{
  "version": 3,
  "sources": ["../../../../node_modules/.pnpm/encoding@0.1.13/node_modules/encoding/lib/encoding.js", "../../../../node_modules/.pnpm/node-fetch@2.6.13_encoding@0.1.13/node_modules/node-fetch/lib/index.js", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/node_modules/tslib/tslib.es6.js", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/backends/backend.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/util_base.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/environment.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/global_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/kernel_names.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/log.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/kernel_registry.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/platforms/is_typed_array_browser.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/node_modules/long/src/long.js", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/hash_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/profiler.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/tape.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/tensor_format.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/tensor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/types.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/tensor_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/engine.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/device_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/flags.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/tensor_util_env.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/operation.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/complex.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/tensor_ops_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/tensor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/io/types.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/io/composite_array_buffer.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/globals.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/io/io_utils.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/io/router_registry.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/io/indexed_db.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/io/local_storage.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/io/model_management.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/platforms/platform_browser.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/platforms/platform_node.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/buffer.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/cast.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/clone.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/print.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/base_side_effects.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/add.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/floorDiv.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/div.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/mul.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/abs.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/acos.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/acosh.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/add_n.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/all.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/any.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/arg_max.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/arg_min.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/asin.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/asinh.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/atan.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/atan2.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/atanh.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/conv_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/reshape.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/avg_pool.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/avg_pool_3d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/concat.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/mat_mul.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/sigmoid.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/slice.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/tanh.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/basic_lstm_cell.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/batch_to_space_nd.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/batchnorm_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/batchnorm.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/batchnorm2d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/batchnorm3d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/batchnorm4d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/bincount.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/bitwise_and.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/broadcast_args.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/broadcast_to.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/ceil.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/fill.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/clip_by_value.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/concat_1d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/concat_2d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/concat_3d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/concat_4d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/conv2d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/conv1d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/conv2d_backprop_input.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/conv2d_transpose.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/conv3d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/conv3d_backprop_input.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/conv3d_transpose.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/cos.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/cosh.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/cumprod.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/cumsum.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/dense_bincount.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/depth_to_space.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/depthwise_conv2d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/diag.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/dilation2d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/broadcast_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/equal.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/where.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/zeros_like.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/div_no_nan.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/dot.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/einsum.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/elu.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/ensure_shape.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/erf.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/axis_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/max.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/min.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/pow.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/scalar.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/sqrt.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/square.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/sum.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/norm.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/euclidean_norm.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/exp.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/expand_dims.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/expm1.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/tile.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/eye.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/floor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/gather.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/greater.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/greater_equal.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/imag.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/is_finite.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/is_inf.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/is_nan.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/leaky_relu.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/less.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/less_equal.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/linspace.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/local_response_normalization.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/log.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/log1p.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/gradients.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/neg.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/softplus.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/log_sigmoid.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/sub.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/log_softmax.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/log_sum_exp.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/logical_and.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/logical_not.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/logical_or.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/logical_xor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/search_sorted.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/lower_bound.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/max_pool.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/max_pool_3d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/max_pool_with_argmax.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/maximum.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/mean.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/zeros.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/ones.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/meshgrid.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/minimum.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/mirror_pad.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/mod.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/moments.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/multi_rnn_cell.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/multinomial.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/not_equal.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/one_hot.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/ones_like.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/outer_product.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/pad.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/pad1d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/pad2d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/pad3d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/pad4d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/space_to_batch_nd.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/pool.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/prelu.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/prod.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/ragged_gather.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/ragged_range.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/ragged_tensor_to_tensor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/rand.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/node_modules/seedrandom/lib/alea.js", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/node_modules/seedrandom/lib/xor128.js", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/node_modules/seedrandom/lib/xorwow.js", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/node_modules/seedrandom/lib/xorshift7.js", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/node_modules/seedrandom/lib/xor4096.js", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/node_modules/seedrandom/lib/tychei.js", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/node_modules/seedrandom/seedrandom.js", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/node_modules/seedrandom/index.js", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/test_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/rand_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/random_gamma.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/random_normal.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/random_standard_normal.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/random_uniform.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/random_uniform_int.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/range.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/real.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/reciprocal.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/relu.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/relu6.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/reverse.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/reverse_1d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/reverse_2d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/reverse_3d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/reverse_4d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/round.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/rsqrt.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/selu.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/separable_conv2d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/setdiff1d_async.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/sign.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/sin.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/sinh.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/slice1d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/slice2d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/slice3d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/slice4d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/softmax.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/spectral/fft.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/spectral/ifft.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/spectral/irfft.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/split.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/spectral/rfft.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/squared_difference.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/squeeze.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/stack.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/step.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/strided_slice.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/tan.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/tensor1d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/tensor2d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/tensor3d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/tensor4d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/tensor5d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/tensor6d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/scatter_nd_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/tensor_scatter_update.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/topk.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/truncated_normal.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/unique.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/unsorted_segment_sum.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/unstack.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/upper_bound.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/variable.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/backends/where_impl.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/where_async.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/boolean_mask.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/transpose.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/moving_average.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/scatter_nd.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/sparse_to_dense_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/sparse_to_dense.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/gather_nd.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/dropout_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/dropout.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/signal_ops_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/in_top_k.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/conv2d_backprop_filter.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/fused_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/fused/conv2d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/depthwise_conv2d_native_backprop_filter.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/depthwise_conv2d_native_backprop_input.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/fused/depthwise_conv2d.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/fused/mat_mul.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/fused_ops.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/signal/hamming_window.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/signal/hann_window.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/signal/frame.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/signal/stft.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/image/crop_and_resize.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/image/flip_left_right.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/image/grayscale_to_rgb.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/image/rgb_to_grayscale.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/image/rotate_with_offset.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/nonmax_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/image/non_max_suppression.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/backends/non_max_suppression_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/backends/non_max_suppression_impl.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/image/non_max_suppression_async.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/image/non_max_suppression_with_score.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/image/non_max_suppression_with_score_async.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/image/non_max_suppression_padded.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/image/non_max_suppression_padded_async.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/image/resize_bilinear.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/image/resize_nearest_neighbor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/image/threshold.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/image/transform.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/linalg/band_part.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/linalg/gram_schmidt.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/linalg/qr.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/loss_ops_utils.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/losses/compute_weighted_loss.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/losses/absolute_difference.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/losses/cosine_distance.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/losses/hinge_loss.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/losses/huber_loss.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/losses/log_loss.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/losses/mean_squared_error.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/losses/sigmoid_cross_entropy.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/losses/softmax_cross_entropy.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/sparse/sparse_fill_empty_rows.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/sparse/sparse_reshape.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/sparse/sparse_segment_mean.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/sparse/sparse_segment_sum.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/string/string_n_grams.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/string/string_split.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/string/string_to_hash_bucket_fast.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/string/static_regex_replace.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/ops.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/serialization.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/optimizers/optimizer.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/optimizers/adadelta_optimizer.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/optimizers/adagrad_optimizer.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/optimizers/adam_optimizer.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/optimizers/adamax_optimizer.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/optimizers/sgd_optimizer.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/optimizers/momentum_optimizer.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/optimizers/rmsprop_optimizer.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/optimizers/register_optimizers.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/io/browser_files.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/io/progress.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/io/weights_loader.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/io/http.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/io/passthrough.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/io/io.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/confusion_matrix.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/math.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/browser.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/gather_nd_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/slice_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/version.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/optimizers/optimizer_constructors.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/train.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/browser_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/concat_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/ragged_to_dense_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/reduce_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/rotate_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/array_ops_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/selu_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/erf_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/backends/complex_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/backends/einsum_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/split_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/sparse/sparse_fill_empty_rows_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/sparse/sparse_reshape_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/sparse/sparse_segment_reduction_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/ops/segment_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/backends/backend_util.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/backends/kernel_impls.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-core@4.22.0_encoding@0.1.13/tfjs-core/src/index.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/flags.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/node_modules/tslib/tslib.es6.js", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/data/compiled_api.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/custom_op/register.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/executors/utils.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/op_list/arithmetic.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/op_list/basic_math.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/op_list/control.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/op_list/convolution.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/op_list/creation.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/op_list/dynamic.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/op_list/evaluation.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/op_list/graph.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/op_list/hash_table.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/op_list/image.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/op_list/logical.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/op_list/matrices.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/op_list/normalization.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/op_list/reduction.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/op_list/slice_join.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/op_list/sparse.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/op_list/spectral.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/op_list/string.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/op_list/transformation.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/operation_mapper.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/custom_op/node_value_impl.ts", "../../../../node_modules/.pnpm/tfjs-core/src/backends/backend.ts", "../../../../node_modules/.pnpm/tfjs-core/src/util_base.ts", "../../../../node_modules/.pnpm/tfjs-core/src/environment.ts", "../../../../node_modules/.pnpm/tfjs-core/src/global_util.ts", "../../../../node_modules/.pnpm/tfjs-core/src/kernel_names.ts", "../../../../node_modules/.pnpm/tfjs-core/src/log.ts", "../../../../node_modules/.pnpm/tfjs-core/src/kernel_registry.ts", "../../../../node_modules/.pnpm/tfjs-core/src/platforms/is_typed_array_browser.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/node_modules/long/src/long.js", "../../../../node_modules/.pnpm/tfjs-core/src/hash_util.ts", "../../../../node_modules/.pnpm/tfjs-core/src/util.ts", "../../../../node_modules/.pnpm/tfjs-core/src/profiler.ts", "../../../../node_modules/.pnpm/tfjs-core/src/tape.ts", "../../../../node_modules/.pnpm/tfjs-core/src/tensor_format.ts", "../../../../node_modules/.pnpm/tfjs-core/src/tensor.ts", "../../../../node_modules/.pnpm/tfjs-core/src/types.ts", "../../../../node_modules/.pnpm/tfjs-core/src/tensor_util.ts", "../../../../node_modules/.pnpm/tfjs-core/src/engine.ts", "../../../../node_modules/.pnpm/tfjs-core/src/tensor_util_env.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/operation.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/abs.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/acos.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/acosh.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/add.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/add_n.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/all.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/any.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/arg_max.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/arg_min.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/asin.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/asinh.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/atan.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/atan2.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/atanh.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/cast.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/conv_util.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/reshape.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/avg_pool.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/avg_pool_3d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/clone.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/concat.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/mat_mul.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/mul.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/sigmoid.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/slice.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/tanh.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/basic_lstm_cell.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/batch_to_space_nd.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/batchnorm_util.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/batchnorm.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/batchnorm2d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/batchnorm3d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/batchnorm4d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/bincount.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/bitwise_and.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/broadcast_args.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/broadcast_to.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/buffer.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/ceil.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/fill.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/clip_by_value.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/complex.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/concat_1d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/concat_2d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/concat_3d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/concat_4d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/conv2d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/conv1d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/conv2d_backprop_input.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/conv2d_transpose.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/conv3d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/conv3d_backprop_input.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/conv3d_transpose.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/cos.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/cosh.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/cumprod.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/cumsum.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/dense_bincount.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/depth_to_space.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/depthwise_conv2d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/diag.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/dilation2d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/floorDiv.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/div.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/broadcast_util.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/equal.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/where.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/zeros_like.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/div_no_nan.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/dot.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/einsum.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/elu.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/ensure_shape.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/erf.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/axis_util.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/max.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/min.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/pow.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/tensor_ops_util.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/scalar.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/sqrt.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/square.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/sum.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/norm.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/euclidean_norm.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/exp.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/expand_dims.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/expm1.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/tile.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/eye.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/floor.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/gather.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/greater.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/greater_equal.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/imag.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/is_finite.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/is_inf.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/is_nan.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/leaky_relu.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/less.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/less_equal.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/linspace.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/local_response_normalization.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/log.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/log1p.ts", "../../../../node_modules/.pnpm/tfjs-core/src/gradients.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/neg.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/softplus.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/log_sigmoid.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/sub.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/log_softmax.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/log_sum_exp.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/logical_and.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/logical_not.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/logical_or.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/logical_xor.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/search_sorted.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/lower_bound.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/max_pool.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/max_pool_3d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/max_pool_with_argmax.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/maximum.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/mean.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/zeros.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/ones.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/meshgrid.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/minimum.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/mirror_pad.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/mod.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/moments.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/multi_rnn_cell.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/multinomial.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/not_equal.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/one_hot.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/ones_like.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/outer_product.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/pad.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/pad1d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/pad2d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/pad3d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/pad4d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/space_to_batch_nd.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/pool.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/prelu.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/print.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/prod.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/ragged_gather.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/ragged_range.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/ragged_tensor_to_tensor.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/rand.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/node_modules/seedrandom/lib/alea.js", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/node_modules/seedrandom/lib/xor128.js", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/node_modules/seedrandom/lib/xorwow.js", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/node_modules/seedrandom/lib/xorshift7.js", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/node_modules/seedrandom/lib/xor4096.js", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/node_modules/seedrandom/lib/tychei.js", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/node_modules/seedrandom/seedrandom.js", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/node_modules/seedrandom/index.js", "../../../../node_modules/.pnpm/tfjs-core/src/ops/rand_util.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/random_gamma.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/random_normal.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/random_standard_normal.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/random_uniform.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/random_uniform_int.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/range.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/real.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/reciprocal.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/relu.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/relu6.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/reverse.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/reverse_1d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/reverse_2d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/reverse_3d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/reverse_4d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/round.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/rsqrt.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/selu.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/separable_conv2d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/setdiff1d_async.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/sign.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/sin.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/sinh.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/slice1d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/slice2d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/slice3d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/slice4d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/softmax.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/spectral/fft.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/spectral/ifft.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/spectral/irfft.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/split.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/spectral/rfft.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/squared_difference.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/squeeze.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/stack.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/step.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/strided_slice.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/tan.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/tensor.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/tensor1d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/tensor2d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/tensor3d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/tensor4d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/tensor5d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/tensor6d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/scatter_nd_util.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/tensor_scatter_update.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/topk.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/truncated_normal.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/unique.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/unsorted_segment_sum.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/unstack.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/upper_bound.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/variable.ts", "../../../../node_modules/.pnpm/tfjs-core/src/backends/where_impl.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/where_async.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/boolean_mask.ts", "../../../../node_modules/.pnpm/tfjs-core/src/globals.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/transpose.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/moving_average.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/scatter_nd.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/sparse_to_dense_util.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/sparse_to_dense.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/gather_nd.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/dropout_util.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/dropout.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/signal_ops_util.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/in_top_k.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/conv2d_backprop_filter.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/fused_util.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/fused/conv2d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/depthwise_conv2d_native_backprop_filter.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/depthwise_conv2d_native_backprop_input.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/fused/depthwise_conv2d.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/fused/mat_mul.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/fused_ops.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/signal/hamming_window.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/signal/hann_window.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/signal/frame.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/signal/stft.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/image/crop_and_resize.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/image/flip_left_right.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/image/grayscale_to_rgb.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/image/rgb_to_grayscale.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/image/rotate_with_offset.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/nonmax_util.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/image/non_max_suppression.ts", "../../../../node_modules/.pnpm/tfjs-core/src/backends/non_max_suppression_util.ts", "../../../../node_modules/.pnpm/tfjs-core/src/backends/non_max_suppression_impl.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/image/non_max_suppression_async.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/image/non_max_suppression_with_score.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/image/non_max_suppression_with_score_async.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/image/non_max_suppression_padded.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/image/non_max_suppression_padded_async.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/image/resize_bilinear.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/image/resize_nearest_neighbor.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/image/threshold.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/image/transform.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/linalg/band_part.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/linalg/gram_schmidt.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/linalg/qr.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/loss_ops_utils.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/losses/compute_weighted_loss.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/losses/absolute_difference.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/losses/cosine_distance.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/losses/hinge_loss.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/losses/huber_loss.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/losses/log_loss.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/losses/mean_squared_error.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/losses/sigmoid_cross_entropy.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/losses/softmax_cross_entropy.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/sparse/sparse_fill_empty_rows.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/sparse/sparse_reshape.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/sparse/sparse_segment_mean.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/sparse/sparse_segment_sum.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/string/string_n_grams.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/string/string_split.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/string/string_to_hash_bucket_fast.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/string/static_regex_replace.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/ops.ts", "../../../../node_modules/.pnpm/tfjs-core/src/ops/ops_for_converter.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/executors/arithmetic_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/executors/basic_math_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/executor/tensor_utils.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/executor/tensor_array.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/executor/tensor_list.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/executors/control_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/executors/convolution_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/executors/creation_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/executors/dynamic_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/executors/evaluation_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/executors/graph_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/executor/hash_table.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/executors/hash_table_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/executors/image_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/executors/logical_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/executors/matrices_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/executors/normalization_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/executors/ragged_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/executors/reduction_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/executors/slice_join_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/executors/sparse_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/executors/spectral_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/executors/string_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/executors/transformation_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/operations/operation_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/executor/execution_context.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/executor/model_analysis.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/executor/graph_executor.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/executor/resource_manager.ts", "../../../../node_modules/.pnpm/tfjs-core/src/io/types.ts", "../../../../node_modules/.pnpm/tfjs-core/src/io/io_utils.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/executor/graph_model.ts", "../../../../node_modules/.pnpm/@tensorflow+tfjs-converter@4.22.0_@tensorflow+tfjs-core@4.22.0_encoding@0.1.13_/tfjs-converter/src/version.ts", "../../../../serving/lib/search.ts", "../../../../serving/lib/tfjs-embedder.ts", "../../../../node_modules/.pnpm/@huggingface+transformers@3.8.1/node_modules/@huggingface/transformers/src/utils/generic.js", "../../../../node_modules/.pnpm/@huggingface+transformers@3.8.1/node_modules/@huggingface/transformers/src/utils/core.js", "../../../../node_modules/.pnpm/@huggingface+transformers@3.8.1/node_modules/@huggingface/transformers/src/utils/hub.js", "../../../../node_modules/.pnpm/@huggingface+transformers@3.8.1/node_modules/@huggingface/transformers/src/env.js", "../../../../node_modules/.pnpm/@huggingface+transformers@3.8.1/node_modules/@huggingface/transformers/src/utils/maths.js", "../../../../serving/lib/dummy-onnx.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-common/lib/index.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-common/lib/backend-impl.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-common/lib/version.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-common/lib/env-impl.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-common/lib/env.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-common/lib/tensor-conversion-impl.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-common/lib/tensor-factory-impl.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-common/lib/tensor-impl-type-mapping.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-common/lib/tensor-utils-impl.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-common/lib/tensor-impl.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-common/lib/tensor.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-common/lib/trace.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-common/lib/inference-session-impl.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-common/lib/inference-session.ts", "../../../../node_modules/.pnpm/onnxruntime-web@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-web/lib/wasm/wasm-utils-env.ts", "../../../../node_modules/.pnpm/onnxruntime-web@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-web/lib/wasm/wasm-utils-import.ts", "../../../../node_modules/.pnpm/onnxruntime-web@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-web/lib/wasm/wasm-factory.ts", "../../../../node_modules/.pnpm/onnxruntime-web@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-web/lib/wasm/wasm-utils.ts", "../../../../node_modules/.pnpm/onnxruntime-web@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-web/lib/wasm/run-options.ts", "../../../../node_modules/.pnpm/onnxruntime-web@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-web/lib/wasm/session-options.ts", "../../../../node_modules/.pnpm/onnxruntime-web@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-web/lib/wasm/wasm-common.ts", "../../../../node_modules/.pnpm/onnxruntime-web@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-web/lib/wasm/wasm-utils-load-file.ts", "../../../../node_modules/.pnpm/onnxruntime-web@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-web/lib/wasm/wasm-core-impl.ts", "../../../../node_modules/.pnpm/onnxruntime-web@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-web/lib/wasm/proxy-wrapper.ts", "../../../../node_modules/.pnpm/onnxruntime-web@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-web/lib/wasm/session-handler-inference.ts", "../../../../node_modules/.pnpm/onnxruntime-web@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-web/lib/backend-wasm.ts", "../../../../node_modules/.pnpm/onnxruntime-web@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-web/lib/index.ts", "../../../../node_modules/.pnpm/onnxruntime-web@1.22.0-dev.20250409-89f8206ba4/node_modules/onnxruntime-web/lib/version.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.25.1/node_modules/onnxruntime-common/lib/version.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.25.1/node_modules/onnxruntime-common/lib/env-impl.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.25.1/node_modules/onnxruntime-common/lib/tensor-conversion-impl.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.25.1/node_modules/onnxruntime-common/lib/tensor-factory-impl.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.25.1/node_modules/onnxruntime-common/lib/tensor-impl-type-mapping.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.25.1/node_modules/onnxruntime-common/lib/tensor-utils-impl.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.25.1/node_modules/onnxruntime-common/lib/tensor-impl.ts", "../../../../node_modules/.pnpm/onnxruntime-common@1.25.1/node_modules/onnxruntime-common/lib/tensor.ts", "../../../../node_modules/.pnpm/@huggingface+transformers@3.8.1/node_modules/@huggingface/transformers/src/backends/onnx.js", "../../../../node_modules/.pnpm/@huggingface+transformers@3.8.1/node_modules/@huggingface/transformers/src/utils/tensor.js", "../../../../node_modules/.pnpm/@huggingface+transformers@3.8.1/node_modules/@huggingface/transformers/src/utils/data-structures.js", "../../../../node_modules/.pnpm/@huggingface+jinja@0.5.5/node_modules/@huggingface/jinja/dist/index.js", "../../../../node_modules/.pnpm/@huggingface+transformers@3.8.1/node_modules/@huggingface/transformers/src/models/whisper/common_whisper.js", "../../../../node_modules/.pnpm/@huggingface+transformers@3.8.1/node_modules/@huggingface/transformers/src/tokenizers.js", "../../../../serving/lib/tfjs-kernels-precise.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/base.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/backend_cpu.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/cpu_util.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Add.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/utils/binary_impl.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/utils/binary_utils.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Cast.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/utils/zeros_impl.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Complex.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Identity.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Real.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/utils/unary_impl.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/utils/unary_utils.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Concat_impl.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Exp.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/GatherV2_impl.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Max_impl.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Maximum.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Minimum.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Multiply.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Prod.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Transpose.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Transpose_impl.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Range_impl.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Rsqrt.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Slice.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/SquaredDifference.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/StridedSlice_impl.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Sub.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Tile_impl.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/GatherV2.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Reshape.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/ExpandDims.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/StridedSlice.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Pack.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Concat.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Imag.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Range.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Mean.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/RealDiv.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Sum.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/BatchMatMul.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Softmax.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Max.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Erf.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Tile.ts", "../../../../node_modules/.pnpm/tfjs-backend-cpu/src/kernels/Square.ts", "../../../../serving/lib/logger.ts", "../../../../constants.ts"],
  "sourcesContent": ["'use strict';\n\nvar iconvLite = require('iconv-lite');\n\n// Expose to the world\nmodule.exports.convert = convert;\n\n/**\n * Convert encoding of an UTF-8 string or a buffer\n *\n * @param {String|Buffer} str String to be converted\n * @param {String} to Encoding to be converted to\n * @param {String} [from='UTF-8'] Encoding to be converted from\n * @return {Buffer} Encoded string\n */\nfunction convert(str, to, from) {\n    from = checkEncoding(from || 'UTF-8');\n    to = checkEncoding(to || 'UTF-8');\n    str = str || '';\n\n    var result;\n\n    if (from !== 'UTF-8' && typeof str === 'string') {\n        str = Buffer.from(str, 'binary');\n    }\n\n    if (from === to) {\n        if (typeof str === 'string') {\n            result = Buffer.from(str);\n        } else {\n            result = str;\n        }\n    } else {\n        try {\n            result = convertIconvLite(str, to, from);\n        } catch (E) {\n            console.error(E);\n            result = str;\n        }\n    }\n\n    if (typeof result === 'string') {\n        result = Buffer.from(result, 'utf-8');\n    }\n\n    return result;\n}\n\n/**\n * Convert encoding of astring with iconv-lite\n *\n * @param {String|Buffer} str String to be converted\n * @param {String} to Encoding to be converted to\n * @param {String} [from='UTF-8'] Encoding to be converted from\n * @return {Buffer} Encoded string\n */\nfunction convertIconvLite(str, to, from) {\n    if (to === 'UTF-8') {\n        return iconvLite.decode(str, from);\n    } else if (from === 'UTF-8') {\n        return iconvLite.encode(str, to);\n    } else {\n        return iconvLite.encode(iconvLite.decode(str, from), to);\n    }\n}\n\n/**\n * Converts charset name if needed\n *\n * @param {String} name Character set\n * @return {String} Character set name\n */\nfunction checkEncoding(name) {\n    return (name || '')\n        .toString()\n        .trim()\n        .replace(/^latin[\\-_]?(\\d+)$/i, 'ISO-8859-$1')\n        .replace(/^win(?:dows)?[\\-_]?(\\d+)$/i, 'WINDOWS-$1')\n        .replace(/^utf[\\-_]?(\\d+)$/i, 'UTF-$1')\n        .replace(/^ks_c_5601\\-1987$/i, 'CP949')\n        .replace(/^us[\\-_]?ascii$/i, 'ASCII')\n        .toUpperCase();\n}\n", "'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nfunction _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; }\n\nvar Stream = _interopDefault(require('stream'));\nvar http = _interopDefault(require('http'));\nvar Url = _interopDefault(require('url'));\nvar whatwgUrl = _interopDefault(require('whatwg-url'));\nvar https = _interopDefault(require('https'));\nvar zlib = _interopDefault(require('zlib'));\n\n// Based on https://github.com/tmpvar/jsdom/blob/aa85b2abf07766ff7bf5c1f6daafb3726f2f2db5/lib/jsdom/living/blob.js\n\n// fix for \"Readable\" isn't a named export issue\nconst Readable = Stream.Readable;\n\nconst BUFFER = Symbol('buffer');\nconst TYPE = Symbol('type');\n\nclass Blob {\n\tconstructor() {\n\t\tthis[TYPE] = '';\n\n\t\tconst blobParts = arguments[0];\n\t\tconst options = arguments[1];\n\n\t\tconst buffers = [];\n\t\tlet size = 0;\n\n\t\tif (blobParts) {\n\t\t\tconst a = blobParts;\n\t\t\tconst length = Number(a.length);\n\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\tconst element = a[i];\n\t\t\t\tlet buffer;\n\t\t\t\tif (element instanceof Buffer) {\n\t\t\t\t\tbuffer = element;\n\t\t\t\t} else if (ArrayBuffer.isView(element)) {\n\t\t\t\t\tbuffer = Buffer.from(element.buffer, element.byteOffset, element.byteLength);\n\t\t\t\t} else if (element instanceof ArrayBuffer) {\n\t\t\t\t\tbuffer = Buffer.from(element);\n\t\t\t\t} else if (element instanceof Blob) {\n\t\t\t\t\tbuffer = element[BUFFER];\n\t\t\t\t} else {\n\t\t\t\t\tbuffer = Buffer.from(typeof element === 'string' ? element : String(element));\n\t\t\t\t}\n\t\t\t\tsize += buffer.length;\n\t\t\t\tbuffers.push(buffer);\n\t\t\t}\n\t\t}\n\n\t\tthis[BUFFER] = Buffer.concat(buffers);\n\n\t\tlet type = options && options.type !== undefined && String(options.type).toLowerCase();\n\t\tif (type && !/[^\\u0020-\\u007E]/.test(type)) {\n\t\t\tthis[TYPE] = type;\n\t\t}\n\t}\n\tget size() {\n\t\treturn this[BUFFER].length;\n\t}\n\tget type() {\n\t\treturn this[TYPE];\n\t}\n\ttext() {\n\t\treturn Promise.resolve(this[BUFFER].toString());\n\t}\n\tarrayBuffer() {\n\t\tconst buf = this[BUFFER];\n\t\tconst ab = buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\treturn Promise.resolve(ab);\n\t}\n\tstream() {\n\t\tconst readable = new Readable();\n\t\treadable._read = function () {};\n\t\treadable.push(this[BUFFER]);\n\t\treadable.push(null);\n\t\treturn readable;\n\t}\n\ttoString() {\n\t\treturn '[object Blob]';\n\t}\n\tslice() {\n\t\tconst size = this.size;\n\n\t\tconst start = arguments[0];\n\t\tconst end = arguments[1];\n\t\tlet relativeStart, relativeEnd;\n\t\tif (start === undefined) {\n\t\t\trelativeStart = 0;\n\t\t} else if (start < 0) {\n\t\t\trelativeStart = Math.max(size + start, 0);\n\t\t} else {\n\t\t\trelativeStart = Math.min(start, size);\n\t\t}\n\t\tif (end === undefined) {\n\t\t\trelativeEnd = size;\n\t\t} else if (end < 0) {\n\t\t\trelativeEnd = Math.max(size + end, 0);\n\t\t} else {\n\t\t\trelativeEnd = Math.min(end, size);\n\t\t}\n\t\tconst span = Math.max(relativeEnd - relativeStart, 0);\n\n\t\tconst buffer = this[BUFFER];\n\t\tconst slicedBuffer = buffer.slice(relativeStart, relativeStart + span);\n\t\tconst blob = new Blob([], { type: arguments[2] });\n\t\tblob[BUFFER] = slicedBuffer;\n\t\treturn blob;\n\t}\n}\n\nObject.defineProperties(Blob.prototype, {\n\tsize: { enumerable: true },\n\ttype: { enumerable: true },\n\tslice: { enumerable: true }\n});\n\nObject.defineProperty(Blob.prototype, Symbol.toStringTag, {\n\tvalue: 'Blob',\n\twritable: false,\n\tenumerable: false,\n\tconfigurable: true\n});\n\n/**\n * fetch-error.js\n *\n * FetchError interface for operational errors\n */\n\n/**\n * Create FetchError instance\n *\n * @param   String      message      Error message for human\n * @param   String      type         Error type for machine\n * @param   String      systemError  For Node.js system error\n * @return  FetchError\n */\nfunction FetchError(message, type, systemError) {\n  Error.call(this, message);\n\n  this.message = message;\n  this.type = type;\n\n  // when err.type is `system`, err.code contains system error code\n  if (systemError) {\n    this.code = this.errno = systemError.code;\n  }\n\n  // hide custom error implementation details from end-users\n  Error.captureStackTrace(this, this.constructor);\n}\n\nFetchError.prototype = Object.create(Error.prototype);\nFetchError.prototype.constructor = FetchError;\nFetchError.prototype.name = 'FetchError';\n\nlet convert;\ntry {\n\tconvert = require('encoding').convert;\n} catch (e) {}\n\nconst INTERNALS = Symbol('Body internals');\n\n// fix an issue where \"PassThrough\" isn't a named export for node <10\nconst PassThrough = Stream.PassThrough;\n\n/**\n * Body mixin\n *\n * Ref: https://fetch.spec.whatwg.org/#body\n *\n * @param   Stream  body  Readable stream\n * @param   Object  opts  Response options\n * @return  Void\n */\nfunction Body(body) {\n\tvar _this = this;\n\n\tvar _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},\n\t    _ref$size = _ref.size;\n\n\tlet size = _ref$size === undefined ? 0 : _ref$size;\n\tvar _ref$timeout = _ref.timeout;\n\tlet timeout = _ref$timeout === undefined ? 0 : _ref$timeout;\n\n\tif (body == null) {\n\t\t// body is undefined or null\n\t\tbody = null;\n\t} else if (isURLSearchParams(body)) {\n\t\t// body is a URLSearchParams\n\t\tbody = Buffer.from(body.toString());\n\t} else if (isBlob(body)) ; else if (Buffer.isBuffer(body)) ; else if (Object.prototype.toString.call(body) === '[object ArrayBuffer]') {\n\t\t// body is ArrayBuffer\n\t\tbody = Buffer.from(body);\n\t} else if (ArrayBuffer.isView(body)) {\n\t\t// body is ArrayBufferView\n\t\tbody = Buffer.from(body.buffer, body.byteOffset, body.byteLength);\n\t} else if (body instanceof Stream) ; else {\n\t\t// none of the above\n\t\t// coerce to string then buffer\n\t\tbody = Buffer.from(String(body));\n\t}\n\tthis[INTERNALS] = {\n\t\tbody,\n\t\tdisturbed: false,\n\t\terror: null\n\t};\n\tthis.size = size;\n\tthis.timeout = timeout;\n\n\tif (body instanceof Stream) {\n\t\tbody.on('error', function (err) {\n\t\t\tconst error = err.name === 'AbortError' ? err : new FetchError(`Invalid response body while trying to fetch ${_this.url}: ${err.message}`, 'system', err);\n\t\t\t_this[INTERNALS].error = error;\n\t\t});\n\t}\n}\n\nBody.prototype = {\n\tget body() {\n\t\treturn this[INTERNALS].body;\n\t},\n\n\tget bodyUsed() {\n\t\treturn this[INTERNALS].disturbed;\n\t},\n\n\t/**\n  * Decode response as ArrayBuffer\n  *\n  * @return  Promise\n  */\n\tarrayBuffer() {\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n\t\t});\n\t},\n\n\t/**\n  * Return raw response as Blob\n  *\n  * @return Promise\n  */\n\tblob() {\n\t\tlet ct = this.headers && this.headers.get('content-type') || '';\n\t\treturn consumeBody.call(this).then(function (buf) {\n\t\t\treturn Object.assign(\n\t\t\t// Prevent copying\n\t\t\tnew Blob([], {\n\t\t\t\ttype: ct.toLowerCase()\n\t\t\t}), {\n\t\t\t\t[BUFFER]: buf\n\t\t\t});\n\t\t});\n\t},\n\n\t/**\n  * Decode response as json\n  *\n  * @return  Promise\n  */\n\tjson() {\n\t\tvar _this2 = this;\n\n\t\treturn consumeBody.call(this).then(function (buffer) {\n\t\t\ttry {\n\t\t\t\treturn JSON.parse(buffer.toString());\n\t\t\t} catch (err) {\n\t\t\t\treturn Body.Promise.reject(new FetchError(`invalid json response body at ${_this2.url} reason: ${err.message}`, 'invalid-json'));\n\t\t\t}\n\t\t});\n\t},\n\n\t/**\n  * Decode response as text\n  *\n  * @return  Promise\n  */\n\ttext() {\n\t\treturn consumeBody.call(this).then(function (buffer) {\n\t\t\treturn buffer.toString();\n\t\t});\n\t},\n\n\t/**\n  * Decode response as buffer (non-spec api)\n  *\n  * @return  Promise\n  */\n\tbuffer() {\n\t\treturn consumeBody.call(this);\n\t},\n\n\t/**\n  * Decode response as text, while automatically detecting the encoding and\n  * trying to decode to UTF-8 (non-spec api)\n  *\n  * @return  Promise\n  */\n\ttextConverted() {\n\t\tvar _this3 = this;\n\n\t\treturn consumeBody.call(this).then(function (buffer) {\n\t\t\treturn convertBody(buffer, _this3.headers);\n\t\t});\n\t}\n};\n\n// In browsers, all properties are enumerable.\nObject.defineProperties(Body.prototype, {\n\tbody: { enumerable: true },\n\tbodyUsed: { enumerable: true },\n\tarrayBuffer: { enumerable: true },\n\tblob: { enumerable: true },\n\tjson: { enumerable: true },\n\ttext: { enumerable: true }\n});\n\nBody.mixIn = function (proto) {\n\tfor (const name of Object.getOwnPropertyNames(Body.prototype)) {\n\t\t// istanbul ignore else: future proof\n\t\tif (!(name in proto)) {\n\t\t\tconst desc = Object.getOwnPropertyDescriptor(Body.prototype, name);\n\t\t\tObject.defineProperty(proto, name, desc);\n\t\t}\n\t}\n};\n\n/**\n * Consume and convert an entire Body to a Buffer.\n *\n * Ref: https://fetch.spec.whatwg.org/#concept-body-consume-body\n *\n * @return  Promise\n */\nfunction consumeBody() {\n\tvar _this4 = this;\n\n\tif (this[INTERNALS].disturbed) {\n\t\treturn Body.Promise.reject(new TypeError(`body used already for: ${this.url}`));\n\t}\n\n\tthis[INTERNALS].disturbed = true;\n\n\tif (this[INTERNALS].error) {\n\t\treturn Body.Promise.reject(this[INTERNALS].error);\n\t}\n\n\tlet body = this.body;\n\n\t// body is null\n\tif (body === null) {\n\t\treturn Body.Promise.resolve(Buffer.alloc(0));\n\t}\n\n\t// body is blob\n\tif (isBlob(body)) {\n\t\tbody = body.stream();\n\t}\n\n\t// body is buffer\n\tif (Buffer.isBuffer(body)) {\n\t\treturn Body.Promise.resolve(body);\n\t}\n\n\t// istanbul ignore if: should never happen\n\tif (!(body instanceof Stream)) {\n\t\treturn Body.Promise.resolve(Buffer.alloc(0));\n\t}\n\n\t// body is stream\n\t// get ready to actually consume the body\n\tlet accum = [];\n\tlet accumBytes = 0;\n\tlet abort = false;\n\n\treturn new Body.Promise(function (resolve, reject) {\n\t\tlet resTimeout;\n\n\t\t// allow timeout on slow response body\n\t\tif (_this4.timeout) {\n\t\t\tresTimeout = setTimeout(function () {\n\t\t\t\tabort = true;\n\t\t\t\treject(new FetchError(`Response timeout while trying to fetch ${_this4.url} (over ${_this4.timeout}ms)`, 'body-timeout'));\n\t\t\t}, _this4.timeout);\n\t\t}\n\n\t\t// handle stream errors\n\t\tbody.on('error', function (err) {\n\t\t\tif (err.name === 'AbortError') {\n\t\t\t\t// if the request was aborted, reject with this Error\n\t\t\t\tabort = true;\n\t\t\t\treject(err);\n\t\t\t} else {\n\t\t\t\t// other errors, such as incorrect content-encoding\n\t\t\t\treject(new FetchError(`Invalid response body while trying to fetch ${_this4.url}: ${err.message}`, 'system', err));\n\t\t\t}\n\t\t});\n\n\t\tbody.on('data', function (chunk) {\n\t\t\tif (abort || chunk === null) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif (_this4.size && accumBytes + chunk.length > _this4.size) {\n\t\t\t\tabort = true;\n\t\t\t\treject(new FetchError(`content size at ${_this4.url} over limit: ${_this4.size}`, 'max-size'));\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\taccumBytes += chunk.length;\n\t\t\taccum.push(chunk);\n\t\t});\n\n\t\tbody.on('end', function () {\n\t\t\tif (abort) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tclearTimeout(resTimeout);\n\n\t\t\ttry {\n\t\t\t\tresolve(Buffer.concat(accum, accumBytes));\n\t\t\t} catch (err) {\n\t\t\t\t// handle streams that have accumulated too much data (issue #414)\n\t\t\t\treject(new FetchError(`Could not create Buffer from response body for ${_this4.url}: ${err.message}`, 'system', err));\n\t\t\t}\n\t\t});\n\t});\n}\n\n/**\n * Detect buffer encoding and convert to target encoding\n * ref: http://www.w3.org/TR/2011/WD-html5-20110113/parsing.html#determining-the-character-encoding\n *\n * @param   Buffer  buffer    Incoming buffer\n * @param   String  encoding  Target encoding\n * @return  String\n */\nfunction convertBody(buffer, headers) {\n\tif (typeof convert !== 'function') {\n\t\tthrow new Error('The package `encoding` must be installed to use the textConverted() function');\n\t}\n\n\tconst ct = headers.get('content-type');\n\tlet charset = 'utf-8';\n\tlet res, str;\n\n\t// header\n\tif (ct) {\n\t\tres = /charset=([^;]*)/i.exec(ct);\n\t}\n\n\t// no charset in content type, peek at response body for at most 1024 bytes\n\tstr = buffer.slice(0, 1024).toString();\n\n\t// html5\n\tif (!res && str) {\n\t\tres = /<meta.+?charset=(['\"])(.+?)\\1/i.exec(str);\n\t}\n\n\t// html4\n\tif (!res && str) {\n\t\tres = /<meta[\\s]+?http-equiv=(['\"])content-type\\1[\\s]+?content=(['\"])(.+?)\\2/i.exec(str);\n\t\tif (!res) {\n\t\t\tres = /<meta[\\s]+?content=(['\"])(.+?)\\1[\\s]+?http-equiv=(['\"])content-type\\3/i.exec(str);\n\t\t\tif (res) {\n\t\t\t\tres.pop(); // drop last quote\n\t\t\t}\n\t\t}\n\n\t\tif (res) {\n\t\t\tres = /charset=(.*)/i.exec(res.pop());\n\t\t}\n\t}\n\n\t// xml\n\tif (!res && str) {\n\t\tres = /<\\?xml.+?encoding=(['\"])(.+?)\\1/i.exec(str);\n\t}\n\n\t// found charset\n\tif (res) {\n\t\tcharset = res.pop();\n\n\t\t// prevent decode issues when sites use incorrect encoding\n\t\t// ref: https://hsivonen.fi/encoding-menu/\n\t\tif (charset === 'gb2312' || charset === 'gbk') {\n\t\t\tcharset = 'gb18030';\n\t\t}\n\t}\n\n\t// turn raw buffers into a single utf-8 buffer\n\treturn convert(buffer, 'UTF-8', charset).toString();\n}\n\n/**\n * Detect a URLSearchParams object\n * ref: https://github.com/bitinn/node-fetch/issues/296#issuecomment-307598143\n *\n * @param   Object  obj     Object to detect by type or brand\n * @return  String\n */\nfunction isURLSearchParams(obj) {\n\t// Duck-typing as a necessary condition.\n\tif (typeof obj !== 'object' || typeof obj.append !== 'function' || typeof obj.delete !== 'function' || typeof obj.get !== 'function' || typeof obj.getAll !== 'function' || typeof obj.has !== 'function' || typeof obj.set !== 'function') {\n\t\treturn false;\n\t}\n\n\t// Brand-checking and more duck-typing as optional condition.\n\treturn obj.constructor.name === 'URLSearchParams' || Object.prototype.toString.call(obj) === '[object URLSearchParams]' || typeof obj.sort === 'function';\n}\n\n/**\n * Check if `obj` is a W3C `Blob` object (which `File` inherits from)\n * @param  {*} obj\n * @return {boolean}\n */\nfunction isBlob(obj) {\n\treturn typeof obj === 'object' && typeof obj.arrayBuffer === 'function' && typeof obj.type === 'string' && typeof obj.stream === 'function' && typeof obj.constructor === 'function' && typeof obj.constructor.name === 'string' && /^(Blob|File)$/.test(obj.constructor.name) && /^(Blob|File)$/.test(obj[Symbol.toStringTag]);\n}\n\n/**\n * Clone body given Res/Req instance\n *\n * @param   Mixed  instance  Response or Request instance\n * @return  Mixed\n */\nfunction clone(instance) {\n\tlet p1, p2;\n\tlet body = instance.body;\n\n\t// don't allow cloning a used body\n\tif (instance.bodyUsed) {\n\t\tthrow new Error('cannot clone body after it is used');\n\t}\n\n\t// check that body is a stream and not form-data object\n\t// note: we can't clone the form-data object without having it as a dependency\n\tif (body instanceof Stream && typeof body.getBoundary !== 'function') {\n\t\t// tee instance body\n\t\tp1 = new PassThrough();\n\t\tp2 = new PassThrough();\n\t\tbody.pipe(p1);\n\t\tbody.pipe(p2);\n\t\t// set instance body to teed body and return the other teed body\n\t\tinstance[INTERNALS].body = p1;\n\t\tbody = p2;\n\t}\n\n\treturn body;\n}\n\n/**\n * Performs the operation \"extract a `Content-Type` value from |object|\" as\n * specified in the specification:\n * https://fetch.spec.whatwg.org/#concept-bodyinit-extract\n *\n * This function assumes that instance.body is present.\n *\n * @param   Mixed  instance  Any options.body input\n */\nfunction extractContentType(body) {\n\tif (body === null) {\n\t\t// body is null\n\t\treturn null;\n\t} else if (typeof body === 'string') {\n\t\t// body is string\n\t\treturn 'text/plain;charset=UTF-8';\n\t} else if (isURLSearchParams(body)) {\n\t\t// body is a URLSearchParams\n\t\treturn 'application/x-www-form-urlencoded;charset=UTF-8';\n\t} else if (isBlob(body)) {\n\t\t// body is blob\n\t\treturn body.type || null;\n\t} else if (Buffer.isBuffer(body)) {\n\t\t// body is buffer\n\t\treturn null;\n\t} else if (Object.prototype.toString.call(body) === '[object ArrayBuffer]') {\n\t\t// body is ArrayBuffer\n\t\treturn null;\n\t} else if (ArrayBuffer.isView(body)) {\n\t\t// body is ArrayBufferView\n\t\treturn null;\n\t} else if (typeof body.getBoundary === 'function') {\n\t\t// detect form data input from form-data module\n\t\treturn `multipart/form-data;boundary=${body.getBoundary()}`;\n\t} else if (body instanceof Stream) {\n\t\t// body is stream\n\t\t// can't really do much about this\n\t\treturn null;\n\t} else {\n\t\t// Body constructor defaults other things to string\n\t\treturn 'text/plain;charset=UTF-8';\n\t}\n}\n\n/**\n * The Fetch Standard treats this as if \"total bytes\" is a property on the body.\n * For us, we have to explicitly get it with a function.\n *\n * ref: https://fetch.spec.whatwg.org/#concept-body-total-bytes\n *\n * @param   Body    instance   Instance of Body\n * @return  Number?            Number of bytes, or null if not possible\n */\nfunction getTotalBytes(instance) {\n\tconst body = instance.body;\n\n\n\tif (body === null) {\n\t\t// body is null\n\t\treturn 0;\n\t} else if (isBlob(body)) {\n\t\treturn body.size;\n\t} else if (Buffer.isBuffer(body)) {\n\t\t// body is buffer\n\t\treturn body.length;\n\t} else if (body && typeof body.getLengthSync === 'function') {\n\t\t// detect form data input from form-data module\n\t\tif (body._lengthRetrievers && body._lengthRetrievers.length == 0 || // 1.x\n\t\tbody.hasKnownLength && body.hasKnownLength()) {\n\t\t\t// 2.x\n\t\t\treturn body.getLengthSync();\n\t\t}\n\t\treturn null;\n\t} else {\n\t\t// body is stream\n\t\treturn null;\n\t}\n}\n\n/**\n * Write a Body to a Node.js WritableStream (e.g. http.Request) object.\n *\n * @param   Body    instance   Instance of Body\n * @return  Void\n */\nfunction writeToStream(dest, instance) {\n\tconst body = instance.body;\n\n\n\tif (body === null) {\n\t\t// body is null\n\t\tdest.end();\n\t} else if (isBlob(body)) {\n\t\tbody.stream().pipe(dest);\n\t} else if (Buffer.isBuffer(body)) {\n\t\t// body is buffer\n\t\tdest.write(body);\n\t\tdest.end();\n\t} else {\n\t\t// body is stream\n\t\tbody.pipe(dest);\n\t}\n}\n\n// expose Promise\nBody.Promise = global.Promise;\n\n/**\n * headers.js\n *\n * Headers class offers convenient helpers\n */\n\nconst invalidTokenRegex = /[^\\^_`a-zA-Z\\-0-9!#$%&'*+.|~]/;\nconst invalidHeaderCharRegex = /[^\\t\\x20-\\x7e\\x80-\\xff]/;\n\nfunction validateName(name) {\n\tname = `${name}`;\n\tif (invalidTokenRegex.test(name) || name === '') {\n\t\tthrow new TypeError(`${name} is not a legal HTTP header name`);\n\t}\n}\n\nfunction validateValue(value) {\n\tvalue = `${value}`;\n\tif (invalidHeaderCharRegex.test(value)) {\n\t\tthrow new TypeError(`${value} is not a legal HTTP header value`);\n\t}\n}\n\n/**\n * Find the key in the map object given a header name.\n *\n * Returns undefined if not found.\n *\n * @param   String  name  Header name\n * @return  String|Undefined\n */\nfunction find(map, name) {\n\tname = name.toLowerCase();\n\tfor (const key in map) {\n\t\tif (key.toLowerCase() === name) {\n\t\t\treturn key;\n\t\t}\n\t}\n\treturn undefined;\n}\n\nconst MAP = Symbol('map');\nclass Headers {\n\t/**\n  * Headers class\n  *\n  * @param   Object  headers  Response headers\n  * @return  Void\n  */\n\tconstructor() {\n\t\tlet init = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : undefined;\n\n\t\tthis[MAP] = Object.create(null);\n\n\t\tif (init instanceof Headers) {\n\t\t\tconst rawHeaders = init.raw();\n\t\t\tconst headerNames = Object.keys(rawHeaders);\n\n\t\t\tfor (const headerName of headerNames) {\n\t\t\t\tfor (const value of rawHeaders[headerName]) {\n\t\t\t\t\tthis.append(headerName, value);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn;\n\t\t}\n\n\t\t// We don't worry about converting prop to ByteString here as append()\n\t\t// will handle it.\n\t\tif (init == null) ; else if (typeof init === 'object') {\n\t\t\tconst method = init[Symbol.iterator];\n\t\t\tif (method != null) {\n\t\t\t\tif (typeof method !== 'function') {\n\t\t\t\t\tthrow new TypeError('Header pairs must be iterable');\n\t\t\t\t}\n\n\t\t\t\t// sequence<sequence<ByteString>>\n\t\t\t\t// Note: per spec we have to first exhaust the lists then process them\n\t\t\t\tconst pairs = [];\n\t\t\t\tfor (const pair of init) {\n\t\t\t\t\tif (typeof pair !== 'object' || typeof pair[Symbol.iterator] !== 'function') {\n\t\t\t\t\t\tthrow new TypeError('Each header pair must be iterable');\n\t\t\t\t\t}\n\t\t\t\t\tpairs.push(Array.from(pair));\n\t\t\t\t}\n\n\t\t\t\tfor (const pair of pairs) {\n\t\t\t\t\tif (pair.length !== 2) {\n\t\t\t\t\t\tthrow new TypeError('Each header pair must be a name/value tuple');\n\t\t\t\t\t}\n\t\t\t\t\tthis.append(pair[0], pair[1]);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// record<ByteString, ByteString>\n\t\t\t\tfor (const key of Object.keys(init)) {\n\t\t\t\t\tconst value = init[key];\n\t\t\t\t\tthis.append(key, value);\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tthrow new TypeError('Provided initializer must be an object');\n\t\t}\n\t}\n\n\t/**\n  * Return combined header value given name\n  *\n  * @param   String  name  Header name\n  * @return  Mixed\n  */\n\tget(name) {\n\t\tname = `${name}`;\n\t\tvalidateName(name);\n\t\tconst key = find(this[MAP], name);\n\t\tif (key === undefined) {\n\t\t\treturn null;\n\t\t}\n\n\t\treturn this[MAP][key].join(', ');\n\t}\n\n\t/**\n  * Iterate over all headers\n  *\n  * @param   Function  callback  Executed for each item with parameters (value, name, thisArg)\n  * @param   Boolean   thisArg   `this` context for callback function\n  * @return  Void\n  */\n\tforEach(callback) {\n\t\tlet thisArg = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : undefined;\n\n\t\tlet pairs = getHeaders(this);\n\t\tlet i = 0;\n\t\twhile (i < pairs.length) {\n\t\t\tvar _pairs$i = pairs[i];\n\t\t\tconst name = _pairs$i[0],\n\t\t\t      value = _pairs$i[1];\n\n\t\t\tcallback.call(thisArg, value, name, this);\n\t\t\tpairs = getHeaders(this);\n\t\t\ti++;\n\t\t}\n\t}\n\n\t/**\n  * Overwrite header values given name\n  *\n  * @param   String  name   Header name\n  * @param   String  value  Header value\n  * @return  Void\n  */\n\tset(name, value) {\n\t\tname = `${name}`;\n\t\tvalue = `${value}`;\n\t\tvalidateName(name);\n\t\tvalidateValue(value);\n\t\tconst key = find(this[MAP], name);\n\t\tthis[MAP][key !== undefined ? key : name] = [value];\n\t}\n\n\t/**\n  * Append a value onto existing header\n  *\n  * @param   String  name   Header name\n  * @param   String  value  Header value\n  * @return  Void\n  */\n\tappend(name, value) {\n\t\tname = `${name}`;\n\t\tvalue = `${value}`;\n\t\tvalidateName(name);\n\t\tvalidateValue(value);\n\t\tconst key = find(this[MAP], name);\n\t\tif (key !== undefined) {\n\t\t\tthis[MAP][key].push(value);\n\t\t} else {\n\t\t\tthis[MAP][name] = [value];\n\t\t}\n\t}\n\n\t/**\n  * Check for header name existence\n  *\n  * @param   String   name  Header name\n  * @return  Boolean\n  */\n\thas(name) {\n\t\tname = `${name}`;\n\t\tvalidateName(name);\n\t\treturn find(this[MAP], name) !== undefined;\n\t}\n\n\t/**\n  * Delete all header values given name\n  *\n  * @param   String  name  Header name\n  * @return  Void\n  */\n\tdelete(name) {\n\t\tname = `${name}`;\n\t\tvalidateName(name);\n\t\tconst key = find(this[MAP], name);\n\t\tif (key !== undefined) {\n\t\t\tdelete this[MAP][key];\n\t\t}\n\t}\n\n\t/**\n  * Return raw headers (non-spec api)\n  *\n  * @return  Object\n  */\n\traw() {\n\t\treturn this[MAP];\n\t}\n\n\t/**\n  * Get an iterator on keys.\n  *\n  * @return  Iterator\n  */\n\tkeys() {\n\t\treturn createHeadersIterator(this, 'key');\n\t}\n\n\t/**\n  * Get an iterator on values.\n  *\n  * @return  Iterator\n  */\n\tvalues() {\n\t\treturn createHeadersIterator(this, 'value');\n\t}\n\n\t/**\n  * Get an iterator on entries.\n  *\n  * This is the default iterator of the Headers object.\n  *\n  * @return  Iterator\n  */\n\t[Symbol.iterator]() {\n\t\treturn createHeadersIterator(this, 'key+value');\n\t}\n}\nHeaders.prototype.entries = Headers.prototype[Symbol.iterator];\n\nObject.defineProperty(Headers.prototype, Symbol.toStringTag, {\n\tvalue: 'Headers',\n\twritable: false,\n\tenumerable: false,\n\tconfigurable: true\n});\n\nObject.defineProperties(Headers.prototype, {\n\tget: { enumerable: true },\n\tforEach: { enumerable: true },\n\tset: { enumerable: true },\n\tappend: { enumerable: true },\n\thas: { enumerable: true },\n\tdelete: { enumerable: true },\n\tkeys: { enumerable: true },\n\tvalues: { enumerable: true },\n\tentries: { enumerable: true }\n});\n\nfunction getHeaders(headers) {\n\tlet kind = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'key+value';\n\n\tconst keys = Object.keys(headers[MAP]).sort();\n\treturn keys.map(kind === 'key' ? function (k) {\n\t\treturn k.toLowerCase();\n\t} : kind === 'value' ? function (k) {\n\t\treturn headers[MAP][k].join(', ');\n\t} : function (k) {\n\t\treturn [k.toLowerCase(), headers[MAP][k].join(', ')];\n\t});\n}\n\nconst INTERNAL = Symbol('internal');\n\nfunction createHeadersIterator(target, kind) {\n\tconst iterator = Object.create(HeadersIteratorPrototype);\n\titerator[INTERNAL] = {\n\t\ttarget,\n\t\tkind,\n\t\tindex: 0\n\t};\n\treturn iterator;\n}\n\nconst HeadersIteratorPrototype = Object.setPrototypeOf({\n\tnext() {\n\t\t// istanbul ignore if\n\t\tif (!this || Object.getPrototypeOf(this) !== HeadersIteratorPrototype) {\n\t\t\tthrow new TypeError('Value of `this` is not a HeadersIterator');\n\t\t}\n\n\t\tvar _INTERNAL = this[INTERNAL];\n\t\tconst target = _INTERNAL.target,\n\t\t      kind = _INTERNAL.kind,\n\t\t      index = _INTERNAL.index;\n\n\t\tconst values = getHeaders(target, kind);\n\t\tconst len = values.length;\n\t\tif (index >= len) {\n\t\t\treturn {\n\t\t\t\tvalue: undefined,\n\t\t\t\tdone: true\n\t\t\t};\n\t\t}\n\n\t\tthis[INTERNAL].index = index + 1;\n\n\t\treturn {\n\t\t\tvalue: values[index],\n\t\t\tdone: false\n\t\t};\n\t}\n}, Object.getPrototypeOf(Object.getPrototypeOf([][Symbol.iterator]())));\n\nObject.defineProperty(HeadersIteratorPrototype, Symbol.toStringTag, {\n\tvalue: 'HeadersIterator',\n\twritable: false,\n\tenumerable: false,\n\tconfigurable: true\n});\n\n/**\n * Export the Headers object in a form that Node.js can consume.\n *\n * @param   Headers  headers\n * @return  Object\n */\nfunction exportNodeCompatibleHeaders(headers) {\n\tconst obj = Object.assign({ __proto__: null }, headers[MAP]);\n\n\t// http.request() only supports string as Host header. This hack makes\n\t// specifying custom Host header possible.\n\tconst hostHeaderKey = find(headers[MAP], 'Host');\n\tif (hostHeaderKey !== undefined) {\n\t\tobj[hostHeaderKey] = obj[hostHeaderKey][0];\n\t}\n\n\treturn obj;\n}\n\n/**\n * Create a Headers object from an object of headers, ignoring those that do\n * not conform to HTTP grammar productions.\n *\n * @param   Object  obj  Object of headers\n * @return  Headers\n */\nfunction createHeadersLenient(obj) {\n\tconst headers = new Headers();\n\tfor (const name of Object.keys(obj)) {\n\t\tif (invalidTokenRegex.test(name)) {\n\t\t\tcontinue;\n\t\t}\n\t\tif (Array.isArray(obj[name])) {\n\t\t\tfor (const val of obj[name]) {\n\t\t\t\tif (invalidHeaderCharRegex.test(val)) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (headers[MAP][name] === undefined) {\n\t\t\t\t\theaders[MAP][name] = [val];\n\t\t\t\t} else {\n\t\t\t\t\theaders[MAP][name].push(val);\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (!invalidHeaderCharRegex.test(obj[name])) {\n\t\t\theaders[MAP][name] = [obj[name]];\n\t\t}\n\t}\n\treturn headers;\n}\n\nconst INTERNALS$1 = Symbol('Response internals');\n\n// fix an issue where \"STATUS_CODES\" aren't a named export for node <10\nconst STATUS_CODES = http.STATUS_CODES;\n\n/**\n * Response class\n *\n * @param   Stream  body  Readable stream\n * @param   Object  opts  Response options\n * @return  Void\n */\nclass Response {\n\tconstructor() {\n\t\tlet body = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;\n\t\tlet opts = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n\n\t\tBody.call(this, body, opts);\n\n\t\tconst status = opts.status || 200;\n\t\tconst headers = new Headers(opts.headers);\n\n\t\tif (body != null && !headers.has('Content-Type')) {\n\t\t\tconst contentType = extractContentType(body);\n\t\t\tif (contentType) {\n\t\t\t\theaders.append('Content-Type', contentType);\n\t\t\t}\n\t\t}\n\n\t\tthis[INTERNALS$1] = {\n\t\t\turl: opts.url,\n\t\t\tstatus,\n\t\t\tstatusText: opts.statusText || STATUS_CODES[status],\n\t\t\theaders,\n\t\t\tcounter: opts.counter\n\t\t};\n\t}\n\n\tget url() {\n\t\treturn this[INTERNALS$1].url || '';\n\t}\n\n\tget status() {\n\t\treturn this[INTERNALS$1].status;\n\t}\n\n\t/**\n  * Convenience property representing if the request ended normally\n  */\n\tget ok() {\n\t\treturn this[INTERNALS$1].status >= 200 && this[INTERNALS$1].status < 300;\n\t}\n\n\tget redirected() {\n\t\treturn this[INTERNALS$1].counter > 0;\n\t}\n\n\tget statusText() {\n\t\treturn this[INTERNALS$1].statusText;\n\t}\n\n\tget headers() {\n\t\treturn this[INTERNALS$1].headers;\n\t}\n\n\t/**\n  * Clone this response\n  *\n  * @return  Response\n  */\n\tclone() {\n\t\treturn new Response(clone(this), {\n\t\t\turl: this.url,\n\t\t\tstatus: this.status,\n\t\t\tstatusText: this.statusText,\n\t\t\theaders: this.headers,\n\t\t\tok: this.ok,\n\t\t\tredirected: this.redirected\n\t\t});\n\t}\n}\n\nBody.mixIn(Response.prototype);\n\nObject.defineProperties(Response.prototype, {\n\turl: { enumerable: true },\n\tstatus: { enumerable: true },\n\tok: { enumerable: true },\n\tredirected: { enumerable: true },\n\tstatusText: { enumerable: true },\n\theaders: { enumerable: true },\n\tclone: { enumerable: true }\n});\n\nObject.defineProperty(Response.prototype, Symbol.toStringTag, {\n\tvalue: 'Response',\n\twritable: false,\n\tenumerable: false,\n\tconfigurable: true\n});\n\nconst INTERNALS$2 = Symbol('Request internals');\nconst URL = Url.URL || whatwgUrl.URL;\n\n// fix an issue where \"format\", \"parse\" aren't a named export for node <10\nconst parse_url = Url.parse;\nconst format_url = Url.format;\n\n/**\n * Wrapper around `new URL` to handle arbitrary URLs\n *\n * @param  {string} urlStr\n * @return {void}\n */\nfunction parseURL(urlStr) {\n\t/*\n \tCheck whether the URL is absolute or not\n \t\tScheme: https://tools.ietf.org/html/rfc3986#section-3.1\n \tAbsolute URL: https://tools.ietf.org/html/rfc3986#section-4.3\n */\n\tif (/^[a-zA-Z][a-zA-Z\\d+\\-.]*:/.exec(urlStr)) {\n\t\turlStr = new URL(urlStr).toString();\n\t}\n\n\t// Fallback to old implementation for arbitrary URLs\n\treturn parse_url(urlStr);\n}\n\nconst streamDestructionSupported = 'destroy' in Stream.Readable.prototype;\n\n/**\n * Check if a value is an instance of Request.\n *\n * @param   Mixed   input\n * @return  Boolean\n */\nfunction isRequest(input) {\n\treturn typeof input === 'object' && typeof input[INTERNALS$2] === 'object';\n}\n\nfunction isAbortSignal(signal) {\n\tconst proto = signal && typeof signal === 'object' && Object.getPrototypeOf(signal);\n\treturn !!(proto && proto.constructor.name === 'AbortSignal');\n}\n\n/**\n * Request class\n *\n * @param   Mixed   input  Url or Request instance\n * @param   Object  init   Custom options\n * @return  Void\n */\nclass Request {\n\tconstructor(input) {\n\t\tlet init = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n\n\t\tlet parsedURL;\n\n\t\t// normalize input\n\t\tif (!isRequest(input)) {\n\t\t\tif (input && input.href) {\n\t\t\t\t// in order to support Node.js' Url objects; though WHATWG's URL objects\n\t\t\t\t// will fall into this branch also (since their `toString()` will return\n\t\t\t\t// `href` property anyway)\n\t\t\t\tparsedURL = parseURL(input.href);\n\t\t\t} else {\n\t\t\t\t// coerce input to a string before attempting to parse\n\t\t\t\tparsedURL = parseURL(`${input}`);\n\t\t\t}\n\t\t\tinput = {};\n\t\t} else {\n\t\t\tparsedURL = parseURL(input.url);\n\t\t}\n\n\t\tlet method = init.method || input.method || 'GET';\n\t\tmethod = method.toUpperCase();\n\n\t\tif ((init.body != null || isRequest(input) && input.body !== null) && (method === 'GET' || method === 'HEAD')) {\n\t\t\tthrow new TypeError('Request with GET/HEAD method cannot have body');\n\t\t}\n\n\t\tlet inputBody = init.body != null ? init.body : isRequest(input) && input.body !== null ? clone(input) : null;\n\n\t\tBody.call(this, inputBody, {\n\t\t\ttimeout: init.timeout || input.timeout || 0,\n\t\t\tsize: init.size || input.size || 0\n\t\t});\n\n\t\tconst headers = new Headers(init.headers || input.headers || {});\n\n\t\tif (inputBody != null && !headers.has('Content-Type')) {\n\t\t\tconst contentType = extractContentType(inputBody);\n\t\t\tif (contentType) {\n\t\t\t\theaders.append('Content-Type', contentType);\n\t\t\t}\n\t\t}\n\n\t\tlet signal = isRequest(input) ? input.signal : null;\n\t\tif ('signal' in init) signal = init.signal;\n\n\t\tif (signal != null && !isAbortSignal(signal)) {\n\t\t\tthrow new TypeError('Expected signal to be an instanceof AbortSignal');\n\t\t}\n\n\t\tthis[INTERNALS$2] = {\n\t\t\tmethod,\n\t\t\tredirect: init.redirect || input.redirect || 'follow',\n\t\t\theaders,\n\t\t\tparsedURL,\n\t\t\tsignal\n\t\t};\n\n\t\t// node-fetch-only options\n\t\tthis.follow = init.follow !== undefined ? init.follow : input.follow !== undefined ? input.follow : 20;\n\t\tthis.compress = init.compress !== undefined ? init.compress : input.compress !== undefined ? input.compress : true;\n\t\tthis.counter = init.counter || input.counter || 0;\n\t\tthis.agent = init.agent || input.agent;\n\t}\n\n\tget method() {\n\t\treturn this[INTERNALS$2].method;\n\t}\n\n\tget url() {\n\t\treturn format_url(this[INTERNALS$2].parsedURL);\n\t}\n\n\tget headers() {\n\t\treturn this[INTERNALS$2].headers;\n\t}\n\n\tget redirect() {\n\t\treturn this[INTERNALS$2].redirect;\n\t}\n\n\tget signal() {\n\t\treturn this[INTERNALS$2].signal;\n\t}\n\n\t/**\n  * Clone this request\n  *\n  * @return  Request\n  */\n\tclone() {\n\t\treturn new Request(this);\n\t}\n}\n\nBody.mixIn(Request.prototype);\n\nObject.defineProperty(Request.prototype, Symbol.toStringTag, {\n\tvalue: 'Request',\n\twritable: false,\n\tenumerable: false,\n\tconfigurable: true\n});\n\nObject.defineProperties(Request.prototype, {\n\tmethod: { enumerable: true },\n\turl: { enumerable: true },\n\theaders: { enumerable: true },\n\tredirect: { enumerable: true },\n\tclone: { enumerable: true },\n\tsignal: { enumerable: true }\n});\n\n/**\n * Convert a Request to Node.js http request options.\n *\n * @param   Request  A Request instance\n * @return  Object   The options object to be passed to http.request\n */\nfunction getNodeRequestOptions(request) {\n\tconst parsedURL = request[INTERNALS$2].parsedURL;\n\tconst headers = new Headers(request[INTERNALS$2].headers);\n\n\t// fetch step 1.3\n\tif (!headers.has('Accept')) {\n\t\theaders.set('Accept', '*/*');\n\t}\n\n\t// Basic fetch\n\tif (!parsedURL.protocol || !parsedURL.hostname) {\n\t\tthrow new TypeError('Only absolute URLs are supported');\n\t}\n\n\tif (!/^https?:$/.test(parsedURL.protocol)) {\n\t\tthrow new TypeError('Only HTTP(S) protocols are supported');\n\t}\n\n\tif (request.signal && request.body instanceof Stream.Readable && !streamDestructionSupported) {\n\t\tthrow new Error('Cancellation of streamed requests with AbortSignal is not supported in node < 8');\n\t}\n\n\t// HTTP-network-or-cache fetch steps 2.4-2.7\n\tlet contentLengthValue = null;\n\tif (request.body == null && /^(POST|PUT)$/i.test(request.method)) {\n\t\tcontentLengthValue = '0';\n\t}\n\tif (request.body != null) {\n\t\tconst totalBytes = getTotalBytes(request);\n\t\tif (typeof totalBytes === 'number') {\n\t\t\tcontentLengthValue = String(totalBytes);\n\t\t}\n\t}\n\tif (contentLengthValue) {\n\t\theaders.set('Content-Length', contentLengthValue);\n\t}\n\n\t// HTTP-network-or-cache fetch step 2.11\n\tif (!headers.has('User-Agent')) {\n\t\theaders.set('User-Agent', 'node-fetch/1.0 (+https://github.com/bitinn/node-fetch)');\n\t}\n\n\t// HTTP-network-or-cache fetch step 2.15\n\tif (request.compress && !headers.has('Accept-Encoding')) {\n\t\theaders.set('Accept-Encoding', 'gzip,deflate');\n\t}\n\n\tlet agent = request.agent;\n\tif (typeof agent === 'function') {\n\t\tagent = agent(parsedURL);\n\t}\n\n\t// HTTP-network fetch step 4.2\n\t// chunked encoding is handled by Node.js\n\n\treturn Object.assign({}, parsedURL, {\n\t\tmethod: request.method,\n\t\theaders: exportNodeCompatibleHeaders(headers),\n\t\tagent\n\t});\n}\n\n/**\n * abort-error.js\n *\n * AbortError interface for cancelled requests\n */\n\n/**\n * Create AbortError instance\n *\n * @param   String      message      Error message for human\n * @return  AbortError\n */\nfunction AbortError(message) {\n  Error.call(this, message);\n\n  this.type = 'aborted';\n  this.message = message;\n\n  // hide custom error implementation details from end-users\n  Error.captureStackTrace(this, this.constructor);\n}\n\nAbortError.prototype = Object.create(Error.prototype);\nAbortError.prototype.constructor = AbortError;\nAbortError.prototype.name = 'AbortError';\n\nconst URL$1 = Url.URL || whatwgUrl.URL;\n\n// fix an issue where \"PassThrough\", \"resolve\" aren't a named export for node <10\nconst PassThrough$1 = Stream.PassThrough;\n\nconst isDomainOrSubdomain = function isDomainOrSubdomain(destination, original) {\n\tconst orig = new URL$1(original).hostname;\n\tconst dest = new URL$1(destination).hostname;\n\n\treturn orig === dest || orig[orig.length - dest.length - 1] === '.' && orig.endsWith(dest);\n};\n\n/**\n * isSameProtocol reports whether the two provided URLs use the same protocol.\n *\n * Both domains must already be in canonical form.\n * @param {string|URL} original\n * @param {string|URL} destination\n */\nconst isSameProtocol = function isSameProtocol(destination, original) {\n\tconst orig = new URL$1(original).protocol;\n\tconst dest = new URL$1(destination).protocol;\n\n\treturn orig === dest;\n};\n\n/**\n * Fetch function\n *\n * @param   Mixed    url   Absolute url or Request instance\n * @param   Object   opts  Fetch options\n * @return  Promise\n */\nfunction fetch(url, opts) {\n\n\t// allow custom promise\n\tif (!fetch.Promise) {\n\t\tthrow new Error('native promise missing, set fetch.Promise to your favorite alternative');\n\t}\n\n\tBody.Promise = fetch.Promise;\n\n\t// wrap http.request into fetch\n\treturn new fetch.Promise(function (resolve, reject) {\n\t\t// build request object\n\t\tconst request = new Request(url, opts);\n\t\tconst options = getNodeRequestOptions(request);\n\n\t\tconst send = (options.protocol === 'https:' ? https : http).request;\n\t\tconst signal = request.signal;\n\n\t\tlet response = null;\n\n\t\tconst abort = function abort() {\n\t\t\tlet error = new AbortError('The user aborted a request.');\n\t\t\treject(error);\n\t\t\tif (request.body && request.body instanceof Stream.Readable) {\n\t\t\t\tdestroyStream(request.body, error);\n\t\t\t}\n\t\t\tif (!response || !response.body) return;\n\t\t\tresponse.body.emit('error', error);\n\t\t};\n\n\t\tif (signal && signal.aborted) {\n\t\t\tabort();\n\t\t\treturn;\n\t\t}\n\n\t\tconst abortAndFinalize = function abortAndFinalize() {\n\t\t\tabort();\n\t\t\tfinalize();\n\t\t};\n\n\t\t// send request\n\t\tconst req = send(options);\n\t\tlet reqTimeout;\n\n\t\tif (signal) {\n\t\t\tsignal.addEventListener('abort', abortAndFinalize);\n\t\t}\n\n\t\tfunction finalize() {\n\t\t\treq.abort();\n\t\t\tif (signal) signal.removeEventListener('abort', abortAndFinalize);\n\t\t\tclearTimeout(reqTimeout);\n\t\t}\n\n\t\tif (request.timeout) {\n\t\t\treq.once('socket', function (socket) {\n\t\t\t\treqTimeout = setTimeout(function () {\n\t\t\t\t\treject(new FetchError(`network timeout at: ${request.url}`, 'request-timeout'));\n\t\t\t\t\tfinalize();\n\t\t\t\t}, request.timeout);\n\t\t\t});\n\t\t}\n\n\t\treq.on('error', function (err) {\n\t\t\treject(new FetchError(`request to ${request.url} failed, reason: ${err.message}`, 'system', err));\n\n\t\t\tif (response && response.body) {\n\t\t\t\tdestroyStream(response.body, err);\n\t\t\t}\n\n\t\t\tfinalize();\n\t\t});\n\n\t\tfixResponseChunkedTransferBadEnding(req, function (err) {\n\t\t\tif (signal && signal.aborted) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif (response && response.body) {\n\t\t\t\tdestroyStream(response.body, err);\n\t\t\t}\n\t\t});\n\n\t\t/* c8 ignore next 18 */\n\t\tif (parseInt(process.version.substring(1)) < 14) {\n\t\t\t// Before Node.js 14, pipeline() does not fully support async iterators and does not always\n\t\t\t// properly handle when the socket close/end events are out of order.\n\t\t\treq.on('socket', function (s) {\n\t\t\t\ts.addListener('close', function (hadError) {\n\t\t\t\t\t// if a data listener is still present we didn't end cleanly\n\t\t\t\t\tconst hasDataListener = s.listenerCount('data') > 0;\n\n\t\t\t\t\t// if end happened before close but the socket didn't emit an error, do it now\n\t\t\t\t\tif (response && hasDataListener && !hadError && !(signal && signal.aborted)) {\n\t\t\t\t\t\tconst err = new Error('Premature close');\n\t\t\t\t\t\terr.code = 'ERR_STREAM_PREMATURE_CLOSE';\n\t\t\t\t\t\tresponse.body.emit('error', err);\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t});\n\t\t}\n\n\t\treq.on('response', function (res) {\n\t\t\tclearTimeout(reqTimeout);\n\n\t\t\tconst headers = createHeadersLenient(res.headers);\n\n\t\t\t// HTTP fetch step 5\n\t\t\tif (fetch.isRedirect(res.statusCode)) {\n\t\t\t\t// HTTP fetch step 5.2\n\t\t\t\tconst location = headers.get('Location');\n\n\t\t\t\t// HTTP fetch step 5.3\n\t\t\t\tlet locationURL = null;\n\t\t\t\ttry {\n\t\t\t\t\tlocationURL = location === null ? null : new URL$1(location, request.url).toString();\n\t\t\t\t} catch (err) {\n\t\t\t\t\t// error here can only be invalid URL in Location: header\n\t\t\t\t\t// do not throw when options.redirect == manual\n\t\t\t\t\t// let the user extract the errorneous redirect URL\n\t\t\t\t\tif (request.redirect !== 'manual') {\n\t\t\t\t\t\treject(new FetchError(`uri requested responds with an invalid redirect URL: ${location}`, 'invalid-redirect'));\n\t\t\t\t\t\tfinalize();\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t// HTTP fetch step 5.5\n\t\t\t\tswitch (request.redirect) {\n\t\t\t\t\tcase 'error':\n\t\t\t\t\t\treject(new FetchError(`uri requested responds with a redirect, redirect mode is set to error: ${request.url}`, 'no-redirect'));\n\t\t\t\t\t\tfinalize();\n\t\t\t\t\t\treturn;\n\t\t\t\t\tcase 'manual':\n\t\t\t\t\t\t// node-fetch-specific step: make manual redirect a bit easier to use by setting the Location header value to the resolved URL.\n\t\t\t\t\t\tif (locationURL !== null) {\n\t\t\t\t\t\t\t// handle corrupted header\n\t\t\t\t\t\t\ttry {\n\t\t\t\t\t\t\t\theaders.set('Location', locationURL);\n\t\t\t\t\t\t\t} catch (err) {\n\t\t\t\t\t\t\t\t// istanbul ignore next: nodejs server prevent invalid response headers, we can't test this through normal request\n\t\t\t\t\t\t\t\treject(err);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'follow':\n\t\t\t\t\t\t// HTTP-redirect fetch step 2\n\t\t\t\t\t\tif (locationURL === null) {\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// HTTP-redirect fetch step 5\n\t\t\t\t\t\tif (request.counter >= request.follow) {\n\t\t\t\t\t\t\treject(new FetchError(`maximum redirect reached at: ${request.url}`, 'max-redirect'));\n\t\t\t\t\t\t\tfinalize();\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// HTTP-redirect fetch step 6 (counter increment)\n\t\t\t\t\t\t// Create a new Request object.\n\t\t\t\t\t\tconst requestOpts = {\n\t\t\t\t\t\t\theaders: new Headers(request.headers),\n\t\t\t\t\t\t\tfollow: request.follow,\n\t\t\t\t\t\t\tcounter: request.counter + 1,\n\t\t\t\t\t\t\tagent: request.agent,\n\t\t\t\t\t\t\tcompress: request.compress,\n\t\t\t\t\t\t\tmethod: request.method,\n\t\t\t\t\t\t\tbody: request.body,\n\t\t\t\t\t\t\tsignal: request.signal,\n\t\t\t\t\t\t\ttimeout: request.timeout,\n\t\t\t\t\t\t\tsize: request.size\n\t\t\t\t\t\t};\n\n\t\t\t\t\t\tif (!isDomainOrSubdomain(request.url, locationURL) || !isSameProtocol(request.url, locationURL)) {\n\t\t\t\t\t\t\tfor (const name of ['authorization', 'www-authenticate', 'cookie', 'cookie2']) {\n\t\t\t\t\t\t\t\trequestOpts.headers.delete(name);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// HTTP-redirect fetch step 9\n\t\t\t\t\t\tif (res.statusCode !== 303 && request.body && getTotalBytes(request) === null) {\n\t\t\t\t\t\t\treject(new FetchError('Cannot follow redirect with body being a readable stream', 'unsupported-redirect'));\n\t\t\t\t\t\t\tfinalize();\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// HTTP-redirect fetch step 11\n\t\t\t\t\t\tif (res.statusCode === 303 || (res.statusCode === 301 || res.statusCode === 302) && request.method === 'POST') {\n\t\t\t\t\t\t\trequestOpts.method = 'GET';\n\t\t\t\t\t\t\trequestOpts.body = undefined;\n\t\t\t\t\t\t\trequestOpts.headers.delete('content-length');\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// HTTP-redirect fetch step 15\n\t\t\t\t\t\tresolve(fetch(new Request(locationURL, requestOpts)));\n\t\t\t\t\t\tfinalize();\n\t\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// prepare response\n\t\t\tres.once('end', function () {\n\t\t\t\tif (signal) signal.removeEventListener('abort', abortAndFinalize);\n\t\t\t});\n\t\t\tlet body = res.pipe(new PassThrough$1());\n\n\t\t\tconst response_options = {\n\t\t\t\turl: request.url,\n\t\t\t\tstatus: res.statusCode,\n\t\t\t\tstatusText: res.statusMessage,\n\t\t\t\theaders: headers,\n\t\t\t\tsize: request.size,\n\t\t\t\ttimeout: request.timeout,\n\t\t\t\tcounter: request.counter\n\t\t\t};\n\n\t\t\t// HTTP-network fetch step 12.1.1.3\n\t\t\tconst codings = headers.get('Content-Encoding');\n\n\t\t\t// HTTP-network fetch step 12.1.1.4: handle content codings\n\n\t\t\t// in following scenarios we ignore compression support\n\t\t\t// 1. compression support is disabled\n\t\t\t// 2. HEAD request\n\t\t\t// 3. no Content-Encoding header\n\t\t\t// 4. no content response (204)\n\t\t\t// 5. content not modified response (304)\n\t\t\tif (!request.compress || request.method === 'HEAD' || codings === null || res.statusCode === 204 || res.statusCode === 304) {\n\t\t\t\tresponse = new Response(body, response_options);\n\t\t\t\tresolve(response);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t// For Node v6+\n\t\t\t// Be less strict when decoding compressed responses, since sometimes\n\t\t\t// servers send slightly invalid responses that are still accepted\n\t\t\t// by common browsers.\n\t\t\t// Always using Z_SYNC_FLUSH is what cURL does.\n\t\t\tconst zlibOptions = {\n\t\t\t\tflush: zlib.Z_SYNC_FLUSH,\n\t\t\t\tfinishFlush: zlib.Z_SYNC_FLUSH\n\t\t\t};\n\n\t\t\t// for gzip\n\t\t\tif (codings == 'gzip' || codings == 'x-gzip') {\n\t\t\t\tbody = body.pipe(zlib.createGunzip(zlibOptions));\n\t\t\t\tresponse = new Response(body, response_options);\n\t\t\t\tresolve(response);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t// for deflate\n\t\t\tif (codings == 'deflate' || codings == 'x-deflate') {\n\t\t\t\t// handle the infamous raw deflate response from old servers\n\t\t\t\t// a hack for old IIS and Apache servers\n\t\t\t\tconst raw = res.pipe(new PassThrough$1());\n\t\t\t\traw.once('data', function (chunk) {\n\t\t\t\t\t// see http://stackoverflow.com/questions/37519828\n\t\t\t\t\tif ((chunk[0] & 0x0F) === 0x08) {\n\t\t\t\t\t\tbody = body.pipe(zlib.createInflate());\n\t\t\t\t\t} else {\n\t\t\t\t\t\tbody = body.pipe(zlib.createInflateRaw());\n\t\t\t\t\t}\n\t\t\t\t\tresponse = new Response(body, response_options);\n\t\t\t\t\tresolve(response);\n\t\t\t\t});\n\t\t\t\traw.on('end', function () {\n\t\t\t\t\t// some old IIS servers return zero-length OK deflate responses, so 'data' is never emitted.\n\t\t\t\t\tif (!response) {\n\t\t\t\t\t\tresponse = new Response(body, response_options);\n\t\t\t\t\t\tresolve(response);\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t// for br\n\t\t\tif (codings == 'br' && typeof zlib.createBrotliDecompress === 'function') {\n\t\t\t\tbody = body.pipe(zlib.createBrotliDecompress());\n\t\t\t\tresponse = new Response(body, response_options);\n\t\t\t\tresolve(response);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t// otherwise, use response as-is\n\t\t\tresponse = new Response(body, response_options);\n\t\t\tresolve(response);\n\t\t});\n\n\t\twriteToStream(req, request);\n\t});\n}\nfunction fixResponseChunkedTransferBadEnding(request, errorCallback) {\n\tlet socket;\n\n\trequest.on('socket', function (s) {\n\t\tsocket = s;\n\t});\n\n\trequest.on('response', function (response) {\n\t\tconst headers = response.headers;\n\n\t\tif (headers['transfer-encoding'] === 'chunked' && !headers['content-length']) {\n\t\t\tresponse.once('close', function (hadError) {\n\t\t\t\t// tests for socket presence, as in some situations the\n\t\t\t\t// the 'socket' event is not triggered for the request\n\t\t\t\t// (happens in deno), avoids `TypeError`\n\t\t\t\t// if a data listener is still present we didn't end cleanly\n\t\t\t\tconst hasDataListener = socket && socket.listenerCount('data') > 0;\n\n\t\t\t\tif (hasDataListener && !hadError) {\n\t\t\t\t\tconst err = new Error('Premature close');\n\t\t\t\t\terr.code = 'ERR_STREAM_PREMATURE_CLOSE';\n\t\t\t\t\terrorCallback(err);\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\t});\n}\n\nfunction destroyStream(stream, err) {\n\tif (stream.destroy) {\n\t\tstream.destroy(err);\n\t} else {\n\t\t// node < 8\n\t\tstream.emit('error', err);\n\t\tstream.end();\n\t}\n}\n\n/**\n * Redirect code matching\n *\n * @param   Number   code  Status code\n * @return  Boolean\n */\nfetch.isRedirect = function (code) {\n\treturn code === 301 || code === 302 || code === 303 || code === 307 || code === 308;\n};\n\n// expose Promise\nfetch.Promise = global.Promise;\n\nmodule.exports = exports = fetch;\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.default = exports;\nexports.Headers = Headers;\nexports.Request = Request;\nexports.Response = Response;\nexports.FetchError = FetchError;\n", "/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n/* global Reflect, Promise */\r\n\r\nvar extendStatics = function(d, b) {\r\n    extendStatics = Object.setPrototypeOf ||\r\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n        function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\r\n    return extendStatics(d, b);\r\n};\r\n\r\nexport function __extends(d, b) {\r\n    if (typeof b !== \"function\" && b !== null)\r\n        throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\r\n    extendStatics(d, b);\r\n    function __() { this.constructor = d; }\r\n    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n}\r\n\r\nexport var __assign = function() {\r\n    __assign = Object.assign || function __assign(t) {\r\n        for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n            s = arguments[i];\r\n            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n        }\r\n        return t;\r\n    }\r\n    return __assign.apply(this, arguments);\r\n}\r\n\r\nexport function __rest(s, e) {\r\n    var t = {};\r\n    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n        t[p] = s[p];\r\n    if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n            if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n                t[p[i]] = s[p[i]];\r\n        }\r\n    return t;\r\n}\r\n\r\nexport function __decorate(decorators, target, key, desc) {\r\n    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n    if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n    return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n}\r\n\r\nexport function __param(paramIndex, decorator) {\r\n    return function (target, key) { decorator(target, key, paramIndex); }\r\n}\r\n\r\nexport function __metadata(metadataKey, metadataValue) {\r\n    if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n}\r\n\r\nexport function __awaiter(thisArg, _arguments, P, generator) {\r\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n    return new (P || (P = Promise))(function (resolve, reject) {\r\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n    });\r\n}\r\n\r\nexport function __generator(thisArg, body) {\r\n    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n    return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n    function verb(n) { return function (v) { return step([n, v]); }; }\r\n    function step(op) {\r\n        if (f) throw new TypeError(\"Generator is already executing.\");\r\n        while (_) try {\r\n            if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n            if (y = 0, t) op = [op[0] & 2, t.value];\r\n            switch (op[0]) {\r\n                case 0: case 1: t = op; break;\r\n                case 4: _.label++; return { value: op[1], done: false };\r\n                case 5: _.label++; y = op[1]; op = [0]; continue;\r\n                case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n                default:\r\n                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n                    if (t[2]) _.ops.pop();\r\n                    _.trys.pop(); continue;\r\n            }\r\n            op = body.call(thisArg, _);\r\n        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n    }\r\n}\r\n\r\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    var desc = Object.getOwnPropertyDescriptor(m, k);\r\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\r\n        desc = { enumerable: true, get: function() { return m[k]; } };\r\n    }\r\n    Object.defineProperty(o, k2, desc);\r\n}) : (function(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    o[k2] = m[k];\r\n});\r\n\r\nexport function __exportStar(m, o) {\r\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\r\n}\r\n\r\nexport function __values(o) {\r\n    var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\r\n    if (m) return m.call(o);\r\n    if (o && typeof o.length === \"number\") return {\r\n        next: function () {\r\n            if (o && i >= o.length) o = void 0;\r\n            return { value: o && o[i++], done: !o };\r\n        }\r\n    };\r\n    throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\r\n}\r\n\r\nexport function __read(o, n) {\r\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n    if (!m) return o;\r\n    var i = m.call(o), r, ar = [], e;\r\n    try {\r\n        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n    }\r\n    catch (error) { e = { error: error }; }\r\n    finally {\r\n        try {\r\n            if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n        }\r\n        finally { if (e) throw e.error; }\r\n    }\r\n    return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spread() {\r\n    for (var ar = [], i = 0; i < arguments.length; i++)\r\n        ar = ar.concat(__read(arguments[i]));\r\n    return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spreadArrays() {\r\n    for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n    for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n        for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n            r[k] = a[j];\r\n    return r;\r\n}\r\n\r\nexport function __spreadArray(to, from, pack) {\r\n    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\r\n        if (ar || !(i in from)) {\r\n            if (!ar) ar = Array.prototype.slice.call(from, 0, i);\r\n            ar[i] = from[i];\r\n        }\r\n    }\r\n    return to.concat(ar || Array.prototype.slice.call(from));\r\n}\r\n\r\nexport function __await(v) {\r\n    return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n}\r\n\r\nexport function __asyncGenerator(thisArg, _arguments, generator) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n    return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n    function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n    function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n    function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n    function fulfill(value) { resume(\"next\", value); }\r\n    function reject(value) { resume(\"throw\", value); }\r\n    function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n}\r\n\r\nexport function __asyncDelegator(o) {\r\n    var i, p;\r\n    return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n    function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n}\r\n\r\nexport function __asyncValues(o) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var m = o[Symbol.asyncIterator], i;\r\n    return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n    function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n    function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n}\r\n\r\nexport function __makeTemplateObject(cooked, raw) {\r\n    if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n    return cooked;\r\n};\r\n\r\nvar __setModuleDefault = Object.create ? (function(o, v) {\r\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\r\n}) : function(o, v) {\r\n    o[\"default\"] = v;\r\n};\r\n\r\nexport function __importStar(mod) {\r\n    if (mod && mod.__esModule) return mod;\r\n    var result = {};\r\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\r\n    __setModuleDefault(result, mod);\r\n    return result;\r\n}\r\n\r\nexport function __importDefault(mod) {\r\n    return (mod && mod.__esModule) ? mod : { default: mod };\r\n}\r\n\r\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\r\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\r\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\r\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\r\n}\r\n\r\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\r\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\r\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\r\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\r\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\r\n}\r\n\r\nexport function __classPrivateFieldIn(state, receiver) {\r\n    if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\r\n    return typeof state === \"function\" ? receiver === state : state.has(receiver);\r\n}\r\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Backend, DataToGPUOptions, GPUData, Tensor} from '../tensor';\nimport {DataId} from '../tensor_info';\nimport {BackendValues, DataType, WebGLData, WebGPUData} from '../types';\n\nexport const EPSILON_FLOAT32 = 1e-7;\nexport const EPSILON_FLOAT16 = 1e-4;\n\n// Required information for all backends.\nexport interface BackendTimingInfo {\n  kernelMs: number|{error: string};\n  getExtraProfileInfo?(): string;  // a field for additional timing information\n                                   // e.g. packing / unpacking for WebGL backend\n}\n\nexport interface TensorStorage {\n  read(dataId: DataId): Promise<BackendValues>;\n  readSync(dataId: DataId): BackendValues;\n  disposeData(dataId: DataId, force?: boolean): boolean;\n  write(values: BackendValues, shape: number[], dtype: DataType): DataId;\n  move(\n      dataId: DataId, values: BackendValues, shape: number[], dtype: DataType,\n      refCount: number): void;\n  memory(): {unreliable: boolean;};  // Backend-specific information.\n  /** Returns number of data ids currently in the storage. */\n  numDataIds(): number;\n  refCount(dataId: DataId): number;\n}\n\n/** Convenient class for storing tensor-related data. */\nexport class DataStorage<T> {\n  private data = new WeakMap<DataId, T>();\n  private dataIdsCount = 0;\n\n  constructor(private backend: KernelBackend, private dataMover: DataMover) {}\n\n  get(dataId: DataId) {\n    if (!this.data.has(dataId)) {\n      this.dataMover.moveData(this.backend, dataId);\n    }\n    return this.data.get(dataId);\n  }\n\n  set(dataId: DataId, value: T): void {\n    this.dataIdsCount++;\n    this.data.set(dataId, value);\n  }\n\n  has(dataId: DataId): boolean {\n    return this.data.has(dataId);\n  }\n\n  delete(dataId: DataId): boolean {\n    this.dataIdsCount--;\n    return this.data.delete(dataId);\n  }\n\n  numDataIds(): number {\n    return this.dataIdsCount;\n  }\n}\n\nexport interface DataMover {\n  /**\n   * To be called by backends whenever they see a dataId that they don't own.\n   * Upon calling this method, the mover will fetch the tensor from another\n   * backend and register it with the current active backend.\n   */\n  moveData(backend: KernelBackend, dataId: DataId): void;\n}\n\nexport interface BackendTimer {\n  // check if backend timer is available\n  timerAvailable(): boolean;\n  time(f: () => void): Promise<BackendTimingInfo>;\n}\n\n/**\n * The interface that defines the kernels that should be implemented when\n * adding a new backend. New backends don't need to implement every one of the\n * methods, this can be done gradually (throw an error for unimplemented\n * methods).\n */\nexport class KernelBackend implements TensorStorage, Backend, BackendTimer {\n  refCount(dataId: DataId): number {\n    return notYetImplemented('refCount');\n  }\n  incRef(dataId: DataId): void {\n    return notYetImplemented('incRef');\n  }\n  timerAvailable(): boolean {\n    return true;\n  }\n  time(f: () => void): Promise<BackendTimingInfo> {\n    return notYetImplemented('time');\n  }\n  read(dataId: object): Promise<BackendValues> {\n    return notYetImplemented('read');\n  }\n  readSync(dataId: object): BackendValues {\n    return notYetImplemented('readSync');\n  }\n  readToGPU(dataId: object, options?: DataToGPUOptions): GPUData {\n    return notYetImplemented('readToGPU');\n  }\n  numDataIds(): number {\n    return notYetImplemented('numDataIds');\n  }\n  disposeData(dataId: object, force?: boolean): boolean {\n    return notYetImplemented('disposeData');\n  }\n  write(values: BackendValues, shape: number[], dtype: DataType): DataId {\n    return notYetImplemented('write');\n  }\n  move(\n      dataId: DataId, values: BackendValues, shape: number[], dtype: DataType,\n      refCount: number): void {\n    return notYetImplemented('move');\n  }\n\n  createTensorFromGPUData(\n      values: WebGLData|WebGPUData, shape: number[], dtype: DataType): Tensor {\n    return notYetImplemented('createTensorFromGPUData');\n  }\n\n  memory(): {unreliable: boolean; reasons?: string[]} {\n    return notYetImplemented('memory');\n  }\n  /** Returns the highest precision for floats in bits (e.g. 16 or 32) */\n  floatPrecision(): 16|32 {\n    return notYetImplemented('floatPrecision');\n  }\n  /** Returns the smallest representable number.  */\n  epsilon(): number {\n    return this.floatPrecision() === 32 ? EPSILON_FLOAT32 : EPSILON_FLOAT16;\n  }\n  dispose(): void {\n    return notYetImplemented('dispose');\n  }\n}\n\nfunction notYetImplemented(kernelName: string): never {\n  throw new Error(\n      `'${kernelName}' not yet implemented or not found in the registry. ` +\n      `This kernel may not be supported by the tfjs backend you have chosen`);\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {BackendValues, DataType, DataTypeMap, FlatVector, NumericDataType, TensorLike, TypedArray, WebGLData, WebGPUData} from './types';\n\n/**\n * Shuffles the array in-place using Fisher-Yates algorithm.\n *\n * ```js\n * const a = [1, 2, 3, 4, 5];\n * tf.util.shuffle(a);\n * console.log(a);\n * ```\n *\n * @param array The array to shuffle in-place.\n *\n * @doc {heading: 'Util', namespace: 'util'}\n */\n// tslint:disable-next-line:no-any\nexport function shuffle(array: any[]|Uint32Array|Int32Array|\n                        Float32Array): void {\n  let counter = array.length;\n  let index = 0;\n  // While there are elements in the array\n  while (counter > 0) {\n    // Pick a random index\n    index = (Math.random() * counter) | 0;\n    // Decrease counter by 1\n    counter--;\n    // And swap the last element with it\n    swap(array, counter, index);\n  }\n}\n\n/**\n * Shuffles two arrays in-place the same way using Fisher-Yates algorithm.\n *\n * ```js\n * const a = [1,2,3,4,5];\n * const b = [11,22,33,44,55];\n * tf.util.shuffleCombo(a, b);\n * console.log(a, b);\n * ```\n *\n * @param array The first array to shuffle in-place.\n * @param array2 The second array to shuffle in-place with the same permutation\n *     as the first array.\n *\n * @doc {heading: 'Util', namespace: 'util'}\n */\nexport function shuffleCombo(\n    // tslint:disable-next-line:no-any\n    array: any[]|Uint32Array|Int32Array|Float32Array,\n    // tslint:disable-next-line:no-any\n    array2: any[]|Uint32Array|Int32Array|Float32Array): void {\n  if (array.length !== array2.length) {\n    throw new Error(\n        `Array sizes must match to be shuffled together ` +\n        `First array length was ${array.length}` +\n        `Second array length was ${array2.length}`);\n  }\n  let counter = array.length;\n  let index = 0;\n  // While there are elements in the array\n  while (counter > 0) {\n    // Pick a random index\n    index = (Math.random() * counter) | 0;\n    // Decrease counter by 1\n    counter--;\n    // And swap the last element of each array with it\n    swap(array, counter, index);\n    swap(array2, counter, index);\n  }\n}\n\n/** Clamps a value to a specified range. */\nexport function clamp(min: number, x: number, max: number): number {\n  return Math.max(min, Math.min(x, max));\n}\n\nexport function nearestLargerEven(val: number): number {\n  return val % 2 === 0 ? val : val + 1;\n}\n\nexport function swap<T>(\n    object: {[index: number]: T}, left: number, right: number) {\n  const temp = object[left];\n  object[left] = object[right];\n  object[right] = temp;\n}\n\nexport function sum(arr: number[]): number {\n  let sum = 0;\n  for (let i = 0; i < arr.length; i++) {\n    sum += arr[i];\n  }\n  return sum;\n}\n\n/**\n * Returns a sample from a uniform [a, b) distribution.\n *\n * @param a The minimum support (inclusive).\n * @param b The maximum support (exclusive).\n * @return A pseudorandom number on the half-open interval [a,b).\n */\nexport function randUniform(a: number, b: number) {\n  const r = Math.random();\n  return (b * r) + (1 - r) * a;\n}\n\n/** Returns the squared Euclidean distance between two vectors. */\nexport function distSquared(a: FlatVector, b: FlatVector): number {\n  let result = 0;\n  for (let i = 0; i < a.length; i++) {\n    const diff = Number(a[i]) - Number(b[i]);\n    result += diff * diff;\n  }\n  return result;\n}\n\n/**\n * Asserts that the expression is true. Otherwise throws an error with the\n * provided message.\n *\n * ```js\n * const x = 2;\n * tf.util.assert(x === 2, 'x is not 2');\n * ```\n *\n * @param expr The expression to assert (as a boolean).\n * @param msg A function that returns the message to report when throwing an\n *     error. We use a function for performance reasons.\n *\n * @doc {heading: 'Util', namespace: 'util'}\n */\nexport function assert(expr: boolean, msg: () => string) {\n  if (!expr) {\n    throw new Error(typeof msg === 'string' ? msg : msg());\n  }\n}\n\nexport function assertShapesMatch(\n    shapeA: number[], shapeB: number[], errorMessagePrefix = ''): void {\n  assert(\n      arraysEqual(shapeA, shapeB),\n      () => errorMessagePrefix + ` Shapes ${shapeA} and ${shapeB} must match`);\n}\n\nexport function assertNonNull(a: TensorLike): void {\n  assert(\n      a != null,\n      () => `The input to the tensor constructor must be a non-null value.`);\n}\n\n/**\n * Returns the size (number of elements) of the tensor given its shape.\n *\n * ```js\n * const shape = [3, 4, 2];\n * const size = tf.util.sizeFromShape(shape);\n * console.log(size);\n * ```\n *\n * @doc {heading: 'Util', namespace: 'util'}\n */\nexport function sizeFromShape(shape: number[]): number {\n  if (shape.length === 0) {\n    // Scalar.\n    return 1;\n  }\n  let size = shape[0];\n  for (let i = 1; i < shape.length; i++) {\n    size *= shape[i];\n  }\n  return size;\n}\n\nexport function isScalarShape(shape: number[]): boolean {\n  return shape.length === 0;\n}\n\nexport function arraysEqualWithNull(n1: number[], n2: number[]) {\n  if (n1 === n2) {\n    return true;\n  }\n\n  if (n1 == null || n2 == null) {\n    return false;\n  }\n\n  if (n1.length !== n2.length) {\n    return false;\n  }\n\n  for (let i = 0; i < n1.length; i++) {\n    if (n1[i] !== null && n2[i] !== null && n1[i] !== n2[i]) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport function arraysEqual(n1: FlatVector, n2: FlatVector) {\n  if (n1 === n2) {\n    return true;\n  }\n  if (n1 == null || n2 == null) {\n    return false;\n  }\n\n  if (n1.length !== n2.length) {\n    return false;\n  }\n  for (let i = 0; i < n1.length; i++) {\n    if (n1[i] !== n2[i]) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport function isInt(a: number): boolean {\n  return a % 1 === 0;\n}\n\nexport function tanh(x: number): number {\n  // tslint:disable-next-line:no-any\n  if ((Math as any).tanh != null) {\n    // tslint:disable-next-line:no-any\n    return (Math as any).tanh(x);\n  }\n  if (x === Infinity) {\n    return 1;\n  } else if (x === -Infinity) {\n    return -1;\n  } else {\n    const e2x = Math.exp(2 * x);\n    return (e2x - 1) / (e2x + 1);\n  }\n}\n\nexport function sizeToSquarishShape(size: number): [number, number] {\n  const width = Math.ceil(Math.sqrt(size));\n  return [width, Math.ceil(size / width)];\n}\n\n/**\n * Creates a new array with randomized indices to a given quantity.\n *\n * ```js\n * const randomTen = tf.util.createShuffledIndices(10);\n * console.log(randomTen);\n * ```\n *\n * @param number Quantity of how many shuffled indices to create.\n *\n * @doc {heading: 'Util', namespace: 'util'}\n */\nexport function createShuffledIndices(n: number): Uint32Array {\n  const shuffledIndices = new Uint32Array(n);\n  for (let i = 0; i < n; ++i) {\n    shuffledIndices[i] = i;\n  }\n  shuffle(shuffledIndices);\n  return shuffledIndices;\n}\n\nexport function rightPad(a: string, size: number): string {\n  if (size <= a.length) {\n    return a;\n  }\n  return a + ' '.repeat(size - a.length);\n}\n\nexport function repeatedTry(\n    checkFn: () => boolean, delayFn = (counter: number) => 0,\n    maxCounter?: number,\n    scheduleFn?: (functionRef: Function, delay: number) =>\n        void): Promise<void> {\n  return new Promise<void>((resolve, reject) => {\n    let tryCount = 0;\n\n    const tryFn = () => {\n      if (checkFn()) {\n        resolve();\n        return;\n      }\n\n      tryCount++;\n\n      const nextBackoff = delayFn(tryCount);\n\n      if (maxCounter != null && tryCount >= maxCounter) {\n        reject();\n        return;\n      }\n\n      if (scheduleFn != null) {\n        scheduleFn(tryFn, nextBackoff);\n      } else {\n        // google3 does not allow assigning another variable to setTimeout.\n        // Don't refactor this so scheduleFn has a default value of setTimeout.\n        setTimeout(tryFn, nextBackoff);\n      }\n    };\n\n    tryFn();\n  });\n}\n\n/**\n * Given the full size of the array and a shape that may contain -1 as the\n * implicit dimension, returns the inferred shape where -1 is replaced.\n * E.g. For shape=[2, -1, 3] and size=24, it will return [2, 4, 3].\n *\n * @param shape The shape, which may contain -1 in some dimension.\n * @param size The full size (number of elements) of the array.\n * @return The inferred shape where -1 is replaced with the inferred size.\n */\nexport function inferFromImplicitShape(\n    shape: number[], size: number): number[] {\n  let shapeProd = 1;\n  let implicitIdx = -1;\n\n  for (let i = 0; i < shape.length; ++i) {\n    if (shape[i] >= 0) {\n      shapeProd *= shape[i];\n    } else if (shape[i] === -1) {\n      if (implicitIdx !== -1) {\n        throw Error(\n            `Shapes can only have 1 implicit size. ` +\n            `Found -1 at dim ${implicitIdx} and dim ${i}`);\n      }\n      implicitIdx = i;\n    } else if (shape[i] < 0) {\n      throw Error(`Shapes can not be < 0. Found ${shape[i]} at dim ${i}`);\n    }\n  }\n\n  if (implicitIdx === -1) {\n    if (size > 0 && size !== shapeProd) {\n      throw Error(`Size(${size}) must match the product of shape ${shape}`);\n    }\n    return shape;\n  }\n\n  if (shapeProd === 0) {\n    throw Error(\n        `Cannot infer the missing size in [${shape}] when ` +\n        `there are 0 elements`);\n  }\n  if (size % shapeProd !== 0) {\n    throw Error(\n        `The implicit shape can't be a fractional number. ` +\n        `Got ${size} / ${shapeProd}`);\n  }\n\n  const newShape = shape.slice();\n  newShape[implicitIdx] = size / shapeProd;\n  return newShape;\n}\n\nexport function parseAxisParam(\n    axis: number|number[], shape: number[]): number[] {\n  const rank = shape.length;\n\n  // Normalize input\n  axis = axis == null ? shape.map((s, i) => i) : [].concat(axis);\n\n  // Check for valid range\n  assert(\n      axis.every(ax => ax >= -rank && ax < rank),\n      () =>\n          `All values in axis param must be in range [-${rank}, ${rank}) but ` +\n          `got axis ${axis}`);\n\n  // Check for only integers\n  assert(\n      axis.every(ax => isInt(ax)),\n      () => `All values in axis param must be integers but ` +\n          `got axis ${axis}`);\n\n  // Handle negative axis.\n  return axis.map(a => a < 0 ? rank + a : a);\n}\n\n/** Reduces the shape by removing all dimensions of shape 1. */\nexport function squeezeShape(shape: number[], axis?: number[]):\n    {newShape: number[], keptDims: number[]} {\n  const newShape: number[] = [];\n  const keptDims: number[] = [];\n  const isEmptyArray = axis != null && Array.isArray(axis) && axis.length === 0;\n  const axes = (axis == null || isEmptyArray) ?\n      null :\n      parseAxisParam(axis, shape).sort();\n  let j = 0;\n  for (let i = 0; i < shape.length; ++i) {\n    if (axes != null) {\n      if (axes[j] === i && shape[i] !== 1) {\n        throw new Error(\n            `Can't squeeze axis ${i} since its dim '${shape[i]}' is not 1`);\n      }\n      if ((axes[j] == null || axes[j] > i) && shape[i] === 1) {\n        newShape.push(shape[i]);\n        keptDims.push(i);\n      }\n      if (axes[j] <= i) {\n        j++;\n      }\n    }\n    if (shape[i] !== 1) {\n      newShape.push(shape[i]);\n      keptDims.push(i);\n    }\n  }\n  return {newShape, keptDims};\n}\n\nexport function getTypedArrayFromDType<D extends NumericDataType>(\n    dtype: D, size: number): DataTypeMap[D] {\n  return getArrayFromDType<D>(dtype, size);\n}\n\nexport function getArrayFromDType<D extends DataType>(\n    dtype: D, size: number): DataTypeMap[D] {\n  let values = null;\n  if (dtype == null || dtype === 'float32') {\n    values = new Float32Array(size);\n  } else if (dtype === 'int32') {\n    values = new Int32Array(size);\n  } else if (dtype === 'bool') {\n    values = new Uint8Array(size);\n  } else if (dtype === 'string') {\n    values = new Array<string>(size);\n  } else {\n    throw new Error(`Unknown data type ${dtype}`);\n  }\n  return values as DataTypeMap[D];\n}\n\nexport function checkConversionForErrors<D extends DataType>(\n    vals: DataTypeMap[D]|number[], dtype: D): void {\n  for (let i = 0; i < vals.length; i++) {\n    const num = vals[i] as number;\n    if (isNaN(num) || !isFinite(num)) {\n      throw Error(`A tensor of type ${dtype} being uploaded contains ${num}.`);\n    }\n  }\n}\n\n/** Returns true if the dtype is valid. */\nexport function isValidDtype(dtype: DataType): boolean {\n  return dtype === 'bool' || dtype === 'complex64' || dtype === 'float32' ||\n      dtype === 'int32' || dtype === 'string';\n}\n\n/**\n * Returns true if the new type can't encode the old type without loss of\n * precision.\n */\nexport function hasEncodingLoss(oldType: DataType, newType: DataType): boolean {\n  if (newType === 'complex64') {\n    return false;\n  }\n  if (newType === 'float32' && oldType !== 'complex64') {\n    return false;\n  }\n  if (newType === 'int32' && oldType !== 'float32' && oldType !== 'complex64') {\n    return false;\n  }\n  if (newType === 'bool' && oldType === 'bool') {\n    return false;\n  }\n  return true;\n}\n\nexport function bytesPerElement(dtype: DataType): number {\n  if (dtype === 'float32' || dtype === 'int32') {\n    return 4;\n  } else if (dtype === 'complex64') {\n    return 8;\n  } else if (dtype === 'bool') {\n    return 1;\n  } else {\n    throw new Error(`Unknown dtype ${dtype}`);\n  }\n}\n\n/**\n * Returns the approximate number of bytes allocated in the string array - 2\n * bytes per character. Computing the exact bytes for a native string in JS\n * is not possible since it depends on the encoding of the html page that\n * serves the website.\n */\nexport function bytesFromStringArray(arr: Uint8Array[]): number {\n  if (arr == null) {\n    return 0;\n  }\n  let bytes = 0;\n  arr.forEach(x => bytes += x.length);\n  return bytes;\n}\n\n/** Returns true if the value is a string. */\nexport function isString(value: {}): value is string {\n  return typeof value === 'string' || value instanceof String;\n}\n\nexport function isBoolean(value: {}): boolean {\n  return typeof value === 'boolean';\n}\n\nexport function isNumber(value: {}): boolean {\n  return typeof value === 'number';\n}\n\nexport function inferDtype(values: TensorLike|WebGLData|WebGPUData): DataType {\n  if (Array.isArray(values)) {\n    return inferDtype(values[0]);\n  }\n  if (values instanceof Float32Array) {\n    return 'float32';\n  } else if (\n      values instanceof Int32Array || values instanceof Uint8Array ||\n      values instanceof Uint8ClampedArray) {\n    return 'int32';\n  } else if (isNumber(values)) {\n    return 'float32';\n  } else if (isString(values)) {\n    return 'string';\n  } else if (isBoolean(values)) {\n    return 'bool';\n  }\n  return 'float32';\n}\n\nexport function isFunction(f: Function) {\n  return !!(f && f.constructor && f.call && f.apply);\n}\n\nexport function nearestDivisor(size: number, start: number): number {\n  for (let i = start; i < size; ++i) {\n    if (size % i === 0) {\n      return i;\n    }\n  }\n  return size;\n}\n\nexport function computeStrides(shape: number[]): number[] {\n  const rank = shape.length;\n  if (rank < 2) {\n    return [];\n  }\n\n  // Last dimension has implicit stride of 1, thus having D-1 (instead of D)\n  // strides.\n  const strides = new Array(rank - 1);\n  strides[rank - 2] = shape[rank - 1];\n  for (let i = rank - 3; i >= 0; --i) {\n    strides[i] = strides[i + 1] * shape[i + 1];\n  }\n  return strides;\n}\n\nfunction createNestedArray(\n    offset: number, shape: number[], a: TypedArray, isComplex = false) {\n  const ret = new Array();\n  if (shape.length === 1) {\n    const d = shape[0] * (isComplex ? 2 : 1);\n    for (let i = 0; i < d; i++) {\n      ret[i] = a[offset + i];\n    }\n  } else {\n    const d = shape[0];\n    const rest = shape.slice(1);\n    const len = rest.reduce((acc, c) => acc * c) * (isComplex ? 2 : 1);\n    for (let i = 0; i < d; i++) {\n      ret[i] = createNestedArray(offset + i * len, rest, a, isComplex);\n    }\n  }\n  return ret;\n}\n\n// Provide a nested array of TypedArray in given shape.\nexport function toNestedArray(\n    shape: number[], a: TypedArray, isComplex = false) {\n  if (shape.length === 0) {\n    // Scalar type should return a single number.\n    return a[0];\n  }\n  const size = shape.reduce((acc, c) => acc * c) * (isComplex ? 2 : 1);\n  if (size === 0) {\n    // A tensor with shape zero should be turned into empty list.\n    return [];\n  }\n  if (size !== a.length) {\n    throw new Error(`[${shape}] does not match the input size ${a.length}${\n        isComplex ? ' for a complex tensor' : ''}.`);\n  }\n\n  return createNestedArray(0, shape, a, isComplex);\n}\n\nexport function convertBackendValuesAndArrayBuffer(\n    data: BackendValues|ArrayBuffer, dtype: DataType) {\n  // If is type Uint8Array[], return it directly.\n  if (Array.isArray(data)) {\n    return data;\n  }\n  if (dtype === 'float32') {\n    return data instanceof Float32Array ? data : new Float32Array(data);\n  } else if (dtype === 'int32') {\n    return data instanceof Int32Array ? data : new Int32Array(data);\n  } else if (dtype === 'bool' || dtype === 'string') {\n    return Uint8Array.from(new Int32Array(data));\n  } else {\n    throw new Error(`Unknown dtype ${dtype}`);\n  }\n}\n\nexport function makeOnesTypedArray<D extends DataType>(\n    size: number, dtype: D): DataTypeMap[D] {\n  const array = makeZerosTypedArray(size, dtype);\n  for (let i = 0; i < array.length; i++) {\n    array[i] = 1;\n  }\n  return array;\n}\n\nexport function makeZerosTypedArray<D extends DataType>(\n    size: number, dtype: D): DataTypeMap[D] {\n  if (dtype == null || dtype === 'float32' || dtype === 'complex64') {\n    return new Float32Array(size) as DataTypeMap[D];\n  } else if (dtype === 'int32') {\n    return new Int32Array(size) as DataTypeMap[D];\n  } else if (dtype === 'bool') {\n    return new Uint8Array(size) as DataTypeMap[D];\n  } else {\n    throw new Error(`Unknown data type ${dtype}`);\n  }\n}\n\n/**\n * Make nested `TypedArray` filled with zeros.\n * @param shape The shape information for the nested array.\n * @param dtype dtype of the array element.\n */\nexport function makeZerosNestedTypedArray<D extends DataType>(\n    shape: number[], dtype: D) {\n  const size = shape.reduce((prev, curr) => prev * curr, 1);\n  if (dtype == null || dtype === 'float32') {\n    return toNestedArray(shape, new Float32Array(size));\n  } else if (dtype === 'int32') {\n    return toNestedArray(shape, new Int32Array(size));\n  } else if (dtype === 'bool') {\n    return toNestedArray(shape, new Uint8Array(size));\n  } else {\n    throw new Error(`Unknown data type ${dtype}`);\n  }\n}\n\nexport function assertNonNegativeIntegerDimensions(shape: number[]) {\n  shape.forEach(dimSize => {\n    assert(\n        Number.isInteger(dimSize) && dimSize >= 0,\n        () =>\n            `Tensor must have a shape comprised of positive integers but got ` +\n            `shape [${shape}].`);\n  });\n}\n\n/**\n * Computes flat index for a given location (multidimentionsal index) in a\n * Tensor/multidimensional array.\n *\n * @param locs Location in the tensor.\n * @param rank Rank of the tensor.\n * @param strides Tensor strides.\n */\nexport function locToIndex(\n    locs: number[], rank: number, strides: number[]): number {\n  if (rank === 0) {\n    return 0;\n  } else if (rank === 1) {\n    return locs[0];\n  }\n  let index = locs[locs.length - 1];\n  for (let i = 0; i < locs.length - 1; ++i) {\n    index += strides[i] * locs[i];\n  }\n  return index;\n}\n\n/**\n * Computes the location (multidimensional index) in a\n * tensor/multidimentional array for a given flat index.\n *\n * @param index Index in flat array.\n * @param rank Rank of tensor.\n * @param strides Strides of tensor.\n */\nexport function indexToLoc(\n    index: number, rank: number, strides: number[]): number[] {\n  if (rank === 0) {\n    return [];\n  } else if (rank === 1) {\n    return [index];\n  }\n  const locs: number[] = new Array(rank);\n  for (let i = 0; i < locs.length - 1; ++i) {\n    locs[i] = Math.floor(index / strides[i]);\n    index -= locs[i] * strides[i];\n  }\n  locs[locs.length - 1] = index;\n  return locs;\n}\n\n/**\n * This method asserts whether an object is a Promise instance.\n * @param object\n */\n// tslint:disable-next-line: no-any\nexport function isPromise(object: any): object is Promise<unknown> {\n  //  We chose to not use 'obj instanceOf Promise' for two reasons:\n  //  1. It only reliably works for es6 Promise, not other Promise\n  //  implementations.\n  //  2. It doesn't work with framework that uses zone.js. zone.js monkey\n  //  patch the async calls, so it is possible the obj (patched) is\n  //  comparing to a pre-patched Promise.\n  return object && object.then && typeof object.then === 'function';\n}\n", "/**\n * @license\n * Copyright 2017 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Platform} from './platforms/platform';\nimport {isPromise} from './util_base';\n\n// Expects flags from URL in the format ?tfjsflags=FLAG1:1,FLAG2:true.\nconst TENSORFLOWJS_FLAGS_PREFIX = 'tfjsflags';\n\ntype FlagValue = number|boolean|string;\ntype FlagEvaluationFn = (() => FlagValue)|(() => Promise<FlagValue>);\nexport type Flags = {\n  [featureName: string]: FlagValue\n};\nexport type FlagRegistryEntry = {\n  evaluationFn: FlagEvaluationFn;\n  setHook?: (value: FlagValue) => void;\n};\n\n/**\n * The environment contains evaluated flags as well as the registered platform.\n * This is always used as a global singleton and can be retrieved with\n * `tf.env()`.\n *\n * @doc {heading: 'Environment'}\n */\nexport class Environment {\n  private flags: Flags = {};\n  private flagRegistry: {[flagName: string]: FlagRegistryEntry} = {};\n\n  private urlFlags: Flags = {};\n\n  platformName: string;\n  platform: Platform;\n\n  // Jasmine spies on this in 'environment_test.ts'\n  getQueryParams = getQueryParams;\n\n  // tslint:disable-next-line: no-any\n  constructor(public global: any) {\n    this.populateURLFlags();\n  }\n\n  setPlatform(platformName: string, platform: Platform) {\n    if (this.platform != null) {\n      if (!(env().getBool('IS_TEST') || env().getBool('PROD'))) {\n        console.warn(\n            `Platform ${this.platformName} has already been set. ` +\n            `Overwriting the platform with ${platformName}.`);\n      }\n    }\n    this.platformName = platformName;\n    this.platform = platform;\n  }\n\n  registerFlag(\n      flagName: string, evaluationFn: FlagEvaluationFn,\n      setHook?: (value: FlagValue) => void) {\n    this.flagRegistry[flagName] = {evaluationFn, setHook};\n\n    // Override the flag value from the URL. This has to happen here because\n    // the environment is initialized before flags get registered.\n    if (this.urlFlags[flagName] != null) {\n      const flagValue = this.urlFlags[flagName];\n      if (!(env().getBool('IS_TEST') || env().getBool('PROD'))) {\n        console.warn(\n            `Setting feature override from URL ${flagName}: ${flagValue}.`);\n      }\n      this.set(flagName, flagValue);\n    }\n  }\n\n  async getAsync(flagName: string): Promise<FlagValue> {\n    if (flagName in this.flags) {\n      return this.flags[flagName];\n    }\n\n    this.flags[flagName] = await this.evaluateFlag(flagName);\n    return this.flags[flagName];\n  }\n\n  get(flagName: string): FlagValue {\n    if (flagName in this.flags) {\n      return this.flags[flagName];\n    }\n\n    const flagValue = this.evaluateFlag(flagName);\n    if (isPromise(flagValue)) {\n      throw new Error(\n          `Flag ${flagName} cannot be synchronously evaluated. ` +\n          `Please use getAsync() instead.`);\n    }\n\n    this.flags[flagName] = flagValue;\n    return this.flags[flagName];\n  }\n\n  getNumber(flagName: string): number {\n    return this.get(flagName) as number;\n  }\n\n  getBool(flagName: string): boolean {\n    return this.get(flagName) as boolean;\n  }\n\n  getString(flagName: string): string {\n    return this.get(flagName) as string;\n  }\n\n  getFlags(): Flags {\n    return this.flags;\n  }\n  // For backwards compatibility.\n  get features(): Flags {\n    return this.flags;\n  }\n\n  set(flagName: string, value: FlagValue): void {\n    if (this.flagRegistry[flagName] == null) {\n      throw new Error(\n          `Cannot set flag ${flagName} as it has not been registered.`);\n    }\n    this.flags[flagName] = value;\n    if (this.flagRegistry[flagName].setHook != null) {\n      this.flagRegistry[flagName].setHook(value);\n    }\n  }\n\n  private evaluateFlag(flagName: string): FlagValue|Promise<FlagValue> {\n    if (this.flagRegistry[flagName] == null) {\n      throw new Error(\n          `Cannot evaluate flag '${flagName}': no evaluation function found.`);\n    }\n    return this.flagRegistry[flagName].evaluationFn();\n  }\n\n  setFlags(flags: Flags) {\n    this.flags = Object.assign({}, flags);\n  }\n\n  reset() {\n    this.flags = {};\n    this.urlFlags = {};\n    this.populateURLFlags();\n  }\n\n  private populateURLFlags(): void {\n    if (typeof this.global === 'undefined' ||\n        typeof this.global.location === 'undefined' ||\n        typeof this.global.location.search === 'undefined') {\n      return;\n    }\n\n    const urlParams = this.getQueryParams(this.global.location.search);\n    if (TENSORFLOWJS_FLAGS_PREFIX in urlParams) {\n      const keyValues = urlParams[TENSORFLOWJS_FLAGS_PREFIX].split(',');\n      keyValues.forEach(keyValue => {\n        const [key, value] = keyValue.split(':') as [string, string];\n        this.urlFlags[key] = parseValue(key, value);\n      });\n    }\n  }\n}\n\nexport function getQueryParams(queryString: string): {[key: string]: string} {\n  const params = {};\n  queryString.replace(/[?&]([^=?&]+)(?:=([^&]*))?/g, (s, ...t) => {\n    decodeParam(params, t[0], t[1]);\n    return t.join('=');\n  });\n  return params;\n}\n\nfunction decodeParam(\n    params: {[key: string]: string}, name: string, value?: string) {\n  params[decodeURIComponent(name)] = decodeURIComponent(value || '');\n}\n\nfunction parseValue(flagName: string, value: string): FlagValue {\n  const lowerCaseValue = value.toLowerCase();\n  if (lowerCaseValue === 'true' || lowerCaseValue === 'false') {\n    return lowerCaseValue === 'true';\n  } else if (`${+ lowerCaseValue}` === lowerCaseValue) {\n    return +lowerCaseValue;\n  } else {\n    return value;\n  }\n}\n\n/**\n * Returns the current environment (a global singleton).\n *\n * The environment object contains the evaluated feature values as well as the\n * active platform.\n *\n * @doc {heading: 'Environment'}\n */\nexport function env() {\n  return ENV;\n}\n\nexport let ENV: Environment = null;\nexport function setEnvironmentGlobal(environment: Environment) {\n  ENV = environment;\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n// Note that the identifier globalNameSpace is scoped to this module, but will\n// always resolve to the same global object regardless of how the module is\n// resolved.\n// tslint:disable-next-line:no-any\nlet globalNameSpace: {_tfGlobals: Map<string, any>};\n// tslint:disable-next-line:no-any\nexport function getGlobalNamespace(): {_tfGlobals: Map<string, any>} {\n  if (globalNameSpace == null) {\n    // tslint:disable-next-line:no-any\n    let ns: any;\n    if (typeof (window) !== 'undefined') {\n      ns = window;\n    } else if (typeof (global) !== 'undefined') {\n      ns = global;\n    } else if (typeof (process) !== 'undefined') {\n      ns = process;\n    } else if (typeof (self) !== 'undefined') {\n      ns = self;\n    } else {\n      throw new Error('Could not find a global object');\n    }\n    globalNameSpace = ns;\n  }\n  return globalNameSpace;\n}\n\n// tslint:disable-next-line:no-any\nfunction getGlobalMap(): Map<string, any> {\n  const ns = getGlobalNamespace();\n  if (ns._tfGlobals == null) {\n    ns._tfGlobals = new Map();\n  }\n  return ns._tfGlobals;\n}\n\n/**\n * Returns a globally accessible 'singleton' object.\n *\n * @param key the name of the object\n * @param init a function to initialize to initialize this object\n *             the first time it is fetched.\n */\nexport function getGlobal<T>(key: string, init: () => T): T {\n  const globalMap = getGlobalMap();\n  if (globalMap.has(key)) {\n    return globalMap.get(key);\n  } else {\n    const singleton = init();\n    globalMap.set(key, singleton);\n    return globalMap.get(key);\n  }\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n// Allow UpperCamelCase variable names\n// tslint:disable: variable-name\n// Unfortunately just enabling PascalCase per file (tslint:enable:\n// allow-pascal-case) doesn't work.\nimport {NamedTensorInfoMap} from './kernel_registry';\nimport {ExplicitPadding} from './ops/conv_util';\nimport {Activation} from './ops/fused_types';\nimport {TensorInfo} from './tensor_info';\nimport {DataType, DrawOptions, PixelData} from './types';\n\nexport const Abs = 'Abs';\nexport type AbsInputs = UnaryInputs;\n\nexport const Acos = 'Acos';\nexport type AcosInputs = UnaryInputs;\n\nexport const Acosh = 'Acosh';\nexport type AcoshInputs = UnaryInputs;\n\nexport const Add = 'Add';\nexport type AddInputs = BinaryInputs;\n\nexport const AddN = 'AddN';\nexport type AddNInputs = TensorInfo[];\n\nexport const All = 'All';\nexport type AllInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface AllAttrs {\n  axis: number|number[];\n  keepDims: boolean;\n}\n\nexport const Any = 'Any';\nexport type AnyInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface AnyAttrs {\n  axis: number|number[];\n  keepDims: boolean;\n}\n\nexport const ArgMax = 'ArgMax';\nexport type ArgMaxInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface ArgMaxAttrs {\n  axis: number;\n}\n\nexport const ArgMin = 'ArgMin';\nexport type ArgMinInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface ArgMinAttrs {\n  axis: number;\n}\n\nexport const Asin = 'Asin';\nexport type AsinInputs = UnaryInputs;\n\nexport const Asinh = 'Asinh';\nexport type AsinhInputs = UnaryInputs;\n\nexport const Atan = 'Atan';\nexport type AtanInputs = UnaryInputs;\n\nexport const Atanh = 'Atanh';\nexport type AtanhInputs = UnaryInputs;\n\nexport const Atan2 = 'Atan2';\nexport type Atan2Inputs = BinaryInputs;\n\nexport const AvgPool = 'AvgPool';\nexport type AvgPoolInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface AvgPoolAttrs {\n  filterSize: [number, number]|number;\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n}\n\nexport const AvgPoolGrad = 'AvgPoolGrad';\nexport type AvgPoolGradInputs = Pick<NamedTensorInfoMap, 'dy'|'input'>;\nexport interface AvgPoolGradAttrs {\n  filterSize: [number, number]|number;\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n}\n\nexport const AvgPool3D = 'AvgPool3D';\nexport type AvgPool3DInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface AvgPool3DAttrs {\n  filterSize: [number, number, number]|number;\n  strides: [number, number, number]|number;\n  pad: 'valid'|'same'|number;\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n  dataFormat: 'NDHWC'|'NCDHW';\n}\n\nexport const AvgPool3DGrad = 'AvgPool3DGrad';\nexport type AvgPool3DGradInputs = Pick<NamedTensorInfoMap, 'dy'|'input'>;\nexport interface AvgPool3DGradAttrs {\n  filterSize: [number, number, number]|number;\n  strides: [number, number, number]|number;\n  pad: 'valid'|'same'|number;\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n}\n\nexport const BatchMatMul = 'BatchMatMul';\nexport type BatchMatMulInputs = Pick<NamedTensorInfoMap, 'a'|'b'>;\nexport interface BatchMatMulAttrs {\n  transposeA: boolean;\n  transposeB: boolean;\n}\n\nexport const BatchToSpaceND = 'BatchToSpaceND';\nexport type BatchToSpaceNDInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface BatchToSpaceNDAttrs {\n  blockShape: number[];\n  crops: number[][];\n}\n\nexport type BinaryInputs = Pick<NamedTensorInfoMap, 'a'|'b'>;\n\nexport const Bincount = 'Bincount';\nexport type BincountInputs = Pick<NamedTensorInfoMap, 'x'|'weights'>;\nexport interface BincountAttrs {\n  size: number;\n}\n\nexport const BitwiseAnd = 'BitwiseAnd';\nexport type BitwiseAndInputs = BinaryInputs;\n\nexport const BroadcastTo = 'BroadcastTo';\nexport type BroadcastToInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface BroadCastToAttrs {\n  shape: number[];\n  inputShape: number[];  // for gradient\n}\n\nexport const BroadcastArgs = 'BroadcastArgs';\nexport type BroadcastArgsInputs = Pick<NamedTensorInfoMap, 's0'|'s1'>;\n\nexport const Cast = 'Cast';\nexport type CastInputs = UnaryInputs;\nexport interface CastAttrs {\n  dtype: DataType;\n}\n\nexport const Ceil = 'Ceil';\nexport type CeilInputs = UnaryInputs;\n\nexport const ClipByValue = 'ClipByValue';\nexport type ClipByValueInputs = UnaryInputs;\nexport interface ClipByValueAttrs {\n  clipValueMin: number;\n  clipValueMax: number;\n}\n\nexport const Complex = 'Complex';\nexport type ComplexInputs = Pick<NamedTensorInfoMap, 'real'|'imag'>;\n\nexport const ComplexAbs = 'ComplexAbs';\nexport type ComplexAbsInputs = UnaryInputs;\n\nexport const Concat = 'Concat';\nexport type ConcatInputs = TensorInfo[];\nexport interface ConcatAttrs {\n  axis: number;\n}\n\nexport const Conv2D = 'Conv2D';\nexport type Conv2DInputs = Pick<NamedTensorInfoMap, 'x'|'filter'>;\nexport interface Conv2DAttrs {\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dataFormat: 'NHWC'|'NCHW';\n  dilations: [number, number]|number;\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n}\n\nexport const Conv2DBackpropFilter = 'Conv2DBackpropFilter';\nexport type Conv2DBackpropFilterInputs = Pick<NamedTensorInfoMap, 'x'|'dy'>;\nexport interface Conv2DBackpropFilterAttrs {\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dataFormat: 'NHWC'|'NCHW';\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n  filterShape: [number, number, number, number];\n}\n\nexport const Conv2DBackpropInput = 'Conv2DBackpropInput';\nexport type Conv2DBackpropInputInputs = Pick<NamedTensorInfoMap, 'dy'|'filter'>;\nexport interface Conv2DBackpropInputAttrs {\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dataFormat: 'NHWC'|'NCHW';\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n  inputShape: [number, number, number, number];\n}\n\nexport const Conv3D = 'Conv3D';\nexport type Conv3DInputs = Pick<NamedTensorInfoMap, 'x'|'filter'>;\nexport interface Conv3DAttrs {\n  strides: [number, number, number]|number;\n  pad: 'valid'|'same';\n  dataFormat: 'NDHWC'|'NCDHW';\n  dilations: [number, number, number]|number;\n}\n\nexport const Conv3DBackpropFilterV2 = 'Conv3DBackpropFilterV2';\nexport type Conv3DBackpropFilterV2Inputs = Pick<NamedTensorInfoMap, 'x'|'dy'>;\n\nexport interface Conv3DBackpropFilterV2Attrs {\n  strides: [number, number, number]|number;\n  pad: 'valid'|'same';\n  filterShape: [number, number, number, number, number];\n}\n\nexport const Conv3DBackpropInputV2 = 'Conv3DBackpropInputV2';\nexport type Conv3DBackpropInputV2Inputs =\n    Pick<NamedTensorInfoMap, 'dy'|'filter'>;\nexport interface Conv3DBackpropInputV2Attrs {\n  strides: [number, number, number]|number;\n  pad: 'valid'|'same';\n  inputShape: [number, number, number, number, number];\n}\n\nexport const Cos = 'Cos';\nexport type CosInputs = UnaryInputs;\n\nexport const Cosh = 'Cosh';\nexport type CoshInputs = UnaryInputs;\n\nexport const Cumprod = 'Cumprod';\nexport type CumprodInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface CumprodAttrs {\n  axis: number;\n  exclusive: boolean;\n  reverse: boolean;\n}\n\nexport const Cumsum = 'Cumsum';\nexport type CumsumInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface CumsumAttrs {\n  axis: number;\n  exclusive: boolean;\n  reverse: boolean;\n}\n\nexport const CropAndResize = 'CropAndResize';\nexport type CropAndResizeInputs =\n    Pick<NamedTensorInfoMap, 'image'|'boxes'|'boxInd'>;\nexport interface CropAndResizeAttrs {\n  cropSize: [number, number];\n  method: 'bilinear'|'nearest';\n  extrapolationValue: number;\n}\n\nexport const DenseBincount = 'DenseBincount';\nexport type DenseBincountInputs = Pick<NamedTensorInfoMap, 'x'|'weights'>;\nexport interface DenseBincountAttrs {\n  size: number;\n  binaryOutput?: boolean;\n}\n\nexport const DepthToSpace = 'DepthToSpace';\nexport type DepthToSpaceInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface DepthToSpaceAttrs {\n  blockSize: number;\n  dataFormat: 'NHWC'|'NCHW';\n}\n\nexport const DepthwiseConv2dNative = 'DepthwiseConv2dNative';\nexport type DepthwiseConv2dNativeInputs =\n    Pick<NamedTensorInfoMap, 'x'|'filter'>;\nexport interface DepthwiseConv2dNativeAttrs {\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dataFormat: 'NHWC'|'NCHW';\n  dilations: [number, number]|number;\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n}\n\nexport const DepthwiseConv2dNativeBackpropFilter =\n    'DepthwiseConv2dNativeBackpropFilter';\nexport type DepthwiseConv2dNativeBackpropFilterInputs =\n    Pick<NamedTensorInfoMap, 'x'|'dy'>;\nexport interface DepthwiseConv2dNativeBackpropFilterAttrs {\n  strides: [number, number]|number;\n  dilations: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n  filterShape: [number, number, number, number];\n}\n\nexport const DepthwiseConv2dNativeBackpropInput =\n    'DepthwiseConv2dNativeBackpropInput';\nexport type DepthwiseConv2dNativeBackpropInputInputs =\n    Pick<NamedTensorInfoMap, 'dy'|'filter'>;\nexport interface DepthwiseConv2dNativeBackpropInputAttrs {\n  strides: [number, number]|number;\n  dilations: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n  inputShape: [number, number, number, number];\n}\n\nexport const Diag = 'Diag';\nexport type DiagInputs = Pick<NamedTensorInfoMap, 'x'>;\n\nexport const Dilation2D = 'Dilation2D';\nexport type Dilation2DInputs = Pick<NamedTensorInfoMap, 'x'|'filter'>;\nexport interface Dilation2DAttrs {\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number;\n  dilations: [number, number]|number;\n}\n\nexport const Dilation2DBackpropInput = 'Dilation2DBackpropInput';\nexport type Dilation2DBackpropInputInputs =\n    Pick<NamedTensorInfoMap, 'x'|'filter'|'dy'>;\n\nexport const Dilation2DBackpropFilter = 'Dilation2DBackpropFilter';\nexport type Dilation2DBackpropFilterInputs =\n    Pick<NamedTensorInfoMap, 'x'|'filter'|'dy'>;\n\nexport const Draw = 'Draw';\nexport type DrawInputs = Pick<NamedTensorInfoMap, 'image'>;\nexport interface DrawAttrs {\n  canvas: HTMLCanvasElement;\n  options?: DrawOptions;\n}\n\nexport const RealDiv = 'RealDiv';\nexport type RealDivInputs = BinaryInputs;\n\nexport const Einsum = 'Einsum';\nexport type EinsumInputs = TensorInfo[];\nexport interface EinsumAttrs {\n  equation: string;\n}\n\nexport const Elu = 'Elu';\nexport type EluInputs = Pick<NamedTensorInfoMap, 'x'>;\n\nexport const EluGrad = 'EluGrad';\nexport type EluGradInputs = Pick<NamedTensorInfoMap, 'dy'|'y'>;\n\nexport const Erf = 'Erf';\nexport type ErfInputs = UnaryInputs;\n\nexport const Equal = 'Equal';\nexport type EqualInputs = BinaryInputs;\n\nexport const Exp = 'Exp';\nexport type ExpInputs = UnaryInputs;\n\nexport const ExpandDims = 'ExpandDims';\nexport type ExpandDimsInputs = Pick<NamedTensorInfoMap, 'input'>;\nexport interface ExpandDimsAttrs {\n  dim: number;\n}\n\nexport const Expm1 = 'Expm1';\nexport type Expm1Inputs = UnaryInputs;\n\nexport const FFT = 'FFT';\nexport type FFTInputs = Pick<NamedTensorInfoMap, 'input'>;\n\nexport const Fill = 'Fill';\nexport interface FillAttrs {\n  shape: number[];\n  value: number|string;\n  dtype: DataType;\n}\n\nexport const FlipLeftRight = 'FlipLeftRight';\nexport type FlipLeftRightInputs = Pick<NamedTensorInfoMap, 'image'>;\n\nexport const Floor = 'Floor';\nexport type FloorInputs = UnaryInputs;\n\nexport const FloorDiv = 'FloorDiv';\nexport type FloorDivInputs = BinaryInputs;\n\nexport const FusedBatchNorm = 'FusedBatchNorm';\nexport type FusedBatchNormInputs =\n    Pick<NamedTensorInfoMap, 'x'|'scale'|'offset'|'mean'|'variance'>;\nexport interface FusedBatchNormAttrs {\n  varianceEpsilon: number;\n}\n\nexport const GatherV2 = 'GatherV2';\nexport type GatherV2Inputs = Pick<NamedTensorInfoMap, 'x'|'indices'>;\nexport interface GatherV2Attrs {\n  axis: number;\n  batchDims: number;\n}\n\nexport const GatherNd = 'GatherNd';\nexport type GatherNdInputs = Pick<NamedTensorInfoMap, 'params'|'indices'>;\n\nexport const Greater = 'Greater';\nexport type GreaterInputs = BinaryInputs;\n\nexport const GreaterEqual = 'GreaterEqual';\nexport type GreaterEqualInputs = BinaryInputs;\n\nexport const Identity = 'Identity';\nexport type IdentityInputs = Pick<NamedTensorInfoMap, 'x'>;\n\nexport const IFFT = 'IFFT';\nexport type IFFTInputs = Pick<NamedTensorInfoMap, 'input'>;\n\nexport const Imag = 'Imag';\nexport type ImagInputs = Pick<NamedTensorInfoMap, 'input'>;\n\nexport const IsFinite = 'IsFinite';\nexport type IsFiniteInputs = UnaryInputs;\n\nexport const IsInf = 'IsInf';\nexport type IsInfInputs = UnaryInputs;\n\nexport const IsNan = 'IsNan';\nexport type IsNanInputs = UnaryInputs;\n\nexport const LeakyRelu = 'LeakyRelu';\nexport type LeakyReluInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface LeakyReluAttrs {\n  alpha: number;\n}\n\nexport const Less = 'Less';\nexport type LessInputs = BinaryInputs;\n\nexport const LessEqual = 'LessEqual';\nexport type LessEqualInputs = BinaryInputs;\n\nexport const LinSpace = 'LinSpace';\nexport interface LinSpaceAttrs {\n  start: number;\n  stop: number;\n  num: number;\n}\nexport const Log = 'Log';\nexport type LogInputs = UnaryInputs;\n\nexport const Log1p = 'Log1p';\nexport type Log1pInputs = UnaryInputs;\n\nexport const LogicalAnd = 'LogicalAnd';\nexport type LogicalAndInputs = BinaryInputs;\n\nexport const LogicalNot = 'LogicalNot';\nexport type LogicalNotInputs = Pick<NamedTensorInfoMap, 'x'>;\n\nexport const LogicalOr = 'LogicalOr';\nexport type LogicalOrInputs = BinaryInputs;\n\nexport const LogicalXor = 'LogicalXor';\nexport type LogicalXorInputs = BinaryInputs;\n\nexport const LogSoftmax = 'LogSoftmax';\nexport type LogSoftmaxInputs = Pick<NamedTensorInfoMap, 'logits'>;\nexport interface LogSoftmaxAttrs {\n  axis: number;\n}\n\nexport const LowerBound = 'LowerBound';\nexport type LowerBoundInputs =\n    Pick<NamedTensorInfoMap, 'sortedSequence'|'values'>;\n\nexport const LRN = 'LRN';\nexport type LRNInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface LRNAttrs {\n  depthRadius: number;\n  bias: number;\n  alpha: number;\n  beta: number;\n}\n\nexport const LRNGrad = 'LRNGrad';\nexport type LRNGradInputs = Pick<NamedTensorInfoMap, 'x'|'y'|'dy'>;\nexport interface LRNGradAttrs {\n  depthRadius: number;\n  bias: number;\n  alpha: number;\n  beta: number;\n}\n\nexport const MatrixBandPart = 'MatrixBandPart';\nexport type MatrixBandPartInputs =\n    Pick<NamedTensorInfoMap, 'input'|'numLower'|'numUpper'>;\nexport interface MatrixBandPartAttrs {}\n\nexport const Max = 'Max';\nexport type MaxInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface MaxAttrs {\n  reductionIndices: number|number[];\n  keepDims: boolean;\n}\n\nexport const Maximum = 'Maximum';\nexport type MaximumInputs = BinaryInputs;\n\nexport const MaxPool = 'MaxPool';\nexport type MaxPoolInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface MaxPoolAttrs {\n  filterSize: [number, number]|number;\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n}\n\nexport const MaxPoolGrad = 'MaxPoolGrad';\nexport type MaxPoolGradInputs = Pick<NamedTensorInfoMap, 'dy'|'input'|'output'>;\nexport interface MaxPoolGradAttrs {\n  filterSize: [number, number]|number;\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n}\n\nexport const MaxPool3D = 'MaxPool3D';\nexport type MaxPool3DInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface MaxPool3DAttrs {\n  filterSize: [number, number, number]|number;\n  strides: [number, number, number]|number;\n  pad: 'valid'|'same'|number;\n  dataFormat: 'NDHWC'|'NCDHW';\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n}\n\nexport const MaxPool3DGrad = 'MaxPool3DGrad';\nexport type MaxPool3DGradInputs =\n    Pick<NamedTensorInfoMap, 'dy'|'input'|'output'>;\nexport interface MaxPool3DGradAttrs {\n  filterSize: [number, number, number]|number;\n  strides: [number, number, number]|number;\n  pad: 'valid'|'same'|number;\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n}\n\nexport const MaxPoolWithArgmax = 'MaxPoolWithArgmax';\nexport type MaxPoolWithArgmaxInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface MaxPoolWithArgmaxAttrs {\n  filterSize: [number, number]|number;\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number;\n  includeBatchInIndex: boolean;\n}\n\nexport const Mean = 'Mean';\nexport type MeanInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface MeanAttrs {\n  axis: number|number[];\n  keepDims: boolean;\n}\n\nexport const Min = 'Min';\nexport type MinInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface MinAttrs {\n  axis: number|number[];\n  keepDims: boolean;\n}\n\nexport const Minimum = 'Minimum';\nexport type MinimumInputs = BinaryInputs;\n\nexport const MirrorPad = 'MirrorPad';\nexport type MirrorPadInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface MirrorPadAttrs {\n  paddings: Array<[number, number]>;\n  mode: 'reflect'|'symmetric';\n}\n\nexport const Mod = 'Mod';\nexport type ModInputs = BinaryInputs;\n\nexport const Multinomial = 'Multinomial';\nexport type MultinomialInputs = Pick<NamedTensorInfoMap, 'logits'>;\nexport interface MultinomialAttrs {\n  numSamples: number;\n  seed: number;\n  normalized: boolean;\n}\n\nexport const Multiply = 'Multiply';\nexport type MultiplyInputs = BinaryInputs;\n\nexport const Neg = 'Neg';\nexport type NegInputs = UnaryInputs;\n\nexport const NotEqual = 'NotEqual';\nexport type NotEqualInputs = BinaryInputs;\n\nexport const NonMaxSuppressionV3 = 'NonMaxSuppressionV3';\nexport type NonMaxSuppressionV3Inputs =\n    Pick<NamedTensorInfoMap, 'boxes'|'scores'>;\nexport interface NonMaxSuppressionV3Attrs {\n  maxOutputSize: number;\n  iouThreshold: number;\n  scoreThreshold: number;\n}\n\nexport const NonMaxSuppressionV4 = 'NonMaxSuppressionV4';\nexport type NonMaxSuppressionV4Inputs =\n    Pick<NamedTensorInfoMap, 'boxes'|'scores'>;\nexport interface NonMaxSuppressionV4Attrs {\n  maxOutputSize: number;\n  iouThreshold: number;\n  scoreThreshold: number;\n  padToMaxOutputSize: boolean;\n}\n\nexport const NonMaxSuppressionV5 = 'NonMaxSuppressionV5';\nexport type NonMaxSuppressionV5Inputs =\n    Pick<NamedTensorInfoMap, 'boxes'|'scores'>;\nexport interface NonMaxSuppressionV5Attrs {\n  maxOutputSize: number;\n  iouThreshold: number;\n  scoreThreshold: number;\n  softNmsSigma: number;\n}\n\nexport const OnesLike = 'OnesLike';\nexport type OnesLikeInputs = UnaryInputs;\n\nexport const OneHot = 'OneHot';\nexport type OneHotInputs = Pick<NamedTensorInfoMap, 'indices'>;\nexport interface OneHotAttrs {\n  depth: number;\n  onValue: number;\n  offValue: number;\n  dtype: DataType;\n}\n\nexport const Pack = 'Pack';\nexport type PackInputs = TensorInfo[];\nexport interface PackAttrs {\n  axis: number;\n}\n\nexport const PadV2 = 'PadV2';\nexport type PadV2Inputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface PadV2Attrs {\n  paddings: Array<[number, number]>;\n  constantValue: number;\n}\n\nexport const Pool = 'Pool';\nexport type PoolInputs = Pick<NamedTensorInfoMap, 'input'>;\n\nexport const Pow = 'Pow';\nexport type PowInputs = BinaryInputs;\n\nexport const Prelu = 'Prelu';\nexport type PreluInputs = Pick<NamedTensorInfoMap, 'x'|'alpha'>;\n\nexport const Prod = 'Prod';\nexport type ProdInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface ProdAttrs {\n  axis: number|number[];\n  keepDims: boolean;\n}\n\nexport const RaggedGather = 'RaggedGather';\nexport type RaggedGatherInputs = {\n  paramsNestedSplits: TensorInfo[]\n}&Pick<NamedTensorInfoMap, 'paramsDenseValues'|'indices'>;\nexport interface RaggedGatherAttrs {\n  outputRaggedRank: number;\n}\n\nexport const RaggedRange = 'RaggedRange';\nexport type RaggedRangeInputs =\n    Pick<NamedTensorInfoMap, 'starts'|'limits'|'deltas'>;\n\nexport const RaggedTensorToTensor = 'RaggedTensorToTensor';\nexport type RaggedTensorToTensorInputs =\n    Pick<NamedTensorInfoMap, 'shape'|'values'|'defaultValue'>&\n    {rowPartitionTensors: TensorInfo[]};\nexport interface RaggedTensorToTensorAttrs {\n  rowPartitionTypes: string[];\n}\n\nexport const Range = 'Range';\nexport interface RangeAttrs {\n  start: number;\n  stop: number;\n  step: number;\n  dtype: 'float32'|'int32';\n}\n\nexport const Real = 'Real';\nexport type RealInputs = Pick<NamedTensorInfoMap, 'input'>;\n\nexport const Reciprocal = 'Reciprocal';\nexport type ReciprocalInputs = UnaryInputs;\n\nexport const Relu = 'Relu';\nexport type ReluInputs = Pick<NamedTensorInfoMap, 'x'>;\n\nexport const Reshape = 'Reshape';\nexport type ReshapeInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface ReshapeAttrs {\n  shape: number[];\n}\n\nexport const ResizeNearestNeighbor = 'ResizeNearestNeighbor';\nexport type ResizeNearestNeighborInputs = Pick<NamedTensorInfoMap, 'images'>;\nexport interface ResizeNearestNeighborAttrs {\n  alignCorners: boolean;\n  halfPixelCenters: boolean;\n  size: [number, number];\n}\n\nexport const ResizeNearestNeighborGrad = 'ResizeNearestNeighborGrad';\nexport type ResizeNearestNeighborGradInputs =\n    Pick<NamedTensorInfoMap, 'images'|'dy'>;\nexport type ResizeNearestNeighborGradAttrs = ResizeNearestNeighborAttrs;\n\nexport const ResizeBilinear = 'ResizeBilinear';\nexport type ResizeBilinearInputs = Pick<NamedTensorInfoMap, 'images'>;\nexport interface ResizeBilinearAttrs {\n  alignCorners: boolean;\n  halfPixelCenters: boolean;\n  size: [number, number];\n}\n\nexport const ResizeBilinearGrad = 'ResizeBilinearGrad';\nexport type ResizeBilinearGradInputs = Pick<NamedTensorInfoMap, 'images'|'dy'>;\nexport type ResizeBilinearGradAttrs = ResizeBilinearAttrs;\n\nexport const Relu6 = 'Relu6';\nexport type Relu6Inputs = Pick<NamedTensorInfoMap, 'x'>;\n\nexport const Reverse = 'Reverse';\nexport type ReverseInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface ReverseAttrs {\n  dims: number|number[];\n}\n\nexport const Round = 'Round';\nexport type RoundInputs = UnaryInputs;\n\nexport const Rsqrt = 'Rsqrt';\nexport type RsqrtInputs = UnaryInputs;\n\nexport const ScatterNd = 'ScatterNd';\nexport type ScatterNdInputs = Pick<NamedTensorInfoMap, 'indices'|'updates'>;\nexport interface ScatterNdAttrs {\n  shape: number[];\n}\n\nexport const TensorScatterUpdate = 'TensorScatterUpdate';\nexport type TensorScatterUpdateInputs =\n    Pick<NamedTensorInfoMap, 'tensor'|'indices'|'updates'>;\nexport interface TensorScatterUpdateAttrs {}\n\nexport const SearchSorted = 'SearchSorted';\nexport type SearchSortedInputs =\n    Pick<NamedTensorInfoMap, 'sortedSequence'|'values'>;\nexport interface SearchSortedAttrs {\n  side: 'left'|'right';\n}\n\nexport const Select = 'Select';\nexport type SelectInputs = Pick<NamedTensorInfoMap, 'condition'|'t'|'e'>;\n\nexport const Selu = 'Selu';\nexport type SeluInputs = Pick<NamedTensorInfoMap, 'x'>;\n\nexport const Slice = 'Slice';\nexport type SliceInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface SliceAttrs {\n  begin: number|number[];\n  size: number|number[];\n}\nexport const Sin = 'Sin';\nexport type SinInputs = UnaryInputs;\n\nexport const Sinh = 'Sinh';\nexport type SinhInputs = UnaryInputs;\n\nexport const Sign = 'Sign';\nexport type SignInputs = UnaryInputs;\n\nexport const Sigmoid = 'Sigmoid';\nexport type SigmoidInputs = UnaryInputs;\n\nexport const Softplus = 'Softplus';\nexport type SoftplusInputs = UnaryInputs;\n\nexport const Sqrt = 'Sqrt';\nexport type SqrtInputs = UnaryInputs;\n\nexport const Sum = 'Sum';\nexport type SumInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface SumAttrs {\n  axis: number|number[];\n  keepDims: boolean;\n}\n\nexport const SpaceToBatchND = 'SpaceToBatchND';\nexport type SpaceToBatchNDInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface SpaceToBatchNDAttrs {\n  blockShape: number[];\n  paddings: number[][];\n}\n\nexport const SplitV = 'SplitV';\nexport type SplitVInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface SplitVAttrs {\n  numOrSizeSplits: number[]|number;\n  axis: number;\n}\n\nexport const Softmax = 'Softmax';\nexport type SoftmaxInputs = Pick<NamedTensorInfoMap, 'logits'>;\nexport interface SoftmaxAttrs {\n  dim: number;\n}\n\nexport const SparseFillEmptyRows = 'SparseFillEmptyRows';\nexport type SparseFillEmptyRowsInputs =\n    Pick<NamedTensorInfoMap, 'indices'|'values'|'denseShape'|'defaultValue'>;\n\nexport const SparseReshape = 'SparseReshape';\nexport type SparseReshapeInputs =\n    Pick<NamedTensorInfoMap, 'inputIndices'|'inputShape'|'newShape'>;\n\nexport const SparseSegmentMean = 'SparseSegmentMean';\nexport type SparseSegmentMeanInputs =\n    Pick<NamedTensorInfoMap, 'data'|'indices'|'segmentIds'>;\n\nexport const SparseSegmentSum = 'SparseSegmentSum';\nexport type SparseSegmentSumInputs =\n    Pick<NamedTensorInfoMap, 'data'|'indices'|'segmentIds'>;\n\nexport const SparseToDense = 'SparseToDense';\nexport type SparseToDenseInputs =\n    Pick<NamedTensorInfoMap, 'sparseIndices'|'sparseValues'|'defaultValue'>;\nexport interface SparseToDenseAttrs {\n  outputShape: number[];\n}\n\nexport const SquaredDifference = 'SquaredDifference';\nexport type SquaredDifferenceInputs = BinaryInputs;\n\nexport const Square = 'Square';\nexport type SquareInputs = Pick<NamedTensorInfoMap, 'x'>;\n\nexport const StaticRegexReplace = 'StaticRegexReplace';\nexport type StaticRegexReplaceInputs = UnaryInputs;\nexport interface StaticRegexReplaceAttrs {\n  pattern: string;\n  rewrite: string;\n  replaceGlobal: boolean;\n}\n\nexport const StridedSlice = 'StridedSlice';\nexport type StridedSliceInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface StridedSliceAttrs {\n  begin: number[];\n  end: number[];\n  strides: number[];\n  beginMask: number;\n  endMask: number;\n  ellipsisMask: number;\n  newAxisMask: number;\n  shrinkAxisMask: number;\n}\n\nexport const StringNGrams = 'StringNGrams';\nexport type StringNGramsInputs = Pick<NamedTensorInfoMap, 'data'|'dataSplits'>;\nexport interface StringNGramsAttrs {\n  separator: string;\n  nGramWidths: number[];\n  leftPad: string;\n  rightPad: string;\n  padWidth: number;\n  preserveShortSequences: boolean;\n}\n\nexport const StringSplit = 'StringSplit';\nexport type StringSplitInputs = Pick<NamedTensorInfoMap, 'input'|'delimiter'>;\nexport interface StringSplitAttrs {\n  skipEmpty: boolean;\n}\n\nexport const StringToHashBucketFast = 'StringToHashBucketFast';\nexport type StringToHashBucketFastInputs = Pick<NamedTensorInfoMap, 'input'>;\nexport interface StringToHashBucketFastAttrs {\n  numBuckets: number;\n}\n\nexport const Sub = 'Sub';\nexport type SubInputs = BinaryInputs;\n\nexport const Tan = 'Tan';\nexport type TanInputs = UnaryInputs;\n\nexport const Tanh = 'Tanh';\nexport type TanhInputs = UnaryInputs;\n\nexport const Tile = 'Tile';\nexport type TileInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface TileAttrs {\n  reps: number[];\n}\n\nexport const TopK = 'TopK';\nexport type TopKInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface TopKAttrs {\n  k: number;\n  sorted: boolean;\n}\n\nexport const Transform = 'Transform';\nexport type TransformInputs = Pick<NamedTensorInfoMap, 'image'|'transforms'>;\nexport interface TransformAttrs {\n  interpolation: 'nearest'|'bilinear';\n  fillMode: 'constant'|'reflect'|'wrap'|'nearest';\n  fillValue: number;\n  outputShape?: [number, number];\n}\n\nexport const Transpose = 'Transpose';\nexport type TransposeInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface TransposeAttrs {\n  perm: number[];\n}\n\nexport const Unique = 'Unique';\nexport type UniqueInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface UniqueAttrs {\n  axis: number;\n}\n\nexport type UnaryInputs = Pick<NamedTensorInfoMap, 'x'>;\n\nexport const Unpack = 'Unpack';\nexport type UnpackInputs = Pick<NamedTensorInfoMap, 'value'>;\nexport interface UnpackAttrs {\n  axis: number;\n}\n\nexport const UnsortedSegmentSum = 'UnsortedSegmentSum';\nexport type UnsortedSegmentSumInputs =\n    Pick<NamedTensorInfoMap, 'x'|'segmentIds'>;\nexport interface UnsortedSegmentSumAttrs {\n  numSegments: number;\n}\n\nexport const UpperBound = 'UpperBound';\nexport type UpperBoundInputs =\n    Pick<NamedTensorInfoMap, 'sortedSequence'|'values'>;\n\nexport const ZerosLike = 'ZerosLike';\nexport type ZerosLikeInputs = UnaryInputs;\n\n/**\n * TensorFlow.js-only kernels\n */\nexport const Step = 'Step';\nexport type StepInputs = UnaryInputs;\nexport interface StepAttrs {\n  alpha: number;\n}\n\nexport const FromPixels = 'FromPixels';\nexport interface FromPixelsInputs {\n  pixels: PixelData|ImageData|HTMLImageElement|HTMLCanvasElement|\n      HTMLVideoElement|ImageBitmap;\n}\nexport interface FromPixelsAttrs {\n  numChannels: number;\n}\n\nexport const RotateWithOffset = 'RotateWithOffset';\nexport type RotateWithOffsetInputs = Pick<NamedTensorInfoMap, 'image'>;\nexport interface RotateWithOffsetAttrs {\n  radians: number;\n  fillValue: number|[number, number, number];\n  center: number|[number, number];\n}\n\nexport const _FusedMatMul = '_FusedMatMul';\n// tslint:disable-next-line: class-name\nexport interface _FusedMatMulInputs extends NamedTensorInfoMap {\n  a: TensorInfo;\n  b: TensorInfo;\n  bias?: TensorInfo;\n  preluActivationWeights?: TensorInfo;\n}\n// tslint:disable-next-line: class-name\nexport interface _FusedMatMulAttrs {\n  transposeA: boolean;\n  transposeB: boolean;\n  activation: Activation;\n  leakyreluAlpha?: number;\n}\n\nexport const FusedConv2D = 'FusedConv2D';\nexport interface FusedConv2DInputs extends NamedTensorInfoMap {\n  x: TensorInfo;\n  filter: TensorInfo;\n  bias?: TensorInfo;\n  preluActivationWeights?: TensorInfo;\n}\nexport interface FusedConv2DAttrs {\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dataFormat: 'NHWC'|'NCHW';\n  dilations: [number, number]|number;\n  dimRoundingMode: 'floor'|'round'|'ceil';\n  activation: Activation;\n  leakyreluAlpha?: number;\n}\n\nexport const FusedDepthwiseConv2D = 'FusedDepthwiseConv2D';\nexport interface FusedDepthwiseConv2DInputs extends NamedTensorInfoMap {\n  x: TensorInfo;\n  filter: TensorInfo;\n  bias?: TensorInfo;\n  preluActivationWeights?: TensorInfo;\n}\nexport interface FusedDepthwiseConv2DAttrs {\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dataFormat: 'NHWC'|'NCHW';\n  dilations: [number, number]|number;\n  dimRoundingMode: 'floor'|'round'|'ceil';\n  activation: Activation;\n  leakyreluAlpha?: number;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {env} from './environment';\n\nexport function warn(...msg: Array<{}>): void {\n  if (!(env().getBool('IS_TEST') || env().getBool('PROD'))) {\n    console.warn(...msg);\n  }\n}\n\nexport function log(...msg: Array<{}>): void {\n  if (!(env().getBool('IS_TEST') || env().getBool('PROD'))) {\n    console.log(...msg);\n  }\n}\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {env} from './environment';\nimport {getGlobal} from './global_util';\nimport * as log from './log';\nimport {NamedGradientMap} from './tape';\nimport {Tensor} from './tensor';\nimport {TensorInfo} from './tensor_info';\nimport {RecursiveArray} from './types';\n\nconst kernelRegistry =\n  getGlobal('kernelRegistry', () => new Map<`${string}_${string}`,\n    KernelConfig>());\nconst gradRegistry =\n  getGlobal('gradRegistry', () => new Map<string, GradConfig>());\n\ntype AttributeValue =\n  number | number[] | boolean | boolean[] | string | string[] | NamedAttrMap;\n\n/** These are extra non-tensor/primitive params passed to kernel functions. */\nexport type Attribute = AttributeValue | RecursiveArray<AttributeValue>;\n\n/** Specifies the code to run when executing a kernel. */\nexport type KernelFunc = (params: {\n  inputs: NamedTensorInfoMap,\n  backend: {},\n  attrs?: NamedAttrMap,\n}) => TensorInfo | TensorInfo[];\n\n/** The function to run when computing a gradient during backprop. */\nexport type GradFunc =\n  (dy: Tensor | Tensor[], saved: Tensor[], attrs: NamedAttrMap) =>\n    NamedGradientMap;\n\n/** Function that gets called after the backend initializes. */\nexport type KernelSetupFunc = (backend: {}) => void;\n/** Function that gets called right before the backend is disposed. */\nexport type KernelDisposeFunc = KernelSetupFunc;\n\n/** Config object for registering a kernel in the global registry. */\nexport interface KernelConfig {\n  kernelName: string;\n  backendName: string;\n  kernelFunc: KernelFunc;\n  setupFunc?: KernelSetupFunc;\n  disposeFunc?: KernelDisposeFunc;\n}\n\n/** Config object for registering a gradient in the global registry. */\nexport interface GradConfig {\n  kernelName: string;\n  inputsToSave?: string[];\n  // When saveAllInputs is true, all inputs will be saved. Only use this flag\n  // if inputs is an array of Tensors.\n  saveAllInputs?: boolean;\n  outputsToSave?: boolean[];\n  gradFunc: GradFunc;\n}\n\nexport interface NamedTensorInfoMap {\n  [name: string]: TensorInfo|undefined;\n}\n\nexport interface NamedAttrMap {\n  [name: string]: Attribute;\n}\n\n/**\n * Returns the kernel function (code) associated with the provided names.\n *\n * @param kernelName The official name of the kernel.\n * @param backendName The official name of the backend.\n */\nexport function getKernel(\n    kernelName: string, backendName: string): KernelConfig {\n  const key = makeKey(kernelName, backendName);\n  return kernelRegistry.get(key);\n}\n\n/**\n * Returns the registered gradient info associated with the provided kernel.\n * @param kernelName The official TF kernel name.\n */\nexport function getGradient(kernelName: string): GradConfig {\n  return gradRegistry.get(kernelName);\n}\n\nexport function getKernelsForBackend(backendName: string): KernelConfig[] {\n  const it = kernelRegistry.entries();\n  const result: KernelConfig[] = [];\n\n  while (true) {\n    const {done, value} = it.next();\n    if (done) {\n      break;\n    }\n    const [key, config] = value;\n    const [backend, ] = key.split('_');\n    if (backend === backendName) {\n      result.push(config);\n    }\n  }\n  return result;\n}\n\n/**\n * Registers the function (forward pass) for the kernel in a global registry.\n *\n * @param config A config object with the following properties:\n * - `kernelName` The official name of the kernel.\n * - `backendName` The official name of the backend.\n * - `kernelFunc` The function to run during the forward pass of the kernel.\n * - `setupFunc` Optional. Gets called once, after the backend initializes.\n * - `disposeFunc` Optional. Gets called once, right before the backend is\n * disposed.\n */\nexport function registerKernel(config: KernelConfig) {\n  const {kernelName, backendName} = config;\n  const key = makeKey(kernelName, backendName);\n  if (kernelRegistry.has(key)) {\n    log.warn(\n        `The kernel '${kernelName}' for backend ` +\n        `'${backendName}' is already registered`);\n  }\n  kernelRegistry.set(key, config);\n}\n\n/**\n * Registers a gradient function for a given kernel in the global registry,\n * to be used during the back-propagation of that kernel.\n *\n * @param config An object with the following properties:\n * - `kernelName` The name of the kernel that the gradient function is for.\n * - `gradFunc` The function to run during back-propagation.\n */\nexport function registerGradient(config: GradConfig) {\n  const {kernelName} = config;\n\n  if (gradRegistry.has(kernelName)) {\n    // TODO (yassogba) after 3.0 assess whether we need to keep this gated\n    // to debug mode.\n    if (env().getBool('DEBUG')) {\n      log.warn(`Overriding the gradient for '${kernelName}'`);\n    }\n  }\n  gradRegistry.set(kernelName, config);\n}\n\n/**\n * Removes the kernel function from the registry.\n *\n * @param kernelName The official name of the kernel.\n * @param backendName The official name of the backend.\n *\n */\nexport function unregisterKernel(\n    kernelName: string, backendName: string): void {\n  const key = makeKey(kernelName, backendName);\n  if (!kernelRegistry.has(key)) {\n    throw new Error(\n        `The kernel '${kernelName}' for backend ` +\n        `'${backendName}' is not registered`);\n  }\n  kernelRegistry.delete(key);\n}\n\n/** Removes the registered gradient from the global registry. */\nexport function unregisterGradient(kernelName: string): void {\n  if (!gradRegistry.has(kernelName)) {\n    throw new Error(\n        `The gradient '${kernelName}' for backend is not registered`);\n  }\n  gradRegistry.delete(kernelName);\n}\n\n/**\n * Finds kernels that have already been registered to a backend and re-registers\n * them for a new backend. Useful for registering custom backends.\n * @param registeredBackendName Already registered backend.\n * @param newBackendName New backend.\n */\nexport function copyRegisteredKernels(\n    registeredBackendName: string, newBackendName: string): void {\n  const kernels = getKernelsForBackend(registeredBackendName);\n  kernels.forEach(kernelConfig => {\n    const newKernelConfig =\n        Object.assign({}, kernelConfig, {backendName: newBackendName});\n    registerKernel(newKernelConfig);\n  });\n}\n\nfunction makeKey(kernelName: string,\n                 backendName: string): `${string}_${string}` {\n  return `${backendName}_${kernelName}`;\n}\n", "/**\n * @license\n * Copyright 2023 Google LLC.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nexport function isTypedArrayBrowser(a: unknown): a is Uint8Array\n  | Float32Array | Int32Array | Uint8ClampedArray {\n  return a instanceof Float32Array || a instanceof Int32Array ||\n    a instanceof Uint8Array || a instanceof Uint8ClampedArray;\n}\n", "module.exports = Long;\r\n\r\n/**\r\n * wasm optimizations, to do native i64 multiplication and divide\r\n */\r\nvar wasm = null;\r\n\r\ntry {\r\n  wasm = new WebAssembly.Instance(new WebAssembly.Module(new Uint8Array([\r\n    0, 97, 115, 109, 1, 0, 0, 0, 1, 13, 2, 96, 0, 1, 127, 96, 4, 127, 127, 127, 127, 1, 127, 3, 7, 6, 0, 1, 1, 1, 1, 1, 6, 6, 1, 127, 1, 65, 0, 11, 7, 50, 6, 3, 109, 117, 108, 0, 1, 5, 100, 105, 118, 95, 115, 0, 2, 5, 100, 105, 118, 95, 117, 0, 3, 5, 114, 101, 109, 95, 115, 0, 4, 5, 114, 101, 109, 95, 117, 0, 5, 8, 103, 101, 116, 95, 104, 105, 103, 104, 0, 0, 10, 191, 1, 6, 4, 0, 35, 0, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 126, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 127, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 128, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 129, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 130, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11\r\n  ])), {}).exports;\r\n} catch (e) {\r\n  // no wasm support :(\r\n}\r\n\r\n/**\r\n * Constructs a 64 bit two's-complement integer, given its low and high 32 bit values as *signed* integers.\r\n *  See the from* functions below for more convenient ways of constructing Longs.\r\n * @exports Long\r\n * @class A Long class for representing a 64 bit two's-complement integer value.\r\n * @param {number} low The low (signed) 32 bits of the long\r\n * @param {number} high The high (signed) 32 bits of the long\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @constructor\r\n */\r\nfunction Long(low, high, unsigned) {\r\n\r\n    /**\r\n     * The low 32 bits as a signed value.\r\n     * @type {number}\r\n     */\r\n    this.low = low | 0;\r\n\r\n    /**\r\n     * The high 32 bits as a signed value.\r\n     * @type {number}\r\n     */\r\n    this.high = high | 0;\r\n\r\n    /**\r\n     * Whether unsigned or not.\r\n     * @type {boolean}\r\n     */\r\n    this.unsigned = !!unsigned;\r\n}\r\n\r\n// The internal representation of a long is the two given signed, 32-bit values.\r\n// We use 32-bit pieces because these are the size of integers on which\r\n// Javascript performs bit-operations.  For operations like addition and\r\n// multiplication, we split each number into 16 bit pieces, which can easily be\r\n// multiplied within Javascript's floating-point representation without overflow\r\n// or change in sign.\r\n//\r\n// In the algorithms below, we frequently reduce the negative case to the\r\n// positive case by negating the input(s) and then post-processing the result.\r\n// Note that we must ALWAYS check specially whether those values are MIN_VALUE\r\n// (-2^63) because -MIN_VALUE == MIN_VALUE (since 2^63 cannot be represented as\r\n// a positive number, it overflows back into a negative).  Not handling this\r\n// case would often result in infinite recursion.\r\n//\r\n// Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the from*\r\n// methods on which they depend.\r\n\r\n/**\r\n * An indicator used to reliably determine if an object is a Long or not.\r\n * @type {boolean}\r\n * @const\r\n * @private\r\n */\r\nLong.prototype.__isLong__;\r\n\r\nObject.defineProperty(Long.prototype, \"__isLong__\", { value: true });\r\n\r\n/**\r\n * @function\r\n * @param {*} obj Object\r\n * @returns {boolean}\r\n * @inner\r\n */\r\nfunction isLong(obj) {\r\n    return (obj && obj[\"__isLong__\"]) === true;\r\n}\r\n\r\n/**\r\n * Tests if the specified object is a Long.\r\n * @function\r\n * @param {*} obj Object\r\n * @returns {boolean}\r\n */\r\nLong.isLong = isLong;\r\n\r\n/**\r\n * A cache of the Long representations of small integer values.\r\n * @type {!Object}\r\n * @inner\r\n */\r\nvar INT_CACHE = {};\r\n\r\n/**\r\n * A cache of the Long representations of small unsigned integer values.\r\n * @type {!Object}\r\n * @inner\r\n */\r\nvar UINT_CACHE = {};\r\n\r\n/**\r\n * @param {number} value\r\n * @param {boolean=} unsigned\r\n * @returns {!Long}\r\n * @inner\r\n */\r\nfunction fromInt(value, unsigned) {\r\n    var obj, cachedObj, cache;\r\n    if (unsigned) {\r\n        value >>>= 0;\r\n        if (cache = (0 <= value && value < 256)) {\r\n            cachedObj = UINT_CACHE[value];\r\n            if (cachedObj)\r\n                return cachedObj;\r\n        }\r\n        obj = fromBits(value, (value | 0) < 0 ? -1 : 0, true);\r\n        if (cache)\r\n            UINT_CACHE[value] = obj;\r\n        return obj;\r\n    } else {\r\n        value |= 0;\r\n        if (cache = (-128 <= value && value < 128)) {\r\n            cachedObj = INT_CACHE[value];\r\n            if (cachedObj)\r\n                return cachedObj;\r\n        }\r\n        obj = fromBits(value, value < 0 ? -1 : 0, false);\r\n        if (cache)\r\n            INT_CACHE[value] = obj;\r\n        return obj;\r\n    }\r\n}\r\n\r\n/**\r\n * Returns a Long representing the given 32 bit integer value.\r\n * @function\r\n * @param {number} value The 32 bit integer in question\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @returns {!Long} The corresponding Long value\r\n */\r\nLong.fromInt = fromInt;\r\n\r\n/**\r\n * @param {number} value\r\n * @param {boolean=} unsigned\r\n * @returns {!Long}\r\n * @inner\r\n */\r\nfunction fromNumber(value, unsigned) {\r\n    if (isNaN(value))\r\n        return unsigned ? UZERO : ZERO;\r\n    if (unsigned) {\r\n        if (value < 0)\r\n            return UZERO;\r\n        if (value >= TWO_PWR_64_DBL)\r\n            return MAX_UNSIGNED_VALUE;\r\n    } else {\r\n        if (value <= -TWO_PWR_63_DBL)\r\n            return MIN_VALUE;\r\n        if (value + 1 >= TWO_PWR_63_DBL)\r\n            return MAX_VALUE;\r\n    }\r\n    if (value < 0)\r\n        return fromNumber(-value, unsigned).neg();\r\n    return fromBits((value % TWO_PWR_32_DBL) | 0, (value / TWO_PWR_32_DBL) | 0, unsigned);\r\n}\r\n\r\n/**\r\n * Returns a Long representing the given value, provided that it is a finite number. Otherwise, zero is returned.\r\n * @function\r\n * @param {number} value The number in question\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @returns {!Long} The corresponding Long value\r\n */\r\nLong.fromNumber = fromNumber;\r\n\r\n/**\r\n * @param {number} lowBits\r\n * @param {number} highBits\r\n * @param {boolean=} unsigned\r\n * @returns {!Long}\r\n * @inner\r\n */\r\nfunction fromBits(lowBits, highBits, unsigned) {\r\n    return new Long(lowBits, highBits, unsigned);\r\n}\r\n\r\n/**\r\n * Returns a Long representing the 64 bit integer that comes by concatenating the given low and high bits. Each is\r\n *  assumed to use 32 bits.\r\n * @function\r\n * @param {number} lowBits The low 32 bits\r\n * @param {number} highBits The high 32 bits\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @returns {!Long} The corresponding Long value\r\n */\r\nLong.fromBits = fromBits;\r\n\r\n/**\r\n * @function\r\n * @param {number} base\r\n * @param {number} exponent\r\n * @returns {number}\r\n * @inner\r\n */\r\nvar pow_dbl = Math.pow; // Used 4 times (4*8 to 15+4)\r\n\r\n/**\r\n * @param {string} str\r\n * @param {(boolean|number)=} unsigned\r\n * @param {number=} radix\r\n * @returns {!Long}\r\n * @inner\r\n */\r\nfunction fromString(str, unsigned, radix) {\r\n    if (str.length === 0)\r\n        throw Error('empty string');\r\n    if (str === \"NaN\" || str === \"Infinity\" || str === \"+Infinity\" || str === \"-Infinity\")\r\n        return ZERO;\r\n    if (typeof unsigned === 'number') {\r\n        // For goog.math.long compatibility\r\n        radix = unsigned,\r\n        unsigned = false;\r\n    } else {\r\n        unsigned = !! unsigned;\r\n    }\r\n    radix = radix || 10;\r\n    if (radix < 2 || 36 < radix)\r\n        throw RangeError('radix');\r\n\r\n    var p;\r\n    if ((p = str.indexOf('-')) > 0)\r\n        throw Error('interior hyphen');\r\n    else if (p === 0) {\r\n        return fromString(str.substring(1), unsigned, radix).neg();\r\n    }\r\n\r\n    // Do several (8) digits each time through the loop, so as to\r\n    // minimize the calls to the very expensive emulated div.\r\n    var radixToPower = fromNumber(pow_dbl(radix, 8));\r\n\r\n    var result = ZERO;\r\n    for (var i = 0; i < str.length; i += 8) {\r\n        var size = Math.min(8, str.length - i),\r\n            value = parseInt(str.substring(i, i + size), radix);\r\n        if (size < 8) {\r\n            var power = fromNumber(pow_dbl(radix, size));\r\n            result = result.mul(power).add(fromNumber(value));\r\n        } else {\r\n            result = result.mul(radixToPower);\r\n            result = result.add(fromNumber(value));\r\n        }\r\n    }\r\n    result.unsigned = unsigned;\r\n    return result;\r\n}\r\n\r\n/**\r\n * Returns a Long representation of the given string, written using the specified radix.\r\n * @function\r\n * @param {string} str The textual representation of the Long\r\n * @param {(boolean|number)=} unsigned Whether unsigned or not, defaults to signed\r\n * @param {number=} radix The radix in which the text is written (2-36), defaults to 10\r\n * @returns {!Long} The corresponding Long value\r\n */\r\nLong.fromString = fromString;\r\n\r\n/**\r\n * @function\r\n * @param {!Long|number|string|!{low: number, high: number, unsigned: boolean}} val\r\n * @param {boolean=} unsigned\r\n * @returns {!Long}\r\n * @inner\r\n */\r\nfunction fromValue(val, unsigned) {\r\n    if (typeof val === 'number')\r\n        return fromNumber(val, unsigned);\r\n    if (typeof val === 'string')\r\n        return fromString(val, unsigned);\r\n    // Throws for non-objects, converts non-instanceof Long:\r\n    return fromBits(val.low, val.high, typeof unsigned === 'boolean' ? unsigned : val.unsigned);\r\n}\r\n\r\n/**\r\n * Converts the specified value to a Long using the appropriate from* function for its type.\r\n * @function\r\n * @param {!Long|number|string|!{low: number, high: number, unsigned: boolean}} val Value\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @returns {!Long}\r\n */\r\nLong.fromValue = fromValue;\r\n\r\n// NOTE: the compiler should inline these constant values below and then remove these variables, so there should be\r\n// no runtime penalty for these.\r\n\r\n/**\r\n * @type {number}\r\n * @const\r\n * @inner\r\n */\r\nvar TWO_PWR_16_DBL = 1 << 16;\r\n\r\n/**\r\n * @type {number}\r\n * @const\r\n * @inner\r\n */\r\nvar TWO_PWR_24_DBL = 1 << 24;\r\n\r\n/**\r\n * @type {number}\r\n * @const\r\n * @inner\r\n */\r\nvar TWO_PWR_32_DBL = TWO_PWR_16_DBL * TWO_PWR_16_DBL;\r\n\r\n/**\r\n * @type {number}\r\n * @const\r\n * @inner\r\n */\r\nvar TWO_PWR_64_DBL = TWO_PWR_32_DBL * TWO_PWR_32_DBL;\r\n\r\n/**\r\n * @type {number}\r\n * @const\r\n * @inner\r\n */\r\nvar TWO_PWR_63_DBL = TWO_PWR_64_DBL / 2;\r\n\r\n/**\r\n * @type {!Long}\r\n * @const\r\n * @inner\r\n */\r\nvar TWO_PWR_24 = fromInt(TWO_PWR_24_DBL);\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar ZERO = fromInt(0);\r\n\r\n/**\r\n * Signed zero.\r\n * @type {!Long}\r\n */\r\nLong.ZERO = ZERO;\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar UZERO = fromInt(0, true);\r\n\r\n/**\r\n * Unsigned zero.\r\n * @type {!Long}\r\n */\r\nLong.UZERO = UZERO;\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar ONE = fromInt(1);\r\n\r\n/**\r\n * Signed one.\r\n * @type {!Long}\r\n */\r\nLong.ONE = ONE;\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar UONE = fromInt(1, true);\r\n\r\n/**\r\n * Unsigned one.\r\n * @type {!Long}\r\n */\r\nLong.UONE = UONE;\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar NEG_ONE = fromInt(-1);\r\n\r\n/**\r\n * Signed negative one.\r\n * @type {!Long}\r\n */\r\nLong.NEG_ONE = NEG_ONE;\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar MAX_VALUE = fromBits(0xFFFFFFFF|0, 0x7FFFFFFF|0, false);\r\n\r\n/**\r\n * Maximum signed value.\r\n * @type {!Long}\r\n */\r\nLong.MAX_VALUE = MAX_VALUE;\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar MAX_UNSIGNED_VALUE = fromBits(0xFFFFFFFF|0, 0xFFFFFFFF|0, true);\r\n\r\n/**\r\n * Maximum unsigned value.\r\n * @type {!Long}\r\n */\r\nLong.MAX_UNSIGNED_VALUE = MAX_UNSIGNED_VALUE;\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar MIN_VALUE = fromBits(0, 0x80000000|0, false);\r\n\r\n/**\r\n * Minimum signed value.\r\n * @type {!Long}\r\n */\r\nLong.MIN_VALUE = MIN_VALUE;\r\n\r\n/**\r\n * @alias Long.prototype\r\n * @inner\r\n */\r\nvar LongPrototype = Long.prototype;\r\n\r\n/**\r\n * Converts the Long to a 32 bit integer, assuming it is a 32 bit integer.\r\n * @returns {number}\r\n */\r\nLongPrototype.toInt = function toInt() {\r\n    return this.unsigned ? this.low >>> 0 : this.low;\r\n};\r\n\r\n/**\r\n * Converts the Long to a the nearest floating-point representation of this value (double, 53 bit mantissa).\r\n * @returns {number}\r\n */\r\nLongPrototype.toNumber = function toNumber() {\r\n    if (this.unsigned)\r\n        return ((this.high >>> 0) * TWO_PWR_32_DBL) + (this.low >>> 0);\r\n    return this.high * TWO_PWR_32_DBL + (this.low >>> 0);\r\n};\r\n\r\n/**\r\n * Converts the Long to a string written in the specified radix.\r\n * @param {number=} radix Radix (2-36), defaults to 10\r\n * @returns {string}\r\n * @override\r\n * @throws {RangeError} If `radix` is out of range\r\n */\r\nLongPrototype.toString = function toString(radix) {\r\n    radix = radix || 10;\r\n    if (radix < 2 || 36 < radix)\r\n        throw RangeError('radix');\r\n    if (this.isZero())\r\n        return '0';\r\n    if (this.isNegative()) { // Unsigned Longs are never negative\r\n        if (this.eq(MIN_VALUE)) {\r\n            // We need to change the Long value before it can be negated, so we remove\r\n            // the bottom-most digit in this base and then recurse to do the rest.\r\n            var radixLong = fromNumber(radix),\r\n                div = this.div(radixLong),\r\n                rem1 = div.mul(radixLong).sub(this);\r\n            return div.toString(radix) + rem1.toInt().toString(radix);\r\n        } else\r\n            return '-' + this.neg().toString(radix);\r\n    }\r\n\r\n    // Do several (6) digits each time through the loop, so as to\r\n    // minimize the calls to the very expensive emulated div.\r\n    var radixToPower = fromNumber(pow_dbl(radix, 6), this.unsigned),\r\n        rem = this;\r\n    var result = '';\r\n    while (true) {\r\n        var remDiv = rem.div(radixToPower),\r\n            intval = rem.sub(remDiv.mul(radixToPower)).toInt() >>> 0,\r\n            digits = intval.toString(radix);\r\n        rem = remDiv;\r\n        if (rem.isZero())\r\n            return digits + result;\r\n        else {\r\n            while (digits.length < 6)\r\n                digits = '0' + digits;\r\n            result = '' + digits + result;\r\n        }\r\n    }\r\n};\r\n\r\n/**\r\n * Gets the high 32 bits as a signed integer.\r\n * @returns {number} Signed high bits\r\n */\r\nLongPrototype.getHighBits = function getHighBits() {\r\n    return this.high;\r\n};\r\n\r\n/**\r\n * Gets the high 32 bits as an unsigned integer.\r\n * @returns {number} Unsigned high bits\r\n */\r\nLongPrototype.getHighBitsUnsigned = function getHighBitsUnsigned() {\r\n    return this.high >>> 0;\r\n};\r\n\r\n/**\r\n * Gets the low 32 bits as a signed integer.\r\n * @returns {number} Signed low bits\r\n */\r\nLongPrototype.getLowBits = function getLowBits() {\r\n    return this.low;\r\n};\r\n\r\n/**\r\n * Gets the low 32 bits as an unsigned integer.\r\n * @returns {number} Unsigned low bits\r\n */\r\nLongPrototype.getLowBitsUnsigned = function getLowBitsUnsigned() {\r\n    return this.low >>> 0;\r\n};\r\n\r\n/**\r\n * Gets the number of bits needed to represent the absolute value of this Long.\r\n * @returns {number}\r\n */\r\nLongPrototype.getNumBitsAbs = function getNumBitsAbs() {\r\n    if (this.isNegative()) // Unsigned Longs are never negative\r\n        return this.eq(MIN_VALUE) ? 64 : this.neg().getNumBitsAbs();\r\n    var val = this.high != 0 ? this.high : this.low;\r\n    for (var bit = 31; bit > 0; bit--)\r\n        if ((val & (1 << bit)) != 0)\r\n            break;\r\n    return this.high != 0 ? bit + 33 : bit + 1;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value equals zero.\r\n * @returns {boolean}\r\n */\r\nLongPrototype.isZero = function isZero() {\r\n    return this.high === 0 && this.low === 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value equals zero. This is an alias of {@link Long#isZero}.\r\n * @returns {boolean}\r\n */\r\nLongPrototype.eqz = LongPrototype.isZero;\r\n\r\n/**\r\n * Tests if this Long's value is negative.\r\n * @returns {boolean}\r\n */\r\nLongPrototype.isNegative = function isNegative() {\r\n    return !this.unsigned && this.high < 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value is positive.\r\n * @returns {boolean}\r\n */\r\nLongPrototype.isPositive = function isPositive() {\r\n    return this.unsigned || this.high >= 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value is odd.\r\n * @returns {boolean}\r\n */\r\nLongPrototype.isOdd = function isOdd() {\r\n    return (this.low & 1) === 1;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value is even.\r\n * @returns {boolean}\r\n */\r\nLongPrototype.isEven = function isEven() {\r\n    return (this.low & 1) === 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value equals the specified's.\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.equals = function equals(other) {\r\n    if (!isLong(other))\r\n        other = fromValue(other);\r\n    if (this.unsigned !== other.unsigned && (this.high >>> 31) === 1 && (other.high >>> 31) === 1)\r\n        return false;\r\n    return this.high === other.high && this.low === other.low;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value equals the specified's. This is an alias of {@link Long#equals}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.eq = LongPrototype.equals;\r\n\r\n/**\r\n * Tests if this Long's value differs from the specified's.\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.notEquals = function notEquals(other) {\r\n    return !this.eq(/* validates */ other);\r\n};\r\n\r\n/**\r\n * Tests if this Long's value differs from the specified's. This is an alias of {@link Long#notEquals}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.neq = LongPrototype.notEquals;\r\n\r\n/**\r\n * Tests if this Long's value differs from the specified's. This is an alias of {@link Long#notEquals}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.ne = LongPrototype.notEquals;\r\n\r\n/**\r\n * Tests if this Long's value is less than the specified's.\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.lessThan = function lessThan(other) {\r\n    return this.comp(/* validates */ other) < 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value is less than the specified's. This is an alias of {@link Long#lessThan}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.lt = LongPrototype.lessThan;\r\n\r\n/**\r\n * Tests if this Long's value is less than or equal the specified's.\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.lessThanOrEqual = function lessThanOrEqual(other) {\r\n    return this.comp(/* validates */ other) <= 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value is less than or equal the specified's. This is an alias of {@link Long#lessThanOrEqual}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.lte = LongPrototype.lessThanOrEqual;\r\n\r\n/**\r\n * Tests if this Long's value is less than or equal the specified's. This is an alias of {@link Long#lessThanOrEqual}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.le = LongPrototype.lessThanOrEqual;\r\n\r\n/**\r\n * Tests if this Long's value is greater than the specified's.\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.greaterThan = function greaterThan(other) {\r\n    return this.comp(/* validates */ other) > 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value is greater than the specified's. This is an alias of {@link Long#greaterThan}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.gt = LongPrototype.greaterThan;\r\n\r\n/**\r\n * Tests if this Long's value is greater than or equal the specified's.\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.greaterThanOrEqual = function greaterThanOrEqual(other) {\r\n    return this.comp(/* validates */ other) >= 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value is greater than or equal the specified's. This is an alias of {@link Long#greaterThanOrEqual}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.gte = LongPrototype.greaterThanOrEqual;\r\n\r\n/**\r\n * Tests if this Long's value is greater than or equal the specified's. This is an alias of {@link Long#greaterThanOrEqual}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.ge = LongPrototype.greaterThanOrEqual;\r\n\r\n/**\r\n * Compares this Long's value with the specified's.\r\n * @param {!Long|number|string} other Other value\r\n * @returns {number} 0 if they are the same, 1 if the this is greater and -1\r\n *  if the given one is greater\r\n */\r\nLongPrototype.compare = function compare(other) {\r\n    if (!isLong(other))\r\n        other = fromValue(other);\r\n    if (this.eq(other))\r\n        return 0;\r\n    var thisNeg = this.isNegative(),\r\n        otherNeg = other.isNegative();\r\n    if (thisNeg && !otherNeg)\r\n        return -1;\r\n    if (!thisNeg && otherNeg)\r\n        return 1;\r\n    // At this point the sign bits are the same\r\n    if (!this.unsigned)\r\n        return this.sub(other).isNegative() ? -1 : 1;\r\n    // Both are positive if at least one is unsigned\r\n    return (other.high >>> 0) > (this.high >>> 0) || (other.high === this.high && (other.low >>> 0) > (this.low >>> 0)) ? -1 : 1;\r\n};\r\n\r\n/**\r\n * Compares this Long's value with the specified's. This is an alias of {@link Long#compare}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {number} 0 if they are the same, 1 if the this is greater and -1\r\n *  if the given one is greater\r\n */\r\nLongPrototype.comp = LongPrototype.compare;\r\n\r\n/**\r\n * Negates this Long's value.\r\n * @returns {!Long} Negated Long\r\n */\r\nLongPrototype.negate = function negate() {\r\n    if (!this.unsigned && this.eq(MIN_VALUE))\r\n        return MIN_VALUE;\r\n    return this.not().add(ONE);\r\n};\r\n\r\n/**\r\n * Negates this Long's value. This is an alias of {@link Long#negate}.\r\n * @function\r\n * @returns {!Long} Negated Long\r\n */\r\nLongPrototype.neg = LongPrototype.negate;\r\n\r\n/**\r\n * Returns the sum of this and the specified Long.\r\n * @param {!Long|number|string} addend Addend\r\n * @returns {!Long} Sum\r\n */\r\nLongPrototype.add = function add(addend) {\r\n    if (!isLong(addend))\r\n        addend = fromValue(addend);\r\n\r\n    // Divide each number into 4 chunks of 16 bits, and then sum the chunks.\r\n\r\n    var a48 = this.high >>> 16;\r\n    var a32 = this.high & 0xFFFF;\r\n    var a16 = this.low >>> 16;\r\n    var a00 = this.low & 0xFFFF;\r\n\r\n    var b48 = addend.high >>> 16;\r\n    var b32 = addend.high & 0xFFFF;\r\n    var b16 = addend.low >>> 16;\r\n    var b00 = addend.low & 0xFFFF;\r\n\r\n    var c48 = 0, c32 = 0, c16 = 0, c00 = 0;\r\n    c00 += a00 + b00;\r\n    c16 += c00 >>> 16;\r\n    c00 &= 0xFFFF;\r\n    c16 += a16 + b16;\r\n    c32 += c16 >>> 16;\r\n    c16 &= 0xFFFF;\r\n    c32 += a32 + b32;\r\n    c48 += c32 >>> 16;\r\n    c32 &= 0xFFFF;\r\n    c48 += a48 + b48;\r\n    c48 &= 0xFFFF;\r\n    return fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns the difference of this and the specified Long.\r\n * @param {!Long|number|string} subtrahend Subtrahend\r\n * @returns {!Long} Difference\r\n */\r\nLongPrototype.subtract = function subtract(subtrahend) {\r\n    if (!isLong(subtrahend))\r\n        subtrahend = fromValue(subtrahend);\r\n    return this.add(subtrahend.neg());\r\n};\r\n\r\n/**\r\n * Returns the difference of this and the specified Long. This is an alias of {@link Long#subtract}.\r\n * @function\r\n * @param {!Long|number|string} subtrahend Subtrahend\r\n * @returns {!Long} Difference\r\n */\r\nLongPrototype.sub = LongPrototype.subtract;\r\n\r\n/**\r\n * Returns the product of this and the specified Long.\r\n * @param {!Long|number|string} multiplier Multiplier\r\n * @returns {!Long} Product\r\n */\r\nLongPrototype.multiply = function multiply(multiplier) {\r\n    if (this.isZero())\r\n        return ZERO;\r\n    if (!isLong(multiplier))\r\n        multiplier = fromValue(multiplier);\r\n\r\n    // use wasm support if present\r\n    if (wasm) {\r\n        var low = wasm.mul(this.low,\r\n                           this.high,\r\n                           multiplier.low,\r\n                           multiplier.high);\r\n        return fromBits(low, wasm.get_high(), this.unsigned);\r\n    }\r\n\r\n    if (multiplier.isZero())\r\n        return ZERO;\r\n    if (this.eq(MIN_VALUE))\r\n        return multiplier.isOdd() ? MIN_VALUE : ZERO;\r\n    if (multiplier.eq(MIN_VALUE))\r\n        return this.isOdd() ? MIN_VALUE : ZERO;\r\n\r\n    if (this.isNegative()) {\r\n        if (multiplier.isNegative())\r\n            return this.neg().mul(multiplier.neg());\r\n        else\r\n            return this.neg().mul(multiplier).neg();\r\n    } else if (multiplier.isNegative())\r\n        return this.mul(multiplier.neg()).neg();\r\n\r\n    // If both longs are small, use float multiplication\r\n    if (this.lt(TWO_PWR_24) && multiplier.lt(TWO_PWR_24))\r\n        return fromNumber(this.toNumber() * multiplier.toNumber(), this.unsigned);\r\n\r\n    // Divide each long into 4 chunks of 16 bits, and then add up 4x4 products.\r\n    // We can skip products that would overflow.\r\n\r\n    var a48 = this.high >>> 16;\r\n    var a32 = this.high & 0xFFFF;\r\n    var a16 = this.low >>> 16;\r\n    var a00 = this.low & 0xFFFF;\r\n\r\n    var b48 = multiplier.high >>> 16;\r\n    var b32 = multiplier.high & 0xFFFF;\r\n    var b16 = multiplier.low >>> 16;\r\n    var b00 = multiplier.low & 0xFFFF;\r\n\r\n    var c48 = 0, c32 = 0, c16 = 0, c00 = 0;\r\n    c00 += a00 * b00;\r\n    c16 += c00 >>> 16;\r\n    c00 &= 0xFFFF;\r\n    c16 += a16 * b00;\r\n    c32 += c16 >>> 16;\r\n    c16 &= 0xFFFF;\r\n    c16 += a00 * b16;\r\n    c32 += c16 >>> 16;\r\n    c16 &= 0xFFFF;\r\n    c32 += a32 * b00;\r\n    c48 += c32 >>> 16;\r\n    c32 &= 0xFFFF;\r\n    c32 += a16 * b16;\r\n    c48 += c32 >>> 16;\r\n    c32 &= 0xFFFF;\r\n    c32 += a00 * b32;\r\n    c48 += c32 >>> 16;\r\n    c32 &= 0xFFFF;\r\n    c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;\r\n    c48 &= 0xFFFF;\r\n    return fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns the product of this and the specified Long. This is an alias of {@link Long#multiply}.\r\n * @function\r\n * @param {!Long|number|string} multiplier Multiplier\r\n * @returns {!Long} Product\r\n */\r\nLongPrototype.mul = LongPrototype.multiply;\r\n\r\n/**\r\n * Returns this Long divided by the specified. The result is signed if this Long is signed or\r\n *  unsigned if this Long is unsigned.\r\n * @param {!Long|number|string} divisor Divisor\r\n * @returns {!Long} Quotient\r\n */\r\nLongPrototype.divide = function divide(divisor) {\r\n    if (!isLong(divisor))\r\n        divisor = fromValue(divisor);\r\n    if (divisor.isZero())\r\n        throw Error('division by zero');\r\n\r\n    // use wasm support if present\r\n    if (wasm) {\r\n        // guard against signed division overflow: the largest\r\n        // negative number / -1 would be 1 larger than the largest\r\n        // positive number, due to two's complement.\r\n        if (!this.unsigned &&\r\n            this.high === -0x80000000 &&\r\n            divisor.low === -1 && divisor.high === -1) {\r\n            // be consistent with non-wasm code path\r\n            return this;\r\n        }\r\n        var low = (this.unsigned ? wasm.div_u : wasm.div_s)(\r\n            this.low,\r\n            this.high,\r\n            divisor.low,\r\n            divisor.high\r\n        );\r\n        return fromBits(low, wasm.get_high(), this.unsigned);\r\n    }\r\n\r\n    if (this.isZero())\r\n        return this.unsigned ? UZERO : ZERO;\r\n    var approx, rem, res;\r\n    if (!this.unsigned) {\r\n        // This section is only relevant for signed longs and is derived from the\r\n        // closure library as a whole.\r\n        if (this.eq(MIN_VALUE)) {\r\n            if (divisor.eq(ONE) || divisor.eq(NEG_ONE))\r\n                return MIN_VALUE;  // recall that -MIN_VALUE == MIN_VALUE\r\n            else if (divisor.eq(MIN_VALUE))\r\n                return ONE;\r\n            else {\r\n                // At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.\r\n                var halfThis = this.shr(1);\r\n                approx = halfThis.div(divisor).shl(1);\r\n                if (approx.eq(ZERO)) {\r\n                    return divisor.isNegative() ? ONE : NEG_ONE;\r\n                } else {\r\n                    rem = this.sub(divisor.mul(approx));\r\n                    res = approx.add(rem.div(divisor));\r\n                    return res;\r\n                }\r\n            }\r\n        } else if (divisor.eq(MIN_VALUE))\r\n            return this.unsigned ? UZERO : ZERO;\r\n        if (this.isNegative()) {\r\n            if (divisor.isNegative())\r\n                return this.neg().div(divisor.neg());\r\n            return this.neg().div(divisor).neg();\r\n        } else if (divisor.isNegative())\r\n            return this.div(divisor.neg()).neg();\r\n        res = ZERO;\r\n    } else {\r\n        // The algorithm below has not been made for unsigned longs. It's therefore\r\n        // required to take special care of the MSB prior to running it.\r\n        if (!divisor.unsigned)\r\n            divisor = divisor.toUnsigned();\r\n        if (divisor.gt(this))\r\n            return UZERO;\r\n        if (divisor.gt(this.shru(1))) // 15 >>> 1 = 7 ; with divisor = 8 ; true\r\n            return UONE;\r\n        res = UZERO;\r\n    }\r\n\r\n    // Repeat the following until the remainder is less than other:  find a\r\n    // floating-point that approximates remainder / other *from below*, add this\r\n    // into the result, and subtract it from the remainder.  It is critical that\r\n    // the approximate value is less than or equal to the real value so that the\r\n    // remainder never becomes negative.\r\n    rem = this;\r\n    while (rem.gte(divisor)) {\r\n        // Approximate the result of division. This may be a little greater or\r\n        // smaller than the actual value.\r\n        approx = Math.max(1, Math.floor(rem.toNumber() / divisor.toNumber()));\r\n\r\n        // We will tweak the approximate result by changing it in the 48-th digit or\r\n        // the smallest non-fractional digit, whichever is larger.\r\n        var log2 = Math.ceil(Math.log(approx) / Math.LN2),\r\n            delta = (log2 <= 48) ? 1 : pow_dbl(2, log2 - 48),\r\n\r\n        // Decrease the approximation until it is smaller than the remainder.  Note\r\n        // that if it is too large, the product overflows and is negative.\r\n            approxRes = fromNumber(approx),\r\n            approxRem = approxRes.mul(divisor);\r\n        while (approxRem.isNegative() || approxRem.gt(rem)) {\r\n            approx -= delta;\r\n            approxRes = fromNumber(approx, this.unsigned);\r\n            approxRem = approxRes.mul(divisor);\r\n        }\r\n\r\n        // We know the answer can't be zero... and actually, zero would cause\r\n        // infinite recursion since we would make no progress.\r\n        if (approxRes.isZero())\r\n            approxRes = ONE;\r\n\r\n        res = res.add(approxRes);\r\n        rem = rem.sub(approxRem);\r\n    }\r\n    return res;\r\n};\r\n\r\n/**\r\n * Returns this Long divided by the specified. This is an alias of {@link Long#divide}.\r\n * @function\r\n * @param {!Long|number|string} divisor Divisor\r\n * @returns {!Long} Quotient\r\n */\r\nLongPrototype.div = LongPrototype.divide;\r\n\r\n/**\r\n * Returns this Long modulo the specified.\r\n * @param {!Long|number|string} divisor Divisor\r\n * @returns {!Long} Remainder\r\n */\r\nLongPrototype.modulo = function modulo(divisor) {\r\n    if (!isLong(divisor))\r\n        divisor = fromValue(divisor);\r\n\r\n    // use wasm support if present\r\n    if (wasm) {\r\n        var low = (this.unsigned ? wasm.rem_u : wasm.rem_s)(\r\n            this.low,\r\n            this.high,\r\n            divisor.low,\r\n            divisor.high\r\n        );\r\n        return fromBits(low, wasm.get_high(), this.unsigned);\r\n    }\r\n\r\n    return this.sub(this.div(divisor).mul(divisor));\r\n};\r\n\r\n/**\r\n * Returns this Long modulo the specified. This is an alias of {@link Long#modulo}.\r\n * @function\r\n * @param {!Long|number|string} divisor Divisor\r\n * @returns {!Long} Remainder\r\n */\r\nLongPrototype.mod = LongPrototype.modulo;\r\n\r\n/**\r\n * Returns this Long modulo the specified. This is an alias of {@link Long#modulo}.\r\n * @function\r\n * @param {!Long|number|string} divisor Divisor\r\n * @returns {!Long} Remainder\r\n */\r\nLongPrototype.rem = LongPrototype.modulo;\r\n\r\n/**\r\n * Returns the bitwise NOT of this Long.\r\n * @returns {!Long}\r\n */\r\nLongPrototype.not = function not() {\r\n    return fromBits(~this.low, ~this.high, this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns the bitwise AND of this Long and the specified.\r\n * @param {!Long|number|string} other Other Long\r\n * @returns {!Long}\r\n */\r\nLongPrototype.and = function and(other) {\r\n    if (!isLong(other))\r\n        other = fromValue(other);\r\n    return fromBits(this.low & other.low, this.high & other.high, this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns the bitwise OR of this Long and the specified.\r\n * @param {!Long|number|string} other Other Long\r\n * @returns {!Long}\r\n */\r\nLongPrototype.or = function or(other) {\r\n    if (!isLong(other))\r\n        other = fromValue(other);\r\n    return fromBits(this.low | other.low, this.high | other.high, this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns the bitwise XOR of this Long and the given one.\r\n * @param {!Long|number|string} other Other Long\r\n * @returns {!Long}\r\n */\r\nLongPrototype.xor = function xor(other) {\r\n    if (!isLong(other))\r\n        other = fromValue(other);\r\n    return fromBits(this.low ^ other.low, this.high ^ other.high, this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns this Long with bits shifted to the left by the given amount.\r\n * @param {number|!Long} numBits Number of bits\r\n * @returns {!Long} Shifted Long\r\n */\r\nLongPrototype.shiftLeft = function shiftLeft(numBits) {\r\n    if (isLong(numBits))\r\n        numBits = numBits.toInt();\r\n    if ((numBits &= 63) === 0)\r\n        return this;\r\n    else if (numBits < 32)\r\n        return fromBits(this.low << numBits, (this.high << numBits) | (this.low >>> (32 - numBits)), this.unsigned);\r\n    else\r\n        return fromBits(0, this.low << (numBits - 32), this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns this Long with bits shifted to the left by the given amount. This is an alias of {@link Long#shiftLeft}.\r\n * @function\r\n * @param {number|!Long} numBits Number of bits\r\n * @returns {!Long} Shifted Long\r\n */\r\nLongPrototype.shl = LongPrototype.shiftLeft;\r\n\r\n/**\r\n * Returns this Long with bits arithmetically shifted to the right by the given amount.\r\n * @param {number|!Long} numBits Number of bits\r\n * @returns {!Long} Shifted Long\r\n */\r\nLongPrototype.shiftRight = function shiftRight(numBits) {\r\n    if (isLong(numBits))\r\n        numBits = numBits.toInt();\r\n    if ((numBits &= 63) === 0)\r\n        return this;\r\n    else if (numBits < 32)\r\n        return fromBits((this.low >>> numBits) | (this.high << (32 - numBits)), this.high >> numBits, this.unsigned);\r\n    else\r\n        return fromBits(this.high >> (numBits - 32), this.high >= 0 ? 0 : -1, this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns this Long with bits arithmetically shifted to the right by the given amount. This is an alias of {@link Long#shiftRight}.\r\n * @function\r\n * @param {number|!Long} numBits Number of bits\r\n * @returns {!Long} Shifted Long\r\n */\r\nLongPrototype.shr = LongPrototype.shiftRight;\r\n\r\n/**\r\n * Returns this Long with bits logically shifted to the right by the given amount.\r\n * @param {number|!Long} numBits Number of bits\r\n * @returns {!Long} Shifted Long\r\n */\r\nLongPrototype.shiftRightUnsigned = function shiftRightUnsigned(numBits) {\r\n    if (isLong(numBits))\r\n        numBits = numBits.toInt();\r\n    numBits &= 63;\r\n    if (numBits === 0)\r\n        return this;\r\n    else {\r\n        var high = this.high;\r\n        if (numBits < 32) {\r\n            var low = this.low;\r\n            return fromBits((low >>> numBits) | (high << (32 - numBits)), high >>> numBits, this.unsigned);\r\n        } else if (numBits === 32)\r\n            return fromBits(high, 0, this.unsigned);\r\n        else\r\n            return fromBits(high >>> (numBits - 32), 0, this.unsigned);\r\n    }\r\n};\r\n\r\n/**\r\n * Returns this Long with bits logically shifted to the right by the given amount. This is an alias of {@link Long#shiftRightUnsigned}.\r\n * @function\r\n * @param {number|!Long} numBits Number of bits\r\n * @returns {!Long} Shifted Long\r\n */\r\nLongPrototype.shru = LongPrototype.shiftRightUnsigned;\r\n\r\n/**\r\n * Returns this Long with bits logically shifted to the right by the given amount. This is an alias of {@link Long#shiftRightUnsigned}.\r\n * @function\r\n * @param {number|!Long} numBits Number of bits\r\n * @returns {!Long} Shifted Long\r\n */\r\nLongPrototype.shr_u = LongPrototype.shiftRightUnsigned;\r\n\r\n/**\r\n * Converts this Long to signed.\r\n * @returns {!Long} Signed long\r\n */\r\nLongPrototype.toSigned = function toSigned() {\r\n    if (!this.unsigned)\r\n        return this;\r\n    return fromBits(this.low, this.high, false);\r\n};\r\n\r\n/**\r\n * Converts this Long to unsigned.\r\n * @returns {!Long} Unsigned long\r\n */\r\nLongPrototype.toUnsigned = function toUnsigned() {\r\n    if (this.unsigned)\r\n        return this;\r\n    return fromBits(this.low, this.high, true);\r\n};\r\n\r\n/**\r\n * Converts this Long to its byte representation.\r\n * @param {boolean=} le Whether little or big endian, defaults to big endian\r\n * @returns {!Array.<number>} Byte representation\r\n */\r\nLongPrototype.toBytes = function toBytes(le) {\r\n    return le ? this.toBytesLE() : this.toBytesBE();\r\n};\r\n\r\n/**\r\n * Converts this Long to its little endian byte representation.\r\n * @returns {!Array.<number>} Little endian byte representation\r\n */\r\nLongPrototype.toBytesLE = function toBytesLE() {\r\n    var hi = this.high,\r\n        lo = this.low;\r\n    return [\r\n        lo        & 0xff,\r\n        lo >>>  8 & 0xff,\r\n        lo >>> 16 & 0xff,\r\n        lo >>> 24       ,\r\n        hi        & 0xff,\r\n        hi >>>  8 & 0xff,\r\n        hi >>> 16 & 0xff,\r\n        hi >>> 24\r\n    ];\r\n};\r\n\r\n/**\r\n * Converts this Long to its big endian byte representation.\r\n * @returns {!Array.<number>} Big endian byte representation\r\n */\r\nLongPrototype.toBytesBE = function toBytesBE() {\r\n    var hi = this.high,\r\n        lo = this.low;\r\n    return [\r\n        hi >>> 24       ,\r\n        hi >>> 16 & 0xff,\r\n        hi >>>  8 & 0xff,\r\n        hi        & 0xff,\r\n        lo >>> 24       ,\r\n        lo >>> 16 & 0xff,\r\n        lo >>>  8 & 0xff,\r\n        lo        & 0xff\r\n    ];\r\n};\r\n\r\n/**\r\n * Creates a Long from its byte representation.\r\n * @param {!Array.<number>} bytes Byte representation\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @param {boolean=} le Whether little or big endian, defaults to big endian\r\n * @returns {Long} The corresponding Long value\r\n */\r\nLong.fromBytes = function fromBytes(bytes, unsigned, le) {\r\n    return le ? Long.fromBytesLE(bytes, unsigned) : Long.fromBytesBE(bytes, unsigned);\r\n};\r\n\r\n/**\r\n * Creates a Long from its little endian byte representation.\r\n * @param {!Array.<number>} bytes Little endian byte representation\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @returns {Long} The corresponding Long value\r\n */\r\nLong.fromBytesLE = function fromBytesLE(bytes, unsigned) {\r\n    return new Long(\r\n        bytes[0]       |\r\n        bytes[1] <<  8 |\r\n        bytes[2] << 16 |\r\n        bytes[3] << 24,\r\n        bytes[4]       |\r\n        bytes[5] <<  8 |\r\n        bytes[6] << 16 |\r\n        bytes[7] << 24,\r\n        unsigned\r\n    );\r\n};\r\n\r\n/**\r\n * Creates a Long from its big endian byte representation.\r\n * @param {!Array.<number>} bytes Big endian byte representation\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @returns {Long} The corresponding Long value\r\n */\r\nLong.fromBytesBE = function fromBytesBE(bytes, unsigned) {\r\n    return new Long(\r\n        bytes[4] << 24 |\r\n        bytes[5] << 16 |\r\n        bytes[6] <<  8 |\r\n        bytes[7],\r\n        bytes[0] << 24 |\r\n        bytes[1] << 16 |\r\n        bytes[2] <<  8 |\r\n        bytes[3],\r\n        unsigned\r\n    );\r\n};\r\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n// Workaround for allowing cjs module to be included in bundle created by\n// rollup.\nimport * as LongExports from 'long';\n// tslint:disable-next-line\nconst Long: LongExports.LongConstructor =\n    // tslint:disable-next-line\n    (LongExports as any).default || LongExports;\n\nexport function hexToLong(hex: string): Long {\n  return Long.fromString(hex, true, 16);\n}\n\n// Some primes between 2^63 and 2^64 for various uses.\n// Hex 0xc3a5c85c97cb3127\nconst k0: Long = hexToLong('c3a5c85c97cb3127');\n// Hex 0xb492b66fbe98f273\nconst k1: Long = hexToLong('b492b66fbe98f273');\n// Hex 0x9ae16a3b2f90404f\nconst k2: Long = hexToLong('9ae16a3b2f90404f');\n\nfunction shiftMix(val: Long): Long {\n  return val.xor(val.shru(47));\n}\n\nfunction fetch(s: Uint8Array, offset: number, numBytes: number): Long {\n  const bytes = s.slice(offset, offset + numBytes);\n  return Long.fromBytes(Array.from(bytes), true, true);\n}\n\nfunction fetch64(s: Uint8Array, offset: number): Long {\n  return fetch(s, offset, 8);\n}\n\nfunction fetch32(s: Uint8Array, offset: number): Long {\n  return fetch(s, offset, 4);\n}\n\nfunction rotate64(val: Long, shift: number): Long {\n  // Avoid shifting by 64: doing so yields an undefined result.\n  return shift === 0 ? val : val.shru(shift).or(val.shl(64 - shift));\n}\n\nfunction hashLen16(u: Long, v: Long, mul = hexToLong('9ddfea08eb382d69')) {\n  // Murmur-inspired hashing.\n  let a = u.xor(v).mul(mul);\n  a = a.xor(a.shru(47));\n  let b = v.xor(a).mul(mul);\n  b = b.xor(b.shru(47));\n  b = b.mul(mul);\n  return b;\n}\n\n// Return a 16-byte hash for 48 bytes.  Quick and dirty.\n// Callers do best to use \"random-looking\" values for a and b.\nfunction weakHashLen32WithSeeds(\n    w: Long, x: Long, y: Long, z: Long, a: Long, b: Long) {\n  a = a.add(w);\n  b = rotate64(b.add(a).add(z), 21);\n  const c = a;\n  a = a.add(x);\n  a = a.add(y);\n  b = b.add(rotate64(a, 44));\n  return [a.add(z), b.add(c)];\n}\n\nfunction weakHashLen32WithSeedsStr(\n    s: Uint8Array, offset: number, a: Long, b: Long) {\n  return weakHashLen32WithSeeds(\n      fetch64(s, offset), fetch64(s, offset + 8), fetch64(s, offset + 16),\n      fetch64(s, offset + 24), a, b);\n}\n\nfunction hashLen0to16(s: Uint8Array, len = s.length): Long {\n  if (len >= 8) {\n    const mul = k2.add(len * 2);\n    const a = fetch64(s, 0).add(k2);\n    const b = fetch64(s, len - 8);\n    const c = rotate64(b, 37).mul(mul).add(a);\n    const d = rotate64(a, 25).add(b).mul(mul);\n    return hashLen16(c, d, mul);\n  }\n  if (len >= 4) {\n    const mul = k2.add(len * 2);\n    const a = fetch32(s, 0);\n    return hashLen16(a.shl(3).add(len), fetch32(s, len - 4), mul);\n  }\n  if (len > 0) {\n    const a = s[0];\n    const b = s[len >> 1];\n    const c = s[len - 1];\n    const y = a + (b << 8);\n    const z = len + (c << 2);\n    return shiftMix(k2.mul(y).xor(k0.mul(z))).mul(k2);\n  }\n  return k2;\n}\n\nfunction hashLen17to32(s: Uint8Array, len = s.length): Long {\n  const mul = k2.add(len * 2);\n  const a = fetch64(s, 0).mul(k1);\n  const b = fetch64(s, 8);\n  const c = fetch64(s, len - 8).mul(mul);\n  const d = fetch64(s, len - 16).mul(k2);\n  return hashLen16(\n      rotate64(a.add(b), 43).add(rotate64(c, 30)).add(d),\n      a.add(rotate64(b.add(k2), 18)).add(c), mul);\n}\n\nfunction hashLen33to64(s: Uint8Array, len = s.length): Long {\n  const mul = k2.add(len * 2);\n  const a = fetch64(s, 0).mul(k2);\n  const b = fetch64(s, 8);\n  const c = fetch64(s, len - 8).mul(mul);\n  const d = fetch64(s, len - 16).mul(k2);\n  const y = rotate64(a.add(b), 43).add(rotate64(c, 30)).add(d);\n  const z = hashLen16(y, a.add(rotate64(b.add(k2), 18)).add(c), mul);\n  const e = fetch64(s, 16).mul(mul);\n  const f = fetch64(s, 24);\n  const g = y.add(fetch64(s, len - 32)).mul(mul);\n  const h = z.add(fetch64(s, len - 24)).mul(mul);\n  return hashLen16(\n      rotate64(e.add(f), 43).add(rotate64(g, 30)).add(h),\n      e.add(rotate64(f.add(a), 18)).add(g), mul);\n}\n\nexport function fingerPrint64(s: Uint8Array, len = s.length): Long {\n  const seed: Long = Long.fromNumber(81, true);\n  if (len <= 32) {\n    if (len <= 16) {\n      return hashLen0to16(s, len);\n    } else {\n      return hashLen17to32(s, len);\n    }\n  } else if (len <= 64) {\n    return hashLen33to64(s, len);\n  }\n\n  // For strings over 64 bytes we loop.  Internal state consists of\n  // 56 bytes: v, w, x, y, and z.\n  let x = seed;\n  let y = seed.mul(k1).add(113);\n\n  let z = shiftMix(y.mul(k2).add(113)).mul(k2);\n  let v = [Long.UZERO, Long.UZERO];\n  let w = [Long.UZERO, Long.UZERO];\n  x = x.mul(k2).add(fetch64(s, 0));\n\n  let offset = 0;\n  // Set end so that after the loop we have 1 to 64 bytes left to process.\n  const end = ((len - 1) >> 6) * 64;\n  const last64 = end + ((len - 1) & 63) - 63;\n\n  do {\n    x = rotate64(x.add(y).add(v[0]).add(fetch64(s, offset + 8)), 37).mul(k1);\n    y = rotate64(y.add(v[1]).add(fetch64(s, offset + 48)), 42).mul(k1);\n    x = x.xor(w[1]);\n    y = y.add(v[0]).add(fetch64(s, offset + 40));\n    z = rotate64(z.add(w[0]), 33).mul(k1);\n    v = weakHashLen32WithSeedsStr(s, offset, v[1].mul(k1), x.add(w[0]));\n    w = weakHashLen32WithSeedsStr(\n        s, offset + 32, z.add(w[1]), y.add(fetch64(s, offset + 16)));\n\n    [z, x] = [x, z];\n    offset += 64;\n  } while (offset !== end);\n  const mul = k1.add(z.and(0xff).shl(1));\n  // Point to the last 64 bytes of input.\n  offset = last64;\n\n  w[0] = w[0].add((len - 1) & 63);\n  v[0] = v[0].add(w[0]);\n  w[0] = w[0].add(v[0]);\n\n  x = rotate64(x.add(y).add(v[0]).add(fetch64(s, offset + 8)), 37).mul(mul);\n  y = rotate64(y.add(v[1]).add(fetch64(s, offset + 48)), 42).mul(mul);\n  x = x.xor(w[1].mul(9));\n  y = y.add(v[0].mul(9).add(fetch64(s, offset + 40)));\n  z = rotate64(z.add(w[0]), 33).mul(mul);\n  v = weakHashLen32WithSeedsStr(s, offset, v[1].mul(mul), x.add(w[0]));\n  w = weakHashLen32WithSeedsStr(\n      s, offset + 32, z.add(w[1]), y.add(fetch64(s, offset + 16)));\n\n  [z, x] = [x, z];\n\n  return hashLen16(\n      hashLen16(v[0], w[0], mul).add(shiftMix(y).mul(k0)).add(z),\n      hashLen16(v[1], w[1], mul).add(x), mul);\n}\n", "/**\n * @license\n * Copyright 2017 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {env} from './environment';\nimport {isTypedArrayBrowser} from './platforms/is_typed_array_browser';\nimport {BackendValues, DataType, RecursiveArray, TensorLike, TypedArray} from './types';\nimport * as base from './util_base';\nexport * from './util_base';\nexport * from './hash_util';\n\n/**\n * Create typed array for scalar value. Used for storing in `DataStorage`.\n */\nexport function createScalarValue(\n    value: DataType, dtype: DataType): BackendValues {\n  if (dtype === 'string') {\n    return encodeString(value);\n  }\n\n  return toTypedArray([value], dtype);\n}\n\nfunction noConversionNeeded(a: TensorLike, dtype: DataType): boolean {\n  return (a instanceof Float32Array && dtype === 'float32') ||\n      (a instanceof Int32Array && dtype === 'int32') ||\n      (a instanceof Uint8Array && dtype === 'bool');\n}\n\nexport function toTypedArray(a: TensorLike, dtype: DataType): TypedArray {\n  if (dtype === 'string') {\n    throw new Error('Cannot convert a string[] to a TypedArray');\n  }\n  if (Array.isArray(a)) {\n    a = flatten(a);\n  }\n\n  if (env().getBool('DEBUG')) {\n    base.checkConversionForErrors(a as number[], dtype);\n  }\n  if (noConversionNeeded(a, dtype)) {\n    return a as TypedArray;\n  }\n  if (dtype == null || dtype === 'float32' || dtype === 'complex64') {\n    return new Float32Array(a as number[]);\n  } else if (dtype === 'int32') {\n    return new Int32Array(a as number[]);\n  } else if (dtype === 'bool') {\n    const bool = new Uint8Array((a as number[]).length);\n    for (let i = 0; i < bool.length; ++i) {\n      if (Math.round((a as number[])[i]) !== 0) {\n        bool[i] = 1;\n      }\n    }\n    return bool;\n  } else {\n    throw new Error(`Unknown data type ${dtype}`);\n  }\n}\n\n/**\n * Returns the current high-resolution time in milliseconds relative to an\n * arbitrary time in the past. It works across different platforms (node.js,\n * browsers).\n *\n * ```js\n * console.log(tf.util.now());\n * ```\n *\n * @doc {heading: 'Util', namespace: 'util'}\n */\nexport function now(): number {\n  return env().platform.now();\n}\n\n/**\n * Returns a platform-specific implementation of\n * [`fetch`](https://developer.mozilla.org/en-US/docs/Web/API/Fetch_API).\n *\n * If `fetch` is defined on the global object (`window`, `process`, etc.),\n * `tf.util.fetch` returns that function.\n *\n * If not, `tf.util.fetch` returns a platform-specific solution.\n *\n * ```js\n * const resource = await tf.util.fetch('https://cdn.jsdelivr.net/npm/@tensorflow/tfjs');\n * // handle response\n * ```\n *\n * @doc {heading: 'Util'}\n */\nexport function fetch(\n    path: string, requestInits?: RequestInit): Promise<Response> {\n  return env().platform.fetch(path, requestInits);\n}\n\n/**\n * Encodes the provided string into bytes using the provided encoding scheme.\n *\n * @param s The string to encode.\n * @param encoding The encoding scheme. Defaults to utf-8.\n *\n * @doc {heading: 'Util'}\n */\nexport function encodeString(s: string, encoding = 'utf-8'): Uint8Array {\n  encoding = encoding || 'utf-8';\n  return env().platform.encode(s, encoding);\n}\n\n/**\n * Decodes the provided bytes into a string using the provided encoding scheme.\n * @param bytes The bytes to decode.\n *\n * @param encoding The encoding scheme. Defaults to utf-8.\n *\n * @doc {heading: 'Util'}\n */\nexport function decodeString(bytes: Uint8Array, encoding = 'utf-8'): string {\n  encoding = encoding || 'utf-8';\n  return env().platform.decode(bytes, encoding);\n}\n\nexport function isTypedArray(a: {}): a is Float32Array|Int32Array|Uint8Array|\n    Uint8ClampedArray {\n  // TODO(mattsoulanille): Remove this fallback in 5.0.0\n  if (env().platform.isTypedArray != null) {\n    return env().platform.isTypedArray(a);\n  } else {\n    return isTypedArrayBrowser(a);\n  }\n}\n\n// NOTE: We explicitly type out what T extends instead of any so that\n// util.flatten on a nested array of number doesn't try to infer T as a\n// number[][], causing us to explicitly type util.flatten<number>().\n/**\n *  Flattens an arbitrarily nested array.\n *\n * ```js\n * const a = [[1, 2], [3, 4], [5, [6, [7]]]];\n * const flat = tf.util.flatten(a);\n * console.log(flat);\n * ```\n *\n *  @param arr The nested array to flatten.\n *  @param result The destination array which holds the elements.\n *  @param skipTypedArray If true, avoids flattening the typed arrays. Defaults\n *      to false.\n *\n * @doc {heading: 'Util', namespace: 'util'}\n */\nexport function\nflatten<T extends number|boolean|string|Promise<number>|TypedArray>(\n    arr: T|RecursiveArray<T>, result: T[] = [], skipTypedArray = false): T[] {\n  if (result == null) {\n    result = [];\n  }\n  if (typeof arr === 'boolean' || typeof arr === 'number' ||\n    typeof arr === 'string' || base.isPromise(arr) || arr == null ||\n      isTypedArray(arr) && skipTypedArray) {\n    result.push(arr as T);\n  } else if (Array.isArray(arr) || isTypedArray(arr)) {\n    for (let i = 0; i < arr.length; ++i) {\n      flatten(arr[i], result, skipTypedArray);\n    }\n  } else {\n    let maxIndex = -1;\n    for (const key of Object.keys(arr)) {\n      // 0 or positive integer.\n      if (/^([1-9]+[0-9]*|0)$/.test(key)) {\n        maxIndex = Math.max(maxIndex, Number(key));\n      }\n    }\n    for (let i = 0; i <= maxIndex; i++) {\n      // tslint:disable-next-line: no-unnecessary-type-assertion\n      flatten((arr as RecursiveArray<T>)[i], result, skipTypedArray);\n    }\n  }\n  return result;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {BackendTimer, BackendTimingInfo} from './backends/backend';\nimport {env} from './environment';\nimport {Tensor} from './tensor';\nimport {NamedTensorMap} from './tensor_types';\nimport {DataType, DataTypeMap, TypedArray} from './types';\nimport * as util from './util';\n\nexport type KernelProfile = {\n  kernelName: string,\n  outputs: Tensor[],\n  inputs: NamedTensorMap,\n  timeMs: Promise<number|{error: string}>,\n  extraInfo: Promise<string>\n};\n\nexport class Profiler {\n  constructor(private backendTimer: BackendTimer, private logger?: Logger) {\n    if (logger == null) {\n      this.logger = new Logger();\n    }\n  }\n\n  profileKernel(kernelName: string, inputs: NamedTensorMap, f: () => Tensor[]):\n      KernelProfile {\n    let outputs: Tensor[];\n    const holdResultWrapperFn = () => {\n      outputs = f();\n    };\n    let timer: Promise<BackendTimingInfo>;\n    const start = util.now();\n    if (this.backendTimer.timerAvailable()) {\n      timer = this.backendTimer.time(holdResultWrapperFn);\n    } else {\n      holdResultWrapperFn();\n      for (const output of outputs) {\n        output.dataSync();\n      }\n      timer = Promise.resolve({kernelMs: util.now() - start});\n    }\n    if (env().getBool('CHECK_COMPUTATION_FOR_ERRORS')) {\n      for (let i = 0; i < outputs.length; i++) {\n        const output = outputs[i];\n        // Dangling promise here because we don't want to propagate up\n        // asynchronicity.\n        output.data().then(tensorVals => {\n          checkComputationForErrors(tensorVals, output.dtype, kernelName);\n        });\n      }\n    }\n\n    const kernelProfile = {\n      kernelName,\n      outputs,\n      inputs,\n      timeMs: timer.then(timing => timing.kernelMs),\n      extraInfo: timer.then(\n          timing => timing.getExtraProfileInfo != null ?\n              timing.getExtraProfileInfo() :\n              '')\n    };\n    return kernelProfile;\n  }\n\n  logKernelProfile(kernelProfile: KernelProfile): void {\n    const {kernelName, outputs, timeMs, inputs, extraInfo} = kernelProfile;\n\n    outputs.forEach(result => {\n      Promise.all([result.data(), timeMs, extraInfo]).then(valueContainer => {\n        this.logger.logKernelProfile(\n            kernelName, result, valueContainer[0], valueContainer[1], inputs,\n            valueContainer[2]);\n      });\n    });\n  }\n}\n\nexport function checkComputationForErrors<D extends DataType>(\n    vals: DataTypeMap[D], dtype: D, kernelName: string): boolean {\n  if (dtype !== 'float32') {\n    // Only floating point computations will generate NaN values\n    return false;\n  }\n  for (let i = 0; i < vals.length; i++) {\n    const num = vals[i] as number;\n    if (isNaN(num) || !isFinite(num)) {\n      // Throwing custom exception so behavior is testable.\n      console.warn(`Found ${num} in the result of '${kernelName}'`);\n      return true;\n    }\n  }\n  return false;\n}\n\nexport class Logger {\n  logKernelProfile(\n      name: string, result: Tensor, vals: TypedArray,\n      timeMs: number|{error: string}, inputs: NamedTensorMap,\n      extraInfo?: string) {\n    const time = typeof timeMs === 'number' ? util.rightPad(`${timeMs}ms`, 9) :\n                                              timeMs['error'];\n    const paddedName = util.rightPad(name, 25);\n    const rank = result.rank;\n    const size = result.size;\n    const shape = util.rightPad(result.shape.toString(), 14);\n    let inputShapesDescription = '';\n\n    for (const name in inputs) {\n      const input = inputs[name];\n      if (input != null) {\n        // The input might be a non-tensor (e.g HTMLImageElement), in which case\n        // we claim the output shape as input shape.\n        const inputShape = input.shape || result.shape;\n        const inputRank = inputShape.length;\n        inputShapesDescription +=\n            `${name}: ${inputRank}D ${inputRank > 0 ? inputShape : ''} `;\n      }\n    }\n\n    console.log(\n        `%c${paddedName}\\t%c${time}\\t%c${rank}D ${shape}\\t%c${size}\\t%c${\n            inputShapesDescription}\\t%c${extraInfo}`,\n        'font-weight:bold', 'color:red', 'color:blue', 'color: orange',\n        'color: green', 'color: steelblue');\n  }\n}\n", "/**\n * @license\n * Copyright 2017 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from './tensor';\nimport {NamedTensorMap} from './tensor_types';\nimport * as util from './util';\n\nexport interface TapeNode {\n  id: number;\n  kernelName: string;\n  outputs: Tensor[];\n  inputs: NamedTensorMap;\n  // Optional params, defined only for ops with gradient impl.\n  gradient?: (dys: Tensor[]) => NamedGradientMap;\n  saved?: Tensor[];\n}\n\nexport type NamedGradientMap = {\n  [inputName: string]: () => Tensor;\n};\n\n/**\n * Computes a list of TapeNodes that connect x to y, filtering everything else\n * out and preserving the order of the original tape elements.\n *\n * @param tape The tape elements to filter.\n * @param xs The input Tensors.\n * @param y The output Tensor.\n */\nexport function getFilteredNodesXToY(\n    tape: TapeNode[], xs: Tensor[], y: Tensor): TapeNode[] {\n  // Forward pass to compute all the nodes and Tensors that are transitively a\n  // function of x.\n  const tensorsFromX: {[tensorId: number]: boolean} = {};\n  const nodesFromX: {[nodeId: number]: boolean} = {};\n  for (let i = 0; i < xs.length; i++) {\n    tensorsFromX[xs[i].id] = true;\n  }\n\n  for (let i = 0; i < tape.length; i++) {\n    const node = tape[i];\n    const nodeInputs = node.inputs;\n    for (const inputName in nodeInputs) {\n      const input = nodeInputs[inputName];\n\n      let anyInputFromX = false;\n      for (let j = 0; j < xs.length; j++) {\n        if (tensorsFromX[input.id]) {\n          node.outputs.forEach(output => tensorsFromX[output.id] = true);\n          anyInputFromX = true;\n          nodesFromX[node.id] = true;\n          break;\n        }\n      }\n\n      if (anyInputFromX) {\n        break;\n      }\n    }\n  }\n\n  // Backward pass to find all of the nodes and Tensors that lead to y.\n  const tensorsLeadToY: {[tensorId: number]: boolean} = {};\n  tensorsLeadToY[y.id] = true;\n  const nodesToY: {[nodeId: number]: boolean} = {};\n\n  for (let i = tape.length - 1; i >= 0; i--) {\n    const node = tape[i];\n    const nodeInputs = node.inputs;\n\n    // If any of the outputs lead to y, mark all of the inputs as leading to y.\n    for (let j = 0; j < node.outputs.length; j++) {\n      if (tensorsLeadToY[node.outputs[j].id]) {\n        for (const inputName in nodeInputs) {\n          tensorsLeadToY[nodeInputs[inputName].id] = true;\n          nodesToY[node.id] = true;\n        }\n        break;\n      }\n    }\n  }\n\n  // Return the paths that come from x and lead to y.\n  const filteredTape: TapeNode[] = [];\n  for (let i = 0; i < tape.length; i++) {\n    const node = tape[i];\n\n    if (nodesFromX[node.id] && nodesToY[node.id]) {\n      // Prune the inputs from the node that aren't a function of x.\n      const prunedInputs: {[inputName: string]: Tensor} = {};\n      for (const inputName in node.inputs) {\n        const nodeInput = node.inputs[inputName];\n        if (tensorsFromX[nodeInput.id]) {\n          prunedInputs[inputName] = nodeInput;\n        }\n      }\n\n      // Copy the node and overwrite inputsAndArgs to the pruned version.\n      const prunedNode = Object.assign({}, node);\n      prunedNode.inputs = prunedInputs;\n      prunedNode.outputs = node.outputs;\n\n      filteredTape.push(prunedNode);\n    }\n  }\n\n  return filteredTape;\n}\n\n/**\n * Backpropagate gradients through the filtered TapeNodes.\n *\n * @param tensorAccumulatedGradientMap A map of Tensor to its gradient. This map\n * is mutated by this method.\n * @param filteredTape The filtered TapeNodes to backprop through.\n */\nexport function backpropagateGradients(\n    tensorAccumulatedGradientMap: {[tensorId: number]: Tensor},\n    filteredTape: TapeNode[], tidy: (f: Function) => Tensor,\n    add: (a: Tensor, b: Tensor) => Tensor) {\n  // Walk the tape backward and keep a map of Tensor to its gradient.\n  for (let i = filteredTape.length - 1; i >= 0; i--) {\n    const node = filteredTape[i];\n\n    const dys: Tensor[] = [];\n    node.outputs.forEach(o => {\n      const gradTensor = tensorAccumulatedGradientMap[o.id];\n      if (gradTensor != null) {\n        dys.push(gradTensor);\n      } else {\n        // This particular output is not in the back-propagation subgraph, so it\n        // does not affect the final output, thus we put null for its dy.\n        dys.push(null);\n      }\n    });\n\n    if (node.gradient == null) {\n      throw new Error(\n          `Cannot compute gradient: gradient function not found ` +\n          `for ${node.kernelName}.`);\n    }\n\n    // Backprop dy through this node and accumulate gradients over the inputs.\n    const inputGradients = node.gradient(dys);\n\n    for (const inputName in node.inputs) {\n      if (!(inputName in inputGradients)) {\n        throw new Error(\n            `Cannot backprop through input ${inputName}. ` +\n            `Available gradients found: ${Object.keys(inputGradients)}.`);\n      }\n\n      // Call the gradient function.\n      const dx = tidy(() => inputGradients[inputName]());\n      if (dx.dtype !== 'float32') {\n        throw new Error(\n            `Error in gradient for op ${\n                node.kernelName}. The gradient of input ` +\n            `${inputName} must have 'float32' dtype, but has '${dx.dtype}'`);\n      }\n      const x = node.inputs[inputName];\n      if (!util.arraysEqual(dx.shape, x.shape)) {\n        throw new Error(\n            `Error in gradient for op ${\n                node.kernelName}. The gradient of input ` +\n            `'${inputName}' has shape '${dx.shape}', which does not match ` +\n            `the shape of the input '${x.shape}'`);\n      }\n\n      if (tensorAccumulatedGradientMap[x.id] == null) {\n        tensorAccumulatedGradientMap[x.id] = dx;\n      } else {\n        const curGradient = tensorAccumulatedGradientMap[x.id];\n        tensorAccumulatedGradientMap[x.id] = add(curGradient, dx);\n        curGradient.dispose();\n      }\n    }\n  }\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {DataType, TypedArray} from './types';\nimport {computeStrides, isString, rightPad, sizeFromShape} from './util';\n\n// Maximum number of values before we decide to show ellipsis.\nconst FORMAT_LIMIT_NUM_VALS = 20;\n// Number of first and last values to show when displaying a, b,...,y, z.\nconst FORMAT_NUM_FIRST_LAST_VALS = 3;\n// Number of significant digits to show.\nconst FORMAT_NUM_SIG_DIGITS = 7;\n\nexport function tensorToString(\n    vals: TypedArray|string[], shape: number[], dtype: DataType,\n    verbose: boolean) {\n  const strides = computeStrides(shape);\n  const padPerCol = computeMaxSizePerColumn(vals, shape, dtype, strides);\n  const rank = shape.length;\n  const valsLines = subTensorToString(vals, shape, dtype, strides, padPerCol);\n  const lines = ['Tensor'];\n  if (verbose) {\n    lines.push(`  dtype: ${dtype}`);\n    lines.push(`  rank: ${rank}`);\n    lines.push(`  shape: [${shape}]`);\n    lines.push(`  values:`);\n  }\n  lines.push(valsLines.map(l => '    ' + l).join('\\n'));\n  return lines.join('\\n');\n}\n\nfunction computeMaxSizePerColumn(\n    vals: TypedArray|string[], shape: number[], dtype: DataType,\n    strides: number[]): number[] {\n  const n = sizeFromShape(shape);\n  const numCols = strides[strides.length - 1];\n  const padPerCol = new Array(numCols).fill(0);\n  const rank = shape.length;\n  const valuesOrTuples =\n      dtype === 'complex64' ? createComplexTuples(vals) : vals;\n\n  if (rank > 1) {\n    for (let row = 0; row < n / numCols; row++) {\n      const offset = row * numCols;\n      for (let j = 0; j < numCols; j++) {\n        padPerCol[j] = Math.max(\n            padPerCol[j],\n            valToString(valuesOrTuples[offset + j], 0, dtype).length);\n      }\n    }\n  }\n  return padPerCol;\n}\n\nfunction valToString(\n    val: number|string|[number, number], pad: number, dtype: DataType) {\n  let valStr: string;\n  if (Array.isArray(val)) {\n    valStr = `${parseFloat(val[0].toFixed(FORMAT_NUM_SIG_DIGITS))} + ` +\n        `${parseFloat(val[1].toFixed(FORMAT_NUM_SIG_DIGITS))}j`;\n  } else if (isString(val)) {\n    valStr = `'${val}'`;\n  } else if (dtype === 'bool') {\n    valStr = boolNumToString(val);\n  } else {\n    valStr = parseFloat(val.toFixed(FORMAT_NUM_SIG_DIGITS)).toString();\n  }\n\n  return rightPad(valStr, pad);\n}\n\nfunction boolNumToString(v: number): string {\n  return v === 0 ? 'false' : 'true';\n}\n\nfunction subTensorToString(\n    vals: TypedArray|string[], shape: number[], dtype: DataType,\n    strides: number[], padPerCol: number[], isLast = true): string[] {\n  const storagePerElement = dtype === 'complex64' ? 2 : 1;\n\n  const size = shape[0];\n  const rank = shape.length;\n  if (rank === 0) {\n    if (dtype === 'complex64') {\n      const complexTuple = createComplexTuples(vals);\n      return [valToString(complexTuple[0], 0, dtype)];\n    }\n    if (dtype === 'bool') {\n      return [boolNumToString(vals[0] as number)];\n    }\n    return [vals[0].toString()];\n  }\n\n  if (rank === 1) {\n    if (size > FORMAT_LIMIT_NUM_VALS) {\n      const firstValsSize = FORMAT_NUM_FIRST_LAST_VALS * storagePerElement;\n\n      let firstVals = Array.from<number|string|[number, number]>(\n          vals.slice(0, firstValsSize));\n      let lastVals = Array.from<number|string|[number, number]>(vals.slice(\n          (size - FORMAT_NUM_FIRST_LAST_VALS) * storagePerElement,\n          size * storagePerElement));\n      if (dtype === 'complex64') {\n        firstVals = createComplexTuples(firstVals);\n        lastVals = createComplexTuples(lastVals);\n      }\n      return [\n        '[' +\n        firstVals.map((x, i) => valToString(x, padPerCol[i], dtype))\n            .join(', ') +\n        ', ..., ' +\n        lastVals\n            .map(\n                (x, i) => valToString(\n                    x, padPerCol[size - FORMAT_NUM_FIRST_LAST_VALS + i], dtype))\n            .join(', ') +\n        ']'\n      ];\n    }\n    const displayVals: Array<number|string|[number, number]> =\n        dtype === 'complex64' ? createComplexTuples(vals) :\n                                Array.from<number|string>(vals);\n\n    return [\n      '[' +\n      displayVals.map((x, i) => valToString(x, padPerCol[i], dtype))\n          .join(', ') +\n      ']'\n    ];\n  }\n\n  // The array is rank 2 or more.\n  const subshape = shape.slice(1);\n  const substrides = strides.slice(1);\n  const stride = strides[0] * storagePerElement;\n  const lines: string[] = [];\n  if (size > FORMAT_LIMIT_NUM_VALS) {\n    for (let i = 0; i < FORMAT_NUM_FIRST_LAST_VALS; i++) {\n      const start = i * stride;\n      const end = start + stride;\n      lines.push(...subTensorToString(\n          vals.slice(start, end), subshape, dtype, substrides, padPerCol,\n          false /* isLast */));\n    }\n    lines.push('...');\n    for (let i = size - FORMAT_NUM_FIRST_LAST_VALS; i < size; i++) {\n      const start = i * stride;\n      const end = start + stride;\n      lines.push(...subTensorToString(\n          vals.slice(start, end), subshape, dtype, substrides, padPerCol,\n          i === size - 1 /* isLast */));\n    }\n  } else {\n    for (let i = 0; i < size; i++) {\n      const start = i * stride;\n      const end = start + stride;\n      lines.push(...subTensorToString(\n          vals.slice(start, end), subshape, dtype, substrides, padPerCol,\n          i === size - 1 /* isLast */));\n    }\n  }\n  const sep = rank === 2 ? ',' : '';\n  lines[0] = '[' + (size > 0 ? lines[0] + sep : '');\n  for (let i = 1; i < lines.length - 1; i++) {\n    lines[i] = ' ' + lines[i] + sep;\n  }\n  let newLineSep = ',\\n';\n  for (let i = 2; i < rank; i++) {\n    newLineSep += '\\n';\n  }\n  lines[lines.length - 1] =\n      ' ' + lines[lines.length - 1] + ']' + (isLast ? '' : newLineSep);\n  return lines;\n}\n\nfunction createComplexTuples(vals: Array<{}>|\n                             TypedArray): Array<[number, number]> {\n  const complexTuples: Array<[number, number]> = [];\n  for (let i = 0; i < vals.length; i += 2) {\n    complexTuples.push([vals[i], vals[i + 1]] as [number, number]);\n  }\n  return complexTuples;\n}\n", "/**\n * @license\n * Copyright 2017 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n// Workaround for: https://github.com/bazelbuild/rules_nodejs/issues/1265\n/// <reference types=\"@webgpu/types/dist\" />\n\nimport {getGlobal} from './global_util';\nimport {tensorToString} from './tensor_format';\nimport {DataId, TensorInfo} from './tensor_info';\nimport {ArrayMap, BackendValues, DataType, DataTypeMap, DataValues, NumericDataType, Rank, ShapeMap, SingleValueMap, TypedArray} from './types';\nimport * as util from './util';\nimport {computeStrides, toNestedArray} from './util';\n\nexport interface TensorData<D extends DataType> {\n  dataId?: DataId;\n  values?: DataTypeMap[D];\n}\n\n// This interface mimics KernelBackend (in backend.ts), which would create a\n// circular dependency if imported.\nexport interface Backend {}\n\n/**\n * A mutable object, similar to `tf.Tensor`, that allows users to set values\n * at locations before converting to an immutable `tf.Tensor`.\n *\n * See `tf.buffer` for creating a tensor buffer.\n *\n * @doc {heading: 'Tensors', subheading: 'Classes'}\n */\nexport class TensorBuffer<R extends Rank, D extends DataType = 'float32'> {\n  size: number;\n  shape: ShapeMap[R];\n  strides: number[];\n  values: DataTypeMap[D];\n\n  constructor(shape: ShapeMap[R], public dtype: D, values?: DataTypeMap[D]) {\n    this.shape = shape.slice() as ShapeMap[R];\n    this.size = util.sizeFromShape(shape);\n\n    if (values != null) {\n      const n = values.length;\n      util.assert(\n          n === this.size,\n          () => `Length of values '${n}' does not match the size ` +\n              `inferred by the shape '${this.size}'.`);\n    }\n    if (dtype === 'complex64') {\n      throw new Error(\n          `complex64 dtype TensorBuffers are not supported. Please create ` +\n          `a TensorBuffer for the real and imaginary parts separately and ` +\n          `call tf.complex(real, imag).`);\n    }\n    this.values = values || util.getArrayFromDType(dtype, this.size);\n    this.strides = computeStrides(shape);\n  }\n\n  /**\n   * Sets a value in the buffer at a given location.\n   *\n   * @param value The value to set.\n   * @param locs  The location indices.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Creation'}\n   */\n  set(value: SingleValueMap[D], ...locs: number[]): void {\n    if (locs.length === 0) {\n      locs = [0];\n    }\n    util.assert(\n        locs.length === this.rank,\n        () => `The number of provided coordinates (${locs.length}) must ` +\n            `match the rank (${this.rank})`);\n\n    const index = this.locToIndex(locs);\n    this.values[index] = value as number;\n  }\n\n  /**\n   * Returns the value in the buffer at the provided location.\n   *\n   * @param locs The location indices.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Creation'}\n   */\n  get(...locs: number[]): SingleValueMap[D] {\n    if (locs.length === 0) {\n      locs = [0];\n    }\n    let i = 0;\n    for (const loc of locs) {\n      if (loc < 0 || loc >= this.shape[i]) {\n        const msg = `Requested out of range element at ${locs}. ` +\n            `  Buffer shape=${this.shape}`;\n        throw new Error(msg);\n      }\n      i++;\n    }\n    let index = locs[locs.length - 1];\n    for (let i = 0; i < locs.length - 1; ++i) {\n      index += this.strides[i] * locs[i];\n    }\n    return this.values[index] as SingleValueMap[D];\n  }\n\n  locToIndex(locs: number[]): number {\n    if (this.rank === 0) {\n      return 0;\n    } else if (this.rank === 1) {\n      return locs[0];\n    }\n    let index = locs[locs.length - 1];\n    for (let i = 0; i < locs.length - 1; ++i) {\n      index += this.strides[i] * locs[i];\n    }\n    return index;\n  }\n\n  indexToLoc(index: number): number[] {\n    if (this.rank === 0) {\n      return [];\n    } else if (this.rank === 1) {\n      return [index];\n    }\n    const locs: number[] = new Array(this.shape.length);\n    for (let i = 0; i < locs.length - 1; ++i) {\n      locs[i] = Math.floor(index / this.strides[i]);\n      index -= locs[i] * this.strides[i];\n    }\n    locs[locs.length - 1] = index;\n    return locs;\n  }\n\n  get rank() {\n    return this.shape.length;\n  }\n\n  /**\n   * Creates an immutable `tf.Tensor` object from the buffer.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Creation'}\n   */\n  toTensor(): Tensor<R> {\n    return trackerFn().makeTensor(this.values, this.shape, this.dtype) as\n        Tensor<R>;\n  }\n}\n\nexport interface DataToGPUWebGLOption {\n  customTexShape?: [number, number];\n}\n\nexport type DataToGPUOptions = DataToGPUWebGLOption;\n\nexport interface GPUData {\n  tensorRef: Tensor;\n  texture?: WebGLTexture;\n  buffer?: GPUBuffer;\n  texShape?: [number, number];\n}\n\nexport interface TensorTracker {\n  makeTensor(\n      values: DataValues, shape: number[], dtype: DataType,\n      backend?: Backend): Tensor;\n  makeVariable(\n      initialValue: Tensor, trainable?: boolean, name?: string,\n      dtype?: DataType): Variable;\n  incRef(a: Tensor, backend: Backend): void;\n  disposeTensor(t: Tensor): void;\n  disposeVariable(v: Variable): void;\n  read(dataId: DataId): Promise<BackendValues>;\n  readSync(dataId: DataId): BackendValues;\n  readToGPU(dataId: DataId, options?: DataToGPUOptions): GPUData;\n}\n\n/**\n * The Tensor class calls into this handler to delegate chaining operations.\n */\nexport interface OpHandler {\n  cast<T extends Tensor>(x: T, dtype: DataType): T;\n  buffer<R extends Rank, D extends DataType>(\n      shape: ShapeMap[R], dtype: D,\n      values?: DataTypeMap[D]): TensorBuffer<R, D>;\n  print<T extends Tensor>(x: T, verbose: boolean): void;\n  clone<T extends Tensor>(x: T): T;\n  // TODO(yassogba) bring reshape back?\n}\n\n// For tracking tensor creation and disposal.\nlet trackerFn: () => TensorTracker = null;\n// Used by chaining methods to call into ops.\nlet opHandler: OpHandler = null;\n// Used to warn about deprecated methods.\nlet deprecationWarningFn: (msg: string) => void = null;\n// This here so that we can use this method on dev branches and keep the\n// functionality at master.\n// tslint:disable-next-line:no-unused-expression\n[deprecationWarningFn];\n\n/**\n * An external consumer can register itself as the tensor tracker. This way\n * the Tensor class can notify the tracker for every tensor created and\n * disposed.\n */\nexport function setTensorTracker(fn: () => TensorTracker) {\n  trackerFn = fn;\n}\n\n/**\n * An external consumer can register itself as the op handler. This way the\n * Tensor class can have chaining methods that call into ops via the op\n * handler.\n */\nexport function setOpHandler(handler: OpHandler) {\n  opHandler = handler;\n}\n\n/**\n * Sets the deprecation warning function to be used by this file. This way the\n * Tensor class can be a leaf but still use the environment.\n */\nexport function setDeprecationWarningFn(fn: (msg: string) => void) {\n  deprecationWarningFn = fn;\n}\n\n// Declare this namespace to make Tensor class augmentation work in google3.\nexport declare namespace Tensor {}\n/**\n * A `tf.Tensor` object represents an immutable, multidimensional array of\n * numbers that has a shape and a data type.\n *\n * For performance reasons, functions that create tensors do not necessarily\n * perform a copy of the data passed to them (e.g. if the data is passed as a\n * `Float32Array`), and changes to the data will change the tensor. This is not\n * a feature and is not supported. To avoid this behavior, use the tensor before\n * changing the input data or create a copy with `copy = tf.add(yourTensor, 0)`.\n *\n * See `tf.tensor` for details on how to create a `tf.Tensor`.\n *\n * @doc {heading: 'Tensors', subheading: 'Classes'}\n */\nexport class Tensor<R extends Rank = Rank> implements TensorInfo {\n  /** Unique id of this tensor. */\n  readonly id: number;\n  /**\n   * Id of the bucket holding the data for this tensor. Multiple arrays can\n   * point to the same bucket (e.g. when calling array.reshape()).\n   */\n  dataId: DataId;\n  /** The shape of the tensor. */\n  readonly shape: ShapeMap[R];\n  /** Number of elements in the tensor. */\n  readonly size: number;\n  /** The data type for the array. */\n  readonly dtype: DataType;\n  /** The rank type for the array (see `Rank` enum). */\n  readonly rankType: R;\n\n  /** Whether this tensor has been globally kept. */\n  kept = false;\n  /** The id of the scope this tensor is being tracked in. */\n  scopeId: number;\n  /** The keras mask that some keras layers attach to the tensor */\n  kerasMask?: Tensor;\n\n  /**\n   * Number of elements to skip in each dimension when indexing. See\n   * https://docs.scipy.org/doc/numpy/reference/generated/\\\n   * numpy.ndarray.strides.html\n   */\n  readonly strides: number[];\n\n  constructor(shape: ShapeMap[R], dtype: DataType, dataId: DataId, id: number) {\n    this.shape = shape.slice() as ShapeMap[R];\n    this.dtype = dtype || 'float32';\n    this.size = util.sizeFromShape(shape);\n    this.strides = computeStrides(shape);\n    this.dataId = dataId;\n    this.id = id;\n    this.rankType = (this.rank < 5 ? this.rank.toString() : 'higher') as R;\n  }\n\n  get rank(): number {\n    return this.shape.length;\n  }\n\n  /**\n   * Returns a promise of `tf.TensorBuffer` that holds the underlying data.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  async buffer<D extends DataType = 'float32'>(): Promise<TensorBuffer<R, D>> {\n    const vals = await this.data<D>();\n    return opHandler.buffer(this.shape, this.dtype as D, vals);\n  }\n\n  /**\n   * Returns a `tf.TensorBuffer` that holds the underlying data.\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  bufferSync<D extends DataType = 'float32'>(): TensorBuffer<R, D> {\n    return opHandler.buffer(this.shape, this.dtype as D, this.dataSync());\n  }\n\n  /**\n   * Returns the tensor data as a nested array. The transfer of data is done\n   * asynchronously.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  async array(): Promise<ArrayMap[R]> {\n    const vals = await this.data();\n    return toNestedArray(this.shape, vals, this.dtype === 'complex64') as\n        ArrayMap[R];\n  }\n\n  /**\n   * Returns the tensor data as a nested array. The transfer of data is done\n   * synchronously.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  arraySync(): ArrayMap[R] {\n    return toNestedArray(\n               this.shape, this.dataSync(), this.dtype === 'complex64') as\n        ArrayMap[R];\n  }\n\n  /**\n   * Asynchronously downloads the values from the `tf.Tensor`. Returns a\n   * promise of `TypedArray` that resolves when the computation has finished.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  async data<D extends DataType = NumericDataType>(): Promise<DataTypeMap[D]> {\n    this.throwIfDisposed();\n    const data = trackerFn().read(this.dataId);\n    if (this.dtype === 'string') {\n      const bytes = await data as Uint8Array[];\n      try {\n        return bytes.map(b => util.decodeString(b)) as DataTypeMap[D];\n      } catch {\n        throw new Error(\n            'Failed to decode the string bytes into utf-8. ' +\n            'To get the original bytes, call tensor.bytes().');\n      }\n    }\n    return data as Promise<DataTypeMap[D]>;\n  }\n\n  /**\n   * Copy the tensor's data to a new GPU resource. Comparing to the `dataSync()`\n   * and `data()`, this method prevents data from being downloaded to CPU.\n   *\n   * For WebGL backend, the data will be stored on a densely packed texture.\n   * This means that the texture will use the RGBA channels to store value.\n   *\n   * For WebGPU backend, the data will be stored on a buffer. There is no\n   * parameter, so can not use a user-defined size to create the buffer.\n   *\n   * @param options:\n   *     For WebGL,\n   *         - customTexShape: Optional. If set, will use the user defined\n   *     texture shape to create the texture.\n   *\n   * @returns For WebGL backend, a GPUData contains the new texture and\n   *     its information.\n   *     {\n   *        tensorRef: The tensor that is associated with this texture,\n   *        texture: WebGLTexture,\n   *        texShape: [number, number] // [height, width]\n   *     }\n   *\n   *     For WebGPU backend, a GPUData contains the new buffer.\n   *     {\n   *        tensorRef: The tensor that is associated with this buffer,\n   *        buffer: GPUBuffer,\n   *     }\n   *\n   *     Remember to dispose the GPUData after it is used by\n   *     `res.tensorRef.dispose()`.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  dataToGPU(options?: DataToGPUOptions): GPUData {\n    this.throwIfDisposed();\n    return trackerFn().readToGPU(this.dataId, options);\n  }\n\n  /**\n   * Synchronously downloads the values from the `tf.Tensor`. This blocks the\n   * UI thread until the values are ready, which can cause performance issues.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  dataSync<D extends DataType = NumericDataType>(): DataTypeMap[D] {\n    this.throwIfDisposed();\n    const data = trackerFn().readSync(this.dataId);\n    if (this.dtype === 'string') {\n      try {\n        return (data as Uint8Array[]).map(b => util.decodeString(b)) as\n            DataTypeMap[D];\n      } catch {\n        throw new Error(\n            'Failed to decode the string bytes into utf-8. ' +\n            'To get the original bytes, call tensor.bytes().');\n      }\n    }\n    return data as DataTypeMap[D];\n  }\n\n  /** Returns the underlying bytes of the tensor's data. */\n  async bytes(): Promise<Uint8Array[]|Uint8Array> {\n    this.throwIfDisposed();\n    const data = await trackerFn().read(this.dataId);\n    if (this.dtype === 'string') {\n      return data as Uint8Array[];\n    } else {\n      return new Uint8Array((data as TypedArray).buffer);\n    }\n  }\n\n  /**\n   * Disposes `tf.Tensor` from memory.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  dispose(): void {\n    if (this.isDisposed) {\n      return;\n    }\n    if (this.kerasMask) {\n      this.kerasMask.dispose();\n    }\n    trackerFn().disposeTensor(this);\n    this.isDisposedInternal = true;\n  }\n\n  protected isDisposedInternal = false;\n  get isDisposed(): boolean {\n    return this.isDisposedInternal;\n  }\n\n  throwIfDisposed() {\n    if (this.isDisposed) {\n      throw new Error(`Tensor is disposed.`);\n    }\n  }\n\n  /**\n   * Prints the `tf.Tensor`. See `tf.print` for details.\n   *\n   * @param verbose Whether to print verbose information about the tensor,\n   *    including dtype and size.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  print(verbose = false): void {\n    return opHandler.print(this, verbose);\n  }\n\n  /**\n   * Returns a copy of the tensor. See `tf.clone` for details.\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  clone<T extends Tensor>(this: T): T {\n    this.throwIfDisposed();\n    return opHandler.clone(this);\n  }\n\n  /**\n   * Returns a human-readable description of the tensor. Useful for logging.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  toString(verbose = false): string {\n    const vals = this.dataSync();\n    return tensorToString(vals, this.shape, this.dtype, verbose);\n  }\n\n  cast<T extends this>(dtype: DataType): T {\n    this.throwIfDisposed();\n    return opHandler.cast(this as T, dtype);\n  }\n  variable(trainable = true, name?: string, dtype?: DataType): Variable<R> {\n    this.throwIfDisposed();\n    return trackerFn().makeVariable(this, trainable, name, dtype) as\n        Variable<R>;\n  }\n}\n\nObject.defineProperty(Tensor, Symbol.hasInstance, {\n  value: (instance: Tensor) => {\n    // Implementation note: we should use properties of the object that will be\n    // defined before the constructor body has finished executing (methods).\n    // This is because when this code is transpiled by babel, babel will call\n    // classCallCheck before the constructor body is run.\n    // See https://github.com/tensorflow/tfjs/issues/3384 for backstory.\n    return !!instance && instance.data != null && instance.dataSync != null &&\n        instance.throwIfDisposed != null;\n  }\n});\n\nexport function getGlobalTensorClass() {\n  // Use getGlobal so that we can augment the Tensor class across package\n  // boundaries because the node resolution alg may result in different modules\n  // being returned for this file depending on the path they are loaded from.\n  return getGlobal('Tensor', () => {\n    return Tensor;\n  });\n}\n\n// Global side effect. Cache global reference to Tensor class\ngetGlobalTensorClass();\n\nexport interface NumericTensor<R extends Rank = Rank> extends Tensor<R> {\n  dtype: NumericDataType;\n  dataSync<D extends DataType = NumericDataType>(): DataTypeMap[D];\n  data<D extends DataType = NumericDataType>(): Promise<DataTypeMap[D]>;\n  dataToGPU(options?: DataToGPUOptions): GPUData;\n}\n\nexport interface StringTensor<R extends Rank = Rank> extends Tensor<R> {\n  dtype: 'string';\n  dataSync<D extends DataType = 'string'>(): DataTypeMap[D];\n  data<D extends DataType = 'string'>(): Promise<DataTypeMap[D]>;\n}\n\n/** @doclink Tensor */\nexport type Scalar = Tensor<Rank.R0>;\n/** @doclink Tensor */\nexport type Tensor1D = Tensor<Rank.R1>;\n/** @doclink Tensor */\nexport type Tensor2D = Tensor<Rank.R2>;\n/** @doclink Tensor */\nexport type Tensor3D = Tensor<Rank.R3>;\n/** @doclink Tensor */\nexport type Tensor4D = Tensor<Rank.R4>;\n/** @doclink Tensor */\nexport type Tensor5D = Tensor<Rank.R5>;\n/** @doclink Tensor */\nexport type Tensor6D = Tensor<Rank.R6>;\n\n/**\n * A mutable `tf.Tensor`, useful for persisting state, e.g. for training.\n *\n * @doc {heading: 'Tensors', subheading: 'Classes'}\n */\nexport class Variable<R extends Rank = Rank> extends Tensor<R> {\n  name: string;\n\n  constructor(\n      initialValue: Tensor<R>, public trainable: boolean, name: string,\n      tensorId: number) {\n    super(\n        initialValue.shape, initialValue.dtype, initialValue.dataId, tensorId);\n    this.name = name;\n  }\n\n  /**\n   * Assign a new `tf.Tensor` to this variable. The new `tf.Tensor` must have\n   * the same shape and dtype as the old `tf.Tensor`.\n   *\n   * @param newValue New tensor to be assigned to this variable.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  assign(newValue: Tensor<R>): void {\n    if (newValue.dtype !== this.dtype) {\n      throw new Error(\n          `dtype of the new value (${newValue.dtype}) and ` +\n          `previous value (${this.dtype}) must match`);\n    }\n    if (!util.arraysEqual(newValue.shape, this.shape)) {\n      throw new Error(\n          `shape of the new value (${newValue.shape}) and ` +\n          `previous value (${this.shape}) must match`);\n    }\n    trackerFn().disposeTensor(this);\n    this.dataId = newValue.dataId;\n    trackerFn().incRef(this, null /* backend */);\n  }\n\n  override dispose(): void {\n    trackerFn().disposeVariable(this);\n    this.isDisposedInternal = true;\n  }\n}\n\nObject.defineProperty(Variable, Symbol.hasInstance, {\n  value: (instance: Variable) => {\n    return instance instanceof Tensor && instance.assign != null &&\n        instance.assign instanceof Function;\n  }\n});\n", "/**\n * @license\n * Copyright 2017 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/** @docalias number[] */\nexport interface ShapeMap {\n  R0: number[];\n  R1: [number];\n  R2: [number, number];\n  R3: [number, number, number];\n  R4: [number, number, number, number];\n  R5: [number, number, number, number, number];\n  R6: [number, number, number, number, number, number];\n}\n\n/** @docalias number[] */\nexport interface ArrayMap {\n  R0: number;\n  R1: number[];\n  R2: number[][];\n  R3: number[][][];\n  R4: number[][][][];\n  R5: number[][][][][];\n  R6: number[][][][][][];\n}\n\nexport interface DataTypeMap {\n  float32: Float32Array;\n  int32: Int32Array;\n  bool: Uint8Array;\n  complex64: Float32Array;\n  string: string[];\n}\n\nexport interface SingleValueMap {\n  bool: boolean;\n  int32: number;\n  float32: number;\n  complex64: number;\n  string: string;\n}\n\n/** @docalias 'float32'|'int32'|'bool'|'complex64'|'string' */\nexport type DataType = keyof DataTypeMap;\nexport type NumericDataType = 'float32'|'int32'|'bool'|'complex64';\n\nexport type DataTypeFor<T extends number|string|boolean> =\n    T extends number|boolean ? NumericDataType : T extends string ? 'string' :\n                                                                    never;\n\nexport type TypedArray = Float32Array|Int32Array|Uint8Array;\n/** Tensor data used in tensor creation and user-facing API. */\nexport type DataValues = DataTypeMap[DataType];\n/** The underlying tensor data that gets stored in a backend. */\nexport type BackendValues = Float32Array|Int32Array|Uint8Array|Uint8Array[];\n\nexport enum Rank {\n  R0 = 'R0',\n  R1 = 'R1',\n  R2 = 'R2',\n  R3 = 'R3',\n  R4 = 'R4',\n  R5 = 'R5',\n  R6 = 'R6'\n}\n\nexport type FlatVector = boolean[]|number[]|TypedArray;\nexport type RegularArray<T> =\n    T[]|T[][]|T[][][]|T[][][][]|T[][][][][]|T[][][][][][];\n\n// tslint:disable-next-line:no-any\nexport interface RecursiveArray<T extends any> {\n  [index: number]: T|RecursiveArray<T>;\n}\n\n// Looks for upcasting types. Used, for example, in operations with mixed dtype\n// inputs.\nenum UpcastInt32AndMap {\n  'float32' = 'float32',\n  'int32' = 'int32',\n  'bool' = 'int32',\n  'complex64' = 'complex64'\n}\n\nenum UpcastBoolAndMap {\n  'float32' = 'float32',\n  'int32' = 'int32',\n  'bool' = 'bool',\n  'complex64' = 'complex64'\n}\n\nenum UpcastFloat32AndMap {\n  'float32' = 'float32',\n  'int32' = 'float32',\n  'bool' = 'float32',\n  'complex64' = 'complex64'\n}\n\nenum UpcastComplex64AndMap {\n  'float32' = 'complex64',\n  'int32' = 'complex64',\n  'bool' = 'complex64',\n  'complex64' = 'complex64'\n}\n\nconst upcastTypeMap = {\n  'float32': UpcastFloat32AndMap,\n  'int32': UpcastInt32AndMap,\n  'bool': UpcastBoolAndMap,\n  'complex64': UpcastComplex64AndMap\n};\n\nexport function upcastType(typeA: DataType, typeB: DataType): DataType {\n  if (typeA === 'string' || typeB === 'string') {\n    if (typeA === 'string' && typeB === 'string') {\n      return 'string';\n    }\n    throw new Error(`Can not upcast ${typeA} with ${typeB}`);\n  }\n  return upcastTypeMap[typeA][typeB];\n}\n\n/** Returns the output type after summation. */\nexport function sumOutType(type: DataType): DataType {\n  return upcastType(type, 'int32');\n}\n\n/** @docalias TypedArray|Array */\nexport type TensorLike =\n    TypedArray|number|boolean|string|RecursiveArray<number|number[]|TypedArray>|\n    RecursiveArray<boolean>|RecursiveArray<string>|Uint8Array[];\nexport type ScalarLike = number|boolean|string|Uint8Array;\n/** @docalias TypedArray|Array */\nexport type TensorLike1D = TypedArray|number[]|boolean[]|string[]|Uint8Array[];\n/** @docalias TypedArray|Array */\nexport type TensorLike2D = TypedArray|number[]|number[][]|boolean[]|boolean[][]|\n    string[]|string[][]|Uint8Array[]|Uint8Array[][];\n/** @docalias TypedArray|Array */\nexport type TensorLike3D = TypedArray|number[]|number[][][]|boolean[]|\n    boolean[][][]|string[]|string[][][]|Uint8Array[]|Uint8Array[][][];\n/** @docalias TypedArray|Array */\nexport type TensorLike4D = TypedArray|number[]|number[][][][]|boolean[]|\n    boolean[][][][]|string[]|string[][][][]|Uint8Array[]|Uint8Array[][][][];\n/** @docalias TypedArray|Array */\nexport type TensorLike5D =\n    TypedArray|number[]|number[][][][][]|boolean[]|boolean[][][][][]|string[]|\n    string[][][][][]|Uint8Array[]|Uint8Array[][][][][];\n/** @docalias TypedArray|Array */\nexport type TensorLike6D =\n    TypedArray|number[]|number[][][][][][]|boolean[]|boolean[][][][][][]|\n    string[]|string[][][][][][]|Uint8Array[]|Uint8Array[][][][][];\n\n/** Type for representing image data in Uint8Array type. */\nexport interface PixelData {\n  width: number;\n  height: number;\n  data: Uint8Array;\n}\n\n/**\n * Type for representing all permutations and combinations of 'RGBA' channels.\n */\nexport type WebGLChannels = 'A'|'B'|'G'|'R'|'AB'|'AG'|'AR'|'BA'|'BG'|'BR'|'GA'|\n    'GB'|'GR'|'RA'|'RB'|'RG'|'ABG'|'ABR'|'AGB'|'AGR'|'ARB'|'ARG'|'BAG'|'BAR'|\n    'BGA'|'BGR'|'BRA'|'BRG'|'GAB'|'GAR'|'GBA'|'GBR'|'GRA'|'GRB'|'RAB'|'RAG'|\n    'RBA'|'RBG'|'RGA'|'RGB'|'ABGR'|'ABRG'|'AGBR'|'AGRB'|'ARBG'|'ARGB'|'BAGR'|\n    'BARG'|'BGAR'|'BGRA'|'BRAG'|'BRGA'|'GABR'|'GARB'|'GBAR'|'GBRA'|'GRAB'|\n    'GRBA'|'RABG'|'RAGB'|'RBAG'|'RBGA'|'RGAB'|'RGBA';\n\n/** Type for representing a texture data to create a tensor. */\nexport interface WebGLData {\n  texture: WebGLTexture;\n  height: number;\n  width: number;\n  channels: WebGLChannels;\n}\n\n/**\n * Type for representing a buffer data to create a tensor. Buffer usage should\n * at least support GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_SRC. When\n * zeroCopy is false or undefined (default), this GPUBuffer will be copied to\n * the tensor's resource buffer. When zeroCopy is true, tensor will use this\n * GPUBuffer as tensor's resource buffer, user should not destroy this GPUBuffer\n * until all access is done. If not specified at creating a tensor, tensor type\n * is float32.\n */\nexport interface WebGPUData {\n  buffer: GPUBuffer;\n  zeroCopy?: boolean;\n}\n\nexport function isWebGLData(values: unknown): values is WebGLData {\n  return values != null && typeof values === 'object' && 'texture' in values &&\n      values.texture instanceof WebGLTexture;\n}\nexport function isWebGPUData(values: unknown): values is WebGPUData {\n  return typeof GPUBuffer !== 'undefined' && values != null &&\n      typeof values === 'object' && 'buffer' in values &&\n      values.buffer instanceof GPUBuffer;\n}\n\nexport interface ImageOptions {\n  /**\n   * Optional. A number in range [0-1]. If the image is a 2D tensor or a 3D\n   * tensor with 1 or 3 channels, the alpha channels would set as its value;\n   * otherwise, it would not make effects.\n   */\n  alpha?: number;\n}\n\nexport interface ContextOptions {\n  /**\n   * Optional.  If the canvas has created a context, it would not make effects.\n   * If it is not set, it would be variable based on the current backend.\n   */\n  contextType?: string;\n  /**\n   * Optional. A WebGLContextAttributes configuration. If the canvas has created\n   * a context, it would not make effects.\n   */\n  contextAttributes?: WebGLContextAttributes;\n}\n\nexport interface DrawOptions {\n  /**\n   * Optional. An object of options to customize the values of image tensor.\n   */\n  imageOptions?: ImageOptions;\n  /**\n   * Optional. An object to configure the context of the canvas to draw to.\n   */\n  contextOptions?: ContextOptions;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from './tensor';\nimport {TensorContainer, TensorContainerArray} from './tensor_types';\nimport {upcastType} from './types';\nimport {assert} from './util';\n\nexport function makeTypesMatch<T extends Tensor>(a: T, b: T): [T, T] {\n  if (a.dtype === b.dtype) {\n    return [a, b];\n  }\n  const dtype = upcastType(a.dtype, b.dtype);\n  return [a.cast(dtype), b.cast(dtype)];\n}\n\nexport function assertTypesMatch(a: Tensor, b: Tensor): void {\n  assert(\n      a.dtype === b.dtype,\n      () => `The dtypes of the first(${a.dtype}) and` +\n          ` second(${b.dtype}) input must match`);\n}\n\nexport function isTensorInList(tensor: Tensor, tensorList: Tensor[]): boolean {\n  return tensorList.some(x => x.id === tensor.id);\n}\n\n/**\n * Extracts any `Tensor`s found within the provided object.\n *\n * @param container an object that may be a `Tensor` or may directly contain\n *   `Tensor`s, such as a `Tensor[]` or `{key: Tensor, ...}`. In general it\n *   is safe to pass any object here, except that `Promise`s are not\n *   supported.\n * @returns An array of `Tensors` found within the passed object. If the\n *   argument is simply a `Tensor', a list containing that `Tensor` is\n *   returned. If the object is not a `Tensor` or does not\n *   contain `Tensors`, an empty list is returned.\n */\nexport function getTensorsInContainer(result: TensorContainer): Tensor[] {\n  const list: Tensor[] = [];\n  const seen = new Set<{}|void>();\n  walkTensorContainer(result, list, seen);\n  return list;\n}\n\nfunction walkTensorContainer(\n    container: TensorContainer, list: Tensor[], seen: Set<{}|void>): void {\n  if (container == null) {\n    return;\n  }\n  if (container instanceof Tensor) {\n    list.push(container);\n    return;\n  }\n  if (!isIterable(container)) {\n    return;\n  }\n  // Iteration over keys works also for arrays.\n  const iterable = container as TensorContainerArray;\n  for (const k in iterable) {\n    const val = iterable[k];\n    if (!seen.has(val)) {\n      seen.add(val);\n      walkTensorContainer(val, list, seen);\n    }\n  }\n}\n\n// tslint:disable-next-line:no-any\nfunction isIterable(obj: any): boolean {\n  return Array.isArray(obj) || typeof obj === 'object';\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {BackendTimingInfo, DataMover, KernelBackend} from './backends/backend';\nimport {Environment, setEnvironmentGlobal} from './environment';\nimport {getGlobalNamespace} from './global_util';\nimport {Add, Cast, Identity} from './kernel_names';\nimport { getGradient, getKernel, getKernelsForBackend, GradFunc, NamedAttrMap } from './kernel_registry';\nimport { TensorInfo } from './tensor_info';\nimport * as log from './log';\nimport {KernelProfile, Profiler} from './profiler';\nimport {backpropagateGradients, getFilteredNodesXToY, TapeNode} from './tape';\nimport {DataToGPUOptions, GPUData, setTensorTracker, Tensor, TensorTracker, Variable} from './tensor';\nimport {DataId} from './tensor_info';\nimport {GradSaveFunc, NamedTensorMap, NamedVariableMap, TensorContainer} from './tensor_types';\nimport {getTensorsInContainer} from './tensor_util';\nimport {BackendValues, DataType, DataValues} from './types';\nimport * as util from './util';\nimport {bytesFromStringArray, makeOnesTypedArray, now, sizeFromShape} from './util';\n\n/**\n * A function that computes an output. The save function is for saving tensors\n * computed in the forward pass, that we need in the backward pass.\n */\nexport type ForwardFunc<T> = (backend: KernelBackend, save?: GradSaveFunc) => T;\n\n/**\n * @docalias (a: Tensor, b: Tensor,..., save?: Function) => {\n *   value: Tensor,\n *   gradFunc: (dy: Tensor, saved?: NamedTensorMap) => Tensor | Tensor[]\n * }\n */\nexport type CustomGradientFunc<T extends Tensor> =\n    (...inputs: Array<Tensor|GradSaveFunc>) => {\n      value: T;\n      gradFunc: (dy: T, saved: Tensor[]) => Tensor | Tensor[];\n    };\n\nexport type MemoryInfo = {\n  numTensors: number; numDataBuffers: number; numBytes: number;\n  unreliable?: boolean; reasons: string[];\n};\n\ntype KernelInfo = {\n  name: string; bytesAdded: number; totalBytesSnapshot: number;\n  tensorsAdded: number;\n  totalTensorsSnapshot: number;\n  inputShapes: number[][];\n  outputShapes: number[][];\n  kernelTimeMs: number | {error: string} | Promise<number|{error: string}>;\n  extraInfo: string | Promise<string>;\n};\n\nexport type ProfileInfo = {\n  newBytes: number; newTensors: number; peakBytes: number;\n  kernels: KernelInfo[];\n  result: TensorContainer;\n  kernelNames: string[];\n};\n\nexport interface TimingInfo extends BackendTimingInfo {\n  wallMs: number;\n}\n\n/** @docalias Function */\nexport type ScopeFn<T extends TensorContainer> = () => T;\n\ninterface ScopeState {\n  track: Tensor[];\n  name: string;\n  id: number;\n}\n\ninterface RegisteredKernelInvocation<I extends NamedTensorMap> {\n  kernelName: string;\n  inputs: I;\n  attrs?: NamedAttrMap;\n}\n\ninterface CustomGradKernelInvocation<T extends Tensor|Tensor[],\n                                               I extends NamedTensorMap> {\n  forwardFunc: ForwardFunc<T>;\n  backwardsFunc: (dy: T, saved: Tensor[]) => {\n    [P in keyof I]: () => I[P]\n  };\n  inputs: I;\n  attrs?: NamedAttrMap;\n}\n\nfunction isRegisteredKernelInvocation<T extends Tensor|Tensor[],\n                                                I extends NamedTensorMap>(\n    kernelInvocation: RegisteredKernelInvocation<I>|\n    CustomGradKernelInvocation<T, I>):\n    kernelInvocation is RegisteredKernelInvocation<I> {\n  return (kernelInvocation as RegisteredKernelInvocation<I>).kernelName != null;\n}\n\nclass EngineState {\n  // Public since optimizers will use it.\n  registeredVariables: NamedVariableMap = {};\n\n  nextTapeNodeId = 0;\n  numBytes = 0;\n  numTensors = 0;\n  numStringTensors = 0;\n  numDataBuffers = 0;\n\n  activeTape: TapeNode[];\n  // Number of nested tf.grad() statements when computing higher-order\n  // gradients. E.g. `1` for first-order gradients and `2` for second-order\n  // gradients. Used to track if the tape should be removed after a backprop.\n  gradientDepth = 0;\n  // Number of nested kernel calls. When kernel depth is greater than 1, we turn\n  // off the tape.\n  kernelDepth = 0;\n\n  // Keep Tensors that parallel the tapes.\n  activeScope: ScopeState;\n  scopeStack: ScopeState[] = [];\n  /**\n   * Keeps track of the number of data moves during a kernel execution. We\n   * maintain a stack since kernels can call other kernels, recursively.\n   */\n  numDataMovesStack: number[] = [];\n  nextScopeId = 0;\n\n  tensorInfo = new WeakMap<DataId, {\n    backend: KernelBackend,\n    bytes: number,\n    dtype: DataType,\n    shape: number[]\n  }>();\n\n  profiling = false;\n  activeProfile: ProfileInfo = {\n    newBytes: 0,\n    newTensors: 0,\n    peakBytes: 0,\n    kernels: [],\n    result: null,\n    get kernelNames():\n        string[] {\n          return Array.from(new Set(this.kernels.map(k => k.name)));\n        }\n  };\n\n  dispose() {\n    for (const variableName in this.registeredVariables) {\n      this.registeredVariables[variableName].dispose();\n    }\n  }\n}\n\nexport class Engine implements TensorTracker, DataMover {\n  state: EngineState;\n  backendName: string;\n  registry: {[id: string]: KernelBackend} = {};\n  registryFactory: {\n    [id: string]: {\n      factory: () => KernelBackend | Promise<KernelBackend>,\n      priority: number\n    }\n  } = {};\n\n  private profiler: Profiler;\n  private backendInstance: KernelBackend;\n  private pendingBackendInit: Promise<boolean>;\n  private pendingBackendInitId = 0;\n\n  constructor(public ENV: Environment) {\n    this.state = new EngineState();\n  }\n\n  async ready(): Promise<void> {\n    if (this.pendingBackendInit != null) {\n      return this.pendingBackendInit.then(() => {});\n    }\n    if (this.backendInstance != null) {\n      return;\n    }\n    const sortedBackends = this.getSortedBackends();\n\n    for (let i = 0; i < sortedBackends.length; i++) {\n      const backendName = sortedBackends[i];\n      const success = await this.initializeBackend(backendName).success;\n      if (success) {\n        await this.setBackend(backendName);\n        return;\n      }\n    }\n\n    throw new Error(\n        `Could not initialize any backends, all backend initializations ` +\n        `failed.`);\n  }\n\n  get backend(): KernelBackend {\n    if (this.pendingBackendInit != null) {\n      throw new Error(\n          `Backend '${this.backendName}' has not yet been initialized. Make ` +\n          `sure to await tf.ready() or await tf.setBackend() before calling ` +\n          `other methods`);\n    }\n    if (this.backendInstance == null) {\n      const {name, asyncInit} = this.initializeBackendsAndReturnBest();\n      if (asyncInit) {\n        throw new Error(\n            `The highest priority backend '${name}' has not yet been ` +\n            `initialized. Make sure to await tf.ready() or ` +\n            `await tf.setBackend() before calling other methods`);\n      }\n      this.setBackend(name);\n    }\n    return this.backendInstance;\n  }\n\n  backendNames(): string[] {\n    return Object.keys(this.registryFactory);\n  }\n\n  findBackend(backendName: string): KernelBackend {\n    if (!(backendName in this.registry)) {\n      // If the backend hasn't been initialized but we have a registry entry for\n      // it, initialize it and return it.\n      if (backendName in this.registryFactory) {\n        const {asyncInit} = this.initializeBackend(backendName);\n        if (asyncInit) {\n          // Backend is not ready yet.\n          return null;\n        }\n      } else {\n        return null;\n      }\n    }\n    return this.registry[backendName];\n  }\n\n  findBackendFactory(backendName: string):\n      () => KernelBackend | Promise<KernelBackend> {\n    if (!(backendName in this.registryFactory)) {\n      return null;\n    }\n    return this.registryFactory[backendName].factory;\n  }\n\n  registerBackend(\n      backendName: string,\n      factory: () => KernelBackend | Promise<KernelBackend>,\n      priority = 1): boolean {\n    if (backendName in this.registryFactory) {\n      log.warn(\n          `${backendName} backend was already registered. ` +\n          `Reusing existing backend factory.`);\n      return false;\n    }\n    this.registryFactory[backendName] = {factory, priority};\n    return true;\n  }\n\n  async setBackend(backendName: string): Promise<boolean> {\n    if (this.registryFactory[backendName] == null) {\n      throw new Error(`Backend name '${backendName}' not found in registry`);\n    }\n    this.backendName = backendName;\n    if (this.registry[backendName] == null) {\n      this.backendInstance = null;\n      const {success, asyncInit} = this.initializeBackend(backendName);\n      const result = asyncInit ? await success : success;\n      if (!result) {\n        return false;\n      }\n    }\n    this.backendInstance = this.registry[backendName];\n    this.setupRegisteredKernels();\n    // Reset the profiler.\n    this.profiler = new Profiler(this.backendInstance);\n\n    return true;\n  }\n\n  private setupRegisteredKernels(): void {\n    const kernels = getKernelsForBackend(this.backendName);\n    kernels.forEach(kernel => {\n      if (kernel.setupFunc != null) {\n        kernel.setupFunc(this.backendInstance);\n      }\n    });\n  }\n\n  private disposeRegisteredKernels(backendName: string): void {\n    const kernels = getKernelsForBackend(backendName);\n    kernels.forEach(kernel => {\n      if (kernel.disposeFunc != null) {\n        kernel.disposeFunc(this.registry[backendName]);\n      }\n    });\n  }\n\n  /**\n   * Initializes a backend by looking up the backend name in the factory\n   * registry and calling the factory method. Returns a boolean representing\n   * whether the initialization of the backend succeeded. Throws an error if\n   * there is no backend in the factory registry.\n   */\n  private initializeBackend(backendName: string):\n      {success: boolean|Promise<boolean>, asyncInit: boolean} {\n    const registryFactoryEntry = this.registryFactory[backendName];\n    if (registryFactoryEntry == null) {\n      throw new Error(\n          `Cannot initialize backend ${backendName}, no registration found.`);\n    }\n\n    try {\n      const backend = registryFactoryEntry.factory();\n      /* Test if the factory returns a promise.\n      Done in a more liberal way than\n      previous 'Promise.resolve(backend)===backend'\n      as we needed to account for custom Promise\n      implementations (e.g. Angular) */\n      if (backend && !(backend instanceof KernelBackend) &&\n          typeof backend.then === 'function') {\n        const promiseId = ++this.pendingBackendInitId;\n        const success =\n            backend\n                .then(backendInstance => {\n                  // Outdated promise. Another backend was set in the meantime.\n                  if (promiseId < this.pendingBackendInitId) {\n                    return false;\n                  }\n                  this.registry[backendName] = backendInstance;\n                  this.pendingBackendInit = null;\n                  return true;\n                })\n                .catch(err => {\n                  // Outdated promise. Another backend was set in the meantime.\n                  if (promiseId < this.pendingBackendInitId) {\n                    return false;\n                  }\n                  this.pendingBackendInit = null;\n                  log.warn(`Initialization of backend ${backendName} failed`);\n                  log.warn(err.stack || err.message);\n                  return false;\n                });\n        this.pendingBackendInit = success;\n        return {success, asyncInit: true};\n      } else {\n        this.registry[backendName] = backend as KernelBackend;\n        return {success: true, asyncInit: false};\n      }\n    } catch (err) {\n      log.warn(`Initialization of backend ${backendName} failed`);\n      log.warn(err.stack || err.message);\n      return {success: false, asyncInit: false};\n    }\n  }\n\n  removeBackend(backendName: string): void {\n    if (!(backendName in this.registryFactory)) {\n      throw new Error(`${backendName} backend not found in registry`);\n    }\n    if (this.backendName === backendName && this.pendingBackendInit != null) {\n      // There is a pending promise of the backend we want to remove. Make it\n      // obsolete.\n      this.pendingBackendInitId++;\n    }\n\n    if (backendName in this.registry) {\n      this.disposeRegisteredKernels(backendName);\n      this.registry[backendName].dispose();\n      delete this.registry[backendName];\n    }\n\n    delete this.registryFactory[backendName];\n\n    // Unset the backend if it is active.\n    if (this.backendName === backendName) {\n      this.pendingBackendInit = null;\n      this.backendName = null;\n      this.backendInstance = null;\n    }\n  }\n\n  private getSortedBackends(): string[] {\n    if (Object.keys(this.registryFactory).length === 0) {\n      throw new Error('No backend found in registry.');\n    }\n    return Object.keys(this.registryFactory).sort((a: string, b: string) => {\n      // Highest priority comes first.\n      return this.registryFactory[b].priority -\n          this.registryFactory[a].priority;\n    });\n  }\n\n  private initializeBackendsAndReturnBest():\n      {name: string, asyncInit: boolean} {\n    const sortedBackends = this.getSortedBackends();\n\n    for (let i = 0; i < sortedBackends.length; i++) {\n      const backendName = sortedBackends[i];\n      const {success, asyncInit} = this.initializeBackend(backendName);\n      if (asyncInit || success) {\n        return {name: backendName, asyncInit};\n      }\n    }\n    throw new Error(\n        `Could not initialize any backends, all backend initializations ` +\n        `failed.`);\n  }\n\n  moveData(backend: KernelBackend, dataId: DataId) {\n    const info = this.state.tensorInfo.get(dataId);\n    const srcBackend = info.backend;\n    const values = this.readSync(dataId);\n    const refCount = srcBackend.refCount(dataId);\n    // Delete the tensor from the old backend and move it to the new\n    // backend.\n    srcBackend.disposeData(dataId, true);\n    info.backend = backend;\n    backend.move(dataId, values, info.shape, info.dtype, refCount);\n    if (this.shouldCheckForMemLeaks()) {\n      // Track the number of moves during a kernel execution to correctly\n      // detect memory leaks.\n      this.state.numDataMovesStack[this.state.numDataMovesStack.length - 1]++;\n    }\n  }\n\n  tidy<T extends TensorContainer>(nameOrFn: string|ScopeFn<T>, fn?: ScopeFn<T>):\n      T {\n    let name: string = null;\n    if (fn == null) {\n      // Called with only 1 argument.\n      if (typeof nameOrFn !== 'function') {\n        throw new Error('Please provide a function to tidy()');\n      }\n      fn = nameOrFn;\n    } else {\n      // Called with 2 arguments.\n      if (typeof nameOrFn !== 'string' && !(nameOrFn instanceof String)) {\n        throw new Error(\n            'When calling with two arguments, the first argument ' +\n            'to tidy() must be a string');\n      }\n      if (typeof fn !== 'function') {\n        throw new Error(\n            'When calling with two arguments, the 2nd argument ' +\n            'to tidy() must be a function');\n      }\n      name = nameOrFn as string;\n      // TODO(nsthorat,smilkov): Do operation logging and performance\n      // profiling.\n    }\n    let result: T;\n    return this.scopedRun(\n        () => this.startScope(name), () => this.endScope(result), () => {\n          result = fn();\n          if (result instanceof Promise) {\n            console.error('Cannot return a Promise inside of tidy.');\n          }\n          return result;\n        });\n  }\n\n  private scopedRun<T>(start: () => void, end: () => void, f: () => T): T {\n    start();\n    try {\n      const res = f();\n      end();\n      return res;\n    } catch (ex) {\n      end();\n      throw ex;\n    }\n  }\n\n  private static nextTensorId = 0;\n  private nextTensorId(): number {\n    return Engine.nextTensorId++;\n  }\n\n  private static nextVariableId = 0;\n  private nextVariableId(): number {\n    return Engine.nextVariableId++;\n  }\n\n  /**\n   * This method is called instead of the public-facing tensor.clone() when\n   * saving a tensor for backwards pass. It makes sure to add the clone\n   * operation to the tape regardless of being called inside a kernel\n   * execution.\n   */\n  private clone(x: Tensor): Tensor {\n    const y: Tensor = ENGINE.runKernel(Identity,\n                                       {x} as unknown as NamedTensorMap);\n    const inputs = {x};\n    const grad = (dy: Tensor) => ({\n      x: () => {\n        const dtype = 'float32';\n        const gradInputs = {x: dy};\n        const attrs = {dtype};\n\n        return ENGINE.runKernel(\n                   Cast, gradInputs as unknown as NamedTensorMap,\n                   // tslint:disable-next-line: no-unnecessary-type-assertion\n                   attrs as unknown as NamedAttrMap) as Tensor;\n      }\n    });\n    const saved: Tensor[] = [];\n    this.addTapeNode(this.state.activeScope.name, inputs, [y], grad, saved, {});\n    return y;\n  }\n\n  /**\n   * Execute a kernel with the given name and return the output tensor.\n   *\n   * @param kernelName The name of the kernel to execute.\n   * @param inputs A map of input names to tensors.\n   * @param attrs A map of attribute names to their values. An attribute is a\n   *     primitive (non-tensor) input to the kernel.\n   * @param inputsToSave A list of tensors, inputs to save for the backprop\n   *     computation.\n   * @param outputsToSave A list of booleans, specifying which output to save\n   *     for the backprop computation. These are booleans since the output\n   * tensors are not visible to the user.\n   */\n  runKernel<T extends Tensor|Tensor[]>(\n      kernelName: string, inputs: NamedTensorMap, attrs?: NamedAttrMap): T {\n    if (this.backendName == null) {\n      // backend has not been initialized yet (backend initialization is lazy\n      // can be deferred until an op/ kernel is run).\n      // The below getter has side effects that will try to initialize the\n      // backend and set properties like this.backendName\n      // tslint:disable-next-line: no-unused-expression\n      this.backend;\n    }\n    const hasKernel = getKernel(kernelName, this.backendName) != null;\n    if (!hasKernel) {\n      throw new Error(`Kernel '${kernelName}' not registered for backend '${\n          this.backendName}'`);\n    }\n    return this.runKernelFunc({kernelName, inputs, attrs});\n  }\n\n  private shouldCheckForMemLeaks(): boolean {\n    return this.ENV.getBool('IS_TEST');\n  }\n\n  private checkKernelForMemLeak(\n      kernelName: string, numDataIdsBefore: number,\n      outInfos: TensorInfo[]): void {\n    const numDataIdsAfter = this.backend.numDataIds();\n\n    // Count the number of data ids associated with the result of the kernel.\n    let numOutputDataIds = 0;\n    outInfos.forEach(info => {\n      // Complex numbers allocate 3 data ids, one for 'real', one for\n      // 'imaginary', and one for the container that holds the former two.\n      numOutputDataIds += (info.dtype === 'complex64' ? 3 : 1);\n    });\n\n    // Account for the number of moves during kernel execution. A \"data move\"\n    // can happen in the middle of a kernel execution, placing a new (key,value)\n    // pair in the data storage. Since data moves have net zero effect (we\n    // always remove the data from the old backend), we have to cancel them out\n    // when detecting memory leaks.\n    const numMoves =\n        this.state.numDataMovesStack[this.state.numDataMovesStack.length - 1];\n    const dataIdsLeaked =\n        numDataIdsAfter - numDataIdsBefore - numOutputDataIds - numMoves;\n    if (dataIdsLeaked > 0) {\n      throw new Error(\n          `Backend '${this.backendName}' has an internal memory leak ` +\n          `(${dataIdsLeaked} data ids) after running '${kernelName}'`);\n    }\n  }\n\n  /**\n   * Internal helper method to execute a kernel Func\n   *\n   * Use `runKernel` to execute kernels from outside of engine.\n   */\n  private runKernelFunc<T extends Tensor|Tensor[], I extends NamedTensorMap>(\n      kernelParams: RegisteredKernelInvocation<I>|\n      CustomGradKernelInvocation<T, I>): T {\n    let outputs: Tensor[];\n    let saved: Tensor[] = [];\n    const isTapeOn = this.isTapeOn();\n\n    const startingBytecount = this.state.numBytes;\n    const startingNumTensors = this.state.numTensors;\n\n    if (this.shouldCheckForMemLeaks()) {\n      this.state.numDataMovesStack.push(0);\n    }\n\n    let kernelFunc: () => Tensor[];\n    if (this.backendName == null) {\n      // backend has not been initialized yet (backend initialization is lazy\n      // can be deferred until an op/ kernel is run).\n      // The below getter has side effects that will try to initialize the\n      // backend and set properties like this.backendName\n      // tslint:disable-next-line: no-unused-expression\n      this.backend;\n    }\n\n    let out: TensorInfo|TensorInfo[];\n\n    const kernelOrScopeName = isRegisteredKernelInvocation(kernelParams) ?\n        kernelParams.kernelName :\n        this.state.activeScope != null ? this.state.activeScope.name : '';\n\n    // Create the kernelFunc from either a registered kernel OR passed in\n    // forward/backward functions (used by custom grad). In this context a\n    // kernelFunc wraps a kernel implementation with some bookkeeping.\n\n    if (isRegisteredKernelInvocation(kernelParams)) {\n      const {kernelName, inputs, attrs} = kernelParams;\n      if (this.backendName == null) {\n        // backend has not been initialized yet (backend initialization is lazy\n        // can be deferred until an op/ kernel is run).\n        // The below getter has side effects that will try to initialize the\n        // backend and set properties like this.backendName\n        // tslint:disable-next-line: no-unused-expression\n        this.backend;\n      }\n      const kernel = getKernel(kernelName, this.backendName);\n      util.assert(\n          kernel != null,\n          () => `Cannot find registered kernel '${kernelName}' for backend '${\n              this.backendName}'`);\n\n      kernelFunc = () => {\n        const numDataIdsBefore = this.backend.numDataIds();\n        out = kernel.kernelFunc({inputs, attrs, backend: this.backend});\n        const outInfos = Array.isArray(out) ? out : [out];\n        if (this.shouldCheckForMemLeaks()) {\n          this.checkKernelForMemLeak(kernelName, numDataIdsBefore, outInfos);\n        }\n\n        const outTensors = outInfos.map((outInfo: TensorInfo|Tensor) => {\n          // todo (yassogba) remove this option (Tensor) when node backend\n          // methods have been modularized and they all return tensorInfo.\n          // TensorInfos do not have a rank attribute.\n          if ((outInfo as Tensor).rank != null) {\n            return outInfo as Tensor;\n          }\n          return this.makeTensorFromTensorInfo(outInfo);\n        });\n\n        // Save any required inputs and outputs.\n\n        // Do not save unless we are recording to the tape. Otherwise it would\n        // cause a mem leak since there would be no backprop for these tensors\n        // (which would otherwise dispose them).\n        if (isTapeOn) {\n          const tensorsToSave =\n              this.getTensorsForGradient(kernelName, inputs, outTensors);\n          saved = this.saveTensorsForBackwardMode(tensorsToSave);\n        }\n        return outTensors;\n      };\n    } else {\n      const {forwardFunc} = kernelParams;\n      // Running a customGrad op.\n      const saveFunc: GradSaveFunc = (tensors) => {\n        // Do not save unless we are recording to the tape. Otherwise it would\n        // cause a mem leak since we would never run backprop, which disposes\n        // the kept tensors.\n        if (!isTapeOn) {\n          return;\n        }\n        saved = tensors.map(tensor => this.keep(this.clone(tensor)));\n      };\n\n      kernelFunc = () => {\n        const numDataIdsBefore = this.backend.numDataIds();\n        out = this.tidy(() => forwardFunc(this.backend, saveFunc));\n        const outs = (Array.isArray(out) ? out : [out]) as Tensor[];\n        if (this.shouldCheckForMemLeaks()) {\n          // Scope name is used to print a more helpful error message if needed.\n          this.checkKernelForMemLeak(kernelOrScopeName, numDataIdsBefore, outs);\n        }\n        return outs;\n      };\n    }\n\n    //\n    // Run the kernelFunc. Optionally profiling it.\n    //\n    const {inputs, attrs} = kernelParams;\n    const backwardsFunc = isRegisteredKernelInvocation(kernelParams) ?\n        null :\n        kernelParams.backwardsFunc;\n\n    let kernelProfile: KernelProfile;\n    this.scopedRun(\n        // Stop recording to a tape when running a kernel.\n        () => this.state.kernelDepth++, () => this.state.kernelDepth--, () => {\n          if (!this.ENV.getBool('DEBUG') && !this.state.profiling) {\n            outputs = kernelFunc();\n          } else {\n            kernelProfile = this.profiler.profileKernel(\n                kernelOrScopeName, inputs, () => kernelFunc());\n            if (this.ENV.getBool('DEBUG')) {\n              this.profiler.logKernelProfile(kernelProfile);\n            }\n            outputs = kernelProfile.outputs;\n          }\n        });\n\n    if (isTapeOn) {\n      this.addTapeNode(\n          kernelOrScopeName, inputs, outputs, backwardsFunc, saved, attrs);\n    }\n\n    if (this.state.profiling) {\n      this.state.activeProfile.kernels.push({\n        name: kernelOrScopeName,\n        bytesAdded: this.state.numBytes - startingBytecount,\n        totalBytesSnapshot: this.state.numBytes,\n        tensorsAdded: this.state.numTensors - startingNumTensors,\n        totalTensorsSnapshot: this.state.numTensors,\n        inputShapes: Object.keys(inputs).map(\n            key => inputs[key] != null ? inputs[key].shape : null),\n        outputShapes: outputs.map(item => item.shape),\n        kernelTimeMs: kernelProfile.timeMs,\n        extraInfo: kernelProfile.extraInfo\n      });\n    }\n    return (Array.isArray(out) ? outputs : outputs[0]) as T;\n  }\n\n  /**\n   * Saves tensors used in forward mode for use in backward mode.\n   *\n   * @param tensors the list of tensors to save.\n   */\n  private saveTensorsForBackwardMode(tensors: Tensor[]): Tensor[] {\n    const saved = tensors.map(tensor => this.keep(this.clone(tensor)));\n    return saved;\n  }\n\n  /**\n   * Returns a list of tensors to save for a given gradient calculation.\n   *\n   * @param kernelName name of kernel to look up gradient for.\n   * @param inputs a map of input tensors.\n   * @param outputs an array of output tensors from forward mode of kernel.\n   */\n  private getTensorsForGradient(\n      kernelName: string, inputs: NamedTensorMap,\n      outputs: Tensor[]): Tensor[]|null {\n    const gradConfig = getGradient(kernelName);\n    if (gradConfig != null) {\n      const inputsToSave: string[] = gradConfig.inputsToSave || [];\n      const outputsToSave: boolean[] = gradConfig.outputsToSave || [];\n\n      // If saveAllInputs is true, all inputs will be saved. Otherwise, inputs\n      // specified in inputsToSave will be saved.\n      let inputTensorsToSave: Tensor[];\n      if (gradConfig.saveAllInputs) {\n        util.assert(\n            Array.isArray(inputs),\n            () => 'saveAllInputs is true, expected inputs to be an array.');\n\n        inputTensorsToSave = Object.keys(inputs).map((key) => inputs[key]);\n      } else {\n        inputTensorsToSave = inputsToSave.map((inputName) => inputs[inputName]);\n      }\n\n      const outputTensorsToSave: Tensor[] =\n          outputs.filter((_, i) => outputsToSave[i]);\n\n      return inputTensorsToSave.concat(outputTensorsToSave);\n    }\n    // We return an empty list rather than throw an error because the kernel we\n    // are looking up may not actually be relevant to backproping through the\n    // overall function\n    //\n    // See 'does not error if irrelevant (pruned) ops are missing grads' test\n    // in gradients_test.ts for an example.\n    return [];\n  }\n\n  /**\n   * Internal method used by public APIs for tensor creation. Makes a new\n   * tensor with the provided shape, dtype and values. It always\n   * creates a new data id and writes the values to the underlying backend.\n   */\n  makeTensor(\n      values: DataValues, shape: number[], dtype: DataType,\n      backend?: KernelBackend): Tensor {\n    if (values == null) {\n      throw new Error('Values passed to engine.makeTensor() are null');\n    }\n    dtype = dtype || 'float32';\n    backend = backend || this.backend;\n    let backendVals = values as BackendValues;\n    if (dtype === 'string' && util.isString(values[0])) {\n      backendVals = (values as string[]).map(d => util.encodeString(d));\n    }\n    const dataId = backend.write(backendVals, shape, dtype);\n    const t = new Tensor(shape, dtype, dataId, this.nextTensorId());\n    this.trackTensor(t, backend);\n\n    // Count bytes for string tensors.\n    if (dtype === 'string') {\n      const info = this.state.tensorInfo.get(dataId);\n      const newBytes = bytesFromStringArray(backendVals as Uint8Array[]);\n      this.state.numBytes += newBytes - info.bytes;\n      info.bytes = newBytes;\n    }\n    return t;\n  }\n\n  /**\n   * Internal method used by backends. Makes a new tensor\n   * that is a wrapper around an existing data id. It doesn't create\n   * a new data id, only increments the ref count used in memory tracking.\n   * @deprecated\n   */\n  makeTensorFromDataId(\n    dataId: DataId, shape: number[], dtype: DataType,\n    backend?: KernelBackend): Tensor {\n    dtype = dtype || 'float32';\n    const tensorInfo: TensorInfo = {dataId, shape, dtype};\n    return this.makeTensorFromTensorInfo(tensorInfo, backend);\n  }\n\n  /**\n   * Internal method used by backends. Makes a new tensor that is a wrapper\n   * around an existing data id in TensorInfo. It doesn't create a new data id,\n   * only increments the ref count used in memory tracking.\n   */\n  makeTensorFromTensorInfo(tensorInfo: TensorInfo, backend?: KernelBackend):\n      Tensor {\n    const {dataId, shape, dtype} = tensorInfo;\n    const t = new Tensor(shape, dtype, dataId, this.nextTensorId());\n    this.trackTensor(t, backend);\n    return t;\n  }\n\n  makeVariable(\n      initialValue: Tensor, trainable = true, name?: string,\n      dtype?: DataType): Variable {\n    name = name || this.nextVariableId().toString();\n    if (dtype != null && dtype !== initialValue.dtype) {\n      initialValue = initialValue.cast(dtype);\n    }\n    const v = new Variable(initialValue, trainable, name, this.nextTensorId());\n    if (this.state.registeredVariables[v.name] != null) {\n      throw new Error(`Variable with name ${v.name} was already registered`);\n    }\n    this.state.registeredVariables[v.name] = v;\n    this.incRef(v, this.backend);\n    return v;\n  }\n\n  trackTensor(a: Tensor, backend: KernelBackend): void {\n    this.state.numTensors++;\n    if (a.dtype === 'string') {\n      this.state.numStringTensors++;\n    }\n    // Bytes for complex numbers are counted by their components. Bytes for\n    // string tensors are counted when writing values.\n    let bytes = 0;\n    if (a.dtype !== 'complex64' && a.dtype !== 'string') {\n      bytes = a.size * util.bytesPerElement(a.dtype);\n    }\n    this.state.numBytes += bytes;\n\n    if (!this.state.tensorInfo.has(a.dataId)) {\n      this.state.numDataBuffers++;\n      this.state.tensorInfo.set(a.dataId, {\n        backend: backend || this.backend,\n        dtype: a.dtype,\n        shape: a.shape,\n        bytes\n      });\n    }\n\n    if (!(a instanceof Variable)) {\n      this.track(a);\n    }\n  }\n\n  // Track the tensor by dataId and increase the refCount for the dataId in the\n  // backend.\n  // TODO(pyu10055): This is currently used by makeVariable method, to increase\n  // refCount on the backend for the dataId. It can potentially be replaced with\n  // Identity op indead of calling backend directly.\n  incRef(a: Tensor, backend: KernelBackend): void {\n    this.trackTensor(a, backend);\n    this.backend.incRef(a.dataId);\n  }\n\n  removeDataId(dataId: DataId, backend: KernelBackend) {\n    if (this.state.tensorInfo.has(dataId) &&\n        this.state.tensorInfo.get(dataId).backend === backend) {\n      this.state.tensorInfo.delete(dataId);\n      this.state.numDataBuffers--;\n    }\n  }\n  disposeTensor(a: Tensor): void {\n    if (!this.state.tensorInfo.has(a.dataId)) {\n      return;\n    }\n    const info = this.state.tensorInfo.get(a.dataId);\n\n    this.state.numTensors--;\n    if (a.dtype === 'string') {\n      this.state.numStringTensors--;\n      this.state.numBytes -= info.bytes;\n    }\n    // Don't count bytes for complex numbers as they are counted by their\n    // components.\n    if (a.dtype !== 'complex64' && a.dtype !== 'string') {\n      const bytes = a.size * util.bytesPerElement(a.dtype);\n      this.state.numBytes -= bytes;\n    }\n\n    // Remove the reference to dataId if backend dispose the data successfully\n    if (info.backend.disposeData(a.dataId)) {\n      this.removeDataId(a.dataId, info.backend);\n    }\n\n    // TODO(nsthorat): Construct an error and save the stack trace for\n    // debugging when in debug mode. Creating a stack trace is too expensive\n    // to do unconditionally.\n  }\n\n  disposeVariables(): void {\n    for (const varName in this.state.registeredVariables) {\n      const v = this.state.registeredVariables[varName];\n      this.disposeVariable(v);\n    }\n  }\n\n  disposeVariable(v: Variable): void {\n    this.disposeTensor(v);\n    if (this.state.registeredVariables[v.name] != null) {\n      delete this.state.registeredVariables[v.name];\n    }\n  }\n\n  memory(): MemoryInfo {\n    const info = this.backend.memory() as MemoryInfo;\n    info.numTensors = this.state.numTensors;\n    info.numDataBuffers = this.state.numDataBuffers;\n    info.numBytes = this.state.numBytes;\n    if (this.state.numStringTensors > 0) {\n      info.unreliable = true;\n      if (info.reasons == null) {\n        info.reasons = [];\n      }\n      info.reasons.push(\n          'Memory usage by string tensors is approximate ' +\n          '(2 bytes per character)');\n    }\n    return info;\n  }\n\n  async profile(query: () => (TensorContainer | Promise<TensorContainer>)):\n      Promise<ProfileInfo> {\n    this.state.profiling = true;\n\n    const startBytes = this.state.numBytes;\n    const startNumTensors = this.state.numTensors;\n\n    this.state.activeProfile.kernels = [];\n    this.state.activeProfile.result = await query();\n\n    this.state.profiling = false;\n\n    this.state.activeProfile.peakBytes = Math.max(\n        ...this.state.activeProfile.kernels.map(d => d.totalBytesSnapshot));\n    this.state.activeProfile.newBytes = this.state.numBytes - startBytes;\n    this.state.activeProfile.newTensors =\n        this.state.numTensors - startNumTensors;\n    for (const kernel of this.state.activeProfile.kernels) {\n      kernel.kernelTimeMs = await kernel.kernelTimeMs;\n      kernel.extraInfo = await kernel.extraInfo;\n    }\n    return this.state.activeProfile;\n  }\n\n  isTapeOn(): boolean {\n    return this.state.gradientDepth > 0 && this.state.kernelDepth === 0;\n  }\n\n  private addTapeNode(\n      kernelName: string, inputs: NamedTensorMap, outputs: Tensor[],\n      gradientsFunc: GradFunc, saved: Tensor[], attrs: NamedAttrMap): void {\n    const tapeNode: TapeNode =\n        {id: this.state.nextTapeNodeId++, kernelName, inputs, outputs, saved};\n\n    const gradConfig = getGradient(kernelName);\n    if (gradConfig != null) {\n      gradientsFunc = gradConfig.gradFunc;\n    }\n    if (gradientsFunc != null) {\n      tapeNode.gradient = (dys: Tensor[]) => {\n        // TODO(smilkov): To optimize back-prop, pass dys that are not used in\n        // the backprop graph to the user as null instead of zeros\n        dys = dys.map((dy, i) => {\n          if (dy == null) {\n            const output = outputs[i];\n            const vals = util.makeZerosTypedArray(output.size, output.dtype);\n            return this.makeTensor(vals, output.shape, output.dtype);\n          }\n          return dy;\n        });\n        // Grad functions of ops with single outputs expect a dy, while ops\n        // with multiple outputs expect dys (array of dy).\n        return gradientsFunc(dys.length > 1 ? dys : dys[0], saved, attrs);\n      };\n    }\n    this.state.activeTape.push(tapeNode);\n  }\n\n  keep<T extends Tensor>(result: T): T {\n    result.kept = true;\n    return result;\n  }\n\n  private startTape() {\n    if (this.state.gradientDepth === 0) {\n      this.state.activeTape = [];\n    }\n    this.state.gradientDepth++;\n  }\n\n  private endTape() {\n    this.state.gradientDepth--;\n  }\n\n  /**\n   * Start a scope. Use this with endScope() to achieve the same functionality\n   * as scope() without the need for a function closure.\n   */\n  startScope(name?: string) {\n    const scopeInfo: ScopeState = {\n      track: [],\n      name: 'unnamed scope',\n      id: this.state.nextScopeId++\n    };\n    if (name) {\n      scopeInfo.name = name;\n    }\n    this.state.scopeStack.push(scopeInfo);\n    this.state.activeScope = scopeInfo;\n  }\n\n  /**\n   * End a scope. Use this with startScope() to achieve the same functionality\n   * as scope() without the need for a function closure.\n   */\n  endScope(result?: TensorContainer) {\n    const tensorsToTrackInParent = getTensorsInContainer(result);\n    const tensorsToTrackInParentSet =\n        new Set(tensorsToTrackInParent.map(t => t.id));\n\n    // Dispose the arrays tracked in this scope.\n    for (let i = 0; i < this.state.activeScope.track.length; i++) {\n      const tensor = this.state.activeScope.track[i];\n      if (!tensor.kept && !tensorsToTrackInParentSet.has(tensor.id)) {\n        tensor.dispose();\n      }\n    }\n\n    const oldScope = this.state.scopeStack.pop();\n    this.state.activeScope = this.state.scopeStack.length === 0 ?\n        null :\n        this.state.scopeStack[this.state.scopeStack.length - 1];\n\n    // Track the current result in the parent scope.\n    tensorsToTrackInParent.forEach(tensor => {\n      // Only track the tensor if was allocated in the inner scope and is not\n      // globally kept.\n      if (!tensor.kept && tensor.scopeId === oldScope.id) {\n        this.track(tensor);\n      }\n    });\n  }\n\n  /**\n   * Returns gradients of `f` with respect to each of the `xs`. The gradients\n   * returned are of the same length as `xs`, but some might be null if `f`\n   * was not a function of that `x`. It also takes optional dy to multiply the\n   * gradient, which defaults to `1`.\n   */\n  gradients<T extends Tensor>(\n      f: () => T, xs: Tensor[], dy?: T,\n      allowNoGradients = false): {value: T, grads: Tensor[]} {\n    util.assert(\n        xs.length > 0, () => 'gradients() received an empty list of xs.');\n    if (dy != null && dy.dtype !== 'float32') {\n      throw new Error(`dy must have 'float32' dtype, but has '${dy.dtype}'`);\n    }\n\n    const y = this.scopedRun(\n        () => this.startTape(), () => this.endTape(),\n        () => this.tidy('forward', f));\n\n    util.assert(\n        y instanceof Tensor,\n        () => 'The result y returned by f() must be a tensor.');\n    // Filter out the nodes that don't connect x => y.\n    const filteredTape = getFilteredNodesXToY(this.state.activeTape, xs, y);\n    if (!allowNoGradients && filteredTape.length === 0 && xs.length > 0) {\n      throw new Error(\n          'Cannot compute gradient of y=f(x) with respect to x. Make sure ' +\n          'that the f you passed encloses all operations that lead from x ' +\n          'to y.');\n    }\n\n    return this.tidy('backward', () => {\n      const accumulatedGradientMap: {[tensorId: number]: Tensor} = {};\n      accumulatedGradientMap[y.id] = (dy == null) ? ones(y.shape) : dy;\n\n      // Backprop gradients through the filtered nodes.\n      backpropagateGradients(\n          accumulatedGradientMap, filteredTape,\n          // Pass the tidy function to avoid circular dep with `tape.ts`.\n          f => this.tidy(f as ScopeFn<Tensor>),\n          // Pass an add function to avoide a circular dep with `tape.ts`.\n          add);\n      const grads = xs.map(x => accumulatedGradientMap[x.id]);\n\n      if (this.state.gradientDepth === 0) {\n        // This means that we are not computing higher-order gradients\n        // and can clean up the tape.\n        this.state.activeTape.forEach(node => {\n          for (const tensor of node.saved) {\n            tensor.dispose();\n          }\n        });\n        this.state.activeTape = null;\n      }\n      return {value: y, grads};\n    });\n  }\n\n  customGrad<T extends Tensor>(f: CustomGradientFunc<T>):\n      (...args: Array<Tensor|GradSaveFunc>) => T {\n    util.assert(\n        util.isFunction(f),\n        () => 'The f passed in customGrad(f) must be a function.');\n    return (...inputs: Tensor[]): T => {\n      util.assert(\n          inputs.every(t => t instanceof Tensor),\n          () => 'The args passed in customGrad(f)(x1, x2,...) must all be ' +\n              'tensors');\n\n      let res: {\n        value: T,\n        gradFunc: (dy: T, saved: Tensor[]) => Tensor | Tensor[],\n      };\n      const inputMap: NamedTensorMap = {};\n      inputs.forEach((input, i) => {\n        inputMap[i] = input;\n      });\n\n      const forwardFunc: ForwardFunc<T> = (_, save) => {\n        res = f(...[...inputs, save]);\n        util.assert(\n            res.value instanceof Tensor,\n            () => 'The function f passed in customGrad(f) must return an ' +\n                'object where `obj.value` is a tensor');\n        util.assert(\n            util.isFunction(res.gradFunc),\n            () => 'The function f passed in customGrad(f) must return an ' +\n                'object where `obj.gradFunc` is a function.');\n        return res.value;\n      };\n\n      const backwardsFunc = (dy: T, saved: Tensor[]) => {\n        const gradRes = res.gradFunc(dy, saved);\n        const grads: Tensor[] = Array.isArray(gradRes) ? gradRes : [gradRes];\n        util.assert(\n            grads.length === inputs.length,\n            () => 'The function f passed in customGrad(f) must return an ' +\n                'object where `obj.gradFunc` is a function that returns ' +\n                'the same number of tensors as inputs passed to f(...).');\n        util.assert(\n            grads.every(t => t instanceof Tensor),\n            () => 'The function f passed in customGrad(f) must return an ' +\n                'object where `obj.gradFunc` is a function that returns ' +\n                'a list of only tensors.');\n        const gradMap: {[key: string]: () => Tensor} = {};\n        grads.forEach((grad, i) => {\n          gradMap[i] = () => grad;\n        });\n        return gradMap;\n      };\n\n      return this.runKernelFunc({\n        forwardFunc,\n        backwardsFunc,\n        inputs: inputMap,\n      });\n    };\n  }\n\n  readSync(dataId: DataId): BackendValues {\n    // Route the read to the correct backend.\n    const info = this.state.tensorInfo.get(dataId);\n    return info.backend.readSync(dataId);\n  }\n  read(dataId: DataId): Promise<BackendValues> {\n    // Route the read to the correct backend.\n    const info = this.state.tensorInfo.get(dataId);\n    return info.backend.read(dataId);\n  }\n\n  readToGPU(dataId: DataId, options?: DataToGPUOptions): GPUData {\n    // Route the read to the correct backend.\n    const info = this.state.tensorInfo.get(dataId);\n    return info.backend.readToGPU(dataId, options);\n  }\n\n  async time(query: () => void): Promise<TimingInfo> {\n    const start = now();\n    const timingInfo = await this.backend.time(query) as TimingInfo;\n    timingInfo.wallMs = now() - start;\n    return timingInfo;\n  }\n\n  /**\n   * Tracks a Tensor in the current scope to be automatically cleaned up\n   * when the current scope ends, and returns the value.\n   *\n   * @param result The Tensor to track in the current scope.\n   */\n  private track<T extends Tensor>(result: T): T {\n    if (this.state.activeScope != null) {\n      result.scopeId = this.state.activeScope.id;\n      this.state.activeScope.track.push(result);\n    }\n\n    return result;\n  }\n\n  get registeredVariables(): NamedVariableMap {\n    return this.state.registeredVariables;\n  }\n\n  /**\n   * Resets the engine state. Removes all backends but does not remove\n   * registered backend factories.\n   */\n  reset(): void {\n    // Make any pending promise obsolete.\n    this.pendingBackendInitId++;\n\n    this.state.dispose();\n    this.ENV.reset();\n    this.state = new EngineState();\n\n    for (const backendName in this.registry) {\n      this.disposeRegisteredKernels(backendName);\n      this.registry[backendName].dispose();\n      delete this.registry[backendName];\n    }\n    this.backendName = null;\n    this.backendInstance = null;\n    this.pendingBackendInit = null;\n  }\n}\n\nfunction ones(shape: number[]): Tensor {\n  const values = makeOnesTypedArray(sizeFromShape(shape), 'float32');\n  return ENGINE.makeTensor(values, shape, 'float32');\n}\n\nexport function getOrMakeEngine(): Engine {\n  const ns = getGlobalNamespace() as unknown as {_tfengine: Engine};\n  if (ns._tfengine == null) {\n    const environment = new Environment(ns);\n    ns._tfengine = new Engine(environment);\n  }\n  setEnvironmentGlobal(ns._tfengine.ENV);\n\n  // Tell the current tensor interface that the global engine is responsible\n  // for tracking.\n  setTensorTracker(() => ns._tfengine);\n  return ns._tfengine;\n}\n\nexport const ENGINE = getOrMakeEngine();\n\n/**\n * A implementation of the add op for use within engine and tape.\n *\n * This allows us to avoid a circular dependency between add.ts and engine.\n * It is exported to be available in tape tests.\n */\nexport function add(a: Tensor, b: Tensor): Tensor {\n  // We duplicate Add here to avoid a circular dependency with add.ts.\n  const inputs = {a, b};\n  return ENGINE.runKernel(Add, inputs as unknown as NamedTensorMap);\n}\n", "/**\n * @license\n * Copyright 2017 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n// tslint:disable-next-line:no-any\nfunction _isNavigatorDefined(): boolean {\n  return typeof navigator !== 'undefined' && navigator != null;\n}\n\nlet isMobileMockValue: boolean|undefined;\n\nexport function mockIsMobile(value: boolean|undefined) {\n  isMobileMockValue = value;\n}\n\nexport function isMobile(nav?: Navigator): boolean {\n  if (isMobileMockValue !== undefined) {\n    return isMobileMockValue;\n  }\n  if (nav || _isNavigatorDefined()) {\n    if (!nav) {\n      nav = navigator;\n    }\n    if (nav.product === 'ReactNative') {\n      return true;\n    }\n\n    const a = nav.userAgent || nav.vendor ||\n        // tslint:disable-next-line:no-any\n        (typeof window !== 'undefined' ? (window as any).opera : '');\n    // Use `navigator.userAgentData.mobile` as fallback.\n    if (!a) {\n      // tslint:disable-next-line:no-any\n      const navAny = nav as any;\n      return navAny.userAgentData && navAny.userAgentData.mobile;\n    }\n    // tslint:disable-next-line:max-line-length\n    return /(android|bb\\d+|meego).+mobile|avantgo|bada\\/|blackberry|blazer|compal|elaine|fennec|hiptop|iemobile|ip(hone|od)|iris|kindle|lge |maemo|midp|mmp|mobile.+firefox|netfront|opera m(ob|in)i|palm( os)?|phone|p(ixi|re)\\/|plucker|pocket|psp|series(4|6)0|symbian|treo|up\\.(browser|link)|vodafone|wap|windows ce|xda|xiino/i\n               .test(a) ||\n        // tslint:disable-next-line:max-line-length\n        /1207|6310|6590|3gso|4thp|50[1-6]i|770s|802s|a wa|abac|ac(er|oo|s\\-)|ai(ko|rn)|al(av|ca|co)|amoi|an(ex|ny|yw)|aptu|ar(ch|go)|as(te|us)|attw|au(di|\\-m|r |s )|avan|be(ck|ll|nq)|bi(lb|rd)|bl(ac|az)|br(e|v)w|bumb|bw\\-(n|u)|c55\\/|capi|ccwa|cdm\\-|cell|chtm|cldc|cmd\\-|co(mp|nd)|craw|da(it|ll|ng)|dbte|dc\\-s|devi|dica|dmob|do(c|p)o|ds(12|\\-d)|el(49|ai)|em(l2|ul)|er(ic|k0)|esl8|ez([4-7]0|os|wa|ze)|fetc|fly(\\-|_)|g1 u|g560|gene|gf\\-5|g\\-mo|go(\\.w|od)|gr(ad|un)|haie|hcit|hd\\-(m|p|t)|hei\\-|hi(pt|ta)|hp( i|ip)|hs\\-c|ht(c(\\-| |_|a|g|p|s|t)|tp)|hu(aw|tc)|i\\-(20|go|ma)|i230|iac( |\\-|\\/)|ibro|idea|ig01|ikom|im1k|inno|ipaq|iris|ja(t|v)a|jbro|jemu|jigs|kddi|keji|kgt( |\\/)|klon|kpt |kwc\\-|kyo(c|k)|le(no|xi)|lg( g|\\/(k|l|u)|50|54|\\-[a-w])|libw|lynx|m1\\-w|m3ga|m50\\/|ma(te|ui|xo)|mc(01|21|ca)|m\\-cr|me(rc|ri)|mi(o8|oa|ts)|mmef|mo(01|02|bi|de|do|t(\\-| |o|v)|zz)|mt(50|p1|v )|mwbp|mywa|n10[0-2]|n20[2-3]|n30(0|2)|n50(0|2|5)|n7(0(0|1)|10)|ne((c|m)\\-|on|tf|wf|wg|wt)|nok(6|i)|nzph|o2im|op(ti|wv)|oran|owg1|p800|pan(a|d|t)|pdxg|pg(13|\\-([1-8]|c))|phil|pire|pl(ay|uc)|pn\\-2|po(ck|rt|se)|prox|psio|pt\\-g|qa\\-a|qc(07|12|21|32|60|\\-[2-7]|i\\-)|qtek|r380|r600|raks|rim9|ro(ve|zo)|s55\\/|sa(ge|ma|mm|ms|ny|va)|sc(01|h\\-|oo|p\\-)|sdk\\/|se(c(\\-|0|1)|47|mc|nd|ri)|sgh\\-|shar|sie(\\-|m)|sk\\-0|sl(45|id)|sm(al|ar|b3|it|t5)|so(ft|ny)|sp(01|h\\-|v\\-|v )|sy(01|mb)|t2(18|50)|t6(00|10|18)|ta(gt|lk)|tcl\\-|tdg\\-|tel(i|m)|tim\\-|t\\-mo|to(pl|sh)|ts(70|m\\-|m3|m5)|tx\\-9|up(\\.b|g1|si)|utst|v400|v750|veri|vi(rg|te)|vk(40|5[0-3]|\\-v)|vm40|voda|vulc|vx(52|53|60|61|70|80|81|83|85|98)|w3c(\\-| )|webc|whit|wi(g |nc|nw)|wmlb|wonu|x700|yas\\-|your|zeto|zte\\-/i\n            .test(a.substr(0, 4));\n  }\n  return false;\n}\n\nexport function isBrowser(): boolean {\n  return (typeof window !== 'undefined' && window.document != null) ||\n      //@ts-ignore\n      (typeof WorkerGlobalScope !== 'undefined');\n}\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport './engine';\n\nimport * as device_util from './device_util';\nimport {env} from './environment';\n\nconst ENV = env();\n\n/**\n * This file contains environment-related flag registrations.\n */\n\n/** Whether to enable debug mode. */\nENV.registerFlag('DEBUG', () => false, debugValue => {\n  if (debugValue) {\n    console.warn(\n        'Debugging mode is ON. The output of every math call will ' +\n        'be downloaded to CPU and checked for NaNs. ' +\n        'This significantly impacts performance.');\n  }\n});\n\n/** Whether we are in a browser (as versus, say, node.js) environment. */\nENV.registerFlag('IS_BROWSER', () => device_util.isBrowser());\n\n/** Whether we are in a browser (as versus, say, node.js) environment. */\nENV.registerFlag(\n    'IS_NODE',\n    () => (typeof process !== 'undefined') &&\n        (typeof process.versions !== 'undefined') &&\n        (typeof process.versions.node !== 'undefined'));\n\n/** Whether this browser is Chrome. */\nENV.registerFlag(\n    'IS_CHROME',\n    () => typeof navigator !== 'undefined' && navigator != null &&\n        navigator.userAgent != null && /Chrome/.test(navigator.userAgent) &&\n        /Google Inc/.test(navigator.vendor));\n\n/** Whether this browser is Safari. */\nENV.registerFlag(\n    'IS_SAFARI',\n    () => typeof navigator !== 'undefined' && navigator != null &&\n        navigator.userAgent != null && /Safari/.test(navigator.userAgent) &&\n        /Apple/.test(navigator.vendor));\n/**\n * True when the environment is \"production\" where we disable safety checks\n * to gain performance.\n */\nENV.registerFlag('PROD', () => false);\n\n/**\n * Whether to do sanity checks when inferring a shape from user-provided\n * values, used when creating a new tensor.\n */\nENV.registerFlag(\n    'TENSORLIKE_CHECK_SHAPE_CONSISTENCY', () => ENV.getBool('DEBUG'));\n\n/** Whether deprecation warnings are enabled. */\nENV.registerFlag('DEPRECATION_WARNINGS_ENABLED', () => true);\n\n/** True if running unit tests. */\nENV.registerFlag('IS_TEST', () => false);\n\n/** Whether to check computation result for errors. */\nENV.registerFlag('CHECK_COMPUTATION_FOR_ERRORS', () => ENV.getBool('DEBUG'));\n\n/** Whether the backend needs to wrap input to imageBitmap. */\nENV.registerFlag('WRAP_TO_IMAGEBITMAP', () => false);\n\n/** Whether to enable canvas2d willReadFrequently for GPU backends */\nENV.registerFlag('CANVAS2D_WILL_READ_FREQUENTLY_FOR_GPU', () => false);\n\n/** Whether to use setTimeoutCustom */\nENV.registerFlag('USE_SETTIMEOUTCUSTOM', () => false);\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from './engine';\nimport {env} from './environment';\nimport {getGlobalTensorClass, Tensor} from './tensor';\nimport {DataType, isWebGLData, isWebGPUData, TensorLike, WebGLData, WebGPUData} from './types';\nimport {assert, flatten, inferDtype, isTypedArray, toTypedArray} from './util';\nimport {bytesPerElement} from './util_base';\n\nexport function inferShape(\n    val: TensorLike|WebGLData|WebGPUData, dtype?: DataType): number[] {\n  let firstElem: typeof val = val;\n\n  if (isTypedArray(val)) {\n    return dtype === 'string' ? [] : [val.length];\n  }\n\n  if (isWebGLData(val)) {\n    const usedChannels = val.channels || 'RGBA';\n    return [val.height, val.width * usedChannels.length];\n  } else if (isWebGPUData(val)) {\n    return [val.buffer.size / (dtype == null ? 4 : bytesPerElement(dtype))];\n  }\n  if (!Array.isArray(val)) {\n    return [];  // Scalar.\n  }\n  const shape: number[] = [];\n\n  while (Array.isArray(firstElem) ||\n         isTypedArray(firstElem) && dtype !== 'string') {\n    shape.push(firstElem.length);\n    firstElem = firstElem[0];\n  }\n  if (Array.isArray(val) &&\n      env().getBool('TENSORLIKE_CHECK_SHAPE_CONSISTENCY')) {\n    deepAssertShapeConsistency(val, shape, []);\n  }\n\n  return shape;\n}\n\nfunction deepAssertShapeConsistency(\n    val: TensorLike, shape: number[], indices: number[]) {\n  indices = indices || [];\n  if (!(Array.isArray(val)) && !isTypedArray(val)) {\n    assert(\n        shape.length === 0,\n        () => `Element arr[${indices.join('][')}] is a primitive, ` +\n            `but should be an array/TypedArray of ${shape[0]} elements`);\n    return;\n  }\n  assert(\n      shape.length > 0,\n      () => `Element arr[${indices.join('][')}] should be a primitive, ` +\n          `but is an array of ${val.length} elements`);\n  assert(\n      val.length === shape[0],\n      () => `Element arr[${indices.join('][')}] should have ${shape[0]} ` +\n          `elements, but has ${val.length} elements`);\n  const subShape = shape.slice(1);\n  for (let i = 0; i < val.length; ++i) {\n    deepAssertShapeConsistency(val[i], subShape, indices.concat(i));\n  }\n}\n\nfunction assertDtype(\n    expectedDtype: DataType|'numeric'|'string_or_numeric',\n    actualDType: DataType, argName: string, functionName: string) {\n  if (expectedDtype === 'string_or_numeric') {\n    return;\n  }\n  if (expectedDtype == null) {\n    throw new Error(`Expected dtype cannot be null.`);\n  }\n  if (expectedDtype !== 'numeric' && expectedDtype !== actualDType ||\n      expectedDtype === 'numeric' && actualDType === 'string') {\n    throw new Error(\n        `Argument '${argName}' passed to '${functionName}' must ` +\n        `be ${expectedDtype} tensor, but got ${actualDType} tensor`);\n  }\n}\n\nexport function convertToTensor<T extends Tensor>(\n    x: T|TensorLike, argName: string, functionName: string,\n    parseAsDtype: DataType|'numeric'|'string_or_numeric' = 'numeric'): T {\n  if (x instanceof getGlobalTensorClass()) {\n    assertDtype(parseAsDtype, x.dtype, argName, functionName);\n    return x;\n  }\n  let inferredDtype = inferDtype(x);\n  // If the user expects a bool/int/float, use that info to update the\n  // inferredDtype when it is not a string.\n  if (inferredDtype !== 'string' &&\n      ['bool', 'int32', 'float32'].indexOf(parseAsDtype) >= 0) {\n    inferredDtype = parseAsDtype as DataType;\n  }\n  assertDtype(parseAsDtype, inferredDtype, argName, functionName);\n\n  if ((x == null) ||\n      (!isTypedArray(x) && !Array.isArray(x) && typeof x !== 'number' &&\n       typeof x !== 'boolean' && typeof x !== 'string')) {\n    const type = x == null ? 'null' : (x as {}).constructor.name;\n    throw new Error(\n        `Argument '${argName}' passed to '${functionName}' must be a ` +\n        `Tensor or TensorLike, but got '${type}'`);\n  }\n  const inferredShape = inferShape(x, inferredDtype);\n  if (!isTypedArray(x) && !Array.isArray(x)) {\n    x = [x] as number[];\n  }\n  const skipTypedArray = true;\n  const values = inferredDtype !== 'string' ?\n      toTypedArray(x, inferredDtype as DataType) :\n      flatten(x as string[], [], skipTypedArray) as string[];\n  return ENGINE.makeTensor(values, inferredShape, inferredDtype) as T;\n}\n\nexport function convertToTensorArray<T extends Tensor>(\n    arg: Array<T|TensorLike>, argName: string, functionName: string,\n    parseAsDtype: DataType|'numeric'|'string_or_numeric' = 'numeric'): T[] {\n  if (!Array.isArray(arg)) {\n    throw new Error(\n        `Argument ${argName} passed to ${functionName} must be a ` +\n        '`Tensor[]` or `TensorLike[]`');\n  }\n  const tensors = arg as T[];\n  return tensors.map(\n      (t, i) =>\n          convertToTensor(t, `${argName}[${i}]`, functionName, parseAsDtype));\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {isPromise} from '../util';\n\nexport const OP_SCOPE_SUFFIX = '__op';\n\n/**\n * Used for wrapping functions that perform math operations on\n * Tensors. The function will be wrapped in a named scope that cleans all\n * memory usage after the function is done.\n */\nexport function op<T extends Function>(f: {[name: string]: T}): T {\n  const keys = Object.keys(f);\n  if (keys.length !== 1) {\n    throw new Error(\n        `Please provide an object with a single key ` +\n        `(operation name) mapping to a function. Got an object with ` +\n        `${keys.length} keys.`);\n  }\n\n  let opName = keys[0];\n  const fn = f[opName];\n\n  // Strip the underscore from the end of the function name.\n  if (opName.endsWith('_')) {\n    opName = opName.substring(0, opName.length - 1);\n  }\n\n  // add an __op suffix to distinguish ops from kernels in tf.profile\n  opName = opName + OP_SCOPE_SUFFIX;\n\n  // tslint:disable-next-line:no-any\n  const f2 = (...args: any[]) => {\n    ENGINE.startScope(opName);\n    try {\n      const result = fn(...args);\n      if (isPromise(result)) {\n        console.error('Cannot return a Promise inside of tidy.');\n      }\n      ENGINE.endScope(result);\n      return result;\n    } catch (ex) {\n      ENGINE.endScope(null);\n      throw ex;\n    }\n  };\n  Object.defineProperty(f2, 'name', {value: opName, configurable: true});\n\n  // tslint:disable-next-line:no-any\n  return f2 as any as T;\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Complex, ComplexInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Converts two real numbers to a complex number.\n *\n * Given a tensor `real` representing the real part of a complex number, and a\n * tensor `imag` representing the imaginary part of a complex number, this\n * operation returns complex numbers elementwise of the form [r0, i0, r1, i1],\n * where r represents the real part and i represents the imag part.\n *\n * The input tensors real and imag must have the same shape.\n *\n * ```js\n * const real = tf.tensor1d([2.25, 3.25]);\n * const imag = tf.tensor1d([4.75, 5.75]);\n * const complex = tf.complex(real, imag);\n *\n * complex.print();\n * ```\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction complex_<T extends Tensor>(real: T|TensorLike, imag: T|TensorLike): T {\n  const $real = convertToTensor(real, 'real', 'complex');\n  const $imag = convertToTensor(imag, 'imag', 'complex');\n  util.assertShapesMatch(\n      $real.shape, $imag.shape,\n      `real and imag shapes, ${$real.shape} and ${$imag.shape}, ` +\n          `must match in call to tf.complex().`);\n\n  const inputs: ComplexInputs = {real: $real, imag: $imag};\n  return ENGINE.runKernel(Complex, inputs as unknown as NamedTensorMap);\n}\n\nexport const complex = /* @__PURE__ */ op({complex_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Tensor} from '../tensor';\nimport {isWebGLData, isWebGPUData, TensorLike, TypedArray, WebGLData, WebGPUData} from '../types';\nimport {DataType} from '../types';\nimport {assert, assertNonNegativeIntegerDimensions, flatten, inferDtype, isTypedArray, sizeFromShape, toTypedArray} from '../util';\n\n/** This is shared code across all tensor creation methods. */\nexport function makeTensor(\n    values: TensorLike|WebGLData|WebGPUData, shape: number[],\n    inferredShape: number[], dtype?: DataType): Tensor {\n  if (dtype == null) {\n    dtype = inferDtype(values);\n  } else if (dtype === 'complex64') {\n    throw new Error(\n        `Cannot construct a complex64 tensor directly. ` +\n        `Please use tf.complex(real, imag).`);\n  }\n\n  if (isWebGPUData(values) || isWebGLData(values)) {\n    if (dtype !== 'float32' && dtype !== 'int32') {\n      throw new Error(\n          `Creating tensor from GPU data only supports ` +\n          `'float32'|'int32' dtype, while the dtype is ${dtype}.`);\n    }\n    return ENGINE.backend.createTensorFromGPUData(\n        values, shape || inferredShape, dtype);\n  }\n\n  if (!isTypedArray(values) && !Array.isArray(values) &&\n      typeof values !== 'number' && typeof values !== 'boolean' &&\n      typeof values !== 'string') {\n    throw new Error(\n        'values passed to tensor(values) must be a number/boolean/string or ' +\n        'an array of numbers/booleans/strings, or a TypedArray');\n  }\n  // Verify that the shape matches the inferred shape.\n  if (shape != null) {\n    assertNonNegativeIntegerDimensions(shape);\n\n    const providedSize = sizeFromShape(shape);\n    const inferredSize = sizeFromShape(inferredShape);\n    assert(\n        providedSize === inferredSize,\n        () =>\n            `Based on the provided shape, [${shape}], the tensor should have ` +\n            `${providedSize} values but has ${inferredSize}`);\n\n    for (let i = 0; i < inferredShape.length; ++i) {\n      const inferred = inferredShape[i];\n      const flatDimsDontMatch = i === inferredShape.length - 1 ?\n          inferred !== sizeFromShape(shape.slice(i)) :\n          true;\n      assert(\n          inferredShape[i] === shape[i] || !flatDimsDontMatch,\n          () => `Error creating a new Tensor. Inferred shape ` +\n              `(${inferredShape}) does not match the provided ` +\n              `shape (${shape}). `);\n    }\n  }\n\n  if (!isTypedArray(values) && !Array.isArray(values)) {\n    values = [values] as number[];\n  }\n\n  shape = shape || inferredShape;\n  values = dtype !== 'string' ?\n      toTypedArray(values, dtype) :\n      flatten(values as string[], [], true) as string[];\n  return ENGINE.makeTensor(values as TypedArray, shape, dtype);\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {inferShape} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {DataType, Rank, ShapeMap, WebGLData, WebGPUData} from '../types';\n\nimport {makeTensor} from './tensor_ops_util';\n\n/**\n * Creates a `tf.Tensor` with the provided values, shape and dtype.\n *\n * ```js\n * // Pass an array of values to create a vector.\n * tf.tensor([1, 2, 3, 4]).print();\n * ```\n *\n * ```js\n * // Pass a nested array of values to make a matrix or a higher\n * // dimensional tensor.\n * tf.tensor([[1, 2], [3, 4]]).print();\n * ```\n *\n * ```js\n * // Pass a flat array and specify a shape yourself.\n * tf.tensor([1, 2, 3, 4], [2, 2]).print();\n * ```\n *\n * ```js\n * // Pass a `WebGLData` object and specify a shape yourself.\n *\n * // This makes it possible for TF.js applications to avoid GPU / CPU sync.\n * // For example, if your application includes a preprocessing step on the GPU,\n * // you could upload the GPU output directly to TF.js, rather than first\n * // downloading the values.\n *\n * // Example for WebGL2:\n * if (tf.findBackend('custom-webgl') == null) {\n *   const customCanvas = document.createElement('canvas');\n *   const customBackend = new tf.MathBackendWebGL(customCanvas);\n *   tf.registerBackend('custom-webgl', () => customBackend);\n * }\n * const savedBackend = tf.getBackend();\n * await tf.setBackend('custom-webgl');\n * const gl = tf.backend().gpgpu.gl;\n * const texture = gl.createTexture();\n * const tex2d = gl.TEXTURE_2D;\n * const width = 2;\n * const height = 2;\n *\n * gl.bindTexture(tex2d, texture);\n * gl.texParameteri(tex2d, gl.TEXTURE_WRAP_S, gl.CLAMP_TO_EDGE);\n * gl.texParameteri(tex2d, gl.TEXTURE_WRAP_T, gl.CLAMP_TO_EDGE);\n * gl.texParameteri(tex2d, gl.TEXTURE_MIN_FILTER, gl.NEAREST);\n * gl.texParameteri(tex2d, gl.TEXTURE_MAG_FILTER, gl.NEAREST);\n * gl.texImage2D(\n *   tex2d, 0, gl.RGBA32F, // internalFormat\n *   width, height, 0,\n *   gl.RGBA, // textureFormat\n *   gl.FLOAT, // textureType\n *   new Float32Array([0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15])\n * );\n *\n * // Currently, the `texture` has 4 pixels:\n * // Pixel0 is {R:0, G:1, B:2, A:3}\n * // Pixel1 is {R:4, G:5, B:6, A:7}\n * // Pixel2 is {R:8, G:9, B:10, A:11}\n * // Pixel3 is {R:12, G:13, B:14, A:15}\n *\n * const logicalShape = [height * width * 2];\n * const a = tf.tensor({texture, height, width, channels: 'BR'}, logicalShape);\n * a.print();\n * // Tensor value will be [2, 0, 6, 4, 10, 8, 14, 12], since [2, 0] is the\n * // values of 'B' and 'R' channels of Pixel0, [6, 4] is the values of 'B' and\n * 'R'\n * // channels of Pixel1...\n *\n * // For postprocessing on the GPU, it's possible to retrieve the texture\n * // backing any tensor by calling the tensor's `dataToGPU` method like\n * // so:\n *\n * const tex = a.dataToGPU();\n * await tf.setBackend(savedBackend);\n * ```\n *\n * ```js\n * // Pass a `WebGPUData` object and specify a shape yourself.\n *\n * // This makes it possible for TF.js applications to avoid GPU / CPU sync.\n * // For example, if your application includes a preprocessing step on the GPU,\n * // you could upload the GPU output directly to TF.js, rather than first\n * // downloading the values. Unlike WebGL, this optionally supports zero copy\n * // by WebGPUData.zeroCopy. When zeroCopy is false or undefined(default), this\n * // passing GPUBuffer can be destroyed after tensor is created. When zeroCopy\n * // is true, this GPUBuffer is bound directly by the tensor, so do not destroy\n * // this GPUBuffer until all access is done.\n *\n * // Example for WebGPU:\n * function createGPUBufferFromData(device, data, dtype) {\n *   const bytesPerElement = 4;\n *   const sizeInBytes = data.length * bytesPerElement;\n *\n *   const gpuWriteBuffer = device.createBuffer({\n *     mappedAtCreation: true,\n *     size: sizeInBytes,\n *     usage: GPUBufferUsage.MAP_WRITE | GPUBufferUsage.COPY_SRC\n *   });\n *   const arrayBuffer = gpuWriteBuffer.getMappedRange();\n *   if (dtype === 'float32') {\n *     new Float32Array(arrayBuffer).set(data);\n *   } else if (dtype === 'int32') {\n *     new Int32Array(arrayBuffer).set(data);\n *   } else {\n *     throw new Error(\n *         `Creating tensor from GPUBuffer only supports` +\n *         `'float32'|'int32' dtype, while the dtype is ${dtype}.`);\n *   }\n *   gpuWriteBuffer.unmap();\n *\n *   const gpuReadBuffer = device.createBuffer({\n *     mappedAtCreation: false,\n *     size: sizeInBytes,\n *     usage: GPUBufferUsage.COPY_DST | GPUBufferUsage.STORAGE |\n *         GPUBufferUsage.COPY_SRC\n *   });\n *\n *   const copyEncoder = device.createCommandEncoder();\n *   copyEncoder.copyBufferToBuffer(\n *       gpuWriteBuffer, 0, gpuReadBuffer, 0, sizeInBytes);\n *   const copyCommands = copyEncoder.finish();\n *   device.queue.submit([copyCommands]);\n *   gpuWriteBuffer.destroy();\n *   return gpuReadBuffer;\n * }\n *\n * const savedBackend = tf.getBackend();\n * await tf.setBackend('webgpu').catch(\n *     () => {throw new Error(\n *         'Failed to use WebGPU backend. Please use Chrome Canary to run.')});\n * const dtype = 'float32';\n * const device = tf.backend().device;\n * const aData = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16];\n * const bData = [1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4];\n * const expected = [2, 4, 6, 8, 6, 8, 10, 12, 10, 12, 14, 16, 14, 16, 18, 20];\n * const aBuffer = createGPUBufferFromData(device, aData, dtype);\n * const shape = [aData.length];\n * // To use zeroCopy, use {buffer: aBuffer, zeroCopy: true} instead and destroy\n * // aBuffer untill all access is done.\n * const a = tf.tensor({buffer: aBuffer}, shape, dtype);\n * const b = tf.tensor(bData, shape, dtype);\n * const result = tf.add(a, b);\n * result.print();\n * a.dispose();\n * b.dispose();\n * result.dispose();\n * aBuffer.destroy();\n * await tf.setBackend(savedBackend);\n * ```\n * @param values The values of the tensor. Can be nested array of numbers,\n * or a flat array, or a `TypedArray`(At the moment it supports Uint8Array,\n * Uint8ClampedArray, Int32Array, Float32Array) data types, or a `WebGLData`\n * object, or a `WebGPUData` object. If the values are strings, they will be\n * encoded as utf-8 and kept as `Uint8Array[]`. If the values is a `WebGLData`\n * object, the dtype could only be 'float32' or 'int32' and the object has to\n * have: 1. texture, a `WebGLTexture`, the texture must share the same\n * `WebGLRenderingContext` with TFJS's WebGL backend (you could create a custom\n * WebGL backend from your texture's canvas) and the internal texture format\n * for the input texture must be floating point or normalized integer; 2.\n * height, the height of the texture; 3. width, the width of the texture; 4.\n * channels, a non-empty subset of 'RGBA', indicating the values of which\n * channels will be passed to the tensor, such as 'R' or 'BR' (The order of the \n * channels affect the order of tensor values. ). (If the values passed from \n * texture is less than the tensor size, zeros will be padded at the rear.). If \n * the values is a `WebGPUData` object, the dtype could only be 'float32' or\n * 'int32 and the object has to have: buffer, a `GPUBuffer`. The buffer must:\n * 1. share the same `GPUDevice` with TFJS's WebGPU backend; 2. buffer.usage\n * should at least support GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_SRC; 3.\n * buffer.size should not be smaller than the byte size of tensor shape.\n * WebGPUData optionally supports zero copy by flag zeroCopy. When zeroCopy is\n * false or undefined(default),this passing GPUBuffer can be destroyed after\n * tensor is created. When zeroCopy is true, this GPUBuffer is bound directly\n * by the tensor, so do not destroy this GPUBuffer until all access is done.\n * @param shape The shape of the tensor. Optional. If not provided,\n *   it is inferred from `values`.\n * @param dtype The data type.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function tensor<R extends Rank>(\n    values: TensorLike|WebGLData|WebGPUData, shape?: ShapeMap[R],\n    dtype?: DataType): Tensor<R> {\n  const inferredShape = inferShape(values, dtype);\n  return makeTensor(values, shape, inferredShape, dtype) as Tensor<R>;\n}", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/* Type definitions for exporting and importing of models. */\n\n/**\n * A map from Tensor dtype to number of bytes per element of the Tensor.\n */\nexport const DTYPE_VALUE_SIZE_MAP: {[dtype: string]: number} = {\n  'float32': 4,\n  'float16': 2,\n  'int32': 4,\n  'uint16': 2,\n  'uint8': 1,\n  'bool': 1,\n  'complex64': 8\n};\n\n/**\n * A weight manifest.\n *\n * The weight manifest consists of an ordered list of weight-manifest groups.\n * Each weight-manifest group (\"group\" for short hereafter) consists of a\n * number of weight values stored in a number of paths.\n * See the documentation of `WeightManifestGroupConfig` below for more details.\n */\nexport declare type WeightsManifestConfig = WeightsManifestGroupConfig[];\n\n/**\n * A weight-manifest group.\n *\n * Consists of an ordered list of weight values encoded in binary format,\n * stored in an ordered list of paths.\n */\nexport declare interface WeightsManifestGroupConfig {\n  /**\n   * An ordered list of paths.\n   *\n   * Paths are intentionally abstract in order to be general. For example, they\n   * can be relative URL paths or relative paths on the file system.\n   */\n  paths: string[];\n\n  /**\n   * Specifications of the weights stored in the paths.\n   */\n  weights: WeightsManifestEntry[];\n}\n\n/**\n * Group to which the weight belongs.\n *\n * - 'optimizer': Weight from a stateful optimizer.\n */\nexport type WeightGroup = 'model'|'optimizer';\n\n/**\n * An entry in the weight manifest.\n *\n * The entry contains specification of a weight.\n */\nexport declare interface WeightsManifestEntry {\n  /**\n   * Name of the weight, e.g., 'Dense_1/bias'\n   */\n  name: string;\n\n  /**\n   * Shape of the weight.\n   */\n  shape: number[];\n\n  /**\n   * Data type of the weight.\n   */\n  dtype: 'float32'|'int32'|'bool'|'string'|'complex64';\n\n  /**\n   * Type of the weight.\n   *\n   * Optional.\n   *\n   * The value 'optimizer' indicates the weight belongs to an optimizer\n   * (i.e., used only during model training and not during inference).\n   */\n  group?: WeightGroup;\n\n  /**\n   * Information for dequantization of the weight.\n   */\n  quantization?: {\n    scale?: number,  // The scaling constant to multiply by.\n    min?: number,    // The (possibly nudged) minimum weight to add.\n       dtype: 'uint16'|'uint8'|'float16'  // The dtype of the quantized weights.\n  };\n}\n\n/**\n * Options for saving a model.\n * @innamespace io\n */\nexport interface SaveConfig {\n  /**\n   * Whether to save only the trainable weights of the model, ignoring the\n   * non-trainable ones.\n   */\n  trainableOnly?: boolean;\n\n  /**\n   * Whether the optimizer will be saved (if exists).\n   *\n   * Default: `false`.\n   */\n  includeOptimizer?: boolean;\n}\n\n/**\n * Result of a saving operation.\n */\nexport interface SaveResult {\n  /**\n   * Information about the model artifacts saved.\n   */\n  modelArtifactsInfo: ModelArtifactsInfo;\n\n  /**\n   * HTTP responses from the server that handled the model-saving request (if\n   * any). This is applicable only to server-based saving routes.\n   */\n  responses?: Response[];\n\n  /**\n   * Error messages and related data (if any).\n   */\n  errors?: Array<{}|string>;\n}\n\nexport declare interface ModelArtifactsInfo {\n  /**\n   * Timestamp for when the model is saved.\n   */\n  dateSaved: Date;\n\n  /**\n   * TODO (cais,yassogba) consider removing GraphDef as GraphDefs now\n   * come in a JSON format and none of our IOHandlers support a non json\n   * format. We could conder replacing this with 'Binary' if we want to\n   * allow future handlers to save to non json formats (though they will\n   * probably want more information than 'Binary').\n   * Type of the model topology\n   *\n   * Type of the model topology\n   *\n   * Possible values:\n   *   - JSON: JSON config (human-readable, e.g., Keras JSON).\n   *   - GraphDef: TensorFlow\n   *     [GraphDef](https://www.tensorflow.org/extend/tool_developers/#graphdef)\n   *     protocol buffer (binary).\n   */\n  modelTopologyType: 'JSON'|'GraphDef';\n\n  /**\n   * Size of model topology (Keras JSON or GraphDef), in bytes.\n   */\n  modelTopologyBytes?: number;\n\n  /**\n   * Size of weight specification or manifest, in bytes.\n   */\n  weightSpecsBytes?: number;\n\n  /**\n   * Size of weight value data, in bytes.\n   */\n  weightDataBytes?: number;\n}\n\n/** Model training configuration. */\nexport declare interface TrainingConfig {\n  // TODO(cais): Tighten the typing once keras spec is available to tfjs-core.\n  // See\n  // tslint:disable-next-line:max-line-length\n  // https://github.com/tensorflow/tfjs-layers/blob/master/src/keras_format/training_config.ts\n  /** Optimizer used for the model training. */\n  optimizer_config: {};\n\n  // TODO(cais): Tighten the typing once keras spec is available to tfjs-core.\n  /** Loss function(s) for the model's output(s). */\n  loss: string|string[]|{[key: string]: string};\n\n  // TODO(cais): Tighten the typing once keras spec is available to tfjs-core.\n  /** Metric function(s) for the model's output(s). */\n  metrics?: string[]|{[key: string]: string};\n\n  // TODO(cais): Tighten the typing once keras spec is available to tfjs-core.\n  weighted_metrics?: string[];\n\n  // TODO(cais): Tighten the typing once keras spec is available to tfjs-core.\n  sample_weight_mode?: string;\n\n  loss_weights?: number[]|{[key: string]: number};\n}\n\nexport type WeightData = ArrayBuffer | ArrayBuffer[];\n\n/**\n * The serialized artifacts of a model, including topology and weights.\n *\n * The `modelTopology`, `trainingConfig`, `weightSpecs` and `weightData` fields\n * of this interface are optional, in order to support topology- or weights-only\n * saving and loading.\n *\n * Note this interface is used internally in IOHandlers.  For the file format\n * written to disk as `model.json`, see `ModelJSON`.\n */\nexport declare interface ModelArtifacts {\n  /**\n   * Model topology.\n   *\n   * For Keras-style `tf.Model`s, this is a JSON object.\n   * For TensorFlow-style models (e.g., `SavedModel`), this is the JSON\n   * encoding of the `GraphDef` protocol buffer.\n   */\n  modelTopology?: {}|ArrayBuffer;\n\n  /**\n   * Serialized configuration for the model's training.\n   */\n  trainingConfig?: TrainingConfig;\n\n  /**\n   * Weight specifications.\n   *\n   * This corresponds to the weightsData below.\n   */\n  weightSpecs?: WeightsManifestEntry[];\n\n  /**\n   * Binary buffer(s) for all weight values in the order specified by\n   * `weightSpecs`. This may be a single ArrayBuffer of all the weights\n   * concatenated together or an Array of ArrayBuffers containing the weights\n   * (weights may be sharded across multiple ArrayBuffers).\n   */\n  weightData?: WeightData;\n\n  /**\n   * Returns a stream of the weights. Some models are too large to fit in\n   * V8's memory heap, and `getWeightStream` loads their weights without storing\n   * them all in memory at the same time.\n   */\n  getWeightStream?: () => ReadableStream<ArrayBuffer>;\n\n  /**\n   * Hard-coded format name for models saved from TensorFlow.js or converted\n   * by TensorFlow.js Converter.\n   */\n  format?: string;\n\n  /**\n   * What library is responsible for originally generating this artifact.\n   *\n   * Used for debugging purposes. E.g., 'TensorFlow.js v1.0.0'.\n   */\n  generatedBy?: string;\n\n  /**\n   * What library or tool is responsible for converting the original model\n   * to this format, applicable only if the model is output by a converter.\n   *\n   * Used for debugging purposes.  E.g., 'TensorFlow.js Converter v1.0.0'.\n   *\n   * A value of `null` means the model artifacts are generated without any\n   * conversion process (e.g., saved directly from a TensorFlow.js\n   * `tf.LayersModel` instance.)\n   */\n  convertedBy?: string|null;\n\n  /**\n   * Inputs and outputs signature for saved model.\n   */\n  signature?: {};\n\n  /**\n   * User-defined metadata about the model.\n   */\n  userDefinedMetadata?: {[key: string]: {}};\n\n  /**\n   * Initializer for the model.\n   */\n  modelInitializer?: {};\n\n  /**\n   * Inputs and outputs signature for model initializer.\n   */\n  initializerSignature?: {};\n}\n\n/**\n * The on-disk format of the `model.json` file.\n *\n * TF.js 1.0 always populates the optional fields when writing model.json.\n * Prior versions did not provide those fields.\n */\nexport declare interface ModelJSON {\n  /**\n   * Model topology.\n   *\n   * For Keras-style `tf.Model`s, this is a JSON object.\n   * For TensorFlow-style models (e.g., `SavedModel`), this is the JSON\n   * encoding of the `GraphDef` protocol buffer.\n   */\n  modelTopology: {};\n\n  /** Model training configuration. */\n  trainingConfig?: TrainingConfig;\n\n  /**\n   * Weights manifest.\n   *\n   * The weights manifest consists of an ordered list of weight-manifest\n   * groups. Each weight-manifest group consists of a number of weight values\n   * stored in a number of paths. See the documentation of\n   * `WeightsManifestConfig` for more details.\n   */\n  weightsManifest: WeightsManifestConfig;\n\n  /**\n   * Hard-coded format name for models saved from TensorFlow.js or converted\n   * by TensorFlow.js Converter.\n   */\n  format?: string;\n\n  /**\n   * What library is responsible for originally generating this artifact.\n   *\n   * Used for debugging purposes. E.g., 'TensorFlow.js v1.0.0'.\n   */\n  generatedBy?: string;\n\n  /**\n   * What library or tool is responsible for converting the original model\n   * to this format, applicable only if the model is output by a converter.\n   *\n   * Used for debugging purposes.  E.g., 'TensorFlow.js Converter v1.0.0'.\n   *\n   * A value of `null` means the model artifacts are generated without any\n   * conversion process (e.g., saved directly from a TensorFlow.js\n   * `tf.LayersModel` instance.)\n   */\n  convertedBy?: string|null;\n\n  /**\n   * Inputs and outputs signature for saved model.\n   */\n  signature?: {};\n\n  /**\n   * User-defined metadata about the model.\n   */\n  userDefinedMetadata?: {[key: string]: {}};\n\n  /**\n   * Initializer for the model.\n   */\n  modelInitializer?: {};\n\n  /**\n   * Inputs and outputs signature for model initializer.\n   */\n  initializerSignature?: {};\n}\n\n/**\n * Type definition for handlers of loading operations.\n */\nexport type LoadHandler = () => Promise<ModelArtifacts>;\n\n/**\n * Type definition for handlers of saving operations.\n */\nexport type SaveHandler = (modelArtifact: ModelArtifacts) =>\n    Promise<SaveResult>;\n\n/**\n * Interface for a model import/export handler.\n *\n * The `save` and `load` handlers are both optional, in order to allow handlers\n * that support only saving or loading.\n */\n// tslint:disable-next-line:interface-name\nexport interface IOHandler {\n  save?: SaveHandler;\n  load?: LoadHandler;\n}\n\n/**\n * Type definition for handlers of synchronous loading operations.\n */\nexport type LoadHandlerSync = () => ModelArtifacts;\n\n/**\n * Type definition for handlers of synchronous saving operations.\n */\nexport type SaveHandlerSync = (modelArtifact: ModelArtifacts) => SaveResult;\n\n/**\n * Interface for a synchronous model import/export handler.\n *\n * The `save` and `load` handlers are both optional, in order to allow handlers\n * that support only saving or loading.\n */\n// tslint:disable-next-line:interface-name\nexport type IOHandlerSync = {\n  save?: SaveHandlerSync;\n  load?: LoadHandlerSync;\n};\n\n/**\n * An interface for the manager of a model store.\n *\n * A model store is defined as a storage medium on which multiple models can\n * be stored. Each stored model has a unique `path` as its identifier.\n * A `ModelStoreManager` for the store allows actions including\n *\n * - Listing the models stored in the store.\n * - Deleting a model from the store.\n */\nexport interface ModelStoreManager {\n  /**\n   * List all models in the model store.\n   *\n   * @returns A dictionary mapping paths of existing models to their\n   *   model artifacts info. Model artifacts info include type of the model's\n   *   topology, byte sizes of the topology, weights, etc.\n   */\n  listModels(): Promise<{[path: string]: ModelArtifactsInfo}>;\n\n  /**\n   * Remove a model specified by `path`.\n   *\n   * @param path\n   * @returns ModelArtifactsInfo of the deleted model (if and only if deletion\n   *   is successful).\n   * @throws Error if deletion fails, e.g., if no model exists at `path`.\n   */\n  removeModel(path: string): Promise<ModelArtifactsInfo>;\n}\n\n/**\n * Callback for the progress of a long-running action such as an HTTP\n * request for a large binary object.\n *\n * `fraction` should be a number in the [0, 1] interval, indicating how\n * much of the action has completed.\n */\nexport type OnProgressCallback = (fraction: number) => void;\n\n/** @innamespace io */\nexport interface LoadOptions {\n  /**\n   * RequestInit (options) for HTTP requests.\n   *\n   * For detailed information on the supported fields, see\n   * [https://developer.mozilla.org/en-US/docs/Web/API/Request/Request](\n   *     https://developer.mozilla.org/en-US/docs/Web/API/Request/Request)\n   */\n  requestInit?: RequestInit;\n\n  /**\n   * Progress callback.\n   */\n  onProgress?: OnProgressCallback;\n\n  /**\n   * A function used to override the `window.fetch` function.\n   */\n  fetchFunc?: typeof fetch;\n\n  /**\n   * Strict loading model: whether extraneous weights or missing\n   * weights should trigger an `Error`.\n   *\n   * If `true`, require that the provided weights exactly match those\n   * required by the layers. `false` means that both extra weights\n   * and missing weights will be silently ignored.\n   *\n   * Default: `true`.\n   */\n  strict?: boolean;\n\n  /**\n   * Path prefix for weight files, by default this is calculated from the\n   * path of the model JSON file.\n   *\n   * For instance, if the path to the model JSON file is\n   * `http://localhost/foo/model.json`, then the default path prefix will be\n   * `http://localhost/foo/`. If a weight file has the path value\n   * `group1-shard1of2` in the weight manifest, then the weight file will be\n   * loaded from `http://localhost/foo/group1-shard1of2` by default. However,\n   * if you provide a `weightPathPrefix` value of\n   * `http://localhost/foo/alt-weights`, then the weight file will be loaded\n   * from the path `http://localhost/foo/alt-weights/group1-shard1of2` instead.\n   */\n  weightPathPrefix?: string;\n\n  /**\n   * Whether the module or model is to be loaded from TF Hub.\n   *\n   * Setting this to `true` allows passing a TF-Hub module URL, omitting the\n   * standard model file name and the query parameters.\n   *\n   * Default: `false`.\n   */\n  fromTFHub?: boolean;\n\n  /**\n   * An async function to convert weight file name to URL. The weight file\n   * names are stored in model.json's weightsManifest.paths field. By default we\n   * consider weight files are colocated with the model.json file. For example:\n   *     model.json URL: https://www.google.com/models/1/model.json\n   *     group1-shard1of1.bin url:\n   *        https://www.google.com/models/1/group1-shard1of1.bin\n   *\n   * With this func you can convert the weight file name to any URL.\n   */\n  weightUrlConverter?: (weightFileName: string) => Promise<string>;\n\n  /**\n   * Whether to stream the model directly to the backend or cache all its\n   * weights on CPU first. Useful for large models.\n   */\n  streamWeights?: boolean;\n}\n\n/**\n * Additional options for Platform.fetch\n */\nexport interface RequestDetails {\n  /**\n   * Is this request for a binary file (as opposed to a json file)\n   */\n  isBinary?: boolean;\n}\n", "/**\n * @license\n * Copyright 2023 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {TypedArray} from '../types';\nimport * as util from '../util';\n\ntype BufferShard = {\n  start: number,\n  end: number,\n  buffer: ArrayBuffer,\n};\n\n/**\n * Wraps a list of ArrayBuffers into a `slice()`-able object without allocating\n * a large ArrayBuffer.\n *\n * Allocating large ArrayBuffers (~2GB) can be unstable on Chrome. TFJS loads\n * its weights as a list of (usually) 4MB ArrayBuffers and then slices the\n * weight tensors out of them. For small models, it's safe to concatenate all\n * the weight buffers into a single ArrayBuffer and then slice the weight\n * tensors out of it, but for large models, a different approach is needed.\n */\n\nexport class CompositeArrayBuffer {\n  private shards: BufferShard[] = [];\n  private previousShardIndex = 0;\n  private bufferUniformSize?: number;\n  public readonly byteLength: number;\n\n  /**\n   * Concatenate a number of ArrayBuffers into one.\n   *\n   * @param buffers An array of ArrayBuffers to concatenate, or a single\n   *     ArrayBuffer.\n   * @returns Result of concatenating `buffers` in order.\n   */\n  static join(buffers?: ArrayBuffer[] | ArrayBuffer) {\n    return new CompositeArrayBuffer(buffers).slice();\n  }\n\n  constructor(buffers?: ArrayBuffer | ArrayBuffer[] | TypedArray |\n    TypedArray[]) {\n    if (buffers == null) {\n      return;\n    }\n    // Normalize the `buffers` input to be `ArrayBuffer[]`.\n    if (!(buffers instanceof Array)) {\n      buffers = [buffers];\n    }\n    buffers = buffers.map((bufferOrTypedArray) => {\n      if (util.isTypedArray(bufferOrTypedArray)) {\n        return bufferOrTypedArray.buffer;\n      }\n      return bufferOrTypedArray;\n    });\n\n    // Skip setting up shards if there are no buffers.\n    if (buffers.length === 0) {\n      return;\n    }\n\n    this.bufferUniformSize = buffers[0].byteLength;\n    let start = 0;\n\n    for (let i = 0; i < buffers.length; i++) {\n      const buffer = buffers[i];\n      // Check that all buffers except the last one have the same length.\n      if (i !== buffers.length - 1 &&\n        buffer.byteLength !== this.bufferUniformSize) {\n        // Unset the buffer uniform size, since the buffer sizes are not\n        // uniform.\n        this.bufferUniformSize = undefined;\n      }\n\n      // Create the shards, including their start and end points.\n      const end = start + buffer.byteLength;\n      this.shards.push({ buffer, start, end });\n      start = end;\n    }\n\n    // Set the byteLength\n    if (this.shards.length === 0) {\n      this.byteLength = 0;\n    }\n    this.byteLength = this.shards[this.shards.length - 1].end;\n  }\n\n  slice(start = 0, end = this.byteLength): ArrayBuffer {\n    // If there are no shards, then the CompositeArrayBuffer was initialized\n    // with no data.\n    if (this.shards.length === 0) {\n      return new ArrayBuffer(0);\n    }\n\n    // NaN is treated as zero for slicing. This matches ArrayBuffer's behavior.\n    start = isNaN(Number(start)) ? 0 : start;\n    end = isNaN(Number(end)) ? 0 : end;\n\n    // Fix the bounds to within the array.\n    start = Math.max(0, start);\n    end = Math.min(this.byteLength, end);\n    if (end <= start) {\n      return new ArrayBuffer(0);\n    }\n\n    const startShardIndex = this.findShardForByte(start);\n    if (startShardIndex === -1) {\n      // This should not happen since the start and end indices are always\n      // within 0 and the composite array's length.\n      throw new Error(`Could not find start shard for byte ${start}`);\n    }\n\n    const size = end - start;\n    const outputBuffer = new ArrayBuffer(size);\n    const outputArray = new Uint8Array(outputBuffer);\n    let sliced = 0;\n    for (let i = startShardIndex; i < this.shards.length; i++) {\n      const shard = this.shards[i];\n\n      const globalStart = start + sliced;\n      const localStart = globalStart - shard.start;\n      const outputStart = sliced;\n\n      const globalEnd = Math.min(end, shard.end);\n      const localEnd = globalEnd - shard.start;\n\n      const outputSlice = new Uint8Array(shard.buffer, localStart,\n                                         localEnd - localStart);\n      outputArray.set(outputSlice, outputStart);\n      sliced += outputSlice.length;\n\n      if (end < shard.end) {\n        break;\n      }\n    }\n    return outputBuffer;\n  }\n\n  /**\n   * Get the index of the shard that contains the byte at `byteIndex`.\n   */\n  private findShardForByte(byteIndex: number): number {\n    if (this.shards.length === 0 || byteIndex < 0 ||\n      byteIndex >= this.byteLength) {\n      return -1;\n    }\n\n    // If the buffers have a uniform size, compute the shard directly.\n    if (this.bufferUniformSize != null) {\n      this.previousShardIndex = Math.floor(byteIndex / this.bufferUniformSize);\n      return this.previousShardIndex;\n    }\n\n    // If the buffers don't have a uniform size, we need to search for the\n    // shard. That means we need a function to check where the byteIndex lies\n    // relative to a given shard.\n    function check(shard: BufferShard) {\n      if (byteIndex < shard.start) {\n        return -1;\n      }\n      if (byteIndex >= shard.end) {\n        return 1;\n      }\n      return 0;\n    }\n\n    // For efficiency, try the previous shard first.\n    if (check(this.shards[this.previousShardIndex]) === 0) {\n      return this.previousShardIndex;\n    }\n\n    // Otherwise, use a generic search function.\n    // This should almost never end up being used in practice since the weight\n    // entries should always be in order.\n    const index = search(this.shards, check);\n    if (index === -1) {\n      return -1;\n    }\n\n    this.previousShardIndex = index;\n    return this.previousShardIndex;\n  }\n}\n\n/**\n * Search for an element of a sorted array.\n *\n * @param sortedArray The sorted array to search\n * @param compare A function to compare the current value against the searched\n *     value. Return 0 on a match, negative if the searched value is less than\n *     the value passed to the function, and positive if the searched value is\n *     greater than the value passed to the function.\n * @returns The index of the element, or -1 if it's not in the array.\n */\nexport function search<T>(sortedArray: T[], compare: (t: T) => number): number {\n  // Binary search\n  let min = 0;\n  let max = sortedArray.length;\n\n  while (min <= max) {\n    const middle = Math.floor((max - min) / 2) + min;\n    const side = compare(sortedArray[middle]);\n\n    if (side === 0) {\n      return middle;\n    } else if (side < 0) {\n      max = middle;\n    } else {\n      min = middle + 1;\n    }\n  }\n  return -1;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {KernelBackend} from './backends/backend';\nimport {ENGINE, Engine, MemoryInfo, ProfileInfo, ScopeFn, TimingInfo} from './engine';\nimport {env} from './environment';\n\nimport {Platform} from './platforms/platform';\nimport {setDeprecationWarningFn, Tensor} from './tensor';\nimport {TensorContainer} from './tensor_types';\nimport {getTensorsInContainer} from './tensor_util';\n\n/**\n * Enables production mode which disables correctness checks in favor of\n * performance.\n *\n * @doc {heading: 'Environment'}\n */\nexport function enableProdMode(): void {\n  env().set('PROD', true);\n}\n\n/**\n * Enables debug mode which will log information about all executed kernels:\n * the elapsed time of the kernel execution, as well as the rank, shape, and\n * size of the output tensor.\n *\n * Debug mode will significantly slow down your application as it will\n * download the result of every operation to the CPU. This should not be used in\n * production. Debug mode does not affect the timing information of the kernel\n * execution as we do not measure download time in the kernel execution time.\n *\n * See also: `tf.profile`, `tf.memory`.\n *\n * @doc {heading: 'Environment'}\n */\nexport function enableDebugMode(): void {\n  env().set('DEBUG', true);\n}\n\n/** Globally disables deprecation warnings */\nexport function disableDeprecationWarnings(): void {\n  env().set('DEPRECATION_WARNINGS_ENABLED', false);\n  console.warn(`TensorFlow.js deprecation warnings have been disabled.`);\n}\n\n/** Warn users about deprecated functionality. */\nexport function deprecationWarn(msg: string) {\n  if (env().getBool('DEPRECATION_WARNINGS_ENABLED')) {\n    console.warn(\n        msg + ' You can disable deprecation warnings with ' +\n        'tf.disableDeprecationWarnings().');\n  }\n}\nsetDeprecationWarningFn(deprecationWarn);\n\n/**\n * Dispose all variables kept in backend engine.\n *\n * @doc {heading: 'Environment'}\n */\nexport function disposeVariables(): void {\n  ENGINE.disposeVariables();\n}\n\n/**\n * It returns the global engine that keeps track of all tensors and backends.\n *\n * @doc {heading: 'Environment'}\n */\nexport function engine(): Engine {\n  return ENGINE;\n}\n\n/**\n * Returns memory info at the current time in the program. The result is an\n * object with the following properties:\n *\n * - `numBytes`: Number of bytes allocated (undisposed) at this time.\n * - `numTensors`: Number of unique tensors allocated.\n * - `numDataBuffers`: Number of unique data buffers allocated\n *   (undisposed) at this time, which is ≤ the number of tensors\n *   (e.g. `a.reshape(newShape)` makes a new Tensor that shares the same\n *   data buffer with `a`).\n * - `unreliable`: True if the memory usage is unreliable. See `reasons` when\n *    `unreliable` is true.\n * - `reasons`: `string[]`, reasons why the memory is unreliable, present if\n *    `unreliable` is true.\n *\n * WebGL Properties:\n * - `numBytesInGPU`: Number of bytes allocated (undisposed) in the GPU only at\n *     this time.\n *\n * @doc {heading: 'Performance', subheading: 'Memory'}\n */\nexport function memory(): MemoryInfo {\n  return ENGINE.memory();\n}\n\n/**\n * Executes the provided function `f()` and returns a promise that resolves\n * with information about the function's memory use:\n * - `newBytes`: the number of new bytes allocated\n * - `newTensors`: the number of new tensors created\n * - `peakBytes`: the peak number of bytes allocated\n * - `kernels`: an array of objects for each kernel involved that reports\n * their input and output shapes, number of bytes used, and number of new\n * tensors created.\n * - `kernelNames`: an array of unique strings with just the names of the\n * kernels in the `kernels` array.\n *\n * ```js\n * const profile = await tf.profile(() => {\n *   const x = tf.tensor1d([1, 2, 3]);\n *   let x2 = x.square();\n *   x2.dispose();\n *   x2 = x.square();\n *   x2.dispose();\n *   return x;\n * });\n *\n * console.log(`newBytes: ${profile.newBytes}`);\n * console.log(`newTensors: ${profile.newTensors}`);\n * console.log(`byte usage over all kernels: ${profile.kernels.map(k =>\n * k.totalBytesSnapshot)}`);\n * ```\n *\n *\n * @doc {heading: 'Performance', subheading: 'Profile'}\n */\nexport function profile(f: () => (TensorContainer | Promise<TensorContainer>)):\n    Promise<ProfileInfo> {\n  return ENGINE.profile(f);\n}\n\n/**\n * Executes the provided function `fn` and after it is executed, cleans up all\n * intermediate tensors allocated by `fn` except those returned by `fn`.\n * `fn` must not return a Promise (async functions not allowed). The returned\n * result can be a complex object.\n *\n * Using this method helps avoid memory leaks. In general, wrap calls to\n * operations in `tf.tidy` for automatic memory cleanup.\n *\n * NOTE: Variables do *not* get cleaned up when inside a tidy(). If you want to\n * dispose variables, please use `tf.disposeVariables` or call dispose()\n * directly on variables.\n *\n * ```js\n * // y = 2 ^ 2 + 1\n * const y = tf.tidy(() => {\n *   // a, b, and one will be cleaned up when the tidy ends.\n *   const one = tf.scalar(1);\n *   const a = tf.scalar(2);\n *   const b = a.square();\n *\n *   console.log('numTensors (in tidy): ' + tf.memory().numTensors);\n *\n *   // The value returned inside the tidy function will return\n *   // through the tidy, in this case to the variable y.\n *   return b.add(one);\n * });\n *\n * console.log('numTensors (outside tidy): ' + tf.memory().numTensors);\n * y.print();\n * ```\n *\n * @param nameOrFn The name of the closure, or the function to execute.\n *     If a name is provided, the 2nd argument should be the function.\n *     If debug mode is on, the timing and the memory usage of the function\n *     will be tracked and displayed on the console using the provided name.\n * @param fn The function to execute.\n *\n * @doc {heading: 'Performance', subheading: 'Memory'}\n */\nexport function tidy<T extends TensorContainer>(\n    nameOrFn: string|ScopeFn<T>, fn?: ScopeFn<T>): T {\n  return ENGINE.tidy(nameOrFn, fn);\n}\n\n/**\n * Disposes any `tf.Tensor`s found within the provided object.\n *\n * @param container an object that may be a `tf.Tensor` or may directly\n *     contain `tf.Tensor`s, such as a `Tensor[]` or `{key: Tensor, ...}`. If\n *     the object is not a `tf.Tensor` or does not contain `Tensors`, nothing\n *     happens. In general it is safe to pass any object here, except that\n *     `Promise`s are not supported.\n *\n * @doc {heading: 'Performance', subheading: 'Memory'}\n */\nexport function dispose(container: TensorContainer) {\n  const tensors = getTensorsInContainer(container);\n  tensors.forEach(tensor => tensor.dispose());\n}\n\n/**\n * Keeps a `tf.Tensor` generated inside a `tf.tidy` from being disposed\n * automatically.\n *\n * ```js\n * let b;\n * const y = tf.tidy(() => {\n *   const one = tf.scalar(1);\n *   const a = tf.scalar(2);\n *\n *   // b will not be cleaned up by the tidy. a and one will be cleaned up\n *   // when the tidy ends.\n *   b = tf.keep(a.square());\n *\n *   console.log('numTensors (in tidy): ' + tf.memory().numTensors);\n *\n *   // The value returned inside the tidy function will return\n *   // through the tidy, in this case to the variable y.\n *   return b.add(one);\n * });\n *\n * console.log('numTensors (outside tidy): ' + tf.memory().numTensors);\n * console.log('y:');\n * y.print();\n * console.log('b:');\n * b.print();\n * ```\n *\n * @param result The tensor to keep from being disposed.\n *\n * @doc {heading: 'Performance', subheading: 'Memory'}\n */\nexport function keep<T extends Tensor>(result: T): T {\n  return ENGINE.keep(result);\n}\n\n/**\n * Executes `f()` and returns a promise that resolves with timing\n * information.\n *\n * The result is an object with the following properties:\n *\n * - `wallMs`: Wall execution time.\n * - `kernelMs`: Kernel execution time, ignoring data transfer. If using the\n * WebGL backend and the query timer extension is not available, this will\n * return an error object.\n * - On `WebGL` The following additional properties exist:\n *   - `uploadWaitMs`: CPU blocking time on texture uploads.\n *   - `downloadWaitMs`: CPU blocking time on texture downloads (readPixels).\n *\n * ```js\n * const x = tf.randomNormal([20, 20]);\n * const time = await tf.time(() => x.matMul(x));\n *\n * console.log(`kernelMs: ${time.kernelMs}, wallTimeMs: ${time.wallMs}`);\n * ```\n *\n * @param f The function to execute and time.\n *\n * @doc {heading: 'Performance', subheading: 'Timing'}\n */\nexport function time(f: () => void): Promise<TimingInfo> {\n  return ENGINE.time(f);\n}\n\n/**\n * Sets the backend (cpu, webgl, wasm, etc) responsible for creating tensors and\n * executing operations on those tensors. Returns a promise that resolves\n * to a boolean if the backend initialization was successful.\n *\n * Note this disposes the current backend, if any, as well as any tensors\n * associated with it. A new backend is initialized, even if it is of the\n * same type as the previous one.\n *\n * @param backendName The name of the backend. Currently supports\n *     `'webgl'|'cpu'` in the browser, `'tensorflow'` under node.js\n *     (requires tfjs-node), and `'wasm'` (requires tfjs-backend-wasm).\n *\n * @doc {heading: 'Backends'}\n */\nexport function setBackend(backendName: string): Promise<boolean> {\n  return ENGINE.setBackend(backendName);\n}\n\n/**\n * Returns a promise that resolves when the currently selected backend (or the\n * highest priority one) has initialized. Await this promise when you are using\n * a backend that has async initialization.\n *\n * @doc {heading: 'Backends'}\n */\nexport function ready(): Promise<void> {\n  return ENGINE.ready();\n}\n\n/**\n * Returns the current backend name (cpu, webgl, etc). The backend is\n * responsible for creating tensors and executing operations on those tensors.\n *\n * @doc {heading: 'Backends'}\n */\nexport function getBackend(): string {\n  return ENGINE.backendName;\n}\n\n/**\n * Removes a backend and the registered factory.\n *\n * @doc {heading: 'Backends'}\n */\nexport function removeBackend(name: string): void {\n  ENGINE.removeBackend(name);\n}\n\n/**\n * Finds the backend registered under the provided name. Returns null if the\n * name is not in the registry, or the registration hasn't finished yet.\n */\nexport function findBackend(name: string): KernelBackend {\n  return ENGINE.findBackend(name);\n}\n\n/**\n * Finds the backend factory registered under the provided name. Returns a\n * function that produces a new backend when called. Returns null if the name\n * is not in the registry.\n */\nexport function findBackendFactory(name: string): () =>\n    KernelBackend | Promise<KernelBackend> {\n  return ENGINE.findBackendFactory(name);\n}\n\n/**\n * Registers a global backend. The registration should happen when importing\n * a module file (e.g. when importing `backend_webgl.ts`), and is used for\n * modular builds (e.g. custom tfjs bundle with only webgl support).\n *\n * @param factory The backend factory function. When called, it should\n * return a backend instance, or a promise of an instance.\n * @param priority The priority of the backend (higher = more important).\n *     In case multiple backends are registered, the priority is used to find\n *     the best backend. Defaults to 1.\n * @return False if there is already a registered backend under this name, true\n *     if not.\n *\n * @doc {heading: 'Backends'}\n */\nexport function registerBackend(\n    name: string, factory: () => KernelBackend | Promise<KernelBackend>,\n    priority = 1): boolean {\n  return ENGINE.registerBackend(name, factory, priority);\n}\n\n/**\n * Gets the current backend. If no backends have been initialized, this will\n * attempt to initialize the best backend. Will throw an error if the highest\n * priority backend has async initialization, in which case you should call\n * 'await tf.ready()' before running other code.\n *\n * @doc {heading: 'Backends'}\n */\nexport function backend(): KernelBackend {\n  return ENGINE.backend;\n}\n\n/**\n * Sets the global platform.\n *\n * @param platformName The name of this platform.\n * @param platform A platform implementation.\n */\nexport function setPlatform(platformName: string, platform: Platform) {\n  env().setPlatform(platformName, platform);\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {complex} from '../ops/complex';\nimport {tensor} from '../ops/tensor';\nimport {NamedTensor, NamedTensorMap} from '../tensor_types';\nimport {TypedArray} from '../types';\nimport {sizeFromShape} from '../util';\n\nimport {DTYPE_VALUE_SIZE_MAP, ModelArtifacts, ModelArtifactsInfo, ModelJSON, WeightData, WeightGroup, WeightsManifestConfig, WeightsManifestEntry} from './types';\nimport {CompositeArrayBuffer} from './composite_array_buffer';\nimport {Tensor} from '../tensor';\nimport {backend} from '../globals';\nimport {DataId} from '../tensor_info';\nimport {env} from '../environment';\nimport {getBackend} from '../globals';\n\n/** Number of bytes reserved for the length of the string. (32bit integer). */\nconst NUM_BYTES_STRING_LENGTH = 4;\n\n/**\n * Encode a map from names to weight values as an ArrayBuffer, along with an\n * `Array` of `WeightsManifestEntry` as specification of the encoded weights.\n *\n * This function does not perform sharding.\n *\n * This function is the reverse of `decodeWeights`.\n *\n * @param tensors A map (\"dict\") from names to tensors.\n * @param group Group to which the weights belong (optional).\n * @returns A `Promise` of\n *   - A flat `ArrayBuffer` with all the binary values of the `Tensor`s\n *     concatenated.\n *   - An `Array` of `WeightManifestEntry`s, carrying information including\n *     tensor names, `dtype`s and shapes.\n * @throws Error: on unsupported tensor `dtype`.\n */\nexport async function encodeWeights(\n    tensors: NamedTensorMap|NamedTensor[], group?: WeightGroup):\n    Promise<{data: ArrayBuffer, specs: WeightsManifestEntry[]}> {\n  // TODO(adarob, cais): Support quantization.\n  const specs: WeightsManifestEntry[] = [];\n  const dataPromises: Array<Promise<TypedArray>> = [];\n\n  const names: string[] = Array.isArray(tensors) ?\n      tensors.map(tensor => tensor.name) :\n      Object.keys(tensors);\n\n  for (let i = 0; i < names.length; ++i) {\n    const name = names[i];\n    const t = Array.isArray(tensors) ? tensors[i].tensor : tensors[name];\n    if (t.dtype !== 'float32' && t.dtype !== 'int32' && t.dtype !== 'bool' &&\n        t.dtype !== 'string' && t.dtype !== 'complex64') {\n      throw new Error(`Unsupported dtype in weight '${name}': ${t.dtype}`);\n    }\n    const spec: WeightsManifestEntry = {name, shape: t.shape, dtype: t.dtype};\n    if (t.dtype === 'string') {\n      const utf8bytes = new Promise<TypedArray>(async resolve => {\n        const vals = await t.bytes() as Uint8Array[];\n        const totalNumBytes = vals.reduce((p, c) => p + c.length, 0) +\n            NUM_BYTES_STRING_LENGTH * vals.length;\n        const bytes = new Uint8Array(totalNumBytes);\n        let offset = 0;\n        for (let i = 0; i < vals.length; i++) {\n          const val = vals[i];\n          const bytesOfLength =\n              new Uint8Array(new Uint32Array([val.length]).buffer);\n          bytes.set(bytesOfLength, offset);\n          offset += NUM_BYTES_STRING_LENGTH;\n          bytes.set(val, offset);\n          offset += val.length;\n        }\n        resolve(bytes);\n      });\n      dataPromises.push(utf8bytes);\n    } else {\n      dataPromises.push(t.data());\n    }\n    if (group != null) {\n      spec.group = group;\n    }\n    specs.push(spec);\n  }\n\n  const tensorValues = await Promise.all(dataPromises);\n  return {data: concatenateTypedArrays(tensorValues), specs};\n}\n\n/**\n * Decode flat ArrayBuffer as weights.\n *\n * This function does not handle sharding.\n *\n * This function is the reverse of `encodeWeights`.\n *\n * @param weightData A flat ArrayBuffer or an array of ArrayBuffers carrying the\n *   binary values of the tensors concatenated in the order specified in\n *   `specs`.\n * @param specs Specifications of the names, dtypes and shapes of the tensors\n *   whose value are encoded by `buffer`.\n * @return A map from tensor name to tensor value, with the names corresponding\n *   to names in `specs`.\n * @throws Error, if any of the tensors has unsupported dtype.\n */\nexport function decodeWeights(\n    weightData: WeightData,\n    specs: WeightsManifestEntry[]): NamedTensorMap {\n  // TODO(adarob, cais): Support quantization.\n  const compositeBuffer = new CompositeArrayBuffer(weightData);\n  const out: NamedTensorMap = {};\n  let offset = 0;\n  for (const spec of specs) {\n    const byteLength = getWeightBytelength(spec, (start, end) => {\n      return compositeBuffer.slice(offset + start, offset + end);\n    });\n    out[spec.name] = decodeWeight(spec, compositeBuffer\n      .slice(offset, offset + byteLength));\n    offset += byteLength;\n  }\n  return out;\n}\n\nfunction getWeightBytelength(spec: WeightsManifestEntry,\n  slice: (start: number, end: number) => ArrayBuffer): number {\n\n  const size = sizeFromShape(spec.shape);\n  let bytesPerValue: number;\n  if ('quantization' in spec) {\n    const quantization = spec.quantization;\n    bytesPerValue = DTYPE_VALUE_SIZE_MAP[quantization.dtype];\n  } else if (spec.dtype === 'string') {\n    // Can not statically determine string length.\n    let byteLength = 0;\n    for (let i = 0; i < size; i++) {\n      byteLength += NUM_BYTES_STRING_LENGTH + new Uint32Array(\n        slice(byteLength, byteLength + NUM_BYTES_STRING_LENGTH))[0];\n    }\n    return byteLength;\n  } else {\n    bytesPerValue = DTYPE_VALUE_SIZE_MAP[spec.dtype];\n  }\n\n  return size * bytesPerValue;\n}\n\nasync function getWeightBytelengthAsync(\n  spec: WeightsManifestEntry,\n  slice: (start: number, end: number) => Promise<ArrayBuffer>\n): Promise<number> {\n\n  const size = sizeFromShape(spec.shape);\n  let bytesPerValue: number;\n  if ('quantization' in spec) {\n    const quantization = spec.quantization;\n    bytesPerValue = DTYPE_VALUE_SIZE_MAP[quantization.dtype];\n  } else if (spec.dtype === 'string') {\n    // Can not statically determine string length.\n    let byteLength = 0;\n    for (let i = 0; i < size; i++) {\n      byteLength += NUM_BYTES_STRING_LENGTH + new Uint32Array(\n        await slice(byteLength, byteLength + NUM_BYTES_STRING_LENGTH))[0];\n    }\n    return byteLength;\n  } else {\n    bytesPerValue = DTYPE_VALUE_SIZE_MAP[spec.dtype];\n  }\n\n  return size * bytesPerValue;\n}\n\nfunction decodeWeight(\n  spec: WeightsManifestEntry,\n  byteBuffer: ArrayBuffer): Tensor {\n\n  const name = spec.name;\n  const dtype = spec.dtype;\n  const shape = spec.shape;\n  const size = sizeFromShape(shape);\n  let values: TypedArray | string[] | Uint8Array[];\n  let offset = 0;\n\n  if ('quantization' in spec) {\n    const quantization = spec.quantization;\n    if (quantization.dtype === 'uint8' || quantization.dtype === 'uint16') {\n      if (!('min' in quantization && 'scale' in quantization)) {\n        throw new Error(\n            `Weight ${spec.name} with quantization ${quantization.dtype} ` +\n            `doesn't have corresponding metadata min and scale.`);\n      }\n    } else if (quantization.dtype === 'float16') {\n      if (dtype !== 'float32') {\n        throw new Error(\n            `Weight ${spec.name} is quantized with ${quantization.dtype} ` +\n            `which only supports weights of type float32 not ${dtype}.`);\n      }\n    } else {\n      throw new Error(\n          `Weight ${spec.name} has unknown ` +\n          `quantization dtype ${quantization.dtype}. ` +\n          `Supported quantization dtypes are: ` +\n          `'uint8', 'uint16', and 'float16'.`);\n    }\n    const quantizationSizeFactor = DTYPE_VALUE_SIZE_MAP[quantization.dtype];\n    const quantizedArray = (quantization.dtype === 'uint8') ?\n      new Uint8Array(byteBuffer) :\n      new Uint16Array(byteBuffer);\n    if (dtype === 'float32') {\n      if (quantization.dtype === 'uint8' || quantization.dtype === 'uint16') {\n        values = new Float32Array(quantizedArray.length);\n        for (let i = 0; i < quantizedArray.length; i++) {\n          const v = quantizedArray[i];\n          values[i] = v * quantization.scale + quantization.min;\n        }\n      } else if (quantization.dtype === 'float16') {\n        // TODO: This is inefficient. Make getFloat16Decoder efficient.\n        const float16Decode = getFloat16Decoder();\n        values = float16Decode(quantizedArray as Uint16Array);\n      } else {\n        throw new Error(\n          `Unsupported quantization type ${quantization.dtype} ` +\n          `for weight type float32.`);\n      }\n    } else if (dtype === 'int32') {\n      if (quantization.dtype !== 'uint8' && quantization.dtype !== 'uint16') {\n        throw new Error(\n          `Unsupported quantization type ${quantization.dtype} ` +\n          `for weight type int32.`);\n      }\n      values = new Int32Array(quantizedArray.length);\n      for (let i = 0; i < quantizedArray.length; i++) {\n        const v = quantizedArray[i];\n        values[i] = Math.round(v * quantization.scale + quantization.min);\n      }\n    } else {\n      throw new Error(`Unsupported dtype in weight '${name}': ${dtype}`);\n    }\n    offset += size * quantizationSizeFactor;\n  } else if (dtype === 'string') {\n    const size = sizeFromShape(spec.shape);\n    values = [];\n    for (let i = 0; i < size; i++) {\n      const byteLength = new Uint32Array(\n        byteBuffer.slice(offset, offset + NUM_BYTES_STRING_LENGTH))[0];\n      offset += NUM_BYTES_STRING_LENGTH;\n      const bytes = new Uint8Array(\n        byteBuffer.slice(offset, offset + byteLength));\n      (values as Uint8Array[]).push(bytes);\n      offset += byteLength;\n    }\n  } else {\n    const dtypeFactor = DTYPE_VALUE_SIZE_MAP[dtype];\n    if (dtype === 'float32') {\n      values = new Float32Array(byteBuffer);\n    } else if (dtype === 'int32') {\n      values = new Int32Array(byteBuffer);\n    } else if (dtype === 'bool') {\n      values = new Uint8Array(byteBuffer);\n    } else if (dtype === 'complex64') {\n      values = new Float32Array(byteBuffer);\n      const real = new Float32Array(values.length / 2);\n      const image = new Float32Array(values.length / 2);\n      for (let i = 0; i < real.length; i++) {\n        real[i] = values[i * 2];\n        image[i] = values[i * 2 + 1];\n      }\n      const realTensor = tensor(real, shape, 'float32');\n      const imageTensor = tensor(image, shape, 'float32');\n      const complexTensor = complex(realTensor, imageTensor);\n      realTensor.dispose();\n      imageTensor.dispose();\n      return complexTensor;\n    } else {\n      throw new Error(`Unsupported dtype in weight '${name}': ${dtype}`);\n    }\n    offset += size * dtypeFactor;\n  }\n  return tensor(values, shape, dtype);\n}\n\nasync function readToLength(reader: ReadableStreamDefaultReader<ArrayBuffer>,\n                            initialData: ArrayBuffer,\n                            length: number): Promise<ArrayBuffer> {\n  let data = new Uint8Array(initialData);\n\n  while (data.byteLength < length) {\n    const {done, value} = await reader.read();\n    if (done && value == null) {\n      const missing  = length - data.byteLength;\n      throw new Error(`Reader is done but ${missing} bytes are still expected`);\n    }\n\n    // TODO: Don't create a new array every loop.\n    const newData = new Uint8Array(data.length + value.byteLength);\n    newData.set(data, 0);\n    newData.set(new Uint8Array(value), data.length);\n    data = newData;\n  }\n\n  return data.buffer;\n}\n\nexport async function decodeWeightsStream(\n  weightStream: ReadableStream<ArrayBuffer>,\n  specs: WeightsManifestEntry[]): Promise<NamedTensorMap> {\n\n  const tensors: NamedTensorMap = {};\n  const reader = weightStream.getReader();\n  let data = new ArrayBuffer(0);\n\n  for (const spec of specs) {\n    const byteLength = await getWeightBytelengthAsync(spec,\n                                                      async (start, end) => {\n      data = await readToLength(reader, data, end);\n      return data.slice(start, end);\n    });\n    data = await readToLength(reader, data, byteLength);\n\n    // Slice the tensor out\n    const tensorData = data.slice(0, byteLength);\n    data = data.slice(byteLength);\n\n    const weightTensor = decodeWeight(spec, tensorData);\n    tensors[spec.name] = weightTensor;\n\n    // TODO(mattsoulanille): Better way to call uploadToGPU.\n    // TODO(mattsoulanille): Make this work for webgl too.\n    if (getBackend() === 'webgpu') {\n      const b = backend();\n\n      if ('uploadToGPU' in b &&\n        sizeFromShape(weightTensor.shape) >= (env()\n          .get('WEBGPU_CPU_HANDOFF_SIZE_THRESHOLD') as number)) {\n        (b.uploadToGPU as (dataId: DataId) => void)(weightTensor.dataId);\n      }\n    }\n  }\n\n  return tensors;\n}\n\n/**\n * Concatenate TypedArrays into an ArrayBuffer.\n */\nexport function concatenateTypedArrays(xs: TypedArray[]): ArrayBuffer {\n  // TODO(adarob, cais): Support quantization.\n  if (xs === null) {\n    throw new Error(`Invalid input value: ${JSON.stringify(xs)}`);\n  }\n\n  let totalByteLength = 0;\n\n  // `normalizedXs` is here for this reason: a `TypedArray`'s `buffer'\n  // can have a different byte length from that of the `TypedArray` itself,\n  // for example, when the `TypedArray` is created from an offset in an\n  // `ArrayBuffer`. `normliazedXs` holds `TypedArray`s whose `buffer`s match\n  // the `TypedArray` in byte length. If an element of `xs` does not show\n  // this property, a new `TypedArray` that satisfy this property will be\n  // constructed and pushed into `normalizedXs`.\n  const normalizedXs: TypedArray[] = [];\n  xs.forEach((x: TypedArray) => {\n    totalByteLength += x.byteLength;\n    // tslint:disable:no-any\n    normalizedXs.push(\n        x.byteLength === x.buffer.byteLength ? x :\n                                               new (x.constructor as any)(x));\n    if (!(x as any instanceof Float32Array || x as any instanceof Int32Array ||\n          x as any instanceof Uint8Array)) {\n      throw new Error(`Unsupported TypedArray subtype: ${x.constructor.name}`);\n    }\n    // tslint:enable:no-any\n  });\n\n  const y = new Uint8Array(totalByteLength);\n  let offset = 0;\n  normalizedXs.forEach((x: TypedArray) => {\n    y.set(new Uint8Array(x.buffer), offset);\n    offset += x.byteLength;\n  });\n\n  return y.buffer;\n}\n\n// Use Buffer on Node.js instead of Blob/atob/btoa\nconst useNodeBuffer = typeof Buffer !== 'undefined' &&\n    (typeof Blob === 'undefined' || typeof atob === 'undefined' ||\n     typeof btoa === 'undefined');\n\n/**\n * Calculate the byte length of a JavaScript string.\n *\n * Note that a JavaScript string can contain wide characters, therefore the\n * length of the string is not necessarily equal to the byte length.\n *\n * @param str Input string.\n * @returns Byte length.\n */\nexport function stringByteLength(str: string): number {\n  if (useNodeBuffer) {\n    return Buffer.byteLength(str, 'utf8');\n  }\n  return new Blob([str]).size;\n}\n\n/**\n * Encode an ArrayBuffer as a base64 encoded string.\n *\n * @param buffer `ArrayBuffer` to be converted.\n * @returns A string that base64-encodes `buffer`.\n */\nexport function arrayBufferToBase64String(buffer: ArrayBuffer): string {\n  if (useNodeBuffer) {\n    return Buffer.from(buffer).toString('base64');\n  }\n  const buf = new Uint8Array(buffer);\n  let s = '';\n  for (let i = 0, l = buf.length; i < l; i++) {\n    s += String.fromCharCode(buf[i]);\n  }\n  return btoa(s);\n}\n\n/**\n * Decode a base64 string as an ArrayBuffer.\n *\n * @param str Base64 string.\n * @returns Decoded `ArrayBuffer`.\n */\nexport function base64StringToArrayBuffer(str: string): ArrayBuffer {\n  if (useNodeBuffer) {\n    const buf = Buffer.from(str, 'base64');\n    return buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n  }\n  const s = atob(str);\n  const buffer = new Uint8Array(s.length);\n  for (let i = 0; i < s.length; ++i) {\n    buffer.set([s.charCodeAt(i)], i);\n  }\n  return buffer.buffer;\n}\n\n/**\n * Concatenate a number of ArrayBuffers into one.\n *\n * @param buffers An array of ArrayBuffers to concatenate, or a single\n *     ArrayBuffer.\n * @returns Result of concatenating `buffers` in order.\n *\n * @deprecated Use tf.io.CompositeArrayBuffer.join() instead.\n */\nexport function concatenateArrayBuffers(buffers: ArrayBuffer[]\n      | ArrayBuffer): ArrayBuffer {\n  return CompositeArrayBuffer.join(buffers);\n}\n\n/**\n * Get the basename of a path.\n *\n * Behaves in a way analogous to Linux's basename command.\n *\n * @param path\n */\nexport function basename(path: string): string {\n  const SEPARATOR = '/';\n  path = path.trim();\n  while (path.endsWith(SEPARATOR)) {\n    path = path.slice(0, path.length - 1);\n  }\n  const items = path.split(SEPARATOR);\n  return items[items.length - 1];\n}\n\n/**\n * Create `ModelJSON` from `ModelArtifacts`.\n *\n * @param artifacts Model artifacts, describing the model and its weights.\n * @param manifest Weight manifest, describing where the weights of the\n *     `ModelArtifacts` are stored, and some metadata about them.\n * @returns Object representing the `model.json` file describing the model\n *     artifacts and weights\n */\nexport function getModelJSONForModelArtifacts(\n    artifacts: ModelArtifacts, manifest: WeightsManifestConfig): ModelJSON {\n  const result: ModelJSON = {\n    modelTopology: artifacts.modelTopology,\n    format: artifacts.format,\n    generatedBy: artifacts.generatedBy,\n    convertedBy: artifacts.convertedBy,\n    weightsManifest: manifest\n  };\n  if (artifacts.signature != null) {\n    result.signature = artifacts.signature;\n  }\n  if (artifacts.userDefinedMetadata != null) {\n    result.userDefinedMetadata = artifacts.userDefinedMetadata;\n  }\n  if (artifacts.modelInitializer != null) {\n    result.modelInitializer = artifacts.modelInitializer;\n  }\n  if (artifacts.initializerSignature != null) {\n    result.initializerSignature = artifacts.initializerSignature;\n  }\n  if (artifacts.trainingConfig != null) {\n    result.trainingConfig = artifacts.trainingConfig;\n  }\n  return result;\n}\n\n/**\n * Create `ModelArtifacts` from a JSON file and weights.\n *\n * @param modelJSON Object containing the parsed JSON of `model.json`\n * @param weightSpecs The list of WeightsManifestEntry for the model. Must be\n *     passed if the modelJSON has a weightsManifest.\n * @param weightData An ArrayBuffer or array of ArrayBuffers of weight data for\n *     the model corresponding to the weights in weightSpecs. Must be passed if\n *     the modelJSON has a weightsManifest.\n * @returns A Promise of the `ModelArtifacts`, as described by the JSON file.\n */\nexport function getModelArtifactsForJSONSync(\n    modelJSON: ModelJSON, weightSpecs?: WeightsManifestEntry[],\n    weightData?: WeightData): ModelArtifacts {\n\n  const modelArtifacts: ModelArtifacts = {\n    modelTopology: modelJSON.modelTopology,\n    format: modelJSON.format,\n    generatedBy: modelJSON.generatedBy,\n    convertedBy: modelJSON.convertedBy\n  };\n\n  if (modelJSON.trainingConfig != null) {\n    modelArtifacts.trainingConfig = modelJSON.trainingConfig;\n  }\n  if (modelJSON.weightsManifest != null) {\n    if (!weightSpecs) {\n      throw new Error('modelJSON has weightsManifest but weightSpecs is null');\n    }\n    if (!weightData) {\n      throw new Error('modelJSON has weightsManifest but weightData is null');\n    }\n    modelArtifacts.weightSpecs = weightSpecs;\n    modelArtifacts.weightData = weightData;\n  }\n  if (modelJSON.signature != null) {\n    modelArtifacts.signature = modelJSON.signature;\n  }\n  if (modelJSON.userDefinedMetadata != null) {\n    modelArtifacts.userDefinedMetadata = modelJSON.userDefinedMetadata;\n  }\n  if (modelJSON.modelInitializer != null) {\n    modelArtifacts.modelInitializer = modelJSON.modelInitializer;\n  }\n  if (modelJSON.initializerSignature != null) {\n    modelArtifacts.initializerSignature = modelJSON.initializerSignature;\n  }\n\n  return modelArtifacts;\n}\n\n/**\n * Create `ModelArtifacts` from a JSON file.\n *\n * @param modelJSON Object containing the parsed JSON of `model.json`\n * @param loadWeights Function that takes the JSON file's weights manifest,\n *     reads weights from the listed path(s), and returns a Promise of the\n *     weight manifest entries along with the weights data.\n * @returns A Promise of the `ModelArtifacts`, as described by the JSON file.\n */\nexport async function getModelArtifactsForJSON(\n    modelJSON: ModelJSON,\n    loadWeights: (weightsManifest: WeightsManifestConfig) => Promise<[\n      /* weightSpecs */ WeightsManifestEntry[], WeightData,\n    ]>): Promise<ModelArtifacts> {\n  let weightSpecs: WeightsManifestEntry[] | undefined;\n  let weightData: WeightData | undefined;\n\n  if (modelJSON.weightsManifest != null) {\n    [weightSpecs, weightData] = await loadWeights(modelJSON.weightsManifest);\n  }\n\n  return getModelArtifactsForJSONSync(modelJSON, weightSpecs, weightData);\n}\n\n/**\n * Populate ModelArtifactsInfo fields for a model with JSON topology.\n * @param modelArtifacts\n * @returns A ModelArtifactsInfo object.\n */\nexport function getModelArtifactsInfoForJSON(modelArtifacts: ModelArtifacts):\n    ModelArtifactsInfo {\n  if (modelArtifacts.modelTopology instanceof ArrayBuffer) {\n    throw new Error('Expected JSON model topology, received ArrayBuffer.');\n  }\n\n  return {\n    dateSaved: new Date(),\n    modelTopologyType: 'JSON',\n    modelTopologyBytes: modelArtifacts.modelTopology == null ?\n        0 :\n        stringByteLength(JSON.stringify(modelArtifacts.modelTopology)),\n    weightSpecsBytes: modelArtifacts.weightSpecs == null ?\n        0 :\n        stringByteLength(JSON.stringify(modelArtifacts.weightSpecs)),\n    weightDataBytes: modelArtifacts.weightData == null ?\n        0 :\n        new CompositeArrayBuffer(modelArtifacts.weightData).byteLength,\n  };\n}\n\n/**\n * Concatenate the weights stored in a WeightsManifestConfig into a list of\n * WeightsManifestEntry\n *\n * @param weightsManifest The WeightsManifestConfig to extract weights from.\n * @returns A list of WeightsManifestEntry of the weights in the weightsManifest\n */\nexport function getWeightSpecs(weightsManifest: WeightsManifestConfig):\n    WeightsManifestEntry[] {\n  const weightSpecs: WeightsManifestEntry[] = [];\n  for (const entry of weightsManifest) {\n    weightSpecs.push(...entry.weights);\n  }\n  return weightSpecs;\n}\n\n/**\n * Computes mantisa table for casting Float16 to Float32\n * See http://www.fox-toolkit.org/ftp/fasthalffloatconversion.pdf\n *\n * @returns Uint32Array, 2048 mantissa lookup values.\n */\nfunction computeFloat16MantisaTable(): Uint32Array {\n  const convertMantissa = (i: number): number => {\n    let m = i << 13;\n    let e = 0;\n\n    while ((m & 0x00800000) === 0) {\n      e -= 0x00800000;\n      m <<= 1;\n    }\n    m &= ~0x00800000;\n    e += 0x38800000;\n\n    return m | e;\n  };\n\n  const mantisaTable = new Uint32Array(2048);\n\n  mantisaTable[0] = 0;\n  for (let i = 1; i < 1024; i++) {\n    mantisaTable[i] = convertMantissa(i);\n  }\n  for (let i = 1024; i < 2048; i++) {\n    mantisaTable[i] = 0x38000000 + ((i - 1024) << 13);\n  }\n\n  return mantisaTable;\n}\n\n/**\n * Computes exponent table for casting Float16 to Float32\n * See http://www.fox-toolkit.org/ftp/fasthalffloatconversion.pdf\n *\n * @returns Uint32Array, 64 exponent lookup values.\n */\nfunction computeFloat16ExponentTable(): Uint32Array {\n  const exponentTable = new Uint32Array(64);\n\n  exponentTable[0] = 0;\n  exponentTable[31] = 0x47800000;\n  exponentTable[32] = 0x80000000;\n  exponentTable[63] = 0xc7800000;\n  for (let i = 1; i < 31; i++) {\n    exponentTable[i] = i << 23;\n  }\n  for (let i = 33; i < 63; i++) {\n    exponentTable[i] = 0x80000000 + ((i - 32) << 23);\n  }\n\n  return exponentTable;\n}\n\n/**\n * Computes offset table for casting Float16 to Float32\n * See http://www.fox-toolkit.org/ftp/fasthalffloatconversion.pdf\n *\n * @returns Uint32Array, 6d offset values.\n */\nfunction computeFloat16OffsetTable(): Uint32Array {\n  const offsetTable = new Uint32Array(64);\n\n  for (let i = 0; i < 64; i++) {\n    offsetTable[i] = 1024;\n  }\n  offsetTable[0] = offsetTable[32] = 0;\n\n  return offsetTable;\n}\n\n/**\n * Retrieve a Float16 decoder which will decode a ByteArray of Float16 values\n * to a Float32Array.\n *\n * @returns Function (buffer: Uint16Array) => Float32Array which decodes\n *          the Uint16Array of Float16 bytes to a Float32Array.\n */\nexport function getFloat16Decoder(): (buffer: Uint16Array) => Float32Array {\n  // Algorithm is based off of\n  // http://www.fox-toolkit.org/ftp/fasthalffloatconversion.pdf\n\n  // Cache lookup tables\n  const mantisaTable = computeFloat16MantisaTable();\n  const exponentTable = computeFloat16ExponentTable();\n  const offsetTable = computeFloat16OffsetTable();\n\n  return (quantizedArray: Uint16Array) => {\n    const buffer = new ArrayBuffer(4 * quantizedArray.length);\n    const bufferUint32View = new Uint32Array(buffer);\n    for (let index = 0; index < quantizedArray.length; index++) {\n      const float16Bits = quantizedArray[index];\n      const float32Bits =\n          mantisaTable[offsetTable[float16Bits >> 10] + (float16Bits & 0x3ff)] +\n          exponentTable[float16Bits >> 10];\n      bufferUint32View[index] = float32Bits;\n    }\n    return new Float32Array(buffer);\n  };\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {IOHandler, LoadOptions} from './types';\n\nexport type IORouter = (url: string|string[], loadOptions?: LoadOptions) =>\n    IOHandler;\n\nexport class IORouterRegistry {\n  // Singleton instance.\n  private static instance: IORouterRegistry;\n\n  private saveRouters: IORouter[];\n  private loadRouters: IORouter[];\n\n  private constructor() {\n    this.saveRouters = [];\n    this.loadRouters = [];\n  }\n\n  private static getInstance(): IORouterRegistry {\n    if (IORouterRegistry.instance == null) {\n      IORouterRegistry.instance = new IORouterRegistry();\n    }\n    return IORouterRegistry.instance;\n  }\n\n  /**\n   * Register a save-handler router.\n   *\n   * @param saveRouter A function that maps a URL-like string onto an instance\n   * of `IOHandler` with the `save` method defined or `null`.\n   */\n  static registerSaveRouter(saveRouter: IORouter) {\n    IORouterRegistry.getInstance().saveRouters.push(saveRouter);\n  }\n\n  /**\n   * Register a load-handler router.\n   *\n   * @param loadRouter A function that maps a URL-like string onto an instance\n   * of `IOHandler` with the `load` method defined or `null`.\n   */\n  static registerLoadRouter(loadRouter: IORouter) {\n    IORouterRegistry.getInstance().loadRouters.push(loadRouter);\n  }\n\n  /**\n   * Look up IOHandler for saving, given a URL-like string.\n   *\n   * @param url\n   * @returns If only one match is found, an instance of IOHandler with the\n   * `save` method defined. If no match is found, `null`.\n   * @throws Error, if more than one match is found.\n   */\n  static getSaveHandlers(url: string|string[]): IOHandler[] {\n    return IORouterRegistry.getHandlers(url, 'save');\n  }\n\n  /**\n   * Look up IOHandler for loading, given a URL-like string.\n   *\n   * @param url\n   * @param loadOptions Optional, custom load options.\n   * @returns All valid handlers for `url`, given the currently registered\n   *   handler routers.\n   */\n  static getLoadHandlers(url: string|string[], loadOptions?: LoadOptions):\n      IOHandler[] {\n    return IORouterRegistry.getHandlers(url, 'load', loadOptions);\n  }\n\n  private static getHandlers(\n      url: string|string[], handlerType: 'save'|'load',\n      loadOptions?: LoadOptions): IOHandler[] {\n    const validHandlers: IOHandler[] = [];\n    const routers = handlerType === 'load' ?\n        IORouterRegistry.getInstance().loadRouters :\n        IORouterRegistry.getInstance().saveRouters;\n    routers.forEach(router => {\n      const handler = router(url, loadOptions);\n      if (handler !== null) {\n        validHandlers.push(handler);\n      }\n    });\n    return validHandlers;\n  }\n}\n\nexport const registerSaveRouter = (loudRouter: IORouter) =>\n    IORouterRegistry.registerSaveRouter(loudRouter);\nexport const registerLoadRouter = (loudRouter: IORouter) =>\n    IORouterRegistry.registerLoadRouter(loudRouter);\nexport const getSaveHandlers = (url: string|string[]) =>\n    IORouterRegistry.getSaveHandlers(url);\nexport const getLoadHandlers =\n    (url: string|string[], loadOptions?: LoadOptions) =>\n        IORouterRegistry.getLoadHandlers(url, loadOptions);\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport '../flags';\n\nimport {env} from '../environment';\n\nimport {getModelArtifactsInfoForJSON} from './io_utils';\nimport {IORouter, IORouterRegistry} from './router_registry';\nimport {IOHandler, ModelArtifacts, ModelArtifactsInfo, ModelStoreManager, SaveResult} from './types';\nimport {CompositeArrayBuffer} from './composite_array_buffer';\n\nconst DATABASE_NAME = 'tensorflowjs';\nconst DATABASE_VERSION = 1;\n\n// Model data and ModelArtifactsInfo (metadata) are stored in two separate\n// stores for efficient access of the list of stored models and their metadata.\n// 1. The object store for model data: topology, weights and weight manifests.\nconst MODEL_STORE_NAME = 'models_store';\n// 2. The object store for ModelArtifactsInfo, including meta-information such\n//    as the type of topology (JSON vs binary), byte size of the topology, byte\n//    size of the weights, etc.\nconst INFO_STORE_NAME = 'model_info_store';\n\n/**\n * Delete the entire database for tensorflow.js, including the models store.\n */\nexport async function deleteDatabase(): Promise<void> {\n  const idbFactory = getIndexedDBFactory();\n\n  return new Promise<void>((resolve, reject) => {\n    const deleteRequest = idbFactory.deleteDatabase(DATABASE_NAME);\n    deleteRequest.onsuccess = () => resolve();\n    deleteRequest.onerror = error => reject(error);\n  });\n}\n\nfunction getIndexedDBFactory(): IDBFactory {\n  if (!env().getBool('IS_BROWSER')) {\n    // TODO(cais): Add more info about what IOHandler subtypes are available.\n    //   Maybe point to a doc page on the web and/or automatically determine\n    //   the available IOHandlers and print them in the error message.\n    throw new Error(\n        'Failed to obtain IndexedDB factory because the current environment' +\n        'is not a web browser.');\n  }\n  // tslint:disable-next-line:no-any\n  const theWindow: any = typeof window === 'undefined' ? self : window;\n  const factory = theWindow.indexedDB || theWindow.mozIndexedDB ||\n      theWindow.webkitIndexedDB || theWindow.msIndexedDB ||\n      theWindow.shimIndexedDB;\n  if (factory == null) {\n    throw new Error(\n        'The current browser does not appear to support IndexedDB.');\n  }\n  return factory;\n}\n\nfunction setUpDatabase(openRequest: IDBRequest) {\n  const db = openRequest.result as IDBDatabase;\n  db.createObjectStore(MODEL_STORE_NAME, {keyPath: 'modelPath'});\n  db.createObjectStore(INFO_STORE_NAME, {keyPath: 'modelPath'});\n}\n\n/**\n * IOHandler subclass: Browser IndexedDB.\n *\n * See the doc string of `browserIndexedDB` for more details.\n */\nexport class BrowserIndexedDB implements IOHandler {\n  protected readonly indexedDB: IDBFactory;\n  protected readonly modelPath: string;\n\n  static readonly URL_SCHEME = 'indexeddb://';\n\n  constructor(modelPath: string) {\n    this.indexedDB = getIndexedDBFactory();\n\n    if (modelPath == null || !modelPath) {\n      throw new Error(\n          'For IndexedDB, modelPath must not be null, undefined or empty.');\n    }\n    this.modelPath = modelPath;\n  }\n\n  async save(modelArtifacts: ModelArtifacts): Promise<SaveResult> {\n    // TODO(cais): Support saving GraphDef models.\n    if (modelArtifacts.modelTopology instanceof ArrayBuffer) {\n      throw new Error(\n          'BrowserLocalStorage.save() does not support saving model topology ' +\n          'in binary formats yet.');\n    }\n\n    return this.databaseAction(this.modelPath, modelArtifacts) as\n        Promise<SaveResult>;\n  }\n\n  async load(): Promise<ModelArtifacts> {\n    return this.databaseAction(this.modelPath) as Promise<ModelArtifacts>;\n  }\n\n  /**\n   * Perform database action to put model artifacts into or read model artifacts\n   * from IndexedDB object store.\n   *\n   * Whether the action is put or get depends on whether `modelArtifacts` is\n   * specified. If it is specified, the action will be put; otherwise the action\n   * will be get.\n   *\n   * @param modelPath A unique string path for the model.\n   * @param modelArtifacts If specified, it will be the model artifacts to be\n   *   stored in IndexedDB.\n   * @returns A `Promise` of `SaveResult`, if the action is put, or a `Promise`\n   *   of `ModelArtifacts`, if the action is get.\n   */\n  private databaseAction(modelPath: string, modelArtifacts?: ModelArtifacts):\n      Promise<ModelArtifacts|SaveResult> {\n    return new Promise<ModelArtifacts|SaveResult>((resolve, reject) => {\n      const openRequest = this.indexedDB.open(DATABASE_NAME, DATABASE_VERSION);\n      openRequest.onupgradeneeded = () => setUpDatabase(openRequest);\n\n      openRequest.onsuccess = () => {\n        const db = openRequest.result;\n\n        if (modelArtifacts == null) {\n          // Read model out from object store.\n          const modelTx = db.transaction(MODEL_STORE_NAME, 'readonly');\n          const modelStore = modelTx.objectStore(MODEL_STORE_NAME);\n          const getRequest = modelStore.get(this.modelPath);\n          getRequest.onsuccess = () => {\n            if (getRequest.result == null) {\n              db.close();\n              return reject(new Error(\n                  `Cannot find model with path '${this.modelPath}' ` +\n                  `in IndexedDB.`));\n            } else {\n              resolve(getRequest.result.modelArtifacts);\n            }\n          };\n          getRequest.onerror = error => {\n            db.close();\n            return reject(getRequest.error);\n          };\n          modelTx.oncomplete = () => db.close();\n        } else {\n          // Put model into object store.\n\n          // Concatenate all the model weights into a single ArrayBuffer. Large\n          // models (~1GB) have problems saving if they are not concatenated.\n          // TODO(mattSoulanille): Save large models to multiple indexeddb\n          // records.\n          modelArtifacts.weightData = CompositeArrayBuffer.join(\n              modelArtifacts.weightData);\n          const modelArtifactsInfo: ModelArtifactsInfo =\n              getModelArtifactsInfoForJSON(modelArtifacts);\n          // First, put ModelArtifactsInfo into info store.\n          const infoTx = db.transaction(INFO_STORE_NAME, 'readwrite');\n          let infoStore = infoTx.objectStore(INFO_STORE_NAME);\n          let putInfoRequest: IDBRequest<IDBValidKey>;\n          try {\n            putInfoRequest =\n              infoStore.put({modelPath: this.modelPath, modelArtifactsInfo});\n          } catch (error) {\n            return reject(error);\n          }\n          let modelTx: IDBTransaction;\n          putInfoRequest.onsuccess = () => {\n            // Second, put model data into model store.\n            modelTx = db.transaction(MODEL_STORE_NAME, 'readwrite');\n            const modelStore = modelTx.objectStore(MODEL_STORE_NAME);\n            let putModelRequest: IDBRequest<IDBValidKey>;\n            try {\n              putModelRequest = modelStore.put({\n                modelPath: this.modelPath,\n                modelArtifacts,\n                modelArtifactsInfo\n              });\n            } catch (error) {\n              // Sometimes, the serialized value is too large to store.\n              return reject(error);\n            }\n            putModelRequest.onsuccess = () => resolve({modelArtifactsInfo});\n            putModelRequest.onerror = error => {\n              // If the put-model request fails, roll back the info entry as\n              // well.\n              infoStore = infoTx.objectStore(INFO_STORE_NAME);\n              const deleteInfoRequest = infoStore.delete(this.modelPath);\n              deleteInfoRequest.onsuccess = () => {\n                db.close();\n                return reject(putModelRequest.error);\n              };\n              deleteInfoRequest.onerror = error => {\n                db.close();\n                return reject(putModelRequest.error);\n              };\n            };\n          };\n          putInfoRequest.onerror = error => {\n            db.close();\n            return reject(putInfoRequest.error);\n          };\n          infoTx.oncomplete = () => {\n            if (modelTx == null) {\n              db.close();\n            } else {\n              modelTx.oncomplete = () => db.close();\n            }\n          };\n        }\n      };\n      openRequest.onerror = error => reject(openRequest.error);\n    });\n  }\n}\n\nexport const indexedDBRouter: IORouter = (url: string|string[]) => {\n  if (!env().getBool('IS_BROWSER')) {\n    return null;\n  } else {\n    if (!Array.isArray(url) && url.startsWith(BrowserIndexedDB.URL_SCHEME)) {\n      return browserIndexedDB(url.slice(BrowserIndexedDB.URL_SCHEME.length));\n    } else {\n      return null;\n    }\n  }\n};\nIORouterRegistry.registerSaveRouter(indexedDBRouter);\nIORouterRegistry.registerLoadRouter(indexedDBRouter);\n\n/**\n * Creates a browser IndexedDB IOHandler for saving and loading models.\n *\n * ```js\n * const model = tf.sequential();\n * model.add(\n *     tf.layers.dense({units: 1, inputShape: [100], activation: 'sigmoid'}));\n *\n * const saveResult = await model.save('indexeddb://MyModel'));\n * console.log(saveResult);\n * ```\n *\n * @param modelPath A unique identifier for the model to be saved. Must be a\n *   non-empty string.\n * @returns An instance of `BrowserIndexedDB` (subclass of `IOHandler`),\n *   which can be used with, e.g., `tf.Model.save`.\n */\nexport function browserIndexedDB(modelPath: string): IOHandler {\n  return new BrowserIndexedDB(modelPath);\n}\n\nfunction maybeStripScheme(key: string) {\n  return key.startsWith(BrowserIndexedDB.URL_SCHEME) ?\n      key.slice(BrowserIndexedDB.URL_SCHEME.length) :\n      key;\n}\n\nexport class BrowserIndexedDBManager implements ModelStoreManager {\n  private indexedDB: IDBFactory;\n\n  constructor() {\n    this.indexedDB = getIndexedDBFactory();\n  }\n\n  async listModels(): Promise<{[path: string]: ModelArtifactsInfo}> {\n    return new Promise<{[path: string]: ModelArtifactsInfo}>(\n        (resolve, reject) => {\n          const openRequest =\n              this.indexedDB.open(DATABASE_NAME, DATABASE_VERSION);\n          openRequest.onupgradeneeded = () => setUpDatabase(openRequest);\n\n          openRequest.onsuccess = () => {\n            const db = openRequest.result;\n            const tx = db.transaction(INFO_STORE_NAME, 'readonly');\n            const store = tx.objectStore(INFO_STORE_NAME);\n            // tslint:disable:max-line-length\n            // Need to cast `store` as `any` here because TypeScript's DOM\n            // library does not have the `getAll()` method even though the\n            // method is supported in the latest version of most mainstream\n            // browsers:\n            // https://developer.mozilla.org/en-US/docs/Web/API/IDBObjectStore/getAll\n            // tslint:enable:max-line-length\n            // tslint:disable-next-line:no-any\n            const getAllInfoRequest = (store as any).getAll() as IDBRequest;\n            getAllInfoRequest.onsuccess = () => {\n              const out: {[path: string]: ModelArtifactsInfo} = {};\n              for (const item of getAllInfoRequest.result) {\n                out[item.modelPath] = item.modelArtifactsInfo;\n              }\n              resolve(out);\n            };\n            getAllInfoRequest.onerror = error => {\n              db.close();\n              return reject(getAllInfoRequest.error);\n            };\n            tx.oncomplete = () => db.close();\n          };\n          openRequest.onerror = error => reject(openRequest.error);\n        });\n  }\n\n  async removeModel(path: string): Promise<ModelArtifactsInfo> {\n    path = maybeStripScheme(path);\n    return new Promise<ModelArtifactsInfo>((resolve, reject) => {\n      const openRequest = this.indexedDB.open(DATABASE_NAME, DATABASE_VERSION);\n      openRequest.onupgradeneeded = () => setUpDatabase(openRequest);\n\n      openRequest.onsuccess = () => {\n        const db = openRequest.result;\n        const infoTx = db.transaction(INFO_STORE_NAME, 'readwrite');\n        const infoStore = infoTx.objectStore(INFO_STORE_NAME);\n\n        const getInfoRequest = infoStore.get(path);\n        let modelTx: IDBTransaction;\n        getInfoRequest.onsuccess = () => {\n          if (getInfoRequest.result == null) {\n            db.close();\n            return reject(new Error(\n                `Cannot find model with path '${path}' ` +\n                `in IndexedDB.`));\n          } else {\n            // First, delete the entry in the info store.\n            const deleteInfoRequest = infoStore.delete(path);\n            const deleteModelData = () => {\n              // Second, delete the entry in the model store.\n              modelTx = db.transaction(MODEL_STORE_NAME, 'readwrite');\n              const modelStore = modelTx.objectStore(MODEL_STORE_NAME);\n              const deleteModelRequest = modelStore.delete(path);\n              deleteModelRequest.onsuccess = () =>\n                  resolve(getInfoRequest.result.modelArtifactsInfo);\n              deleteModelRequest.onerror = error =>\n                  reject(getInfoRequest.error);\n            };\n            // Proceed with deleting model data regardless of whether deletion\n            // of info data succeeds or not.\n            deleteInfoRequest.onsuccess = deleteModelData;\n            deleteInfoRequest.onerror = error => {\n              deleteModelData();\n              db.close();\n              return reject(getInfoRequest.error);\n            };\n          }\n        };\n        getInfoRequest.onerror = error => {\n          db.close();\n          return reject(getInfoRequest.error);\n        };\n\n        infoTx.oncomplete = () => {\n          if (modelTx == null) {\n            db.close();\n          } else {\n            modelTx.oncomplete = () => db.close();\n          }\n        };\n      };\n      openRequest.onerror = error => reject(openRequest.error);\n    });\n  }\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport '../flags';\nimport {env} from '../environment';\n\nimport {assert} from '../util';\nimport {arrayBufferToBase64String, base64StringToArrayBuffer, getModelArtifactsInfoForJSON} from './io_utils';\nimport {CompositeArrayBuffer} from './composite_array_buffer';\nimport {IORouter, IORouterRegistry} from './router_registry';\nimport {IOHandler, ModelArtifacts, ModelArtifactsInfo, ModelJSON, ModelStoreManager, SaveResult} from './types';\n\nconst PATH_SEPARATOR = '/';\nconst PATH_PREFIX = 'tensorflowjs_models';\nconst INFO_SUFFIX = 'info';\nconst MODEL_TOPOLOGY_SUFFIX = 'model_topology';\nconst WEIGHT_SPECS_SUFFIX = 'weight_specs';\nconst WEIGHT_DATA_SUFFIX = 'weight_data';\nconst MODEL_METADATA_SUFFIX = 'model_metadata';\n\n/**\n * Purge all tensorflow.js-saved model artifacts from local storage.\n *\n * @returns Paths of the models purged.\n */\nexport function purgeLocalStorageArtifacts(): string[] {\n  if (!env().getBool('IS_BROWSER') || typeof window === 'undefined' ||\n      typeof window.localStorage === 'undefined') {\n    throw new Error(\n        'purgeLocalStorageModels() cannot proceed because local storage is ' +\n        'unavailable in the current environment.');\n  }\n  const LS = window.localStorage;\n  const purgedModelPaths: string[] = [];\n  for (let i = 0; i < LS.length; ++i) {\n    const key = LS.key(i);\n    const prefix = PATH_PREFIX + PATH_SEPARATOR;\n    if (key.startsWith(prefix) && key.length > prefix.length) {\n      LS.removeItem(key);\n      const modelName = getModelPathFromKey(key);\n      if (purgedModelPaths.indexOf(modelName) === -1) {\n        purgedModelPaths.push(modelName);\n      }\n    }\n  }\n  return purgedModelPaths;\n}\n\ntype LocalStorageKeys = {\n  /** Key of the localStorage entry storing `ModelArtifactsInfo`. */\n  info: string,\n  /**\n   * Key of the localStorage entry storing the 'modelTopology' key of\n   * `model.json`\n   */\n  topology: string,\n  /**\n   * Key of the localStorage entry storing the `weightsManifest.weights` entries\n   * of `model.json`\n   */\n  weightSpecs: string,\n  /** Key of the localStorage entry storing the weight data in Base64 */\n  weightData: string,\n  /**\n   * Key of the localStorage entry storing the remaining fields of `model.json`\n   * @see {@link ModelMetadata}\n   */\n  modelMetadata: string,\n};\n\ntype ModelMetadata = Omit<ModelJSON, 'modelTopology'|'weightsManifest'>;\n\nfunction getModelKeys(path: string): LocalStorageKeys {\n  return {\n    info: [PATH_PREFIX, path, INFO_SUFFIX].join(PATH_SEPARATOR),\n    topology: [PATH_PREFIX, path, MODEL_TOPOLOGY_SUFFIX].join(PATH_SEPARATOR),\n    weightSpecs: [PATH_PREFIX, path, WEIGHT_SPECS_SUFFIX].join(PATH_SEPARATOR),\n    weightData: [PATH_PREFIX, path, WEIGHT_DATA_SUFFIX].join(PATH_SEPARATOR),\n    modelMetadata:\n        [PATH_PREFIX, path, MODEL_METADATA_SUFFIX].join(PATH_SEPARATOR)\n  };\n}\n\nfunction removeItems(keys: LocalStorageKeys): void {\n  for (const key of Object.values(keys)) {\n    window.localStorage.removeItem(key);\n  }\n}\n\n/**\n * Get model path from a local-storage key.\n *\n * E.g., 'tensorflowjs_models/my/model/1/info' --> 'my/model/1'\n *\n * @param key\n */\nfunction getModelPathFromKey(key: string) {\n  const items = key.split(PATH_SEPARATOR);\n  if (items.length < 3) {\n    throw new Error(`Invalid key format: ${key}`);\n  }\n  return items.slice(1, items.length - 1).join(PATH_SEPARATOR);\n}\n\nfunction maybeStripScheme(key: string) {\n  return key.startsWith(BrowserLocalStorage.URL_SCHEME) ?\n      key.slice(BrowserLocalStorage.URL_SCHEME.length) :\n      key;\n}\n\n/**\n * IOHandler subclass: Browser Local Storage.\n *\n * See the doc string to `browserLocalStorage` for more details.\n */\nexport class BrowserLocalStorage implements IOHandler {\n  protected readonly LS: Storage;\n  protected readonly modelPath: string;\n  protected readonly keys: LocalStorageKeys;\n\n  static readonly URL_SCHEME = 'localstorage://';\n\n  constructor(modelPath: string) {\n    if (!env().getBool('IS_BROWSER') || typeof window === 'undefined' ||\n        typeof window.localStorage === 'undefined') {\n      // TODO(cais): Add more info about what IOHandler subtypes are\n      // available.\n      //   Maybe point to a doc page on the web and/or automatically determine\n      //   the available IOHandlers and print them in the error message.\n      throw new Error(\n          'The current environment does not support local storage.');\n    }\n    this.LS = window.localStorage;\n\n    if (modelPath == null || !modelPath) {\n      throw new Error(\n          'For local storage, modelPath must not be null, undefined or empty.');\n    }\n    this.modelPath = modelPath;\n    this.keys = getModelKeys(this.modelPath);\n  }\n\n  /**\n   * Save model artifacts to browser local storage.\n   *\n   * See the documentation to `browserLocalStorage` for details on the saved\n   * artifacts.\n   *\n   * @param modelArtifacts The model artifacts to be stored.\n   * @returns An instance of SaveResult.\n   */\n  async save(modelArtifacts: ModelArtifacts): Promise<SaveResult> {\n    if (modelArtifacts.modelTopology instanceof ArrayBuffer) {\n      throw new Error(\n          'BrowserLocalStorage.save() does not support saving model topology ' +\n          'in binary formats yet.');\n    } else {\n      const topology = JSON.stringify(modelArtifacts.modelTopology);\n      const weightSpecs = JSON.stringify(modelArtifacts.weightSpecs);\n\n      const modelArtifactsInfo: ModelArtifactsInfo =\n          getModelArtifactsInfoForJSON(modelArtifacts);\n\n      // TODO(mattsoulanille): Support saving models over 2GB that exceed\n      // Chrome's ArrayBuffer size limit.\n      const weightBuffer = CompositeArrayBuffer.join(modelArtifacts.weightData);\n\n      try {\n        this.LS.setItem(this.keys.info, JSON.stringify(modelArtifactsInfo));\n        this.LS.setItem(this.keys.topology, topology);\n        this.LS.setItem(this.keys.weightSpecs, weightSpecs);\n        this.LS.setItem(\n            this.keys.weightData,\n            arrayBufferToBase64String(weightBuffer));\n\n        // Note that JSON.stringify doesn't write out keys that have undefined\n        // values, so for some keys, we set undefined instead of a null-ish\n        // value.\n        const metadata: Required<ModelMetadata> = {\n          format: modelArtifacts.format,\n          generatedBy: modelArtifacts.generatedBy,\n          convertedBy: modelArtifacts.convertedBy,\n          signature: modelArtifacts.signature != null ?\n              modelArtifacts.signature :\n              undefined,\n          userDefinedMetadata: modelArtifacts.userDefinedMetadata != null ?\n              modelArtifacts.userDefinedMetadata :\n              undefined,\n          modelInitializer: modelArtifacts.modelInitializer != null ?\n              modelArtifacts.modelInitializer :\n              undefined,\n          initializerSignature: modelArtifacts.initializerSignature != null ?\n              modelArtifacts.initializerSignature :\n              undefined,\n          trainingConfig: modelArtifacts.trainingConfig != null ?\n              modelArtifacts.trainingConfig :\n              undefined\n        };\n        this.LS.setItem(this.keys.modelMetadata, JSON.stringify(metadata));\n\n        return {modelArtifactsInfo};\n      } catch (err) {\n        // If saving failed, clean up all items saved so far.\n        removeItems(this.keys);\n\n        throw new Error(\n            `Failed to save model '${this.modelPath}' to local storage: ` +\n            `size quota being exceeded is a possible cause of this failure: ` +\n            `modelTopologyBytes=${modelArtifactsInfo.modelTopologyBytes}, ` +\n            `weightSpecsBytes=${modelArtifactsInfo.weightSpecsBytes}, ` +\n            `weightDataBytes=${modelArtifactsInfo.weightDataBytes}.`);\n      }\n    }\n  }\n\n  /**\n   * Load a model from local storage.\n   *\n   * See the documentation to `browserLocalStorage` for details on the saved\n   * artifacts.\n   *\n   * @returns The loaded model (if loading succeeds).\n   */\n  async load(): Promise<ModelArtifacts> {\n    const info =\n        JSON.parse(this.LS.getItem(this.keys.info)) as ModelArtifactsInfo;\n    if (info == null) {\n      throw new Error(\n          `In local storage, there is no model with name '${this.modelPath}'`);\n    }\n\n    if (info.modelTopologyType !== 'JSON') {\n      throw new Error(\n          'BrowserLocalStorage does not support loading non-JSON model ' +\n          'topology yet.');\n    }\n\n    const out: ModelArtifacts = {};\n\n    // Load topology.\n    const topology = JSON.parse(this.LS.getItem(this.keys.topology));\n    if (topology == null) {\n      throw new Error(\n          `In local storage, the topology of model '${this.modelPath}' ` +\n          `is missing.`);\n    }\n    out.modelTopology = topology;\n\n    // Load weight specs.\n    const weightSpecs = JSON.parse(this.LS.getItem(this.keys.weightSpecs));\n    if (weightSpecs == null) {\n      throw new Error(\n          `In local storage, the weight specs of model '${this.modelPath}' ` +\n          `are missing.`);\n    }\n    out.weightSpecs = weightSpecs;\n\n    // Load meta-data fields.\n    const metadataString = this.LS.getItem(this.keys.modelMetadata);\n    if (metadataString != null) {\n      const metadata = JSON.parse(metadataString) as ModelMetadata;\n      out.format = metadata.format;\n      out.generatedBy = metadata.generatedBy;\n      out.convertedBy = metadata.convertedBy;\n      if (metadata.signature != null) {\n        out.signature = metadata.signature;\n      }\n      if (metadata.userDefinedMetadata != null) {\n        out.userDefinedMetadata = metadata.userDefinedMetadata;\n      }\n      if (metadata.modelInitializer != null) {\n        out.modelInitializer = metadata.modelInitializer;\n      }\n      if (metadata.initializerSignature != null) {\n        out.initializerSignature = metadata.initializerSignature;\n      }\n      if (metadata.trainingConfig != null) {\n        out.trainingConfig = metadata.trainingConfig;\n      }\n    }\n\n    // Load weight data.\n    const weightDataBase64 = this.LS.getItem(this.keys.weightData);\n    if (weightDataBase64 == null) {\n      throw new Error(\n          `In local storage, the binary weight values of model ` +\n          `'${this.modelPath}' are missing.`);\n    }\n    out.weightData = base64StringToArrayBuffer(weightDataBase64);\n\n    return out;\n  }\n}\n\nexport const localStorageRouter: IORouter = (url: string|string[]) => {\n  if (!env().getBool('IS_BROWSER')) {\n    return null;\n  } else {\n    if (!Array.isArray(url) && url.startsWith(BrowserLocalStorage.URL_SCHEME)) {\n      return browserLocalStorage(\n          url.slice(BrowserLocalStorage.URL_SCHEME.length));\n    } else {\n      return null;\n    }\n  }\n};\nIORouterRegistry.registerSaveRouter(localStorageRouter);\nIORouterRegistry.registerLoadRouter(localStorageRouter);\n\n/**\n * Factory function for local storage IOHandler.\n *\n * This `IOHandler` supports both `save` and `load`.\n *\n * For each model's saved artifacts, four items are saved to local storage.\n *   - `${PATH_SEPARATOR}/${modelPath}/info`: Contains meta-info about the\n *     model, such as date saved, type of the topology, size in bytes, etc.\n *   - `${PATH_SEPARATOR}/${modelPath}/topology`: Model topology. For Keras-\n *     style models, this is a stringized JSON.\n *   - `${PATH_SEPARATOR}/${modelPath}/weight_specs`: Weight specs of the\n *     model, can be used to decode the saved binary weight values (see\n *     item below).\n *   - `${PATH_SEPARATOR}/${modelPath}/weight_data`: Concatenated binary\n *     weight values, stored as a base64-encoded string.\n *\n * Saving may throw an `Error` if the total size of the artifacts exceed the\n * browser-specific quota.\n *\n * @param modelPath A unique identifier for the model to be saved. Must be a\n *   non-empty string.\n * @returns An instance of `IOHandler`, which can be used with, e.g.,\n *   `tf.Model.save`.\n */\nexport function browserLocalStorage(modelPath: string): IOHandler {\n  return new BrowserLocalStorage(modelPath);\n}\n\nexport class BrowserLocalStorageManager implements ModelStoreManager {\n  private readonly LS: Storage;\n\n  constructor() {\n    assert(\n        env().getBool('IS_BROWSER'),\n        () => 'Current environment is not a web browser');\n    assert(\n        typeof window === 'undefined' ||\n            typeof window.localStorage !== 'undefined',\n        () => 'Current browser does not appear to support localStorage');\n    this.LS = window.localStorage;\n  }\n\n  async listModels(): Promise<{[path: string]: ModelArtifactsInfo}> {\n    const out: {[path: string]: ModelArtifactsInfo} = {};\n    const prefix = PATH_PREFIX + PATH_SEPARATOR;\n    const suffix = PATH_SEPARATOR + INFO_SUFFIX;\n    for (let i = 0; i < this.LS.length; ++i) {\n      const key = this.LS.key(i);\n      if (key.startsWith(prefix) && key.endsWith(suffix)) {\n        const modelPath = getModelPathFromKey(key);\n        out[modelPath] = JSON.parse(this.LS.getItem(key)) as ModelArtifactsInfo;\n      }\n    }\n    return out;\n  }\n\n  async removeModel(path: string): Promise<ModelArtifactsInfo> {\n    path = maybeStripScheme(path);\n    const keys = getModelKeys(path);\n    if (this.LS.getItem(keys.info) == null) {\n      throw new Error(`Cannot find model at path '${path}'`);\n    }\n    const info = JSON.parse(this.LS.getItem(keys.info)) as ModelArtifactsInfo;\n    removeItems(keys);\n    return info;\n  }\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/**\n * Classes and functions for model management across multiple storage mediums.\n *\n * Supported client actions:\n * - Listing models on all registered storage mediums.\n * - Remove model by URL from any registered storage mediums, by using URL\n *   string.\n * - Moving or copying model from one path to another in the same medium or from\n *   one medium to another, by using URL strings.\n */\n\nimport {assert} from '../util';\n\nimport {IORouterRegistry} from './router_registry';\nimport {ModelArtifactsInfo, ModelStoreManager} from './types';\n\nconst URL_SCHEME_SUFFIX = '://';\n\nexport class ModelStoreManagerRegistry {\n  // Singleton instance.\n  private static instance: ModelStoreManagerRegistry;\n\n  private managers: {[scheme: string]: ModelStoreManager};\n\n  private constructor() {\n    this.managers = {};\n  }\n\n  private static getInstance(): ModelStoreManagerRegistry {\n    if (ModelStoreManagerRegistry.instance == null) {\n      ModelStoreManagerRegistry.instance = new ModelStoreManagerRegistry();\n    }\n    return ModelStoreManagerRegistry.instance;\n  }\n\n  /**\n   * Register a save-handler router.\n   *\n   * @param saveRouter A function that maps a URL-like string onto an instance\n   * of `IOHandler` with the `save` method defined or `null`.\n   */\n  static registerManager(scheme: string, manager: ModelStoreManager) {\n    assert(scheme != null, () => 'scheme must not be undefined or null.');\n    if (scheme.endsWith(URL_SCHEME_SUFFIX)) {\n      scheme = scheme.slice(0, scheme.indexOf(URL_SCHEME_SUFFIX));\n    }\n    assert(scheme.length > 0, () => 'scheme must not be an empty string.');\n    const registry = ModelStoreManagerRegistry.getInstance();\n    assert(\n        registry.managers[scheme] == null,\n        () => `A model store manager is already registered for scheme '${\n            scheme}'.`);\n    registry.managers[scheme] = manager;\n  }\n\n  static getManager(scheme: string): ModelStoreManager {\n    const manager = ModelStoreManagerRegistry.getInstance().managers[scheme];\n    if (manager == null) {\n      throw new Error(`Cannot find model manager for scheme '${scheme}'`);\n    }\n    return manager;\n  }\n\n  static getSchemes(): string[] {\n    return Object.keys(ModelStoreManagerRegistry.getInstance().managers);\n  }\n}\n\n/**\n * Helper method for parsing a URL string into a scheme and a path.\n *\n * @param url E.g., 'localstorage://my-model'\n * @returns A dictionary with two fields: scheme and path.\n *   Scheme: e.g., 'localstorage' in the example above.\n *   Path: e.g., 'my-model' in the example above.\n */\nfunction parseURL(url: string): {scheme: string, path: string} {\n  if (url.indexOf(URL_SCHEME_SUFFIX) === -1) {\n    throw new Error(\n        `The url string provided does not contain a scheme. ` +\n        `Supported schemes are: ` +\n        `${ModelStoreManagerRegistry.getSchemes().join(',')}`);\n  }\n  return {\n    scheme: url.split(URL_SCHEME_SUFFIX)[0],\n    path: url.split(URL_SCHEME_SUFFIX)[1],\n  };\n}\n\nasync function cloneModelInternal(\n    sourceURL: string, destURL: string,\n    deleteSource = false): Promise<ModelArtifactsInfo> {\n  assert(\n      sourceURL !== destURL,\n      () => `Old path and new path are the same: '${sourceURL}'`);\n\n  const loadHandlers = IORouterRegistry.getLoadHandlers(sourceURL);\n  assert(\n      loadHandlers.length > 0,\n      () => `Copying failed because no load handler is found for source URL ${\n          sourceURL}.`);\n  assert(\n      loadHandlers.length < 2,\n      () => `Copying failed because more than one (${loadHandlers.length}) ` +\n          `load handlers for source URL ${sourceURL}.`);\n  const loadHandler = loadHandlers[0];\n\n  const saveHandlers = IORouterRegistry.getSaveHandlers(destURL);\n  assert(\n      saveHandlers.length > 0,\n      () => `Copying failed because no save handler is found for destination ` +\n          `URL ${destURL}.`);\n  assert(\n      saveHandlers.length < 2,\n      () => `Copying failed because more than one (${loadHandlers.length}) ` +\n          `save handlers for destination URL ${destURL}.`);\n  const saveHandler = saveHandlers[0];\n\n  const sourceScheme = parseURL(sourceURL).scheme;\n  const sourcePath = parseURL(sourceURL).path;\n  const sameMedium = sourceScheme === parseURL(sourceURL).scheme;\n\n  const modelArtifacts = await loadHandler.load();\n\n  // If moving within the same storage medium, remove the old model as soon as\n  // the loading is done. Without doing this, it is possible that the combined\n  // size of the two models will cause the cloning to fail.\n  if (deleteSource && sameMedium) {\n    await ModelStoreManagerRegistry.getManager(sourceScheme)\n        .removeModel(sourcePath);\n  }\n\n  const saveResult = await saveHandler.save(modelArtifacts);\n\n  // If moving between mediums, the deletion is done after the save succeeds.\n  // This guards against the case in which saving to the destination medium\n  // fails.\n  if (deleteSource && !sameMedium) {\n    await ModelStoreManagerRegistry.getManager(sourceScheme)\n        .removeModel(sourcePath);\n  }\n\n  return saveResult.modelArtifactsInfo;\n}\n\n/**\n * List all models stored in registered storage mediums.\n *\n * For a web browser environment, the registered mediums are Local Storage and\n * IndexedDB.\n *\n * ```js\n * // First create and save a model.\n * const model = tf.sequential();\n * model.add(tf.layers.dense(\n *     {units: 1, inputShape: [10], activation: 'sigmoid'}));\n * await model.save('localstorage://demo/management/model1');\n *\n * // Then list existing models.\n * console.log(JSON.stringify(await tf.io.listModels()));\n *\n * // Delete the model.\n * await tf.io.removeModel('localstorage://demo/management/model1');\n *\n * // List models again.\n * console.log(JSON.stringify(await tf.io.listModels()));\n * ```\n *\n * @returns A `Promise` of a dictionary mapping URLs of existing models to\n * their model artifacts info. URLs include medium-specific schemes, e.g.,\n *   'indexeddb://my/model/1'. Model artifacts info include type of the\n * model's topology, byte sizes of the topology, weights, etc.\n *\n * @doc {\n *   heading: 'Models',\n *   subheading: 'Management',\n *   namespace: 'io',\n *   ignoreCI: true\n * }\n */\nasync function listModels(): Promise<{[url: string]: ModelArtifactsInfo}> {\n  const schemes = ModelStoreManagerRegistry.getSchemes();\n  const out: {[url: string]: ModelArtifactsInfo} = {};\n  for (const scheme of schemes) {\n    const schemeOut =\n        await ModelStoreManagerRegistry.getManager(scheme).listModels();\n    for (const path in schemeOut) {\n      const url = scheme + URL_SCHEME_SUFFIX + path;\n      out[url] = schemeOut[path];\n    }\n  }\n  return out;\n}\n\n/**\n * Remove a model specified by URL from a registered storage medium.\n *\n * ```js\n * // First create and save a model.\n * const model = tf.sequential();\n * model.add(tf.layers.dense(\n *     {units: 1, inputShape: [10], activation: 'sigmoid'}));\n * await model.save('localstorage://demo/management/model1');\n *\n * // Then list existing models.\n * console.log(JSON.stringify(await tf.io.listModels()));\n *\n * // Delete the model.\n * await tf.io.removeModel('localstorage://demo/management/model1');\n *\n * // List models again.\n * console.log(JSON.stringify(await tf.io.listModels()));\n * ```\n *\n * @param url A URL to a stored model, with a scheme prefix, e.g.,\n *   'localstorage://my-model-1', 'indexeddb://my/model/2'.\n * @returns ModelArtifactsInfo of the deleted model (if and only if deletion\n *   is successful).\n * @throws Error if deletion fails, e.g., if no model exists at `path`.\n *\n * @doc {\n *   heading: 'Models',\n *   subheading: 'Management',\n *   namespace: 'io',\n *   ignoreCI: true\n * }\n */\nasync function removeModel(url: string): Promise<ModelArtifactsInfo> {\n  const schemeAndPath = parseURL(url);\n  const manager = ModelStoreManagerRegistry.getManager(schemeAndPath.scheme);\n  return manager.removeModel(schemeAndPath.path);\n}\n\n/**\n * Copy a model from one URL to another.\n *\n * This function supports:\n *\n * 1. Copying within a storage medium, e.g.,\n *    `tf.io.copyModel('localstorage://model-1', 'localstorage://model-2')`\n * 2. Copying between two storage mediums, e.g.,\n *    `tf.io.copyModel('localstorage://model-1', 'indexeddb://model-1')`\n *\n * ```js\n * // First create and save a model.\n * const model = tf.sequential();\n * model.add(tf.layers.dense(\n *     {units: 1, inputShape: [10], activation: 'sigmoid'}));\n * await model.save('localstorage://demo/management/model1');\n *\n * // Then list existing models.\n * console.log(JSON.stringify(await tf.io.listModels()));\n *\n * // Copy the model, from Local Storage to IndexedDB.\n * await tf.io.copyModel(\n *     'localstorage://demo/management/model1',\n *     'indexeddb://demo/management/model1');\n *\n * // List models again.\n * console.log(JSON.stringify(await tf.io.listModels()));\n *\n * // Remove both models.\n * await tf.io.removeModel('localstorage://demo/management/model1');\n * await tf.io.removeModel('indexeddb://demo/management/model1');\n * ```\n *\n * @param sourceURL Source URL of copying.\n * @param destURL Destination URL of copying.\n * @returns ModelArtifactsInfo of the copied model (if and only if copying\n *   is successful).\n * @throws Error if copying fails, e.g., if no model exists at `sourceURL`, or\n *   if `oldPath` and `newPath` are identical.\n *\n * @doc {\n *   heading: 'Models',\n *   subheading: 'Management',\n *   namespace: 'io',\n *   ignoreCI: true\n * }\n */\nasync function copyModel(\n    sourceURL: string, destURL: string): Promise<ModelArtifactsInfo> {\n  const deleteSource = false;\n  return cloneModelInternal(sourceURL, destURL, deleteSource);\n}\n\n/**\n * Move a model from one URL to another.\n *\n * This function supports:\n *\n * 1. Moving within a storage medium, e.g.,\n *    `tf.io.moveModel('localstorage://model-1', 'localstorage://model-2')`\n * 2. Moving between two storage mediums, e.g.,\n *    `tf.io.moveModel('localstorage://model-1', 'indexeddb://model-1')`\n *\n * ```js\n * // First create and save a model.\n * const model = tf.sequential();\n * model.add(tf.layers.dense(\n *     {units: 1, inputShape: [10], activation: 'sigmoid'}));\n * await model.save('localstorage://demo/management/model1');\n *\n * // Then list existing models.\n * console.log(JSON.stringify(await tf.io.listModels()));\n *\n * // Move the model, from Local Storage to IndexedDB.\n * await tf.io.moveModel(\n *     'localstorage://demo/management/model1',\n *     'indexeddb://demo/management/model1');\n *\n * // List models again.\n * console.log(JSON.stringify(await tf.io.listModels()));\n *\n * // Remove the moved model.\n * await tf.io.removeModel('indexeddb://demo/management/model1');\n * ```\n *\n * @param sourceURL Source URL of moving.\n * @param destURL Destination URL of moving.\n * @returns ModelArtifactsInfo of the copied model (if and only if copying\n *   is successful).\n * @throws Error if moving fails, e.g., if no model exists at `sourceURL`, or\n *   if `oldPath` and `newPath` are identical.\n *\n * @doc {\n *   heading: 'Models',\n *   subheading: 'Management',\n *   namespace: 'io',\n *   ignoreCI: true\n * }\n */\nasync function moveModel(\n    sourceURL: string, destURL: string): Promise<ModelArtifactsInfo> {\n  const deleteSource = true;\n  return cloneModelInternal(sourceURL, destURL, deleteSource);\n}\n\nexport {moveModel, copyModel, removeModel, listModels};\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport '../flags';\n\nimport {env} from '../environment';\nimport {BrowserIndexedDB, BrowserIndexedDBManager} from '../io/indexed_db';\nimport {BrowserLocalStorage, BrowserLocalStorageManager} from '../io/local_storage';\nimport {ModelStoreManagerRegistry} from '../io/model_management';\n\nimport {Platform} from './platform';\nimport {isTypedArrayBrowser} from './is_typed_array_browser';\n\nexport class PlatformBrowser implements Platform {\n  // According to the spec, the built-in encoder can do only UTF-8 encoding.\n  // https://developer.mozilla.org/en-US/docs/Web/API/TextEncoder/TextEncoder\n  private textEncoder: TextEncoder;\n\n  // For setTimeoutCustom\n  private readonly messageName = 'setTimeoutCustom';\n  private functionRefs: Function[] = [];\n  private handledMessageCount = 0;\n  private hasEventListener = false;\n\n  fetch(path: string, init?: RequestInit): Promise<Response> {\n    return fetch(path, init);\n  }\n\n  now(): number {\n    return performance.now();\n  }\n\n  encode(text: string, encoding: string): Uint8Array {\n    if (encoding !== 'utf-8' && encoding !== 'utf8') {\n      throw new Error(\n          `Browser's encoder only supports utf-8, but got ${encoding}`);\n    }\n    if (this.textEncoder == null) {\n      this.textEncoder = new TextEncoder();\n    }\n    return this.textEncoder.encode(text);\n  }\n  decode(bytes: Uint8Array, encoding: string): string {\n    return new TextDecoder(encoding).decode(bytes);\n  }\n\n  // If the setTimeout nesting level is greater than 5 and timeout is less\n  // than 4ms, timeout will be clamped to 4ms, which hurts the perf.\n  // Interleaving window.postMessage and setTimeout will trick the browser and\n  // avoid the clamp.\n  setTimeoutCustom(functionRef: Function, delay: number): void {\n    if (typeof window === 'undefined' ||\n        !env().getBool('USE_SETTIMEOUTCUSTOM')) {\n      setTimeout(functionRef, delay);\n      return;\n    }\n\n    this.functionRefs.push(functionRef);\n    setTimeout(() => {\n      window.postMessage(\n          {name: this.messageName, index: this.functionRefs.length - 1}, '*');\n    }, delay);\n\n    if (!this.hasEventListener) {\n      this.hasEventListener = true;\n      window.addEventListener('message', (event: MessageEvent) => {\n        if (event.source === window && event.data.name === this.messageName) {\n          event.stopPropagation();\n          const functionRef = this.functionRefs[event.data.index];\n          functionRef();\n          this.handledMessageCount++;\n          if (this.handledMessageCount === this.functionRefs.length) {\n            this.functionRefs = [];\n            this.handledMessageCount = 0;\n          }\n        }\n      }, true);\n    }\n  }\n\n  isTypedArray(a: unknown): a is Uint8Array | Float32Array | Int32Array\n    | Uint8ClampedArray {\n    return isTypedArrayBrowser(a);\n  }\n}\n\nif (env().get('IS_BROWSER')) {\n  env().setPlatform('browser', new PlatformBrowser());\n\n  // Register LocalStorage IOHandler\n  try {\n    ModelStoreManagerRegistry.registerManager(\n        BrowserLocalStorage.URL_SCHEME, new BrowserLocalStorageManager());\n  } catch (err) {\n  }\n\n  // Register IndexedDB IOHandler\n  try {\n    ModelStoreManagerRegistry.registerManager(\n        BrowserIndexedDB.URL_SCHEME, new BrowserIndexedDBManager());\n  } catch (err) {\n  }\n}\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {env} from '../environment';\nimport {Platform} from './platform';\n\n// We are wrapping this within an object so it can be stubbed by Jasmine.\nexport const getNodeFetch = {\n  // tslint:disable-next-line:no-require-imports\n  importFetch: () => require('node-fetch')\n};\n\ntype FetchFn = (url: string, init?: RequestInit) => Promise<Response>;\nlet systemFetch: FetchFn;\n// These getters and setters are for testing so we don't export a mutable\n// variable.\nexport function resetSystemFetch() {\n  systemFetch = null;\n}\nexport function setSystemFetch(fetchFn: FetchFn) {\n  systemFetch = fetchFn;\n}\nexport function getSystemFetch(): FetchFn {\n  return systemFetch;\n}\n\nexport class PlatformNode implements Platform {\n  private textEncoder: TextEncoder;\n  // tslint:disable-next-line:no-any\n  util: any;\n\n  constructor() {\n    // tslint:disable-next-line:no-require-imports\n    this.util = require('util');\n    // According to the spec, the built-in encoder can do only UTF-8 encoding.\n    // https://developer.mozilla.org/en-US/docs/Web/API/TextEncoder/TextEncoder\n    this.textEncoder = new this.util.TextEncoder();\n  }\n\n  fetch(path: string, requestInits?: RequestInit): Promise<Response> {\n    if (env().global.fetch != null) {\n      return env().global.fetch(path, requestInits);\n    }\n\n    if (systemFetch == null) {\n      systemFetch = getNodeFetch.importFetch();\n    }\n    return systemFetch(path, requestInits);\n  }\n\n  now(): number {\n    const time = process.hrtime();\n    return time[0] * 1000 + time[1] / 1000000;\n  }\n\n  encode(text: string, encoding: string): Uint8Array {\n    if (encoding !== 'utf-8' && encoding !== 'utf8') {\n      throw new Error(\n          `Node built-in encoder only supports utf-8, but got ${encoding}`);\n    }\n    return this.textEncoder.encode(text);\n  }\n  decode(bytes: Uint8Array, encoding: string): string {\n    if (bytes.length === 0) {\n      return '';\n    }\n    return new this.util.TextDecoder(encoding).decode(bytes);\n  }\n  isTypedArray(a: unknown): a is Float32Array | Int32Array | Uint8Array\n    | Uint8ClampedArray {\n    return this.util.types.isFloat32Array(a)\n      || this.util.types.isInt32Array(a)\n      || this.util.types.isUint8Array(a)\n      || this.util.types.isUint8ClampedArray(a);\n  }\n}\n\nif (env().get('IS_NODE') && !env().get('IS_BROWSER')) {\n  env().setPlatform('node', new PlatformNode());\n}\n", "/**\n * @license\n * Copyright 2020 Google Inc. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {TensorBuffer} from '../tensor';\nimport {DataType, DataTypeMap, Rank, ShapeMap} from '../types';\nimport * as util from '../util';\n\n/**\n * Creates an empty `tf.TensorBuffer` with the specified `shape` and `dtype`.\n *\n * The values are stored in CPU as `TypedArray`. Fill the buffer using\n * `buffer.set()`, or by modifying directly `buffer.values`.\n *\n * When done, call `buffer.toTensor()` to get an immutable `tf.Tensor` with\n * those values.\n *\n * ```js\n * // Create a buffer and set values at particular indices.\n * const buffer = tf.buffer([2, 2]);\n * buffer.set(3, 0, 0);\n * buffer.set(5, 1, 0);\n *\n * // Convert the buffer back to a tensor.\n * buffer.toTensor().print();\n * ```\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param dtype The dtype of the buffer. Defaults to 'float32'.\n * @param values The values of the buffer as `TypedArray`. Defaults to\n * zeros.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function buffer<R extends Rank, D extends DataType = 'float32'>(\n    shape: ShapeMap[R], dtype: D = 'float32' as D,\n    values?: DataTypeMap[D]): TensorBuffer<R, D> {\n  dtype = dtype || 'float32' as D;\n  util.assertNonNegativeIntegerDimensions(shape);\n  return new TensorBuffer<R, D>(shape, dtype, values);\n}\n", "/**\n * @license\n * Copyright 2020 Google Inc. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Cast, CastAttrs, CastInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {DataType, TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Casts a `tf.Tensor` to a new dtype.\n *\n * ```js\n * const x = tf.tensor1d([1.5, 2.5, 3]);\n * tf.cast(x, 'int32').print();\n * ```\n * @param x The input tensor to be casted.\n * @param dtype The dtype to cast the input tensor to.\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction cast_<T extends Tensor>(x: T|TensorLike, dtype: DataType): T {\n  const $x = convertToTensor(x, 'x', 'cast');\n\n  // Sanity checks.\n  if (!util.isValidDtype(dtype)) {\n    throw new Error(`Failed to cast to unknown dtype ${dtype}`);\n  }\n  if (dtype === 'string' && $x.dtype !== 'string' ||\n      dtype !== 'string' && $x.dtype === 'string') {\n    throw new Error('Only strings can be casted to strings');\n  }\n\n  const inputs: CastInputs = {x: $x};\n  const attrs: CastAttrs = {dtype};\n\n  return ENGINE.runKernel(\n      Cast, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const cast = /* @__PURE__ */ op({cast_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Identity, IdentityInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Creates a new tensor with the same values and shape as the specified\n * tensor.\n *\n * ```js\n * const x = tf.tensor([1, 2]);\n *\n * x.clone().print();\n * ```\n *\n * @param x The tensor to clone.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction clone_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'clone', 'string_or_numeric');\n  const inputs: IdentityInputs = {x: $x};\n\n  // Note this op is called tf.identity in python. Hence the kernel name used\n  // here.\n  return ENGINE.runKernel(Identity, inputs as unknown as NamedTensorMap);\n}\n\nexport const clone = /* @__PURE__ */ op({clone_});\n", "/**\n * @license\n * Copyright 2020 Google Inc. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\n\n/**\n * Prints information about the `tf.Tensor` including its data.\n *\n * ```js\n * const verbose = true;\n * tf.tensor2d([1, 2, 3, 4], [2, 2]).print(verbose);\n * ```\n * @param x The tensor to be printed.\n * @param verbose Whether to print verbose information about the ` Tensor`,\n * including dtype and size.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function print<T extends Tensor>(x: T, verbose = false): void {\n  console.log(x.toString(verbose));\n}\n", "/**\n * @license\n * Copyright 2020 Google Inc. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n// Required side effectful code for tfjs-core\n\n// Set up Engine and ENV\nimport {getOrMakeEngine} from './engine';\ngetOrMakeEngine();\n\n// Register backend-agnostic flags.\nimport './flags';\n// Register platforms\nimport './platforms/platform_browser';\nimport './platforms/platform_node';\n\n// Set up OpHandler\nimport {buffer} from './ops/buffer';\nimport {cast} from './ops/cast';\nimport {clone} from './ops/clone';\nimport {print} from './ops/print';\nimport {OpHandler, setOpHandler} from './tensor';\nconst opHandler: OpHandler = {\n  buffer,\n  cast,\n  clone,\n  print\n};\nsetOpHandler(opHandler);\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Add, AddInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Adds two `tf.Tensor`s element-wise, A + B. Supports broadcasting.\n *\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3, 4]);\n * const b = tf.tensor1d([10, 20, 30, 40]);\n *\n * a.add(b).print();  // or tf.add(a, b)\n * ```\n *\n * ```js\n * // Broadcast add a with b.\n * const a = tf.scalar(5);\n * const b = tf.tensor1d([10, 20, 30, 40]);\n *\n * a.add(b).print();  // or tf.add(a, b)\n * ```\n * @param a The first `tf.Tensor` to add.\n * @param b The second `tf.Tensor` to add. Must have the same type as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction add_<T extends Tensor>(a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'add');\n  let $b = convertToTensor(b, 'b', 'add');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  const inputs: AddInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(Add, inputs as unknown as NamedTensorMap);\n}\n\nexport const add = /* @__PURE__ */ op({add_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {FloorDiv, FloorDivInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Divides two `tf.Tensor`s element-wise, A / B. Supports broadcasting.\n * The result is rounded with floor function.\n *\n *\n * ```js\n * const a = tf.tensor1d([1, 4, 9, 16]);\n * const b = tf.tensor1d([1, 2, 3, 4]);\n *\n * a.floorDiv(b).print();  // or tf.div(a, b)\n * ```\n *\n * ```js\n * // Broadcast div a with b.\n * const a = tf.tensor1d([2, 4, 6, 8]);\n * const b = tf.scalar(2);\n *\n * a.floorDiv(b).print();  // or tf.floorDiv(a, b)\n * ```\n *\n * @param a The first tensor as the numerator.\n * @param b The second tensor as the denominator. Must have the same dtype as\n * `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction floorDiv_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'floorDiv');\n  let $b = convertToTensor(b, 'b', 'floorDiv');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  const inputs: FloorDivInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(FloorDiv, inputs as unknown as NamedTensorMap);\n}\n\nexport const floorDiv = /* @__PURE__ */ op({floorDiv_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {RealDiv, RealDivInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {floorDiv} from './floorDiv';\nimport {op} from './operation';\n\n/**\n * Divides two `tf.Tensor`s element-wise, A / B. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([1, 4, 9, 16]);\n * const b = tf.tensor1d([1, 2, 3, 4]);\n *\n * a.div(b).print();  // or tf.div(a, b)\n * ```\n *\n * ```js\n * // Broadcast div a with b.\n * const a = tf.tensor1d([2, 4, 6, 8]);\n * const b = tf.scalar(2);\n *\n * a.div(b).print();  // or tf.div(a, b)\n * ```\n *\n * @param a The first tensor as the numerator.\n * @param b The second tensor as the denominator. Must have the same dtype as\n * `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction div_<T extends Tensor>(a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'div');\n  let $b = convertToTensor(b, 'b', 'div');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  if ($a.dtype === 'int32' && $b.dtype === 'int32') {\n    return floorDiv($a, $b);\n  }\n\n  const inputs: RealDivInputs = {a: $a, b: $b};\n  const attrs = {};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  return ENGINE.runKernel(RealDiv,\n                          inputs as unknown as NamedTensorMap, attrs) as T;\n}\n\nexport const div = /* @__PURE__ */ op({div_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Multiply, MultiplyInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Multiplies two `tf.Tensor`s element-wise, A * B. Supports broadcasting.\n *\n * We also expose `tf.mulStrict` which has the same signature as this op and\n * asserts that `a` and `b` are the same shape (does not broadcast).\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3, 4]);\n * const b = tf.tensor1d([2, 3, 4, 5]);\n *\n * a.mul(b).print();  // or tf.mul(a, b)\n * ```\n *\n * ```js\n * // Broadcast mul a with b.\n * const a = tf.tensor1d([1, 2, 3, 4]);\n * const b = tf.scalar(5);\n *\n * a.mul(b).print();  // or tf.mul(a, b)\n * ```\n * @param a The first tensor to multiply.\n * @param b The second tensor to multiply. Must have the same dtype as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction mul_<T extends Tensor>(a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'mul');\n  let $b = convertToTensor(b, 'b', 'mul');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  const inputs: MultiplyInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(Multiply, inputs as unknown as NamedTensorMap);\n}\nexport const mul = /* @__PURE__ */ op({mul_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Abs, AbsInputs, ComplexAbs, ComplexAbsInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes absolute value element-wise: `abs(x)`\n *\n * ```js\n * const x = tf.tensor1d([-1, 2, -3, 4]);\n *\n * x.abs().print();  // or tf.abs(x)\n * ```\n * @param x The input `tf.Tensor`.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction abs_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'abs');\n\n  if ($x.dtype === 'complex64') {\n    const inputs: ComplexAbsInputs = {x: $x};\n    return ENGINE.runKernel(ComplexAbs, inputs as unknown as NamedTensorMap);\n  } else {\n    const inputs: AbsInputs = {x: $x};\n    return ENGINE.runKernel(Abs, inputs as unknown as NamedTensorMap);\n  }\n}\n\nexport const abs = /* @__PURE__ */ op({abs_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Acos, AcosInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes acos of the input `tf.Tensor` element-wise: `acos(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, 1, -1, .7]);\n *\n * x.acos().print();  // or tf.acos(x)\n * ```\n * @param x The input tensor.\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction acos_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'acos');\n  const inputs: AcosInputs = {x: $x};\n\n  return ENGINE.runKernel(Acos, inputs as unknown as NamedTensorMap);\n}\nexport const acos = /* @__PURE__ */ op({acos_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Acosh, AcoshInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the inverse hyperbolic cos of the input `tf.Tensor` element-wise:\n * `acosh(x)`\n *\n * ```js\n * const x = tf.tensor1d([10, 1, 3, 5.7]);\n *\n * x.acosh().print();  // or tf.acosh(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction acosh_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'acosh');\n  const inputs: AcoshInputs = {x: $x};\n\n  return ENGINE.runKernel(Acosh, inputs as unknown as NamedTensorMap);\n}\nexport const acosh = /* @__PURE__ */ op({acosh_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {AddN, AddNInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Adds a list of `tf.Tensor`s element-wise, each with the same shape and dtype.\n *\n * ```js\n * const a = tf.tensor1d([1, 2]);\n * const b = tf.tensor1d([3, 4]);\n * const c = tf.tensor1d([5, 6]);\n *\n * tf.addN([a, b, c]).print();\n * ```\n * @param tensors A list of tensors with the same shape and dtype.\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction addN_<T extends Tensor>(tensors: Array<T|TensorLike>): T {\n  util.assert(\n      Array.isArray(tensors),\n      () => 'The argument passed to tf.addN() must be a list of tensors');\n  util.assert(\n      tensors.length >= 1,\n      () => `Must pass at least one tensor to tf.addN(), but got ` +\n          `${tensors.length}`);\n\n  const $tensors =\n      tensors.map((t, i) => convertToTensor(t, `tensors${i}`, 'addN'));\n\n  const firstTensor = $tensors[0];\n  $tensors.forEach(t => {\n    if (t.dtype !== firstTensor.dtype) {\n      throw new Error(\n          'All tensors passed to tf.addN() must have the same dtype');\n    }\n  });\n\n  $tensors.forEach(t => {\n    if (!util.arraysEqual(t.shape, firstTensor.shape)) {\n      throw new Error(\n          'All tensors passed to tf.addN() must have the same shape');\n    }\n  });\n\n  const inputs: AddNInputs = $tensors;\n\n  return ENGINE.runKernel(AddN, inputs as unknown as NamedTensorMap);\n}\n\nexport const addN = /* @__PURE__ */ op({addN_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {All, AllAttrs, AllInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the logical and of elements across dimensions of a `tf.Tensor`.\n *\n * Reduces the input along the dimensions given in `axes`. Unless `keepDims`\n * is true, the rank of the `tf.Tensor` is reduced by 1 for each entry in\n * `axes`. If `keepDims` is true, the reduced dimensions are retained with\n * length 1. If `axes` has no entries, all dimensions are reduced, and a\n * `tf.Tensor` with a single element is returned.\n *\n * ```js\n * const x = tf.tensor1d([1, 1, 1], 'bool');\n *\n * x.all().print();  // or tf.all(x)\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 1, 0, 0], [2, 2], 'bool');\n *\n * const axis = 1;\n * x.all(axis).print();  // or tf.all(x, axis)\n * ```\n *\n * @param x The input tensor. Must be of dtype bool.\n * @param axis The dimension(s) to reduce. By default it reduces\n *     all dimensions.\n * @param keepDims If true, retains reduced dimensions with size 1.\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction all_<T extends Tensor>(\n    x: Tensor|TensorLike, axis: number|number[] = null, keepDims = false): T {\n  const $x = convertToTensor(x, 'x', 'all', 'bool');\n\n  const inputs: AllInputs = {x: $x};\n  const attrs: AllAttrs = {axis, keepDims};\n\n  return ENGINE.runKernel(\n      All, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const all = /* @__PURE__ */ op({all_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Any, AnyAttrs, AnyInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the logical or of elements across dimensions of a `tf.Tensor`.\n *\n * Reduces the input along the dimensions given in `axes`. Unless `keepDims`\n * is true, the rank of the `tf.Tensor` is reduced by 1 for each entry in\n * `axes`. If `keepDims` is true, the reduced dimensions are retained with\n * length 1. If `axes` has no entries, all dimensions are reduced, and a\n * `tf.Tensor` with a single element is returned.\n *\n * ```js\n * const x = tf.tensor1d([1, 1, 1], 'bool');\n *\n * x.any().print();  // or tf.any(x)\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 1, 0, 0], [2, 2], 'bool');\n *\n * const axis = 1;\n * x.any(axis).print();  // or tf.any(x, axis)\n * ```\n *\n * @param x The input tensor. Must be of dtype bool.\n * @param axis The dimension(s) to reduce. By default it reduces\n *     all dimensions.\n * @param keepDims If true, retains reduced dimensions with size 1.\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction any_<T extends Tensor>(\n    x: Tensor|TensorLike, axis: number|number[] = null, keepDims = false): T {\n  const $x = convertToTensor(x, 'x', 'any', 'bool');\n\n  const inputs: AnyInputs = {x: $x};\n  const attrs: AnyAttrs = {axis, keepDims};\n\n  return ENGINE.runKernel(\n      Any, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\n// tslint:disable-next-line:variable-name\nexport const any = /* @__PURE__ */ op({any_});\n", "/**\n * @license\n * Copyright 2020 Google Inc. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {ArgMax, ArgMaxAttrs, ArgMaxInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Returns the indices of the maximum values along an `axis`.\n *\n * The result has the same shape as `input` with the dimension along `axis`\n * removed.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3]);\n *\n * x.argMax().print();  // or tf.argMax(x)\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 4, 3], [2, 2]);\n *\n * const axis = 1;\n * x.argMax(axis).print();  // or tf.argMax(x, axis)\n * ```\n *\n * @param x The input tensor.\n * @param axis The dimension to reduce. Defaults to 0 (outer-most dimension).\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction argMax_<T extends Tensor>(x: Tensor|TensorLike, axis = 0): T {\n  const $x = convertToTensor(x, 'x', 'argMax');\n\n  const inputs: ArgMaxInputs = {x: $x};\n  const attrs: ArgMaxAttrs = {axis};\n\n  return ENGINE.runKernel(\n      ArgMax, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const argMax = /* @__PURE__ */ op({argMax_});\n", "/**\n * @license\n * Copyright 2020 Google Inc. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {ArgMin, ArgMinAttrs, ArgMinInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Returns the indices of the minimum values along an `axis`.\n *\n * The result has the same shape as `input` with the dimension along `axis`\n * removed.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3]);\n *\n * x.argMin().print();  // or tf.argMin(x)\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 4, 3], [2, 2]);\n *\n * const axis = 1;\n * x.argMin(axis).print();  // or tf.argMin(x, axis)\n * ```\n *\n * @param x The input tensor.\n * @param axis The dimension to reduce. Defaults to 0 (outer-most dimension).\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction argMin_<T extends Tensor>(x: Tensor|TensorLike, axis = 0): T {\n  const $x = convertToTensor(x, 'x', 'argMin');\n\n  const inputs: ArgMinInputs = {x: $x};\n  const attrs: ArgMinAttrs = {axis};\n\n  return ENGINE.runKernel(\n      ArgMin, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const argMin = /* @__PURE__ */ op({argMin_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Asin, AsinInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes asin of the input `tf.Tensor` element-wise: `asin(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, 1, -1, .7]);\n *\n * x.asin().print();  // or tf.asin(x)\n * ```\n * @param x The input tensor.\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction asin_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'asin');\n  const inputs: AsinInputs = {x: $x};\n\n  return ENGINE.runKernel(Asin, inputs as unknown as NamedTensorMap);\n}\nexport const asin = /* @__PURE__ */ op({asin_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Asinh, AsinhInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes inverse hyperbolic sin of the input `tf.Tensor` element-wise:\n * `asinh(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, 1, -1, .7]);\n *\n * x.asinh().print();  // or tf.asinh(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction asinh_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'asinh');\n\n  const inputs: AsinhInputs = {x: $x};\n\n  return ENGINE.runKernel(Asinh, inputs as unknown as NamedTensorMap);\n}\nexport const asinh = /* @__PURE__ */ op({asinh_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Atan, AtanInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes atan of the input `tf.Tensor` element-wise: `atan(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, 1, -1, .7]);\n *\n * x.atan().print();  // or tf.atan(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction atan_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'atan');\n\n  const inputs: AtanInputs = {x: $x};\n\n  return ENGINE.runKernel(Atan, inputs as unknown as NamedTensorMap);\n}\nexport const atan = /* @__PURE__ */ op({atan_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Atan2, Atan2Inputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes arctangent of `tf.Tensor`s a / b element-wise: `atan2(a, b)`.\n * Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([1.0, 1.0, -1.0, .7]);\n * const b = tf.tensor1d([2.0, 13.0, 3.5, .21]);\n *\n * tf.atan2(a, b).print()\n * ```\n *\n * @param a The first tensor.\n * @param b The second tensor. Must have the same dtype as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction atan2_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'atan2');\n  let $b = convertToTensor(b, 'b', 'atan2');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  const inputs: Atan2Inputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(Atan2, inputs as unknown as NamedTensorMap);\n}\n\nexport const atan2 = /* @__PURE__ */ op({atan2_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Atanh, AtanhInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes inverse hyperbolic tan of the input `tf.Tensor` element-wise:\n * `atanh(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, .1, -.1, .7]);\n *\n * x.atanh().print();  // or tf.atanh(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction atanh_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'atanh');\n\n  const inputs: AtanhInputs = {x: $x};\n\n  return ENGINE.runKernel(Atanh, inputs as unknown as NamedTensorMap);\n}\nexport const atanh = /* @__PURE__ */ op({atanh_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport * as util from '../util';\n\ntype PadType = 'SAME'|'VALID'|'NUMBER'|'EXPLICIT';\n\n// For NHWC should be in the following form:\n//  [[0, 0], [pad_top,pad_bottom], [pad_left, pad_right], [0, 0]]\n// For NCHW should be in the following form:\n//  [[0, 0], [0, 0], [pad_top,pad_bottom], [pad_left, pad_right]]\n// Reference: https://www.tensorflow.org/api_docs/python/tf/nn/conv2d\nexport type ExplicitPadding =\n    [[number, number], [number, number], [number, number], [number, number]];\n\nexport type PadInfo = {\n  top: number,\n  left: number,\n  right: number,\n  bottom: number,\n  type: PadType\n};\n\nexport type PadInfo3D = {\n  top: number,\n  left: number,\n  right: number,\n  bottom: number,\n  front: number,\n  back: number,\n  type: PadType\n};\n\n/**\n * Information about the forward pass of a convolution/pooling operation.\n * It includes input and output shape, strides, filter size and padding\n * information.\n */\nexport type Conv2DInfo = {\n  batchSize: number,\n  inHeight: number,\n  inWidth: number,\n  inChannels: number,\n  outHeight: number,\n  outWidth: number,\n  outChannels: number,\n  dataFormat: 'channelsFirst'|'channelsLast',\n  strideHeight: number,\n  strideWidth: number,\n  dilationHeight: number,\n  dilationWidth: number,\n  filterHeight: number,\n  filterWidth: number,\n  effectiveFilterHeight: number,\n  effectiveFilterWidth: number,\n  padInfo: PadInfo,\n  inShape: [number, number, number, number],\n  outShape: [number, number, number, number],\n  filterShape: [number, number, number, number]\n};\n\n/**\n *\n * @param inputShape Input tensor shape is of the following dimensions:\n *     `[batch, height, width, inChannels]`.\n * @param filterShape The filter shape is of the following dimensions:\n *     `[filterHeight, filterWidth, depth]`.\n * @param strides The strides of the sliding window for each dimension of the\n *     input tensor: `[strideHeight, strideWidth]`.\n *     If `strides` is a single number,\n *     then `strideHeight == strideWidth`.\n * @param pad The type of padding algorithm.\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1*1x1.\n *    - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dataFormat The data format of the input and output data.\n *     Defaults to 'NHWC'.\n * @param dilations The dilation rates: `[dilationHeight, dilationWidth]`.\n *     Defaults to `[1, 1]`. If `dilations` is a single number, then\n *     `dilationHeight == dilationWidth`.\n */\nexport function computeDilation2DInfo(\n    inputShape: [number, number, number, number],\n    filterShape: [number, number, number], strides: number|[number, number],\n    pad: 'same'|'valid'|number, dataFormat: 'NHWC' = 'NHWC',\n    dilations: number|[number, number]) {\n  // `computerConv2DInfo` require filterShape to be in the dimension of:\n  // `[filterHeight, filterWidth, depth, outDepth]`, dilation2d doesn't have\n  // outDepth, it should have the same depth as the input.\n  // Input shape: [batch, height, width, inChannels]\n  const inputChannels = inputShape[3];\n  const $filterShape =\n      [...filterShape, inputChannels] as [number, number, number, number];\n  const $dataFormat = convertConv2DDataFormat(dataFormat);\n\n  return computeConv2DInfo(\n      inputShape, $filterShape, strides, dilations, pad,\n      null /* roundingMode */, null /* depthWise */, $dataFormat);\n}\n\nexport function computePool2DInfo(\n    inShape: [number, number, number, number],\n    filterSize: [number, number]|number, strides: number|[number, number],\n    dilations: number|[number, number],\n    pad: 'same'|'valid'|number|ExplicitPadding,\n    roundingMode?: 'floor'|'round'|'ceil',\n    dataFormat: 'channelsFirst'|'channelsLast' = 'channelsLast'): Conv2DInfo {\n  const [filterHeight, filterWidth] = parseTupleParam(filterSize);\n\n  let filterShape: [number, number, number, number];\n  if (dataFormat === 'channelsLast') {\n    filterShape = [filterHeight, filterWidth, inShape[3], inShape[3]];\n  } else if (dataFormat === 'channelsFirst') {\n    filterShape = [filterHeight, filterWidth, inShape[1], inShape[1]];\n  } else {\n    throw new Error(`Unknown dataFormat ${dataFormat}`);\n  }\n\n  return computeConv2DInfo(\n      inShape, filterShape, strides, dilations, pad, roundingMode, false,\n      dataFormat);\n}\n\n/**\n * Computes the information for a forward pass of a pooling3D operation.\n */\nexport function computePool3DInfo(\n    inShape: [number, number, number, number, number],\n    filterSize: number|[number, number, number],\n    strides: number|[number, number, number],\n    dilations: number|[number, number, number], pad: 'same'|'valid'|number,\n    roundingMode?: 'floor'|'round'|'ceil',\n    dataFormat: 'NDHWC'|'NCDHW' = 'NDHWC'): Conv3DInfo {\n  const [filterDepth, filterHeight, filterWidth] = parse3TupleParam(filterSize);\n\n  let filterShape: [number, number, number, number, number];\n  let $dataFormat: 'channelsFirst'|'channelsLast';\n  if (dataFormat === 'NDHWC') {\n    $dataFormat = 'channelsLast';\n    filterShape =\n        [filterDepth, filterHeight, filterWidth, inShape[4], inShape[4]];\n  } else if (dataFormat === 'NCDHW') {\n    $dataFormat = 'channelsFirst';\n    filterShape =\n        [filterDepth, filterHeight, filterWidth, inShape[1], inShape[1]];\n  } else {\n    throw new Error(`Unknown dataFormat ${dataFormat}`);\n  }\n\n  return computeConv3DInfo(\n      inShape, filterShape, strides, dilations, pad, false, $dataFormat,\n      roundingMode);\n}\n\n/**\n * Computes the information for a forward pass of a convolution/pooling\n * operation.\n */\nexport function computeConv2DInfo(\n    inShape: [number, number, number, number],\n    filterShape: [number, number, number, number],\n    strides: number|[number, number], dilations: number|[number, number],\n    pad: 'same'|'valid'|number|ExplicitPadding,\n    roundingMode?: 'floor'|'round'|'ceil', depthwise = false,\n    dataFormat: 'channelsFirst'|'channelsLast' = 'channelsLast'): Conv2DInfo {\n  let [batchSize, inHeight, inWidth, inChannels] = [-1, -1, -1, -1];\n  if (dataFormat === 'channelsLast') {\n    [batchSize, inHeight, inWidth, inChannels] = inShape;\n  } else if (dataFormat === 'channelsFirst') {\n    [batchSize, inChannels, inHeight, inWidth] = inShape;\n  } else {\n    throw new Error(`Unknown dataFormat ${dataFormat}`);\n  }\n\n  const [filterHeight, filterWidth, , filterChannels] = filterShape;\n  const [strideHeight, strideWidth] = parseTupleParam(strides);\n  const [dilationHeight, dilationWidth] = parseTupleParam(dilations);\n\n  const effectiveFilterHeight =\n      getEffectiveFilterSize(filterHeight, dilationHeight);\n  const effectiveFilterWidth =\n      getEffectiveFilterSize(filterWidth, dilationWidth);\n  const {padInfo, outHeight, outWidth} = getPadAndOutInfo(\n      pad, inHeight, inWidth, strideHeight, strideWidth, effectiveFilterHeight,\n      effectiveFilterWidth, roundingMode, dataFormat);\n\n  const outChannels = depthwise ? filterChannels * inChannels : filterChannels;\n\n  let outShape: [number, number, number, number];\n  if (dataFormat === 'channelsFirst') {\n    outShape = [batchSize, outChannels, outHeight, outWidth];\n  } else if (dataFormat === 'channelsLast') {\n    outShape = [batchSize, outHeight, outWidth, outChannels];\n  }\n\n  return {\n    batchSize,\n    dataFormat,\n    inHeight,\n    inWidth,\n    inChannels,\n    outHeight,\n    outWidth,\n    outChannels,\n    padInfo,\n    strideHeight,\n    strideWidth,\n    filterHeight,\n    filterWidth,\n    effectiveFilterHeight,\n    effectiveFilterWidth,\n    dilationHeight,\n    dilationWidth,\n    inShape,\n    outShape,\n    filterShape\n  };\n}\n\n/**\n * Information about the forward pass of a 3D convolution/pooling operation.\n * It includes input and output shape, strides, filter size and padding\n * information.\n */\nexport type Conv3DInfo = {\n  batchSize: number,\n  inDepth: number,\n  inHeight: number,\n  inWidth: number,\n  inChannels: number,\n  outDepth: number,\n  outHeight: number,\n  outWidth: number,\n  outChannels: number,\n  dataFormat: 'channelsFirst'|'channelsLast',\n  strideDepth: number,\n  strideHeight: number,\n  strideWidth: number,\n  dilationDepth: number,\n  dilationHeight: number,\n  dilationWidth: number,\n  filterDepth: number,\n  filterHeight: number,\n  filterWidth: number,\n  effectiveFilterDepth: number,\n  effectiveFilterHeight: number,\n  effectiveFilterWidth: number,\n  padInfo: PadInfo3D,\n  inShape: [number, number, number, number, number],\n  outShape: [number, number, number, number, number],\n  filterShape: [number, number, number, number, number]\n};\n\n/**\n * Computes the information for a forward pass of a 3D convolution/pooling\n * operation.\n */\nexport function computeConv3DInfo(\n    inShape: [number, number, number, number, number],\n    filterShape: [number, number, number, number, number],\n    strides: number|[number, number, number],\n    dilations: number|[number, number, number], pad: 'same'|'valid'|number,\n    depthwise = false,\n    dataFormat: 'channelsFirst'|'channelsLast' = 'channelsLast',\n    roundingMode?: 'floor'|'round'|'ceil'): Conv3DInfo {\n  let [batchSize, inDepth, inHeight, inWidth, inChannels] =\n      [-1, -1, -1, -1, -1];\n  if (dataFormat === 'channelsLast') {\n    [batchSize, inDepth, inHeight, inWidth, inChannels] = inShape;\n  } else if (dataFormat === 'channelsFirst') {\n    [batchSize, inChannels, inDepth, inHeight, inWidth] = inShape;\n  } else {\n    throw new Error(`Unknown dataFormat ${dataFormat}`);\n  }\n\n  const [filterDepth, filterHeight, filterWidth, , filterChannels] =\n      filterShape;\n  const [strideDepth, strideHeight, strideWidth] = parse3TupleParam(strides);\n  const [dilationDepth, dilationHeight, dilationWidth] =\n      parse3TupleParam(dilations);\n\n  const effectiveFilterDepth =\n      getEffectiveFilterSize(filterDepth, dilationDepth);\n  const effectiveFilterHeight =\n      getEffectiveFilterSize(filterHeight, dilationHeight);\n  const effectiveFilterWidth =\n      getEffectiveFilterSize(filterWidth, dilationWidth);\n  const {padInfo, outDepth, outHeight, outWidth} = get3DPadAndOutInfo(\n      pad, inDepth, inHeight, inWidth, strideDepth, strideHeight, strideWidth,\n      effectiveFilterDepth, effectiveFilterHeight, effectiveFilterWidth,\n      roundingMode);\n\n  const outChannels = depthwise ? filterChannels * inChannels : filterChannels;\n\n  let outShape: [number, number, number, number, number];\n  if (dataFormat === 'channelsFirst') {\n    outShape = [batchSize, outChannels, outDepth, outHeight, outWidth];\n  } else if (dataFormat === 'channelsLast') {\n    outShape = [batchSize, outDepth, outHeight, outWidth, outChannels];\n  }\n\n  return {\n    batchSize,\n    dataFormat,\n    inDepth,\n    inHeight,\n    inWidth,\n    inChannels,\n    outDepth,\n    outHeight,\n    outWidth,\n    outChannels,\n    padInfo,\n    strideDepth,\n    strideHeight,\n    strideWidth,\n    filterDepth,\n    filterHeight,\n    filterWidth,\n    effectiveFilterDepth,\n    effectiveFilterHeight,\n    effectiveFilterWidth,\n    dilationDepth,\n    dilationHeight,\n    dilationWidth,\n    inShape,\n    outShape,\n    filterShape\n  };\n}\n\nfunction computeOutputShape2D(\n    inShape: [number, number], fieldSize: number, stride: number,\n    zeroPad?: number, roundingMode?: 'floor'|'round'|'ceil'): [number, number] {\n  if (zeroPad == null) {\n    zeroPad = computeDefaultPad(inShape, fieldSize, stride);\n  }\n  const inputRows = inShape[0];\n  const inputCols = inShape[1];\n\n  const outputRows =\n      round((inputRows - fieldSize + 2 * zeroPad) / stride + 1, roundingMode);\n  const outputCols =\n      round((inputCols - fieldSize + 2 * zeroPad) / stride + 1, roundingMode);\n\n  return [outputRows, outputCols];\n}\n\nfunction computeOutputShape4D(\n    inShape: [number, number, number, number],\n    filterShape: [number, number, number], outChannels: number,\n    strides: [number, number, number], zeroPad?: number,\n    roundingMode?: 'floor'|'round'|'ceil'): [number, number, number, number] {\n  if (zeroPad == null) {\n    zeroPad = computeDefaultPad(inShape, filterShape[0], strides[0]);\n  }\n  const outShape: [number, number, number, number] = [0, 0, 0, outChannels];\n  for (let index = 0; index < 3; index++) {\n    if (inShape[index] + 2 * zeroPad >= filterShape[index]) {\n      outShape[index] = round(\n          (inShape[index] - filterShape[index] + 2 * zeroPad) / strides[index] +\n              1,\n          roundingMode);\n    }\n  }\n  return outShape;\n}\n\nexport function computeDefaultPad(\n    inputShape: [number, number]|[number, number, number, number],\n    fieldSize: number, stride: number, dilation = 1): number {\n  const effectiveFieldSize = getEffectiveFilterSize(fieldSize, dilation);\n  return Math.floor(\n      (inputShape[0] * (stride - 1) - stride + effectiveFieldSize) / 2);\n}\n\nfunction parseTupleParam(param: number|number[]): [number, number, number] {\n  if (typeof param === 'number') {\n    return [param, param, param];\n  }\n  if (param.length === 2) {\n    return [param[0], param[1], 1];\n  }\n  return param as [number, number, number];\n}\n\nfunction parse3TupleParam(param: number|[number, number, number]):\n    [number, number, number] {\n  return typeof param === 'number' ? [param, param, param] : param;\n}\n\n/* See https://www.tensorflow.org/api_docs/python/tf/nn/atrous_conv2d\n * Atrous convolution is equivalent to standard convolution with upsampled\n * filters with effective_filter_height =\n * filter_height + (filter_height - 1) * (dilation - 1)\n * and effective_filter_width =\n * filter_width + (filter_width - 1) * (dilation - 1),\n * produced by inserting dilation - 1 zeros along consecutive elements across\n * the filters' spatial dimensions.\n * When there is a dilation, this converts a filter dimension to the\n * effective filter dimension, so it can be used in a standard convolution.\n */\nfunction getEffectiveFilterSize(filterSize: number, dilation: number) {\n  if (dilation <= 1) {\n    return filterSize;\n  }\n\n  return filterSize + (filterSize - 1) * (dilation - 1);\n}\n\nfunction getPadAndOutInfo(\n    pad: 'same'|'valid'|number|ExplicitPadding, inHeight: number,\n    inWidth: number, strideHeight: number, strideWidth: number,\n    filterHeight: number, filterWidth: number,\n    roundingMode: 'floor'|'round'|'ceil',\n    dataFormat: 'channelsFirst'|\n    'channelsLast'): {padInfo: PadInfo, outHeight: number, outWidth: number} {\n  let padInfo: PadInfo;\n  let outHeight: number;\n  let outWidth: number;\n\n  if (typeof pad === 'number') {\n    const padType = (pad === 0) ? 'VALID' : 'NUMBER';\n    padInfo = {top: pad, bottom: pad, left: pad, right: pad, type: padType};\n    const outShape = computeOutputShape2D(\n        [inHeight, inWidth], filterHeight, strideHeight, pad, roundingMode);\n    outHeight = outShape[0];\n    outWidth = outShape[1];\n  } else if (pad === 'same') {\n    outHeight = Math.ceil(inHeight / strideHeight);\n    outWidth = Math.ceil(inWidth / strideWidth);\n    const padAlongHeight =\n        Math.max(0, (outHeight - 1) * strideHeight + filterHeight - inHeight);\n    const padAlongWidth =\n        Math.max(0, (outWidth - 1) * strideWidth + filterWidth - inWidth);\n    const top = Math.floor(padAlongHeight / 2);\n    const bottom = padAlongHeight - top;\n    const left = Math.floor(padAlongWidth / 2);\n    const right = padAlongWidth - left;\n    padInfo = {top, bottom, left, right, type: 'SAME'};\n  } else if (pad === 'valid') {\n    padInfo = {top: 0, bottom: 0, left: 0, right: 0, type: 'VALID'};\n    outHeight = Math.ceil((inHeight - filterHeight + 1) / strideHeight);\n    outWidth = Math.ceil((inWidth - filterWidth + 1) / strideWidth);\n  } else if (typeof pad === 'object') {\n    const top = dataFormat === 'channelsLast' ? pad[1][0] : pad[2][0];\n    const bottom = dataFormat === 'channelsLast' ? pad[1][1] : pad[2][1];\n    const left = dataFormat === 'channelsLast' ? pad[2][0] : pad[3][0];\n    const right = dataFormat === 'channelsLast' ? pad[2][1] : pad[3][1];\n    const padType = (top === 0 && bottom === 0 && left === 0 && right === 0) ?\n        'VALID' :\n        'EXPLICIT';\n    padInfo = {top, bottom, left, right, type: padType};\n    outHeight = round(\n        (inHeight - filterHeight + top + bottom) / strideHeight + 1,\n        roundingMode);\n    outWidth = round(\n        (inWidth - filterWidth + left + right) / strideWidth + 1, roundingMode);\n  } else {\n    throw Error(`Unknown padding parameter: ${pad}`);\n  }\n  return {padInfo, outHeight, outWidth};\n}\n\nfunction get3DPadAndOutInfo(\n    pad: 'same'|'valid'|number, inDepth: number, inHeight: number,\n    inWidth: number, strideDepth: number, strideHeight: number,\n    strideWidth: number, filterDepth: number, filterHeight: number,\n    filterWidth: number, roundingMode?: 'floor'|'round'|'ceil'): {\n  padInfo: PadInfo3D,\n  outDepth: number,\n  outHeight: number,\n  outWidth: number\n} {\n  let padInfo: PadInfo3D;\n  let outDepth: number;\n  let outHeight: number;\n  let outWidth: number;\n\n  if (pad === 'valid') {\n    pad = 0;\n  }\n\n  if (typeof pad === 'number') {\n    const padType = (pad === 0) ? 'VALID' : 'NUMBER';\n    padInfo = {\n      top: pad,\n      bottom: pad,\n      left: pad,\n      right: pad,\n      front: pad,\n      back: pad,\n      type: padType\n    };\n    const outShape = computeOutputShape4D(\n        [inDepth, inHeight, inWidth, 1],\n        [filterDepth, filterHeight, filterWidth], 1,\n        [strideDepth, strideHeight, strideWidth], pad, roundingMode);\n    outDepth = outShape[0];\n    outHeight = outShape[1];\n    outWidth = outShape[2];\n  } else if (pad === 'same') {\n    outDepth = Math.ceil(inDepth / strideDepth);\n    outHeight = Math.ceil(inHeight / strideHeight);\n    outWidth = Math.ceil(inWidth / strideWidth);\n    const padAlongDepth = (outDepth - 1) * strideDepth + filterDepth - inDepth;\n    const padAlongHeight =\n        (outHeight - 1) * strideHeight + filterHeight - inHeight;\n    const padAlongWidth = (outWidth - 1) * strideWidth + filterWidth - inWidth;\n    const front = Math.floor(padAlongDepth / 2);\n    const back = padAlongDepth - front;\n    const top = Math.floor(padAlongHeight / 2);\n    const bottom = padAlongHeight - top;\n    const left = Math.floor(padAlongWidth / 2);\n    const right = padAlongWidth - left;\n\n    padInfo = {top, bottom, left, right, front, back, type: 'SAME'};\n  } else {\n    throw Error(`Unknown padding parameter: ${pad}`);\n  }\n  return {padInfo, outDepth, outHeight, outWidth};\n}\n\n/**\n * Rounds a value depending on the rounding mode\n * @param value\n * @param roundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n */\nfunction round(value: number, roundingMode?: 'floor'|'round'|'ceil') {\n  if (!roundingMode) {\n    return Math.trunc(value);\n  }\n  switch (roundingMode) {\n    case 'round':\n      // used for Caffe Conv\n      return Math.round(value);\n    case 'ceil':\n      // used for Caffe Pool\n      return Math.ceil(value);\n    case 'floor':\n      return Math.floor(value);\n    default:\n      throw new Error(`Unknown roundingMode ${roundingMode}`);\n  }\n}\n\nexport function tupleValuesAreOne(param: number|number[]): boolean {\n  const [dimA, dimB, dimC] = parseTupleParam(param);\n  return dimA === 1 && dimB === 1 && dimC === 1;\n}\n\nexport function eitherStridesOrDilationsAreOne(\n    strides: number|number[], dilations: number|number[]): boolean {\n  return tupleValuesAreOne(strides) || tupleValuesAreOne(dilations);\n}\n\nexport function stridesOrDilationsArePositive(values: number|\n                                              number[]): boolean {\n  return parseTupleParam(values).every(value => value > 0);\n}\n\n/**\n * Convert Conv2D dataFormat from 'NHWC'|'NCHW' to\n *    'channelsLast'|'channelsFirst'\n * @param dataFormat in 'NHWC'|'NCHW' mode\n * @return dataFormat in 'channelsLast'|'channelsFirst' mode\n * @throws unknown dataFormat\n */\nexport function convertConv2DDataFormat(dataFormat: 'NHWC'|'NCHW'):\n    'channelsLast'|'channelsFirst' {\n  if (dataFormat === 'NHWC') {\n    return 'channelsLast';\n  } else if (dataFormat === 'NCHW') {\n    return 'channelsFirst';\n  } else {\n    throw new Error(`Unknown dataFormat ${dataFormat}`);\n  }\n}\n\n/**\n * Check validity of pad when using dimRoundingMode.\n * @param opDesc A string of op description\n * @param pad The type of padding algorithm.\n *   - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *   - `valid` output will be smaller than input if filter is larger\n *       than 1x1.\n *   - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n * @throws unknown padding parameter\n */\nexport function checkPadOnDimRoundingMode(\n    opDesc: string, pad: 'valid'|'same'|number|ExplicitPadding,\n    dimRoundingMode?: 'floor'|'round'|'ceil') {\n  if (dimRoundingMode != null) {\n    if (typeof pad === 'string') {\n      throw Error(\n          `Error in ${opDesc}: pad must be an integer when using ` +\n          `dimRoundingMode ${dimRoundingMode} but got pad ${pad}.`);\n    } else if (typeof pad === 'number') {\n      util.assert(\n          util.isInt(pad),\n          () => `Error in ${opDesc}: pad must be an integer when using ` +\n              `dimRoundingMode ${dimRoundingMode} but got pad ${pad}.`);\n    } else if (typeof pad === 'object') {\n      (pad as ExplicitPadding).forEach(p => {\n        p.forEach(v => {\n          util.assert(\n              util.isInt(v),\n              () => `Error in ${opDesc}: pad must be an integer when using ` +\n                  `dimRoundingMode ${dimRoundingMode} but got pad ${v}.`);\n        });\n      });\n    } else {\n      throw Error(`Error in ${opDesc}: Unknown padding parameter: ${pad}`);\n    }\n  }\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Reshape, ReshapeAttrs, ReshapeInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {Rank, ShapeMap, TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Reshapes a `tf.Tensor` to a given shape.\n *\n * Given an input tensor, returns a new tensor with the same values as the\n * input tensor with shape `shape`.\n *\n * If one component of shape is the special value -1, the size of that\n * dimension is computed so that the total size remains constant. In\n * particular, a shape of [-1] flattens into 1-D. At most one component of\n * shape can be -1.\n *\n * If shape is 1-D or higher, then the operation returns a tensor with shape\n * shape filled with the values of tensor. In this case, the number of\n * elements implied by shape must be the same as the number of elements in\n * tensor.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n * x.reshape([2, 2]).print();\n * ```\n *\n * @param x The input tensor to be reshaped.\n * @param shape An array of integers defining the output tensor shape.\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction reshape_<R extends Rank>(\n    x: Tensor|TensorLike, shape: ShapeMap[R]): Tensor<R> {\n  const $x = convertToTensor(x, 'x', 'reshape', 'string_or_numeric');\n\n  const inputs: ReshapeInputs = {x: $x};\n  const attrs: ReshapeAttrs = {shape};\n  return ENGINE.runKernel(\n      Reshape, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\nexport const reshape = /* @__PURE__ */ op({reshape_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {AvgPool, AvgPoolAttrs, AvgPoolInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {cast} from './cast';\nimport * as conv_util from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes the 2D average pooling of an image.\n *\n * @param x The input tensor, of rank 4 or rank 3 of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is assumed.\n * @param filterSize The filter size: `[filterHeight, filterWidth]`. If\n *     `filterSize` is a single number, then `filterHeight == filterWidth`.\n * @param strides The strides of the pooling: `[strideHeight, strideWidth]`. If\n *     `strides` is a single number, then `strideHeight == strideWidth`.\n * @param pad The type of padding algorithm:\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n *    - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *         https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction avgPool_<T extends Tensor3D|Tensor4D>(\n    x: T|TensorLike, filterSize: [number, number]|number,\n    strides: [number, number]|number,\n    pad: 'valid'|'same'|number|conv_util.ExplicitPadding,\n    dimRoundingMode?: 'floor'|'round'|'ceil'): T {\n  const $x = convertToTensor(x, 'x', 'avgPool', 'float32');\n  const dilations = 1;\n\n  util.assert(\n      conv_util.eitherStridesOrDilationsAreOne(strides, dilations),\n      () => 'Error in avgPool: Either strides or dilations must be 1. ' +\n          `Got strides ${strides} and dilations '${dilations}'`);\n\n  let x4D = $x as Tensor4D;\n  let reshapedTo4D = false;\n  if ($x.rank === 3) {\n    reshapedTo4D = true;\n    x4D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2]]);\n  }\n\n  util.assert(\n      x4D.rank === 4,\n      () => `Error in avgPool: x must be rank 4 but got rank ${x4D.rank}.`);\n  conv_util.checkPadOnDimRoundingMode('avgPool', pad, dimRoundingMode);\n  const inputs: AvgPoolInputs = {x: x4D};\n  const attrs: AvgPoolAttrs = {filterSize, strides, pad, dimRoundingMode};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  let res = ENGINE.runKernel(\n                AvgPool, inputs as unknown as NamedTensorMap,\n                attrs as unknown as NamedAttrMap) as T;\n\n  res = cast(res, $x.dtype);\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n\n  return res;\n}\n\nexport const avgPool = /* @__PURE__ */ op({avgPool_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {AvgPool3D, AvgPool3DAttrs, AvgPool3DInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor4D, Tensor5D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {cast} from './cast';\nimport {checkPadOnDimRoundingMode} from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes the 3D average pooling.\n *\n * ```js\n * const x = tf.tensor5d([1, 2, 3, 4, 5, 6, 7, 8], [1, 2, 2, 2, 1]);\n * const result = tf.avgPool3d(x, 2, 1, 'valid');\n * result.print();\n * ```\n *\n * @param x The input tensor, of rank 5 or rank 4 of shape\n *     `[batch, depth, height, width, inChannels]`.\n * @param filterSize The filter size:\n *     `[filterDepth, filterHeight, filterWidth]`.\n *     If `filterSize` is a single number,\n *     then `filterDepth == filterHeight == filterWidth`.\n * @param strides The strides of the pooling:\n *     `[strideDepth, strideHeight, strideWidth]`.\n *     If `strides` is a single number,\n *     then `strideDepth == strideHeight == strideWidth`.\n * @param pad The type of padding algorithm.\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1*1x1.\n *    - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n * @param dataFormat An optional string from: \"NDHWC\", \"NCDHW\". Defaults to\n *     \"NDHWC\". Specify the data format of the input and output data. With the\n *     default format \"NDHWC\", the data is stored in the order of: [batch,\n *     depth, height, width, channels]. Only \"NDHWC\" is currently supported.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction avgPool3d_<T extends Tensor4D|Tensor5D>(\n    x: T|TensorLike, filterSize: [number, number, number]|number,\n    strides: [number, number, number]|number, pad: 'valid'|'same'|number,\n    dimRoundingMode?: 'floor'|'round'|'ceil',\n    dataFormat: 'NDHWC'|'NCDHW' = 'NDHWC'): T {\n  const $x = convertToTensor(x, 'x', 'avgPool3d', 'float32');\n\n  let x5D = $x as Tensor5D;\n  let reshapedTo5D = false;\n  if ($x.rank === 4) {\n    reshapedTo5D = true;\n    x5D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2], $x.shape[3]]);\n  }\n\n  util.assert(\n      x5D.rank === 5,\n      () => `Error in avgPool3d: x must be rank 5 but got rank ${x5D.rank}.`);\n  util.assert(\n      dataFormat === 'NDHWC',\n      () => `Error in avgPool3d: Only NDHWC is currently supported, ` +\n          `but got dataFormat of ${dataFormat}`);\n  util.assert(\n      (typeof strides === 'number' && strides > 0) ||\n          (Array.isArray(strides) && strides[0] > 0 && strides[1] > 0 &&\n           strides[2] > 0),\n      () => `Error in avgPool3d: Stride must be > 0, but got '${strides}'`);\n  checkPadOnDimRoundingMode('avgPool3d', pad, dimRoundingMode);\n  const inputs: AvgPool3DInputs = {x: x5D};\n  const attrs:\n      AvgPool3DAttrs = {filterSize, strides, pad, dimRoundingMode, dataFormat};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  let res = ENGINE.runKernel(\n                AvgPool3D, inputs as unknown as NamedTensorMap,\n                attrs as unknown as NamedAttrMap) as T;\n\n  res = cast(res, x5D.dtype);\n\n  if (reshapedTo5D) {\n    return reshape(\n               res, [res.shape[1], res.shape[2], res.shape[3], res.shape[4]]) as\n        T;\n  }\n\n  return res;\n}\n\nexport const avgPool3d = /* @__PURE__ */ op({avgPool3d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Concat, ConcatAttrs, ConcatInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensorArray} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {assert} from '../util';\n\nimport {clone} from './clone';\nimport {op} from './operation';\n\n/**\n * Concatenates a list of `tf.Tensor`s along a given axis.\n *\n * The tensors ranks and types must match, and their sizes must match in all\n * dimensions except `axis`.\n *\n * Also available are stricter rank-specific methods that assert that\n * `tensors` are of the given rank:\n *   - `tf.concat1d`\n *   - `tf.concat2d`\n *   - `tf.concat3d`\n *   - `tf.concat4d`\n *\n * Except `tf.concat1d` (which does not have axis param), all methods have\n * same signature as this method.\n *\n * ```js\n * const a = tf.tensor1d([1, 2]);\n * const b = tf.tensor1d([3, 4]);\n * a.concat(b).print();  // or a.concat(b)\n * ```\n *\n * ```js\n * const a = tf.tensor1d([1, 2]);\n * const b = tf.tensor1d([3, 4]);\n * const c = tf.tensor1d([5, 6]);\n * tf.concat([a, b, c]).print();\n * ```\n *\n * ```js\n * const a = tf.tensor2d([[1, 2], [10, 20]]);\n * const b = tf.tensor2d([[3, 4], [30, 40]]);\n * const axis = 1;\n * tf.concat([a, b], axis).print();\n * ```\n * @param tensors A list of tensors to concatenate.\n * @param axis The axis to concatenate along. Defaults to 0 (the first dim).\n *\n * @doc {heading: 'Tensors', subheading: 'Slicing and Joining'}\n */\nfunction concat_<T extends Tensor>(tensors: Array<T|TensorLike>, axis = 0): T {\n  assert(tensors.length >= 1, () => 'Pass at least one tensor to concat');\n\n  const $tensors =\n      convertToTensorArray(tensors, 'tensors', 'concat', 'string_or_numeric');\n\n  if ($tensors[0].dtype === 'complex64') {\n    $tensors.forEach(tensor => {\n      if (tensor.dtype !== 'complex64') {\n        throw new Error(`Cannot concatenate complex64 tensors with a tensor\n          with dtype ${tensor.dtype}. `);\n      }\n    });\n  }\n\n  if ($tensors.length === 1) {\n    return clone($tensors[0]);\n  }\n\n  const inputs: ConcatInputs = $tensors;\n  const attr: ConcatAttrs = {axis};\n\n  return ENGINE.runKernel(\n      Concat, inputs as unknown as NamedTensorMap,\n      attr as unknown as NamedAttrMap);\n}\n\nexport const concat = /* @__PURE__ */ op({concat_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {BatchMatMul, BatchMatMulAttrs, BatchMatMulInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the dot product of two matrices, A * B. These must be matrices.\n *\n * ```js\n * const a = tf.tensor2d([1, 2], [1, 2]);\n * const b = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * a.matMul(b).print();  // or tf.matMul(a, b)\n * ```\n * @param a First matrix in dot product operation.\n * @param b Second matrix in dot product operation.\n * @param transposeA If true, `a` is transposed before multiplication.\n * @param transposeB If true, `b` is transposed before multiplication.\n *\n * @doc {heading: 'Operations', subheading: 'Matrices'}\n */\nfunction matMul_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike, transposeA = false,\n    transposeB = false): T {\n  let $a = convertToTensor(a, 'a', 'matMul');\n  let $b = convertToTensor(b, 'b', 'matMul');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  const inputs: BatchMatMulInputs = {a: $a, b: $b};\n  const attrs: BatchMatMulAttrs = {transposeA, transposeB};\n\n  return ENGINE.runKernel(\n      BatchMatMul, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const matMul = /* @__PURE__ */ op({matMul_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Sigmoid, SigmoidInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes sigmoid element-wise, `1 / (1 + exp(-x))`\n *\n * ```js\n * const x = tf.tensor1d([0, -1, 2, -3]);\n *\n * x.sigmoid().print();  // or tf.sigmoid(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction sigmoid_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'sigmoid', 'float32');\n\n  const inputs: SigmoidInputs = {x: $x};\n\n  return ENGINE.runKernel(Sigmoid, inputs as unknown as NamedTensorMap);\n}\nexport const sigmoid = /* @__PURE__ */ op({sigmoid_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Slice, SliceAttrs, SliceInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {Rank, TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Extracts a slice from a `tf.Tensor` starting at coordinates `begin`\n * and is of size `size`.\n *\n * Also available are stricter rank-specific methods with the same signature\n * as this method that assert that `x` is of the given rank:\n *   - `tf.slice1d`\n *   - `tf.slice2d`\n *   - `tf.slice3d`\n *   - `tf.slice4d`\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n *\n * x.slice([1], [2]).print();\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * x.slice([1, 0], [1, 2]).print();\n * ```\n * @param x The input `tf.Tensor` to slice from.\n * @param begin The coordinates to start the slice from. The length can be\n *     less than the rank of x - the rest of the axes will have implicit 0 as\n *     start. Can also be a single number, in which case it specifies the\n *     first axis.\n * @param size The size of the slice. The length can be less than the rank of\n *     x - the rest of the axes will have implicit -1. A value of -1 requests\n *     the rest of the dimensions in the axis. Can also be a single number,\n *     in which case it specifies the size of the first axis.\n *\n * @doc {heading: 'Tensors', subheading: 'Slicing and Joining'}\n */\nfunction slice_<R extends Rank, T extends Tensor<R>>(\n    x: T|TensorLike, begin: number|number[], size?: number|number[]): T {\n  const $x = convertToTensor(x, 'x', 'slice', 'string_or_numeric');\n\n  if ($x.rank === 0) {\n    throw new Error('Slicing scalar is not possible');\n  }\n\n  const inputs: SliceInputs = {x: $x};\n  const attrs: SliceAttrs = {begin, size};\n\n  return ENGINE.runKernel(\n      Slice, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const slice = /* @__PURE__ */ op({slice_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Tanh, TanhInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes hyperbolic tangent of the input `tf.Tensor` element-wise: `tanh(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, 1, -1, 70]);\n *\n * x.tanh().print();  // or tf.tanh(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction tanh_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'tanh', 'float32');\n\n  const inputs: TanhInputs = {x: $x};\n\n  return ENGINE.runKernel(Tanh, inputs as unknown as NamedTensorMap);\n}\nexport const tanh = /* @__PURE__ */ op({tanh_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Scalar, Tensor1D, Tensor2D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {add} from './add';\nimport {concat} from './concat';\nimport {matMul} from './mat_mul';\nimport {mul} from './mul';\nimport {op} from './operation';\nimport {sigmoid} from './sigmoid';\nimport {slice} from './slice';\nimport {tanh} from './tanh';\n\n/**\n * Computes the next state and output of a BasicLSTMCell.\n *\n * Returns `[newC, newH]`.\n *\n * Derived from tf.contrib.rnn.BasicLSTMCell.\n *\n * @param forgetBias Forget bias for the cell.\n * @param lstmKernel The weights for the cell.\n * @param lstmBias The bias for the cell.\n * @param data The input to the cell.\n * @param c Previous cell state.\n * @param h Previous cell output.\n *\n * @doc {heading: 'Operations', subheading: 'RNN'}\n */\nfunction basicLSTMCell_(\n    forgetBias: Scalar|TensorLike, lstmKernel: Tensor2D|TensorLike,\n    lstmBias: Tensor1D|TensorLike, data: Tensor2D|TensorLike,\n    c: Tensor2D|TensorLike, h: Tensor2D|TensorLike): [Tensor2D, Tensor2D] {\n  const $forgetBias =\n      convertToTensor(forgetBias, 'forgetBias', 'basicLSTMCell');\n  const $lstmKernel =\n      convertToTensor(lstmKernel, 'lstmKernel', 'basicLSTMCell');\n  const $lstmBias = convertToTensor(lstmBias, 'lstmBias', 'basicLSTMCell');\n  const $data = convertToTensor(data, 'data', 'basicLSTMCell');\n  const $c = convertToTensor(c, 'c', 'basicLSTMCell');\n  const $h = convertToTensor(h, 'h', 'basicLSTMCell');\n\n  const combined = concat([$data, $h], 1);\n  const weighted = matMul(combined, $lstmKernel);\n  const res: Tensor2D = add(weighted, $lstmBias);\n\n  // i = input_gate, j = new_input, f = forget_gate, o = output_gate\n  const batchSize = res.shape[0];\n  const sliceCols = res.shape[1] / 4;\n  const sliceSize: [number, number] = [batchSize, sliceCols];\n  const i = slice(res, [0, 0], sliceSize);\n  const j = slice(res, [0, sliceCols], sliceSize);\n  const f = slice(res, [0, sliceCols * 2], sliceSize);\n  const o = slice(res, [0, sliceCols * 3], sliceSize);\n\n  const newC: Tensor2D =\n      add(mul(sigmoid(i), tanh(j)),\n          mul($c, sigmoid(add($forgetBias, f)) as Tensor2D));\n  const newH: Tensor2D = mul(tanh(newC), sigmoid(o));\n  return [newC, newH];\n}\n\nexport const basicLSTMCell = /* @__PURE__ */ op({basicLSTMCell_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {BatchToSpaceND, BatchToSpaceNDAttrs, BatchToSpaceNDInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * This operation reshapes the \"batch\" dimension 0 into `M + 1` dimensions of\n * shape `blockShape + [batch]`, interleaves these blocks back into the grid\n * defined by the spatial dimensions `[1, ..., M]`, to obtain a result with\n * the same rank as the input. The spatial dimensions of this intermediate\n * result are then optionally cropped according to `crops` to produce the\n * output. This is the reverse of `tf.spaceToBatchND`. See below for a precise\n * description.\n *\n * ```js\n * const x = tf.tensor4d([1, 2, 3, 4], [4, 1, 1, 1]);\n * const blockShape = [2, 2];\n * const crops = [[0, 0], [0, 0]];\n *\n * x.batchToSpaceND(blockShape, crops).print();\n * ```\n *\n * @param x A `tf.Tensor`. N-D with `x.shape` = `[batch] + spatialShape +\n * remainingShape`, where spatialShape has `M` dimensions.\n * @param blockShape A 1-D array. Must have shape `[M]`, all values must\n * be >= 1.\n * @param crops A 2-D array.  Must have shape `[M, 2]`, all values must be >= 0.\n * `crops[i] = [cropStart, cropEnd]` specifies the amount to crop from input\n * dimension `i + 1`, which corresponds to spatial dimension `i`. It is required\n * that `cropStart[i] + cropEnd[i] <= blockShape[i] * inputShape[i + 1]`\n *\n * This operation is equivalent to the following steps:\n *\n * 1. Reshape `x` to `reshaped` of shape: `[blockShape[0], ...,\n * blockShape[M-1], batch / prod(blockShape), x.shape[1], ...,\n * x.shape[N-1]]`\n *\n * 2. Permute dimensions of `reshaped` to produce `permuted` of shape `[batch /\n * prod(blockShape),x.shape[1], blockShape[0], ..., x.shape[M],\n * blockShape[M-1],x.shape[M+1], ..., x.shape[N-1]]`\n *\n * 3. Reshape `permuted` to produce `reshapedPermuted` of shape `[batch /\n * prod(blockShape),x.shape[1] * blockShape[0], ..., x.shape[M] *\n * blockShape[M-1],x.shape[M+1], ..., x.shape[N-1]]`\n *\n * 4. Crop the start and end of dimensions `[1, ..., M]` of `reshapedPermuted`\n * according to `crops` to produce the output of shape: `[batch /\n * prod(blockShape),x.shape[1] * blockShape[0] - crops[0,0] - crops[0,1],\n * ..., x.shape[M] * blockShape[M-1] - crops[M-1,0] -\n * crops[M-1,1],x.shape[M+1], ..., x.shape[N-1]]`\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction batchToSpaceND_<T extends Tensor>(\n    x: T|TensorLike, blockShape: number[], crops: number[][]): T {\n  const $x = convertToTensor(x, 'x', 'batchToSpaceND');\n  const prod = blockShape.reduce((a, b) => a * b);\n\n  util.assert(\n      $x.rank >= 1 + blockShape.length,\n      () => `input rank is ${$x.rank} but should be > than blockShape.length ${\n          blockShape.length}`);\n\n  util.assert(\n      crops.length === blockShape.length,\n      () => `crops.length is ${\n          crops.length} but should be equal to blockShape.length  ${\n          blockShape.length}`);\n\n  util.assert(\n      $x.shape[0] % prod === 0,\n      () => `input tensor batch is ${\n                $x.shape[0]} but is not divisible by the product of ` +\n          `the elements of blockShape ${blockShape.join(' * ')} === ${prod}`);\n\n  const inputs: BatchToSpaceNDInputs = {x: $x};\n  const attrs: BatchToSpaceNDAttrs = {blockShape, crops};\n\n  return ENGINE.runKernel(\n      BatchToSpaceND, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const batchToSpaceND = /* @__PURE__ */ op({batchToSpaceND_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor, Tensor4D} from '../tensor';\nimport {Rank} from '../types';\nimport {reshape} from './reshape';\n\nexport function xAs4D<R extends Rank>(x: Tensor<R>) {\n  let x4D: Tensor4D;\n  if (x.rank === 0 || x.rank === 1) {\n    x4D = reshape(x, [1, 1, 1, x.size]);\n  } else if (x.rank === 2) {\n    x4D = reshape(x, [1, 1, x.shape[0], x.shape[1]]);\n  } else if (x.rank === 3) {\n    x4D = reshape(x, [1, x.shape[0], x.shape[1], x.shape[2]]);\n  } else {\n    x4D = x as Tensor4D;\n  }\n\n  return x4D;\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {FusedBatchNorm, FusedBatchNormAttrs, FusedBatchNormInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor, Tensor1D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {Rank, TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {xAs4D} from './batchnorm_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Batch normalization.\n *\n * As described in\n * [http://arxiv.org/abs/1502.03167](http://arxiv.org/abs/1502.03167).\n *\n * Mean, variance, scale, and offset can be of two shapes:\n *   - The same shape as the input.\n *   - In the common case, the depth dimension is the last dimension of x, so\n *     the values would be a `tf.Tensor1D` of shape [depth].\n *\n * Also available are stricter rank-specific methods with the same signature\n * as this method that assert that parameters passed are of given rank\n *   - `tf.batchNorm2d`\n *   - `tf.batchNorm3d`\n *   - `tf.batchNorm4d`\n *\n * @param x The input Tensor.\n * @param mean A mean Tensor.\n * @param variance A variance Tensor.\n * @param offset An offset Tensor.\n * @param scale A scale Tensor.\n * @param varianceEpsilon A small float number to avoid dividing by 0.\n *\n * @doc {heading: 'Operations', subheading: 'Normalization'}\n */\nfunction batchNorm_<R extends Rank>(\n    x: Tensor<R>|TensorLike, mean: Tensor<R>|Tensor1D|TensorLike,\n    variance: Tensor<R>|Tensor1D|TensorLike,\n    offset?: Tensor<R>|Tensor1D|TensorLike,\n    scale?: Tensor<R>|Tensor1D|TensorLike,\n    varianceEpsilon?: number): Tensor<R> {\n  if (varianceEpsilon == null) {\n    varianceEpsilon = 0.001;\n  }\n  const $x = convertToTensor(x, 'x', 'batchNorm');\n  const $mean = convertToTensor(mean, 'mean', 'batchNorm');\n  const $variance = convertToTensor(variance, 'variance', 'batchNorm');\n  let $scale: Tensor<R>|Tensor1D;\n  if (scale != null) {\n    $scale = convertToTensor(scale, 'scale', 'batchNorm');\n  }\n  let $offset: Tensor<R>|Tensor1D;\n  if (offset != null) {\n    $offset = convertToTensor(offset, 'offset', 'batchNorm');\n  }\n\n  util.assert(\n      $mean.rank === $variance.rank,\n      () => 'Batch normalization gradient requires mean and variance to have ' +\n          'equal ranks.');\n  util.assert(\n      $offset == null || $mean.rank === $offset.rank,\n      () => 'Batch normalization gradient requires mean and offset to have ' +\n          'equal ranks.');\n  util.assert(\n      $scale == null || $mean.rank === $scale.rank,\n      () => 'Batch normalization gradient requires mean and scale to have ' +\n          'equal ranks.');\n\n  const x4D: Tensor4D = xAs4D($x);\n\n  const inputs: FusedBatchNormInputs = {\n    x: x4D,\n    scale: $scale,\n    offset: $offset,\n    mean: $mean,\n    variance: $variance\n  };\n\n  const attrs: FusedBatchNormAttrs = {varianceEpsilon};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  FusedBatchNorm, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as Tensor<R>;\n\n  return reshape(res, $x.shape);\n}\n\nexport const batchNorm = /* @__PURE__ */ op({batchNorm_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor1D, Tensor2D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {batchNorm} from './batchnorm';\nimport {op} from './operation';\n\n/**\n * Batch normalization, strictly for 2D. For the more relaxed version, see\n * `tf.batchNorm`.\n *\n * @param x The input Tensor.\n * @param mean A mean Tensor.\n * @param variance A variance Tensor.\n * @param offset An offset Tensor.\n * @param scale A scale Tensor.\n * @param varianceEpsilon A small float number to avoid dividing by 0.\n */\nfunction batchNorm2d_(\n    x: Tensor2D|TensorLike, mean: Tensor2D|Tensor1D|TensorLike,\n    variance: Tensor2D|Tensor1D|TensorLike,\n    offset?: Tensor2D|Tensor1D|TensorLike, scale?: Tensor2D|Tensor1D|TensorLike,\n    varianceEpsilon?: number): Tensor2D {\n  const $x = convertToTensor(x, 'x', 'batchNorm');\n  const $mean = convertToTensor(mean, 'mean', 'batchNorm');\n  const $variance = convertToTensor(variance, 'variance', 'batchNorm');\n  let $scale: Tensor2D|Tensor1D;\n  if (scale != null) {\n    $scale = convertToTensor(scale, 'scale', 'batchNorm');\n  }\n  let $offset: Tensor2D|Tensor1D;\n  if (offset != null) {\n    $offset = convertToTensor(offset, 'offset', 'batchNorm');\n  }\n  util.assert(\n      $x.rank === 2,\n      () => `Error in batchNorm2D: x must be rank 2 but got rank ` +\n          `${$x.rank}.`);\n  util.assert(\n      $mean.rank === 2 || $mean.rank === 1,\n      () => `Error in batchNorm2D: mean must be rank 2 or rank 1 but ` +\n          `got rank ${$mean.rank}.`);\n  util.assert(\n      $variance.rank === 2 || $variance.rank === 1,\n      () => `Error in batchNorm2D: variance must be rank 2 or rank 1 ` +\n          `but got rank ${$variance.rank}.`);\n  if ($scale != null) {\n    util.assert(\n        $scale.rank === 2 || $scale.rank === 1,\n        () => `Error in batchNorm2D: scale must be rank 2 or rank 1 ` +\n            `but got rank ${$scale.rank}.`);\n  }\n  if ($offset != null) {\n    util.assert(\n        $offset.rank === 2 || $offset.rank === 1,\n        () => `Error in batchNorm2D: offset must be rank 2 or rank 1 ` +\n            `but got rank ${$offset.rank}.`);\n  }\n\n  return batchNorm($x, $mean, $variance, $offset, $scale, varianceEpsilon);\n}\n\nexport const batchNorm2d = /* @__PURE__ */ op({batchNorm2d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor1D, Tensor3D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {batchNorm} from './batchnorm';\nimport {op} from './operation';\n\n/**\n * Batch normalization, strictly for 3D. For the more relaxed version, see\n * `tf.batchNorm`.\n *\n * @param x The input Tensor.\n * @param mean A mean Tensor.\n * @param variance A variance Tensor.\n * @param offset An offset Tensor.\n * @param scale A scale Tensor.\n * @param varianceEpsilon A small float number to avoid dividing by 0.\n */\nfunction batchNorm3d_(\n    x: Tensor3D|TensorLike, mean: Tensor3D|Tensor1D|TensorLike,\n    variance: Tensor3D|Tensor1D|TensorLike,\n    offset?: Tensor3D|Tensor1D|TensorLike, scale?: Tensor3D|Tensor1D|TensorLike,\n    varianceEpsilon?: number): Tensor3D {\n  const $x = convertToTensor(x, 'x', 'batchNorm');\n  const $mean = convertToTensor(mean, 'mean', 'batchNorm');\n  const $variance = convertToTensor(variance, 'variance', 'batchNorm');\n  let $scale: Tensor3D|Tensor1D;\n  if (scale != null) {\n    $scale = convertToTensor(scale, 'scale', 'batchNorm');\n  }\n  let $offset: Tensor3D|Tensor1D;\n  if (offset != null) {\n    $offset = convertToTensor(offset, 'offset', 'batchNorm');\n  }\n  util.assert(\n      $x.rank === 3,\n      () => `Error in batchNorm3D: x must be rank 3 but got rank ` +\n          `${$x.rank}.`);\n  util.assert(\n      $mean.rank === 3 || $mean.rank === 1,\n      () => `Error in batchNorm3D: mean must be rank 3 or rank 1 but ` +\n          `got rank ${$mean.rank}.`);\n  util.assert(\n      $variance.rank === 3 || $variance.rank === 1,\n      () => `Error in batchNorm3D: variance must be rank 3 or rank 1 ` +\n          `but got rank ${$variance.rank}.`);\n  if ($scale != null) {\n    util.assert(\n        $scale.rank === 3 || $scale.rank === 1,\n        () => `Error in batchNorm3D: scale must be rank 3 or rank 1 ` +\n            `but got rank ${$scale.rank}.`);\n  }\n  if ($offset != null) {\n    util.assert(\n        $offset.rank === 3 || $offset.rank === 1,\n        () => `Error in batchNorm3D: offset must be rank 3 or rank 1 ` +\n            `but got rank ${$offset.rank}.`);\n  }\n\n  return batchNorm($x, $mean, $variance, $offset, $scale, varianceEpsilon);\n}\n\nexport const batchNorm3d = /* @__PURE__ */ op({batchNorm3d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor1D, Tensor4D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {batchNorm} from './batchnorm';\nimport {op} from './operation';\n\n/**\n * Batch normalization, strictly for 4D. For the more relaxed version, see\n * `tf.batchNorm`.\n *\n * @param x The input Tensor.\n * @param mean A mean Tensor.\n * @param variance A variance Tensor.\n * @param offset An offset Tensor.\n * @param scale A scale Tensor.\n * @param varianceEpsilon A small float number to avoid dividing by 0.\n */\nfunction batchNorm4d_(\n    x: Tensor4D|TensorLike, mean: Tensor4D|Tensor1D|TensorLike,\n    variance: Tensor4D|Tensor1D|TensorLike,\n    offset?: Tensor4D|Tensor1D|TensorLike, scale?: Tensor4D|Tensor1D|TensorLike,\n    varianceEpsilon?: number): Tensor4D {\n  const $x = convertToTensor(x, 'x', 'batchNorm');\n  const $mean = convertToTensor(mean, 'mean', 'batchNorm');\n  const $variance = convertToTensor(variance, 'variance', 'batchNorm');\n  let $scale: Tensor4D|Tensor1D;\n  if (scale != null) {\n    $scale = convertToTensor(scale, 'scale', 'batchNorm');\n  }\n  let $offset: Tensor4D|Tensor1D;\n  if (offset != null) {\n    $offset = convertToTensor(offset, 'offset', 'batchNorm');\n  }\n  util.assert(\n      $x.rank === 4,\n      () => `Error in batchNorm4D: x must be rank 4 but got rank ` +\n          `${$x.rank}.`);\n  util.assert(\n      $mean.rank === 4 || $mean.rank === 1,\n      () => `Error in batchNorm4D: mean must be rank 4 or rank 1 but ` +\n          `got rank ${$mean.rank}.`);\n  util.assert(\n      $variance.rank === 4 || $variance.rank === 1,\n      () => `Error in batchNorm4D: variance must be rank 4 or rank 1 ` +\n          `but got rank ${$variance.rank}.`);\n  if ($scale != null) {\n    util.assert(\n        $scale.rank === 4 || $scale.rank === 1,\n        () => `Error in batchNorm4D: scale must be rank 4 or rank 1 ` +\n            `but got rank ${$scale.rank}.`);\n  }\n  if ($offset != null) {\n    util.assert(\n        $offset.rank === 4 || $offset.rank === 1,\n        () => `Error in batchNorm4D: offset must be rank 4 or rank 1 ` +\n            `but got rank ${$offset.rank}.`);\n  }\n  return batchNorm($x, $mean, $variance, $offset, $scale, varianceEpsilon);\n}\n\nexport const batchNorm4d = /* @__PURE__ */ op({batchNorm4d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Bincount, BincountAttrs, BincountInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor1D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Outputs a vector with length `size` and the same dtype as `weights`.\n *\n * If `weights` are empty, then index `i` stores the number of times the value\n * `i` is counted in `x`. If `weights` are non-empty, then index `i` stores the\n * sum of the value in `weights` at each index where the corresponding value in\n * `x` is `i`.\n *\n * Values in `x` outside of the range [0, size) are ignored.\n *\n * @param x The input int tensor, rank 1.\n * @param weights The weights tensor, must have the same shape as x, or a\n *     length-0 Tensor, in which case it acts as all weights equal to 1.\n * @param size Non-negative integer.\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction bincount_<T extends Tensor1D>(\n    x: T|TensorLike, weights: T|TensorLike, size: number): T {\n  const $x = convertToTensor(x, 'x', 'bincount');\n  const $weights = convertToTensor(weights, 'weights', 'bincount');\n\n  util.assert(\n      $x.dtype === 'int32',\n      () => `Error in bincount: input ` +\n          `dtype must be int32, but got ${$x.dtype}`);\n  util.assert(size >= 0, () => `size must be non-negative, but got ${size}.`);\n  util.assert(\n      $weights.size === $x.size || $weights.size === 0,\n      () => `Error in bincount: weights must have the same size as input or` +\n          `0-length, but got input shape: ${$x.shape}, weights shape: ` +\n          `${$weights.shape}.`);\n\n  const inputs: BincountInputs = {x: $x, weights: $weights};\n  const attrs: BincountAttrs = {size};\n\n  return ENGINE.runKernel(\n      Bincount, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const bincount = /* @__PURE__ */ op({bincount_});\n", "/**\n * @license\n * Copyright 2023 Google LLC.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {BitwiseAnd, BitwiseAndInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {Rank} from '../types';\nimport {arraysEqual} from '../util_base';\n\nimport {op} from './operation';\n\n/**\n * Bitwise `AND` operation for input tensors.\n *\n * Given two input tensors, returns a new tensor\n * with the `AND` calculated values.\n *\n * The method supports int32 values\n *\n *\n * ```js\n * const x = tf.tensor1d([0, 5, 3, 14], 'int32');\n * const y = tf.tensor1d([5, 0, 7, 11], 'int32');\n * tf.bitwiseAnd(x, y).print();\n * ```\n *\n * @param x The input tensor to be calculated.\n * @param y The input tensor to be calculated.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction bitwiseAnd_<R extends Rank>(x: Tensor, y: Tensor): Tensor<R> {\n  const $x = convertToTensor(x, 'x', 'bitwiseAnd');\n  const $y = convertToTensor(y, 'y', 'bitwiseAnd');\n\n  if (!arraysEqual($x.shape, $y.shape)) {\n    throw new Error(`BitwiseAnd: Tensors must have the same shape. x: ${\n        $x.shape}, y: ${$y.shape}`);\n  }\n  if ($x.dtype !== 'int32' || $y.dtype !== 'int32') {\n    throw new Error(\n        `BitwiseAnd: Only supports 'int32' values in tensor, found type of x: ${\n            $x.dtype} and type of y: ${$y.dtype}`);\n  }\n\n  const inputs: BitwiseAndInputs = {a: $x, b: $y};\n  return ENGINE.runKernel(BitwiseAnd, inputs as unknown as NamedTensorMap);\n}\nexport const bitwiseAnd = /* @__PURE__ */ op({bitwiseAnd_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport { NamedTensorMap } from '../tensor_types';\nimport { ENGINE } from '../engine';\nimport { BroadcastArgs, BroadcastArgsInputs } from '../kernel_names';\nimport { Tensor } from '../tensor';\nimport { convertToTensor } from '../tensor_util_env';\nimport { Rank, TensorLike } from '../types';\n\nimport { op } from './operation';\n\n/**\n * Return the shape of s0 op s1 with broadcast.\n *\n * compute r0, the broadcasted shape as a tensor.\n * s0, s1 and r0 are all integer vectors.\n *\n * This function returns the shape of the result of an operation between\n * two tensors of size s0 and s1 performed with broadcast.\n *\n * @param s0 A tensor representing a shape\n * @param s1 A tensor representing a shape\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction broadcastArgs_<R extends Rank>(\n  s0: Tensor | TensorLike, s1: Tensor | TensorLike): Tensor<R> {\n  const shape1Input = convertToTensor(s0, 's0', 'broadcastArgs', 'int32');\n  const shape2Input = convertToTensor(s1, 's1', 'broadcastArgs', 'int32');\n\n  if (shape1Input.rank !== 1) {\n    throw new Error(\n      'broadcastArgs(): first input must be a vector (rank=1). ' +\n      `Has rank ${shape1Input.rank}`);\n  }\n\n  if (shape2Input.rank !== 1) {\n    throw new Error(\n      'broadcastArgs(): second input must be a vector (rank=1). ' +\n      `Has rank ${shape2Input.rank}`);\n  }\n\n  const inputs: BroadcastArgsInputs = { s0: shape1Input, s1: shape2Input };\n  return ENGINE.runKernel(BroadcastArgs, inputs as unknown as NamedTensorMap);\n}\n\nexport const broadcastArgs = /* @__PURE__ */ op({ broadcastArgs_ });\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Tile, TileAttrs, TileInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {Rank, ShapeMap, TensorLike} from '../types';\nimport {assertNonNegativeIntegerDimensions} from '../util_base';\n\nimport {clone} from './clone';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Broadcast an array to a compatible shape NumPy-style.\n *\n * The tensor's shape is compared to the broadcast shape from end to beginning.\n * Ones are prepended to the tensor's shape until it has the same length as\n * the broadcast shape. If input.shape[i]==shape[i], the (i+1)-th axis is\n * already broadcast-compatible. If input.shape[i]==1 and shape[i]==N, then\n * the input tensor is tiled N times along that axis (using tf.tile).\n *\n * @param input The tensor that is to be broadcasted.\n * @param shape The input is to be broadcast to this shape.\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction broadcastTo_<R extends Rank>(\n    x: Tensor|TensorLike, shape: ShapeMap[R]): Tensor<R> {\n  let input = convertToTensor(x, 'broadcastTo', 'x');\n  const xShape = input.shape;\n\n  assertNonNegativeIntegerDimensions(shape);\n\n  if (shape.length < input.rank) {\n    throw new Error(`broadcastTo(): shape.length=${shape.length} < input.rank=${\n        input.rank}.`);\n  }\n\n  if (shape.length > input.rank) {\n    const newShape = input.shape.slice();\n    while (newShape.length < shape.length) {\n      newShape.unshift(1);\n    }\n    input = reshape(input, newShape);\n  }\n\n  const inputShape = input.shape;\n  const reps: number[] = Array.from(shape);\n  for (let i = shape.length - 1; i >= 0; i--) {\n    if (inputShape[i] === shape[i]) {\n      reps[i] = 1;\n    } else if (input.shape[i] !== 1) {\n      throw new Error(\n          `broadcastTo(): [${xShape}] cannot be broadcast to [${shape}].`);\n    }\n  }\n  const axes = reps.map((n, i) => n > 1 ? i : -1).filter(i => i >= 0);\n\n  if (axes.length === 0) {\n    return clone(input) as Tensor<R>;\n  }\n\n  // TODO call broadcastTo kernel directly once backends implement broadcstTo\n  const inputs: TileInputs = {x: input};\n  const attrs: TileAttrs = {reps};\n  return ENGINE.runKernel(\n      Tile, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const broadcastTo = /* @__PURE__ */ op({broadcastTo_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Ceil, CeilInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes ceiling of input `tf.Tensor` element-wise: `ceil(x)`\n *\n * ```js\n * const x = tf.tensor1d([.6, 1.1, -3.3]);\n *\n * x.ceil().print();  // or tf.ceil(x)\n * ```\n * @param x The input Tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction ceil_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'ceil', 'float32');\n\n  const inputs: CeilInputs = {x: $x};\n  return ENGINE.runKernel(Ceil, inputs as unknown as NamedTensorMap);\n}\nexport const ceil = /* @__PURE__ */ op({ceil_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Fill, FillAttrs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {DataType, Rank, ShapeMap} from '../types';\nimport {inferDtype} from '../util';\nimport {assertNonNegativeIntegerDimensions} from '../util_base';\n\n/**\n * Creates a `tf.Tensor` filled with a scalar value.\n *\n * ```js\n * tf.fill([2, 2], 4).print();\n * ```\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param value The scalar value to fill the tensor with.\n * @param dtype The type of an element in the resulting tensor. Defaults to\n *     'float32' if the given param value is a number, otherwise 'string'.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction fill<R extends Rank>(\n    shape: ShapeMap[R], value: number|string, dtype?: DataType): Tensor<R> {\n  assertNonNegativeIntegerDimensions(shape);\n\n  dtype = dtype || inferDtype(value);\n  const attrs: FillAttrs = {shape, value, dtype};\n\n  return ENGINE.runKernel(Fill, {}, attrs as unknown as NamedAttrMap);\n}\n\nexport {fill};\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {ClipByValue, ClipByValueAttrs, ClipByValueInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\nimport {fill} from './fill';\n\nimport {op} from './operation';\n\n/**\n * Clips values element-wise. `max(min(x, clipValueMax), clipValueMin)`\n *\n * ```js\n * const x = tf.tensor1d([-1, 2, -3, 4]);\n *\n * x.clipByValue(-2, 3).print();  // or tf.clipByValue(x, -2, 3)\n * ```\n * @param x The input tensor.\n * @param clipValueMin Lower bound of range to be clipped to.\n * @param clipValueMax Upper bound of range to be clipped to.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction clipByValue_<T extends Tensor>(\n    x: T|TensorLike, clipValueMin: number, clipValueMax: number): T {\n  const $x = convertToTensor(x, 'x', 'clipByValue');\n  util.assert(\n      (clipValueMin <= clipValueMax),\n      () => `Error in clip: min (${clipValueMin}) must be ` +\n          `less than or equal to max (${clipValueMax}).`);\n\n  if (clipValueMin === clipValueMax) {\n    return fill($x.shape, clipValueMin, $x.dtype) as T;\n  }\n\n  const inputs: ClipByValueInputs = {x: $x};\n  const attrs: ClipByValueAttrs = {clipValueMin, clipValueMax};\n\n  return ENGINE.runKernel(\n      ClipByValue, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const clipByValue = /* @__PURE__ */ op({clipByValue_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor1D} from '../tensor';\nimport {TensorLike} from '../types';\n\nimport {concat} from './concat';\nimport {op} from './operation';\n\n/**\n * Concatenates a list of`tf.Tensor1D`s along an axis. See `concat` for details.\n *\n * For example, if:\n * A: shape(3) = |r1, g1, b1|\n * B: shape(2) = |r2, g2|\n * C = tf.concat1d([A, B]) == |r1, g1, b1, r2, g2|\n *\n * @param tensors A list of`tf.Tensor`s to concatenate.\n * @return The concatenated array.\n */\nfunction concat1d_(tensors: Array<Tensor1D|TensorLike>): Tensor1D {\n  return concat(tensors, 0 /* axis */);\n}\n\nexport const concat1d = /* @__PURE__ */ op({concat1d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor2D} from '../tensor';\nimport {TensorLike} from '../types';\n\nimport {concat} from './concat';\nimport {op} from './operation';\n\n/**\n * Concatenates a list of`tf.Tensor2D`s along an axis. See `concat` for details.\n *\n * For example, if:\n * A: shape(2, 3) = | r1, g1, b1 |\n *                  | r2, g2, b2 |\n *\n * B: shape(2, 3) = | r3, g3, b3 |\n *                  | r4, g4, b4 |\n *\n * C = tf.concat2d([A, B], axis)\n *\n * if axis = 0:\n * C: shape(4, 3) = | r1, g1, b1 |\n *                  | r2, g2, b2 |\n *                  | r3, g3, b3 |\n *                  | r4, g4, b4 |\n *\n * if axis = 1:\n * C = shape(2, 6) = | r1, g1, b1, r3, g3, b3 |\n *                   | r2, g2, b2, r4, g4, b4 |\n *\n *\n * @param tensors A list of `tf.Tensor`s to concatenate.\n * @param axis The axis to concatenate along.\n * @return The concatenated array.\n */\nfunction concat2d_(\n    tensors: Array<Tensor2D|TensorLike>, axis: number): Tensor2D {\n  return concat(tensors, axis);\n}\n\nexport const concat2d = /* @__PURE__ */ op({concat2d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor3D} from '../tensor';\nimport {TensorLike} from '../types';\n\nimport {concat} from './concat';\nimport {op} from './operation';\n\n/**\n * Concatenates a list of `tf.Tensor3D`s along an axis.\n * See `concat` for details.\n *\n * For example, if:\n * A: shape(2, 1, 3) = | r1, g1, b1 |\n *                     | r2, g2, b2 |\n *\n * B: shape(2, 1, 3) = | r3, g3, b3 |\n *                     | r4, g4, b4 |\n *\n * C = tf.concat3d([A, B], axis)\n *\n * if axis = 0:\n * C: shape(4, 1, 3) = | r1, g1, b1 |\n *                     | r2, g2, b2 |\n *                     | r3, g3, b3 |\n *                     | r4, g4, b4 |\n *\n * if axis = 1:\n * C: shape(2, 2, 3) = | r1, g1, b1, r3, g3, b3 |\n *                     | r2, g2, b2, r4, g4, b4 |\n *\n * if axis = 2:\n * C = shape(2, 1, 6) = | r1, g1, b1, r3, g3, b3 |\n *                      | r2, g2, b2, r4, g4, b4 |\n *\n * @param tensors A list of`tf.Tensor`s to concatenate.\n * @param axis The axis to concate along.\n * @return The concatenated array.\n */\nfunction concat3d_(\n    tensors: Array<Tensor3D|TensorLike>, axis: number): Tensor3D {\n  return concat(tensors, axis);\n}\n\nexport const concat3d = /* @__PURE__ */ op({concat3d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor4D} from '../tensor';\nimport {TensorLike} from '../types';\n\nimport {concat} from './concat';\nimport {op} from './operation';\n\n/**\n * Concatenates a list of `tf.Tensor4D`s along an axis.\n * See `concat` for details.\n *\n * @param tensors A list of `tf.Tensor`s to concatenate.\n * @param axis The axis to concate along.\n * @return The concatenated array.\n */\nfunction concat4d_(\n    tensors: Array<Tensor4D|TensorLike>, axis: number): Tensor4D {\n  return concat(tensors, axis);\n}\n\nexport const concat4d = /* @__PURE__ */ op({concat4d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Conv2D, Conv2DAttrs, Conv2DInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport * as conv_util from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes a 2D convolution over the input x.\n *\n * @param x The input tensor, of rank 4 or rank 3, of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is\n * assumed.\n * @param filter The filter, rank 4, of shape\n *     `[filterHeight, filterWidth, inDepth, outDepth]`.\n * @param strides The strides of the convolution: `[strideHeight,\n * strideWidth]`.\n * @param pad The type of padding algorithm.\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n *   - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dataFormat: An optional string from: \"NHWC\", \"NCHW\". Defaults to\n *     \"NHWC\". Specify the data format of the input and output data. With the\n *     default format \"NHWC\", the data is stored in the order of: [batch,\n *     height, width, channels].\n * @param dilations The dilation rates: `[dilationHeight, dilationWidth]`\n *     in which we sample input values across the height and width dimensions\n *     in atrous convolution. Defaults to `[1, 1]`. If `dilations` is a single\n *     number, then `dilationHeight == dilationWidth`. If it is greater than\n *     1, then all values of `strides` must be 1.\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction conv2d_<T extends Tensor3D|Tensor4D>(\n    x: T|TensorLike, filter: Tensor4D|TensorLike,\n    strides: [number, number]|number,\n    pad: 'valid'|'same'|number|conv_util.ExplicitPadding,\n    dataFormat: 'NHWC'|'NCHW' = 'NHWC',\n    dilations: [number, number]|number = [1, 1],\n    dimRoundingMode?: 'floor'|'round'|'ceil'): T {\n  const $x = convertToTensor(x, 'x', 'conv2d', 'float32');\n  const $filter = convertToTensor(filter, 'filter', 'conv2d', 'float32');\n\n  let x4D = $x as Tensor4D;\n  let reshapedTo4D = false;\n\n  if ($x.rank === 3) {\n    reshapedTo4D = true;\n    x4D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2]]);\n  }\n\n  util.assert(\n      x4D.rank === 4,\n      () => `Error in conv2d: input must be rank 4, but got rank ${x4D.rank}.`);\n  util.assert(\n      $filter.rank === 4,\n      () => `Error in conv2d: filter must be rank 4, but got rank ` +\n          `${$filter.rank}.`);\n  conv_util.checkPadOnDimRoundingMode('conv2d', pad, dimRoundingMode);\n  const inDepth = dataFormat === 'NHWC' ? x4D.shape[3] : x4D.shape[1];\n  util.assert(\n      inDepth === $filter.shape[2],\n      () => `Error in conv2d: depth of input (${inDepth}) must match ` +\n          `input depth for filter ${$filter.shape[2]}.`);\n  util.assert(\n      conv_util.eitherStridesOrDilationsAreOne(strides, dilations),\n      () => 'Error in conv2D: Either strides or dilations must be 1. ' +\n          `Got strides ${strides} and dilations '${dilations}'`);\n  util.assert(\n      conv_util.stridesOrDilationsArePositive(dilations),\n      () => 'Error in conv2D: Dilated rates should be larger than 0.');\n  util.assert(\n      conv_util.stridesOrDilationsArePositive(strides),\n      () => 'Error in conv2D: Strides should be larger than 0.');\n\n  const inputs: Conv2DInputs = {x: x4D, filter: $filter};\n  const attrs:\n      Conv2DAttrs = {strides, pad, dataFormat, dilations, dimRoundingMode};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  Conv2D, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n  return res;\n}\n\nexport const conv2d = /* @__PURE__ */ op({conv2d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor2D, Tensor3D, Tensor4D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {conv2d} from './conv2d';\nimport * as conv_util from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes a 1D convolution over the input x.\n *\n * @param x The input tensor, of rank 3 or rank 2, of shape\n *     `[batch, width, inChannels]`. If rank 2, batch of 1 is assumed.\n * @param filter The filter, rank 3, of shape\n *     `[filterWidth, inDepth, outDepth]`.\n * @param stride The number of entries by which the filter is moved right at\n *     each step.\n * @param pad The type of padding algorithm.\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n *   - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dataFormat An optional string from \"NWC\", \"NCW\". Defaults to \"NWC\",\n *     the data is stored in the order of [batch, in_width, in_channels]. Only\n *     \"NWC\" is currently supported.\n * @param dilation The dilation rate in which we sample input values in\n *     atrous convolution. Defaults to `1`. If it is greater than 1, then\n *     stride must be `1`.\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction conv1d_<T extends Tensor2D|Tensor3D>(\n    x: T|TensorLike, filter: Tensor3D|TensorLike, stride: number,\n    pad: 'valid'|'same'|number|conv_util.ExplicitPadding,\n    dataFormat: 'NWC'|'NCW' = 'NWC', dilation = 1,\n    dimRoundingMode?: 'floor'|'round'|'ceil'): T {\n  const $x = convertToTensor(x, 'x', 'conv1d');\n  const $filter = convertToTensor(filter, 'filter', 'conv1d');\n\n  let x3D = $x as Tensor3D;\n  let reshapedTo3D = false;\n  if ($x.rank === 2) {\n    reshapedTo3D = true;\n    x3D = reshape($x, [1, $x.shape[0], $x.shape[1]]);\n  }\n\n  util.assert(\n      x3D.rank === 3,\n      () => `Error in conv1d: input must be rank 3, but got rank ${x3D.rank}.`);\n  util.assert(\n      $filter.rank === 3,\n      () => `Error in conv1d: filter must be rank 3, but got rank ` +\n          `${$filter.rank}.`);\n  conv_util.checkPadOnDimRoundingMode('conv1d', pad, dimRoundingMode);\n  util.assert(\n      x3D.shape[2] === $filter.shape[1],\n      () => `Error in conv1d: depth of input (${x3D.shape[2]}) must match ` +\n          `input depth for filter ${$filter.shape[1]}.`);\n  util.assert(\n      conv_util.eitherStridesOrDilationsAreOne(stride, dilation),\n      () => 'Error in conv1D: Either stride or dilation must be 1. ' +\n          `Got stride ${stride} and dilation '${dilation}'`);\n  util.assert(\n      conv_util.stridesOrDilationsArePositive(dilation),\n      () => 'Error in conv1D: Dilated rates should be larger than 0.');\n  util.assert(\n      conv_util.stridesOrDilationsArePositive(stride),\n      () => 'Error in conv1D: Stride should be larger than 0.');\n  util.assert(\n      dataFormat === 'NWC',\n      () => `Error in conv1d: got dataFormat of ${\n          dataFormat} but only NWC is currently supported.`);\n\n  const filter4D = reshape(\n      $filter, [1, $filter.shape[0], $filter.shape[1], $filter.shape[2]]);\n  const input4D = reshape(x3D, [x3D.shape[0], 1, x3D.shape[1], x3D.shape[2]]);\n  const strides: [number, number] = [1, stride];\n  const dilations: [number, number] = [1, dilation];\n\n  const conv2dDataFormat = 'NHWC';\n\n  const res = conv2d(\n      (input4D as Tensor4D), (filter4D as Tensor4D), strides, pad,\n      conv2dDataFormat, dilations, dimRoundingMode);\n\n  if (reshapedTo3D) {\n    return reshape(res, [res.shape[2], res.shape[3]]) as T;\n  }\n\n  return reshape(res, [res.shape[0], res.shape[2], res.shape[3]]) as T;\n}\n\nexport const conv1d = /* @__PURE__ */ op({conv1d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Conv2DBackpropInput, Conv2DBackpropInputAttrs, Conv2DBackpropInputInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport * as util from '../util';\n\nimport * as conv_util from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes the derivative of the input of a 2D convolution.\n *\n * @param xShape The shape of the input: [batch, height, width, inDepth].\n * If length of 3, batch of 1 is assumed.\n * @param dy The derivative of the output, of rank 4 or rank 3 of shape\n *   `[batch, outHeight, outWidth, outDepth]`. If rank 3, batch of 1 is\n * assumed.\n * @param filter The filter, rank 4, of shape\n *     `[filterHeight, filterWidth, inDepth, outDepth]`.\n * @param strides The strides of the convolution: `[strideHeight,\n * strideWidth]`.\n * @param pad The type of padding algorithm used:\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n * @param dataFormat: An optional string from: \"NHWC\", \"NCHW\". Defaults to\n *     \"NHWC\". Specify the data format of the input and output data. With the\n *     default format \"NHWC\", the data is stored in the order of: [batch,\n *     height, width, channels].\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n */\nfunction conv2DBackpropInput_<T extends Tensor3D|Tensor4D>(\n    xShape: [number, number, number, number]|[number, number, number], dy: T,\n    filter: Tensor4D, strides: [number, number]|number,\n    pad: 'valid'|'same'|number|conv_util.ExplicitPadding,\n    dataFormat: 'NHWC'|'NCHW' = 'NHWC',\n    dimRoundingMode?: 'floor'|'round'|'ceil'): T {\n  util.assert(\n      xShape.length === dy.rank,\n      () => `Length of inShape ` +\n          `(${xShape.length}) and rank of dy (${dy.rank}) must match`);\n\n  let xShape4D = xShape as [number, number, number, number];\n  let dy4D = dy as Tensor4D;\n  let reshapedTo4D = false;\n  if (dy.rank === 3) {\n    reshapedTo4D = true;\n    dy4D = reshape(dy, [1, dy.shape[0], dy.shape[1], dy.shape[2]]);\n    xShape4D = [1, xShape[0], xShape[1], xShape[2]];\n  }\n\n  util.assert(\n      xShape4D.length === 4,\n      () =>\n          `Error in conv2dDerInput: inShape must be length 4, but got length ` +\n          `${xShape4D.length}.`);\n  util.assert(\n      dy4D.rank === 4,\n      () => `Error in conv2dDerInput: dy must be rank 4, but got ` +\n          `rank ${dy4D.rank}`);\n  util.assert(\n      filter.rank === 4,\n      () => `Error in conv2dDerInput: filter must be rank 4, but got ` +\n          `rank ${filter.rank}`);\n  const inDepth = dataFormat === 'NHWC' ? xShape4D[3] : xShape4D[1];\n  const outDepth = dataFormat === 'NHWC' ? dy4D.shape[3] : dy4D.shape[1];\n  util.assert(\n      inDepth === filter.shape[2],\n      () => `Error in conv2dDerInput: depth of input (${inDepth}) must ` +\n          `match input depth for filter ${filter.shape[2]}.`);\n  util.assert(\n      outDepth === filter.shape[3],\n      () => `Error in conv2dDerInput: depth of output (${outDepth}) must ` +\n          `match output depth for filter ${filter.shape[3]}.`);\n  conv_util.checkPadOnDimRoundingMode('conv2dDerInput', pad, dimRoundingMode);\n  const inputs: Conv2DBackpropInputInputs = {dy: dy4D, filter};\n  const attrs: Conv2DBackpropInputAttrs =\n      {strides, pad, dataFormat, dimRoundingMode, inputShape: xShape4D};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  Conv2DBackpropInput, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n  return res;\n}\n\nexport const conv2DBackpropInput = /* @__PURE__ */ op({conv2DBackpropInput_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {conv2DBackpropInput} from './conv2d_backprop_input';\nimport {ExplicitPadding} from './conv_util';\nimport {op} from './operation';\n\n/**\n * Computes the transposed 2D convolution of an image, also known as a\n * deconvolution.\n *\n * @param x The input image, of rank 4 or rank 3, of shape\n *   `[batch, height, width, inDepth]`. If rank 3, batch of 1 is assumed.\n * @param filter The filter, rank 4, of shape\n *     `[filterHeight, filterWidth, outDepth, inDepth]`.\n *     `inDepth` must match `inDepth` in `x`.\n * @param outputShape Output shape, of rank 4 or rank 3:\n *     `[batch, height, width, outDepth]`. If rank 3, batch of 1 is assumed.\n * @param strides The strides of the original convolution:\n *     `[strideHeight, strideWidth]`.\n * @param pad  The type of padding algorithm used in the non-transpose version\n *    of the op.\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction conv2dTranspose_<T extends Tensor3D|Tensor4D>(\n    x: T|TensorLike, filter: Tensor4D|TensorLike,\n    outputShape: [number, number, number, number]|[number, number, number],\n    strides: [number, number]|number,\n    pad: 'valid'|'same'|number|ExplicitPadding,\n    dimRoundingMode?: 'floor'|'round'|'ceil'): T {\n  const $x = convertToTensor(x, 'x', 'conv2dTranspose');\n  const $filter = convertToTensor(filter, 'filter', 'conv2dTranspose');\n\n  return conv2DBackpropInput(\n      outputShape, $x, $filter, strides, pad, 'NHWC', dimRoundingMode);\n}\n\nexport const conv2dTranspose = /* @__PURE__ */ op({conv2dTranspose_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Conv3D, Conv3DAttrs, Conv3DInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor4D, Tensor5D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {eitherStridesOrDilationsAreOne, stridesOrDilationsArePositive} from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes a 3D convolution over the input x.\n *\n * @param x The input tensor, of rank 5 or rank 4, of shape\n *     `[batch, depth, height, width, channels]`. If rank 4,\n * batch of 1 is assumed.\n * @param filter The filter, rank 5, of shape\n *     `[filterDepth, filterHeight, filterWidth, inChannels, outChannels]`.\n *      inChannels must match between input and filter.\n * @param strides The strides of the convolution: `[strideDepth, strideHeight,\n * strideWidth]`.\n * @param pad The type of padding algorithm.\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n *   - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dataFormat: An optional string from: \"NDHWC\", \"NCDHW\". Defaults to\n *     \"NDHWC\". Specify the data format of the input and output data. With the\n *     default format \"NDHWC\", the data is stored in the order of: [batch,\n *     depth, height, width, channels]. Only \"NDHWC\" is currently supported.\n * @param dilations The dilation rates: `[dilationDepth, dilationHeight,\n *     dilationWidth]` in which we sample input values across the height\n *     and width dimensions in atrous convolution. Defaults to `[1, 1, 1]`.\n *     If `dilations` is a single number, then\n *     `dilationDepth == dilationHeight == dilationWidth`. If it is greater\n *     than 1, then all values of `strides` must be 1.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction conv3d_<T extends Tensor4D|Tensor5D>(\n    x: T|TensorLike, filter: Tensor5D|TensorLike,\n    strides: [number, number, number]|number, pad: 'valid'|'same',\n    dataFormat: 'NDHWC'|'NCDHW' = 'NDHWC',\n    dilations: [number, number, number]|number = [1, 1, 1]): T {\n  const $x = convertToTensor(x, 'x', 'conv3d');\n  const $filter = convertToTensor(filter, 'filter', 'conv3d');\n\n  let x5D = $x as Tensor5D;\n  let reshapedTo5D = false;\n\n  if ($x.rank === 4) {\n    reshapedTo5D = true;\n    x5D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2], $x.shape[3]]);\n  }\n  util.assert(\n      x5D.rank === 5,\n      () => `Error in conv3d: input must be rank 5, but got rank ${x5D.rank}.`);\n  util.assert(\n      $filter.rank === 5,\n      () => `Error in conv3d: filter must be rank 5, but got rank ` +\n          `${$filter.rank}.`);\n  util.assert(\n      x5D.shape[4] === $filter.shape[3],\n      () => `Error in conv3d: depth of input (${x5D.shape[4]}) must match ` +\n          `input depth for filter ${$filter.shape[3]}.`);\n  util.assert(\n      eitherStridesOrDilationsAreOne(strides, dilations),\n      () => 'Error in conv3D: Either strides or dilations must be 1. ' +\n          `Got strides ${strides} and dilations '${dilations}'`);\n  util.assert(\n      dataFormat === 'NDHWC',\n      () => `Error in conv3d: got dataFormat of ${\n          dataFormat} but only NDHWC is currently supported.`);\n  util.assert(\n      stridesOrDilationsArePositive(dilations),\n      () => 'Error in conv3D: Dilated rates should be larger than 0.');\n  util.assert(\n      stridesOrDilationsArePositive(strides),\n      () => 'Error in conv3D: Strides should be larger than 0.');\n\n  const inputs: Conv3DInputs = {x: x5D, filter: $filter};\n\n  const attrs: Conv3DAttrs = {strides, pad, dataFormat, dilations};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  Conv3D, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo5D) {\n    return reshape(\n               res, [res.shape[1], res.shape[2], res.shape[3], res.shape[4]]) as\n        T;\n  }\n  return res;\n}\n\nexport const conv3d = /* @__PURE__ */ op({conv3d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Conv3DBackpropInputV2, Conv3DBackpropInputV2Attrs, Conv3DBackpropInputV2Inputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor4D, Tensor5D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport * as util from '../util';\n\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes the derivative of the input of a 3D convolution.\n *\n * @param xShape The shape of the input: [batch, depth, height, width,\n * in_channels]. If length of 4, batch of 1 is assumed.\n * @param dy The derivative of the output, of rank 5 or rank 4 of shape\n *   `[batch, outDepth, outHeight, outWidth, in_channels]`.\n * If rank 4, batch of 1 is assumed.\n * @param filter The filter, rank 5, of shape\n *     `[filterDepth, filterHeight, filterWidth, inDepth, outDepth]`.\n * @param strides The strides of the convolution: `[strideDepth, strideHeight,\n * strideWidth]`.\n * @param pad The type of padding algorithm used:\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n */\nfunction conv3DBackpropInput_<T extends Tensor4D|Tensor5D>(\n    xShape:\n        [number, number, number, number,\n         number]|[number, number, number, number],\n    dy: T, filter: Tensor5D, strides: [number, number, number]|number,\n    pad: 'valid'|'same'): T {\n  util.assert(\n      xShape.length === dy.rank,\n      () => `Length of inShape ` +\n          `(${xShape.length}) and rank of dy (${dy.rank}) must match`);\n\n  let xShape5D = xShape as [number, number, number, number, number];\n  let dy5D = dy as Tensor5D;\n  let reshapedTo5D = false;\n  if (dy.rank === 4) {\n    reshapedTo5D = true;\n    dy5D = reshape(dy, [1, dy.shape[0], dy.shape[1], dy.shape[2], dy.shape[3]]);\n    xShape5D = [1, xShape[0], xShape[1], xShape[2], xShape[3]];\n  }\n\n  const inDepth = xShape5D[4];\n  const outDepth = dy5D.shape[4];\n  util.assert(\n      xShape5D.length === 5,\n      () =>\n          `Error in conv3dDerInput: inShape must be length 5, but got length ` +\n          `${xShape5D.length}.`);\n  util.assert(\n      dy5D.rank === 5,\n      () => `Error in conv3dDerInput: dy must be rank 5, but got ` +\n          `rank ${dy5D.rank}`);\n  util.assert(\n      filter.rank === 5,\n      () => `Error in conv3dDerInput: filter must be rank 5, but got ` +\n          `rank ${filter.rank}`);\n  util.assert(\n      inDepth === filter.shape[3],\n      () => `Error in conv3dDerInput: depth of input (${inDepth}) must ` +\n          `match input depth for filter ${filter.shape[3]}.`);\n  util.assert(\n      outDepth === filter.shape[4],\n      () => `Error in conv3dDerInput: depth of output (${outDepth}) must ` +\n          `match output depth for filter ${filter.shape[4]}.`);\n\n  const inputs: Conv3DBackpropInputV2Inputs = {dy: dy5D, filter};\n\n  const attrs:\n      Conv3DBackpropInputV2Attrs = {pad, strides, inputShape: xShape5D};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  Conv3DBackpropInputV2, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo5D) {\n    return reshape(\n               res, [res.shape[1], res.shape[2], res.shape[3], res.shape[4]]) as\n        T;\n  }\n  return res;\n}\n\nexport const conv3DBackpropInput = /* @__PURE__ */ op({conv3DBackpropInput_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor4D, Tensor5D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {conv3DBackpropInput} from './conv3d_backprop_input';\nimport {op} from './operation';\n\n/**\n * Computes the transposed 3D convolution of a volume, also known as a\n * deconvolution.\n *\n * @param x The input image, of rank 5 or rank 4, of shape\n *   `[batch, depth, height, width, inDepth]`. If rank 4, batch of 1 is assumed.\n * @param filter The filter, rank 4, of shape\n *     `[depth, filterHeight, filterWidth, outDepth, inDepth]`.\n *     `inDepth` must match `inDepth` in `x`.\n * @param outputShape Output shape, of rank 5 or rank 4:\n *     `[batch, depth, height, width, outDepth]`. If rank 3, batch of 1 is\n *    assumed.\n * @param strides The strides of the original convolution:\n *     `[strideDepth, strideHeight, strideWidth]`.\n * @param pad  The type of padding algorithm used in the non-transpose version\n *    of the op.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction conv3dTranspose_<T extends Tensor4D|Tensor5D>(\n    x: T|TensorLike, filter: Tensor5D|TensorLike,\n    outputShape:\n        [number, number, number, number,\n         number]|[number, number, number, number],\n    strides: [number, number, number]|number, pad: 'valid'|'same'): T {\n  const $x = convertToTensor(x, 'x', 'conv3dTranspose');\n  const $filter = convertToTensor(filter, 'filter', 'conv3dTranspose');\n\n  return conv3DBackpropInput(outputShape, $x, $filter, strides, pad);\n}\n\nexport const conv3dTranspose = /* @__PURE__ */ op({conv3dTranspose_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Cos, CosInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes cos of the input `tf.Tensor` element-wise: `cos(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, Math.PI / 2, Math.PI * 3 / 4]);\n *\n * x.cos().print();  // or tf.cos(x)\n * ```\n * @param x The input tensor. Must be float32 type.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction cos_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'cos', 'float32');\n\n  const inputs: CosInputs = {x: $x};\n\n  return ENGINE.runKernel(Cos, inputs as unknown as NamedTensorMap);\n}\nexport const cos = /* @__PURE__ */ op({cos_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Cosh, CoshInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes hyperbolic cos of the input `tf.Tensor` element-wise: `cosh(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, 1, -1, .7]);\n *\n * x.cosh().print();  // or tf.cosh(x)\n * ```\n * @param x The input tensor. Must be float32 type.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction cosh_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'cosh', 'float32');\n  const inputs: CoshInputs = {x: $x};\n\n  return ENGINE.runKernel(Cosh, inputs as unknown as NamedTensorMap);\n}\nexport const cosh = /* @__PURE__ */ op({cosh_});\n", "/**\n * @license\n * Copyright 2022 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the 'License');\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an 'AS IS' BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport { ENGINE } from '../engine';\nimport { Cumprod, CumprodAttrs, CumprodInputs } from '../kernel_names';\nimport { NamedAttrMap } from '../kernel_registry';\nimport { Tensor } from '../tensor';\nimport { NamedTensorMap } from '../tensor_types';\nimport { convertToTensor } from '../tensor_util_env';\nimport { TensorLike } from '../types';\n\nimport { op } from './operation';\n\n/**\n * Computes the cumulative product of a `tf.Tensor` along `axis`.\n *\n * ```js\n * const x = tf.tensor([1, 2, 3, 4]);\n * x.cumprod().print();\n * ```\n * ```js\n * const x = tf.tensor([[1, 2], [3, 4]]);\n * x.cumprod().print();\n * ```\n *\n * @param x The input tensor to cumulatively multiply.\n * @param axis The axis along which to multiply. Optional. Defaults to 0.\n * @param exclusive Whether to perform exclusive cumulative product. Optional.\n *     Defaults to false. If set to true then the product of each tensor entry\n *     does not include its own value, but only the values previous to it\n *     along the specified axis.\n * @param reverse Whether to multiply in the opposite direction. Optional.\n *     Defaults to false.\n *\n * @doc {heading: 'Operations', subheading: 'Scan'}\n */\nfunction cumprod_<T extends Tensor>(\n  x: Tensor | TensorLike,\n  axis = 0,\n  exclusive = false,\n  reverse = false\n): T {\n  const $x = convertToTensor(x, 'x', 'cumprod');\n\n  const inputs: CumprodInputs = { x: $x };\n  const attrs: CumprodAttrs = { axis, exclusive, reverse };\n\n  return ENGINE.runKernel(\n    Cumprod,\n    inputs as unknown as NamedTensorMap,\n    attrs as unknown as NamedAttrMap\n  );\n}\n\nexport const cumprod = /* @__PURE__ */ op({ cumprod_ });\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Cumsum, CumsumAttrs, CumsumInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the cumulative sum of a `tf.Tensor` along `axis`.\n *\n * ```js\n * const x = tf.tensor([1, 2, 3, 4]);\n * x.cumsum().print();\n * ```\n * ```js\n * const x = tf.tensor([[1, 2], [3, 4]]);\n * x.cumsum().print();\n * ```\n *\n * @param x The input tensor to be summed.\n * @param axis The axis along which to sum. Optional. Defaults to 0.\n * @param exclusive Whether to perform exclusive cumulative sum. Optional.\n *     Defaults to false. If set to true then the sum of each tensor entry\n *     does not include its own value, but only the values previous to it\n *     along the specified axis.\n * @param reverse Whether to sum in the opposite direction. Optional.\n *     Defaults to false.\n *\n * @doc {heading: 'Operations', subheading: 'Scan'}\n */\nfunction cumsum_<T extends Tensor>(\n    x: Tensor|TensorLike, axis = 0, exclusive = false, reverse = false): T {\n  const $x = convertToTensor(x, 'x', 'cumsum');\n\n  const inputs: CumsumInputs = {x: $x};\n  const attrs: CumsumAttrs = {axis, exclusive, reverse};\n\n  return ENGINE.runKernel(\n      Cumsum, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const cumsum = /* @__PURE__ */ op({cumsum_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {DenseBincount, DenseBincountAttrs, DenseBincountInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor1D, Tensor2D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Outputs a vector with length `size` and the same dtype as `weights`.\n *\n * If `weights` are empty, then index `i` stores the number of times the value\n * `i` is counted in `x`. If `weights` are non-empty, then index `i` stores the\n * sum of the value in `weights` at each index where the corresponding value in\n * `x` is `i`.\n *\n * Values in `x` outside of the range [0, size) are ignored.\n *\n * @param x The input int tensor, rank 1 or rank 2.\n * @param weights The weights tensor, must have the same shape as x, or a\n *     length-0 Tensor, in which case it acts as all weights equal to 1.\n * @param size Non-negative integer.\n * @param binaryOutput Optional. Whether the kernel should count the appearance\n *     or number of occurrences. Defaults to False.\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction denseBincount_<T extends Tensor1D|Tensor2D>(\n    x: T|TensorLike, weights: T|TensorLike, size: number,\n    binaryOutput = false): T {\n  const $x = convertToTensor(x, 'x', 'denseBincount');\n  const $weights = convertToTensor(weights, 'weights', 'denseBincount');\n\n  util.assert(\n      $x.dtype === 'int32',\n      () => `Error in denseBincount: input ` +\n          `dtype must be int32, but got ${$x.dtype}`);\n  util.assert(\n      $x.rank <= 2,\n      () => `Error in denseBincount: input must be at most rank 2, but got ` +\n          `rank ${$x.rank}.`);\n  util.assert(size >= 0, () => `size must be non-negative, but got ${size}.`);\n  util.assert(\n      $weights.size === $x.size || $weights.size === 0,\n      () =>\n          `Error in denseBincount: weights must have the same shape as x or ` +\n          `0-length, but got x shape: ${$x.shape}, weights shape: ` +\n          `${$weights.shape}.`);\n\n  const inputs: DenseBincountInputs = {x: $x, weights: $weights};\n  const attrs: DenseBincountAttrs = {size, binaryOutput};\n\n  return ENGINE.runKernel(\n      DenseBincount, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const denseBincount = /* @__PURE__ */ op({denseBincount_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {DepthToSpace, DepthToSpaceAttrs, DepthToSpaceInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike4D} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Rearranges data from depth into blocks of spatial data. More specifically,\n * this op outputs a copy of the input tensor where values from the `depth`\n * dimension are moved in spatial blocks to the `height` and `width` dimensions.\n * The attr `blockSize` indicates the input block size and how the data is\n * moved.\n *\n *  - Chunks of data of size `blockSize * blockSize` from depth are rearranged\n * into non-overlapping blocks of size `blockSize x blockSize`\n *\n *  - The width the output tensor is `inputWidth * blockSize`, whereas the\n * height is `inputHeight * blockSize`\n *\n *  - The Y, X coordinates within each block of the output image are determined\n * by the high order component of the input channel index\n *\n *  - The depth of the input tensor must be divisible by `blockSize *\n * blockSize`\n *\n * The `dataFormat` attr specifies the layout of the input and output tensors\n * with the following options: \"NHWC\": [ `batch, height, width, channels` ]\n * \"NCHW\": [ `batch, channels, height, width` ]\n *\n * ```js\n * const x = tf.tensor4d([1, 2, 3, 4], [1, 1, 1, 4]);\n * const blockSize = 2;\n * const dataFormat = \"NHWC\";\n *\n * tf.depthToSpace(x, blockSize, dataFormat).print();\n * ```\n *\n * @param x The input tensor of rank 4\n * @param blockSIze  An `int` that is `>= 2`. The size of the spatial block\n * @param dataFormat An optional string from: \"NHWC\", \"NCHW\". Defaults to \"NHWC\"\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction depthToSpace_(\n    x: Tensor4D|TensorLike4D, blockSize: number,\n    dataFormat: 'NHWC'|'NCHW' = 'NHWC'): Tensor4D {\n  const $x = convertToTensor(x, 'x', 'depthToSpace', 'float32') as Tensor4D;\n\n  const inputHeight = (dataFormat === 'NHWC') ? $x.shape[1] : $x.shape[2];\n  const inputWidth = (dataFormat === 'NHWC') ? $x.shape[2] : $x.shape[3];\n  const inputDepth = (dataFormat === 'NHWC') ? $x.shape[3] : $x.shape[1];\n\n  util.assert(\n      blockSize > 1,\n      () => `blockSize should be > 1 for depthToSpace, but was: ${blockSize}`);\n\n  util.assert(\n      inputHeight * blockSize >= 0,\n      () => `Negative dimension size caused by overflow when multiplying\n    ${inputHeight} and ${blockSize}  for depthToSpace with input shape\n    ${$x.shape}`);\n\n  util.assert(\n      inputWidth * blockSize >= 0,\n      () => `Negative dimension size caused by overflow when multiplying\n    ${inputWidth} and ${blockSize} for depthToSpace with input shape\n        ${$x.shape}`);\n\n  util.assert(\n      (inputDepth % (blockSize * blockSize) === 0),\n      () => `Dimension size must be evenly divisible by ${\n          blockSize * blockSize} but is ${\n          inputDepth} for depthToSpace with input shape ${$x.shape}`);\n\n  const inputs: DepthToSpaceInputs = {x: $x};\n  const attrs: DepthToSpaceAttrs = {blockSize, dataFormat};\n\n  return ENGINE.runKernel(\n      DepthToSpace, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const depthToSpace = /* @__PURE__ */ op({depthToSpace_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {DepthwiseConv2dNative, DepthwiseConv2dNativeAttrs, DepthwiseConv2dNativeInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport * as conv_util from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Depthwise 2D convolution.\n *\n * Given a 4D `input` array and a `filter` array of shape\n * `[filterHeight, filterWidth, inChannels, channelMultiplier]` containing\n * `inChannels` convolutional filters of depth 1, this op applies a\n * different filter to each input channel (expanding from 1 channel to\n * `channelMultiplier` channels for each), then concatenates the results\n * together. The output has `inChannels * channelMultiplier` channels.\n *\n * See\n * [https://www.tensorflow.org/api_docs/python/tf/nn/depthwise_conv2d](\n *     https://www.tensorflow.org/api_docs/python/tf/nn/depthwise_conv2d)\n * for more details.\n *\n * @param x The input tensor, of rank 4 or rank 3, of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is\n * assumed.\n * @param filter The filter tensor, rank 4, of shape\n *     `[filterHeight, filterWidth, inChannels, channelMultiplier]`.\n * @param strides The strides of the convolution: `[strideHeight,\n * strideWidth]`. If strides is a single number, then `strideHeight ==\n * strideWidth`.\n * @param pad The type of padding algorithm.\n *   - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *   - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n *   - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dilations The dilation rates: `[dilationHeight, dilationWidth]`\n *     in which we sample input values across the height and width dimensions\n *     in atrous convolution. Defaults to `[1, 1]`. If `rate` is a single\n *     number, then `dilationHeight == dilationWidth`. If it is greater than\n *     1, then all values of `strides` must be 1.\n * @param dataFormat: An optional string from: \"NHWC\", \"NCHW\". Defaults to\n *     \"NHWC\". Specify the data format of the input and output data. With the\n *     default format \"NHWC\", the data is stored in the order of: [batch,\n *     height, width, channels]. Only \"NHWC\" is currently supported.\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction depthwiseConv2d_<T extends Tensor3D|Tensor4D>(\n    x: T|TensorLike, filter: Tensor4D|TensorLike,\n    strides: [number, number]|number,\n    pad: 'valid'|'same'|number|conv_util.ExplicitPadding,\n    dataFormat: 'NHWC'|'NCHW' = 'NHWC',\n    dilations: [number, number]|number = [1, 1],\n    dimRoundingMode?: 'floor'|'round'|'ceil'): T {\n  const $x = convertToTensor(x, 'x', 'depthwiseConv2d', 'float32');\n  const $filter =\n      convertToTensor(filter, 'filter', 'depthwiseConv2d', 'float32');\n\n  let x4D = $x as Tensor4D;\n  let reshapedTo4D = false;\n  if ($x.rank === 3) {\n    reshapedTo4D = true;\n    x4D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2]]);\n  }\n  util.assert(\n      x4D.rank === 4,\n      () => `Error in depthwiseConv2d: input must be rank 4, but got ` +\n          `rank ${x4D.rank}.`);\n  util.assert(\n      $filter.rank === 4,\n      () => `Error in depthwiseConv2d: filter must be rank 4, but got rank ` +\n          `${$filter.rank}.`);\n  const inChannels = dataFormat === 'NHWC' ? x4D.shape[3] : x4D.shape[1];\n  util.assert(\n      inChannels === $filter.shape[2],\n      () => `Error in depthwiseConv2d: number of input channels ` +\n          `(${inChannels}) must match the inChannels dimension in ` +\n          `filter ${$filter.shape[2]}.`);\n  conv_util.checkPadOnDimRoundingMode('depthwiseConv2d', pad, dimRoundingMode);\n  const inputs: DepthwiseConv2dNativeInputs = {x: x4D, filter: $filter};\n  const attrs: DepthwiseConv2dNativeAttrs =\n      {strides, pad, dataFormat, dilations, dimRoundingMode};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  DepthwiseConv2dNative, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n  return res;\n}\n\nexport const depthwiseConv2d = /* @__PURE__ */ op({depthwiseConv2d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Diag, DiagInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\n\nimport {op} from './operation';\n\n/**\n * Returns a diagonal tensor with given diagonal values.\n *\n * Given a diagonal, this operation returns a tensor with the diagonal and\n * everything else padded with zeros.\n *\n * Assume the input has dimensions `[D1,..., Dk]`, then the output is a tensor\n * of rank 2k with dimensions `[D1,..., Dk, D1,..., Dk]`\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n *\n * tf.diag(x).print()\n * ```\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4, 5, 6, 7, 8], [4, 2])\n *\n * tf.diag(x).print()\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction diag_(x: Tensor): Tensor {\n  const $x = convertToTensor(x, 'x', 'diag');\n\n  const inputs: DiagInputs = {x: $x};\n\n  return ENGINE.runKernel(Diag, inputs as unknown as NamedTensorMap);\n}\n\nexport const diag = /* @__PURE__ */ op({diag_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Dilation2D, Dilation2DAttrs, Dilation2DInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes the grayscale dilation over the input `x`.\n *\n * @param x The input tensor, rank 3 or rank 4 of shape\n *     `[batch, height, width, depth]`. If rank 3, batch of 1 is assumed.\n * @param filter The filter tensor, rank 3, of shape\n *     `[filterHeight, filterWidth, depth]`.\n * @param strides The strides of the sliding window for each dimension of the\n *     input tensor: `[strideHeight, strideWidth]`.\n *     If `strides` is a single number,\n *     then `strideHeight == strideWidth`.\n * @param pad The type of padding algorithm.\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1*1x1.\n *    - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dataFormat Specify the data format of the input and output data.\n *      Defaults to 'NHWC'. Only 'NHWC' is currently supported. With the\n *      default format \"NHWC\", the data is stored in the order of: [batch,\n *      height, width, channels].\n * @param dilations The dilation rates: `[dilationHeight, dilationWidth]`\n *     in which we sample input values across the height and width dimensions\n *     for atrous morphological dilation. Defaults to `[1, 1]`. If `dilations`\n *     is a single number, then `dilationHeight == dilationWidth`. If it is\n *     greater than 1, then all values of `strides` must be 1.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction dilation2d_<T extends Tensor3D|Tensor4D>(\n    x: T|TensorLike, filter: Tensor3D|TensorLike,\n    strides: [number, number]|number, pad: 'valid'|'same',\n    dilations: [number, number]|number = [1, 1],\n    dataFormat: 'NHWC' = 'NHWC'): T {\n  const $x = convertToTensor(x, 'x', 'dilation2d');\n  const $filter = convertToTensor(filter, 'filter', 'dilation2d');\n\n  util.assert(\n      $x.rank === 3 || $x.rank === 4,\n      () => `Error in dilation2d: input must be rank 3 or 4, but got rank ` +\n          `${$x.rank}.`);\n  util.assert(\n      $filter.rank === 3,\n      () => `Error in dilation2d: filter must be rank 3, but got rank ` +\n          `${$filter.rank}.`);\n  util.assert(\n      dataFormat === 'NHWC',\n      () => `Error in dilation2d: Only NHWC is currently supported, ` +\n          `but got dataFormat of ${dataFormat}`);\n\n  let x4D = $x as Tensor4D;\n  let reshapedTo4D = false;\n\n  if ($x.rank === 3) {\n    x4D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2]]);\n    reshapedTo4D = true;\n  }\n\n  util.assert(\n      x4D.shape[3] === $filter.shape[2],\n      () => `Error in dilation2d:  input and filter must have the same depth: ${\n          x4D.shape[3]} vs ${$filter.shape[2]}`);\n\n  const inputs: Dilation2DInputs = {x: x4D, filter: $filter};\n  const attrs: Dilation2DAttrs = {strides, pad, dilations};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  Dilation2D, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n\n  return res;\n}\n\nexport const dilation2d = /* @__PURE__ */ op({dilation2d_});\n", "/**\n * @license\n * Copyright 2017 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/**\n * Returns the dimensions in the input shape that are broadcasted to\n * produce the provided output shape.\n *\n * The returned dimensions are 0-indexed and sorted. An example:\n * inShape = [4, 1, 3]\n * outShape = [5, 4, 3, 3]\n * result = [1]. Dimension 1 (2nd dimension of input) gets broadcasted 1 => 3.\n */\nexport function getBroadcastDims(\n    inShape: number[], outShape: number[]): number[] {\n  const inRank = inShape.length;\n  const dims: number[] = [];\n  for (let i = 0; i < inRank; i++) {\n    const dim = inRank - 1 - i;\n    const a = inShape[dim] || 1;\n    const b = outShape[outShape.length - 1 - i] || 1;\n    if (b > 1 && a === 1) {\n      dims.unshift(dim);\n    }\n  }\n  return dims;\n}\n\n/**\n * Returns the axes in the output space that should be reduced to produce\n * the input space.\n */\nexport function getReductionAxes(\n    inShape: number[], outShape: number[]): number[] {\n  const result: number[] = [];\n  for (let i = 0; i < outShape.length; i++) {\n    const inDim = inShape[inShape.length - i - 1];\n    const outAxis = outShape.length - i - 1;\n    const outDim = outShape[outAxis];\n    if (inDim == null || (inDim === 1 && outDim > 1)) {\n      result.unshift(outAxis);\n    }\n  }\n  return result;\n}\n\nexport function assertAndGetBroadcastShape(\n    shapeA: number[], shapeB: number[]): number[] {\n  const l = Math.max(shapeA.length, shapeB.length);\n  const result = new Array(l);\n\n  for (let i = 0; i < l; i++) {\n    let a = shapeA[shapeA.length - i - 1];\n    if (a == null) {\n      a = 1;\n    }\n    let b = shapeB[shapeB.length - i - 1];\n    if (b == null) {\n      b = 1;\n    }\n    if (a === 1) {\n      result[l - i - 1] = b;\n    } else if (b === 1) {\n      result[l - i - 1] = a;\n    } else if (a !== b) {\n      const errMsg = `Operands could not be broadcast together with shapes ` +\n          `${shapeA} and ${shapeB}.`;\n      throw Error(errMsg);\n    } else {\n      result[l - i - 1] = a;\n    }\n  }\n  return result;\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Equal, EqualInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {op} from './operation';\n\n/**\n * Returns the truth value of (a == b) element-wise. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3]);\n * const b = tf.tensor1d([2, 2, 2]);\n *\n * a.equal(b).print();\n * ```\n *\n * @param a The first input tensor.\n * @param b The second input tensor. Must have the same dtype as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction equal_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'equal', 'string_or_numeric');\n  let $b = convertToTensor(b, 'b', 'equal', 'string_or_numeric');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: EqualInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(Equal, inputs as unknown as NamedTensorMap);\n}\n\nexport const equal = /* @__PURE__ */ op({equal_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Select, SelectInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {broadcastTo} from './broadcast_to';\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {op} from './operation';\n\n/**\n * Returns the elements, either `a` or `b` depending on the `condition`.\n *\n * If the condition is true, select from `a`, otherwise select from `b`.\n *\n * ```js\n * const cond = tf.tensor1d([false, false, true], 'bool');\n * const a = tf.tensor1d([1 , 2, 3]);\n * const b = tf.tensor1d([-1, -2, -3]);\n *\n * a.where(cond, b).print();\n * ```\n *\n * @param condition The input condition. Must be of dtype bool.\n * @param a If `condition` is rank 1, `a` may have a higher rank but\n *     its first dimension must match the size of `condition`.\n * @param b A tensor with the same dtype as `a` and with shape that is\n *     compatible with `a`.\n * @return A tensor with same dtype as `a` and `b`, and shape that is\n *     broadcastable from `a` and `b`.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction where_<T extends Tensor>(\n    condition: Tensor|TensorLike, a: T|TensorLike, b: T|TensorLike): T {\n  const $a = convertToTensor(a, 'a', 'where');\n  const $b = convertToTensor(b, 'b', 'where');\n  const $condition = convertToTensor(condition, 'condition', 'where', 'bool');\n  // TODO: move this logic to forward function when the broadcastTo op is\n  // implemented in WASM.\n  // Find the broadcastable shape for $condition, $a, and $b.\n  const broadcastShape = assertAndGetBroadcastShape(\n      assertAndGetBroadcastShape($condition.shape, $a.shape), $b.shape);\n  const $broadcastedCondition = broadcastTo($condition, broadcastShape);\n  const $broadcastedA = broadcastTo($a, broadcastShape);\n  const $broadcastedB = broadcastTo($b, broadcastShape);\n\n  const inputs: SelectInputs = {\n    condition: $broadcastedCondition,\n    t: $broadcastedA,\n    e: $broadcastedB\n  };\n  return ENGINE.runKernel(Select, inputs as unknown as NamedTensorMap);\n}\n\nexport const where = /* @__PURE__ */ op({where_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {ZerosLike, ZerosLikeInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Creates a `tf.Tensor` with all elements set to 0 with the same shape as the\n * given tensor.\n *\n * ```js\n * const x = tf.tensor([1, 2]);\n * tf.zerosLike(x).print();\n * ```\n *\n * @param x The tensor of required shape.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction zerosLike_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'zerosLike');\n  const inputs: ZerosLikeInputs = {x: $x};\n  return ENGINE.runKernel(ZerosLike, inputs as unknown as NamedTensorMap);\n}\nexport const zerosLike = /* @__PURE__ */ op({zerosLike_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {div} from './div';\nimport {equal} from './equal';\nimport {op} from './operation';\nimport {where} from './where';\nimport {zerosLike} from './zeros_like';\n\n/**\n * Divides two `tf.Tensor`s element-wise, A / B. Supports broadcasting. Return 0\n * if denominator is 0.\n *\n *\n * ```js\n * const a = tf.tensor1d([1, 4, 9, 16]);\n * const b = tf.tensor1d([1, 2, 3, 4]);\n * const c = tf.tensor1d([0, 0, 0, 0]);\n *\n * a.divNoNan(b).print();  // or tf.divNoNan(a, b)\n * a.divNoNan(c).print();  // or tf.divNoNan(a, c)\n * ```\n *\n * ```js\n * // Broadcast div a with b.\n * const a = tf.tensor1d([2, 4, 6, 8]);\n * const b = tf.scalar(2);\n * const c = tf.scalar(0);\n *\n * a.divNoNan(b).print();  // or tf.divNoNan(a, b)\n * a.divNoNan(c).print();  // or tf.divNoNan(a, c)\n * ```\n *\n * @param a The first tensor as the numerator.\n * @param b The second tensor as the denominator. Must have the same dtype as\n * `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction divNoNan_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  // TODO: Make this into its own kernel.\n  let $a = convertToTensor(a, 'a', 'div');\n  let $b = convertToTensor(b, 'b', 'div');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  const divResult = div($a, $b);\n  const zeros = zerosLike(divResult);\n  const bEqualsZero = equal($b, zeros);\n  return where(bEqualsZero, zeros, divResult) as T;\n}\n\nexport const divNoNan = /* @__PURE__ */ op({divNoNan_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor,} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {matMul} from './mat_mul';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes the dot product of two matrices and/or vectors, `t1` and `t2`.\n *\n * ```js\n * const a = tf.tensor1d([1, 2]);\n * const b = tf.tensor2d([[1, 2], [3, 4]]);\n * const c = tf.tensor2d([[1, 2, 3], [4, 5, 6]]);\n *\n * a.dot(b).print();  // or tf.dot(a, b)\n * b.dot(a).print();\n * b.dot(c).print();\n * ```\n * @param t1 The first tensor in the dot operation.\n * @param t2 The second tensor in the dot operation.\n *\n * @doc {heading: 'Operations', subheading: 'Matrices'}\n */\nfunction dot_(t1: Tensor|TensorLike, t2: Tensor|TensorLike): Tensor {\n  const $t1 = convertToTensor(t1, 't1', 'dot');\n  const $t2 = convertToTensor(t2, 't2', 'dot');\n\n  util.assert(\n      ($t1.rank === 1 || $t1.rank === 2) && ($t2.rank === 1 || $t2.rank === 2),\n      () => `Error in dot: inputs must all be rank 1 or 2, but got ranks ` +\n          `${$t1.rank} and ${$t2.rank}.`);\n\n  const t1Inner = ($t1.rank === 1 ? $t1.size : $t1.shape[1]);\n  const t2Inner = ($t2.rank === 1 ? $t2.size : $t2.shape[0]);\n\n  util.assert(\n      t1Inner === t2Inner,\n      () => `Error in dot: inner dimensions of inputs must match, but got ` +\n          `${t1Inner} and ${t2Inner}.`);\n\n  if ($t1.rank === 1 && $t2.rank === 1) {\n    const t12D = reshape($t1, [1, -1]);\n    const t22D = reshape($t2, [-1, 1]);\n    const t1t2 = matMul(t12D, t22D);\n    return reshape(t1t2, []);\n  } else if ($t1.rank === 1 && $t2.rank === 2) {\n    const t12D = reshape($t1, [1, -1]);\n    const t22D = reshape($t2, [$t2.shape[0], $t2.shape[1]]);\n    const t1t2 = matMul(t12D, t22D);\n    return reshape(t1t2, [t1t2.size]);\n  } else if ($t1.rank === 2 && $t2.rank === 1) {\n    const t22D = reshape($t2, [-1, 1]);\n    const t1t2 = matMul($t1, t22D);\n    return reshape(t1t2, [t1t2.size]);\n  } else {\n    const t22D = reshape($t2, [$t2.shape[0], $t2.shape[1]]);\n    const t1t2 = matMul($t1, t22D);\n    return t1t2;\n  }\n}\n\nexport const dot = /* @__PURE__ */ op({dot_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Einsum, EinsumAttrs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\n\nimport {op} from './operation';\n\n/**\n * Tensor contraction over specified indices and outer product.\n *\n * `einsum` allows defining Tensors by defining their element-wise computation.\n * This computation is based on\n * [Einstein summation](https://en.wikipedia.org/wiki/Einstein_notation).\n *\n * Some special cases include:\n *\n * Matrix multiplication:\n * ```js\n * const x = tf.tensor2d([[1, 2, 3], [4, 5, 6]]);\n * const y = tf.tensor2d([[0, 1], [2, 3], [4, 5]]);\n * x.print();\n * y.print();\n * tf.einsum('ij,jk->ik', x, y).print();\n * ```\n *\n * Dot product:\n * ```js\n * const x = tf.tensor1d([1, 2, 3]);\n * const y = tf.tensor1d([0, 1, 2]);\n * x.print();\n * y.print();\n * tf.einsum('i,i->', x, y).print();\n * ```\n *\n * Batch dot product:\n * ```js\n * const x = tf.tensor2d([[1, 2, 3], [4, 5, 6]]);\n * const y = tf.tensor2d([[0, 1, 2], [3, 4, 5]]);\n * x.print();\n * y.print();\n * tf.einsum('bi,bi->b', x, y).print();\n * ```\n *\n * Outer prouduct:\n * ```js\n * const x = tf.tensor1d([1, 3, 5]);\n * const y = tf.tensor1d([2, 4, 6]);\n * x.print();\n * y.print();\n * tf.einsum('i,j->ij', x, y).print();\n * ```\n *\n * Matrix transpose:\n * ```js\n * const x = tf.tensor2d([[1, 2], [3, 4]]);\n * x.print();\n * tf.einsum('ij->ji', x).print();\n * ```\n *\n * Batch matrix transpose:\n * ```js\n * const x = tf.tensor3d([[[1, 2], [3, 4]], [[-1, -2], [-3, -4]]]);\n * x.print();\n * tf.einsum('bij->bji', x).print();\n * ```\n *\n * Limitations:\n *\n * This implementation of einsum has the following limitations:\n *\n * - Does not support >2 input tensors.\n * - Does not support duplicate axes for any given input tensor. E.g., equation\n *   'ii->' is not supported.\n * - The `...` notation is not supported.\n *\n * @param equation a string describing the contraction, in the same format as\n * [numpy.einsum](https://numpy.org/doc/stable/reference/generated/numpy.einsum.html).\n * @param tensors the input(s) to contract (each one a Tensor), whose shapes\n *     should be consistent with equation.\n * @returns The output tensor.\n *\n * @doc {heading: 'Tensors', subheading: 'Matrices'}\n */\nexport function einsum_(equation: string, ...tensors: Tensor[]): Tensor {\n  const $tensors =\n      tensors.map((t, i) => convertToTensor(t, `tensors${i}`, 'einsum'));\n  const attrs: EinsumAttrs = {equation};\n  return ENGINE.runKernel(\n      Einsum, $tensors as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const einsum = /* @__PURE__ */ op({einsum_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Elu, EluInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes exponential linear element-wise: `x > 0 ? x : (e ^ x) - 1`.\n *\n * ```js\n * const x = tf.tensor1d([-1, 1, -3, 2]);\n *\n * x.elu().print();  // or tf.elu(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction elu_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'elu', 'float32');\n\n  const inputs: EluInputs = {x: $x};\n\n  return ENGINE.runKernel(Elu, inputs as unknown as NamedTensorMap);\n}\n\nexport const elu = /* @__PURE__ */ op({elu_});\n", "/**\n * @license\n * Copyright 2023 Google LLC.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {Rank, ShapeMap} from '../types';\nimport {arraysEqualWithNull} from '../util_base';\n\nimport {op} from './operation';\n\n/**\n * Checks the input tensor mathes the given shape.\n *\n * Given an input tensor, returns a new tensor with the same values as the\n * input tensor with shape `shape`.\n *\n * The method supports the null value in tensor. It will still check the shapes,\n * and null is a placeholder.\n *\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n * const y = tf.tensor1d([1, null, 3, 4]);\n * const z = tf.tensor2d([1, 2, 3, 4], [2,2]);\n * tf.ensureShape(x, [4]).print();\n * tf.ensureShape(y, [4]).print();\n * tf.ensureShape(z, [null, 2]).print();\n * ```\n *\n * @param x The input tensor to be ensured.\n * @param shape A TensorShape representing the shape of this tensor, an array\n *     or null.\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction ensureShape_<R extends Rank>(x: Tensor, shape: ShapeMap[R]): Tensor {\n  const $x = convertToTensor(x, 'x', 'ensureShape', 'string_or_numeric');\n  if (!arraysEqualWithNull($x.shape, shape)) {\n    throw new Error(`EnsureShape: Shape of tensor ${\n        $x.shape} is not compatible with expected shape ${shape}`);\n  }\n\n  return x;\n}\nexport const ensureShape = /* @__PURE__ */ op({ensureShape_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Erf, ErfInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {cast} from './cast';\nimport {op} from './operation';\n\n/**\n * Computes Gauss error function of the input `tf.Tensor` element-wise:\n * `erf(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, .1, -.1, .7]);\n *\n * x.erf().print(); // or tf.erf(x);\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction erf_<T extends Tensor>(x: T|TensorLike): T {\n  let $x = convertToTensor(x, 'x', 'erf');\n  util.assert(\n      $x.dtype === 'int32' || $x.dtype === 'float32',\n      () => 'Input dtype must be `int32` or `float32`.');\n\n  if ($x.dtype === 'int32') {\n    $x = cast($x, 'float32');\n  }\n\n  const inputs: ErfInputs = {x: $x};\n  return ENGINE.runKernel(Erf, inputs as unknown as NamedTensorMap);\n}\nexport const erf = /* @__PURE__ */ op({erf_});\n", "/**\n * @license\n * Copyright 2017 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport * as util from '../util';\n\n/**\n * Returns true if the axis specifies the inner most dimensions of the\n * array.\n */\nexport function axesAreInnerMostDims(axes: number[], rank: number): boolean {\n  for (let i = 0; i < axes.length; ++i) {\n    if (axes[axes.length - i - 1] !== rank - 1 - i) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport function combineLocations(\n    outputLoc: number[], reduceLoc: number[], axes: number[]): number[] {\n  const rank = outputLoc.length + reduceLoc.length;\n  const loc = [];\n  let outIdx = 0;\n  let reduceIdx = 0;\n    for (let dim = 0; dim < rank; dim++) {\n    if (axes.indexOf(dim) === -1) {\n      loc.push(outputLoc[outIdx++]);\n    } else {\n      loc.push(reduceLoc[reduceIdx++]);\n    }\n  }\n  return loc;\n}\n\nexport function computeOutAndReduceShapes(\n    aShape: number[], axes: number[]): [number[], number[]] {\n  const outShape = [];\n  const rank = aShape.length;\n  for (let dim = 0; dim < rank; dim++) {\n    if (axes.indexOf(dim) === -1) {\n      outShape.push(aShape[dim]);\n    }\n  }\n  const reduceShape = axes.map(dim => aShape[dim]);\n  return [outShape, reduceShape];\n}\n\nexport function expandShapeToKeepDim(\n    shape: number[], axes: number[]): number[] {\n  const reduceSubShape = axes.map(x => 1);\n  return combineLocations(shape, reduceSubShape, axes);\n}\n\nexport function assertAxesAreInnerMostDims(\n    msg: string, axes: number[], rank: number): void {\n  util.assert(\n      axesAreInnerMostDims(axes, rank),\n      () => `${msg} supports only inner-most axes for now. ` +\n          `Got axes ${axes} and rank-${rank} input.`);\n}\n\n/**\n * Returns the axes permutation to be used with `tf.transpose`, if such\n * permutation is necessary. Otherwise it returns null. This method is used by\n * operations that operate only on inner-most axes.\n */\nexport function getAxesPermutation(axes: number[], rank: number): number[]|\n    null {\n  if (axesAreInnerMostDims(axes, rank)) {\n    return null;\n  }\n  const result: number[] = [];\n  for (let i = 0; i < rank; ++i) {\n    if (axes.indexOf(i) === -1) {\n      result.push(i);\n    }\n  }\n  axes.forEach(axis => result.push(axis));\n  return result;\n}\n\n/** Returns the axes permutation that undoes the original permutation. */\nexport function getUndoAxesPermutation(axes: number[]): number[] {\n  return axes.map((axis, i) => [i, axis])\n      .sort((a, b) => a[1] - b[1])\n      .map(x => x[0]);\n}\n\nexport function getInnerMostAxes(numAxes: number, rank: number): number[] {\n  const res: number[] = [];\n  for (let i = rank - numAxes; i < rank; ++i) {\n    res.push(i);\n  }\n  return res;\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Max, MaxAttrs, MaxInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the maximum of elements across dimensions of a `tf.Tensor`.\n *\n * Reduces the input along the dimensions given in `axes`. Unless `keepDims`\n * is true, the rank of the `tf.Tensor` is reduced by 1 for each entry in\n * `axes`. If `keepDims` is true, the reduced dimensions are retained with\n * length 1. If `axes` has no entries, all dimensions are reduced, and a\n * `tf.Tensor` with a single element is returned.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3]);\n *\n * x.max().print();  // or tf.max(x)\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * const axis = 1;\n * x.max(axis).print();  // or tf.max(x, axis)\n * ```\n *\n * @param x The input tensor.\n * @param axis The dimension(s) to reduce. By default it reduces\n *     all dimensions.\n * @param keepDims If true, retains reduced dimensions with size 1.\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction max_<T extends Tensor>(\n    x: Tensor|TensorLike, axis: number|number[] = null, keepDims = false): T {\n  const $x = convertToTensor(x, 'x', 'max');\n\n  const inputs: MaxInputs = {x: $x};\n  const attrs: MaxAttrs = {reductionIndices: axis, keepDims};\n\n  return ENGINE.runKernel(\n      Max, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const max = /* @__PURE__ */ op({max_});\n", "/**\n * @license\n * Copyright 2020 Google Inc. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Min, MinAttrs, MinInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the minimum value from the input.\n *\n * Reduces the input along the dimensions given in `axes`. Unless `keepDims`\n * is true, the rank of the array is reduced by 1 for each entry in `axes`.\n * If `keepDims` is true, the reduced dimensions are retained with length 1.\n * If `axes` has no entries, all dimensions are reduced, and an array with a\n * single element is returned.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3]);\n *\n * x.min().print();  // or tf.min(x)\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * const axis = 1;\n * x.min(axis).print();  // or tf.min(x, axis)\n * ```\n *\n * @param x The input Tensor.\n * @param axis The dimension(s) to reduce. By default it reduces\n *     all dimensions.\n * @param keepDims If true, retains reduced dimensions with size 1.\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction min_<T extends Tensor>(\n    x: Tensor|TensorLike, axis: number|number[] = null, keepDims = false): T {\n  const $x = convertToTensor(x, 'x', 'min');\n\n  const inputs: MinInputs = {x: $x};\n  const attrs: MinAttrs = {axis, keepDims};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  return ENGINE.runKernel(\n             Min, inputs as unknown as NamedTensorMap,\n             attrs as unknown as NamedAttrMap) as T;\n}\n\nexport const min = /* @__PURE__ */ op({min_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Pow, PowInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the power of one `tf.Tensor` to another. Supports broadcasting.\n *\n * Given a `tf.Tensor` x and a `tf.Tensor` y, this operation computes x^y for\n * corresponding elements in x and y. The result's dtype will be the upcasted\n * type of the `base` and `exp` dtypes.\n *\n * ```js\n * const a = tf.tensor([[2, 3], [4, 5]])\n * const b = tf.tensor([[1, 2], [3, 0]]).toInt();\n *\n * a.pow(b).print();  // or tf.pow(a, b)\n * ```\n *\n * ```js\n * const a = tf.tensor([[1, 2], [3, 4]])\n * const b = tf.tensor(2).toInt();\n *\n * a.pow(b).print();  // or tf.pow(a, b)\n * ```\n * We also expose `powStrict` which has the same signature as this op and\n * asserts that `base` and `exp` are the same shape (does not broadcast).\n *\n * @param base The base `tf.Tensor` to pow element-wise.\n * @param exp The exponent `tf.Tensor` to pow element-wise.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction pow_<T extends Tensor>(\n    base: Tensor|TensorLike, exp: Tensor|TensorLike): T {\n  let $base = convertToTensor(base, 'base', 'pow');\n  let $exp = convertToTensor(exp, 'exp', 'pow');\n  [$base, $exp] = makeTypesMatch($base, $exp);\n\n  const inputs: PowInputs = {a: $base, b: $exp};\n\n  return ENGINE.runKernel(Pow, inputs as unknown as NamedTensorMap);\n}\n\nexport const pow = /* @__PURE__ */ op({pow_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Scalar} from '../tensor';\nimport {DataType} from '../types';\nimport {isTypedArray} from '../util';\nimport {makeTensor} from './tensor_ops_util';\n\n/**\n * Creates rank-0 `tf.Tensor` (scalar) with the provided value and dtype.\n *\n * The same functionality can be achieved with `tf.tensor`, but in general\n * we recommend using `tf.scalar` as it makes the code more readable.\n *\n * ```js\n * tf.scalar(3.14).print();\n * ```\n *\n * @param value The value of the scalar.\n * @param dtype The data type.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function scalar(\n    value: number|boolean|string|Uint8Array, dtype?: DataType): Scalar {\n  if (((isTypedArray(value) && dtype !== 'string') || Array.isArray(value)) &&\n      dtype !== 'complex64') {\n    throw new Error(\n        'Error creating a new Scalar: value must be a primitive ' +\n        '(number|boolean|string)');\n  }\n  if (dtype === 'string' && isTypedArray(value) &&\n      !(value instanceof Uint8Array)) {\n    throw new Error(\n        'When making a scalar from encoded string, ' +\n        'the value must be `Uint8Array`.');\n  }\n  const shape: number[] = [];\n  const inferredShape: number[] = [];\n  return makeTensor(value, shape, inferredShape, dtype) as Scalar;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Sqrt, SqrtInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes square root of the input `tf.Tensor` element-wise: `y = sqrt(x)`\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 4, -1]);\n *\n * x.sqrt().print();  // or tf.sqrt(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction sqrt_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'sqrt', 'float32');\n\n  const inputs: SqrtInputs = {x: $x};\n\n  return ENGINE.runKernel(Sqrt, inputs as unknown as NamedTensorMap);\n}\nexport const sqrt = /* @__PURE__ */ op({sqrt_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {op} from './operation';\n\n/**\n * Computes square of `x` element-wise: `x ^ 2`\n *\n * ```js\n * const x = tf.tensor1d([1, 2, Math.sqrt(2), -1]);\n *\n * x.square().print();  // or tf.square(x)\n * ```\n * @param x The input Tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction square_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'square');\n  const attrs = {};\n  return ENGINE.runKernel('Square', {x: $x}, attrs);\n}\n\nexport const square = /* @__PURE__ */ op({square_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Sum, SumAttrs, SumInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {cast} from './cast';\nimport {op} from './operation';\n\n/**\n * Computes the sum of elements across dimensions of a `tf.Tensor`.\n *\n * Reduces the input along the dimensions given in `axes`. Unless `keepDims`\n * is true, the rank of the `tf.Tensor` is reduced by 1 for each entry in\n * `axes`. If `keepDims` is true, the reduced dimensions are retained with\n * length 1. If axes has no entries, all dimensions are reduced, and a\n * `tf.Tensor` with a single element is returned.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3]);\n *\n * x.sum().print();  // or tf.sum(x)\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * const axis = 1;\n * x.sum(axis).print();  // or tf.sum(x, axis)\n * ```\n *\n * @param x The input tensor to compute the sum over. If the dtype is `bool`\n *   it will be converted to `int32` and the output dtype will be `int32`.\n * @param axis The dimension(s) to reduce. By default it reduces\n *     all dimensions.\n * @param keepDims If true, retains reduced dimensions with size 1.\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction sum_<T extends Tensor>(\n    x: Tensor|TensorLike, axis: number|number[] = null, keepDims = false): T {\n  let $x = convertToTensor(x, 'x', 'sum');\n  if ($x.dtype === 'bool') {\n    $x = cast($x, 'int32');\n  }\n\n  const inputs: SumInputs = {x: $x};\n  const attrs: SumAttrs = {axis, keepDims};\n\n  return ENGINE.runKernel(\n      Sum, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const sum = /* @__PURE__ */ op({sum_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {parseAxisParam} from '../util';\n\nimport {abs} from './abs';\nimport * as axis_util from './axis_util';\nimport {max} from './max';\nimport {min} from './min';\nimport {op} from './operation';\nimport {pow} from './pow';\nimport {reshape} from './reshape';\nimport {scalar} from './scalar';\nimport {sqrt} from './sqrt';\nimport {square} from './square';\nimport {sum} from './sum';\n\n/**\n * Computes the norm of scalar, vectors, and matrices.\n * This function can compute several different vector norms (the 1-norm, the\n * Euclidean or 2-norm, the inf-norm, and in general the p-norm for p > 0)\n * and matrix norms (Frobenius, 1-norm, and inf-norm).\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n *\n * x.norm().print();  // or tf.norm(x)\n * ```\n *\n * @param x The input array.\n * @param ord Optional. Order of the norm. Supported norm types are\n * following:\n *\n *  | ord        | norm for matrices         | norm for vectors\n *  |------------|---------------------------|---------------------\n *  |'euclidean' |Frobenius norm             |2-norm\n *  |'fro'       |Frobenius norm\t           |\n *  |Infinity    |max(sum(abs(x), axis=1))   |max(abs(x))\n *  |-Infinity   |min(sum(abs(x), axis=1))   |min(abs(x))\n *  |1           |max(sum(abs(x), axis=0))   |sum(abs(x))\n *  |2           |                           |sum(abs(x)^2)^(1/2)\n *\n * @param axis Optional. If axis is null (the default), the input is\n * considered a vector and a single vector norm is computed over the entire\n * set of values in the Tensor, i.e. norm(x, ord) is equivalent\n * to norm(x.reshape([-1]), ord). If axis is an integer, the input\n * is considered a batch of vectors, and axis determines the axis in x\n * over which to compute vector norms. If axis is a 2-tuple of integer it is\n * considered a batch of matrices and axis determines the axes in NDArray\n * over which to compute a matrix norm.\n * @param keepDims Optional. If true, the norm has the same dimensionality\n * as the input.\n *\n * @doc {heading: 'Operations', subheading: 'Matrices'}\n */\nfunction norm_(\n    x: Tensor|TensorLike, ord: number|'euclidean'|'fro' = 'euclidean',\n    axis: number|number[] = null, keepDims = false): Tensor {\n  x = convertToTensor(x, 'x', 'norm');\n\n  const norm = normImpl(x, ord, axis);\n  let keepDimsShape = norm.shape;\n  if (keepDims) {\n    const axes = parseAxisParam(axis, x.shape);\n    keepDimsShape = axis_util.expandShapeToKeepDim(norm.shape, axes);\n  }\n  return reshape(norm, keepDimsShape);\n}\n\nfunction normImpl(\n    x: Tensor, p: number|string, axis: number|number[] = null): Tensor {\n  if (x.rank === 0) {\n    return abs(x);\n  }\n\n  // consider vector when no axis is specified\n  if (x.rank !== 1 && axis === null) {\n    return normImpl(reshape(x, [-1]), p, axis);\n  }\n\n  // vector\n  if (x.rank === 1 || typeof axis === 'number' ||\n      Array.isArray(axis) && axis.length === 1) {\n    if (p === 1) {\n      return sum(abs(x), axis);\n    }\n    if (p === Infinity) {\n      return max(abs(x), axis);\n    }\n    if (p === -Infinity) {\n      return min(abs(x), axis);\n    }\n    if (p === 'euclidean' || p === 2) {\n      // norm(x, 2) = sum(abs(xi) ^ 2) ^ 1/2\n      return sqrt(sum(pow(abs(x), scalar(2, 'int32')), axis));\n    }\n\n    throw new Error(`Error in norm: invalid ord value: ${p}`);\n  }\n\n  // matrix (assumption axis[0] < axis[1])\n  if (Array.isArray(axis) && axis.length === 2) {\n    if (p === 1) {\n      return max(sum(abs(x), axis[0]), axis[1] - 1);\n    }\n    if (p === Infinity) {\n      return max(sum(abs(x), axis[1]), axis[0]);\n    }\n    if (p === -Infinity) {\n      return min(sum(abs(x), axis[1]), axis[0]);\n    }\n    if (p === 'fro' || p === 'euclidean') {\n      // norm(x) = sqrt(sum(pow(x, 2)))\n      return sqrt(sum(square(x), axis));\n    }\n\n    throw new Error(`Error in norm: invalid ord value: ${p}`);\n  }\n\n  throw new Error(`Error in norm: invalid axis: ${axis}`);\n}\n\nexport const norm = /* @__PURE__ */ op({norm_});\n", "/**\n * @license\n * Copyright 2022 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {TensorLike} from '../types';\n\nimport {norm} from './norm';\nimport {op} from './operation';\n\n/**\n * Computes the Euclidean norm of scalar, vectors, and matrices.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n *\n * x.euclideanNorm().print();  // or tf.euclideanNorm(x)\n * ```\n *\n * @param x The input array.\n * @param axis Optional. If axis is null (the default), the input is\n * considered a vector and a single vector norm is computed over the entire\n * set of values in the Tensor, i.e. euclideanNorm(x) is equivalent\n * to euclideanNorm(x.reshape([-1])). If axis is an integer, the input\n * is considered a batch of vectors, and axis determines the axis in x\n * over which to compute vector norms. If axis is a 2-tuple of integer it is\n * considered a batch of matrices and axis determines the axes in NDArray\n * over which to compute a matrix norm.\n * @param keepDims Optional. If true, the norm has the same dimensionality\n * as the input.\n *\n * @doc {heading: 'Operations', subheading: 'Matrices'}\n */\nfunction euclideanNorm_(\n    x: Tensor|TensorLike, axis: number|number[] = null,\n    keepDims = false): Tensor {\n  return norm(x, 'euclidean', axis, keepDims);\n}\n\nexport const euclideanNorm = /* @__PURE__ */ op({euclideanNorm_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Exp, ExpInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes exponential of the input `tf.Tensor` element-wise. `e ^ x`\n *\n * ```js\n * const x = tf.tensor1d([1, 2, -3]);\n *\n * x.exp().print();  // or tf.exp(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction exp_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'exp');\n\n  const inputs: ExpInputs = {x: $x};\n  return ENGINE.runKernel(Exp, inputs as unknown as NamedTensorMap);\n}\nexport const exp = /* @__PURE__ */ op({exp_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {ExpandDims, ExpandDimsAttrs, ExpandDimsInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Returns a `tf.Tensor` that has expanded rank, by inserting a dimension\n * into the tensor's shape.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n * const axis = 1;\n * x.expandDims(axis).print();\n * ```\n *\n * @param x The input tensor whose dimensions are to be expanded.\n * @param axis The dimension index at which to insert shape of `1`. Defaults\n *     to 0 (the first dimension).\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction expandDims_<T extends Tensor>(x: Tensor|TensorLike, axis = 0): T {\n  const $x = convertToTensor(x, 'x', 'expandDims', 'string_or_numeric');\n\n  util.assert(axis <= $x.rank, () => 'Axis must be <= rank of the tensor');\n\n  const inputs: ExpandDimsInputs = {input: $x};\n  const attrs: ExpandDimsAttrs = {dim: axis};\n\n  return ENGINE.runKernel(\n      ExpandDims, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const expandDims = /* @__PURE__ */ op({expandDims_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Expm1, Expm1Inputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes exponential of the input `tf.Tensor` minus one element-wise.\n * `e ^ x - 1`\n *\n * ```js\n * const x = tf.tensor1d([1, 2, -3]);\n *\n * x.expm1().print();  // or tf.expm1(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction expm1_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'expm1');\n\n  const inputs: Expm1Inputs = {x: $x};\n  return ENGINE.runKernel(Expm1, inputs as unknown as NamedTensorMap);\n}\nexport const expm1 = /* @__PURE__ */ op({expm1_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Tile, TileAttrs, TileInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Construct a tensor by repeating it the number of times given by reps.\n *\n * This operation creates a new tensor by replicating `input` `reps`\n * times. The output tensor's `i`th dimension has `input.shape[i] *\n * reps[i]` elements, and the values of `input` are replicated\n * `reps[i]` times along the `i`th dimension. For example, tiling\n * `[a, b, c, d]` by `[2]` produces `[a, b, c, d, a, b, c, d]`.\n *\n * ```js\n * const a = tf.tensor1d([1, 2]);\n *\n * a.tile([2]).print();    // or tf.tile(a, [2])\n * ```\n *\n * ```js\n * const a = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * a.tile([1, 2]).print();  // or tf.tile(a, [1,2])\n * ```\n * @param x The tensor to tile.\n * @param reps Determines the number of replications per dimension.\n *\n * @doc {heading: 'Tensors', subheading: 'Slicing and Joining'}\n */\nfunction tile_<T extends Tensor>(x: T|TensorLike, reps: number[]): T {\n  const $x = convertToTensor(x, 'x', 'tile', 'string_or_numeric');\n  util.assert(\n      $x.rank === reps.length,\n      () => `Error in transpose: rank of input ${$x.rank} ` +\n          `must match length of reps ${reps}.`);\n\n  const inputs: TileInputs = {x: $x};\n  const attrs: TileAttrs = {reps};\n\n  return ENGINE.runKernel(\n      Tile, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const tile = /* @__PURE__ */ op({tile_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor2D} from '../tensor';\nimport {DataType} from '../types';\n\nimport {buffer} from './buffer';\nimport {expandDims} from './expand_dims';\nimport {op} from './operation';\nimport {reshape} from './reshape';\nimport {tile} from './tile';\n\n/**\n * Create an identity matrix.\n *\n * @param numRows Number of rows.\n * @param numColumns Number of columns. Defaults to `numRows`.\n * @param batchShape If provided, will add the batch shape to the beginning\n *   of the shape of the returned `tf.Tensor` by repeating the identity\n *   matrix.\n * @param dtype Data type.\n * @returns Identity matrix of the specified size and data type, possibly\n *   with batch repetition if `batchShape` is specified.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction eye_(\n    numRows: number, numColumns?: number,\n    batchShape?:\n        [\n          number\n        ]|[number,\n           number]|[number, number, number]|[number, number, number, number],\n    dtype: DataType = 'float32'): Tensor2D {\n  if (numColumns == null) {\n    numColumns = numRows;\n  }\n  const buff = buffer([numRows, numColumns], dtype);\n  const n = numRows <= numColumns ? numRows : numColumns;\n  for (let i = 0; i < n; ++i) {\n    buff.set(1, i, i);\n  }\n  const out: Tensor2D = reshape(buff.toTensor(), [numRows, numColumns]);\n  if (batchShape == null) {\n    return out;\n  } else {\n    if (batchShape.length === 1) {\n      return tile(expandDims(out, 0), [batchShape[0], 1, 1]) as Tensor2D;\n    } else if (batchShape.length === 2) {\n      // tslint:disable-next-line:no-unnecessary-type-assertion\n      return tile(\n                 expandDims(expandDims(out, 0), 0),\n                 [batchShape[0], batchShape[1], 1, 1]) as Tensor2D;\n    } else if (batchShape.length === 3) {\n      // tslint:disable-next-line:no-unnecessary-type-assertion\n      return tile(expandDims(expandDims(expandDims(out, 0), 0), 0), [\n               batchShape[0], batchShape[1], batchShape[2], 1, 1\n             ]) as Tensor2D;\n    } else {\n      throw new Error(\n          `eye() currently supports only 1D and 2D ` +\n          // tslint:disable-next-line:no-any\n          `batchShapes, but received ${(batchShape as any).length}D.`);\n    }\n  }\n}\n\nexport const eye = /* @__PURE__ */ op({eye_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Floor, FloorInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes floor of input `tf.Tensor` element-wise: `floor(x)`.\n *\n * ```js\n * const x = tf.tensor1d([.6, 1.1, -3.3]);\n *\n * x.floor().print();  // or tf.floor(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction floor_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'floor', 'float32');\n\n  const inputs: FloorInputs = {x: $x};\n  return ENGINE.runKernel(Floor, inputs as unknown as NamedTensorMap);\n}\nexport const floor = /* @__PURE__ */ op({floor_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {GatherV2, GatherV2Attrs, GatherV2Inputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Gather slices from tensor `x`'s axis `axis` according to `indices`.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n * const indices = tf.tensor1d([1, 3, 3], 'int32');\n *\n * x.gather(indices).print();\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n * const indices = tf.tensor1d([1, 1, 0], 'int32');\n *\n * x.gather(indices).print();\n * ```\n * @param x The input tensor whose slices are to be gathered.\n * @param indices The indices of the values to extract.\n * @param axis The axis over which to select values. Defaults to 0.\n * @param batchDims Optional. The number of batch dimensions. It must be less\n *     than or equal to rank(indices). Defaults to 0.\n *     The output tensor will have shape of\n *     `x.shape[:axis] + indices.shape[batchDims:] + x.shape[axis + 1:]`\n *\n * @doc {heading: 'Tensors', subheading: 'Slicing and Joining'}\n */\nfunction gather_<T extends Tensor>(\n    x: T|TensorLike, indices: Tensor|TensorLike, axis = 0, batchDims = 0): T {\n  const $x = convertToTensor(x, 'x', 'gather');\n  const $indices = convertToTensor(indices, 'indices', 'gather', 'int32');\n\n  const inputs: GatherV2Inputs = {x: $x, indices: $indices};\n  const attrs: GatherV2Attrs = {axis, batchDims};\n\n  return ENGINE.runKernel(\n      GatherV2, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const gather = /* @__PURE__ */ op({gather_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Greater, GreaterInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {op} from './operation';\n\n/**\n * Returns the truth value of (a > b) element-wise. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3]);\n * const b = tf.tensor1d([2, 2, 2]);\n *\n * a.greater(b).print();\n * ```\n *\n * @param a The first input tensor.\n * @param b The second input tensor. Must have the same dtype as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction greater_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'greater', 'string_or_numeric');\n  let $b = convertToTensor(b, 'b', 'greater', 'string_or_numeric');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: GreaterInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(Greater, inputs as unknown as NamedTensorMap);\n}\n\nexport const greater = /* @__PURE__ */ op({greater_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {GreaterEqual, GreaterEqualInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {op} from './operation';\n\n/**\n * Returns the truth value of (a >= b) element-wise. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3]);\n * const b = tf.tensor1d([2, 2, 2]);\n *\n * a.greaterEqual(b).print();\n * ```\n *\n * @param a The first input tensor.\n * @param b The second input tensor. Must have the same dtype as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction greaterEqual_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'greaterEqual', 'string_or_numeric');\n  let $b = convertToTensor(b, 'b', 'greaterEqual', 'string_or_numeric');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: GreaterEqualInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(GreaterEqual, inputs as unknown as NamedTensorMap);\n}\n\nexport const greaterEqual = /* @__PURE__ */ op({greaterEqual_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Imag, ImagInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {op} from './operation';\n/**\n * Returns the imaginary part of a complex (or real) tensor.\n *\n * Given a tensor input, this operation returns a tensor of type float that is\n * the imaginary part of each element in input considered as a complex number.\n * If input is real, a tensor of all zeros is returned.\n *\n * ```js\n * const x = tf.complex([-2.25, 3.25], [4.75, 5.75]);\n * tf.imag(x).print();\n * ```\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction imag_<T extends Tensor>(input: T|TensorLike): T {\n  const $input = convertToTensor(input, 'input', 'imag');\n\n  const inputs: ImagInputs = {input: $input};\n  return ENGINE.runKernel(Imag, inputs as unknown as NamedTensorMap);\n}\n\nexport const imag = /* @__PURE__ */ op({imag_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {IsFinite, IsFiniteInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Returns which elements of x are finite.\n *\n * ```js\n * const x = tf.tensor1d([NaN, Infinity, -Infinity, 0, 1]);\n *\n * x.isFinite().print();  // or tf.isNaN(x)\n * ```\n * @param x The input Tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction isFinite_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'isFinite');\n\n  const inputs: IsFiniteInputs = {x: $x};\n\n  return ENGINE.runKernel(IsFinite, inputs as unknown as NamedTensorMap);\n}\nexport const isFinite = /* @__PURE__ */ op({isFinite_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {IsInf, IsInfInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Returns which elements of x are Infinity or -Infinity.\n *\n * ```js\n * const x = tf.tensor1d([NaN, Infinity, -Infinity, 0, 1]);\n *\n * x.isInf().print();  // or tf.isNaN(x)\n * ```\n * @param x The input Tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction isInf_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'isInf');\n\n  const inputs: IsInfInputs = {x: $x};\n\n  return ENGINE.runKernel(IsInf, inputs as unknown as NamedTensorMap);\n}\nexport const isInf = /* @__PURE__ */ op({isInf_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {IsNan, IsNanInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Returns which elements of x are NaN.\n *\n * ```js\n * const x = tf.tensor1d([NaN, Infinity, -Infinity, 0, 1]);\n *\n * x.isNaN().print();  // or tf.isNaN(x)\n * ```\n * @param x The input Tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction isNaN_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'isNaN');\n  const inputs: IsNanInputs = {x: $x};\n\n  return ENGINE.runKernel(IsNan, inputs as unknown as NamedTensorMap);\n}\nexport const isNaN = /* @__PURE__ */ op({isNaN_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {LeakyRelu, LeakyReluAttrs, LeakyReluInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes leaky rectified linear element-wise.\n *\n * See\n * [http://web.stanford.edu/~awni/papers/relu_hybrid_icml2013_final.pdf](\n *     http://web.stanford.edu/~awni/papers/relu_hybrid_icml2013_final.pdf)\n *\n * ```js\n * const x = tf.tensor1d([-1, 2, -3, 4]);\n *\n * x.leakyRelu(0.1).print();  // or tf.leakyRelu(x, 0.1)\n * ```\n * @param x The input tensor.\n * @param alpha The scaling factor for negative values, defaults to 0.2.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction leakyRelu_<T extends Tensor>(x: T|TensorLike, alpha = 0.2): T {\n  const $x = convertToTensor(x, 'x', 'leakyRelu');\n\n  const inputs: LeakyReluInputs = {x: $x};\n  const attrs: LeakyReluAttrs = {alpha};\n\n  return ENGINE.runKernel(\n      LeakyRelu, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const leakyRelu = /* @__PURE__ */ op({leakyRelu_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Less, LessInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {op} from './operation';\n\n/**\n * Returns the truth value of (a < b) element-wise. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3]);\n * const b = tf.tensor1d([2, 2, 2]);\n *\n * a.less(b).print();\n * ```\n * @param a The first input tensor.\n * @param b The second input tensor. Must have the same dtype as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction less_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'less', 'string_or_numeric');\n  let $b = convertToTensor(b, 'b', 'less', 'string_or_numeric');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: LessInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(Less, inputs as unknown as NamedTensorMap);\n}\n\nexport const less = /* @__PURE__ */ op({less_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {LessEqual, LessEqualInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {op} from './operation';\n\n/**\n * Returns the truth value of (a <= b) element-wise. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3]);\n * const b = tf.tensor1d([2, 2, 2]);\n *\n * a.lessEqual(b).print();\n * ```\n *\n * @param a The first input tensor.\n * @param b The second input tensor. Must have the same dtype as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction lessEqual_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'lessEqual', 'string_or_numeric');\n  let $b = convertToTensor(b, 'b', 'lessEqual', 'string_or_numeric');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: LessEqualInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(LessEqual, inputs as unknown as NamedTensorMap);\n}\n\nexport const lessEqual = /* @__PURE__ */ op({lessEqual_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {LinSpace, LinSpaceAttrs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor1D} from '../tensor';\n\n/**\n * Return an evenly spaced sequence of numbers over the given interval.\n *\n * ```js\n * tf.linspace(0, 9, 10).print();\n * ```\n * @param start The start value of the sequence.\n * @param stop The end value of the sequence.\n * @param num The number of values to generate.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function linspace(start: number, stop: number, num: number): Tensor1D {\n  if (num <= 0) {\n    throw new Error('The number of values should be positive.');\n  }\n\n  const attrs: LinSpaceAttrs = {start, stop, num};\n  return ENGINE.runKernel(LinSpace, {}, attrs as unknown as NamedAttrMap);\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {LRN, LRNAttrs, LRNInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Normalizes the activation of a local neighborhood across or within\n * channels.\n *\n * @param x The input tensor. The 4-D input tensor is treated as a 3-D array\n *     of 1D vectors (along the last dimension), and each vector is\n *     normalized independently.\n * @param depthRadius The number of adjacent channels in the 1D normalization\n *     window.\n * @param bias A constant bias term for the basis.\n * @param alpha A scale factor, usually positive.\n * @param beta An exponent.\n *\n * @doc {heading: 'Operations', subheading: 'Normalization'}\n */\nfunction localResponseNormalization_<T extends Tensor3D|Tensor4D>(\n    x: T|TensorLike, depthRadius = 5, bias = 1, alpha = 1, beta = 0.5): T {\n  const $x = convertToTensor(x, 'x', 'localResponseNormalization');\n  util.assert(\n      $x.rank === 4 || $x.rank === 3,\n      () => `Error in localResponseNormalization: x must be rank 3 or 4 but got\n               rank ${$x.rank}.`);\n  util.assert(\n      util.isInt(depthRadius),\n      () => `Error in localResponseNormalization: depthRadius must be an ` +\n          `integer but got depthRadius ${depthRadius}.`);\n\n  let x4D = $x as Tensor4D;\n  let reshapedTo4D = false;\n  if ($x.rank === 3) {\n    reshapedTo4D = true;\n    x4D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2]]);\n  }\n\n  const inputs: LRNInputs = {x: x4D};\n\n  const attrs: LRNAttrs = {depthRadius, bias, alpha, beta};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  LRN, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  } else {\n    return res;\n  }\n}\n\nexport const localResponseNormalization = /* @__PURE__ */ op({localResponseNormalization_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Log, LogInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes natural logarithm of the input `tf.Tensor` element-wise: `ln(x)`\n *\n * ```js\n * const x = tf.tensor1d([1, 2, Math.E]);\n *\n * x.log().print();  // or tf.log(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction log_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'log', 'float32');\n\n  const inputs: LogInputs = {x: $x};\n  return ENGINE.runKernel(Log, inputs as unknown as NamedTensorMap);\n}\nexport const log = /* @__PURE__ */ op({log_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Log1p, Log1pInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes natural logarithm of the input `tf.Tensor` plus one\n * element-wise: `ln(1 + x)`\n *\n * ```js\n * const x = tf.tensor1d([1, 2, Math.E - 1]);\n *\n * x.log1p().print();  // or tf.log1p(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction log1p_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'log1p');\n\n  const inputs: Log1pInputs = {x: $x};\n  return ENGINE.runKernel(Log1p, inputs as unknown as NamedTensorMap);\n}\nexport const log1p = /* @__PURE__ */ op({log1p_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {CustomGradientFunc, ENGINE} from './engine';\nimport {Scalar, Tensor, Variable} from './tensor';\nimport {NamedTensorMap} from './tensor_types';\nimport {convertToTensor, convertToTensorArray} from './tensor_util_env';\nimport {TensorLike} from './types';\nimport * as util from './util';\n\n/**\n * Provided `f(x)`, returns another function `g(x, dy?)`, which gives the\n * gradient of `f(x)` with respect to `x`.\n *\n * If `dy` is provided, the gradient of `f(x).mul(dy).sum()` with respect to\n * `x` is computed instead. `f(x)` must take a single tensor `x` and return a\n * single tensor `y`. If `f()` takes multiple inputs, use `tf.grads` instead.\n *\n * ```js\n * // f(x) = x ^ 2\n * const f = x => x.square();\n * // f'(x) = 2x\n * const g = tf.grad(f);\n *\n * const x = tf.tensor1d([2, 3]);\n * g(x).print();\n * ```\n *\n * ```js\n * // f(x) = x ^ 3\n * const f = x => x.pow(tf.scalar(3, 'int32'));\n * // f'(x) = 3x ^ 2\n * const g = tf.grad(f);\n * // f''(x) = 6x\n * const gg = tf.grad(g);\n *\n * const x = tf.tensor1d([2, 3]);\n * gg(x).print();\n * ```\n *\n * @param f The function f(x), to compute gradient for.\n *\n * @doc {heading: 'Training', subheading: 'Gradients'}\n */\nfunction grad(f: (x: Tensor) => Tensor): (\n    x: TensorLike|Tensor, dy?: TensorLike|Tensor) => Tensor {\n  util.assert(\n      util.isFunction(f), () => 'The f passed in grad(f) must be a function');\n  return (x: TensorLike|Tensor, dy?: TensorLike|Tensor): Tensor => {\n    // x can be of any dtype, thus null as the last argument.\n    const $x = convertToTensor(x, 'x', 'tf.grad', 'string_or_numeric');\n    const $dy: Tensor =\n        (dy != null) ? convertToTensor(dy, 'dy', 'tf.grad') : null;\n    return ENGINE.tidy(() => {\n      const {value, grads} = ENGINE.gradients(() => f($x), [$x], $dy);\n      if ($dy != null) {\n        util.assertShapesMatch(\n            value.shape, $dy.shape,\n            'The shape of dy passed in grad(f)(x, dy) must match the shape ' +\n                'returned by f(x)');\n      }\n      checkGrads(grads);\n      return grads[0];\n    });\n  };\n}\n\n/**\n * Provided `f(x1, x2,...)`, returns another function `g([x1, x2,...], dy?)`,\n * which gives an array of gradients of `f()` with respect to each input\n * [`x1`,`x2`,...].\n *\n * If `dy` is passed when calling `g()`, the gradient of\n * `f(x1,...).mul(dy).sum()` with respect to each input is computed instead.\n * The provided `f` must take one or more tensors and return a single tensor\n * `y`. If `f()` takes a single input, we recommend using `tf.grad` instead.\n *\n * ```js\n * // f(a, b) = a * b\n * const f = (a, b) => a.mul(b);\n * // df / da = b, df / db = a\n * const g = tf.grads(f);\n *\n * const a = tf.tensor1d([2, 3]);\n * const b = tf.tensor1d([-2, -3]);\n * const [da, db] = g([a, b]);\n * console.log('da');\n * da.print();\n * console.log('db');\n * db.print();\n * ```\n *\n * @param f The function `f(x1, x2,...)` to compute gradients for.\n *\n * @doc {heading: 'Training', subheading: 'Gradients'}\n */\nfunction grads(f: (...args: Tensor[]) => Tensor): (\n    args: Array<Tensor|TensorLike>, dy?: Tensor|TensorLike) => Tensor[] {\n  util.assert(\n      util.isFunction(f), () => 'The f passed in grads(f) must be a function');\n  return (args: Array<Tensor|TensorLike>, dy?: Tensor|TensorLike): Tensor[] => {\n    util.assert(\n        Array.isArray(args),\n        () => 'The args passed in grads(f)(args) must be an array ' +\n            'of `Tensor`s or `TensorLike`s');\n    // args can be of any dtype, thus null as the last argument.\n    const $args =\n        convertToTensorArray(args, 'args', 'tf.grads', 'string_or_numeric');\n    const $dy: Tensor =\n        (dy != null) ? convertToTensor(dy, 'dy', 'tf.grads') : null;\n    return ENGINE.tidy(() => {\n      const {value, grads} = ENGINE.gradients(() => f(...$args), $args, $dy);\n      if ($dy != null) {\n        util.assertShapesMatch(\n            value.shape, $dy.shape,\n            'The shape of dy passed in grads(f)([x1,...], dy) must ' +\n                'match the shape returned by f([x1,...])');\n      }\n      checkGrads(grads);\n      return grads;\n    });\n  };\n}\n\n/**\n * Like `tf.grad`, but also returns the value of `f()`. Useful when `f()`\n * returns a metric you want to show.\n *\n * The result is a rich object with the following properties:\n * - grad: The gradient of `f(x)` w.r.t. `x` (result of `tf.grad`).\n * - value: The value returned by `f(x)`.\n *\n * ```js\n * // f(x) = x ^ 2\n * const f = x => x.square();\n * // f'(x) = 2x\n * const g = tf.valueAndGrad(f);\n *\n * const x = tf.tensor1d([2, 3]);\n * const {value, grad} = g(x);\n *\n * console.log('value');\n * value.print();\n * console.log('grad');\n * grad.print();\n * ```\n *\n * @doc {heading: 'Training', subheading: 'Gradients'}\n */\nfunction valueAndGrad<I extends Tensor, O extends Tensor>(f: (x: I) => O): (\n    x: I, dy?: O) => {\n  value: O;\n  grad: I;\n} {\n  util.assert(\n      util.isFunction(f),\n      () => 'The f passed in valueAndGrad(f) must be a function');\n  return (x: I, dy?: O) => {\n    util.assert(\n        x instanceof Tensor,\n        () => 'The x passed in valueAndGrad(f)(x) must be a tensor');\n    util.assert(\n        dy == null || dy instanceof Tensor,\n        () => 'The dy passed in valueAndGrad(f)(x, dy) must be a tensor');\n    const {grads, value} = ENGINE.gradients(() => f(x), [x], dy);\n    checkGrads(grads);\n    return {grad: grads[0] as I, value};\n  };\n}\n\n/**\n * Like `tf.grads`, but returns also the value of `f()`. Useful when `f()`\n * returns a metric you want to show.\n *\n * The result is a rich object with the following properties:\n * - grads: The gradients of `f()` w.r.t. each input (result of `tf.grads`).\n * - value: The value returned by `f(x)`.\n *\n * ```js\n * // f(a, b) = a * b\n * const f = (a, b) => a.mul(b);\n * // df/da = b, df/db = a\n * const g = tf.valueAndGrads(f);\n *\n * const a = tf.tensor1d([2, 3]);\n * const b = tf.tensor1d([-2, -3]);\n * const {value, grads} = g([a, b]);\n *\n * const [da, db] = grads;\n *\n * console.log('value');\n * value.print();\n *\n * console.log('da');\n * da.print();\n * console.log('db');\n * db.print();\n * ```\n *\n * @doc {heading: 'Training', subheading: 'Gradients'}\n */\nfunction valueAndGrads<O extends Tensor>(f: (...args: Tensor[]) => O): (\n    args: Tensor[], dy?: O) => {\n  grads: Tensor[];\n  value: O;\n} {\n  util.assert(\n      util.isFunction(f),\n      () => 'The f passed in valueAndGrads(f) must be a function');\n  return (args: Tensor[], dy?: O) => {\n    util.assert(\n        Array.isArray(args) && args.every(arg => arg instanceof Tensor),\n        () => 'The args passed in valueAndGrads(f)(args) must be array of ' +\n            'tensors');\n    util.assert(\n        dy == null || dy instanceof Tensor,\n        () => 'The dy passed in valueAndGrads(f)(args, dy) must be a tensor');\n    const res = ENGINE.gradients(() => f(...args), args, dy);\n    if (dy != null) {\n      util.assertShapesMatch(\n          res.value.shape, dy.shape,\n          'The shape of dy passed in valueAndGrads(f)([x1,...], dy) must ' +\n              'match the shape returned by f([x1,...])');\n    }\n    checkGrads(res.grads);\n    return res;\n  };\n}\n\n/**\n * Computes and returns the gradient of f(x) with respect to the list of\n * trainable variables provided by `varList`. If no list is provided, it\n * defaults to all trainable variables.\n *\n * ```js\n * const a = tf.variable(tf.tensor1d([3, 4]));\n * const b = tf.variable(tf.tensor1d([5, 6]));\n * const x = tf.tensor1d([1, 2]);\n *\n * // f(a, b) = a * x ^ 2 + b * x\n * const f = () => a.mul(x.square()).add(b.mul(x)).sum();\n * // df/da = x ^ 2, df/db = x\n * const {value, grads} = tf.variableGrads(f);\n *\n * Object.keys(grads).forEach(varName => grads[varName].print());\n * ```\n *\n * @param f The function to execute. f() should return a scalar.\n * @param varList The list of variables to compute the gradients with respect\n *     to. Defaults to all trainable variables.\n * @returns An object with the following keys and values:\n *   - `value`: The value of the function `f`.\n *   - `grads`: A map from the names of the variables to the gradients.\n *     If the `varList` argument is provided explicitly and contains a subset of\n *     non-trainable variables, this map in the return value will contain keys\n *     that map the names of the non-trainable variables to `null`.\n *\n * @doc {heading: 'Training', subheading: 'Gradients'}\n */\nfunction variableGrads(f: () => Scalar, varList?: Variable[]):\n    {value: Scalar, grads: NamedTensorMap} {\n  util.assert(\n      util.isFunction(f),\n      () => 'The f passed in variableGrads(f) must be a function');\n  util.assert(\n      varList == null ||\n          Array.isArray(varList) && varList.every(v => v instanceof Variable),\n      () =>\n          'The varList passed in variableGrads(f, varList) must be an array ' +\n          'of variables');\n\n  const specifiedVarList = varList != null;\n  if (!specifiedVarList) {\n    // Get all of the trainable variables.\n    varList = [];\n    for (const varName in ENGINE.registeredVariables) {\n      varList.push(ENGINE.registeredVariables[varName]);\n    }\n  }\n\n  const specifiedNonTrainable: Variable[] =\n      specifiedVarList ? varList.filter(variable => !variable.trainable) : null;\n\n  // Prune non-trainable variables.\n  const originalVarCount = varList.length;\n  varList = varList.filter(variable => variable.trainable);\n  util.assert(\n      varList.length > 0,\n      () => `variableGrads() expects at least one of the input variables to ` +\n          `be trainable, but none of the ${originalVarCount} variables is ` +\n          `trainable.`);\n\n  const allowNoGradients = true;\n  const {value, grads} = ENGINE.gradients(f, varList, null, allowNoGradients);\n\n  util.assert(\n      grads.some(g => g != null),\n      () => 'Cannot find a connection between any variable and the result of ' +\n          'the loss function y=f(x). Please make sure the operations that ' +\n          'use variables are inside the function f passed to minimize().');\n  util.assert(\n      value.rank === 0,\n      () => `The f passed in variableGrads(f) must return a scalar, but it ` +\n          `returned a rank-${value.rank} tensor`);\n\n  const namedGrads: NamedTensorMap = {};\n  varList.forEach((v, i) => {\n    if (grads[i] != null) {\n      namedGrads[v.name] = grads[i];\n    }\n  });\n  if (specifiedNonTrainable != null) {\n    // If varList is explicitly provided and contains non-trainable values,\n    // add them to the returned gradients with `null` values.\n    specifiedNonTrainable.forEach(v => namedGrads[v.name] = null);\n  }\n  return {value, grads: namedGrads};\n}\n\n/**\n * Overrides the gradient computation of a function `f`.\n *\n * Takes a function\n * `f(...inputs, save) => {value: Tensor, gradFunc: (dy, saved) => Tensor[]}`\n * and returns another function `g(...inputs)` which takes the same inputs as\n * `f`. When called, `g` returns `f().value`. In backward mode, custom gradients\n * with respect to each input of `f` are computed using `f().gradFunc`.\n *\n * The `save` function passed to `f` should be used for saving tensors needed\n * in the gradient. And the `saved` passed to the `gradFunc` is a\n * `NamedTensorMap`, which contains those saved tensors.\n *\n * ```js\n * const customOp = tf.customGrad((x, save) => {\n *   // Save x to make sure it's available later for the gradient.\n *   save([x]);\n *   // Override gradient of our custom x ^ 2 op to be dy * abs(x);\n *   return {\n *     value: x.square(),\n *     // Note `saved.x` which points to the `x` we saved earlier.\n *     gradFunc: (dy, saved) => [dy.mul(saved[0].abs())]\n *   };\n * });\n *\n * const x = tf.tensor1d([-1, -2, 3]);\n * const dx = tf.grad(x => customOp(x));\n *\n * console.log(`f(x):`);\n * customOp(x).print();\n * console.log(`f'(x):`);\n * dx(x).print();\n * ```\n *\n * @param f The function to evaluate in forward mode, which should return\n *     `{value: Tensor, gradFunc: (dy, saved) => Tensor[]}`, where `gradFunc`\n *     returns the custom gradients of `f` with respect to its inputs.\n *\n * @doc {heading: 'Training', subheading: 'Gradients'}\n */\nfunction customGrad<T extends Tensor>(f: CustomGradientFunc<T>):\n    (...args: Tensor[]) => T {\n  return ENGINE.customGrad(f);\n}\n\nfunction checkGrads(grads: Tensor[]) {\n  const numNullGradients = grads.filter(g => g == null).length;\n  if (numNullGradients > 0) {\n    throw new Error(\n        `Cannot compute gradient of y=f(x) with respect to x. Make sure that\n    the f you passed encloses all operations that lead from x to y.`);\n  }\n}\n\nexport {\n  customGrad,\n  variableGrads,\n  valueAndGrad,\n  valueAndGrads,\n  grad,\n  grads,\n};\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Neg, NegInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes `-1 * x` element-wise.\n *\n * ```js\n * const x = tf.tensor2d([1, 2, -2, 0], [2, 2]);\n *\n * x.neg().print();  // or tf.neg(x)\n * ```\n *\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction neg_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'neg');\n\n  const inputs: NegInputs = {x: $x};\n  return ENGINE.runKernel(Neg, inputs as unknown as NamedTensorMap);\n}\nexport const neg = /* @__PURE__ */ op({neg_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Softplus, SoftplusInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes softplus of the input `tf.Tensor` element-wise: `log(exp(x) + 1)`\n *\n * ```js\n * const x = tf.tensor1d([0, 1, -1, .7]);\n *\n * x.softplus().print();  // or tf.softplus(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction softplus_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'softplus');\n\n  const inputs: SoftplusInputs = {x: $x};\n  return ENGINE.runKernel(Softplus, inputs as unknown as NamedTensorMap);\n}\nexport const softplus = /* @__PURE__ */ op({softplus_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {customGrad} from '../gradients';\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {mul} from './mul';\nimport {neg} from './neg';\nimport {op} from './operation';\nimport {sigmoid} from './sigmoid';\nimport {softplus} from './softplus';\n\n/**\n * Computes log sigmoid of the input `tf.Tensor` element-wise:\n * `logSigmoid(x)`. For numerical stability, we use `-tf.softplus(-x)`.\n *\n * ```js\n * const x = tf.tensor1d([0, 1, -1, .7]);\n *\n * x.logSigmoid().print();  // or tf.logSigmoid(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction logSigmoid_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'logSigmoid');\n\n  // Use a custom gradient to maintain previous implementation.\n  // There is no LogSigmoid kernel in TF so we can't use engine.runKernel\n  // directly\n  const customOp = customGrad((x: Tensor) => {\n    // TODO(yassogba) we can remove the chained softplus call here only\n    // after backends have modualrized softplus at which point we can call\n    // engine runKernel(..., Sotfplus, ...) directly.\n    const value = neg(softplus(neg(x)));\n\n    const gradFunc = (dy: T) => {\n      const derX = mul(dy, sigmoid(neg(x)));\n      return derX;\n    };\n    return {value, gradFunc};\n  });\n\n  return customOp($x) as T;\n}\nexport const logSigmoid = /* @__PURE__ */ op({logSigmoid_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Sub, SubInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Subtracts two `tf.Tensor`s element-wise, A - B. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([10, 20, 30, 40]);\n * const b = tf.tensor1d([1, 2, 3, 4]);\n *\n * a.sub(b).print();  // or tf.sub(a, b)\n * ```\n *\n * ```js\n * // Broadcast subtract a with b.\n * const a = tf.tensor1d([10, 20, 30, 40]);\n * const b = tf.scalar(5);\n *\n * a.sub(b).print();  // or tf.sub(a, b)\n * ```\n * @param a The first `tf.Tensor` to subtract from.\n * @param b The second `tf.Tensor` to be subtracted. Must have the same dtype as\n * `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction sub_<T extends Tensor>(a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'sub');\n  let $b = convertToTensor(b, 'b', 'sub');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  const inputs: SubInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(Sub, inputs as unknown as NamedTensorMap);\n}\n\nexport const sub = /* @__PURE__ */ op({sub_});\n", "/**\n * @license\n * Copyright 2020 Google Inc. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {customGrad} from '../gradients';\n\nimport {Tensor} from '../tensor';\nimport {GradSaveFunc} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {cast} from './cast';\nimport {exp} from './exp';\nimport {log} from './log';\nimport {max} from './max';\nimport {mul} from './mul';\nimport {op} from './operation';\nimport {sub} from './sub';\nimport {sum} from './sum';\n\n/**\n * Computes the log softmax.\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3]);\n *\n * a.logSoftmax().print();  // or tf.logSoftmax(a)\n * ```\n *\n * ```js\n * const a = tf.tensor2d([2, 4, 6, 1, 2, 3], [2, 3]);\n *\n * a.logSoftmax().print();  // or tf.logSoftmax(a)\n * ```\n *\n * @param logits The logits array.\n * @param axis The dimension softmax would be performed on. Defaults to `-1`\n *     which indicates the last dimension.\n *\n * @doc {heading: 'Operations', subheading: 'Normalization'}\n */\nfunction logSoftmax_<T extends Tensor>(logits: T|TensorLike, axis = -1): T {\n  const $logits = convertToTensor(logits, 'logits', 'logSoftmax');\n\n  if (axis === -1) {\n    axis = $logits.rank - 1;\n  }\n  if (axis !== $logits.rank - 1) {\n    throw Error(\n        'Log Softmax along a non-last dimension is not yet supported. ' +\n        `Logits was rank ${$logits.rank} and axis was ${axis}`);\n  }\n\n  // const forward: ForwardFunc<Tensor> = (backend, save) => {\n  //   const keepDims = true;\n  //   const xMax = max(logits, axis, true);\n  //   const shifted = sub(logits, xMax);\n  //   const value =\n  //       sub(cast(shifted, 'float32'), log(sum(exp(shifted), axis,\n  //       keepDims)));\n  //   save([value]);\n  //   return value;\n  // };\n\n  // Use a custom gradient for numerical stability.\n  const customOp = customGrad((logits: Tensor, save: GradSaveFunc) => {\n    const keepDims = true;\n    const xMax = max(logits, axis, true);\n    const shifted = sub(logits, xMax);\n    const value =\n        sub(cast(shifted, 'float32'), log(sum(exp(shifted), axis, keepDims)));\n    save([value]);\n\n    const gradFunc = (dy: Tensor, saved: Tensor[]) => {\n      const [value] = saved;\n      const keepDims = true;\n      const softmax = exp(value);\n      return sub(dy, mul(sum(dy, axis, keepDims), softmax));\n    };\n    return {value, gradFunc};\n  });\n\n  return customOp($logits) as T;\n\n  // TODO Use Engine.runKernel when CPU/WebGL/WASM backends implement this.\n  // const inputs: LogSoftmaxInputs = {logits: $logits};\n  // const attrs: LogSoftmaxAttrs = {axis};\n  // return ENGINE.runKernel(\n  //            LogSoftmax, inputs as unknown as NamedTensorMap,\n  //            attrs as unknown as NamedAttrMap);\n}\n\nexport const logSoftmax = /* @__PURE__ */ op({logSoftmax_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {parseAxisParam} from '../util';\n\nimport {add} from './add';\nimport {expandShapeToKeepDim} from './axis_util';\nimport {exp} from './exp';\nimport {log} from './log';\nimport {max} from './max';\nimport {op} from './operation';\nimport {reshape} from './reshape';\nimport {sub} from './sub';\nimport {sum} from './sum';\n\n/**\n * Computes the log(sum(exp(elements across the reduction dimensions))).\n *\n * Reduces the input along the dimensions given in `axis`. Unless `keepDims`\n * is true, the rank of the array is reduced by 1 for each entry in `axis`.\n * If `keepDims` is true, the reduced dimensions are retained with length 1.\n * If `axis` has no entries, all dimensions are reduced, and an array with a\n * single element is returned.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3]);\n *\n * x.logSumExp().print();  // or tf.logSumExp(x)\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * const axis = 1;\n * x.logSumExp(axis).print();  // or tf.logSumExp(a, axis)\n * ```\n * @param x The input tensor.\n * @param axis The dimension(s) to reduce. If null (the default),\n *     reduces all dimensions.\n * @param keepDims If true, retains reduced dimensions with length\n *     of 1. Defaults to false.\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction logSumExp_<T extends Tensor>(\n    x: Tensor|TensorLike, axis: number|number[] = null, keepDims = false): T {\n  const $x = convertToTensor(x, 'x', 'logSumExp');\n\n  const axes = parseAxisParam(axis, $x.shape);\n  const xMax = max($x, axes, true /* keepDims */);\n  const a = sub($x, xMax);\n  const b = exp(a);\n  const c = sum(b, axes);\n  const d = log(c);\n  const res = add(reshape(xMax, d.shape), d);\n\n  if (keepDims) {\n    const newShape = expandShapeToKeepDim(res.shape, axes);\n    return reshape(res, newShape) as T;\n  }\n  return res as T;\n}\n\nexport const logSumExp = /* @__PURE__ */ op({logSumExp_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {LogicalAnd, LogicalAndInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {op} from './operation';\n\n/**\n * Returns the truth value of `a AND b` element-wise. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([false, false, true, true], 'bool');\n * const b = tf.tensor1d([false, true, false, true], 'bool');\n *\n * a.logicalAnd(b).print();\n * ```\n *\n * @param a The first input tensor. Must be of dtype bool.\n * @param b The second input tensor. Must be of dtype bool.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction logicalAnd_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  const $a = convertToTensor(a, 'a', 'logicalAnd', 'bool');\n  const $b = convertToTensor(b, 'b', 'logicalAnd', 'bool');\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: LogicalAndInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(LogicalAnd, inputs as unknown as NamedTensorMap);\n}\n\nexport const logicalAnd = /* @__PURE__ */ op({logicalAnd_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {LogicalNot, LogicalNotInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {op} from './operation';\n\n/**\n * Returns the truth value of `NOT x` element-wise.\n *\n * ```js\n * const a = tf.tensor1d([false, true], 'bool');\n *\n * a.logicalNot().print();\n * ```\n *\n * @param x The input tensor. Must be of dtype 'bool'.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction logicalNot_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'logicalNot', 'bool');\n  const inputs: LogicalNotInputs = {x: $x};\n  return ENGINE.runKernel(LogicalNot, inputs as unknown as NamedTensorMap);\n}\n\nexport const logicalNot = /* @__PURE__ */ op({logicalNot_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {LogicalOr, LogicalOrInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {op} from './operation';\n\n/**\n * Returns the truth value of `a OR b` element-wise. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([false, false, true, true], 'bool');\n * const b = tf.tensor1d([false, true, false, true], 'bool');\n *\n * a.logicalOr(b).print();\n * ```\n * @param a The first input tensor. Must be of dtype bool.\n * @param b The second input tensor. Must be of dtype bool.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction logicalOr_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  const $a = convertToTensor(a, 'a', 'logicalOr', 'bool');\n  const $b = convertToTensor(b, 'b', 'logicalOr', 'bool');\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: LogicalOrInputs = {a: $a, b: $b};\n  return ENGINE.runKernel(LogicalOr, inputs as unknown as NamedTensorMap);\n}\nexport const logicalOr = /* @__PURE__ */ op({logicalOr_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {logicalAnd} from './logical_and';\nimport {logicalNot} from './logical_not';\nimport {logicalOr} from './logical_or';\nimport {op} from './operation';\n\n/**\n * Returns the truth value of `a XOR b` element-wise. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([false, false, true, true], 'bool');\n * const b = tf.tensor1d([false, true, false, true], 'bool');\n *\n * a.logicalXor(b).print();\n * ```\n *\n * @param a The first input tensor. Must be of dtype bool.\n * @param b The second input tensor. Must be of dtype bool.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction logicalXor_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  const $a = convertToTensor(a, 'a', 'logicalXor', 'bool');\n  const $b = convertToTensor(b, 'b', 'logicalXor', 'bool');\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  // x ^ y = (x | y) & ~(x & y)\n  return logicalAnd(logicalOr(a, b), logicalNot(logicalAnd(a, b)));\n}\n\nexport const logicalXor = /* @__PURE__ */ op({logicalXor_});\n", "/**\n * @license\n * Copyright 2022 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {SearchSorted, SearchSortedAttrs, SearchSortedInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {sizeFromShape} from '../util_base';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\nconst INT32_MAX = 2147483648;\n/**\n * Searches for where a value would go in a sorted sequence.\n *\n * This is not a method for checking containment (like javascript in).\n *\n * The typical use case for this operation is \"binning\", \"bucketing\", or\n * \"discretizing\". The values are assigned to bucket-indices based on the edges\n * listed in 'sortedSequence'. This operation returns the bucket-index for each\n * value.\n *\n * The side argument controls which index is returned if a value lands exactly\n * on an edge.\n *\n * The axis is not settable for this operation. It always operates on the\n * innermost dimension (axis=-1). The operation will accept any number of outer\n * dimensions.\n *\n * Note: This operation assumes that 'sortedSequence' is sorted along the\n * innermost axis, maybe using 'sort(..., axis=-1)'. If the sequence is not\n * sorted no error is raised and the content of the returned tensor is not well\n * defined.\n *\n * ```js\n * const edges = tf.tensor1d([-1, 3.3, 9.1, 10.0]);\n * let values = tf.tensor1d([0.0, 4.1, 12.0]);\n * const result1 = tf.searchSorted(edges, values, 'left');\n * result1.print(); // [1, 2, 4]\n *\n * const seq = tf.tensor1d([0, 3, 9, 10, 10]);\n * values = tf.tensor1d([0, 4, 10]);\n * const result2 = tf.searchSorted(seq, values, 'left');\n * result2.print(); // [0, 2, 3]\n * const result3 = tf.searchSorted(seq, values, 'right');\n * result3.print(); // [1, 2, 5]\n *\n * const sortedSequence = tf.tensor2d([[0., 3., 8., 9., 10.],\n *                                     [1., 2., 3., 4., 5.]]);\n * values = tf.tensor2d([[9.8, 2.1, 4.3],\n *                       [0.1, 6.6, 4.5, ]]);\n * const result4 = tf.searchSorted(sortedSequence, values, 'left');\n * result4.print(); // [[4, 1, 2], [0, 5, 4]]\n * ```\n * @param sortedSequence: N-D. Sorted sequence.\n * @param values: N-D. Search values.\n * @param side: 'left'|'right'. Defaults to 'left'. 'left' corresponds to lower\n *     bound and 'right' to upper bound.\n * @return An N-D int32 tensor the size of values containing the result of\n *     applying either lower bound or upper bound (depending on side) to each\n *     value. The result is not a global index to the entire Tensor, but the\n *     index in the last dimension.\n * @doc {heading: 'Operations', subheading: 'Evaluation'}\n */\nfunction searchSorted_(\n    sortedSequence: Tensor|TensorLike, values: Tensor|TensorLike,\n    side: 'left'|'right' = 'left'): Tensor {\n  const $sortedSequence =\n      convertToTensor(sortedSequence, 'sortedSequence', 'searchSorted');\n  const $values = convertToTensor(values, 'values', 'searchSorted');\n\n  const sequenceSize = $sortedSequence.shape[$sortedSequence.shape.length - 1];\n  const valuesSize = $values.shape[$values.shape.length - 1];\n  const $sortedSequence2D = reshape($sortedSequence, [-1, sequenceSize]);\n  const $values2D = reshape($values, [-1, valuesSize]);\n\n  if ($sortedSequence2D.rank < 2) {\n    throw new Error(`Sorted input argument must be at least 2-dimensional`);\n  }\n  if ($sortedSequence2D.shape[0] !== $values2D.shape[0]) {\n    throw new Error(\n        `Leading dimension of 'sortedSequence' and 'values' must match.`);\n  }\n  if (sizeFromShape($values2D.shape) >= INT32_MAX) {\n    throw new Error(`values tensor size must less than ${INT32_MAX}`);\n  }\n  if ($sortedSequence2D.shape[1] >= INT32_MAX) {\n    throw new Error(`trailing dim_size must less than ${\n        INT32_MAX} for int32 output type, was ${$sortedSequence2D.shape[1]}`);\n  }\n\n  const inputs: SearchSortedInputs = {\n    sortedSequence: $sortedSequence2D,\n    values: $values2D,\n  };\n  const attrs: SearchSortedAttrs = {side};\n\n  return ENGINE.runKernel(SearchSorted, inputs as {}, attrs as {});\n}\n\nexport const searchSorted = /* @__PURE__ */ op({searchSorted_});\n", "/**\n * @license\n * Copyright 2022 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {TensorLike} from '../types';\nimport {searchSorted} from './search_sorted';\n\n/**\n * Searches for where a value would go in a sorted sequence.\n *\n * This is not a method for checking containment (like javascript in).\n *\n * The typical use case for this operation is \"binning\", \"bucketing\", or\n * \"discretizing\". The values are assigned to bucket-indices based on the edges\n * listed in 'sortedSequence'. This operation returns the bucket-index for each\n * value.\n *\n * The index returned corresponds to the first edge greater than or equal to the\n * value.\n *\n * The axis is not settable for this operation. It always operates on the\n * innermost dimension (axis=-1). The operation will accept any number of outer\n * dimensions.\n *\n * Note: This operation assumes that 'lowerBound' is sorted along the\n * innermost axis, maybe using 'sort(..., axis=-1)'. If the sequence is not\n * sorted no error is raised and the content of the returned tensor is not well\n * defined.\n *\n * ```js\n * const edges = tf.tensor1d([-1, 3.3, 9.1, 10.0]);\n * let values = tf.tensor1d([0.0, 4.1, 12.0]);\n * const result1 = tf.lowerBound(edges, values);\n * result1.print(); // [1, 2, 4]\n *\n * const seq = tf.tensor1d([0, 3, 9, 10, 10]);\n * values = tf.tensor1d([0, 4, 10]);\n * const result2 = tf.lowerBound(seq, values);\n * result2.print(); // [0, 2, 3]\n *\n * const sortedSequence = tf.tensor2d([[0., 3., 8., 9., 10.],\n *                                     [1., 2., 3., 4., 5.]]);\n * values = tf.tensor2d([[9.8, 2.1, 4.3],\n *                       [0.1, 6.6, 4.5, ]]);\n * const result3 = tf.lowerBound(sortedSequence, values);\n * result3.print(); // [[4, 1, 2], [0, 5, 4]]\n * ```\n * @param sortedSequence: N-D. Sorted sequence.\n * @param values: N-D. Search values.\n * @return An N-D int32 tensor the size of values containing the result of\n *     applying lower bound to each value. The result is not a global index to\n *     the entire Tensor, but the index in the last dimension.\n * @doc {heading: 'Operations', subheading: 'Evaluation'}\n */\nexport function lowerBound(\n    sortedSequence: Tensor|TensorLike, values: Tensor|TensorLike): Tensor {\n  return searchSorted(sortedSequence, values, 'left');\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {MaxPool, MaxPoolAttrs, MaxPoolInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport * as conv_util from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes the 2D max pooling of an image.\n *\n * @param x The input tensor, of rank 4 or rank 3 of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is assumed.\n * @param filterSize The filter size: `[filterHeight, filterWidth]`. If\n *     `filterSize` is a single number, then `filterHeight == filterWidth`.\n * @param strides The strides of the pooling: `[strideHeight, strideWidth]`. If\n *     `strides` is a single number, then `strideHeight == strideWidth`.\n * @param dilations The dilation rates: `[dilationHeight, dilationWidth]`\n *     in which we sample input values across the height and width dimensions\n *     in dilated pooling. Defaults to `[1, 1]`. If `dilations` is a single\n *     number, then `dilationHeight == dilationWidth`. If it is greater than\n *     1, then all values of `strides` must be 1.\n * @param pad The type of padding algorithm.\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n *    - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n */\nfunction maxPool_<T extends Tensor3D|Tensor4D>(\n    x: T|TensorLike, filterSize: [number, number]|number,\n    strides: [number, number]|number,\n    pad: 'valid'|'same'|number|conv_util.ExplicitPadding,\n    dimRoundingMode?: 'floor'|'round'|'ceil'): T {\n  const $x = convertToTensor(x, 'x', 'maxPool');\n  const dilations = 1;\n\n  let x4D = $x as Tensor4D;\n  let reshapedTo4D = false;\n  if ($x.rank === 3) {\n    reshapedTo4D = true;\n    x4D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2]]);\n  }\n\n  util.assert(\n      x4D.rank === 4,\n      () => `Error in maxPool: input must be rank 4 but got rank ${x4D.rank}.`);\n  util.assert(\n      conv_util.eitherStridesOrDilationsAreOne(strides, dilations),\n      () => 'Error in maxPool: Either strides or dilations must be 1. ' +\n          `Got strides ${strides} and dilations '${dilations}'`);\n  conv_util.checkPadOnDimRoundingMode('maxPool', pad, dimRoundingMode);\n  const inputs: MaxPoolInputs = {x: x4D};\n  const attrs: MaxPoolAttrs = {filterSize, strides, pad, dimRoundingMode};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  MaxPool, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n  return res;\n}\n\nexport const maxPool = /* @__PURE__ */ op({maxPool_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {MaxPool3D, MaxPool3DAttrs, MaxPool3DInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor4D, Tensor5D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {checkPadOnDimRoundingMode} from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes the 3D max pooling.\n *\n * ```js\n * const x = tf.tensor5d([1, 2, 3, 4, 5, 6, 7, 8], [1, 2, 2, 2, 1]);\n * const result = tf.maxPool3d(x, 2, 1, 'valid');\n * result.print();\n * ```\n *\n * @param x The input tensor, of rank 5 or rank 4 of shape\n *     `[batch, depth, height, width, inChannels]`.\n * @param filterSize The filter size:\n *     `[filterDepth, filterHeight, filterWidth]`.\n *     If `filterSize` is a single number,\n *     then `filterDepth == filterHeight == filterWidth`.\n * @param strides The strides of the pooling:\n *     `[strideDepth, strideHeight, strideWidth]`.\n *     If `strides` is a single number,\n *     then `strideDepth == strideHeight == strideWidth`.\n * @param pad The type of padding algorithm.\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1*1x1.\n *    - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n * @param dataFormat An optional string from: \"NDHWC\", \"NCDHW\". Defaults to\n *     \"NDHWC\". Specify the data format of the input and output data. With the\n *     default format \"NDHWC\", the data is stored in the order of: [batch,\n *     depth, height, width, channels]. Only \"NDHWC\" is currently supported.\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction maxPool3d_<T extends Tensor4D|Tensor5D>(\n    x: T|TensorLike, filterSize: [number, number, number]|number = [1, 1, 1],\n    strides: [number, number, number]|number, pad: 'valid'|'same'|number,\n    dimRoundingMode?: 'floor'|'round'|'ceil',\n    dataFormat: 'NDHWC'|'NCDHW' = 'NDHWC'): T {\n  const $x = convertToTensor(x, 'x', 'maxPool3d');\n\n  let x5D = $x as Tensor5D;\n  let reshapedTo5D = false;\n  if ($x.rank === 4) {\n    reshapedTo5D = true;\n    x5D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2], $x.shape[3]]);\n  }\n\n  util.assert(\n      x5D.rank === 5,\n      () => `Error in maxPool3d: x must be rank 5 but got rank ${x5D.rank}.`);\n  util.assert(\n      dataFormat === 'NDHWC',\n      () => `Error in maxPool3d: Only NDHWC is currently supported, ` +\n          `but got dataFormat of ${dataFormat}`);\n  checkPadOnDimRoundingMode('maxPool3d', pad, dimRoundingMode);\n  const inputs: MaxPool3DInputs = {x: x5D};\n  const attrs:\n      MaxPool3DAttrs = {filterSize, strides, pad, dimRoundingMode, dataFormat};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  MaxPool3D, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo5D) {\n    return reshape(\n               res, [res.shape[1], res.shape[2], res.shape[3], res.shape[4]]) as\n        T;\n  }\n\n  return res;\n}\n\nexport const maxPool3d = /* @__PURE__ */ op({maxPool3d_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {MaxPoolWithArgmax, MaxPoolWithArgmaxAttrs, MaxPoolWithArgmaxInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the 2D max pooling of an image with Argmax index.\n * The indices in argmax are flattened, so that a maximum value at position `[b,\n * y, x, c]` becomes flattened index: `(y * width + x) * channels + c` if\n * include_batch_in_index is False; `((b * height + y) * width + x) * channels\n * +c` if include_batch_in_index is True.\n *\n * The indices returned are always in `[0, height) x [0, width)` before\n * flattening.\n *\n * @param x The input tensor, of rank 4 or rank 3 of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is assumed.\n * @param filterSize The filter size: `[filterHeight, filterWidth]`. If\n *     `filterSize` is a single number, then `filterHeight == filterWidth`.\n * @param strides The strides of the pooling: `[strideHeight, strideWidth]`. If\n *     `strides` is a single number, then `strideHeight == strideWidth`.\n * @param dataFormat An optional string from: \"NDHWC\", \"NCDHW\". Defaults to\n *     \"NDHWC\". Specify the data format of the input and output data. With the\n *     default format \"NDHWC\", the data is stored in the order of: [batch,\n *     depth, height, width, channels]. Only \"NDHWC\" is currently supported.\n * @param pad The type of padding algorithm.\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n *    - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param includeBatchIndex Defaults to False. Whether to include batch\n *    dimension in flattened index of argmax.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction maxPoolWithArgmax_<T extends Tensor4D>(\n    x: T|TensorLike, filterSize: [number, number]|number,\n    strides: [number, number]|number, pad: 'valid'|'same'|number,\n    includeBatchInIndex = false): NamedTensorMap {\n  const $x = convertToTensor(x, 'x', 'maxPoolWithArgmax');\n\n  const inputs: MaxPoolWithArgmaxInputs = {x: $x};\n  const attrs:\n      MaxPoolWithArgmaxAttrs = {filterSize, strides, pad, includeBatchInIndex};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const result = ENGINE.runKernel(\n                     MaxPoolWithArgmax, inputs as unknown as NamedTensorMap,\n                     attrs as unknown as NamedAttrMap) as Tensor[];\n\n  return {result: result[0], indexes: result[1]};\n}\n\nexport const maxPoolWithArgmax = /* @__PURE__ */ op({maxPoolWithArgmax_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Maximum, MaximumInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {cast} from './cast';\nimport {op} from './operation';\n\n/**\n * Returns the max of a and b (`a > b ? a : b`) element-wise.\n * Supports broadcasting.\n *\n * We also expose `tf.maximumStrict` which has the same signature as this op and\n * asserts that `a` and `b` are the same shape (does not broadcast).\n *\n * ```js\n * const a = tf.tensor1d([1, 4, 3, 16]);\n * const b = tf.tensor1d([1, 2, 9, 4]);\n *\n * a.maximum(b).print();  // or tf.maximum(a, b)\n * ```\n *\n * ```js\n * // Broadcast maximum a with b.\n * const a = tf.tensor1d([2, 4, 6, 8]);\n * const b = tf.scalar(5);\n *\n * a.maximum(b).print();  // or tf.maximum(a, b)\n * ```\n *\n * @param a The first tensor.\n * @param b The second tensor. Must have the same type as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction maximum_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'maximum');\n  let $b = convertToTensor(b, 'b', 'maximum');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  if ($a.dtype === 'bool') {\n    $a = cast($a, 'int32');\n    $b = cast($b, 'int32');\n  }\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: MaximumInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(Maximum, inputs as unknown as NamedTensorMap);\n}\n\nexport const maximum = /* @__PURE__ */ op({maximum_});\n", "/**\n * @license\n * Copyright 2020 Google Inc. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Mean, MeanAttrs, MeanInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the mean of elements across dimensions of a `tf.Tensor`.\n *\n * Reduces `x` along the dimensions given in `axis`. Unless `keepDims` is\n * true, the rank of the `tf.Tensor` is reduced by 1 for each entry in `axis`.\n * If `keepDims` is true, the reduced dimensions are retained with length 1.\n * If `axis` has no entries, all dimensions are reduced, and a `tf.Tensor` with\n * a single element is returned.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3]);\n *\n * x.mean().print();  // or tf.mean(a)\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * const axis = 1;\n * x.mean(axis).print();  // or tf.mean(x, axis)\n * ```\n *\n * @param x The input tensor.\n * @param axis The dimension(s) to reduce. By default it reduces\n *     all dimensions.\n * @param keepDims If true, retains reduced dimensions with size 1.\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction mean_<T extends Tensor>(\n    x: Tensor|TensorLike, axis: number|number[] = null, keepDims = false): T {\n  const $x = convertToTensor(x, 'x', 'mean');\n\n  const inputs: MeanInputs = {x: $x};\n  const attrs: MeanAttrs = {axis, keepDims};\n\n  return ENGINE.runKernel(\n      Mean, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const mean = /* @__PURE__ */ op({mean_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Tensor} from '../tensor';\nimport {DataType, Rank, ShapeMap} from '../types';\nimport {assertNonNegativeIntegerDimensions, makeZerosTypedArray, sizeFromShape} from '../util';\n\nimport {complex} from './complex';\n\n/**\n * Creates a `tf.Tensor` with all elements set to 0.\n *\n * ```js\n * tf.zeros([2, 2]).print();\n * ```\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param dtype The type of an element in the resulting tensor. Can\n *     be 'float32', 'int32' or 'bool'. Defaults to 'float'.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function zeros<R extends Rank>(\n    shape: ShapeMap[R], dtype: DataType = 'float32'): Tensor<R> {\n  assertNonNegativeIntegerDimensions(shape);\n  if (dtype === 'complex64') {\n    const real = zeros(shape, 'float32');\n    const imag = zeros(shape, 'float32');\n    return complex(real, imag);\n  }\n  const values = makeZerosTypedArray(sizeFromShape(shape), dtype);\n  return ENGINE.makeTensor(values, shape, dtype) as Tensor<R>;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Tensor} from '../tensor';\nimport {DataType, Rank, ShapeMap} from '../types';\nimport {makeOnesTypedArray, sizeFromShape} from '../util';\nimport {assertNonNegativeIntegerDimensions} from '../util_base';\nimport {complex} from './complex';\nimport {zeros} from './zeros';\n\n/**\n * Creates a `tf.Tensor` with all elements set to 1.\n *\n * ```js\n * tf.ones([2, 2]).print();\n * ```\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param dtype The type of an element in the resulting tensor. Defaults to\n *     'float'.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function ones<R extends Rank>(\n    shape: ShapeMap[R], dtype: DataType = 'float32'): Tensor<R> {\n  assertNonNegativeIntegerDimensions(shape);\n  if (dtype === 'complex64') {\n    const real = ones(shape, 'float32');\n    const imag = zeros(shape, 'float32');\n    return complex(real, imag);\n  }\n  const values = makeOnesTypedArray(sizeFromShape(shape), dtype);\n  return ENGINE.makeTensor(values, shape, dtype) as Tensor<R>;\n}\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {matMul} from './mat_mul';\nimport {ones} from './ones';\nimport {reshape} from './reshape';\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {sizeFromShape} from '../util_base';\n\n/**\n * Broadcasts parameters for evaluation on an N-D grid.\n *\n * Given N one-dimensional coordinate arrays `*args`, returns a list `outputs`\n * of N-D coordinate arrays for evaluating expressions on an N-D grid.\n *\n * Notes:\n * `meshgrid` supports cartesian ('xy') and matrix ('ij') indexing conventions.\n * When the `indexing` argument is set to 'xy' (the default), the broadcasting\n * instructions for the first two dimensions are swapped.\n * Examples:\n * Calling `const [X, Y] = meshgrid(x, y)` with the tensors\n *\n * ```javascript\n * const x = [1, 2, 3];\n * const y = [4, 5, 6];\n * const [X, Y] = tf.meshgrid(x, y);\n * // X = [[1, 2, 3],\n * //      [1, 2, 3],\n * //      [1, 2, 3]]\n * // Y = [[4, 4, 4],\n * //      [5, 5, 5],\n * //      [6, 6, 6]]\n * ```\n *\n * @param x Tensor with rank geq 1.\n * @param y Tensor with rank geq 1.\n * @param indexing\n *\n * @doc {heading: 'Operations', subheading: 'Slicing and Joining'}\n */\nexport function meshgrid<T extends Tensor>(\n    x?: T|TensorLike, y?: T|TensorLike, {indexing = 'xy'} = {}): T[] {\n  if (indexing !== 'xy' && indexing !== 'ij') {\n    throw new TypeError(\n        `${indexing} is not a valid third argument to meshgrid`);\n  }\n  if (x === undefined) {\n    return [];\n  }\n  let $x = convertToTensor(\n      x, 'x', 'meshgrid', x instanceof Tensor ? x.dtype : 'float32');\n\n  if (y === undefined) {\n    return [$x];\n  }\n  let $y = convertToTensor(\n      y, 'y', 'meshgrid', y instanceof Tensor ? y.dtype : 'float32');\n\n  const w = sizeFromShape($x.shape);\n  const h = sizeFromShape($y.shape);\n\n  if (indexing === 'xy') {\n    $x = reshape($x, [1, -1]) as T;\n    $y = reshape($y, [-1, 1]) as T;\n    return [\n      matMul(ones([h, 1], $x.dtype), $x),\n      matMul($y, ones([1, w], $y.dtype)),\n    ];\n  }\n\n  $x = reshape($x, [-1, 1]) as T;\n  $y = reshape($y, [1, -1]) as T;\n  return [\n    matMul($x, ones([1, h], $x.dtype)),\n    matMul(ones([w, 1], $y.dtype), $y),\n  ];\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Minimum, MinimumInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {cast} from './cast';\nimport {op} from './operation';\n\n/**\n * Returns the min of a and b (`a < b ? a : b`) element-wise.\n * Supports broadcasting.\n *\n * We also expose `minimumStrict` which has the same signature as this op and\n * asserts that `a` and `b` are the same shape (does not broadcast).\n *\n * ```js\n * const a = tf.tensor1d([1, 4, 3, 16]);\n * const b = tf.tensor1d([1, 2, 9, 4]);\n *\n * a.minimum(b).print();  // or tf.minimum(a, b)\n * ```\n *\n * ```js\n * // Broadcast minimum a with b.\n * const a = tf.tensor1d([2, 4, 6, 8]);\n * const b = tf.scalar(5);\n *\n * a.minimum(b).print();  // or tf.minimum(a, b)\n * ```\n *\n * @param a The first tensor.\n * @param b The second tensor. Must have the same type as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction minimum_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'minimum');\n  let $b = convertToTensor(b, 'b', 'minimum');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  if ($a.dtype === 'bool') {\n    $a = cast($a, 'int32');\n    $b = cast($b, 'int32');\n  }\n\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: MinimumInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(Minimum, inputs as unknown as NamedTensorMap);\n}\n\nexport const minimum = /* @__PURE__ */ op({minimum_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {MirrorPad, MirrorPadAttrs, MirrorPadInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Pads a `tf.Tensor` using mirror padding.\n *\n * This operation implements the `REFLECT` and `SYMMETRIC` modes of pad.\n *\n * ```js\n * const x = tf.range(0, 9).reshape([1, 1, 3, 3]);\n * x.mirrorPad([[0, 0], [0, 0], [2, 2], [2, 2]], 'reflect').print();\n * ```\n * @param x The tensor to pad.\n * @param paddings An array of length `R` (the rank of the tensor), where\n * each element is a length-2 tuple of ints `[padBefore, padAfter]`,\n * specifying how much to pad along each dimension of the tensor.\n * In \"reflect\" mode, the padded regions do not include the borders,\n * while in \"symmetric\" mode the padded regions do include the borders.\n * For example, if the input is `[1, 2, 3]` and paddings is `[0, 2]`,\n * then the output is `[1, 2, 3, 2, 1]` in \"reflect\" mode, and\n * `[1, 2, 3, 3, 2]` in \"symmetric\" mode.\n * If `mode` is \"reflect\" then both `paddings[D, 0]` and `paddings[D, 1]`\n * must be no greater than `x.shape[D] - 1`. If mode is \"symmetric\"\n * then both `paddings[D, 0]` and `paddings[D, 1]` must be no greater than\n * `x.shape[D]`\n * @param mode String to specify padding mode. Can be `'reflect' | 'symmetric'`\n */\n/** @doc {heading: 'Tensors', subheading: 'Transformations'} */\nfunction mirrorPad_<T extends Tensor>(\n    x: T|TensorLike, paddings: Array<[number, number]>,\n    mode: 'reflect'|'symmetric'): T {\n  util.assert(\n      mode === 'reflect' || mode === 'symmetric',\n      () => `Invalid mode. Mode must be either reflect or symmetric. ` +\n          `Got ${mode}.`);\n\n  const $x = convertToTensor(x, 'x', 'mirrorPad');\n  if ($x.rank === 0) {\n    throw new Error(\n        'mirrorPad(scalar) is not defined. ' +\n        'Pass non-scalar to mirrorPad');\n  }\n  util.assert(\n      paddings.length === $x.rank,\n      () => `Padding doesn't match input. Must be ${$x.rank}. ` +\n          `Got ${paddings.length}.`);\n  const shapeOffset = mode === 'reflect' ? 1 : 0;\n  for (let i = 0; i < $x.rank; i++) {\n    util.assert(\n        paddings[i].length === 2,\n        () => `Invalid number of paddings. Must be length of 2 each.`);\n    util.assert(\n        paddings[i][0] >= 0 && paddings[i][0] <= $x.shape[i] - shapeOffset &&\n            paddings[i][1] >= 0 && paddings[i][1] <= $x.shape[i] - shapeOffset,\n        () => `Padding in dimension ${i} cannot be greater than or equal ` +\n            `to ${$x.shape[i] - shapeOffset} or less than 0 for input of ` +\n            `shape ${$x.shape}`);\n  }\n\n  const attrs: MirrorPadAttrs = {paddings, mode};\n  const inputs: MirrorPadInputs = {x: $x};\n  return ENGINE.runKernel(\n      MirrorPad, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const mirrorPad = /* @__PURE__ */ op({mirrorPad_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Mod, ModInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Returns the mod of a and b element-wise.\n * `floor(x / y) * y + mod(x, y) = x`\n * Supports broadcasting.\n *\n * We also expose `tf.modStrict` which has the same signature as this op and\n * asserts that `a` and `b` are the same shape (does not broadcast).\n *\n * ```js\n * const a = tf.tensor1d([1, 4, 3, 16]);\n * const b = tf.tensor1d([1, 2, 9, 4]);\n *\n * a.mod(b).print();  // or tf.mod(a, b)\n * ```\n *\n * ```js\n * // Broadcast a mod b.\n * const a = tf.tensor1d([2, 4, 6, 8]);\n * const b = tf.scalar(5);\n *\n * a.mod(b).print();  // or tf.mod(a, b)\n * ```\n *\n * @param a The first tensor.\n * @param b The second tensor. Must have the same type as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction mod_<T extends Tensor>(a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'mod');\n  let $b = convertToTensor(b, 'b', 'mod');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  const inputs: ModInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(Mod, inputs as unknown as NamedTensorMap);\n}\n\nexport const mod = /* @__PURE__ */ op({mod_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {parseAxisParam} from '../util';\n\nimport {expandShapeToKeepDim} from './axis_util';\nimport {cast} from './cast';\nimport {mean} from './mean';\nimport {op} from './operation';\nimport {reshape} from './reshape';\nimport {square} from './square';\nimport {sub} from './sub';\n\n/**\n * Calculates the mean and variance of `x`. The mean and variance are\n * calculated by aggregating the contents of `x` across `axes`. If `x` is\n * 1-D and `axes = [0]` this is just the mean and variance of a vector.\n *\n * @param x The input tensor.\n * @param axis The dimension(s) along with to compute mean and\n *     variance. By default it reduces all dimensions.\n * @param keepDims If true, the moments have the same dimensionality as the\n *     input.\n * @return An object with two keys: `mean` and `variance`.\n *\n * @doc {heading: 'Operations', subheading: 'Normalization'}\n */\nfunction moments_(\n    x: Tensor|TensorLike, axis: number|number[] = null,\n    keepDims = false): {mean: Tensor, variance: Tensor} {\n  x = convertToTensor(x, 'x', 'moments');\n  const axes = parseAxisParam(axis, x.shape);\n  const xMean = mean(x, axes, keepDims);\n  let keepDimsShape = xMean.shape;\n  if (!keepDims) {\n    keepDimsShape = expandShapeToKeepDim(xMean.shape, axes);\n  }\n  const devSquared =\n      square(sub(cast(x, 'float32'), reshape(xMean, keepDimsShape)));\n  const variance = mean(devSquared, axes, keepDims);\n  return {mean: xMean, variance};\n}\n\nexport const moments = /* @__PURE__ */ op({moments_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor2D} from '../tensor';\nimport {convertToTensor, convertToTensorArray} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {op} from './operation';\n\n/**\n * @docalias (data: Tensor2D, c: Tensor2D, h: Tensor2D): [Tensor2D, Tensor2D]\n */\nexport type LSTMCellFunc = {\n  (data: Tensor2D, c: Tensor2D, h: Tensor2D): [Tensor2D, Tensor2D];\n};\n\n/**\n * Computes the next states and outputs of a stack of LSTMCells.\n *\n * Each cell output is used as input to the next cell.\n *\n * Returns `[cellState, cellOutput]`.\n *\n * Derived from tf.contrib.rn.MultiRNNCell.\n *\n * @param lstmCells Array of LSTMCell functions.\n * @param data The input to the cell.\n * @param c Array of previous cell states.\n * @param h Array of previous cell outputs.\n *\n * @doc {heading: 'Operations', subheading: 'RNN'}\n */\nfunction multiRNNCell_(\n    lstmCells: LSTMCellFunc[], data: Tensor2D|TensorLike,\n    c: Array<Tensor2D|TensorLike>,\n    h: Array<Tensor2D|TensorLike>): [Tensor2D[], Tensor2D[]] {\n  const $data = convertToTensor(data, 'data', 'multiRNNCell');\n  const $c = convertToTensorArray(c, 'c', 'multiRNNCell');\n  const $h = convertToTensorArray(h, 'h', 'multiRNNCell');\n\n  let input = $data;\n  const newStates = [];\n  for (let i = 0; i < lstmCells.length; i++) {\n    const output = lstmCells[i](input, $c[i], $h[i]);\n    newStates.push(output[0]);\n    newStates.push(output[1]);\n    input = output[1];\n  }\n  const newC: Tensor2D[] = [];\n  const newH: Tensor2D[] = [];\n  for (let i = 0; i < newStates.length; i += 2) {\n    newC.push(newStates[i]);\n    newH.push(newStates[i + 1]);\n  }\n  return [newC, newH];\n}\nexport const multiRNNCell = /* @__PURE__ */ op({multiRNNCell_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Multinomial, MultinomialAttrs, MultinomialInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor1D, Tensor2D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Creates a `tf.Tensor` with values drawn from a multinomial distribution.\n *\n * ```js\n * const probs = tf.tensor([.75, .25]);\n * tf.multinomial(probs, 3).print();\n * ```\n *\n * @param logits 1D array with unnormalized log-probabilities, or\n *     2D array of shape `[batchSize, numOutcomes]`. See the `normalized`\n *     parameter.\n * @param numSamples Number of samples to draw for each row slice.\n * @param seed The seed number.\n * @param normalized Whether the provided `logits` are normalized true\n *     probabilities (sum to 1). Defaults to false.\n * @return 1D array of shape `[numSamples]`, or 2D array of shape\n *     `[batchSize, numSamples]`, depending on the rank of the input.\n *\n * @doc {heading: 'Tensors', subheading: 'Random'}\n */\nfunction multinomial_(\n    logits: Tensor1D|Tensor2D|TensorLike, numSamples: number, seed?: number,\n    normalized = false): Tensor1D|Tensor2D {\n  const $logits = convertToTensor(logits, 'logits', 'multinomial');\n  const numOutcomes = $logits.size;\n  const origRank = $logits.rank;\n  if (numOutcomes < 2) {\n    throw new Error(\n        `Error in multinomial: you need at least 2 outcomes, but got ` +\n        `${numOutcomes}.`);\n  }\n  if (origRank > 2) {\n    throw new Error(`Rank of probabilities must be 1 or 2, but is ${origRank}`);\n  }\n  // TODO(lina128): Investigate correct seed behavior. The code seems not allow\n  // setting see to 0.\n  seed = seed || Math.random();\n\n  // The kernel only accepts (and returns) rank 2 tensors.\n  const logits2D: Tensor2D =\n      origRank === 1 ? reshape($logits, [1, -1]) : $logits as Tensor2D;\n\n  const inputs: MultinomialInputs = {logits: logits2D};\n  const attrs: MultinomialAttrs = {numSamples, seed, normalized};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  Multinomial, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as Tensor2D;\n\n  // tslint:disable-next-line:no-unnecessary-type-assertion\n  return origRank === 1 ? reshape(res, [res.size]) as Tensor1D : res;\n}\n\nexport const multinomial = /* @__PURE__ */ op({multinomial_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {NotEqual, NotEqualInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {op} from './operation';\n\n/**\n * Returns the truth value of (a != b) element-wise. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3]);\n * const b = tf.tensor1d([0, 2, 3]);\n *\n * a.notEqual(b).print();\n * ```\n * @param a The first input tensor.\n * @param b The second input tensor. Must have the same dtype as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction notEqual_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'notEqual', 'string_or_numeric');\n  let $b = convertToTensor(b, 'b', 'notEqual', 'string_or_numeric');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: NotEqualInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(NotEqual, inputs as unknown as NamedTensorMap);\n}\n\nexport const notEqual = /* @__PURE__ */ op({notEqual_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {OneHot, OneHotAttrs, OneHotInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {DataType, TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Creates a one-hot `tf.Tensor`. The locations represented by `indices` take\n * value `onValue` (defaults to 1), while all other locations take value\n * `offValue` (defaults to 0). If `indices` is rank `R`, the output has rank\n * `R+1` with the last axis of size `depth`.\n * `indices` used to encode prediction class must start from 0. For example,\n *  if you have 3 classes of data, class 1 should be encoded as 0, class 2\n *  should be 1, and class 3 should be 2.\n *\n * ```js\n * tf.oneHot(tf.tensor1d([0, 1], 'int32'), 3).print();\n * ```\n *\n * @param indices `tf.Tensor` of indices with dtype `int32`. Indices must\n * start from 0.\n * @param depth The depth of the one hot dimension.\n * @param onValue A number used to fill in the output when the index matches\n * the location.\n * @param offValue A number used to fill in the output when the index does\n *     not match the location.\n * @param dtype The dtype of the output tensor, default to 'int32'.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction oneHot_(\n    indices: Tensor|TensorLike, depth: number, onValue = 1, offValue = 0,\n    dtype: DataType = 'int32'): Tensor {\n  if (depth < 2) {\n    throw new Error(`Error in oneHot: depth must be >=2, but it is ${depth}`);\n  }\n  const $indices = convertToTensor(indices, 'indices', 'oneHot', 'int32');\n\n  const inputs: OneHotInputs = {indices: $indices};\n  const attrs: OneHotAttrs = {dtype, depth, onValue, offValue};\n\n  return ENGINE.runKernel(\n      OneHot, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const oneHot = /* @__PURE__ */ op({oneHot_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {OnesLike, OnesLikeInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Creates a `tf.Tensor` with all elements set to 1 with the same shape as the\n * given tensor.\n *\n * ```js\n * const x = tf.tensor([1, 2]);\n * tf.onesLike(x).print();\n * ```\n * @param x A tensor.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction onesLike_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'onesLike');\n\n  const inputs: OnesLikeInputs = {x: $x};\n  return ENGINE.runKernel(OnesLike, inputs as unknown as NamedTensorMap);\n}\n\nexport const onesLike = /* @__PURE__ */ op({onesLike_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor1D, Tensor2D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {matMul} from './mat_mul';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes the outer product of two vectors, `v1` and `v2`.\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3]);\n * const b = tf.tensor1d([3, 4, 5]);\n *\n * tf.outerProduct(a, b).print();\n * ```\n * @param v1 The first vector in the outer product operation.\n * @param v2 The second vector in the outer product operation.\n *\n * @doc {heading: 'Operations', subheading: 'Matrices'}\n */\nfunction outerProduct_(\n    v1: Tensor1D|TensorLike, v2: Tensor1D|TensorLike): Tensor2D {\n  const $v1 = convertToTensor(v1, 'v1', 'outerProduct');\n  const $v2 = convertToTensor(v2, 'v2', 'outerProduct');\n\n  util.assert(\n      $v1.rank === 1 && $v2.rank === 1,\n      () => `Error in outerProduct: inputs must be rank 1, but got ranks ` +\n          `${$v1.rank} and ${$v2.rank}.`);\n\n  const v12D = reshape($v1, [-1, 1]);\n  const v22D = reshape($v2, [1, -1]);\n  return matMul(v12D, v22D);\n}\n\nexport const outerProduct = /* @__PURE__ */ op({outerProduct_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {PadV2, PadV2Attrs, PadV2Inputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Pads a `tf.Tensor` with a given value and paddings.\n *\n * This operation implements `CONSTANT` mode. For `REFLECT` and `SYMMETRIC`,\n * refer to `tf.mirrorPad`.\n *\n * Also available are stricter rank-specific methods with the same signature\n * as this method that assert that `paddings` is of given length.\n *   - `tf.pad1d`\n *   - `tf.pad2d`\n *   - `tf.pad3d`\n *   - `tf.pad4d`\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n * x.pad([[1, 2]]).print();\n * ```\n * @param x The tensor to pad.\n * @param paddings An array of length `R` (the rank of the tensor), where\n * each element is a length-2 tuple of ints `[padBefore, padAfter]`,\n * specifying how much to pad along each dimension of the tensor.\n * @param constantValue The pad value to use. Defaults to 0.\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction pad_<T extends Tensor>(\n    x: T|TensorLike, paddings: Array<[number, number]>, constantValue = 0): T {\n  const $x = convertToTensor(x, 'x', 'pad');\n  if ($x.rank === 0) {\n    throw new Error('pad(scalar) is not defined. Pass non-scalar to pad');\n  }\n\n  const attrs: PadV2Attrs = {paddings, constantValue};\n  const inputs: PadV2Inputs = {x: $x};\n  return ENGINE.runKernel(\n      PadV2, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const pad = /* @__PURE__ */ op({pad_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor1D} from '../tensor';\nimport {TensorLike} from '../types';\nimport {assert} from '../util';\nimport {op} from './operation';\nimport {pad} from './pad';\n\n/**\n * Pads a `tf.Tensor1D` with a given value and paddings. See `pad` for details.\n */\nfunction pad1d_(\n    x: Tensor1D|TensorLike, paddings: [number, number],\n    constantValue = 0): Tensor1D {\n  assert(\n      paddings.length === 2,\n      () => 'Invalid number of paddings. Must be length of 2.');\n  return pad(x, [paddings], constantValue);\n}\n\nexport const pad1d = /* @__PURE__ */ op({pad1d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor2D} from '../tensor';\nimport {TensorLike} from '../types';\nimport {assert} from '../util';\nimport {op} from './operation';\nimport {pad} from './pad';\n\n/**\n * Pads a `tf.Tensor2D` with a given value and paddings. See `pad` for details.\n */\nfunction pad2d_(\n    x: Tensor2D|TensorLike, paddings: [[number, number], [number, number]],\n    constantValue = 0): Tensor2D {\n  assert(\n      paddings.length === 2 && paddings[0].length === 2 &&\n          paddings[1].length === 2,\n      () => 'Invalid number of paddings. Must be length of 2 each.');\n  return pad(x, paddings, constantValue);\n}\n\nexport const pad2d = /* @__PURE__ */ op({pad2d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor3D} from '../tensor';\nimport {TensorLike} from '../types';\nimport {assert} from '../util';\nimport {op} from './operation';\nimport {pad} from './pad';\n\n/**\n * Pads a `tf.Tensor3D` with a given value and paddings. See `pad` for details.\n */\nfunction pad3d_(\n    x: Tensor3D|TensorLike,\n    paddings: [[number, number], [number, number], [number, number]],\n    constantValue = 0): Tensor3D {\n  assert(\n      paddings.length === 3 && paddings[0].length === 2 &&\n          paddings[1].length === 2 && paddings[2].length === 2,\n      () => 'Invalid number of paddings. Must be length of 2 each.');\n  return pad(x, paddings, constantValue);\n}\n\nexport const pad3d = /* @__PURE__ */ op({pad3d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor4D} from '../tensor';\nimport {TensorLike} from '../types';\nimport {assert} from '../util';\nimport {op} from './operation';\nimport {pad} from './pad';\n\n/**\n * Pads a `tf.Tensor4D` with a given value and paddings. See `pad` for details.\n */\nfunction pad4d_(\n    x: Tensor4D|TensorLike,\n    paddings:\n        [\n          [number, number], [number, number], [number, number], [number, number]\n        ],\n    constantValue = 0): Tensor4D {\n  assert(\n      paddings.length === 4 && paddings[0].length === 2 &&\n          paddings[1].length === 2 && paddings[2].length === 2 &&\n          paddings[3].length === 2,\n      () => 'Invalid number of paddings. Must be length of 2 each.');\n  return pad(x, paddings, constantValue);\n}\n\nexport const pad4d = /* @__PURE__ */ op({pad4d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {SpaceToBatchND, SpaceToBatchNDAttrs, SpaceToBatchNDInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * This operation divides \"spatial\" dimensions `[1, ..., M]` of the input into\n * a grid of blocks of shape `blockShape`, and interleaves these blocks with\n * the \"batch\" dimension (0) such that in the output, the spatial\n * dimensions `[1, ..., M]` correspond to the position within the grid,\n * and the batch dimension combines both the position within a spatial block\n * and the original batch position. Prior to division into blocks,\n * the spatial dimensions of the input are optionally zero padded\n * according to `paddings`. See below for a precise description.\n *\n * ```js\n * const x = tf.tensor4d([1, 2, 3, 4], [1, 2, 2, 1]);\n * const blockShape = [2, 2];\n * const paddings = [[0, 0], [0, 0]];\n *\n * x.spaceToBatchND(blockShape, paddings).print();\n * ```\n *\n * @param x A `tf.Tensor`. N-D with `x.shape` = `[batch] + spatialShape +\n * remainingShape`, where spatialShape has `M` dimensions.\n * @param blockShape A 1-D array. Must have shape `[M]`, all values must\n * be >= 1.\n * @param paddings A 2-D array. Must have shape `[M, 2]`, all values must be >=\n *     0. `paddings[i] = [padStart, padEnd]` specifies the amount to zero-pad\n * from input dimension `i + 1`, which corresponds to spatial dimension `i`. It\n * is required that\n * `(inputShape[i + 1] + padStart + padEnd) % blockShape[i] === 0`\n *\n * This operation is equivalent to the following steps:\n *\n * 1. Zero-pad the start and end of dimensions `[1, ..., M]` of the input\n * according to `paddings` to produce `padded` of shape paddedShape.\n *\n * 2. Reshape `padded` to `reshapedPadded` of shape:\n * `[batch] + [paddedShape[1] / blockShape[0], blockShape[0], ...,\n * paddedShape[M] / blockShape[M-1], blockShape[M-1]] + remainingShape`\n *\n * 3. Permute dimensions of `reshapedPadded` to produce `permutedReshapedPadded`\n * of shape: `blockShape + [batch] + [paddedShape[1] / blockShape[0], ...,\n * paddedShape[M] / blockShape[M-1]] + remainingShape`\n *\n * 4. Reshape `permutedReshapedPadded` to flatten `blockShape` into the\n * batch dimension, producing an output tensor of shape:\n * `[batch * prod(blockShape)] + [paddedShape[1] / blockShape[0], ...,\n * paddedShape[M] / blockShape[M-1]] + remainingShape`\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction spaceToBatchND_<T extends Tensor>(\n    x: T|TensorLike, blockShape: number[], paddings: number[][]): T {\n  const $x = convertToTensor(x, 'x', 'spaceToBatchND');\n\n  util.assert(\n      $x.rank >= 1 + blockShape.length,\n      () => `input rank ${$x.rank} should be > than [blockShape] ${\n          blockShape.length}`);\n\n  util.assert(\n      paddings.length === blockShape.length,\n      () => `paddings.shape[0] ${\n          paddings.length} must be equal to [blockShape] ${blockShape.length}`);\n\n  util.assert(\n      $x.shape.reduce(\n          (a, b, i) => {\n            if (i > 0 && i <= blockShape.length) {\n              return a &&\n                  ((b + paddings[i - 1][0] + paddings[i - 1][1]) %\n                       blockShape[i - 1] ===\n                   0);\n            }\n            return a;\n          },\n          true),\n      () => `input spatial dimensions ${$x.shape.slice(1)} with paddings ${\n          paddings.toString()} must be divisible by blockShapes ${\n          blockShape.toString()}`);\n\n  const inputs: SpaceToBatchNDInputs = {x: $x};\n  const attrs: SpaceToBatchNDAttrs = {blockShape, paddings};\n\n  return ENGINE.runKernel(\n      SpaceToBatchND, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const spaceToBatchND = /* @__PURE__ */ op({spaceToBatchND_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {avgPool} from './avg_pool';\nimport {batchToSpaceND} from './batch_to_space_nd';\nimport * as conv_util from './conv_util';\nimport {maxPool} from './max_pool';\nimport {op} from './operation';\nimport {reshape} from './reshape';\nimport {spaceToBatchND} from './space_to_batch_nd';\n\n/**\n * Performs an N-D pooling operation\n *\n * @param input The input tensor, of rank 4 or rank 3 of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is assumed.\n * @param windowShape The filter size: `[filterHeight, filterWidth]`. If\n *     `filterSize` is a single number, then `filterHeight == filterWidth`.\n * @param poolingType The type of pooling, either 'max' or 'avg'.\n * @param pad The type of padding algorithm:\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n *    - For more info, see this guide:\n *     [https://www.tensorflow.org/api_guides/python/nn#Convolution](\n *         https://www.tensorflow.org/api_guides/python/nn#Convolution)\n * @param dilations The dilation rates: `[dilationHeight, dilationWidth]`\n *     in which we sample input values across the height and width dimensions\n *     in dilated pooling. Defaults to `[1, 1]`. If `dilationRate` is a single\n *     number, then `dilationHeight == dilationWidth`. If it is greater than\n *     1, then all values of `strides` must be 1.\n * @param strides The strides of the pooling: `[strideHeight, strideWidth]`. If\n *     `strides` is a single number, then `strideHeight == strideWidth`.\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction pool_<T extends Tensor3D|Tensor4D>(\n    input: T|TensorLike, windowShape: [number, number]|number,\n    poolingType: 'avg'|'max',\n    pad: 'valid'|'same'|number|conv_util.ExplicitPadding,\n    dilations?: [number, number]|number, strides?: [number, number]|number,\n    dimRoundingMode?: 'floor'|'round'|'ceil') {\n  if (dilations == null) {\n    dilations = [1, 1];\n  }\n  if (strides == null) {\n    strides = 1;\n  }\n  if (pad === 0) {\n    pad = 'valid';\n  }\n\n  const $x = convertToTensor(input, 'x', 'maxPool');\n  let x4D = $x as Tensor4D;\n  let reshapedTo4D = false;\n\n  if ($x.rank === 3) {\n    reshapedTo4D = true;\n    x4D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2]]);\n  }\n\n  util.assert(\n      conv_util.eitherStridesOrDilationsAreOne(strides, dilations),\n      () => 'Error in pool: Either strides or dilations must be 1. ' +\n          `Got strides ${strides} and dilations '${dilations}'`);\n\n  const convInfo = conv_util.computePool2DInfo(\n      x4D.shape, windowShape, strides, dilations, pad);\n  const dilation: [number, number] =\n      [convInfo.dilationHeight, convInfo.dilationWidth];\n\n  // The following implementation does batchToSpace(pool(spaceToBatch(x)))\n  // whenever dilation > 1 since the TF kernels do not support dilation > 1.\n  // tslint:disable-next-line:max-line-length\n  // https://github.com/tensorflow/tensorflow/blob/50f6bb67dc98c9b74630b6047aae7a4f8a40fd02/tensorflow/python/ops/nn_ops.py#L1037\n\n  let basePadding: number[][];\n  if (pad === 'same') {\n    basePadding = withSpaceToBatchBasePaddings(\n        [convInfo.filterHeight, convInfo.filterWidth], dilation);\n  } else {\n    basePadding = [[0, 0], [0, 0]];\n  }\n\n  const isDilationOne = dilation[0] === 1 && dilation[1] === 1;\n  const [adjustedPadding, adjustedCrops] = requiredSpaceToBatchPaddings(\n      [convInfo.inHeight, convInfo.inWidth], dilation, basePadding);\n  const convertedPad = isDilationOne ? pad : 'valid';\n  const convertedX =\n      isDilationOne ? x4D : spaceToBatchND(x4D, dilation, adjustedPadding);\n\n  const forwardOp = poolingType === 'avg' ?\n      () => avgPool(convertedX, windowShape, strides, convertedPad,\n                    dimRoundingMode) :\n      () => maxPool(convertedX, windowShape, strides, convertedPad,\n                    dimRoundingMode);\n  const y = forwardOp();\n\n  const res = isDilationOne ? y : batchToSpaceND(y, dilation, adjustedCrops);\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n\n  return res as T;\n}\n\n// Helper function to compute crops and paddings for pool with dilation > 1.\n// tslint:disable-next-line:max-line-length\n// https://github.com/tensorflow/tensorflow/blob/50f6bb67dc98c9b74630b6047aae7a4f8a40fd02/tensorflow/python/ops/array_ops.py#L2184\nfunction requiredSpaceToBatchPaddings(\n    inputShape: [number, number], blockShape: [number, number],\n    basePadding: number[][]) {\n  const padStart = basePadding.map(b => b[0]);\n  const origPadEnd = basePadding.map(b => b[1]);\n  const fullInputShape = inputShape.concat(padStart, origPadEnd);\n  const padEndExtra = blockShape.map((b, i) => (b - fullInputShape[i] % b) % b);\n  const padEnd = origPadEnd.map((s, i) => s + padEndExtra[i]);\n  const paddings = blockShape.map((_, i) => [padStart[i], padEnd[i]]);\n  const crops = blockShape.map((_, i) => [0, padEndExtra[i]]);\n  return [paddings, crops];\n}\n\n// Helper function to compute base paddings for pool with dilation > 1.\n// tslint:disable-next-line:max-line-length\n// https://github.com/tensorflow/tensorflow/blob/50f6bb67dc98c9b74630b6047aae7a4f8a40fd02/tensorflow/python/ops/nn_ops.py#L524\nfunction withSpaceToBatchBasePaddings(\n    filterShape: [number, number], dilation: [number, number]) {\n  // Spatial dimensions of the filters and the upsampled filters in which we\n  // introduce (rate - 1) zeros between consecutive filter values.\n  const dilatedFilterShape = filterShape.map((s, i) => {\n    return s + (s - 1) * (dilation[i] - 1);\n  });\n  const padExtraShape = dilatedFilterShape.map(s => s - 1);\n\n  // When padding is odd, we pad more at end, following the same\n  // convention as conv2d.\n  const padExtraStart = padExtraShape.map(s => Math.floor(s / 2));\n  const padExtraEnd = padExtraShape.map((s, i) => s - padExtraStart[i]);\n  return padExtraShape.map((_, i) => {\n    return [padExtraStart[i], padExtraEnd[i]];\n  });\n}\n\nexport const pool = /* @__PURE__ */ op({pool_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Prelu, PreluInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes leaky rectified linear element-wise with parametric alphas.\n *\n * `x < 0 ? alpha * x : f(x) = x`\n *\n * ```js\n * const x = tf.tensor1d([-1, 2, -3, 4]);\n * const alpha = tf.scalar(0.1);\n *\n * x.prelu(alpha).print();  // or tf.prelu(x, alpha)\n * ```\n * @param x The input tensor.\n * @param alpha Scaling factor for negative values.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction prelu_<T extends Tensor>(x: T|TensorLike, alpha: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'prelu');\n  const $alpha = convertToTensor(alpha, 'alpha', 'prelu');\n\n  const inputs: PreluInputs = {x: $x, alpha: $alpha};\n  return ENGINE.runKernel(Prelu, inputs as unknown as NamedTensorMap);\n}\n\nexport const prelu = /* @__PURE__ */ op({prelu_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Prod, ProdAttrs, ProdInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {cast} from './cast';\nimport {op} from './operation';\n\n/**\n * Computes the product of elements across dimensions of a `tf.Tensor`.\n *\n * Reduces the input along the dimensions given in `axes`. Unless `keepDims`\n * is true, the rank of the `tf.Tensor` is reduced by 1 for each entry in\n * `axes`. If `keepDims` is true, the reduced dimensions are retained with\n * length 1. If `axes` has no entries, all dimensions are reduced, and a\n * `tf.Tensor` with a single element is returned.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3]);\n *\n * x.prod().print();  // or tf.prod(x)\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * const axis = 1;\n * x.prod(axis).print();  // or tf.prod(x, axis)\n * ```\n *\n * @param x The input tensor to compute the product over. If the dtype is `bool`\n *   it will be converted to `int32` and the output dtype will be `int32`.\n * @param axis The dimension(s) to reduce. By default it reduces\n *     all dimensions.\n * @param keepDims If true, retains reduced dimensions with size 1.\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction prod_<T extends Tensor>(\n    x: Tensor|TensorLike, axis: number|number[] = null, keepDims = false): T {\n  let $x = convertToTensor(x, 'x', 'prod');\n\n  if ($x.dtype === 'bool') {\n    // bool is not an allowed type for the underlying kernel.\n    $x = cast($x, 'int32');\n  }\n\n  const inputs: ProdInputs = {x: $x};\n  const attrs: ProdAttrs = {axis, keepDims};\n\n  return ENGINE.runKernel(\n      Prod, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const prod = /* @__PURE__ */ op({prod_});\n", "/**\n * @license\n * Copyright 2022 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {RaggedGather, RaggedGatherAttrs, RaggedGatherInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {op} from './operation';\n\n/**\n * Gather ragged slices from params axis 0 according to indices.\n *\n * @param paramsNestedSplits: A list of at least 1 Tensor with type 'int32' The\n *     nestedRowSplits tensors that define the row-partitioning for the params\n *     RaggedTensor input.\n * @param paramsDenseValues: A Tensor. The flatValues for the params\n *     RaggedTensor.\n * @param indices: A Tensor. Must be one of type: int32. Indices in the\n *     outermost dimension of params of the values that should be gathered.\n * @param outputRaggedRank: An int that is >= 0. The ragged rank of the output\n *     RaggedTensor. outputNestedSplits will contain this number of rowSplits\n *     tensors. This value should equal indices.shape.ndims + params.raggedRank\n *     - 1.\n * @return A map with the following properties:\n *     - outputNestedSplits: A list of outputRaggedRank Tensor objects with the\n * same type as paramsNestedSplits.\n *     - outputDenseValues: A Tensor. Has the same type as paramsDenseValues.\n * @doc {heading: 'Operations', subheading: 'Ragged'}\n */\n\ninterface RaggedGatherMap {\n  outputNestedSplits: Tensor[];\n  outputDenseValues: Tensor;\n}\n\nfunction raggedGather_(\n    paramsNestedSplits: Tensor[], paramsDenseValues: Tensor|TensorLike,\n    indices: Tensor|TensorLike, outputRaggedRank: number): RaggedGatherMap {\n  const $paramsNestedSplits = paramsNestedSplits.map(\n      (t, i) => convertToTensor(t, `tensors${i}`, 'raggedGather', 'int32'));\n  const $paramsDenseValues =\n      convertToTensor(paramsDenseValues, 'paramsDenseValues', 'raggedGather');\n  const $indices = convertToTensor(indices, 'indices', 'raggedGather', 'int32');\n\n  const inputs: RaggedGatherInputs = {\n    paramsNestedSplits: $paramsNestedSplits,\n    paramsDenseValues: $paramsDenseValues,\n    indices: $indices,\n  };\n  const attrs: RaggedGatherAttrs = {outputRaggedRank};\n\n  const result: Tensor[] =\n      ENGINE.runKernel(RaggedGather, inputs as {}, attrs as {});\n  return {\n    outputNestedSplits: result.slice(0, result.length - 1),\n    outputDenseValues: result[result.length - 1],\n  };\n}\n\nexport const raggedGather = /* @__PURE__ */ op({raggedGather_});\n", "/**\n * @license\n * Copyright 2022 Google LLC.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {RaggedRange, RaggedRangeInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {op} from './operation';\n\n/**\n * Returns a RaggedTensor result composed from rtDenseValues and rtNestedSplits,\n * such that result[i] = [starts[i], starts[i] + deltas[i], ..., limits[i]]).\n *\n * @param starts: A Tensor. Must be one of the following types:\n *     'float32', 'int32'. The starts of each range.\n * @param limits: A Tensor. Must have the same type as starts. The limits of\n *     each range.\n * @param deltas: A Tensor. Must have the same type as starts. The deltas of\n *     each range.\n * @return A map with the following properties:\n *     - rtNestedSplits: A Tensor of type 'int32'.\n *     - rtDenseValues: A Tensor. Has the same type as starts.\n */\n\nfunction raggedRange_(\n    starts: Tensor|TensorLike, limits: Tensor|TensorLike,\n    deltas: Tensor|TensorLike): NamedTensorMap {\n  const $starts = convertToTensor(starts, 'starts', 'raggedRange');\n  const $limits =\n      convertToTensor(limits, 'limits', 'raggedRange', $starts.dtype);\n  const $deltas =\n      convertToTensor(deltas, 'deltas', 'raggedRange', $starts.dtype);\n\n  const inputs: RaggedRangeInputs = {\n    starts: $starts,\n    limits: $limits,\n    deltas: $deltas,\n  };\n\n  const result: Tensor[] = ENGINE.runKernel(RaggedRange, inputs as {});\n  return {\n    rtNestedSplits: result[0],\n    rtDenseValues: result[1],\n  };\n}\n\nexport const raggedRange = /* @__PURE__ */ op({raggedRange_});\n", "/**\n * @license\n * Copyright 2022 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {RaggedTensorToTensor, RaggedTensorToTensorAttrs, RaggedTensorToTensorInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {op} from './operation';\n\n/**\n * Create a dense tensor from a ragged tensor, possibly altering its shape.\n *\n * The raggedTensorToTensor op creates a dense tensor from am array of row\n * partition tensors, a value vector, and default values. If the shape is\n * unspecified, the minimal shape required to contain all the elements in the\n * ragged tensor (the natural shape) will be used. If some dimensions are left\n * unspecified, then the size of the natural shape is used in that dimension.\n *\n * The defaultValue will be broadcast to the output shape. After that, the\n * values from the ragged tensor overwrite the default values. Note that the\n * defaultValue must have less dimensions than the value.\n *\n * The row partition tensors are in the order of the dimensions. At present, the\n * types can be: \"ROW_SPLITS\": the row_splits tensor from the ragged tensor.\n *   \"VALUE_ROWIDS\": the value_rowids tensor from the ragged tensor.\n *   \"FIRST_DIM_SIZE\": if value_rowids is used for the first dimension, then it\n * is preceded by \"FIRST_DIM_SIZE\".\n * ```\n * @param shape: A Tensor. Must be one of the following types: 'int32'. The\n *     desired shape of the output tensor. If left unspecified (empty), the\n *     minimal shape required to contain all the elements in the ragged tensor\n *     (the natural shape) will be used. If some dimensions are left\n *     unspecified, then the size of the natural shape is used in that\n *     dimension.\n *\n *     Note that dense dimensions cannot be modified by the shape argument.\n *     Trying to change the size of a dense dimension will cause the op to fail.\n *     Examples: natural shape: [4, 5, 6] shape: -1 output shape: [4, 5, 6]\n *\n *     natural shape: [4, 5, 6] shape: [3, -1, 2] output shape: [3, 5, 2]\n *\n *     natural shape: [4, 5, 6] shape: [3, 7, 2] output shape: [3, 7, 2]\n * @param values: A Tensor. A 1D tensor representing the values of the ragged\n *     tensor.\n * @param defaultValue: A Tensor. Must have the same type as values. The\n *     defaultValue when the shape is larger than the ragged tensor. The\n *     defaultValue is broadcast until it is the shape of the output tensor,\n *     and then overwritten by values in the ragged tensor. The default value\n *     must be compatible with this broadcast operation, and must have fewer\n *     dimensions than the value tensor.\n * @param rowPartitionTensors: A list of at least 1 Tensor objects with the same\n *     type in: 'int32'.\n * @param rowPartitionTypes: A list of strings. The types of the row partition\n *     tensors. At present, these can be:\n *     \"ROW_SPLITS\": the row_splits tensor from the ragged tensor.\n *     \"VALUE_ROWIDS\": the value_rowids tensor from the ragged tensor.\n *     \"FIRST_DIM_SIZE\": if value_rowids is used for the first dimension, then\n *         it is preceded by \"FIRST_DIM_SIZE\". The tensors are in the order of\n *         the dimensions.\n * @return A Tensor. Has the same type as values.\n * @doc {heading: 'Operations', subheading: 'Ragged'}\n */\nfunction raggedTensorToTensor_(\n    shape: Tensor|TensorLike, values: Tensor|TensorLike,\n    defaultValue: Tensor|TensorLike, rowPartitionTensors: Tensor[],\n    rowPartitionTypes: string[]): Tensor {\n  const $shape =\n      convertToTensor(shape, 'shape', 'raggedTensorToTensor', 'int32');\n  const $values = convertToTensor(values, 'values', 'raggedTensorToTensor');\n  const $defaultValue = convertToTensor(\n      defaultValue, 'defaultValue', 'raggedTensorToTensor', $values.dtype);\n  const $rowPartitionTensors = rowPartitionTensors.map(\n      (t, i) =>\n          convertToTensor(t, `tensors${i}`, 'raggedTensorToTensor', 'int32'));\n\n  const inputs: RaggedTensorToTensorInputs = {\n    shape: $shape,\n    values: $values,\n    defaultValue: $defaultValue,\n    rowPartitionTensors: $rowPartitionTensors\n  };\n  const attrs: RaggedTensorToTensorAttrs = {rowPartitionTypes};\n\n  return ENGINE.runKernel(RaggedTensorToTensor, inputs as {}, attrs as {});\n}\n\nexport const raggedTensorToTensor = /* @__PURE__ */ op({raggedTensorToTensor_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Tensor} from '../tensor';\nimport {DataType, Rank, ShapeMap} from '../types';\nimport {sizeFromShape} from '../util';\nimport {assertNonNegativeIntegerDimensions} from '../util_base';\n\nimport {op} from './operation';\n\n/**\n * Creates a `tf.Tensor` with values sampled from a random number generator\n * function defined by the user.\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param randFunction A random number generator function which is called\n * for each element in the output tensor.\n * @param dtype The data type of the output tensor. Defaults to 'float32'.\n *\n * @doc {heading: 'Tensors', subheading: 'Random'}\n */\nfunction rand_<R extends Rank>(\n    shape: ShapeMap[R], randFunction: () => number,\n    dtype?: DataType): Tensor<R> {\n  assertNonNegativeIntegerDimensions(shape);\n  const size = sizeFromShape(shape);\n  let values = null;\n  if (dtype == null || dtype === 'float32') {\n    values = new Float32Array(size);\n  } else if (dtype === 'int32') {\n    values = new Int32Array(size);\n  } else if (dtype === 'bool') {\n    values = new Uint8Array(size);\n  } else {\n    throw new Error(`Unknown data type ${dtype}`);\n  }\n  for (let i = 0; i < size; i++) {\n    values[i] = randFunction();\n  }\n  return ENGINE.makeTensor(values, shape, dtype) as Tensor<R>;\n}\n\nexport const rand = /* @__PURE__ */ op({rand_});\n", "// A port of an algorithm by Johannes Baagøe <baagoe@baagoe.com>, 2010\n// http://baagoe.com/en/RandomMusings/javascript/\n// https://github.com/nquinlan/better-random-numbers-for-javascript-mirror\n// Original work is under MIT license -\n\n// Copyright (C) 2010 by Johannes Baagøe <baagoe@baagoe.org>\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\n\n\n(function(global, module, define) {\n\nfunction Alea(seed) {\n  var me = this, mash = Mash();\n\n  me.next = function() {\n    var t = 2091639 * me.s0 + me.c * 2.3283064365386963e-10; // 2^-32\n    me.s0 = me.s1;\n    me.s1 = me.s2;\n    return me.s2 = t - (me.c = t | 0);\n  };\n\n  // Apply the seeding algorithm from Baagoe.\n  me.c = 1;\n  me.s0 = mash(' ');\n  me.s1 = mash(' ');\n  me.s2 = mash(' ');\n  me.s0 -= mash(seed);\n  if (me.s0 < 0) { me.s0 += 1; }\n  me.s1 -= mash(seed);\n  if (me.s1 < 0) { me.s1 += 1; }\n  me.s2 -= mash(seed);\n  if (me.s2 < 0) { me.s2 += 1; }\n  mash = null;\n}\n\nfunction copy(f, t) {\n  t.c = f.c;\n  t.s0 = f.s0;\n  t.s1 = f.s1;\n  t.s2 = f.s2;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  var xg = new Alea(seed),\n      state = opts && opts.state,\n      prng = xg.next;\n  prng.int32 = function() { return (xg.next() * 0x100000000) | 0; }\n  prng.double = function() {\n    return prng() + (prng() * 0x200000 | 0) * 1.1102230246251565e-16; // 2^-53\n  };\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nfunction Mash() {\n  var n = 0xefc8249d;\n\n  var mash = function(data) {\n    data = String(data);\n    for (var i = 0; i < data.length; i++) {\n      n += data.charCodeAt(i);\n      var h = 0.02519603282416938 * n;\n      n = h >>> 0;\n      h -= n;\n      h *= n;\n      n = h >>> 0;\n      h -= n;\n      n += h * 0x100000000; // 2^32\n    }\n    return (n >>> 0) * 2.3283064365386963e-10; // 2^-32\n  };\n\n  return mash;\n}\n\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.alea = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n", "// A Javascript implementaion of the \"xor128\" prng algorithm by\n// George Marsaglia.  See http://www.jstatsoft.org/v08/i14/paper\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this, strseed = '';\n\n  me.x = 0;\n  me.y = 0;\n  me.z = 0;\n  me.w = 0;\n\n  // Set up generator function.\n  me.next = function() {\n    var t = me.x ^ (me.x << 11);\n    me.x = me.y;\n    me.y = me.z;\n    me.z = me.w;\n    return me.w ^= (me.w >>> 19) ^ t ^ (t >>> 8);\n  };\n\n  if (seed === (seed | 0)) {\n    // Integer seed.\n    me.x = seed;\n  } else {\n    // String seed.\n    strseed += seed;\n  }\n\n  // Mix in string seed, then discard an initial batch of 64 values.\n  for (var k = 0; k < strseed.length + 64; k++) {\n    me.x ^= strseed.charCodeAt(k) | 0;\n    me.next();\n  }\n}\n\nfunction copy(f, t) {\n  t.x = f.x;\n  t.y = f.y;\n  t.z = f.z;\n  t.w = f.w;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xor128 = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n", "// A Javascript implementaion of the \"xorwow\" prng algorithm by\n// George Marsaglia.  See http://www.jstatsoft.org/v08/i14/paper\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this, strseed = '';\n\n  // Set up generator function.\n  me.next = function() {\n    var t = (me.x ^ (me.x >>> 2));\n    me.x = me.y; me.y = me.z; me.z = me.w; me.w = me.v;\n    return (me.d = (me.d + 362437 | 0)) +\n       (me.v = (me.v ^ (me.v << 4)) ^ (t ^ (t << 1))) | 0;\n  };\n\n  me.x = 0;\n  me.y = 0;\n  me.z = 0;\n  me.w = 0;\n  me.v = 0;\n\n  if (seed === (seed | 0)) {\n    // Integer seed.\n    me.x = seed;\n  } else {\n    // String seed.\n    strseed += seed;\n  }\n\n  // Mix in string seed, then discard an initial batch of 64 values.\n  for (var k = 0; k < strseed.length + 64; k++) {\n    me.x ^= strseed.charCodeAt(k) | 0;\n    if (k == strseed.length) {\n      me.d = me.x << 10 ^ me.x >>> 4;\n    }\n    me.next();\n  }\n}\n\nfunction copy(f, t) {\n  t.x = f.x;\n  t.y = f.y;\n  t.z = f.z;\n  t.w = f.w;\n  t.v = f.v;\n  t.d = f.d;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xorwow = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n", "// A Javascript implementaion of the \"xorshift7\" algorithm by\n// François Panneton and Pierre L'ecuyer:\n// \"On the Xorgshift Random Number Generators\"\n// http://saluc.engr.uconn.edu/refs/crypto/rng/panneton05onthexorshift.pdf\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this;\n\n  // Set up generator function.\n  me.next = function() {\n    // Update xor generator.\n    var X = me.x, i = me.i, t, v, w;\n    t = X[i]; t ^= (t >>> 7); v = t ^ (t << 24);\n    t = X[(i + 1) & 7]; v ^= t ^ (t >>> 10);\n    t = X[(i + 3) & 7]; v ^= t ^ (t >>> 3);\n    t = X[(i + 4) & 7]; v ^= t ^ (t << 7);\n    t = X[(i + 7) & 7]; t = t ^ (t << 13); v ^= t ^ (t << 9);\n    X[i] = v;\n    me.i = (i + 1) & 7;\n    return v;\n  };\n\n  function init(me, seed) {\n    var j, w, X = [];\n\n    if (seed === (seed | 0)) {\n      // Seed state array using a 32-bit integer.\n      w = X[0] = seed;\n    } else {\n      // Seed state using a string.\n      seed = '' + seed;\n      for (j = 0; j < seed.length; ++j) {\n        X[j & 7] = (X[j & 7] << 15) ^\n            (seed.charCodeAt(j) + X[(j + 1) & 7] << 13);\n      }\n    }\n    // Enforce an array length of 8, not all zeroes.\n    while (X.length < 8) X.push(0);\n    for (j = 0; j < 8 && X[j] === 0; ++j);\n    if (j == 8) w = X[7] = -1; else w = X[j];\n\n    me.x = X;\n    me.i = 0;\n\n    // Discard an initial 256 values.\n    for (j = 256; j > 0; --j) {\n      me.next();\n    }\n  }\n\n  init(me, seed);\n}\n\nfunction copy(f, t) {\n  t.x = f.x.slice();\n  t.i = f.i;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  if (seed == null) seed = +(new Date);\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (state.x) copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xorshift7 = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n", "// A Javascript implementaion of Richard Brent's Xorgens xor4096 algorithm.\n//\n// This fast non-cryptographic random number generator is designed for\n// use in Monte-Carlo algorithms. It combines a long-period xorshift\n// generator with a Weyl generator, and it passes all common batteries\n// of stasticial tests for randomness while consuming only a few nanoseconds\n// for each prng generated.  For background on the generator, see Brent's\n// paper: \"Some long-period random number generators using shifts and xors.\"\n// http://arxiv.org/pdf/1004.3115v1.pdf\n//\n// Usage:\n//\n// var xor4096 = require('xor4096');\n// random = xor4096(1);                        // Seed with int32 or string.\n// assert.equal(random(), 0.1520436450538547); // (0, 1) range, 53 bits.\n// assert.equal(random.int32(), 1806534897);   // signed int32, 32 bits.\n//\n// For nonzero numeric keys, this impelementation provides a sequence\n// identical to that by Brent's xorgens 3 implementaion in C.  This\n// implementation also provides for initalizing the generator with\n// string seeds, or for saving and restoring the state of the generator.\n//\n// On Chrome, this prng benchmarks about 2.1 times slower than\n// Javascript's built-in Math.random().\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this;\n\n  // Set up generator function.\n  me.next = function() {\n    var w = me.w,\n        X = me.X, i = me.i, t, v;\n    // Update Weyl generator.\n    me.w = w = (w + 0x61c88647) | 0;\n    // Update xor generator.\n    v = X[(i + 34) & 127];\n    t = X[i = ((i + 1) & 127)];\n    v ^= v << 13;\n    t ^= t << 17;\n    v ^= v >>> 15;\n    t ^= t >>> 12;\n    // Update Xor generator array state.\n    v = X[i] = v ^ t;\n    me.i = i;\n    // Result is the combination.\n    return (v + (w ^ (w >>> 16))) | 0;\n  };\n\n  function init(me, seed) {\n    var t, v, i, j, w, X = [], limit = 128;\n    if (seed === (seed | 0)) {\n      // Numeric seeds initialize v, which is used to generates X.\n      v = seed;\n      seed = null;\n    } else {\n      // String seeds are mixed into v and X one character at a time.\n      seed = seed + '\\0';\n      v = 0;\n      limit = Math.max(limit, seed.length);\n    }\n    // Initialize circular array and weyl value.\n    for (i = 0, j = -32; j < limit; ++j) {\n      // Put the unicode characters into the array, and shuffle them.\n      if (seed) v ^= seed.charCodeAt((j + 32) % seed.length);\n      // After 32 shuffles, take v as the starting w value.\n      if (j === 0) w = v;\n      v ^= v << 10;\n      v ^= v >>> 15;\n      v ^= v << 4;\n      v ^= v >>> 13;\n      if (j >= 0) {\n        w = (w + 0x61c88647) | 0;     // Weyl.\n        t = (X[j & 127] ^= (v + w));  // Combine xor and weyl to init array.\n        i = (0 == t) ? i + 1 : 0;     // Count zeroes.\n      }\n    }\n    // We have detected all zeroes; make the key nonzero.\n    if (i >= 128) {\n      X[(seed && seed.length || 0) & 127] = -1;\n    }\n    // Run the generator 512 times to further mix the state before using it.\n    // Factoring this as a function slows the main generator, so it is just\n    // unrolled here.  The weyl generator is not advanced while warming up.\n    i = 127;\n    for (j = 4 * 128; j > 0; --j) {\n      v = X[(i + 34) & 127];\n      t = X[i = ((i + 1) & 127)];\n      v ^= v << 13;\n      t ^= t << 17;\n      v ^= v >>> 15;\n      t ^= t >>> 12;\n      X[i] = v ^ t;\n    }\n    // Storing state as object members is faster than using closure variables.\n    me.w = w;\n    me.X = X;\n    me.i = i;\n  }\n\n  init(me, seed);\n}\n\nfunction copy(f, t) {\n  t.i = f.i;\n  t.w = f.w;\n  t.X = f.X.slice();\n  return t;\n};\n\nfunction impl(seed, opts) {\n  if (seed == null) seed = +(new Date);\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (state.X) copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xor4096 = impl;\n}\n\n})(\n  this,                                     // window object or global\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n", "// A Javascript implementaion of the \"Tyche-i\" prng algorithm by\n// Samuel Neves and Filipe Araujo.\n// See https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this, strseed = '';\n\n  // Set up generator function.\n  me.next = function() {\n    var b = me.b, c = me.c, d = me.d, a = me.a;\n    b = (b << 25) ^ (b >>> 7) ^ c;\n    c = (c - d) | 0;\n    d = (d << 24) ^ (d >>> 8) ^ a;\n    a = (a - b) | 0;\n    me.b = b = (b << 20) ^ (b >>> 12) ^ c;\n    me.c = c = (c - d) | 0;\n    me.d = (d << 16) ^ (c >>> 16) ^ a;\n    return me.a = (a - b) | 0;\n  };\n\n  /* The following is non-inverted tyche, which has better internal\n   * bit diffusion, but which is about 25% slower than tyche-i in JS.\n  me.next = function() {\n    var a = me.a, b = me.b, c = me.c, d = me.d;\n    a = (me.a + me.b | 0) >>> 0;\n    d = me.d ^ a; d = d << 16 ^ d >>> 16;\n    c = me.c + d | 0;\n    b = me.b ^ c; b = b << 12 ^ d >>> 20;\n    me.a = a = a + b | 0;\n    d = d ^ a; me.d = d = d << 8 ^ d >>> 24;\n    me.c = c = c + d | 0;\n    b = b ^ c;\n    return me.b = (b << 7 ^ b >>> 25);\n  }\n  */\n\n  me.a = 0;\n  me.b = 0;\n  me.c = 2654435769 | 0;\n  me.d = 1367130551;\n\n  if (seed === Math.floor(seed)) {\n    // Integer seed.\n    me.a = (seed / 0x100000000) | 0;\n    me.b = seed | 0;\n  } else {\n    // String seed.\n    strseed += seed;\n  }\n\n  // Mix in string seed, then discard an initial batch of 64 values.\n  for (var k = 0; k < strseed.length + 20; k++) {\n    me.b ^= strseed.charCodeAt(k) | 0;\n    me.next();\n  }\n}\n\nfunction copy(f, t) {\n  t.a = f.a;\n  t.b = f.b;\n  t.c = f.c;\n  t.d = f.d;\n  return t;\n};\n\nfunction impl(seed, opts) {\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.tychei = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n", "/*\nCopyright 2019 David Bau.\n\nPermission is hereby granted, free of charge, to any person obtaining\na copy of this software and associated documentation files (the\n\"Software\"), to deal in the Software without restriction, including\nwithout limitation the rights to use, copy, modify, merge, publish,\ndistribute, sublicense, and/or sell copies of the Software, and to\npermit persons to whom the Software is furnished to do so, subject to\nthe following conditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\nCLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n*/\n\n(function (global, pool, math) {\n//\n// The following constants are related to IEEE 754 limits.\n//\n\nvar width = 256,        // each RC4 output is 0 <= x < 256\n    chunks = 6,         // at least six RC4 outputs for each double\n    digits = 52,        // there are 52 significant digits in a double\n    rngname = 'random', // rngname: name for Math.random and Math.seedrandom\n    startdenom = math.pow(width, chunks),\n    significance = math.pow(2, digits),\n    overflow = significance * 2,\n    mask = width - 1,\n    nodecrypto;         // node.js crypto module, initialized at the bottom.\n\n//\n// seedrandom()\n// This is the seedrandom function described above.\n//\nfunction seedrandom(seed, options, callback) {\n  var key = [];\n  options = (options == true) ? { entropy: true } : (options || {});\n\n  // Flatten the seed string or build one from local entropy if needed.\n  var shortseed = mixkey(flatten(\n    options.entropy ? [seed, tostring(pool)] :\n    (seed == null) ? autoseed() : seed, 3), key);\n\n  // Use the seed to initialize an ARC4 generator.\n  var arc4 = new ARC4(key);\n\n  // This function returns a random double in [0, 1) that contains\n  // randomness in every bit of the mantissa of the IEEE 754 value.\n  var prng = function() {\n    var n = arc4.g(chunks),             // Start with a numerator n < 2 ^ 48\n        d = startdenom,                 //   and denominator d = 2 ^ 48.\n        x = 0;                          //   and no 'extra last byte'.\n    while (n < significance) {          // Fill up all significant digits by\n      n = (n + x) * width;              //   shifting numerator and\n      d *= width;                       //   denominator and generating a\n      x = arc4.g(1);                    //   new least-significant-byte.\n    }\n    while (n >= overflow) {             // To avoid rounding up, before adding\n      n /= 2;                           //   last byte, shift everything\n      d /= 2;                           //   right using integer math until\n      x >>>= 1;                         //   we have exactly the desired bits.\n    }\n    return (n + x) / d;                 // Form the number within [0, 1).\n  };\n\n  prng.int32 = function() { return arc4.g(4) | 0; }\n  prng.quick = function() { return arc4.g(4) / 0x100000000; }\n  prng.double = prng;\n\n  // Mix the randomness into accumulated entropy.\n  mixkey(tostring(arc4.S), pool);\n\n  // Calling convention: what to return as a function of prng, seed, is_math.\n  return (options.pass || callback ||\n      function(prng, seed, is_math_call, state) {\n        if (state) {\n          // Load the arc4 state from the given state if it has an S array.\n          if (state.S) { copy(state, arc4); }\n          // Only provide the .state method if requested via options.state.\n          prng.state = function() { return copy(arc4, {}); }\n        }\n\n        // If called as a method of Math (Math.seedrandom()), mutate\n        // Math.random because that is how seedrandom.js has worked since v1.0.\n        if (is_math_call) { math[rngname] = prng; return seed; }\n\n        // Otherwise, it is a newer calling convention, so return the\n        // prng directly.\n        else return prng;\n      })(\n  prng,\n  shortseed,\n  'global' in options ? options.global : (this == math),\n  options.state);\n}\n\n//\n// ARC4\n//\n// An ARC4 implementation.  The constructor takes a key in the form of\n// an array of at most (width) integers that should be 0 <= x < (width).\n//\n// The g(count) method returns a pseudorandom integer that concatenates\n// the next (count) outputs from ARC4.  Its return value is a number x\n// that is in the range 0 <= x < (width ^ count).\n//\nfunction ARC4(key) {\n  var t, keylen = key.length,\n      me = this, i = 0, j = me.i = me.j = 0, s = me.S = [];\n\n  // The empty key [] is treated as [0].\n  if (!keylen) { key = [keylen++]; }\n\n  // Set up S using the standard key scheduling algorithm.\n  while (i < width) {\n    s[i] = i++;\n  }\n  for (i = 0; i < width; i++) {\n    s[i] = s[j = mask & (j + key[i % keylen] + (t = s[i]))];\n    s[j] = t;\n  }\n\n  // The \"g\" method returns the next (count) outputs as one number.\n  (me.g = function(count) {\n    // Using instance members instead of closure state nearly doubles speed.\n    var t, r = 0,\n        i = me.i, j = me.j, s = me.S;\n    while (count--) {\n      t = s[i = mask & (i + 1)];\n      r = r * width + s[mask & ((s[i] = s[j = mask & (j + t)]) + (s[j] = t))];\n    }\n    me.i = i; me.j = j;\n    return r;\n    // For robust unpredictability, the function call below automatically\n    // discards an initial batch of values.  This is called RC4-drop[256].\n    // See http://google.com/search?q=rsa+fluhrer+response&btnI\n  })(width);\n}\n\n//\n// copy()\n// Copies internal state of ARC4 to or from a plain object.\n//\nfunction copy(f, t) {\n  t.i = f.i;\n  t.j = f.j;\n  t.S = f.S.slice();\n  return t;\n};\n\n//\n// flatten()\n// Converts an object tree to nested arrays of strings.\n//\nfunction flatten(obj, depth) {\n  var result = [], typ = (typeof obj), prop;\n  if (depth && typ == 'object') {\n    for (prop in obj) {\n      try { result.push(flatten(obj[prop], depth - 1)); } catch (e) {}\n    }\n  }\n  return (result.length ? result : typ == 'string' ? obj : obj + '\\0');\n}\n\n//\n// mixkey()\n// Mixes a string seed into a key that is an array of integers, and\n// returns a shortened string seed that is equivalent to the result key.\n//\nfunction mixkey(seed, key) {\n  var stringseed = seed + '', smear, j = 0;\n  while (j < stringseed.length) {\n    key[mask & j] =\n      mask & ((smear ^= key[mask & j] * 19) + stringseed.charCodeAt(j++));\n  }\n  return tostring(key);\n}\n\n//\n// autoseed()\n// Returns an object for autoseeding, using window.crypto and Node crypto\n// module if available.\n//\nfunction autoseed() {\n  try {\n    var out;\n    if (nodecrypto && (out = nodecrypto.randomBytes)) {\n      // The use of 'out' to remember randomBytes makes tight minified code.\n      out = out(width);\n    } else {\n      out = new Uint8Array(width);\n      (global.crypto || global.msCrypto).getRandomValues(out);\n    }\n    return tostring(out);\n  } catch (e) {\n    var browser = global.navigator,\n        plugins = browser && browser.plugins;\n    return [+new Date, global, plugins, global.screen, tostring(pool)];\n  }\n}\n\n//\n// tostring()\n// Converts an array of charcodes to a string\n//\nfunction tostring(a) {\n  return String.fromCharCode.apply(0, a);\n}\n\n//\n// When seedrandom.js is loaded, we immediately mix a few bits\n// from the built-in RNG into the entropy pool.  Because we do\n// not want to interfere with deterministic PRNG state later,\n// seedrandom will not call math.random on its own again after\n// initialization.\n//\nmixkey(math.random(), pool);\n\n//\n// Nodejs and AMD support: export the implementation as a module using\n// either convention.\n//\nif ((typeof module) == 'object' && module.exports) {\n  module.exports = seedrandom;\n  // When in node.js, try using crypto package for autoseeding.\n  try {\n    nodecrypto = require('crypto');\n  } catch (ex) {}\n} else if ((typeof define) == 'function' && define.amd) {\n  define(function() { return seedrandom; });\n} else {\n  // When included as a plain script, set up Math.seedrandom global.\n  math['seed' + rngname] = seedrandom;\n}\n\n\n// End anonymous scope, and pass initial values.\n})(\n  // global: `self` in browsers (including strict mode and web workers),\n  // otherwise `this` in Node and other environments\n  (typeof self !== 'undefined') ? self : this,\n  [],     // pool: entropy pool starts empty\n  Math    // math: package containing random, pow, and seedrandom\n);\n", "// A library of seedable RNGs implemented in Javascript.\n//\n// Usage:\n//\n// var seedrandom = require('seedrandom');\n// var random = seedrandom(1); // or any seed.\n// var x = random();       // 0 <= x < 1.  Every bit is random.\n// var x = random.quick(); // 0 <= x < 1.  32 bits of randomness.\n\n// alea, a 53-bit multiply-with-carry generator by Johannes Baagøe.\n// Period: ~2^116\n// Reported to pass all BigCrush tests.\nvar alea = require('./lib/alea');\n\n// xor128, a pure xor-shift generator by George Marsaglia.\n// Period: 2^128-1.\n// Reported to fail: MatrixRank and LinearComp.\nvar xor128 = require('./lib/xor128');\n\n// xorwow, George Marsaglia's 160-bit xor-shift combined plus weyl.\n// Period: 2^192-2^32\n// Reported to fail: CollisionOver, SimpPoker, and LinearComp.\nvar xorwow = require('./lib/xorwow');\n\n// xorshift7, by François Panneton and Pierre L'ecuyer, takes\n// a different approach: it adds robustness by allowing more shifts\n// than Marsaglia's original three.  It is a 7-shift generator\n// with 256 bits, that passes BigCrush with no systmatic failures.\n// Period 2^256-1.\n// No systematic BigCrush failures reported.\nvar xorshift7 = require('./lib/xorshift7');\n\n// xor4096, by Richard Brent, is a 4096-bit xor-shift with a\n// very long period that also adds a Weyl generator. It also passes\n// BigCrush with no systematic failures.  Its long period may\n// be useful if you have many generators and need to avoid\n// collisions.\n// Period: 2^4128-2^32.\n// No systematic BigCrush failures reported.\nvar xor4096 = require('./lib/xor4096');\n\n// Tyche-i, by Samuel Neves and Filipe Araujo, is a bit-shifting random\n// number generator derived from ChaCha, a modern stream cipher.\n// https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf\n// Period: ~2^127\n// No systematic BigCrush failures reported.\nvar tychei = require('./lib/tychei');\n\n// The original ARC4-based prng included in this library.\n// Period: ~2^1600\nvar sr = require('./seedrandom');\n\nsr.alea = alea;\nsr.xor128 = xor128;\nsr.xorwow = xorwow;\nsr.xorshift7 = xorshift7;\nsr.xor4096 = xor4096;\nsr.tychei = tychei;\n\nmodule.exports = sr;\n", "/**\n * @license\n * Copyright 2017 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from './engine';\nimport {inferShape} from './tensor_util_env';\nimport {RecursiveArray, TensorLike, TypedArray} from './types';\nimport {arraysEqual, encodeString, flatten, isString, isTypedArray} from './util';\n\nconst TEST_EPSILON_FLOAT32 = 1e-3;\nexport const TEST_EPSILON_FLOAT16 = 1e-1;\n\nexport function expectArraysClose(\n    actual: TypedArray|number|RecursiveArray<number>,\n    expected: TypedArray|number|RecursiveArray<number>, epsilon?: number) {\n  if (epsilon == null) {\n    epsilon = testEpsilon();\n  }\n  return expectArraysPredicate(\n      actual, expected, (a, b) => areClose(a as number, b as number, epsilon));\n}\n\nexport function testEpsilon() {\n  return ENGINE.backend.floatPrecision() === 32 ? TEST_EPSILON_FLOAT32 :\n                                                  TEST_EPSILON_FLOAT16;\n}\n\nfunction expectArraysPredicate(\n    actual: TensorLike, expected: TensorLike,\n    predicate: (a: {}, b: {}) => boolean) {\n  let checkClassType = true;\n  if (isTypedArray(actual) || isTypedArray(expected)) {\n    checkClassType = false;\n  }\n  if (isTypedArray(actual) && isTypedArray(expected)) {\n    checkClassType = true;\n  }\n  if (checkClassType) {\n    const aType = actual.constructor.name;\n    const bType = expected.constructor.name;\n\n    if (aType !== bType) {\n      throw new Error(\n          `Arrays are of different type. Actual: ${aType}. ` +\n          `Expected: ${bType}`);\n    }\n  }\n\n  if (Array.isArray(actual) && Array.isArray(expected)) {\n    const actualShape = inferShape(actual);\n    const expectedShape = inferShape(expected);\n    if (!arraysEqual(actualShape, expectedShape)) {\n      throw new Error(\n          `Arrays have different shapes. ` +\n          `Actual: [${actualShape}]. Expected: [${expectedShape}]`);\n    }\n  }\n\n  const actualFlat =\n      isTypedArray(actual) ? actual : flatten(actual as RecursiveArray<number>);\n  const expectedFlat = isTypedArray(expected) ?\n      expected :\n      flatten(expected as RecursiveArray<number>);\n\n  if (actualFlat.length !== expectedFlat.length) {\n    throw new Error(\n        `Arrays have different lengths actual: ${actualFlat.length} vs ` +\n        `expected: ${expectedFlat.length}.\\n` +\n        `Actual:   ${actualFlat}.\\n` +\n        `Expected: ${expectedFlat}.`);\n  }\n  for (let i = 0; i < expectedFlat.length; ++i) {\n    const a = actualFlat[i];\n    const e = expectedFlat[i];\n\n    if (!predicate(a, e)) {\n      throw new Error(\n          `Arrays differ: actual[${i}] = ${a}, expected[${i}] = ${e}.\\n` +\n          `Actual:   ${actualFlat}.\\n` +\n          `Expected: ${expectedFlat}.`);\n    }\n  }\n  if (typeof expect !== 'undefined') {\n    expect().nothing();\n  }\n}\n\nexport interface DoneFn {\n  (): void;\n  fail: (message?: Error|string) => void;\n}\n\nexport function expectPromiseToFail(fn: () => Promise<{}>, done: DoneFn): void {\n  fn().then(() => done.fail(), () => done());\n  if (typeof expect !== 'undefined') {\n    expect().nothing();\n  }\n}\n\nexport function expectArraysEqual(actual: TensorLike, expected: TensorLike) {\n  const exp = typeof expected === 'string' || typeof expected === 'number' ||\n          typeof expected === 'boolean' ?\n      [expected] as number[] :\n      expected as number[];\n  if (isString(actual) || isString((actual as string[])[0]) ||\n      isString(expected) || isString((expected as string[])[0])) {\n    // tslint:disable-next-line: triple-equals\n    return expectArraysPredicate(actual, exp, (a, b) => a == b);\n  }\n  return expectArraysPredicate(\n      actual, expected, (a, b) => areClose(a as number, b as number, 0));\n}\n\nexport function expectNumbersClose(a: number, e: number, epsilon?: number) {\n  if (epsilon == null) {\n    epsilon = testEpsilon();\n  }\n  if (!areClose(a, e, epsilon)) {\n    throw new Error(`Numbers differ: actual === ${a}, expected === ${e}`);\n  }\n  if (typeof expect !== 'undefined') {\n    expect().nothing();\n  }\n}\n\nfunction areClose(a: number, e: number, epsilon: number): boolean {\n  if (!isFinite(a) && !isFinite(e)) {\n    return true;\n  }\n  if (isNaN(a) || isNaN(e) || Math.abs(a - e) > epsilon) {\n    return false;\n  }\n  return true;\n}\n\nexport function expectValuesInRange(\n    actual: TypedArray|number[], low: number, high: number) {\n  for (let i = 0; i < actual.length; i++) {\n    if (actual[i] < low || actual[i] > high) {\n      throw new Error(\n          `Value out of range:${actual[i]} low: ${low}, high: ${high}`);\n    }\n  }\n}\n\nexport function expectArrayBuffersEqual(\n    actual: ArrayBuffer, expected: ArrayBuffer) {\n  // Safari does not like comparing ArrayBuffers directly. Wrapping in\n  // a Float32Array solves this issue.\n  const actualArray = new Float32Array(actual);\n  const expectedArray = new Float32Array(expected);\n  if (actualArray.length !== expectedArray.length) {\n    throw new Error(\n        'Expected ArrayBuffer to be of length ' +\n        `${expectedArray.length}, but it was ${actualArray.length}`);\n  }\n\n  for (let i = 0; i < expectedArray.length; i++) {\n    if (actualArray[i] !== expectedArray[i]) {\n      throw new Error(\n          `Expected ArrayBuffer value at ${i} to be ` +\n          `${expectedArray[i]} but got ${actualArray[i]} instead`);\n    }\n  }\n}\n\n/** Encodes strings into utf-8 bytes. */\nexport function encodeStrings(a: RecursiveArray<{}>):\n    RecursiveArray<Uint8Array> {\n  for (let i = 0; i < (a as Array<{}>).length; i++) {\n    const val = a[i];\n    if (Array.isArray(val)) {\n      encodeStrings(val);\n    } else {\n      a[i] = encodeString(val as string);\n    }\n  }\n  return a as RecursiveArray<Uint8Array>;\n}\n\n/** Creates an HTMLVideoElement with autoplay-friendly default settings. */\nexport function createVideoElement(source: HTMLSourceElement):\n    Promise<HTMLVideoElement> {\n  const video = document.createElement('video');\n  if ('playsInline' in video) {\n    // tslint:disable-next-line:no-any\n    (video as any).playsInline = true;\n  }\n  video.muted = true;\n  video.loop = true;\n  video.style.position = 'fixed';\n  video.style.left = '0px';\n  video.style.top = '0px';\n\n  video.preload = 'auto';\n  video.appendChild(source);\n  return new Promise(resolve => {\n    video.addEventListener('loadeddata', _ => resolve(video));\n    video.load();\n  });\n}\n\nexport async function play(video: HTMLVideoElement) {\n  await video.play();\n  if ('requestVideoFrameCallback' in video) {\n    await new Promise(resolve => {\n      // tslint:disable-next-line:no-any\n      (video as any).requestVideoFrameCallback(resolve);\n    });\n  }\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport * as seedrandom from 'seedrandom';\n\nimport {expectNumbersClose, testEpsilon} from '../test_util';\nimport {TypedArray} from '../types';\n\nexport interface RandomBase {\n  nextValue(): number;\n}\n\nexport interface RandomGamma {\n  nextValue(): number;\n}\n\nexport interface RandNormalDataTypes {\n  float32: Float32Array;\n  int32: Int32Array;\n}\n\nexport interface RandGammaDataTypes {\n  float32: Float32Array;\n  int32: Int32Array;\n}\n\n// https://en.wikipedia.org/wiki/Marsaglia_polar_method\nexport class MPRandGauss implements RandomBase {\n  private mean: number;\n  private stdDev: number;\n  private nextVal: number;\n  private dtype?: keyof RandNormalDataTypes;\n  private truncated?: boolean;\n  private upper?: number;\n  private lower?: number;\n  private random: seedrandom.prng;\n\n  constructor(\n      mean: number, stdDeviation: number, dtype?: keyof RandNormalDataTypes,\n      truncated?: boolean, seed?: number) {\n    this.mean = mean;\n    this.stdDev = stdDeviation;\n    this.dtype = dtype;\n    this.nextVal = NaN;\n    this.truncated = truncated;\n    if (this.truncated) {\n      this.upper = this.mean + this.stdDev * 2;\n      this.lower = this.mean - this.stdDev * 2;\n    }\n    const seedValue = seed ? seed : Math.random();\n    this.random = seedrandom.alea(seedValue.toString());\n  }\n\n  /** Returns next sample from a Gaussian distribution. */\n  public nextValue(): number {\n    if (!isNaN(this.nextVal)) {\n      const value = this.nextVal;\n      this.nextVal = NaN;\n      return value;\n    }\n\n    let resultX: number, resultY: number;\n    let isValid = false;\n    while (!isValid) {\n      let v1: number, v2: number, s: number;\n      do {\n        v1 = 2 * this.random() - 1;\n        v2 = 2 * this.random() - 1;\n        s = v1 * v1 + v2 * v2;\n      } while (s >= 1 || s === 0);\n\n      const mul = Math.sqrt(-2.0 * Math.log(s) / s);\n      resultX = this.mean + this.stdDev * v1 * mul;\n      resultY = this.mean + this.stdDev * v2 * mul;\n\n      if (!this.truncated || this.isValidTruncated(resultX)) {\n        isValid = true;\n      }\n    }\n\n    if (!this.truncated || this.isValidTruncated(resultY)) {\n      this.nextVal = this.convertValue(resultY);\n    }\n    return this.convertValue(resultX);\n  }\n\n  /** Handles proper rounding for non-floating-point numbers. */\n  private convertValue(value: number): number {\n    if (this.dtype == null || this.dtype === 'float32') {\n      return value;\n    }\n    return Math.round(value);\n  }\n\n  /** Returns true if less than 2-standard-deviations from the mean. */\n  private isValidTruncated(value: number): boolean {\n    return value <= this.upper && value >= this.lower;\n  }\n}\n\n// Marsaglia, George, and Wai Wan Tsang. 2000. \"A Simple Method for Generating\n// Gamma Variables.\"\nexport class RandGamma implements RandomGamma {\n  private alpha: number;\n  private beta: number;\n  private d: number;\n  private c: number;\n  private dtype?: keyof RandGammaDataTypes;\n  private randu: seedrandom.prng;\n  private randn: MPRandGauss;\n\n  constructor(\n      alpha: number, beta: number, dtype: keyof RandGammaDataTypes,\n      seed?: number) {\n    this.alpha = alpha;\n    this.beta = 1 / beta;  // convert rate to scale parameter\n    this.dtype = dtype;\n\n    const seedValue = seed ? seed : Math.random();\n    this.randu = seedrandom.alea(seedValue.toString());\n    this.randn = new MPRandGauss(0, 1, dtype, false, this.randu());\n\n    if (alpha < 1) {\n      this.d = alpha + (2 / 3);\n    } else {\n      this.d = alpha - (1 / 3);\n    }\n    this.c = 1 / Math.sqrt(9 * this.d);\n  }\n\n  /** Returns next sample from a gamma distribution. */\n  public nextValue(): number {\n    let x2: number, v0: number, v1: number, x: number, u: number, v: number;\n    while (true) {\n      do {\n        x = this.randn.nextValue();\n        v = 1 + (this.c * x);\n      } while (v <= 0);\n      v *= v * v;\n      x2 = x * x;\n      v0 = 1 - (0.331 * x2 * x2);\n      v1 = (0.5 * x2) + (this.d * (1 - v + Math.log(v)));\n      u = this.randu();\n      if (u < v0 || Math.log(u) < v1) {\n        break;\n      }\n    }\n    v = (1 / this.beta) * this.d * v;\n    if (this.alpha < 1) {\n      v *= Math.pow(this.randu(), 1 / this.alpha);\n    }\n    return this.convertValue(v);\n  }\n  /** Handles proper rounding for non-floating-point numbers. */\n  private convertValue(value: number): number {\n    if (this.dtype === 'float32') {\n      return value;\n    }\n    return Math.round(value);\n  }\n}\n\nexport class UniformRandom implements RandomBase {\n  private min: number;\n  private range: number;\n  private random: seedrandom.prng;\n  private dtype?: keyof RandNormalDataTypes;\n\n  constructor(\n      min = 0, max = 1, dtype?: keyof RandNormalDataTypes,\n      seed?: string|number) {\n    this.min = min;\n    this.range = max - min;\n    this.dtype = dtype;\n    if (seed == null) {\n      seed = Math.random();\n    }\n    if (typeof seed === 'number') {\n      seed = seed.toString();\n    }\n\n    if (!this.canReturnFloat() && this.range <= 1) {\n      throw new Error(\n          `The difference between ${min} - ${max} <= 1 and dtype is not float`);\n    }\n    this.random = seedrandom.alea(seed);\n  }\n\n  /** Handles proper rounding for non floating point numbers. */\n  private canReturnFloat = () =>\n      (this.dtype == null || this.dtype === 'float32');\n\n  private convertValue(value: number): number {\n    if (this.canReturnFloat()) {\n      return value;\n    }\n    return Math.round(value);\n  }\n\n  nextValue() {\n    return this.convertValue(this.min + this.range * this.random());\n  }\n}\n\nexport function jarqueBeraNormalityTest(values: TypedArray|number[]) {\n  // https://en.wikipedia.org/wiki/Jarque%E2%80%93Bera_test\n  const n = values.length;\n  const s = skewness(values);\n  const k = kurtosis(values);\n  const jb = n / 6 * (Math.pow(s, 2) + 0.25 * Math.pow(k - 3, 2));\n  // JB test requires 2-degress of freedom from Chi-Square @ 0.95:\n  // http://www.itl.nist.gov/div898/handbook/eda/section3/eda3674.htm\n  const CHI_SQUARE_2DEG = 5.991;\n  if (jb > CHI_SQUARE_2DEG) {\n    throw new Error(`Invalid p-value for JB: ${jb}`);\n  }\n}\n\nexport function expectArrayInMeanStdRange(\n    actual: TypedArray|number[], expectedMean: number, expectedStdDev: number,\n    epsilon?: number) {\n  if (epsilon == null) {\n    epsilon = testEpsilon();\n  }\n  const actualMean = mean(actual);\n  expectNumbersClose(actualMean, expectedMean, epsilon);\n  expectNumbersClose(\n      standardDeviation(actual, actualMean), expectedStdDev, epsilon);\n}\n\nfunction mean(values: TypedArray|number[]) {\n  let sum = 0;\n  for (let i = 0; i < values.length; i++) {\n    sum += values[i];\n  }\n  return sum / values.length;\n}\n\nfunction standardDeviation(values: TypedArray|number[], mean: number) {\n  let squareDiffSum = 0;\n  for (let i = 0; i < values.length; i++) {\n    const diff = values[i] - mean;\n    squareDiffSum += diff * diff;\n  }\n  return Math.sqrt(squareDiffSum / values.length);\n}\n\nfunction kurtosis(values: TypedArray|number[]) {\n  // https://en.wikipedia.org/wiki/Kurtosis\n  const valuesMean = mean(values);\n  const n = values.length;\n  let sum2 = 0;\n  let sum4 = 0;\n  for (let i = 0; i < n; i++) {\n    const v = values[i] - valuesMean;\n    sum2 += Math.pow(v, 2);\n    sum4 += Math.pow(v, 4);\n  }\n  return (1 / n) * sum4 / Math.pow((1 / n) * sum2, 2);\n}\n\nfunction skewness(values: TypedArray|number[]) {\n  // https://en.wikipedia.org/wiki/Skewness\n  const valuesMean = mean(values);\n  const n = values.length;\n  let sum2 = 0;\n  let sum3 = 0;\n  for (let i = 0; i < n; i++) {\n    const v = values[i] - valuesMean;\n    sum2 += Math.pow(v, 2);\n    sum3 += Math.pow(v, 3);\n  }\n  return (1 / n) * sum3 / Math.pow((1 / (n - 1)) * sum2, 3 / 2);\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {Rank, ShapeMap} from '../types';\nimport {assertNonNegativeIntegerDimensions} from '../util_base';\n\nimport {buffer} from './buffer';\nimport {op} from './operation';\nimport {RandGamma} from './rand_util';\n\n/**\n * Creates a `tf.Tensor` with values sampled from a gamma distribution.\n *\n * ```js\n * tf.randomGamma([2, 2], 1).print();\n * ```\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param alpha The shape parameter of the gamma distribution.\n * @param beta The inverse scale parameter of the gamma distribution. Defaults\n *     to 1.\n * @param dtype The data type of the output. Defaults to float32.\n * @param seed The seed for the random number generator.\n *\n * @doc {heading: 'Tensors', subheading: 'Random'}\n */\nfunction randomGamma_<R extends Rank>(\n    shape: ShapeMap[R], alpha: number, beta = 1,\n    dtype: 'float32'|'int32' = 'float32', seed?: number): Tensor<R> {\n  assertNonNegativeIntegerDimensions(shape);\n  if (beta == null) {\n    beta = 1;\n  }\n  if (dtype == null) {\n    dtype = 'float32';\n  }\n  if (dtype !== 'float32' && dtype !== 'int32') {\n    throw new Error(`Unsupported data type ${dtype}`);\n  }\n  const rgamma = new RandGamma(alpha, beta, dtype, seed);\n  const res = buffer(shape, dtype);\n  for (let i = 0; i < res.values.length; i++) {\n    res.values[i] = rgamma.nextValue();\n  }\n  return res.toTensor();\n}\n\nexport const randomGamma = /* @__PURE__ */ op({randomGamma_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {DataType, Rank, ShapeMap} from '../types';\nimport {assertNonNegativeIntegerDimensions} from '../util_base';\n\nimport {buffer} from './buffer';\nimport {op} from './operation';\nimport {MPRandGauss} from './rand_util';\n\n/**\n * Creates a `tf.Tensor` with values sampled from a normal distribution.\n *\n * ```js\n * tf.randomNormal([2, 2]).print();\n * ```\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param mean The mean of the normal distribution.\n * @param stdDev The standard deviation of the normal distribution.\n * @param dtype The data type of the output.\n * @param seed The seed for the random number generator.\n *\n * @doc {heading: 'Tensors', subheading: 'Random'}\n */\nfunction randomNormal_<R extends Rank>(\n    shape: ShapeMap[R], mean = 0, stdDev = 1, dtype?: 'float32'|'int32',\n    seed?: number): Tensor<R> {\n  assertNonNegativeIntegerDimensions(shape);\n  if (dtype != null && (dtype as DataType) === 'bool') {\n    throw new Error(`Unsupported data type ${dtype}`);\n  }\n  const randGauss =\n      new MPRandGauss(mean, stdDev, dtype, false /* truncated */, seed);\n  const res = buffer(shape, dtype);\n  for (let i = 0; i < res.values.length; i++) {\n    res.values[i] = randGauss.nextValue();\n  }\n  return res.toTensor();\n}\n\nexport const randomNormal = /* @__PURE__ */ op({randomNormal_});\n", "/**\n * @license\n * Copyright 2022 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {DataType, Rank, ShapeMap} from '../types';\n\nimport {op} from './operation';\nimport {randomNormal} from './random_normal';\n\n/**\n * Creates a `tf.Tensor` with values sampled from a normal distribution.\n *\n * The generated values will have mean 0 and standard deviation 1.\n *\n * ```js\n * tf.randomStandardNormal([2, 2]).print();\n * ```\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param dtype The data type of the output.\n * @param seed The seed for the random number generator.\n *\n * @doc {heading: 'Tensors', subheading: 'Random'}\n */\nfunction randomStandardNormal_<R extends Rank>(\n    shape: ShapeMap[R], dtype?: 'float32'|'int32', seed?: number): Tensor<R> {\n  if (dtype != null && (dtype as DataType) === 'bool') {\n    throw new Error(`Unsupported data type ${dtype}`);\n  }\n  return randomNormal(shape, 0, 1, dtype, seed);\n}\n\nexport const randomStandardNormal = /* @__PURE__ */ op({randomStandardNormal_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {DataType, Rank, ShapeMap} from '../types';\nimport {assertNonNegativeIntegerDimensions} from '../util_base';\n\nimport {buffer} from './buffer';\nimport {op} from './operation';\nimport {UniformRandom} from './rand_util';\n\n/**\n * Creates a `tf.Tensor` with values sampled from a uniform distribution.\n *\n * The generated values follow a uniform distribution in the range [minval,\n * maxval). The lower bound minval is included in the range, while the upper\n * bound maxval is excluded.\n *\n * ```js\n * tf.randomUniform([2, 2]).print();\n * ```\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param minval The lower bound on the range of random values to generate.\n *   Defaults to 0.\n * @param maxval The upper bound on the range of random values to generate.\n *   Defaults to 1.\n * @param dtype The data type of the output tensor. Defaults to 'float32'.\n * @param seed An optional int. Defaults to 0. If seed is set to be non-zero,\n *   the random number generator is seeded by the given seed. Otherwise, it is\n *   seeded by a random seed.\n *\n * @doc {heading: 'Tensors', subheading: 'Random'}\n */\nfunction randomUniform_<R extends Rank>(\n    shape: ShapeMap[R], minval = 0, maxval = 1, dtype: DataType = 'float32',\n    seed?: number|string): Tensor<R> {\n  assertNonNegativeIntegerDimensions(shape);\n  const res = buffer(shape, dtype);\n  const random = new UniformRandom(minval, maxval, null, seed);\n  for (let i = 0; i < res.values.length; i++) {\n    res.values[i] = random.nextValue();\n  }\n  return res.toTensor();\n}\n\nexport const randomUniform = /* @__PURE__ */ op({randomUniform_});\n", "/**\n * @license\n * Copyright 2023 Google LLC.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {Rank, ShapeMap} from '../types';\nimport {op} from './operation';\nimport {randomUniform} from './random_uniform';\n\n/**\n * Creates a `tf.Tensor` with integers sampled from a uniform distribution.\n *\n * The generated values are uniform integers in the range [minval, maxval). The\n * lower bound minval is included in the range, while the upper bound maxval is\n * excluded.\n *\n * ```js\n * tf.randomUniformInt([2, 2], 0, 10).print();\n * ```\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param minval Inclusive lower bound on the generated integers.\n * @param maxval Exclusive upper bound on the generated integers.\n * @param seed An optional int. Defaults to 0. If seed is set to be non-zero,\n *   the random number generator is seeded by the given seed. Otherwise, it is\n *   seeded by a random seed.\n *\n * @doc {heading: 'Tensors', subheading: 'Random'}\n */\nfunction randomUniformInt_<R extends Rank>(\n  shape: ShapeMap[R], minval: number, maxval: number,\n    seed?: number|string): Tensor<R> {\n  // TODO(mattsoulanille): Handle optional seed2 input.\n  return randomUniform(shape, minval, maxval, 'int32', seed);\n}\n\nexport const randomUniformInt = /* @__PURE__ */ op({randomUniformInt_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Range, RangeAttrs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor1D} from '../tensor';\n\n/**\n * Creates a new `tf.Tensor1D` filled with the numbers in the range provided.\n *\n * The tensor is a half-open interval meaning it includes start, but\n * excludes stop. Decrementing ranges and negative step values are also\n * supported.\n *\n *\n * ```js\n * tf.range(0, 9, 2).print();\n * ```\n *\n * @param start An integer start value\n * @param stop An integer stop value\n * @param step An integer increment (will default to 1 or -1)\n * @param dtype The data type of the output tensor. Defaults to 'float32'.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function range(\n    start: number, stop: number, step = 1,\n    dtype: 'float32'|'int32' = 'float32'): Tensor1D {\n  if (step === 0) {\n    throw new Error('Cannot have a step of zero');\n  }\n\n  const attrs: RangeAttrs = {start, stop, step, dtype};\n\n  return ENGINE.runKernel(Range, {} /* inputs */,\n      attrs as unknown as NamedAttrMap);\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Real, RealInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {op} from './operation';\n\n/**\n * Returns the real part of a complex (or real) tensor.\n *\n * Given a tensor input, this operation returns a tensor of type float that is\n * the real part of each element in input considered as a complex number.\n *\n * If the input is real, it simply makes a clone.\n *\n * ```js\n * const x = tf.complex([-2.25, 3.25], [4.75, 5.75]);\n * tf.real(x).print();\n * ```\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction real_<T extends Tensor>(input: T|TensorLike): T {\n  const $input = convertToTensor(input, 'input', 'real');\n\n  const inputs: RealInputs = {input: $input};\n  return ENGINE.runKernel(Real, inputs as unknown as NamedTensorMap);\n}\n\nexport const real = /* @__PURE__ */ op({real_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Reciprocal, ReciprocalInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes reciprocal of x element-wise: `1 / x`\n *\n * ```js\n * const x = tf.tensor1d([0, 1, 2]);\n *\n * x.reciprocal().print();  // or tf.reciprocal(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction reciprocal_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'reciprocal');\n\n  const inputs: ReciprocalInputs = {x: $x};\n  return ENGINE.runKernel(Reciprocal, inputs as unknown as NamedTensorMap);\n}\nexport const reciprocal = /* @__PURE__ */ op({reciprocal_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Relu, ReluInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes rectified linear element-wise: `max(x, 0)`.\n *\n * ```js\n * const x = tf.tensor1d([-1, 2, -3, 4]);\n *\n * x.relu().print();  // or tf.relu(x)\n * ```\n * @param x The input tensor. If the dtype is `bool`, the output dtype will be\n *     `int32`.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction relu_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'relu');\n\n  const inputs: ReluInputs = {x: $x};\n\n  return ENGINE.runKernel(Relu, inputs as unknown as NamedTensorMap);\n}\n\nexport const relu = /* @__PURE__ */ op({relu_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Relu6, Relu6Inputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes rectified linear 6 element-wise: `min(max(x, 0), 6)`.\n *\n * ```js\n * const x = tf.tensor1d([-1, 2, -3, 8]);\n *\n * x.relu6().print();  // or tf.relu6(x)\n * ```\n * @param x The input tensor. If the dtype is `bool`, the output dtype will be\n *     `int32`.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction relu6_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'relu6');\n\n  const inputs: Relu6Inputs = {x: $x};\n\n  return ENGINE.runKernel(Relu6, inputs as unknown as NamedTensorMap);\n}\n\nexport const relu6 = /* @__PURE__ */ op({relu6_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Reverse, ReverseAttrs, ReverseInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Reverses a `tf.Tensor` along a specified axis.\n *\n * Also available are stricter rank-specific methods that assert that `x` is\n * of the given rank:\n *   - `tf.reverse1d`\n *   - `tf.reverse2d`\n *   - `tf.reverse3d`\n *   - `tf.reverse4d`\n *\n * Except `tf.reverse1d` (which does not have axis param), all methods have\n * same signature as this method.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n *\n * x.reverse().print();\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * const axis = 1;\n * x.reverse(axis).print();\n * ```\n * @param x The input tensor to be reversed.\n * @param axis The set of dimensions to reverse. Must be in the\n *     range [-rank(x), rank(x)). Defaults to all axes.\n *\n * @doc {heading: 'Tensors', subheading: 'Slicing and Joining'}\n */\nfunction reverse_<T extends Tensor>(\n    x: T|TensorLike, axis?: number|number[]): T {\n  const $x = convertToTensor(x, 'x', 'reverse');\n\n  const inputs: ReverseInputs = {x: $x};\n  const attrs: ReverseAttrs = {dims: axis};\n\n  return ENGINE.runKernel(\n      Reverse, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const reverse = /* @__PURE__ */ op({reverse_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor1D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\nimport {op} from './operation';\nimport {reverse} from './reverse';\n\n/**\n * Reverses a `tf.Tensor1D`.\n *\n * @param x The input tensor.\n */\nfunction reverse1d_(x: Tensor1D|TensorLike): Tensor1D {\n  const $x = convertToTensor(x, 'x', 'reverse');\n  util.assert(\n      $x.rank === 1,\n      () => `Error in reverse1D: x must be rank 1 but got rank ${$x.rank}.`);\n  return reverse($x, 0);\n}\n\nexport const reverse1d = /* @__PURE__ */ op({reverse1d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor2D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\nimport {op} from './operation';\nimport {reverse} from './reverse';\n\n/**\n * Reverses a `tf.Tensor2D` along a specified axis.\n *\n * @param x The input tensor.\n * @param axis The set of dimensions to reverse. Must be in the\n *     range [-rank(x), rank(x)). Defaults to all axes.\n */\nfunction reverse2d_(x: Tensor2D|TensorLike, axis?: number|number[]): Tensor2D {\n  const $x = convertToTensor(x, 'x', 'reverse');\n  util.assert(\n      $x.rank === 2,\n      () => `Error in reverse2D: x must be rank 2 but got rank ${$x.rank}.`);\n  return reverse($x, axis);\n}\n\nexport const reverse2d = /* @__PURE__ */ op({reverse2d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor3D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\nimport {op} from './operation';\nimport {reverse} from './reverse';\n\n/**\n * Reverses a `tf.Tensor3D` along a specified axis.\n *\n * @param x The input tensor.\n * @param axis The set of dimensions to reverse. Must be in the\n *     range [-rank(x), rank(x)). Defaults to all axes.\n */\nfunction reverse3d_(x: Tensor3D|TensorLike, axis?: number|number[]): Tensor3D {\n  const $x = convertToTensor(x, 'x', 'reverse');\n  util.assert(\n      $x.rank === 3,\n      () => `Error in reverse3D: x must be rank 3 but got rank ${$x.rank}.`);\n  return reverse($x, axis);\n}\n\nexport const reverse3d = /* @__PURE__ */ op({reverse3d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor4D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\nimport {op} from './operation';\nimport {reverse} from './reverse';\n\n/**\n * Reverses a `tf.Tensor4D` along a specified axis.\n *\n * @param x The input tensor.\n * @param axis The set of dimensions to reverse. Must be in the\n *     range [-rank(x), rank(x)). Defaults to all axes.\n */\nfunction reverse4d_(x: Tensor4D|TensorLike, axis?: number|number[]): Tensor4D {\n  const $x = convertToTensor(x, 'x', 'reverse');\n  util.assert(\n      $x.rank === 4,\n      () => `Error in reverse4D: x must be rank 4 but got rank ${$x.rank}.`);\n  return reverse($x, axis);\n}\n\nexport const reverse4d = /* @__PURE__ */ op({reverse4d_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Round, RoundInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes round of input `tf.Tensor` element-wise: `round(x)`.\n * It implements banker's rounding.\n *\n * ```js\n * const x = tf.tensor1d([.6, 1.1, -3.3]);\n *\n * x.round().print();  // or tf.round(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction round_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'round');\n  const inputs: RoundInputs = {x: $x};\n\n  return ENGINE.runKernel(Round, inputs as unknown as NamedTensorMap);\n}\n\nexport const round = /* @__PURE__ */ op({round_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Rsqrt, RsqrtInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes reciprocal of square root of the input `tf.Tensor` element-wise:\n * `y = 1 / sqrt(x)`\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 4, -1]);\n *\n * x.rsqrt().print();  // or tf.rsqrt(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction rsqrt_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'rsqrt', 'float32');\n\n  const inputs: RsqrtInputs = {x: $x};\n\n  return ENGINE.runKernel(Rsqrt, inputs as unknown as NamedTensorMap);\n}\nexport const rsqrt = /* @__PURE__ */ op({rsqrt_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Selu, SeluInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes scaled exponential linear element-wise.\n *\n * `x < 0 ? scale * alpha * (exp(x) - 1) : scale * x`\n *\n * ```js\n * const x = tf.tensor1d([-1, 2, -3, 4]);\n *\n * x.selu().print();  // or tf.selu(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction selu_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'selu');\n\n  const inputs: SeluInputs = {x: $x};\n\n  return ENGINE.runKernel(Selu, inputs as unknown as NamedTensorMap);\n}\n\nexport const selu = /* @__PURE__ */ op({selu_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {conv2d} from './conv2d';\nimport {depthwiseConv2d} from './depthwise_conv2d';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * 2-D convolution with separable filters.\n *\n * Performs a depthwise convolution that acts separately on channels followed\n * by a pointwise convolution that mixes channels. Note that this is\n * separability between dimensions [1, 2] and 3, not spatial separability\n * between dimensions 1 and 2.\n *\n * See\n * [https://www.tensorflow.org/api_docs/python/tf/nn/separable_conv2d](\n *     https://www.tensorflow.org/api_docs/python/tf/nn/separable_conv2d)\n * for more details.\n *\n * @param x The input tensor, of rank 4 or rank 3, of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is\n * assumed.\n * @param depthwiseFilter The depthwise filter tensor, rank 4, of shape\n *     `[filterHeight, filterWidth, inChannels, channelMultiplier]`. This is\n *     the filter used in the first step.\n * @param pointwiseFilter The pointwise filter tensor, rank 4, of shape\n *     `[1, 1, inChannels * channelMultiplier, outChannels]`. This is\n *     the filter used in the second step.\n * @param strides The strides of the convolution: `[strideHeight,\n * strideWidth]`. If strides is a single number, then `strideHeight ==\n * strideWidth`.\n * @param pad The type of padding algorithm.\n *   - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *   - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n *   - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dilations The dilation rates: `[dilationHeight, dilationWidth]`\n *     in which we sample input values across the height and width dimensions\n *     in atrous convolution. Defaults to `[1, 1]`. If `rate` is a single\n *     number, then `dilationHeight == dilationWidth`. If it is greater than\n *     1, then all values of `strides` must be 1.\n * @param dataFormat: An optional string from: \"NHWC\", \"NCHW\". Defaults to\n *     \"NHWC\". Specify the data format of the input and output data. With the\n *     default format \"NHWC\", the data is stored in the order of: [batch,\n *     height, width, channels]. Only \"NHWC\" is currently supported.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction separableConv2d_<T extends Tensor3D|Tensor4D>(\n    x: T|TensorLike, depthwiseFilter: Tensor4D|TensorLike,\n    pointwiseFilter: Tensor4D|TensorLike, strides: [number, number]|number,\n    pad: 'valid'|'same', dilation: [number, number]|number = [1, 1],\n    dataFormat: 'NHWC'|'NCHW' = 'NHWC'): T {\n  const $x = convertToTensor(x, 'x', 'separableConv2d');\n  const $depthwiseFilter =\n      convertToTensor(depthwiseFilter, 'depthwiseFilter', 'separableConv2d');\n  const $pointwiseFilter =\n      convertToTensor(pointwiseFilter, 'pointwiseFilter', 'separableConv2d');\n\n  let x4D = $x as Tensor4D;\n  let reshapedTo4D = false;\n  if ($x.rank === 3) {\n    reshapedTo4D = true;\n    x4D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2]]);\n  }\n\n  if (dataFormat === 'NCHW') {\n    throw new Error(\n        'separableConv2d currently does not support dataFormat NCHW; only ' +\n        'NHWC is supported');\n  }\n\n  util.assert(\n      x4D.rank === 4,\n      () => `Error in separableConv2d: input must be rank 4, but got ` +\n          `rank ${x4D.rank}.`);\n  util.assert(\n      $depthwiseFilter.rank === 4,\n      () => `Error in separableConv2d: depthwise filter must be rank 4, but ` +\n          `got rank ${$depthwiseFilter.rank}.`);\n  util.assert(\n      $pointwiseFilter.rank === 4,\n      () => `Error in separableConv2d: pointwise filter must be rank 4, but ` +\n          `got rank ${$depthwiseFilter.rank}.`);\n  util.assert(\n      $pointwiseFilter.shape[0] === 1,\n      () =>\n          `Error in separableConv2d: the first dimension of pointwise filter ` +\n          ` must be 1, but got ${$pointwiseFilter.shape[0]}.`);\n  util.assert(\n      $pointwiseFilter.shape[1] === 1,\n      () => `Error in separableConv2d: the second dimension of pointwise ` +\n          `filter must be 1, but got ${$pointwiseFilter.shape[1]}.`);\n\n  const inChannels = $depthwiseFilter.shape[2];\n  const channelMultiplier = $depthwiseFilter.shape[3];\n  util.assert(\n      $pointwiseFilter.shape[2] === inChannels * channelMultiplier,\n      () =>\n          `Error in separableConv2d: the third dimension of pointwise filter ` +\n          `must be ${inChannels * channelMultiplier}, ` +\n          `but got ${$pointwiseFilter.shape[2]}.`);\n\n  const depthwise = depthwiseConv2d(\n      x4D, $depthwiseFilter, strides, pad, dataFormat, dilation);\n  const pointwiseStride = 1;\n  const res =\n      conv2d(depthwise, $pointwiseFilter, pointwiseStride, 'valid', dataFormat);\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n  return res as T;\n}\n\nexport const separableConv2d = /* @__PURE__ */ op({separableConv2d_});\n", "/**\n * @license\n * Copyright 2020 Google Inc. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor, TensorBuffer} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\n/**\n * Computes the difference between two lists of numbers.\n *\n * Given a Tensor `x` and a Tensor `y`, this operation returns a Tensor `out`\n * that represents all values that are in `x` but not in `y`. The returned\n * Tensor `out` is sorted in the same order that the numbers appear in `x`\n * (duplicates are preserved). This operation also returns a Tensor indices that\n * represents the position of each out element in `x`. In other words:\n *\n * `out[i] = x[idx[i]] for i in [0, 1, ..., out.length - 1]`\n *\n * ```js\n * const x = [1, 2, 3, 4, 5, 6];\n * const y = [1, 3, 5];\n *\n * const [out, indices] = await tf.setdiff1dAsync(x, y);\n * out.print(); // [2, 4, 6]\n * indices.print(); // [1, 3, 5]\n * ```\n *\n * @param x 1-D Tensor. Values to keep.\n * @param y 1-D Tensor. Must have the same type as x. Values to exclude in the\n *     output.\n * @returns Promise of Tensor tuple [out, indices].\n *  out: Tensor with the same type as x.\n *  indices: A Tensor of type int32.\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nasync function setdiff1dAsync_(\n    x: Tensor|TensorLike, y: Tensor|TensorLike): Promise<[Tensor, Tensor]> {\n  const $x = convertToTensor(x, 'x', 'setdiff1d');\n  const $y = convertToTensor(y, 'y', 'setdiff1d');\n\n  util.assert(\n      $x.dtype === $y.dtype,\n      () => `x and y should have the same dtype, but got x (${\n          $x.dtype}) and y (${$y.dtype}).`);\n\n  util.assert(\n      $x.rank === 1, () => `x should be 1D tensor, but got x (${$x.shape}).`);\n\n  util.assert(\n      $y.rank === 1, () => `y should be 1D tensor, but got y (${$y.shape}).`);\n\n  const xVals = await $x.data();\n  const yVals = await $y.data();\n  const ySet = new Set(yVals);\n\n  let outputSize = 0;\n  for (let i = 0; i < xVals.length; i++) {\n    if (!ySet.has(xVals[i])) {\n      outputSize++;\n    }\n  }\n\n  const buffer = new TensorBuffer([outputSize], $x.dtype);\n  const indices = new TensorBuffer([outputSize], 'int32');\n  for (let i = 0, p = 0; i < xVals.length; i++) {\n    if (!ySet.has(xVals[i])) {\n      buffer.values[p] = xVals[i];\n      indices.values[p] = i;\n      p++;\n    }\n  }\n  return [buffer.toTensor(), indices.toTensor()];\n}\nexport const setdiff1dAsync = setdiff1dAsync_;\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Sign, SignInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Returns an element-wise indication of the sign of a number.\n *\n * ```js\n * const x = tf.tensor1d([.6, 1.1, -3.3, NaN, 0]);\n *\n * x.sign().print();  // or tf.sign(x)\n * ```\n * @param x The input Tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction sign_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'sign');\n  const inputs: SignInputs = {x: $x};\n  return ENGINE.runKernel(Sign, inputs as unknown as NamedTensorMap);\n}\nexport const sign = /* @__PURE__ */ op({sign_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Sin, SinInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes sin of the input Tensor element-wise: `sin(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, Math.PI / 2, Math.PI * 3 / 4]);\n *\n * x.sin().print();  // or tf.sin(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction sin_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'sin', 'float32');\n\n  const inputs: SinInputs = {x: $x};\n\n  return ENGINE.runKernel(Sin, inputs as unknown as NamedTensorMap);\n}\nexport const sin = /* @__PURE__ */ op({sin_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Sinh, SinhInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes hyperbolic sin of the input `tf.Tensor` element-wise: `sinh(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, 1, -1, .7]);\n *\n * x.sinh().print();  // or tf.sinh(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction sinh_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'sinh');\n  const inputs: SinhInputs = {x: $x};\n\n  return ENGINE.runKernel(Sinh, inputs as unknown as NamedTensorMap);\n}\nexport const sinh = /* @__PURE__ */ op({sinh_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor1D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\nimport {slice} from './slice';\n\n/**\n * Extracts a 1D slice from 1D array starting at coordinates `begin` and is\n * of length `size`. See `slice` for details.\n */\nfunction slice1d_(\n    x: Tensor1D|TensorLike, begin: number, size: number): Tensor1D {\n  const $x = convertToTensor(x, 'x', 'slice1d');\n  util.assert(\n      $x.rank === 1,\n      () =>\n          `slice1d expects a rank-1 tensor, but got a rank-${$x.rank} tensor`);\n  return slice($x, [begin], [size]);\n}\nexport const slice1d = /* @__PURE__ */ op({slice1d_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor2D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\nimport {slice} from './slice';\n\n/**\n * Extracts a 2D slice from a 2D array starting at coordinates `begin` and\n * is of size `size`. See `slice` for details.\n */\nfunction slice2d_(\n    x: Tensor2D|TensorLike, begin: [number, number],\n    size: [number, number]): Tensor2D {\n  const $x = convertToTensor(x, 'x', 'slice2d');\n  util.assert(\n      $x.rank === 2,\n      () =>\n          `slice2d expects a rank-2 tensor, but got a rank-${$x.rank} tensor`);\n  return slice($x, begin, size);\n}\nexport const slice2d = /* @__PURE__ */ op({slice2d_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor3D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\nimport {slice} from './slice';\n\n/**\n * Extracts a 3D slice from a 3D array starting at coordinates `begin` and\n * is of size `size`. See `slice` for details.\n */\nfunction slice3d_(\n    x: Tensor3D|TensorLike, begin: [number, number, number],\n    size: [number, number, number]): Tensor3D {\n  const $x = convertToTensor(x, 'x', 'slice3d');\n  util.assert(\n      $x.rank === 3,\n      () =>\n          `slice3d expects a rank-3 tensor, but got a rank-${$x.rank} tensor`);\n  return slice($x, begin, size);\n}\nexport const slice3d = /* @__PURE__ */ op({slice3d_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor4D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\nimport {slice} from './slice';\n\n/**\n * Extracts a 4D slice from a 4D array starting at coordinates `begin` and\n * is of size `size`. See `slice` for details.\n */\nfunction slice4d_(\n    x: Tensor4D|TensorLike, begin: [number, number, number, number],\n    size: [number, number, number, number]): Tensor4D {\n  const $x = convertToTensor(x, 'x', 'slice4d');\n  util.assert(\n      $x.rank === 4,\n      () =>\n          `slice4d expects a rank-4 tensor, but got a rank-${$x.rank} tensor`);\n  return slice($x, begin, size);\n}\nexport const slice4d = /* @__PURE__ */ op({slice4d_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Softmax, SoftmaxAttrs, SoftmaxInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the softmax normalized vector given the logits.\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3]);\n *\n * a.softmax().print();  // or tf.softmax(a)\n * ```\n *\n * ```js\n * const a = tf.tensor2d([2, 4, 6, 1, 2, 3], [2, 3]);\n *\n * a.softmax().print();  // or tf.softmax(a)\n * ```\n *\n * @param logits The logits array.\n * @param dim The dimension softmax would be performed on. Defaults to `-1`\n *     which indicates the last dimension.\n *\n * @doc {heading: 'Operations', subheading: 'Normalization'}\n */\nfunction softmax_<T extends Tensor>(logits: T|TensorLike, dim = -1): T {\n  const $logits = convertToTensor(logits, 'logits', 'softmax', 'float32');\n\n  if (dim === -1) {\n    dim = $logits.rank - 1;\n  }\n  if (dim !== $logits.rank - 1) {\n    throw Error(\n        'Softmax along a non-last dimension is not yet supported. ' +\n        `Logits was rank ${$logits.rank} and dim was ${dim}`);\n  }\n\n  const inputs: SoftmaxInputs = {logits: $logits};\n  const attrs: SoftmaxAttrs = {dim};\n\n  return ENGINE.runKernel(\n      Softmax, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const softmax = /* @__PURE__ */ op({softmax_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {FFT, FFTInputs} from '../../kernel_names';\nimport {Tensor} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {assert} from '../../util';\nimport {op} from '../operation';\n\n/**\n * Fast Fourier transform.\n *\n * Computes the 1-dimensional discrete Fourier transform over the inner-most\n * dimension of input.\n *\n * ```js\n * const real = tf.tensor1d([1, 2, 3]);\n * const imag = tf.tensor1d([1, 2, 3]);\n * const x = tf.complex(real, imag);\n *\n * x.fft().print();  // tf.spectral.fft(x).print();\n * ```\n * @param input The complex input to compute an fft over.\n *\n * @doc {heading: 'Operations', subheading: 'Spectral', namespace: 'spectral'}\n */\nfunction fft_(input: Tensor): Tensor {\n  assert(\n      input.dtype === 'complex64',\n      () => `The dtype for tf.spectral.fft() must be complex64 ` +\n          `but got ${input.dtype}.`);\n\n  const inputs: FFTInputs = {input};\n\n  return ENGINE.runKernel(FFT, inputs as unknown as NamedTensorMap);\n}\n\nexport const fft = /* @__PURE__ */ op({fft_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {IFFT, IFFTInputs} from '../../kernel_names';\nimport {Tensor} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {assert} from '../../util';\nimport {op} from '../operation';\n\n/**\n * Inverse fast Fourier transform.\n *\n * Computes the inverse 1-dimensional discrete Fourier transform over the\n * inner-most dimension of input.\n *\n * ```js\n * const real = tf.tensor1d([1, 2, 3]);\n * const imag = tf.tensor1d([1, 2, 3]);\n * const x = tf.complex(real, imag);\n *\n * x.ifft().print();  // tf.spectral.ifft(x).print();\n * ```\n * @param input The complex input to compute an ifft over.\n *\n * @doc {heading: 'Operations', subheading: 'Spectral', namespace: 'spectral'}\n */\nfunction ifft_(input: Tensor): Tensor {\n  assert(\n      input.dtype === 'complex64',\n      () => `The dtype for tf.spectral.ifft() must be complex64 ` +\n          `but got ${input.dtype}.`);\n\n  const inputs: IFFTInputs = {input};\n\n  return ENGINE.runKernel(IFFT, inputs as unknown as NamedTensorMap);\n}\n\nexport const ifft = /* @__PURE__ */ op({ifft_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor, Tensor2D} from '../../tensor';\nimport {complex} from '../complex';\nimport {concat} from '../concat';\nimport {imag} from '../imag';\nimport {mul} from '../mul';\nimport {op} from '../operation';\nimport {real} from '../real';\nimport {reshape} from '../reshape';\nimport {reverse} from '../reverse';\nimport {scalar} from '../scalar';\nimport {slice} from '../slice';\n\nimport {ifft} from './ifft';\n\n/**\n * Inversed real value input fast Fourier transform.\n *\n * Computes the 1-dimensional inversed discrete Fourier transform over the\n * inner-most dimension of the real input.\n *\n * ```js\n * const real = tf.tensor1d([1, 2, 3]);\n * const imag = tf.tensor1d([0, 0, 0]);\n * const x = tf.complex(real, imag);\n *\n * x.irfft().print();\n * ```\n * @param input The real value input to compute an irfft over.\n *\n * @doc {heading: 'Operations', subheading: 'Spectral', namespace: 'spectral'}\n */\nfunction irfft_(input: Tensor): Tensor {\n  const innerDimensionSize = input.shape[input.shape.length - 1];\n  const batch = input.size / innerDimensionSize;\n  let ret: Tensor;\n  if (innerDimensionSize <= 2) {\n    const complexInput = reshape(input, [batch, innerDimensionSize]);\n    ret = ifft(complexInput);\n  } else {\n    // The length of unique components of the DFT of a real-valued signal\n    // is 2 * (input_len - 1)\n    const outputShape = [batch, 2 * (innerDimensionSize - 1)];\n    const realInput = reshape(real(input), [batch, innerDimensionSize]);\n    const imagInput = reshape(imag(input), [batch, innerDimensionSize]);\n\n    const realConjugate =\n        reverse(slice(realInput, [0, 1], [batch, innerDimensionSize - 2]), 1);\n    const imagConjugate: Tensor2D = mul(\n        reverse(slice(imagInput, [0, 1], [batch, innerDimensionSize - 2]), 1),\n        scalar(-1));\n\n    const r = concat([realInput, realConjugate], 1);\n    const i = concat([imagInput, imagConjugate], 1);\n    const complexInput =\n        reshape(complex(r, i), [outputShape[0], outputShape[1]]);\n    ret = ifft(complexInput);\n  }\n  ret = real(ret);\n  // reshape the result if the input is 3D tensor.\n  if (input.rank === 3 && input.shape[0] !== 0) {\n    const temp = ret;\n    const batch = input.shape[0];\n    ret = reshape(ret, [batch, ret.shape[0] / batch, ret.shape[1]]);\n    temp.dispose();\n  }\n  return ret;\n}\n\nexport const irfft = /* @__PURE__ */ op({irfft_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {SplitV, SplitVAttrs, SplitVInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Splits a `tf.Tensor` into sub tensors.\n *\n * If `numOrSizeSplits` is a number, splits `x` along dimension `axis`\n * into `numOrSizeSplits` smaller tensors.\n * Requires that `numOrSizeSplits` evenly divides `x.shape[axis]`.\n *\n * If `numOrSizeSplits` is a number array, splits `x` into\n * `numOrSizeSplits.length` pieces. The shape of the `i`-th piece has the\n * same size as `x` except along dimension `axis` where the size is\n * `numOrSizeSplits[i]`.\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4, 5, 6, 7, 8], [2, 4]);\n * const [a, b] = tf.split(x, 2, 1);\n * a.print();\n * b.print();\n *\n * const [c, d, e] = tf.split(x, [1, 2, 1], 1);\n * c.print();\n * d.print();\n * e.print();\n * ```\n *\n * @param x The input tensor to split.\n * @param numOrSizeSplits Either an integer indicating the number of\n * splits along the axis or an array of integers containing the sizes of\n * each output tensor along the axis. If a number then it must evenly divide\n * `x.shape[axis]`; otherwise the sum of sizes must match `x.shape[axis]`.\n * Can contain one -1 indicating that dimension is to be inferred.\n * @param axis The dimension along which to split. Defaults to 0 (the first\n * dim).\n *\n * @doc {heading: 'Tensors', subheading: 'Slicing and Joining'}\n */\nfunction split_<T extends Tensor>(\n    x: Tensor|TensorLike, numOrSizeSplits: number[]|number, axis = 0): T[] {\n  const $x = convertToTensor(x, 'x', 'split');\n\n  const inputs: SplitVInputs = {x: $x};\n  const attr: SplitVAttrs = {numOrSizeSplits, axis};\n\n  return ENGINE.runKernel(\n             SplitV, inputs as unknown as NamedTensorMap,\n             attr as unknown as NamedAttrMap) as unknown as T[];\n}\n\nexport const split = /* @__PURE__ */ op({split_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../../tensor';\nimport {assert} from '../../util';\nimport {complex} from '../complex';\nimport {concat} from '../concat';\nimport {imag} from '../imag';\nimport {op} from '../operation';\nimport {real} from '../real';\nimport {reshape} from '../reshape';\nimport {slice} from '../slice';\nimport {split} from '../split';\nimport {zeros} from '../zeros';\nimport {zerosLike} from '../zeros_like';\n\nimport {fft} from './fft';\n\n/**\n * Real value input fast Fourier transform.\n *\n * Computes the 1-dimensional discrete Fourier transform over the\n * inner-most dimension of the real input.\n *\n * ```js\n * const real = tf.tensor1d([1, 2, 3]);\n *\n * real.rfft().print();\n * ```\n * @param input The real value input to compute an rfft over.\n *\n * @doc {heading: 'Operations', subheading: 'Spectral', namespace: 'spectral'}\n */\nfunction rfft_(input: Tensor, fftLength?: number): Tensor {\n  assert(\n      input.dtype === 'float32',\n      () => `The dtype for rfft() must be real value but got ${input.dtype}`);\n\n  let innerDimensionSize = input.shape[input.shape.length - 1];\n  const batch = input.size / innerDimensionSize;\n\n  let adjustedInput: Tensor;\n  if (fftLength != null && fftLength < innerDimensionSize) {\n    // Need to crop\n    const begin = input.shape.map(v => 0);\n    const size = input.shape.map(v => v);\n    size[input.shape.length - 1] = fftLength;\n    adjustedInput = slice(input, begin, size);\n    innerDimensionSize = fftLength;\n  } else if (fftLength != null && fftLength > innerDimensionSize) {\n    // Need to pad with zeros\n    const zerosShape = input.shape.map(v => v);\n    zerosShape[input.shape.length - 1] = fftLength - innerDimensionSize;\n    adjustedInput = concat([input, zeros(zerosShape)], input.shape.length - 1);\n    innerDimensionSize = fftLength;\n  } else {\n    adjustedInput = input;\n  }\n\n  // Complement the input with zero imaginary numbers.\n  const zerosInput = zerosLike(adjustedInput);\n  const complexInput =\n      reshape(complex(adjustedInput, zerosInput), [batch, innerDimensionSize]);\n\n  const ret = fft(complexInput);\n\n  // Exclude complex conjugations. These conjugations are put symmetrically.\n  const half = Math.floor(innerDimensionSize / 2) + 1;\n  const realValues = real(ret);\n  const imagValues = imag(ret);\n  const realComplexConjugate = split(\n      realValues, [half, innerDimensionSize - half],\n      realValues.shape.length - 1);\n  const imagComplexConjugate = split(\n      imagValues, [half, innerDimensionSize - half],\n      imagValues.shape.length - 1);\n\n  const outputShape = adjustedInput.shape.slice();\n  outputShape[adjustedInput.shape.length - 1] = half;\n\n  return reshape(\n      complex(realComplexConjugate[0], imagComplexConjugate[0]), outputShape);\n}\n\nexport const rfft = /* @__PURE__ */ op({rfft_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {SquaredDifference, SquaredDifferenceInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {op} from './operation';\n\n/**\n * Returns (a - b) * (a - b) element-wise.\n * Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([1, 4, 3, 16]);\n * const b = tf.tensor1d([1, 2, 9, 4]);\n *\n * a.squaredDifference(b).print();  // or tf.squaredDifference(a, b)\n * ```\n *\n * ```js\n * // Broadcast squared difference  a with b.\n * const a = tf.tensor1d([2, 4, 6, 8]);\n * const b = tf.scalar(5);\n *\n * a.squaredDifference(b).print();  // or tf.squaredDifference(a, b)\n * ```\n *\n * @param a The first tensor.\n * @param b The second tensor. Must have the same type as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction squaredDifference_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'squaredDifference');\n  let $b = convertToTensor(b, 'b', 'squaredDifference');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: SquaredDifferenceInputs = {a: $a, b: $b};\n  const attrs = {};\n\n  return ENGINE.runKernel(\n      SquaredDifference, inputs as unknown as NamedTensorMap, attrs);\n}\n\nexport const squaredDifference = /* @__PURE__ */ op({squaredDifference_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {squeezeShape} from '../util';\n\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Removes dimensions of size 1 from the shape of a `tf.Tensor`.\n *\n * ```js\n * const x = tf.tensor([1, 2, 3, 4], [1, 1, 4]);\n * x.squeeze().print();\n * ```\n *\n * @param x The input tensor to be squeezed.\n * @param axis An optional list of numbers. If specified, only\n *     squeezes the dimensions listed. The dimension index starts at 0. It\n * is an error to squeeze a dimension that is not 1.\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction squeeze_<T extends Tensor>(x: Tensor|TensorLike, axis?: number[]): T {\n  const $x = convertToTensor(x, 'x', 'squeeze', 'string_or_numeric');\n  return reshape($x, squeezeShape($x.shape, axis).newShape) as T;\n}\n\nexport const squeeze = /* @__PURE__ */ op({squeeze_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Pack, PackAttrs, PackInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensorArray} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Stacks a list of rank-`R` `tf.Tensor`s into one rank-`(R+1)` `tf.Tensor`.\n *\n * ```js\n * const a = tf.tensor1d([1, 2]);\n * const b = tf.tensor1d([3, 4]);\n * const c = tf.tensor1d([5, 6]);\n * tf.stack([a, b, c]).print();\n * ```\n *\n * @param tensors A list of tensor objects with the same shape and dtype.\n * @param axis The axis to stack along. Defaults to 0 (the first dim).\n *\n * @doc {heading: 'Tensors', subheading: 'Slicing and Joining'}\n */\nfunction stack_<T extends Tensor>(\n    tensors: Array<T|TensorLike>, axis = 0): Tensor {\n  const $tensors =\n      convertToTensorArray(tensors, 'tensors', 'stack', 'string_or_numeric');\n\n  util.assert(\n      $tensors.length >= 1, () => 'Pass at least one tensor to tf.stack');\n\n  if ($tensors.length > 0) {\n    util.assert(\n        axis <= $tensors[0].rank, () => 'Axis must be <= rank of the tensor');\n  }\n\n  const inputs: PackInputs = $tensors;\n  const attrs: PackAttrs = {axis};\n\n  return ENGINE.runKernel(\n      Pack, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const stack = /* @__PURE__ */ op({stack_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Step, StepAttrs, StepInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes step of the input `tf.Tensor` element-wise: `x > 0 ? 1 : alpha`\n *\n * ```js\n * const x = tf.tensor1d([0, 2, -1, -3]);\n *\n * x.step(.5).print();  // or tf.step(x, .5)\n * ```\n * @param x The input tensor.\n * @param alpha The gradient when input is negative. Defaults to 0.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction step_<T extends Tensor>(x: T|TensorLike, alpha = 0.0): T {\n  const $x = convertToTensor(x, 'x', 'step');\n\n  const inputs: StepInputs = {x: $x};\n  const attrs: StepAttrs = {alpha};\n\n  return ENGINE.runKernel(\n      Step, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\nexport const step = /* @__PURE__ */ op({step_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {StridedSlice, StridedSliceAttrs, StridedSliceInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Extracts a strided slice of a tensor.\n *\n * Roughly speaking, this op extracts a slice of size (end-begin)/stride from\n * the given input tensor (x). Starting at the location specified by begin the\n * slice continues by adding stride to the index until all dimensions are not\n * less than end. Note that a stride can be negative, which causes a reverse\n * slice.\n *\n * ```js\n * const t = tf.tensor3d([1, 1, 1 ,2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6],\n *    [3, 2, 3]);\n * t.stridedSlice([1, 0, 0], [2, 1, 3], [1, 1, 1]).print()  // [[[3, 3, 3]]]\n * t.stridedSlice([1, 0, 0], [2, 2, 3], [1, 1, 1]).print()  // [[[3, 3, 3],\n *                                                     // [4, 4, 4]]]\n * t.stridedSlice([1, -1, 0], [2, -3, 3], [1, -1, 1]).print() // [[[4, 4, 4],\n *                                                     // [3, 3, 3]]]\n * ```\n *\n * @param x The tensor to stride slice.\n * @param begin The coordinates to start the slice from.\n * @param end: The coordinates to end the slice at.\n * @param strides: The size of the slice.\n * @param beginMask: If the ith bit of beginMask is set, begin[i] is ignored\n *      and the fullest possible range in that dimension is used instead.\n * @param endMask: If the ith bit of endMask is set, end[i] is ignored\n *      and the fullest possible range in that dimension is used instead.\n * @param shrinkAxisMask: a bitmask where bit i implies that\n * the ith specification should shrink the dimensionality. begin and end must\n * imply a slice of size 1 in the dimension.\n *\n * @doc {heading: 'Operations', subheading: 'Slicing and Joining'}\n */\nfunction stridedSlice_(\n    x: Tensor|TensorLike, begin: number[], end: number[], strides?: number[],\n    beginMask = 0, endMask = 0, ellipsisMask = 0, newAxisMask = 0,\n    shrinkAxisMask = 0): Tensor {\n  const $x = convertToTensor(x, 'x', 'stridedSlice', 'string_or_numeric');\n\n  const inputs: StridedSliceInputs = {x: $x};\n  const attrs: StridedSliceAttrs = {\n    begin,\n    end,\n    strides,\n    beginMask,\n    endMask,\n    ellipsisMask,\n    newAxisMask,\n    shrinkAxisMask\n  };\n\n  return ENGINE.runKernel(\n      StridedSlice, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const stridedSlice = /* @__PURE__ */ op({stridedSlice_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Tan, TanInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes tan of the input `tf.Tensor` element-wise, `tan(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, Math.PI / 2, Math.PI * 3 / 4]);\n *\n * x.tan().print();  // or tf.tan(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction tan_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'tan', 'float32');\n\n  const inputs: TanInputs = {x: $x};\n\n  return ENGINE.runKernel(Tan, inputs as unknown as NamedTensorMap);\n}\nexport const tan = /* @__PURE__ */ op({tan_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor1D} from '../tensor';\nimport {inferShape} from '../tensor_util_env';\nimport {TensorLike1D} from '../types';\nimport {DataType} from '../types';\nimport {assertNonNull} from '../util';\nimport {makeTensor} from './tensor_ops_util';\n\n/**\n * Creates rank-1 `tf.Tensor` with the provided values, shape and dtype.\n *\n * The same functionality can be achieved with `tf.tensor`, but in general\n * we recommend using `tf.tensor1d` as it makes the code more readable.\n *\n * ```js\n * tf.tensor1d([1, 2, 3]).print();\n * ```\n *\n * @param values The values of the tensor. Can be array of numbers,\n *     or a `TypedArray`.\n * @param dtype The data type.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function tensor1d(values: TensorLike1D, dtype?: DataType): Tensor1D {\n  assertNonNull(values);\n  const inferredShape = inferShape(values, dtype);\n  if (inferredShape.length !== 1) {\n    throw new Error('tensor1d() requires values to be a flat/TypedArray');\n  }\n  const shape: number[] = null;\n  return makeTensor(values, shape, inferredShape, dtype) as Tensor1D;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor2D} from '../tensor';\nimport {inferShape} from '../tensor_util_env';\nimport {TensorLike2D} from '../types';\nimport {DataType} from '../types';\nimport {assertNonNull} from '../util';\nimport {makeTensor} from './tensor_ops_util';\n\n/**\n * Creates rank-2 `tf.Tensor` with the provided values, shape and dtype.\n *\n * The same functionality can be achieved with `tf.tensor`, but in general\n * we recommend using `tf.tensor2d` as it makes the code more readable.\n *\n *  ```js\n * // Pass a nested array.\n * tf.tensor2d([[1, 2], [3, 4]]).print();\n * ```\n * ```js\n * // Pass a flat array and specify a shape.\n * tf.tensor2d([1, 2, 3, 4], [2, 2]).print();\n * ```\n *\n * @param values The values of the tensor. Can be nested array of numbers,\n *     or a flat array, or a `TypedArray`.\n * @param shape The shape of the tensor. If not provided, it is inferred from\n *     `values`.\n * @param dtype The data type.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function tensor2d(\n    values: TensorLike2D, shape?: [number, number],\n    dtype?: DataType): Tensor2D {\n  assertNonNull(values);\n  if (shape != null && shape.length !== 2) {\n    throw new Error('tensor2d() requires shape to have two numbers');\n  }\n  const inferredShape = inferShape(values, dtype);\n  if (inferredShape.length !== 2 && inferredShape.length !== 1) {\n    throw new Error(\n        'tensor2d() requires values to be number[][] or flat/TypedArray');\n  }\n  if (inferredShape.length === 1 && shape == null) {\n    throw new Error(\n        'tensor2d() requires shape to be provided when `values` ' +\n        'are a flat/TypedArray');\n  }\n  return makeTensor(values, shape, inferredShape, dtype) as Tensor2D;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor3D} from '../tensor';\nimport {inferShape} from '../tensor_util_env';\nimport {TensorLike3D} from '../types';\nimport {DataType} from '../types';\nimport {assertNonNull} from '../util';\nimport {makeTensor} from './tensor_ops_util';\n\n/**\n * Creates rank-3 `tf.Tensor` with the provided values, shape and dtype.\n *\n * The same functionality can be achieved with `tf.tensor`, but in general\n * we recommend using `tf.tensor3d` as it makes the code more readable.\n *\n *  ```js\n * // Pass a nested array.\n * tf.tensor3d([[[1], [2]], [[3], [4]]]).print();\n * ```\n * ```js\n * // Pass a flat array and specify a shape.\n * tf.tensor3d([1, 2, 3, 4], [2, 2, 1]).print();\n * ```\n *\n * @param values The values of the tensor. Can be nested array of numbers,\n *     or a flat array, or a `TypedArray`.\n * @param shape The shape of the tensor. If not provided,  it is inferred from\n *     `values`.\n * @param dtype The data type.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function tensor3d(\n    values: TensorLike3D, shape?: [number, number, number],\n    dtype?: DataType): Tensor3D {\n  assertNonNull(values);\n  if (shape != null && shape.length !== 3) {\n    throw new Error('tensor3d() requires shape to have three numbers');\n  }\n  const inferredShape = inferShape(values, dtype);\n  if (inferredShape.length !== 3 && inferredShape.length !== 1) {\n    throw new Error(\n        'tensor3d() requires values to be number[][][] or flat/TypedArray');\n  }\n  if (inferredShape.length === 1 && shape == null) {\n    throw new Error(\n        'tensor3d() requires shape to be provided when `values` ' +\n        'are a flat array');\n  }\n  return makeTensor(values, shape, inferredShape, dtype) as Tensor3D;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor4D} from '../tensor';\nimport {inferShape} from '../tensor_util_env';\nimport {TensorLike4D} from '../types';\nimport {DataType} from '../types';\nimport {assertNonNull} from '../util';\nimport {makeTensor} from './tensor_ops_util';\n\n/**\n * Creates rank-4 `tf.Tensor` with the provided values, shape and dtype.\n *\n * The same functionality can be achieved with `tf.tensor`, but in general\n * we recommend using `tf.tensor4d` as it makes the code more readable.\n *\n *  ```js\n * // Pass a nested array.\n * tf.tensor4d([[[[1], [2]], [[3], [4]]]]).print();\n * ```\n * ```js\n * // Pass a flat array and specify a shape.\n * tf.tensor4d([1, 2, 3, 4], [1, 2, 2, 1]).print();\n * ```\n *\n * @param values The values of the tensor. Can be nested array of numbers,\n *     or a flat array, or a `TypedArray`.\n * @param shape The shape of the tensor. Optional. If not provided,\n *   it is inferred from `values`.\n * @param dtype The data type.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function tensor4d(\n    values: TensorLike4D, shape?: [number, number, number, number],\n    dtype?: DataType): Tensor4D {\n  assertNonNull(values);\n  if (shape != null && shape.length !== 4) {\n    throw new Error('tensor4d() requires shape to have four numbers');\n  }\n  const inferredShape = inferShape(values, dtype);\n  if (inferredShape.length !== 4 && inferredShape.length !== 1) {\n    throw new Error(\n        'tensor4d() requires values to be number[][][][] or flat/TypedArray');\n  }\n  if (inferredShape.length === 1 && shape == null) {\n    throw new Error(\n        'tensor4d() requires shape to be provided when `values` ' +\n        'are a flat array');\n  }\n  return makeTensor(values, shape, inferredShape, dtype) as Tensor4D;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor5D} from '../tensor';\nimport {inferShape} from '../tensor_util_env';\nimport {TensorLike5D} from '../types';\nimport {DataType} from '../types';\nimport {assertNonNull} from '../util';\nimport {makeTensor} from './tensor_ops_util';\n\n/**\n * Creates rank-5 `tf.Tensor` with the provided values, shape and dtype.\n *\n * The same functionality can be achieved with `tf.tensor`, but in general\n * we recommend using `tf.tensor5d` as it makes the code more readable.\n *\n *  ```js\n * // Pass a nested array.\n * tf.tensor5d([[[[[1],[2]],[[3],[4]]],[[[5],[6]],[[7],[8]]]]]).print();\n * ```\n * ```js\n * // Pass a flat array and specify a shape.\n * tf.tensor5d([1, 2, 3, 4, 5, 6, 7, 8], [1, 2, 2, 2, 1]).print();\n * ```\n *\n * @param values The values of the tensor. Can be nested array of numbers,\n *     or a flat array, or a `TypedArray`.\n * @param shape The shape of the tensor. Optional. If not provided,\n *   it is inferred from `values`.\n * @param dtype The data type.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function tensor5d(\n    values: TensorLike5D, shape?: [number, number, number, number, number],\n    dtype?: DataType): Tensor5D {\n  assertNonNull(values);\n  if (shape != null && shape.length !== 5) {\n    throw new Error('tensor5d() requires shape to have five numbers');\n  }\n  const inferredShape = inferShape(values, dtype);\n  if (inferredShape.length !== 5 && inferredShape.length !== 1) {\n    throw new Error(\n        'tensor5d() requires values to be ' +\n        'number[][][][][] or flat/TypedArray');\n  }\n  if (inferredShape.length === 1 && shape == null) {\n    throw new Error(\n        'tensor5d() requires shape to be provided when `values` ' +\n        'are a flat array');\n  }\n  return makeTensor(values, shape, inferredShape, dtype) as Tensor5D;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor6D} from '../tensor';\nimport {inferShape} from '../tensor_util_env';\nimport {TensorLike6D} from '../types';\nimport {DataType} from '../types';\nimport {assertNonNull} from '../util';\nimport {makeTensor} from './tensor_ops_util';\n\n/**\n * Creates rank-6 `tf.Tensor` with the provided values, shape and dtype.\n *\n * The same functionality can be achieved with `tf.tensor`, but in general\n * we recommend using `tf.tensor6d` as it makes the code more readable.\n *\n *  ```js\n * // Pass a nested array.\n * tf.tensor6d([[[[[[1],[2]],[[3],[4]]],[[[5],[6]],[[7],[8]]]]]]).print();\n * ```\n * ```js\n * // Pass a flat array and specify a shape.\n * tf.tensor6d([1, 2, 3, 4, 5, 6, 7, 8], [1, 1, 2, 2, 2, 1]).print();\n * ```\n *\n * @param values The values of the tensor. Can be nested array of numbers,\n *     or a flat array, or a `TypedArray`.\n * @param shape The shape of the tensor. Optional. If not provided,\n *   it is inferred from `values`.\n * @param dtype The data type.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function tensor6d(\n    values: TensorLike6D,\n    shape?: [number, number, number, number, number, number],\n    dtype?: DataType): Tensor6D {\n  assertNonNull(values);\n  if (shape != null && shape.length !== 6) {\n    throw new Error('tensor6d() requires shape to have six numbers');\n  }\n  const inferredShape = inferShape(values, dtype);\n  if (inferredShape.length !== 6 && inferredShape.length !== 1) {\n    throw new Error(\n        'tensor6d() requires values to be number[][][][][][] or ' +\n        'flat/TypedArray');\n  }\n  if (inferredShape.length === 1 && shape == null) {\n    throw new Error(\n        'tensor6d() requires shape to be provided when `values` ' +\n        'are a flat array');\n  }\n  shape = shape ||\n      inferredShape as [number, number, number, number, number, number];\n  return makeTensor(values, shape, inferredShape, dtype) as Tensor6D;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport { TensorInfo } from '../tensor_info';\nimport {Tensor} from '../tensor';\nimport {computeStrides, sizeFromShape} from '../util';\n\n/**\n * Check whether updates.shape = indices.shape[:batchDim] +\n * shape[sliceDim:]\n *\n * @param x The input tensor.\n */\nexport function validateUpdateShape(\n    shape: number[], indices: Tensor, updates: Tensor) {\n  const sliceDim = (indices.rank > 1) ? indices.shape[indices.rank - 1] : 1;\n  const batchDim = (indices.rank > 1) ? indices.rank - 1 : 1;\n\n  const shapeError = 'Must have updates.shape = indices.shape[:batchDim] + ' +\n      `shape[sliceDim:], got updates.shape: ${updates.shape}` +\n      `, indices.shape: ${indices.shape}, shape: ${shape}` +\n      `, sliceDim: ${sliceDim}, and batchDim: ${batchDim}.`;\n\n  if (updates.rank < batchDim) {\n    throw new Error(shapeError + ` update.rank < ${batchDim}. `);\n  }\n  if (shape.length < sliceDim + (updates.rank - batchDim)) {\n    throw new Error(\n        shapeError +\n        ` Output shape length < ${sliceDim + (updates.rank - batchDim)}`);\n  }\n  if (updates.rank !== batchDim + shape.length - sliceDim) {\n    throw new Error(\n        shapeError + ` update.rank != ${batchDim + shape.length - sliceDim}`);\n  }\n  for (let d = 0; d < batchDim; ++d) {\n    if (updates.shape[d] !== indices.shape[d]) {\n      throw new Error(\n          shapeError +\n          ` updates.shape[${d}] (${updates.shape[d]}) != indices.shape[${d}] (${\n              indices.shape[d]}).`);\n    }\n  }\n  for (let d = 0; d < updates.rank - batchDim; ++d) {\n    if (updates.shape[d + batchDim] !== shape[d + sliceDim]) {\n      throw new Error(\n          shapeError +\n          ` updates.shape[${d + batchDim}] (${\n              updates.shape[d + batchDim]}) != shape[${d + batchDim}] (${\n              shape[d + batchDim]})`);\n    }\n  }\n}\n\nexport interface ScatterShapeInfo {\n  sliceRank: number;\n  numUpdates: number;\n  sliceSize: number;\n  strides: number[];\n  outputSize: number;\n}\n/**\n * Validate scatter nd inputs.\n *\n * @param update The tensor contains the update values.\n * @param indices The tensor contains the indices for the update values.\n * @param shape The shape of the output tensor.\n */\nexport function validateInput(\n    updates: Tensor, indices: Tensor, shape: number[]) {\n  if (indices.rank < 1) {\n    throw new Error(\n        'tf.scatterND() expects the indices to be rank 1 or higher,' +\n        ` but the rank was ${indices.rank}.`);\n  }\n  if (updates.rank < 1) {\n    throw new Error(\n        'tf.scatterND() expects the updates to be rank 1 or higher,' +\n        ` but the rank was ${updates.rank}.`);\n  }\n  if (indices.dtype !== 'int32') {\n    throw new Error(`The dtype of 'indices' should be int32, but got dtype: ${\n        indices.dtype}`);\n  }\n  if (shape.length < 1) {\n    throw new Error(\n        `Output rank must be greater or equal to 1, but got shape: ${shape}`);\n  }\n\n  if (shape.length === 0) {\n    if (indices.size === 0) {\n      throw new Error(`Indices specified for empty output. indices shape: ${\n          indices.shape}`);\n    }\n    if (updates.size === 0) {\n      throw new Error(`Updates specified for empty output. updates shape: ${\n          updates.shape}`);\n    }\n  }\n\n  validateUpdateShape(shape, indices, updates);\n}\n\n/**\n * Calculate the shape information for the output.\n *\n * @param update The tensor contains the update values.\n * @param indices The tensor contains the indices for the update values.\n * @param shape The shape of the output tensor.\n *\n * @returns ScatterShapeInfo\n */\nexport function calculateShapes(\n    updates: TensorInfo, indices: TensorInfo,\n    shape: number[]): ScatterShapeInfo {\n  // Calculate the number of dimensions in indices\n  const indicesRank = indices.shape.length;\n  const sliceRank = (indicesRank > 1) ? indices.shape[indicesRank - 1] : 1;\n\n  // Calculate the number of elements that make up each slice of our updated\n  // tensor. This allows us to work with flattened tensors and copy over whole\n  // slices at a time.\n  const totalNd = shape.length;\n\n  let sliceSize = 1;\n  for (let i = sliceRank; i < totalNd; ++i) {\n    sliceSize *= shape[i];\n  }\n\n  const safeSliceDim = (sliceRank < 1) ? 1 : sliceRank;\n  const numUpdates = sizeFromShape(indices.shape) / safeSliceDim;\n\n  const strides = [...computeStrides(shape.slice(0, sliceRank)), 1];\n  const outputSize = sizeFromShape(shape);\n  return {sliceRank, numUpdates, sliceSize, strides, outputSize};\n}\n", "/**\n * @license\n * Copyright 2022 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {TensorScatterUpdate, TensorScatterUpdateAttrs, TensorScatterUpdateInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {Rank, TensorLike} from '../types';\n\nimport {op} from './operation';\nimport * as scatter_nd_util from './scatter_nd_util';\n\n/**\n * Creates a new tensor by applying sparse updates to individual\n * values or slices to the passed in tensor according to\n * indices. This operator is the similar to scatterNd op, except that the\n * udpates are scattered on an existing tensor (as opposed to a zero-tensor).\n *\n * If indices contains duplicates, then we pick the last update for the index.\n *\n * If an out of bound index is found on CPU, an error is returned.\n *\n * Warning: There are some GPU specific semantics for this operation.\n *  - If an out of bound index is found, the index is ignored.\n *  - The order in which updates are applied is nondeterministic, so the output\n * will be nondeterministic if indices contains duplicates.\n * ```js\n * const shape = [8];\n * const tensor = tf.ones(shape);\n * const indices = tf.tensor2d([4, 3, 1, 7], [4, 1], 'int32');\n * const updates = tf.tensor1d([9, 10, 11, 12]);\n *\n * tf.tensorScatterUpdate(tensor, indices, updates).print();\n *    //[1, 11, 1, 10, 9, 1, 1, 12]\n * ```\n *\n * @param tensor A Tensor. Tensor to copy/update.\n * @param indices The tensor contains the indices into the output tensor, must\n *     have at least 2 axes: (num_updates, index_depth).\n * @param updates The tensor contains the value for the indices.\n *\n * @doc {heading: 'Operations', subheading: 'Slicing and Joining'}\n */\nfunction tensorScatterUpdate_<R extends Rank>(\n    tensor: Tensor<R>|TensorLike, indices: Tensor|TensorLike,\n    updates: Tensor|TensorLike): Tensor<R> {\n  const $tensor = convertToTensor(tensor, 'tensor', 'tensorScatterupdate');\n  const $indices =\n      convertToTensor(indices, 'indices', 'tensorScatterupdate', 'int32');\n  const $updates = convertToTensor(updates, 'updates', 'tensorScatterupdate');\n  scatter_nd_util.validateInput($updates, $indices, $tensor.shape);\n  if ($tensor.dtype !== $updates.dtype) {\n    throw new Error(\n        `tensor and updates must have the same dtype, instead they are ${\n            $tensor.dtype} and ${$updates.dtype}.`);\n  }\n\n  const inputs: TensorScatterUpdateInputs = {\n    tensor: $tensor,\n    indices: $indices,\n    updates: $updates\n  };\n  const attrs: TensorScatterUpdateAttrs = {};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  return ENGINE.runKernel(\n             TensorScatterUpdate, inputs as unknown as NamedTensorMap,\n             attrs as unknown as NamedAttrMap) as Tensor<R>;\n}\n\nexport const tensorScatterUpdate = op({tensorScatterUpdate_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {TopK, TopKAttrs, TopKInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Finds the values and indices of the `k` largest entries along the last\n * dimension.\n *\n * If the input is a vector (rank=1), finds the k largest entries in the vector\n * and outputs their values and indices as vectors. Thus values[j] is the j-th\n * largest entry in input, and its index is indices[j].\n * For higher rank inputs, computes the top k entries along the last dimension.\n *\n * If two elements are equal, the lower-index element appears first.\n *\n * ```js\n * const a = tf.tensor2d([[1, 5], [4, 3]]);\n * const {values, indices} = tf.topk(a);\n * values.print();\n * indices.print();\n * ```\n * @param x 1-D or higher `tf.Tensor` with last dimension being at least `k`.\n * @param k Number of top elements to look for along the last dimension.\n * @param sorted If true, the resulting `k` elements will be sorted by the\n *     values in descending order.\n *\n * @doc {heading: 'Operations', subheading: 'Evaluation'}\n */\nfunction topk_<T extends Tensor>(\n    x: T|TensorLike, k = 1, sorted = true): {values: T, indices: T} {\n  const $x = convertToTensor(x, 'x', 'topk');\n  if ($x.rank === 0) {\n    throw new Error('topk() expects the input to be of rank 1 or higher');\n  }\n  const lastDim = $x.shape[$x.shape.length - 1];\n\n  if (k < 0) {\n    throw new Error(`'k' passed to topk() must be >= 0 but got ${k}`);\n  }\n\n  if (k > lastDim) {\n    throw new Error(\n        `'k' passed to topk() must be <= the last dimension (${lastDim}) ` +\n        `but got ${k}`);\n  }\n\n  const inputs: TopKInputs = {x: $x};\n  const attrs: TopKAttrs = {k, sorted};\n\n  const [values, indices] = ENGINE.runKernel(\n      TopK, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap) as [T, T];\n\n  return {values, indices};\n}\n\nexport const topk = /* @__PURE__ */ op({topk_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {DataType, Rank, ShapeMap} from '../types';\nimport {assertNonNegativeIntegerDimensions} from '../util_base';\n\nimport {buffer} from './buffer';\nimport {op} from './operation';\nimport {MPRandGauss} from './rand_util';\n\n/**\n * Creates a `tf.Tensor` with values sampled from a truncated normal\n * distribution.\n *\n * ```js\n * tf.truncatedNormal([2, 2]).print();\n * ```\n *\n * The generated values follow a normal distribution with specified mean and\n * standard deviation, except that values whose magnitude is more than 2\n * standard deviations from the mean are dropped and re-picked.\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param mean The mean of the normal distribution.\n * @param stdDev The standard deviation of the normal distribution.\n * @param dtype The data type of the output tensor.\n * @param seed The seed for the random number generator.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction truncatedNormal_<R extends Rank>(\n    shape: ShapeMap[R], mean = 0, stdDev = 1, dtype?: 'float32'|'int32',\n    seed?: number): Tensor<R> {\n  assertNonNegativeIntegerDimensions(shape);\n  if (dtype != null && (dtype as DataType) === 'bool') {\n    throw new Error(`Unsupported data type $ { dtype }`);\n  }\n  const randGauss =\n      new MPRandGauss(mean, stdDev, dtype, true /* truncated */, seed);\n  const res = buffer(shape, dtype);\n  for (let i = 0; i < res.values.length; i++) {\n    res.values[i] = randGauss.nextValue();\n  }\n  return res.toTensor();\n}\n\nexport const truncatedNormal = /* @__PURE__ */ op({truncatedNormal_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Unique, UniqueAttrs, UniqueInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor, Tensor1D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {assert} from '../util';\n\nimport {op} from './operation';\n\n/**\n * Finds unique elements along an axis of a tensor.\n *\n * It returns a tensor `values` containing all of the unique elements along the\n * `axis` of the given tensor `x` in the same order that they occur along the\n * `axis` in `x`; `x` does not need to be sorted. It also returns a tensor\n * `indices` the same size as the number of the elements in `x` along the `axis`\n * dimension. It contains the index in the unique output `values`.\n *\n * ```js\n * // A 1-D tensor\n * const a = tf.tensor1d([1, 1, 2, 4, 4, 4, 7, 8, 8]);\n * const {values, indices} = tf.unique(a);\n * values.print();   // [1, 2, 4, 7, 8,]\n * indices.print();  // [0, 0, 1, 2, 2, 2, 3, 4, 4]\n * ```\n *\n * ```js\n * // A 2-D tensor with axis=0\n * //\n * // 'a' is: [[1, 0, 0],\n * //          [1, 0, 0],\n * //          [2, 0, 0]]\n * const a = tf.tensor2d([[1, 0, 0], [1, 0, 0], [2, 0, 0]]);\n * const {values, indices} = tf.unique(a, 0)\n * values.print();   // [[1, 0, 0],\n *                   //  [2, 0, 0]]\n * indices.print();  // [0, 0, 1]\n * ```\n *\n * ```js\n * // A 2-D tensor with axis=1\n * //\n * // 'a' is: [[1, 0, 0],\n * //          [1, 0, 0],\n * //          [2, 0, 0]]\n * const a = tf.tensor2d([[1, 0, 0], [1, 0, 0], [2, 0, 0]]);\n * const {values, indices} = tf.unique(a, 1)\n * values.print();   // [[1, 0],\n *                   //  [1, 0],\n *                   //  [2, 0]]\n * indices.print();  // [0, 1, 1]\n * ```\n * @param x A tensor (int32, string, bool).\n * @param axis The axis of the tensor to find the unique elements.\n * @returns [uniqueElements, indices] (see above for details)\n *\n * @doc {heading: 'Operations', subheading: 'Evaluation'}\n */\nfunction unique_<T extends Tensor>(\n    x: T|TensorLike, axis = 0): {values: T, indices: Tensor1D} {\n  const $x = convertToTensor(x, 'x', 'unique', 'string_or_numeric');\n  assert($x.rank > 0, () => 'The input tensor must be at least 1D');\n\n  const inputs: UniqueInputs = {x: $x};\n  const attrs: UniqueAttrs = {axis};\n  const [values, indices] = ENGINE.runKernel(\n      Unique, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap) as [T, Tensor1D];\n  return {values, indices};\n}\n\nexport const unique = /* @__PURE__ */ op({unique_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {UnsortedSegmentSum, UnsortedSegmentSumAttrs, UnsortedSegmentSumInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor, Tensor1D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {assert, isInt} from '../util';\n\nimport {op} from './operation';\n\n/**\n * Computes the sum along segments of a `tf.Tensor`.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n * const segmentIds = tf.tensor1d([1, 2, 0, 1], 'int32');\n * const numSegments = 3;\n *\n * x.unsortedSegmentSum(segmentIds, numSegments).print()\n * //or tf.unsortedSegmentSum(x, segmentIds, numSegments)\n * ```\n * @param x The `tf.Tensor` that will be summed along its segments.\n * @param segmentIds A `tf.Tensor1D` whose rank is equal to the rank of `x`'s\n * dimension along the `axis`.  Maps each element of `x` to a segment.\n * @param numSegments The number of distinct `segmentIds`.\n *\n * @doc {heading: 'Operations', subheading: 'Segment'}\n */\nfunction unsortedSegmentSum_<T extends Tensor>(\n    x: T|TensorLike, segmentIds: Tensor1D|TensorLike, numSegments: number): T {\n  const $x = convertToTensor(x, 'x', 'unsortedSegmentSum');\n  const $segmentIds =\n      convertToTensor(segmentIds, 'segmentIds', 'unsortedSegmentSum', 'int32');\n  assert(isInt(numSegments), () => 'numSegments must be of dtype int');\n\n  const inputs: UnsortedSegmentSumInputs = {x: $x, segmentIds: $segmentIds};\n  const attrs: UnsortedSegmentSumAttrs = {numSegments};\n\n  return ENGINE.runKernel(\n      UnsortedSegmentSum, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const unsortedSegmentSum = /* @__PURE__ */ op({unsortedSegmentSum_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Unpack, UnpackAttrs, UnpackInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Unstacks a `tf.Tensor` of rank-`R` into a list of rank-`(R-1)` `tf.Tensor`s.\n *\n * ```js\n * const a = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * tf.unstack(a).forEach(tensor => tensor.print());\n * ```\n *\n * @param x A tensor object.\n * @param axis The axis to unstack along. Defaults to 0 (the first dim).\n *\n * @doc {heading: 'Tensors', subheading: 'Slicing and Joining'}\n */\nfunction unstack_(x: Tensor|TensorLike, axis = 0): Tensor[] {\n  const $x = convertToTensor(x, 'x', 'unstack', 'string_or_numeric');\n  util.assert(\n      axis >= -$x.shape.length && axis < $x.shape.length,\n      () =>\n          `Axis = ${axis} is not in [-${$x.shape.length}, ${$x.shape.length})`);\n\n  const inputs: UnpackInputs = {value: $x};\n  const attrs: UnpackAttrs = {axis};\n\n  return ENGINE.runKernel(\n      Unpack, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const unstack = /* @__PURE__ */ op({unstack_});\n", "/**\n * @license\n * Copyright 2022 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {TensorLike} from '../types';\nimport {searchSorted} from './search_sorted';\n\n/**\n * Searches for where a value would go in a sorted sequence.\n *\n * This is not a method for checking containment (like javascript in).\n *\n * The typical use case for this operation is \"binning\", \"bucketing\", or\n * \"discretizing\". The values are assigned to bucket-indices based on the edges\n * listed in 'sortedSequence'. This operation returns the bucket-index for each\n * value.\n *\n * The index returned corresponds to the first edge greater than the value.\n *\n * The axis is not settable for this operation. It always operates on the\n * innermost dimension (axis=-1). The operation will accept any number of outer\n * dimensions.\n *\n * Note: This operation assumes that 'upperBound' is sorted along the\n * innermost axis, maybe using 'sort(..., axis=-1)'. If the sequence is not\n * sorted no error is raised and the content of the returned tensor is not well\n * defined.\n *\n * ```js\n * const seq = tf.tensor1d([0, 3, 9, 10, 10]);\n * const values = tf.tensor1d([0, 4, 10]);\n * const result = tf.upperBound(seq, values);\n * result.print(); // [1, 2, 5]\n * ```\n * @param sortedSequence: N-D. Sorted sequence.\n * @param values: N-D. Search values.\n * @return An N-D int32 tensor the size of values containing the result of\n *     applying upper bound to each value. The result is not a global index to\n *     the entire Tensor, but the index in the last dimension.\n * @doc {heading: 'Operations', subheading: 'Evaluation'}\n */\nexport function upperBound(\n    sortedSequence: Tensor|TensorLike, values: Tensor|TensorLike): Tensor {\n  return searchSorted(sortedSequence, values, 'right');\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Tensor, Variable} from '../tensor';\nimport {DataType, Rank} from '../types';\n\n/**\n * Creates a new variable with the provided initial value.\n * ```js\n * const x = tf.variable(tf.tensor([1, 2, 3]));\n * x.assign(tf.tensor([4, 5, 6]));\n *\n * x.print();\n * ```\n *\n * @param initialValue Initial value for the tensor.\n * @param trainable If true, optimizers are allowed to update it.\n * @param name Name of the variable. Defaults to a unique id.\n * @param dtype If set, initialValue will be converted to the given type.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function variable<R extends Rank>(\n    initialValue: Tensor<R>, trainable = true, name?: string,\n    dtype?: DataType): Variable<R> {\n  return ENGINE.makeVariable(initialValue, trainable, name, dtype) as\n      Variable<R>;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/** An implementation of the Where kernel shared between cpu and webgl */\n\nimport {buffer} from '../ops/buffer';\nimport {Tensor2D} from '../tensor';\nimport {TypedArray} from '../types';\n\nexport function whereImpl(condShape: number[], condVals: TypedArray): Tensor2D {\n  const indices = [];\n  for (let i = 0; i < condVals.length; i++) {\n    if (condVals[i]) {\n      indices.push(i);\n    }\n  }\n\n  const inBuffer = buffer(condShape, 'int32');\n\n  const out = buffer([indices.length, condShape.length], 'int32');\n  for (let i = 0; i < indices.length; i++) {\n    const loc = inBuffer.indexToLoc(indices[i]);\n    const offset = i * condShape.length;\n    out.values.set(loc, offset);\n  }\n  return out.toTensor() as Tensor2D;\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {whereImpl} from '../backends/where_impl';\nimport {Tensor, Tensor2D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\n/**\n * Returns the coordinates of true elements of condition.\n *\n * The coordinates are returned in a 2-D tensor where the first dimension (rows)\n * represents the number of true elements, and the second dimension (columns)\n * represents the coordinates of the true elements. Keep in mind, the shape of\n * the output tensor can vary depending on how many true values there are in\n * input. Indices are output in row-major order. The resulting tensor has the\n * shape `[numTrueElems, condition.rank]`.\n *\n * This is analogous to calling the python `tf.where(cond)` without an x or y.\n *\n * ```js\n * const cond = tf.tensor1d([false, false, true], 'bool');\n * const result = await tf.whereAsync(cond);\n * result.print();\n * ```\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nasync function whereAsync_(condition: Tensor|TensorLike): Promise<Tensor2D> {\n  const $condition =\n      convertToTensor(condition, 'condition', 'whereAsync', 'bool');\n  const vals = await $condition.data();\n  const res = whereImpl($condition.shape, vals);\n  if (condition !== $condition) {\n    $condition.dispose();\n  }\n  return res;\n}\n\nexport const whereAsync = whereAsync_;\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {gather} from './gather';\nimport {reshape} from './reshape';\nimport {squeeze} from './squeeze';\nimport {whereAsync} from './where_async';\n\n/**\n * Apply boolean mask to tensor.\n *\n * ```js\n * const tensor = tf.tensor2d([1, 2, 3, 4, 5, 6], [3, 2]);\n * const mask = tf.tensor1d([1, 0, 1], 'bool');\n * const result = await tf.booleanMaskAsync(tensor, mask);\n * result.print();\n * ```\n *\n * @param tensor N-D tensor.\n * @param mask K-D boolean tensor, K <= N and K must be known statically.\n * @param axis A 0-D int Tensor representing the axis in tensor to mask from.\n *     By default, axis is 0 which will mask from the first dimension.\n *     Otherwise K + axis <= N.\n *\n * @doc {heading: 'Tensors', subheading: 'Slicing and Joining'}\n */\nasync function booleanMaskAsync_(\n    tensor: Tensor|TensorLike, mask: Tensor|TensorLike,\n    axis?: number): Promise<Tensor> {\n  const $tensor = convertToTensor(tensor, 'tensor', 'boolMask');\n  const $mask = convertToTensor(mask, 'mask', 'boolMask', 'bool');\n\n  const axisFrom = axis == null ? 0 : axis;\n  const maskDim = $mask.rank;\n  const tensorShape = $tensor.shape;\n\n  util.assert(maskDim > 0, () => 'mask cannot be scalar');\n  util.assertShapesMatch(\n      tensorShape.slice(axisFrom, axisFrom + maskDim), $mask.shape,\n      `mask's shape must match the first K dimensions of tensor's shape,`);\n\n  let leadingSize = 1;\n  for (let i = axisFrom; i < axisFrom + maskDim; i++) {\n    leadingSize *= tensorShape[i];\n  }\n  const targetTensorShape =\n      tensorShape.slice(0, axisFrom)\n          .concat([leadingSize], tensorShape.slice(axisFrom + maskDim));\n  const reshapedTensor = reshape($tensor, targetTensorShape);\n  const reshapedMask = reshape($mask, [-1]);\n  const positivePositions = await whereAsync(reshapedMask);\n  const indices = squeeze(positivePositions, [1]);\n\n  const res = gather(reshapedTensor, indices, axisFrom);\n\n  // Ensure no memory leak.\n  if (tensor !== $tensor) {\n    $tensor.dispose();\n  }\n  if (mask !== $mask) {\n    $mask.dispose();\n  }\n  indices.dispose();\n  reshapedTensor.dispose();\n  reshapedMask.dispose();\n  positivePositions.dispose();\n\n  return res;\n}\n\nexport const booleanMaskAsync = booleanMaskAsync_;\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {tidy} from '../globals';\nimport {Transpose, TransposeAttrs, TransposeInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\nimport {complex} from './complex';\nimport {imag} from './imag';\nimport {neg} from './neg';\nimport {op} from './operation';\nimport {real} from './real';\n\n/**\n * Transposes the `tf.Tensor`. Permutes the dimensions according to `perm`.\n *\n * The returned `tf.Tensor`'s dimension `i` will correspond to the input\n * dimension `perm[i]`. If `perm` is not given, it is set to `[n-1...0]`,\n * where `n` is the rank of the input `tf.Tensor`. Hence by default, this\n * operation performs a regular matrix transpose on 2-D input `tf.Tensor`s.\n *\n * ```js\n * const a = tf.tensor2d([1, 2, 3, 4, 5, 6], [2, 3]);\n *\n * a.transpose().print();  // or tf.transpose(a)\n * ```\n *\n * @param x The tensor to transpose.\n * @param perm The permutation of the dimensions of a.\n * @param conjugate Will conjugate complex input if true.\n *\n * @doc {heading: 'Operations', subheading: 'Matrices'}\n */\nfunction transpose_<T extends Tensor>(\n    x: T|TensorLike, perm?: number[], conjugate?: boolean): T {\n  const $x = convertToTensor(x, 'x', 'transpose');\n\n  if (perm == null) {\n    perm = $x.shape.map((s, i) => i).reverse();\n  }\n  util.assert(\n      $x.rank === perm.length,\n      () => `Error in transpose: rank of input ${$x.rank} ` +\n          `must match length of perm ${perm}.`);\n  perm.forEach(axis => {\n    util.assert(\n        axis >= 0 && axis < $x.rank,\n        () => `All entries in 'perm' must be between 0 and ${$x.rank - 1}` +\n            ` but got ${perm}`);\n  });\n\n  if ($x.rank <= 1) {\n    return $x.clone();\n  }\n\n  const inputs: TransposeInputs = {x: $x};\n  const attrs: TransposeAttrs = {perm};\n\n  if ($x.dtype === 'complex64') {\n    return tidy(() => {\n      let $real = real($x);\n      let $imag = imag($x);\n      $real = ENGINE.runKernel(\n          Transpose, {x: $real} as unknown as NamedTensorMap,\n          attrs as unknown as NamedAttrMap);\n      $imag = ENGINE.runKernel(\n          Transpose, {x: $imag} as unknown as NamedTensorMap,\n          attrs as unknown as NamedAttrMap);\n      if (conjugate) {\n        $imag = neg($imag);\n      }\n      return complex($real, $imag);\n    });\n  }\n\n  return ENGINE.runKernel(\n      Transpose, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const transpose = /* @__PURE__ */ op({transpose_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Scalar, Tensor} from '../tensor';\nimport {assertTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {add} from './add';\nimport {div} from './div';\nimport {mul} from './mul';\nimport {op} from './operation';\nimport {pow} from './pow';\nimport {scalar} from './scalar';\nimport {sub} from './sub';\n\n/**\n * Compute the moving average of a variable.\n *\n * Without zeroDebias, the moving average operation is defined by:\n *   `v += delta`\n * where\n *   `delta = (1 - decay) * (x - v)`\n *\n * With zeroDebias (default), the `delta` term is scaled to debias the\n * effect of the (assumed) zero-initialization of `v`.\n *   `delta /= (1 - decay ^ step)`\n *\n * For more details on the zero-debiasing algorithm, see:\n *   https://arxiv.org/abs/1412.6980\n *\n * Note that this function is completely stateless and does not keep track of\n * step count. The step count needs to be maintained by the caller and passed\n * in as `step`.\n *\n * @param v The current moving average value.\n * @param x New input value, must have the same shape and dtype as `v`.\n * @param decay The decay factor. Typical values are 0.95 and 0.99.\n * @param step Step count.\n * @param zeroDebias: Whether zeroDebias is to be performed (default: `true`).\n * @returns The new moving average value.\n *\n * @doc {heading: 'Operations', subheading: 'Moving Average'}\n */\nfunction movingAverage_<T extends Tensor>(\n    v: T|TensorLike, x: T|TensorLike, decay: number|Scalar,\n    step?: number|Scalar, zeroDebias = true): T {\n  const $v = convertToTensor(v, 'v', 'movingAverage');\n  const $x = convertToTensor(x, 'x', 'movingAverage');\n  const $decay = convertToTensor(decay, 'decay', 'movingAverage');\n\n  assertTypesMatch($v, $x);\n  util.assert(\n      util.arraysEqual($v.shape, $x.shape), () => 'Shape mismatch in v and x');\n\n  const one = scalar(1);\n  const oneMinusDecay = sub(one, $decay);\n\n  let update = mul(sub($x, $v), oneMinusDecay);\n  if (zeroDebias) {\n    util.assert(\n        step != null, () => 'When using zeroDebias: true, step is required.');\n    const $step = convertToTensor(step, 'step', 'movingAverage');\n    update = div(update, sub(one, pow($decay, $step)));\n  }\n  return add($v, update);\n}\n\nexport const movingAverage = /* @__PURE__ */ op({movingAverage_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {ScatterNd, ScatterNdAttrs, ScatterNdInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {Rank, ShapeMap, TensorLike} from '../types';\nimport {assertNonNegativeIntegerDimensions} from '../util_base';\n\nimport {op} from './operation';\nimport * as scatter_nd_util from './scatter_nd_util';\n\n/**\n * Creates a new tensor by applying sparse updates to individual\n * values or slices within a zero tensor of the given shape tensor according to\n * indices. This operator is the inverse of the `tf.gatherND` operator which\n * extracts values or slices from a given tensor.\n *\n * ```js\n * const indices = tf.tensor2d([4, 3, 1, 7], [4, 1], 'int32');\n * const updates = tf.tensor1d([9, 10, 11, 12]);\n * const shape = [8];\n * tf.scatterND(indices, updates, shape).print() //[0, 11, 0, 10, 9, 0, 0, 12]\n * ```\n *\n * @param indices The tensor contains the indices into the output tensor.\n * @param updates The tensor contains the value for the indices.\n * @param shape: The shape of the output tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Slicing and Joining'}\n */\nfunction scatterND_<R extends Rank>(\n    indices: Tensor|TensorLike, updates: Tensor|TensorLike,\n    shape: ShapeMap[R]): Tensor<R> {\n  assertNonNegativeIntegerDimensions(shape);\n  const $indices = convertToTensor(indices, 'indices', 'scatterND', 'int32');\n  const $updates = convertToTensor(updates, 'updates', 'scatterND');\n  scatter_nd_util.validateInput($updates, $indices, shape);\n\n  const inputs: ScatterNdInputs = {indices: $indices, updates: $updates};\n  const attrs: ScatterNdAttrs = {shape};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  return ENGINE.runKernel(\n             ScatterNd, inputs as unknown as NamedTensorMap,\n             attrs as unknown as NamedAttrMap) as Tensor<R>;\n}\n\nexport const scatterND = /* @__PURE__ */ op({scatterND_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor} from '../tensor';\n\n/**\n * Validate sparseToDense inputs.\n *\n * @param sparseIndices A 0-D, 1-D, or 2-D Tensor of type int32.\n * sparseIndices[i] contains the complete index where sparseValues[i] will be\n * placed.\n * @param sparseValues A 0-D or 1-D Tensor. Values\n * corresponding to each row of sparseIndices, or a scalar value to be used for\n * all sparse indices.\n * @param outputShape number[]. Shape of the dense output tensor.\n * @param validateIndices boolean. indice validation is not supported, error\n * will be thrown if it is set.\n */\nexport function validateInput(\n    sparseIndices: Tensor, sparseValues: Tensor, outputShape: number[],\n    defaultValues: Tensor) {\n  if (sparseIndices.dtype !== 'int32') {\n    throw new Error(\n        'tf.sparseToDense() expects the indices to be int32 type,' +\n        ` but the dtype was ${sparseIndices.dtype}.`);\n  }\n  if (sparseIndices.rank > 2) {\n    throw new Error(\n        'sparseIndices should be a scalar, vector, or matrix,' +\n        ` but got shape ${sparseIndices.shape}.`);\n  }\n\n  const numElems = sparseIndices.rank > 0 ? sparseIndices.shape[0] : 1;\n  const numDims = sparseIndices.rank > 1 ? sparseIndices.shape[1] : 1;\n\n  if (outputShape.length !== numDims) {\n    throw new Error(\n        'outputShape has incorrect number of elements:,' +\n        ` ${outputShape.length}, should be: ${numDims}.`);\n  }\n\n  const numValues = sparseValues.size;\n  if (!(sparseValues.rank === 0 ||\n        sparseValues.rank === 1 && numValues === numElems)) {\n    throw new Error(\n        'sparseValues has incorrect shape ' +\n        `${sparseValues.shape}, should be [] or [${numElems}]`);\n  }\n\n  if (sparseValues.dtype !== defaultValues.dtype) {\n    throw new Error('sparseValues.dtype must match defaultValues.dtype');\n  }\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {SparseToDense, SparseToDenseAttrs, SparseToDenseInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport * as sparse_to_dense from '../ops/sparse_to_dense_util';\nimport {Scalar, Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {Rank, ScalarLike, ShapeMap, TensorLike} from '../types';\nimport {assertNonNegativeIntegerDimensions} from '../util_base';\n\nimport {op} from './operation';\n\n/**\n * Converts a sparse representation into a dense tensor.\n *\n * Builds an array dense with shape outputShape such that:\n *\n * // If sparseIndices is scalar\n * dense[i] = (i == sparseIndices ? sparseValues : defaultValue)\n *\n * // If sparseIndices is a vector, then for each i\n * dense[sparseIndices[i]] = sparseValues[i]\n *\n * // If sparseIndices is an n by d matrix, then for each i in [0, n)\n * dense[sparseIndices[i][0], ..., sparseIndices[i][d-1]] = sparseValues[i]\n * All other values in dense are set to defaultValue. If sparseValues is a\n * scalar, all sparse indices are set to this single value.\n *\n * If indices are repeated the final value is summed over all values for those\n * indices.\n *\n * ```js\n * const indices = tf.tensor1d([4, 5, 6, 1, 2, 3], 'int32');\n * const values = tf.tensor1d([10, 11, 12, 13, 14, 15], 'float32');\n * const shape = [8];\n * tf.sparseToDense(indices, values, shape).print();\n * ```\n *\n * @param sparseIndices A 0-D, 1-D, or 2-D Tensor of type int32.\n * sparseIndices[i] contains the complete index where sparseValues[i] will be\n * placed.\n * @param sparseValues A 0-D or 1-D Tensor. Values\n * corresponding to each row of sparseIndices, or a scalar value to be used for\n * all sparse indices.\n * @param outputShape Shape of the dense output tensor. The type is inferred.\n * @param defaultValue Scalar. Value to set for indices not specified in\n * sparseIndices. Defaults to zero.\n *\n * @doc {heading: 'Operations', subheading: 'Normalization'}\n */\nfunction sparseToDense_<R extends Rank>(\n    sparseIndices: Tensor|TensorLike, sparseValues: Tensor|TensorLike,\n    outputShape: ShapeMap[R], defaultValue: Scalar|ScalarLike = 0): Tensor<R> {\n  assertNonNegativeIntegerDimensions(outputShape);\n\n  const $sparseIndices =\n      convertToTensor(sparseIndices, 'sparseIndices', 'sparseToDense', 'int32');\n  const $sparseValues = convertToTensor(\n      sparseValues, 'sparseValues', 'sparseToDense', 'string_or_numeric');\n  const $defaultValue = convertToTensor(\n      defaultValue, 'defaultValue', 'sparseToDense', $sparseValues.dtype);\n\n  sparse_to_dense.validateInput(\n      $sparseIndices, $sparseValues, outputShape, $defaultValue);\n\n  const inputs: SparseToDenseInputs = {\n    sparseIndices: $sparseIndices,\n    sparseValues: $sparseValues,\n    defaultValue: $defaultValue\n  };\n\n  const attrs: SparseToDenseAttrs = {outputShape};\n\n  return ENGINE.runKernel(\n      SparseToDense, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const sparseToDense = /* @__PURE__ */ op({sparseToDense_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {GatherNd, GatherNdInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {op} from './operation';\n\n/**\n * Gather slices from input tensor into a Tensor with shape specified by\n * `indices`.\n *\n * `indices` is a K-dimensional integer tensor, best thought of as a\n * (K-1)-dimensional tensor of indices into input, where each element defines a\n * slice of input:\n * output[\\\\(i_0, ..., i_{K-2}\\\\)] = input[indices[\\\\(i_0, ..., i_{K-2}\\\\)]]\n *\n * Whereas in `tf.gather`, `indices` defines slices into the first dimension of\n * input, in `tf.gatherND`, `indices` defines slices into the first N dimensions\n * of input, where N = indices.shape[-1].\n *\n * The last dimension of indices can be at most the rank of input:\n * indices.shape[-1] <= input.rank\n *\n * The last dimension of `indices` corresponds to elements\n * (if indices.shape[-1] == input.rank) or slices\n * (if indices.shape[-1] < input.rank) along dimension indices.shape[-1] of\n * input.\n * The output tensor has shape\n * indices.shape[:-1] + input.shape[indices.shape[-1]:]\n *\n * Note that on CPU, if an out of bound index is found, an error is returned. On\n * GPU, if an out of bound index is found, a 0 is stored in the corresponding\n * output value.\n *\n * ```js\n * const indices = tf.tensor2d([0, 1, 1, 0], [2,2], 'int32');\n * const input = tf.tensor2d([9, 10, 11, 12], [2, 2]);\n * tf.gatherND(input, indices).print() // [10, 11]\n * ```\n *\n * @param x The tensor from which to gather values.\n * @param indices Index tensor, must be of type int32.\n *\n * @doc {heading: 'Operations', subheading: 'Slicing and Joining'}\n */\nfunction gatherND_(x: Tensor|TensorLike, indices: Tensor|TensorLike): Tensor {\n  const $indices = convertToTensor(indices, 'indices', 'gatherND', 'int32');\n  const $x = convertToTensor(x, 'x', 'gatherND', 'string_or_numeric');\n\n  const inputs: GatherNdInputs = {params: $x, indices: $indices};\n\n  return ENGINE.runKernel(GatherNd, inputs as unknown as NamedTensorMap);\n}\n\nexport const gatherND = /* @__PURE__ */ op({gatherND_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport * as util from '../util';\n\n/**\n * Normalize noise shape based on provided tensor and noise shape.\n *\n * @param x Tensor.\n * @param noiseShape The shape for the randomly generated keep/drop flags, as\n *   an array of numbers. Optional.\n * @returns Normalized noise shape.\n */\nexport function getNoiseShape(x: Tensor, noiseShape?: number[]): number[] {\n  if (noiseShape == null) {\n    return x.shape.slice();\n  }\n  if (util.arraysEqual(x.shape, noiseShape)) {\n    return noiseShape;\n  }\n  if (x.shape.length === noiseShape.length) {\n    const newDimension: number[] = [];\n    for (let i = 0; i < x.shape.length; i++) {\n      if (noiseShape[i] == null && x.shape[i] != null) {\n        newDimension.push(x.shape[i]);\n      } else {\n        newDimension.push(noiseShape[i]);\n      }\n    }\n    return newDimension;\n  }\n\n  return noiseShape;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {add} from './add';\nimport {div} from './div';\nimport {getNoiseShape} from './dropout_util';\nimport {floor} from './floor';\nimport {mul} from './mul';\nimport {op} from './operation';\nimport {randomUniform} from './random_uniform';\n\n/**\n * Computes dropout.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 2, 1]);\n * const rate = 0.75;\n * const output = tf.dropout(x, rate);\n * output.print();\n * ```\n *\n * @param x A floating point Tensor or TensorLike.\n * @param rate A float in the range [0, 1). The probability that each element\n *   of x is discarded.\n * @param noiseShape An array of numbers of type int32, representing the\n * shape for randomly generated keep/drop flags. If the noiseShape has null\n * value, it will be automatically replaced with the x's relative dimension\n * size. Optional.\n * @param seed Used to create random seeds. Optional.\n * @returns A Tensor of the same shape of x.\n *\n * @doc {heading: 'Operations', subheading: 'Dropout'}\n */\nfunction dropout_(\n    x: Tensor|TensorLike, rate: number, noiseShape?: number[],\n    seed?: number|string): Tensor {\n  const $x = convertToTensor(x, 'x', 'dropout');\n\n  util.assert(\n      $x.dtype === 'float32',\n      () => `x has to be a floating point tensor since it's going to be ` +\n          `scaled, but got a ${$x.dtype} tensor instead.`);\n  util.assert(\n      rate >= 0 && rate < 1,\n      () => `rate must be a float in the range [0, 1), but got ${rate}.`);\n\n  if (rate === 0) {\n    return x instanceof Tensor ? $x.clone() : $x;\n  }\n\n  const $noiseShape = getNoiseShape($x, noiseShape);\n  const keepProb = 1 - rate;\n  const multiplier = div(\n      floor(add(randomUniform($noiseShape, 0, 1, 'float32', seed), keepProb)),\n      keepProb);\n\n  return mul($x, multiplier);\n}\n\nexport const dropout = /* @__PURE__ */ op({dropout_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor1D} from '../tensor';\nimport {tensor1d} from './tensor1d';\n\nexport function enclosingPowerOfTwo(value: number) {\n  // Return 2**N for integer N such that 2**N >= value.\n  return Math.floor(Math.pow(2, Math.ceil(Math.log(value) / Math.log(2.0))));\n}\n\nexport function cosineWindow(\n    windowLength: number, a: number, b: number): Tensor1D {\n  const even = 1 - windowLength % 2;\n  const newValues = new Float32Array(windowLength);\n  for (let i = 0; i < windowLength; ++i) {\n    const cosArg = (2.0 * Math.PI * i) / (windowLength + even - 1);\n    newValues[i] = a - b * Math.cos(cosArg);\n  }\n  return tensor1d(newValues, 'float32');\n}\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {assert, assertShapesMatch, getTypedArrayFromDType} from '../util';\nimport {tensor} from './tensor';\n\n/**\n * Returns whether the targets are in the top K predictions.\n *\n * ```js\n * const predictions = tf.tensor2d([[20, 10, 40, 30], [30, 50, -20, 10]]);\n * const targets = tf.tensor1d([2, 0]);\n * const precision = await tf.inTopKAsync(predictions, targets);\n * precision.print();\n * ```\n * @param predictions 2-D or higher `tf.Tensor` with last dimension being\n *     at least `k`.\n * @param targets 1-D or higher `tf.Tensor`.\n * @param k Optional Number of top elements to look at for computing precision,\n *     default to 1.\n *\n * @doc {heading: 'Operations', subheading: 'Evaluation'}\n */\nasync function inTopKAsync_<T extends Tensor, U extends Tensor>(\n    predictions: T|TensorLike, targets: U|TensorLike, k = 1): Promise<U> {\n  const $predictions = convertToTensor(predictions, 'predictions', 'inTopK');\n  const $targets = convertToTensor(targets, 'targets', 'inTopK');\n\n  assert(\n      $predictions.rank > 1,\n      () => 'inTopK() expects the predictions to be of rank 2 or higher, ' +\n          `but got ${$predictions.rank}`);\n  assert(\n      $predictions.rank - 1 === $targets.rank,\n      () => `predictions rank should be 1 larger than ` +\n          `targets rank, but got predictions rank ` +\n          `${$predictions.rank} and targets rank ${$targets.rank}`);\n  assertShapesMatch(\n      $predictions.shape.slice(0, $predictions.shape.length - 1),\n      $targets.shape,\n      `predictions's shape should be align with the targets' shape, ` +\n          'except the last dimension.');\n  const lastDim = $predictions.shape[$predictions.shape.length - 1];\n  assert(\n      k > 0 && k <= lastDim,\n      () => `'k' passed to inTopK() must be > 0 && <= the predictions last ` +\n          `dimension (${lastDim}), but got ${k}`);\n\n  const predictionsVals = await $predictions.data();\n  const targetsVals = await $targets.data();\n\n  // Reshape predictionsVals into a 2d tensor [batch, lastDim]\n  // and look up topK along lastDim.\n  const [batch, size] = [predictionsVals.length / lastDim, lastDim];\n  const precision = getTypedArrayFromDType('bool', batch);\n\n  for (let b = 0; b < batch; b++) {\n    const offset = b * size;\n    const vals = predictionsVals.subarray(offset, offset + size);\n    const valAndInd: Array<{value: number, index: number}> = [];\n    for (let i = 0; i < vals.length; i++) {\n      valAndInd.push({value: vals[i], index: i});\n    }\n    valAndInd.sort((a, b) => b.value - a.value);\n\n    precision[b] = 0;\n    for (let i = 0; i < k; i++) {\n      if (valAndInd[i].index === targetsVals[b]) {\n        precision[b] = 1;\n        break;\n      }\n    }\n  }\n\n  if (predictions !== $predictions) {\n    $predictions.dispose();\n  }\n  if (targets !== $targets) {\n    $targets.dispose();\n  }\n\n  // Output precision has the same shape as targets.\n  return tensor(precision, $targets.shape, 'bool') as U;\n}\n\nexport const inTopKAsync = inTopKAsync_;\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Conv2DBackpropFilter, Conv2DBackpropFilterAttrs, Conv2DBackpropFilterInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport * as util from '../util';\n\nimport * as conv_util from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes the derivative of the filter of a 2D convolution.\n *\n * @param x The input tensor, of rank 4 or rank 3 of shape\n *     [batch, height, width, inChannels]. If rank 3, batch of 1 is assumed.\n * @param dy The dy image, of rank 4 or rank 3, of shape\n *     [batch, height, width, outDepth]. If rank 3, batch of 1 is assumed.\n * @param filterShape The shape of the filter, length 4,\n *     [filterHeight, filterWidth, inDepth, outDepth].\n * @param strides The strides of the convolution: [strideHeight,\n * strideWidth].\n * @param pad A string from: 'same', 'valid'. The type of padding algorithm\n *     used in the forward prop of the op.\n * @param dataFormat: An optional string from: \"NHWC\", \"NCHW\". Defaults to\n *     \"NHWC\". Specify the data format of the input and output data. With the\n *     default format \"NHWC\", the data is stored in the order of: [batch,\n *     height, width, channels].\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n */\nfunction conv2DBackpropFilter_<T extends Tensor3D|Tensor4D>(\n    x: T, dy: T, filterShape: [number, number, number, number],\n    strides: [number, number]|number,\n    pad: 'valid'|'same'|number|conv_util.ExplicitPadding,\n    dataFormat: 'NHWC'|'NCHW' = 'NHWC',\n    dimRoundingMode?: 'floor'|'round'|'ceil'): Tensor4D {\n  let x4D = x as Tensor4D;\n  if (x.rank === 3) {\n    x4D = reshape(x, [1, x.shape[0], x.shape[1], x.shape[2]]);\n  }\n  let dy4D = dy as Tensor4D;\n  if (dy4D.rank === 3) {\n    dy4D = reshape(dy, [1, dy.shape[0], dy.shape[1], dy.shape[2]]);\n  }\n  util.assert(\n      x4D.rank === 4,\n      () => `Error in conv2dDerFilter: input must be rank 4, but got shape ` +\n          `${x4D.shape}.`);\n  util.assert(\n      dy4D.rank === 4,\n      () => `Error in conv2dDerFilter: dy must be rank 4, but got shape ` +\n          `${dy4D.shape}.`);\n  util.assert(\n      filterShape.length === 4,\n      () => `Error in conv2dDerFilter: filterShape must be length 4, but got ` +\n          `${filterShape}.`);\n  const inDepth = dataFormat === 'NHWC' ? x4D.shape[3] : x4D.shape[1];\n  const outDepth = dataFormat === 'NHWC' ? dy4D.shape[3] : dy4D.shape[1];\n  util.assert(\n      inDepth === filterShape[2],\n      () => `Error in conv2dDerFilter: depth of input ${inDepth}) must ` +\n          `match input depth in filter (${filterShape[2]}.`);\n  util.assert(\n      outDepth === filterShape[3],\n      () => `Error in conv2dDerFilter: depth of dy (${outDepth}) must ` +\n          `match output depth for filter (${filterShape[3]}).`);\n  conv_util.checkPadOnDimRoundingMode('conv2dDerFilter', pad, dimRoundingMode);\n  const inputs: Conv2DBackpropFilterInputs = {x: x4D, dy: dy4D};\n  const attrs: Conv2DBackpropFilterAttrs =\n      {strides, pad, dataFormat, dimRoundingMode, filterShape};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  return ENGINE.runKernel(\n             Conv2DBackpropFilter, inputs as unknown as NamedTensorMap,\n             attrs as unknown as NamedAttrMap) as Tensor4D;\n}\n\nexport const conv2DBackpropFilter = /* @__PURE__ */ op({conv2DBackpropFilter_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\n\nimport * as broadcast_util from './broadcast_util';\nimport {elu} from './elu';\nimport {Activation} from './fused_types';\nimport {leakyRelu} from './leaky_relu';\nimport {mul} from './mul';\nimport {prelu} from './prelu';\nimport {relu} from './relu';\nimport {relu6} from './relu6';\nimport {reshape} from './reshape';\nimport {sigmoid} from './sigmoid';\nimport {step} from './step';\nimport {sum} from './sum';\n\n// Returns gradient for fused activation.\nexport function getFusedDyActivation(\n    dy: Tensor, y: Tensor, activation: Activation): Tensor {\n  if (activation == null || activation === 'linear') {\n    return dy;\n  }\n  if (activation === 'relu') {\n    return mul(dy, step(y));\n  }\n  throw new Error(\n      `Cannot compute gradient for fused activation ${activation}.`);\n}\n\n// Returns gradient for fused bias.\nexport function getFusedBiasGradient(\n    bias: Tensor, dyActivation: Tensor): Tensor {\n  let res = dyActivation;\n  const reduceAxes =\n      broadcast_util.getReductionAxes(bias.shape, dyActivation.shape);\n  if (reduceAxes.length > 0) {\n    res = sum(res, reduceAxes);\n  }\n  return reshape(res, bias.shape);\n}\n\nexport function applyActivation(\n    x: Tensor, activation: Activation, preluActivationWeights?: Tensor,\n    leakyreluAlpha?: number): Tensor {\n  if (activation === 'linear') {\n    return x;\n  } else if (activation === 'relu') {\n    return relu(x);\n  } else if (activation === 'elu') {\n    return elu(x);\n  } else if (activation === 'relu6') {\n    return relu6(x);\n  } else if (activation === 'prelu') {\n    return prelu(x, preluActivationWeights);\n  } else if (activation === 'leakyrelu') {\n    return leakyRelu(x, leakyreluAlpha);\n  } else if (activation === 'sigmoid') {\n    return sigmoid(x);\n  }\n  throw new Error(`Unknown fused activation ${activation}.`);\n}\n\n// Whether we should call fused ops.\nexport const shouldFuse = (gradientDepth: number, activation: Activation) => {\n  const gradientMode = gradientDepth > 0;\n  return !gradientMode || activation === 'linear';\n};\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {customGrad} from '../../gradients';\nimport {FusedConv2D, FusedConv2DAttrs, FusedConv2DInputs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor, Tensor3D, Tensor4D} from '../../tensor';\nimport {GradSaveFunc, NamedTensorMap} from '../../tensor_types';\nimport {makeTypesMatch} from '../../tensor_util';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\nimport {add} from '../add';\nimport * as broadcast_util from '../broadcast_util';\nimport {conv2d as unfusedConv2d} from '../conv2d';\nimport {conv2DBackpropFilter} from '../conv2d_backprop_filter';\nimport {conv2DBackpropInput} from '../conv2d_backprop_input';\nimport * as conv_util from '../conv_util';\nimport {Activation} from '../fused_types';\nimport {applyActivation, getFusedBiasGradient, getFusedDyActivation, shouldFuse} from '../fused_util';\nimport {op} from '../operation';\nimport {reshape} from '../reshape';\n\n/**\n * Computes a 2D convolution over the input x, optionally fused with adding a\n * bias and applying an activation.\n *\n * ```js\n * const inputDepth = 2;\n * const inShape = [2, 2, 2, inputDepth];\n * const outputDepth = 2;\n * const fSize = 1;\n * const pad = 0;\n * const strides = 1;\n *\n * const x = tf.tensor4d( [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n * 16], inShape);\n * const w = tf.tensor4d([-1, 1, -2, 0.5], [fSize, fSize, inputDepth,\n * outputDepth]);\n *\n * tf.fused.conv2d({ x, filter: w, strides, pad, dataFormat: 'NHWC',\n * dilations: [1, 1], bias: tf.scalar(5), activation: 'relu' }).print();\n * ```\n *\n * @param obj An object with the following properties:\n * @param x The input tensor, of rank 4 or rank 3, of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is\n * assumed.\n * @param filter The filter, rank 4, of shape\n *     `[filterHeight, filterWidth, inDepth, outDepth]`.\n * @param strides The strides of the convolution: `[strideHeight,\n * strideWidth]`.\n * @param pad The type of padding algorithm.\n *   - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *   - `valid` output will be smaller than input if filter is larger\n *       than 1x1.\n *   - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dataFormat An optional string from: \"NHWC\", \"NCHW\". Defaults to\n *     \"NHWC\". Specify the data format of the input and output data. With the\n *     default format \"NHWC\", the data is stored in the order of: [batch,\n *     height, width, channels]. Only \"NHWC\" is currently supported.\n * @param dilations The dilation rates: `[dilationHeight, dilationWidth]`\n *     in which we sample input values across the height and width dimensions\n *     in atrous convolution. Defaults to `[1, 1]`. If `dilations` is a single\n *     number, then `dilationHeight == dilationWidth`. If it is greater than\n *     1, then all values of `strides` must be 1.\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n * @param bias Tensor to be added to the result.\n * @param activation Name of activation kernel (defaults to `linear`) to be\n *     applied\n *      after biasAdd.\n * @param preluActivationWeights Tensor of prelu weights to be applied as part\n *     of a `prelu` activation, typically the same shape as `x`.\n * @param leakyreluAlpha Optional. Alpha to be applied as part of a `leakyrelu`\n *     activation.\n */\nfunction fusedConv2d_<T extends Tensor3D|Tensor4D>({\n  x,\n  filter,\n  strides,\n  pad,\n  dataFormat = 'NHWC',\n  dilations = [1, 1],\n  dimRoundingMode,\n  bias,\n  activation = 'linear',\n  preluActivationWeights,\n  leakyreluAlpha\n}: {\n  x: T|TensorLike,\n  filter: Tensor4D|TensorLike,\n  strides: [number, number]|number,\n  pad: 'valid'|'same'|number|conv_util.ExplicitPadding,\n  dataFormat?: 'NHWC'|'NCHW',\n  dilations?: [number, number]|number,\n  dimRoundingMode?: 'floor'|'round'|'ceil',\n  bias?: Tensor|TensorLike,\n  activation?: Activation,\n  preluActivationWeights?: Tensor,\n  leakyreluAlpha?: number\n}): T {\n  activation = activation || 'linear';\n\n  if (shouldFuse(ENGINE.state.gradientDepth, activation) === false) {\n    // TODO: Transpose bias and preluActivationWeights properly for NCHW\n    // format before computation.\n    util.assert(\n        dataFormat === 'NHWC',\n        () => `Error in fused conv2d: got dataFormat of ${dataFormat} but ` +\n            `only NHWC is currently supported for the case of gradient depth ` +\n            `is 0 and the activation is not linear.`);\n\n    let result = unfusedConv2d(\n        x, filter, strides, pad, dataFormat, dilations, dimRoundingMode);\n    if (bias != null) {\n      result = add(result, bias);\n    }\n\n    return applyActivation(\n               result, activation, preluActivationWeights, leakyreluAlpha) as T;\n  }\n\n  const $x = convertToTensor(x, 'x', 'conv2d', 'float32');\n  const $filter = convertToTensor(filter, 'filter', 'conv2d', 'float32');\n\n  let x4D = $x as Tensor4D;\n  let reshapedTo4D = false;\n\n  if ($x.rank === 3) {\n    reshapedTo4D = true;\n    x4D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2]]);\n  }\n  util.assert(\n      x4D.rank === 4,\n      () => `Error in fused conv2d: input must be rank 4, but got rank ` +\n          `${x4D.rank}.`);\n  util.assert(\n      $filter.rank === 4,\n      () => `Error in fused conv2d: filter must be rank 4, but got rank ` +\n          `${$filter.rank}.`);\n  conv_util.checkPadOnDimRoundingMode('fused conv2d', pad, dimRoundingMode);\n  const inputChannels = dataFormat === 'NHWC' ? x4D.shape[3] : x4D.shape[1];\n  util.assert(\n      $filter.shape[2] === inputChannels,\n      () => `Error in conv2d: depth of input (${inputChannels}) must match ` +\n          `input depth for filter ${$filter.shape[2]}.`);\n  util.assert(\n      conv_util.eitherStridesOrDilationsAreOne(strides, dilations),\n      () => 'Error in conv2D: Either strides or dilations must be 1. ' +\n          `Got strides ${strides} and dilations '${dilations}'`);\n\n  const convInfo = conv_util.computeConv2DInfo(\n      x4D.shape, $filter.shape, strides, dilations, pad, dimRoundingMode);\n\n  let $bias: Tensor;\n  if (bias != null) {\n    $bias = convertToTensor(bias, 'bias', 'fused conv2d');\n    [$bias] = makeTypesMatch($bias, $x);\n\n    // According to TensorFlow, the bias is supposed be a 1-D tensor or a\n    // scalar.\n    //\n    // 3-D or 4-D bias is not disabled for NHWC format, because they are\n    // currently being used in some cases. For examplem in our code base,\n    // https://github.com/tensorflow/tfjs/blob/b53bd47e880367ae57493f0ea628abaf08db2d5d/tfjs-core/src/ops/fused/fused_conv2d_test.ts#L1972.\n    if (dataFormat === 'NHWC') {\n      broadcast_util.assertAndGetBroadcastShape(convInfo.outShape, $bias.shape);\n    } else {\n      util.assert(\n          $bias.shape.length <= 1,\n          () => `Error in fused conv2d: only supports scalar or 1-D Tensor ` +\n              `bias for NCHW format but got the bias of ` +\n              `rank-${$bias.shape.length}.`);\n\n      util.assert(\n          $bias.shape.length === 0 || $bias.shape[0] === convInfo.outChannels ||\n              $bias.shape[0] === 1,\n          () => `Error in fused conv2d: bias shape (${$bias.shape}) is not ` +\n              `compatible with the number of output channels ` +\n              `(${convInfo.outChannels})`);\n    }\n  }\n\n  let $preluActivationWeights: Tensor;\n  if (preluActivationWeights != null) {\n    // PReLU's activation weights could be a scalar, a 1-D tensor or a 3-D\n    // tensor.\n    const alphaShape = preluActivationWeights.shape;\n    util.assert(\n        alphaShape.length <= 1 || alphaShape.length === 3,\n        () => `Error in fused conv2d: only supports scalar, 1-D Tensor or ` +\n            `3-D Tensor PReLU activation weights but got a tensor of ` +\n            `rank-${alphaShape.length}.`);\n\n    if (alphaShape.length === 1) {\n      // Whether the data format is NCHW or NHWC, the 1-D PReLU activation\n      // weights tensor should be aligned with the output channels of conv2d\n      // result.\n      util.assert(\n          alphaShape[0] === 1 || alphaShape[0] === convInfo.outChannels,\n          () => `Error in fused conv2d: PReLU activation weights ` +\n              `(${alphaShape}) is not compatible with the number of output ` +\n              `channels (${convInfo.outChannels}).`);\n    } else if (alphaShape.length === 3) {\n      // Whether the data format is NCHW or NHWC, the PReLU activation weights\n      // tensor should has the compatible shape with the result of conv2d.\n      try {\n        broadcast_util.assertAndGetBroadcastShape(\n            alphaShape, convInfo.outShape);\n      } catch (e) {\n        const errMsg =\n            `Error in fused conv2d: PReLU activation weights (${alphaShape}) ` +\n            `is not compatible with the output shape of the conv2d ` +\n            `(${convInfo.outShape}).`;\n        throw Error(errMsg);\n      }\n    }\n\n    $preluActivationWeights = convertToTensor(\n        preluActivationWeights, 'prelu weights', 'fused conv2d');\n  }\n\n  const grad = (dy: Tensor4D, saved: Tensor[]) => {\n    util.assert(\n        dataFormat === 'NHWC',\n        () => `Error in gradient of fused conv2D: got dataFormat of ${\n            dataFormat} but only NHWC is currently supported.`);\n\n    const [$filter, x4D, y, $bias] =\n        saved as [Tensor4D, Tensor4D, Tensor4D, Tensor];\n\n    const dyActivation = getFusedDyActivation(dy, y, activation) as Tensor4D;\n\n    util.assert(\n        conv_util.tupleValuesAreOne(dilations),\n        () => 'Error in gradient of fused conv2D: ' +\n            `dilation rates greater than 1 ` +\n            `are not yet supported in gradients. Got dilations '${dilations}'`);\n\n    const xDer =\n        conv2DBackpropInput(x4D.shape, dyActivation, $filter, strides, pad);\n    const filterDer =\n        conv2DBackpropFilter(x4D, dyActivation, $filter.shape, strides, pad);\n    const der: Tensor[] = [xDer, filterDer];\n\n    if ($bias != null) {\n      const biasDer = getFusedBiasGradient($bias, dyActivation);\n      der.push(biasDer);\n    }\n    return der;\n  };\n\n  const inputs: FusedConv2DInputs = {\n    x: x4D,\n    filter: $filter,\n    bias: $bias,\n    preluActivationWeights: $preluActivationWeights\n  };\n\n  const attrs: FusedConv2DAttrs = {\n    strides,\n    pad,\n    dataFormat,\n    dilations,\n    dimRoundingMode,\n    activation,\n    leakyreluAlpha\n  };\n\n  // Depending on the the params passed in we will have different number of\n  // inputs and thus a a different number of elements in the gradient.\n  if (bias == null) {\n    const customOp =\n        customGrad((x4D: Tensor4D, filter: Tensor4D, save: GradSaveFunc) => {\n          let res: Tensor4D|Tensor3D =\n              // tslint:disable-next-line: no-unnecessary-type-assertion\n              ENGINE.runKernel(\n                  FusedConv2D, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap);\n\n          save([filter, x4D, res]);\n\n          if (reshapedTo4D) {\n            // tslint:disable-next-line: no-unnecessary-type-assertion\n            res = reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as\n                Tensor3D;\n          }\n\n          return {value: res, gradFunc: grad};\n        });\n    return customOp(x4D, $filter) as T;\n  } else {\n    const customOpWithBias = customGrad(\n        (x4D: Tensor4D, filter: Tensor4D, bias: Tensor, save: GradSaveFunc) => {\n          let res: Tensor4D|Tensor3D = ENGINE.runKernel(\n              FusedConv2D, inputs as unknown as NamedTensorMap,\n              attrs as unknown as NamedAttrMap);\n\n          save([filter, x4D, res, bias]);\n\n          if (reshapedTo4D) {\n            // tslint:disable-next-line: no-unnecessary-type-assertion\n            res = reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as\n                Tensor3D;\n          }\n\n          return {value: res, gradFunc: grad};\n        });\n\n    return customOpWithBias(x4D, $filter, $bias) as T;\n  }\n}\nexport const conv2d = /* @__PURE__ */ op({fusedConv2d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {DepthwiseConv2dNativeBackpropFilter, DepthwiseConv2dNativeBackpropFilterAttrs, DepthwiseConv2dNativeBackpropFilterInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\n\nimport {ExplicitPadding} from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\nfunction depthwiseConv2dNativeBackpropFilter_<T extends Tensor3D|Tensor4D>(\n    x: T, dy: T, filterShape: [number, number, number, number],\n    strides: [number, number]|number,\n    pad: 'valid'|'same'|number|ExplicitPadding,\n    dilations: [number, number]|number = [1, 1],\n    dimRoundingMode?: 'floor'|'round'|'ceil'): Tensor4D {\n  let x4D = x as Tensor4D;\n  if (x.rank === 3) {\n    x4D = reshape(x, [1, x.shape[0], x.shape[1], x.shape[2]]);\n  }\n  let dy4D = dy as Tensor4D;\n  if (dy4D.rank === 3) {\n    dy4D = reshape(dy, [1, dy.shape[0], dy.shape[1], dy.shape[2]]);\n  }\n\n  const inputs: DepthwiseConv2dNativeBackpropFilterInputs = {x: x4D, dy: dy4D};\n  const attrs: DepthwiseConv2dNativeBackpropFilterAttrs =\n      {strides, pad, dimRoundingMode, dilations, filterShape};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  return ENGINE.runKernel(\n             DepthwiseConv2dNativeBackpropFilter,\n             inputs as unknown as NamedTensorMap,\n             attrs as unknown as NamedAttrMap) as Tensor4D;\n}\n\nexport const depthwiseConv2dNativeBackpropFilter =\n    op({depthwiseConv2dNativeBackpropFilter_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {DepthwiseConv2dNativeBackpropInput, DepthwiseConv2dNativeBackpropInputAttrs, DepthwiseConv2dNativeBackpropInputInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\n\nimport {ExplicitPadding} from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\nfunction depthwiseConv2dNativeBackpropInput_<T extends Tensor3D|Tensor4D>(\n    xShape: [number, number, number, number], dy: T, filter: Tensor4D,\n    strides: [number, number]|number,\n    pad: 'valid'|'same'|number|ExplicitPadding,\n    dilations: [number, number]|number = [1, 1],\n    dimRoundingMode?: 'floor'|'round'|'ceil'): T {\n  let dy4D = dy as Tensor4D;\n  let reshapedTo4D = false;\n  if (dy.rank === 3) {\n    reshapedTo4D = true;\n    dy4D = reshape(dy, [1, dy.shape[0], dy.shape[1], dy.shape[2]]);\n  }\n\n  const inputs: DepthwiseConv2dNativeBackpropInputInputs = {dy: dy4D, filter};\n  const attrs: DepthwiseConv2dNativeBackpropInputAttrs =\n      {strides, pad, dimRoundingMode, dilations, inputShape: xShape};\n\n  const res =\n      // tslint:disable-next-line: no-unnecessary-type-assertion\n      ENGINE.runKernel(\n          DepthwiseConv2dNativeBackpropInput,\n          inputs as unknown as NamedTensorMap,\n          attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n  return res;\n}\n\nexport const depthwiseConv2dNativeBackpropInput =\n    op({depthwiseConv2dNativeBackpropInput_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {customGrad} from '../../gradients';\nimport {FusedDepthwiseConv2D, FusedDepthwiseConv2DAttrs, FusedDepthwiseConv2DInputs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor, Tensor3D, Tensor4D} from '../../tensor';\nimport {GradSaveFunc, NamedTensorMap} from '../../tensor_types';\nimport {makeTypesMatch} from '../../tensor_util';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\nimport {add} from '../add';\nimport * as broadcast_util from '../broadcast_util';\nimport * as conv_util from '../conv_util';\nimport {depthwiseConv2d as unfusedDepthwiseConv2d} from '../depthwise_conv2d';\nimport {depthwiseConv2dNativeBackpropFilter} from '../depthwise_conv2d_native_backprop_filter';\nimport {depthwiseConv2dNativeBackpropInput} from '../depthwise_conv2d_native_backprop_input';\nimport {Activation} from '../fused_types';\nimport {applyActivation, getFusedBiasGradient, getFusedDyActivation, shouldFuse} from '../fused_util';\nimport {op} from '../operation';\nimport {reshape} from '../reshape';\n\n/**\n * Computes depthwise 2D convolution, optionally fused with adding a\n * bias and applying an activation.\n *\n * Given a 4D `input` array and a `filter` array of shape\n * `[filterHeight, filterWidth, inChannels, channelMultiplier]` containing\n * `inChannels` convolutional filters of depth 1, this op applies a\n * different filter to each input channel (expanding from 1 channel to\n * `channelMultiplier` channels for each), then concatenates the results\n * together. The output has `inChannels * channelMultiplier` channels.\n *\n * See\n * [https://www.tensorflow.org/api_docs/python/tf/nn/depthwise_conv2d](\n *     https://www.tensorflow.org/api_docs/python/tf/nn/depthwise_conv2d)\n * for more details.\n *\n * @param obj An object with the following properties:\n * @param x The input tensor, of rank 4 or rank 3, of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is\n * assumed.\n * @param filter The filter tensor, rank 4, of shape\n *     `[filterHeight, filterWidth, inChannels, channelMultiplier]`.\n * @param strides The strides of the convolution: `[strideHeight,\n * strideWidth]`. If strides is a single number, then `strideHeight ==\n * strideWidth`.\n * @param pad The type of padding algorithm.\n *   - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *   - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n *   - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dilations The dilation rates: `[dilationHeight, dilationWidth]`\n *     in which we sample input values across the height and width dimensions\n *     in atrous convolution. Defaults to `[1, 1]`. If `rate` is a single\n *     number, then `dilationHeight == dilationWidth`. If it is greater than\n *     1, then all values of `strides` must be 1.\n * @param dataFormat: An optional string from: \"NHWC\", \"NCHW\". Defaults to\n *     \"NHWC\". Specify the data format of the input and output data. With the\n *     default format \"NHWC\", the data is stored in the order of: [batch,\n *     height, width, channels]. Only \"NHWC\" is currently supported.\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n * @param bias Tensor to be added to the result.\n * @param activation Name of activation kernel (defaults to `linear`).\n * @param preluActivationWeights Tensor of prelu weights to be applied as part\n *     of a `prelu` activation, typically the same shape as `x`.\n * @param leakyreluAlpha Optional. Alpha to be applied as part of a `leakyrelu`\n *     activation.\n */\nfunction fusedDepthwiseConv2d_<T extends Tensor3D|Tensor4D>({\n  x,\n  filter,\n  strides,\n  pad,\n  dataFormat = 'NHWC',\n  dilations = [1, 1],\n  dimRoundingMode,\n  bias,\n  activation = 'linear',\n  preluActivationWeights,\n  leakyreluAlpha\n}: {\n  x: T|TensorLike,\n  filter: Tensor4D|TensorLike,\n  strides: [number, number]|number,\n  pad: 'valid'|'same'|number,\n  dataFormat?: 'NHWC'|'NCHW',\n  dilations?: [number, number]|number,\n  dimRoundingMode?: 'floor'|'round'|'ceil',\n  bias?: Tensor|TensorLike,\n  activation?: Activation,\n  preluActivationWeights?: Tensor,\n  leakyreluAlpha?: number\n}): T {\n  if (shouldFuse(ENGINE.state.gradientDepth, activation) === false) {\n    let result = unfusedDepthwiseConv2d(\n        x, filter, strides, pad, dataFormat, dilations, dimRoundingMode);\n    if (bias != null) {\n      result = add(result, bias);\n    }\n\n    return applyActivation(\n               result, activation, preluActivationWeights, leakyreluAlpha) as T;\n  }\n\n  const $x = convertToTensor(x, 'x', 'depthwiseConv2d', 'float32');\n  const $filter =\n      convertToTensor(filter, 'filter', 'depthwiseConv2d', 'float32');\n\n  let x4D = $x as Tensor4D;\n  let reshapedTo4D = false;\n  if ($x.rank === 3) {\n    reshapedTo4D = true;\n    x4D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2]]);\n  }\n  util.assert(\n      x4D.rank === 4,\n      () => `Error in fused depthwiseConv2d: input must be rank 4, but got ` +\n          `rank ${x4D.rank}.`);\n  util.assert(\n      $filter.rank === 4,\n      () => `Error in fused depthwiseConv2d: filter must be rank 4, ` +\n          `but got rank ${$filter.rank}.`);\n  util.assert(\n      x4D.shape[3] === $filter.shape[2],\n      () => `Error in fused depthwiseConv2d: number of input channels ` +\n          `(${x4D.shape[3]}) must match the inChannels dimension in ` +\n          `filter ${$filter.shape[2]}.`);\n  if (dilations == null) {\n    dilations = [1, 1];\n  }\n  util.assert(\n      conv_util.eitherStridesOrDilationsAreOne(strides, dilations),\n      () =>\n          'Error in fused depthwiseConv2d: Either strides or dilations must ' +\n          `be 1. Got strides ${strides} and dilations '${dilations}'`);\n  conv_util.checkPadOnDimRoundingMode(\n      'fused depthwiseConv2d', pad, dimRoundingMode);\n  const convInfo = conv_util.computeConv2DInfo(\n      x4D.shape, $filter.shape, strides, dilations, pad, dimRoundingMode,\n      true /* depthwise */);\n\n  let $bias: Tensor;\n  if (bias != null) {\n    $bias = convertToTensor(bias, 'bias', 'fused conv2d');\n    [$bias] = makeTypesMatch($bias, $x);\n\n    broadcast_util.assertAndGetBroadcastShape(convInfo.outShape, $bias.shape);\n  }\n\n  let $preluActivationWeights: Tensor;\n  if (preluActivationWeights != null) {\n    $preluActivationWeights = convertToTensor(\n        preluActivationWeights, 'prelu weights', 'fused depthwiseConv2d');\n  }\n\n  const grad = (dy: Tensor4D, saved: Tensor[]) => {\n    util.assert(\n        conv_util.tupleValuesAreOne(dilations),\n        () => 'Error in gradient of fused depthwiseConv2d: dilation rates ' +\n            `greater than 1 are not yet supported. Got dilations ` +\n            `'${dilations}'`);\n    const [$filter, x4D, y, bias] = saved;\n\n    const dyActivation = getFusedDyActivation(dy, y, activation) as Tensor4D;\n\n    const xDer = depthwiseConv2dNativeBackpropInput(\n        (x4D as Tensor4D).shape, dyActivation, $filter as Tensor4D, strides,\n        pad, dilations, dimRoundingMode);\n    const filterDer = depthwiseConv2dNativeBackpropFilter(\n        x4D as Tensor4D, dyActivation, ($filter as Tensor4D).shape, strides,\n        pad, dilations, dimRoundingMode);\n\n    if (bias != null) {\n      const biasDer = getFusedBiasGradient($bias, dyActivation);\n      return [xDer, filterDer, biasDer];\n    }\n    return [xDer, filterDer];\n  };\n\n  const inputs: FusedDepthwiseConv2DInputs = {\n    x: x4D,\n    filter: $filter,\n    bias: $bias,\n    preluActivationWeights: $preluActivationWeights\n  };\n  const attrs: FusedDepthwiseConv2DAttrs = {\n    strides,\n    pad,\n    dataFormat,\n    dilations,\n    dimRoundingMode,\n    activation,\n    leakyreluAlpha\n  };\n\n  // Depending on the the params passed in we will have different number of\n  // inputs and thus a a different number of elements in the gradient.\n  if (bias == null) {\n    const customOp =\n        customGrad((x4D: Tensor4D, filter: Tensor4D, save: GradSaveFunc) => {\n          // tslint:disable-next-line: no-unnecessary-type-assertion\n          let res: Tensor4D|Tensor3D = ENGINE.runKernel(\n              FusedDepthwiseConv2D, inputs as unknown as NamedTensorMap,\n              attrs as unknown as NamedAttrMap);\n\n          save([filter, x4D, res]);\n\n          if (reshapedTo4D) {\n            // tslint:disable-next-line: no-unnecessary-type-assertion\n            res = reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as\n                Tensor3D;\n          }\n\n          return {value: res, gradFunc: grad};\n        });\n    return customOp(x4D, $filter) as T;\n  } else {\n    const customOpWithBias = customGrad(\n        (x4D: Tensor4D, filter: Tensor4D, bias: Tensor, save: GradSaveFunc) => {\n          // tslint:disable-next-line: no-unnecessary-type-assertion\n          let res: Tensor4D|Tensor3D = ENGINE.runKernel(\n              FusedDepthwiseConv2D, inputs as unknown as NamedTensorMap,\n              attrs as unknown as NamedAttrMap);\n\n          save([filter, x4D, res, bias]);\n\n          if (reshapedTo4D) {\n            // tslint:disable-next-line: no-unnecessary-type-assertion\n            res = reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as\n                Tensor3D;\n          }\n\n          return {value: res, gradFunc: grad};\n        });\n\n    return customOpWithBias(x4D, $filter, $bias) as T;\n  }\n}\nexport const depthwiseConv2d = /* @__PURE__ */ op({fusedDepthwiseConv2d_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {customGrad} from '../../gradients';\nimport {_FusedMatMul, _FusedMatMulAttrs, _FusedMatMulInputs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor, Tensor3D} from '../../tensor';\nimport {GradSaveFunc, NamedTensorMap} from '../../tensor_types';\nimport {makeTypesMatch} from '../../tensor_util';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\n\nimport {add} from '../add';\nimport * as broadcast_util from '../broadcast_util';\nimport {Activation} from '../fused_types';\nimport {applyActivation, getFusedBiasGradient, getFusedDyActivation, shouldFuse} from '../fused_util';\nimport {matMul as unfusedMatMul} from '../mat_mul';\nimport {op} from '../operation';\nimport {reshape} from '../reshape';\n\n/**\n * Computes the dot product of two matrices with optional activation and bias.\n *\n * ```js\n * const a = tf.tensor2d([-1, -2], [1, 2]);\n * const b = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n * const bias = tf.tensor2d([1, 2], [1, 2]);\n *\n * tf.fused.matMul({a, b, bias, activation: 'relu'}).print();\n * ```\n *\n * @param obj An object with the following properties:\n * - `a` First matrix in dot product operation.\n * - `b` Second matrix in dot product operation.\n * - `transposeA` If true, `a` is transposed before multiplication.\n * - `transposeB` If true, `b` is transposed before multiplication.\n * - `bias` Matrix to be added to the result.\n * - `activation` Name of activation kernel (defaults to `linear`).\n * - `preluActivationWeights` Tensor of prelu weights.\n * - `leakyreluAlpha` Alpha of leakyrelu.\n */\nfunction fusedMatMul_({\n  a,\n  b,\n  transposeA = false,\n  transposeB = false,\n  bias,\n  activation = 'linear',\n  preluActivationWeights,\n  leakyreluAlpha = 0.2,\n}: {\n  a: Tensor|TensorLike,\n  b: Tensor|TensorLike,\n  transposeA?: boolean,\n  transposeB?: boolean,\n  bias?: Tensor|TensorLike,\n  activation?: Activation,\n  preluActivationWeights?: Tensor\n  leakyreluAlpha?: number\n}): Tensor {\n    if (shouldFuse(ENGINE.state.gradientDepth, activation) === false) {\n      let result = unfusedMatMul(a, b, transposeA, transposeB);\n      if (bias != null) {\n        result = add(result, bias);\n      }\n\n      return applyActivation(\n                 result, activation, preluActivationWeights, leakyreluAlpha);\n    }\n\n    let $a = convertToTensor(a, 'a', 'fused matMul');\n    let $b = convertToTensor(b, 'b', 'fused matMul');\n    [$a, $b] = makeTypesMatch($a, $b);\n\n    const innerShapeA =\n        transposeA ? $a.shape[$a.rank - 2] : $a.shape[$a.rank - 1];\n    const innerShapeB =\n        transposeB ? $b.shape[$b.rank - 1] : $b.shape[$b.rank - 2];\n\n    const outerShapeA =\n        transposeA ? $a.shape[$a.rank - 1] : $a.shape[$a.rank - 2];\n    const outerShapeB =\n        transposeB ? $b.shape[$b.rank - 2] : $b.shape[$b.rank - 1];\n\n    const outerDimsA = $a.shape.slice(0, -2);\n    const outerDimsB = $b.shape.slice(0, -2);\n    const batchDimA = util.sizeFromShape(outerDimsA);\n    const batchDimB = util.sizeFromShape(outerDimsB);\n\n    util.assert(\n        innerShapeA === innerShapeB,\n        () => `Error in fused matMul: inner shapes (${innerShapeA}) and (` +\n            `${innerShapeB}) of Tensors with shapes ${$a.shape} and ` +\n            `${$b.shape} and transposeA=${transposeA}` +\n            ` and transposeB=${transposeB} must match.`);\n\n    const outShapeOuterDims = broadcast_util.assertAndGetBroadcastShape(\n        $a.shape.slice(0, -2), $b.shape.slice(0, -2));\n    const outShape = outShapeOuterDims.concat([outerShapeA, outerShapeB]);\n\n    const a3D: Tensor3D = transposeA ?\n        reshape($a, [batchDimA, innerShapeA, outerShapeA]) :\n        reshape($a, [batchDimA, outerShapeA, innerShapeA]);\n    const b3D: Tensor3D = transposeB ?\n        reshape($b, [batchDimB, outerShapeB, innerShapeB]) :\n        reshape($b, [batchDimB, innerShapeB, outerShapeB]);\n\n    let $bias: Tensor;\n    if (bias != null) {\n      $bias = convertToTensor(bias, 'bias', 'fused matMul');\n      [$bias] = makeTypesMatch($bias, $a);\n\n      broadcast_util.assertAndGetBroadcastShape(outShape, $bias.shape);\n    }\n\n    let $preluActivationWeights: Tensor;\n    if (preluActivationWeights != null) {\n      $preluActivationWeights = convertToTensor(\n          preluActivationWeights, 'prelu weights', 'fused matMul');\n    }\n\n    const grad = (dy: Tensor3D, saved: Tensor[]) => {\n      const [a3D, b3D, y, $bias] = saved;\n      // we reshape dy because the result of the forward is not\n      // necessarily going to be a 3d tensor due to a reshape done at the end of\n      // the customOp.\n      const dyActivation =\n          getFusedDyActivation(reshape(dy, y.shape), y, activation);\n      let aDer: Tensor;\n      let bDer: Tensor;\n\n      if (!transposeA && !transposeB) {\n        aDer = unfusedMatMul(dyActivation, b3D, false, true);\n        bDer = unfusedMatMul(a3D, dyActivation, true, false);\n      } else if (!transposeA && transposeB) {\n        aDer = unfusedMatMul(dyActivation, b3D, false, false);\n        bDer = unfusedMatMul(dyActivation, a3D, true, false);\n      } else if (transposeA && !transposeB) {\n        aDer = unfusedMatMul(b3D, dyActivation, false, true);\n        bDer = unfusedMatMul(a3D, dyActivation, false, false);\n      } else {\n        aDer = unfusedMatMul(b3D, dyActivation, true, true);\n        bDer = unfusedMatMul(dyActivation, a3D, true, true);\n      }\n\n      if (bias != null) {\n        const biasDer = getFusedBiasGradient($bias, dyActivation);\n        return [aDer, bDer, biasDer];\n      } else {\n        return [aDer, bDer];\n      }\n    };\n\n    const inputs: _FusedMatMulInputs = {\n      a: a3D,\n      b: b3D,\n      bias: $bias,\n      preluActivationWeights: $preluActivationWeights\n    };\n    const attrs: _FusedMatMulAttrs =\n        {transposeA, transposeB, activation, leakyreluAlpha};\n\n    // Depending on the the params passed in we will have different number of\n    // inputs and thus a a different number of elements in the gradient.\n    if (bias == null) {\n      const customOp =\n          customGrad((a3D: Tensor3D, b3D: Tensor3D, save: GradSaveFunc) => {\n            const res =\n                // tslint:disable-next-line: no-unnecessary-type-assertion\n                ENGINE.runKernel(\n                    _FusedMatMul, inputs as unknown as NamedTensorMap,\n                    attrs as unknown as NamedAttrMap) as Tensor;\n\n            save([a3D, b3D, res]);\n\n            return {value: reshape(res, outShape), gradFunc: grad};\n          });\n      return customOp(a3D, b3D);\n    } else {\n      const customOpWithBias = customGrad(\n          (a3D: Tensor3D, b3D: Tensor3D, $bias: Tensor, save: GradSaveFunc) => {\n            const res =\n                // tslint:disable-next-line: no-unnecessary-type-assertion\n                ENGINE.runKernel(\n                    _FusedMatMul, inputs as unknown as NamedTensorMap,\n                    attrs as unknown as NamedAttrMap) as Tensor;\n\n            save([a3D, b3D, res, $bias]);\n\n            return {value: reshape(res, outShape), gradFunc: grad};\n          });\n\n      return customOpWithBias(a3D, b3D, $bias);\n    }\n  }\n\n  export const matMul = /* @__PURE__ */ op({fusedMatMul_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {conv2d} from './fused/conv2d';\nimport {depthwiseConv2d} from './fused/depthwise_conv2d';\nimport {matMul} from './fused/mat_mul';\nimport {Activation} from './fused_types';\n\nexport {Activation, conv2d, depthwiseConv2d, matMul};\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor1D} from '../../tensor';\nimport {op} from '../operation';\nimport {cosineWindow} from '../signal_ops_util';\n\n/**\n * Generate a hamming window.\n *\n * See: https://en.wikipedia.org/wiki/Window_function#Hann_and_Hamming_windows\n *\n * ```js\n * tf.signal.hammingWindow(10).print();\n * ```\n * @param The length of window\n *\n * @doc {heading: 'Operations', subheading: 'Signal', namespace: 'signal'}\n */\nfunction hammingWindow_(windowLength: number): Tensor1D {\n  return cosineWindow(windowLength, 0.54, 0.46);\n}\nexport const hammingWindow = /* @__PURE__ */ op({hammingWindow_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor1D} from '../../tensor';\nimport {op} from '../operation';\nimport {cosineWindow} from '../signal_ops_util';\n\n/**\n * Generate a Hann window.\n *\n * See: https://en.wikipedia.org/wiki/Window_function#Hann_and_Hamming_windows\n *\n * ```js\n * tf.signal.hannWindow(10).print();\n * ```\n * @param The length of window\n *\n * @doc {heading: 'Operations', subheading: 'Signal', namespace: 'signal'}\n */\nfunction hannWindow_(windowLength: number): Tensor1D {\n  return cosineWindow(windowLength, 0.5, 0.5);\n}\n\nexport const hannWindow = /* @__PURE__ */ op({hannWindow_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor, Tensor1D} from '../../tensor';\nimport {concat} from '../concat';\nimport {fill} from '../fill';\nimport {op} from '../operation';\nimport {reshape} from '../reshape';\nimport {slice} from '../slice';\nimport {tensor2d} from '../tensor2d';\n\n/**\n * Expands input into frames of frameLength.\n * Slides a window size with frameStep.\n *\n * ```js\n * tf.signal.frame([1, 2, 3], 2, 1).print();\n * ```\n * @param signal The input tensor to be expanded\n * @param frameLength Length of each frame\n * @param frameStep The frame hop size in samples.\n * @param padEnd Whether to pad the end of signal with padValue.\n * @param padValue A number to use where the input signal does\n *     not exist when padEnd is True.\n *\n * @doc {heading: 'Operations', subheading: 'Signal', namespace: 'signal'}\n */\nfunction frame_(\n    signal: Tensor1D, frameLength: number, frameStep: number, padEnd = false,\n    padValue = 0): Tensor {\n  let start = 0;\n  const output: Tensor[] = [];\n  while (start + frameLength <= signal.size) {\n    output.push(slice(signal, start, frameLength));\n    start += frameStep;\n  }\n\n  if (padEnd) {\n    while (start < signal.size) {\n      const padLen = (start + frameLength) - signal.size;\n      const pad = concat([\n        slice(signal, start, frameLength - padLen), fill([padLen], padValue)\n      ]);\n      output.push(pad);\n      start += frameStep;\n    }\n  }\n\n  if (output.length === 0) {\n    return tensor2d([], [0, frameLength]);\n  }\n\n  return reshape(concat(output), [output.length, frameLength]);\n}\nexport const frame = /* @__PURE__ */ op({frame_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor, Tensor1D} from '../../tensor';\nimport {mul} from '../mul';\nimport {op} from '../operation';\nimport {enclosingPowerOfTwo} from '../signal_ops_util';\nimport {rfft} from '../spectral/rfft';\n\nimport {frame} from './frame';\nimport {hannWindow} from './hann_window';\n\n/**\n * Computes the Short-time Fourier Transform of signals\n * See: https://en.wikipedia.org/wiki/Short-time_Fourier_transform\n *\n * ```js\n * const input = tf.tensor1d([1, 1, 1, 1, 1])\n * tf.signal.stft(input, 3, 1).print();\n * ```\n * @param signal 1-dimensional real value tensor.\n * @param frameLength The window length of samples.\n * @param frameStep The number of samples to step.\n * @param fftLength The size of the FFT to apply.\n * @param windowFn A callable that takes a window length and returns 1-d tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Signal', namespace: 'signal'}\n */\nfunction stft_(\n    signal: Tensor1D, frameLength: number, frameStep: number,\n    fftLength?: number,\n    windowFn: (length: number) => Tensor1D = hannWindow): Tensor {\n  if (fftLength == null) {\n    fftLength = enclosingPowerOfTwo(frameLength);\n  }\n  const framedSignal = frame(signal, frameLength, frameStep);\n  const windowedSignal = mul(framedSignal, windowFn(frameLength));\n  return rfft(windowedSignal, fftLength);\n}\nexport const stft = /* @__PURE__ */ op({stft_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {CropAndResize, CropAndResizeAttrs, CropAndResizeInputs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor1D, Tensor2D, Tensor4D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\n\nimport {op} from '../operation';\n\n/**\n * Extracts crops from the input image tensor and resizes them using bilinear\n * sampling or nearest neighbor sampling (possibly with aspect ratio change)\n * to a common output size specified by cropSize.\n *\n * @param image 4d tensor of shape `[batch,imageHeight,imageWidth, depth]`,\n *     where imageHeight and imageWidth must be positive, specifying the\n *     batch of images from which to take crops\n * @param boxes 2d float32 tensor of shape `[numBoxes, 4]`. Each entry is\n *     `[y1, x1, y2, x2]`, where `(y1, x1)` and `(y2, x2)` are the normalized\n *     coordinates of the box in the `boxInd[i]`th image in the batch\n * @param boxInd 1d int32 tensor of shape `[numBoxes]` with values in range\n *     `[0, batch)` that specifies the image that the `i`-th box refers to.\n * @param cropSize 1d int32 tensor of 2 elements `[cropHeigh, cropWidth]`\n *     specifying the size to which all crops are resized to.\n * @param method Optional string from `'bilinear' | 'nearest'`,\n *     defaults to bilinear, which specifies the sampling method for resizing\n * @param extrapolationValue A threshold for deciding when to remove boxes based\n *     on score. Defaults to 0.\n * @return A 4D tensor of the shape `[numBoxes,cropHeight,cropWidth,depth]`\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nfunction cropAndResize_(\n    image: Tensor4D|TensorLike,\n    boxes: Tensor2D|TensorLike,\n    boxInd: Tensor1D|TensorLike,\n    cropSize: [number, number],\n    method: 'bilinear'|'nearest' = 'bilinear',\n    extrapolationValue = 0,\n    ): Tensor4D {\n  const $image = convertToTensor(image, 'image', 'cropAndResize');\n  const $boxes = convertToTensor(boxes, 'boxes', 'cropAndResize', 'float32');\n  const $boxInd = convertToTensor(boxInd, 'boxInd', 'cropAndResize', 'int32');\n\n  const numBoxes = $boxes.shape[0];\n\n  util.assert(\n      $image.rank === 4,\n      () => 'Error in cropAndResize: image must be rank 4,' +\n          `but got rank ${$image.rank}.`);\n  util.assert(\n      $boxes.rank === 2 && $boxes.shape[1] === 4,\n      () => `Error in cropAndResize: boxes must be have size [${numBoxes},4] ` +\n          `but had shape ${$boxes.shape}.`);\n  util.assert(\n      $boxInd.rank === 1 && $boxInd.shape[0] === numBoxes,\n      () => `Error in cropAndResize: boxInd must be have size [${numBoxes}] ` +\n          `but had shape ${$boxes.shape}.`);\n  util.assert(\n      cropSize.length === 2,\n      () => `Error in cropAndResize: cropSize must be of length 2, but got ` +\n          `length ${cropSize.length}.`);\n  util.assert(\n      cropSize[0] >= 1 && cropSize[1] >= 1,\n      () => `cropSize must be atleast [1,1], but was ${cropSize}`);\n  util.assert(\n      method === 'bilinear' || method === 'nearest',\n      () => `method must be bilinear or nearest, but was ${method}`);\n\n  const inputs:\n      CropAndResizeInputs = {image: $image, boxes: $boxes, boxInd: $boxInd};\n  const attrs: CropAndResizeAttrs = {method, extrapolationValue, cropSize};\n  const res = ENGINE.runKernel(\n      CropAndResize, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n  return res as Tensor4D;\n}\n\nexport const cropAndResize = /* @__PURE__ */ op({cropAndResize_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {FlipLeftRight, FlipLeftRightInputs} from '../../kernel_names';\nimport {Tensor4D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\nimport {op} from '../operation';\n\n/**\n * Flips the image left to right. Currently available in the CPU, WebGL, and\n * WASM backends.\n *\n * @param image 4d tensor of shape `[batch, imageHeight, imageWidth, depth]`.\n */\n/** @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'} */\nfunction flipLeftRight_(image: Tensor4D|TensorLike): Tensor4D {\n  const $image = convertToTensor(image, 'image', 'flipLeftRight', 'float32');\n\n  util.assert(\n      $image.rank === 4,\n      () => 'Error in flipLeftRight: image must be rank 4,' +\n          `but got rank ${$image.rank}.`);\n\n  const inputs: FlipLeftRightInputs = {image: $image};\n  const res =\n      ENGINE.runKernel(FlipLeftRight, inputs as unknown as NamedTensorMap, {});\n  return res as Tensor4D;\n}\n\nexport const flipLeftRight = /* @__PURE__ */ op({flipLeftRight_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor2D, Tensor3D, Tensor4D, Tensor5D, Tensor6D} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\n\nimport {op} from '../operation';\nimport {tile} from '../tile';\n\n/**\n * Converts images from grayscale to RGB format.\n *\n * @param image A grayscale tensor to convert. The `image`'s last dimension must\n *     be size 1 with at least a two-dimensional shape.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nfunction grayscaleToRGB_<T extends Tensor2D|Tensor3D|Tensor4D|Tensor5D|\n                         Tensor6D>(image: T|TensorLike): T {\n  const $image = convertToTensor(image, 'image', 'grayscaleToRGB');\n\n  const lastDimsIdx = $image.rank - 1;\n  const lastDims = $image.shape[lastDimsIdx];\n\n  util.assert(\n      $image.rank >= 2,\n      () => 'Error in grayscaleToRGB: images must be at least rank 2, ' +\n          `but got rank ${$image.rank}.`);\n\n  util.assert(\n      lastDims === 1,\n      () => 'Error in grayscaleToRGB: last dimension of a grayscale image ' +\n          `should be size 1, but got size ${lastDims}.`);\n\n  const reps = new Array($image.rank);\n\n  reps.fill(1, 0, lastDimsIdx);\n  reps[lastDimsIdx] = 3;\n\n  return tile($image, reps);\n}\n\nexport const grayscaleToRGB = /* @__PURE__ */ op({grayscaleToRGB_});\n", "/**\n * @license\n * Copyright 2023 Google LLC.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor2D, Tensor3D, Tensor4D, Tensor5D, Tensor6D} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\nimport {cast} from '../cast';\nimport {einsum} from '../einsum';\nimport {expandDims} from '../expand_dims';\nimport {op} from '../operation';\nimport {tensor1d} from '../tensor1d';\n\n/**\n * Converts images from RGB format to grayscale.\n *\n * @param image A RGB tensor to convert. The `image`'s last dimension must\n *     be size 3 with at least a two-dimensional shape.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nfunction rgbToGrayscale_<T extends Tensor2D|Tensor3D|Tensor4D|Tensor5D|\n                         Tensor6D>(image: T|TensorLike): T {\n  const $image = convertToTensor(image, 'image', 'RGBToGrayscale');\n\n  const lastDimsIdx = $image.rank - 1;\n  const lastDims = $image.shape[lastDimsIdx];\n\n  util.assert(\n      $image.rank >= 2,\n      () => 'Error in RGBToGrayscale: images must be at least rank 2, ' +\n          `but got rank ${$image.rank}.`);\n\n  util.assert(\n      lastDims === 3,\n      () => 'Error in RGBToGrayscale: last dimension of an RGB image ' +\n          `should be size 3, but got size ${lastDims}.`);\n\n  // Remember original dtype so we can convert back if needed\n  const origDtype = $image.dtype;\n  const fltImage = cast($image, 'float32');\n\n  const rgbWeights = tensor1d([0.2989, 0.5870, 0.1140]);\n\n  let grayFloat;\n  switch ($image.rank) {\n    case 2:\n      grayFloat = einsum('ij,j->i', fltImage, rgbWeights);\n      break;\n    case 3:\n      grayFloat = einsum('ijk,k->ij', fltImage, rgbWeights);\n      break;\n    case 4:\n      grayFloat = einsum('ijkl,l->ijk', fltImage, rgbWeights);\n      break;\n    case 5:\n      grayFloat = einsum('ijklm,m->ijkl', fltImage, rgbWeights);\n      break;\n    case 6:\n      grayFloat = einsum('ijklmn,n->ijklm', fltImage, rgbWeights);\n      break;\n    default:\n      throw new Error('Not a valid tensor rank.');\n  }\n  grayFloat = expandDims(grayFloat, -1);\n\n  return cast(grayFloat, origDtype) as T;\n}\n\nexport const rgbToGrayscale = /* @__PURE__ */ op({rgbToGrayscale_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {RotateWithOffset, RotateWithOffsetAttrs, RotateWithOffsetInputs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor4D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\n\nimport {op} from '../operation';\n\n/**\n * Rotates the input image tensor counter-clockwise with an optional offset\n * center of rotation. Currently available in the CPU, WebGL, and WASM backends.\n *\n * @param image 4d tensor of shape `[batch, imageHeight, imageWidth, depth]`.\n * @param radians The amount of rotation.\n * @param fillValue The value to fill in the empty space leftover\n *     after rotation. Can be either a single grayscale value (0-255), or an\n *     array of three numbers `[red, green, blue]` specifying the red, green,\n *     and blue channels. Defaults to `0` (black).\n * @param center The center of rotation. Can be either a single value (0-1), or\n *     an array of two numbers `[centerX, centerY]`. Defaults to `0.5` (rotates\n *     the image around its center).\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nfunction rotateWithOffset_(\n    image: Tensor4D|TensorLike, radians: number,\n    fillValue: number|[number, number, number] = 0,\n    center: number|[number, number] = 0.5): Tensor4D {\n  const $image = convertToTensor(image, 'image', 'rotateWithOffset', 'float32');\n\n  util.assert(\n      $image.rank === 4,\n      () => 'Error in rotateWithOffset: image must be rank 4,' +\n          `but got rank ${$image.rank}.`);\n\n  const inputs: RotateWithOffsetInputs = {image: $image};\n  const attrs: RotateWithOffsetAttrs = {radians, fillValue, center};\n  const res = ENGINE.runKernel(\n      RotateWithOffset, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n  return res as Tensor4D;\n}\n\nexport const rotateWithOffset = /* @__PURE__ */ op({rotateWithOffset_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor1D, Tensor2D} from '../tensor';\nimport * as util from '../util';\n\nfunction nonMaxSuppSanityCheck(\n    boxes: Tensor2D, scores: Tensor1D, maxOutputSize: number,\n    iouThreshold: number, scoreThreshold: number, softNmsSigma?: number): {\n  maxOutputSize: number,\n  iouThreshold: number,\n  scoreThreshold: number,\n  softNmsSigma: number\n} {\n  if (iouThreshold == null) {\n    iouThreshold = 0.5;\n  }\n  if (scoreThreshold == null) {\n    scoreThreshold = Number.NEGATIVE_INFINITY;\n  }\n  if (softNmsSigma == null) {\n    softNmsSigma = 0.0;\n  }\n\n  const numBoxes = boxes.shape[0];\n  maxOutputSize = Math.min(maxOutputSize, numBoxes);\n\n  util.assert(\n      0 <= iouThreshold && iouThreshold <= 1,\n      () => `iouThreshold must be in [0, 1], but was '${iouThreshold}'`);\n  util.assert(\n      boxes.rank === 2,\n      () => `boxes must be a 2D tensor, but was of rank '${boxes.rank}'`);\n  util.assert(\n      boxes.shape[1] === 4,\n      () =>\n          `boxes must have 4 columns, but 2nd dimension was ${boxes.shape[1]}`);\n  util.assert(scores.rank === 1, () => 'scores must be a 1D tensor');\n  util.assert(\n      scores.shape[0] === numBoxes,\n      () => `scores has incompatible shape with boxes. Expected ${numBoxes}, ` +\n          `but was ${scores.shape[0]}`);\n  util.assert(\n      0 <= softNmsSigma && softNmsSigma <= 1,\n      () => `softNmsSigma must be in [0, 1], but was '${softNmsSigma}'`);\n  return {maxOutputSize, iouThreshold, scoreThreshold, softNmsSigma};\n}\n\nexport {nonMaxSuppSanityCheck};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {NonMaxSuppressionV3} from '../../kernel_names';\nimport {Tensor1D, Tensor2D} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {nonMaxSuppSanityCheck} from '../nonmax_util';\nimport {op} from '../operation';\n\n/**\n * Performs non maximum suppression of bounding boxes based on\n * iou (intersection over union).\n *\n * @param boxes a 2d tensor of shape `[numBoxes, 4]`. Each entry is\n *     `[y1, x1, y2, x2]`, where `(y1, x1)` and `(y2, x2)` are the corners of\n *     the bounding box.\n * @param scores a 1d tensor providing the box scores of shape `[numBoxes]`.\n * @param maxOutputSize The maximum number of boxes to be selected.\n * @param iouThreshold A float representing the threshold for deciding whether\n *     boxes overlap too much with respect to IOU. Must be between [0, 1].\n *     Defaults to 0.5 (50% box overlap).\n * @param scoreThreshold A threshold for deciding when to remove boxes based\n *     on score. Defaults to -inf, which means any score is accepted.\n * @return A 1D tensor with the selected box indices.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nfunction nonMaxSuppression_(\n    boxes: Tensor2D|TensorLike, scores: Tensor1D|TensorLike,\n    maxOutputSize: number, iouThreshold = 0.5,\n    scoreThreshold = Number.NEGATIVE_INFINITY): Tensor1D {\n  const $boxes =\n      convertToTensor(boxes, 'boxes', 'nonMaxSuppression', 'float32');\n  const $scores =\n      convertToTensor(scores, 'scores', 'nonMaxSuppression', 'float32');\n\n  const inputs = nonMaxSuppSanityCheck(\n      $boxes, $scores, maxOutputSize, iouThreshold, scoreThreshold);\n  maxOutputSize = inputs.maxOutputSize;\n  iouThreshold = inputs.iouThreshold;\n  scoreThreshold = inputs.scoreThreshold;\n\n  const attrs = {maxOutputSize, iouThreshold, scoreThreshold};\n  return ENGINE.runKernel(\n      NonMaxSuppressionV3, {boxes: $boxes, scores: $scores}, attrs);\n}\n\nexport const nonMaxSuppression = /* @__PURE__ */ op({nonMaxSuppression_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/**\n * Inserts a value into a sorted array. This method allows duplicate, meaning it\n * allows inserting duplicate value, in which case, the element will be inserted\n * at the lowest index of the value.\n * @param arr The array to modify.\n * @param element The element to insert.\n * @param comparator Optional. If no comparator is specified, elements are\n * compared using array_util.defaultComparator, which is suitable for Strings\n * and Numbers in ascending arrays. If the array contains multiple instances of\n * the target value, the left-most instance will be returned. To provide a\n * comparator, it should take 2 arguments to compare and return a negative,\n * zero, or a positive number.\n */\nexport function binaryInsert<T>(\n    arr: T[], element: T, comparator?: (a: T, b: T) => number) {\n  const index = binarySearch(arr, element, comparator);\n  const insertionPoint = index < 0 ? -(index + 1) : index;\n  arr.splice(insertionPoint, 0, element);\n}\n\n/**\n * Searches the array for the target using binary search, returns the index\n * of the found element, or position to insert if element not found. If no\n * comparator is specified, elements are compared using array_\n * util.defaultComparator, which is suitable for Strings and Numbers in\n * ascending arrays. If the array contains multiple instances of the target\n * value, the left-most instance will be returned.\n * @param arr The array to be searched in.\n * @param target The target to be searched for.\n * @param comparator Should take 2 arguments to compare and return a negative,\n *    zero, or a positive number.\n * @return Lowest index of the target value if found, otherwise the insertion\n *    point where the target should be inserted, in the form of\n *    (-insertionPoint - 1).\n */\nexport function binarySearch<T>(\n    arr: T[], target: T, comparator?: (a: T, b: T) => number) {\n  return binarySearch_(arr, target, comparator || defaultComparator);\n}\n\n/**\n * Compares its two arguments for order.\n * @param a The first element to be compared.\n * @param b The second element to be compared.\n * @return A negative number, zero, or a positive number as the first\n *     argument is less than, equal to, or greater than the second.\n */\nfunction defaultComparator<T>(a: T, b: T): number {\n  return a > b ? 1 : a < b ? -1 : 0;\n}\n\nfunction binarySearch_<T>(\n    arr: T[], target: T, comparator: (a: T, b: T) => number) {\n  let left = 0;\n  let right = arr.length;\n  let middle = 0;\n  let found = false;\n  while (left < right) {\n    middle = left + ((right - left) >>> 1);\n    const compareResult = comparator(target, arr[middle]);\n    if (compareResult > 0) {\n      left = middle + 1;\n    } else {\n      right = middle;\n      // If compareResult is 0, the value is found. We record it is found,\n      // and then keep looking because there may be duplicate.\n      found = !compareResult;\n    }\n  }\n\n  return found ? left : -left - 1;\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {TypedArray} from '../types';\nimport {binaryInsert} from './non_max_suppression_util';\n\n/**\n * Implementation of the NonMaxSuppression kernel shared between webgl and cpu.\n */\ninterface Candidate {\n  score: number;\n  boxIndex: number;\n  suppressBeginIndex: number;\n}\n\ninterface NonMaxSuppressionResult {\n  selectedIndices: number[];\n  selectedScores?: number[];\n  validOutputs?: number;\n}\n\nexport function nonMaxSuppressionV3Impl(\n    boxes: TypedArray, scores: TypedArray, maxOutputSize: number,\n    iouThreshold: number, scoreThreshold: number): NonMaxSuppressionResult {\n  return nonMaxSuppressionImpl_(\n      boxes, scores, maxOutputSize, iouThreshold, scoreThreshold,\n      0 /* softNmsSigma */);\n}\n\nexport function nonMaxSuppressionV4Impl(\n    boxes: TypedArray, scores: TypedArray, maxOutputSize: number,\n    iouThreshold: number, scoreThreshold: number,\n    padToMaxOutputSize: boolean): NonMaxSuppressionResult {\n  return nonMaxSuppressionImpl_(\n      boxes, scores, maxOutputSize, iouThreshold, scoreThreshold,\n      0 /* softNmsSigma */, false /* returnScoresTensor */,\n      padToMaxOutputSize /* padToMaxOutputSize */, true\n      /* returnValidOutputs */);\n}\n\nexport function nonMaxSuppressionV5Impl(\n    boxes: TypedArray, scores: TypedArray, maxOutputSize: number,\n    iouThreshold: number, scoreThreshold: number,\n    softNmsSigma: number): NonMaxSuppressionResult {\n  return nonMaxSuppressionImpl_(\n      boxes, scores, maxOutputSize, iouThreshold, scoreThreshold, softNmsSigma,\n      true /* returnScoresTensor */);\n}\n\nfunction nonMaxSuppressionImpl_(\n    boxes: TypedArray, scores: TypedArray, maxOutputSize: number,\n    iouThreshold: number, scoreThreshold: number, softNmsSigma: number,\n    returnScoresTensor = false, padToMaxOutputSize = false,\n    returnValidOutputs = false): NonMaxSuppressionResult {\n  // The list is sorted in ascending order, so that we can always pop the\n  // candidate with the largest score in O(1) time.\n  const candidates = [];\n\n  for (let i = 0; i < scores.length; i++) {\n    if (scores[i] > scoreThreshold) {\n      candidates.push({score: scores[i], boxIndex: i, suppressBeginIndex: 0});\n    }\n  }\n\n  candidates.sort(ascendingComparator);\n\n  // If softNmsSigma is 0, the outcome of this algorithm is exactly same as\n  // before.\n  const scale = softNmsSigma > 0 ? (-0.5 / softNmsSigma) : 0.0;\n\n  const selectedIndices: number[] = [];\n  const selectedScores: number[] = [];\n\n  while (selectedIndices.length < maxOutputSize && candidates.length > 0) {\n    const candidate = candidates.pop();\n    const {score: originalScore, boxIndex, suppressBeginIndex} = candidate;\n\n    if (originalScore < scoreThreshold) {\n      break;\n    }\n\n    // Overlapping boxes are likely to have similar scores, therefore we\n    // iterate through the previously selected boxes backwards in order to\n    // see if candidate's score should be suppressed. We use\n    // suppressBeginIndex to track and ensure a candidate can be suppressed\n    // by a selected box no more than once. Also, if the overlap exceeds\n    // iouThreshold, we simply ignore the candidate.\n    let ignoreCandidate = false;\n    for (let j = selectedIndices.length - 1; j >= suppressBeginIndex; --j) {\n      const iou = intersectionOverUnion(boxes, boxIndex, selectedIndices[j]);\n\n      if (iou >= iouThreshold) {\n        ignoreCandidate = true;\n        break;\n      }\n\n      candidate.score =\n          candidate.score * suppressWeight(iouThreshold, scale, iou);\n\n      if (candidate.score <= scoreThreshold) {\n        break;\n      }\n    }\n\n    // At this point, if `candidate.score` has not dropped below\n    // `scoreThreshold`, then we know that we went through all of the\n    // previous selections and can safely update `suppressBeginIndex` to the\n    // end of the selected array. Then we can re-insert the candidate with\n    // the updated score and suppressBeginIndex back in the candidate list.\n    // If on the other hand, `candidate.score` has dropped below the score\n    // threshold, we will not add it back to the candidates list.\n    candidate.suppressBeginIndex = selectedIndices.length;\n\n    if (!ignoreCandidate) {\n      // Candidate has passed all the tests, and is not suppressed, so\n      // select the candidate.\n      if (candidate.score === originalScore) {\n        selectedIndices.push(boxIndex);\n        selectedScores.push(candidate.score);\n      } else if (candidate.score > scoreThreshold) {\n        // Candidate's score is suppressed but is still high enough to be\n        // considered, so add back to the candidates list.\n        binaryInsert(candidates, candidate, ascendingComparator);\n      }\n    }\n  }\n\n  // NonMaxSuppressionV4 feature: padding output to maxOutputSize.\n  const validOutputs = selectedIndices.length;\n  const elemsToPad = maxOutputSize - validOutputs;\n\n  if (padToMaxOutputSize && elemsToPad > 0) {\n    selectedIndices.push(...new Array(elemsToPad).fill(0));\n    selectedScores.push(...new Array(elemsToPad).fill(0.0));\n  }\n\n  const result: NonMaxSuppressionResult = {selectedIndices};\n\n  if (returnScoresTensor) {\n    result['selectedScores'] = selectedScores;\n  }\n\n  if (returnValidOutputs) {\n    result['validOutputs'] = validOutputs;\n  }\n\n  return result;\n}\n\nfunction intersectionOverUnion(boxes: TypedArray, i: number, j: number) {\n  const iCoord = boxes.subarray(i * 4, i * 4 + 4);\n  const jCoord = boxes.subarray(j * 4, j * 4 + 4);\n  const yminI = Math.min(iCoord[0], iCoord[2]);\n  const xminI = Math.min(iCoord[1], iCoord[3]);\n  const ymaxI = Math.max(iCoord[0], iCoord[2]);\n  const xmaxI = Math.max(iCoord[1], iCoord[3]);\n  const yminJ = Math.min(jCoord[0], jCoord[2]);\n  const xminJ = Math.min(jCoord[1], jCoord[3]);\n  const ymaxJ = Math.max(jCoord[0], jCoord[2]);\n  const xmaxJ = Math.max(jCoord[1], jCoord[3]);\n  const areaI = (ymaxI - yminI) * (xmaxI - xminI);\n  const areaJ = (ymaxJ - yminJ) * (xmaxJ - xminJ);\n  if (areaI <= 0 || areaJ <= 0) {\n    return 0.0;\n  }\n  const intersectionYmin = Math.max(yminI, yminJ);\n  const intersectionXmin = Math.max(xminI, xminJ);\n  const intersectionYmax = Math.min(ymaxI, ymaxJ);\n  const intersectionXmax = Math.min(xmaxI, xmaxJ);\n  const intersectionArea = Math.max(intersectionYmax - intersectionYmin, 0.0) *\n      Math.max(intersectionXmax - intersectionXmin, 0.0);\n  return intersectionArea / (areaI + areaJ - intersectionArea);\n}\n\n// A Gaussian penalty function, this method always returns values in [0, 1].\n// The weight is a function of similarity, the more overlap two boxes are, the\n// smaller the weight is,meaning highly overlapping boxes will be significantly\n// penalized. On the other hand, a non-overlapping box will not be penalized.\nfunction suppressWeight(iouThreshold: number, scale: number, iou: number) {\n  const weight = Math.exp(scale * iou * iou);\n  return iou <= iouThreshold ? weight : 0.0;\n}\n\nfunction ascendingComparator(c1: Candidate, c2: Candidate) {\n  // For objects with same scores, we make the object with the larger index go\n  // first. In an array that pops from the end, this means that the object with\n  // the smaller index will be popped first. This ensures the same output as\n  // the TensorFlow python version.\n  return (c1.score - c2.score) ||\n      ((c1.score === c2.score) && (c2.boxIndex - c1.boxIndex));\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {nonMaxSuppressionV3Impl} from '../../backends/non_max_suppression_impl';\nimport {Tensor1D, Tensor2D} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {nonMaxSuppSanityCheck} from '../nonmax_util';\nimport {tensor1d} from '../tensor1d';\n\n/**\n * Performs non maximum suppression of bounding boxes based on\n * iou (intersection over union).\n *\n * This is the async version of `nonMaxSuppression`\n *\n * @param boxes a 2d tensor of shape `[numBoxes, 4]`. Each entry is\n *     `[y1, x1, y2, x2]`, where `(y1, x1)` and `(y2, x2)` are the corners of\n *     the bounding box.\n * @param scores a 1d tensor providing the box scores of shape `[numBoxes]`.\n * @param maxOutputSize The maximum number of boxes to be selected.\n * @param iouThreshold A float representing the threshold for deciding whether\n *     boxes overlap too much with respect to IOU. Must be between [0, 1].\n *     Defaults to 0.5 (50% box overlap).\n * @param scoreThreshold A threshold for deciding when to remove boxes based\n *     on score. Defaults to -inf, which means any score is accepted.\n * @return A 1D tensor with the selected box indices.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nasync function nonMaxSuppressionAsync_(\n    boxes: Tensor2D|TensorLike, scores: Tensor1D|TensorLike,\n    maxOutputSize: number, iouThreshold = 0.5,\n    scoreThreshold = Number.NEGATIVE_INFINITY): Promise<Tensor1D> {\n  const $boxes = convertToTensor(boxes, 'boxes', 'nonMaxSuppressionAsync');\n  const $scores = convertToTensor(scores, 'scores', 'nonMaxSuppressionAsync');\n\n  const inputs = nonMaxSuppSanityCheck(\n      $boxes, $scores, maxOutputSize, iouThreshold, scoreThreshold);\n  maxOutputSize = inputs.maxOutputSize;\n  iouThreshold = inputs.iouThreshold;\n  scoreThreshold = inputs.scoreThreshold;\n\n  const boxesAndScores = await Promise.all([$boxes.data(), $scores.data()]);\n  const boxesVals = boxesAndScores[0];\n  const scoresVals = boxesAndScores[1];\n\n  // We call a cpu based impl directly with the typedarray data  here rather\n  // than a kernel because all kernels are synchronous (and thus cannot await\n  // .data()).\n  const {selectedIndices} = nonMaxSuppressionV3Impl(\n      boxesVals, scoresVals, maxOutputSize, iouThreshold, scoreThreshold);\n  if ($boxes !== boxes) {\n    $boxes.dispose();\n  }\n  if ($scores !== scores) {\n    $scores.dispose();\n  }\n\n  return tensor1d(selectedIndices, 'int32');\n}\n\nexport const nonMaxSuppressionAsync = nonMaxSuppressionAsync_;\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {NonMaxSuppressionV5, NonMaxSuppressionV5Attrs, NonMaxSuppressionV5Inputs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor, Tensor1D, Tensor2D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\n\nimport {nonMaxSuppSanityCheck} from '../nonmax_util';\nimport {op} from '../operation';\n\n/**\n * Performs non maximum suppression of bounding boxes based on\n * iou (intersection over union).\n *\n * This op also supports a Soft-NMS mode (cf.\n * Bodla et al, https://arxiv.org/abs/1704.04503) where boxes reduce the score\n * of other overlapping boxes, therefore favoring different regions of the image\n * with high scores. To enable this Soft-NMS mode, set the `softNmsSigma`\n * parameter to be larger than 0.\n *\n * @param boxes a 2d tensor of shape `[numBoxes, 4]`. Each entry is\n *     `[y1, x1, y2, x2]`, where `(y1, x1)` and `(y2, x2)` are the corners of\n *     the bounding box.\n * @param scores a 1d tensor providing the box scores of shape `[numBoxes]`.\n * @param maxOutputSize The maximum number of boxes to be selected.\n * @param iouThreshold A float representing the threshold for deciding whether\n *     boxes overlap too much with respect to IOU. Must be between [0, 1].\n *     Defaults to 0.5 (50% box overlap).\n * @param scoreThreshold A threshold for deciding when to remove boxes based\n *     on score. Defaults to -inf, which means any score is accepted.\n * @param softNmsSigma A float representing the sigma parameter for Soft NMS.\n *     When sigma is 0, it falls back to nonMaxSuppression.\n * @return A map with the following properties:\n *     - selectedIndices: A 1D tensor with the selected box indices.\n *     - selectedScores: A 1D tensor with the corresponding scores for each\n *       selected box.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nfunction nonMaxSuppressionWithScore_(\n    boxes: Tensor2D|TensorLike, scores: Tensor1D|TensorLike,\n    maxOutputSize: number, iouThreshold = 0.5,\n    scoreThreshold = Number.NEGATIVE_INFINITY,\n    softNmsSigma = 0.0): NamedTensorMap {\n  const $boxes = convertToTensor(boxes, 'boxes', 'nonMaxSuppression');\n  const $scores = convertToTensor(scores, 'scores', 'nonMaxSuppression');\n\n  const params = nonMaxSuppSanityCheck(\n      $boxes, $scores, maxOutputSize, iouThreshold, scoreThreshold,\n      softNmsSigma);\n  maxOutputSize = params.maxOutputSize;\n  iouThreshold = params.iouThreshold;\n  scoreThreshold = params.scoreThreshold;\n  softNmsSigma = params.softNmsSigma;\n\n  const inputs: NonMaxSuppressionV5Inputs = {boxes: $boxes, scores: $scores};\n  const attrs: NonMaxSuppressionV5Attrs =\n      {maxOutputSize, iouThreshold, scoreThreshold, softNmsSigma};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const result = ENGINE.runKernel(\n                     NonMaxSuppressionV5, inputs as unknown as NamedTensorMap,\n                     attrs as unknown as NamedAttrMap) as Tensor[];\n\n  return {selectedIndices: result[0], selectedScores: result[1]};\n}\n\nexport const nonMaxSuppressionWithScore = /* @__PURE__ */ op({nonMaxSuppressionWithScore_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {nonMaxSuppressionV5Impl} from '../../backends/non_max_suppression_impl';\nimport {Tensor1D, Tensor2D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {nonMaxSuppSanityCheck} from '../nonmax_util';\nimport {tensor1d} from '../tensor1d';\n\n/**\n * Asynchronously performs non maximum suppression of bounding boxes based on\n * iou (intersection over union).\n *\n * This op also supports a Soft-NMS mode (cf.\n * Bodla et al, https://arxiv.org/abs/1704.04503) where boxes reduce the score\n * of other overlapping boxes, therefore favoring different regions of the image\n * with high scores. To enable this Soft-NMS mode, set the `softNmsSigma`\n * parameter to be larger than 0.\n *\n * @param boxes a 2d tensor of shape `[numBoxes, 4]`. Each entry is\n *     `[y1, x1, y2, x2]`, where `(y1, x1)` and `(y2, x2)` are the corners of\n *     the bounding box.\n * @param scores a 1d tensor providing the box scores of shape `[numBoxes]`.\n * @param maxOutputSize The maximum number of boxes to be selected.\n * @param iouThreshold A float representing the threshold for deciding whether\n *     boxes overlap too much with respect to IOU. Must be between [0, 1].\n *     Defaults to 0.5 (50% box overlap).\n * @param scoreThreshold A threshold for deciding when to remove boxes based\n *     on score. Defaults to -inf, which means any score is accepted.\n * @param softNmsSigma A float representing the sigma parameter for Soft NMS.\n *     When sigma is 0, it falls back to nonMaxSuppression.\n * @return A map with the following properties:\n *     - selectedIndices: A 1D tensor with the selected box indices.\n *     - selectedScores: A 1D tensor with the corresponding scores for each\n *       selected box.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nasync function nonMaxSuppressionWithScoreAsync_(\n    boxes: Tensor2D|TensorLike, scores: Tensor1D|TensorLike,\n    maxOutputSize: number, iouThreshold = 0.5,\n    scoreThreshold = Number.NEGATIVE_INFINITY,\n    softNmsSigma = 0.0): Promise<NamedTensorMap> {\n  const $boxes = convertToTensor(boxes, 'boxes', 'nonMaxSuppressionAsync');\n  const $scores = convertToTensor(scores, 'scores', 'nonMaxSuppressionAsync');\n\n  const params = nonMaxSuppSanityCheck(\n      $boxes, $scores, maxOutputSize, iouThreshold, scoreThreshold,\n      softNmsSigma);\n  maxOutputSize = params.maxOutputSize;\n  iouThreshold = params.iouThreshold;\n  scoreThreshold = params.scoreThreshold;\n  softNmsSigma = params.softNmsSigma;\n\n  const boxesAndScores = await Promise.all([$boxes.data(), $scores.data()]);\n  const boxesVals = boxesAndScores[0];\n  const scoresVals = boxesAndScores[1];\n\n  // We call a cpu based impl directly with the typedarray data  here rather\n  // than a kernel because all kernels are synchronous (and thus cannot await\n  // .data()).\n  const {selectedIndices, selectedScores} = nonMaxSuppressionV5Impl(\n      boxesVals, scoresVals, maxOutputSize, iouThreshold, scoreThreshold,\n      softNmsSigma);\n\n  if ($boxes !== boxes) {\n    $boxes.dispose();\n  }\n  if ($scores !== scores) {\n    $scores.dispose();\n  }\n\n  return {\n    selectedIndices: tensor1d(selectedIndices, 'int32'),\n    selectedScores: tensor1d(selectedScores)\n  };\n}\n\nexport const nonMaxSuppressionWithScoreAsync = nonMaxSuppressionWithScoreAsync_;\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {NonMaxSuppressionV4, NonMaxSuppressionV4Attrs, NonMaxSuppressionV4Inputs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor, Tensor1D, Tensor2D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\n\nimport {nonMaxSuppSanityCheck} from '../nonmax_util';\nimport {op} from '../operation';\n\n/**\n * Asynchronously performs non maximum suppression of bounding boxes based on\n * iou (intersection over union), with an option to pad results.\n *\n * @param boxes a 2d tensor of shape `[numBoxes, 4]`. Each entry is\n *     `[y1, x1, y2, x2]`, where `(y1, x1)` and `(y2, x2)` are the corners of\n *     the bounding box.\n * @param scores a 1d tensor providing the box scores of shape `[numBoxes]`.\n * @param maxOutputSize The maximum number of boxes to be selected.\n * @param iouThreshold A float representing the threshold for deciding whether\n *     boxes overlap too much with respect to IOU. Must be between [0, 1].\n *     Defaults to 0.5 (50% box overlap).\n * @param scoreThreshold A threshold for deciding when to remove boxes based\n *     on score. Defaults to -inf, which means any score is accepted.\n * @param padToMaxOutputSize Defaults to false. If true, size of output\n *     `selectedIndices` is padded to maxOutputSize.\n * @return A map with the following properties:\n *     - selectedIndices: A 1D tensor with the selected box indices.\n *     - validOutputs: A scalar denoting how many elements in `selectedIndices`\n *       are valid. Valid elements occur first, then padding.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nfunction nonMaxSuppressionPadded_(\n    boxes: Tensor2D|TensorLike, scores: Tensor1D|TensorLike,\n    maxOutputSize: number, iouThreshold = 0.5,\n    scoreThreshold = Number.NEGATIVE_INFINITY,\n    padToMaxOutputSize = false): NamedTensorMap {\n  const $boxes = convertToTensor(boxes, 'boxes', 'nonMaxSuppression');\n  const $scores = convertToTensor(scores, 'scores', 'nonMaxSuppression');\n\n  const params = nonMaxSuppSanityCheck(\n      $boxes, $scores, maxOutputSize, iouThreshold, scoreThreshold,\n      null /* softNmsSigma */);\n  const $maxOutputSize = params.maxOutputSize;\n  const $iouThreshold = params.iouThreshold;\n  const $scoreThreshold = params.scoreThreshold;\n\n  const inputs: NonMaxSuppressionV4Inputs = {boxes: $boxes, scores: $scores};\n  const attrs: NonMaxSuppressionV4Attrs = {\n    maxOutputSize: $maxOutputSize,\n    iouThreshold: $iouThreshold,\n    scoreThreshold: $scoreThreshold,\n    padToMaxOutputSize\n  };\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const result = ENGINE.runKernel(\n                     NonMaxSuppressionV4, inputs as unknown as NamedTensorMap,\n                     attrs as unknown as NamedAttrMap) as Tensor[];\n\n  return {selectedIndices: result[0], validOutputs: result[1]};\n}\n\nexport const nonMaxSuppressionPadded = /* @__PURE__ */ op({nonMaxSuppressionPadded_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {nonMaxSuppressionV4Impl} from '../../backends/non_max_suppression_impl';\nimport {Tensor1D, Tensor2D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {nonMaxSuppSanityCheck} from '../nonmax_util';\nimport {scalar} from '../scalar';\nimport {tensor1d} from '../tensor1d';\n\n/**\n * Asynchronously performs non maximum suppression of bounding boxes based on\n * iou (intersection over union), with an option to pad results.\n *\n * @param boxes a 2d tensor of shape `[numBoxes, 4]`. Each entry is\n *     `[y1, x1, y2, x2]`, where `(y1, x1)` and `(y2, x2)` are the corners of\n *     the bounding box.\n * @param scores a 1d tensor providing the box scores of shape `[numBoxes]`.\n * @param maxOutputSize The maximum number of boxes to be selected.\n * @param iouThreshold A float representing the threshold for deciding whether\n *     boxes overlap too much with respect to IOU. Must be between [0, 1].\n *     Defaults to 0.5 (50% box overlap).\n * @param scoreThreshold A threshold for deciding when to remove boxes based\n *     on score. Defaults to -inf, which means any score is accepted.\n * @param padToMaxOutputSize Defaults to false. If true, size of output\n *     `selectedIndices` is padded to maxOutputSize.\n * @return A map with the following properties:\n *     - selectedIndices: A 1D tensor with the selected box indices.\n *     - validOutputs: A scalar denoting how many elements in `selectedIndices`\n *       are valid. Valid elements occur first, then padding.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nasync function nonMaxSuppressionPaddedAsync_(\n    boxes: Tensor2D|TensorLike, scores: Tensor1D|TensorLike,\n    maxOutputSize: number, iouThreshold = 0.5,\n    scoreThreshold = Number.NEGATIVE_INFINITY,\n    padToMaxOutputSize = false): Promise<NamedTensorMap> {\n  const $boxes = convertToTensor(boxes, 'boxes', 'nonMaxSuppressionAsync');\n  const $scores = convertToTensor(scores, 'scores', 'nonMaxSuppressionAsync');\n\n  const params = nonMaxSuppSanityCheck(\n      $boxes, $scores, maxOutputSize, iouThreshold, scoreThreshold,\n      null /* softNmsSigma */);\n  const $maxOutputSize = params.maxOutputSize;\n  const $iouThreshold = params.iouThreshold;\n  const $scoreThreshold = params.scoreThreshold;\n\n  const [boxesVals, scoresVals] =\n      await Promise.all([$boxes.data(), $scores.data()]);\n\n  // We call a cpu based impl directly with the typedarray data here rather\n  // than a kernel because all kernels are synchronous (and thus cannot await\n  // .data()).\n  const {selectedIndices, validOutputs} = nonMaxSuppressionV4Impl(\n      boxesVals, scoresVals, $maxOutputSize, $iouThreshold, $scoreThreshold,\n      padToMaxOutputSize);\n\n  if ($boxes !== boxes) {\n    $boxes.dispose();\n  }\n  if ($scores !== scores) {\n    $scores.dispose();\n  }\n\n  return {\n    selectedIndices: tensor1d(selectedIndices, 'int32'),\n    validOutputs: scalar(validOutputs, 'int32')\n  };\n}\n\nexport const nonMaxSuppressionPaddedAsync = nonMaxSuppressionPaddedAsync_;\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {ResizeBilinear, ResizeBilinearAttrs, ResizeBilinearInputs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\n\nimport {op} from '../operation';\nimport {reshape} from '../reshape';\n\n/**\n * Bilinear resize a single 3D image or a batch of 3D images to a new shape.\n *\n * @param images The images, of rank 4 or rank 3, of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is assumed.\n * @param size The new shape `[newHeight, newWidth]` to resize the\n *     images to. Each channel is resized individually.\n * @param alignCorners Defaults to `false`. If true, rescale\n *     input by `(new_height - 1) / (height - 1)`, which exactly aligns the 4\n *     corners of images and resized images. If false, rescale by\n *     `new_height / height`. Treat similarly the width dimension.\n * @param halfPixelCenters Defaults to `false`. Whether to assume pixel centers\n *     are at 0.5, which would make the floating point coordinates of the top\n *     left pixel 0.5, 0.5.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nfunction resizeBilinear_<T extends Tensor3D|Tensor4D>(\n    images: T|TensorLike, size: [number, number], alignCorners = false,\n    halfPixelCenters = false): T {\n  const $images = convertToTensor(images, 'images', 'resizeBilinear');\n\n  util.assert(\n      $images.rank === 3 || $images.rank === 4,\n      () => `Error in resizeBilinear: x must be rank 3 or 4, but got ` +\n          `rank ${$images.rank}.`);\n  util.assert(\n      size.length === 2,\n      () => `Error in resizeBilinear: new shape must 2D, but got shape ` +\n          `${size}.`);\n  util.assert(\n      halfPixelCenters === false || alignCorners === false,\n      () => `Error in resizeBilinear: If halfPixelCenters is true, ` +\n          `alignCorners must be false.`);\n\n  let batchImages = $images as Tensor4D;\n  let reshapedTo4D = false;\n  if ($images.rank === 3) {\n    reshapedTo4D = true;\n    batchImages = reshape(\n        $images, [1, $images.shape[0], $images.shape[1], $images.shape[2]]);\n  }\n\n  const [] = size;\n\n  const inputs: ResizeBilinearInputs = {images: batchImages};\n  const attrs: ResizeBilinearAttrs = {alignCorners, halfPixelCenters, size};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  ResizeBilinear, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n  return res;\n}\n\nexport const resizeBilinear = /* @__PURE__ */ op({resizeBilinear_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {ResizeNearestNeighbor, ResizeNearestNeighborAttrs, ResizeNearestNeighborInputs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\n\nimport {op} from '../operation';\nimport {reshape} from '../reshape';\n\n/**\n * NearestNeighbor resize a batch of 3D images to a new shape.\n *\n * @param images The images, of rank 4 or rank 3, of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is assumed.\n * @param size The new shape `[newHeight, newWidth]` to resize the\n *     images to. Each channel is resized individually.\n * @param alignCorners Defaults to False. If true, rescale\n *     input by `(new_height - 1) / (height - 1)`, which exactly aligns the 4\n *     corners of images and resized images. If false, rescale by\n *     `new_height / height`. Treat similarly the width dimension.\n * @param halfPixelCenters Defaults to `false`. Whether to assume pixels are of\n *      half the actual dimensions, and yield more accurate resizes. This flag\n *      would also make the floating point coordinates of the top left pixel\n *      0.5, 0.5.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nfunction resizeNearestNeighbor_<T extends Tensor3D|Tensor4D>(\n    images: T|TensorLike, size: [number, number], alignCorners = false,\n    halfPixelCenters = false): T {\n  const $images = convertToTensor(images, 'images', 'resizeNearestNeighbor');\n\n  util.assert(\n      $images.rank === 3 || $images.rank === 4,\n      () => `Error in resizeNearestNeighbor: x must be rank 3 or 4, but got ` +\n          `rank ${$images.rank}.`);\n  util.assert(\n      size.length === 2,\n      () =>\n          `Error in resizeNearestNeighbor: new shape must 2D, but got shape ` +\n          `${size}.`);\n  util.assert(\n      $images.dtype === 'float32' || $images.dtype === 'int32',\n      () => '`images` must have `int32` or `float32` as dtype');\n  util.assert(\n      halfPixelCenters === false || alignCorners === false,\n      () => `Error in resizeNearestNeighbor: If halfPixelCenters is true, ` +\n          `alignCorners must be false.`);\n  let batchImages = $images as Tensor4D;\n  let reshapedTo4D = false;\n  if ($images.rank === 3) {\n    reshapedTo4D = true;\n    batchImages = reshape(\n        $images, [1, $images.shape[0], $images.shape[1], $images.shape[2]]);\n  }\n  const [] = size;\n\n  const inputs: ResizeNearestNeighborInputs = {images: batchImages};\n  const attrs:\n      ResizeNearestNeighborAttrs = {alignCorners, halfPixelCenters, size};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  ResizeNearestNeighbor, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n  return res;\n}\n\nexport const resizeNearestNeighbor = /* @__PURE__ */ op({resizeNearestNeighbor_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * https://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport { Tensor1D, Tensor3D } from '../../tensor';\nimport { tensor1d } from '../tensor1d';\nimport { TensorLike } from '../../types';\nimport { op } from '../operation';\nimport { cast } from '../cast';\nimport { split } from '../split';\nimport { bincount } from '../bincount';\nimport { lessEqual } from '../less_equal';\nimport { greater } from '../greater';\nimport { sum } from '../sum';\nimport { add } from '../add';\nimport { mul } from '../mul';\nimport { div } from '../div';\nimport { sub } from '../sub';\nimport { round } from '../round';\nimport { where } from '../where';\nimport { fill } from '../fill';\nimport {slice} from '../slice';\nimport { range } from '../range';\nimport { tensor } from '../tensor';\nimport * as util from '../../util';\nimport { convertToTensor } from '../../tensor_util_env';\n\n/**\n * Performs image binarization with corresponding threshold\n * (depends on the method)value, which creates a binary image from a grayscale.\n * @param image 3d tensor of shape [imageHeight,imageWidth, depth],\n * where imageHeight and imageWidth must be positive.The image color\n * range should be [0, 255].\n * @param method Optional string from `'binary' | 'otsu'`\n * which specifies the method for thresholding. Defaults to 'binary'.\n * @param inverted Optional boolean whichspecifies\n * if colours should be inverted. Defaults to false.\n * @param threshValue Optional number which defines threshold value from 0 to 1.\n * Defaults to 0.5.\n * @return A 3d tensor of shape [imageHeight,imageWidth, depth], which\n * contains binarized image.\n */\n\nfunction threshold_(\n    image: Tensor3D | TensorLike,\n    method = 'binary',\n    inverted = false,\n    threshValue = 0.5\n): Tensor3D {\n    const $image = convertToTensor(image, 'image', 'threshold');\n\n    /* 0.2989, 0.5870, 0.1140 are represent luma coefficients in CCIR601.\n\tReference for converting between RGB and grayscale: https://en.wikipedia.org/wiki/Luma_%28video%29  */\n\n    const RED_INTENCITY_COEF = 0.2989;\n    const GREEN_INTENCITY_COEF = 0.5870;\n    const BLUE_INTENCITY_COEF = 0.1140;\n    const totalPixelsInImage = $image.shape[0] * $image.shape[1];\n\n    let $threshold = mul(tensor1d([threshValue]), 255);\n    let r, g, b, grayscale;\n\n    util.assert(\n        $image.rank === 3,\n        () => 'Error in threshold: image must be rank 3,' +\n            `but got rank ${$image.rank}.`);\n\n    util.assert(\n        $image.shape[2] === 3 || $image.shape[2]=== 1,\n        () => 'Error in threshold: ' +\n            'image color channel must be equal to 3 or 1' +\n            `but got ${$image.shape[2]}.`);\n\n    util.assert(\n      $image.dtype === 'int32' || $image.dtype === 'float32',\n      () => 'Error in dtype: image dtype must be int32 or float32,' +\n          `but got dtype ${$image.dtype}.`);\n\n    util.assert(\n      method === 'otsu' || method === 'binary',\n      () => `Method must be binary or otsu, but was ${method}`);\n\n    if ($image.shape[2] === 3) {\n        [r, g, b] = split($image, [1, 1, 1], -1);\n        const $r = mul(r,RED_INTENCITY_COEF);\n        const $g = mul(g,GREEN_INTENCITY_COEF);\n        const $b = mul(b,BLUE_INTENCITY_COEF);\n        grayscale = add(add($r, $g), $b);\n    } else {\n        grayscale = image;\n    }\n\n    if (method === 'otsu') {\n        const $histogram = bincount(cast(round(grayscale), 'int32') as Tensor1D,\n            tensor([]),\n            256);\n        $threshold = otsu($histogram, totalPixelsInImage);\n    }\n\n    const invCondition = inverted ?\n        lessEqual(grayscale, $threshold) : greater(grayscale, $threshold);\n\n    const result = cast(mul(invCondition,255), 'int32');\n\n    return result as Tensor3D;\n}\n\nfunction otsu(histogram: Tensor1D, total: number):Tensor1D {\n\n    let bestThresh = tensor1d([-1]);\n    let bestInBetVar = tensor1d([0]);\n    let cInBetVar = tensor1d([0]);\n    let classFirst, classSecond, meanFirst,\n        meanSec, weightForeground, weightBack;\n\n    for (let index = 0; index < histogram.size-1; index++) {\n\n        classFirst = slice(histogram, 0, index + 1);\n\n        classSecond = slice(histogram,index + 1);\n\n        weightForeground = div(sum(classFirst),total);\n\n        weightBack = div(sum(classSecond),total);\n\n        const meanFirstDivA = sum(mul(classFirst, range(0, classFirst.size)));\n\n        meanFirst = div(meanFirstDivA, sum(classFirst) );\n\n        const meanSecFill = fill(classSecond.shape, classFirst.size);\n        const meanSecAdd = add(range(0,classSecond.size),meanSecFill);\n        const meanSecMul = mul(classSecond, (meanSecAdd));\n        meanSec = div(sum(meanSecMul), sum(classSecond));\n\n        const cInBetVarSubA = sub(meanFirst, meanSec);\n        const cInBetVarSubB = sub(meanFirst, meanSec);\n        const cInBetVarMul = mul(weightForeground, weightBack);\n        cInBetVar = mul(mul(cInBetVarMul,cInBetVarSubA), cInBetVarSubB);\n\n        const condition = greater(cInBetVar, bestInBetVar);\n\n        bestInBetVar = where(condition, cInBetVar, bestInBetVar);\n\n        bestThresh = where(condition, tensor1d([index]), bestThresh);\n\n    }\n    return bestThresh;\n}\n\nexport const threshold = /* @__PURE__ */ op({ threshold_ });\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../../engine';\nimport {Transform, TransformAttrs, TransformInputs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor2D, Tensor4D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\n\nimport {op} from '../operation';\n\n/**\n * Applies the given transform(s) to the image(s).\n *\n * @param image 4d tensor of shape `[batch, imageHeight, imageWidth, depth]`.\n * @param transforms Projective transform matrix/matrices. A tensor1d of length\n *     8 or tensor of size N x 8. If one row of transforms is [a0, a1, a2, b0,\n *     b1, b2, c0, c1], then it maps the output point (x, y) to a transformed\n *     input point (x', y') = ((a0 x + a1 y + a2) / k, (b0 x + b1 y + b2) / k),\n *     where k = c0 x + c1 y + 1. The transforms are inverted compared to the\n *     transform mapping input points to output points.\n * @param interpolation Interpolation mode.\n *     Supported values: 'nearest', 'bilinear'. Default to 'nearest'.\n * @param fillMode Points outside the boundaries of the input are filled\n *     according to the given mode, one of 'constant', 'reflect', 'wrap',\n *     'nearest'. Default to 'constant'.\n *     'reflect': (d c b a | a b c d | d c b a ) The input is extended by\n *     reflecting about the edge of the last pixel.\n *     'constant': (k k k k | a b c d | k k k k) The input is extended by\n *     filling all values beyond the edge with the same constant value k.\n *     'wrap': (a b c d | a b c d | a b c d) The input is extended by\n *     wrapping around to the opposite edge.\n *     'nearest': (a a a a | a b c d | d d d d) The input is extended by\n *     the nearest pixel.\n * @param fillValue A float represents the value to be filled outside the\n *     boundaries when fillMode is 'constant'.\n * @param Output dimension after the transform, [height, width]. If undefined,\n *     output is the same size as input image.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nfunction transform_(\n    image: Tensor4D|TensorLike, transforms: Tensor2D|TensorLike,\n    interpolation: 'nearest'|'bilinear' = 'nearest',\n    fillMode: 'constant'|'reflect'|'wrap'|'nearest' = 'constant', fillValue = 0,\n    outputShape?: [number, number]): Tensor4D {\n  const $image = convertToTensor(image, 'image', 'transform', 'float32');\n  const $transforms =\n      convertToTensor(transforms, 'transforms', 'transform', 'float32');\n\n  util.assert(\n      $image.rank === 4,\n      () => 'Error in transform: image must be rank 4,' +\n          `but got rank ${$image.rank}.`);\n\n  util.assert(\n      $transforms.rank === 2 &&\n          ($transforms.shape[0] === $image.shape[0] ||\n           $transforms.shape[0] === 1) &&\n          $transforms.shape[1] === 8,\n      () => `Error in transform: Input transform should be batch x 8 or 1 x 8`);\n\n  util.assert(\n      outputShape == null || outputShape.length === 2,\n      () =>\n          'Error in transform: outputShape must be [height, width] or null, ' +\n          `but got ${outputShape}.`);\n\n  const inputs: TransformInputs = {image: $image, transforms: $transforms};\n  const attrs:\n      TransformAttrs = {interpolation, fillMode, fillValue, outputShape};\n\n  return ENGINE.runKernel(\n      Transform, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const transform = /* @__PURE__ */ op({transform_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Scalar, Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {assert} from '../../util';\n\nimport {greaterEqual} from '../greater_equal';\nimport {less} from '../less';\nimport {lessEqual} from '../less_equal';\nimport {logicalAnd} from '../logical_and';\nimport {minimum} from '../minimum';\nimport {neg} from '../neg';\nimport {op} from '../operation';\nimport {range} from '../range';\nimport {reshape} from '../reshape';\nimport {stack} from '../stack';\nimport {sub} from '../sub';\nimport {unstack} from '../unstack';\nimport {where} from '../where';\nimport {zeros} from '../zeros';\n\n/**\n * Copy a tensor setting everything outside a central band in each innermost\n * matrix to zero.\n *\n * The band part is computed as follows: Assume input has `k` dimensions\n * `[I, J, K, ..., M, N]`, then the output is a tensor with the same shape where\n * `band[i, j, k, ..., m, n] = in_band(m, n) * input[i, j, k, ..., m, n]`.\n * The indicator function\n * `in_band(m, n) = (num_lower < 0 || (m-n) <= num_lower)`\n * `&& (num_upper < 0 || (n-m) <= num_upper)`\n *\n * ```js\n * const x = tf.tensor2d([[ 0,  1,  2, 3],\n *                        [-1,  0,  1, 2],\n *                        [-2, -1,  0, 1],\n *                        [-3, -2, -1, 0]]);\n * let y = tf.linalg.bandPart(x, 1, -1);\n * y.print(); // [[ 0,  1,  2, 3],\n *            //  [-1,  0,  1, 2],\n *            //  [ 0, -1,  0, 1],\n *            //  [ 0, 0 , -1, 0]]\n * let z = tf.linalg.bandPart(x, 2, 1);\n * z.print(); // [[ 0,  1,  0, 0],\n *            //  [-1,  0,  1, 0],\n *            //  [-2, -1,  0, 1],\n *            //  [ 0, -2, -1, 0]]\n * ```\n *\n * @param x Rank `k` tensor\n * @param numLower Number of subdiagonals to keep.\n *   If negative, keep entire lower triangle.\n * @param numUpper Number of subdiagonals to keep.\n *   If negative, keep entire upper triangle.\n * @returns Rank `k` tensor of the same shape as input.\n *   The extracted banded tensor.\n *\n * @doc {heading:'Operations', subheading:'Linear Algebra', namespace:'linalg'}\n */\nfunction bandPart_<T extends Tensor>(\n    a: T|TensorLike, numLower: number|Scalar, numUpper: number|Scalar): T {\n  const $a = convertToTensor(a, 'a', 'bandPart');\n  assert(\n      $a.rank >= 2,\n      () => `bandPart(): Rank must be at least 2, got ${$a.rank}.`);\n\n  const shape = $a.shape;\n  const [M, N] = $a.shape.slice(-2);\n\n  let $numLower: Scalar;\n  let $numUpper: Scalar;\n  if (typeof numLower === 'number') {\n    assert(\n        numLower % 1 === 0,\n        () => `bandPart(): numLower must be an integer, got ${numLower}.`);\n    assert(\n        numLower <= M,\n        () => `bandPart(): numLower (${numLower})` +\n            ` must not be greater than the number of rows (${M}).`);\n    $numLower =\n        convertToTensor(numLower < 0 ? M : numLower, 'numLower', 'bandPart') as\n        Scalar;\n  } else {\n    assert(\n        numLower.dtype === 'int32',\n        () => `bandPart(): numLower's dtype must be an int32.`);\n    // If numLower is a Scalar, checking `numLower <= M` could hurt performance,\n    // but minimum(numLower, M) could avoid unexpected results.\n    $numLower = where(less(numLower, 0), M, minimum(numLower, M)) as Scalar;\n  }\n\n  if (typeof numUpper === 'number') {\n    assert(\n        numUpper % 1 === 0,\n        () => `bandPart(): numUpper must be an integer, got ${numUpper}.`);\n    assert(\n        numUpper <= N,\n        () => `bandPart(): numUpper (${numUpper})` +\n            ` must not be greater than the number of columns (${N}).`);\n    $numUpper =\n        convertToTensor(numUpper < 0 ? N : numUpper, 'numUpper', 'bandPart') as\n        Scalar;\n  } else {\n    assert(\n        numUpper.dtype === 'int32',\n        () => `bandPart(): numUpper's dtype must be an int32.`);\n    $numUpper = where(less(numUpper, 0), N, minimum(numUpper, N)) as Scalar;\n  }\n\n  const i = reshape(range(0, M, 1, 'int32'), [-1, 1]);\n  const j = range(0, N, 1, 'int32');\n  const ij = sub(i, j);\n\n  const inBand =\n      logicalAnd(lessEqual(ij, $numLower), greaterEqual(ij, neg($numUpper)));\n\n  const zero = zeros([M, N], $a.dtype);\n\n  return reshape(\n             stack(unstack(reshape($a, [-1, M, N]))\n                       .map(mat => where(inBand, mat, zero))),\n             shape) as T;\n}\n\nexport const bandPart = /* @__PURE__ */ op({bandPart_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {Tensor1D, Tensor2D} from '../../tensor';\nimport {assert} from '../../util';\n\nimport {div} from '../div';\nimport {mul} from '../mul';\nimport {norm} from '../norm';\nimport {op} from '../operation';\nimport {split} from '../split';\nimport {squeeze} from '../squeeze';\nimport {stack} from '../stack';\nimport {sub} from '../sub';\nimport {sum} from '../sum';\n\n/**\n * Gram-Schmidt orthogonalization.\n *\n * ```js\n * const x = tf.tensor2d([[1, 2], [3, 4]]);\n * let y = tf.linalg.gramSchmidt(x);\n * y.print();\n * console.log('Orthogonalized:');\n * y.dot(y.transpose()).print();  // should be nearly the identity matrix.\n * console.log('First row direction maintained:');\n * const data = await y.array();\n * console.log(data[0][1] / data[0][0]);  // should be nearly 2.\n * ```\n *\n * @param xs The vectors to be orthogonalized, in one of the two following\n *   formats:\n *   - An Array of `tf.Tensor1D`.\n *   - A `tf.Tensor2D`, i.e., a matrix, in which case the vectors are the rows\n *     of `xs`.\n *   In each case, all the vectors must have the same length and the length\n *   must be greater than or equal to the number of vectors.\n * @returns The orthogonalized and normalized vectors or matrix.\n *   Orthogonalization means that the vectors or the rows of the matrix\n *   are orthogonal (zero inner products). Normalization means that each\n *   vector or each row of the matrix has an L2 norm that equals `1`.\n *\n * @doc {heading:'Operations', subheading:'Linear Algebra', namespace:'linalg'}\n */\nfunction gramSchmidt_(xs: Tensor1D[]|Tensor2D): Tensor1D[]|Tensor2D {\n  let inputIsTensor2D: boolean;\n  if (Array.isArray(xs)) {\n    inputIsTensor2D = false;\n    assert(\n        xs != null && xs.length > 0,\n        () => 'Gram-Schmidt process: input must not be null, undefined, or ' +\n            'empty');\n    const dim = xs[0].shape[0];\n    for (let i = 1; i < xs.length; ++i) {\n      assert(\n          xs[i].shape[0] === dim,\n          () =>\n              'Gram-Schmidt: Non-unique lengths found in the input vectors: ' +\n              `(${(xs as Tensor1D[])[i].shape[0]} vs. ${dim})`);\n    }\n  } else {\n    inputIsTensor2D = true;\n    xs = split(xs, xs.shape[0], 0).map(x => squeeze(x, [0]));\n  }\n\n  assert(\n      xs.length <= xs[0].shape[0],\n      () => `Gram-Schmidt: Number of vectors (${\n                (xs as Tensor1D[]).length}) exceeds ` +\n          `number of dimensions (${(xs as Tensor1D[])[0].shape[0]}).`);\n\n  const ys: Tensor1D[] = [];\n  const xs1d = xs;\n  for (let i = 0; i < xs.length; ++i) {\n    ys.push(ENGINE.tidy(() => {\n      let x = xs1d[i];\n      if (i > 0) {\n        for (let j = 0; j < i; ++j) {\n          const proj = mul(sum(mul(ys[j], x)), ys[j]);\n          x = sub(x, proj);\n        }\n      }\n      return div(x, norm(x, 'euclidean'));\n    }));\n  }\n\n  if (inputIsTensor2D) {\n    return stack(ys, 0) as Tensor2D;\n  } else {\n    return ys;\n  }\n}\n\nexport const gramSchmidt = /* @__PURE__ */ op({gramSchmidt_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../../engine';\nimport {dispose} from '../../globals';\nimport {Tensor, Tensor2D} from '../../tensor';\nimport {assert} from '../../util';\n\nimport {clone} from '../clone';\nimport {concat} from '../concat';\nimport {div} from '../div';\nimport {eye} from '../eye';\nimport {greater} from '../greater';\nimport {matMul} from '../mat_mul';\nimport {mul} from '../mul';\nimport {neg} from '../neg';\nimport {norm} from '../norm';\nimport {op} from '../operation';\nimport {reshape} from '../reshape';\nimport {slice} from '../slice';\nimport {stack} from '../stack';\nimport {sub} from '../sub';\nimport {tensor2d} from '../tensor2d';\nimport {transpose} from '../transpose';\nimport {unstack} from '../unstack';\nimport {where} from '../where';\n\n/**\n * Compute QR decomposition of m-by-n matrix using Householder transformation.\n *\n * Implementation based on\n *   [http://www.cs.cornell.edu/~bindel/class/cs6210-f09/lec18.pdf]\n * (http://www.cs.cornell.edu/~bindel/class/cs6210-f09/lec18.pdf)\n *\n * ```js\n * const a = tf.tensor2d([[1, 2], [3, 4]]);\n * let [q, r] = tf.linalg.qr(a);\n * console.log('Q');\n * q.print();\n * console.log('R');\n * r.print();\n * console.log('Orthogonalized');\n * q.dot(q.transpose()).print()  // should be nearly the identity matrix.\n * console.log('Reconstructed');\n * q.dot(r).print(); // should be nearly [[1, 2], [3, 4]];\n * ```\n *\n * @param x The `tf.Tensor` to be QR-decomposed. Must have rank >= 2. Suppose\n *   it has the shape `[..., M, N]`.\n * @param fullMatrices An optional boolean parameter. Defaults to `false`.\n *   If `true`, compute full-sized `Q`. If `false` (the default),\n *   compute only the leading N columns of `Q` and `R`.\n * @returns An `Array` of two `tf.Tensor`s: `[Q, R]`. `Q` is a unitary matrix,\n *   i.e., its columns all have unit norm and are mutually orthogonal.\n *   If `M >= N`,\n *     If `fullMatrices` is `false` (default),\n *       - `Q` has a shape of `[..., M, N]`,\n *       - `R` has a shape of `[..., N, N]`.\n *     If `fullMatrices` is `true` (default),\n *       - `Q` has a shape of `[..., M, M]`,\n *       - `R` has a shape of `[..., M, N]`.\n *   If `M < N`,\n *     - `Q` has a shape of `[..., M, M]`,\n *     - `R` has a shape of `[..., M, N]`.\n * @throws If the rank of `x` is less than 2.\n *\n * @doc {heading:'Operations',\n *       subheading:'Linear Algebra',\n *       namespace:'linalg'}\n */\nfunction qr_(x: Tensor, fullMatrices = false): [Tensor, Tensor] {\n  assert(\n      x.rank >= 2,\n      () => `qr() requires input tensor to have a rank >= 2, but got rank ${\n          x.rank}`);\n\n  if (x.rank === 2) {\n    return qr2d(x as Tensor2D, fullMatrices);\n  } else {\n    // Rank > 2.\n    // TODO(cais): Below we split the input into individual 2D tensors,\n    //   perform QR decomposition on them and then stack the results back\n    //   together. We should explore whether this can be parallelized.\n    const outerDimsProd = x.shape.slice(0, x.shape.length - 2)\n                              .reduce((value, prev) => value * prev);\n    const x2ds = unstack(\n        reshape(\n            x,\n            [\n              outerDimsProd, x.shape[x.shape.length - 2],\n              x.shape[x.shape.length - 1]\n            ]),\n        0);\n    const q2ds: Tensor2D[] = [];\n    const r2ds: Tensor2D[] = [];\n    x2ds.forEach(x2d => {\n      const [q2d, r2d] = qr2d(x2d as Tensor2D, fullMatrices);\n      q2ds.push(q2d);\n      r2ds.push(r2d);\n    });\n    const q = reshape(stack(q2ds, 0), x.shape);\n    const r = reshape(stack(r2ds, 0), x.shape);\n    return [q, r];\n  }\n}\n\nfunction qr2d(x: Tensor2D, fullMatrices = false): [Tensor2D, Tensor2D] {\n  return ENGINE.tidy(() => {\n    assert(\n        x.shape.length === 2,\n        () => `qr2d() requires a 2D Tensor, but got a ${\n            x.shape.length}D Tensor.`);\n\n    const m = x.shape[0];\n    const n = x.shape[1];\n\n    let q = eye(m);    // Orthogonal transform so far.\n    let r = clone(x);  // Transformed matrix so far.\n\n    const one2D = tensor2d([[1]], [1, 1]);\n    let w: Tensor2D = clone(one2D);\n\n    const iters = m >= n ? n : m;\n    for (let j = 0; j < iters; ++j) {\n      // This tidy within the for-loop ensures we clean up temporary\n      // tensors as soon as they are no longer needed.\n      const rTemp = r;\n      const wTemp = w;\n      const qTemp = q;\n      [w, r, q] = ENGINE.tidy((): [Tensor2D, Tensor2D, Tensor2D] => {\n        // Find H = I - tau * w * w', to put zeros below R(j, j).\n        const rjEnd1 = slice(r, [j, j], [m - j, 1]);\n        const normX = norm(rjEnd1);\n        const rjj = slice(r, [j, j], [1, 1]);\n\n        // The sign() function returns 0 on 0, which causes division by zero.\n        const s = where(greater(rjj, 0), tensor2d([[-1]]), tensor2d([[1]]));\n\n        const u1 = sub(rjj, mul(s, normX));\n        const wPre = div(rjEnd1, u1);\n        if (wPre.shape[0] === 1) {\n          w = clone(one2D);\n        } else {\n          w = concat(\n              [\n                one2D,\n                slice(wPre, [1, 0], [wPre.shape[0] - 1, wPre.shape[1]]) as\n                    Tensor2D\n              ],\n              0);\n        }\n        const tau = neg(div(matMul(s, u1), normX)) as Tensor2D;\n\n        // -- R := HR, Q := QH.\n        const rjEndAll = slice(r, [j, 0], [m - j, n]);\n        const tauTimesW: Tensor2D = mul(tau, w);\n        const wT: Tensor2D = transpose(w);\n        if (j === 0) {\n          r = sub(rjEndAll, matMul(tauTimesW, matMul(wT, rjEndAll)));\n        } else {\n          const rTimesTau: Tensor2D =\n              sub(rjEndAll, matMul(tauTimesW, matMul(wT, rjEndAll)));\n          r = concat([slice(r, [0, 0], [j, n]), rTimesTau], 0);\n        }\n        const tawTimesWT: Tensor2D = transpose(tauTimesW);\n        const qAllJEnd = slice(q, [0, j], [m, q.shape[1] - j]);\n        if (j === 0) {\n          q = sub(qAllJEnd, matMul(matMul(qAllJEnd, w), tawTimesWT));\n        } else {\n          const qTimesTau: Tensor2D =\n              sub(qAllJEnd, matMul(matMul(qAllJEnd, w), tawTimesWT));\n          q = concat([slice(q, [0, 0], [m, j]), qTimesTau], 1);\n        }\n        return [w, r, q];\n      });\n      dispose([rTemp, wTemp, qTemp]);\n    }\n\n    if (!fullMatrices && m > n) {\n      q = slice(q, [0, 0], [m, n]);\n      r = slice(r, [0, 0], [n, n]);\n    }\n\n    return [q, r];\n  }) as [Tensor2D, Tensor2D];\n}\n\nexport const qr = /* @__PURE__ */ op({qr_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nexport enum Reduction {\n  NONE,\n  MEAN,\n  SUM,\n  SUM_BY_NONZERO_WEIGHTS\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\n\nimport {cast} from '../cast';\nimport {div} from '../div';\nimport {Reduction} from '../loss_ops_utils';\nimport {mean} from '../mean';\nimport {mul} from '../mul';\nimport {notEqual} from '../not_equal';\nimport {ones} from '../ones';\nimport {op} from '../operation';\nimport {scalar} from '../scalar';\nimport {sum} from '../sum';\n\n/**\n * Computes the weighted loss between two tensors.\n *\n * @param losses Tensor of shape `[batch_size, d1, ..., dN]`.\n * @param weights Tensor whose rank is either 0, or the same rank as\n *    `losses`, and must be broadcastable to `losses` (i.e., all\n *    dimensions must be either `1`, or the same as the corresponding\n *    `losses` dimension).\n *\n * @doc {heading: 'Training', subheading: 'Losses', namespace: 'losses'}\n */\nfunction computeWeightedLoss_<T extends Tensor, O extends Tensor>(\n    losses: T|TensorLike, weights?: Tensor|TensorLike,\n    reduction = Reduction.SUM_BY_NONZERO_WEIGHTS): O {\n  const $losses = convertToTensor(losses, 'losses', 'computeWeightedLoss');\n  let $weights: Tensor = null;\n  if (weights != null) {\n    $weights = convertToTensor(weights, 'weights', 'computeWeightedLoss');\n  }\n\n  const weightedLoss = ($weights == null) ? $losses : mul($losses, $weights);\n\n  if (reduction === Reduction.NONE) {\n    return weightedLoss as O;\n  }\n  if (reduction === Reduction.SUM) {\n    return sum(weightedLoss);\n  }\n  if (reduction === Reduction.MEAN) {\n    if ($weights == null) {\n      return mean(weightedLoss);\n    } else {\n      const broadcastFactor = $losses.size / $weights.size;\n      const result = div(sum(weightedLoss), sum($weights));\n      return broadcastFactor > 1 ? div(result, scalar(broadcastFactor)) :\n                                   result as O;\n    }\n  }\n  if (reduction === Reduction.SUM_BY_NONZERO_WEIGHTS) {\n    if ($weights == null) {\n      return div(sum(weightedLoss), scalar($losses.size));\n    } else {\n      const broadcastedWeights = mul($weights, ones($losses.shape));\n\n      const numNonZeros =\n          cast(sum(notEqual(broadcastedWeights, scalar(0))), 'float32');\n      return div(sum(weightedLoss), numNonZeros);\n    }\n  }\n\n  throw Error(`Unknown reduction: ${reduction}`);\n}\nexport const computeWeightedLoss = /* @__PURE__ */ op({computeWeightedLoss_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {assertShapesMatch} from '../../util';\nimport {abs} from '../abs';\nimport {Reduction} from '../loss_ops_utils';\nimport {op} from '../operation';\nimport {sub} from '../sub';\n\nimport {computeWeightedLoss} from './compute_weighted_loss';\n\n/**\n * Computes the absolute difference loss between two tensors.\n *\n * @param labels The ground truth output tensor, same dimensions as\n *    'predictions'.\n * @param predictions The predicted outputs.\n * @param weights Tensor whose rank is either 0, or the same rank as\n *    `labels`, and must be broadcastable to `labels` (i.e., all dimensions\n *    must be either `1`, or the same as the corresponding `losses`\n *    dimension).\n * @param reduction Type of reduction to apply to loss. Should be of type\n *    `Reduction`\n *\n * @doc {heading: 'Training', subheading: 'Losses', namespace: 'losses'}\n */\nfunction absoluteDifference_<T extends Tensor, O extends Tensor>(\n    labels: T|TensorLike, predictions: T|TensorLike,\n    weights?: Tensor|TensorLike,\n    reduction = Reduction.SUM_BY_NONZERO_WEIGHTS): O {\n  const $labels = convertToTensor(labels, 'labels', 'absoluteDifference');\n  const $predictions =\n      convertToTensor(predictions, 'predictions', 'absoluteDifference');\n  let $weights: Tensor = null;\n  if (weights != null) {\n    $weights = convertToTensor(weights, 'weights', 'absoluteDifference');\n  }\n  assertShapesMatch(\n      $labels.shape, $predictions.shape, 'Error in absoluteDifference: ');\n\n  const losses = abs(sub($labels, $predictions));\n  return computeWeightedLoss(losses, $weights, reduction);\n}\n\nexport const absoluteDifference = /* @__PURE__ */ op({absoluteDifference_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {assertShapesMatch} from '../../util';\nimport {Reduction} from '../loss_ops_utils';\nimport {mul} from '../mul';\nimport {op} from '../operation';\nimport {scalar} from '../scalar';\nimport {sub} from '../sub';\nimport {sum} from '../sum';\n\nimport {computeWeightedLoss} from './compute_weighted_loss';\n\n/**\n * Computes the cosine distance loss between two tensors.\n *\n * @param labels The ground truth output tensor, same dimensions as\n *    'predictions'.\n * @param predictions The predicted outputs.\n * @param axis The dimension along which the cosine distance is computed.\n * @param weights Tensor whose rank is either 0, or the same rank as\n *    `labels`, and must be broadcastable to `labels` (i.e., all dimensions\n *    must be either `1`, or the same as the corresponding `losses`\n *    dimension).\n * @param reduction Type of reduction to apply to loss. Should be of type\n *    `Reduction`\n *\n * @doc {heading: 'Training', subheading: 'Losses', namespace: 'losses'}\n */\nfunction cosineDistance_<T extends Tensor, O extends Tensor>(\n    labels: T|TensorLike, predictions: T|TensorLike, axis: number,\n    weights?: Tensor|TensorLike,\n    reduction = Reduction.SUM_BY_NONZERO_WEIGHTS): O {\n  const $labels = convertToTensor(labels, 'labels', 'cosineDistance');\n  const $predictions =\n      convertToTensor(predictions, 'predictions', 'cosineDistance');\n  let $weights: Tensor = null;\n  if (weights != null) {\n    $weights = convertToTensor(weights, 'weights', 'cosineDistance');\n  }\n  assertShapesMatch(\n      $labels.shape, $predictions.shape, 'Error in cosineDistance: ');\n\n  const one = scalar(1);\n  const losses = sub(one, sum(mul($labels, $predictions), axis, true));\n  return computeWeightedLoss(losses, $weights, reduction);\n}\nexport const cosineDistance = /* @__PURE__ */ op({cosineDistance_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {assertShapesMatch} from '../../util';\nimport {Reduction} from '../loss_ops_utils';\nimport {mul} from '../mul';\nimport {op} from '../operation';\nimport {relu} from '../relu';\nimport {scalar} from '../scalar';\nimport {sub} from '../sub';\n\nimport {computeWeightedLoss} from './compute_weighted_loss';\n\n/**\n * Computes the Hinge loss between two tensors.\n *\n * @param labels The ground truth output tensor, same dimensions as\n *    'predictions'.\n * @param predictions The predicted outputs.\n * @param weights Tensor whose rank is either 0, or the same rank as\n *    `labels`, and must be broadcastable to `labels` (i.e., all dimensions\n *    must be either `1`, or the same as the corresponding `losses`\n *    dimension).\n * @param reduction Type of reduction to apply to loss. Should be of type\n *    `Reduction`\n *\n * @doc {heading: 'Training', subheading: 'Losses', namespace: 'losses'}\n */\nfunction hingeLoss_<T extends Tensor, O extends Tensor>(\n    labels: T|TensorLike, predictions: T|TensorLike,\n    weights?: Tensor|TensorLike,\n    reduction = Reduction.SUM_BY_NONZERO_WEIGHTS): O {\n  let $labels = convertToTensor(labels, 'labels', 'hingeLoss');\n  const $predictions = convertToTensor(predictions, 'predictions', 'hingeLoss');\n  let $weights: Tensor = null;\n  if (weights != null) {\n    $weights = convertToTensor(weights, 'weights', 'hingeLoss');\n  }\n  assertShapesMatch($labels.shape, $predictions.shape, 'Error in hingeLoss: ');\n\n  const one = scalar(1);\n  // Convert binary labels to (-1, 1)\n  $labels = sub(mul(scalar(2), $labels), one);\n  const losses = relu(sub(one, mul($labels, $predictions)));\n  return computeWeightedLoss(losses, $weights, reduction);\n}\nexport const hingeLoss = /* @__PURE__ */ op({hingeLoss_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {assertShapesMatch} from '../../util';\nimport {abs} from '../abs';\nimport {add} from '../add';\nimport {Reduction} from '../loss_ops_utils';\nimport {minimum} from '../minimum';\nimport {mul} from '../mul';\nimport {op} from '../operation';\nimport {scalar} from '../scalar';\nimport {square} from '../square';\nimport {sub} from '../sub';\n\nimport {computeWeightedLoss} from './compute_weighted_loss';\n\n/**\n * Computes the Huber loss between two tensors.\n *\n * @param labels The ground truth output tensor, same dimensions as\n *    'predictions'.\n * @param predictions The predicted outputs.\n * @param weights Tensor whose rank is either 0, or the same rank as\n *    `labels`, and must be broadcastable to `labels` (i.e., all dimensions\n *    must be either `1`, or the same as the corresponding `losses`\n *    dimension).\n * @param delta Point where Huber loss changes from quadratic to linear.\n * @param reduction Type of reduction to apply to loss. Should be of type\n *    `Reduction`.\n *\n * @doc {heading: 'Training', subheading: 'Losses', namespace: 'losses'}\n */\nfunction huberLoss_<T extends Tensor, O extends Tensor>(\n    labels: T|TensorLike, predictions: T|TensorLike,\n    weights?: Tensor|TensorLike, delta = 1.0,\n    reduction = Reduction.SUM_BY_NONZERO_WEIGHTS): O {\n  const $labels = convertToTensor(labels, 'labels', 'huberLoss');\n  const $predictions = convertToTensor(predictions, 'predictions', 'huberLoss');\n  let $weights: Tensor = null;\n  if (weights != null) {\n    $weights = convertToTensor(weights, 'weights', 'huberLoss');\n  }\n  assertShapesMatch($labels.shape, $predictions.shape, 'Error in huberLoss: ');\n\n  const deltaScalar = scalar(delta);\n  const error = abs(sub($predictions, $labels));\n  const quadratic = minimum(error, deltaScalar);\n  const linear = sub(error, quadratic);\n\n  const losses =\n      add(mul(scalar(0.5), square(quadratic)), mul(deltaScalar, linear));\n  return computeWeightedLoss(losses, $weights, reduction);\n}\nexport const huberLoss = /* @__PURE__ */ op({huberLoss_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {assertShapesMatch} from '../../util';\nimport {add} from '../add';\nimport {log} from '../log';\nimport {Reduction} from '../loss_ops_utils';\nimport {mul} from '../mul';\nimport {neg} from '../neg';\nimport {op} from '../operation';\nimport {scalar} from '../scalar';\nimport {sub} from '../sub';\n\nimport {computeWeightedLoss} from './compute_weighted_loss';\n\n/**\n * Computes the log loss between two tensors.\n *\n * @param labels The ground truth output tensor, same dimensions as\n *    'predictions'.\n * @param predictions The predicted outputs.\n * @param weights Tensor whose rank is either 0, or the same rank as\n *    `labels`, and must be broadcastable to `labels` (i.e., all dimensions\n *    must be either `1`, or the same as the corresponding `losses`\n *    dimension).\n * @param epsilon A small increment to avoid taking log of zero\n * @param reduction Type of reduction to apply to loss. Should be of type\n *    `Reduction`\n *\n * @doc {heading: 'Training', subheading: 'Losses', namespace: 'losses'}\n */\nfunction logLoss_<T extends Tensor, O extends Tensor>(\n    labels: T|TensorLike, predictions: T|TensorLike,\n    weights?: Tensor|TensorLike, epsilon = 1e-7,\n    reduction = Reduction.SUM_BY_NONZERO_WEIGHTS): O {\n  const $labels = convertToTensor(labels, 'labels', 'logLoss');\n  const $predictions = convertToTensor(predictions, 'predictions', 'logLoss');\n  let $weights: Tensor = null;\n  if (weights != null) {\n    $weights = convertToTensor(weights, 'weights', 'logLoss');\n  }\n  assertShapesMatch($labels.shape, $predictions.shape, 'Error in logLoss: ');\n\n  const one = scalar(1);\n  const epsilonScalar = scalar(epsilon);\n\n  const l1 = neg(mul($labels, log(add($predictions, epsilonScalar))));\n  const l2 =\n      mul(sub(one, $labels), log(add(sub(one, $predictions), epsilonScalar)));\n  const losses = sub(l1, l2);\n  return computeWeightedLoss(losses, $weights, reduction);\n}\nexport const logLoss = /* @__PURE__ */ op({logLoss_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {assertShapesMatch} from '../../util';\nimport {Reduction} from '../loss_ops_utils';\nimport {op} from '../operation';\nimport {squaredDifference} from '../squared_difference';\n\nimport {computeWeightedLoss} from './compute_weighted_loss';\n\n/**\n * Computes the mean squared error between two tensors.\n *\n * @param labels The ground truth output tensor, same dimensions as\n *    'predictions'.\n * @param predictions The predicted outputs.\n * @param weights Tensor whose rank is either 0, or the same rank as\n *    `labels`, and must be broadcastable to `labels` (i.e., all dimensions\n *    must be either `1`, or the same as the corresponding `losses`\n *    dimension).\n * @param reduction Type of reduction to apply to loss. Should be of type\n *    `Reduction`\n *\n * @doc {heading: 'Training', subheading: 'Losses', namespace: 'losses'}\n */\nfunction meanSquaredError_<T extends Tensor, O extends Tensor>(\n    labels: T|TensorLike, predictions: T|TensorLike,\n    weights?: Tensor|TensorLike,\n    reduction = Reduction.SUM_BY_NONZERO_WEIGHTS): O {\n  const $labels = convertToTensor(labels, 'labels', 'meanSquaredError');\n  const $predictions =\n      convertToTensor(predictions, 'predictions', 'meanSquaredError');\n  let $weights: Tensor = null;\n  if (weights != null) {\n    $weights = convertToTensor(weights, 'weights', 'meanSquaredError');\n  }\n  assertShapesMatch(\n      $labels.shape, $predictions.shape, 'Error in meanSquaredError: ');\n\n  const losses = squaredDifference($labels, $predictions);\n  return computeWeightedLoss(losses, $weights, reduction);\n}\nexport const meanSquaredError = /* @__PURE__ */ op({meanSquaredError_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {assertShapesMatch} from '../../util';\nimport {abs} from '../abs';\nimport {add} from '../add';\nimport {exp} from '../exp';\nimport {log1p} from '../log1p';\nimport {Reduction} from '../loss_ops_utils';\nimport {mul} from '../mul';\nimport {neg} from '../neg';\nimport {op} from '../operation';\nimport {relu} from '../relu';\nimport {scalar} from '../scalar';\nimport {sub} from '../sub';\n\nimport {computeWeightedLoss} from './compute_weighted_loss';\n\nfunction sigmoidCrossEntropyWithLogits_<T extends Tensor, O extends Tensor>(\n    labels: T|TensorLike, logits: T|TensorLike): O {\n  const $labels =\n      convertToTensor(labels, 'labels', 'sigmoidCrossEntropyWithLogits');\n  const $logits =\n      convertToTensor(logits, 'logits', 'sigmoidCrossEntropyWithLogits');\n  assertShapesMatch(\n      $labels.shape, $logits.shape, 'Error in sigmoidCrossEntropyWithLogits: ');\n\n  /**\n   * Implementation Details:\n   *\n   * For brevity, let `x = logits`, `z = labels`.  The logistic loss is\n   *     z * -log(sigmoid(x)) + (1 - z) * -log(1 - sigmoid(x))\n   *   = z * -log(1 / (1 + exp(-x))) + (1 - z) * -log(exp(-x) / (1 + exp(-x)))\n   *   = z * log(1 + exp(-x)) + (1 - z) * (-log(exp(-x)) + log(1 + exp(-x)))\n   *   = z * log(1 + exp(-x)) + (1 - z) * (x + log(1 + exp(-x))\n   *   = (1 - z) * x + log(1 + exp(-x))\n   *   = x - x * z + log(1 + exp(-x))\n   *\n   *   For x < 0, to avoid overflow in exp(-x), we reformulate the above\n   *     x - x * z + log(1 + exp(-x))\n   *   = log(exp(x)) - x * z + log(1 + exp(-x))\n   *   = - x * z + log(1 + exp(x))\n   *\n   * Hence, to ensure stability and avoid overflow, the implementation uses\n   * this equivalent formulation:\n   *     max(x, 0) - x * z + log(1 + exp(-abs(x)))\n   */\n  const maxOutput = relu($logits);\n  const outputXTarget = mul($logits, $labels);\n  const sigmoidOutput = log1p(exp(neg(abs($logits))));\n\n  return add(sub(maxOutput, outputXTarget), sigmoidOutput);\n}\n\n/**\n * Computes the sigmoid cross entropy loss between two tensors.\n *\n * If labelSmoothing is nonzero, smooth the labels towards 1/2:\n *\n *   newMulticlassLabels = multiclassLabels * (1 - labelSmoothing)\n *                         + 0.5 * labelSmoothing\n *\n * @param multiClassLabels The ground truth output tensor of shape\n * [batch_size, num_classes], same dimensions as 'predictions'.\n * @param logits The predicted outputs.\n * @param weights Tensor whose rank is either 0, or the same rank as\n *    `labels`, and must be broadcastable to `labels` (i.e., all dimensions\n *    must be either `1`, or the same as the corresponding `losses`\n *    dimension).\n * @param labelSmoothing If greater than 0, then smooth the labels.\n * @param reduction Type of reduction to apply to loss. Should be of type\n *    `Reduction`\n *\n * @doc { heading: 'Training', subheading: 'Losses', namespace: 'losses' }\n */\nfunction sigmoidCrossEntropy_<T extends Tensor, O extends Tensor>(\n    multiClassLabels: T|TensorLike, logits: T|TensorLike,\n    weights?: Tensor|TensorLike, labelSmoothing = 0,\n    reduction = Reduction.SUM_BY_NONZERO_WEIGHTS): O {\n  let $multiClassLabels = convertToTensor(\n      multiClassLabels, 'multiClassLabels', 'sigmoidCrossEntropy');\n  const $logits = convertToTensor(logits, 'logits', 'sigmoidCrossEntropy');\n  let $weights: Tensor = null;\n  if (weights != null) {\n    $weights = convertToTensor(weights, 'weights', 'sigmoidCrossEntropy');\n  }\n  assertShapesMatch(\n      $multiClassLabels.shape, $logits.shape, 'Error in sigmoidCrossEntropy: ');\n\n  if (labelSmoothing > 0) {\n    const labelSmoothingScalar = scalar(labelSmoothing);\n    const one = scalar(1);\n    const half = scalar(0.5);\n\n    $multiClassLabels =\n        add(mul($multiClassLabels, sub(one, labelSmoothingScalar)),\n            mul(half, labelSmoothingScalar));\n  }\n  const losses = sigmoidCrossEntropyWithLogits_($multiClassLabels, $logits);\n\n  return computeWeightedLoss(losses, $weights, reduction);\n}\n\nexport const sigmoidCrossEntropy = /* @__PURE__ */ op({sigmoidCrossEntropy_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {customGrad} from '../../gradients';\nimport {Tensor} from '../../tensor';\nimport {GradSaveFunc} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {assertShapesMatch} from '../../util';\nimport {add} from '../add';\nimport {expandShapeToKeepDim} from '../axis_util';\nimport {cast} from '../cast';\nimport {div} from '../div';\nimport {exp} from '../exp';\nimport {logSumExp} from '../log_sum_exp';\nimport {Reduction} from '../loss_ops_utils';\nimport {mul} from '../mul';\nimport {neg} from '../neg';\nimport {op} from '../operation';\nimport {reshape} from '../reshape';\nimport {scalar} from '../scalar';\nimport {sub} from '../sub';\nimport {sum} from '../sum';\n\nimport {computeWeightedLoss} from './compute_weighted_loss';\n\n/**\n * Computes softmax cross entropy between logits and labels.\n *\n * Measures the probability error in discrete classification tasks in which\n * the classes are mutually exclusive (each entry is in exactly one class).\n * For example, each CIFAR-10 image is labeled with one and only one label: an\n * image can be a dog or a truck, but not both.\n *\n * `NOTE`: While the classes are mutually exclusive, their probabilities need\n * not be. All that is required is that each row of labels is a valid\n * probability distribution. If they are not, the computation of the gradient\n * will be incorrect.\n *\n * `WARNING`: This op expects unscaled logits, since it performs a softmax on\n * logits internally for efficiency. Do not call this op with the output of\n * softmax, as it will produce incorrect results.\n *\n * logits and labels must have the same shape, e.g. [batch_size, num_classes]\n * and the same dtype.\n * @param labels The labels array.\n * @param logits The logits array.\n * @param dim The dimension softmax would be performed on. Defaults to `-1`\n *     which indicates the last dimension.\n */\nfunction softmaxCrossEntropyWithLogits_<T extends Tensor, O extends Tensor>(\n    labels: T, logits: T, dim = -1): O {\n  if (dim === -1) {\n    dim = logits.rank - 1;\n  }\n\n  if (dim !== logits.rank - 1) {\n    throw Error(\n        `Softmax cross entropy along a non-last dimension is not yet ` +\n        `supported. Labels / logits was rank ${logits.rank} ` +\n        `and dim was ${dim}`);\n  }\n  // Use a custom gradient for numerical stability.\n  const customOp =\n      customGrad((labels: Tensor, logits: Tensor, save: GradSaveFunc) => {\n        // Reference:\n        //   1. http://cs231n.github.io/linear-classify/#softmax\n        //   2. https://blog.feedly.com/tricks-of-the-trade-logsumexp/\n        const keepDims = true;\n        const lse = logSumExp(logits, [dim], keepDims);\n        const logResult = sub(cast(logits, 'float32'), lse);\n        save([labels, logResult]);\n\n        const costVector = neg(mul(logResult, labels));\n        const value: O = sum(costVector, [dim]);\n\n        const gradFunc = (dy: O, saved: Tensor[]) => {\n          const [labels, logResult] = saved;\n          const dyShape = expandShapeToKeepDim(dy.shape, [dim]);\n          return [\n            mul(reshape(dy, dyShape),\n                sub(cast(labels, 'float32'), exp(logResult))),\n            mul(reshape(dy, dyShape),\n                sub(exp(logResult), cast(labels, 'float32'))),\n          ];\n        };\n        return {value, gradFunc};\n      });\n\n  return customOp(labels, logits);\n}\n\n/**\n * Computes the softmax cross entropy loss between two tensors.\n *\n * If labelSmoothing is nonzero, smooth the labels towards 1/2:\n *\n *   newOnehotLabels = onehotLabels * (1 - labelSmoothing)\n *                         + labelSmoothing / numClasses\n *\n * @param onehotLabels One hot encoded labels\n *    [batch_size, num_classes], same dimensions as 'predictions'.\n * @param logits The predicted outputs.\n * @param weights Tensor whose rank is either 0, or 1, and must be\n *    broadcastable to `loss`  of shape [batch_size]\n * @param labelSmoothing If greater than 0, then smooth the labels.\n * @param reduction Type of reduction to apply to loss. Should be of type\n *    `Reduction`\n *\n * @doc { heading: 'Training', subheading: 'Losses', namespace: 'losses' }\n */\nfunction softmaxCrossEntropy_<T extends Tensor, O extends Tensor>(\n    onehotLabels: T|TensorLike, logits: T|TensorLike,\n    weights?: Tensor|TensorLike, labelSmoothing = 0,\n    reduction = Reduction.SUM_BY_NONZERO_WEIGHTS): O {\n  let $onehotLabels =\n      convertToTensor(onehotLabels, 'onehotLabels', 'softmaxCrossEntropy');\n  const $logits = convertToTensor(logits, 'logits', 'softmaxCrossEntropy');\n  let $weights: Tensor = null;\n\n  if (weights != null) {\n    $weights = convertToTensor(weights, 'weights', 'softmaxCrossEntropy');\n  }\n\n  assertShapesMatch(\n      $onehotLabels.shape, $logits.shape, 'Error in softmaxCrossEntropy: ');\n\n  if (labelSmoothing > 0) {\n    const labelSmoothingScalar = scalar(labelSmoothing);\n    const one = scalar(1);\n    const numClasses = scalar($onehotLabels.shape[1]);\n\n    $onehotLabels =\n        add(mul($onehotLabels, sub(one, labelSmoothingScalar)),\n            div(labelSmoothingScalar, numClasses));\n  }\n\n  const losses = softmaxCrossEntropyWithLogits_($onehotLabels, $logits);\n\n  return computeWeightedLoss(losses, $weights, reduction);\n}\n\nexport const softmaxCrossEntropy = /* @__PURE__ */ op({softmaxCrossEntropy_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {SparseFillEmptyRows, SparseFillEmptyRowsInputs} from '../../kernel_names';\nimport {Scalar, Tensor, Tensor1D, Tensor2D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {ScalarLike, TensorLike} from '../../types';\nimport {op} from '../operation';\n\n/**\n * The input SparseTensor is represented via the map of inputs {`indices`,\n * `values`, `denseShape`}. The output SparseTensor has the same `denseShape`\n * but with indices `outputIndices` and values `outputValues`. This op inserts a\n * single entry for every row that doesn't have any values. The index is created\n * as `[row, 0, ..., 0]` and the inserted value is `defaultValue`.\n *\n * For example, suppose `spInput` has shape [5, 6] and non-empty values:\n * [0, 1]: a\n * [0, 3]: b\n * [2, 0]: c\n * [3, 1]: d\n *\n * Rows 1 and 4 are empty, so the output will be of shape [5, 6] with values:\n * [0, 1]: a\n * [0, 3]: b\n * [1, 0]: `defaultValue`\n * [2, 0]: c\n * [3, 1]: d\n * [4, 0]: `defaultValue`\n *\n * The output SparseTensor will be in row-major order and will have the same\n * shape as the input.\n *\n * This op also returns an indicator vector shaped [dense_shape[0]] such that\n * emptyRowIndicator[i] = True iff row i was an empty row.\n *\n * And a reverse index map vector shaped [indices.shape[0]] that is used during\n * backpropagation, reverseIndexMap[i] = outi s.t. indices[i, j] ==\n * outputIndices[outi, j] for all j\n *\n * ```js\n * const result = tf.sparse.sparseFillEmptyRows(\n *   [[0, 0], [1, 0], [1, 3], [1, 4], [3, 2], [3, 3]],\n *   [0, 10, 13, 14, 32, 33], [5, 6], -1);\n * console.log(result);\n * result['outputIndices'].print(); // [[0, 0], [1, 0], [1, 3], [1, 4],\n *                                  //  [2, 0], [3, 2], [3, 3], [4, 0]]\n * result['outputValues'].print(); // [0, 10, 13, 14,-1, 32, 33, -1]\n * result['emptyRowIndicator'].print(); // [false, false, true, false, true]\n * result['reverseIndexMap'].print(); // [0, 1, 2, 3, 5, 6]\n * ```\n * @param indices: 2-D. The indices of the sparse tensor.\n * @param values: 1-D. The values of the sparse tensor.\n * @param denseShape: 1-D. The shape of the sparse tensor.\n * @param defaultValue: 0-D. Default value to insert into location [row, 0, ...,\n *     0] for rows missing from the input sparse tensor.\n * @return A map with the following properties:\n *     - outputIndices\n *     - outputValues: 1-D. The values of the filled sparse tensor.\n *     - emptyRowIndicator: 1-D. Whether the dense row was missing in the input\n * sparse tensor.\n *     - reverseIndexMap: 1-D. A map from the input indices to the output\n * indices.\n * @doc {heading: 'Operations', subheading: 'Sparse'}\n */\nfunction sparseFillEmptyRows_(\n    indices: Tensor2D|TensorLike, values: Tensor1D|TensorLike,\n    denseShape: Tensor1D|TensorLike,\n    defaultValue: Scalar|ScalarLike): NamedTensorMap {\n  const $indices =\n      convertToTensor(indices, 'indices', 'sparseFillEmptyRows', 'int32');\n  const $values = convertToTensor(values, 'values', 'sparseFillEmptyRows');\n  const $denseShape =\n      convertToTensor(denseShape, 'denseShape', 'sparseFillEmptyRows', 'int32');\n  const $defaultValue = convertToTensor(\n      defaultValue, 'defaultValue', 'sparseFillEmptyRows', $values.dtype);\n\n  if ($indices.rank !== 2) {\n    throw new Error(`Indices should be Tensor2D but received shape\n        ${$indices.shape}`);\n  }\n  if ($values.rank !== 1) {\n    throw new Error(\n        `Values should be Tensor1D but received shape ${$values.shape}`);\n  }\n  if ($denseShape.rank !== 1) {\n    throw new Error(`Dense shape should be Tensor1D but received shape ${\n        $denseShape.shape}`);\n  }\n  if ($defaultValue.rank !== 0) {\n    throw new Error(`Default value should be a scalar but received shape ${\n        $defaultValue.shape}`);\n  }\n\n  const inputs: SparseFillEmptyRowsInputs = {\n    indices: $indices,\n    values: $values,\n    denseShape: $denseShape,\n    defaultValue: $defaultValue\n  };\n\n  const result: Tensor[] = ENGINE.runKernel(SparseFillEmptyRows, inputs as {});\n  return {\n    outputIndices: result[0],\n    outputValues: result[1],\n    emptyRowIndicator: result[2],\n    reverseIndexMap: result[3]\n  };\n}\n\nexport const sparseFillEmptyRows = /* @__PURE__ */ op({sparseFillEmptyRows_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {SparseReshape, SparseReshapeInputs} from '../../kernel_names';\nimport {Tensor, Tensor1D, Tensor2D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {op} from '../operation';\n\n/**\n * This operation has the same semantics as reshape on the represented dense\n * tensor. The `inputIndices` are recomputed based on the requested `newShape`.\n * If one component of `newShape` is the special value -1, the size of that\n * dimension is computed so that the total dense size remains constant. At most\n * one component of `newShape` can be -1. The number of dense elements implied\n * by `newShape` must be the same as the number of dense elements originally\n * implied by `inputShape`. Reshaping does not affect the order of values in the\n * SparseTensor. If the input tensor has rank R_in and N non-empty values, and\n * `newShape` has length R_out, then `inputIndices` has shape [N, R_in],\n * `inputShape` has length R_in, `outputIndices` has shape [N, R_out], and\n * `outputShape` has length R_out.\n *\n * ```js\n * const result = tf.sparse.sparseReshape(\n *   [[0, 0, 0], [0, 0, 1], [0, 1, 0], [1, 0, 0], [1, 2, 3]],\n *   [2, 3, 6], [9, -1]);\n * console.log(result);\n * result['outputIndices'].print(); //[[0, 0], [0, 1], [1, 2], [4, 2], [8, 1]]\n * result['outputShape'].print(); // [9, 4]\n * ```\n * @param inputIndices: 2-D. N x R_in matrix with the indices of non-empty\n * values in a SparseTensor.\n * @param inputShape: 1-D. R_in Tensor1D with the input SparseTensor's dense\n * shape.\n * @param newShape: 1-D. R_out Tensor1D with the requested new dense shape.\n * @return A map with the following properties:\n *     - outputIndices: 2-D. N x R_out matrix with the updated indices of\n *       non-empty values in the output SparseTensor.\n *     - outputShape: 1-D. R_out vector with the full dense shape of the output\n *       SparseTensor. This is the same as newShape but with any -1 dimensions\n *        filled in.\n * @doc {heading: 'Operations', subheading: 'Sparse'}\n */\nfunction sparseReshape_(\n    inputIndices: Tensor2D|TensorLike, inputShape: Tensor1D|TensorLike,\n    newShape: Tensor1D|TensorLike): NamedTensorMap {\n  const $inputIndices =\n      convertToTensor(inputIndices, 'inputIndices', 'sparseReshape', 'int32');\n  const $inputShape =\n      convertToTensor(inputShape, 'inputShape', 'sparseReshape', 'int32');\n  const $newShape =\n      convertToTensor(newShape, 'newShape', 'sparseReshape', 'int32');\n\n  if ($inputIndices.rank !== 2) {\n    throw new Error(`Input indices should be Tensor2D but received shape\n        ${$inputIndices.shape}`);\n  }\n  if ($inputShape.rank !== 1) {\n    throw new Error(`Input shape should be Tensor1D but received shape ${\n        $inputShape.shape}`);\n  }\n  if ($newShape.rank !== 1) {\n    throw new Error(\n        `New shape should be Tensor1D but received shape ${$newShape.shape}`);\n  }\n\n  const inputs: SparseReshapeInputs = {\n    inputIndices: $inputIndices,\n    inputShape: $inputShape,\n    newShape: $newShape\n  };\n  const result: Tensor[] = ENGINE.runKernel(SparseReshape, inputs as {});\n  return {outputIndices: result[0], outputShape: result[1]};\n}\n\nexport const sparseReshape = /* @__PURE__ */ op({sparseReshape_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {SparseSegmentMean, SparseSegmentMeanInputs} from '../../kernel_names';\nimport {Tensor, Tensor1D} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {op} from '../operation';\n\n/**\n * Computes the mean along sparse segments of a tensor.\n *\n * ```js\n * const c = tf.tensor2d([[1,2,3,4], [-1,-2,-3,-4], [6,7,8,9]]);\n * // Select two rows, one segment.\n * const result1 = tf.sparse.sparseSegmentMean(c,\n *                                           tf.tensor1d([0, 1], 'int32'),\n *                                           tf.tensor1d([0, 0], 'int32'));\n * result1.print(); // [[0, 0, 0, 0]]\n *\n * // Select two rows, two segments.\n * const result2 = tf.sparse.sparseSegmentMean(c,\n *                                             tf.tensor1d([0, 1], 'int32'),\n *                                             tf.tensor1d([0, 1], 'int32'));\n * result2.print(); // [[1, 2, 3, 4], [-1, -2, -3, -4]]\n *\n * // Select all rows, two segments.\n * const result3 = tf.sparse.sparseSegmentMean(c,\n *                                             tf.tensor1d([0, 1, 2], 'int32'),\n *                                             tf.tensor1d([0, 1, 1], 'int32'));\n * result3.print(); // [[1.0, 2.0, 3.0, 4.0], [2.5, 2.5, 2.5, 2.5]]\n * ```\n * @param data: A Tensor of at least one dimension with data that will be\n *     assembled in the output.\n * @param indices: A 1-D Tensor with indices into data. Has same rank as\n *     segmentIds.\n * @param segmentIds: A 1-D Tensor with indices into the output Tensor. Values\n *     should be sorted and can be repeated.\n * @return Has same shape as data, except for dimension 0 which has equal to\n *         the number of segments.\n *\n * @doc {heading: 'Operations', subheading: 'Sparse'}\n */\nfunction sparseSegmentMean_(\n    data: Tensor|TensorLike, indices: Tensor1D|TensorLike,\n    segmentIds: Tensor1D|TensorLike): Tensor {\n  const $data = convertToTensor(data, 'data', 'sparseSegmentMean');\n  const $indices =\n      convertToTensor(indices, 'indices', 'sparseSegmentMean', 'int32');\n  const $segmentIds =\n      convertToTensor(segmentIds, 'segmentIds', 'sparseSegmentMean', 'int32');\n\n  if ($data.rank < 1) {\n    throw new Error(\n        `Data should be at least 1 dimensional but received scalar`);\n  }\n  if ($indices.rank !== 1) {\n    throw new Error(`Indices should be Tensor1D but received shape\n          ${$indices.shape}`);\n  }\n  if ($segmentIds.rank !== 1) {\n    throw new Error(`Segment ids should be Tensor1D but received shape\n          ${$segmentIds.shape}`);\n  }\n\n  const inputs: SparseSegmentMeanInputs = {\n    data: $data,\n    indices: $indices,\n    segmentIds: $segmentIds\n  };\n\n  return ENGINE.runKernel(SparseSegmentMean, inputs as {});\n}\n\nexport const sparseSegmentMean = /* @__PURE__ */ op({sparseSegmentMean_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {SparseSegmentSum, SparseSegmentSumInputs} from '../../kernel_names';\nimport {Tensor, Tensor1D} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {op} from '../operation';\n\n/**\n * Computes the sum along sparse segments of a tensor.\n *\n * ```js\n * const c = tf.tensor2d([[1,2,3,4], [-1,-2,-3,-4], [5,6,7,8]]);\n * // Select two rows, one segment.\n * const result1 = tf.sparse.sparseSegmentSum(c,\n *                                           tf.tensor1d([0, 1], 'int32'),\n *                                           tf.tensor1d([0, 0], 'int32'));\n * result1.print(); // [[0, 0, 0, 0]]\n *\n * // Select two rows, two segments.\n * const result2 = tf.sparse.sparseSegmentSum(c,\n *                                           tf.tensor1d([0, 1], 'int32'),\n *                                           tf.tensor1d([0, 1], 'int32'));\n * result2.print(); // [[1, 2, 3, 4], [-1, -2, -3, -4]]\n *\n * // Select all rows, two segments.\n * const result3 = tf.sparse.sparseSegmentSum(c,\n *                                           tf.tensor1d([0, 1, 2], 'int32'),\n *                                           tf.tensor1d([0, 0, 1], 'int32'));\n * result3.print(); // [[0, 0, 0, 0], [5, 6, 7, 8]]\n * ```\n * @param data: A Tensor of at least one dimension with data that will be\n *     assembled in the output.\n * @param indices: A 1-D Tensor with indices into data. Has same rank as\n *     segmentIds.\n * @param segmentIds: A 1-D Tensor with indices into the output Tensor. Values\n *     should be sorted and can be repeated.\n * @return Has same shape as data, except for dimension 0 which has equal to\n *         the number of segments.\n *\n * @doc {heading: 'Operations', subheading: 'Sparse'}\n */\nfunction sparseSegmentSum_(\n    data: Tensor|TensorLike, indices: Tensor1D|TensorLike,\n    segmentIds: Tensor1D|TensorLike): Tensor {\n  const $data = convertToTensor(data, 'data', 'sparseSegmentSum');\n  const $indices =\n      convertToTensor(indices, 'indices', 'sparseSegmentSum', 'int32');\n  const $segmentIds =\n      convertToTensor(segmentIds, 'segmentIds', 'sparseSegmentSum', 'int32');\n\n  if ($data.rank < 1) {\n    throw new Error(\n        `Data should be at least 1 dimensional but received scalar`);\n  }\n  if ($indices.rank !== 1) {\n    throw new Error(`Indices should be Tensor1D but received shape\n         ${$indices.shape}`);\n  }\n  if ($segmentIds.rank !== 1) {\n    throw new Error(`Segment ids should be Tensor1D but received shape\n         ${$segmentIds.shape}`);\n  }\n\n  const inputs: SparseSegmentSumInputs = {\n    data: $data,\n    indices: $indices,\n    segmentIds: $segmentIds\n  };\n\n  return ENGINE.runKernel(SparseSegmentSum, inputs as {});\n}\n\nexport const sparseSegmentSum = /* @__PURE__ */ op({sparseSegmentSum_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {StringNGrams, StringNGramsAttrs, StringNGramsInputs} from '../../kernel_names';\nimport {Tensor, Tensor1D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {op} from '../operation';\n\n/**\n * Creates ngrams from ragged string data.\n *\n * This op accepts a ragged tensor with 1 ragged dimension containing only\n * strings and outputs a ragged tensor with 1 ragged dimension containing ngrams\n * of that string, joined along the innermost axis.\n *\n * ```js\n * const result = tf.string.stringNGrams(\n *   ['a', 'b', 'c', 'd'], tf.tensor1d([0, 2, 4], 'int32'),\n *   '|', [1, 2], 'LP', 'RP', -1, false);\n * result['nGrams'].print(); // ['a', 'b', 'LP|a', 'a|b', 'b|RP',\n *                           //  'c', 'd', 'LP|c', 'c|d', 'd|RP']\n * result['nGramsSplits'].print(); // [0, 5, 10]\n * ```\n * @param data: The values tensor of the ragged string tensor to make ngrams out\n *     of. Must be a 1D string tensor.\n * @param dataSplits: The splits tensor of the ragged string tensor to make\n *     ngrams out of.\n * @param separator: The string to append between elements of the token. Use \"\"\n *     for no separator.\n * @param nGramWidths: The sizes of the ngrams to create.\n * @param leftPad: The string to use to pad the left side of the ngram sequence.\n *     Only used if pad_width !== 0.\n * @param rightPad: The string to use to pad the right side of the ngram\n *     sequence. Only used if pad_width !== 0.\n * @param padWidth: The number of padding elements to add to each side of each\n *     sequence. Note that padding will never be greater than `nGramWidths`-1\n *     regardless of this value. If `padWidth`=-1, then add max(`nGramWidths`)-1\n *     elements.\n * @param preserveShortSequences: If true, then ensure that at least one ngram\n *     is generated for each input sequence. In particular, if an input sequence\n *     is shorter than min(ngramWidth) + 2*padWidth, then generate a single\n *     ngram containing the entire sequence. If false, then no ngrams are\n *     generated for these short input sequences.\n * @return A map with the following properties:\n *     - nGrams: The values tensor of the output ngrams ragged tensor.\n *     - nGramsSplits: The splits tensor of the output ngrams ragged tensor.\n *\n * @doc {heading: 'Operations', subheading: 'String'}\n */\nfunction stringNGrams_(\n    data: Tensor1D|TensorLike, dataSplits: Tensor|TensorLike, separator: string,\n    nGramWidths: number[], leftPad: string, rightPad: string, padWidth: number,\n    preserveShortSequences: boolean): NamedTensorMap {\n  const $data = convertToTensor(data, 'data', 'stringNGrams', 'string');\n  if ($data.dtype !== 'string') {\n    throw new Error('Data must be of datatype string');\n  }\n  if ($data.shape.length !== 1) {\n    throw new Error(`Data must be a vector, saw: ${$data.shape}`);\n  }\n\n  const $dataSplits = convertToTensor(dataSplits, 'dataSplits', 'stringNGrams');\n  if ($dataSplits.dtype !== 'int32') {\n    throw new Error('Data splits must be of datatype int32');\n  }\n\n  const attrs: StringNGramsAttrs = {\n    separator,\n    nGramWidths,\n    leftPad,\n    rightPad,\n    padWidth,\n    preserveShortSequences\n  };\n\n  const inputs: StringNGramsInputs = {data: $data, dataSplits: $dataSplits};\n  const result: Tensor[] =\n      ENGINE.runKernel(StringNGrams, inputs as {}, attrs as {});\n  return {nGrams: result[0], nGramsSplits: result[1]};\n}\n\nexport const stringNGrams = /* @__PURE__ */ op({stringNGrams_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {StringSplit, StringSplitAttrs, StringSplitInputs} from '../../kernel_names';\nimport {Scalar, Tensor, Tensor1D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {ScalarLike, TensorLike} from '../../types';\nimport {op} from '../operation';\n\n/**\n * Split elements of `input` based on `delimiter` into a SparseTensor .\n *\n * Let N be the size of source (typically N will be the batch size). Split each\n * element of `input` based on `delimiter` and return a SparseTensor containing\n * the splitted tokens. Empty tokens are ignored if `skipEmpty` is set to True.\n *\n * `delimiter` can be empty, or a string of split characters. If `delimiter` is\n * an empty string, each element of `input` is split into individual\n * character strings. Otherwise every character of `delimiter` is a potential\n * split point.\n *\n * ```js\n * const result = tf.string.stringSplit(['hello world',  'a b c'], ' ');\n * result['indices'].print(); // [[0, 0], [0, 1], [1, 0], [1, 1], [1, 2]]\n * result['values'].print(); // ['hello', 'world', 'a', 'b', 'c']\n * result['shape'].print(); // [2, 3]\n * ```\n * @param input: 1-D. Strings to split.\n * @param delimiter: 0-D. Delimiter characters, or empty string.\n * @param skipEmpty: Optional. If true, skip the empty strings from the result.\n *     Defaults to true.\n * @return A map with the following properties:\n *     - indices: A dense matrix of int32 representing the indices of the sparse\n *       tensor.\n *     - values: A vector of strings corresponding to the splited values.\n *     - shape: a length-2 vector of int32 representing the shape of the sparse\n * tensor, where the first value is N and the second value is the maximum number\n * of tokens in a single input entry.\n *\n * @doc {heading: 'Operations', subheading: 'String'}\n */\nfunction stringSplit_(\n    input: Tensor1D|TensorLike, delimiter: Scalar|ScalarLike,\n    skipEmpty = true): NamedTensorMap {\n  const $input = convertToTensor(input, 'input', 'stringSplit', 'string');\n  const $delimiter =\n      convertToTensor(delimiter, 'delimiter', 'stringSplit', 'string');\n\n  if ($input.rank !== 1) {\n    throw new Error(\n        `Input should be Tensor1D but received shape ${$input.shape}`);\n  }\n  if ($delimiter.rank !== 0) {\n    throw new Error(\n        `Delimiter should be a scalar but received shape ${$delimiter.shape}`);\n  }\n\n  const attrs: StringSplitAttrs = {skipEmpty};\n  const inputs: StringSplitInputs = {input: $input, delimiter: $delimiter};\n  const result: Tensor[] =\n      ENGINE.runKernel(StringSplit, inputs as {}, attrs as {});\n  return {indices: result[0], values: result[1], shape: result[2]};\n}\n\nexport const stringSplit = /* @__PURE__ */ op({stringSplit_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {StringToHashBucketFast, StringToHashBucketFastAttrs, StringToHashBucketFastInputs} from '../../kernel_names';\nimport {Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {op} from '../operation';\n\n/**\n * Converts each string in the input Tensor to its hash mod by a number of\n * buckets.\n *\n * The hash function is deterministic on the content of the string within the\n * process and will never change. However, it is not suitable for cryptography.\n * This function may be used when CPU time is scarce and inputs are trusted or\n * unimportant. There is a risk of adversaries constructing inputs that all hash\n * to the same bucket.\n *\n * ```js\n * const result = tf.string.stringToHashBucketFast(\n *   ['Hello', 'TensorFlow', '2.x'], 3);\n * result.print(); // [0, 2, 2]\n * ```\n * @param input: The strings to assign a hash bucket.\n * @param numBuckets: The number of buckets.\n * @return A Tensor of the same shape as the input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'String'}\n */\nfunction stringToHashBucketFast_(\n    input: Tensor|TensorLike, numBuckets: number): Tensor {\n  const $input =\n      convertToTensor(input, 'input', 'stringToHashBucketFast', 'string');\n  const attrs: StringToHashBucketFastAttrs = {numBuckets};\n\n  if (numBuckets <= 0) {\n    throw new Error(`Number of buckets must be at least 1`);\n  }\n\n  const inputs: StringToHashBucketFastInputs = {input: $input};\n  return ENGINE.runKernel(StringToHashBucketFast, inputs as {}, attrs as {});\n}\n\nexport const stringToHashBucketFast = /* @__PURE__ */ op({stringToHashBucketFast_});\n", "/**\n * @license\n * Copyright 2023 Google LLC.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {StaticRegexReplace, StaticRegexReplaceAttrs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {op} from '../operation';\n\n/**\n * Replace the match of a `pattern` in `input` with `rewrite`.\n *\n * ```js\n * const result = tf.string.staticRegexReplace(\n *     ['format       this   spacing      better'], ' +', ' ');\n * result.print(); // ['format this spacing better']\n * ```\n * @param input: A Tensor of type string. The text to be processed.\n * @param pattern: A string. The regular expression to match the input.\n * @param rewrite: A string. The rewrite to be applied to the matched\n *     expression.\n * @param replaceGlobal: An optional bool. Defaults to True. If True, the\n *     replacement is global, otherwise the replacement is done only on the\n *     first match.\n * @return A Tensor of type string.\n *\n * @doc {heading: 'Operations', subheading: 'String'}\n */\nfunction staticRegexReplace_(\n  input: Tensor | TensorLike, pattern: string, rewrite: string,\n  replaceGlobal=true): Tensor {\n\n  const $input = convertToTensor(input, 'input', 'staticRegexReplace',\n                                 'string');\n  const attrs: StaticRegexReplaceAttrs = {pattern, rewrite, replaceGlobal};\n  return ENGINE.runKernel(StaticRegexReplace, {x: $input},\n                          attrs as unknown as NamedAttrMap);\n}\n\nexport const staticRegexReplace = /* @__PURE__ */ op({staticRegexReplace_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n// Modularized ops.\nexport {abs} from './abs';\nexport {acos} from './acos';\nexport {acosh} from './acosh';\nexport {add} from './add';\nexport {addN} from './add_n';\nexport {all} from './all';\nexport {any} from './any';\nexport {argMax} from './arg_max';\nexport {argMin} from './arg_min';\nexport {asin} from './asin';\nexport {asinh} from './asinh';\nexport {atan} from './atan';\nexport {atan2} from './atan2';\nexport {atanh} from './atanh';\nexport {avgPool} from './avg_pool';\nexport {avgPool3d} from './avg_pool_3d';\nexport {basicLSTMCell} from './basic_lstm_cell';\nexport {batchToSpaceND} from './batch_to_space_nd';\nexport {batchNorm} from './batchnorm';\nexport {batchNorm2d} from './batchnorm2d';\nexport {batchNorm3d} from './batchnorm3d';\nexport {batchNorm4d} from './batchnorm4d';\nexport {bincount} from './bincount';\nexport {bitwiseAnd} from './bitwise_and';\nexport {broadcastArgs} from './broadcast_args';\nexport {broadcastTo} from './broadcast_to';\nexport {buffer} from './buffer';\nexport {cast} from './cast';\nexport {ceil} from './ceil';\nexport {clipByValue} from './clip_by_value';\nexport {clone} from './clone';\nexport {complex} from './complex';\nexport {concat} from './concat';\nexport {concat1d} from './concat_1d';\nexport {concat2d} from './concat_2d';\nexport {concat3d} from './concat_3d';\nexport {concat4d} from './concat_4d';\nexport {conv1d} from './conv1d';\nexport {conv2d} from './conv2d';\nexport {conv2dTranspose} from './conv2d_transpose';\nexport {conv3d} from './conv3d';\nexport {conv3dTranspose} from './conv3d_transpose';\nexport {cos} from './cos';\nexport {cosh} from './cosh';\nexport {cumprod} from './cumprod';\nexport {cumsum} from './cumsum';\nexport {denseBincount} from './dense_bincount';\nexport {depthToSpace} from './depth_to_space';\nexport {depthwiseConv2d} from './depthwise_conv2d';\nexport {diag} from './diag';\nexport {dilation2d} from './dilation2d';\nexport {div} from './div';\nexport {divNoNan} from './div_no_nan';\nexport {dot} from './dot';\nexport {einsum} from './einsum';\nexport {elu} from './elu';\nexport {ensureShape} from './ensure_shape';\nexport {equal} from './equal';\nexport {erf} from './erf';\nexport {euclideanNorm} from './euclidean_norm';\nexport {exp} from './exp';\nexport {expandDims} from './expand_dims';\nexport {expm1} from './expm1';\nexport {eye} from './eye';\nexport {fill} from './fill';\nexport {floor} from './floor';\nexport {floorDiv} from './floorDiv';\nexport {gather} from './gather';\nexport {greater} from './greater';\nexport {greaterEqual} from './greater_equal';\nexport {imag} from './imag';\nexport {isFinite} from './is_finite';\nexport {isInf} from './is_inf';\nexport {isNaN} from './is_nan';\nexport {leakyRelu} from './leaky_relu';\nexport {less} from './less';\nexport {lessEqual} from './less_equal';\nexport {linspace} from './linspace';\nexport {localResponseNormalization} from './local_response_normalization';\nexport {log} from './log';\nexport {log1p} from './log1p';\nexport {logSigmoid} from './log_sigmoid';\nexport {logSoftmax} from './log_softmax';\nexport {logSumExp} from './log_sum_exp';\nexport {logicalAnd} from './logical_and';\nexport {logicalNot} from './logical_not';\nexport {logicalOr} from './logical_or';\nexport {logicalXor} from './logical_xor';\nexport {lowerBound} from './lower_bound';\nexport {matMul} from './mat_mul';\nexport {max} from './max';\nexport {maxPool} from './max_pool';\nexport {maxPool3d} from './max_pool_3d';\nexport {maxPoolWithArgmax} from './max_pool_with_argmax';\nexport {maximum} from './maximum';\nexport {mean} from './mean';\nexport {meshgrid} from './meshgrid';\nexport {min} from './min';\nexport {minimum} from './minimum';\nexport {mirrorPad} from './mirror_pad';\nexport {mod} from './mod';\nexport {moments} from './moments';\nexport {mul} from './mul';\nexport {LSTMCellFunc, multiRNNCell} from './multi_rnn_cell';\nexport {multinomial} from './multinomial';\nexport {neg} from './neg';\nexport {notEqual} from './not_equal';\nexport {oneHot} from './one_hot';\nexport {ones} from './ones';\nexport {onesLike} from './ones_like';\nexport {outerProduct} from './outer_product';\nexport {pad} from './pad';\nexport {pad1d} from './pad1d';\nexport {pad2d} from './pad2d';\nexport {pad3d} from './pad3d';\nexport {pad4d} from './pad4d';\nexport {pool} from './pool';\nexport {pow} from './pow';\nexport {prelu} from './prelu';\nexport {print} from './print';\nexport {prod} from './prod';\nexport {raggedGather} from './ragged_gather';\nexport {raggedRange} from './ragged_range';\nexport {raggedTensorToTensor} from './ragged_tensor_to_tensor';\nexport {rand} from './rand';\nexport {randomGamma} from './random_gamma';\nexport {randomNormal} from './random_normal';\nexport {randomStandardNormal} from './random_standard_normal';\nexport {randomUniform} from './random_uniform';\nexport {randomUniformInt} from './random_uniform_int';\nexport {range} from './range';\nexport {real} from './real';\nexport {reciprocal} from './reciprocal';\nexport {relu} from './relu';\nexport {relu6} from './relu6';\nexport {reshape} from './reshape';\nexport {reverse} from './reverse';\nexport {reverse1d} from './reverse_1d';\nexport {reverse2d} from './reverse_2d';\nexport {reverse3d} from './reverse_3d';\nexport {reverse4d} from './reverse_4d';\nexport {round} from './round';\nexport {rsqrt} from './rsqrt';\nexport {scalar} from './scalar';\nexport {selu} from './selu';\nexport {separableConv2d} from './separable_conv2d';\nexport {setdiff1dAsync} from './setdiff1d_async';\nexport {sigmoid} from './sigmoid';\nexport {sign} from './sign';\nexport {sin} from './sin';\nexport {sinh} from './sinh';\nexport {slice} from './slice';\nexport {slice1d} from './slice1d';\nexport {slice2d} from './slice2d';\nexport {slice3d} from './slice3d';\nexport {slice4d} from './slice4d';\nexport {softmax} from './softmax';\nexport {softplus} from './softplus';\nexport {spaceToBatchND} from './space_to_batch_nd';\nexport {fft} from './spectral/fft';\nexport {ifft} from './spectral/ifft';\nexport {irfft} from './spectral/irfft';\nexport {rfft} from './spectral/rfft';\nexport {split} from './split';\nexport {sqrt} from './sqrt';\nexport {square} from './square';\nexport {squaredDifference} from './squared_difference';\nexport {squeeze} from './squeeze';\nexport {stack} from './stack';\nexport {step} from './step';\nexport {stridedSlice} from './strided_slice';\nexport {sub} from './sub';\nexport {sum} from './sum';\nexport {tan} from './tan';\nexport {tanh} from './tanh';\nexport {tensor} from './tensor';\nexport {tensor1d} from './tensor1d';\nexport {tensor2d} from './tensor2d';\nexport {tensor3d} from './tensor3d';\nexport {tensor4d} from './tensor4d';\nexport {tensor5d} from './tensor5d';\nexport {tensor6d} from './tensor6d';\nexport {tensorScatterUpdate} from './tensor_scatter_update';\nexport {tile} from './tile';\nexport {topk} from './topk';\nexport {truncatedNormal} from './truncated_normal';\nexport {unique} from './unique';\nexport {unsortedSegmentSum} from './unsorted_segment_sum';\nexport {unstack} from './unstack';\nexport {upperBound} from './upper_bound';\nexport {variable} from './variable';\nexport {where} from './where';\nexport {whereAsync} from './where_async';\nexport {zeros} from './zeros';\nexport {zerosLike} from './zeros_like';\n\nexport * from './boolean_mask';\nexport * from './transpose';\nexport * from './norm';\nexport * from './moving_average';\nexport * from './scatter_nd';\nexport * from './search_sorted';\nexport * from './sparse_to_dense';\nexport * from './gather_nd';\nexport * from './dropout';\nexport * from './signal_ops_util';\nexport * from './in_top_k';\n\nexport {op, OP_SCOPE_SUFFIX} from './operation';\n\nimport {rfft} from './spectral/rfft';\nimport {fft} from './spectral/fft';\nimport {ifft} from './spectral/ifft';\nimport {irfft} from './spectral/irfft';\nconst spectral = {\n  fft,\n  ifft,\n  rfft,\n  irfft\n};\n\nimport * as fused from './fused_ops';\n\nimport {hammingWindow} from './signal/hamming_window';\nimport {hannWindow} from './signal/hann_window';\nimport {frame} from './signal/frame';\nimport {stft} from './signal/stft';\nconst signal = {\n  hammingWindow,\n  hannWindow,\n  frame,\n  stft,\n};\n\n// Image Ops namespace\nimport {cropAndResize} from './image/crop_and_resize';\nimport {flipLeftRight} from './image/flip_left_right';\nimport {grayscaleToRGB} from './image/grayscale_to_rgb';\nimport {rgbToGrayscale} from './image/rgb_to_grayscale';\nimport {rotateWithOffset} from './image/rotate_with_offset';\nimport {nonMaxSuppression} from './image/non_max_suppression';\nimport {nonMaxSuppressionAsync} from './image/non_max_suppression_async';\nimport {nonMaxSuppressionWithScore} from './image/non_max_suppression_with_score';\nimport {nonMaxSuppressionWithScoreAsync} from './image/non_max_suppression_with_score_async';\nimport {nonMaxSuppressionPadded} from './image/non_max_suppression_padded';\nimport {nonMaxSuppressionPaddedAsync} from './image/non_max_suppression_padded_async';\nimport {resizeBilinear} from './image/resize_bilinear';\nimport {resizeNearestNeighbor} from './image/resize_nearest_neighbor';\nimport {threshold} from './image/threshold';\nimport {transform} from './image/transform';\nconst image = {\n  flipLeftRight,\n  grayscaleToRGB,\n  resizeNearestNeighbor,\n  resizeBilinear,\n  rgbToGrayscale,\n  rotateWithOffset,\n  cropAndResize,\n  nonMaxSuppression,\n  nonMaxSuppressionAsync,\n  nonMaxSuppressionWithScore,\n  nonMaxSuppressionWithScoreAsync,\n  nonMaxSuppressionPadded,\n  nonMaxSuppressionPaddedAsync,\n  threshold,\n  transform\n};\n\n// linalg namespace\nimport {bandPart} from './linalg/band_part';\nimport {gramSchmidt} from './linalg/gram_schmidt';\nimport {qr} from './linalg/qr';\nconst linalg = {\n  bandPart,\n  gramSchmidt,\n  qr\n};\n\n// losses namespace;\nimport {absoluteDifference} from './losses/absolute_difference';\nimport {computeWeightedLoss} from './losses/compute_weighted_loss';\nimport {cosineDistance} from './losses/cosine_distance';\nimport {hingeLoss} from './losses/hinge_loss';\nimport {huberLoss} from './losses/huber_loss';\nimport {logLoss} from './losses/log_loss';\nimport {meanSquaredError} from './losses/mean_squared_error';\nimport {sigmoidCrossEntropy} from './losses/sigmoid_cross_entropy';\nimport {softmaxCrossEntropy} from './losses/softmax_cross_entropy';\nconst losses = {\n  absoluteDifference,\n  computeWeightedLoss,\n  cosineDistance,\n  hingeLoss,\n  huberLoss,\n  logLoss,\n  meanSquaredError,\n  sigmoidCrossEntropy,\n  softmaxCrossEntropy\n};\n\nimport {sparseFillEmptyRows} from './sparse/sparse_fill_empty_rows';\nimport {sparseReshape} from './sparse/sparse_reshape';\nimport {sparseSegmentMean} from './sparse/sparse_segment_mean';\nimport {sparseSegmentSum} from './sparse/sparse_segment_sum';\nconst sparse = {\n  sparseFillEmptyRows,\n  sparseReshape,\n  sparseSegmentMean,\n  sparseSegmentSum\n};\n\nimport {stringNGrams} from './string/string_n_grams';\nimport {stringSplit} from './string/string_split';\nimport {stringToHashBucketFast} from './string/string_to_hash_bucket_fast';\nimport {staticRegexReplace} from './string/static_regex_replace';\n// tslint:disable-next-line:variable-name\nconst string = {\n  stringNGrams,\n  stringSplit,\n  stringToHashBucketFast,\n  staticRegexReplace,\n};\n\n// Second level exports.\nexport {image, linalg, losses, spectral, fused, signal, sparse, string};\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {assert} from './util';\n\n/**\n * Types to support JSON-esque data structures internally.\n *\n * Internally ConfigDict's use camelCase keys and values where the\n * values are class names to be instantiated.  On the python side, these\n * will be snake_case.  Internally we allow Enums into the values for better\n * type safety, but these need to be converted to raw primitives (usually\n * strings) for round-tripping with python.\n *\n * toConfig returns the TS-friendly representation. model.toJSON() returns\n * the pythonic version as that's the portable format.  If you need to\n * python-ify a non-model level toConfig output, you'll need to use a\n * convertTsToPythonic from serialization_utils in -Layers.\n *\n */\nexport declare type ConfigDictValue =\n    boolean | number | string | null | ConfigDictArray | ConfigDict;\nexport declare interface ConfigDict {\n  [key: string]: ConfigDictValue;\n}\nexport declare interface ConfigDictArray extends Array<ConfigDictValue> {}\n\n/**\n * Type to represent the class-type of Serializable objects.\n *\n * Ie the class prototype with access to the constructor and any\n * static members/methods. Instance methods are not listed here.\n *\n * Source for this idea: https://stackoverflow.com/a/43607255\n */\nexport declare type SerializableConstructor<T extends Serializable> = {\n  // tslint:disable-next-line:no-any\n  new (...args: any[]): T; className: string; fromConfig: FromConfigMethod<T>;\n};\nexport declare type FromConfigMethod<T extends Serializable> =\n    (cls: SerializableConstructor<T>, config: ConfigDict) => T;\n\n/**\n * Maps to mapping between the custom object and its name.\n *\n * After registering a custom class, these two maps will add key-value pairs\n * for the class object and the registered name.\n *\n * Therefore we can get the relative registered name by calling\n * getRegisteredName() function.\n *\n * For example:\n * GLOBAL_CUSTOM_OBJECT: {key=registeredName: value=corresponding\n * CustomObjectClass}\n *\n * GLOBAL_CUSTOM_NAMES: {key=CustomObjectClass: value=corresponding\n * registeredName}\n *\n */\nconst GLOBAL_CUSTOM_OBJECT =\n    new Map<string, SerializableConstructor<Serializable>>();\n\nconst GLOBAL_CUSTOM_NAMES =\n    new Map<SerializableConstructor<Serializable>, string>();\n\n/**\n * Serializable defines the serialization contract.\n *\n * TFJS requires serializable classes to return their className when asked\n * to avoid issues with minification.\n */\nexport abstract class Serializable {\n  /**\n   * Return the class name for this class to use in serialization contexts.\n   *\n   * Generally speaking this will be the same thing that constructor.name\n   * would have returned.  However, the class name needs to be robust\n   * against minification for serialization/deserialization to work properly.\n   *\n   * There's also places such as initializers.VarianceScaling, where\n   * implementation details between different languages led to different\n   * class hierarchies and a non-leaf node is used for serialization purposes.\n   */\n  getClassName(): string {\n    return (this.constructor as SerializableConstructor<Serializable>)\n        .className;\n  }\n\n  /**\n   * Return all the non-weight state needed to serialize this object.\n   */\n  abstract getConfig(): ConfigDict;\n\n  /**\n   * Creates an instance of T from a ConfigDict.\n   *\n   * This works for most descendants of serializable.  A few need to\n   * provide special handling.\n   * @param cls A Constructor for the class to instantiate.\n   * @param config The Configuration for the object.\n   */\n  /** @nocollapse */\n  static fromConfig<T extends Serializable>(\n      cls: SerializableConstructor<T>, config: ConfigDict): T {\n    return new cls(config);\n  }\n}\n\n/**\n * Maps string keys to class constructors.\n *\n * Used during (de)serialization from the cross-language JSON format, which\n * requires the class name in the serialization format matches the class\n * names as used in Python, should it exist.\n */\nexport class SerializationMap {\n  private static instance: SerializationMap;\n  classNameMap: {\n    [className: string]:\n        [SerializableConstructor<Serializable>, FromConfigMethod<Serializable>]\n  };\n\n  private constructor() {\n    this.classNameMap = {};\n  }\n\n  /**\n   * Returns the singleton instance of the map.\n   */\n  static getMap(): SerializationMap {\n    if (SerializationMap.instance == null) {\n      SerializationMap.instance = new SerializationMap();\n    }\n    return SerializationMap.instance;\n  }\n\n  /**\n   * Registers the class as serializable.\n   */\n  static register<T extends Serializable>(cls: SerializableConstructor<T>) {\n    SerializationMap.getMap().classNameMap[cls.className] =\n        [cls, cls.fromConfig];\n  }\n}\n\n/**\n * Register a class with the serialization map of TensorFlow.js.\n *\n * This is often used for registering custom Layers, so they can be\n * serialized and deserialized.\n *\n * Example 1. Register the class without package name and specified name.\n *\n * ```js\n * class MyCustomLayer extends tf.layers.Layer {\n *   static className = 'MyCustomLayer';\n *\n *   constructor(config) {\n *     super(config);\n *   }\n * }\n * tf.serialization.registerClass(MyCustomLayer);\n * console.log(tf.serialization.GLOBALCUSTOMOBJECT.get(\"Custom>MyCustomLayer\"));\n * console.log(tf.serialization.GLOBALCUSTOMNAMES.get(MyCustomLayer));\n * ```\n *\n * Example 2. Register the class with package name: \"Package\" and specified\n * name: \"MyLayer\".\n * ```js\n * class MyCustomLayer extends tf.layers.Layer {\n *   static className = 'MyCustomLayer';\n *\n *   constructor(config) {\n *     super(config);\n *   }\n * }\n * tf.serialization.registerClass(MyCustomLayer, \"Package\", \"MyLayer\");\n * console.log(tf.serialization.GLOBALCUSTOMOBJECT.get(\"Package>MyLayer\"));\n * console.log(tf.serialization.GLOBALCUSTOMNAMES.get(MyCustomLayer));\n * ```\n *\n * Example 3. Register the class with specified name: \"MyLayer\".\n * ```js\n * class MyCustomLayer extends tf.layers.Layer {\n *   static className = 'MyCustomLayer';\n *\n *   constructor(config) {\n *     super(config);\n *   }\n * }\n * tf.serialization.registerClass(MyCustomLayer, undefined, \"MyLayer\");\n * console.log(tf.serialization.GLOBALCUSTOMOBJECT.get(\"Custom>MyLayer\"));\n * console.log(tf.serialization.GLOBALCUSTOMNAMES.get(MyCustomLayer));\n * ```\n *\n * Example 4. Register the class with specified package name: \"Package\".\n * ```js\n * class MyCustomLayer extends tf.layers.Layer {\n *   static className = 'MyCustomLayer';\n *\n *   constructor(config) {\n *     super(config);\n *   }\n * }\n * tf.serialization.registerClass(MyCustomLayer, \"Package\");\n * console.log(tf.serialization.GLOBALCUSTOMOBJECT\n * .get(\"Package>MyCustomLayer\"));\n * console.log(tf.serialization.GLOBALCUSTOMNAMES\n * .get(MyCustomLayer));\n * ```\n *\n * @param cls The class to be registered. It must have a public static member\n *   called `className` defined and the value must be a non-empty string.\n * @param pkg The package name that this class belongs to. This used to define\n *     the key in GlobalCustomObject. If not defined, it defaults to `Custom`.\n * @param name The name that user specified. It defaults to the actual name of\n *     the class as specified by its static `className` property.\n * @doc {heading: 'Models', subheading: 'Serialization', ignoreCI: true}\n */\nexport function registerClass<T extends Serializable>(\n    cls: SerializableConstructor<T>, pkg?: string, name?: string) {\n  assert(\n      cls.className != null,\n      () => `Class being registered does not have the static className ` +\n          `property defined.`);\n  assert(\n      typeof cls.className === 'string',\n      () => `className is required to be a string, but got type ` +\n          typeof cls.className);\n  assert(\n      cls.className.length > 0,\n      () => `Class being registered has an empty-string as its className, ` +\n          `which is disallowed.`);\n\n  if (typeof pkg === 'undefined') {\n    pkg = 'Custom';\n  }\n\n  if (typeof name === 'undefined') {\n    name = cls.className;\n  }\n\n  const className = name;\n  const registerName = pkg + '>' + className;\n\n  SerializationMap.register(cls);\n  GLOBAL_CUSTOM_OBJECT.set(registerName, cls);\n  GLOBAL_CUSTOM_NAMES.set(cls, registerName);\n\n  return cls;\n}\n\n/**\n * Get the registered name of a class. If the class has not been registered,\n * return the class name.\n *\n * @param cls The class we want to get register name for. It must have a public\n *     static member called `className` defined.\n * @returns registered name or class name.\n */\nexport function getRegisteredName<T extends Serializable>(\n    cls: SerializableConstructor<T>) {\n  if (GLOBAL_CUSTOM_NAMES.has(cls)) {\n    return GLOBAL_CUSTOM_NAMES.get(cls);\n  } else {\n    return cls.className;\n  }\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {dispose} from '../globals';\nimport {variableGrads} from '../gradients';\nimport {scalar} from '../ops/ops';\nimport {Serializable} from '../serialization';\nimport {Scalar, Variable} from '../tensor';\nimport {NamedTensor, NamedTensorMap} from '../tensor_types';\n\n/**\n * A variable that belongs to an optimizer.\n *\n * The `originalName` field is required for keeping track of the canonical\n * name of the variable, which is usually the name of the model weight that\n * the variable is related to plus a suffix, e.g., 'dense1/kernel/momentum'.\n * The name of the `Variable` object itself cannot be used directly due to\n * possible deduplication: Every `Variable` must have a unique name but more\n * than one optimizer objects of the same type may be created for the same model\n * or the same `Variable`.\n */\nexport interface OptimizerVariable {\n  originalName: string;\n  variable: Variable;\n}\n\n/** @doc {heading: 'Training', subheading: 'Classes', namespace: 'train'} */\nexport abstract class Optimizer extends Serializable {\n  protected iterations_: number;\n\n  /**\n   * Executes `f()` and minimizes the scalar output of `f()` by computing\n   * gradients of y with respect to the list of trainable variables provided by\n   * `varList`. If no list is provided, it defaults to all trainable variables.\n   *\n   * @param f The function to execute and whose output to minimize.\n   * @param returnCost Whether to return the scalar cost value produced by\n   * executing `f()`.\n   * @param varList An optional list of variables to update. If specified, only\n   * the trainable variables in varList will be updated by minimize. Defaults to\n   * all trainable variables.\n   *\n   * @doc {heading: 'Training', subheading: 'Optimizers'}\n   */\n  minimize(f: () => Scalar, returnCost = false, varList?: Variable[]): Scalar\n      |null {\n    const {value, grads} = this.computeGradients(f, varList);\n\n    if (varList != null) {\n      const gradArray: NamedTensor[] =\n          varList.map(v => ({name: v.name, tensor: grads[v.name]}));\n      this.applyGradients(gradArray);\n    } else {\n      this.applyGradients(grads);\n    }\n\n    // Dispose gradients.\n    dispose(grads);\n\n    if (returnCost) {\n      return value;\n    } else {\n      value.dispose();\n      return null;\n    }\n  }\n\n  /**\n   * The number of iterations that this optimizer instance has been invoked for.\n   */\n  get iterations(): number {\n    if (this.iterations_ == null) {\n      this.iterations_ = 0;\n    }\n    return this.iterations_;\n  }\n\n  protected incrementIterations() {\n    this.iterations_ = this.iterations + 1;\n  }\n\n  /**\n   * Executes f() and computes the gradient of the scalar output of f() with\n   * respect to the list of trainable variables provided by `varList`. If no\n   * list is provided, it defaults to all trainable variables.\n   *\n   * @param f The function to execute and whose output to use for computing\n   * gradients with respect to variables.\n   * @param varList An optional list of variables to compute gradients with\n   * respect to. If specified, only the trainable variables in varList will have\n   * gradients computed with respect to. Defaults to all trainable variables.\n   *\n   * @doc {heading: 'Training', subheading: 'Optimizers'}\n   */\n  computeGradients(f: () => Scalar, varList?: Variable[]):\n      {value: Scalar, grads: NamedTensorMap} {\n    return variableGrads(f, varList);\n  }\n\n  /**\n   * Updates variables by using the computed gradients.\n   *\n   * @param variableGradients A mapping of variable name to its gradient value.\n   *\n   * @doc {heading: 'Training', subheading: 'Optimizers'}\n   */\n  abstract applyGradients(variableGradients: NamedTensorMap|\n                          NamedTensor[]): void;\n\n  /**\n   * Dispose the variables (if any) owned by this optimizer instance.\n   */\n  dispose(): void {\n    if (this.iterations_ != null) {\n      dispose(this.iterations_);\n    }\n  }\n\n  async saveIterations(): Promise<NamedTensor> {\n    if (this.iterations_ == null) {\n      this.iterations_ = 0;\n    }\n    return {\n      name: 'iter',  // Named for Python compatibility.\n      // TODO(cais): Use 'int64' type when available.\n      tensor: scalar(this.iterations_, 'int32')\n    };\n  }\n\n  async getWeights(): Promise<NamedTensor[]> {\n    throw new Error('getWeights() is not implemented for this optimizer yet.');\n  }\n\n  async setWeights(weightValues: NamedTensor[]): Promise<void> {\n    throw new Error(\n        `setWeights() is not implemented for this optimizer class ` +\n        `${this.getClassName()}`);\n  }\n\n  /**\n   * Extract the first element of the weight values and set it\n   * as the iterations counter variable of this instance of optimizer.\n   *\n   * @param weightValues\n   * @returns Weight values with the first element consumed and excluded.\n   */\n  protected async extractIterations(weightValues: NamedTensor[]):\n      Promise<NamedTensor[]> {\n    this.iterations_ = (await weightValues[0].tensor.data())[0];\n    return weightValues.slice(1);\n  }\n}\n\nObject.defineProperty(Optimizer, Symbol.hasInstance, {\n  value: (instance: Optimizer) => {\n    return instance.minimize != null && instance.computeGradients != null &&\n        instance.applyGradients != null;\n  }\n});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {dispose, tidy} from '../globals';\nimport {add} from '../ops/add';\nimport {div} from '../ops/div';\nimport {mul} from '../ops/mul';\nimport {sqrt} from '../ops/ops';\nimport {square} from '../ops/square';\nimport {zerosLike} from '../ops/zeros_like';\nimport {ConfigDict, Serializable, SerializableConstructor} from '../serialization';\nimport {NamedTensor, NamedVariableMap} from '../tensor_types';\n\nimport {Optimizer, OptimizerVariable} from './optimizer';\n\n/** @doclink Optimizer */\nexport class AdadeltaOptimizer extends Optimizer {\n  /** @nocollapse */\n  static get className() {\n    // Name matters for Python compatibility.\n    // This is a getter instead of a property because when it's a property, it\n    // prevents the entire class from being tree-shaken.\n    return 'Adadelta';\n  }\n  private accumulatedGrads: OptimizerVariable[] = [];\n  private accumulatedUpdates: OptimizerVariable[] = [];\n\n  constructor(\n      protected learningRate: number, protected rho: number,\n      protected epsilon: number = null) {\n    super();\n\n    if (epsilon == null) {\n      this.epsilon = ENGINE.backend.epsilon();\n    }\n  }\n\n  applyGradients(variableGradients: NamedVariableMap|NamedTensor[]) {\n    const variableNames = Array.isArray(variableGradients) ?\n        variableGradients.map(item => item.name) :\n        Object.keys(variableGradients);\n\n    variableNames.forEach((name, i) => {\n      const value = ENGINE.registeredVariables[name];\n      const trainable = false;\n      if (this.accumulatedGrads[i] == null) {\n        this.accumulatedGrads[i] = {\n          originalName: `${name}/accum_grad`,\n          variable: tidy(() => zerosLike(value).variable(trainable))\n        };\n      }\n      if (this.accumulatedUpdates[i] == null) {\n        this.accumulatedUpdates[i] = {\n          originalName: `${name}/accum_var`,\n          variable: tidy(() => zerosLike(value).variable(trainable))\n        };\n      }\n\n      const gradient = Array.isArray(variableGradients) ?\n          variableGradients[i].tensor :\n          variableGradients[name];\n      if (gradient == null) {\n        return;\n      }\n\n      const accumulatedGrad = this.accumulatedGrads[i].variable;\n      const accumulatedUpdate = this.accumulatedUpdates[i].variable;\n\n      tidy(() => {\n        const newAccumulatedGrad =\n            add(mul(accumulatedGrad, this.rho),\n                mul(square(gradient), 1 - this.rho));\n\n        const updates =\n            mul(div(sqrt(add(accumulatedUpdate, this.epsilon)),\n                    sqrt(add(accumulatedGrad, this.epsilon))),\n                gradient);\n\n        const newAccumulatedUpdate =\n            add(mul(accumulatedUpdate, this.rho),\n                mul(square(updates), 1 - this.rho));\n\n        accumulatedGrad.assign(newAccumulatedGrad);\n        accumulatedUpdate.assign(newAccumulatedUpdate);\n\n        const newValue = add(mul(updates, -this.learningRate), value);\n        value.assign(newValue);\n      });\n    });\n    this.incrementIterations();\n  }\n\n  override dispose(): void {\n    if (this.accumulatedUpdates != null) {\n      dispose(this.accumulatedGrads.map(v => v.variable));\n      dispose(this.accumulatedUpdates.map(v => v.variable));\n    }\n  }\n\n  override async getWeights(): Promise<NamedTensor[]> {\n    // Order matters for Python compatibility.\n    const variables: OptimizerVariable[] =\n        [...this.accumulatedGrads, ...this.accumulatedUpdates];\n    return [await this.saveIterations()].concat(\n        variables.map(v => ({name: v.originalName, tensor: v.variable})));\n  }\n\n  override async setWeights(weightValues: NamedTensor[]): Promise<void> {\n    weightValues = await this.extractIterations(weightValues);\n    const variableCount = weightValues.length / 2;\n    const trainable = false;\n    this.accumulatedGrads =\n        weightValues.slice(0, variableCount).map(v => ({\n                                                   originalName: v.name,\n                                                   variable: v.tensor.variable(\n                                                       trainable)\n                                                 }));\n    this.accumulatedUpdates =\n        weightValues.slice(variableCount, variableCount * 2)\n            .map(v => ({\n                   originalName: v.name,\n                   variable: v.tensor.variable(trainable)\n                 }));\n  }\n\n  getConfig(): ConfigDict {\n    return {\n      'learningRate': this.learningRate,\n      'rho': this.rho,\n      'epsilon': this.epsilon\n    };\n  }\n\n  /** @nocollapse */\n  static override fromConfig<T extends Serializable>(\n      cls: SerializableConstructor<T>, config: ConfigDict): T {\n    return new cls(config['learningRate'], config['rho'], config['epsilon']);\n  }\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {dispose, tidy} from '../globals';\nimport {add} from '../ops/add';\nimport {div} from '../ops/div';\nimport {fill} from '../ops/fill';\nimport {mul} from '../ops/mul';\nimport {sqrt} from '../ops/sqrt';\nimport {square} from '../ops/square';\nimport {ConfigDict, Serializable, SerializableConstructor} from '../serialization';\nimport {NamedTensor, NamedVariableMap} from '../tensor_types';\n\nimport {Optimizer, OptimizerVariable} from './optimizer';\n\n/** @doclink Optimizer */\nexport class AdagradOptimizer extends Optimizer {\n  /** @nocollapse */\n  static get className() {\n    // Name matters for Python compatibility.\n    // This is a getter instead of a property because when it's a property, it\n    // prevents the entire class from being tree-shaken.\n    return 'Adagrad';\n  }\n\n  private accumulatedGrads: OptimizerVariable[] = [];\n\n  constructor(\n      protected learningRate: number, private initialAccumulatorValue = 0.1) {\n    super();\n  }\n\n  applyGradients(variableGradients: NamedVariableMap|NamedTensor[]) {\n    const variableNames = Array.isArray(variableGradients) ?\n        variableGradients.map(item => item.name) :\n        Object.keys(variableGradients);\n\n    variableNames.forEach((name, i) => {\n      const value = ENGINE.registeredVariables[name];\n      if (this.accumulatedGrads[i] == null) {\n        const trainable = false;\n        this.accumulatedGrads[i] = {\n          originalName: `${name}/accumulator`,\n          variable: tidy(\n              () => fill(value.shape, this.initialAccumulatorValue)\n                        .variable(trainable))\n        };\n      }\n\n      const gradient = Array.isArray(variableGradients) ?\n          variableGradients[i].tensor :\n          variableGradients[name];\n      if (gradient == null) {\n        return;\n      }\n\n      const accumulatedGrad = this.accumulatedGrads[i].variable;\n\n      tidy(() => {\n        const newAccumulatedGrad = add(accumulatedGrad, square(gradient));\n        accumulatedGrad.assign(newAccumulatedGrad);\n\n        const newValue = add(\n            mul(div(gradient,\n                    sqrt(add(newAccumulatedGrad, ENGINE.backend.epsilon()))),\n                -this.learningRate),\n            value);\n        value.assign(newValue);\n      });\n    });\n    this.incrementIterations();\n  }\n\n  override dispose(): void {\n    if (this.accumulatedGrads != null) {\n      dispose(this.accumulatedGrads.map(v => v.variable));\n    }\n  }\n\n  override async getWeights(): Promise<NamedTensor[]> {\n    // Order matters for Python compatibility.\n    return [await this.saveIterations()].concat(this.accumulatedGrads.map(\n        v => ({name: v.originalName, tensor: v.variable})));\n  }\n\n  override async setWeights(weightValues: NamedTensor[]): Promise<void> {\n    weightValues = await this.extractIterations(weightValues);\n    const trainable = false;\n    this.accumulatedGrads = weightValues.map(\n        v => ({originalName: v.name, variable: v.tensor.variable(trainable)}));\n  }\n\n  getConfig(): ConfigDict {\n    return {\n      'learningRate': this.learningRate,\n      'initialAccumulatorValue': this.initialAccumulatorValue,\n    };\n  }\n\n  /** @nocollapse */\n  static override fromConfig<T extends Serializable>(\n      cls: SerializableConstructor<T>, config: ConfigDict): T {\n    return new cls(config['learningRate'], config['initialAccumulatorValue']);\n  }\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {dispose, tidy} from '../globals';\nimport {add} from '../ops/add';\nimport {div} from '../ops/div';\nimport {mul} from '../ops/mul';\nimport {pow} from '../ops/pow';\nimport {scalar} from '../ops/scalar';\nimport {sqrt} from '../ops/sqrt';\nimport {square} from '../ops/square';\nimport {sub} from '../ops/sub';\nimport {zerosLike} from '../ops/zeros_like';\nimport {ConfigDict, Serializable, SerializableConstructor} from '../serialization';\nimport {Variable} from '../tensor';\nimport {NamedTensor, NamedVariableMap} from '../tensor_types';\n\nimport {Optimizer, OptimizerVariable} from './optimizer';\n\nexport class AdamOptimizer extends Optimizer {\n  /** @nocollapse */\n  static get className() {\n    // Name matters for Python compatibility.\n    // This is a getter instead of a property because when it's a property, it\n    // prevents the entire class from being tree-shaken.\n    return 'Adam';\n  }\n  private accBeta1: Variable;\n  private accBeta2: Variable;\n\n  private accumulatedFirstMoment: OptimizerVariable[] = [];\n  private accumulatedSecondMoment: OptimizerVariable[] = [];\n\n  constructor(\n      protected learningRate: number, protected beta1: number,\n      protected beta2: number, protected epsilon: number = null) {\n    super();\n    tidy(() => {\n      // accB* will be updated by batch.\n      this.accBeta1 = scalar(beta1).variable();\n      this.accBeta2 = scalar(beta2).variable();\n    });\n\n    if (epsilon == null) {\n      this.epsilon = ENGINE.backend.epsilon();\n    }\n  }\n\n  applyGradients(variableGradients: NamedVariableMap|NamedTensor[]) {\n    const varNames = Array.isArray(variableGradients) ?\n        variableGradients.map(v => v.name) :\n        Object.keys(variableGradients);\n    tidy(() => {\n      const oneMinusAccBeta1 = sub(1, this.accBeta1);\n      const oneMinusAccBeta2 = sub(1, this.accBeta2);\n\n      varNames.forEach((name, i) => {\n        const value = ENGINE.registeredVariables[name];\n        const trainable = false;\n        if (this.accumulatedFirstMoment[i] == null) {\n          this.accumulatedFirstMoment[i] = {\n            originalName: `${name}/m`,\n            variable: tidy(() => zerosLike(value).variable(trainable))\n          };\n        }\n        if (this.accumulatedSecondMoment[i] == null) {\n          this.accumulatedSecondMoment[i] = {\n            originalName: `${name}/v`,\n            variable: tidy(() => zerosLike(value).variable(trainable))\n          };\n        }\n\n        const gradient = Array.isArray(variableGradients) ?\n            variableGradients[i].tensor :\n            variableGradients[name];\n        if (gradient == null) {\n          return;\n        }\n\n        const firstMoment = this.accumulatedFirstMoment[i].variable;\n        const secondMoment = this.accumulatedSecondMoment[i].variable;\n\n        const newFirstMoment =\n            add(mul(firstMoment, this.beta1), mul(gradient, 1 - this.beta1));\n        const newSecondMoment =\n            add(mul(secondMoment, this.beta2),\n                mul(square(gradient), 1 - this.beta2));\n\n        const biasCorrectedFirstMoment = div(newFirstMoment, oneMinusAccBeta1);\n        const biasCorrectedSecondMoment =\n            div(newSecondMoment, oneMinusAccBeta2);\n\n        firstMoment.assign(newFirstMoment);\n        secondMoment.assign(newSecondMoment);\n\n        const newValue =\n            add(mul(div(biasCorrectedFirstMoment,\n                        add(sqrt(biasCorrectedSecondMoment), this.epsilon)),\n                    -this.learningRate),\n                value);\n        value.assign(newValue);\n      });\n\n      this.accBeta1.assign(mul(this.accBeta1, this.beta1));\n      this.accBeta2.assign(mul(this.accBeta2, this.beta2));\n    });\n    this.incrementIterations();\n  }\n\n  override dispose(): void {\n    this.accBeta1.dispose();\n    this.accBeta2.dispose();\n\n    if (this.accumulatedFirstMoment != null) {\n      dispose(this.accumulatedFirstMoment.map(v => v.variable));\n    }\n    if (this.accumulatedSecondMoment != null) {\n      dispose(this.accumulatedSecondMoment.map(v => v.variable));\n    }\n  }\n\n  override async getWeights(): Promise<NamedTensor[]> {\n    // Order matters for Python compatibility.\n    const variables: OptimizerVariable[] =\n        [...this.accumulatedFirstMoment, ...this.accumulatedSecondMoment];\n    return [await this.saveIterations()].concat(\n        variables.map(v => ({name: v.originalName, tensor: v.variable})));\n  }\n\n  override async setWeights(weightValues: NamedTensor[]): Promise<void> {\n    weightValues = await this.extractIterations(weightValues);\n    tidy(() => {\n      this.accBeta1.assign(pow(this.beta1, this.iterations_ + 1));\n      this.accBeta2.assign(pow(this.beta2, this.iterations_ + 1));\n    });\n\n    const variableCount = weightValues.length / 2;\n    const trainable = false;\n    this.accumulatedFirstMoment =\n        weightValues.slice(0, variableCount).map(v => ({\n                                                   originalName: v.name,\n                                                   variable: v.tensor.variable(\n                                                       trainable)\n                                                 }));\n    this.accumulatedSecondMoment =\n        weightValues.slice(variableCount, variableCount * 2)\n            .map(v => ({\n                   originalName: v.name,\n                   variable: v.tensor.variable(trainable)\n                 }));\n  }\n\n  getConfig(): ConfigDict {\n    return {\n      'learningRate': this.learningRate,\n      'beta1': this.beta1,\n      'beta2': this.beta2,\n      'epsilon': this.epsilon,\n    };\n  }\n\n  /** @nocollapse */\n  static override fromConfig<T extends Serializable>(\n      cls: SerializableConstructor<T>, config: ConfigDict): T {\n    return new cls(\n        config['learningRate'], config['beta1'], config['beta2'],\n        config['epsilon']);\n  }\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {dispose, tidy} from '../globals';\nimport {abs} from '../ops/abs';\nimport {add} from '../ops/add';\nimport {div} from '../ops/div';\nimport {maximum} from '../ops/maximum';\nimport {mul} from '../ops/mul';\nimport {scalar} from '../ops/scalar';\nimport {sub} from '../ops/sub';\nimport {zerosLike} from '../ops/zeros_like';\nimport {ConfigDict, Serializable, SerializableConstructor} from '../serialization';\nimport {Variable} from '../tensor';\nimport {NamedTensor, NamedVariableMap} from '../tensor_types';\n\nimport {Optimizer, OptimizerVariable} from './optimizer';\n\nexport class AdamaxOptimizer extends Optimizer {\n  /** @nocollapse */\n  static get className() {\n    // Name matters for Python compatibility.\n    // This is a getter instead of a property because when it's a property, it\n    // prevents the entire class from being tree-shaken.\n    return 'Adamax';\n  }\n  private accBeta1: Variable;\n  private iteration: Variable;\n\n  private accumulatedFirstMoment: OptimizerVariable[] = [];\n  private accumulatedWeightedInfNorm: OptimizerVariable[] = [];\n\n  constructor(\n      protected learningRate: number, protected beta1: number,\n      protected beta2: number, protected epsilon: number = null,\n      protected decay = 0.0) {\n    super();\n\n    tidy(() => {\n      this.iteration = scalar(0).variable();\n      this.accBeta1 = scalar(beta1).variable();\n    });\n\n    if (epsilon == null) {\n      this.epsilon = ENGINE.backend.epsilon();\n    }\n  }\n\n  applyGradients(variableGradients: NamedVariableMap|NamedTensor[]) {\n    const variableNames = Array.isArray(variableGradients) ?\n        variableGradients.map(item => item.name) :\n        Object.keys(variableGradients);\n\n    tidy(() => {\n      const oneMinusAccBeta1 = sub(1, this.accBeta1);\n      const lr =\n          div(-this.learningRate, add(mul(this.iteration, this.decay), 1));\n\n      variableNames.forEach((name, i) => {\n        const value = ENGINE.registeredVariables[name];\n        const trainable = false;\n        if (this.accumulatedFirstMoment[i] == null) {\n          this.accumulatedFirstMoment[i] = {\n            originalName: `${name}/m`,\n            variable: zerosLike(value).variable(trainable)\n          };\n        }\n        if (this.accumulatedWeightedInfNorm[i] == null) {\n          this.accumulatedWeightedInfNorm[i] = {\n            originalName: `${name}/v`,\n            variable: zerosLike(value).variable(trainable)\n          };\n        }\n\n        const gradient = Array.isArray(variableGradients) ?\n            variableGradients[i].tensor :\n            variableGradients[name];\n        if (gradient == null) {\n          return;\n        }\n\n        const firstMoment = this.accumulatedFirstMoment[i].variable;\n        const weightedInfNorm = this.accumulatedWeightedInfNorm[i].variable;\n\n        const newFirstMoment =\n            add(mul(firstMoment, this.beta1), mul(gradient, 1 - this.beta1));\n\n        const ut0 = mul(weightedInfNorm, this.beta2);\n        const ut1 = abs(gradient);\n\n        const newWeightedInfNorm = maximum(ut0, ut1);\n\n        firstMoment.assign(newFirstMoment);\n        weightedInfNorm.assign(newWeightedInfNorm);\n\n        const newValue =\n            add(mul(div(lr, oneMinusAccBeta1),\n                    div(newFirstMoment, add(newWeightedInfNorm, this.epsilon))),\n                value);\n\n        value.assign(newValue);\n      });\n\n      this.iteration.assign(add(this.iteration, 1));\n      this.accBeta1.assign(mul(this.accBeta1, this.beta1));\n    });\n    this.incrementIterations();\n  }\n\n  override dispose(): void {\n    this.accBeta1.dispose();\n    this.iteration.dispose();\n\n    if (this.accumulatedFirstMoment != null) {\n      dispose(this.accumulatedFirstMoment.map(v => v.variable));\n    }\n    if (this.accumulatedWeightedInfNorm != null) {\n      dispose(this.accumulatedWeightedInfNorm.map(v => v.variable));\n    }\n  }\n\n  override async getWeights(): Promise<NamedTensor[]> {\n    throw new Error('getWeights() is not implemented for Adamax yet.');\n  }\n\n  override async setWeights(weightValues: NamedTensor[]): Promise<void> {\n    throw new Error('setWeights() is not implemented for Adamax yet.');\n  }\n\n  getConfig(): ConfigDict {\n    return {\n      'learningRate': this.learningRate,\n      'beta1': this.beta1,\n      'beta2': this.beta2,\n      'epsilon': this.epsilon,\n      'decay': this.decay\n    };\n  }\n\n  /** @nocollapse */\n  static override fromConfig<T extends Serializable>(\n      cls: SerializableConstructor<T>, config: ConfigDict): T {\n    return new cls(\n        config['learningRate'], config['beta1'], config['beta2'],\n        config['epsilon'], config['decay']);\n  }\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {keep, tidy} from '../globals';\nimport {add} from '../ops/add';\nimport {mul} from '../ops/mul';\nimport {scalar} from '../ops/scalar';\nimport {ConfigDict, Serializable, SerializableConstructor} from '../serialization';\nimport {Scalar} from '../tensor';\nimport {NamedTensor, NamedTensorMap} from '../tensor_types';\n\nimport {Optimizer} from './optimizer';\n\n/** @doclink Optimizer */\nexport class SGDOptimizer extends Optimizer {\n  /** @nocollapse */\n  static get className() {\n    // Name matters for Python compatibility.\n    // This is a getter instead of a property because when it's a property, it\n    // prevents the entire class from being tree-shaken.\n    return 'SGD';\n  }\n  protected c: Scalar;\n\n  constructor(protected learningRate: number) {\n    super();\n    this.setLearningRate(learningRate);\n  }\n\n  applyGradients(variableGradients: NamedTensorMap|NamedTensor[]) {\n    const varNames = Array.isArray(variableGradients) ?\n        variableGradients.map(v => v.name) :\n        Object.keys(variableGradients);\n    varNames.forEach((name, i) => {\n      const gradient = Array.isArray(variableGradients) ?\n          variableGradients[i].tensor :\n          variableGradients[name];\n      if (gradient == null) {\n        return;\n      }\n      const value = ENGINE.registeredVariables[name];\n      tidy(() => {\n        const newValue = add(mul(this.c, gradient), value);\n        value.assign(newValue);\n      });\n    });\n    this.incrementIterations();\n  }\n\n  /**\n   * Sets the learning rate of the optimizer.\n   */\n  setLearningRate(learningRate: number) {\n    this.learningRate = learningRate;\n    if (this.c != null) {\n      this.c.dispose();\n    }\n    this.c = keep(scalar(-learningRate));\n  }\n\n  override dispose() {\n    this.c.dispose();\n  }\n\n  override async getWeights(): Promise<NamedTensor[]> {\n    return [await this.saveIterations()];\n  }\n\n  override async setWeights(weightValues: NamedTensor[]): Promise<void> {\n    weightValues = await this.extractIterations(weightValues);\n    if (weightValues.length !== 0) {\n      throw new Error('SGD optimizer does not have settable weights.');\n    }\n  }\n\n  getConfig(): ConfigDict {\n    return {'learningRate': this.learningRate};\n  }\n\n  /** @nocollapse */\n  static override fromConfig<T extends Serializable>(\n      cls: SerializableConstructor<T>, config: ConfigDict): T {\n    return new cls(config['learningRate']);\n  }\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {dispose, tidy} from '../globals';\nimport {add} from '../ops/add';\nimport {mul} from '../ops/mul';\nimport {scalar} from '../ops/scalar';\nimport {zerosLike} from '../ops/zeros_like';\nimport {ConfigDict, Serializable, SerializableConstructor} from '../serialization';\nimport {Scalar, Tensor} from '../tensor';\nimport {NamedTensor, NamedVariableMap} from '../tensor_types';\n\nimport {OptimizerVariable} from './optimizer';\nimport {SGDOptimizer} from './sgd_optimizer';\n\n/** @doclink Optimizer */\nexport class MomentumOptimizer extends SGDOptimizer {\n  /** @nocollapse */\n  // Name matters for Python compatibility.\n  static override get className() {\n    // Name matters for Python compatibility.\n    // This is a getter instead of a property because when it's a property, it\n    // prevents the entire class from being tree-shaken.\n    return 'Momentum';\n  }\n  private m: Scalar;\n  private accumulations: OptimizerVariable[] = [];\n\n  constructor(\n      protected override learningRate: number, private momentum: number,\n      private useNesterov = false) {\n    super(learningRate);\n    this.m = scalar(this.momentum);\n  }\n\n  override applyGradients(variableGradients: NamedVariableMap|NamedTensor[]) {\n    const variableNames = Array.isArray(variableGradients) ?\n        variableGradients.map(item => item.name) :\n        Object.keys(variableGradients);\n\n    variableNames.forEach((name, i) => {\n      const value = ENGINE.registeredVariables[name];\n      if (this.accumulations[i] == null) {\n        const trainable = false;\n        this.accumulations[i] = {\n          originalName: `${name}/momentum`,\n          variable: tidy(() => zerosLike(value).variable(trainable))\n        };\n      }\n\n      const accumulation = this.accumulations[i].variable;\n      const gradient = Array.isArray(variableGradients) ?\n          variableGradients[i].tensor :\n          variableGradients[name];\n      if (gradient == null) {\n        return;\n      }\n\n      tidy(() => {\n        let newValue: Tensor;\n        const newAccumulation = add(mul(this.m, accumulation), gradient);\n        if (this.useNesterov) {\n          newValue = add(\n              mul(this.c, add(gradient, mul(newAccumulation, this.m))), value);\n        } else {\n          newValue = add(mul(this.c, newAccumulation), value);\n        }\n        accumulation.assign(newAccumulation);\n        value.assign(newValue);\n      });\n    });\n    this.incrementIterations();\n  }\n\n  override dispose(): void {\n    this.m.dispose();\n    if (this.accumulations != null) {\n      dispose(this.accumulations.map(v => v.variable));\n    }\n  }\n\n  /**\n   * Sets the momentum of the optimizer.\n   *\n   * @param momentum\n   */\n  setMomentum(momentum: number) {\n    this.momentum = momentum;\n  }\n\n  override async getWeights(): Promise<NamedTensor[]> {\n    // Order matters for Python compatibility.\n    return [await this.saveIterations()].concat(this.accumulations.map(\n        v => ({name: v.originalName, tensor: v.variable})));\n  }\n\n  override async setWeights(weightValues: NamedTensor[]): Promise<void> {\n    weightValues = await this.extractIterations(weightValues);\n    const trainable = false;\n    this.accumulations = weightValues.map(\n        v => ({originalName: v.name, variable: v.tensor.variable(trainable)}));\n  }\n\n  override getConfig(): ConfigDict {\n    return {\n      'learningRate': this.learningRate,\n      'momentum': this.momentum,\n      'useNesterov': this.useNesterov\n    };\n  }\n\n  /** @nocollapse */\n  static override fromConfig<T extends Serializable>(\n      cls: SerializableConstructor<T>, config: ConfigDict): T {\n    return new cls(\n        config['learningRate'], config['momentum'], config['useNesterov']);\n  }\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {dispose, tidy} from '../globals';\nimport {add} from '../ops/add';\nimport {div} from '../ops/div';\nimport {mul} from '../ops/mul';\nimport {sqrt} from '../ops/sqrt';\nimport {square} from '../ops/square';\nimport {sub} from '../ops/sub';\nimport {zerosLike} from '../ops/zeros_like';\nimport {ConfigDict, Serializable, SerializableConstructor} from '../serialization';\nimport {NamedTensor, NamedTensorMap} from '../tensor_types';\n\nimport {Optimizer, OptimizerVariable} from './optimizer';\n\n/** @doclink Optimizer */\nexport class RMSPropOptimizer extends Optimizer {\n  /** @nocollapse */\n  static get className() {\n    // Name matters for Python compatibility.\n    // This is a getter instead of a property because when it's a property, it\n    // prevents the entire class from being tree-shaken.\n    return 'RMSProp';\n  }\n  private centered: boolean;\n\n  private accumulatedMeanSquares: OptimizerVariable[] = [];\n  private accumulatedMoments: OptimizerVariable[] = [];\n  private accumulatedMeanGrads: OptimizerVariable[] = [];\n\n  constructor(\n      protected learningRate: number, protected decay = 0.9,\n      protected momentum = 0.0, protected epsilon: number = null,\n      centered = false) {\n    super();\n\n    this.centered = centered;\n\n    if (epsilon == null) {\n      this.epsilon = ENGINE.backend.epsilon();\n    }\n    if (learningRate == null) {\n      throw new Error(`learningRate for RMSPropOptimizer must be defined.`);\n    }\n  }\n\n  applyGradients(variableGradients: NamedTensorMap|NamedTensor[]) {\n    const variableNames = Array.isArray(variableGradients) ?\n        variableGradients.map(item => item.name) :\n        Object.keys(variableGradients);\n\n    variableNames.forEach((name, i) => {\n      const value = ENGINE.registeredVariables[name];\n      const trainable = false;\n      if (this.accumulatedMeanSquares[i] == null) {\n        this.accumulatedMeanSquares[i] = {\n          originalName: `${name}/rms`,\n          variable: tidy(() => zerosLike(value).variable(trainable))\n        };\n      }\n      if (this.accumulatedMoments[i] == null) {\n        this.accumulatedMoments[i] = {\n          originalName: `${name}/momentum`,\n          variable: tidy(() => zerosLike(value).variable(trainable))\n        };\n      }\n      if (this.accumulatedMeanGrads[i] == null && this.centered) {\n        this.accumulatedMeanGrads[i] = {\n          originalName: `${name}/mg`,\n          variable: tidy(() => zerosLike(value).variable(trainable))\n        };\n      }\n\n      const gradient = Array.isArray(variableGradients) ?\n          variableGradients[i].tensor :\n          variableGradients[name];\n      if (gradient == null) {\n        return;\n      }\n\n      const accumulatedMeanSquare = this.accumulatedMeanSquares[i].variable;\n      const accumulatedMoments = this.accumulatedMoments[i].variable;\n      tidy(() => {\n        const newAccumulatedMeanSquare =\n            add(mul(accumulatedMeanSquare, this.decay),\n                mul(square(gradient), 1 - this.decay));\n\n        if (this.centered) {\n          const accumulatedMeanGrad = this.accumulatedMeanGrads[i].variable;\n          // Centered gradient\n          const newAccumulatedMeanGrad =\n              add(mul(accumulatedMeanGrad, this.decay),\n                  mul(gradient, 1 - this.decay));\n\n          const gradContribution =\n              div(mul(gradient, this.learningRate),\n                  sqrt(\n                      sub(newAccumulatedMeanSquare,\n                          add(square(newAccumulatedMeanGrad), this.epsilon))));\n          const newAccumulatedMoments =\n              add(mul(accumulatedMoments, this.momentum), gradContribution);\n\n          accumulatedMeanSquare.assign(newAccumulatedMeanSquare);\n          accumulatedMeanGrad.assign(newAccumulatedMeanGrad);\n          accumulatedMoments.assign(newAccumulatedMoments);\n\n          const newValue = sub(value, newAccumulatedMoments);\n          value.assign(newValue);\n        } else {\n          // Plain gradient\n          const newAccumulatedMeanSquare =\n              add(mul(accumulatedMeanSquare, this.decay),\n                  mul(square(gradient), 1 - this.decay));\n\n          const newAccumulatedMoments =\n              add(mul(accumulatedMoments, this.momentum),\n                  div(mul(gradient, this.learningRate),\n                      sqrt(add(newAccumulatedMeanSquare, this.epsilon))));\n\n          accumulatedMeanSquare.assign(newAccumulatedMeanSquare);\n          accumulatedMoments.assign(newAccumulatedMoments);\n\n          const newValue = sub(value, newAccumulatedMoments);\n          value.assign(newValue);\n        }\n      });\n    });\n    this.incrementIterations();\n  }\n\n  override dispose(): void {\n    if (this.accumulatedMeanSquares != null) {\n      dispose(this.accumulatedMeanSquares.map(v => v.variable));\n    }\n    if (this.accumulatedMeanGrads != null && this.centered) {\n      dispose(this.accumulatedMeanGrads.map(v => v.variable));\n    }\n    if (this.accumulatedMoments != null) {\n      dispose(this.accumulatedMoments.map(v => v.variable));\n    }\n  }\n\n  override async getWeights(): Promise<NamedTensor[]> {\n    // Order matters for Python compatibility.\n    const variables: OptimizerVariable[] =\n        [...this.accumulatedMeanSquares, ...this.accumulatedMoments];\n    if (this.centered) {\n      variables.push(...this.accumulatedMeanGrads);\n    }\n    return [await this.saveIterations()].concat(\n        variables.map(v => ({name: v.originalName, tensor: v.variable})));\n  }\n\n  override async setWeights(weightValues: NamedTensor[]): Promise<void> {\n    weightValues = await this.extractIterations(weightValues);\n    const variableCount =\n        this.centered ? weightValues.length / 3 : weightValues.length / 2;\n    const trainable = false;\n    this.accumulatedMeanSquares =\n        weightValues.slice(0, variableCount).map(v => ({\n                                                   originalName: v.name,\n                                                   variable: v.tensor.variable(\n                                                       trainable)\n                                                 }));\n    this.accumulatedMoments =\n        weightValues.slice(variableCount, variableCount * 2)\n            .map(v => ({\n                   originalName: v.name,\n                   variable: v.tensor.variable(trainable)\n                 }));\n    if (this.centered) {\n      this.accumulatedMeanGrads =\n          weightValues.slice(variableCount * 2, variableCount * 3)\n              .map(v => ({\n                     originalName: v.name,\n                     variable: v.tensor.variable(trainable)\n                   }));\n    }\n  }\n\n  getConfig(): ConfigDict {\n    return {\n      'learningRate': this.learningRate,\n      'decay': this.decay,\n      'momentum': this.momentum,\n      'epsilon': this.epsilon,\n      'centered': this.centered\n    };\n  }\n\n  /** @nocollapse */\n  static override fromConfig<T extends Serializable>(\n      cls: SerializableConstructor<T>, config: ConfigDict): T {\n    return new cls(\n        config['learningRate'], config['decay'], config['momentum'],\n        config['epsilon'], config['centered']);\n  }\n}\n", "/**\n * @license\n * Copyright 2022 Google LLC.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {AdadeltaOptimizer} from './adadelta_optimizer';\nimport {AdagradOptimizer} from './adagrad_optimizer';\nimport {AdamOptimizer} from './adam_optimizer';\nimport {AdamaxOptimizer} from './adamax_optimizer';\nimport {MomentumOptimizer} from './momentum_optimizer';\nimport {RMSPropOptimizer} from './rmsprop_optimizer';\nimport {SGDOptimizer} from './sgd_optimizer';\nimport {registerClass} from '../serialization';\n\nconst OPTIMIZERS = [\n  AdadeltaOptimizer,\n  AdagradOptimizer,\n  AdamOptimizer,\n  AdamaxOptimizer,\n  MomentumOptimizer,\n  RMSPropOptimizer,\n  SGDOptimizer,\n];\n\nexport function registerOptimizers() {\n  for (const optimizer of OPTIMIZERS) {\n    registerClass(optimizer);\n  }\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/**\n * IOHandlers related to files, such as browser-triggered file downloads,\n * user-selected files in browser.\n */\n\nimport '../flags';\nimport {env} from '../environment';\n\nimport {basename, getModelArtifactsForJSON, getModelArtifactsInfoForJSON, getModelJSONForModelArtifacts} from './io_utils';\nimport {IORouter, IORouterRegistry} from './router_registry';\nimport {IOHandler, ModelArtifacts, ModelJSON, SaveResult, WeightData, WeightsManifestConfig, WeightsManifestEntry} from './types';\nimport {CompositeArrayBuffer} from './composite_array_buffer';\n\nconst DEFAULT_FILE_NAME_PREFIX = 'model';\nconst DEFAULT_JSON_EXTENSION_NAME = '.json';\nconst DEFAULT_WEIGHT_DATA_EXTENSION_NAME = '.weights.bin';\n\nfunction defer<T>(f: () => T): Promise<T> {\n  return new Promise(resolve => setTimeout(resolve)).then(f);\n}\n\nexport class BrowserDownloads implements IOHandler {\n  private readonly modelJsonFileName: string;\n  private readonly weightDataFileName: string;\n  private readonly modelJsonAnchor: HTMLAnchorElement;\n  private readonly weightDataAnchor: HTMLAnchorElement;\n\n  static readonly URL_SCHEME = 'downloads://';\n\n  constructor(fileNamePrefix?: string) {\n    if (!env().getBool('IS_BROWSER')) {\n      // TODO(cais): Provide info on what IOHandlers are available under the\n      //   current environment.\n      throw new Error(\n          'browserDownloads() cannot proceed because the current environment ' +\n          'is not a browser.');\n    }\n\n    if (fileNamePrefix.startsWith(BrowserDownloads.URL_SCHEME)) {\n      fileNamePrefix = fileNamePrefix.slice(BrowserDownloads.URL_SCHEME.length);\n    }\n    if (fileNamePrefix == null || fileNamePrefix.length === 0) {\n      fileNamePrefix = DEFAULT_FILE_NAME_PREFIX;\n    }\n\n    this.modelJsonFileName = fileNamePrefix + DEFAULT_JSON_EXTENSION_NAME;\n    this.weightDataFileName =\n        fileNamePrefix + DEFAULT_WEIGHT_DATA_EXTENSION_NAME;\n  }\n\n  async save(modelArtifacts: ModelArtifacts): Promise<SaveResult> {\n    if (typeof (document) === 'undefined') {\n      throw new Error(\n          'Browser downloads are not supported in ' +\n          'this environment since `document` is not present');\n    }\n\n    // TODO(mattsoulanille): Support saving models over 2GB that exceed\n    // Chrome's ArrayBuffer size limit.\n    const weightBuffer = CompositeArrayBuffer.join(modelArtifacts.weightData);\n\n    const weightsURL = window.URL.createObjectURL(new Blob(\n        [weightBuffer], {type: 'application/octet-stream'}));\n\n    if (modelArtifacts.modelTopology instanceof ArrayBuffer) {\n      throw new Error(\n          'BrowserDownloads.save() does not support saving model topology ' +\n          'in binary formats yet.');\n    } else {\n      const weightsManifest: WeightsManifestConfig = [{\n        paths: ['./' + this.weightDataFileName],\n        weights: modelArtifacts.weightSpecs\n      }];\n      const modelJSON: ModelJSON =\n          getModelJSONForModelArtifacts(modelArtifacts, weightsManifest);\n\n      const modelJsonURL = window.URL.createObjectURL(\n          new Blob([JSON.stringify(modelJSON)], {type: 'application/json'}));\n\n      // If anchor elements are not provided, create them without attaching them\n      // to parents, so that the downloaded file names can be controlled.\n      const jsonAnchor = this.modelJsonAnchor == null ?\n          document.createElement('a') :\n          this.modelJsonAnchor;\n      jsonAnchor.download = this.modelJsonFileName;\n      jsonAnchor.href = modelJsonURL;\n      // Trigger downloads by evoking a click event on the download anchors.\n      // When multiple downloads are started synchronously, Firefox will only\n      // save the last one.\n      await defer(() => jsonAnchor.dispatchEvent(new MouseEvent('click')));\n\n      if (modelArtifacts.weightData != null) {\n        const weightDataAnchor = this.weightDataAnchor == null ?\n            document.createElement('a') :\n            this.weightDataAnchor;\n        weightDataAnchor.download = this.weightDataFileName;\n        weightDataAnchor.href = weightsURL;\n        await defer(\n            () => weightDataAnchor.dispatchEvent(new MouseEvent('click')));\n      }\n\n      return {modelArtifactsInfo: getModelArtifactsInfoForJSON(modelArtifacts)};\n    }\n  }\n}\n\nclass BrowserFiles implements IOHandler {\n  private readonly jsonFile: File;\n  private readonly weightsFiles: File[];\n\n  constructor(files: File[]) {\n    if (files == null || files.length < 1) {\n      throw new Error(\n          `When calling browserFiles, at least 1 file is required, ` +\n          `but received ${files}`);\n    }\n    this.jsonFile = files[0];\n    this.weightsFiles = files.slice(1);\n  }\n\n  async load(): Promise<ModelArtifacts> {\n    return new Promise((resolve, reject) => {\n      const jsonReader = new FileReader();\n      jsonReader.onload = (event: Event) => {\n        // tslint:disable-next-line:no-any\n        const modelJSON = JSON.parse((event.target as any).result) as ModelJSON;\n\n        const modelTopology = modelJSON.modelTopology;\n        if (modelTopology == null) {\n          reject(new Error(`modelTopology field is missing from file ${\n              this.jsonFile.name}`));\n          return;\n        }\n\n        const weightsManifest = modelJSON.weightsManifest;\n        if (weightsManifest == null) {\n          reject(new Error(`weightManifest field is missing from file ${\n              this.jsonFile.name}`));\n          return;\n        }\n\n        if (this.weightsFiles.length === 0) {\n          resolve({modelTopology});\n          return;\n        }\n\n        const modelArtifactsPromise = getModelArtifactsForJSON(\n            modelJSON, (weightsManifest) => this.loadWeights(weightsManifest));\n        resolve(modelArtifactsPromise);\n      };\n\n      jsonReader.onerror = error => reject(\n          `Failed to read model topology and weights manifest JSON ` +\n          `from file '${this.jsonFile.name}'. BrowserFiles supports loading ` +\n          `Keras-style tf.Model artifacts only.`);\n      jsonReader.readAsText(this.jsonFile);\n    });\n  }\n\n  private loadWeights(weightsManifest: WeightsManifestConfig): Promise<[\n    /* weightSpecs */ WeightsManifestEntry[], WeightData,\n  ]> {\n    const weightSpecs: WeightsManifestEntry[] = [];\n    const paths: string[] = [];\n    for (const entry of weightsManifest) {\n      weightSpecs.push(...entry.weights);\n      paths.push(...entry.paths);\n    }\n\n    const pathToFile: {[path: string]: File} =\n        this.checkManifestAndWeightFiles(weightsManifest);\n\n    const promises: Array<Promise<ArrayBuffer>> =\n        paths.map(path => this.loadWeightsFile(path, pathToFile[path]));\n\n    return Promise.all(promises).then(\n        buffers => [weightSpecs, buffers]);\n  }\n\n  private loadWeightsFile(path: string, file: File): Promise<ArrayBuffer> {\n    return new Promise((resolve, reject) => {\n      const weightFileReader = new FileReader();\n      weightFileReader.onload = (event: Event) => {\n        // tslint:disable-next-line:no-any\n        const weightData = (event.target as any).result as ArrayBuffer;\n        resolve(weightData);\n      };\n      weightFileReader.onerror = error =>\n          reject(`Failed to weights data from file of path '${path}'.`);\n      weightFileReader.readAsArrayBuffer(file);\n    });\n  }\n\n  /**\n   * Check the compatibility between weights manifest and weight files.\n   */\n  private checkManifestAndWeightFiles(manifest: WeightsManifestConfig):\n      {[path: string]: File} {\n    const basenames: string[] = [];\n    const fileNames = this.weightsFiles.map(file => basename(file.name));\n    const pathToFile: {[path: string]: File} = {};\n    for (const group of manifest) {\n      group.paths.forEach(path => {\n        const pathBasename = basename(path);\n        if (basenames.indexOf(pathBasename) !== -1) {\n          throw new Error(\n              `Duplicate file basename found in weights manifest: ` +\n              `'${pathBasename}'`);\n        }\n        basenames.push(pathBasename);\n        if (fileNames.indexOf(pathBasename) === -1) {\n          throw new Error(\n              `Weight file with basename '${pathBasename}' is not provided.`);\n        } else {\n          pathToFile[path] = this.weightsFiles[fileNames.indexOf(pathBasename)];\n        }\n      });\n    }\n\n    if (basenames.length !== this.weightsFiles.length) {\n      throw new Error(\n          `Mismatch in the number of files in weights manifest ` +\n          `(${basenames.length}) and the number of weight files provided ` +\n          `(${this.weightsFiles.length}).`);\n    }\n    return pathToFile;\n  }\n}\n\nexport const browserDownloadsRouter: IORouter = (url: string|string[]) => {\n  if (!env().getBool('IS_BROWSER')) {\n    return null;\n  } else {\n    if (!Array.isArray(url) && url.startsWith(BrowserDownloads.URL_SCHEME)) {\n      return browserDownloads(url.slice(BrowserDownloads.URL_SCHEME.length));\n    } else {\n      return null;\n    }\n  }\n};\nIORouterRegistry.registerSaveRouter(browserDownloadsRouter);\n\n/**\n * Creates an IOHandler that triggers file downloads from the browser.\n *\n * The returned `IOHandler` instance can be used as model exporting methods such\n * as `tf.Model.save` and supports only saving.\n *\n * ```js\n * const model = tf.sequential();\n * model.add(tf.layers.dense(\n *     {units: 1, inputShape: [10], activation: 'sigmoid'}));\n * const saveResult = await model.save('downloads://mymodel');\n * // This will trigger downloading of two files:\n * //   'mymodel.json' and 'mymodel.weights.bin'.\n * console.log(saveResult);\n * ```\n *\n * @param fileNamePrefix Prefix name of the files to be downloaded. For use with\n *   `tf.Model`, `fileNamePrefix` should follow either of the following two\n *   formats:\n *   1. `null` or `undefined`, in which case the default file\n *      names will be used:\n *      - 'model.json' for the JSON file containing the model topology and\n *        weights manifest.\n *      - 'model.weights.bin' for the binary file containing the binary weight\n *        values.\n *   2. A single string or an Array of a single string, as the file name prefix.\n *      For example, if `'foo'` is provided, the downloaded JSON\n *      file and binary weights file will be named 'foo.json' and\n *      'foo.weights.bin', respectively.\n * @param config Additional configuration for triggering downloads.\n * @returns An instance of `BrowserDownloads` `IOHandler`.\n *\n * @doc {\n *   heading: 'Models',\n *   subheading: 'Loading',\n *   namespace: 'io',\n *   ignoreCI: true\n * }\n */\nexport function browserDownloads(fileNamePrefix = 'model'): IOHandler {\n  return new BrowserDownloads(fileNamePrefix);\n}\n\n/**\n * Creates an IOHandler that loads model artifacts from user-selected files.\n *\n * This method can be used for loading from files such as user-selected files\n * in the browser.\n * When used in conjunction with `tf.loadLayersModel`, an instance of\n * `tf.LayersModel` (Keras-style) can be constructed from the loaded artifacts.\n *\n * ```js\n * // Note: This code snippet won't run properly without the actual file input\n * //   elements in the HTML DOM.\n *\n * // Suppose there are two HTML file input (`<input type=\"file\" ...>`)\n * // elements.\n * const uploadJSONInput = document.getElementById('upload-json');\n * const uploadWeightsInput = document.getElementById('upload-weights');\n * const model = await tf.loadLayersModel(tf.io.browserFiles(\n *     [uploadJSONInput.files[0], uploadWeightsInput.files[0]]));\n * ```\n *\n * @param files `File`s to load from. Currently, this function supports only\n *   loading from files that contain Keras-style models (i.e., `tf.Model`s), for\n *   which an `Array` of `File`s is expected (in that order):\n *   - A JSON file containing the model topology and weight manifest.\n *   - Optionally, one or more binary files containing the binary weights.\n *     These files must have names that match the paths in the `weightsManifest`\n *     contained by the aforementioned JSON file, or errors will be thrown\n *     during loading. These weights files have the same format as the ones\n *     generated by `tensorflowjs_converter` that comes with the `tensorflowjs`\n *     Python PIP package. If no weights files are provided, only the model\n *     topology will be loaded from the JSON file above.\n * @returns An instance of `Files` `IOHandler`.\n *\n * @doc {\n *   heading: 'Models',\n *   subheading: 'Loading',\n *   namespace: 'io',\n *   ignoreCI: true\n * }\n */\nexport function browserFiles(files: File[]): IOHandler {\n  return new BrowserFiles(files);\n}\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {assert} from '../util';\n\nimport {OnProgressCallback} from './types';\n\n/**\n * Monitor Promise.all progress, fire onProgress callback function.\n *\n * @param promises Promise list going to be monitored\n * @param onProgress Callback function. Fired when a promise resolved.\n * @param startFraction Optional fraction start. Default to 0.\n * @param endFraction Optional fraction end. Default to 1.\n */\nexport function monitorPromisesProgress<T>(\n    promises: Array<Promise<T>>, onProgress: OnProgressCallback,\n    startFraction?: number, endFraction?: number) {\n  checkPromises(promises);\n  startFraction = startFraction == null ? 0 : startFraction;\n  endFraction = endFraction == null ? 1 : endFraction;\n  checkFraction(startFraction, endFraction);\n  let resolvedPromise = 0;\n\n  const registerMonitor = (promise: Promise<T>) => {\n    promise.then(value => {\n      const fraction = startFraction +\n          ++resolvedPromise / promises.length * (endFraction - startFraction);\n      // pass fraction as parameter to callback function.\n      onProgress(fraction);\n      return value;\n    });\n    return promise;\n  };\n\n  function checkPromises(promises: Array<Promise<T>>): void {\n    assert(\n        promises != null && Array.isArray(promises) && promises.length > 0,\n        () => 'promises must be a none empty array');\n  }\n\n  function checkFraction(startFraction: number, endFraction: number): void {\n    assert(\n        startFraction >= 0 && startFraction <= 1,\n        () => `Progress fraction must be in range [0, 1], but ` +\n            `got startFraction ${startFraction}`);\n    assert(\n        endFraction >= 0 && endFraction <= 1,\n        () => `Progress fraction must be in range [0, 1], but ` +\n            `got endFraction ${endFraction}`);\n    assert(\n        endFraction >= startFraction,\n        () => `startFraction must be no more than endFraction, but ` +\n            `got startFraction ${startFraction} and endFraction ` +\n            `${endFraction}`);\n  }\n\n  return Promise.all(promises.map(registerMonitor));\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {env} from '../environment';\n\nimport {NamedTensorMap} from '../tensor_types';\nimport * as util from '../util';\nimport {CompositeArrayBuffer} from './composite_array_buffer';\nimport {decodeWeights} from './io_utils';\nimport {monitorPromisesProgress} from './progress';\nimport {DTYPE_VALUE_SIZE_MAP, LoadOptions, WeightsManifestConfig, WeightsManifestEntry} from './types';\n\n/**\n * Reads binary weights data from a number of URLs.\n *\n * @param fetchURLs URLs to send the HTTP requests at, using `fetch` calls.\n * @param requestOptions RequestInit (options) for the HTTP requests.\n * @param fetchFunc Optional overriding value for the `window.fetch` function.\n * @param onProgress Optional, progress callback function, fired periodically\n *   before the load is completed.\n * @returns A `Promise` of an Array of `ArrayBuffer`. The Array has the same\n *   length as `fetchURLs`.\n */\nexport async function loadWeightsAsArrayBuffer(\n  fetchURLs: string[], loadOptions?: LoadOptions): Promise<ArrayBuffer[]> {\n  if (loadOptions == null) {\n    loadOptions = {};\n  }\n\n  const fetchFunc = loadOptions.fetchFunc == null ? env().platform.fetch :\n    loadOptions.fetchFunc;\n\n  // Create the requests for all of the weights in parallel.\n  const requests = fetchURLs.map(\n    fetchURL =>\n      fetchFunc(fetchURL, loadOptions.requestInit, { isBinary: true }));\n\n  const fetchStartFraction = 0;\n  const fetchEndFraction = 0.5;\n\n  const responses = loadOptions.onProgress == null ?\n    await Promise.all(requests) :\n    await monitorPromisesProgress(\n      requests, loadOptions.onProgress, fetchStartFraction,\n      fetchEndFraction);\n\n  const bufferPromises = responses.map(response => response.arrayBuffer());\n\n  const bufferStartFraction = 0.5;\n  const bufferEndFraction = 1;\n\n  const buffers = loadOptions.onProgress == null ?\n    await Promise.all(bufferPromises) :\n    await monitorPromisesProgress(\n      bufferPromises, loadOptions.onProgress, bufferStartFraction,\n      bufferEndFraction);\n  return buffers;\n}\n\nexport function streamWeights(fetchURLs: string[], loadOptions: LoadOptions): ReadableStream<ArrayBuffer> {\n  const fetchFunc = loadOptions.fetchFunc == null ? env().platform.fetch :\n    loadOptions.fetchFunc;\n\n  let fetchIndex = 0;\n  let chunkReader: ReadableStreamDefaultReader<Uint8Array> | undefined;\n  loadOptions.onProgress?.(0);\n  return new ReadableStream<Uint8Array>({\n    pull: async (controller) => {\n      while (fetchIndex < fetchURLs.length) {\n        if (!chunkReader) {\n          const body = (await fetchFunc(fetchURLs[fetchIndex],\n                                         loadOptions.requestInit,\n                                         {isBinary: true})).body;\n\n          chunkReader = body.getReader();\n        }\n\n        const {done, value} = await chunkReader.read();\n\n        if (done) {\n          fetchIndex++;\n          chunkReader = undefined;\n          loadOptions.onProgress?.(fetchIndex / fetchURLs.length);\n          continue;\n        }\n        controller.enqueue(value);\n        return;\n      }\n      controller.close();\n    },\n  });\n}\n\n/**\n * Reads a weights manifest JSON configuration, fetches the weights and\n * returns them as `Tensor`s.\n *\n * @param manifest The weights manifest JSON.\n * @param filePathPrefix The path prefix for filenames given in the manifest.\n *     Defaults to the empty string.\n * @param weightNames The names of the weights to be fetched.\n */\nexport async function loadWeights(\n  manifest: WeightsManifestConfig, filePathPrefix = '',\n  weightNames?: string[],\n  requestInit?: RequestInit): Promise<NamedTensorMap> {\n  // TODO(nsthorat): Groups are currently fetched atomically. If you need a\n  // single weight from a group, the whole group will be fetched. At a future\n  // date, we should support fetching only the individual shards within a\n  // group that are needed to reconstruct the requested weight.\n  // TODO(cais): Use `decodeWeights` for implementation.\n\n  const fetchWeights = (fetchUrls: string[]) =>\n    loadWeightsAsArrayBuffer(fetchUrls, { requestInit });\n  const loadWeights = weightsLoaderFactory(fetchWeights);\n\n  return loadWeights(manifest, filePathPrefix, weightNames);\n}\n\n/**\n * Creates a function, which reads a weights manifest JSON configuration,\n * fetches the weight files using the specified function and returns them as\n * `Tensor`s.\n *\n * ```js\n * // example for creating a nodejs weight loader, which reads the weight files\n * // from disk using fs.readFileSync\n *\n * import * as fs from 'fs'\n *\n * const fetchWeightsFromDisk = (filePaths: string[]) =>\n *   filePaths.map(filePath => fs.readFileSync(filePath).buffer)\n *\n * const loadWeights = tf.io.weightsLoaderFactory(fetchWeightsFromDisk)\n *\n * const manifest = JSON.parse(\n *   fs.readFileSync('./my_model-weights_manifest').toString()\n * )\n * const weightMap = await loadWeights(manifest, './')\n * ```\n * @param fetchWeightsFunction The function used for fetching the weight files.\n * @returns Weight loading function.\n */\nexport function weightsLoaderFactory(\n  fetchWeightsFunction: (fetchUrls: string[]) => Promise<ArrayBuffer[]>):\n  (manifest: WeightsManifestConfig, filePathPrefix?: string,\n    weightNames?: string[]) => Promise<NamedTensorMap> {\n  return async (\n    manifest: WeightsManifestConfig, filePathPrefix = '',\n    weightNames?: string[]): Promise<NamedTensorMap> => {\n    // Collect all the groups, weights, and their relative offsets to be\n    // fetched.\n    const groupIndicesToFetchMap = manifest.map(() => false);\n    const groupWeightsToFetch: {\n      [group: number]: Array<{\n        manifestEntry: WeightsManifestEntry; groupOffset: number;\n        sizeBytes: number;\n      }>\n    } = {};\n    const weightsFound =\n      weightNames != null ? weightNames.map(() => false) : [];\n    const allManifestWeightNames: string[] = [];\n    manifest.forEach((manifestGroupConfig, groupIndex) => {\n      let groupOffset = 0;\n      manifestGroupConfig.weights.forEach(weightsEntry => {\n        const rawDtype = ('quantization' in weightsEntry) ?\n          weightsEntry.quantization.dtype :\n          weightsEntry.dtype;\n\n        const weightsBytes = DTYPE_VALUE_SIZE_MAP[rawDtype] *\n          util.sizeFromShape(weightsEntry.shape);\n\n        const enqueueWeightsForFetchingFn = () => {\n          groupIndicesToFetchMap[groupIndex] = true;\n          if (groupWeightsToFetch[groupIndex] == null) {\n            groupWeightsToFetch[groupIndex] = [];\n          }\n\n          groupWeightsToFetch[groupIndex].push({\n            manifestEntry: weightsEntry,\n            groupOffset,\n            sizeBytes: weightsBytes\n          });\n        };\n\n        if (weightNames != null) {\n          weightNames.forEach((weightName, weightIndex) => {\n            if (weightName === weightsEntry.name) {\n              enqueueWeightsForFetchingFn();\n              weightsFound[weightIndex] = true;\n            }\n          });\n        } else {\n          enqueueWeightsForFetchingFn();\n        }\n\n        allManifestWeightNames.push(weightsEntry.name);\n        groupOffset += weightsBytes;\n      });\n    });\n\n    if (!weightsFound.every(found => found)) {\n      const weightsNotFound = weightNames.filter((_, i) => !weightsFound[i]);\n      throw new Error(\n        `Could not find weights in manifest with names: ` +\n        `${weightsNotFound.join(', ')}. \\n` +\n        `Manifest JSON has weights with names: ` +\n        `${allManifestWeightNames.join(', ')}.`);\n    }\n\n    // Convert the one-hot boolean groupId => shouldFetch map to a list of group\n    // IDs.\n    const groupIndicesToFetch =\n      groupIndicesToFetchMap.reduce((accumulator, shouldFetch, i) => {\n        if (shouldFetch) {\n          accumulator.push(i);\n        }\n        return accumulator;\n      }, []);\n\n    const fetchUrls: string[] = [];\n    groupIndicesToFetch.forEach(i => {\n      manifest[i].paths.forEach(filepath => {\n        const fetchUrl = filePathPrefix +\n          (!filePathPrefix.endsWith('/') ? '/' : '') + filepath;\n        fetchUrls.push(fetchUrl);\n      });\n    });\n    const buffers = await fetchWeightsFunction(fetchUrls);\n\n    const weightsTensorMap: NamedTensorMap = {};\n    let bufferIndexOffset = 0;\n    groupIndicesToFetch.forEach(i => {\n      const numBuffers = manifest[i].paths.length;\n\n      const weightsBuffer = new CompositeArrayBuffer(\n        buffers.slice(bufferIndexOffset, bufferIndexOffset + numBuffers));\n\n      const weightsEntries = groupWeightsToFetch[i];\n\n      weightsEntries.forEach(weightsEntry => {\n        const byteBuffer = weightsBuffer.slice(\n          weightsEntry.groupOffset,\n          weightsEntry.groupOffset + weightsEntry.sizeBytes);\n        const nameToTensorMap =\n          decodeWeights(byteBuffer, [weightsEntry.manifestEntry]);\n        for (const name in nameToTensorMap) {\n          weightsTensorMap[name] = nameToTensorMap[name];\n        }\n      });\n\n      bufferIndexOffset += numBuffers;\n    });\n\n    return weightsTensorMap;\n  };\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/**\n * IOHandler implementations based on HTTP requests in the web browser.\n *\n * Uses [`fetch`](https://developer.mozilla.org/en-US/docs/Web/API/Fetch_API).\n */\n\nimport {env} from '../environment';\n\nimport {assert} from '../util';\nimport {getModelArtifactsForJSON, getModelArtifactsInfoForJSON, getModelJSONForModelArtifacts, getWeightSpecs} from './io_utils';\nimport {CompositeArrayBuffer} from './composite_array_buffer';\nimport {IORouter, IORouterRegistry} from './router_registry';\nimport {IOHandler, LoadOptions, ModelArtifacts, ModelJSON, SaveResult, WeightData, WeightsManifestConfig, WeightsManifestEntry} from './types';\nimport {loadWeightsAsArrayBuffer, streamWeights} from './weights_loader';\n\nconst OCTET_STREAM_MIME_TYPE = 'application/octet-stream';\nconst JSON_TYPE = 'application/json';\nexport class HTTPRequest implements IOHandler {\n  protected readonly path: string;\n  protected readonly requestInit: RequestInit;\n\n  private readonly fetch: typeof fetch;\n  private readonly weightUrlConverter: (weightName: string) => Promise<string>;\n\n  readonly DEFAULT_METHOD = 'POST';\n\n  static readonly URL_SCHEME_REGEX = /^https?:\\/\\//;\n\n  private readonly weightPathPrefix: string;\n  private readonly loadOptions: LoadOptions;\n\n  constructor(path: string, loadOptions?: LoadOptions) {\n    if (loadOptions == null) {\n      loadOptions = {};\n    }\n    this.weightPathPrefix = loadOptions.weightPathPrefix;\n    this.weightUrlConverter = loadOptions.weightUrlConverter;\n\n    if (loadOptions.fetchFunc != null) {\n      assert(\n          typeof loadOptions.fetchFunc === 'function',\n          () => 'Must pass a function that matches the signature of ' +\n              '`fetch` (see ' +\n              'https://developer.mozilla.org/en-US/docs/Web/API/Fetch_API)');\n      this.fetch = loadOptions.fetchFunc;\n    } else {\n      this.fetch = env().platform.fetch;\n    }\n\n    assert(\n        path != null && path.length > 0,\n        () => 'URL path for http must not be null, undefined or ' +\n            'empty.');\n\n    if (Array.isArray(path)) {\n      assert(\n          path.length === 2,\n          () => 'URL paths for http must have a length of 2, ' +\n              `(actual length is ${path.length}).`);\n    }\n    this.path = path;\n\n    if (loadOptions.requestInit != null &&\n        loadOptions.requestInit.body != null) {\n      throw new Error(\n          'requestInit is expected to have no pre-existing body, but has one.');\n    }\n    this.requestInit = loadOptions.requestInit || {};\n    this.loadOptions = loadOptions;\n  }\n\n  async save(modelArtifacts: ModelArtifacts): Promise<SaveResult> {\n    if (modelArtifacts.modelTopology instanceof ArrayBuffer) {\n      throw new Error(\n          'BrowserHTTPRequest.save() does not support saving model topology ' +\n          'in binary formats yet.');\n    }\n\n    const init = Object.assign({method: this.DEFAULT_METHOD}, this.requestInit);\n    init.body = new FormData();\n\n    const weightsManifest: WeightsManifestConfig = [{\n      paths: ['./model.weights.bin'],\n      weights: modelArtifacts.weightSpecs,\n    }];\n    const modelTopologyAndWeightManifest: ModelJSON =\n        getModelJSONForModelArtifacts(modelArtifacts, weightsManifest);\n\n    init.body.append(\n        'model.json',\n        new Blob(\n            [JSON.stringify(modelTopologyAndWeightManifest)],\n            {type: JSON_TYPE}),\n        'model.json');\n\n    if (modelArtifacts.weightData != null) {\n      // TODO(mattsoulanille): Support saving models over 2GB that exceed\n      // Chrome's ArrayBuffer size limit.\n      const weightBuffer = CompositeArrayBuffer.join(modelArtifacts.weightData);\n\n      init.body.append(\n          'model.weights.bin',\n          new Blob([weightBuffer], {type: OCTET_STREAM_MIME_TYPE}),\n          'model.weights.bin');\n    }\n\n    const response = await this.fetch(this.path, init);\n\n    if (response.ok) {\n      return {\n        modelArtifactsInfo: getModelArtifactsInfoForJSON(modelArtifacts),\n        responses: [response],\n      };\n    } else {\n      throw new Error(\n          `BrowserHTTPRequest.save() failed due to HTTP response status ` +\n          `${response.status}.`);\n    }\n  }\n\n  private async loadModelJSON(): Promise<ModelJSON> {\n    const modelConfigRequest = await this.fetch(this.path, this.requestInit);\n\n    if (!modelConfigRequest.ok) {\n      throw new Error(\n          `Request to ${this.path} failed with status code ` +\n          `${modelConfigRequest.status}. Please verify this URL points to ` +\n          `the model JSON of the model to load.`);\n    }\n    let modelJSON: ModelJSON;\n    try {\n      modelJSON = await modelConfigRequest.json();\n    } catch (e) {\n      let message = `Failed to parse model JSON of response from ${this.path}.`;\n      // TODO(nsthorat): Remove this after some time when we're comfortable that\n      // .pb files are mostly gone.\n      if (this.path.endsWith('.pb')) {\n        message += ' Your path contains a .pb file extension. ' +\n            'Support for .pb models have been removed in TensorFlow.js 1.0 ' +\n            'in favor of .json models. You can re-convert your Python ' +\n            'TensorFlow model using the TensorFlow.js 1.0 conversion scripts ' +\n            'or you can convert your.pb models with the \\'pb2json\\'' +\n            'NPM script in the tensorflow/tfjs-converter repository.';\n      } else {\n        message += ' Please make sure the server is serving valid ' +\n            'JSON for this request.';\n      }\n      throw new Error(message);\n    }\n\n    // We do not allow both modelTopology and weightsManifest to be missing.\n    const modelTopology = modelJSON.modelTopology;\n    const weightsManifest = modelJSON.weightsManifest;\n    if (modelTopology == null && weightsManifest == null) {\n      throw new Error(\n          `The JSON from HTTP path ${this.path} contains neither model ` +\n          `topology or manifest for weights.`);\n    }\n\n    return modelJSON;\n  }\n\n  /**\n   * Load model artifacts via HTTP request(s).\n   *\n   * See the documentation to `tf.io.http` for details on the saved\n   * artifacts.\n   *\n   * @returns The loaded model artifacts (if loading succeeds).\n   */\n  async load(): Promise<ModelArtifacts> {\n    if (this.loadOptions.streamWeights) {\n      return this.loadStream();\n    }\n    const modelJSON = await this.loadModelJSON();\n    return getModelArtifactsForJSON(\n        modelJSON, (weightsManifest) => this.loadWeights(weightsManifest));\n  }\n\n  private async loadStream(): Promise<ModelArtifacts> {\n    const modelJSON = await this.loadModelJSON();\n    const fetchURLs = await this.getWeightUrls(modelJSON.weightsManifest);\n    const weightSpecs = getWeightSpecs(modelJSON.weightsManifest);\n    const stream = () => streamWeights(fetchURLs, this.loadOptions);\n\n    return {\n      ...modelJSON,\n      weightSpecs,\n      getWeightStream: stream,\n    };\n  }\n\n  private async getWeightUrls(weightsManifest: WeightsManifestConfig):\n    Promise<string[]> {\n    const weightPath = Array.isArray(this.path) ? this.path[1] : this.path;\n    const [prefix, suffix] = parseUrl(weightPath);\n    const pathPrefix = this.weightPathPrefix || prefix;\n\n    const fetchURLs: string[] = [];\n    const urlPromises: Array<Promise<string>> = [];\n    for (const weightsGroup of weightsManifest) {\n      for (const path of weightsGroup.paths) {\n        if (this.weightUrlConverter != null) {\n          urlPromises.push(this.weightUrlConverter(path));\n        } else {\n          fetchURLs.push(pathPrefix + path + suffix);\n        }\n      }\n    }\n\n    if (this.weightUrlConverter) {\n      fetchURLs.push(...await Promise.all(urlPromises));\n    }\n    return fetchURLs;\n  }\n\n  private async loadWeights(weightsManifest: WeightsManifestConfig):\n    Promise<[WeightsManifestEntry[], WeightData]> {\n    const fetchURLs = await this.getWeightUrls(weightsManifest);\n    const weightSpecs = getWeightSpecs(weightsManifest);\n\n    const buffers = await loadWeightsAsArrayBuffer(fetchURLs, this.loadOptions);\n    return [weightSpecs, buffers];\n  }\n}\n\n/**\n * Extract the prefix and suffix of the url, where the prefix is the path before\n * the last file, and suffix is the search params after the last file.\n * ```\n * const url = 'http://tfhub.dev/model/1/tensorflowjs_model.pb?tfjs-format=file'\n * [prefix, suffix] = parseUrl(url)\n * // prefix = 'http://tfhub.dev/model/1/'\n * // suffix = '?tfjs-format=file'\n * ```\n * @param url the model url to be parsed.\n */\nexport function parseUrl(url: string): [string, string] {\n  const lastSlash = url.lastIndexOf('/');\n  const lastSearchParam = url.lastIndexOf('?');\n  const prefix = url.substring(0, lastSlash);\n  const suffix =\n      lastSearchParam > lastSlash ? url.substring(lastSearchParam) : '';\n  return [prefix + '/', suffix];\n}\n\nexport function isHTTPScheme(url: string): boolean {\n  return url.match(HTTPRequest.URL_SCHEME_REGEX) != null;\n}\n\nexport const httpRouter: IORouter =\n    (url: string, loadOptions?: LoadOptions) => {\n      if (typeof fetch === 'undefined' &&\n          (loadOptions == null || loadOptions.fetchFunc == null)) {\n        // `http` uses `fetch` or `node-fetch`, if one wants to use it in\n        // an environment that is not the browser or node they have to setup a\n        // global fetch polyfill.\n        return null;\n      } else {\n        let isHTTP = true;\n        if (Array.isArray(url)) {\n          isHTTP = url.every(urlItem => isHTTPScheme(urlItem));\n        } else {\n          isHTTP = isHTTPScheme(url);\n        }\n        if (isHTTP) {\n          return http(url, loadOptions);\n        }\n      }\n      return null;\n    };\nIORouterRegistry.registerSaveRouter(httpRouter);\nIORouterRegistry.registerLoadRouter(httpRouter);\n\n/**\n * Creates an IOHandler subtype that sends model artifacts to HTTP server.\n *\n * An HTTP request of the `multipart/form-data` mime type will be sent to the\n * `path` URL. The form data includes artifacts that represent the topology\n * and/or weights of the model. In the case of Keras-style `tf.Model`, two\n * blobs (files) exist in form-data:\n *   - A JSON file consisting of `modelTopology` and `weightsManifest`.\n *   - A binary weights file consisting of the concatenated weight values.\n * These files are in the same format as the one generated by\n * [tfjs_converter](https://js.tensorflow.org/tutorials/import-keras.html).\n *\n * The following code snippet exemplifies the client-side code that uses this\n * function:\n *\n * ```js\n * const model = tf.sequential();\n * model.add(\n *     tf.layers.dense({units: 1, inputShape: [100], activation: 'sigmoid'}));\n *\n * const saveResult = await model.save(tf.io.http(\n *     'http://model-server:5000/upload', {requestInit: {method: 'PUT'}}));\n * console.log(saveResult);\n * ```\n *\n * If the default `POST` method is to be used, without any custom parameters\n * such as headers, you can simply pass an HTTP or HTTPS URL to `model.save`:\n *\n * ```js\n * const saveResult = await model.save('http://model-server:5000/upload');\n * ```\n *\n * The following GitHub Gist\n * https://gist.github.com/dsmilkov/1b6046fd6132d7408d5257b0976f7864\n * implements a server based on [flask](https://github.com/pallets/flask) that\n * can receive the request. Upon receiving the model artifacts via the request,\n * this particular server reconstitutes instances of [Keras\n * Models](https://keras.io/models/model/) in memory.\n *\n *\n * @param path A URL path to the model.\n *   Can be an absolute HTTP path (e.g.,\n *   'http://localhost:8000/model-upload)') or a relative path (e.g.,\n *   './model-upload').\n * @param requestInit Request configurations to be used when sending\n *    HTTP request to server using `fetch`. It can contain fields such as\n *    `method`, `credentials`, `headers`, `mode`, etc. See\n *    https://developer.mozilla.org/en-US/docs/Web/API/Request/Request\n *    for more information. `requestInit` must not have a body, because the\n * body will be set by TensorFlow.js. File blobs representing the model\n * topology (filename: 'model.json') and the weights of the model (filename:\n * 'model.weights.bin') will be appended to the body. If `requestInit` has a\n * `body`, an Error will be thrown.\n * @param loadOptions Optional configuration for the loading. It includes the\n *   following fields:\n *   - weightPathPrefix Optional, this specifies the path prefix for weight\n *     files, by default this is calculated from the path param.\n *   - fetchFunc Optional, custom `fetch` function. E.g., in Node.js,\n *     the `fetch` from node-fetch can be used here.\n *   - onProgress Optional, progress callback function, fired periodically\n *     before the load is completed.\n * @returns An instance of `IOHandler`.\n *\n * @doc {\n *   heading: 'Models',\n *   subheading: 'Loading',\n *   namespace: 'io',\n *   ignoreCI: true\n * }\n */\nexport function http(path: string, loadOptions?: LoadOptions): IOHandler {\n  return new HTTPRequest(path, loadOptions);\n}\n\n/**\n * Deprecated. Use `tf.io.http`.\n * @param path\n * @param loadOptions\n */\nexport function browserHTTPRequest(\n    path: string, loadOptions?: LoadOptions): IOHandler {\n  return http(path, loadOptions);\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/**\n * IOHandlers that pass through the in-memory ModelArtifacts format.\n */\n\nimport {IOHandler, IOHandlerSync, LoadHandler, ModelArtifacts, SaveHandler, SaveResult, TrainingConfig, WeightData, WeightsManifestEntry} from './types';\n\nclass PassthroughLoader implements IOHandlerSync {\n  constructor(private readonly modelArtifacts?: ModelArtifacts) {}\n\n  load(): ModelArtifacts {\n    return this.modelArtifacts;\n  }\n}\n\nclass PassthroughSaver<R extends SaveResult | Promise<SaveResult>> {\n  constructor(\n    private readonly saveHandler: (artifacts: ModelArtifacts) => R) {}\n\n  save(modelArtifacts: ModelArtifacts): R {\n    return this.saveHandler(modelArtifacts);\n  }\n}\n\nclass PassthroughAsync implements IOHandler {\n  load?: LoadHandler;\n  save?: SaveHandler;\n\n  constructor(handler: IOHandlerSync) {\n    if (handler.load) {\n      this.load = () => Promise.resolve(handler.load());\n    }\n    if (handler.save) {\n      this.save = (modelArtifacts: ModelArtifacts) =>\n        Promise.resolve(handler.save(modelArtifacts));\n    }\n  }\n}\n\n/**\n * Creates an IOHandler that loads model artifacts from memory.\n *\n * When used in conjunction with `tf.loadLayersModel`, an instance of\n * `tf.LayersModel` (Keras-style) can be constructed from the loaded artifacts.\n *\n * ```js\n * const model = await tf.loadLayersModel(tf.io.fromMemory(\n *     modelTopology, weightSpecs, weightData));\n * ```\n *\n * @param modelArtifacts a object containing model topology (i.e., parsed from\n *   the JSON format).\n * @param weightSpecs An array of `WeightsManifestEntry` objects describing the\n *   names, shapes, types, and quantization of the weight data. Optional.\n * @param weightData A single `ArrayBuffer` containing the weight data,\n *   concatenated in the order described by the weightSpecs. Optional.\n * @param trainingConfig Model training configuration. Optional.\n *\n * @returns A passthrough `IOHandler` that simply loads the provided data.\n */\nexport function fromMemory(\n    modelArtifacts: {}|ModelArtifacts, weightSpecs?: WeightsManifestEntry[],\n    weightData?: WeightData, trainingConfig?: TrainingConfig): IOHandler {\n\n  const args = arguments as unknown as Parameters<typeof fromMemory>;\n  return new PassthroughAsync(fromMemorySync(...args));\n}\n\n/**\n * Creates an IOHandler that loads model artifacts from memory.\n *\n * When used in conjunction with `tf.loadLayersModel`, an instance of\n * `tf.LayersModel` (Keras-style) can be constructed from the loaded artifacts.\n *\n * ```js\n * const model = await tf.loadLayersModel(tf.io.fromMemory(\n *     modelTopology, weightSpecs, weightData));\n * ```\n *\n * @param modelArtifacts a object containing model topology (i.e., parsed from\n *   the JSON format).\n * @param weightSpecs An array of `WeightsManifestEntry` objects describing the\n *   names, shapes, types, and quantization of the weight data. Optional.\n * @param weightData A single `ArrayBuffer` containing the weight data,\n *   concatenated in the order described by the weightSpecs. Optional.\n * @param trainingConfig Model training configuration. Optional.\n *\n * @returns A passthrough `IOHandlerSync` that simply loads the provided data.\n */\nexport function fromMemorySync(\n    modelArtifacts: {}|ModelArtifacts, weightSpecs?: WeightsManifestEntry[],\n    weightData?: WeightData, trainingConfig?: TrainingConfig): IOHandlerSync {\n  if (arguments.length === 1) {\n    const isModelArtifacts =\n        (modelArtifacts as ModelArtifacts).modelTopology != null ||\n        (modelArtifacts as ModelArtifacts).weightSpecs != null;\n    if (isModelArtifacts) {\n      return new PassthroughLoader(modelArtifacts as ModelArtifacts);\n    } else {\n      // Legacy support: with only modelTopology.\n      // TODO(cais): Remove this deprecated API.\n      console.warn(\n          'Please call tf.io.fromMemory() with only one argument. ' +\n          'The argument should be of type ModelArtifacts. ' +\n          'The multi-argument signature of tf.io.fromMemory() has been ' +\n          'deprecated and will be removed in a future release.');\n      return new PassthroughLoader({modelTopology: modelArtifacts as {}});\n    }\n  } else {\n    // Legacy support.\n    // TODO(cais): Remove this deprecated API.\n    console.warn(\n        'Please call tf.io.fromMemory() with only one argument. ' +\n        'The argument should be of type ModelArtifacts. ' +\n        'The multi-argument signature of tf.io.fromMemory() has been ' +\n        'deprecated and will be removed in a future release.');\n    return new PassthroughLoader({\n      modelTopology: modelArtifacts as {},\n      weightSpecs,\n      weightData,\n      trainingConfig\n    });\n  }\n}\n\n/**\n * Creates an IOHandler that passes saved model artifacts to a callback.\n *\n * ```js\n * function handleSave(artifacts) {\n *   // ... do something with the artifacts ...\n *   return {modelArtifactsInfo: {...}, ...};\n * }\n *\n * const saveResult = model.save(tf.io.withSaveHandler(handleSave));\n * ```\n *\n * @param saveHandler A function that accepts a `ModelArtifacts` and returns a\n *     promise that resolves to a `SaveResult`.\n */\nexport function withSaveHandler(\n    saveHandler: (artifacts: ModelArtifacts) =>\n        Promise<SaveResult>): IOHandler {\n  return new PassthroughSaver(saveHandler);\n}\n\n/**\n * Creates an IOHandlerSync that passes saved model artifacts to a callback.\n *\n * ```js\n * function handleSave(artifacts) {\n *   // ... do something with the artifacts ...\n *   return {modelArtifactsInfo: {...}, ...};\n * }\n *\n * const saveResult = model.save(tf.io.withSaveHandler(handleSave));\n * ```\n *\n * @param saveHandler A function that accepts a `ModelArtifacts` and returns a\n *     `SaveResult`.\n */\nexport function withSaveHandlerSync(\n    saveHandler: (artifacts: ModelArtifacts) => SaveResult): IOHandlerSync {\n  return new PassthroughSaver<SaveResult>(saveHandler);\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n// Importing local_storage and indexed_db is necessary for the routers to be\n// registered.\nimport './indexed_db';\nimport './local_storage';\n\nimport {browserFiles} from './browser_files';\nimport {browserHTTPRequest, http, isHTTPScheme} from './http';\nimport {concatenateArrayBuffers, decodeWeights, decodeWeightsStream, encodeWeights, getModelArtifactsForJSON, getModelArtifactsForJSONSync, getModelArtifactsInfoForJSON, getWeightSpecs} from './io_utils';\nimport {fromMemory, fromMemorySync, withSaveHandler, withSaveHandlerSync} from './passthrough';\nimport {getLoadHandlers, getSaveHandlers, registerLoadRouter, registerSaveRouter} from './router_registry';\nimport {IOHandler, IOHandlerSync, LoadHandler, LoadOptions, ModelArtifacts, ModelArtifactsInfo, ModelJSON, ModelStoreManager, OnProgressCallback, RequestDetails, SaveConfig, SaveHandler, SaveResult, TrainingConfig, WeightGroup, WeightsManifestConfig, WeightsManifestEntry, WeightData} from './types';\nimport {loadWeights, weightsLoaderFactory} from './weights_loader';\nimport {CompositeArrayBuffer} from './composite_array_buffer';\n\nexport {copyModel, listModels, moveModel, removeModel} from './model_management';\nexport {\n  browserFiles,\n  browserHTTPRequest,\n  CompositeArrayBuffer,\n  concatenateArrayBuffers,\n  decodeWeights,\n  decodeWeightsStream,\n  encodeWeights,\n  fromMemory,\n  fromMemorySync,\n  getLoadHandlers,\n  getModelArtifactsForJSON,\n  getModelArtifactsForJSONSync,\n  getModelArtifactsInfoForJSON,\n  getSaveHandlers,\n  getWeightSpecs,\n  http,\n  IOHandler,\n  IOHandlerSync,\n  isHTTPScheme,\n  LoadHandler,\n  LoadOptions,\n  loadWeights,\n  ModelArtifacts,\n  ModelArtifactsInfo,\n  ModelJSON,\n  ModelStoreManager,\n  OnProgressCallback,\n  registerLoadRouter,\n  registerSaveRouter,\n  RequestDetails,\n  SaveConfig,\n  SaveHandler,\n  SaveResult,\n  TrainingConfig,\n  WeightData,\n  WeightGroup,\n  weightsLoaderFactory,\n  WeightsManifestConfig,\n  WeightsManifestEntry,\n  withSaveHandler,\n  withSaveHandlerSync,\n};\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor1D, Tensor2D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {cast} from './cast';\nimport {matMul} from './mat_mul';\nimport {oneHot} from './one_hot';\nimport {op} from './operation';\nimport {transpose} from './transpose';\n\n/**\n * Computes the confusion matrix from true labels and predicted labels.\n *\n * ```js\n * const labels = tf.tensor1d([0, 1, 2, 1, 0], 'int32');\n * const predictions = tf.tensor1d([0, 2, 2, 1, 0], 'int32');\n * const numClasses = 3;\n * const out = tf.math.confusionMatrix(labels, predictions, numClasses);\n * out.print();\n * // Expected output matrix:\n * // [[2, 0, 0],\n * //  [0, 1, 1],\n * //  [0, 0, 1]]\n * ```\n *\n * @param labels The target labels, assumed to be 0-based integers\n *   for the classes. The shape is `[numExamples]`, where\n *   `numExamples` is the number of examples included.\n * @param predictions The predicted classes, assumed to be\n *   0-based integers for the classes. Must have the same shape as `labels`.\n * @param numClasses Number of all classes, as an integer.\n *   Its value must be larger than the largest element in `labels` and\n *   `predictions`.\n * @returns The confusion matrix as a int32-type 2D tensor. The value at\n *   row `r` and column `c` is the number of times examples of actual class\n *   `r` were predicted as class `c`.\n *\n * @doc {heading: 'Operations', subheading: 'Evaluation'}\n */\nexport function confusionMatrix_(\n    labels: Tensor1D|TensorLike, predictions: Tensor1D|TensorLike,\n    numClasses: number): Tensor2D {\n  const $labels = convertToTensor(labels, 'labels', 'confusionMatrix');\n  const $predictions =\n      convertToTensor(predictions, 'predictions', 'confusionMatrix');\n\n  util.assert(\n      numClasses == null || numClasses > 0 && Number.isInteger(numClasses),\n      () => `If provided, numClasses must be a positive integer, ` +\n          `but got ${numClasses}`);\n  util.assert(\n      $labels.rank === 1,\n      () => `Expected the rank of labels to be 1, but got ${$labels.rank}`);\n  util.assert(\n      $predictions.rank === 1,\n      () => `Expected the rank of predictions to be 1, ` +\n          `but got ${$predictions.rank}`);\n  util.assert(\n      $labels.shape[0] === $predictions.shape[0],\n      () => `Mismatch in the number of examples: ` +\n          `${$labels.shape[0]} vs. ${$predictions.shape[0]}. ` +\n          `Labels and predictions should have the same number of elements.`);\n  util.assert(\n      numClasses > 0 && Number.isInteger(numClasses),\n      () => `numClasses is required to be a positive integer, but got ` +\n          `${numClasses}`);\n  // TODO(cais): In the future, if oneHot supports tensors inputs for\n  //   `numClasses`, `confusionMatrix` can make `numClasses` optional.\n\n  const oneHotLabels = oneHot(cast($labels, 'int32'), numClasses) as Tensor2D;\n  const oneHotPredictions =\n      oneHot(cast($predictions, 'int32'), numClasses) as Tensor2D;\n  const oneHotLabelsT: Tensor2D = transpose(oneHotLabels);\n  const product: Tensor2D = matMul(oneHotLabelsT, oneHotPredictions);\n  return cast(product, 'int32');\n}\n\nexport const confusionMatrix = /* @__PURE__ */ op({confusionMatrix_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/**\n * Exports under the tf.math.* namespace.\n */\n\nimport {confusionMatrix} from './ops/confusion_matrix';\n\nexport {confusionMatrix};\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {env} from '../environment';\nimport {Draw, DrawAttrs, DrawInputs, FromPixels, FromPixelsAttrs, FromPixelsInputs} from '../kernel_names';\nimport {getKernel, NamedAttrMap} from '../kernel_registry';\nimport {Tensor, Tensor2D, Tensor3D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {DrawOptions, ImageOptions, PixelData, TensorLike} from '../types';\n\nimport {cast} from './cast';\nimport {op} from './operation';\nimport {tensor3d} from './tensor3d';\n\nlet fromPixels2DContext: CanvasRenderingContext2D;\nlet hasToPixelsWarned = false;\n\n/**\n * Creates a `tf.Tensor` from an image.\n *\n * ```js\n * const image = new ImageData(1, 1);\n * image.data[0] = 100;\n * image.data[1] = 150;\n * image.data[2] = 200;\n * image.data[3] = 255;\n *\n * tf.browser.fromPixels(image).print();\n * ```\n *\n * @param pixels The input image to construct the tensor from. The\n * supported image types are all 4-channel. You can also pass in an image\n * object with following attributes:\n * `{data: Uint8Array; width: number; height: number}`\n * @param numChannels The number of channels of the output tensor. A\n * numChannels value less than 4 allows you to ignore channels. Defaults to\n * 3 (ignores alpha channel of input image).\n *\n * @returns A Tensor3D with the shape `[height, width, numChannels]`.\n *\n * Note: fromPixels can be lossy in some cases, same image may result in\n * slightly different tensor values, if rendered by different rendering\n * engines. This means that results from different browsers, or even same\n * browser with CPU and GPU rendering engines can be different. See discussion\n * in details:\n * https://github.com/tensorflow/tfjs/issues/5482\n *\n * @doc {heading: 'Browser', namespace: 'browser', ignoreCI: true}\n */\nfunction fromPixels_(\n    pixels: PixelData|ImageData|HTMLImageElement|HTMLCanvasElement|\n    HTMLVideoElement|ImageBitmap,\n    numChannels = 3): Tensor3D {\n  // Sanity checks.\n  if (numChannels > 4) {\n    throw new Error(\n        'Cannot construct Tensor with more than 4 channels from pixels.');\n  }\n  if (pixels == null) {\n    throw new Error('pixels passed to tf.browser.fromPixels() can not be null');\n  }\n  let isPixelData = false;\n  let isImageData = false;\n  let isVideo = false;\n  let isImage = false;\n  let isCanvasLike = false;\n  let isImageBitmap = false;\n  if ((pixels as PixelData).data instanceof Uint8Array) {\n    isPixelData = true;\n  } else if (\n      typeof (ImageData) !== 'undefined' && pixels instanceof ImageData) {\n    isImageData = true;\n  } else if (\n      typeof (HTMLVideoElement) !== 'undefined' &&\n      pixels instanceof HTMLVideoElement) {\n    isVideo = true;\n  } else if (\n      typeof (HTMLImageElement) !== 'undefined' &&\n      pixels instanceof HTMLImageElement) {\n    isImage = true;\n    // tslint:disable-next-line: no-any\n  } else if ((pixels as any).getContext != null) {\n    isCanvasLike = true;\n  } else if (\n      typeof (ImageBitmap) !== 'undefined' && pixels instanceof ImageBitmap) {\n    isImageBitmap = true;\n  } else {\n    throw new Error(\n        'pixels passed to tf.browser.fromPixels() must be either an ' +\n        `HTMLVideoElement, HTMLImageElement, HTMLCanvasElement, ImageData ` +\n        `in browser, or OffscreenCanvas, ImageData in webworker` +\n        ` or {data: Uint32Array, width: number, height: number}, ` +\n        `but was ${(pixels as {}).constructor.name}`);\n  }\n  // If the current backend has 'FromPixels' registered, it has a more\n  // efficient way of handling pixel uploads, so we call that.\n  const kernel = getKernel(FromPixels, ENGINE.backendName);\n  if (kernel != null) {\n    const inputs: FromPixelsInputs = {pixels};\n    const attrs: FromPixelsAttrs = {numChannels};\n    return ENGINE.runKernel(\n        FromPixels, inputs as unknown as NamedTensorMap,\n        attrs as unknown as NamedAttrMap);\n  }\n\n  const [width, height] = isVideo ?\n      [\n        (pixels as HTMLVideoElement).videoWidth,\n        (pixels as HTMLVideoElement).videoHeight\n      ] :\n      [pixels.width, pixels.height];\n  let vals: Uint8ClampedArray|Uint8Array;\n\n  if (isCanvasLike) {\n    vals =\n        // tslint:disable-next-line:no-any\n        (pixels as any).getContext('2d').getImageData(0, 0, width, height).data;\n  } else if (isImageData || isPixelData) {\n    vals = (pixels as PixelData | ImageData).data;\n  } else if (isImage || isVideo || isImageBitmap) {\n    if (fromPixels2DContext == null) {\n      if (typeof document === 'undefined') {\n        if (typeof OffscreenCanvas !== 'undefined' &&\n            typeof OffscreenCanvasRenderingContext2D !== 'undefined') {\n          // @ts-ignore\n          fromPixels2DContext = new OffscreenCanvas(1, 1).getContext('2d');\n        } else {\n          throw new Error(\n              'Cannot parse input in current context. ' +\n              'Reason: OffscreenCanvas Context2D rendering is not supported.');\n        }\n      } else {\n        fromPixels2DContext = document.createElement('canvas').getContext(\n            '2d', {willReadFrequently: true});\n      }\n    }\n    fromPixels2DContext.canvas.width = width;\n    fromPixels2DContext.canvas.height = height;\n    fromPixels2DContext.drawImage(\n        pixels as HTMLVideoElement, 0, 0, width, height);\n    vals = fromPixels2DContext.getImageData(0, 0, width, height).data;\n  }\n  let values: Int32Array;\n  if (numChannels === 4) {\n    values = new Int32Array(vals);\n  } else {\n    const numPixels = width * height;\n    values = new Int32Array(numPixels * numChannels);\n    for (let i = 0; i < numPixels; i++) {\n      for (let channel = 0; channel < numChannels; ++channel) {\n        values[i * numChannels + channel] = vals[i * 4 + channel];\n      }\n    }\n  }\n  const outShape: [number, number, number] = [height, width, numChannels];\n  return tensor3d(values, outShape, 'int32');\n}\n\n// Helper functions for |fromPixelsAsync| to check whether the input can\n// be wrapped into imageBitmap.\nfunction isPixelData(pixels: PixelData|ImageData|HTMLImageElement|\n                     HTMLCanvasElement|HTMLVideoElement|\n                     ImageBitmap): pixels is PixelData {\n  return (pixels != null) && ((pixels as PixelData).data instanceof Uint8Array);\n}\n\nfunction isImageBitmapFullySupported() {\n  return typeof window !== 'undefined' &&\n      typeof (ImageBitmap) !== 'undefined' &&\n      window.hasOwnProperty('createImageBitmap');\n}\n\nfunction isNonEmptyPixels(pixels: PixelData|ImageData|HTMLImageElement|\n                          HTMLCanvasElement|HTMLVideoElement|ImageBitmap) {\n  return pixels != null && pixels.width !== 0 && pixels.height !== 0;\n}\n\nfunction canWrapPixelsToImageBitmap(pixels: PixelData|ImageData|\n                                    HTMLImageElement|HTMLCanvasElement|\n                                    HTMLVideoElement|ImageBitmap) {\n  return isImageBitmapFullySupported() && !(pixels instanceof ImageBitmap) &&\n      isNonEmptyPixels(pixels) && !isPixelData(pixels);\n}\n\n/**\n * Creates a `tf.Tensor` from an image in async way.\n *\n * ```js\n * const image = new ImageData(1, 1);\n * image.data[0] = 100;\n * image.data[1] = 150;\n * image.data[2] = 200;\n * image.data[3] = 255;\n *\n * (await tf.browser.fromPixelsAsync(image)).print();\n * ```\n * This API is the async version of fromPixels. The API will first\n * check |WRAP_TO_IMAGEBITMAP| flag, and try to wrap the input to\n * imageBitmap if the flag is set to true.\n *\n * @param pixels The input image to construct the tensor from. The\n * supported image types are all 4-channel. You can also pass in an image\n * object with following attributes:\n * `{data: Uint8Array; width: number; height: number}`\n * @param numChannels The number of channels of the output tensor. A\n * numChannels value less than 4 allows you to ignore channels. Defaults to\n * 3 (ignores alpha channel of input image).\n *\n * @doc {heading: 'Browser', namespace: 'browser', ignoreCI: true}\n */\nexport async function fromPixelsAsync(\n    pixels: PixelData|ImageData|HTMLImageElement|HTMLCanvasElement|\n    HTMLVideoElement|ImageBitmap,\n    numChannels = 3) {\n  let inputs: PixelData|ImageData|HTMLImageElement|HTMLCanvasElement|\n      HTMLVideoElement|ImageBitmap = null;\n\n  // Check whether the backend needs to wrap |pixels| to imageBitmap and\n  // whether |pixels| can be wrapped to imageBitmap.\n  if (env().getBool('WRAP_TO_IMAGEBITMAP') &&\n      canWrapPixelsToImageBitmap(pixels)) {\n    // Force the imageBitmap creation to not do any premultiply alpha\n    // ops.\n    let imageBitmap;\n\n    try {\n      // wrap in try-catch block, because createImageBitmap may not work\n      // properly in some browsers, e.g.\n      // https://bugzilla.mozilla.org/show_bug.cgi?id=1335594\n      // tslint:disable-next-line: no-any\n      imageBitmap = await (createImageBitmap as any)(\n          pixels as ImageBitmapSource, {premultiplyAlpha: 'none'});\n    } catch (e) {\n      imageBitmap = null;\n    }\n\n    // createImageBitmap will clip the source size.\n    // In some cases, the input will have larger size than its content.\n    // E.g. new Image(10, 10) but with 1 x 1 content. Using\n    // createImageBitmap will clip the size from 10 x 10 to 1 x 1, which\n    // is not correct. We should avoid wrapping such resouce to\n    // imageBitmap.\n    if (imageBitmap != null && imageBitmap.width === pixels.width &&\n        imageBitmap.height === pixels.height) {\n      inputs = imageBitmap;\n    } else {\n      inputs = pixels;\n    }\n  } else {\n    inputs = pixels;\n  }\n\n  return fromPixels_(inputs, numChannels);\n}\n\nfunction validateImgTensor(img: Tensor2D|Tensor3D) {\n  if (img.rank !== 2 && img.rank !== 3) {\n    throw new Error(\n        `toPixels only supports rank 2 or 3 tensors, got rank ${img.rank}.`);\n  }\n  const depth = img.rank === 2 ? 1 : img.shape[2];\n\n  if (depth > 4 || depth === 2) {\n    throw new Error(\n        `toPixels only supports depth of size ` +\n        `1, 3 or 4 but got ${depth}`);\n  }\n\n  if (img.dtype !== 'float32' && img.dtype !== 'int32') {\n    throw new Error(\n        `Unsupported type for toPixels: ${img.dtype}.` +\n        ` Please use float32 or int32 tensors.`);\n  }\n}\n\nfunction validateImageOptions(imageOptions: ImageOptions) {\n  const alpha = imageOptions ?.alpha || 1;\n  if (alpha > 1 || alpha < 0) {\n    throw new Error(`Alpha value ${alpha} is suppoed to be in range [0 - 1].`);\n  }\n}\n\n/**\n * Draws a `tf.Tensor` of pixel values to a byte array or optionally a\n * canvas.\n *\n * When the dtype of the input is 'float32', we assume values in the range\n * [0-1]. Otherwise, when input is 'int32', we assume values in the range\n * [0-255].\n *\n * Returns a promise that resolves when the canvas has been drawn to.\n *\n * @param img A rank-2 tensor with shape `[height, width]`, or a rank-3 tensor\n * of shape `[height, width, numChannels]`. If rank-2, draws grayscale. If\n * rank-3, must have depth of 1, 3 or 4. When depth of 1, draws\n * grayscale. When depth of 3, we draw with the first three components of\n * the depth dimension corresponding to r, g, b and alpha = 1. When depth of\n * 4, all four components of the depth dimension correspond to r, g, b, a.\n * @param canvas The canvas to draw to.\n *\n * @doc {heading: 'Browser', namespace: 'browser'}\n */\nexport async function toPixels(\n    img: Tensor2D|Tensor3D|TensorLike,\n    canvas?: HTMLCanvasElement): Promise<Uint8ClampedArray> {\n  let $img = convertToTensor(img, 'img', 'toPixels');\n  if (!(img instanceof Tensor)) {\n    // Assume int32 if user passed a native array.\n    const originalImgTensor = $img;\n    $img = cast(originalImgTensor, 'int32');\n    originalImgTensor.dispose();\n  }\n  validateImgTensor($img);\n\n  const [height, width] = $img.shape.slice(0, 2);\n  const depth = $img.rank === 2 ? 1 : $img.shape[2];\n  const data = await $img.data();\n  const multiplier = $img.dtype === 'float32' ? 255 : 1;\n  const bytes = new Uint8ClampedArray(width * height * 4);\n\n  for (let i = 0; i < height * width; ++i) {\n    const rgba = [0, 0, 0, 255];\n\n    for (let d = 0; d < depth; d++) {\n      const value = data[i * depth + d];\n\n      if ($img.dtype === 'float32') {\n        if (value < 0 || value > 1) {\n          throw new Error(\n              `Tensor values for a float32 Tensor must be in the ` +\n              `range [0 - 1] but encountered ${value}.`);\n        }\n      } else if ($img.dtype === 'int32') {\n        if (value < 0 || value > 255) {\n          throw new Error(\n              `Tensor values for a int32 Tensor must be in the ` +\n              `range [0 - 255] but encountered ${value}.`);\n        }\n      }\n\n      if (depth === 1) {\n        rgba[0] = value * multiplier;\n        rgba[1] = value * multiplier;\n        rgba[2] = value * multiplier;\n      } else {\n        rgba[d] = value * multiplier;\n      }\n    }\n\n    const j = i * 4;\n    bytes[j + 0] = Math.round(rgba[0]);\n    bytes[j + 1] = Math.round(rgba[1]);\n    bytes[j + 2] = Math.round(rgba[2]);\n    bytes[j + 3] = Math.round(rgba[3]);\n  }\n\n  if (canvas != null) {\n    if (!hasToPixelsWarned) {\n      const kernel = getKernel(Draw, ENGINE.backendName);\n      if (kernel != null) {\n        console.warn(\n            'tf.browser.toPixels is not efficient to draw tensor on canvas. ' +\n            'Please try tf.browser.draw instead.');\n        hasToPixelsWarned = true;\n      }\n    }\n\n    canvas.width = width;\n    canvas.height = height;\n    const ctx = canvas.getContext('2d');\n    const imageData = new ImageData(bytes, width, height);\n    ctx.putImageData(imageData, 0, 0);\n  }\n  if ($img !== img) {\n    $img.dispose();\n  }\n  return bytes;\n}\n\n/**\n * Draws a `tf.Tensor` to a canvas.\n *\n * When the dtype of the input is 'float32', we assume values in the range\n * [0-1]. Otherwise, when input is 'int32', we assume values in the range\n * [0-255].\n *\n * @param image The tensor to draw on the canvas. Must match one of\n * these shapes:\n *   - Rank-2 with shape `[height, width`]: Drawn as grayscale.\n *   - Rank-3 with shape `[height, width, 1]`: Drawn as grayscale.\n *   - Rank-3 with shape `[height, width, 3]`: Drawn as RGB with alpha set in\n *     `imageOptions` (defaults to 1, which is opaque).\n *   - Rank-3 with shape `[height, width, 4]`: Drawn as RGBA.\n * @param canvas The canvas to draw to.\n * @param options The configuration arguments for image to be drawn and the\n *     canvas to draw to.\n *\n * @doc {heading: 'Browser', namespace: 'browser'}\n */\nexport function draw(\n    image: Tensor2D|Tensor3D|TensorLike, canvas: HTMLCanvasElement,\n    options?: DrawOptions): void {\n  let $img = convertToTensor(image, 'img', 'draw');\n  if (!(image instanceof Tensor)) {\n    // Assume int32 if user passed a native array.\n    const originalImgTensor = $img;\n    $img = cast(originalImgTensor, 'int32');\n    originalImgTensor.dispose();\n  }\n  validateImgTensor($img);\n  validateImageOptions(options?.imageOptions);\n\n  const inputs: DrawInputs = {image: $img};\n  const attrs: DrawAttrs = {canvas, options};\n  ENGINE.runKernel(\n      Draw, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const fromPixels = /* @__PURE__ */ op({fromPixels_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport { TensorInfo } from '../tensor_info';\nimport {computeStrides, sizeFromShape} from '../util';\n\n/**\n * Validate gather nd inputs.\n *\n * @param tensor The tensor contains the source values.\n * @param indices The tensor contains the indices to slice the source.\n *\n * @returns [resultShape, numUpdates, sliceSize, strides]\n */\nexport function prepareAndValidate(tensor: TensorInfo, indices: TensorInfo):\n    [number[], number, number, number[]] {\n  const tensorRank = tensor.shape.length;\n  const indicesRank = indices.shape.length;\n  if (tensorRank < 1) {\n    throw new Error(\n        'tf.gatherND() expects the input to be rank 1 or higher,' +\n        ` but the rank was ${tensorRank}.`);\n  }\n  if (indicesRank < 1) {\n    throw new Error(\n        'tf.gatherND() expects the indices to be rank 1 or higher,' +\n        ` but the rank was ${indicesRank}.`);\n  }\n  if (indices.dtype !== 'int32') {\n    throw new Error(\n        'tf.gatherND() expects the indices to be int32 type,' +\n        ` but the dtype was ${indices.dtype}.`);\n  }\n  if (indices.shape[indicesRank - 1] > tensorRank) {\n    throw new Error(\n        'index innermost dimension length must be <= tensor rank; saw: ' +\n        `${indices.shape[indicesRank - 1]} vs. ${tensorRank}`);\n  }\n\n  if (sizeFromShape(tensor.shape) === 0) {\n    throw new Error(\n        'Requested more than 0 entries, but input is empty.' +\n        ` Input shape: ${tensor.shape}.`);\n  }\n\n  const indicesShape = indices.shape;\n  const sliceRank = indicesShape[indicesShape.length - 1];\n\n  // The result shape is\n  //   indices.shape[:-1] + params.shape[indices.shape[-1]:]\n  let nResult = 1;\n  for (let i = 0; i < indicesShape.length - 1; ++i) {\n    nResult *= indicesShape[i];\n  }\n\n  const inputShape = tensor.shape;\n\n  const resultShape = indicesShape.slice();\n  resultShape.pop();\n\n  let sliceSize = 1;\n  for (let i = sliceRank; i < tensorRank; ++i) {\n    sliceSize *= inputShape[i];\n    resultShape.push(inputShape[i]);\n  }\n\n  const strides =\n      [...computeStrides(tensor.shape).map(stride => stride / sliceSize),\n       1].slice(0, sliceRank);\n\n  return [resultShape, nResult, sliceSize, strides];\n}\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport { TensorInfo } from '../tensor_info';\nimport * as util from '../util';\n\nconst NEW_AXIS = -2;\nconst SHRINK_AXIS = -1;\n\n// Sparse slicing specification\n// if one does foo[3:5, ..., -3], the begin, end and strides will have length\n// of 3.\ninterface StridedSliceSparseSpec {\n  dims: number;\n  numAddAxisAfterEllipsis: number;\n  begin: number[];\n  end: number[];\n  strides: number[];\n  beginMask: number;\n  endMask: number;\n  ellipsisMask: number;\n  newAxisMask: number;\n  shrinkAxisMask: number;\n}\n\n// Dense slicing specification\n// all ellipses and newaxis are expanded out. So if foo[3:5, ..., -3] where foo\n// is 10 dimensional, each array of begin, end, strides will have 10 entries\n// where as the sparse can have length less than the rank of foo.\ninterface StridedSliceDenseSpec {\n  dims: number;\n  beginMask?: number;\n  endMask?: number;\n  beginValid: boolean;\n  endValid: boolean;\n  begin?: number[];\n  end?: number[];\n  strides?: number[];\n  // This array helps construct the final shape of the slice.\n  // The final tensor is reduced in rank whenever a single index e.g. foo[3]\n  // is called for. The final tensor increases in rank with newAxis entries.\n  // If an index in this array is positive, the size of the dimension is\n  // obtained from canonical end-begin.  Otherwise, if it is a NEW_AXIS, it will\n  // be 1. A shrunk dimension is skipped.\n  finalShapeGatherIndices?: number[];\n  // This array has the same size as finalShapeGatherIndices, but it remembers\n  // the sparse index that a dimension comes from, instead of dense index.\n  // A -1 in this vector means the index is not from the sparse input.\n  finalShapeGatherIndicesSparse?: number[];\n  inputShapeGatherIndicesSparse?: number[];\n  // The dense indexed shrink mask is which processing dimensions should be\n  // shrunk. For example, if foo.shape = [10, 10, 10, 10], foo[3, ..., 5] has\n  // sparseShrinkAxisMask of 5 (0101) and denseShrinkAxisMask of 9 (1001),\n  // yielding a final shape [10, 10].\n  shrinkAxisMask?: number;\n}\n\nexport type SliceInfo = {\n  finalShapeSparse: number[],\n  finalShape: number[],\n  isIdentity: boolean,\n  sliceDim0: boolean,\n  isSimpleSlice: boolean,\n  begin: number[],\n  end: number[],\n  strides: number[]\n};\n\nexport function assertParamsValid(\n    input: TensorInfo, begin: number[], size: number[]): void {\n  const inputRank = input.shape.length;\n  util.assert(\n      inputRank === begin.length,\n      () => `Error in slice${inputRank}D: Length of begin ${begin} must ` +\n          `match the rank of the array (${inputRank}).`);\n  util.assert(\n      inputRank === size.length,\n      () => `Error in slice${inputRank}D: Length of size ${size} must ` +\n          `match the rank of the array (${inputRank}).`);\n\n  for (let i = 0; i < inputRank; ++i) {\n    util.assert(\n        begin[i] + size[i] <= input.shape[i],\n        () => `Error in slice${inputRank}D: begin[${i}] + size[${i}] ` +\n            `(${begin[i] + size[i]}) would overflow input.shape[${i}] (${\n                  input.shape[i]})`);\n  }\n}\n\n/** Converts a binary mask to an array of axes. Used in stridedSlice(). */\nexport function maskToAxes(mask: number): number[] {\n  const axes = [];\n  let axis = 0;\n  while (mask > 0) {\n    if (mask & 1) {\n      axes.push(axis);\n    }\n    mask /= 2;\n    axis++;\n  }\n  return axes;\n}\n\n/** Computes the output shape given the strided slice params. */\nexport function computeOutShape(\n    begin: number[], end: number[], strides: number[]): number[] {\n  const size = [];\n  for (let axis = 0; axis < begin.length; axis++) {\n    size[axis] = Math.ceil((end[axis] - begin[axis]) / strides[axis]);\n  }\n  return size;\n}\n\n// Creates full selection at the elided dimensions. If the dimension matches\n// the ellipsis mask, override the current stride value. Otherwise, insert.\nexport function stridesWithElidedDims(\n    strides: number[], ellipsisInsertionIndex: number, numElidedAxes: number,\n    inputShape: number[]): number[] {\n  const newStrides = [...strides];\n  for (let i = newStrides.length; i < inputShape.length; i++) {\n    newStrides.push(1);\n  }\n  for (let i = 0; i < numElidedAxes; i++) {\n    if (i === 0) {\n      newStrides[ellipsisInsertionIndex] = 1;\n    } else {\n      newStrides.splice(\n          ellipsisInsertionIndex, 0 /* num elements to delete */,\n          1 /* element to add */);\n      newStrides.pop();\n    }\n  }\n  return newStrides;\n}\n\nfunction unnormalizeAxis(\n    ellipsisInsertionIndex: number, numElidedAxes: number,\n    normalizedAxis: number): number {\n  if (normalizedAxis <= ellipsisInsertionIndex) {\n    return normalizedAxis;\n  }\n\n  return normalizedAxis - (numElidedAxes - 1);\n}\n\nfunction getElidedAxes(numElidedAxes: number, ellipsisInsertionIndex: number) {\n  const elidedAxes = [];\n  for (let i = 0; i < numElidedAxes; i++) {\n    elidedAxes.push(ellipsisInsertionIndex + i);\n  }\n  return elidedAxes;\n}\n\n// Normalize the start, end and strides.\nexport function getNormalizedAxes(\n    inputShape: number[], ellipsisAxes: number[], numInterpolatedAxes: number,\n    begin: number[], end: number[], strides: number[], beginMask: number,\n    endMask: number,\n    ellipsisMask: number): {begin: number[], end: number[], strides: number[]} {\n  const inputRank = inputShape.length;\n  let normalizedBegin = new Array(inputRank),\n      normalizedEnd = new Array(inputRank),\n      normalizedStrides = new Array(inputRank);\n  if (ellipsisAxes.length && numInterpolatedAxes > 0) {\n    const fullIndex = ellipsisAxes[0];\n\n    // The ellipsis applies to the masked index as well as any dimensions\n    // that are interpolated.\n    const numElidedAxes = numInterpolatedAxes + 1;\n    normalizedBegin = startIndicesWithElidedDims(\n        beginMask, fullIndex, numElidedAxes, begin, inputShape);\n    normalizedEnd = stopIndicesWithElidedDims(\n        endMask, fullIndex, numElidedAxes, end, inputShape);\n    normalizedStrides =\n        stridesWithElidedDims(strides, fullIndex, numElidedAxes, inputShape);\n  } else {\n    for (let axis = 0; axis < inputRank; axis++) {\n      normalizedBegin[axis] = startForAxis(\n          beginMask, begin, strides, inputShape, axis, ellipsisMask);\n      normalizedEnd[axis] =\n          stopForAxis(endMask, end, strides, inputShape, axis, ellipsisMask);\n      normalizedStrides[axis] = stridesForAxis(strides, axis, ellipsisMask);\n    }\n  }\n\n  return {\n    begin: normalizedBegin,\n    end: normalizedEnd,\n    strides: normalizedStrides\n  };\n}\n\n// Creates full selection at the elided dimensions. If the dimension matches\n// the ellipsis mask, override the current start value. Otherwise, insert.\nexport function startIndicesWithElidedDims(\n    beginMask: number, ellipsisInsertionIndex: number, numElidedAxes: number,\n    originalBegin: number[], inputShape: number[]): number[] {\n  const newIndices = [...inputShape];\n  const elidedAxes = getElidedAxes(numElidedAxes, ellipsisInsertionIndex);\n\n  for (let axis = 0; axis < newIndices.length; axis++) {\n    if (elidedAxes.indexOf(axis) > -1) {\n      newIndices[axis] = 0;\n    } else {\n      const originalAxis =\n          unnormalizeAxis(ellipsisInsertionIndex, numElidedAxes, axis);\n      let originalValue = originalBegin[originalAxis];\n      if (beginMask & 1 << originalAxis) {\n        originalValue = 0;\n      }\n\n      newIndices[axis] = originalValue;\n    }\n  }\n  return newIndices;\n}\n\n// Creates full selection at the elided dimensions. If the dimension matches\n// the ellipsis mask, override the current stop value. Otherwise, insert.\nexport function stopIndicesWithElidedDims(\n    endMask: number, ellipsisInsertionIndex: number, numElidedAxes: number,\n    originalEnd: number[], inputShape: number[]): number[] {\n  const newIndices = [...inputShape];\n  const elidedAxes = getElidedAxes(numElidedAxes, ellipsisInsertionIndex);\n\n  for (let axis = 0; axis < newIndices.length; axis++) {\n    if (elidedAxes.indexOf(axis) > -1) {\n      newIndices[axis] = Number.MAX_SAFE_INTEGER;\n    } else {\n      const originalAxis =\n          unnormalizeAxis(ellipsisInsertionIndex, numElidedAxes, axis);\n      let originalValue = originalEnd[originalAxis];\n      if (endMask & 1 << originalAxis) {\n        originalValue = Number.MAX_SAFE_INTEGER;\n      }\n      newIndices[axis] = originalValue;\n    }\n  }\n\n  for (let i = 0; i < newIndices.length; i++) {\n    // Handle negative indices\n    const axisSize = inputShape[i];\n    if (newIndices[i] < 0) {\n      newIndices[i] += axisSize;\n    }\n    newIndices[i] = util.clamp(0, newIndices[i], inputShape[i]);\n  }\n  return newIndices;\n}\n\nexport function stridesForAxis(\n    strides: number[], axis: number, ellipsisMask: number): number {\n  let stride = strides[axis];\n  if (ellipsisMask & (1 << axis) || stride == null) {\n    stride = 1;\n  }\n\n  return stride;\n}\n\nexport function startForAxis(\n    beginMask: number, startIndices: number[], strides: number[],\n    inputShape: number[], axis: number, ellipsisMask: number): number {\n  // Begin with the specified index\n  let start = startIndices[axis];\n  const stride = strides[axis] || 1;\n\n  // Check the axis bit from right of masked axes, or the begin index is not set\n  // for the axis.\n  if (beginMask & 1 << axis || ellipsisMask & 1 << axis || start == null) {\n    if (stride > 0) {\n      // Forward iteration - use the first element. These values will get\n      // clamped below (Note: We could have set them to 0 and axis_size-1, but\n      // use lowest() and max() to maintain symmetry with StopForAxis())\n      start = Number.MIN_SAFE_INTEGER;\n    } else {\n      // Backward iteration - use the last element.\n      start = Number.MAX_SAFE_INTEGER;\n    }\n  }\n\n  // Handle negative indices\n  const axisSize = inputShape[axis];\n  if (start < 0) {\n    start += axisSize;\n  }\n\n  // Clamping\n  start = util.clamp(0, start, axisSize - 1);\n\n  return start;\n}\n\nexport function stopForAxis(\n    endMask: number, stopIndices: number[], strides: number[],\n    inputShape: number[], axis: number, ellipsisMask: number): number {\n  // Begin with the specified index\n  let stop = stopIndices[axis];\n  const stride = strides[axis] || 1;\n\n  // Check the axis bit from right of masked axes, or if the stop index is not\n  // set for this axis.\n  if (endMask & (1 << axis) || ellipsisMask & (1 << axis) || stop == null) {\n    if (stride > 0) {\n      // Forward iteration - use the last element. These values will get\n      // clamped below\n      stop = Number.MAX_SAFE_INTEGER;\n    } else {\n      // Backward iteration - use the first element.\n      stop = Number.MIN_SAFE_INTEGER;\n    }\n  }\n\n  // Handle negative indices\n  const axisSize = inputShape[axis];\n  if (stop < 0) {\n    stop += axisSize;\n  }\n\n  // Clamping\n  // Because the end index points one past the last element, we need slightly\n  // different clamping ranges depending on the direction.\n  if (stride > 0) {\n    // Forward iteration\n    stop = util.clamp(0, stop, axisSize);\n  } else {\n    // Backward iteration\n    stop = util.clamp(-1, stop, axisSize - 1);\n  }\n\n  return stop;\n}\n\n/**\n * Returns true if the slice occupies a continous set of elements in the\n * 'flat' space.\n */\nexport function isSliceContinous(\n    shape: number[], begin: number[], size: number[]) {\n  // Index of the first axis that has size > 1.\n  let firstNonOneAxis = size.length;\n  for (let i = 0; i < size.length; i++) {\n    if (size[i] > 1) {\n      firstNonOneAxis = i;\n      break;\n    }\n  }\n\n  for (let i = firstNonOneAxis + 1; i < size.length; i++) {\n    if (begin[i] > 0 || size[i] !== shape[i]) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport function computeFlatOffset(begin: number[], strides: number[]): number {\n  let flatOffset = begin.length > 0 ? begin[begin.length - 1] : 1;\n  for (let i = 0; i < begin.length - 1; i++) {\n    flatOffset += begin[i] * strides[i];\n  }\n  return flatOffset;\n}\n\nexport function parseSliceParams(\n    x: TensorInfo, begin: number|number[], size?: number|number[]) {\n  // The following logic allows for more ergonomic calls.\n  let begin_: number[];\n  const xRank = x.shape.length;\n  if (typeof begin === 'number') {\n    begin_ = [begin, ...new Array(xRank - 1).fill(0)];\n  } else if (begin.length < xRank) {\n    begin_ = begin.concat(new Array(xRank - begin.length).fill(0));\n  } else {\n    begin_ = begin.slice();\n  }\n  begin_.forEach(d => {\n    util.assert(\n        d !== -1, () => 'slice() does not support negative begin indexing.');\n  });\n  let size_: number[];\n  if (size == null) {\n    size_ = new Array(xRank).fill(-1);\n  } else if (typeof size === 'number') {\n    size_ = [size, ...new Array(xRank - 1).fill(-1)];\n  } else if (size.length < xRank) {\n    size_ = size.concat(new Array(xRank - size.length).fill(-1));\n  } else {\n    size_ = size;\n  }\n  size_ = size_.map((d, i) => {\n    if (d >= 0) {\n      return d;\n    } else {\n      util.assert(\n          d === -1,\n          () => `Negative size values should be exactly -1 but got ` +\n              `${d} for the slice() size at index ${i}.`);\n      return x.shape[i] - begin_[i];\n    }\n  });\n  return [begin_, size_];\n}\n\n// Convert the slicing specification from a sparse representation to a dense\n// representation. This means that all ellipses and newaxis are expanded out.\nexport function sliceInfo(\n    xShape: number[], begin: number[], end: number[], strides: number[],\n    beginMask: number, endMask: number, ellipsisMask: number,\n    newAxisMask: number, shrinkAxisMask: number): SliceInfo {\n  let stridesNonNull;\n  if (strides == null) {\n    stridesNonNull = new Array(begin.length);\n    stridesNonNull.fill(1);\n  } else {\n    stridesNonNull = strides;\n  }\n\n  // Only one non-zero bit is allowed in ellipsisMask, which means ellipsisMask\n  // is a power of 2. Use bit compares to ensure ellipsisMask is 0 or a power\n  // of 2. When i is a power of 2, i & (i - 1) is always 0.\n  // Also ref:\n  // https://stackoverflow.com/questions/600293/how-to-check-if-a-number-is-a-power-of-2\n  if (ellipsisMask != null && (ellipsisMask & (ellipsisMask - 1)) !== 0) {\n    throw new Error('Multiple ellipses in slice is not allowed.');\n  }\n\n  // Step 1: Account for ellipsis and new axis.\n  // Check for ellipsis and count how many non-newaxis there are after.\n  let ellipsisSeen = false;\n\n  const sparseSpec: StridedSliceSparseSpec = {\n    dims: stridesNonNull.length,\n    numAddAxisAfterEllipsis: 0,\n    begin: begin.slice(),\n    end: end.slice(),\n    strides: stridesNonNull.slice(),\n    beginMask,\n    endMask,\n    ellipsisMask,\n    newAxisMask,\n    shrinkAxisMask\n  };\n\n  for (let i = 0; i < sparseSpec.dims; i++) {\n    if (ellipsisSeen && ((1 << i) & newAxisMask) !== 0) {\n      sparseSpec.numAddAxisAfterEllipsis++;\n    }\n    if ((1 << i) & ellipsisMask) {\n      ellipsisSeen = true;\n    }\n  }\n  // If no ellipsis insert one at the end.\n  if (!ellipsisSeen) {\n    sparseSpec.ellipsisMask |= (1 << sparseSpec.dims);\n    sparseSpec.dims++;  // this effects loop iteration below\n  }\n\n  // Step 2: Make a sparse spec into a full index spec.\n  //\n  // The sparse spec deos not correspond to the number of dimensions.\n  // Make a dense spec that cooresponds to the number of dimensions.\n  //\n  // For example suppose foo[...,3:] on foo.shape = [2, 2, 3] then we need to\n  // produce the missing beginMask for the first two dimensions i.e. from\n  // beginMaskSpec = 0, endMaskSpec = 2, we achieve beginMask = 6 (110),\n  // endMask = 7 (111).\n  const denseSpec: StridedSliceDenseSpec = {\n    dims: xShape.length,\n    beginMask: 0,\n    endMask: 0,\n    beginValid: false,\n    endValid: false\n  };\n\n  buildDenseSpec(sparseSpec, denseSpec);\n\n  // Step 3: Make implicit ranges (non-zero beginMasks and endMasks) explicit\n  // and bounds check.\n  let isIdentity = true;\n  let sliceDim0 = true;\n  let isSimpleSlice = true;\n  const processingShape = [];\n  const finalShape = [];\n\n  for (let i = 0; i < xShape.length; ++i) {\n    if (denseSpec.strides[i] === 0) {\n      throw Error(`strides[${i}] must be non-zero`);\n    }\n    const shrinkI = !!(denseSpec.shrinkAxisMask & (1 << i));\n    const dimI = xShape[i];\n    if (dimI === -1) {\n      processingShape.push(shrinkI ? 1 : -1);\n      continue;\n    }\n\n    const masks =\n        [denseSpec.beginMask & (1 << i), denseSpec.endMask & (1 << i)];\n    const validRange = [\n      denseSpec.strides[i] > 0 ? 0 : -1,\n      denseSpec.strides[i] > 0 ? dimI : dimI - 1\n    ];\n\n    if (shrinkI && denseSpec.strides[i] <= 0) {\n      throw Error('only stride 1 allowed on non-range indexing.');\n    }\n\n    isSimpleSlice = isSimpleSlice && (denseSpec.strides[i] === 1);\n\n    const beginAndEndMasked =\n        !!((denseSpec.beginMask & (1 << i)) && (denseSpec.endMask & (1 << i)));\n\n    if (denseSpec.beginValid && denseSpec.endValid) {\n      if (shrinkI) {\n        // If we are shrinking, the end index is now possibly incorrect. In\n        // particular foo[-1] produces sparseBegin = -1, sparseEnd = 0.\n        // and canonical puts these to n-1 and 0, which implies a degenerate\n        // interval. Fortunately, it is now safe to re-create end as begin + 1.\n        const xFwd = denseSpec.begin[i] < 0 ? dimI + denseSpec.begin[i] :\n                                              denseSpec.begin[i];\n        denseSpec.begin[i] = xFwd;\n        denseSpec.end[i] = denseSpec.begin[i] + 1;\n        if (xFwd < 0 || xFwd >= dimI) {\n          throw Error(`slice index ${denseSpec.begin[i]} of dimension ${\n              i} out of bounds.`);\n        }\n      } else {\n        denseSpec.begin[i] = canonical(\n            denseSpec.begin[i], 0, denseSpec.strides[i], dimI, masks,\n            validRange);\n        denseSpec.end[i] = canonical(\n            denseSpec.end[i], 1, denseSpec.strides[i], dimI, masks, validRange);\n      }\n      // Update optimization values\n      const takeAllInDimension = denseSpec.strides[i] === 1 &&\n          denseSpec.begin[i] === 0 && denseSpec.end[i] === dimI;\n      isIdentity = isIdentity && takeAllInDimension;\n      sliceDim0 = sliceDim0 &&\n          ((i === 0 && denseSpec.strides[i] === 1) || takeAllInDimension);\n    } else {\n      isIdentity =\n          isIdentity && ((denseSpec.strides[i] === 1) && beginAndEndMasked);\n      sliceDim0 = sliceDim0 &&\n          ((i === 0 && denseSpec.strides[i] === 1) || beginAndEndMasked);\n    }\n    // Compute the processing shape (the intermediate Eigen will produce)\n    let intervalLength;\n    let knownInterval = false;\n    if (denseSpec.beginValid && denseSpec.endValid) {\n      intervalLength = denseSpec.end[i] - denseSpec.begin[i];\n      knownInterval = true;\n    } else if (shrinkI) {\n      // The dimension is still known as 1 for the processingShape, but will be\n      // discarded for the final shape.\n      intervalLength = 1;\n      knownInterval = true;\n    } else if (beginAndEndMasked) {\n      // Even if we don't have values for begin or end, we do know that this\n      // dimension covers the whole interval. If we have shape information for\n      // this dimension, that tells us the interval length.\n      if (dimI >= 0) {\n        if (denseSpec.strides[i] < 0) {\n          intervalLength = -dimI;\n        } else {\n          intervalLength = dimI;\n        }\n        knownInterval = true;\n      }\n    }\n    if (knownInterval) {\n      let sizeI;\n      // Hold zero if the interval is degenerate, otherwise account for\n      // remainder\n      if (intervalLength === 0 ||\n          ((intervalLength < 0) !== (denseSpec.strides[i] < 0))) {\n        sizeI = 0;\n      } else {\n        sizeI = Math.trunc(intervalLength / denseSpec.strides[i]) +\n            (intervalLength % denseSpec.strides[i] !== 0 ? 1 : 0);\n      }\n      processingShape.push(sizeI);\n    } else {\n      processingShape.push(-1);\n    }\n  }\n\n  // Step 4: Compute the final shape\n  //\n  // newAxis will increase dimension by 1 (with a one-size dimension)\n  // slices like foo[3, ...] will reduce dimension by 1.\n  // This cannot be done earlier, because it depends on Step 3.\n  for (let denseDim = 0; denseDim < denseSpec.finalShapeGatherIndices.length;\n       ++denseDim) {\n    const gatherIndex = denseSpec.finalShapeGatherIndices[denseDim];\n    if (gatherIndex >= 0) {\n      finalShape.push(processingShape[gatherIndex]);\n    } else if (gatherIndex === NEW_AXIS) {\n      finalShape.push(1);\n    }\n  }\n\n  const finalShapeSparse = finalShape.filter(\n      (dim, i) => denseSpec.finalShapeGatherIndices[i] !== NEW_AXIS);\n\n  return {\n    finalShapeSparse,\n    finalShape,\n    isIdentity,\n    sliceDim0,\n    isSimpleSlice,\n    begin: denseSpec.begin,\n    end: denseSpec.end,\n    strides: denseSpec.strides\n  };\n}\n\nfunction buildDenseSpec(\n    sparse: StridedSliceSparseSpec, dense: StridedSliceDenseSpec) {\n  dense.beginMask = 0;\n  dense.endMask = 0;\n  dense.shrinkAxisMask = 0;\n\n  let fullIndex = 0;\n  dense.beginValid = sparse.begin != null;\n  dense.endValid = sparse.end != null;\n\n  dense.begin = new Array(dense.dims);\n  dense.end = new Array(dense.dims);\n  dense.strides = new Array(dense.dims);\n  dense.finalShapeGatherIndices = [];\n  dense.finalShapeGatherIndicesSparse = [];\n  dense.inputShapeGatherIndicesSparse = new Array(dense.dims);\n\n  for (let i = 0; i < sparse.dims; i++) {\n    if ((1 << i) & sparse.ellipsisMask) {\n      // Only the bit that has ellipsis will fall in this condition.\n      // Expand the ellipsis into the appropriate indices\n      // Note: this only works because we guaranteed one ellipsis.\n      const nextIndex = Math.min(\n          dense.dims - (sparse.dims - i) + 1 + sparse.numAddAxisAfterEllipsis,\n          dense.dims);\n      for (; fullIndex < nextIndex; fullIndex++) {\n        // newAxis aren't real axis so you have to skip.\n        dense.begin[fullIndex] = 0;\n        dense.end[fullIndex] = 0;\n        dense.strides[fullIndex] = 1;\n        dense.beginMask |= (1 << fullIndex);\n        dense.endMask |= (1 << fullIndex);\n        dense.finalShapeGatherIndices.push(fullIndex);\n        dense.finalShapeGatherIndicesSparse.push(-1);\n        dense.inputShapeGatherIndicesSparse[fullIndex] = i;\n      }\n    } else if ((1 << i) & sparse.newAxisMask) {\n      // Only the bit that has newAxis will fall in this condition.\n      dense.finalShapeGatherIndices.push(NEW_AXIS);\n      dense.finalShapeGatherIndicesSparse.push(-1);\n    } else {\n      if (fullIndex === dense.begin.length) {\n        throw Error(\n            `Index out of range using input dim ${fullIndex}; input ` +\n            `has only ${dense.dims} dims, ${dense.begin.length}.`);\n      }\n\n      // Gather slicing spec into appropriate index.\n      if (sparse.begin != null) {\n        dense.begin[fullIndex] = sparse.begin[i];\n      }\n      if (sparse.end != null) {\n        dense.end[fullIndex] = sparse.end[i];\n      }\n      dense.strides[fullIndex] = sparse.strides[i];\n      if (sparse.beginMask & (1 << i)) {\n        dense.beginMask |= (1 << fullIndex);\n      }\n      if (sparse.endMask & (1 << i)) {\n        dense.endMask |= (1 << fullIndex);\n      }\n      // If shrink, record where to get the dimensionality from (i.e. newAxis)\n      // creates a fake 1 size dimension. Also remember shrink axis (now in\n      // dense form) so we can ignore dense.end below.\n      if (sparse.shrinkAxisMask & (1 << i)) {\n        dense.finalShapeGatherIndices.push(SHRINK_AXIS);\n        dense.finalShapeGatherIndicesSparse.push(-1);\n        dense.shrinkAxisMask |= (1 << fullIndex);\n      } else {\n        dense.finalShapeGatherIndices.push(fullIndex);\n        // Remember that where in the sparse shape the dense dim comes from.\n        dense.finalShapeGatherIndicesSparse.push(i);\n      }\n      dense.inputShapeGatherIndicesSparse[fullIndex] = i;\n      fullIndex++;\n    }\n  }\n}\n\nfunction canonical(\n    x: number, c: number, strideI: number, dimI: number, masks: number[],\n    validRange: number[]) {\n  if (masks[c]) {\n    return strideI > 0 ? validRange[c] : validRange[(c + 1) & 1];\n  } else {\n    const xFwd = x < 0 ? dimI + x : x;  // make negative indices positive\n    return xFwd < validRange[0] ? validRange[0] :\n                                  xFwd > validRange[1] ? validRange[1] : xFwd;\n  }\n}\n", "/** @license See the LICENSE file. */\n\n// This code is auto-generated, do not modify this file!\nconst version = '4.22.0';\nexport {version};\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {AdadeltaOptimizer} from './adadelta_optimizer';\nimport {AdagradOptimizer} from './adagrad_optimizer';\nimport {AdamOptimizer} from './adam_optimizer';\nimport {AdamaxOptimizer} from './adamax_optimizer';\nimport {MomentumOptimizer} from './momentum_optimizer';\nimport {RMSPropOptimizer} from './rmsprop_optimizer';\nimport {SGDOptimizer} from './sgd_optimizer';\n\nexport class OptimizerConstructors {\n  /**\n   * Constructs a `tf.SGDOptimizer` that uses stochastic gradient descent.\n   *\n   * ```js\n   * // Fit a quadratic function by learning the coefficients a, b, c.\n   * const xs = tf.tensor1d([0, 1, 2, 3]);\n   * const ys = tf.tensor1d([1.1, 5.9, 16.8, 33.9]);\n   *\n   * const a = tf.scalar(Math.random()).variable();\n   * const b = tf.scalar(Math.random()).variable();\n   * const c = tf.scalar(Math.random()).variable();\n   *\n   * // y = a * x^2 + b * x + c.\n   * const f = x => a.mul(x.square()).add(b.mul(x)).add(c);\n   * const loss = (pred, label) => pred.sub(label).square().mean();\n   *\n   * const learningRate = 0.01;\n   * const optimizer = tf.train.sgd(learningRate);\n   *\n   * // Train the model.\n   * for (let i = 0; i < 10; i++) {\n   *   optimizer.minimize(() => loss(f(xs), ys));\n   * }\n   *\n   * // Make predictions.\n   * console.log(\n   *     `a: ${a.dataSync()}, b: ${b.dataSync()}, c: ${c.dataSync()}`);\n   * const preds = f(xs).dataSync();\n   * preds.forEach((pred, i) => {\n   *   console.log(`x: ${i}, pred: ${pred}`);\n   * });\n   * ```\n   *\n   * @param learningRate The learning rate to use for the SGD algorithm.\n   *\n   * @doc {heading: 'Training', subheading: 'Optimizers', namespace: 'train'}\n   */\n  static sgd(learningRate: number): SGDOptimizer {\n    return new SGDOptimizer(learningRate);\n  }\n\n  /**\n   * Constructs a `tf.MomentumOptimizer` that uses momentum gradient\n   * descent.\n   *\n   * See\n   * [http://proceedings.mlr.press/v28/sutskever13.pdf](\n   * http://proceedings.mlr.press/v28/sutskever13.pdf)\n   *\n   * @param learningRate The learning rate to use for the Momentum gradient\n   * descent algorithm.\n   * @param momentum The momentum to use for the momentum gradient descent\n   * algorithm.\n   *\n   * @doc {heading: 'Training', subheading: 'Optimizers', namespace: 'train'}\n   */\n  static momentum(learningRate: number, momentum: number, useNesterov = false):\n      MomentumOptimizer {\n    return new MomentumOptimizer(learningRate, momentum, useNesterov);\n  }\n\n  /**\n   * Constructs a `tf.RMSPropOptimizer` that uses RMSProp gradient\n   * descent. This implementation uses plain momentum and is not centered\n   * version of RMSProp.\n   *\n   * See\n   * [http://www.cs.toronto.edu/~tijmen/csc321/slides/lecture_slides_lec6.pdf](\n   * http://www.cs.toronto.edu/~tijmen/csc321/slides/lecture_slides_lec6.pdf)\n   *\n   * @param learningRate The learning rate to use for the RMSProp gradient\n   * descent algorithm.\n   * @param decay The discounting factor for the history/coming gradient.\n   * @param momentum The momentum to use for the RMSProp gradient descent\n   * algorithm.\n   * @param epsilon Small value to avoid zero denominator.\n   * @param centered If true, gradients are normalized by the estimated\n   * variance of the gradient.\n   *\n   * @doc {heading: 'Training', subheading: 'Optimizers', namespace: 'train'}\n   */\n  static rmsprop(\n      learningRate: number, decay = .9, momentum = 0.0, epsilon: number = null,\n      centered = false): RMSPropOptimizer {\n    return new RMSPropOptimizer(\n        learningRate, decay, momentum, epsilon, centered);\n  }\n\n  /**\n   * Constructs a `tf.AdamOptimizer` that uses the Adam algorithm.\n   * See [https://arxiv.org/abs/1412.6980](https://arxiv.org/abs/1412.6980)\n   *\n   * @param learningRate The learning rate to use for the Adam gradient\n   * descent algorithm.\n   * @param beta1 The exponential decay rate for the 1st moment estimates.\n   * @param beta2 The exponential decay rate for the 2nd moment estimates.\n   * @param epsilon A small constant for numerical stability.\n   *\n   * @doc {heading: 'Training', subheading: 'Optimizers', namespace: 'train'}\n   */\n  static adam(\n      learningRate = 0.001, beta1 = 0.9, beta2 = 0.999,\n      epsilon: number = null): AdamOptimizer {\n    return new AdamOptimizer(learningRate, beta1, beta2, epsilon);\n  }\n\n  /**\n   * Constructs a `tf.AdadeltaOptimizer` that uses the Adadelta algorithm.\n   * See [https://arxiv.org/abs/1212.5701](https://arxiv.org/abs/1212.5701)\n   *\n   * @param learningRate The learning rate to use for the Adadelta gradient\n   * descent algorithm.\n   * @param rho The learning rate decay over each update.\n   * @param epsilon A constant epsilon used to better condition the grad\n   * update.\n   *\n   * @doc {heading: 'Training', subheading: 'Optimizers', namespace: 'train'}\n   */\n  static adadelta(learningRate = .001, rho = .95, epsilon: number = null):\n      AdadeltaOptimizer {\n    return new AdadeltaOptimizer(learningRate, rho, epsilon);\n  }\n\n  /**\n   * Constructs a `tf.AdamaxOptimizer` that uses the Adamax algorithm.\n   * See [https://arxiv.org/abs/1412.6980](https://arxiv.org/abs/1412.6980)\n   *\n   * @param learningRate The learning rate to use for the Adamax gradient\n   * descent algorithm.\n   * @param beta1 The exponential decay rate for the 1st moment estimates.\n   * @param beta2 The exponential decay rate for the 2nd moment estimates.\n   * @param epsilon A small constant for numerical stability.\n   * @param decay The learning rate decay over each update.\n   *\n   * @doc {heading: 'Training', subheading: 'Optimizers', namespace: 'train'}\n   */\n  static adamax(\n      learningRate = 0.002, beta1 = 0.9, beta2 = 0.999, epsilon: number = null,\n      decay = 0.0): AdamaxOptimizer {\n    return new AdamaxOptimizer(learningRate, beta1, beta2, epsilon, decay);\n  }\n\n  /**\n   * Constructs a `tf.AdagradOptimizer` that uses the Adagrad algorithm.\n   * See\n   * [http://www.jmlr.org/papers/volume12/duchi11a/duchi11a.pdf](\n   * http://www.jmlr.org/papers/volume12/duchi11a/duchi11a.pdf)\n   * or\n   * [http://ruder.io/optimizing-gradient-descent/index.html#adagrad](\n   * http://ruder.io/optimizing-gradient-descent/index.html#adagrad)\n   *\n   * @param learningRate The learning rate to use for the Adagrad gradient\n   * descent algorithm.\n   * @param initialAccumulatorValue Starting value for the accumulators, must be\n   * positive.\n   *\n   * @doc {heading: 'Training', subheading: 'Optimizers', namespace: 'train'}\n   */\n  static adagrad(learningRate: number, initialAccumulatorValue = 0.1):\n      AdagradOptimizer {\n    return new AdagradOptimizer(learningRate, initialAccumulatorValue);\n  }\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {OptimizerConstructors} from './optimizers/optimizer_constructors';\n\nexport const train = OptimizerConstructors;\n", "/**\n * @license\n * Copyright 2017 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nconst delayCallback: Function = (() => {\n  if (typeof requestAnimationFrame !== 'undefined') {\n    return requestAnimationFrame;\n  } else if (typeof setImmediate !== 'undefined') {\n    return setImmediate;\n  }\n  return (f: Function) => f();  // no delays\n})();\n\n/**\n * Returns a promise that resolves when a requestAnimationFrame has completed.\n *\n * On Node.js this uses setImmediate instead of requestAnimationFrame.\n *\n * This is simply a sugar method so that users can do the following:\n * `await tf.nextFrame();`\n *\n * @doc {heading: 'Performance', subheading: 'Timing'}\n */\nfunction nextFrame(): Promise<void> {\n  return new Promise<void>(resolve => delayCallback(() => resolve()));\n}\n\nexport {nextFrame};\n", "/**\n * @license\n * Copyright 2017 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport * as util from '../util';\n\nexport function assertParamsConsistent(shapes: number[][], axis: number) {\n  const rank = shapes[0].length;\n  shapes.forEach((shape, i) => {\n    util.assert(\n        shape.length === rank,\n        () =>\n            `Error in concat${rank}D: rank of tensors[${i}] must be the same ` +\n            `as the rank of the rest (${rank})`);\n  });\n\n  util.assert(\n      axis >= 0 && axis < rank,\n      () => `Error in concat${rank}D: axis must be between 0 and ${rank - 1}.`);\n\n  const firstShape = shapes[0];\n  shapes.forEach((shape, i) => {\n    for (let r = 0; r < rank; r++) {\n      util.assert(\n          (r === axis) || (shape[r] === firstShape[r]),\n          () => `Error in concat${rank}D: Shape of tensors[${i}] (${shape}) ` +\n              `does not match the shape of the rest (${firstShape}) ` +\n              `along the non-concatenated axis ${i}.`);\n    }\n  });\n}\n\nexport function computeOutShape(shapes: number[][], axis: number): number[] {\n  const outputShape = shapes[0].slice();\n  for (let i = 1; i < shapes.length; i++) {\n    outputShape[axis] += shapes[i][axis];\n  }\n  return outputShape;\n}\n", "/**\n * @license\n * Copyright 2022 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nexport enum RowPartitionType {\n  FIRST_DIM_SIZE,\n  VALUE_ROWIDS,\n  ROW_LENGTHS,\n  ROW_SPLITS,\n  ROW_LIMITS,\n  ROW_STARTS\n}\n\nexport function combineRaggedTensorToTensorShapes(\n    raggedRank: number, shape: number[], valueShape: number[]) {\n  // Test for consistency of valueShape and shape specified.\n  // If shape is unspecified and valueShape is specified, then copy\n  // over the size from the valueShape dimension.\n\n  let outputShape: number[] = new Array();\n  if (valueShape == null && shape == null) {\n    return outputShape;\n  }\n\n  if (shape == null) {\n    // Here, value_shape must be of known size.\n    while (outputShape.length < raggedRank + valueShape.length) {\n      outputShape.push(-1);\n    }\n  } else {\n    outputShape = shape.slice();\n  }\n  if (valueShape == null) {\n    return outputShape;\n  }\n  // At this point, valueShape and output_shape have known ranks.\n  if (raggedRank + valueShape.length !== outputShape.length) {\n    throw new Error(\n        `rt input.shape and shape=${shape} are incompatible: rt input.rank = ${\n            raggedRank +\n            valueShape.length}, but shape.rank = ${outputShape.length}`);\n  }\n\n  for (let i = 1; i < valueShape.length; ++i) {\n    const valueDim = valueShape[i];\n    const outputShapeDimIndex =\n        outputShape[outputShape.length - valueShape.length + i];\n    const outputShapeDim = outputShape[outputShapeDimIndex];\n\n    if (valueDim >= 0) {\n      if (outputShapeDim >= 0) {\n        if (outputShapeDim !== valueDim) {\n          throw new Error(`rt input.shape and shape=${\n              shape} are incompatible: rt input.shape[${i + raggedRank}] = ${\n              valueDim} but shape[${i + raggedRank}] = ${outputShapeDim}`);\n        }\n      } else {\n        outputShape[outputShapeDimIndex] = valueDim;\n      }\n    }\n  }\n  return outputShape;\n}\n\nexport function getRowPartitionTypesHelper(rowPartitionTypeStrings: string[]) {\n  const stringToType = {\n    'FIRST_DIM_SIZE': RowPartitionType.FIRST_DIM_SIZE,\n    'VALUE_ROWIDS': RowPartitionType.VALUE_ROWIDS,\n    'ROW_LENGTHS': RowPartitionType.ROW_LENGTHS,\n    'ROW_SPLITS': RowPartitionType.ROW_SPLITS,\n    'ROW_LIMITS': RowPartitionType.ROW_LIMITS,\n    'ROW_STARTS': RowPartitionType.ROW_STARTS\n  };\n\n  const result: RowPartitionType[] = [];\n  for (const typeStr of rowPartitionTypeStrings) {\n    if (typeStr in stringToType) {\n      result.push(stringToType[typeStr as keyof typeof stringToType]);\n    } else {\n      break;\n    }\n  }\n\n  return result;\n}\n\nexport function getRaggedRank(rowPartitionTypes: RowPartitionType[]) {\n  if (rowPartitionTypes.length === 0) {\n    return 0;\n  }\n  if (rowPartitionTypes[0] === RowPartitionType.FIRST_DIM_SIZE) {\n    return rowPartitionTypes.length - 1;\n  }\n  return rowPartitionTypes.length;\n}\n\nexport function validateDefaultValueShape(\n    defaultValueShape: number[], valueShape: number[]) {\n  if (defaultValueShape == null || valueShape == null) {\n    return;\n  }\n\n  const defaultNDims = defaultValueShape.length;\n  const valuesNDims = valueShape.length;\n  if (defaultNDims >= valuesNDims) {\n    throw new Error(`defaultValue.shape=${\n        defaultValueShape} and ragged tensor flatValues.shape=${\n        valueShape}, are incompatible: defaultValue.rank = ${\n        defaultNDims} must be less than ragged tensor input flatValues.rank = ${\n        valuesNDims})`);\n  }\n  for (let i = 0; i < Math.min(defaultNDims, valuesNDims - 1); ++i) {\n    const defaultDim = defaultValueShape[i];\n    const valueDim = valueShape[i + 1];\n    if (defaultDim >= 0 && valueDim >= 0 && defaultDim !== 1 &&\n        defaultDim !== valueDim) {\n      throw new Error(`defaultValue.shape=${\n          defaultValueShape}, and ragged tensor input flatValues.shape=${\n          valueShape} are incompatible: defaultValue.shape[${\n          i - defaultValueShape.length}] = ${\n          defaultDim} but ragged tensor input.flatValues.shape[${\n          i - defaultValueShape.length}] = ${valueDim}`);\n    }\n  }\n}\n", "/**\n * @license\n * Copyright 2017 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/**\n * Inputs of size above this threshold will be parallelized by calling multiple\n * shader programs.\n */\nimport {nearestDivisor} from '../util';\n\nexport const PARALLELIZE_THRESHOLD = 30;\n\nexport interface ReduceInfo {\n  windowSize: number;\n  batchSize: number;\n  inSize: number;\n  outSize: number;\n}\n\nexport function computeOptimalWindowSize(inSize: number): number {\n  if (inSize <= PARALLELIZE_THRESHOLD) {\n    return inSize;\n  }\n  return nearestDivisor(inSize, Math.floor(Math.sqrt(inSize)));\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n// Returns the image center in pixels.\nexport function getImageCenter(\n    center: number|[number, number], imageHeight: number,\n    imageWidth: number): [number, number] {\n  const centerX =\n      imageWidth * (typeof center === 'number' ? center : center[0]);\n  const centerY =\n      imageHeight * (typeof center === 'number' ? center : center[1]);\n  return [centerX, centerY];\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/**\n * Gets the new shape of the input Tensor after it's been reshaped\n * to:\n * [blockShape[0], ..., blockShape[M-1], batch / prod(blockShape),\n * inputShape[1], ..., inputShape[N-1]]\n *\n * See step 1: https://www.tensorflow.org/api_docs/python/tf/batch_to_space_nd\n */\nexport function getReshaped(\n    inputShape: number[], blockShape: number[], prod: number,\n    batchToSpace = true): number[] {\n  let reshaped: number[] = [];\n  if (batchToSpace) {\n    reshaped = reshaped.concat(blockShape.slice(0));\n    reshaped.push(inputShape[0] / prod);\n    reshaped = reshaped.concat(inputShape.slice(1));\n  } else {\n    reshaped = reshaped.concat(inputShape[0]);\n    const spatialLength = blockShape.length;\n    for (let i = 0; i < spatialLength; ++i) {\n      reshaped =\n          reshaped.concat([inputShape[i + 1] / blockShape[i], blockShape[i]]);\n    }\n    reshaped = reshaped.concat(inputShape.slice(spatialLength + 1));\n  }\n  return reshaped;\n}\n\n/**\n * Gets the permutation that will transpose the dimensions of the\n * reshaped tensor to shape:\n *\n * [batch / prod(block_shape),inputShape[1], blockShape[0], ...,\n * inputShape[M], blockShape[M-1],inputShape[M+1], ..., inputShape[N-1]]\n *\n * see step 2: https://www.tensorflow.org/api_docs/python/tf/batch_to_space_nd\n */\nexport function getPermuted(\n    reshapedRank: number, blockShapeRank: number,\n    batchToSpace = true): number[] {\n  const permuted = [];\n  if (batchToSpace) {\n    permuted.push(blockShapeRank);\n    for (let i = blockShapeRank + 1; i < reshapedRank; ++i) {\n      if (i <= 2 * blockShapeRank) {\n        permuted.push(i);\n        permuted.push(i - (blockShapeRank + 1));\n      } else {\n        permuted.push(i);\n      }\n    }\n  } else {\n    const permutedBeforeBatch = [];\n    const permutedAfterBatch = [];\n    for (let i = 1; i < reshapedRank; ++i) {\n      if (i >= blockShapeRank * 2 + 1 || i % 2 === 1) {\n        permutedAfterBatch.push(i);\n      } else {\n        permutedBeforeBatch.push(i);\n      }\n    }\n    permuted.push(...permutedBeforeBatch);\n    permuted.push(0);\n    permuted.push(...permutedAfterBatch);\n  }\n  return permuted;\n}\n\n/**\n * Gets the shape of the reshaped and permuted input Tensor before any cropping\n * is applied.  The new shape will be:\n *\n * [batch / prod(blockShape),inputShape[1] * blockShape[0], ...,\n * inputShape[M] * blockShape[M-1],inputShape[M+1], ..., inputShape[N-1]]\n *\n * See step 3: https://www.tensorflow.org/api_docs/python/tf/batch_to_space_nd\n */\nexport function getReshapedPermuted(\n    inputShape: number[], blockShape: number[], prod: number,\n    batchToSpace = true): number[] {\n  const reshapedPermuted = [];\n\n  if (batchToSpace) {\n    reshapedPermuted.push(inputShape[0] / prod);\n  } else {\n    reshapedPermuted.push(inputShape[0] * prod);\n  }\n\n  for (let i = 1; i < inputShape.length; ++i) {\n    if (i <= blockShape.length) {\n      if (batchToSpace) {\n        reshapedPermuted.push(blockShape[i - 1] * inputShape[i]);\n      } else {\n        reshapedPermuted.push(inputShape[i] / blockShape[i - 1]);\n      }\n    } else {\n      reshapedPermuted.push(inputShape[i]);\n    }\n  }\n\n  return reshapedPermuted;\n}\n\n/**\n * Converts the crops argument into the beginning coordinates of a slice\n * operation.\n */\nexport function getSliceBeginCoords(\n    crops: number[][], blockShape: number): number[] {\n  const sliceBeginCoords = [0];\n  for (let i = 0; i < blockShape; ++i) {\n    sliceBeginCoords.push(crops[i][0]);\n  }\n  return sliceBeginCoords;\n}\n\n/**\n * Converts the crops argument into the size of a slice operation.  When\n * combined with getSliceBeginCoords this function allows the reshaped and\n * permuted Tensor to be cropped to its final output shape of:\n *\n * inputShape[1] * blockShape[0] - crops[0,0] - crops[0,1], ...,\n * inputShape[M] * blockShape[M-1] -crops[M-1,0] -\n * crops[M-1,1],inputShape[M+1], ..., inputShape[N-1]]\n *\n * See step 4: https://www.tensorflow.org/api_docs/python/tf/batch_to_space_nd\n */\nexport function getSliceSize(\n    uncroppedShape: number[], crops: number[][], blockShape: number): number[] {\n  const sliceSize = uncroppedShape.slice(0, 1);\n  for (let i = 0; i < blockShape; ++i) {\n    sliceSize.push(uncroppedShape[i + 1] - crops[i][0] - crops[i][1]);\n  }\n\n  return sliceSize;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nexport const SELU_SCALEALPHA = 1.7580993408473768599402175208123;\nexport const SELU_SCALE = 1.0507009873554804934193349852946;\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nexport const ERF_P = 0.3275911;\nexport const ERF_A1 = 0.254829592;\nexport const ERF_A2 = -0.284496736;\nexport const ERF_A3 = 1.421413741;\nexport const ERF_A4 = -1.453152027;\nexport const ERF_A5 = 1.061405429;\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {TypedArray} from '../types';\n/**\n * Merges real and imaginary Float32Arrays into a single complex Float32Array.\n *\n * The memory layout is interleaved as follows:\n * real: [r0, r1, r2]\n * imag: [i0, i1, i2]\n * complex: [r0, i0, r1, i1, r2, i2]\n *\n * This is the inverse of splitRealAndImagArrays.\n *\n * @param real The real values of the complex tensor values.\n * @param imag The imag values of the complex tensor values.\n * @returns A complex tensor as a Float32Array with merged values.\n */\nexport function mergeRealAndImagArrays(\n    real: Float32Array, imag: Float32Array): Float32Array {\n  if (real.length !== imag.length) {\n    throw new Error(\n        `Cannot merge real and imag arrays of different lengths. real:` +\n        `${real.length}, imag: ${imag.length}.`);\n  }\n  const result = new Float32Array(real.length * 2);\n  for (let i = 0; i < result.length; i += 2) {\n    result[i] = real[i / 2];\n    result[i + 1] = imag[i / 2];\n  }\n  return result;\n}\n\n/**\n * Splits a complex Float32Array into real and imag parts.\n *\n * The memory layout is interleaved as follows:\n * complex: [r0, i0, r1, i1, r2, i2]\n * real: [r0, r1, r2]\n * imag: [i0, i1, i2]\n *\n * This is the inverse of mergeRealAndImagArrays.\n *\n * @param complex The complex tensor values.\n * @returns An object with real and imag Float32Array components of the complex\n *     tensor.\n */\nexport function splitRealAndImagArrays(complex: Float32Array):\n    {real: Float32Array, imag: Float32Array} {\n  const real = new Float32Array(complex.length / 2);\n  const imag = new Float32Array(complex.length / 2);\n  for (let i = 0; i < complex.length; i += 2) {\n    real[i / 2] = complex[i];\n    imag[i / 2] = complex[i + 1];\n  }\n  return {real, imag};\n}\n\n/**\n * Extracts even indexed complex values in the given array.\n * @param complex The complex tensor values\n */\nexport function complexWithEvenIndex(complex: Float32Array):\n    {real: Float32Array, imag: Float32Array} {\n  const len = Math.ceil(complex.length / 4);\n  const real = new Float32Array(len);\n  const imag = new Float32Array(len);\n  for (let i = 0; i < complex.length; i += 4) {\n    real[Math.floor(i / 4)] = complex[i];\n    imag[Math.floor(i / 4)] = complex[i + 1];\n  }\n  return {real, imag};\n}\n\n/**\n * Extracts odd indexed complete values in the given array.\n * @param complex The complex tensor values\n */\nexport function complexWithOddIndex(complex: Float32Array):\n    {real: Float32Array, imag: Float32Array} {\n  const len = Math.floor(complex.length / 4);\n  const real = new Float32Array(len);\n  const imag = new Float32Array(len);\n  for (let i = 2; i < complex.length; i += 4) {\n    real[Math.floor(i / 4)] = complex[i];\n    imag[Math.floor(i / 4)] = complex[i + 1];\n  }\n  return {real, imag};\n}\n\n/**\n * Get the map representing a complex value in the given array.\n * @param complex The complex tensor values.\n * @param index An index of the target complex value.\n */\nexport function getComplexWithIndex(\n    complex: Float32Array, index: number): {real: number, imag: number} {\n  const real = complex[index * 2];\n  const imag = complex[index * 2 + 1];\n  return {real, imag};\n}\n\n/**\n * Insert a given complex value into the TypedArray.\n * @param data The array in which the complex value is inserted.\n * @param c The complex value to be inserted.\n * @param index An index of the target complex value.\n */\nexport function assignToTypedArray(\n    data: TypedArray, real: number, imag: number, index: number) {\n  data[index * 2] = real;\n  data[index * 2 + 1] = imag;\n}\n\n/**\n * Make the list of exponent terms used by FFT.\n */\nexport function exponents(\n    n: number, inverse: boolean): {real: Float32Array, imag: Float32Array} {\n  const real = new Float32Array(n / 2);\n  const imag = new Float32Array(n / 2);\n  for (let i = 0; i < Math.ceil(n / 2); i++) {\n    const x = (inverse ? 2 : -2) * Math.PI * (i / n);\n    real[i] = Math.cos(x);\n    imag[i] = Math.sin(x);\n  }\n  return {real, imag};\n}\n\n/**\n * Make the exponent term used by FFT.\n */\nexport function exponent(\n    k: number, n: number, inverse: boolean): {real: number, imag: number} {\n  const x = (inverse ? 2 : -2) * Math.PI * (k / n);\n  const real = Math.cos(x);\n  const imag = Math.sin(x);\n  return {real, imag};\n}\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/**\n * Utility functions for computing einsum (tensor contraction and summation\n * based on Einstein summation.)\n */\n\nimport {Tensor} from '../tensor';\nimport {assert} from '../util_base';\n\nconst ARROW = '->';\nconst ARROW_REGEX = /->/g;\nconst COMMA = ',';\nconst ELLIPSIS = '...';\n\n/**\n * Parse an equation for einsum.\n *\n * @param equation The einsum equation (e.g., \"ij,jk->ik\").\n * @param numTensors Number of tensors provided along with `equation`. Used to\n *   check matching number of input tensors.\n * @returns An object consisting of the following fields:\n *   - allDims: all dimension names as strings.\n *   - summedDims: a list of all dimensions being summed over, as indices to\n *     the elements of `allDims`.\n *   - idDims: indices of the dimensions in each input tensor, as indices to\n *     the elements of `allDims.\n */\nexport function decodeEinsumEquation(equation: string, numTensors: number): {\n  allDims: string[],\n  summedDims: number[],\n  idDims: number[][],\n} {\n  equation = equation.replace(/\\s/g, '');  // Remove witespace in equation.\n  const numArrows =\n      (equation.length - equation.replace(ARROW_REGEX, '').length) /\n      ARROW.length;\n  if (numArrows < 1) {\n    throw new Error('Equations without an arrow are not supported.');\n  } else if (numArrows > 1) {\n    throw new Error(`Equation must contain exactly one arrow (\"${ARROW}\").`);\n  }\n  const [inputString, outputString] = equation.split(ARROW);\n  assert(\n      inputString.indexOf(ELLIPSIS) === -1,\n      () => `The ellipsis notation (\"${ELLIPSIS}\") is not supported yet.`);\n  const inputTerms = inputString.split(COMMA);\n  const numInputs = inputTerms.length;\n  if (numTensors !== numInputs) {\n    throw new Error(\n        `Expected ${numInputs} input tensors, received ${numTensors}`);\n  }\n  if (numInputs > 2) {\n    throw new Error(\n        'Support for more than 2 input tensors is not implemented yet.');\n  }\n\n  const allDims: string[] = [];\n  for (let i = 0; i < outputString.length; ++i) {\n    const dimName = outputString[i];\n    if (!inputTerms.some(inputTerm => inputTerm.indexOf(dimName) !== -1)) {\n      throw new Error(\n          `Output subscripts contain the label ${dimName} ` +\n          `not present in the input subscripts.`);\n    }\n    if (allDims.indexOf(dimName) === -1) {\n      allDims.push(dimName);\n    }\n  }\n  for (let i = 0; i < inputString.length; ++i) {\n    const dimName = inputString[i];\n    if (allDims.indexOf(dimName) === -1 && dimName !== COMMA) {\n      allDims.push(dimName);\n    }\n  }\n\n  const idDims: number[][] = new Array<number[]>(inputTerms.length);\n  for (let i = 0; i < numInputs; ++i) {\n    if (new Set(inputTerms[i].split('')).size !== inputTerms[i].length) {\n      throw new Error(\n          `Found duplicate axes in input component ${inputTerms[i]}. ` +\n          `Support for duplicate axes in input is not implemented yet.`);\n    }\n    idDims[i] = [];\n    for (let j = 0; j < inputTerms[i].length; ++j) {\n      idDims[i].push(allDims.indexOf(inputTerms[i][j]));\n    }\n  }\n\n  const numDims = allDims.length;          // Number of unique dimensions.\n  const numOutDims = outputString.length;  // Number of output dimensions.\n  const summedDims: number[] = [];         // Dimensions being summed over.\n  for (let i = numOutDims; i < numDims; ++i) {\n    summedDims.push(i);\n  }\n  return {allDims, summedDims, idDims};\n}\n\n/**\n * Get the permutation for a given input tensor.\n *\n * @param nDims Total number of dimension of all tensors involved in the einsum\n *   operation.\n * @param idDims Dimension indices involve in the tensor in question.\n * @returns An object consisting of the following fields:\n *   - permutationIndices: Indices to permute the axes of the tensor with.\n *   - expandDims: Indices to the dimension that need to be expanded from the\n *     tensor after permutation.\n */\nexport function getEinsumPermutation(nDims: number, idDims: number[]):\n    {permutationIndices: number[], expandDims: number[]} {\n  let permutationIndices: number[] = new Array<number>(nDims);\n  permutationIndices.fill(-1);\n  for (let i = 0; i < idDims.length; ++i) {\n    permutationIndices[idDims[i]] = i;\n  }\n  const expandDims: number[] = [];\n  for (let i = 0; i < nDims; ++i) {\n    if (permutationIndices[i] === -1) {\n      expandDims.push(i);\n    }\n  }\n  permutationIndices = permutationIndices.filter(d => d !== -1);\n  return {permutationIndices, expandDims};\n}\n\n/**\n * Checks that the dimension sizes from different input tensors match the\n * equation.\n */\nexport function checkEinsumDimSizes(\n    nDims: number, idDims: number[][], tensors: Tensor[]) {\n  const dimSizes: number[] = new Array<number>(nDims);\n  for (let i = 0; i < tensors.length; ++i) {\n    const shape: number[] = tensors[i].shape;\n    for (let j = 0; j < idDims[i].length; ++j) {\n      if (dimSizes[idDims[i][j]] === undefined) {\n        dimSizes[idDims[i][j]] = shape[j];\n      } else {\n        assert(\n            dimSizes[idDims[i][j]] === shape[j],\n            () => `Expected dimension ${dimSizes[idDims[i][j]]} at axis ${j} ` +\n                `of input shaped ${JSON.stringify(shape)}, ` +\n                `but got dimension ${shape[j]}`);\n      }\n    }\n  }\n}\n\n/**\n * Gets path of computation for einsum.\n *\n * @param summedDims indices to the dimensions being summed over.\n * @param idDims A look up table for the dimensions present in each input\n *     tensor.Each constituent array contains indices for the dimensions in the\n *     corresponding input tensor.\n *\n * @return A map with two fields:\n *   - path: The path of computation, with each element indicating the dimension\n *     being summed over after the element-wise multiplication in that step.\n *   - steps: With the same length as `path`. Each element contains the indices\n *     to the input tensors being used for element-wise multiplication in the\n *     corresponding step.\n */\nexport function getEinsumComputePath(summedDims: number[], idDims: number[][]):\n    {path: number[], steps: number[][]} {\n  const path: number[] = summedDims;\n  const steps: number[][] = [];\n  let nSteps = 0;\n  if (summedDims.length === 0) {\n    // Einsum that involes no summing: e.g., transpose and outer product.\n    path.push(-1);\n  }\n  nSteps = summedDims.length + 1;\n  for (let i = 0; i < nSteps; ++i) {\n    steps.push([]);\n  }\n  const computedTermIndices: number[] = [];\n  for (let i = 0; i < path.length; ++i) {\n    const summedDim = path[i];\n    const termIndices = findTermsWithDim(idDims, summedDim);\n    for (const termIndex of termIndices) {\n      if (computedTermIndices.indexOf(termIndex) === -1) {\n        steps[i].push(termIndex);\n        computedTermIndices.push(termIndex);\n      }\n    }\n  }\n  return {path, steps};\n}\n\n/** Determines if an axes permutation is the identity permutation. */\nexport function isIdentityPermutation(perm: number[]): boolean {\n  return perm.every((dim: number, index: number) => dim === index);\n}\n\nfunction findTermsWithDim(idDims: number[][], dim: number): number[] {\n  const termIndices: number[] = [];\n  for (let i = 0; i < idDims.length; ++i) {\n    if (idDims[i].length === 0 || idDims[i].indexOf(dim) !== -1 || dim === -1) {\n      termIndices.push(i);\n    }\n  }\n  return termIndices;\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport { TensorInfo } from '../tensor_info';\nimport {Tensor} from '../tensor';\nimport {assert} from '../util';\n\n/**\n * Prepare the split size array. When the input is a number, the axis is evenly\n * divided among the split size. When the input contains the negative value, the\n * rest of the axis is allocated toward that.\n */\nexport function prepareSplitSize(\n    x: Tensor|TensorInfo, numOrSizeSplits: number[]|number,\n    axis = 0): number[] {\n  let splitSizes = [];\n  if (typeof (numOrSizeSplits) === 'number') {\n    assert(\n        x.shape[axis] % numOrSizeSplits === 0,\n        () => 'Number of splits must evenly divide the axis.');\n    splitSizes =\n        new Array(numOrSizeSplits).fill(x.shape[axis] / numOrSizeSplits);\n  } else {\n    const numOfNegs = numOrSizeSplits.reduce((count, value) => {\n      if (value === -1) {\n        count += 1;\n      }\n      return count;\n    }, 0);\n    assert(\n        numOfNegs <= 1,\n        () => 'There should be only one negative value in split array.');\n    const negIndex = numOrSizeSplits.indexOf(-1);\n    // Allow the number of split array to be -1, which indicates the rest\n    // of dimension is allocated to that split.\n    if (negIndex !== -1) {\n      const total = numOrSizeSplits.reduce((a, b) => b > 0 ? a + b : a);\n      numOrSizeSplits[negIndex] = x.shape[axis] - total;\n    }\n    assert(\n        x.shape[axis] === numOrSizeSplits.reduce((a, b) => a + b),\n        () => 'The sum of sizes must match the size of the axis dimension.');\n    splitSizes = numOrSizeSplits;\n  }\n\n  return splitSizes;\n}\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/**\n * Generates sparse fill empty rows indices, dense shape mismatch error message.\n *\n * @param indicesLength The first dimension of indices.\n */\nexport function getSparseFillEmptyRowsIndicesDenseShapeMismatch(\n    indicesLength: number) {\n  return `Received SparseTensor with denseShape[0] = 0 but\n  indices.shape[0] = ${indicesLength}`;\n}\n\n/**\n * Generates sparse fill empty rows negative index error message.\n *\n * @param index The index with a negative value.\n * @param value The negative value.\n */\nexport function getSparseFillEmptyRowsNegativeIndexErrorMessage(\n    index: number, value: number) {\n  return `indices(${index}, 0) is invalid: ${value} < 0`;\n}\n\n/**\n * Generates sparse fill empty rows out of range index error message.\n *\n * @param index The index with an out of range value.\n * @param value The out of range value.\n * @param limit The upper limit for indices.\n */\nexport function getSparseFillEmptyRowsOutOfRangeIndexErrorMessage(\n    index: number, value: number, limit: number) {\n  return `indices(${index}, 0) is invalid: ${value} >= ${limit}`;\n}\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {sizeFromShape} from '../../util';\n\n/**\n * Generates sparse reshape multiple negative 1 output dimension error message.\n *\n * @param dim1 The first dimension with a negative 1 value.\n * @param dim2 The second dimension with a negative 1 value.\n */\nexport function getSparseReshapeMultipleNegativeOneOutputDimErrorMessage(\n    dim1: number, dim2: number) {\n  return `only one output dimension may be -1, not both ${dim1} and ${dim2}`;\n}\n\n/**\n * Generates sparse reshape negative output dimension error message.\n *\n * @param dim The dimension with a negative value.\n * @param value The negative value.\n */\nexport function getSparseReshapeNegativeOutputDimErrorMessage(\n    dim: number, value: number) {\n  return `size ${dim} must be non-negative, not ${value}`;\n}\n\n/**\n * Generates sparse reshape empty tensor zero output dimension error message.\n *\n */\nexport function getSparseReshapeEmptyTensorZeroOutputDimErrorMessage() {\n  return 'reshape cannot infer the missing input size for an empty tensor ' +\n      'unless all specified input sizes are non-zero';\n}\n\n/**\n * Generates sparse reshape input output multiple mismatch error message.\n *\n * @param inputShape the input shape.\n * @param outputShape the requested output shape.\n */\nexport function getSparseReshapeInputOutputMultipleErrorMessage(\n    inputShape: number[], outputShape: number[]) {\n  const inputSize = sizeFromShape(inputShape);\n  const outputSize = sizeFromShape(outputShape);\n  return `Input to reshape is a SparseTensor with ${inputSize}\n  dense values, but the requested shape requires a multiple of ${\n      outputSize}. inputShape=${inputShape} outputShape= ${outputShape}`;\n}\n\n/**\n * Generates sparse reshape input output inequality error message.\n *\n * @param inputShape the input shape.\n * @param outputShape the requested output shape.\n */\nexport function getSparseReshapeInputOutputMismatchErrorMessage(\n    inputShape: number[], outputShape: number[]) {\n  const inputSize = sizeFromShape(inputShape);\n  const outputSize = sizeFromShape(outputShape);\n  return `Input to reshape is a tensor with ${\n      inputSize} dense values, but the requested shape has ${\n      outputSize}. inputShape=${inputShape} outputShape=${outputShape}`;\n}\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/**\n * Generates sparse segment reduction negative segment ids error message.\n *\n */\nexport function getSparseSegmentReductionNegativeSegmentIdsErrorMessage() {\n  return `segment ids must be >= 0`;\n}\n\n/**\n * Generates sparse segment reduction non increasing segment ids error message.\n *\n */\nexport function getSparseSegmentReductionNonIncreasingSegmentIdsErrorMessage() {\n  return `segment ids are not increasing`;\n}\n\n/**\n * Generates sparse segment reduction segment id out of range error message.\n *\n * @param segmentId The segment id index that is out of range.\n * @param outputRows Upper bound of valid segment id values.\n */\nexport function getSparseSegmentReductionSegmentIdOutOfRangeErrorMessage(\n    segmentId: number, outputRows: number) {\n  return `Segment id ${segmentId} out of range [0, ${\n      outputRows}), possibly because segmentIds input is not sorted.`;\n}\n\n/**\n * Generates sparse segment reduction input indice out of range error message.\n *\n * @param index The index that holds the out of range value.\n * @param indexValue The value that is out of range.\n * @param inputRows Upper bound of valid index values.\n */\nexport function getSparseSegmentReductionIndicesOutOfRangeErrorMessage(\n    index: number, indexValue: number, inputRows: number) {\n  return `Bad: indices[${index}] == ${indexValue} out of range [0, ${\n      inputRows})`;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport { TensorInfo } from '../tensor_info';\nimport {nearestDivisor} from '../util';\n\nimport {PARALLELIZE_THRESHOLD} from './reduce_util';\n\nexport interface SegOpInfo {\n  windowSize: number;\n  batchSize: number;\n  inSize: number;\n  numSegments: number;\n}\n\nexport function segOpComputeOptimalWindowSize(\n    inSize: number, numSegments: number): number {\n  let done = false;\n  let res;\n\n  if (inSize <= PARALLELIZE_THRESHOLD) {\n    res = inSize;\n    done = true;\n  } else {\n    res = nearestDivisor(inSize, Math.floor(Math.sqrt(inSize)));\n  }\n\n  while (!done) {\n    if (res > numSegments || res === inSize) {\n      done = true;\n    } else {\n      res = nearestDivisor(inSize, res + 1);\n    }\n  }\n  return res;\n}\n\nexport function computeOutShape(\n    aShape: number[], axis: number, numSegments: number): number[] {\n  const outShape = [];\n  const rank = aShape.length;\n  for (let dim = 0; dim < rank; dim++) {\n    if (dim !== axis) {\n      outShape.push(aShape[dim]);\n    } else {\n      outShape.push(numSegments);\n    }\n  }\n  return outShape;\n}\n\nexport interface GatherOpShapeInfo {\n  batchSize: number;\n  sliceSize: number;\n  outerSize: number;\n  dimSize: number;\n  outputShape: number[];\n}\n\nexport function collectGatherOpShapeInfo(\n    x: TensorInfo, indices: TensorInfo, axis: number,\n    batchDims: number): GatherOpShapeInfo {\n  const indicesRank = indices.shape.length;\n  const xRank = x.shape.length;\n\n  if (batchDims !== 0) {\n    if (batchDims < -indicesRank || batchDims > indicesRank) {\n      throw new Error(`Expect batchDims in the range of [-${indicesRank}, ${\n          indicesRank}], but got ${batchDims}`);\n    }\n  }\n\n  if (batchDims < 0) {\n    batchDims += indicesRank;\n  }\n\n  if (batchDims > xRank) {\n    throw new Error(`batchDims (${batchDims}) must be less than rank(x) (\n    ${xRank}).`);\n  }\n\n  if (axis < batchDims) {\n    throw new Error(`batchDims (${\n        batchDims}) must be less than or equal to axis (${axis}).`);\n  }\n\n  for (let i = 0; i < batchDims; ++i) {\n    if (x.shape[i] !== indices.shape[i]) {\n      throw new Error(\n          `x.shape[${i}]: ${x.shape[i]} should be equal to indices.shape[${\n              i}]: ${indices.shape[i]}.`);\n    }\n  }\n  const dimSize = x.shape[axis];\n\n  const outputShape: number[] = [];\n  let batchSize = 1;\n  let outerSize = 1;\n  let sliceSize = 1;\n\n  for (let i = 0; i < batchDims; ++i) {\n    outputShape.push(x.shape[i]);\n    batchSize *= x.shape[i];\n  }\n\n  for (let i = batchDims; i < axis; i++) {\n    outputShape.push(x.shape[i]);\n    outerSize *= x.shape[i];\n  }\n\n  for (let i = batchDims; i < indicesRank; i++) {\n    outputShape.push(indices.shape[i]);\n  }\n\n  for (let i = axis + 1; i < xRank; i++) {\n    outputShape.push(x.shape[i]);\n    sliceSize *= x.shape[i];\n  }\n\n  return {batchSize, sliceSize, outerSize, dimSize, outputShape};\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {decodeString, encodeString} from '../util';\n\n// Utilities needed by backend consumers of tf-core.\nexport * from '../ops/axis_util';\nexport * from '../ops/broadcast_util';\nexport * from '../ops/concat_util';\nexport * from '../ops/conv_util';\nexport * from '../ops/fused_util';\nexport * from '../ops/fused_types';\nexport * from '../ops/ragged_to_dense_util';\nexport * from '../ops/reduce_util';\n\nimport * as slice_util from '../ops/slice_util';\nexport {slice_util};\n\nexport {BackendValues, TypedArray, upcastType, PixelData} from '../types';\nexport {MemoryInfo, TimingInfo} from '../engine';\nexport * from '../ops/rotate_util';\nexport * from '../ops/array_ops_util';\nexport * from '../ops/gather_nd_util';\nexport * from '../ops/scatter_nd_util';\nexport * from '../ops/selu_util';\nexport * from '../ops/fused_util';\nexport * from '../ops/erf_util';\nexport * from '../log';\nexport * from '../backends/complex_util';\nexport * from '../backends/einsum_util';\nexport * from '../ops/split_util';\nexport * from '../ops/sparse/sparse_fill_empty_rows_util';\nexport * from '../ops/sparse/sparse_reshape_util';\nexport * from '../ops/sparse/sparse_segment_reduction_util';\n\nimport * as segment_util from '../ops/segment_util';\nexport {segment_util};\n\nexport function fromUint8ToStringArray(vals: Uint8Array[]) {\n  try {\n    // Decode the bytes into string.\n    return vals.map(val => decodeString(val));\n  } catch (err) {\n    throw new Error(\n        `Failed to decode encoded string bytes into utf-8, error: ${err}`);\n  }\n}\n\nexport function fromStringArrayToUint8(strings: string[]) {\n  return strings.map(s => encodeString(s));\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nexport {nonMaxSuppressionV3Impl, nonMaxSuppressionV4Impl, nonMaxSuppressionV5Impl} from './non_max_suppression_impl';\nexport {whereImpl} from './where_impl';\n", "/**\n * @license\n * Copyright 2017 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n// Required side effectful code.\nimport './base_side_effects';\n\n// TODO(mattSoulanille): Move this to base_side_effects.ts\n// It is here for now because custom bundles need to avoid calling it, and they\n// only replace the index.js file, not the base_side_effects file.\nimport {registerOptimizers} from './optimizers/register_optimizers';\nregisterOptimizers();\n\n// All exports from this package should be in base.\nexport * from './base';\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {env} from '@tensorflow/tfjs-core';\n\nconst ENV = env();\n\n/** Whether to keep intermediate tensors. */\nENV.registerFlag('KEEP_INTERMEDIATE_TENSORS', () => false, debugValue => {\n  if (debugValue) {\n    console.warn(\n        'Keep intermediate tensors is ON. This will print the values of all ' +\n        'intermediate tensors during model inference. Not all models ' +\n        'support this mode. For details, check e2e/benchmarks/ ' +\n        'model_config.js. This significantly impacts performance.');\n  }\n});\n", "/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n/* global Reflect, Promise */\r\n\r\nvar extendStatics = function(d, b) {\r\n    extendStatics = Object.setPrototypeOf ||\r\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n        function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\r\n    return extendStatics(d, b);\r\n};\r\n\r\nexport function __extends(d, b) {\r\n    if (typeof b !== \"function\" && b !== null)\r\n        throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\r\n    extendStatics(d, b);\r\n    function __() { this.constructor = d; }\r\n    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n}\r\n\r\nexport var __assign = function() {\r\n    __assign = Object.assign || function __assign(t) {\r\n        for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n            s = arguments[i];\r\n            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n        }\r\n        return t;\r\n    }\r\n    return __assign.apply(this, arguments);\r\n}\r\n\r\nexport function __rest(s, e) {\r\n    var t = {};\r\n    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n        t[p] = s[p];\r\n    if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n            if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n                t[p[i]] = s[p[i]];\r\n        }\r\n    return t;\r\n}\r\n\r\nexport function __decorate(decorators, target, key, desc) {\r\n    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n    if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n    return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n}\r\n\r\nexport function __param(paramIndex, decorator) {\r\n    return function (target, key) { decorator(target, key, paramIndex); }\r\n}\r\n\r\nexport function __metadata(metadataKey, metadataValue) {\r\n    if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n}\r\n\r\nexport function __awaiter(thisArg, _arguments, P, generator) {\r\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n    return new (P || (P = Promise))(function (resolve, reject) {\r\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n    });\r\n}\r\n\r\nexport function __generator(thisArg, body) {\r\n    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n    return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n    function verb(n) { return function (v) { return step([n, v]); }; }\r\n    function step(op) {\r\n        if (f) throw new TypeError(\"Generator is already executing.\");\r\n        while (_) try {\r\n            if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n            if (y = 0, t) op = [op[0] & 2, t.value];\r\n            switch (op[0]) {\r\n                case 0: case 1: t = op; break;\r\n                case 4: _.label++; return { value: op[1], done: false };\r\n                case 5: _.label++; y = op[1]; op = [0]; continue;\r\n                case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n                default:\r\n                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n                    if (t[2]) _.ops.pop();\r\n                    _.trys.pop(); continue;\r\n            }\r\n            op = body.call(thisArg, _);\r\n        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n    }\r\n}\r\n\r\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    var desc = Object.getOwnPropertyDescriptor(m, k);\r\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\r\n        desc = { enumerable: true, get: function() { return m[k]; } };\r\n    }\r\n    Object.defineProperty(o, k2, desc);\r\n}) : (function(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    o[k2] = m[k];\r\n});\r\n\r\nexport function __exportStar(m, o) {\r\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\r\n}\r\n\r\nexport function __values(o) {\r\n    var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\r\n    if (m) return m.call(o);\r\n    if (o && typeof o.length === \"number\") return {\r\n        next: function () {\r\n            if (o && i >= o.length) o = void 0;\r\n            return { value: o && o[i++], done: !o };\r\n        }\r\n    };\r\n    throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\r\n}\r\n\r\nexport function __read(o, n) {\r\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n    if (!m) return o;\r\n    var i = m.call(o), r, ar = [], e;\r\n    try {\r\n        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n    }\r\n    catch (error) { e = { error: error }; }\r\n    finally {\r\n        try {\r\n            if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n        }\r\n        finally { if (e) throw e.error; }\r\n    }\r\n    return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spread() {\r\n    for (var ar = [], i = 0; i < arguments.length; i++)\r\n        ar = ar.concat(__read(arguments[i]));\r\n    return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spreadArrays() {\r\n    for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n    for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n        for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n            r[k] = a[j];\r\n    return r;\r\n}\r\n\r\nexport function __spreadArray(to, from, pack) {\r\n    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\r\n        if (ar || !(i in from)) {\r\n            if (!ar) ar = Array.prototype.slice.call(from, 0, i);\r\n            ar[i] = from[i];\r\n        }\r\n    }\r\n    return to.concat(ar || Array.prototype.slice.call(from));\r\n}\r\n\r\nexport function __await(v) {\r\n    return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n}\r\n\r\nexport function __asyncGenerator(thisArg, _arguments, generator) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n    return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n    function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n    function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n    function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n    function fulfill(value) { resume(\"next\", value); }\r\n    function reject(value) { resume(\"throw\", value); }\r\n    function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n}\r\n\r\nexport function __asyncDelegator(o) {\r\n    var i, p;\r\n    return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n    function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n}\r\n\r\nexport function __asyncValues(o) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var m = o[Symbol.asyncIterator], i;\r\n    return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n    function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n    function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n}\r\n\r\nexport function __makeTemplateObject(cooked, raw) {\r\n    if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n    return cooked;\r\n};\r\n\r\nvar __setModuleDefault = Object.create ? (function(o, v) {\r\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\r\n}) : function(o, v) {\r\n    o[\"default\"] = v;\r\n};\r\n\r\nexport function __importStar(mod) {\r\n    if (mod && mod.__esModule) return mod;\r\n    var result = {};\r\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\r\n    __setModuleDefault(result, mod);\r\n    return result;\r\n}\r\n\r\nexport function __importDefault(mod) {\r\n    return (mod && mod.__esModule) ? mod : { default: mod };\r\n}\r\n\r\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\r\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\r\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\r\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\r\n}\r\n\r\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\r\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\r\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\r\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\r\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\r\n}\r\n\r\nexport function __classPrivateFieldIn(state, receiver) {\r\n    if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\r\n    return typeof state === \"function\" ? receiver === state : state.has(receiver);\r\n}\r\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n * =============================================================================\n */\n\n/* tslint:disable */\n\n/** Properties of an Any. */\nexport declare interface IAny {\n  /** Any typeUrl */\n  typeUrl?: (string|null);\n\n  /** Any value */\n  value?: (Uint8Array|null);\n}\n\n/** DataType enum. */\nexport enum DataType {\n  // These properties must be quoted since they are used by parseDtypeParam\n  // in tfjs-converter/src/operations/operation_mapper.ts to look up dtypes\n  // by string name. If they are not quoted, Closure will mangle their names.\n\n  // Not a legal value for DataType.  Used to indicate a DataType field\n  // has not been set.\n  'DT_INVALID' = 0,\n\n  // Data types that all computation devices are expected to be\n  // capable to support.\n  'DT_FLOAT' = 1,\n  'DT_DOUBLE' = 2,\n  'DT_INT32' = 3,\n  'DT_UINT8' = 4,\n  'DT_INT16' = 5,\n  'DT_INT8' = 6,\n  'DT_STRING' = 7,\n  'DT_COMPLEX64' = 8,  // Single-precision complex\n  'DT_INT64' = 9,\n  'DT_BOOL' = 10,\n  'DT_QINT8' = 11,     // Quantized int8\n  'DT_QUINT8' = 12,    // Quantized uint8\n  'DT_QINT32' = 13,    // Quantized int32\n  'DT_BFLOAT16' = 14,  // Float32 truncated to 16 bits.  Only for cast ops.\n  'DT_QINT16' = 15,    // Quantized int16\n  'DT_QUINT16' = 16,   // Quantized uint16\n  'DT_UINT16' = 17,\n  'DT_COMPLEX128' = 18,  // Double-precision complex\n  'DT_HALF' = 19,\n  'DT_RESOURCE' = 20,\n  'DT_VARIANT' = 21,  // Arbitrary C++ data types\n  'DT_UINT32' = 22,\n  'DT_UINT64' = 23,\n\n  // Do not use!  These are only for parameters.  Every enum above\n  // should have a corresponding value below (verified by types_test).\n  'DT_FLOAT_REF' = 101,\n  'DT_DOUBLE_REF' = 102,\n  'DT_INT32_REF' = 103,\n  'DT_UINT8_REF' = 104,\n  'DT_INT16_REF' = 105,\n  'DT_INT8_REF' = 106,\n  'DT_STRING_REF' = 107,\n  'DT_COMPLEX64_REF' = 108,\n  'DT_INT64_REF' = 109,\n  'DT_BOOL_REF' = 110,\n  'DT_QINT8_REF' = 111,\n  'DT_QUINT8_REF' = 112,\n  'DT_QINT32_REF' = 113,\n  'DT_BFLOAT16_REF' = 114,\n  'DT_QINT16_REF' = 115,\n  'DT_QUINT16_REF' = 116,\n  'DT_UINT16_REF' = 117,\n  'DT_COMPLEX128_REF' = 118,\n  'DT_HALF_REF' = 119,\n  'DT_RESOURCE_REF' = 120,\n  'DT_VARIANT_REF' = 121,\n  'DT_UINT32_REF' = 122,\n  'DT_UINT64_REF' = 123,\n}\n\n/** Properties of a TensorShape. */\nexport declare interface ITensorShape {\n  /** TensorShape dim */\n  dim?: (TensorShape.IDim[]|null);\n\n  /** TensorShape unknownRank */\n  unknownRank?: (boolean|null);\n}\n\nexport namespace TensorShape {\n  /** Properties of a Dim. */\n  export declare interface IDim {\n    /** Dim size */\n    size?: (number|string|null);\n\n    /** Dim name */\n    name?: (string|null);\n  }\n}\n\n/** Properties of a Tensor. */\nexport declare interface ITensor {\n  /** Tensor dtype */\n  dtype?: (DataType|null);\n\n  /** Tensor tensorShape */\n  tensorShape?: (ITensorShape|null);\n\n  /** Tensor versionNumber */\n  versionNumber?: (number|null);\n\n  /** Tensor tensorContent */\n  tensorContent?: (Uint8Array|null);\n\n  /** Tensor floatVal */\n  floatVal?: (number[]|null);\n\n  /** Tensor doubleVal */\n  doubleVal?: (number[]|null);\n\n  /** Tensor intVal */\n  intVal?: (number[]|null);\n\n  /** Tensor stringVal */\n  stringVal?: (Uint8Array[]|null);\n\n  /** Tensor scomplexVal */\n  scomplexVal?: (number[]|null);\n\n  /** Tensor int64Val */\n  int64Val?: ((number | string)[]|null);\n\n  /** Tensor boolVal */\n  boolVal?: (boolean[]|null);\n\n  /** Tensor uint32Val */\n  uint32Val?: (number[]|null);\n\n  /** Tensor uint64Val */\n  uint64Val?: ((number | string)[]|null);\n}\n\n/** Properties of an AttrValue. */\nexport declare interface IAttrValue {\n  /** AttrValue list */\n  list?: (AttrValue.IListValue|null);\n\n  /** AttrValue s */\n  s?: (string|null);\n\n  /** AttrValue i */\n  i?: (number|string|null);\n\n  /** AttrValue f */\n  f?: (number|null);\n\n  /** AttrValue b */\n  b?: (boolean|null);\n\n  /** AttrValue type */\n  type?: (DataType|null);\n\n  /** AttrValue shape */\n  shape?: (ITensorShape|null);\n\n  /** AttrValue tensor */\n  tensor?: (ITensor|null);\n\n  /** AttrValue placeholder */\n  placeholder?: (string|null);\n\n  /** AttrValue func */\n  func?: (INameAttrList|null);\n}\n\nexport namespace AttrValue {\n  /** Properties of a ListValue. */\n  export declare interface IListValue {\n    /** ListValue s */\n    s?: (string[]|null);\n\n    /** ListValue i */\n    i?: ((number | string)[]|null);\n\n    /** ListValue f */\n    f?: (number[]|null);\n\n    /** ListValue b */\n    b?: (boolean[]|null);\n\n    /** ListValue type */\n    type?: (DataType[]|null);\n\n    /** ListValue shape */\n    shape?: (ITensorShape[]|null);\n\n    /** ListValue tensor */\n    tensor?: (ITensor[]|null);\n\n    /** ListValue func */\n    func?: (INameAttrList[]|null);\n  }\n}\n\n/** Properties of a NameAttrList. */\nexport declare interface INameAttrList {\n  /** NameAttrList name */\n  name?: (string|null);\n\n  /** NameAttrList attr */\n  attr?: ({[k: string]: IAttrValue}|null);\n}\n\n/** Properties of a NodeDef. */\nexport declare interface INodeDef {\n  /** NodeDef name */\n  name?: (string|null);\n\n  /** NodeDef op */\n  op?: (string|null);\n\n  /** NodeDef input */\n  input?: (string[]|null);\n\n  /** NodeDef device */\n  device?: (string|null);\n\n  /** NodeDef attr */\n  attr?: ({[k: string]: IAttrValue}|null);\n}\n\n/** Properties of a VersionDef. */\nexport declare interface IVersionDef {\n  /** VersionDef producer */\n  producer?: (number|null);\n\n  /** VersionDef minConsumer */\n  minConsumer?: (number|null);\n\n  /** VersionDef badConsumers */\n  badConsumers?: (number[]|null);\n}\n\n/** Properties of a GraphDef. */\nexport declare interface IGraphDef {\n  /** GraphDef node */\n  node?: (INodeDef[]|null);\n\n  /** GraphDef versions */\n  versions?: (IVersionDef|null);\n\n  /** GraphDef library */\n  library?: (IFunctionDefLibrary|null);\n}\n\n/** Properties of a CollectionDef. */\nexport declare interface ICollectionDef {\n  /** CollectionDef nodeList */\n  nodeList?: (CollectionDef.INodeList|null);\n\n  /** CollectionDef bytesList */\n  bytesList?: (CollectionDef.IBytesList|null);\n\n  /** CollectionDef int64List */\n  int64List?: (CollectionDef.IInt64List|null);\n\n  /** CollectionDef floatList */\n  floatList?: (CollectionDef.IFloatList|null);\n\n  /** CollectionDef anyList */\n  anyList?: (CollectionDef.IAnyList|null);\n}\n\nexport namespace CollectionDef {\n  /** Properties of a NodeList. */\n  export declare interface INodeList {\n    /** NodeList value */\n    value?: (string[]|null);\n  }\n\n  /** Properties of a BytesList. */\n  export declare interface IBytesList {\n    /** BytesList value */\n    value?: (Uint8Array[]|null);\n  }\n\n  /** Properties of an Int64List. */\n  export declare interface IInt64List {\n    /** Int64List value */\n    value?: ((number | string)[]|null);\n  }\n\n  /** Properties of a FloatList. */\n  export declare interface IFloatList {\n    /** FloatList value */\n    value?: (number[]|null);\n  }\n\n  /** Properties of an AnyList. */\n  export declare interface IAnyList {\n    /** AnyList value */\n    value?: (IAny[]|null);\n  }\n}\n\n/** Properties of a SaverDef. */\nexport declare interface ISaverDef {\n  /** SaverDef filenameTensorName */\n  filenameTensorName?: (string|null);\n\n  /** SaverDef saveTensorName */\n  saveTensorName?: (string|null);\n\n  /** SaverDef restoreOpName */\n  restoreOpName?: (string|null);\n\n  /** SaverDef maxToKeep */\n  maxToKeep?: (number|null);\n\n  /** SaverDef sharded */\n  sharded?: (boolean|null);\n\n  /** SaverDef keepCheckpointEveryNHours */\n  keepCheckpointEveryNHours?: (number|null);\n\n  /** SaverDef version */\n  version?: (SaverDef.CheckpointFormatVersion|null);\n}\n\nexport namespace SaverDef {\n  /** CheckpointFormatVersion enum. */\n  export enum CheckpointFormatVersion {'LEGACY' = 0, 'V1' = 1, 'V2' = 2}\n}\n\n/** Properties of a TensorInfo. */\nexport declare interface ITensorInfo {\n  /** TensorInfo name */\n  name?: (string|null);\n\n  /** TensorInfo cooSparse */\n  cooSparse?: (TensorInfo.ICooSparse|null);\n\n  /** TensorInfo dtype */\n  dtype?: (DataType|string|null);\n\n  /** TensorInfo tensorShape */\n  tensorShape?: (ITensorShape|null);\n\n  /** Resource id tensor was originally assigned to.  */\n  resourceId?: (number|null);\n}\n\nexport namespace TensorInfo {\n  /** Properties of a CooSparse. */\n  export declare interface ICooSparse {\n    /** CooSparse valuesTensorName */\n    valuesTensorName?: (string|null);\n\n    /** CooSparse indicesTensorName */\n    indicesTensorName?: (string|null);\n\n    /** CooSparse denseShapeTensorName */\n    denseShapeTensorName?: (string|null);\n  }\n}\n\n/** Properties of a SignatureDef. */\nexport declare interface ISignatureDef {\n  /** SignatureDef inputs */\n  inputs?: ({[k: string]: ITensorInfo}|null);\n\n  /** SignatureDef outputs */\n  outputs?: ({[k: string]: ITensorInfo}|null);\n\n  /** SignatureDef methodName */\n  methodName?: (string|null);\n}\n\n/** Properties of an AssetFileDef. */\nexport declare interface IAssetFileDef {\n  /** AssetFileDef tensorInfo */\n  tensorInfo?: (ITensorInfo|null);\n\n  /** AssetFileDef filename */\n  filename?: (string|null);\n}\n\n/** Properties of an OpDef. */\nexport declare interface IOpDef {\n  /** OpDef name */\n  name?: (string|null);\n\n  /** OpDef inputArg */\n  inputArg?: (OpDef.IArgDef[]|null);\n\n  /** OpDef outputArg */\n  outputArg?: (OpDef.IArgDef[]|null);\n\n  /** OpDef attr */\n  attr?: (OpDef.IAttrDef[]|null);\n\n  /** OpDef deprecation */\n  deprecation?: (OpDef.IOpDeprecation|null);\n\n  /** OpDef summary */\n  summary?: (string|null);\n\n  /** OpDef description */\n  description?: (string|null);\n\n  /** OpDef isCommutative */\n  isCommutative?: (boolean|null);\n\n  /** OpDef isAggregate */\n  isAggregate?: (boolean|null);\n\n  /** OpDef isStateful */\n  isStateful?: (boolean|null);\n\n  /** OpDef allowsUninitializedInput */\n  allowsUninitializedInput?: (boolean|null);\n}\n\nexport namespace OpDef {\n  /** Properties of an ArgDef. */\n  export declare interface IArgDef {\n    /** ArgDef name */\n    name?: (string|null);\n\n    /** ArgDef description */\n    description?: (string|null);\n\n    /** ArgDef type */\n    type?: (DataType|null);\n\n    /** ArgDef typeAttr */\n    typeAttr?: (string|null);\n\n    /** ArgDef numberAttr */\n    numberAttr?: (string|null);\n\n    /** ArgDef typeListAttr */\n    typeListAttr?: (string|null);\n\n    /** ArgDef isRef */\n    isRef?: (boolean|null);\n  }\n\n  /** Properties of an AttrDef. */\n  export declare interface IAttrDef {\n    /** AttrDef name */\n    name?: (string|null);\n\n    /** AttrDef type */\n    type?: (string|null);\n\n    /** AttrDef defaultValue */\n    defaultValue?: (IAttrValue|null);\n\n    /** AttrDef description */\n    description?: (string|null);\n\n    /** AttrDef hasMinimum */\n    hasMinimum?: (boolean|null);\n\n    /** AttrDef minimum */\n    minimum?: (number|string|null);\n\n    /** AttrDef allowedValues */\n    allowedValues?: (IAttrValue|null);\n  }\n\n  /** Properties of an OpDeprecation. */\n  export declare interface IOpDeprecation {\n    /** OpDeprecation version */\n    version?: (number|null);\n\n    /** OpDeprecation explanation */\n    explanation?: (string|null);\n  }\n}\n\n/** Properties of an OpList. */\nexport declare interface IOpList {\n  /** OpList op */\n  op?: (IOpDef[]|null);\n}\n\n/** Properties of a MetaGraphDef. */\nexport declare interface IMetaGraphDef {\n  /** MetaGraphDef metaInfoDef */\n  metaInfoDef?: (MetaGraphDef.IMetaInfoDef|null);\n\n  /** MetaGraphDef graphDef */\n  graphDef?: (IGraphDef|null);\n\n  /** MetaGraphDef saverDef */\n  saverDef?: (ISaverDef|null);\n\n  /** MetaGraphDef collectionDef */\n  collectionDef?: ({[k: string]: ICollectionDef}|null);\n\n  /** MetaGraphDef signatureDef */\n  signatureDef?: ({[k: string]: ISignatureDef}|null);\n\n  /** MetaGraphDef assetFileDef */\n  assetFileDef?: (IAssetFileDef[]|null);\n}\n\nexport namespace MetaGraphDef {\n  /** Properties of a MetaInfoDef. */\n  export declare interface IMetaInfoDef {\n    /** MetaInfoDef metaGraphVersion */\n    metaGraphVersion?: (string|null);\n\n    /** MetaInfoDef strippedOpList */\n    strippedOpList?: (IOpList|null);\n\n    /** MetaInfoDef anyInfo */\n    anyInfo?: (IAny|null);\n\n    /** MetaInfoDef tags */\n    tags?: (string[]|null);\n\n    /** MetaInfoDef tensorflowVersion */\n    tensorflowVersion?: (string|null);\n\n    /** MetaInfoDef tensorflowGitVersion */\n    tensorflowGitVersion?: (string|null);\n  }\n}\n\n/** Properties of a SavedModel. */\nexport declare interface ISavedModel {\n  /** SavedModel savedModelSchemaVersion */\n  savedModelSchemaVersion?: (number|string|null);\n\n  /** SavedModel metaGraphs */\n  metaGraphs?: (IMetaGraphDef[]|null);\n}\n\n/** Properties of a FunctionDefLibrary. */\nexport declare interface IFunctionDefLibrary {\n  /** FunctionDefLibrary function */\n  'function'?: (IFunctionDef[]|null);\n\n  /** FunctionDefLibrary gradient */\n  gradient?: (IGradientDef[]|null);\n}\n\n/** Properties of a FunctionDef. */\nexport declare interface IFunctionDef {\n  /** FunctionDef signature */\n  signature?: (IOpDef|null);\n\n  /** FunctionDef attr */\n  attr?: ({[k: string]: IAttrValue}|null);\n\n  /** FunctionDef nodeDef */\n  nodeDef?: (INodeDef[]|null);\n\n  /** FunctionDef ret */\n  ret?: ({[k: string]: string}|null);\n}\n\n/** Properties of a GradientDef. */\nexport declare interface IGradientDef {\n  /** GradientDef functionName */\n  functionName?: (string|null);\n\n  /** GradientDef gradientFunc */\n  gradientFunc?: (string|null);\n}\n", "\n/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {OpExecutor, OpMapper} from '../types';\n\nconst CUSTOM_OPS: {[key: string]: OpMapper} = {};\n\n/**\n * Register an Op for graph model executor. This allows you to register\n * TensorFlow custom op or override existing op.\n *\n * Here is an example of registering a new MatMul Op.\n * ```js\n * const customMatmul = (node) =>\n *    tf.matMul(\n *        node.inputs[0], node.inputs[1],\n *        node.attrs['transpose_a'], node.attrs['transpose_b']);\n *\n * tf.registerOp('MatMul', customMatmul);\n * ```\n * The inputs and attrs of the node object are based on the TensorFlow op\n * registry.\n *\n * @param name The Tensorflow Op name.\n * @param opFunc An op function which is called with the current graph node\n * during execution and needs to return a tensor or a list of tensors. The node\n * has the following attributes:\n *    - attr: A map from attribute name to its value\n *    - inputs: A list of input tensors\n *\n * @doc {heading: 'Models', subheading: 'Op Registry'}\n */\nexport function registerOp(name: string, opFunc: OpExecutor) {\n  const opMapper: OpMapper = {\n    tfOpName: name,\n    category: 'custom',\n    inputs: [],\n    attrs: [],\n    customExecutor: opFunc\n  };\n\n  CUSTOM_OPS[name] = opMapper;\n}\n\n/**\n * Retrieve the OpMapper object for the registered op.\n *\n * @param name The Tensorflow Op name.\n *\n * @doc {heading: 'Models', subheading: 'Op Registry'}\n */\nexport function getRegisteredOp(name: string): OpMapper {\n  return CUSTOM_OPS[name];\n}\n\n/**\n * Deregister the Op for graph model executor.\n *\n * @param name The Tensorflow Op name.\n *\n * @doc {heading: 'Models', subheading: 'Op Registry'}\n */\nexport function deregisterOp(name: string) {\n  delete CUSTOM_OPS[name];\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {clone, Tensor, util} from '@tensorflow/tfjs-core';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport {ResourceManager} from '../../executor/resource_manager';\nimport {Node, ValueType} from '../types';\n\nexport function getParamValue(\n    paramName: string, node: Node, tensorMap: NamedTensorsMap,\n    context: ExecutionContext, resourceManager?: ResourceManager): ValueType {\n  const inputParam = node.inputParams[paramName];\n  if (inputParam && inputParam.inputIndexStart !== undefined) {\n    const start = inputParam.inputIndexStart;\n    const end = inputParam.inputIndexEnd === 0 ?\n        undefined :\n        (inputParam.inputIndexEnd === undefined ? start + 1 :\n                                                  inputParam.inputIndexEnd);\n    const shiftedStart = start < 0 ? node.inputNames.length + start : start;\n    if (inputParam.type === 'tensor') {\n      return getTensor(\n          node.inputNames[shiftedStart], tensorMap, context, resourceManager);\n    }\n    if (inputParam.type === 'tensors') {\n      // TODO(mattSoulanille): This filters out NoOp nodes during execution, but\n      // these should really never be in the execution graph in the first place.\n      // They're necessary for ordering the graph, but should not be visible\n      // during execution. Perhaps have different sets of children, one for\n      // control dependencies and another for real dependencies.\n      const inputs = node.inputs.slice(start, end);\n      const inputNames = node.inputNames.slice(start, end)\n        .filter((_name, index) => inputs[index]?.op !== 'NoOp');\n\n      return inputNames.map(\n          name => getTensor(name, tensorMap, context, resourceManager));\n    }\n    const tensor = getTensor(\n        node.inputNames[shiftedStart], tensorMap, context, resourceManager);\n    const data = tensor.dataSync();\n    return inputParam.type === 'number' ?\n        data[0] :\n        util.toNestedArray(tensor.shape, data);\n  }\n  const attrParam = node.attrParams[paramName];\n  return attrParam && attrParam.value;\n}\n\n/**\n * Retrieve the tensor from tensorsMap based on input name.\n * @param name Node input name\n * @param tensorsMap Tensors map keyed by the node\n * @param context contains tensors and information for running the current node.\n * @param resourceManager Optional. Contains global resources of the model.\n */\nexport function getTensor(\n    name: string, tensorsMap: NamedTensorsMap, context: ExecutionContext,\n    resourceManager?: ResourceManager): Tensor {\n  const [nodeName, index] = parseNodeName(name, context);\n\n  if (resourceManager != null) {\n    const tensor = resourceManager.getHashTableHandleByName(nodeName);\n    if (tensor != null) {\n      return tensor;\n    }\n  }\n\n  const contextId = context.currentContextIds.find(contextId => {\n    return !!tensorsMap[getNodeNameWithContextId(nodeName, contextId)];\n  });\n\n  return contextId !== undefined ?\n      tensorsMap[getNodeNameWithContextId(nodeName, contextId)][index] :\n      undefined;\n}\n\n/**\n * Retrieve the tensors based on input name for current context.\n * @param name Node input name\n * @param tensorsMap Tensors map keyed by the node\n */\nexport function getTensorsForCurrentContext(\n    name: string, tensorsMap: NamedTensorsMap,\n    context: ExecutionContext): Tensor[] {\n  return tensorsMap[getNodeNameWithContextId(name, context.currentContextId)];\n}\n\n/**\n * Returns the node name, outputName and index from the Node input name.\n * @param inputName The input name of the node, in format of\n * node_name:output_index, i.e. MatMul:0, if the output_index is not set, it is\n * default to 0.\n * If the input name contains output name i.e. StringSplit:indices:0, it will\n * return ['StringSplit', 0, 'indices'].\n */\nexport function getNodeNameAndIndex(\n    inputName: string, context?: ExecutionContext): [string, number, string] {\n  const [nodeName, index, outputName] = parseNodeName(inputName, context);\n\n  return [\n    getNodeNameWithContextId(nodeName, context && context.currentContextId),\n    index, outputName\n  ];\n}\n\nfunction getNodeNameWithContextId(name: string, contextId?: string): string {\n  return !!contextId ? `${name}-${contextId}` : name;\n}\n\nexport function parseNodeName(\n    name: string, context?: ExecutionContext): [string, number, string?] {\n  if (name === '') {\n    return ['', 0, undefined];\n  }\n\n  const isCacheEnabled = context != null && context.parseNodeNameCache != null;\n  if (isCacheEnabled) {\n    const cachedResult = context.parseNodeNameCache.get(name);\n    if (cachedResult != null) {\n      return cachedResult;\n    }\n  }\n  const parts = name.split(':');\n  let result: [string, number, string?];\n  if (parts.length === 1) {\n    result = [name, 0, undefined];\n  } else {\n    const nodeName = parts[0];\n    const outputName = parts.length === 3 ? parts[1] : undefined;\n    const index = Number(parts[parts.length - 1]);\n    result = [nodeName, index, outputName];\n  }\n  if (isCacheEnabled) {\n    context.parseNodeNameCache.set(name, result);\n  }\n  return result;\n}\n\nexport function split(arr: number[], size: number) {\n  const res = [];\n  for (let i = 0; i < arr.length; i += size) {\n    res.push(arr.slice(i, i + size));\n  }\n  return res;\n}\nexport function getPadding(\n    node: Node, tensorMap: NamedTensorsMap,\n    context: ExecutionContext): ValueType {\n  let pad = getParamValue('pad', node, tensorMap, context);\n  if (pad === 'explicit') {\n    // This is 1d array, we need to convert it to 2d array\n    pad = getParamValue('explicitPaddings', node, tensorMap, context);\n    const explicitPadding: [\n      [number, number], [number, number], [number, number], [number, number]\n    ] = [[0, 0], [0, 0], [0, 0], [0, 0]];\n    for (let i = 0; i < 4; i++) {\n      explicitPadding[i][0] = (pad as number[])[i * 2];\n      explicitPadding[i][1] = (pad as number[])[i * 2 + 1];\n    }\n    return explicitPadding;\n  }\n  return pad;\n}\n\n/**\n *  Reuse the tensor if it is marked as keep, otherwise clone the tensor to\n *  avoid disposal. This is important for TensorArray and TensorList ops, since\n *  internally they use a tensor as the id for TensorArray and TensorList, and\n * to simplify lookup, they also use Tensor.id as the key to the internal map.\n * These id tensors have been marked as kept in the backend, we need avoid clone\n * them in order to create new Tensor.id.\n * @param tensor\n */\nexport function cloneTensor(tensor: Tensor): Tensor {\n  return tensor.kept ? tensor : clone(tensor);\n}\n", "\n/**\n * @license\n * Copyright 2023 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {OpMapper} from '../types';\n\nexport const json: OpMapper[] = [\n  {\n    'tfOpName': 'Add',\n    'category': 'arithmetic',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'AddV2',\n    'category': 'arithmetic',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'AddN',\n    'category': 'arithmetic',\n    'inputs': [\n      {\n        'start': 0,\n        'end': 0,\n        'name': 'tensors',\n        'type': 'tensors'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'BiasAdd',\n    'category': 'arithmetic',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      },\n      {\n        'tfName': 'data_format',\n        'name': 'dataFormat',\n        'type': 'string',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Sub',\n    'category': 'arithmetic',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'RealDiv',\n    'category': 'arithmetic',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Div',\n    'category': 'arithmetic',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'DivNoNan',\n    'category': 'arithmetic',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'FloorDiv',\n    'category': 'arithmetic',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Mul',\n    'category': 'arithmetic',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Maximum',\n    'category': 'arithmetic',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Minimum',\n    'category': 'arithmetic',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Pow',\n    'category': 'arithmetic',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'SquaredDifference',\n    'category': 'arithmetic',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Mod',\n    'category': 'arithmetic',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'FloorMod',\n    'category': 'arithmetic',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  }\n];\n", "\n/**\n * @license\n * Copyright 2023 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {OpMapper} from '../types';\n\nexport const json: OpMapper[] = [\n  {\n    'tfOpName': 'Abs',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Acos',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Asin',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Atan',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Atan2',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'y',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Ceil',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'ClipByValue',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'clipValueMin',\n        'type': 'number'\n      },\n      {\n        'start': 2,\n        'name': 'clipValueMax',\n        'type': 'number'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Complex',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'real',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'imag',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'ComplexAbs',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Cos',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Cosh',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Elu',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Exp',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Floor',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Log',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Imag',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      },\n      {\n        'tfName': 'Tout',\n        'name': 'outputType',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Neg',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Real',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      },\n      {\n        'tfName': 'Tout',\n        'name': 'outputType',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Prelu',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'alpha',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Relu',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Relu6',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Selu',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Sigmoid',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Sin',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Sinh',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Sqrt',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Rsqrt',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Square',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Tan',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Tanh',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Sign',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Round',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Expm1',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Log1p',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Reciprocal',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Softplus',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Asinh',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Acosh',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Atanh',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Erf',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'LeakyRelu',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'alpha',\n        'name': 'alpha',\n        'type': 'number',\n        'defaultValue': 0.2\n      },\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'IsNan',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'IsFinite',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'IsInf',\n    'category': 'basic_math',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  }\n]\n;\n", "\n/**\n * @license\n * Copyright 2023 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {OpMapper} from '../types';\n\nexport const json: OpMapper[] = [\n  {\n    'tfOpName': 'EmptyTensorList',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'elementShape',\n        'type': 'shape'\n      },\n      {\n        'start': 1,\n        'name': 'maxNumElements',\n        'type': 'number'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'element_dtype',\n        'name': 'elementDType',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'LoopCond',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'pred',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Switch',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'data',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'pred',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Merge',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'end': 0,\n        'name': 'tensors',\n        'type': 'tensors'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Enter',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensor',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      },\n      {\n        'tfName': 'frame_name',\n        'name': 'frameName',\n        'type': 'string'\n      },\n      {\n        'tfName': 'is_constant',\n        'name': 'isConstant',\n        'type': 'bool'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Exit',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensor',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'NextIteration',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensor',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorArrayV3',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'size',\n        'type': 'number'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'dtype',\n        'name': 'dtype',\n        'type': 'dtype'\n      },\n      {\n        'tfName': 'element_shape',\n        'name': 'elementShape',\n        'type': 'shape'\n      },\n      {\n        'tfName': 'dynamic_size',\n        'name': 'dynamicSize',\n        'type': 'bool'\n      },\n      {\n        'tfName': 'clear_after_read',\n        'name': 'clearAfterRead',\n        'type': 'bool'\n      },\n      {\n        'tfName': 'identical_element_shapes',\n        'name': 'identicalElementShapes',\n        'type': 'bool'\n      },\n      {\n        'tfName': 'tensor_array_name',\n        'name': 'name',\n        'type': 'string'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorArrayWriteV3',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensorArrayId',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'index',\n        'type': 'number'\n      },\n      {\n        'start': 2,\n        'name': 'tensor',\n        'type': 'tensor'\n      },\n      {\n        'start': 3,\n        'name': 'flowIn',\n        'type': 'number'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorArrayReadV3',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensorArrayId',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'index',\n        'type': 'number'\n      },\n      {\n        'start': 2,\n        'name': 'flowIn',\n        'type': 'number'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'dtype',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorArrayGatherV3',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensorArrayId',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'indices',\n        'type': 'number[]'\n      },\n      {\n        'start': 2,\n        'name': 'flowIn',\n        'type': 'number'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'dtype',\n        'name': 'dtype',\n        'type': 'dtype'\n      },\n      {\n        'tfName': 'element_shape',\n        'name': 'elementShape',\n        'type': 'shape'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorArrayScatterV3',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensorArrayId',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'indices',\n        'type': 'number[]'\n      },\n      {\n        'start': 2,\n        'name': 'tensor',\n        'type': 'tensor'\n      },\n      {\n        'start': 3,\n        'name': 'flowIn',\n        'type': 'number'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorArrayConcatV3',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensorArrayId',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'flowIn',\n        'type': 'number'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'dtype',\n        'name': 'dtype',\n        'type': 'dtype'\n      },\n      {\n        'tfName': 'element_shape_except0',\n        'name': 'elementShapeExcept0',\n        'type': 'shape',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorArraySplitV3',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensorArrayId',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'tensor',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'lengths',\n        'type': 'number[]'\n      },\n      {\n        'start': 3,\n        'name': 'flowIn',\n        'type': 'number'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorArraySizeV3',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensorArrayId',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'flowIn',\n        'type': 'number'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorArrayCloseV3',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensorArrayId',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'StatelessIf',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'cond',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'end': 0,\n        'name': 'args',\n        'type': 'tensors'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'then_branch',\n        'name': 'thenBranch',\n        'type': 'func'\n      },\n      {\n        'tfName': 'else_branch',\n        'name': 'elseBranch',\n        'type': 'func'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'If',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'cond',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'end': 0,\n        'name': 'args',\n        'type': 'tensors'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'then_branch',\n        'name': 'thenBranch',\n        'type': 'func'\n      },\n      {\n        'tfName': 'else_branch',\n        'name': 'elseBranch',\n        'type': 'func'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'StatelessWhile',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'end': 0,\n        'name': 'args',\n        'type': 'tensors'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'cond',\n        'name': 'cond',\n        'type': 'func'\n      },\n      {\n        'tfName': 'body',\n        'name': 'body',\n        'type': 'func'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'While',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'end': 0,\n        'name': 'args',\n        'type': 'tensors'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'cond',\n        'name': 'cond',\n        'type': 'func'\n      },\n      {\n        'tfName': 'body',\n        'name': 'body',\n        'type': 'func'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorListScatter',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensor',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'indices',\n        'type': 'number[]'\n      },\n      {\n        'start': 2,\n        'name': 'elementShape',\n        'type': 'shape'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'element_dtype',\n        'name': 'elementDType',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorListScatterV2',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensor',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'indices',\n        'type': 'number[]'\n      },\n      {\n        'start': 2,\n        'name': 'elementShape',\n        'type': 'shape'\n      },\n      {\n        'start': 3,\n        'name': 'numElements',\n        'type': 'number'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'element_dtype',\n        'name': 'elementDType',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorListGather',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensorListId',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'indices',\n        'type': 'number[]'\n      },\n      {\n        'start': 2,\n        'name': 'elementShape',\n        'type': 'shape'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'element_dtype',\n        'name': 'elementDType',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorListGetItem',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensorListId',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'index',\n        'type': 'number'\n      },\n      {\n        'start': 2,\n        'name': 'elementShape',\n        'type': 'shape'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'element_dtype',\n        'name': 'elementDType',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorListSetItem',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensorListId',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'index',\n        'type': 'number'\n      },\n      {\n        'start': 2,\n        'name': 'tensor',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'element_dtype',\n        'name': 'elementDType',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorListReserve',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'elementShape',\n        'type': 'shape'\n      },\n      {\n        'start': 1,\n        'name': 'numElements',\n        'type': 'number'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'element_dtype',\n        'name': 'elementDType',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorListFromTensor',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensor',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'elementShape',\n        'type': 'shape'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'element_dtype',\n        'name': 'elementDType',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorListStack',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensorListId',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'elementShape',\n        'type': 'shape'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'element_dtype',\n        'name': 'elementDType',\n        'type': 'dtype'\n      },\n      {\n        'tfName': 'num_elements',\n        'name': 'numElements',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorListSplit',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensor',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'elementShape',\n        'type': 'shape'\n      },\n      {\n        'start': 2,\n        'name': 'lengths',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'element_dtype',\n        'name': 'elementDType',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorListConcat',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensorListId',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'element_shape',\n        'name': 'elementShape',\n        'type': 'shape'\n      },\n      {\n        'tfName': 'element_dtype',\n        'name': 'elementDType',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorListConcatV2',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensorListId',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'element_shape',\n        'name': 'elementShape',\n        'type': 'shape'\n      },\n      {\n        'tfName': 'element_dtype',\n        'name': 'elementDType',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorListPopBack',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensorListId',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'elementShape',\n        'type': 'shape'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'element_dtype',\n        'name': 'elementDType',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorListPushBack',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensorListId',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'tensor',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'element_dtype',\n        'name': 'elementDType',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorListLength',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensorListId',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorListResize',\n    'category': 'control',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensorListId',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'size',\n        'type': 'number'\n      }\n    ]\n  }\n]\n;\n", "\n/**\n * @license\n * Copyright 2023 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {OpMapper} from '../types';\n\nexport const json: OpMapper[] = [\n  {\n    'tfOpName': 'AvgPool',\n    'category': 'convolution',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'strides',\n        'name': 'strides',\n        'type': 'number[]'\n      },\n      {\n        'tfName': 'padding',\n        'name': 'pad',\n        'type': 'string'\n      },\n      {\n        'tfName': 'data_format',\n        'name': 'dataFormat',\n        'type': 'string',\n        'notSupported': true\n      },\n      {\n        'tfName': 'ksize',\n        'name': 'kernelSize',\n        'type': 'number[]'\n      },\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'MaxPool',\n    'category': 'convolution',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'strides',\n        'name': 'strides',\n        'type': 'number[]'\n      },\n      {\n        'tfName': 'padding',\n        'name': 'pad',\n        'type': 'string'\n      },\n      {\n        'tfName': 'data_format',\n        'name': 'dataFormat',\n        'type': 'string',\n        'notSupported': true\n      },\n      {\n        'tfName': 'ksize',\n        'name': 'kernelSize',\n        'type': 'number[]'\n      },\n      {\n        'tfName': 'explicit_paddings',\n        'name': 'explicitPaddings',\n        'type': 'number[]',\n        'defaultValue': [],\n        'notSupported': true\n      },\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'MaxPoolWithArgmax',\n    'category': 'convolution',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'strides',\n        'name': 'strides',\n        'type': 'number[]'\n      },\n      {\n        'tfName': 'padding',\n        'name': 'pad',\n        'type': 'string'\n      },\n      {\n        'tfName': 'ksize',\n        'name': 'kernelSize',\n        'type': 'number[]'\n      },\n      {\n        'tfName': 'include_batch_in_index',\n        'name': 'includeBatchInIndex',\n        'type': 'bool'\n      },\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'AvgPool3D',\n    'category': 'convolution',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'strides',\n        'name': 'strides',\n        'type': 'number[]'\n      },\n      {\n        'tfName': 'padding',\n        'name': 'pad',\n        'type': 'string'\n      },\n      {\n        'tfName': 'data_format',\n        'name': 'dataFormat',\n        'type': 'string',\n        'notSupported': true\n      },\n      {\n        'tfName': 'ksize',\n        'name': 'kernelSize',\n        'type': 'number[]'\n      },\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'MaxPool3D',\n    'category': 'convolution',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'strides',\n        'name': 'strides',\n        'type': 'number[]'\n      },\n      {\n        'tfName': 'padding',\n        'name': 'pad',\n        'type': 'string'\n      },\n      {\n        'tfName': 'data_format',\n        'name': 'dataFormat',\n        'type': 'string',\n        'notSupported': true\n      },\n      {\n        'tfName': 'ksize',\n        'name': 'kernelSize',\n        'type': 'number[]'\n      },\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Conv1D',\n    'category': 'convolution',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'filter',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'stride',\n        'name': 'stride',\n        'type': 'number'\n      },\n      {\n        'tfName': 'padding',\n        'name': 'pad',\n        'type': 'string'\n      },\n      {\n        'tfName': 'data_format',\n        'name': 'dataFormat',\n        'type': 'string',\n        'defaultValue': 'NWC'\n      },\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      },\n      {\n        'tfName': 'dilation',\n        'name': 'dilation',\n        'type': 'number',\n        'defaultValue': 1\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Conv2D',\n    'category': 'convolution',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'filter',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      },\n      {\n        'tfName': 'strides',\n        'name': 'strides',\n        'type': 'number[]'\n      },\n      {\n        'tfName': 'padding',\n        'name': 'pad',\n        'type': 'string'\n      },\n      {\n        'tfName': 'useCudnnOnGpu',\n        'name': 'useCudnnOnGpu',\n        'type': 'bool'\n      },\n      {\n        'tfName': 'data_format',\n        'name': 'dataFormat',\n        'type': 'string',\n        'defaultValue': 'NHWC'\n      },\n      {\n        'tfName': 'explicit_paddings',\n        'name': 'explicitPaddings',\n        'type': 'number[]',\n        'defaultValue': []\n      },\n      {\n        'tfName': 'dilations',\n        'name': 'dilations',\n        'type': 'number[]'\n      }\n    ]\n  },\n  {\n    'tfOpName': '_FusedConv2D',\n    'category': 'convolution',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'filter',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'end': 0,\n        'name': 'args',\n        'type': 'tensors'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'num_args',\n        'name': 'numArgs',\n        'type': 'number'\n      },\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      },\n      {\n        'tfName': 'strides',\n        'name': 'strides',\n        'type': 'number[]'\n      },\n      {\n        'tfName': 'padding',\n        'name': 'pad',\n        'type': 'string'\n      },\n      {\n        'tfName': 'explicit_paddings',\n        'name': 'explicitPaddings',\n        'type': 'number[]',\n        'defaultValue': []\n      },\n      {\n        'tfName': 'use_cudnn_on_gpu',\n        'name': 'useCudnnOnGpu',\n        'type': 'bool',\n        'defaultValue': true\n      },\n      {\n        'tfName': 'data_format',\n        'name': 'dataFormat',\n        'type': 'string',\n        'defaultValue': 'NHWC'\n      },\n      {\n        'tfName': 'dilations',\n        'name': 'dilations',\n        'type': 'number[]',\n        'defaultValue': [\n          1,\n          1,\n          1,\n          1\n        ]\n      },\n      {\n        'tfName': 'fused_ops',\n        'name': 'fusedOps',\n        'type': 'string[]',\n        'defaultValue': []\n      },\n      {\n        'tfName': 'epsilon',\n        'name': 'epsilon',\n        'type': 'number',\n        'defaultValue': 0.0001\n      },\n      {\n        'tfName': 'leakyrelu_alpha',\n        'name': 'leakyreluAlpha',\n        'type': 'number',\n        'defaultValue': 0.2\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Conv2DBackpropInput',\n    'category': 'convolution',\n    'inputs': [\n      {\n        'start': 2,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'filter',\n        'type': 'tensor'\n      },\n      {\n        'start': 0,\n        'name': 'outputShape',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'strides',\n        'name': 'strides',\n        'type': 'number[]'\n      },\n      {\n        'tfName': 'padding',\n        'name': 'pad',\n        'type': 'string'\n      },\n      {\n        'tfName': 'data_format',\n        'name': 'dataFormat',\n        'type': 'string',\n        'notSupported': true\n      },\n      {\n        'tfName': 'explicit_paddings',\n        'name': 'explicitPaddings',\n        'type': 'number[]',\n        'defaultValue': []\n      },\n      {\n        'tfName': 'dilations',\n        'name': 'dilations',\n        'type': 'number[]',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'DepthwiseConv2d',\n    'category': 'convolution',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'input',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'filter',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'strides',\n        'name': 'strides',\n        'type': 'number[]'\n      },\n      {\n        'tfName': 'padding',\n        'name': 'pad',\n        'type': 'string'\n      },\n      {\n        'tfName': 'data_format',\n        'name': 'dataFormat',\n        'type': 'string',\n        'defaultValue': 'NHWC'\n      },\n      {\n        'tfName': 'explicit_paddings',\n        'name': 'explicitPaddings',\n        'type': 'number[]',\n        'defaultValue': []\n      },\n      {\n        'tfName': 'dilations',\n        'name': 'dilations',\n        'type': 'number[]'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'DepthwiseConv2dNative',\n    'category': 'convolution',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'input',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'filter',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'strides',\n        'name': 'strides',\n        'type': 'number[]'\n      },\n      {\n        'tfName': 'padding',\n        'name': 'pad',\n        'type': 'string'\n      },\n      {\n        'tfName': 'data_format',\n        'name': 'dataFormat',\n        'type': 'string',\n        'defaultValue': 'NHWC'\n      },\n      {\n        'tfName': 'explicit_paddings',\n        'name': 'explicitPaddings',\n        'type': 'number[]',\n        'defaultValue': []\n      },\n      {\n        'tfName': 'dilations',\n        'name': 'dilations',\n        'type': 'number[]'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'FusedDepthwiseConv2dNative',\n    'category': 'convolution',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'filter',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'end': 0,\n        'name': 'args',\n        'type': 'tensors'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'num_args',\n        'name': 'numArgs',\n        'type': 'number'\n      },\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      },\n      {\n        'tfName': 'strides',\n        'name': 'strides',\n        'type': 'number[]'\n      },\n      {\n        'tfName': 'padding',\n        'name': 'pad',\n        'type': 'string'\n      },\n      {\n        'tfName': 'data_format',\n        'name': 'dataFormat',\n        'type': 'string',\n        'defaultValue': 'NHWC'\n      },\n      {\n        'tfName': 'dilations',\n        'name': 'dilations',\n        'type': 'number[]',\n        'defaultValue': [\n          1,\n          1,\n          1,\n          1\n        ]\n      },\n      {\n        'tfName': 'fused_ops',\n        'name': 'fusedOps',\n        'type': 'string[]',\n        'defaultValue': []\n      },\n      {\n        'tfName': 'explicit_paddings',\n        'name': 'explicitPaddings',\n        'type': 'number[]',\n        'defaultValue': []\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Conv3D',\n    'category': 'convolution',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'filter',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'strides',\n        'name': 'strides',\n        'type': 'number[]'\n      },\n      {\n        'tfName': 'padding',\n        'name': 'pad',\n        'type': 'string'\n      },\n      {\n        'tfName': 'data_format',\n        'name': 'dataFormat',\n        'type': 'string',\n        'defaultValue': 'NHWC'\n      },\n      {\n        'tfName': 'dilations',\n        'name': 'dilations',\n        'type': 'number[]'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Dilation2D',\n    'category': 'convolution',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'filter',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'strides',\n        'name': 'strides',\n        'type': 'number[]'\n      },\n      {\n        'tfName': 'rates',\n        'name': 'dilations',\n        'type': 'number[]'\n      },\n      {\n        'tfName': 'padding',\n        'name': 'pad',\n        'type': 'string'\n      }\n    ]\n  }\n]\n;\n", "\n/**\n * @license\n * Copyright 2023 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {OpMapper} from '../types';\n\nexport const json: OpMapper[] = [\n  {\n    'tfOpName': 'Fill',\n    'category': 'creation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'shape',\n        'type': 'number[]'\n      },\n      {\n        'start': 1,\n        'name': 'value',\n        'type': 'number'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'LinSpace',\n    'category': 'creation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'start',\n        'type': 'number'\n      },\n      {\n        'start': 1,\n        'name': 'stop',\n        'type': 'number'\n      },\n      {\n        'start': 2,\n        'name': 'num',\n        'type': 'number'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'OneHot',\n    'category': 'creation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'indices',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'depth',\n        'type': 'number'\n      },\n      {\n        'start': 2,\n        'name': 'onValue',\n        'type': 'number',\n        'defaultValue': 1\n      },\n      {\n        'start': 3,\n        'name': 'offValue',\n        'type': 'number',\n        'defaultValue': 0\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'axis',\n        'name': 'axis',\n        'type': 'number',\n        'notSupported': true\n      },\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Ones',\n    'category': 'creation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'shape',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'OnesLike',\n    'category': 'creation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'dtype',\n        'name': 'dtype',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'RandomStandardNormal',\n    'category': 'creation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'shape',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'seed',\n        'name': 'seed',\n        'type': 'number',\n        'defaultValue': 0\n      },\n      {\n        'tfName': 'seed2',\n        'name': 'seed2',\n        'type': 'number',\n        'defaultValue': 0,\n        'notSupported': true\n      },\n      {\n        'tfName': 'dtype',\n        'name': 'dtype',\n        'type': 'dtype'\n      },\n      {\n        'tfName': 'T',\n        'name': 'T',\n        'type': 'number',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'RandomUniform',\n    'category': 'creation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'shape',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'minval',\n        'name': 'minval',\n        'type': 'number',\n        'defaultValue': 0\n      },\n      {\n        'tfName': 'maxval',\n        'name': 'maxval',\n        'type': 'number',\n        'defaultValue': 1\n      },\n      {\n        'tfName': 'dtype',\n        'name': 'dtype',\n        'type': 'dtype'\n      },\n      {\n        'tfName': 'seed',\n        'name': 'seed',\n        'type': 'number',\n        'defaultValue': 0\n      },\n      {\n        'tfName': 'seed2',\n        'name': 'seed2',\n        'type': 'number',\n        'defaultValue': 0,\n        'notSupported': true\n      },\n      {\n        'tfName': 'T',\n        'name': 'T',\n        'type': 'number',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'RandomUniformInt',\n    'category': 'creation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'shape',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'minval',\n        'name': 'minval',\n        'type': 'number'\n      },\n      {\n        'tfName': 'maxval',\n        'name': 'maxval',\n        'type': 'number'\n      },\n      {\n        'tfName': 'seed',\n        'name': 'seed',\n        'type': 'number',\n        'defaultValue': 0\n      },\n      {\n        'tfName': 'seed2',\n        'name': 'seed2',\n        'type': 'number',\n        'defaultValue': 0,\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Range',\n    'category': 'creation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'start',\n        'type': 'number'\n      },\n      {\n        'start': 1,\n        'name': 'stop',\n        'type': 'number'\n      },\n      {\n        'start': 2,\n        'name': 'step',\n        'type': 'number',\n        'defaultValue': 0\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'Tidx',\n        'name': 'dtype',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TruncatedNormal',\n    'category': 'creation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'shape',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'means',\n        'name': 'mean',\n        'type': 'number',\n        'defaultValue': 0\n      },\n      {\n        'tfName': 'stddev',\n        'name': 'stdDev',\n        'type': 'number',\n        'defaultValue': 1\n      },\n      {\n        'tfName': 'seed',\n        'name': 'seed',\n        'type': 'number'\n      },\n      {\n        'tfName': 'seed2',\n        'name': 'seed2',\n        'type': 'number',\n        'defaultValue': 0,\n        'notSupported': true\n      },\n      {\n        'tfName': 'dtype',\n        'name': 'dtype',\n        'type': 'dtype'\n      },\n      {\n        'tfName': 'T',\n        'name': 'T',\n        'type': 'number',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Zeros',\n    'category': 'creation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'shape',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'ZerosLike',\n    'category': 'creation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Multinomial',\n    'category': 'creation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'logits',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'numSamples',\n        'type': 'number'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'seed',\n        'name': 'seed',\n        'type': 'number'\n      },\n      {\n        'tfName': 'seed2',\n        'name': 'seed2',\n        'type': 'number'\n      },\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype'\n      },\n      {\n        'tfName': 'output_dtype',\n        'name': 'output_dtype',\n        'type': 'dtype'\n      }\n    ]\n  }\n]\n;\n", "\n/**\n * @license\n * Copyright 2023 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {OpMapper} from '../types';\n\nexport const json: OpMapper[] = [\n  {\n    'tfOpName': 'NonMaxSuppressionV2',\n    'category': 'dynamic',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'boxes',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'scores',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'maxOutputSize',\n        'type': 'number'\n      },\n      {\n        'start': 3,\n        'name': 'iouThreshold',\n        'type': 'number'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'NonMaxSuppressionV3',\n    'category': 'dynamic',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'boxes',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'scores',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'maxOutputSize',\n        'type': 'number'\n      },\n      {\n        'start': 3,\n        'name': 'iouThreshold',\n        'type': 'number'\n      },\n      {\n        'start': 4,\n        'name': 'scoreThreshold',\n        'type': 'number'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'NonMaxSuppressionV4',\n    'category': 'dynamic',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'boxes',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'scores',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'maxOutputSize',\n        'type': 'number'\n      },\n      {\n        'start': 3,\n        'name': 'iouThreshold',\n        'type': 'number'\n      },\n      {\n        'start': 4,\n        'name': 'scoreThreshold',\n        'type': 'number'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      },\n      {\n        'tfName': 'T_threshold',\n        'name': 'threshold',\n        'type': 'dtype',\n        'notSupported': true\n      },\n      {\n        'tfName': 'pad_to_max_output_size',\n        'name': 'padToMaxOutputSize',\n        'type': 'bool'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'NonMaxSuppressionV5',\n    'category': 'dynamic',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'boxes',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'scores',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'maxOutputSize',\n        'type': 'number'\n      },\n      {\n        'start': 3,\n        'name': 'iouThreshold',\n        'type': 'number'\n      },\n      {\n        'start': 4,\n        'name': 'scoreThreshold',\n        'type': 'number'\n      },\n      {\n        'start': 5,\n        'name': 'softNmsSigma',\n        'type': 'number'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Where',\n    'category': 'dynamic',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'condition',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'ListDiff',\n    'category': 'dynamic',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'y',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  }\n];\n", "\n/**\n * @license\n * Copyright 2023 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {OpMapper} from '../types';\n\nexport const json: OpMapper[] = [\n  {\n    'tfOpName': 'LowerBound',\n    'category': 'evaluation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'sortedSequence',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'values',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TopKV2',\n    'category': 'evaluation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'k',\n        'type': 'number'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'sorted',\n        'name': 'sorted',\n        'type': 'bool'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'UpperBound',\n    'category': 'evaluation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'sortedSequence',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'values',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Unique',\n    'category': 'evaluation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'UniqueV2',\n    'category': 'evaluation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'axis',\n        'type': 'number'\n      }\n    ]\n  }\n]\n;\n", "\n/**\n * @license\n * Copyright 2023 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {OpMapper} from '../types';\n\nexport const json: OpMapper[] = [\n  {\n    'tfOpName': 'PlaceholderWithDefault',\n    'category': 'graph',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'default',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'shape',\n        'name': 'shape',\n        'type': 'shape'\n      },\n      {\n        'tfName': 'dtype',\n        'name': 'dtype',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Placeholder',\n    'category': 'graph',\n    'attrs': [\n      {\n        'tfName': 'shape',\n        'name': 'shape',\n        'type': 'shape'\n      },\n      {\n        'tfName': 'dtype',\n        'name': 'dtype',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Const',\n    'category': 'graph'\n  },\n  {\n    'tfOpName': 'Identity',\n    'category': 'graph',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'IdentityN',\n    'category': 'graph',\n    'inputs': [\n      {\n        'start': 0,\n        'end': 0,\n        'name': 'x',\n        'type': 'tensors'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Snapshot',\n    'category': 'graph',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Rank',\n    'category': 'graph',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Size',\n    'category': 'graph',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Shape',\n    'category': 'graph',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'ShapeN',\n    'category': 'graph',\n    'inputs': [\n      {\n        'start': 0,\n        'end': 0,\n        'name': 'x',\n        'type': 'tensors'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Print',\n    'category': 'graph',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'data',\n        'type': 'tensors'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'message',\n        'name': 'message',\n        'type': 'string'\n      },\n      {\n        'tfName': 'first_n',\n        'name': 'firstN',\n        'type': 'number',\n        'notSupported': true\n      },\n      {\n        'tfName': 'summarize',\n        'name': 'summarize',\n        'type': 'number',\n        'defaultValue': 3\n      }\n    ]\n  },\n  {\n    'tfOpName': 'NoOp',\n    'category': 'graph',\n    'inputs': []\n  },\n  {\n    'tfOpName': 'StopGradient',\n    'category': 'graph',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'FakeQuantWithMinMaxVars',\n    'category': 'graph',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'min',\n        'name': 'min',\n        'type': 'number'\n      },\n      {\n        'tfName': 'max',\n        'name': 'max',\n        'type': 'number'\n      }\n    ]\n  }\n];\n", "\n/**\n * @license\n * Copyright 2023 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {OpMapper} from '../types';\n\nexport const json: OpMapper[] = [\n  {\n    'tfOpName': 'HashTable',\n    'category': 'hash_table',\n    'inputs': [],\n    'attrs': [\n      {\n        'tfName': 'shared_name',\n        'name': 'sharedName',\n        'type': 'string'\n      },\n      {\n        'tfName': 'use_node_name_sharing',\n        'name': 'useNodeNameSharing',\n        'type': 'bool'\n      },\n      {\n        'tfName': 'key_dtype',\n        'name': 'keyDType',\n        'type': 'dtype'\n      },\n      {\n        'tfName': 'value_dtype',\n        'name': 'valueDType',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'HashTableV2',\n    'category': 'hash_table',\n    'inputs': [],\n    'attrs': [\n      {\n        'tfName': 'shared_name',\n        'name': 'sharedName',\n        'type': 'string'\n      },\n      {\n        'tfName': 'use_node_name_sharing',\n        'name': 'useNodeNameSharing',\n        'type': 'bool'\n      },\n      {\n        'tfName': 'key_dtype',\n        'name': 'keyDType',\n        'type': 'dtype'\n      },\n      {\n        'tfName': 'value_dtype',\n        'name': 'valueDType',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'LookupTableImport',\n    'category': 'hash_table',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tableHandle',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'keys',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'values',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'Tin',\n        'name': 'tIn',\n        'type': 'dtype',\n        'notSupported': true\n      },\n      {\n        'tfName': 'Tout',\n        'name': 'tOut',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'LookupTableImportV2',\n    'category': 'hash_table',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tableHandle',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'keys',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'values',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'Tin',\n        'name': 'tIn',\n        'type': 'dtype',\n        'notSupported': true\n      },\n      {\n        'tfName': 'Tout',\n        'name': 'tOut',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'LookupTableFind',\n    'category': 'hash_table',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tableHandle',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'keys',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'defaultValue',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'Tin',\n        'name': 'tIn',\n        'type': 'dtype',\n        'notSupported': true\n      },\n      {\n        'tfName': 'Tout',\n        'name': 'tOut',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'LookupTableFindV2',\n    'category': 'hash_table',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tableHandle',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'keys',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'defaultValue',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'Tin',\n        'name': 'tIn',\n        'type': 'dtype',\n        'notSupported': true\n      },\n      {\n        'tfName': 'Tout',\n        'name': 'tOut',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'LookupTableSize',\n    'category': 'hash_table',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tableHandle',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'LookupTableSizeV2',\n    'category': 'hash_table',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tableHandle',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'InitializeTable',\n    'category': 'hash_table',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tableHandle',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'keys',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'values',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'InitializeTableV2',\n    'category': 'hash_table',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tableHandle',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'keys',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'values',\n        'type': 'tensor'\n      }\n    ]\n  }\n]\n;\n", "\n/**\n * @license\n * Copyright 2023 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {OpMapper} from '../types';\n\nexport const json: OpMapper[] = [\n  {\n    'tfOpName': 'ResizeBilinear',\n    'category': 'image',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'images',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'size',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'align_corners',\n        'name': 'alignCorners',\n        'type': 'bool'\n      },\n      {\n        'tfName': 'half_pixel_centers',\n        'name': 'halfPixelCenters',\n        'type': 'bool'\n      },\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'ResizeNearestNeighbor',\n    'category': 'image',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'images',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'size',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'align_corners',\n        'name': 'alignCorners',\n        'type': 'bool'\n      },\n      {\n        'tfName': 'half_pixel_centers',\n        'name': 'halfPixelCenters',\n        'type': 'bool'\n      },\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'CropAndResize',\n    'category': 'image',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'image',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'boxes',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'boxInd',\n        'type': 'tensor'\n      },\n      {\n        'start': 3,\n        'name': 'cropSize',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'method',\n        'name': 'method',\n        'type': 'string'\n      },\n      {\n        'tfName': 'extrapolation_value',\n        'name': 'extrapolationValue',\n        'type': 'number'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'ImageProjectiveTransformV3',\n    'category': 'image',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'images',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'transforms',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'outputShape',\n        'type': 'number[]'\n      },\n      {\n        'start': 3,\n        'name': 'fillValue',\n        'type': 'number'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'interpolation',\n        'name': 'interpolation',\n        'type': 'string'\n      },\n      {\n        'tfName': 'fill_mode',\n        'name': 'fillMode',\n        'type': 'string'\n      }\n    ]\n  }\n];\n", "\n/**\n * @license\n * Copyright 2023 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {OpMapper} from '../types';\n\nexport const json: OpMapper[] = [\n  {\n    'tfOpName': 'Equal',\n    'category': 'logical',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'NotEqual',\n    'category': 'logical',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Greater',\n    'category': 'logical',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'GreaterEqual',\n    'category': 'logical',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Less',\n    'category': 'logical',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'LessEqual',\n    'category': 'logical',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'LogicalAnd',\n    'category': 'logical',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'LogicalNot',\n    'category': 'logical',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'LogicalOr',\n    'category': 'logical',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Select',\n    'category': 'logical',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'condition',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'SelectV2',\n    'category': 'logical',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'condition',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'BitwiseAnd',\n    'category': 'logical',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'y',\n        'type': 'tensor'\n      }\n    ]\n  }\n]\n;\n", "\n/**\n * @license\n * Copyright 2023 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {OpMapper} from '../types';\n\nexport const json: OpMapper[] = [\n  {\n    'tfOpName': '_FusedMatMul',\n    'category': 'matrices',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'end': 0,\n        'name': 'args',\n        'type': 'tensors'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'num_args',\n        'name': 'numArgs',\n        'type': 'number'\n      },\n      {\n        'tfName': 'fused_ops',\n        'name': 'fusedOps',\n        'type': 'string[]',\n        'defaultValue': []\n      },\n      {\n        'tfName': 'epsilon',\n        'name': 'epsilon',\n        'type': 'number',\n        'defaultValue': 0.0001\n      },\n      {\n        'tfName': 'transpose_a',\n        'name': 'transposeA',\n        'type': 'bool',\n        'defaultValue': false\n      },\n      {\n        'tfName': 'transpose_b',\n        'name': 'transposeB',\n        'type': 'bool',\n        'defaultValue': false\n      },\n      {\n        'tfName': 'leakyrelu_alpha',\n        'name': 'leakyreluAlpha',\n        'type': 'number',\n        'defaultValue': 0.2\n      },\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'MatMul',\n    'category': 'matrices',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'transpose_a',\n        'name': 'transposeA',\n        'type': 'bool',\n        'defaultValue': false\n      },\n      {\n        'tfName': 'transpose_b',\n        'name': 'transposeB',\n        'type': 'bool',\n        'defaultValue': false\n      },\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'BatchMatMul',\n    'category': 'matrices',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'adj_x',\n        'name': 'transposeA',\n        'type': 'bool',\n        'defaultValue': false\n      },\n      {\n        'tfName': 'adj_y',\n        'name': 'transposeB',\n        'type': 'bool',\n        'defaultValue': false\n      },\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'BatchMatMulV2',\n    'category': 'matrices',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'b',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'adj_x',\n        'name': 'transposeA',\n        'type': 'bool',\n        'defaultValue': false\n      },\n      {\n        'tfName': 'adj_y',\n        'name': 'transposeB',\n        'type': 'bool',\n        'defaultValue': false\n      },\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Transpose',\n    'category': 'matrices',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'perm',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Einsum',\n    'category': 'matrices',\n    'inputs': [\n      {\n        'start': 0,\n        'end': 0,\n        'name': 'tensors',\n        'type': 'tensors'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'equation',\n        'name': 'equation',\n        'type': 'string'\n      },\n      {\n        'tfName': 'N',\n        'name': 'n',\n        'type': 'number',\n        'defaultValue': 2\n      },\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'MatrixBandPart',\n    'category': 'matrices',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'a',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'numLower',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'numUpper',\n        'type': 'tensor'\n      }\n    ]\n  }\n]\n;\n", "\n/**\n * @license\n * Copyright 2023 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {OpMapper} from '../types';\n\nexport const json: OpMapper[] = [\n  {\n    'tfOpName': 'EuclideanNorm',\n    'category': 'normalization',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'axis',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'keep_dims',\n        'name': 'keepDims',\n        'type': 'bool',\n        'defaultValue': false\n      }\n    ]\n  },\n  {\n    'tfOpName': 'FusedBatchNorm',\n    'category': 'normalization',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'scale',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'offset',\n        'type': 'tensor'\n      },\n      {\n        'start': 3,\n        'name': 'mean',\n        'type': 'tensor'\n      },\n      {\n        'start': 4,\n        'name': 'variance',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'epsilon',\n        'name': 'epsilon',\n        'type': 'number',\n        'defaultValue': 0.001\n      },\n      {\n        'tfName': 'data_format',\n        'name': 'dataFormat',\n        'type': 'string',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'FusedBatchNormV2',\n    'category': 'normalization',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'scale',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'offset',\n        'type': 'tensor'\n      },\n      {\n        'start': 3,\n        'name': 'mean',\n        'type': 'tensor'\n      },\n      {\n        'start': 4,\n        'name': 'variance',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'epsilon',\n        'name': 'epsilon',\n        'type': 'number',\n        'defaultValue': 0.001\n      },\n      {\n        'tfName': 'data_format',\n        'name': 'dataFormat',\n        'type': 'string',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'FusedBatchNormV3',\n    'category': 'normalization',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'scale',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'offset',\n        'type': 'tensor'\n      },\n      {\n        'start': 3,\n        'name': 'mean',\n        'type': 'tensor'\n      },\n      {\n        'start': 4,\n        'name': 'variance',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'epsilon',\n        'name': 'epsilon',\n        'type': 'number',\n        'defaultValue': 0.001\n      },\n      {\n        'tfName': 'data_format',\n        'name': 'dataFormat',\n        'type': 'string',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'LRN',\n    'category': 'normalization',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'depth_radius',\n        'name': 'radius',\n        'type': 'number',\n        'defaultValue': 5\n      },\n      {\n        'tfName': 'bias',\n        'name': 'bias',\n        'type': 'number',\n        'defaultValue': 1\n      },\n      {\n        'tfName': 'alpha',\n        'name': 'alpha',\n        'type': 'number',\n        'defaultValue': 1\n      },\n      {\n        'tfName': 'beta',\n        'name': 'beta',\n        'type': 'number',\n        'defaultValue': 0.5\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Softmax',\n    'category': 'normalization',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'LogSoftmax',\n    'category': 'normalization',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ]\n  }\n]\n;\n", "\n/**\n * @license\n * Copyright 2023 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {OpMapper} from '../types';\n\nexport const json: OpMapper[] = [\n  {\n    'tfOpName': 'Bincount',\n    'category': 'reduction',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'size',\n        'type': 'number'\n      },\n      {\n        'start': 2,\n        'name': 'weights',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'DenseBincount',\n    'category': 'reduction',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'size',\n        'type': 'number'\n      },\n      {\n        'start': 2,\n        'name': 'weights',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'binary_output',\n        'name': 'binaryOutput',\n        'type': 'bool'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Max',\n    'category': 'reduction',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'axis',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'keep_dims',\n        'name': 'keepDims',\n        'type': 'bool'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Mean',\n    'category': 'reduction',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'axis',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'keep_dims',\n        'name': 'keepDims',\n        'type': 'bool'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Min',\n    'category': 'reduction',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'axis',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'keep_dims',\n        'name': 'keepDims',\n        'type': 'bool'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Sum',\n    'category': 'reduction',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'axis',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'keep_dims',\n        'name': 'keepDims',\n        'type': 'bool'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'All',\n    'category': 'reduction',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'axis',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'keep_dims',\n        'name': 'keepDims',\n        'type': 'bool'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Any',\n    'category': 'reduction',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'axis',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'keep_dims',\n        'name': 'keepDims',\n        'type': 'bool'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'ArgMax',\n    'category': 'reduction',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'axis',\n        'type': 'number'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'ArgMin',\n    'category': 'reduction',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'axis',\n        'type': 'number'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Prod',\n    'category': 'reduction',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'axis',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'keep_dims',\n        'name': 'keepDims',\n        'type': 'bool'\n      },\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Cumprod',\n    'category': 'reduction',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'axis',\n        'type': 'number'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'exclusive',\n        'name': 'exclusive',\n        'type': 'bool'\n      },\n      {\n        'tfName': 'reverse',\n        'name': 'reverse',\n        'type': 'bool'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Cumsum',\n    'category': 'reduction',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'axis',\n        'type': 'number'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'exclusive',\n        'name': 'exclusive',\n        'type': 'bool'\n      },\n      {\n        'tfName': 'reverse',\n        'name': 'reverse',\n        'type': 'bool'\n      }\n    ]\n  }\n]\n;\n", "\n/**\n * @license\n * Copyright 2023 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {OpMapper} from '../types';\n\nexport const json: OpMapper[] = [\n  {\n    'tfOpName': 'ConcatV2',\n    'category': 'slice_join',\n    'inputs': [\n      {\n        'start': 0,\n        'end': -1,\n        'name': 'tensors',\n        'type': 'tensors'\n      },\n      {\n        'start': -1,\n        'name': 'axis',\n        'type': 'number'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'N',\n        'name': 'n',\n        'type': 'number',\n        'defaultValue': 2\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Concat',\n    'category': 'slice_join',\n    'inputs': [\n      {\n        'start': 1,\n        'end': 0,\n        'name': 'tensors',\n        'type': 'tensors'\n      },\n      {\n        'start': 0,\n        'name': 'axis',\n        'type': 'number'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'N',\n        'name': 'n',\n        'type': 'number',\n        'defaultValue': 2\n      }\n    ]\n  },\n  {\n    'tfOpName': 'GatherV2',\n    'category': 'slice_join',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'indices',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'axis',\n        'type': 'number',\n        'defaultValue': 0\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'batch_dims',\n        'name': 'batchDims',\n        'type': 'number',\n        'defaultValue': 0\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Gather',\n    'category': 'slice_join',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'indices',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'validate_indices',\n        'name': 'validateIndices',\n        'type': 'bool',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Reverse',\n    'category': 'slice_join',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'dims',\n        'type': 'bool[]'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'ReverseV2',\n    'category': 'slice_join',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'axis',\n        'type': 'number[]'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Slice',\n    'category': 'slice_join',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'begin',\n        'type': 'number[]'\n      },\n      {\n        'start': 2,\n        'name': 'size',\n        'type': 'number[]'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'StridedSlice',\n    'category': 'slice_join',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'begin',\n        'type': 'number[]'\n      },\n      {\n        'start': 2,\n        'name': 'end',\n        'type': 'number[]'\n      },\n      {\n        'start': 3,\n        'name': 'strides',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'begin_mask',\n        'name': 'beginMask',\n        'type': 'number',\n        'defaultValue': 0\n      },\n      {\n        'tfName': 'end_mask',\n        'name': 'endMask',\n        'type': 'number',\n        'defaultValue': 0\n      },\n      {\n        'tfName': 'new_axis_mask',\n        'name': 'newAxisMask',\n        'type': 'number',\n        'defaultValue': 0\n      },\n      {\n        'tfName': 'ellipsis_mask',\n        'name': 'ellipsisMask',\n        'type': 'number',\n        'defaultValue': 0\n      },\n      {\n        'tfName': 'shrink_axis_mask',\n        'name': 'shrinkAxisMask',\n        'type': 'number',\n        'defaultValue': 0\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Pack',\n    'category': 'slice_join',\n    'inputs': [\n      {\n        'start': 0,\n        'end': 0,\n        'name': 'tensors',\n        'type': 'tensors'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'axis',\n        'name': 'axis',\n        'type': 'number',\n        'defaultValue': 0\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Unpack',\n    'category': 'slice_join',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensor',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'axis',\n        'name': 'axis',\n        'type': 'number',\n        'defaultValue': 0\n      },\n      {\n        'tfName': 'num',\n        'name': 'num',\n        'type': 'number',\n        'defaultValue': 0,\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Tile',\n    'category': 'slice_join',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'reps',\n        'type': 'number[]'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Split',\n    'category': 'slice_join',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'axis',\n        'type': 'number',\n        'defaultValue': 0\n      },\n      {\n        'start': 1,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'num_split',\n        'name': 'numOrSizeSplits',\n        'type': 'number',\n        'defaultValue': 1\n      }\n    ]\n  },\n  {\n    'tfOpName': 'SplitV',\n    'category': 'slice_join',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'numOrSizeSplits',\n        'type': 'number[]'\n      },\n      {\n        'start': 2,\n        'name': 'axis',\n        'type': 'number',\n        'defaultValue': 0\n      }\n    ]\n  },\n  {\n    'tfOpName': 'ScatterNd',\n    'category': 'slice_join',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'indices',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'values',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'shape',\n        'type': 'number[]'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'GatherNd',\n    'category': 'slice_join',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'indices',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'SparseToDense',\n    'category': 'slice_join',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'sparseIndices',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'outputShape',\n        'type': 'number[]'\n      },\n      {\n        'start': 2,\n        'name': 'sparseValues',\n        'type': 'tensor'\n      },\n      {\n        'start': 3,\n        'name': 'defaultValue',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'validate_indices',\n        'name': 'validateIndices',\n        'type': 'bool',\n        'defaultValue': false,\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'TensorScatterUpdate',\n    'category': 'slice_join',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'tensor',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'indices',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'values',\n        'type': 'tensor'\n      }\n    ]\n  }\n]\n;\n", "\n/**\n * @license\n * Copyright 2023 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {OpMapper} from '../types';\n\nexport const json: OpMapper[] = [\n  {\n    'tfOpName': 'SparseFillEmptyRows',\n    'category': 'sparse',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'indices',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'values',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'denseShape',\n        'type': 'tensor'\n      },\n      {\n        'start': 3,\n        'name': 'defaultValue',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'SparseReshape',\n    'category': 'sparse',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'inputIndices',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'inputShape',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'newShape',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'T',\n        'name': 'dtype',\n        'type': 'dtype',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'SparseSegmentMean',\n    'category': 'sparse',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'data',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'indices',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'segmentIds',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'SparseSegmentSum',\n    'category': 'sparse',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'data',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'indices',\n        'type': 'tensor'\n      },\n      {\n        'start': 2,\n        'name': 'segmentIds',\n        'type': 'tensor'\n      }\n    ]\n  }\n];\n", "\n/**\n * @license\n * Copyright 2023 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {OpMapper} from '../types';\n\nexport const json: OpMapper[] = [\n  {\n    'tfOpName': 'FFT',\n    'category': 'spectral',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'IFFT',\n    'category': 'spectral',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'RFFT',\n    'category': 'spectral',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'fft_length',\n        'type': 'number',\n        'notSupported': true\n      }\n    ]\n  },\n  {\n    'tfOpName': 'IRFFT',\n    'category': 'spectral',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'fft_length',\n        'type': 'number',\n        'notSupported': true\n      }\n    ]\n  }\n];\n", "\n/**\n * @license\n * Copyright 2023 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {OpMapper} from '../types';\n\nexport const json: OpMapper[] = [\n  {\n    'tfOpName': 'StaticRegexReplace',\n    'category': 'string',\n    'inputs': [\n      {\n      'start': 0,\n        'name': 'input',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'pattern',\n        'name': 'pattern',\n        'type': 'string'\n      },\n      {\n        'tfName': 'rewrite',\n        'name': 'rewrite',\n        'type': 'string'\n      },\n      {\n        'tfName': 'replace_global',\n        'name': 'replaceGlobal',\n        'type': 'bool'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'StringNGrams',\n    'category': 'string',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'data',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'dataSplits',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'separator',\n        'name': 'separator',\n        'type': 'string'\n      },\n      {\n        'tfName': 'ngram_widths',\n        'name': 'nGramWidths',\n        'type': 'number[]'\n      },\n      {\n        'tfName': 'left_pad',\n        'name': 'leftPad',\n        'type': 'string'\n      },\n      {\n        'tfName': 'right_pad',\n        'name': 'rightPad',\n        'type': 'string'\n      },\n      {\n        'tfName': 'pad_width',\n        'name': 'padWidth',\n        'type': 'number'\n      },\n      {\n        'tfName': 'preserve_short_sequences',\n        'name': 'preserveShortSequences',\n        'type': 'bool'\n      }\n    ],\n    'outputs': [\n      'ngrams',\n      'ngrams_splits'\n    ]\n  },\n  {\n    'tfOpName': 'StringSplit',\n    'category': 'string',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'input',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'delimiter',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'skip_empty',\n        'name': 'skipEmpty',\n        'type': 'bool'\n      }\n    ],\n    'outputs': [\n      'indices',\n      'values',\n      'shape'\n    ]\n  },\n  {\n    'tfOpName': 'StringToHashBucketFast',\n    'category': 'string',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'input',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'num_buckets',\n        'name': 'numBuckets',\n        'type': 'number'\n      }\n    ]\n  }\n]\n;\n", "\n/**\n * @license\n * Copyright 2023 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {OpMapper} from '../types';\n\nexport const json: OpMapper[] = [\n  {\n    'tfOpName': 'Cast',\n    'category': 'transformation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'SrcT',\n        'name': 'sdtype',\n        'type': 'dtype',\n        'notSupported': true\n      },\n      {\n        'tfName': 'DstT',\n        'name': 'dtype',\n        'type': 'dtype'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'ExpandDims',\n    'category': 'transformation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'axis',\n        'type': 'number'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'MirrorPad',\n    'category': 'transformation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'padding',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'mode',\n        'name': 'mode',\n        'type': 'string'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Pad',\n    'category': 'transformation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'padding',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'constant_value',\n        'name': 'constantValue',\n        'type': 'number',\n        'defaultValue': 0\n      }\n    ]\n  },\n  {\n    'tfOpName': 'PadV2',\n    'category': 'transformation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'padding',\n        'type': 'number[]'\n      },\n      {\n        'start': 2,\n        'name': 'constantValue',\n        'type': 'number',\n        'defaultValue': 0\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Reshape',\n    'category': 'transformation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'shape',\n        'type': 'number[]'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'EnsureShape',\n    'category': 'transformation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'shape',\n        'type': 'number[]'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'Squeeze',\n    'category': 'transformation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'axis',\n        'tfDeprecatedName': 'squeeze_dims',\n        'name': 'axis',\n        'type': 'number[]'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'SpaceToBatchND',\n    'category': 'transformation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'blockShape',\n        'type': 'number[]'\n      },\n      {\n        'start': 2,\n        'name': 'paddings',\n        'type': 'number[]'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'BatchToSpaceND',\n    'category': 'transformation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'blockShape',\n        'type': 'number[]'\n      },\n      {\n        'start': 2,\n        'name': 'crops',\n        'type': 'number[]'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'DepthToSpace',\n    'category': 'transformation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': [\n      {\n        'tfName': 'block_size',\n        'name': 'blockSize',\n        'type': 'number'\n      },\n      {\n        'tfName': 'data_format',\n        'name': 'dataFormat',\n        'type': 'string'\n      }\n    ]\n  },\n  {\n    'tfOpName': 'BroadcastTo',\n    'category': 'transformation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 'x',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 'shape',\n        'type': 'number[]'\n      }\n    ],\n    'attrs': []\n  },\n  {\n    'tfOpName': 'BroadcastArgs',\n    'category': 'transformation',\n    'inputs': [\n      {\n        'start': 0,\n        'name': 's0',\n        'type': 'tensor'\n      },\n      {\n        'start': 1,\n        'name': 's1',\n        'type': 'tensor'\n      }\n    ],\n    'attrs': []\n  }\n]\n;\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {DataType, env} from '@tensorflow/tfjs-core';\n\nimport * as tensorflow from '../data/compiled_api';\n\nimport {getRegisteredOp} from './custom_op/register';\nimport {getNodeNameAndIndex} from './executors/utils';\nimport * as arithmetic from './op_list/arithmetic';\nimport * as basicMath from './op_list/basic_math';\nimport * as control from './op_list/control';\nimport * as convolution from './op_list/convolution';\nimport * as creation from './op_list/creation';\nimport * as dynamic from './op_list/dynamic';\nimport * as evaluation from './op_list/evaluation';\nimport * as graph from './op_list/graph';\nimport * as hashTable from './op_list/hash_table';\nimport * as image from './op_list/image';\nimport * as logical from './op_list/logical';\nimport * as matrices from './op_list/matrices';\nimport * as normalization from './op_list/normalization';\nimport * as reduction from './op_list/reduction';\nimport * as sliceJoin from './op_list/slice_join';\nimport * as sparse from './op_list/sparse';\nimport * as spectral from './op_list/spectral';\nimport * as string from './op_list/string';\nimport * as transformation from './op_list/transformation';\nimport {Graph, InputParamValue, Node, OpMapper, ParamValue} from './types';\n\nexport class OperationMapper {\n  private static _instance: OperationMapper;\n\n  private opMappers: {[key: string]: OpMapper};\n\n  // Singleton instance for the mapper\n  public static get Instance() {\n    return this._instance || (this._instance = new this());\n  }\n\n  // Loads the op mapping from the JSON file.\n  private constructor() {\n    const ops = [\n      arithmetic, basicMath, control, convolution, creation, dynamic,\n      evaluation, graph, hashTable, image, logical, matrices, normalization,\n      reduction, sliceJoin, sparse, spectral, string, transformation\n    ];\n    const mappersJson: OpMapper[] = [].concat(...ops.map(op => op.json));\n\n    this.opMappers = mappersJson.reduce<{[key: string]: OpMapper}>(\n        (map, mapper: OpMapper) => {\n          map[mapper.tfOpName] = mapper;\n          return map;\n        },\n        {});\n  }\n\n  // Converts the model inference graph from Tensorflow GraphDef to local\n  // representation for TensorFlow.js API\n  transformGraph(\n      graph: tensorflow.IGraphDef,\n      signature: tensorflow.ISignatureDef = {}): Graph {\n    const tfNodes = graph.node;\n    const placeholders: Node[] = [];\n    const weights: Node[] = [];\n    const initNodes: Node[] = [];\n    const nodes = tfNodes.reduce<{[key: string]: Node}>((map, node) => {\n      map[node.name] = this.mapNode(node);\n      if (node.op.startsWith('Placeholder')) {\n        placeholders.push(map[node.name]);\n      } else if (node.op === 'Const') {\n        weights.push(map[node.name]);\n      } else if (node.input == null || node.input.length === 0) {\n        initNodes.push(map[node.name]);\n      }\n      return map;\n    }, {});\n\n    let inputs: Node[] = [];\n    const outputs: Node[] = [];\n    let inputNodeNameToKey: {[key: string]: string} = {};\n    let outputNodeNameToKey: {[key: string]: string} = {};\n    if (signature != null) {\n      inputNodeNameToKey = this.mapSignatureEntries(signature.inputs);\n      outputNodeNameToKey = this.mapSignatureEntries(signature.outputs);\n    }\n    const allNodes = Object.keys(nodes);\n    allNodes.forEach(key => {\n      const node = nodes[key];\n      node.inputNames.forEach((name, index) => {\n        const [nodeName, , outputName] = getNodeNameAndIndex(name);\n        const inputNode = nodes[nodeName];\n        if (inputNode.outputs != null) {\n          const outputIndex = inputNode.outputs.indexOf(outputName);\n          if (outputIndex !== -1) {\n            const inputName = `${nodeName}:${outputIndex}`;\n            // update the input name to use the mapped output index directly.\n            node.inputNames[index] = inputName;\n          }\n        }\n        node.inputs.push(inputNode);\n        inputNode.children.push(node);\n      });\n    });\n\n    // if signature has not outputs set, add any node that does not have\n    // outputs.\n    if (Object.keys(outputNodeNameToKey).length === 0) {\n      allNodes.forEach(key => {\n        const node = nodes[key];\n        if (node.children.length === 0) {\n          outputs.push(node);\n        }\n      });\n    } else {\n      Object.keys(outputNodeNameToKey).forEach(name => {\n        const [nodeName, ] = getNodeNameAndIndex(name);\n        const node = nodes[nodeName];\n        if (node != null) {\n          node.signatureKey = outputNodeNameToKey[name];\n          outputs.push(node);\n        }\n      });\n    }\n\n    if (Object.keys(inputNodeNameToKey).length > 0) {\n      Object.keys(inputNodeNameToKey).forEach(name => {\n        const [nodeName, ] = getNodeNameAndIndex(name);\n        const node = nodes[nodeName];\n        if (node) {\n          node.signatureKey = inputNodeNameToKey[name];\n          inputs.push(node);\n        }\n      });\n    } else {\n      inputs = placeholders;\n    }\n\n    let functions = {};\n    if (graph.library != null && graph.library.function != null) {\n      functions = graph.library.function.reduce((functions, func) => {\n        functions[func.signature.name] = this.mapFunction(func);\n        return functions;\n      }, {} as {[key: string]: Graph});\n    }\n\n    const result: Graph =\n        {nodes, inputs, outputs, weights, placeholders, signature, functions};\n\n    if (initNodes.length > 0) {\n      result.initNodes = initNodes;\n    }\n\n    return result;\n  }\n\n  private mapSignatureEntries(entries: {[k: string]: tensorflow.ITensorInfo}) {\n    return Object.keys(entries || {})\n        .reduce<{[key: string]: string}>((prev, curr) => {\n          prev[entries[curr].name] = curr;\n          return prev;\n        }, {});\n  }\n\n  private mapNode(node: tensorflow.INodeDef): Node {\n    // Unsupported ops will cause an error at run-time (not parse time), since\n    // they may not be used by the actual execution subgraph.\n    const mapper =\n        getRegisteredOp(node.op) || this.opMappers[node.op] || {} as OpMapper;\n    if (node.attr == null) {\n      node.attr = {};\n    }\n\n    const newNode: Node = {\n      name: node.name,\n      op: node.op,\n      category: mapper.category,\n      inputNames:\n          (node.input ||\n           []).map(input => input.startsWith('^') ? input.slice(1) : input),\n      inputs: [],\n      children: [],\n      inputParams: {},\n      attrParams: {},\n      rawAttrs: node.attr,\n      outputs: mapper.outputs\n    };\n\n    if (mapper.inputs != null) {\n      newNode.inputParams =\n          mapper.inputs.reduce<{[key: string]: InputParamValue}>(\n              (map, param) => {\n                map[param.name] = {\n                  type: param.type,\n                  inputIndexStart: param.start,\n                  inputIndexEnd: param.end\n                };\n                return map;\n              },\n              {});\n    }\n    if (mapper.attrs != null) {\n      newNode.attrParams =\n          mapper.attrs.reduce<{[key: string]: ParamValue}>((map, param) => {\n            const type = param.type;\n            let value = undefined;\n            switch (param.type) {\n              case 'string':\n                value = getStringParam(\n                    node.attr, param.tfName, param.defaultValue as string);\n\n                if (value === undefined && !!param.tfDeprecatedName) {\n                  value = getStringParam(\n                      node.attr, param.tfDeprecatedName,\n                      param.defaultValue as string);\n                }\n                break;\n              case 'string[]':\n                value = getStringArrayParam(\n                    node.attr, param.tfName, param.defaultValue as string[]);\n\n                if (value === undefined && !!param.tfDeprecatedName) {\n                  value = getStringArrayParam(\n                      node.attr, param.tfDeprecatedName,\n                      param.defaultValue as string[]);\n                }\n                break;\n              case 'number':\n                value = getNumberParam(\n                    node.attr, param.tfName,\n                    (param.defaultValue || 0) as number);\n                if (value === undefined && !!param.tfDeprecatedName) {\n                  value = getNumberParam(\n                      node.attr, param.tfDeprecatedName,\n                      param.defaultValue as number);\n                }\n                break;\n              case 'number[]':\n                value = getNumericArrayParam(\n                    node.attr, param.tfName, param.defaultValue as number[]);\n                if (value === undefined && !!param.tfDeprecatedName) {\n                  value = getNumericArrayParam(\n                      node.attr, param.tfDeprecatedName,\n                      param.defaultValue as number[]);\n                }\n                break;\n              case 'bool':\n                value = getBoolParam(\n                    node.attr, param.tfName, param.defaultValue as boolean);\n                if (value === undefined && !!param.tfDeprecatedName) {\n                  value = getBoolParam(\n                      node.attr, param.tfDeprecatedName,\n                      param.defaultValue as boolean);\n                }\n                break;\n              case 'bool[]':\n                value = getBoolArrayParam(\n                    node.attr, param.tfName, param.defaultValue as boolean[]);\n                if (value === undefined && !!param.tfDeprecatedName) {\n                  value = getBoolArrayParam(\n                      node.attr, param.tfDeprecatedName,\n                      param.defaultValue as boolean[]);\n                }\n                break;\n              case 'shape':\n                value = getTensorShapeParam(\n                    node.attr, param.tfName, param.defaultValue as number[]);\n                if (value === undefined && !!param.tfDeprecatedName) {\n                  value = getTensorShapeParam(\n                      node.attr, param.tfDeprecatedName,\n                      param.defaultValue as number[]);\n                }\n                break;\n              case 'shape[]':\n                value = getTensorShapeArrayParam(\n                    node.attr, param.tfName, param.defaultValue as number[][]);\n                if (value === undefined && !!param.tfDeprecatedName) {\n                  value = getTensorShapeArrayParam(\n                      node.attr, param.tfDeprecatedName,\n                      param.defaultValue as number[][]);\n                }\n                break;\n              case 'dtype':\n                value = getDtypeParam(\n                    node.attr, param.tfName, param.defaultValue as DataType);\n                if (value === undefined && !!param.tfDeprecatedName) {\n                  value = getDtypeParam(\n                      node.attr, param.tfDeprecatedName,\n                      param.defaultValue as DataType);\n                }\n                break;\n              case 'dtype[]':\n                value = getDtypeArrayParam(\n                    node.attr, param.tfName, param.defaultValue as DataType[]);\n                if (value === undefined && !!param.tfDeprecatedName) {\n                  value = getDtypeArrayParam(\n                      node.attr, param.tfDeprecatedName,\n                      param.defaultValue as DataType[]);\n                }\n                break;\n              case 'func':\n                value = getFuncParam(\n                    node.attr, param.tfName, param.defaultValue as string);\n                if (value === undefined && !!param.tfDeprecatedName) {\n                  value = getFuncParam(\n                      node.attr, param.tfDeprecatedName,\n                      param.defaultValue as string);\n                }\n                break;\n              case 'tensor':\n              case 'tensors':\n                break;\n              default:\n                throw new Error(\n                    `Unsupported param type: ${param.type} for op: ${node.op}`);\n            }\n            map[param.name] = {value, type};\n            return map;\n          }, {});\n    }\n    return newNode;\n  }\n\n  // map the TFunctionDef to TFJS graph object\n  private mapFunction(functionDef: tensorflow.IFunctionDef): Graph {\n    const tfNodes = functionDef.nodeDef;\n    const placeholders: Node[] = [];\n    const weights: Node[] = [];\n    let nodes: {[key: string]: Node} = {};\n    if (tfNodes != null) {\n      nodes = tfNodes.reduce<{[key: string]: Node}>((map, node) => {\n        map[node.name] = this.mapNode(node);\n        if (node.op === 'Const') {\n          weights.push(map[node.name]);\n        }\n        return map;\n      }, {});\n    }\n    const inputs: Node[] = [];\n    const outputs: Node[] = [];\n\n    functionDef.signature.inputArg.forEach(arg => {\n      const [nodeName, ] = getNodeNameAndIndex(arg.name);\n      const node: Node = {\n        name: nodeName,\n        op: 'Placeholder',\n        inputs: [],\n        inputNames: [],\n        category: 'graph',\n        inputParams: {},\n        attrParams: {dtype: {value: parseDtypeParam(arg.type), type: 'dtype'}},\n        children: []\n      };\n      node.signatureKey = arg.name;\n      inputs.push(node);\n      nodes[nodeName] = node;\n    });\n\n    const allNodes = Object.keys(nodes);\n    allNodes.forEach(key => {\n      const node = nodes[key];\n      node.inputNames.forEach((name, index) => {\n        const [nodeName, , outputName] = getNodeNameAndIndex(name);\n        const inputNode = nodes[nodeName];\n        if (inputNode.outputs != null) {\n          const outputIndex = inputNode.outputs.indexOf(outputName);\n          if (outputIndex !== -1) {\n            const inputName = `${nodeName}:${outputIndex}`;\n            // update the input name to use the mapped output index directly.\n            node.inputNames[index] = inputName;\n          }\n        }\n        node.inputs.push(inputNode);\n        inputNode.children.push(node);\n      });\n    });\n\n    const returnNodeMap = functionDef.ret;\n\n    functionDef.signature.outputArg.forEach(output => {\n      const [nodeName, index] = getNodeNameAndIndex(returnNodeMap[output.name]);\n      const node = nodes[nodeName];\n      if (node != null) {\n        node.defaultOutput = index;\n        outputs.push(node);\n      }\n    });\n\n    const signature = this.mapArgsToSignature(functionDef);\n    return {nodes, inputs, outputs, weights, placeholders, signature};\n  }\n\n  private mapArgsToSignature(functionDef: tensorflow.IFunctionDef):\n      tensorflow.ISignatureDef {\n    return {\n      methodName: functionDef.signature.name,\n      inputs: functionDef.signature.inputArg.reduce(\n          (map, arg) => {\n            map[arg.name] = this.mapArgToTensorInfo(arg);\n            return map;\n          },\n          {} as {[key: string]: tensorflow.ITensorInfo}),\n      outputs: functionDef.signature.outputArg.reduce(\n          (map, arg) => {\n            map[arg.name] = this.mapArgToTensorInfo(arg, functionDef.ret);\n            return map;\n          },\n          {} as {[key: string]: tensorflow.ITensorInfo}),\n    };\n  }\n\n  private mapArgToTensorInfo(\n      arg: tensorflow.OpDef.IArgDef,\n      nameMap?: {[key: string]: string}): tensorflow.ITensorInfo {\n    let name = arg.name;\n    if (nameMap != null) {\n      name = nameMap[name];\n    }\n    return {name, dtype: arg.type};\n  }\n}\n\nexport function decodeBase64(text: string): string {\n  const global = env().global;\n  if (typeof global.atob !== 'undefined') {\n    return global.atob(text);\n  } else if (typeof Buffer !== 'undefined') {\n    return new Buffer(text, 'base64').toString();\n  } else {\n    throw new Error(\n        'Unable to decode base64 in this environment. ' +\n        'Missing built-in atob() or Buffer()');\n  }\n}\n\nexport function parseStringParam(s: []|string, keepCase: boolean): string {\n  const value =\n      Array.isArray(s) ? String.fromCharCode.apply(null, s) : decodeBase64(s);\n  return keepCase ? value : value.toLowerCase();\n}\n\nexport function getStringParam(\n    attrs: {[key: string]: tensorflow.IAttrValue}, name: string, def: string,\n    keepCase = false): string {\n  const param = attrs[name];\n  if (param != null) {\n    return parseStringParam(param.s, keepCase);\n  }\n  return def;\n}\n\nexport function getBoolParam(\n    attrs: {[key: string]: tensorflow.IAttrValue}, name: string,\n    def: boolean): boolean {\n  const param = attrs[name];\n  return param ? param.b : def;\n}\n\nexport function getNumberParam(\n    attrs: {[key: string]: tensorflow.IAttrValue}, name: string,\n    def: number): number {\n  const param = attrs[name] || {};\n  const value =\n      param['i'] != null ? param['i'] : (param['f'] != null ? param['f'] : def);\n  return (typeof value === 'number') ? value : parseInt(value, 10);\n}\n\nexport function parseDtypeParam(value: string|tensorflow.DataType): DataType {\n  if (typeof (value) === 'string') {\n    // tslint:disable-next-line:no-any\n    value = tensorflow.DataType[value as any];\n  }\n  switch (value) {\n    case tensorflow.DataType.DT_FLOAT:\n    case tensorflow.DataType.DT_HALF:\n      return 'float32';\n    case tensorflow.DataType.DT_INT32:\n    case tensorflow.DataType.DT_INT64:\n    case tensorflow.DataType.DT_INT8:\n    case tensorflow.DataType.DT_UINT8:\n      return 'int32';\n    case tensorflow.DataType.DT_BOOL:\n      return 'bool';\n    case tensorflow.DataType.DT_DOUBLE:\n      return 'float32';\n    case tensorflow.DataType.DT_STRING:\n      return 'string';\n    case tensorflow.DataType.DT_COMPLEX64:\n    case tensorflow.DataType.DT_COMPLEX128:\n      return 'complex64';\n    default:\n      // Unknown dtype error will happen at runtime (instead of parse time),\n      // since these nodes might not be used by the actual subgraph execution.\n      return null;\n  }\n}\n\nexport function getFuncParam(\n    attrs: {[key: string]: tensorflow.IAttrValue}, name: string,\n    def: string): string {\n  const param = attrs[name];\n  if (param && param.func) {\n    return param.func.name;\n  }\n  return def;\n}\n\nexport function getDtypeParam(\n    attrs: {[key: string]: tensorflow.IAttrValue}, name: string,\n    def: DataType): DataType {\n  const param = attrs[name];\n  if (param && param.type) {\n    return parseDtypeParam(param.type);\n  }\n  return def;\n}\n\nexport function getDtypeArrayParam(\n    attrs: {[key: string]: tensorflow.IAttrValue}, name: string,\n    def: DataType[]): DataType[] {\n  const param = attrs[name];\n  if (param && param.list && param.list.type) {\n    return param.list.type.map(v => parseDtypeParam(v));\n  }\n  return def;\n}\n\nexport function parseTensorShapeParam(shape: tensorflow.ITensorShape): number[]|\n    undefined {\n  if (shape.unknownRank) {\n    return undefined;\n  }\n  if (shape.dim != null) {\n    return shape.dim.map(\n        dim =>\n            (typeof dim.size === 'number') ? dim.size : parseInt(dim.size, 10));\n  }\n  return [];\n}\n\nexport function getTensorShapeParam(\n    attrs: {[key: string]: tensorflow.IAttrValue}, name: string,\n    def?: number[]): number[]|undefined {\n  const param = attrs[name];\n  if (param && param.shape) {\n    return parseTensorShapeParam(param.shape);\n  }\n  return def;\n}\n\nexport function getNumericArrayParam(\n    attrs: {[key: string]: tensorflow.IAttrValue}, name: string,\n    def: number[]): number[] {\n  const param = attrs[name];\n  if (param) {\n    return ((param.list.f && param.list.f.length ? param.list.f :\n                                                   param.list.i) ||\n            [])\n        .map(v => (typeof v === 'number') ? v : parseInt(v, 10));\n  }\n  return def;\n}\n\nexport function getStringArrayParam(\n    attrs: {[key: string]: tensorflow.IAttrValue}, name: string, def: string[],\n    keepCase = false): string[] {\n  const param = attrs[name];\n  if (param && param.list && param.list.s) {\n    return param.list.s.map((v) => {\n      return parseStringParam(v, keepCase);\n    });\n  }\n  return def;\n}\n\nexport function getTensorShapeArrayParam(\n    attrs: {[key: string]: tensorflow.IAttrValue}, name: string,\n    def: number[][]): number[][] {\n  const param = attrs[name];\n  if (param && param.list && param.list.shape) {\n    return param.list.shape.map((v) => {\n      return parseTensorShapeParam(v);\n    });\n  }\n  return def;\n}\n\nexport function getBoolArrayParam(\n    attrs: {[key: string]: tensorflow.IAttrValue}, name: string,\n    def: boolean[]): boolean[] {\n  const param = attrs[name];\n  if (param && param.list && param.list.b) {\n    return param.list.b;\n  }\n  return def;\n}\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {DataType, Tensor} from '@tensorflow/tfjs-core';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport {getTensor} from '../executors/utils';\nimport {getBoolArrayParam, getBoolParam, getDtypeArrayParam, getDtypeParam, getNumberParam, getNumericArrayParam, getStringArrayParam, getStringParam, getTensorShapeArrayParam, getTensorShapeParam} from '../operation_mapper';\nimport {GraphNode, Node, ValueType} from '../types';\n\n/**\n * Helper class for lookup inputs and params for nodes in the model graph.\n */\nexport class NodeValueImpl implements GraphNode {\n  public readonly inputs: Tensor[] = [];\n  public readonly attrs: {[key: string]: ValueType} = {};\n  constructor(\n      private node: Node, private tensorMap: NamedTensorsMap,\n      private context: ExecutionContext) {\n    this.inputs = node.inputNames.map(name => this.getInput(name));\n    if (node.rawAttrs != null) {\n      this.attrs = Object.keys(node.rawAttrs)\n                       .reduce((attrs: {[key: string]: ValueType}, key) => {\n                         attrs[key] = this.getAttr(key);\n                         return attrs;\n                       }, {});\n    }\n  }\n\n  /**\n   * Return the value of the attribute or input param.\n   * @param name String: name of attribute or input param.\n   */\n  private getInput(name: string): Tensor {\n    return getTensor(name, this.tensorMap, this.context);\n  }\n\n  /**\n   * Return the value of the attribute or input param.\n   * @param name String: name of attribute or input param.\n   */\n  private getAttr(name: string, defaultValue?: ValueType): ValueType {\n    const value = this.node.rawAttrs[name];\n    if (value.tensor != null) {\n      return getTensor(name, this.tensorMap, this.context);\n    }\n    if (value.i != null || value.f != null) {\n      return getNumberParam(this.node.rawAttrs, name, defaultValue as number);\n    }\n    if (value.s != null) {\n      return getStringParam(this.node.rawAttrs, name, defaultValue as string);\n    }\n    if (value.b != null) {\n      return getBoolParam(this.node.rawAttrs, name, defaultValue as boolean);\n    }\n    if (value.shape != null) {\n      return getTensorShapeParam(\n          this.node.rawAttrs, name, defaultValue as number[]);\n    }\n    if (value.type != null) {\n      return getDtypeParam(this.node.rawAttrs, name, defaultValue as DataType);\n    }\n    if (value.list != null) {\n      if (value.list.i != null || value.list.f != null) {\n        return getNumericArrayParam(\n            this.node.rawAttrs, name, defaultValue as number[]);\n      }\n      if (value.list.s != null) {\n        return getStringArrayParam(\n            this.node.rawAttrs, name, defaultValue as string[]);\n      }\n      if (value.list.shape != null) {\n        return getTensorShapeArrayParam(\n            this.node.rawAttrs, name, defaultValue as number[][]);\n      }\n      if (value.list.b != null) {\n        return getBoolArrayParam(\n            this.node.rawAttrs, name, defaultValue as boolean[]);\n      }\n      if (value.list.type != null) {\n        return getDtypeArrayParam(\n            this.node.rawAttrs, name, defaultValue as DataType[]);\n      }\n    }\n\n    return defaultValue;\n  }\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Backend, DataToGPUOptions, GPUData, Tensor} from '../tensor';\nimport {DataId} from '../tensor_info';\nimport {BackendValues, DataType, WebGLData, WebGPUData} from '../types';\n\nexport const EPSILON_FLOAT32 = 1e-7;\nexport const EPSILON_FLOAT16 = 1e-4;\n\n// Required information for all backends.\nexport interface BackendTimingInfo {\n  kernelMs: number|{error: string};\n  getExtraProfileInfo?(): string;  // a field for additional timing information\n                                   // e.g. packing / unpacking for WebGL backend\n}\n\nexport interface TensorStorage {\n  read(dataId: DataId): Promise<BackendValues>;\n  readSync(dataId: DataId): BackendValues;\n  disposeData(dataId: DataId, force?: boolean): boolean;\n  write(values: BackendValues, shape: number[], dtype: DataType): DataId;\n  move(\n      dataId: DataId, values: BackendValues, shape: number[], dtype: DataType,\n      refCount: number): void;\n  memory(): {unreliable: boolean;};  // Backend-specific information.\n  /** Returns number of data ids currently in the storage. */\n  numDataIds(): number;\n  refCount(dataId: DataId): number;\n}\n\n/** Convenient class for storing tensor-related data. */\nexport class DataStorage<T> {\n  private data = new WeakMap<DataId, T>();\n  private dataIdsCount = 0;\n\n  constructor(private backend: KernelBackend, private dataMover: DataMover) {}\n\n  get(dataId: DataId) {\n    if (!this.data.has(dataId)) {\n      this.dataMover.moveData(this.backend, dataId);\n    }\n    return this.data.get(dataId);\n  }\n\n  set(dataId: DataId, value: T): void {\n    this.dataIdsCount++;\n    this.data.set(dataId, value);\n  }\n\n  has(dataId: DataId): boolean {\n    return this.data.has(dataId);\n  }\n\n  delete(dataId: DataId): boolean {\n    this.dataIdsCount--;\n    return this.data.delete(dataId);\n  }\n\n  numDataIds(): number {\n    return this.dataIdsCount;\n  }\n}\n\nexport interface DataMover {\n  /**\n   * To be called by backends whenever they see a dataId that they don't own.\n   * Upon calling this method, the mover will fetch the tensor from another\n   * backend and register it with the current active backend.\n   */\n  moveData(backend: KernelBackend, dataId: DataId): void;\n}\n\nexport interface BackendTimer {\n  // check if backend timer is available\n  timerAvailable(): boolean;\n  time(f: () => void): Promise<BackendTimingInfo>;\n}\n\n/**\n * The interface that defines the kernels that should be implemented when\n * adding a new backend. New backends don't need to implement every one of the\n * methods, this can be done gradually (throw an error for unimplemented\n * methods).\n */\nexport class KernelBackend implements TensorStorage, Backend, BackendTimer {\n  refCount(dataId: DataId): number {\n    return notYetImplemented('refCount');\n  }\n  incRef(dataId: DataId): void {\n    return notYetImplemented('incRef');\n  }\n  timerAvailable(): boolean {\n    return true;\n  }\n  time(f: () => void): Promise<BackendTimingInfo> {\n    return notYetImplemented('time');\n  }\n  read(dataId: object): Promise<BackendValues> {\n    return notYetImplemented('read');\n  }\n  readSync(dataId: object): BackendValues {\n    return notYetImplemented('readSync');\n  }\n  readToGPU(dataId: object, options?: DataToGPUOptions): GPUData {\n    return notYetImplemented('readToGPU');\n  }\n  numDataIds(): number {\n    return notYetImplemented('numDataIds');\n  }\n  disposeData(dataId: object, force?: boolean): boolean {\n    return notYetImplemented('disposeData');\n  }\n  write(values: BackendValues, shape: number[], dtype: DataType): DataId {\n    return notYetImplemented('write');\n  }\n  move(\n      dataId: DataId, values: BackendValues, shape: number[], dtype: DataType,\n      refCount: number): void {\n    return notYetImplemented('move');\n  }\n\n  createTensorFromGPUData(\n      values: WebGLData|WebGPUData, shape: number[], dtype: DataType): Tensor {\n    return notYetImplemented('createTensorFromGPUData');\n  }\n\n  memory(): {unreliable: boolean; reasons?: string[]} {\n    return notYetImplemented('memory');\n  }\n  /** Returns the highest precision for floats in bits (e.g. 16 or 32) */\n  floatPrecision(): 16|32 {\n    return notYetImplemented('floatPrecision');\n  }\n  /** Returns the smallest representable number.  */\n  epsilon(): number {\n    return this.floatPrecision() === 32 ? EPSILON_FLOAT32 : EPSILON_FLOAT16;\n  }\n  dispose(): void {\n    return notYetImplemented('dispose');\n  }\n}\n\nfunction notYetImplemented(kernelName: string): never {\n  throw new Error(\n      `'${kernelName}' not yet implemented or not found in the registry. ` +\n      `This kernel may not be supported by the tfjs backend you have chosen`);\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {BackendValues, DataType, DataTypeMap, FlatVector, NumericDataType, TensorLike, TypedArray, WebGLData, WebGPUData} from './types';\n\n/**\n * Shuffles the array in-place using Fisher-Yates algorithm.\n *\n * ```js\n * const a = [1, 2, 3, 4, 5];\n * tf.util.shuffle(a);\n * console.log(a);\n * ```\n *\n * @param array The array to shuffle in-place.\n *\n * @doc {heading: 'Util', namespace: 'util'}\n */\n// tslint:disable-next-line:no-any\nexport function shuffle(array: any[]|Uint32Array|Int32Array|\n                        Float32Array): void {\n  let counter = array.length;\n  let index = 0;\n  // While there are elements in the array\n  while (counter > 0) {\n    // Pick a random index\n    index = (Math.random() * counter) | 0;\n    // Decrease counter by 1\n    counter--;\n    // And swap the last element with it\n    swap(array, counter, index);\n  }\n}\n\n/**\n * Shuffles two arrays in-place the same way using Fisher-Yates algorithm.\n *\n * ```js\n * const a = [1,2,3,4,5];\n * const b = [11,22,33,44,55];\n * tf.util.shuffleCombo(a, b);\n * console.log(a, b);\n * ```\n *\n * @param array The first array to shuffle in-place.\n * @param array2 The second array to shuffle in-place with the same permutation\n *     as the first array.\n *\n * @doc {heading: 'Util', namespace: 'util'}\n */\nexport function shuffleCombo(\n    // tslint:disable-next-line:no-any\n    array: any[]|Uint32Array|Int32Array|Float32Array,\n    // tslint:disable-next-line:no-any\n    array2: any[]|Uint32Array|Int32Array|Float32Array): void {\n  if (array.length !== array2.length) {\n    throw new Error(\n        `Array sizes must match to be shuffled together ` +\n        `First array length was ${array.length}` +\n        `Second array length was ${array2.length}`);\n  }\n  let counter = array.length;\n  let index = 0;\n  // While there are elements in the array\n  while (counter > 0) {\n    // Pick a random index\n    index = (Math.random() * counter) | 0;\n    // Decrease counter by 1\n    counter--;\n    // And swap the last element of each array with it\n    swap(array, counter, index);\n    swap(array2, counter, index);\n  }\n}\n\n/** Clamps a value to a specified range. */\nexport function clamp(min: number, x: number, max: number): number {\n  return Math.max(min, Math.min(x, max));\n}\n\nexport function nearestLargerEven(val: number): number {\n  return val % 2 === 0 ? val : val + 1;\n}\n\nexport function swap<T>(\n    object: {[index: number]: T}, left: number, right: number) {\n  const temp = object[left];\n  object[left] = object[right];\n  object[right] = temp;\n}\n\nexport function sum(arr: number[]): number {\n  let sum = 0;\n  for (let i = 0; i < arr.length; i++) {\n    sum += arr[i];\n  }\n  return sum;\n}\n\n/**\n * Returns a sample from a uniform [a, b) distribution.\n *\n * @param a The minimum support (inclusive).\n * @param b The maximum support (exclusive).\n * @return A pseudorandom number on the half-open interval [a,b).\n */\nexport function randUniform(a: number, b: number) {\n  const r = Math.random();\n  return (b * r) + (1 - r) * a;\n}\n\n/** Returns the squared Euclidean distance between two vectors. */\nexport function distSquared(a: FlatVector, b: FlatVector): number {\n  let result = 0;\n  for (let i = 0; i < a.length; i++) {\n    const diff = Number(a[i]) - Number(b[i]);\n    result += diff * diff;\n  }\n  return result;\n}\n\n/**\n * Asserts that the expression is true. Otherwise throws an error with the\n * provided message.\n *\n * ```js\n * const x = 2;\n * tf.util.assert(x === 2, 'x is not 2');\n * ```\n *\n * @param expr The expression to assert (as a boolean).\n * @param msg A function that returns the message to report when throwing an\n *     error. We use a function for performance reasons.\n *\n * @doc {heading: 'Util', namespace: 'util'}\n */\nexport function assert(expr: boolean, msg: () => string) {\n  if (!expr) {\n    throw new Error(typeof msg === 'string' ? msg : msg());\n  }\n}\n\nexport function assertShapesMatch(\n    shapeA: number[], shapeB: number[], errorMessagePrefix = ''): void {\n  assert(\n      arraysEqual(shapeA, shapeB),\n      () => errorMessagePrefix + ` Shapes ${shapeA} and ${shapeB} must match`);\n}\n\nexport function assertNonNull(a: TensorLike): void {\n  assert(\n      a != null,\n      () => `The input to the tensor constructor must be a non-null value.`);\n}\n\n/**\n * Returns the size (number of elements) of the tensor given its shape.\n *\n * ```js\n * const shape = [3, 4, 2];\n * const size = tf.util.sizeFromShape(shape);\n * console.log(size);\n * ```\n *\n * @doc {heading: 'Util', namespace: 'util'}\n */\nexport function sizeFromShape(shape: number[]): number {\n  if (shape.length === 0) {\n    // Scalar.\n    return 1;\n  }\n  let size = shape[0];\n  for (let i = 1; i < shape.length; i++) {\n    size *= shape[i];\n  }\n  return size;\n}\n\nexport function isScalarShape(shape: number[]): boolean {\n  return shape.length === 0;\n}\n\nexport function arraysEqualWithNull(n1: number[], n2: number[]) {\n  if (n1 === n2) {\n    return true;\n  }\n\n  if (n1 == null || n2 == null) {\n    return false;\n  }\n\n  if (n1.length !== n2.length) {\n    return false;\n  }\n\n  for (let i = 0; i < n1.length; i++) {\n    if (n1[i] !== null && n2[i] !== null && n1[i] !== n2[i]) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport function arraysEqual(n1: FlatVector, n2: FlatVector) {\n  if (n1 === n2) {\n    return true;\n  }\n  if (n1 == null || n2 == null) {\n    return false;\n  }\n\n  if (n1.length !== n2.length) {\n    return false;\n  }\n  for (let i = 0; i < n1.length; i++) {\n    if (n1[i] !== n2[i]) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport function isInt(a: number): boolean {\n  return a % 1 === 0;\n}\n\nexport function tanh(x: number): number {\n  // tslint:disable-next-line:no-any\n  if ((Math as any).tanh != null) {\n    // tslint:disable-next-line:no-any\n    return (Math as any).tanh(x);\n  }\n  if (x === Infinity) {\n    return 1;\n  } else if (x === -Infinity) {\n    return -1;\n  } else {\n    const e2x = Math.exp(2 * x);\n    return (e2x - 1) / (e2x + 1);\n  }\n}\n\nexport function sizeToSquarishShape(size: number): [number, number] {\n  const width = Math.ceil(Math.sqrt(size));\n  return [width, Math.ceil(size / width)];\n}\n\n/**\n * Creates a new array with randomized indices to a given quantity.\n *\n * ```js\n * const randomTen = tf.util.createShuffledIndices(10);\n * console.log(randomTen);\n * ```\n *\n * @param number Quantity of how many shuffled indices to create.\n *\n * @doc {heading: 'Util', namespace: 'util'}\n */\nexport function createShuffledIndices(n: number): Uint32Array {\n  const shuffledIndices = new Uint32Array(n);\n  for (let i = 0; i < n; ++i) {\n    shuffledIndices[i] = i;\n  }\n  shuffle(shuffledIndices);\n  return shuffledIndices;\n}\n\nexport function rightPad(a: string, size: number): string {\n  if (size <= a.length) {\n    return a;\n  }\n  return a + ' '.repeat(size - a.length);\n}\n\nexport function repeatedTry(\n    checkFn: () => boolean, delayFn = (counter: number) => 0,\n    maxCounter?: number,\n    scheduleFn?: (functionRef: Function, delay: number) =>\n        void): Promise<void> {\n  return new Promise<void>((resolve, reject) => {\n    let tryCount = 0;\n\n    const tryFn = () => {\n      if (checkFn()) {\n        resolve();\n        return;\n      }\n\n      tryCount++;\n\n      const nextBackoff = delayFn(tryCount);\n\n      if (maxCounter != null && tryCount >= maxCounter) {\n        reject();\n        return;\n      }\n\n      if (scheduleFn != null) {\n        scheduleFn(tryFn, nextBackoff);\n      } else {\n        // google3 does not allow assigning another variable to setTimeout.\n        // Don't refactor this so scheduleFn has a default value of setTimeout.\n        setTimeout(tryFn, nextBackoff);\n      }\n    };\n\n    tryFn();\n  });\n}\n\n/**\n * Given the full size of the array and a shape that may contain -1 as the\n * implicit dimension, returns the inferred shape where -1 is replaced.\n * E.g. For shape=[2, -1, 3] and size=24, it will return [2, 4, 3].\n *\n * @param shape The shape, which may contain -1 in some dimension.\n * @param size The full size (number of elements) of the array.\n * @return The inferred shape where -1 is replaced with the inferred size.\n */\nexport function inferFromImplicitShape(\n    shape: number[], size: number): number[] {\n  let shapeProd = 1;\n  let implicitIdx = -1;\n\n  for (let i = 0; i < shape.length; ++i) {\n    if (shape[i] >= 0) {\n      shapeProd *= shape[i];\n    } else if (shape[i] === -1) {\n      if (implicitIdx !== -1) {\n        throw Error(\n            `Shapes can only have 1 implicit size. ` +\n            `Found -1 at dim ${implicitIdx} and dim ${i}`);\n      }\n      implicitIdx = i;\n    } else if (shape[i] < 0) {\n      throw Error(`Shapes can not be < 0. Found ${shape[i]} at dim ${i}`);\n    }\n  }\n\n  if (implicitIdx === -1) {\n    if (size > 0 && size !== shapeProd) {\n      throw Error(`Size(${size}) must match the product of shape ${shape}`);\n    }\n    return shape;\n  }\n\n  if (shapeProd === 0) {\n    throw Error(\n        `Cannot infer the missing size in [${shape}] when ` +\n        `there are 0 elements`);\n  }\n  if (size % shapeProd !== 0) {\n    throw Error(\n        `The implicit shape can't be a fractional number. ` +\n        `Got ${size} / ${shapeProd}`);\n  }\n\n  const newShape = shape.slice();\n  newShape[implicitIdx] = size / shapeProd;\n  return newShape;\n}\n\nexport function parseAxisParam(\n    axis: number|number[], shape: number[]): number[] {\n  const rank = shape.length;\n\n  // Normalize input\n  axis = axis == null ? shape.map((s, i) => i) : [].concat(axis);\n\n  // Check for valid range\n  assert(\n      axis.every(ax => ax >= -rank && ax < rank),\n      () =>\n          `All values in axis param must be in range [-${rank}, ${rank}) but ` +\n          `got axis ${axis}`);\n\n  // Check for only integers\n  assert(\n      axis.every(ax => isInt(ax)),\n      () => `All values in axis param must be integers but ` +\n          `got axis ${axis}`);\n\n  // Handle negative axis.\n  return axis.map(a => a < 0 ? rank + a : a);\n}\n\n/** Reduces the shape by removing all dimensions of shape 1. */\nexport function squeezeShape(shape: number[], axis?: number[]):\n    {newShape: number[], keptDims: number[]} {\n  const newShape: number[] = [];\n  const keptDims: number[] = [];\n  const isEmptyArray = axis != null && Array.isArray(axis) && axis.length === 0;\n  const axes = (axis == null || isEmptyArray) ?\n      null :\n      parseAxisParam(axis, shape).sort();\n  let j = 0;\n  for (let i = 0; i < shape.length; ++i) {\n    if (axes != null) {\n      if (axes[j] === i && shape[i] !== 1) {\n        throw new Error(\n            `Can't squeeze axis ${i} since its dim '${shape[i]}' is not 1`);\n      }\n      if ((axes[j] == null || axes[j] > i) && shape[i] === 1) {\n        newShape.push(shape[i]);\n        keptDims.push(i);\n      }\n      if (axes[j] <= i) {\n        j++;\n      }\n    }\n    if (shape[i] !== 1) {\n      newShape.push(shape[i]);\n      keptDims.push(i);\n    }\n  }\n  return {newShape, keptDims};\n}\n\nexport function getTypedArrayFromDType<D extends NumericDataType>(\n    dtype: D, size: number): DataTypeMap[D] {\n  return getArrayFromDType<D>(dtype, size);\n}\n\nexport function getArrayFromDType<D extends DataType>(\n    dtype: D, size: number): DataTypeMap[D] {\n  let values = null;\n  if (dtype == null || dtype === 'float32') {\n    values = new Float32Array(size);\n  } else if (dtype === 'int32') {\n    values = new Int32Array(size);\n  } else if (dtype === 'bool') {\n    values = new Uint8Array(size);\n  } else if (dtype === 'string') {\n    values = new Array<string>(size);\n  } else {\n    throw new Error(`Unknown data type ${dtype}`);\n  }\n  return values as DataTypeMap[D];\n}\n\nexport function checkConversionForErrors<D extends DataType>(\n    vals: DataTypeMap[D]|number[], dtype: D): void {\n  for (let i = 0; i < vals.length; i++) {\n    const num = vals[i] as number;\n    if (isNaN(num) || !isFinite(num)) {\n      throw Error(`A tensor of type ${dtype} being uploaded contains ${num}.`);\n    }\n  }\n}\n\n/** Returns true if the dtype is valid. */\nexport function isValidDtype(dtype: DataType): boolean {\n  return dtype === 'bool' || dtype === 'complex64' || dtype === 'float32' ||\n      dtype === 'int32' || dtype === 'string';\n}\n\n/**\n * Returns true if the new type can't encode the old type without loss of\n * precision.\n */\nexport function hasEncodingLoss(oldType: DataType, newType: DataType): boolean {\n  if (newType === 'complex64') {\n    return false;\n  }\n  if (newType === 'float32' && oldType !== 'complex64') {\n    return false;\n  }\n  if (newType === 'int32' && oldType !== 'float32' && oldType !== 'complex64') {\n    return false;\n  }\n  if (newType === 'bool' && oldType === 'bool') {\n    return false;\n  }\n  return true;\n}\n\nexport function bytesPerElement(dtype: DataType): number {\n  if (dtype === 'float32' || dtype === 'int32') {\n    return 4;\n  } else if (dtype === 'complex64') {\n    return 8;\n  } else if (dtype === 'bool') {\n    return 1;\n  } else {\n    throw new Error(`Unknown dtype ${dtype}`);\n  }\n}\n\n/**\n * Returns the approximate number of bytes allocated in the string array - 2\n * bytes per character. Computing the exact bytes for a native string in JS\n * is not possible since it depends on the encoding of the html page that\n * serves the website.\n */\nexport function bytesFromStringArray(arr: Uint8Array[]): number {\n  if (arr == null) {\n    return 0;\n  }\n  let bytes = 0;\n  arr.forEach(x => bytes += x.length);\n  return bytes;\n}\n\n/** Returns true if the value is a string. */\nexport function isString(value: {}): value is string {\n  return typeof value === 'string' || value instanceof String;\n}\n\nexport function isBoolean(value: {}): boolean {\n  return typeof value === 'boolean';\n}\n\nexport function isNumber(value: {}): boolean {\n  return typeof value === 'number';\n}\n\nexport function inferDtype(values: TensorLike|WebGLData|WebGPUData): DataType {\n  if (Array.isArray(values)) {\n    return inferDtype(values[0]);\n  }\n  if (values instanceof Float32Array) {\n    return 'float32';\n  } else if (\n      values instanceof Int32Array || values instanceof Uint8Array ||\n      values instanceof Uint8ClampedArray) {\n    return 'int32';\n  } else if (isNumber(values)) {\n    return 'float32';\n  } else if (isString(values)) {\n    return 'string';\n  } else if (isBoolean(values)) {\n    return 'bool';\n  }\n  return 'float32';\n}\n\nexport function isFunction(f: Function) {\n  return !!(f && f.constructor && f.call && f.apply);\n}\n\nexport function nearestDivisor(size: number, start: number): number {\n  for (let i = start; i < size; ++i) {\n    if (size % i === 0) {\n      return i;\n    }\n  }\n  return size;\n}\n\nexport function computeStrides(shape: number[]): number[] {\n  const rank = shape.length;\n  if (rank < 2) {\n    return [];\n  }\n\n  // Last dimension has implicit stride of 1, thus having D-1 (instead of D)\n  // strides.\n  const strides = new Array(rank - 1);\n  strides[rank - 2] = shape[rank - 1];\n  for (let i = rank - 3; i >= 0; --i) {\n    strides[i] = strides[i + 1] * shape[i + 1];\n  }\n  return strides;\n}\n\nfunction createNestedArray(\n    offset: number, shape: number[], a: TypedArray, isComplex = false) {\n  const ret = new Array();\n  if (shape.length === 1) {\n    const d = shape[0] * (isComplex ? 2 : 1);\n    for (let i = 0; i < d; i++) {\n      ret[i] = a[offset + i];\n    }\n  } else {\n    const d = shape[0];\n    const rest = shape.slice(1);\n    const len = rest.reduce((acc, c) => acc * c) * (isComplex ? 2 : 1);\n    for (let i = 0; i < d; i++) {\n      ret[i] = createNestedArray(offset + i * len, rest, a, isComplex);\n    }\n  }\n  return ret;\n}\n\n// Provide a nested array of TypedArray in given shape.\nexport function toNestedArray(\n    shape: number[], a: TypedArray, isComplex = false) {\n  if (shape.length === 0) {\n    // Scalar type should return a single number.\n    return a[0];\n  }\n  const size = shape.reduce((acc, c) => acc * c) * (isComplex ? 2 : 1);\n  if (size === 0) {\n    // A tensor with shape zero should be turned into empty list.\n    return [];\n  }\n  if (size !== a.length) {\n    throw new Error(`[${shape}] does not match the input size ${a.length}${\n        isComplex ? ' for a complex tensor' : ''}.`);\n  }\n\n  return createNestedArray(0, shape, a, isComplex);\n}\n\nexport function convertBackendValuesAndArrayBuffer(\n    data: BackendValues|ArrayBuffer, dtype: DataType) {\n  // If is type Uint8Array[], return it directly.\n  if (Array.isArray(data)) {\n    return data;\n  }\n  if (dtype === 'float32') {\n    return data instanceof Float32Array ? data : new Float32Array(data);\n  } else if (dtype === 'int32') {\n    return data instanceof Int32Array ? data : new Int32Array(data);\n  } else if (dtype === 'bool' || dtype === 'string') {\n    return Uint8Array.from(new Int32Array(data));\n  } else {\n    throw new Error(`Unknown dtype ${dtype}`);\n  }\n}\n\nexport function makeOnesTypedArray<D extends DataType>(\n    size: number, dtype: D): DataTypeMap[D] {\n  const array = makeZerosTypedArray(size, dtype);\n  for (let i = 0; i < array.length; i++) {\n    array[i] = 1;\n  }\n  return array;\n}\n\nexport function makeZerosTypedArray<D extends DataType>(\n    size: number, dtype: D): DataTypeMap[D] {\n  if (dtype == null || dtype === 'float32' || dtype === 'complex64') {\n    return new Float32Array(size) as DataTypeMap[D];\n  } else if (dtype === 'int32') {\n    return new Int32Array(size) as DataTypeMap[D];\n  } else if (dtype === 'bool') {\n    return new Uint8Array(size) as DataTypeMap[D];\n  } else {\n    throw new Error(`Unknown data type ${dtype}`);\n  }\n}\n\n/**\n * Make nested `TypedArray` filled with zeros.\n * @param shape The shape information for the nested array.\n * @param dtype dtype of the array element.\n */\nexport function makeZerosNestedTypedArray<D extends DataType>(\n    shape: number[], dtype: D) {\n  const size = shape.reduce((prev, curr) => prev * curr, 1);\n  if (dtype == null || dtype === 'float32') {\n    return toNestedArray(shape, new Float32Array(size));\n  } else if (dtype === 'int32') {\n    return toNestedArray(shape, new Int32Array(size));\n  } else if (dtype === 'bool') {\n    return toNestedArray(shape, new Uint8Array(size));\n  } else {\n    throw new Error(`Unknown data type ${dtype}`);\n  }\n}\n\nexport function assertNonNegativeIntegerDimensions(shape: number[]) {\n  shape.forEach(dimSize => {\n    assert(\n        Number.isInteger(dimSize) && dimSize >= 0,\n        () =>\n            `Tensor must have a shape comprised of positive integers but got ` +\n            `shape [${shape}].`);\n  });\n}\n\n/**\n * Computes flat index for a given location (multidimentionsal index) in a\n * Tensor/multidimensional array.\n *\n * @param locs Location in the tensor.\n * @param rank Rank of the tensor.\n * @param strides Tensor strides.\n */\nexport function locToIndex(\n    locs: number[], rank: number, strides: number[]): number {\n  if (rank === 0) {\n    return 0;\n  } else if (rank === 1) {\n    return locs[0];\n  }\n  let index = locs[locs.length - 1];\n  for (let i = 0; i < locs.length - 1; ++i) {\n    index += strides[i] * locs[i];\n  }\n  return index;\n}\n\n/**\n * Computes the location (multidimensional index) in a\n * tensor/multidimentional array for a given flat index.\n *\n * @param index Index in flat array.\n * @param rank Rank of tensor.\n * @param strides Strides of tensor.\n */\nexport function indexToLoc(\n    index: number, rank: number, strides: number[]): number[] {\n  if (rank === 0) {\n    return [];\n  } else if (rank === 1) {\n    return [index];\n  }\n  const locs: number[] = new Array(rank);\n  for (let i = 0; i < locs.length - 1; ++i) {\n    locs[i] = Math.floor(index / strides[i]);\n    index -= locs[i] * strides[i];\n  }\n  locs[locs.length - 1] = index;\n  return locs;\n}\n\n/**\n * This method asserts whether an object is a Promise instance.\n * @param object\n */\n// tslint:disable-next-line: no-any\nexport function isPromise(object: any): object is Promise<unknown> {\n  //  We chose to not use 'obj instanceOf Promise' for two reasons:\n  //  1. It only reliably works for es6 Promise, not other Promise\n  //  implementations.\n  //  2. It doesn't work with framework that uses zone.js. zone.js monkey\n  //  patch the async calls, so it is possible the obj (patched) is\n  //  comparing to a pre-patched Promise.\n  return object && object.then && typeof object.then === 'function';\n}\n", "/**\n * @license\n * Copyright 2017 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Platform} from './platforms/platform';\nimport {isPromise} from './util_base';\n\n// Expects flags from URL in the format ?tfjsflags=FLAG1:1,FLAG2:true.\nconst TENSORFLOWJS_FLAGS_PREFIX = 'tfjsflags';\n\ntype FlagValue = number|boolean|string;\ntype FlagEvaluationFn = (() => FlagValue)|(() => Promise<FlagValue>);\nexport type Flags = {\n  [featureName: string]: FlagValue\n};\nexport type FlagRegistryEntry = {\n  evaluationFn: FlagEvaluationFn;\n  setHook?: (value: FlagValue) => void;\n};\n\n/**\n * The environment contains evaluated flags as well as the registered platform.\n * This is always used as a global singleton and can be retrieved with\n * `tf.env()`.\n *\n * @doc {heading: 'Environment'}\n */\nexport class Environment {\n  private flags: Flags = {};\n  private flagRegistry: {[flagName: string]: FlagRegistryEntry} = {};\n\n  private urlFlags: Flags = {};\n\n  platformName: string;\n  platform: Platform;\n\n  // Jasmine spies on this in 'environment_test.ts'\n  getQueryParams = getQueryParams;\n\n  // tslint:disable-next-line: no-any\n  constructor(public global: any) {\n    this.populateURLFlags();\n  }\n\n  setPlatform(platformName: string, platform: Platform) {\n    if (this.platform != null) {\n      if (!(env().getBool('IS_TEST') || env().getBool('PROD'))) {\n        console.warn(\n            `Platform ${this.platformName} has already been set. ` +\n            `Overwriting the platform with ${platformName}.`);\n      }\n    }\n    this.platformName = platformName;\n    this.platform = platform;\n  }\n\n  registerFlag(\n      flagName: string, evaluationFn: FlagEvaluationFn,\n      setHook?: (value: FlagValue) => void) {\n    this.flagRegistry[flagName] = {evaluationFn, setHook};\n\n    // Override the flag value from the URL. This has to happen here because\n    // the environment is initialized before flags get registered.\n    if (this.urlFlags[flagName] != null) {\n      const flagValue = this.urlFlags[flagName];\n      if (!(env().getBool('IS_TEST') || env().getBool('PROD'))) {\n        console.warn(\n            `Setting feature override from URL ${flagName}: ${flagValue}.`);\n      }\n      this.set(flagName, flagValue);\n    }\n  }\n\n  async getAsync(flagName: string): Promise<FlagValue> {\n    if (flagName in this.flags) {\n      return this.flags[flagName];\n    }\n\n    this.flags[flagName] = await this.evaluateFlag(flagName);\n    return this.flags[flagName];\n  }\n\n  get(flagName: string): FlagValue {\n    if (flagName in this.flags) {\n      return this.flags[flagName];\n    }\n\n    const flagValue = this.evaluateFlag(flagName);\n    if (isPromise(flagValue)) {\n      throw new Error(\n          `Flag ${flagName} cannot be synchronously evaluated. ` +\n          `Please use getAsync() instead.`);\n    }\n\n    this.flags[flagName] = flagValue;\n    return this.flags[flagName];\n  }\n\n  getNumber(flagName: string): number {\n    return this.get(flagName) as number;\n  }\n\n  getBool(flagName: string): boolean {\n    return this.get(flagName) as boolean;\n  }\n\n  getString(flagName: string): string {\n    return this.get(flagName) as string;\n  }\n\n  getFlags(): Flags {\n    return this.flags;\n  }\n  // For backwards compatibility.\n  get features(): Flags {\n    return this.flags;\n  }\n\n  set(flagName: string, value: FlagValue): void {\n    if (this.flagRegistry[flagName] == null) {\n      throw new Error(\n          `Cannot set flag ${flagName} as it has not been registered.`);\n    }\n    this.flags[flagName] = value;\n    if (this.flagRegistry[flagName].setHook != null) {\n      this.flagRegistry[flagName].setHook(value);\n    }\n  }\n\n  private evaluateFlag(flagName: string): FlagValue|Promise<FlagValue> {\n    if (this.flagRegistry[flagName] == null) {\n      throw new Error(\n          `Cannot evaluate flag '${flagName}': no evaluation function found.`);\n    }\n    return this.flagRegistry[flagName].evaluationFn();\n  }\n\n  setFlags(flags: Flags) {\n    this.flags = Object.assign({}, flags);\n  }\n\n  reset() {\n    this.flags = {};\n    this.urlFlags = {};\n    this.populateURLFlags();\n  }\n\n  private populateURLFlags(): void {\n    if (typeof this.global === 'undefined' ||\n        typeof this.global.location === 'undefined' ||\n        typeof this.global.location.search === 'undefined') {\n      return;\n    }\n\n    const urlParams = this.getQueryParams(this.global.location.search);\n    if (TENSORFLOWJS_FLAGS_PREFIX in urlParams) {\n      const keyValues = urlParams[TENSORFLOWJS_FLAGS_PREFIX].split(',');\n      keyValues.forEach(keyValue => {\n        const [key, value] = keyValue.split(':') as [string, string];\n        this.urlFlags[key] = parseValue(key, value);\n      });\n    }\n  }\n}\n\nexport function getQueryParams(queryString: string): {[key: string]: string} {\n  const params = {};\n  queryString.replace(/[?&]([^=?&]+)(?:=([^&]*))?/g, (s, ...t) => {\n    decodeParam(params, t[0], t[1]);\n    return t.join('=');\n  });\n  return params;\n}\n\nfunction decodeParam(\n    params: {[key: string]: string}, name: string, value?: string) {\n  params[decodeURIComponent(name)] = decodeURIComponent(value || '');\n}\n\nfunction parseValue(flagName: string, value: string): FlagValue {\n  const lowerCaseValue = value.toLowerCase();\n  if (lowerCaseValue === 'true' || lowerCaseValue === 'false') {\n    return lowerCaseValue === 'true';\n  } else if (`${+ lowerCaseValue}` === lowerCaseValue) {\n    return +lowerCaseValue;\n  } else {\n    return value;\n  }\n}\n\n/**\n * Returns the current environment (a global singleton).\n *\n * The environment object contains the evaluated feature values as well as the\n * active platform.\n *\n * @doc {heading: 'Environment'}\n */\nexport function env() {\n  return ENV;\n}\n\nexport let ENV: Environment = null;\nexport function setEnvironmentGlobal(environment: Environment) {\n  ENV = environment;\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n// Note that the identifier globalNameSpace is scoped to this module, but will\n// always resolve to the same global object regardless of how the module is\n// resolved.\n// tslint:disable-next-line:no-any\nlet globalNameSpace: {_tfGlobals: Map<string, any>};\n// tslint:disable-next-line:no-any\nexport function getGlobalNamespace(): {_tfGlobals: Map<string, any>} {\n  if (globalNameSpace == null) {\n    // tslint:disable-next-line:no-any\n    let ns: any;\n    if (typeof (window) !== 'undefined') {\n      ns = window;\n    } else if (typeof (global) !== 'undefined') {\n      ns = global;\n    } else if (typeof (process) !== 'undefined') {\n      ns = process;\n    } else if (typeof (self) !== 'undefined') {\n      ns = self;\n    } else {\n      throw new Error('Could not find a global object');\n    }\n    globalNameSpace = ns;\n  }\n  return globalNameSpace;\n}\n\n// tslint:disable-next-line:no-any\nfunction getGlobalMap(): Map<string, any> {\n  const ns = getGlobalNamespace();\n  if (ns._tfGlobals == null) {\n    ns._tfGlobals = new Map();\n  }\n  return ns._tfGlobals;\n}\n\n/**\n * Returns a globally accessible 'singleton' object.\n *\n * @param key the name of the object\n * @param init a function to initialize to initialize this object\n *             the first time it is fetched.\n */\nexport function getGlobal<T>(key: string, init: () => T): T {\n  const globalMap = getGlobalMap();\n  if (globalMap.has(key)) {\n    return globalMap.get(key);\n  } else {\n    const singleton = init();\n    globalMap.set(key, singleton);\n    return globalMap.get(key);\n  }\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n// Allow UpperCamelCase variable names\n// tslint:disable: variable-name\n// Unfortunately just enabling PascalCase per file (tslint:enable:\n// allow-pascal-case) doesn't work.\nimport {NamedTensorInfoMap} from './kernel_registry';\nimport {ExplicitPadding} from './ops/conv_util';\nimport {Activation} from './ops/fused_types';\nimport {TensorInfo} from './tensor_info';\nimport {DataType, DrawOptions, PixelData} from './types';\n\nexport const Abs = 'Abs';\nexport type AbsInputs = UnaryInputs;\n\nexport const Acos = 'Acos';\nexport type AcosInputs = UnaryInputs;\n\nexport const Acosh = 'Acosh';\nexport type AcoshInputs = UnaryInputs;\n\nexport const Add = 'Add';\nexport type AddInputs = BinaryInputs;\n\nexport const AddN = 'AddN';\nexport type AddNInputs = TensorInfo[];\n\nexport const All = 'All';\nexport type AllInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface AllAttrs {\n  axis: number|number[];\n  keepDims: boolean;\n}\n\nexport const Any = 'Any';\nexport type AnyInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface AnyAttrs {\n  axis: number|number[];\n  keepDims: boolean;\n}\n\nexport const ArgMax = 'ArgMax';\nexport type ArgMaxInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface ArgMaxAttrs {\n  axis: number;\n}\n\nexport const ArgMin = 'ArgMin';\nexport type ArgMinInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface ArgMinAttrs {\n  axis: number;\n}\n\nexport const Asin = 'Asin';\nexport type AsinInputs = UnaryInputs;\n\nexport const Asinh = 'Asinh';\nexport type AsinhInputs = UnaryInputs;\n\nexport const Atan = 'Atan';\nexport type AtanInputs = UnaryInputs;\n\nexport const Atanh = 'Atanh';\nexport type AtanhInputs = UnaryInputs;\n\nexport const Atan2 = 'Atan2';\nexport type Atan2Inputs = BinaryInputs;\n\nexport const AvgPool = 'AvgPool';\nexport type AvgPoolInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface AvgPoolAttrs {\n  filterSize: [number, number]|number;\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n}\n\nexport const AvgPoolGrad = 'AvgPoolGrad';\nexport type AvgPoolGradInputs = Pick<NamedTensorInfoMap, 'dy'|'input'>;\nexport interface AvgPoolGradAttrs {\n  filterSize: [number, number]|number;\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n}\n\nexport const AvgPool3D = 'AvgPool3D';\nexport type AvgPool3DInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface AvgPool3DAttrs {\n  filterSize: [number, number, number]|number;\n  strides: [number, number, number]|number;\n  pad: 'valid'|'same'|number;\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n  dataFormat: 'NDHWC'|'NCDHW';\n}\n\nexport const AvgPool3DGrad = 'AvgPool3DGrad';\nexport type AvgPool3DGradInputs = Pick<NamedTensorInfoMap, 'dy'|'input'>;\nexport interface AvgPool3DGradAttrs {\n  filterSize: [number, number, number]|number;\n  strides: [number, number, number]|number;\n  pad: 'valid'|'same'|number;\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n}\n\nexport const BatchMatMul = 'BatchMatMul';\nexport type BatchMatMulInputs = Pick<NamedTensorInfoMap, 'a'|'b'>;\nexport interface BatchMatMulAttrs {\n  transposeA: boolean;\n  transposeB: boolean;\n}\n\nexport const BatchToSpaceND = 'BatchToSpaceND';\nexport type BatchToSpaceNDInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface BatchToSpaceNDAttrs {\n  blockShape: number[];\n  crops: number[][];\n}\n\nexport type BinaryInputs = Pick<NamedTensorInfoMap, 'a'|'b'>;\n\nexport const Bincount = 'Bincount';\nexport type BincountInputs = Pick<NamedTensorInfoMap, 'x'|'weights'>;\nexport interface BincountAttrs {\n  size: number;\n}\n\nexport const BitwiseAnd = 'BitwiseAnd';\nexport type BitwiseAndInputs = BinaryInputs;\n\nexport const BroadcastTo = 'BroadcastTo';\nexport type BroadcastToInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface BroadCastToAttrs {\n  shape: number[];\n  inputShape: number[];  // for gradient\n}\n\nexport const BroadcastArgs = 'BroadcastArgs';\nexport type BroadcastArgsInputs = Pick<NamedTensorInfoMap, 's0'|'s1'>;\n\nexport const Cast = 'Cast';\nexport type CastInputs = UnaryInputs;\nexport interface CastAttrs {\n  dtype: DataType;\n}\n\nexport const Ceil = 'Ceil';\nexport type CeilInputs = UnaryInputs;\n\nexport const ClipByValue = 'ClipByValue';\nexport type ClipByValueInputs = UnaryInputs;\nexport interface ClipByValueAttrs {\n  clipValueMin: number;\n  clipValueMax: number;\n}\n\nexport const Complex = 'Complex';\nexport type ComplexInputs = Pick<NamedTensorInfoMap, 'real'|'imag'>;\n\nexport const ComplexAbs = 'ComplexAbs';\nexport type ComplexAbsInputs = UnaryInputs;\n\nexport const Concat = 'Concat';\nexport type ConcatInputs = TensorInfo[];\nexport interface ConcatAttrs {\n  axis: number;\n}\n\nexport const Conv2D = 'Conv2D';\nexport type Conv2DInputs = Pick<NamedTensorInfoMap, 'x'|'filter'>;\nexport interface Conv2DAttrs {\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dataFormat: 'NHWC'|'NCHW';\n  dilations: [number, number]|number;\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n}\n\nexport const Conv2DBackpropFilter = 'Conv2DBackpropFilter';\nexport type Conv2DBackpropFilterInputs = Pick<NamedTensorInfoMap, 'x'|'dy'>;\nexport interface Conv2DBackpropFilterAttrs {\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dataFormat: 'NHWC'|'NCHW';\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n  filterShape: [number, number, number, number];\n}\n\nexport const Conv2DBackpropInput = 'Conv2DBackpropInput';\nexport type Conv2DBackpropInputInputs = Pick<NamedTensorInfoMap, 'dy'|'filter'>;\nexport interface Conv2DBackpropInputAttrs {\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dataFormat: 'NHWC'|'NCHW';\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n  inputShape: [number, number, number, number];\n}\n\nexport const Conv3D = 'Conv3D';\nexport type Conv3DInputs = Pick<NamedTensorInfoMap, 'x'|'filter'>;\nexport interface Conv3DAttrs {\n  strides: [number, number, number]|number;\n  pad: 'valid'|'same';\n  dataFormat: 'NDHWC'|'NCDHW';\n  dilations: [number, number, number]|number;\n}\n\nexport const Conv3DBackpropFilterV2 = 'Conv3DBackpropFilterV2';\nexport type Conv3DBackpropFilterV2Inputs = Pick<NamedTensorInfoMap, 'x'|'dy'>;\n\nexport interface Conv3DBackpropFilterV2Attrs {\n  strides: [number, number, number]|number;\n  pad: 'valid'|'same';\n  filterShape: [number, number, number, number, number];\n}\n\nexport const Conv3DBackpropInputV2 = 'Conv3DBackpropInputV2';\nexport type Conv3DBackpropInputV2Inputs =\n    Pick<NamedTensorInfoMap, 'dy'|'filter'>;\nexport interface Conv3DBackpropInputV2Attrs {\n  strides: [number, number, number]|number;\n  pad: 'valid'|'same';\n  inputShape: [number, number, number, number, number];\n}\n\nexport const Cos = 'Cos';\nexport type CosInputs = UnaryInputs;\n\nexport const Cosh = 'Cosh';\nexport type CoshInputs = UnaryInputs;\n\nexport const Cumprod = 'Cumprod';\nexport type CumprodInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface CumprodAttrs {\n  axis: number;\n  exclusive: boolean;\n  reverse: boolean;\n}\n\nexport const Cumsum = 'Cumsum';\nexport type CumsumInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface CumsumAttrs {\n  axis: number;\n  exclusive: boolean;\n  reverse: boolean;\n}\n\nexport const CropAndResize = 'CropAndResize';\nexport type CropAndResizeInputs =\n    Pick<NamedTensorInfoMap, 'image'|'boxes'|'boxInd'>;\nexport interface CropAndResizeAttrs {\n  cropSize: [number, number];\n  method: 'bilinear'|'nearest';\n  extrapolationValue: number;\n}\n\nexport const DenseBincount = 'DenseBincount';\nexport type DenseBincountInputs = Pick<NamedTensorInfoMap, 'x'|'weights'>;\nexport interface DenseBincountAttrs {\n  size: number;\n  binaryOutput?: boolean;\n}\n\nexport const DepthToSpace = 'DepthToSpace';\nexport type DepthToSpaceInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface DepthToSpaceAttrs {\n  blockSize: number;\n  dataFormat: 'NHWC'|'NCHW';\n}\n\nexport const DepthwiseConv2dNative = 'DepthwiseConv2dNative';\nexport type DepthwiseConv2dNativeInputs =\n    Pick<NamedTensorInfoMap, 'x'|'filter'>;\nexport interface DepthwiseConv2dNativeAttrs {\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dataFormat: 'NHWC'|'NCHW';\n  dilations: [number, number]|number;\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n}\n\nexport const DepthwiseConv2dNativeBackpropFilter =\n    'DepthwiseConv2dNativeBackpropFilter';\nexport type DepthwiseConv2dNativeBackpropFilterInputs =\n    Pick<NamedTensorInfoMap, 'x'|'dy'>;\nexport interface DepthwiseConv2dNativeBackpropFilterAttrs {\n  strides: [number, number]|number;\n  dilations: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n  filterShape: [number, number, number, number];\n}\n\nexport const DepthwiseConv2dNativeBackpropInput =\n    'DepthwiseConv2dNativeBackpropInput';\nexport type DepthwiseConv2dNativeBackpropInputInputs =\n    Pick<NamedTensorInfoMap, 'dy'|'filter'>;\nexport interface DepthwiseConv2dNativeBackpropInputAttrs {\n  strides: [number, number]|number;\n  dilations: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n  inputShape: [number, number, number, number];\n}\n\nexport const Diag = 'Diag';\nexport type DiagInputs = Pick<NamedTensorInfoMap, 'x'>;\n\nexport const Dilation2D = 'Dilation2D';\nexport type Dilation2DInputs = Pick<NamedTensorInfoMap, 'x'|'filter'>;\nexport interface Dilation2DAttrs {\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number;\n  dilations: [number, number]|number;\n}\n\nexport const Dilation2DBackpropInput = 'Dilation2DBackpropInput';\nexport type Dilation2DBackpropInputInputs =\n    Pick<NamedTensorInfoMap, 'x'|'filter'|'dy'>;\n\nexport const Dilation2DBackpropFilter = 'Dilation2DBackpropFilter';\nexport type Dilation2DBackpropFilterInputs =\n    Pick<NamedTensorInfoMap, 'x'|'filter'|'dy'>;\n\nexport const Draw = 'Draw';\nexport type DrawInputs = Pick<NamedTensorInfoMap, 'image'>;\nexport interface DrawAttrs {\n  canvas: HTMLCanvasElement;\n  options?: DrawOptions;\n}\n\nexport const RealDiv = 'RealDiv';\nexport type RealDivInputs = BinaryInputs;\n\nexport const Einsum = 'Einsum';\nexport type EinsumInputs = TensorInfo[];\nexport interface EinsumAttrs {\n  equation: string;\n}\n\nexport const Elu = 'Elu';\nexport type EluInputs = Pick<NamedTensorInfoMap, 'x'>;\n\nexport const EluGrad = 'EluGrad';\nexport type EluGradInputs = Pick<NamedTensorInfoMap, 'dy'|'y'>;\n\nexport const Erf = 'Erf';\nexport type ErfInputs = UnaryInputs;\n\nexport const Equal = 'Equal';\nexport type EqualInputs = BinaryInputs;\n\nexport const Exp = 'Exp';\nexport type ExpInputs = UnaryInputs;\n\nexport const ExpandDims = 'ExpandDims';\nexport type ExpandDimsInputs = Pick<NamedTensorInfoMap, 'input'>;\nexport interface ExpandDimsAttrs {\n  dim: number;\n}\n\nexport const Expm1 = 'Expm1';\nexport type Expm1Inputs = UnaryInputs;\n\nexport const FFT = 'FFT';\nexport type FFTInputs = Pick<NamedTensorInfoMap, 'input'>;\n\nexport const Fill = 'Fill';\nexport interface FillAttrs {\n  shape: number[];\n  value: number|string;\n  dtype: DataType;\n}\n\nexport const FlipLeftRight = 'FlipLeftRight';\nexport type FlipLeftRightInputs = Pick<NamedTensorInfoMap, 'image'>;\n\nexport const Floor = 'Floor';\nexport type FloorInputs = UnaryInputs;\n\nexport const FloorDiv = 'FloorDiv';\nexport type FloorDivInputs = BinaryInputs;\n\nexport const FusedBatchNorm = 'FusedBatchNorm';\nexport type FusedBatchNormInputs =\n    Pick<NamedTensorInfoMap, 'x'|'scale'|'offset'|'mean'|'variance'>;\nexport interface FusedBatchNormAttrs {\n  varianceEpsilon: number;\n}\n\nexport const GatherV2 = 'GatherV2';\nexport type GatherV2Inputs = Pick<NamedTensorInfoMap, 'x'|'indices'>;\nexport interface GatherV2Attrs {\n  axis: number;\n  batchDims: number;\n}\n\nexport const GatherNd = 'GatherNd';\nexport type GatherNdInputs = Pick<NamedTensorInfoMap, 'params'|'indices'>;\n\nexport const Greater = 'Greater';\nexport type GreaterInputs = BinaryInputs;\n\nexport const GreaterEqual = 'GreaterEqual';\nexport type GreaterEqualInputs = BinaryInputs;\n\nexport const Identity = 'Identity';\nexport type IdentityInputs = Pick<NamedTensorInfoMap, 'x'>;\n\nexport const IFFT = 'IFFT';\nexport type IFFTInputs = Pick<NamedTensorInfoMap, 'input'>;\n\nexport const Imag = 'Imag';\nexport type ImagInputs = Pick<NamedTensorInfoMap, 'input'>;\n\nexport const IsFinite = 'IsFinite';\nexport type IsFiniteInputs = UnaryInputs;\n\nexport const IsInf = 'IsInf';\nexport type IsInfInputs = UnaryInputs;\n\nexport const IsNan = 'IsNan';\nexport type IsNanInputs = UnaryInputs;\n\nexport const LeakyRelu = 'LeakyRelu';\nexport type LeakyReluInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface LeakyReluAttrs {\n  alpha: number;\n}\n\nexport const Less = 'Less';\nexport type LessInputs = BinaryInputs;\n\nexport const LessEqual = 'LessEqual';\nexport type LessEqualInputs = BinaryInputs;\n\nexport const LinSpace = 'LinSpace';\nexport interface LinSpaceAttrs {\n  start: number;\n  stop: number;\n  num: number;\n}\nexport const Log = 'Log';\nexport type LogInputs = UnaryInputs;\n\nexport const Log1p = 'Log1p';\nexport type Log1pInputs = UnaryInputs;\n\nexport const LogicalAnd = 'LogicalAnd';\nexport type LogicalAndInputs = BinaryInputs;\n\nexport const LogicalNot = 'LogicalNot';\nexport type LogicalNotInputs = Pick<NamedTensorInfoMap, 'x'>;\n\nexport const LogicalOr = 'LogicalOr';\nexport type LogicalOrInputs = BinaryInputs;\n\nexport const LogicalXor = 'LogicalXor';\nexport type LogicalXorInputs = BinaryInputs;\n\nexport const LogSoftmax = 'LogSoftmax';\nexport type LogSoftmaxInputs = Pick<NamedTensorInfoMap, 'logits'>;\nexport interface LogSoftmaxAttrs {\n  axis: number;\n}\n\nexport const LowerBound = 'LowerBound';\nexport type LowerBoundInputs =\n    Pick<NamedTensorInfoMap, 'sortedSequence'|'values'>;\n\nexport const LRN = 'LRN';\nexport type LRNInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface LRNAttrs {\n  depthRadius: number;\n  bias: number;\n  alpha: number;\n  beta: number;\n}\n\nexport const LRNGrad = 'LRNGrad';\nexport type LRNGradInputs = Pick<NamedTensorInfoMap, 'x'|'y'|'dy'>;\nexport interface LRNGradAttrs {\n  depthRadius: number;\n  bias: number;\n  alpha: number;\n  beta: number;\n}\n\nexport const MatrixBandPart = 'MatrixBandPart';\nexport type MatrixBandPartInputs =\n    Pick<NamedTensorInfoMap, 'input'|'numLower'|'numUpper'>;\nexport interface MatrixBandPartAttrs {}\n\nexport const Max = 'Max';\nexport type MaxInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface MaxAttrs {\n  reductionIndices: number|number[];\n  keepDims: boolean;\n}\n\nexport const Maximum = 'Maximum';\nexport type MaximumInputs = BinaryInputs;\n\nexport const MaxPool = 'MaxPool';\nexport type MaxPoolInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface MaxPoolAttrs {\n  filterSize: [number, number]|number;\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n}\n\nexport const MaxPoolGrad = 'MaxPoolGrad';\nexport type MaxPoolGradInputs = Pick<NamedTensorInfoMap, 'dy'|'input'|'output'>;\nexport interface MaxPoolGradAttrs {\n  filterSize: [number, number]|number;\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n}\n\nexport const MaxPool3D = 'MaxPool3D';\nexport type MaxPool3DInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface MaxPool3DAttrs {\n  filterSize: [number, number, number]|number;\n  strides: [number, number, number]|number;\n  pad: 'valid'|'same'|number;\n  dataFormat: 'NDHWC'|'NCDHW';\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n}\n\nexport const MaxPool3DGrad = 'MaxPool3DGrad';\nexport type MaxPool3DGradInputs =\n    Pick<NamedTensorInfoMap, 'dy'|'input'|'output'>;\nexport interface MaxPool3DGradAttrs {\n  filterSize: [number, number, number]|number;\n  strides: [number, number, number]|number;\n  pad: 'valid'|'same'|number;\n  dimRoundingMode?: 'floor'|'round'|'ceil';\n}\n\nexport const MaxPoolWithArgmax = 'MaxPoolWithArgmax';\nexport type MaxPoolWithArgmaxInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface MaxPoolWithArgmaxAttrs {\n  filterSize: [number, number]|number;\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number;\n  includeBatchInIndex: boolean;\n}\n\nexport const Mean = 'Mean';\nexport type MeanInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface MeanAttrs {\n  axis: number|number[];\n  keepDims: boolean;\n}\n\nexport const Min = 'Min';\nexport type MinInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface MinAttrs {\n  axis: number|number[];\n  keepDims: boolean;\n}\n\nexport const Minimum = 'Minimum';\nexport type MinimumInputs = BinaryInputs;\n\nexport const MirrorPad = 'MirrorPad';\nexport type MirrorPadInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface MirrorPadAttrs {\n  paddings: Array<[number, number]>;\n  mode: 'reflect'|'symmetric';\n}\n\nexport const Mod = 'Mod';\nexport type ModInputs = BinaryInputs;\n\nexport const Multinomial = 'Multinomial';\nexport type MultinomialInputs = Pick<NamedTensorInfoMap, 'logits'>;\nexport interface MultinomialAttrs {\n  numSamples: number;\n  seed: number;\n  normalized: boolean;\n}\n\nexport const Multiply = 'Multiply';\nexport type MultiplyInputs = BinaryInputs;\n\nexport const Neg = 'Neg';\nexport type NegInputs = UnaryInputs;\n\nexport const NotEqual = 'NotEqual';\nexport type NotEqualInputs = BinaryInputs;\n\nexport const NonMaxSuppressionV3 = 'NonMaxSuppressionV3';\nexport type NonMaxSuppressionV3Inputs =\n    Pick<NamedTensorInfoMap, 'boxes'|'scores'>;\nexport interface NonMaxSuppressionV3Attrs {\n  maxOutputSize: number;\n  iouThreshold: number;\n  scoreThreshold: number;\n}\n\nexport const NonMaxSuppressionV4 = 'NonMaxSuppressionV4';\nexport type NonMaxSuppressionV4Inputs =\n    Pick<NamedTensorInfoMap, 'boxes'|'scores'>;\nexport interface NonMaxSuppressionV4Attrs {\n  maxOutputSize: number;\n  iouThreshold: number;\n  scoreThreshold: number;\n  padToMaxOutputSize: boolean;\n}\n\nexport const NonMaxSuppressionV5 = 'NonMaxSuppressionV5';\nexport type NonMaxSuppressionV5Inputs =\n    Pick<NamedTensorInfoMap, 'boxes'|'scores'>;\nexport interface NonMaxSuppressionV5Attrs {\n  maxOutputSize: number;\n  iouThreshold: number;\n  scoreThreshold: number;\n  softNmsSigma: number;\n}\n\nexport const OnesLike = 'OnesLike';\nexport type OnesLikeInputs = UnaryInputs;\n\nexport const OneHot = 'OneHot';\nexport type OneHotInputs = Pick<NamedTensorInfoMap, 'indices'>;\nexport interface OneHotAttrs {\n  depth: number;\n  onValue: number;\n  offValue: number;\n  dtype: DataType;\n}\n\nexport const Pack = 'Pack';\nexport type PackInputs = TensorInfo[];\nexport interface PackAttrs {\n  axis: number;\n}\n\nexport const PadV2 = 'PadV2';\nexport type PadV2Inputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface PadV2Attrs {\n  paddings: Array<[number, number]>;\n  constantValue: number;\n}\n\nexport const Pool = 'Pool';\nexport type PoolInputs = Pick<NamedTensorInfoMap, 'input'>;\n\nexport const Pow = 'Pow';\nexport type PowInputs = BinaryInputs;\n\nexport const Prelu = 'Prelu';\nexport type PreluInputs = Pick<NamedTensorInfoMap, 'x'|'alpha'>;\n\nexport const Prod = 'Prod';\nexport type ProdInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface ProdAttrs {\n  axis: number|number[];\n  keepDims: boolean;\n}\n\nexport const RaggedGather = 'RaggedGather';\nexport type RaggedGatherInputs = {\n  paramsNestedSplits: TensorInfo[]\n}&Pick<NamedTensorInfoMap, 'paramsDenseValues'|'indices'>;\nexport interface RaggedGatherAttrs {\n  outputRaggedRank: number;\n}\n\nexport const RaggedRange = 'RaggedRange';\nexport type RaggedRangeInputs =\n    Pick<NamedTensorInfoMap, 'starts'|'limits'|'deltas'>;\n\nexport const RaggedTensorToTensor = 'RaggedTensorToTensor';\nexport type RaggedTensorToTensorInputs =\n    Pick<NamedTensorInfoMap, 'shape'|'values'|'defaultValue'>&\n    {rowPartitionTensors: TensorInfo[]};\nexport interface RaggedTensorToTensorAttrs {\n  rowPartitionTypes: string[];\n}\n\nexport const Range = 'Range';\nexport interface RangeAttrs {\n  start: number;\n  stop: number;\n  step: number;\n  dtype: 'float32'|'int32';\n}\n\nexport const Real = 'Real';\nexport type RealInputs = Pick<NamedTensorInfoMap, 'input'>;\n\nexport const Reciprocal = 'Reciprocal';\nexport type ReciprocalInputs = UnaryInputs;\n\nexport const Relu = 'Relu';\nexport type ReluInputs = Pick<NamedTensorInfoMap, 'x'>;\n\nexport const Reshape = 'Reshape';\nexport type ReshapeInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface ReshapeAttrs {\n  shape: number[];\n}\n\nexport const ResizeNearestNeighbor = 'ResizeNearestNeighbor';\nexport type ResizeNearestNeighborInputs = Pick<NamedTensorInfoMap, 'images'>;\nexport interface ResizeNearestNeighborAttrs {\n  alignCorners: boolean;\n  halfPixelCenters: boolean;\n  size: [number, number];\n}\n\nexport const ResizeNearestNeighborGrad = 'ResizeNearestNeighborGrad';\nexport type ResizeNearestNeighborGradInputs =\n    Pick<NamedTensorInfoMap, 'images'|'dy'>;\nexport type ResizeNearestNeighborGradAttrs = ResizeNearestNeighborAttrs;\n\nexport const ResizeBilinear = 'ResizeBilinear';\nexport type ResizeBilinearInputs = Pick<NamedTensorInfoMap, 'images'>;\nexport interface ResizeBilinearAttrs {\n  alignCorners: boolean;\n  halfPixelCenters: boolean;\n  size: [number, number];\n}\n\nexport const ResizeBilinearGrad = 'ResizeBilinearGrad';\nexport type ResizeBilinearGradInputs = Pick<NamedTensorInfoMap, 'images'|'dy'>;\nexport type ResizeBilinearGradAttrs = ResizeBilinearAttrs;\n\nexport const Relu6 = 'Relu6';\nexport type Relu6Inputs = Pick<NamedTensorInfoMap, 'x'>;\n\nexport const Reverse = 'Reverse';\nexport type ReverseInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface ReverseAttrs {\n  dims: number|number[];\n}\n\nexport const Round = 'Round';\nexport type RoundInputs = UnaryInputs;\n\nexport const Rsqrt = 'Rsqrt';\nexport type RsqrtInputs = UnaryInputs;\n\nexport const ScatterNd = 'ScatterNd';\nexport type ScatterNdInputs = Pick<NamedTensorInfoMap, 'indices'|'updates'>;\nexport interface ScatterNdAttrs {\n  shape: number[];\n}\n\nexport const TensorScatterUpdate = 'TensorScatterUpdate';\nexport type TensorScatterUpdateInputs =\n    Pick<NamedTensorInfoMap, 'tensor'|'indices'|'updates'>;\nexport interface TensorScatterUpdateAttrs {}\n\nexport const SearchSorted = 'SearchSorted';\nexport type SearchSortedInputs =\n    Pick<NamedTensorInfoMap, 'sortedSequence'|'values'>;\nexport interface SearchSortedAttrs {\n  side: 'left'|'right';\n}\n\nexport const Select = 'Select';\nexport type SelectInputs = Pick<NamedTensorInfoMap, 'condition'|'t'|'e'>;\n\nexport const Selu = 'Selu';\nexport type SeluInputs = Pick<NamedTensorInfoMap, 'x'>;\n\nexport const Slice = 'Slice';\nexport type SliceInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface SliceAttrs {\n  begin: number|number[];\n  size: number|number[];\n}\nexport const Sin = 'Sin';\nexport type SinInputs = UnaryInputs;\n\nexport const Sinh = 'Sinh';\nexport type SinhInputs = UnaryInputs;\n\nexport const Sign = 'Sign';\nexport type SignInputs = UnaryInputs;\n\nexport const Sigmoid = 'Sigmoid';\nexport type SigmoidInputs = UnaryInputs;\n\nexport const Softplus = 'Softplus';\nexport type SoftplusInputs = UnaryInputs;\n\nexport const Sqrt = 'Sqrt';\nexport type SqrtInputs = UnaryInputs;\n\nexport const Sum = 'Sum';\nexport type SumInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface SumAttrs {\n  axis: number|number[];\n  keepDims: boolean;\n}\n\nexport const SpaceToBatchND = 'SpaceToBatchND';\nexport type SpaceToBatchNDInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface SpaceToBatchNDAttrs {\n  blockShape: number[];\n  paddings: number[][];\n}\n\nexport const SplitV = 'SplitV';\nexport type SplitVInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface SplitVAttrs {\n  numOrSizeSplits: number[]|number;\n  axis: number;\n}\n\nexport const Softmax = 'Softmax';\nexport type SoftmaxInputs = Pick<NamedTensorInfoMap, 'logits'>;\nexport interface SoftmaxAttrs {\n  dim: number;\n}\n\nexport const SparseFillEmptyRows = 'SparseFillEmptyRows';\nexport type SparseFillEmptyRowsInputs =\n    Pick<NamedTensorInfoMap, 'indices'|'values'|'denseShape'|'defaultValue'>;\n\nexport const SparseReshape = 'SparseReshape';\nexport type SparseReshapeInputs =\n    Pick<NamedTensorInfoMap, 'inputIndices'|'inputShape'|'newShape'>;\n\nexport const SparseSegmentMean = 'SparseSegmentMean';\nexport type SparseSegmentMeanInputs =\n    Pick<NamedTensorInfoMap, 'data'|'indices'|'segmentIds'>;\n\nexport const SparseSegmentSum = 'SparseSegmentSum';\nexport type SparseSegmentSumInputs =\n    Pick<NamedTensorInfoMap, 'data'|'indices'|'segmentIds'>;\n\nexport const SparseToDense = 'SparseToDense';\nexport type SparseToDenseInputs =\n    Pick<NamedTensorInfoMap, 'sparseIndices'|'sparseValues'|'defaultValue'>;\nexport interface SparseToDenseAttrs {\n  outputShape: number[];\n}\n\nexport const SquaredDifference = 'SquaredDifference';\nexport type SquaredDifferenceInputs = BinaryInputs;\n\nexport const Square = 'Square';\nexport type SquareInputs = Pick<NamedTensorInfoMap, 'x'>;\n\nexport const StaticRegexReplace = 'StaticRegexReplace';\nexport type StaticRegexReplaceInputs = UnaryInputs;\nexport interface StaticRegexReplaceAttrs {\n  pattern: string;\n  rewrite: string;\n  replaceGlobal: boolean;\n}\n\nexport const StridedSlice = 'StridedSlice';\nexport type StridedSliceInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface StridedSliceAttrs {\n  begin: number[];\n  end: number[];\n  strides: number[];\n  beginMask: number;\n  endMask: number;\n  ellipsisMask: number;\n  newAxisMask: number;\n  shrinkAxisMask: number;\n}\n\nexport const StringNGrams = 'StringNGrams';\nexport type StringNGramsInputs = Pick<NamedTensorInfoMap, 'data'|'dataSplits'>;\nexport interface StringNGramsAttrs {\n  separator: string;\n  nGramWidths: number[];\n  leftPad: string;\n  rightPad: string;\n  padWidth: number;\n  preserveShortSequences: boolean;\n}\n\nexport const StringSplit = 'StringSplit';\nexport type StringSplitInputs = Pick<NamedTensorInfoMap, 'input'|'delimiter'>;\nexport interface StringSplitAttrs {\n  skipEmpty: boolean;\n}\n\nexport const StringToHashBucketFast = 'StringToHashBucketFast';\nexport type StringToHashBucketFastInputs = Pick<NamedTensorInfoMap, 'input'>;\nexport interface StringToHashBucketFastAttrs {\n  numBuckets: number;\n}\n\nexport const Sub = 'Sub';\nexport type SubInputs = BinaryInputs;\n\nexport const Tan = 'Tan';\nexport type TanInputs = UnaryInputs;\n\nexport const Tanh = 'Tanh';\nexport type TanhInputs = UnaryInputs;\n\nexport const Tile = 'Tile';\nexport type TileInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface TileAttrs {\n  reps: number[];\n}\n\nexport const TopK = 'TopK';\nexport type TopKInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface TopKAttrs {\n  k: number;\n  sorted: boolean;\n}\n\nexport const Transform = 'Transform';\nexport type TransformInputs = Pick<NamedTensorInfoMap, 'image'|'transforms'>;\nexport interface TransformAttrs {\n  interpolation: 'nearest'|'bilinear';\n  fillMode: 'constant'|'reflect'|'wrap'|'nearest';\n  fillValue: number;\n  outputShape?: [number, number];\n}\n\nexport const Transpose = 'Transpose';\nexport type TransposeInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface TransposeAttrs {\n  perm: number[];\n}\n\nexport const Unique = 'Unique';\nexport type UniqueInputs = Pick<NamedTensorInfoMap, 'x'>;\nexport interface UniqueAttrs {\n  axis: number;\n}\n\nexport type UnaryInputs = Pick<NamedTensorInfoMap, 'x'>;\n\nexport const Unpack = 'Unpack';\nexport type UnpackInputs = Pick<NamedTensorInfoMap, 'value'>;\nexport interface UnpackAttrs {\n  axis: number;\n}\n\nexport const UnsortedSegmentSum = 'UnsortedSegmentSum';\nexport type UnsortedSegmentSumInputs =\n    Pick<NamedTensorInfoMap, 'x'|'segmentIds'>;\nexport interface UnsortedSegmentSumAttrs {\n  numSegments: number;\n}\n\nexport const UpperBound = 'UpperBound';\nexport type UpperBoundInputs =\n    Pick<NamedTensorInfoMap, 'sortedSequence'|'values'>;\n\nexport const ZerosLike = 'ZerosLike';\nexport type ZerosLikeInputs = UnaryInputs;\n\n/**\n * TensorFlow.js-only kernels\n */\nexport const Step = 'Step';\nexport type StepInputs = UnaryInputs;\nexport interface StepAttrs {\n  alpha: number;\n}\n\nexport const FromPixels = 'FromPixels';\nexport interface FromPixelsInputs {\n  pixels: PixelData|ImageData|HTMLImageElement|HTMLCanvasElement|\n      HTMLVideoElement|ImageBitmap;\n}\nexport interface FromPixelsAttrs {\n  numChannels: number;\n}\n\nexport const RotateWithOffset = 'RotateWithOffset';\nexport type RotateWithOffsetInputs = Pick<NamedTensorInfoMap, 'image'>;\nexport interface RotateWithOffsetAttrs {\n  radians: number;\n  fillValue: number|[number, number, number];\n  center: number|[number, number];\n}\n\nexport const _FusedMatMul = '_FusedMatMul';\n// tslint:disable-next-line: class-name\nexport interface _FusedMatMulInputs extends NamedTensorInfoMap {\n  a: TensorInfo;\n  b: TensorInfo;\n  bias?: TensorInfo;\n  preluActivationWeights?: TensorInfo;\n}\n// tslint:disable-next-line: class-name\nexport interface _FusedMatMulAttrs {\n  transposeA: boolean;\n  transposeB: boolean;\n  activation: Activation;\n  leakyreluAlpha?: number;\n}\n\nexport const FusedConv2D = 'FusedConv2D';\nexport interface FusedConv2DInputs extends NamedTensorInfoMap {\n  x: TensorInfo;\n  filter: TensorInfo;\n  bias?: TensorInfo;\n  preluActivationWeights?: TensorInfo;\n}\nexport interface FusedConv2DAttrs {\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dataFormat: 'NHWC'|'NCHW';\n  dilations: [number, number]|number;\n  dimRoundingMode: 'floor'|'round'|'ceil';\n  activation: Activation;\n  leakyreluAlpha?: number;\n}\n\nexport const FusedDepthwiseConv2D = 'FusedDepthwiseConv2D';\nexport interface FusedDepthwiseConv2DInputs extends NamedTensorInfoMap {\n  x: TensorInfo;\n  filter: TensorInfo;\n  bias?: TensorInfo;\n  preluActivationWeights?: TensorInfo;\n}\nexport interface FusedDepthwiseConv2DAttrs {\n  strides: [number, number]|number;\n  pad: 'valid'|'same'|number|ExplicitPadding;\n  dataFormat: 'NHWC'|'NCHW';\n  dilations: [number, number]|number;\n  dimRoundingMode: 'floor'|'round'|'ceil';\n  activation: Activation;\n  leakyreluAlpha?: number;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {env} from './environment';\n\nexport function warn(...msg: Array<{}>): void {\n  if (!(env().getBool('IS_TEST') || env().getBool('PROD'))) {\n    console.warn(...msg);\n  }\n}\n\nexport function log(...msg: Array<{}>): void {\n  if (!(env().getBool('IS_TEST') || env().getBool('PROD'))) {\n    console.log(...msg);\n  }\n}\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {env} from './environment';\nimport {getGlobal} from './global_util';\nimport * as log from './log';\nimport {NamedGradientMap} from './tape';\nimport {Tensor} from './tensor';\nimport {TensorInfo} from './tensor_info';\nimport {RecursiveArray} from './types';\n\nconst kernelRegistry =\n  getGlobal('kernelRegistry', () => new Map<`${string}_${string}`,\n    KernelConfig>());\nconst gradRegistry =\n  getGlobal('gradRegistry', () => new Map<string, GradConfig>());\n\ntype AttributeValue =\n  number | number[] | boolean | boolean[] | string | string[] | NamedAttrMap;\n\n/** These are extra non-tensor/primitive params passed to kernel functions. */\nexport type Attribute = AttributeValue | RecursiveArray<AttributeValue>;\n\n/** Specifies the code to run when executing a kernel. */\nexport type KernelFunc = (params: {\n  inputs: NamedTensorInfoMap,\n  backend: {},\n  attrs?: NamedAttrMap,\n}) => TensorInfo | TensorInfo[];\n\n/** The function to run when computing a gradient during backprop. */\nexport type GradFunc =\n  (dy: Tensor | Tensor[], saved: Tensor[], attrs: NamedAttrMap) =>\n    NamedGradientMap;\n\n/** Function that gets called after the backend initializes. */\nexport type KernelSetupFunc = (backend: {}) => void;\n/** Function that gets called right before the backend is disposed. */\nexport type KernelDisposeFunc = KernelSetupFunc;\n\n/** Config object for registering a kernel in the global registry. */\nexport interface KernelConfig {\n  kernelName: string;\n  backendName: string;\n  kernelFunc: KernelFunc;\n  setupFunc?: KernelSetupFunc;\n  disposeFunc?: KernelDisposeFunc;\n}\n\n/** Config object for registering a gradient in the global registry. */\nexport interface GradConfig {\n  kernelName: string;\n  inputsToSave?: string[];\n  // When saveAllInputs is true, all inputs will be saved. Only use this flag\n  // if inputs is an array of Tensors.\n  saveAllInputs?: boolean;\n  outputsToSave?: boolean[];\n  gradFunc: GradFunc;\n}\n\nexport interface NamedTensorInfoMap {\n  [name: string]: TensorInfo|undefined;\n}\n\nexport interface NamedAttrMap {\n  [name: string]: Attribute;\n}\n\n/**\n * Returns the kernel function (code) associated with the provided names.\n *\n * @param kernelName The official name of the kernel.\n * @param backendName The official name of the backend.\n */\nexport function getKernel(\n    kernelName: string, backendName: string): KernelConfig {\n  const key = makeKey(kernelName, backendName);\n  return kernelRegistry.get(key);\n}\n\n/**\n * Returns the registered gradient info associated with the provided kernel.\n * @param kernelName The official TF kernel name.\n */\nexport function getGradient(kernelName: string): GradConfig {\n  return gradRegistry.get(kernelName);\n}\n\nexport function getKernelsForBackend(backendName: string): KernelConfig[] {\n  const it = kernelRegistry.entries();\n  const result: KernelConfig[] = [];\n\n  while (true) {\n    const {done, value} = it.next();\n    if (done) {\n      break;\n    }\n    const [key, config] = value;\n    const [backend, ] = key.split('_');\n    if (backend === backendName) {\n      result.push(config);\n    }\n  }\n  return result;\n}\n\n/**\n * Registers the function (forward pass) for the kernel in a global registry.\n *\n * @param config A config object with the following properties:\n * - `kernelName` The official name of the kernel.\n * - `backendName` The official name of the backend.\n * - `kernelFunc` The function to run during the forward pass of the kernel.\n * - `setupFunc` Optional. Gets called once, after the backend initializes.\n * - `disposeFunc` Optional. Gets called once, right before the backend is\n * disposed.\n */\nexport function registerKernel(config: KernelConfig) {\n  const {kernelName, backendName} = config;\n  const key = makeKey(kernelName, backendName);\n  if (kernelRegistry.has(key)) {\n    log.warn(\n        `The kernel '${kernelName}' for backend ` +\n        `'${backendName}' is already registered`);\n  }\n  kernelRegistry.set(key, config);\n}\n\n/**\n * Registers a gradient function for a given kernel in the global registry,\n * to be used during the back-propagation of that kernel.\n *\n * @param config An object with the following properties:\n * - `kernelName` The name of the kernel that the gradient function is for.\n * - `gradFunc` The function to run during back-propagation.\n */\nexport function registerGradient(config: GradConfig) {\n  const {kernelName} = config;\n\n  if (gradRegistry.has(kernelName)) {\n    // TODO (yassogba) after 3.0 assess whether we need to keep this gated\n    // to debug mode.\n    if (env().getBool('DEBUG')) {\n      log.warn(`Overriding the gradient for '${kernelName}'`);\n    }\n  }\n  gradRegistry.set(kernelName, config);\n}\n\n/**\n * Removes the kernel function from the registry.\n *\n * @param kernelName The official name of the kernel.\n * @param backendName The official name of the backend.\n *\n */\nexport function unregisterKernel(\n    kernelName: string, backendName: string): void {\n  const key = makeKey(kernelName, backendName);\n  if (!kernelRegistry.has(key)) {\n    throw new Error(\n        `The kernel '${kernelName}' for backend ` +\n        `'${backendName}' is not registered`);\n  }\n  kernelRegistry.delete(key);\n}\n\n/** Removes the registered gradient from the global registry. */\nexport function unregisterGradient(kernelName: string): void {\n  if (!gradRegistry.has(kernelName)) {\n    throw new Error(\n        `The gradient '${kernelName}' for backend is not registered`);\n  }\n  gradRegistry.delete(kernelName);\n}\n\n/**\n * Finds kernels that have already been registered to a backend and re-registers\n * them for a new backend. Useful for registering custom backends.\n * @param registeredBackendName Already registered backend.\n * @param newBackendName New backend.\n */\nexport function copyRegisteredKernels(\n    registeredBackendName: string, newBackendName: string): void {\n  const kernels = getKernelsForBackend(registeredBackendName);\n  kernels.forEach(kernelConfig => {\n    const newKernelConfig =\n        Object.assign({}, kernelConfig, {backendName: newBackendName});\n    registerKernel(newKernelConfig);\n  });\n}\n\nfunction makeKey(kernelName: string,\n                 backendName: string): `${string}_${string}` {\n  return `${backendName}_${kernelName}`;\n}\n", "/**\n * @license\n * Copyright 2023 Google LLC.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nexport function isTypedArrayBrowser(a: unknown): a is Uint8Array\n  | Float32Array | Int32Array | Uint8ClampedArray {\n  return a instanceof Float32Array || a instanceof Int32Array ||\n    a instanceof Uint8Array || a instanceof Uint8ClampedArray;\n}\n", "module.exports = Long;\r\n\r\n/**\r\n * wasm optimizations, to do native i64 multiplication and divide\r\n */\r\nvar wasm = null;\r\n\r\ntry {\r\n  wasm = new WebAssembly.Instance(new WebAssembly.Module(new Uint8Array([\r\n    0, 97, 115, 109, 1, 0, 0, 0, 1, 13, 2, 96, 0, 1, 127, 96, 4, 127, 127, 127, 127, 1, 127, 3, 7, 6, 0, 1, 1, 1, 1, 1, 6, 6, 1, 127, 1, 65, 0, 11, 7, 50, 6, 3, 109, 117, 108, 0, 1, 5, 100, 105, 118, 95, 115, 0, 2, 5, 100, 105, 118, 95, 117, 0, 3, 5, 114, 101, 109, 95, 115, 0, 4, 5, 114, 101, 109, 95, 117, 0, 5, 8, 103, 101, 116, 95, 104, 105, 103, 104, 0, 0, 10, 191, 1, 6, 4, 0, 35, 0, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 126, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 127, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 128, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 129, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 130, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11\r\n  ])), {}).exports;\r\n} catch (e) {\r\n  // no wasm support :(\r\n}\r\n\r\n/**\r\n * Constructs a 64 bit two's-complement integer, given its low and high 32 bit values as *signed* integers.\r\n *  See the from* functions below for more convenient ways of constructing Longs.\r\n * @exports Long\r\n * @class A Long class for representing a 64 bit two's-complement integer value.\r\n * @param {number} low The low (signed) 32 bits of the long\r\n * @param {number} high The high (signed) 32 bits of the long\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @constructor\r\n */\r\nfunction Long(low, high, unsigned) {\r\n\r\n    /**\r\n     * The low 32 bits as a signed value.\r\n     * @type {number}\r\n     */\r\n    this.low = low | 0;\r\n\r\n    /**\r\n     * The high 32 bits as a signed value.\r\n     * @type {number}\r\n     */\r\n    this.high = high | 0;\r\n\r\n    /**\r\n     * Whether unsigned or not.\r\n     * @type {boolean}\r\n     */\r\n    this.unsigned = !!unsigned;\r\n}\r\n\r\n// The internal representation of a long is the two given signed, 32-bit values.\r\n// We use 32-bit pieces because these are the size of integers on which\r\n// Javascript performs bit-operations.  For operations like addition and\r\n// multiplication, we split each number into 16 bit pieces, which can easily be\r\n// multiplied within Javascript's floating-point representation without overflow\r\n// or change in sign.\r\n//\r\n// In the algorithms below, we frequently reduce the negative case to the\r\n// positive case by negating the input(s) and then post-processing the result.\r\n// Note that we must ALWAYS check specially whether those values are MIN_VALUE\r\n// (-2^63) because -MIN_VALUE == MIN_VALUE (since 2^63 cannot be represented as\r\n// a positive number, it overflows back into a negative).  Not handling this\r\n// case would often result in infinite recursion.\r\n//\r\n// Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the from*\r\n// methods on which they depend.\r\n\r\n/**\r\n * An indicator used to reliably determine if an object is a Long or not.\r\n * @type {boolean}\r\n * @const\r\n * @private\r\n */\r\nLong.prototype.__isLong__;\r\n\r\nObject.defineProperty(Long.prototype, \"__isLong__\", { value: true });\r\n\r\n/**\r\n * @function\r\n * @param {*} obj Object\r\n * @returns {boolean}\r\n * @inner\r\n */\r\nfunction isLong(obj) {\r\n    return (obj && obj[\"__isLong__\"]) === true;\r\n}\r\n\r\n/**\r\n * Tests if the specified object is a Long.\r\n * @function\r\n * @param {*} obj Object\r\n * @returns {boolean}\r\n */\r\nLong.isLong = isLong;\r\n\r\n/**\r\n * A cache of the Long representations of small integer values.\r\n * @type {!Object}\r\n * @inner\r\n */\r\nvar INT_CACHE = {};\r\n\r\n/**\r\n * A cache of the Long representations of small unsigned integer values.\r\n * @type {!Object}\r\n * @inner\r\n */\r\nvar UINT_CACHE = {};\r\n\r\n/**\r\n * @param {number} value\r\n * @param {boolean=} unsigned\r\n * @returns {!Long}\r\n * @inner\r\n */\r\nfunction fromInt(value, unsigned) {\r\n    var obj, cachedObj, cache;\r\n    if (unsigned) {\r\n        value >>>= 0;\r\n        if (cache = (0 <= value && value < 256)) {\r\n            cachedObj = UINT_CACHE[value];\r\n            if (cachedObj)\r\n                return cachedObj;\r\n        }\r\n        obj = fromBits(value, (value | 0) < 0 ? -1 : 0, true);\r\n        if (cache)\r\n            UINT_CACHE[value] = obj;\r\n        return obj;\r\n    } else {\r\n        value |= 0;\r\n        if (cache = (-128 <= value && value < 128)) {\r\n            cachedObj = INT_CACHE[value];\r\n            if (cachedObj)\r\n                return cachedObj;\r\n        }\r\n        obj = fromBits(value, value < 0 ? -1 : 0, false);\r\n        if (cache)\r\n            INT_CACHE[value] = obj;\r\n        return obj;\r\n    }\r\n}\r\n\r\n/**\r\n * Returns a Long representing the given 32 bit integer value.\r\n * @function\r\n * @param {number} value The 32 bit integer in question\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @returns {!Long} The corresponding Long value\r\n */\r\nLong.fromInt = fromInt;\r\n\r\n/**\r\n * @param {number} value\r\n * @param {boolean=} unsigned\r\n * @returns {!Long}\r\n * @inner\r\n */\r\nfunction fromNumber(value, unsigned) {\r\n    if (isNaN(value))\r\n        return unsigned ? UZERO : ZERO;\r\n    if (unsigned) {\r\n        if (value < 0)\r\n            return UZERO;\r\n        if (value >= TWO_PWR_64_DBL)\r\n            return MAX_UNSIGNED_VALUE;\r\n    } else {\r\n        if (value <= -TWO_PWR_63_DBL)\r\n            return MIN_VALUE;\r\n        if (value + 1 >= TWO_PWR_63_DBL)\r\n            return MAX_VALUE;\r\n    }\r\n    if (value < 0)\r\n        return fromNumber(-value, unsigned).neg();\r\n    return fromBits((value % TWO_PWR_32_DBL) | 0, (value / TWO_PWR_32_DBL) | 0, unsigned);\r\n}\r\n\r\n/**\r\n * Returns a Long representing the given value, provided that it is a finite number. Otherwise, zero is returned.\r\n * @function\r\n * @param {number} value The number in question\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @returns {!Long} The corresponding Long value\r\n */\r\nLong.fromNumber = fromNumber;\r\n\r\n/**\r\n * @param {number} lowBits\r\n * @param {number} highBits\r\n * @param {boolean=} unsigned\r\n * @returns {!Long}\r\n * @inner\r\n */\r\nfunction fromBits(lowBits, highBits, unsigned) {\r\n    return new Long(lowBits, highBits, unsigned);\r\n}\r\n\r\n/**\r\n * Returns a Long representing the 64 bit integer that comes by concatenating the given low and high bits. Each is\r\n *  assumed to use 32 bits.\r\n * @function\r\n * @param {number} lowBits The low 32 bits\r\n * @param {number} highBits The high 32 bits\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @returns {!Long} The corresponding Long value\r\n */\r\nLong.fromBits = fromBits;\r\n\r\n/**\r\n * @function\r\n * @param {number} base\r\n * @param {number} exponent\r\n * @returns {number}\r\n * @inner\r\n */\r\nvar pow_dbl = Math.pow; // Used 4 times (4*8 to 15+4)\r\n\r\n/**\r\n * @param {string} str\r\n * @param {(boolean|number)=} unsigned\r\n * @param {number=} radix\r\n * @returns {!Long}\r\n * @inner\r\n */\r\nfunction fromString(str, unsigned, radix) {\r\n    if (str.length === 0)\r\n        throw Error('empty string');\r\n    if (str === \"NaN\" || str === \"Infinity\" || str === \"+Infinity\" || str === \"-Infinity\")\r\n        return ZERO;\r\n    if (typeof unsigned === 'number') {\r\n        // For goog.math.long compatibility\r\n        radix = unsigned,\r\n        unsigned = false;\r\n    } else {\r\n        unsigned = !! unsigned;\r\n    }\r\n    radix = radix || 10;\r\n    if (radix < 2 || 36 < radix)\r\n        throw RangeError('radix');\r\n\r\n    var p;\r\n    if ((p = str.indexOf('-')) > 0)\r\n        throw Error('interior hyphen');\r\n    else if (p === 0) {\r\n        return fromString(str.substring(1), unsigned, radix).neg();\r\n    }\r\n\r\n    // Do several (8) digits each time through the loop, so as to\r\n    // minimize the calls to the very expensive emulated div.\r\n    var radixToPower = fromNumber(pow_dbl(radix, 8));\r\n\r\n    var result = ZERO;\r\n    for (var i = 0; i < str.length; i += 8) {\r\n        var size = Math.min(8, str.length - i),\r\n            value = parseInt(str.substring(i, i + size), radix);\r\n        if (size < 8) {\r\n            var power = fromNumber(pow_dbl(radix, size));\r\n            result = result.mul(power).add(fromNumber(value));\r\n        } else {\r\n            result = result.mul(radixToPower);\r\n            result = result.add(fromNumber(value));\r\n        }\r\n    }\r\n    result.unsigned = unsigned;\r\n    return result;\r\n}\r\n\r\n/**\r\n * Returns a Long representation of the given string, written using the specified radix.\r\n * @function\r\n * @param {string} str The textual representation of the Long\r\n * @param {(boolean|number)=} unsigned Whether unsigned or not, defaults to signed\r\n * @param {number=} radix The radix in which the text is written (2-36), defaults to 10\r\n * @returns {!Long} The corresponding Long value\r\n */\r\nLong.fromString = fromString;\r\n\r\n/**\r\n * @function\r\n * @param {!Long|number|string|!{low: number, high: number, unsigned: boolean}} val\r\n * @param {boolean=} unsigned\r\n * @returns {!Long}\r\n * @inner\r\n */\r\nfunction fromValue(val, unsigned) {\r\n    if (typeof val === 'number')\r\n        return fromNumber(val, unsigned);\r\n    if (typeof val === 'string')\r\n        return fromString(val, unsigned);\r\n    // Throws for non-objects, converts non-instanceof Long:\r\n    return fromBits(val.low, val.high, typeof unsigned === 'boolean' ? unsigned : val.unsigned);\r\n}\r\n\r\n/**\r\n * Converts the specified value to a Long using the appropriate from* function for its type.\r\n * @function\r\n * @param {!Long|number|string|!{low: number, high: number, unsigned: boolean}} val Value\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @returns {!Long}\r\n */\r\nLong.fromValue = fromValue;\r\n\r\n// NOTE: the compiler should inline these constant values below and then remove these variables, so there should be\r\n// no runtime penalty for these.\r\n\r\n/**\r\n * @type {number}\r\n * @const\r\n * @inner\r\n */\r\nvar TWO_PWR_16_DBL = 1 << 16;\r\n\r\n/**\r\n * @type {number}\r\n * @const\r\n * @inner\r\n */\r\nvar TWO_PWR_24_DBL = 1 << 24;\r\n\r\n/**\r\n * @type {number}\r\n * @const\r\n * @inner\r\n */\r\nvar TWO_PWR_32_DBL = TWO_PWR_16_DBL * TWO_PWR_16_DBL;\r\n\r\n/**\r\n * @type {number}\r\n * @const\r\n * @inner\r\n */\r\nvar TWO_PWR_64_DBL = TWO_PWR_32_DBL * TWO_PWR_32_DBL;\r\n\r\n/**\r\n * @type {number}\r\n * @const\r\n * @inner\r\n */\r\nvar TWO_PWR_63_DBL = TWO_PWR_64_DBL / 2;\r\n\r\n/**\r\n * @type {!Long}\r\n * @const\r\n * @inner\r\n */\r\nvar TWO_PWR_24 = fromInt(TWO_PWR_24_DBL);\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar ZERO = fromInt(0);\r\n\r\n/**\r\n * Signed zero.\r\n * @type {!Long}\r\n */\r\nLong.ZERO = ZERO;\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar UZERO = fromInt(0, true);\r\n\r\n/**\r\n * Unsigned zero.\r\n * @type {!Long}\r\n */\r\nLong.UZERO = UZERO;\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar ONE = fromInt(1);\r\n\r\n/**\r\n * Signed one.\r\n * @type {!Long}\r\n */\r\nLong.ONE = ONE;\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar UONE = fromInt(1, true);\r\n\r\n/**\r\n * Unsigned one.\r\n * @type {!Long}\r\n */\r\nLong.UONE = UONE;\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar NEG_ONE = fromInt(-1);\r\n\r\n/**\r\n * Signed negative one.\r\n * @type {!Long}\r\n */\r\nLong.NEG_ONE = NEG_ONE;\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar MAX_VALUE = fromBits(0xFFFFFFFF|0, 0x7FFFFFFF|0, false);\r\n\r\n/**\r\n * Maximum signed value.\r\n * @type {!Long}\r\n */\r\nLong.MAX_VALUE = MAX_VALUE;\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar MAX_UNSIGNED_VALUE = fromBits(0xFFFFFFFF|0, 0xFFFFFFFF|0, true);\r\n\r\n/**\r\n * Maximum unsigned value.\r\n * @type {!Long}\r\n */\r\nLong.MAX_UNSIGNED_VALUE = MAX_UNSIGNED_VALUE;\r\n\r\n/**\r\n * @type {!Long}\r\n * @inner\r\n */\r\nvar MIN_VALUE = fromBits(0, 0x80000000|0, false);\r\n\r\n/**\r\n * Minimum signed value.\r\n * @type {!Long}\r\n */\r\nLong.MIN_VALUE = MIN_VALUE;\r\n\r\n/**\r\n * @alias Long.prototype\r\n * @inner\r\n */\r\nvar LongPrototype = Long.prototype;\r\n\r\n/**\r\n * Converts the Long to a 32 bit integer, assuming it is a 32 bit integer.\r\n * @returns {number}\r\n */\r\nLongPrototype.toInt = function toInt() {\r\n    return this.unsigned ? this.low >>> 0 : this.low;\r\n};\r\n\r\n/**\r\n * Converts the Long to a the nearest floating-point representation of this value (double, 53 bit mantissa).\r\n * @returns {number}\r\n */\r\nLongPrototype.toNumber = function toNumber() {\r\n    if (this.unsigned)\r\n        return ((this.high >>> 0) * TWO_PWR_32_DBL) + (this.low >>> 0);\r\n    return this.high * TWO_PWR_32_DBL + (this.low >>> 0);\r\n};\r\n\r\n/**\r\n * Converts the Long to a string written in the specified radix.\r\n * @param {number=} radix Radix (2-36), defaults to 10\r\n * @returns {string}\r\n * @override\r\n * @throws {RangeError} If `radix` is out of range\r\n */\r\nLongPrototype.toString = function toString(radix) {\r\n    radix = radix || 10;\r\n    if (radix < 2 || 36 < radix)\r\n        throw RangeError('radix');\r\n    if (this.isZero())\r\n        return '0';\r\n    if (this.isNegative()) { // Unsigned Longs are never negative\r\n        if (this.eq(MIN_VALUE)) {\r\n            // We need to change the Long value before it can be negated, so we remove\r\n            // the bottom-most digit in this base and then recurse to do the rest.\r\n            var radixLong = fromNumber(radix),\r\n                div = this.div(radixLong),\r\n                rem1 = div.mul(radixLong).sub(this);\r\n            return div.toString(radix) + rem1.toInt().toString(radix);\r\n        } else\r\n            return '-' + this.neg().toString(radix);\r\n    }\r\n\r\n    // Do several (6) digits each time through the loop, so as to\r\n    // minimize the calls to the very expensive emulated div.\r\n    var radixToPower = fromNumber(pow_dbl(radix, 6), this.unsigned),\r\n        rem = this;\r\n    var result = '';\r\n    while (true) {\r\n        var remDiv = rem.div(radixToPower),\r\n            intval = rem.sub(remDiv.mul(radixToPower)).toInt() >>> 0,\r\n            digits = intval.toString(radix);\r\n        rem = remDiv;\r\n        if (rem.isZero())\r\n            return digits + result;\r\n        else {\r\n            while (digits.length < 6)\r\n                digits = '0' + digits;\r\n            result = '' + digits + result;\r\n        }\r\n    }\r\n};\r\n\r\n/**\r\n * Gets the high 32 bits as a signed integer.\r\n * @returns {number} Signed high bits\r\n */\r\nLongPrototype.getHighBits = function getHighBits() {\r\n    return this.high;\r\n};\r\n\r\n/**\r\n * Gets the high 32 bits as an unsigned integer.\r\n * @returns {number} Unsigned high bits\r\n */\r\nLongPrototype.getHighBitsUnsigned = function getHighBitsUnsigned() {\r\n    return this.high >>> 0;\r\n};\r\n\r\n/**\r\n * Gets the low 32 bits as a signed integer.\r\n * @returns {number} Signed low bits\r\n */\r\nLongPrototype.getLowBits = function getLowBits() {\r\n    return this.low;\r\n};\r\n\r\n/**\r\n * Gets the low 32 bits as an unsigned integer.\r\n * @returns {number} Unsigned low bits\r\n */\r\nLongPrototype.getLowBitsUnsigned = function getLowBitsUnsigned() {\r\n    return this.low >>> 0;\r\n};\r\n\r\n/**\r\n * Gets the number of bits needed to represent the absolute value of this Long.\r\n * @returns {number}\r\n */\r\nLongPrototype.getNumBitsAbs = function getNumBitsAbs() {\r\n    if (this.isNegative()) // Unsigned Longs are never negative\r\n        return this.eq(MIN_VALUE) ? 64 : this.neg().getNumBitsAbs();\r\n    var val = this.high != 0 ? this.high : this.low;\r\n    for (var bit = 31; bit > 0; bit--)\r\n        if ((val & (1 << bit)) != 0)\r\n            break;\r\n    return this.high != 0 ? bit + 33 : bit + 1;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value equals zero.\r\n * @returns {boolean}\r\n */\r\nLongPrototype.isZero = function isZero() {\r\n    return this.high === 0 && this.low === 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value equals zero. This is an alias of {@link Long#isZero}.\r\n * @returns {boolean}\r\n */\r\nLongPrototype.eqz = LongPrototype.isZero;\r\n\r\n/**\r\n * Tests if this Long's value is negative.\r\n * @returns {boolean}\r\n */\r\nLongPrototype.isNegative = function isNegative() {\r\n    return !this.unsigned && this.high < 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value is positive.\r\n * @returns {boolean}\r\n */\r\nLongPrototype.isPositive = function isPositive() {\r\n    return this.unsigned || this.high >= 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value is odd.\r\n * @returns {boolean}\r\n */\r\nLongPrototype.isOdd = function isOdd() {\r\n    return (this.low & 1) === 1;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value is even.\r\n * @returns {boolean}\r\n */\r\nLongPrototype.isEven = function isEven() {\r\n    return (this.low & 1) === 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value equals the specified's.\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.equals = function equals(other) {\r\n    if (!isLong(other))\r\n        other = fromValue(other);\r\n    if (this.unsigned !== other.unsigned && (this.high >>> 31) === 1 && (other.high >>> 31) === 1)\r\n        return false;\r\n    return this.high === other.high && this.low === other.low;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value equals the specified's. This is an alias of {@link Long#equals}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.eq = LongPrototype.equals;\r\n\r\n/**\r\n * Tests if this Long's value differs from the specified's.\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.notEquals = function notEquals(other) {\r\n    return !this.eq(/* validates */ other);\r\n};\r\n\r\n/**\r\n * Tests if this Long's value differs from the specified's. This is an alias of {@link Long#notEquals}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.neq = LongPrototype.notEquals;\r\n\r\n/**\r\n * Tests if this Long's value differs from the specified's. This is an alias of {@link Long#notEquals}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.ne = LongPrototype.notEquals;\r\n\r\n/**\r\n * Tests if this Long's value is less than the specified's.\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.lessThan = function lessThan(other) {\r\n    return this.comp(/* validates */ other) < 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value is less than the specified's. This is an alias of {@link Long#lessThan}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.lt = LongPrototype.lessThan;\r\n\r\n/**\r\n * Tests if this Long's value is less than or equal the specified's.\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.lessThanOrEqual = function lessThanOrEqual(other) {\r\n    return this.comp(/* validates */ other) <= 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value is less than or equal the specified's. This is an alias of {@link Long#lessThanOrEqual}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.lte = LongPrototype.lessThanOrEqual;\r\n\r\n/**\r\n * Tests if this Long's value is less than or equal the specified's. This is an alias of {@link Long#lessThanOrEqual}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.le = LongPrototype.lessThanOrEqual;\r\n\r\n/**\r\n * Tests if this Long's value is greater than the specified's.\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.greaterThan = function greaterThan(other) {\r\n    return this.comp(/* validates */ other) > 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value is greater than the specified's. This is an alias of {@link Long#greaterThan}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.gt = LongPrototype.greaterThan;\r\n\r\n/**\r\n * Tests if this Long's value is greater than or equal the specified's.\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.greaterThanOrEqual = function greaterThanOrEqual(other) {\r\n    return this.comp(/* validates */ other) >= 0;\r\n};\r\n\r\n/**\r\n * Tests if this Long's value is greater than or equal the specified's. This is an alias of {@link Long#greaterThanOrEqual}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.gte = LongPrototype.greaterThanOrEqual;\r\n\r\n/**\r\n * Tests if this Long's value is greater than or equal the specified's. This is an alias of {@link Long#greaterThanOrEqual}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {boolean}\r\n */\r\nLongPrototype.ge = LongPrototype.greaterThanOrEqual;\r\n\r\n/**\r\n * Compares this Long's value with the specified's.\r\n * @param {!Long|number|string} other Other value\r\n * @returns {number} 0 if they are the same, 1 if the this is greater and -1\r\n *  if the given one is greater\r\n */\r\nLongPrototype.compare = function compare(other) {\r\n    if (!isLong(other))\r\n        other = fromValue(other);\r\n    if (this.eq(other))\r\n        return 0;\r\n    var thisNeg = this.isNegative(),\r\n        otherNeg = other.isNegative();\r\n    if (thisNeg && !otherNeg)\r\n        return -1;\r\n    if (!thisNeg && otherNeg)\r\n        return 1;\r\n    // At this point the sign bits are the same\r\n    if (!this.unsigned)\r\n        return this.sub(other).isNegative() ? -1 : 1;\r\n    // Both are positive if at least one is unsigned\r\n    return (other.high >>> 0) > (this.high >>> 0) || (other.high === this.high && (other.low >>> 0) > (this.low >>> 0)) ? -1 : 1;\r\n};\r\n\r\n/**\r\n * Compares this Long's value with the specified's. This is an alias of {@link Long#compare}.\r\n * @function\r\n * @param {!Long|number|string} other Other value\r\n * @returns {number} 0 if they are the same, 1 if the this is greater and -1\r\n *  if the given one is greater\r\n */\r\nLongPrototype.comp = LongPrototype.compare;\r\n\r\n/**\r\n * Negates this Long's value.\r\n * @returns {!Long} Negated Long\r\n */\r\nLongPrototype.negate = function negate() {\r\n    if (!this.unsigned && this.eq(MIN_VALUE))\r\n        return MIN_VALUE;\r\n    return this.not().add(ONE);\r\n};\r\n\r\n/**\r\n * Negates this Long's value. This is an alias of {@link Long#negate}.\r\n * @function\r\n * @returns {!Long} Negated Long\r\n */\r\nLongPrototype.neg = LongPrototype.negate;\r\n\r\n/**\r\n * Returns the sum of this and the specified Long.\r\n * @param {!Long|number|string} addend Addend\r\n * @returns {!Long} Sum\r\n */\r\nLongPrototype.add = function add(addend) {\r\n    if (!isLong(addend))\r\n        addend = fromValue(addend);\r\n\r\n    // Divide each number into 4 chunks of 16 bits, and then sum the chunks.\r\n\r\n    var a48 = this.high >>> 16;\r\n    var a32 = this.high & 0xFFFF;\r\n    var a16 = this.low >>> 16;\r\n    var a00 = this.low & 0xFFFF;\r\n\r\n    var b48 = addend.high >>> 16;\r\n    var b32 = addend.high & 0xFFFF;\r\n    var b16 = addend.low >>> 16;\r\n    var b00 = addend.low & 0xFFFF;\r\n\r\n    var c48 = 0, c32 = 0, c16 = 0, c00 = 0;\r\n    c00 += a00 + b00;\r\n    c16 += c00 >>> 16;\r\n    c00 &= 0xFFFF;\r\n    c16 += a16 + b16;\r\n    c32 += c16 >>> 16;\r\n    c16 &= 0xFFFF;\r\n    c32 += a32 + b32;\r\n    c48 += c32 >>> 16;\r\n    c32 &= 0xFFFF;\r\n    c48 += a48 + b48;\r\n    c48 &= 0xFFFF;\r\n    return fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns the difference of this and the specified Long.\r\n * @param {!Long|number|string} subtrahend Subtrahend\r\n * @returns {!Long} Difference\r\n */\r\nLongPrototype.subtract = function subtract(subtrahend) {\r\n    if (!isLong(subtrahend))\r\n        subtrahend = fromValue(subtrahend);\r\n    return this.add(subtrahend.neg());\r\n};\r\n\r\n/**\r\n * Returns the difference of this and the specified Long. This is an alias of {@link Long#subtract}.\r\n * @function\r\n * @param {!Long|number|string} subtrahend Subtrahend\r\n * @returns {!Long} Difference\r\n */\r\nLongPrototype.sub = LongPrototype.subtract;\r\n\r\n/**\r\n * Returns the product of this and the specified Long.\r\n * @param {!Long|number|string} multiplier Multiplier\r\n * @returns {!Long} Product\r\n */\r\nLongPrototype.multiply = function multiply(multiplier) {\r\n    if (this.isZero())\r\n        return ZERO;\r\n    if (!isLong(multiplier))\r\n        multiplier = fromValue(multiplier);\r\n\r\n    // use wasm support if present\r\n    if (wasm) {\r\n        var low = wasm.mul(this.low,\r\n                           this.high,\r\n                           multiplier.low,\r\n                           multiplier.high);\r\n        return fromBits(low, wasm.get_high(), this.unsigned);\r\n    }\r\n\r\n    if (multiplier.isZero())\r\n        return ZERO;\r\n    if (this.eq(MIN_VALUE))\r\n        return multiplier.isOdd() ? MIN_VALUE : ZERO;\r\n    if (multiplier.eq(MIN_VALUE))\r\n        return this.isOdd() ? MIN_VALUE : ZERO;\r\n\r\n    if (this.isNegative()) {\r\n        if (multiplier.isNegative())\r\n            return this.neg().mul(multiplier.neg());\r\n        else\r\n            return this.neg().mul(multiplier).neg();\r\n    } else if (multiplier.isNegative())\r\n        return this.mul(multiplier.neg()).neg();\r\n\r\n    // If both longs are small, use float multiplication\r\n    if (this.lt(TWO_PWR_24) && multiplier.lt(TWO_PWR_24))\r\n        return fromNumber(this.toNumber() * multiplier.toNumber(), this.unsigned);\r\n\r\n    // Divide each long into 4 chunks of 16 bits, and then add up 4x4 products.\r\n    // We can skip products that would overflow.\r\n\r\n    var a48 = this.high >>> 16;\r\n    var a32 = this.high & 0xFFFF;\r\n    var a16 = this.low >>> 16;\r\n    var a00 = this.low & 0xFFFF;\r\n\r\n    var b48 = multiplier.high >>> 16;\r\n    var b32 = multiplier.high & 0xFFFF;\r\n    var b16 = multiplier.low >>> 16;\r\n    var b00 = multiplier.low & 0xFFFF;\r\n\r\n    var c48 = 0, c32 = 0, c16 = 0, c00 = 0;\r\n    c00 += a00 * b00;\r\n    c16 += c00 >>> 16;\r\n    c00 &= 0xFFFF;\r\n    c16 += a16 * b00;\r\n    c32 += c16 >>> 16;\r\n    c16 &= 0xFFFF;\r\n    c16 += a00 * b16;\r\n    c32 += c16 >>> 16;\r\n    c16 &= 0xFFFF;\r\n    c32 += a32 * b00;\r\n    c48 += c32 >>> 16;\r\n    c32 &= 0xFFFF;\r\n    c32 += a16 * b16;\r\n    c48 += c32 >>> 16;\r\n    c32 &= 0xFFFF;\r\n    c32 += a00 * b32;\r\n    c48 += c32 >>> 16;\r\n    c32 &= 0xFFFF;\r\n    c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;\r\n    c48 &= 0xFFFF;\r\n    return fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns the product of this and the specified Long. This is an alias of {@link Long#multiply}.\r\n * @function\r\n * @param {!Long|number|string} multiplier Multiplier\r\n * @returns {!Long} Product\r\n */\r\nLongPrototype.mul = LongPrototype.multiply;\r\n\r\n/**\r\n * Returns this Long divided by the specified. The result is signed if this Long is signed or\r\n *  unsigned if this Long is unsigned.\r\n * @param {!Long|number|string} divisor Divisor\r\n * @returns {!Long} Quotient\r\n */\r\nLongPrototype.divide = function divide(divisor) {\r\n    if (!isLong(divisor))\r\n        divisor = fromValue(divisor);\r\n    if (divisor.isZero())\r\n        throw Error('division by zero');\r\n\r\n    // use wasm support if present\r\n    if (wasm) {\r\n        // guard against signed division overflow: the largest\r\n        // negative number / -1 would be 1 larger than the largest\r\n        // positive number, due to two's complement.\r\n        if (!this.unsigned &&\r\n            this.high === -0x80000000 &&\r\n            divisor.low === -1 && divisor.high === -1) {\r\n            // be consistent with non-wasm code path\r\n            return this;\r\n        }\r\n        var low = (this.unsigned ? wasm.div_u : wasm.div_s)(\r\n            this.low,\r\n            this.high,\r\n            divisor.low,\r\n            divisor.high\r\n        );\r\n        return fromBits(low, wasm.get_high(), this.unsigned);\r\n    }\r\n\r\n    if (this.isZero())\r\n        return this.unsigned ? UZERO : ZERO;\r\n    var approx, rem, res;\r\n    if (!this.unsigned) {\r\n        // This section is only relevant for signed longs and is derived from the\r\n        // closure library as a whole.\r\n        if (this.eq(MIN_VALUE)) {\r\n            if (divisor.eq(ONE) || divisor.eq(NEG_ONE))\r\n                return MIN_VALUE;  // recall that -MIN_VALUE == MIN_VALUE\r\n            else if (divisor.eq(MIN_VALUE))\r\n                return ONE;\r\n            else {\r\n                // At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.\r\n                var halfThis = this.shr(1);\r\n                approx = halfThis.div(divisor).shl(1);\r\n                if (approx.eq(ZERO)) {\r\n                    return divisor.isNegative() ? ONE : NEG_ONE;\r\n                } else {\r\n                    rem = this.sub(divisor.mul(approx));\r\n                    res = approx.add(rem.div(divisor));\r\n                    return res;\r\n                }\r\n            }\r\n        } else if (divisor.eq(MIN_VALUE))\r\n            return this.unsigned ? UZERO : ZERO;\r\n        if (this.isNegative()) {\r\n            if (divisor.isNegative())\r\n                return this.neg().div(divisor.neg());\r\n            return this.neg().div(divisor).neg();\r\n        } else if (divisor.isNegative())\r\n            return this.div(divisor.neg()).neg();\r\n        res = ZERO;\r\n    } else {\r\n        // The algorithm below has not been made for unsigned longs. It's therefore\r\n        // required to take special care of the MSB prior to running it.\r\n        if (!divisor.unsigned)\r\n            divisor = divisor.toUnsigned();\r\n        if (divisor.gt(this))\r\n            return UZERO;\r\n        if (divisor.gt(this.shru(1))) // 15 >>> 1 = 7 ; with divisor = 8 ; true\r\n            return UONE;\r\n        res = UZERO;\r\n    }\r\n\r\n    // Repeat the following until the remainder is less than other:  find a\r\n    // floating-point that approximates remainder / other *from below*, add this\r\n    // into the result, and subtract it from the remainder.  It is critical that\r\n    // the approximate value is less than or equal to the real value so that the\r\n    // remainder never becomes negative.\r\n    rem = this;\r\n    while (rem.gte(divisor)) {\r\n        // Approximate the result of division. This may be a little greater or\r\n        // smaller than the actual value.\r\n        approx = Math.max(1, Math.floor(rem.toNumber() / divisor.toNumber()));\r\n\r\n        // We will tweak the approximate result by changing it in the 48-th digit or\r\n        // the smallest non-fractional digit, whichever is larger.\r\n        var log2 = Math.ceil(Math.log(approx) / Math.LN2),\r\n            delta = (log2 <= 48) ? 1 : pow_dbl(2, log2 - 48),\r\n\r\n        // Decrease the approximation until it is smaller than the remainder.  Note\r\n        // that if it is too large, the product overflows and is negative.\r\n            approxRes = fromNumber(approx),\r\n            approxRem = approxRes.mul(divisor);\r\n        while (approxRem.isNegative() || approxRem.gt(rem)) {\r\n            approx -= delta;\r\n            approxRes = fromNumber(approx, this.unsigned);\r\n            approxRem = approxRes.mul(divisor);\r\n        }\r\n\r\n        // We know the answer can't be zero... and actually, zero would cause\r\n        // infinite recursion since we would make no progress.\r\n        if (approxRes.isZero())\r\n            approxRes = ONE;\r\n\r\n        res = res.add(approxRes);\r\n        rem = rem.sub(approxRem);\r\n    }\r\n    return res;\r\n};\r\n\r\n/**\r\n * Returns this Long divided by the specified. This is an alias of {@link Long#divide}.\r\n * @function\r\n * @param {!Long|number|string} divisor Divisor\r\n * @returns {!Long} Quotient\r\n */\r\nLongPrototype.div = LongPrototype.divide;\r\n\r\n/**\r\n * Returns this Long modulo the specified.\r\n * @param {!Long|number|string} divisor Divisor\r\n * @returns {!Long} Remainder\r\n */\r\nLongPrototype.modulo = function modulo(divisor) {\r\n    if (!isLong(divisor))\r\n        divisor = fromValue(divisor);\r\n\r\n    // use wasm support if present\r\n    if (wasm) {\r\n        var low = (this.unsigned ? wasm.rem_u : wasm.rem_s)(\r\n            this.low,\r\n            this.high,\r\n            divisor.low,\r\n            divisor.high\r\n        );\r\n        return fromBits(low, wasm.get_high(), this.unsigned);\r\n    }\r\n\r\n    return this.sub(this.div(divisor).mul(divisor));\r\n};\r\n\r\n/**\r\n * Returns this Long modulo the specified. This is an alias of {@link Long#modulo}.\r\n * @function\r\n * @param {!Long|number|string} divisor Divisor\r\n * @returns {!Long} Remainder\r\n */\r\nLongPrototype.mod = LongPrototype.modulo;\r\n\r\n/**\r\n * Returns this Long modulo the specified. This is an alias of {@link Long#modulo}.\r\n * @function\r\n * @param {!Long|number|string} divisor Divisor\r\n * @returns {!Long} Remainder\r\n */\r\nLongPrototype.rem = LongPrototype.modulo;\r\n\r\n/**\r\n * Returns the bitwise NOT of this Long.\r\n * @returns {!Long}\r\n */\r\nLongPrototype.not = function not() {\r\n    return fromBits(~this.low, ~this.high, this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns the bitwise AND of this Long and the specified.\r\n * @param {!Long|number|string} other Other Long\r\n * @returns {!Long}\r\n */\r\nLongPrototype.and = function and(other) {\r\n    if (!isLong(other))\r\n        other = fromValue(other);\r\n    return fromBits(this.low & other.low, this.high & other.high, this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns the bitwise OR of this Long and the specified.\r\n * @param {!Long|number|string} other Other Long\r\n * @returns {!Long}\r\n */\r\nLongPrototype.or = function or(other) {\r\n    if (!isLong(other))\r\n        other = fromValue(other);\r\n    return fromBits(this.low | other.low, this.high | other.high, this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns the bitwise XOR of this Long and the given one.\r\n * @param {!Long|number|string} other Other Long\r\n * @returns {!Long}\r\n */\r\nLongPrototype.xor = function xor(other) {\r\n    if (!isLong(other))\r\n        other = fromValue(other);\r\n    return fromBits(this.low ^ other.low, this.high ^ other.high, this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns this Long with bits shifted to the left by the given amount.\r\n * @param {number|!Long} numBits Number of bits\r\n * @returns {!Long} Shifted Long\r\n */\r\nLongPrototype.shiftLeft = function shiftLeft(numBits) {\r\n    if (isLong(numBits))\r\n        numBits = numBits.toInt();\r\n    if ((numBits &= 63) === 0)\r\n        return this;\r\n    else if (numBits < 32)\r\n        return fromBits(this.low << numBits, (this.high << numBits) | (this.low >>> (32 - numBits)), this.unsigned);\r\n    else\r\n        return fromBits(0, this.low << (numBits - 32), this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns this Long with bits shifted to the left by the given amount. This is an alias of {@link Long#shiftLeft}.\r\n * @function\r\n * @param {number|!Long} numBits Number of bits\r\n * @returns {!Long} Shifted Long\r\n */\r\nLongPrototype.shl = LongPrototype.shiftLeft;\r\n\r\n/**\r\n * Returns this Long with bits arithmetically shifted to the right by the given amount.\r\n * @param {number|!Long} numBits Number of bits\r\n * @returns {!Long} Shifted Long\r\n */\r\nLongPrototype.shiftRight = function shiftRight(numBits) {\r\n    if (isLong(numBits))\r\n        numBits = numBits.toInt();\r\n    if ((numBits &= 63) === 0)\r\n        return this;\r\n    else if (numBits < 32)\r\n        return fromBits((this.low >>> numBits) | (this.high << (32 - numBits)), this.high >> numBits, this.unsigned);\r\n    else\r\n        return fromBits(this.high >> (numBits - 32), this.high >= 0 ? 0 : -1, this.unsigned);\r\n};\r\n\r\n/**\r\n * Returns this Long with bits arithmetically shifted to the right by the given amount. This is an alias of {@link Long#shiftRight}.\r\n * @function\r\n * @param {number|!Long} numBits Number of bits\r\n * @returns {!Long} Shifted Long\r\n */\r\nLongPrototype.shr = LongPrototype.shiftRight;\r\n\r\n/**\r\n * Returns this Long with bits logically shifted to the right by the given amount.\r\n * @param {number|!Long} numBits Number of bits\r\n * @returns {!Long} Shifted Long\r\n */\r\nLongPrototype.shiftRightUnsigned = function shiftRightUnsigned(numBits) {\r\n    if (isLong(numBits))\r\n        numBits = numBits.toInt();\r\n    numBits &= 63;\r\n    if (numBits === 0)\r\n        return this;\r\n    else {\r\n        var high = this.high;\r\n        if (numBits < 32) {\r\n            var low = this.low;\r\n            return fromBits((low >>> numBits) | (high << (32 - numBits)), high >>> numBits, this.unsigned);\r\n        } else if (numBits === 32)\r\n            return fromBits(high, 0, this.unsigned);\r\n        else\r\n            return fromBits(high >>> (numBits - 32), 0, this.unsigned);\r\n    }\r\n};\r\n\r\n/**\r\n * Returns this Long with bits logically shifted to the right by the given amount. This is an alias of {@link Long#shiftRightUnsigned}.\r\n * @function\r\n * @param {number|!Long} numBits Number of bits\r\n * @returns {!Long} Shifted Long\r\n */\r\nLongPrototype.shru = LongPrototype.shiftRightUnsigned;\r\n\r\n/**\r\n * Returns this Long with bits logically shifted to the right by the given amount. This is an alias of {@link Long#shiftRightUnsigned}.\r\n * @function\r\n * @param {number|!Long} numBits Number of bits\r\n * @returns {!Long} Shifted Long\r\n */\r\nLongPrototype.shr_u = LongPrototype.shiftRightUnsigned;\r\n\r\n/**\r\n * Converts this Long to signed.\r\n * @returns {!Long} Signed long\r\n */\r\nLongPrototype.toSigned = function toSigned() {\r\n    if (!this.unsigned)\r\n        return this;\r\n    return fromBits(this.low, this.high, false);\r\n};\r\n\r\n/**\r\n * Converts this Long to unsigned.\r\n * @returns {!Long} Unsigned long\r\n */\r\nLongPrototype.toUnsigned = function toUnsigned() {\r\n    if (this.unsigned)\r\n        return this;\r\n    return fromBits(this.low, this.high, true);\r\n};\r\n\r\n/**\r\n * Converts this Long to its byte representation.\r\n * @param {boolean=} le Whether little or big endian, defaults to big endian\r\n * @returns {!Array.<number>} Byte representation\r\n */\r\nLongPrototype.toBytes = function toBytes(le) {\r\n    return le ? this.toBytesLE() : this.toBytesBE();\r\n};\r\n\r\n/**\r\n * Converts this Long to its little endian byte representation.\r\n * @returns {!Array.<number>} Little endian byte representation\r\n */\r\nLongPrototype.toBytesLE = function toBytesLE() {\r\n    var hi = this.high,\r\n        lo = this.low;\r\n    return [\r\n        lo        & 0xff,\r\n        lo >>>  8 & 0xff,\r\n        lo >>> 16 & 0xff,\r\n        lo >>> 24       ,\r\n        hi        & 0xff,\r\n        hi >>>  8 & 0xff,\r\n        hi >>> 16 & 0xff,\r\n        hi >>> 24\r\n    ];\r\n};\r\n\r\n/**\r\n * Converts this Long to its big endian byte representation.\r\n * @returns {!Array.<number>} Big endian byte representation\r\n */\r\nLongPrototype.toBytesBE = function toBytesBE() {\r\n    var hi = this.high,\r\n        lo = this.low;\r\n    return [\r\n        hi >>> 24       ,\r\n        hi >>> 16 & 0xff,\r\n        hi >>>  8 & 0xff,\r\n        hi        & 0xff,\r\n        lo >>> 24       ,\r\n        lo >>> 16 & 0xff,\r\n        lo >>>  8 & 0xff,\r\n        lo        & 0xff\r\n    ];\r\n};\r\n\r\n/**\r\n * Creates a Long from its byte representation.\r\n * @param {!Array.<number>} bytes Byte representation\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @param {boolean=} le Whether little or big endian, defaults to big endian\r\n * @returns {Long} The corresponding Long value\r\n */\r\nLong.fromBytes = function fromBytes(bytes, unsigned, le) {\r\n    return le ? Long.fromBytesLE(bytes, unsigned) : Long.fromBytesBE(bytes, unsigned);\r\n};\r\n\r\n/**\r\n * Creates a Long from its little endian byte representation.\r\n * @param {!Array.<number>} bytes Little endian byte representation\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @returns {Long} The corresponding Long value\r\n */\r\nLong.fromBytesLE = function fromBytesLE(bytes, unsigned) {\r\n    return new Long(\r\n        bytes[0]       |\r\n        bytes[1] <<  8 |\r\n        bytes[2] << 16 |\r\n        bytes[3] << 24,\r\n        bytes[4]       |\r\n        bytes[5] <<  8 |\r\n        bytes[6] << 16 |\r\n        bytes[7] << 24,\r\n        unsigned\r\n    );\r\n};\r\n\r\n/**\r\n * Creates a Long from its big endian byte representation.\r\n * @param {!Array.<number>} bytes Big endian byte representation\r\n * @param {boolean=} unsigned Whether unsigned or not, defaults to signed\r\n * @returns {Long} The corresponding Long value\r\n */\r\nLong.fromBytesBE = function fromBytesBE(bytes, unsigned) {\r\n    return new Long(\r\n        bytes[4] << 24 |\r\n        bytes[5] << 16 |\r\n        bytes[6] <<  8 |\r\n        bytes[7],\r\n        bytes[0] << 24 |\r\n        bytes[1] << 16 |\r\n        bytes[2] <<  8 |\r\n        bytes[3],\r\n        unsigned\r\n    );\r\n};\r\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n// Workaround for allowing cjs module to be included in bundle created by\n// rollup.\nimport * as LongExports from 'long';\n// tslint:disable-next-line\nconst Long: LongExports.LongConstructor =\n    // tslint:disable-next-line\n    (LongExports as any).default || LongExports;\n\nexport function hexToLong(hex: string): Long {\n  return Long.fromString(hex, true, 16);\n}\n\n// Some primes between 2^63 and 2^64 for various uses.\n// Hex 0xc3a5c85c97cb3127\nconst k0: Long = hexToLong('c3a5c85c97cb3127');\n// Hex 0xb492b66fbe98f273\nconst k1: Long = hexToLong('b492b66fbe98f273');\n// Hex 0x9ae16a3b2f90404f\nconst k2: Long = hexToLong('9ae16a3b2f90404f');\n\nfunction shiftMix(val: Long): Long {\n  return val.xor(val.shru(47));\n}\n\nfunction fetch(s: Uint8Array, offset: number, numBytes: number): Long {\n  const bytes = s.slice(offset, offset + numBytes);\n  return Long.fromBytes(Array.from(bytes), true, true);\n}\n\nfunction fetch64(s: Uint8Array, offset: number): Long {\n  return fetch(s, offset, 8);\n}\n\nfunction fetch32(s: Uint8Array, offset: number): Long {\n  return fetch(s, offset, 4);\n}\n\nfunction rotate64(val: Long, shift: number): Long {\n  // Avoid shifting by 64: doing so yields an undefined result.\n  return shift === 0 ? val : val.shru(shift).or(val.shl(64 - shift));\n}\n\nfunction hashLen16(u: Long, v: Long, mul = hexToLong('9ddfea08eb382d69')) {\n  // Murmur-inspired hashing.\n  let a = u.xor(v).mul(mul);\n  a = a.xor(a.shru(47));\n  let b = v.xor(a).mul(mul);\n  b = b.xor(b.shru(47));\n  b = b.mul(mul);\n  return b;\n}\n\n// Return a 16-byte hash for 48 bytes.  Quick and dirty.\n// Callers do best to use \"random-looking\" values for a and b.\nfunction weakHashLen32WithSeeds(\n    w: Long, x: Long, y: Long, z: Long, a: Long, b: Long) {\n  a = a.add(w);\n  b = rotate64(b.add(a).add(z), 21);\n  const c = a;\n  a = a.add(x);\n  a = a.add(y);\n  b = b.add(rotate64(a, 44));\n  return [a.add(z), b.add(c)];\n}\n\nfunction weakHashLen32WithSeedsStr(\n    s: Uint8Array, offset: number, a: Long, b: Long) {\n  return weakHashLen32WithSeeds(\n      fetch64(s, offset), fetch64(s, offset + 8), fetch64(s, offset + 16),\n      fetch64(s, offset + 24), a, b);\n}\n\nfunction hashLen0to16(s: Uint8Array, len = s.length): Long {\n  if (len >= 8) {\n    const mul = k2.add(len * 2);\n    const a = fetch64(s, 0).add(k2);\n    const b = fetch64(s, len - 8);\n    const c = rotate64(b, 37).mul(mul).add(a);\n    const d = rotate64(a, 25).add(b).mul(mul);\n    return hashLen16(c, d, mul);\n  }\n  if (len >= 4) {\n    const mul = k2.add(len * 2);\n    const a = fetch32(s, 0);\n    return hashLen16(a.shl(3).add(len), fetch32(s, len - 4), mul);\n  }\n  if (len > 0) {\n    const a = s[0];\n    const b = s[len >> 1];\n    const c = s[len - 1];\n    const y = a + (b << 8);\n    const z = len + (c << 2);\n    return shiftMix(k2.mul(y).xor(k0.mul(z))).mul(k2);\n  }\n  return k2;\n}\n\nfunction hashLen17to32(s: Uint8Array, len = s.length): Long {\n  const mul = k2.add(len * 2);\n  const a = fetch64(s, 0).mul(k1);\n  const b = fetch64(s, 8);\n  const c = fetch64(s, len - 8).mul(mul);\n  const d = fetch64(s, len - 16).mul(k2);\n  return hashLen16(\n      rotate64(a.add(b), 43).add(rotate64(c, 30)).add(d),\n      a.add(rotate64(b.add(k2), 18)).add(c), mul);\n}\n\nfunction hashLen33to64(s: Uint8Array, len = s.length): Long {\n  const mul = k2.add(len * 2);\n  const a = fetch64(s, 0).mul(k2);\n  const b = fetch64(s, 8);\n  const c = fetch64(s, len - 8).mul(mul);\n  const d = fetch64(s, len - 16).mul(k2);\n  const y = rotate64(a.add(b), 43).add(rotate64(c, 30)).add(d);\n  const z = hashLen16(y, a.add(rotate64(b.add(k2), 18)).add(c), mul);\n  const e = fetch64(s, 16).mul(mul);\n  const f = fetch64(s, 24);\n  const g = y.add(fetch64(s, len - 32)).mul(mul);\n  const h = z.add(fetch64(s, len - 24)).mul(mul);\n  return hashLen16(\n      rotate64(e.add(f), 43).add(rotate64(g, 30)).add(h),\n      e.add(rotate64(f.add(a), 18)).add(g), mul);\n}\n\nexport function fingerPrint64(s: Uint8Array, len = s.length): Long {\n  const seed: Long = Long.fromNumber(81, true);\n  if (len <= 32) {\n    if (len <= 16) {\n      return hashLen0to16(s, len);\n    } else {\n      return hashLen17to32(s, len);\n    }\n  } else if (len <= 64) {\n    return hashLen33to64(s, len);\n  }\n\n  // For strings over 64 bytes we loop.  Internal state consists of\n  // 56 bytes: v, w, x, y, and z.\n  let x = seed;\n  let y = seed.mul(k1).add(113);\n\n  let z = shiftMix(y.mul(k2).add(113)).mul(k2);\n  let v = [Long.UZERO, Long.UZERO];\n  let w = [Long.UZERO, Long.UZERO];\n  x = x.mul(k2).add(fetch64(s, 0));\n\n  let offset = 0;\n  // Set end so that after the loop we have 1 to 64 bytes left to process.\n  const end = ((len - 1) >> 6) * 64;\n  const last64 = end + ((len - 1) & 63) - 63;\n\n  do {\n    x = rotate64(x.add(y).add(v[0]).add(fetch64(s, offset + 8)), 37).mul(k1);\n    y = rotate64(y.add(v[1]).add(fetch64(s, offset + 48)), 42).mul(k1);\n    x = x.xor(w[1]);\n    y = y.add(v[0]).add(fetch64(s, offset + 40));\n    z = rotate64(z.add(w[0]), 33).mul(k1);\n    v = weakHashLen32WithSeedsStr(s, offset, v[1].mul(k1), x.add(w[0]));\n    w = weakHashLen32WithSeedsStr(\n        s, offset + 32, z.add(w[1]), y.add(fetch64(s, offset + 16)));\n\n    [z, x] = [x, z];\n    offset += 64;\n  } while (offset !== end);\n  const mul = k1.add(z.and(0xff).shl(1));\n  // Point to the last 64 bytes of input.\n  offset = last64;\n\n  w[0] = w[0].add((len - 1) & 63);\n  v[0] = v[0].add(w[0]);\n  w[0] = w[0].add(v[0]);\n\n  x = rotate64(x.add(y).add(v[0]).add(fetch64(s, offset + 8)), 37).mul(mul);\n  y = rotate64(y.add(v[1]).add(fetch64(s, offset + 48)), 42).mul(mul);\n  x = x.xor(w[1].mul(9));\n  y = y.add(v[0].mul(9).add(fetch64(s, offset + 40)));\n  z = rotate64(z.add(w[0]), 33).mul(mul);\n  v = weakHashLen32WithSeedsStr(s, offset, v[1].mul(mul), x.add(w[0]));\n  w = weakHashLen32WithSeedsStr(\n      s, offset + 32, z.add(w[1]), y.add(fetch64(s, offset + 16)));\n\n  [z, x] = [x, z];\n\n  return hashLen16(\n      hashLen16(v[0], w[0], mul).add(shiftMix(y).mul(k0)).add(z),\n      hashLen16(v[1], w[1], mul).add(x), mul);\n}\n", "/**\n * @license\n * Copyright 2017 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {env} from './environment';\nimport {isTypedArrayBrowser} from './platforms/is_typed_array_browser';\nimport {BackendValues, DataType, RecursiveArray, TensorLike, TypedArray} from './types';\nimport * as base from './util_base';\nexport * from './util_base';\nexport * from './hash_util';\n\n/**\n * Create typed array for scalar value. Used for storing in `DataStorage`.\n */\nexport function createScalarValue(\n    value: DataType, dtype: DataType): BackendValues {\n  if (dtype === 'string') {\n    return encodeString(value);\n  }\n\n  return toTypedArray([value], dtype);\n}\n\nfunction noConversionNeeded(a: TensorLike, dtype: DataType): boolean {\n  return (a instanceof Float32Array && dtype === 'float32') ||\n      (a instanceof Int32Array && dtype === 'int32') ||\n      (a instanceof Uint8Array && dtype === 'bool');\n}\n\nexport function toTypedArray(a: TensorLike, dtype: DataType): TypedArray {\n  if (dtype === 'string') {\n    throw new Error('Cannot convert a string[] to a TypedArray');\n  }\n  if (Array.isArray(a)) {\n    a = flatten(a);\n  }\n\n  if (env().getBool('DEBUG')) {\n    base.checkConversionForErrors(a as number[], dtype);\n  }\n  if (noConversionNeeded(a, dtype)) {\n    return a as TypedArray;\n  }\n  if (dtype == null || dtype === 'float32' || dtype === 'complex64') {\n    return new Float32Array(a as number[]);\n  } else if (dtype === 'int32') {\n    return new Int32Array(a as number[]);\n  } else if (dtype === 'bool') {\n    const bool = new Uint8Array((a as number[]).length);\n    for (let i = 0; i < bool.length; ++i) {\n      if (Math.round((a as number[])[i]) !== 0) {\n        bool[i] = 1;\n      }\n    }\n    return bool;\n  } else {\n    throw new Error(`Unknown data type ${dtype}`);\n  }\n}\n\n/**\n * Returns the current high-resolution time in milliseconds relative to an\n * arbitrary time in the past. It works across different platforms (node.js,\n * browsers).\n *\n * ```js\n * console.log(tf.util.now());\n * ```\n *\n * @doc {heading: 'Util', namespace: 'util'}\n */\nexport function now(): number {\n  return env().platform.now();\n}\n\n/**\n * Returns a platform-specific implementation of\n * [`fetch`](https://developer.mozilla.org/en-US/docs/Web/API/Fetch_API).\n *\n * If `fetch` is defined on the global object (`window`, `process`, etc.),\n * `tf.util.fetch` returns that function.\n *\n * If not, `tf.util.fetch` returns a platform-specific solution.\n *\n * ```js\n * const resource = await tf.util.fetch('https://cdn.jsdelivr.net/npm/@tensorflow/tfjs');\n * // handle response\n * ```\n *\n * @doc {heading: 'Util'}\n */\nexport function fetch(\n    path: string, requestInits?: RequestInit): Promise<Response> {\n  return env().platform.fetch(path, requestInits);\n}\n\n/**\n * Encodes the provided string into bytes using the provided encoding scheme.\n *\n * @param s The string to encode.\n * @param encoding The encoding scheme. Defaults to utf-8.\n *\n * @doc {heading: 'Util'}\n */\nexport function encodeString(s: string, encoding = 'utf-8'): Uint8Array {\n  encoding = encoding || 'utf-8';\n  return env().platform.encode(s, encoding);\n}\n\n/**\n * Decodes the provided bytes into a string using the provided encoding scheme.\n * @param bytes The bytes to decode.\n *\n * @param encoding The encoding scheme. Defaults to utf-8.\n *\n * @doc {heading: 'Util'}\n */\nexport function decodeString(bytes: Uint8Array, encoding = 'utf-8'): string {\n  encoding = encoding || 'utf-8';\n  return env().platform.decode(bytes, encoding);\n}\n\nexport function isTypedArray(a: {}): a is Float32Array|Int32Array|Uint8Array|\n    Uint8ClampedArray {\n  // TODO(mattsoulanille): Remove this fallback in 5.0.0\n  if (env().platform.isTypedArray != null) {\n    return env().platform.isTypedArray(a);\n  } else {\n    return isTypedArrayBrowser(a);\n  }\n}\n\n// NOTE: We explicitly type out what T extends instead of any so that\n// util.flatten on a nested array of number doesn't try to infer T as a\n// number[][], causing us to explicitly type util.flatten<number>().\n/**\n *  Flattens an arbitrarily nested array.\n *\n * ```js\n * const a = [[1, 2], [3, 4], [5, [6, [7]]]];\n * const flat = tf.util.flatten(a);\n * console.log(flat);\n * ```\n *\n *  @param arr The nested array to flatten.\n *  @param result The destination array which holds the elements.\n *  @param skipTypedArray If true, avoids flattening the typed arrays. Defaults\n *      to false.\n *\n * @doc {heading: 'Util', namespace: 'util'}\n */\nexport function\nflatten<T extends number|boolean|string|Promise<number>|TypedArray>(\n    arr: T|RecursiveArray<T>, result: T[] = [], skipTypedArray = false): T[] {\n  if (result == null) {\n    result = [];\n  }\n  if (typeof arr === 'boolean' || typeof arr === 'number' ||\n    typeof arr === 'string' || base.isPromise(arr) || arr == null ||\n      isTypedArray(arr) && skipTypedArray) {\n    result.push(arr as T);\n  } else if (Array.isArray(arr) || isTypedArray(arr)) {\n    for (let i = 0; i < arr.length; ++i) {\n      flatten(arr[i], result, skipTypedArray);\n    }\n  } else {\n    let maxIndex = -1;\n    for (const key of Object.keys(arr)) {\n      // 0 or positive integer.\n      if (/^([1-9]+[0-9]*|0)$/.test(key)) {\n        maxIndex = Math.max(maxIndex, Number(key));\n      }\n    }\n    for (let i = 0; i <= maxIndex; i++) {\n      // tslint:disable-next-line: no-unnecessary-type-assertion\n      flatten((arr as RecursiveArray<T>)[i], result, skipTypedArray);\n    }\n  }\n  return result;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {BackendTimer, BackendTimingInfo} from './backends/backend';\nimport {env} from './environment';\nimport {Tensor} from './tensor';\nimport {NamedTensorMap} from './tensor_types';\nimport {DataType, DataTypeMap, TypedArray} from './types';\nimport * as util from './util';\n\nexport type KernelProfile = {\n  kernelName: string,\n  outputs: Tensor[],\n  inputs: NamedTensorMap,\n  timeMs: Promise<number|{error: string}>,\n  extraInfo: Promise<string>\n};\n\nexport class Profiler {\n  constructor(private backendTimer: BackendTimer, private logger?: Logger) {\n    if (logger == null) {\n      this.logger = new Logger();\n    }\n  }\n\n  profileKernel(kernelName: string, inputs: NamedTensorMap, f: () => Tensor[]):\n      KernelProfile {\n    let outputs: Tensor[];\n    const holdResultWrapperFn = () => {\n      outputs = f();\n    };\n    let timer: Promise<BackendTimingInfo>;\n    const start = util.now();\n    if (this.backendTimer.timerAvailable()) {\n      timer = this.backendTimer.time(holdResultWrapperFn);\n    } else {\n      holdResultWrapperFn();\n      for (const output of outputs) {\n        output.dataSync();\n      }\n      timer = Promise.resolve({kernelMs: util.now() - start});\n    }\n    if (env().getBool('CHECK_COMPUTATION_FOR_ERRORS')) {\n      for (let i = 0; i < outputs.length; i++) {\n        const output = outputs[i];\n        // Dangling promise here because we don't want to propagate up\n        // asynchronicity.\n        output.data().then(tensorVals => {\n          checkComputationForErrors(tensorVals, output.dtype, kernelName);\n        });\n      }\n    }\n\n    const kernelProfile = {\n      kernelName,\n      outputs,\n      inputs,\n      timeMs: timer.then(timing => timing.kernelMs),\n      extraInfo: timer.then(\n          timing => timing.getExtraProfileInfo != null ?\n              timing.getExtraProfileInfo() :\n              '')\n    };\n    return kernelProfile;\n  }\n\n  logKernelProfile(kernelProfile: KernelProfile): void {\n    const {kernelName, outputs, timeMs, inputs, extraInfo} = kernelProfile;\n\n    outputs.forEach(result => {\n      Promise.all([result.data(), timeMs, extraInfo]).then(valueContainer => {\n        this.logger.logKernelProfile(\n            kernelName, result, valueContainer[0], valueContainer[1], inputs,\n            valueContainer[2]);\n      });\n    });\n  }\n}\n\nexport function checkComputationForErrors<D extends DataType>(\n    vals: DataTypeMap[D], dtype: D, kernelName: string): boolean {\n  if (dtype !== 'float32') {\n    // Only floating point computations will generate NaN values\n    return false;\n  }\n  for (let i = 0; i < vals.length; i++) {\n    const num = vals[i] as number;\n    if (isNaN(num) || !isFinite(num)) {\n      // Throwing custom exception so behavior is testable.\n      console.warn(`Found ${num} in the result of '${kernelName}'`);\n      return true;\n    }\n  }\n  return false;\n}\n\nexport class Logger {\n  logKernelProfile(\n      name: string, result: Tensor, vals: TypedArray,\n      timeMs: number|{error: string}, inputs: NamedTensorMap,\n      extraInfo?: string) {\n    const time = typeof timeMs === 'number' ? util.rightPad(`${timeMs}ms`, 9) :\n                                              timeMs['error'];\n    const paddedName = util.rightPad(name, 25);\n    const rank = result.rank;\n    const size = result.size;\n    const shape = util.rightPad(result.shape.toString(), 14);\n    let inputShapesDescription = '';\n\n    for (const name in inputs) {\n      const input = inputs[name];\n      if (input != null) {\n        // The input might be a non-tensor (e.g HTMLImageElement), in which case\n        // we claim the output shape as input shape.\n        const inputShape = input.shape || result.shape;\n        const inputRank = inputShape.length;\n        inputShapesDescription +=\n            `${name}: ${inputRank}D ${inputRank > 0 ? inputShape : ''} `;\n      }\n    }\n\n    console.log(\n        `%c${paddedName}\\t%c${time}\\t%c${rank}D ${shape}\\t%c${size}\\t%c${\n            inputShapesDescription}\\t%c${extraInfo}`,\n        'font-weight:bold', 'color:red', 'color:blue', 'color: orange',\n        'color: green', 'color: steelblue');\n  }\n}\n", "/**\n * @license\n * Copyright 2017 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from './tensor';\nimport {NamedTensorMap} from './tensor_types';\nimport * as util from './util';\n\nexport interface TapeNode {\n  id: number;\n  kernelName: string;\n  outputs: Tensor[];\n  inputs: NamedTensorMap;\n  // Optional params, defined only for ops with gradient impl.\n  gradient?: (dys: Tensor[]) => NamedGradientMap;\n  saved?: Tensor[];\n}\n\nexport type NamedGradientMap = {\n  [inputName: string]: () => Tensor;\n};\n\n/**\n * Computes a list of TapeNodes that connect x to y, filtering everything else\n * out and preserving the order of the original tape elements.\n *\n * @param tape The tape elements to filter.\n * @param xs The input Tensors.\n * @param y The output Tensor.\n */\nexport function getFilteredNodesXToY(\n    tape: TapeNode[], xs: Tensor[], y: Tensor): TapeNode[] {\n  // Forward pass to compute all the nodes and Tensors that are transitively a\n  // function of x.\n  const tensorsFromX: {[tensorId: number]: boolean} = {};\n  const nodesFromX: {[nodeId: number]: boolean} = {};\n  for (let i = 0; i < xs.length; i++) {\n    tensorsFromX[xs[i].id] = true;\n  }\n\n  for (let i = 0; i < tape.length; i++) {\n    const node = tape[i];\n    const nodeInputs = node.inputs;\n    for (const inputName in nodeInputs) {\n      const input = nodeInputs[inputName];\n\n      let anyInputFromX = false;\n      for (let j = 0; j < xs.length; j++) {\n        if (tensorsFromX[input.id]) {\n          node.outputs.forEach(output => tensorsFromX[output.id] = true);\n          anyInputFromX = true;\n          nodesFromX[node.id] = true;\n          break;\n        }\n      }\n\n      if (anyInputFromX) {\n        break;\n      }\n    }\n  }\n\n  // Backward pass to find all of the nodes and Tensors that lead to y.\n  const tensorsLeadToY: {[tensorId: number]: boolean} = {};\n  tensorsLeadToY[y.id] = true;\n  const nodesToY: {[nodeId: number]: boolean} = {};\n\n  for (let i = tape.length - 1; i >= 0; i--) {\n    const node = tape[i];\n    const nodeInputs = node.inputs;\n\n    // If any of the outputs lead to y, mark all of the inputs as leading to y.\n    for (let j = 0; j < node.outputs.length; j++) {\n      if (tensorsLeadToY[node.outputs[j].id]) {\n        for (const inputName in nodeInputs) {\n          tensorsLeadToY[nodeInputs[inputName].id] = true;\n          nodesToY[node.id] = true;\n        }\n        break;\n      }\n    }\n  }\n\n  // Return the paths that come from x and lead to y.\n  const filteredTape: TapeNode[] = [];\n  for (let i = 0; i < tape.length; i++) {\n    const node = tape[i];\n\n    if (nodesFromX[node.id] && nodesToY[node.id]) {\n      // Prune the inputs from the node that aren't a function of x.\n      const prunedInputs: {[inputName: string]: Tensor} = {};\n      for (const inputName in node.inputs) {\n        const nodeInput = node.inputs[inputName];\n        if (tensorsFromX[nodeInput.id]) {\n          prunedInputs[inputName] = nodeInput;\n        }\n      }\n\n      // Copy the node and overwrite inputsAndArgs to the pruned version.\n      const prunedNode = Object.assign({}, node);\n      prunedNode.inputs = prunedInputs;\n      prunedNode.outputs = node.outputs;\n\n      filteredTape.push(prunedNode);\n    }\n  }\n\n  return filteredTape;\n}\n\n/**\n * Backpropagate gradients through the filtered TapeNodes.\n *\n * @param tensorAccumulatedGradientMap A map of Tensor to its gradient. This map\n * is mutated by this method.\n * @param filteredTape The filtered TapeNodes to backprop through.\n */\nexport function backpropagateGradients(\n    tensorAccumulatedGradientMap: {[tensorId: number]: Tensor},\n    filteredTape: TapeNode[], tidy: (f: Function) => Tensor,\n    add: (a: Tensor, b: Tensor) => Tensor) {\n  // Walk the tape backward and keep a map of Tensor to its gradient.\n  for (let i = filteredTape.length - 1; i >= 0; i--) {\n    const node = filteredTape[i];\n\n    const dys: Tensor[] = [];\n    node.outputs.forEach(o => {\n      const gradTensor = tensorAccumulatedGradientMap[o.id];\n      if (gradTensor != null) {\n        dys.push(gradTensor);\n      } else {\n        // This particular output is not in the back-propagation subgraph, so it\n        // does not affect the final output, thus we put null for its dy.\n        dys.push(null);\n      }\n    });\n\n    if (node.gradient == null) {\n      throw new Error(\n          `Cannot compute gradient: gradient function not found ` +\n          `for ${node.kernelName}.`);\n    }\n\n    // Backprop dy through this node and accumulate gradients over the inputs.\n    const inputGradients = node.gradient(dys);\n\n    for (const inputName in node.inputs) {\n      if (!(inputName in inputGradients)) {\n        throw new Error(\n            `Cannot backprop through input ${inputName}. ` +\n            `Available gradients found: ${Object.keys(inputGradients)}.`);\n      }\n\n      // Call the gradient function.\n      const dx = tidy(() => inputGradients[inputName]());\n      if (dx.dtype !== 'float32') {\n        throw new Error(\n            `Error in gradient for op ${\n                node.kernelName}. The gradient of input ` +\n            `${inputName} must have 'float32' dtype, but has '${dx.dtype}'`);\n      }\n      const x = node.inputs[inputName];\n      if (!util.arraysEqual(dx.shape, x.shape)) {\n        throw new Error(\n            `Error in gradient for op ${\n                node.kernelName}. The gradient of input ` +\n            `'${inputName}' has shape '${dx.shape}', which does not match ` +\n            `the shape of the input '${x.shape}'`);\n      }\n\n      if (tensorAccumulatedGradientMap[x.id] == null) {\n        tensorAccumulatedGradientMap[x.id] = dx;\n      } else {\n        const curGradient = tensorAccumulatedGradientMap[x.id];\n        tensorAccumulatedGradientMap[x.id] = add(curGradient, dx);\n        curGradient.dispose();\n      }\n    }\n  }\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {DataType, TypedArray} from './types';\nimport {computeStrides, isString, rightPad, sizeFromShape} from './util';\n\n// Maximum number of values before we decide to show ellipsis.\nconst FORMAT_LIMIT_NUM_VALS = 20;\n// Number of first and last values to show when displaying a, b,...,y, z.\nconst FORMAT_NUM_FIRST_LAST_VALS = 3;\n// Number of significant digits to show.\nconst FORMAT_NUM_SIG_DIGITS = 7;\n\nexport function tensorToString(\n    vals: TypedArray|string[], shape: number[], dtype: DataType,\n    verbose: boolean) {\n  const strides = computeStrides(shape);\n  const padPerCol = computeMaxSizePerColumn(vals, shape, dtype, strides);\n  const rank = shape.length;\n  const valsLines = subTensorToString(vals, shape, dtype, strides, padPerCol);\n  const lines = ['Tensor'];\n  if (verbose) {\n    lines.push(`  dtype: ${dtype}`);\n    lines.push(`  rank: ${rank}`);\n    lines.push(`  shape: [${shape}]`);\n    lines.push(`  values:`);\n  }\n  lines.push(valsLines.map(l => '    ' + l).join('\\n'));\n  return lines.join('\\n');\n}\n\nfunction computeMaxSizePerColumn(\n    vals: TypedArray|string[], shape: number[], dtype: DataType,\n    strides: number[]): number[] {\n  const n = sizeFromShape(shape);\n  const numCols = strides[strides.length - 1];\n  const padPerCol = new Array(numCols).fill(0);\n  const rank = shape.length;\n  const valuesOrTuples =\n      dtype === 'complex64' ? createComplexTuples(vals) : vals;\n\n  if (rank > 1) {\n    for (let row = 0; row < n / numCols; row++) {\n      const offset = row * numCols;\n      for (let j = 0; j < numCols; j++) {\n        padPerCol[j] = Math.max(\n            padPerCol[j],\n            valToString(valuesOrTuples[offset + j], 0, dtype).length);\n      }\n    }\n  }\n  return padPerCol;\n}\n\nfunction valToString(\n    val: number|string|[number, number], pad: number, dtype: DataType) {\n  let valStr: string;\n  if (Array.isArray(val)) {\n    valStr = `${parseFloat(val[0].toFixed(FORMAT_NUM_SIG_DIGITS))} + ` +\n        `${parseFloat(val[1].toFixed(FORMAT_NUM_SIG_DIGITS))}j`;\n  } else if (isString(val)) {\n    valStr = `'${val}'`;\n  } else if (dtype === 'bool') {\n    valStr = boolNumToString(val);\n  } else {\n    valStr = parseFloat(val.toFixed(FORMAT_NUM_SIG_DIGITS)).toString();\n  }\n\n  return rightPad(valStr, pad);\n}\n\nfunction boolNumToString(v: number): string {\n  return v === 0 ? 'false' : 'true';\n}\n\nfunction subTensorToString(\n    vals: TypedArray|string[], shape: number[], dtype: DataType,\n    strides: number[], padPerCol: number[], isLast = true): string[] {\n  const storagePerElement = dtype === 'complex64' ? 2 : 1;\n\n  const size = shape[0];\n  const rank = shape.length;\n  if (rank === 0) {\n    if (dtype === 'complex64') {\n      const complexTuple = createComplexTuples(vals);\n      return [valToString(complexTuple[0], 0, dtype)];\n    }\n    if (dtype === 'bool') {\n      return [boolNumToString(vals[0] as number)];\n    }\n    return [vals[0].toString()];\n  }\n\n  if (rank === 1) {\n    if (size > FORMAT_LIMIT_NUM_VALS) {\n      const firstValsSize = FORMAT_NUM_FIRST_LAST_VALS * storagePerElement;\n\n      let firstVals = Array.from<number|string|[number, number]>(\n          vals.slice(0, firstValsSize));\n      let lastVals = Array.from<number|string|[number, number]>(vals.slice(\n          (size - FORMAT_NUM_FIRST_LAST_VALS) * storagePerElement,\n          size * storagePerElement));\n      if (dtype === 'complex64') {\n        firstVals = createComplexTuples(firstVals);\n        lastVals = createComplexTuples(lastVals);\n      }\n      return [\n        '[' +\n        firstVals.map((x, i) => valToString(x, padPerCol[i], dtype))\n            .join(', ') +\n        ', ..., ' +\n        lastVals\n            .map(\n                (x, i) => valToString(\n                    x, padPerCol[size - FORMAT_NUM_FIRST_LAST_VALS + i], dtype))\n            .join(', ') +\n        ']'\n      ];\n    }\n    const displayVals: Array<number|string|[number, number]> =\n        dtype === 'complex64' ? createComplexTuples(vals) :\n                                Array.from<number|string>(vals);\n\n    return [\n      '[' +\n      displayVals.map((x, i) => valToString(x, padPerCol[i], dtype))\n          .join(', ') +\n      ']'\n    ];\n  }\n\n  // The array is rank 2 or more.\n  const subshape = shape.slice(1);\n  const substrides = strides.slice(1);\n  const stride = strides[0] * storagePerElement;\n  const lines: string[] = [];\n  if (size > FORMAT_LIMIT_NUM_VALS) {\n    for (let i = 0; i < FORMAT_NUM_FIRST_LAST_VALS; i++) {\n      const start = i * stride;\n      const end = start + stride;\n      lines.push(...subTensorToString(\n          vals.slice(start, end), subshape, dtype, substrides, padPerCol,\n          false /* isLast */));\n    }\n    lines.push('...');\n    for (let i = size - FORMAT_NUM_FIRST_LAST_VALS; i < size; i++) {\n      const start = i * stride;\n      const end = start + stride;\n      lines.push(...subTensorToString(\n          vals.slice(start, end), subshape, dtype, substrides, padPerCol,\n          i === size - 1 /* isLast */));\n    }\n  } else {\n    for (let i = 0; i < size; i++) {\n      const start = i * stride;\n      const end = start + stride;\n      lines.push(...subTensorToString(\n          vals.slice(start, end), subshape, dtype, substrides, padPerCol,\n          i === size - 1 /* isLast */));\n    }\n  }\n  const sep = rank === 2 ? ',' : '';\n  lines[0] = '[' + (size > 0 ? lines[0] + sep : '');\n  for (let i = 1; i < lines.length - 1; i++) {\n    lines[i] = ' ' + lines[i] + sep;\n  }\n  let newLineSep = ',\\n';\n  for (let i = 2; i < rank; i++) {\n    newLineSep += '\\n';\n  }\n  lines[lines.length - 1] =\n      ' ' + lines[lines.length - 1] + ']' + (isLast ? '' : newLineSep);\n  return lines;\n}\n\nfunction createComplexTuples(vals: Array<{}>|\n                             TypedArray): Array<[number, number]> {\n  const complexTuples: Array<[number, number]> = [];\n  for (let i = 0; i < vals.length; i += 2) {\n    complexTuples.push([vals[i], vals[i + 1]] as [number, number]);\n  }\n  return complexTuples;\n}\n", "/**\n * @license\n * Copyright 2017 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n// Workaround for: https://github.com/bazelbuild/rules_nodejs/issues/1265\n/// <reference types=\"@webgpu/types/dist\" />\n\nimport {getGlobal} from './global_util';\nimport {tensorToString} from './tensor_format';\nimport {DataId, TensorInfo} from './tensor_info';\nimport {ArrayMap, BackendValues, DataType, DataTypeMap, DataValues, NumericDataType, Rank, ShapeMap, SingleValueMap, TypedArray} from './types';\nimport * as util from './util';\nimport {computeStrides, toNestedArray} from './util';\n\nexport interface TensorData<D extends DataType> {\n  dataId?: DataId;\n  values?: DataTypeMap[D];\n}\n\n// This interface mimics KernelBackend (in backend.ts), which would create a\n// circular dependency if imported.\nexport interface Backend {}\n\n/**\n * A mutable object, similar to `tf.Tensor`, that allows users to set values\n * at locations before converting to an immutable `tf.Tensor`.\n *\n * See `tf.buffer` for creating a tensor buffer.\n *\n * @doc {heading: 'Tensors', subheading: 'Classes'}\n */\nexport class TensorBuffer<R extends Rank, D extends DataType = 'float32'> {\n  size: number;\n  shape: ShapeMap[R];\n  strides: number[];\n  values: DataTypeMap[D];\n\n  constructor(shape: ShapeMap[R], public dtype: D, values?: DataTypeMap[D]) {\n    this.shape = shape.slice() as ShapeMap[R];\n    this.size = util.sizeFromShape(shape);\n\n    if (values != null) {\n      const n = values.length;\n      util.assert(\n          n === this.size,\n          () => `Length of values '${n}' does not match the size ` +\n              `inferred by the shape '${this.size}'.`);\n    }\n    if (dtype === 'complex64') {\n      throw new Error(\n          `complex64 dtype TensorBuffers are not supported. Please create ` +\n          `a TensorBuffer for the real and imaginary parts separately and ` +\n          `call tf.complex(real, imag).`);\n    }\n    this.values = values || util.getArrayFromDType(dtype, this.size);\n    this.strides = computeStrides(shape);\n  }\n\n  /**\n   * Sets a value in the buffer at a given location.\n   *\n   * @param value The value to set.\n   * @param locs  The location indices.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Creation'}\n   */\n  set(value: SingleValueMap[D], ...locs: number[]): void {\n    if (locs.length === 0) {\n      locs = [0];\n    }\n    util.assert(\n        locs.length === this.rank,\n        () => `The number of provided coordinates (${locs.length}) must ` +\n            `match the rank (${this.rank})`);\n\n    const index = this.locToIndex(locs);\n    this.values[index] = value as number;\n  }\n\n  /**\n   * Returns the value in the buffer at the provided location.\n   *\n   * @param locs The location indices.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Creation'}\n   */\n  get(...locs: number[]): SingleValueMap[D] {\n    if (locs.length === 0) {\n      locs = [0];\n    }\n    let i = 0;\n    for (const loc of locs) {\n      if (loc < 0 || loc >= this.shape[i]) {\n        const msg = `Requested out of range element at ${locs}. ` +\n            `  Buffer shape=${this.shape}`;\n        throw new Error(msg);\n      }\n      i++;\n    }\n    let index = locs[locs.length - 1];\n    for (let i = 0; i < locs.length - 1; ++i) {\n      index += this.strides[i] * locs[i];\n    }\n    return this.values[index] as SingleValueMap[D];\n  }\n\n  locToIndex(locs: number[]): number {\n    if (this.rank === 0) {\n      return 0;\n    } else if (this.rank === 1) {\n      return locs[0];\n    }\n    let index = locs[locs.length - 1];\n    for (let i = 0; i < locs.length - 1; ++i) {\n      index += this.strides[i] * locs[i];\n    }\n    return index;\n  }\n\n  indexToLoc(index: number): number[] {\n    if (this.rank === 0) {\n      return [];\n    } else if (this.rank === 1) {\n      return [index];\n    }\n    const locs: number[] = new Array(this.shape.length);\n    for (let i = 0; i < locs.length - 1; ++i) {\n      locs[i] = Math.floor(index / this.strides[i]);\n      index -= locs[i] * this.strides[i];\n    }\n    locs[locs.length - 1] = index;\n    return locs;\n  }\n\n  get rank() {\n    return this.shape.length;\n  }\n\n  /**\n   * Creates an immutable `tf.Tensor` object from the buffer.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Creation'}\n   */\n  toTensor(): Tensor<R> {\n    return trackerFn().makeTensor(this.values, this.shape, this.dtype) as\n        Tensor<R>;\n  }\n}\n\nexport interface DataToGPUWebGLOption {\n  customTexShape?: [number, number];\n}\n\nexport type DataToGPUOptions = DataToGPUWebGLOption;\n\nexport interface GPUData {\n  tensorRef: Tensor;\n  texture?: WebGLTexture;\n  buffer?: GPUBuffer;\n  texShape?: [number, number];\n}\n\nexport interface TensorTracker {\n  makeTensor(\n      values: DataValues, shape: number[], dtype: DataType,\n      backend?: Backend): Tensor;\n  makeVariable(\n      initialValue: Tensor, trainable?: boolean, name?: string,\n      dtype?: DataType): Variable;\n  incRef(a: Tensor, backend: Backend): void;\n  disposeTensor(t: Tensor): void;\n  disposeVariable(v: Variable): void;\n  read(dataId: DataId): Promise<BackendValues>;\n  readSync(dataId: DataId): BackendValues;\n  readToGPU(dataId: DataId, options?: DataToGPUOptions): GPUData;\n}\n\n/**\n * The Tensor class calls into this handler to delegate chaining operations.\n */\nexport interface OpHandler {\n  cast<T extends Tensor>(x: T, dtype: DataType): T;\n  buffer<R extends Rank, D extends DataType>(\n      shape: ShapeMap[R], dtype: D,\n      values?: DataTypeMap[D]): TensorBuffer<R, D>;\n  print<T extends Tensor>(x: T, verbose: boolean): void;\n  clone<T extends Tensor>(x: T): T;\n  // TODO(yassogba) bring reshape back?\n}\n\n// For tracking tensor creation and disposal.\nlet trackerFn: () => TensorTracker = null;\n// Used by chaining methods to call into ops.\nlet opHandler: OpHandler = null;\n// Used to warn about deprecated methods.\nlet deprecationWarningFn: (msg: string) => void = null;\n// This here so that we can use this method on dev branches and keep the\n// functionality at master.\n// tslint:disable-next-line:no-unused-expression\n[deprecationWarningFn];\n\n/**\n * An external consumer can register itself as the tensor tracker. This way\n * the Tensor class can notify the tracker for every tensor created and\n * disposed.\n */\nexport function setTensorTracker(fn: () => TensorTracker) {\n  trackerFn = fn;\n}\n\n/**\n * An external consumer can register itself as the op handler. This way the\n * Tensor class can have chaining methods that call into ops via the op\n * handler.\n */\nexport function setOpHandler(handler: OpHandler) {\n  opHandler = handler;\n}\n\n/**\n * Sets the deprecation warning function to be used by this file. This way the\n * Tensor class can be a leaf but still use the environment.\n */\nexport function setDeprecationWarningFn(fn: (msg: string) => void) {\n  deprecationWarningFn = fn;\n}\n\n// Declare this namespace to make Tensor class augmentation work in google3.\nexport declare namespace Tensor {}\n/**\n * A `tf.Tensor` object represents an immutable, multidimensional array of\n * numbers that has a shape and a data type.\n *\n * For performance reasons, functions that create tensors do not necessarily\n * perform a copy of the data passed to them (e.g. if the data is passed as a\n * `Float32Array`), and changes to the data will change the tensor. This is not\n * a feature and is not supported. To avoid this behavior, use the tensor before\n * changing the input data or create a copy with `copy = tf.add(yourTensor, 0)`.\n *\n * See `tf.tensor` for details on how to create a `tf.Tensor`.\n *\n * @doc {heading: 'Tensors', subheading: 'Classes'}\n */\nexport class Tensor<R extends Rank = Rank> implements TensorInfo {\n  /** Unique id of this tensor. */\n  readonly id: number;\n  /**\n   * Id of the bucket holding the data for this tensor. Multiple arrays can\n   * point to the same bucket (e.g. when calling array.reshape()).\n   */\n  dataId: DataId;\n  /** The shape of the tensor. */\n  readonly shape: ShapeMap[R];\n  /** Number of elements in the tensor. */\n  readonly size: number;\n  /** The data type for the array. */\n  readonly dtype: DataType;\n  /** The rank type for the array (see `Rank` enum). */\n  readonly rankType: R;\n\n  /** Whether this tensor has been globally kept. */\n  kept = false;\n  /** The id of the scope this tensor is being tracked in. */\n  scopeId: number;\n  /** The keras mask that some keras layers attach to the tensor */\n  kerasMask?: Tensor;\n\n  /**\n   * Number of elements to skip in each dimension when indexing. See\n   * https://docs.scipy.org/doc/numpy/reference/generated/\\\n   * numpy.ndarray.strides.html\n   */\n  readonly strides: number[];\n\n  constructor(shape: ShapeMap[R], dtype: DataType, dataId: DataId, id: number) {\n    this.shape = shape.slice() as ShapeMap[R];\n    this.dtype = dtype || 'float32';\n    this.size = util.sizeFromShape(shape);\n    this.strides = computeStrides(shape);\n    this.dataId = dataId;\n    this.id = id;\n    this.rankType = (this.rank < 5 ? this.rank.toString() : 'higher') as R;\n  }\n\n  get rank(): number {\n    return this.shape.length;\n  }\n\n  /**\n   * Returns a promise of `tf.TensorBuffer` that holds the underlying data.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  async buffer<D extends DataType = 'float32'>(): Promise<TensorBuffer<R, D>> {\n    const vals = await this.data<D>();\n    return opHandler.buffer(this.shape, this.dtype as D, vals);\n  }\n\n  /**\n   * Returns a `tf.TensorBuffer` that holds the underlying data.\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  bufferSync<D extends DataType = 'float32'>(): TensorBuffer<R, D> {\n    return opHandler.buffer(this.shape, this.dtype as D, this.dataSync());\n  }\n\n  /**\n   * Returns the tensor data as a nested array. The transfer of data is done\n   * asynchronously.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  async array(): Promise<ArrayMap[R]> {\n    const vals = await this.data();\n    return toNestedArray(this.shape, vals, this.dtype === 'complex64') as\n        ArrayMap[R];\n  }\n\n  /**\n   * Returns the tensor data as a nested array. The transfer of data is done\n   * synchronously.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  arraySync(): ArrayMap[R] {\n    return toNestedArray(\n               this.shape, this.dataSync(), this.dtype === 'complex64') as\n        ArrayMap[R];\n  }\n\n  /**\n   * Asynchronously downloads the values from the `tf.Tensor`. Returns a\n   * promise of `TypedArray` that resolves when the computation has finished.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  async data<D extends DataType = NumericDataType>(): Promise<DataTypeMap[D]> {\n    this.throwIfDisposed();\n    const data = trackerFn().read(this.dataId);\n    if (this.dtype === 'string') {\n      const bytes = await data as Uint8Array[];\n      try {\n        return bytes.map(b => util.decodeString(b)) as DataTypeMap[D];\n      } catch {\n        throw new Error(\n            'Failed to decode the string bytes into utf-8. ' +\n            'To get the original bytes, call tensor.bytes().');\n      }\n    }\n    return data as Promise<DataTypeMap[D]>;\n  }\n\n  /**\n   * Copy the tensor's data to a new GPU resource. Comparing to the `dataSync()`\n   * and `data()`, this method prevents data from being downloaded to CPU.\n   *\n   * For WebGL backend, the data will be stored on a densely packed texture.\n   * This means that the texture will use the RGBA channels to store value.\n   *\n   * For WebGPU backend, the data will be stored on a buffer. There is no\n   * parameter, so can not use a user-defined size to create the buffer.\n   *\n   * @param options:\n   *     For WebGL,\n   *         - customTexShape: Optional. If set, will use the user defined\n   *     texture shape to create the texture.\n   *\n   * @returns For WebGL backend, a GPUData contains the new texture and\n   *     its information.\n   *     {\n   *        tensorRef: The tensor that is associated with this texture,\n   *        texture: WebGLTexture,\n   *        texShape: [number, number] // [height, width]\n   *     }\n   *\n   *     For WebGPU backend, a GPUData contains the new buffer.\n   *     {\n   *        tensorRef: The tensor that is associated with this buffer,\n   *        buffer: GPUBuffer,\n   *     }\n   *\n   *     Remember to dispose the GPUData after it is used by\n   *     `res.tensorRef.dispose()`.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  dataToGPU(options?: DataToGPUOptions): GPUData {\n    this.throwIfDisposed();\n    return trackerFn().readToGPU(this.dataId, options);\n  }\n\n  /**\n   * Synchronously downloads the values from the `tf.Tensor`. This blocks the\n   * UI thread until the values are ready, which can cause performance issues.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  dataSync<D extends DataType = NumericDataType>(): DataTypeMap[D] {\n    this.throwIfDisposed();\n    const data = trackerFn().readSync(this.dataId);\n    if (this.dtype === 'string') {\n      try {\n        return (data as Uint8Array[]).map(b => util.decodeString(b)) as\n            DataTypeMap[D];\n      } catch {\n        throw new Error(\n            'Failed to decode the string bytes into utf-8. ' +\n            'To get the original bytes, call tensor.bytes().');\n      }\n    }\n    return data as DataTypeMap[D];\n  }\n\n  /** Returns the underlying bytes of the tensor's data. */\n  async bytes(): Promise<Uint8Array[]|Uint8Array> {\n    this.throwIfDisposed();\n    const data = await trackerFn().read(this.dataId);\n    if (this.dtype === 'string') {\n      return data as Uint8Array[];\n    } else {\n      return new Uint8Array((data as TypedArray).buffer);\n    }\n  }\n\n  /**\n   * Disposes `tf.Tensor` from memory.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  dispose(): void {\n    if (this.isDisposed) {\n      return;\n    }\n    if (this.kerasMask) {\n      this.kerasMask.dispose();\n    }\n    trackerFn().disposeTensor(this);\n    this.isDisposedInternal = true;\n  }\n\n  protected isDisposedInternal = false;\n  get isDisposed(): boolean {\n    return this.isDisposedInternal;\n  }\n\n  throwIfDisposed() {\n    if (this.isDisposed) {\n      throw new Error(`Tensor is disposed.`);\n    }\n  }\n\n  /**\n   * Prints the `tf.Tensor`. See `tf.print` for details.\n   *\n   * @param verbose Whether to print verbose information about the tensor,\n   *    including dtype and size.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  print(verbose = false): void {\n    return opHandler.print(this, verbose);\n  }\n\n  /**\n   * Returns a copy of the tensor. See `tf.clone` for details.\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  clone<T extends Tensor>(this: T): T {\n    this.throwIfDisposed();\n    return opHandler.clone(this);\n  }\n\n  /**\n   * Returns a human-readable description of the tensor. Useful for logging.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  toString(verbose = false): string {\n    const vals = this.dataSync();\n    return tensorToString(vals, this.shape, this.dtype, verbose);\n  }\n\n  cast<T extends this>(dtype: DataType): T {\n    this.throwIfDisposed();\n    return opHandler.cast(this as T, dtype);\n  }\n  variable(trainable = true, name?: string, dtype?: DataType): Variable<R> {\n    this.throwIfDisposed();\n    return trackerFn().makeVariable(this, trainable, name, dtype) as\n        Variable<R>;\n  }\n}\n\nObject.defineProperty(Tensor, Symbol.hasInstance, {\n  value: (instance: Tensor) => {\n    // Implementation note: we should use properties of the object that will be\n    // defined before the constructor body has finished executing (methods).\n    // This is because when this code is transpiled by babel, babel will call\n    // classCallCheck before the constructor body is run.\n    // See https://github.com/tensorflow/tfjs/issues/3384 for backstory.\n    return !!instance && instance.data != null && instance.dataSync != null &&\n        instance.throwIfDisposed != null;\n  }\n});\n\nexport function getGlobalTensorClass() {\n  // Use getGlobal so that we can augment the Tensor class across package\n  // boundaries because the node resolution alg may result in different modules\n  // being returned for this file depending on the path they are loaded from.\n  return getGlobal('Tensor', () => {\n    return Tensor;\n  });\n}\n\n// Global side effect. Cache global reference to Tensor class\ngetGlobalTensorClass();\n\nexport interface NumericTensor<R extends Rank = Rank> extends Tensor<R> {\n  dtype: NumericDataType;\n  dataSync<D extends DataType = NumericDataType>(): DataTypeMap[D];\n  data<D extends DataType = NumericDataType>(): Promise<DataTypeMap[D]>;\n  dataToGPU(options?: DataToGPUOptions): GPUData;\n}\n\nexport interface StringTensor<R extends Rank = Rank> extends Tensor<R> {\n  dtype: 'string';\n  dataSync<D extends DataType = 'string'>(): DataTypeMap[D];\n  data<D extends DataType = 'string'>(): Promise<DataTypeMap[D]>;\n}\n\n/** @doclink Tensor */\nexport type Scalar = Tensor<Rank.R0>;\n/** @doclink Tensor */\nexport type Tensor1D = Tensor<Rank.R1>;\n/** @doclink Tensor */\nexport type Tensor2D = Tensor<Rank.R2>;\n/** @doclink Tensor */\nexport type Tensor3D = Tensor<Rank.R3>;\n/** @doclink Tensor */\nexport type Tensor4D = Tensor<Rank.R4>;\n/** @doclink Tensor */\nexport type Tensor5D = Tensor<Rank.R5>;\n/** @doclink Tensor */\nexport type Tensor6D = Tensor<Rank.R6>;\n\n/**\n * A mutable `tf.Tensor`, useful for persisting state, e.g. for training.\n *\n * @doc {heading: 'Tensors', subheading: 'Classes'}\n */\nexport class Variable<R extends Rank = Rank> extends Tensor<R> {\n  name: string;\n\n  constructor(\n      initialValue: Tensor<R>, public trainable: boolean, name: string,\n      tensorId: number) {\n    super(\n        initialValue.shape, initialValue.dtype, initialValue.dataId, tensorId);\n    this.name = name;\n  }\n\n  /**\n   * Assign a new `tf.Tensor` to this variable. The new `tf.Tensor` must have\n   * the same shape and dtype as the old `tf.Tensor`.\n   *\n   * @param newValue New tensor to be assigned to this variable.\n   *\n   * @doc {heading: 'Tensors', subheading: 'Classes'}\n   */\n  assign(newValue: Tensor<R>): void {\n    if (newValue.dtype !== this.dtype) {\n      throw new Error(\n          `dtype of the new value (${newValue.dtype}) and ` +\n          `previous value (${this.dtype}) must match`);\n    }\n    if (!util.arraysEqual(newValue.shape, this.shape)) {\n      throw new Error(\n          `shape of the new value (${newValue.shape}) and ` +\n          `previous value (${this.shape}) must match`);\n    }\n    trackerFn().disposeTensor(this);\n    this.dataId = newValue.dataId;\n    trackerFn().incRef(this, null /* backend */);\n  }\n\n  override dispose(): void {\n    trackerFn().disposeVariable(this);\n    this.isDisposedInternal = true;\n  }\n}\n\nObject.defineProperty(Variable, Symbol.hasInstance, {\n  value: (instance: Variable) => {\n    return instance instanceof Tensor && instance.assign != null &&\n        instance.assign instanceof Function;\n  }\n});\n", "/**\n * @license\n * Copyright 2017 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/** @docalias number[] */\nexport interface ShapeMap {\n  R0: number[];\n  R1: [number];\n  R2: [number, number];\n  R3: [number, number, number];\n  R4: [number, number, number, number];\n  R5: [number, number, number, number, number];\n  R6: [number, number, number, number, number, number];\n}\n\n/** @docalias number[] */\nexport interface ArrayMap {\n  R0: number;\n  R1: number[];\n  R2: number[][];\n  R3: number[][][];\n  R4: number[][][][];\n  R5: number[][][][][];\n  R6: number[][][][][][];\n}\n\nexport interface DataTypeMap {\n  float32: Float32Array;\n  int32: Int32Array;\n  bool: Uint8Array;\n  complex64: Float32Array;\n  string: string[];\n}\n\nexport interface SingleValueMap {\n  bool: boolean;\n  int32: number;\n  float32: number;\n  complex64: number;\n  string: string;\n}\n\n/** @docalias 'float32'|'int32'|'bool'|'complex64'|'string' */\nexport type DataType = keyof DataTypeMap;\nexport type NumericDataType = 'float32'|'int32'|'bool'|'complex64';\n\nexport type DataTypeFor<T extends number|string|boolean> =\n    T extends number|boolean ? NumericDataType : T extends string ? 'string' :\n                                                                    never;\n\nexport type TypedArray = Float32Array|Int32Array|Uint8Array;\n/** Tensor data used in tensor creation and user-facing API. */\nexport type DataValues = DataTypeMap[DataType];\n/** The underlying tensor data that gets stored in a backend. */\nexport type BackendValues = Float32Array|Int32Array|Uint8Array|Uint8Array[];\n\nexport enum Rank {\n  R0 = 'R0',\n  R1 = 'R1',\n  R2 = 'R2',\n  R3 = 'R3',\n  R4 = 'R4',\n  R5 = 'R5',\n  R6 = 'R6'\n}\n\nexport type FlatVector = boolean[]|number[]|TypedArray;\nexport type RegularArray<T> =\n    T[]|T[][]|T[][][]|T[][][][]|T[][][][][]|T[][][][][][];\n\n// tslint:disable-next-line:no-any\nexport interface RecursiveArray<T extends any> {\n  [index: number]: T|RecursiveArray<T>;\n}\n\n// Looks for upcasting types. Used, for example, in operations with mixed dtype\n// inputs.\nenum UpcastInt32AndMap {\n  'float32' = 'float32',\n  'int32' = 'int32',\n  'bool' = 'int32',\n  'complex64' = 'complex64'\n}\n\nenum UpcastBoolAndMap {\n  'float32' = 'float32',\n  'int32' = 'int32',\n  'bool' = 'bool',\n  'complex64' = 'complex64'\n}\n\nenum UpcastFloat32AndMap {\n  'float32' = 'float32',\n  'int32' = 'float32',\n  'bool' = 'float32',\n  'complex64' = 'complex64'\n}\n\nenum UpcastComplex64AndMap {\n  'float32' = 'complex64',\n  'int32' = 'complex64',\n  'bool' = 'complex64',\n  'complex64' = 'complex64'\n}\n\nconst upcastTypeMap = {\n  'float32': UpcastFloat32AndMap,\n  'int32': UpcastInt32AndMap,\n  'bool': UpcastBoolAndMap,\n  'complex64': UpcastComplex64AndMap\n};\n\nexport function upcastType(typeA: DataType, typeB: DataType): DataType {\n  if (typeA === 'string' || typeB === 'string') {\n    if (typeA === 'string' && typeB === 'string') {\n      return 'string';\n    }\n    throw new Error(`Can not upcast ${typeA} with ${typeB}`);\n  }\n  return upcastTypeMap[typeA][typeB];\n}\n\n/** Returns the output type after summation. */\nexport function sumOutType(type: DataType): DataType {\n  return upcastType(type, 'int32');\n}\n\n/** @docalias TypedArray|Array */\nexport type TensorLike =\n    TypedArray|number|boolean|string|RecursiveArray<number|number[]|TypedArray>|\n    RecursiveArray<boolean>|RecursiveArray<string>|Uint8Array[];\nexport type ScalarLike = number|boolean|string|Uint8Array;\n/** @docalias TypedArray|Array */\nexport type TensorLike1D = TypedArray|number[]|boolean[]|string[]|Uint8Array[];\n/** @docalias TypedArray|Array */\nexport type TensorLike2D = TypedArray|number[]|number[][]|boolean[]|boolean[][]|\n    string[]|string[][]|Uint8Array[]|Uint8Array[][];\n/** @docalias TypedArray|Array */\nexport type TensorLike3D = TypedArray|number[]|number[][][]|boolean[]|\n    boolean[][][]|string[]|string[][][]|Uint8Array[]|Uint8Array[][][];\n/** @docalias TypedArray|Array */\nexport type TensorLike4D = TypedArray|number[]|number[][][][]|boolean[]|\n    boolean[][][][]|string[]|string[][][][]|Uint8Array[]|Uint8Array[][][][];\n/** @docalias TypedArray|Array */\nexport type TensorLike5D =\n    TypedArray|number[]|number[][][][][]|boolean[]|boolean[][][][][]|string[]|\n    string[][][][][]|Uint8Array[]|Uint8Array[][][][][];\n/** @docalias TypedArray|Array */\nexport type TensorLike6D =\n    TypedArray|number[]|number[][][][][][]|boolean[]|boolean[][][][][][]|\n    string[]|string[][][][][][]|Uint8Array[]|Uint8Array[][][][][];\n\n/** Type for representing image data in Uint8Array type. */\nexport interface PixelData {\n  width: number;\n  height: number;\n  data: Uint8Array;\n}\n\n/**\n * Type for representing all permutations and combinations of 'RGBA' channels.\n */\nexport type WebGLChannels = 'A'|'B'|'G'|'R'|'AB'|'AG'|'AR'|'BA'|'BG'|'BR'|'GA'|\n    'GB'|'GR'|'RA'|'RB'|'RG'|'ABG'|'ABR'|'AGB'|'AGR'|'ARB'|'ARG'|'BAG'|'BAR'|\n    'BGA'|'BGR'|'BRA'|'BRG'|'GAB'|'GAR'|'GBA'|'GBR'|'GRA'|'GRB'|'RAB'|'RAG'|\n    'RBA'|'RBG'|'RGA'|'RGB'|'ABGR'|'ABRG'|'AGBR'|'AGRB'|'ARBG'|'ARGB'|'BAGR'|\n    'BARG'|'BGAR'|'BGRA'|'BRAG'|'BRGA'|'GABR'|'GARB'|'GBAR'|'GBRA'|'GRAB'|\n    'GRBA'|'RABG'|'RAGB'|'RBAG'|'RBGA'|'RGAB'|'RGBA';\n\n/** Type for representing a texture data to create a tensor. */\nexport interface WebGLData {\n  texture: WebGLTexture;\n  height: number;\n  width: number;\n  channels: WebGLChannels;\n}\n\n/**\n * Type for representing a buffer data to create a tensor. Buffer usage should\n * at least support GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_SRC. When\n * zeroCopy is false or undefined (default), this GPUBuffer will be copied to\n * the tensor's resource buffer. When zeroCopy is true, tensor will use this\n * GPUBuffer as tensor's resource buffer, user should not destroy this GPUBuffer\n * until all access is done. If not specified at creating a tensor, tensor type\n * is float32.\n */\nexport interface WebGPUData {\n  buffer: GPUBuffer;\n  zeroCopy?: boolean;\n}\n\nexport function isWebGLData(values: unknown): values is WebGLData {\n  return values != null && typeof values === 'object' && 'texture' in values &&\n      values.texture instanceof WebGLTexture;\n}\nexport function isWebGPUData(values: unknown): values is WebGPUData {\n  return typeof GPUBuffer !== 'undefined' && values != null &&\n      typeof values === 'object' && 'buffer' in values &&\n      values.buffer instanceof GPUBuffer;\n}\n\nexport interface ImageOptions {\n  /**\n   * Optional. A number in range [0-1]. If the image is a 2D tensor or a 3D\n   * tensor with 1 or 3 channels, the alpha channels would set as its value;\n   * otherwise, it would not make effects.\n   */\n  alpha?: number;\n}\n\nexport interface ContextOptions {\n  /**\n   * Optional.  If the canvas has created a context, it would not make effects.\n   * If it is not set, it would be variable based on the current backend.\n   */\n  contextType?: string;\n  /**\n   * Optional. A WebGLContextAttributes configuration. If the canvas has created\n   * a context, it would not make effects.\n   */\n  contextAttributes?: WebGLContextAttributes;\n}\n\nexport interface DrawOptions {\n  /**\n   * Optional. An object of options to customize the values of image tensor.\n   */\n  imageOptions?: ImageOptions;\n  /**\n   * Optional. An object to configure the context of the canvas to draw to.\n   */\n  contextOptions?: ContextOptions;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from './tensor';\nimport {TensorContainer, TensorContainerArray} from './tensor_types';\nimport {upcastType} from './types';\nimport {assert} from './util';\n\nexport function makeTypesMatch<T extends Tensor>(a: T, b: T): [T, T] {\n  if (a.dtype === b.dtype) {\n    return [a, b];\n  }\n  const dtype = upcastType(a.dtype, b.dtype);\n  return [a.cast(dtype), b.cast(dtype)];\n}\n\nexport function assertTypesMatch(a: Tensor, b: Tensor): void {\n  assert(\n      a.dtype === b.dtype,\n      () => `The dtypes of the first(${a.dtype}) and` +\n          ` second(${b.dtype}) input must match`);\n}\n\nexport function isTensorInList(tensor: Tensor, tensorList: Tensor[]): boolean {\n  return tensorList.some(x => x.id === tensor.id);\n}\n\n/**\n * Extracts any `Tensor`s found within the provided object.\n *\n * @param container an object that may be a `Tensor` or may directly contain\n *   `Tensor`s, such as a `Tensor[]` or `{key: Tensor, ...}`. In general it\n *   is safe to pass any object here, except that `Promise`s are not\n *   supported.\n * @returns An array of `Tensors` found within the passed object. If the\n *   argument is simply a `Tensor', a list containing that `Tensor` is\n *   returned. If the object is not a `Tensor` or does not\n *   contain `Tensors`, an empty list is returned.\n */\nexport function getTensorsInContainer(result: TensorContainer): Tensor[] {\n  const list: Tensor[] = [];\n  const seen = new Set<{}|void>();\n  walkTensorContainer(result, list, seen);\n  return list;\n}\n\nfunction walkTensorContainer(\n    container: TensorContainer, list: Tensor[], seen: Set<{}|void>): void {\n  if (container == null) {\n    return;\n  }\n  if (container instanceof Tensor) {\n    list.push(container);\n    return;\n  }\n  if (!isIterable(container)) {\n    return;\n  }\n  // Iteration over keys works also for arrays.\n  const iterable = container as TensorContainerArray;\n  for (const k in iterable) {\n    const val = iterable[k];\n    if (!seen.has(val)) {\n      seen.add(val);\n      walkTensorContainer(val, list, seen);\n    }\n  }\n}\n\n// tslint:disable-next-line:no-any\nfunction isIterable(obj: any): boolean {\n  return Array.isArray(obj) || typeof obj === 'object';\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {BackendTimingInfo, DataMover, KernelBackend} from './backends/backend';\nimport {Environment, setEnvironmentGlobal} from './environment';\nimport {getGlobalNamespace} from './global_util';\nimport {Add, Cast, Identity} from './kernel_names';\nimport { getGradient, getKernel, getKernelsForBackend, GradFunc, NamedAttrMap } from './kernel_registry';\nimport { TensorInfo } from './tensor_info';\nimport * as log from './log';\nimport {KernelProfile, Profiler} from './profiler';\nimport {backpropagateGradients, getFilteredNodesXToY, TapeNode} from './tape';\nimport {DataToGPUOptions, GPUData, setTensorTracker, Tensor, TensorTracker, Variable} from './tensor';\nimport {DataId} from './tensor_info';\nimport {GradSaveFunc, NamedTensorMap, NamedVariableMap, TensorContainer} from './tensor_types';\nimport {getTensorsInContainer} from './tensor_util';\nimport {BackendValues, DataType, DataValues} from './types';\nimport * as util from './util';\nimport {bytesFromStringArray, makeOnesTypedArray, now, sizeFromShape} from './util';\n\n/**\n * A function that computes an output. The save function is for saving tensors\n * computed in the forward pass, that we need in the backward pass.\n */\nexport type ForwardFunc<T> = (backend: KernelBackend, save?: GradSaveFunc) => T;\n\n/**\n * @docalias (a: Tensor, b: Tensor,..., save?: Function) => {\n *   value: Tensor,\n *   gradFunc: (dy: Tensor, saved?: NamedTensorMap) => Tensor | Tensor[]\n * }\n */\nexport type CustomGradientFunc<T extends Tensor> =\n    (...inputs: Array<Tensor|GradSaveFunc>) => {\n      value: T;\n      gradFunc: (dy: T, saved: Tensor[]) => Tensor | Tensor[];\n    };\n\nexport type MemoryInfo = {\n  numTensors: number; numDataBuffers: number; numBytes: number;\n  unreliable?: boolean; reasons: string[];\n};\n\ntype KernelInfo = {\n  name: string; bytesAdded: number; totalBytesSnapshot: number;\n  tensorsAdded: number;\n  totalTensorsSnapshot: number;\n  inputShapes: number[][];\n  outputShapes: number[][];\n  kernelTimeMs: number | {error: string} | Promise<number|{error: string}>;\n  extraInfo: string | Promise<string>;\n};\n\nexport type ProfileInfo = {\n  newBytes: number; newTensors: number; peakBytes: number;\n  kernels: KernelInfo[];\n  result: TensorContainer;\n  kernelNames: string[];\n};\n\nexport interface TimingInfo extends BackendTimingInfo {\n  wallMs: number;\n}\n\n/** @docalias Function */\nexport type ScopeFn<T extends TensorContainer> = () => T;\n\ninterface ScopeState {\n  track: Tensor[];\n  name: string;\n  id: number;\n}\n\ninterface RegisteredKernelInvocation<I extends NamedTensorMap> {\n  kernelName: string;\n  inputs: I;\n  attrs?: NamedAttrMap;\n}\n\ninterface CustomGradKernelInvocation<T extends Tensor|Tensor[],\n                                               I extends NamedTensorMap> {\n  forwardFunc: ForwardFunc<T>;\n  backwardsFunc: (dy: T, saved: Tensor[]) => {\n    [P in keyof I]: () => I[P]\n  };\n  inputs: I;\n  attrs?: NamedAttrMap;\n}\n\nfunction isRegisteredKernelInvocation<T extends Tensor|Tensor[],\n                                                I extends NamedTensorMap>(\n    kernelInvocation: RegisteredKernelInvocation<I>|\n    CustomGradKernelInvocation<T, I>):\n    kernelInvocation is RegisteredKernelInvocation<I> {\n  return (kernelInvocation as RegisteredKernelInvocation<I>).kernelName != null;\n}\n\nclass EngineState {\n  // Public since optimizers will use it.\n  registeredVariables: NamedVariableMap = {};\n\n  nextTapeNodeId = 0;\n  numBytes = 0;\n  numTensors = 0;\n  numStringTensors = 0;\n  numDataBuffers = 0;\n\n  activeTape: TapeNode[];\n  // Number of nested tf.grad() statements when computing higher-order\n  // gradients. E.g. `1` for first-order gradients and `2` for second-order\n  // gradients. Used to track if the tape should be removed after a backprop.\n  gradientDepth = 0;\n  // Number of nested kernel calls. When kernel depth is greater than 1, we turn\n  // off the tape.\n  kernelDepth = 0;\n\n  // Keep Tensors that parallel the tapes.\n  activeScope: ScopeState;\n  scopeStack: ScopeState[] = [];\n  /**\n   * Keeps track of the number of data moves during a kernel execution. We\n   * maintain a stack since kernels can call other kernels, recursively.\n   */\n  numDataMovesStack: number[] = [];\n  nextScopeId = 0;\n\n  tensorInfo = new WeakMap<DataId, {\n    backend: KernelBackend,\n    bytes: number,\n    dtype: DataType,\n    shape: number[]\n  }>();\n\n  profiling = false;\n  activeProfile: ProfileInfo = {\n    newBytes: 0,\n    newTensors: 0,\n    peakBytes: 0,\n    kernels: [],\n    result: null,\n    get kernelNames():\n        string[] {\n          return Array.from(new Set(this.kernels.map(k => k.name)));\n        }\n  };\n\n  dispose() {\n    for (const variableName in this.registeredVariables) {\n      this.registeredVariables[variableName].dispose();\n    }\n  }\n}\n\nexport class Engine implements TensorTracker, DataMover {\n  state: EngineState;\n  backendName: string;\n  registry: {[id: string]: KernelBackend} = {};\n  registryFactory: {\n    [id: string]: {\n      factory: () => KernelBackend | Promise<KernelBackend>,\n      priority: number\n    }\n  } = {};\n\n  private profiler: Profiler;\n  private backendInstance: KernelBackend;\n  private pendingBackendInit: Promise<boolean>;\n  private pendingBackendInitId = 0;\n\n  constructor(public ENV: Environment) {\n    this.state = new EngineState();\n  }\n\n  async ready(): Promise<void> {\n    if (this.pendingBackendInit != null) {\n      return this.pendingBackendInit.then(() => {});\n    }\n    if (this.backendInstance != null) {\n      return;\n    }\n    const sortedBackends = this.getSortedBackends();\n\n    for (let i = 0; i < sortedBackends.length; i++) {\n      const backendName = sortedBackends[i];\n      const success = await this.initializeBackend(backendName).success;\n      if (success) {\n        await this.setBackend(backendName);\n        return;\n      }\n    }\n\n    throw new Error(\n        `Could not initialize any backends, all backend initializations ` +\n        `failed.`);\n  }\n\n  get backend(): KernelBackend {\n    if (this.pendingBackendInit != null) {\n      throw new Error(\n          `Backend '${this.backendName}' has not yet been initialized. Make ` +\n          `sure to await tf.ready() or await tf.setBackend() before calling ` +\n          `other methods`);\n    }\n    if (this.backendInstance == null) {\n      const {name, asyncInit} = this.initializeBackendsAndReturnBest();\n      if (asyncInit) {\n        throw new Error(\n            `The highest priority backend '${name}' has not yet been ` +\n            `initialized. Make sure to await tf.ready() or ` +\n            `await tf.setBackend() before calling other methods`);\n      }\n      this.setBackend(name);\n    }\n    return this.backendInstance;\n  }\n\n  backendNames(): string[] {\n    return Object.keys(this.registryFactory);\n  }\n\n  findBackend(backendName: string): KernelBackend {\n    if (!(backendName in this.registry)) {\n      // If the backend hasn't been initialized but we have a registry entry for\n      // it, initialize it and return it.\n      if (backendName in this.registryFactory) {\n        const {asyncInit} = this.initializeBackend(backendName);\n        if (asyncInit) {\n          // Backend is not ready yet.\n          return null;\n        }\n      } else {\n        return null;\n      }\n    }\n    return this.registry[backendName];\n  }\n\n  findBackendFactory(backendName: string):\n      () => KernelBackend | Promise<KernelBackend> {\n    if (!(backendName in this.registryFactory)) {\n      return null;\n    }\n    return this.registryFactory[backendName].factory;\n  }\n\n  registerBackend(\n      backendName: string,\n      factory: () => KernelBackend | Promise<KernelBackend>,\n      priority = 1): boolean {\n    if (backendName in this.registryFactory) {\n      log.warn(\n          `${backendName} backend was already registered. ` +\n          `Reusing existing backend factory.`);\n      return false;\n    }\n    this.registryFactory[backendName] = {factory, priority};\n    return true;\n  }\n\n  async setBackend(backendName: string): Promise<boolean> {\n    if (this.registryFactory[backendName] == null) {\n      throw new Error(`Backend name '${backendName}' not found in registry`);\n    }\n    this.backendName = backendName;\n    if (this.registry[backendName] == null) {\n      this.backendInstance = null;\n      const {success, asyncInit} = this.initializeBackend(backendName);\n      const result = asyncInit ? await success : success;\n      if (!result) {\n        return false;\n      }\n    }\n    this.backendInstance = this.registry[backendName];\n    this.setupRegisteredKernels();\n    // Reset the profiler.\n    this.profiler = new Profiler(this.backendInstance);\n\n    return true;\n  }\n\n  private setupRegisteredKernels(): void {\n    const kernels = getKernelsForBackend(this.backendName);\n    kernels.forEach(kernel => {\n      if (kernel.setupFunc != null) {\n        kernel.setupFunc(this.backendInstance);\n      }\n    });\n  }\n\n  private disposeRegisteredKernels(backendName: string): void {\n    const kernels = getKernelsForBackend(backendName);\n    kernels.forEach(kernel => {\n      if (kernel.disposeFunc != null) {\n        kernel.disposeFunc(this.registry[backendName]);\n      }\n    });\n  }\n\n  /**\n   * Initializes a backend by looking up the backend name in the factory\n   * registry and calling the factory method. Returns a boolean representing\n   * whether the initialization of the backend succeeded. Throws an error if\n   * there is no backend in the factory registry.\n   */\n  private initializeBackend(backendName: string):\n      {success: boolean|Promise<boolean>, asyncInit: boolean} {\n    const registryFactoryEntry = this.registryFactory[backendName];\n    if (registryFactoryEntry == null) {\n      throw new Error(\n          `Cannot initialize backend ${backendName}, no registration found.`);\n    }\n\n    try {\n      const backend = registryFactoryEntry.factory();\n      /* Test if the factory returns a promise.\n      Done in a more liberal way than\n      previous 'Promise.resolve(backend)===backend'\n      as we needed to account for custom Promise\n      implementations (e.g. Angular) */\n      if (backend && !(backend instanceof KernelBackend) &&\n          typeof backend.then === 'function') {\n        const promiseId = ++this.pendingBackendInitId;\n        const success =\n            backend\n                .then(backendInstance => {\n                  // Outdated promise. Another backend was set in the meantime.\n                  if (promiseId < this.pendingBackendInitId) {\n                    return false;\n                  }\n                  this.registry[backendName] = backendInstance;\n                  this.pendingBackendInit = null;\n                  return true;\n                })\n                .catch(err => {\n                  // Outdated promise. Another backend was set in the meantime.\n                  if (promiseId < this.pendingBackendInitId) {\n                    return false;\n                  }\n                  this.pendingBackendInit = null;\n                  log.warn(`Initialization of backend ${backendName} failed`);\n                  log.warn(err.stack || err.message);\n                  return false;\n                });\n        this.pendingBackendInit = success;\n        return {success, asyncInit: true};\n      } else {\n        this.registry[backendName] = backend as KernelBackend;\n        return {success: true, asyncInit: false};\n      }\n    } catch (err) {\n      log.warn(`Initialization of backend ${backendName} failed`);\n      log.warn(err.stack || err.message);\n      return {success: false, asyncInit: false};\n    }\n  }\n\n  removeBackend(backendName: string): void {\n    if (!(backendName in this.registryFactory)) {\n      throw new Error(`${backendName} backend not found in registry`);\n    }\n    if (this.backendName === backendName && this.pendingBackendInit != null) {\n      // There is a pending promise of the backend we want to remove. Make it\n      // obsolete.\n      this.pendingBackendInitId++;\n    }\n\n    if (backendName in this.registry) {\n      this.disposeRegisteredKernels(backendName);\n      this.registry[backendName].dispose();\n      delete this.registry[backendName];\n    }\n\n    delete this.registryFactory[backendName];\n\n    // Unset the backend if it is active.\n    if (this.backendName === backendName) {\n      this.pendingBackendInit = null;\n      this.backendName = null;\n      this.backendInstance = null;\n    }\n  }\n\n  private getSortedBackends(): string[] {\n    if (Object.keys(this.registryFactory).length === 0) {\n      throw new Error('No backend found in registry.');\n    }\n    return Object.keys(this.registryFactory).sort((a: string, b: string) => {\n      // Highest priority comes first.\n      return this.registryFactory[b].priority -\n          this.registryFactory[a].priority;\n    });\n  }\n\n  private initializeBackendsAndReturnBest():\n      {name: string, asyncInit: boolean} {\n    const sortedBackends = this.getSortedBackends();\n\n    for (let i = 0; i < sortedBackends.length; i++) {\n      const backendName = sortedBackends[i];\n      const {success, asyncInit} = this.initializeBackend(backendName);\n      if (asyncInit || success) {\n        return {name: backendName, asyncInit};\n      }\n    }\n    throw new Error(\n        `Could not initialize any backends, all backend initializations ` +\n        `failed.`);\n  }\n\n  moveData(backend: KernelBackend, dataId: DataId) {\n    const info = this.state.tensorInfo.get(dataId);\n    const srcBackend = info.backend;\n    const values = this.readSync(dataId);\n    const refCount = srcBackend.refCount(dataId);\n    // Delete the tensor from the old backend and move it to the new\n    // backend.\n    srcBackend.disposeData(dataId, true);\n    info.backend = backend;\n    backend.move(dataId, values, info.shape, info.dtype, refCount);\n    if (this.shouldCheckForMemLeaks()) {\n      // Track the number of moves during a kernel execution to correctly\n      // detect memory leaks.\n      this.state.numDataMovesStack[this.state.numDataMovesStack.length - 1]++;\n    }\n  }\n\n  tidy<T extends TensorContainer>(nameOrFn: string|ScopeFn<T>, fn?: ScopeFn<T>):\n      T {\n    let name: string = null;\n    if (fn == null) {\n      // Called with only 1 argument.\n      if (typeof nameOrFn !== 'function') {\n        throw new Error('Please provide a function to tidy()');\n      }\n      fn = nameOrFn;\n    } else {\n      // Called with 2 arguments.\n      if (typeof nameOrFn !== 'string' && !(nameOrFn instanceof String)) {\n        throw new Error(\n            'When calling with two arguments, the first argument ' +\n            'to tidy() must be a string');\n      }\n      if (typeof fn !== 'function') {\n        throw new Error(\n            'When calling with two arguments, the 2nd argument ' +\n            'to tidy() must be a function');\n      }\n      name = nameOrFn as string;\n      // TODO(nsthorat,smilkov): Do operation logging and performance\n      // profiling.\n    }\n    let result: T;\n    return this.scopedRun(\n        () => this.startScope(name), () => this.endScope(result), () => {\n          result = fn();\n          if (result instanceof Promise) {\n            console.error('Cannot return a Promise inside of tidy.');\n          }\n          return result;\n        });\n  }\n\n  private scopedRun<T>(start: () => void, end: () => void, f: () => T): T {\n    start();\n    try {\n      const res = f();\n      end();\n      return res;\n    } catch (ex) {\n      end();\n      throw ex;\n    }\n  }\n\n  private static nextTensorId = 0;\n  private nextTensorId(): number {\n    return Engine.nextTensorId++;\n  }\n\n  private static nextVariableId = 0;\n  private nextVariableId(): number {\n    return Engine.nextVariableId++;\n  }\n\n  /**\n   * This method is called instead of the public-facing tensor.clone() when\n   * saving a tensor for backwards pass. It makes sure to add the clone\n   * operation to the tape regardless of being called inside a kernel\n   * execution.\n   */\n  private clone(x: Tensor): Tensor {\n    const y: Tensor = ENGINE.runKernel(Identity,\n                                       {x} as unknown as NamedTensorMap);\n    const inputs = {x};\n    const grad = (dy: Tensor) => ({\n      x: () => {\n        const dtype = 'float32';\n        const gradInputs = {x: dy};\n        const attrs = {dtype};\n\n        return ENGINE.runKernel(\n                   Cast, gradInputs as unknown as NamedTensorMap,\n                   // tslint:disable-next-line: no-unnecessary-type-assertion\n                   attrs as unknown as NamedAttrMap) as Tensor;\n      }\n    });\n    const saved: Tensor[] = [];\n    this.addTapeNode(this.state.activeScope.name, inputs, [y], grad, saved, {});\n    return y;\n  }\n\n  /**\n   * Execute a kernel with the given name and return the output tensor.\n   *\n   * @param kernelName The name of the kernel to execute.\n   * @param inputs A map of input names to tensors.\n   * @param attrs A map of attribute names to their values. An attribute is a\n   *     primitive (non-tensor) input to the kernel.\n   * @param inputsToSave A list of tensors, inputs to save for the backprop\n   *     computation.\n   * @param outputsToSave A list of booleans, specifying which output to save\n   *     for the backprop computation. These are booleans since the output\n   * tensors are not visible to the user.\n   */\n  runKernel<T extends Tensor|Tensor[]>(\n      kernelName: string, inputs: NamedTensorMap, attrs?: NamedAttrMap): T {\n    if (this.backendName == null) {\n      // backend has not been initialized yet (backend initialization is lazy\n      // can be deferred until an op/ kernel is run).\n      // The below getter has side effects that will try to initialize the\n      // backend and set properties like this.backendName\n      // tslint:disable-next-line: no-unused-expression\n      this.backend;\n    }\n    const hasKernel = getKernel(kernelName, this.backendName) != null;\n    if (!hasKernel) {\n      throw new Error(`Kernel '${kernelName}' not registered for backend '${\n          this.backendName}'`);\n    }\n    return this.runKernelFunc({kernelName, inputs, attrs});\n  }\n\n  private shouldCheckForMemLeaks(): boolean {\n    return this.ENV.getBool('IS_TEST');\n  }\n\n  private checkKernelForMemLeak(\n      kernelName: string, numDataIdsBefore: number,\n      outInfos: TensorInfo[]): void {\n    const numDataIdsAfter = this.backend.numDataIds();\n\n    // Count the number of data ids associated with the result of the kernel.\n    let numOutputDataIds = 0;\n    outInfos.forEach(info => {\n      // Complex numbers allocate 3 data ids, one for 'real', one for\n      // 'imaginary', and one for the container that holds the former two.\n      numOutputDataIds += (info.dtype === 'complex64' ? 3 : 1);\n    });\n\n    // Account for the number of moves during kernel execution. A \"data move\"\n    // can happen in the middle of a kernel execution, placing a new (key,value)\n    // pair in the data storage. Since data moves have net zero effect (we\n    // always remove the data from the old backend), we have to cancel them out\n    // when detecting memory leaks.\n    const numMoves =\n        this.state.numDataMovesStack[this.state.numDataMovesStack.length - 1];\n    const dataIdsLeaked =\n        numDataIdsAfter - numDataIdsBefore - numOutputDataIds - numMoves;\n    if (dataIdsLeaked > 0) {\n      throw new Error(\n          `Backend '${this.backendName}' has an internal memory leak ` +\n          `(${dataIdsLeaked} data ids) after running '${kernelName}'`);\n    }\n  }\n\n  /**\n   * Internal helper method to execute a kernel Func\n   *\n   * Use `runKernel` to execute kernels from outside of engine.\n   */\n  private runKernelFunc<T extends Tensor|Tensor[], I extends NamedTensorMap>(\n      kernelParams: RegisteredKernelInvocation<I>|\n      CustomGradKernelInvocation<T, I>): T {\n    let outputs: Tensor[];\n    let saved: Tensor[] = [];\n    const isTapeOn = this.isTapeOn();\n\n    const startingBytecount = this.state.numBytes;\n    const startingNumTensors = this.state.numTensors;\n\n    if (this.shouldCheckForMemLeaks()) {\n      this.state.numDataMovesStack.push(0);\n    }\n\n    let kernelFunc: () => Tensor[];\n    if (this.backendName == null) {\n      // backend has not been initialized yet (backend initialization is lazy\n      // can be deferred until an op/ kernel is run).\n      // The below getter has side effects that will try to initialize the\n      // backend and set properties like this.backendName\n      // tslint:disable-next-line: no-unused-expression\n      this.backend;\n    }\n\n    let out: TensorInfo|TensorInfo[];\n\n    const kernelOrScopeName = isRegisteredKernelInvocation(kernelParams) ?\n        kernelParams.kernelName :\n        this.state.activeScope != null ? this.state.activeScope.name : '';\n\n    // Create the kernelFunc from either a registered kernel OR passed in\n    // forward/backward functions (used by custom grad). In this context a\n    // kernelFunc wraps a kernel implementation with some bookkeeping.\n\n    if (isRegisteredKernelInvocation(kernelParams)) {\n      const {kernelName, inputs, attrs} = kernelParams;\n      if (this.backendName == null) {\n        // backend has not been initialized yet (backend initialization is lazy\n        // can be deferred until an op/ kernel is run).\n        // The below getter has side effects that will try to initialize the\n        // backend and set properties like this.backendName\n        // tslint:disable-next-line: no-unused-expression\n        this.backend;\n      }\n      const kernel = getKernel(kernelName, this.backendName);\n      util.assert(\n          kernel != null,\n          () => `Cannot find registered kernel '${kernelName}' for backend '${\n              this.backendName}'`);\n\n      kernelFunc = () => {\n        const numDataIdsBefore = this.backend.numDataIds();\n        out = kernel.kernelFunc({inputs, attrs, backend: this.backend});\n        const outInfos = Array.isArray(out) ? out : [out];\n        if (this.shouldCheckForMemLeaks()) {\n          this.checkKernelForMemLeak(kernelName, numDataIdsBefore, outInfos);\n        }\n\n        const outTensors = outInfos.map((outInfo: TensorInfo|Tensor) => {\n          // todo (yassogba) remove this option (Tensor) when node backend\n          // methods have been modularized and they all return tensorInfo.\n          // TensorInfos do not have a rank attribute.\n          if ((outInfo as Tensor).rank != null) {\n            return outInfo as Tensor;\n          }\n          return this.makeTensorFromTensorInfo(outInfo);\n        });\n\n        // Save any required inputs and outputs.\n\n        // Do not save unless we are recording to the tape. Otherwise it would\n        // cause a mem leak since there would be no backprop for these tensors\n        // (which would otherwise dispose them).\n        if (isTapeOn) {\n          const tensorsToSave =\n              this.getTensorsForGradient(kernelName, inputs, outTensors);\n          saved = this.saveTensorsForBackwardMode(tensorsToSave);\n        }\n        return outTensors;\n      };\n    } else {\n      const {forwardFunc} = kernelParams;\n      // Running a customGrad op.\n      const saveFunc: GradSaveFunc = (tensors) => {\n        // Do not save unless we are recording to the tape. Otherwise it would\n        // cause a mem leak since we would never run backprop, which disposes\n        // the kept tensors.\n        if (!isTapeOn) {\n          return;\n        }\n        saved = tensors.map(tensor => this.keep(this.clone(tensor)));\n      };\n\n      kernelFunc = () => {\n        const numDataIdsBefore = this.backend.numDataIds();\n        out = this.tidy(() => forwardFunc(this.backend, saveFunc));\n        const outs = (Array.isArray(out) ? out : [out]) as Tensor[];\n        if (this.shouldCheckForMemLeaks()) {\n          // Scope name is used to print a more helpful error message if needed.\n          this.checkKernelForMemLeak(kernelOrScopeName, numDataIdsBefore, outs);\n        }\n        return outs;\n      };\n    }\n\n    //\n    // Run the kernelFunc. Optionally profiling it.\n    //\n    const {inputs, attrs} = kernelParams;\n    const backwardsFunc = isRegisteredKernelInvocation(kernelParams) ?\n        null :\n        kernelParams.backwardsFunc;\n\n    let kernelProfile: KernelProfile;\n    this.scopedRun(\n        // Stop recording to a tape when running a kernel.\n        () => this.state.kernelDepth++, () => this.state.kernelDepth--, () => {\n          if (!this.ENV.getBool('DEBUG') && !this.state.profiling) {\n            outputs = kernelFunc();\n          } else {\n            kernelProfile = this.profiler.profileKernel(\n                kernelOrScopeName, inputs, () => kernelFunc());\n            if (this.ENV.getBool('DEBUG')) {\n              this.profiler.logKernelProfile(kernelProfile);\n            }\n            outputs = kernelProfile.outputs;\n          }\n        });\n\n    if (isTapeOn) {\n      this.addTapeNode(\n          kernelOrScopeName, inputs, outputs, backwardsFunc, saved, attrs);\n    }\n\n    if (this.state.profiling) {\n      this.state.activeProfile.kernels.push({\n        name: kernelOrScopeName,\n        bytesAdded: this.state.numBytes - startingBytecount,\n        totalBytesSnapshot: this.state.numBytes,\n        tensorsAdded: this.state.numTensors - startingNumTensors,\n        totalTensorsSnapshot: this.state.numTensors,\n        inputShapes: Object.keys(inputs).map(\n            key => inputs[key] != null ? inputs[key].shape : null),\n        outputShapes: outputs.map(item => item.shape),\n        kernelTimeMs: kernelProfile.timeMs,\n        extraInfo: kernelProfile.extraInfo\n      });\n    }\n    return (Array.isArray(out) ? outputs : outputs[0]) as T;\n  }\n\n  /**\n   * Saves tensors used in forward mode for use in backward mode.\n   *\n   * @param tensors the list of tensors to save.\n   */\n  private saveTensorsForBackwardMode(tensors: Tensor[]): Tensor[] {\n    const saved = tensors.map(tensor => this.keep(this.clone(tensor)));\n    return saved;\n  }\n\n  /**\n   * Returns a list of tensors to save for a given gradient calculation.\n   *\n   * @param kernelName name of kernel to look up gradient for.\n   * @param inputs a map of input tensors.\n   * @param outputs an array of output tensors from forward mode of kernel.\n   */\n  private getTensorsForGradient(\n      kernelName: string, inputs: NamedTensorMap,\n      outputs: Tensor[]): Tensor[]|null {\n    const gradConfig = getGradient(kernelName);\n    if (gradConfig != null) {\n      const inputsToSave: string[] = gradConfig.inputsToSave || [];\n      const outputsToSave: boolean[] = gradConfig.outputsToSave || [];\n\n      // If saveAllInputs is true, all inputs will be saved. Otherwise, inputs\n      // specified in inputsToSave will be saved.\n      let inputTensorsToSave: Tensor[];\n      if (gradConfig.saveAllInputs) {\n        util.assert(\n            Array.isArray(inputs),\n            () => 'saveAllInputs is true, expected inputs to be an array.');\n\n        inputTensorsToSave = Object.keys(inputs).map((key) => inputs[key]);\n      } else {\n        inputTensorsToSave = inputsToSave.map((inputName) => inputs[inputName]);\n      }\n\n      const outputTensorsToSave: Tensor[] =\n          outputs.filter((_, i) => outputsToSave[i]);\n\n      return inputTensorsToSave.concat(outputTensorsToSave);\n    }\n    // We return an empty list rather than throw an error because the kernel we\n    // are looking up may not actually be relevant to backproping through the\n    // overall function\n    //\n    // See 'does not error if irrelevant (pruned) ops are missing grads' test\n    // in gradients_test.ts for an example.\n    return [];\n  }\n\n  /**\n   * Internal method used by public APIs for tensor creation. Makes a new\n   * tensor with the provided shape, dtype and values. It always\n   * creates a new data id and writes the values to the underlying backend.\n   */\n  makeTensor(\n      values: DataValues, shape: number[], dtype: DataType,\n      backend?: KernelBackend): Tensor {\n    if (values == null) {\n      throw new Error('Values passed to engine.makeTensor() are null');\n    }\n    dtype = dtype || 'float32';\n    backend = backend || this.backend;\n    let backendVals = values as BackendValues;\n    if (dtype === 'string' && util.isString(values[0])) {\n      backendVals = (values as string[]).map(d => util.encodeString(d));\n    }\n    const dataId = backend.write(backendVals, shape, dtype);\n    const t = new Tensor(shape, dtype, dataId, this.nextTensorId());\n    this.trackTensor(t, backend);\n\n    // Count bytes for string tensors.\n    if (dtype === 'string') {\n      const info = this.state.tensorInfo.get(dataId);\n      const newBytes = bytesFromStringArray(backendVals as Uint8Array[]);\n      this.state.numBytes += newBytes - info.bytes;\n      info.bytes = newBytes;\n    }\n    return t;\n  }\n\n  /**\n   * Internal method used by backends. Makes a new tensor\n   * that is a wrapper around an existing data id. It doesn't create\n   * a new data id, only increments the ref count used in memory tracking.\n   * @deprecated\n   */\n  makeTensorFromDataId(\n    dataId: DataId, shape: number[], dtype: DataType,\n    backend?: KernelBackend): Tensor {\n    dtype = dtype || 'float32';\n    const tensorInfo: TensorInfo = {dataId, shape, dtype};\n    return this.makeTensorFromTensorInfo(tensorInfo, backend);\n  }\n\n  /**\n   * Internal method used by backends. Makes a new tensor that is a wrapper\n   * around an existing data id in TensorInfo. It doesn't create a new data id,\n   * only increments the ref count used in memory tracking.\n   */\n  makeTensorFromTensorInfo(tensorInfo: TensorInfo, backend?: KernelBackend):\n      Tensor {\n    const {dataId, shape, dtype} = tensorInfo;\n    const t = new Tensor(shape, dtype, dataId, this.nextTensorId());\n    this.trackTensor(t, backend);\n    return t;\n  }\n\n  makeVariable(\n      initialValue: Tensor, trainable = true, name?: string,\n      dtype?: DataType): Variable {\n    name = name || this.nextVariableId().toString();\n    if (dtype != null && dtype !== initialValue.dtype) {\n      initialValue = initialValue.cast(dtype);\n    }\n    const v = new Variable(initialValue, trainable, name, this.nextTensorId());\n    if (this.state.registeredVariables[v.name] != null) {\n      throw new Error(`Variable with name ${v.name} was already registered`);\n    }\n    this.state.registeredVariables[v.name] = v;\n    this.incRef(v, this.backend);\n    return v;\n  }\n\n  trackTensor(a: Tensor, backend: KernelBackend): void {\n    this.state.numTensors++;\n    if (a.dtype === 'string') {\n      this.state.numStringTensors++;\n    }\n    // Bytes for complex numbers are counted by their components. Bytes for\n    // string tensors are counted when writing values.\n    let bytes = 0;\n    if (a.dtype !== 'complex64' && a.dtype !== 'string') {\n      bytes = a.size * util.bytesPerElement(a.dtype);\n    }\n    this.state.numBytes += bytes;\n\n    if (!this.state.tensorInfo.has(a.dataId)) {\n      this.state.numDataBuffers++;\n      this.state.tensorInfo.set(a.dataId, {\n        backend: backend || this.backend,\n        dtype: a.dtype,\n        shape: a.shape,\n        bytes\n      });\n    }\n\n    if (!(a instanceof Variable)) {\n      this.track(a);\n    }\n  }\n\n  // Track the tensor by dataId and increase the refCount for the dataId in the\n  // backend.\n  // TODO(pyu10055): This is currently used by makeVariable method, to increase\n  // refCount on the backend for the dataId. It can potentially be replaced with\n  // Identity op indead of calling backend directly.\n  incRef(a: Tensor, backend: KernelBackend): void {\n    this.trackTensor(a, backend);\n    this.backend.incRef(a.dataId);\n  }\n\n  removeDataId(dataId: DataId, backend: KernelBackend) {\n    if (this.state.tensorInfo.has(dataId) &&\n        this.state.tensorInfo.get(dataId).backend === backend) {\n      this.state.tensorInfo.delete(dataId);\n      this.state.numDataBuffers--;\n    }\n  }\n  disposeTensor(a: Tensor): void {\n    if (!this.state.tensorInfo.has(a.dataId)) {\n      return;\n    }\n    const info = this.state.tensorInfo.get(a.dataId);\n\n    this.state.numTensors--;\n    if (a.dtype === 'string') {\n      this.state.numStringTensors--;\n      this.state.numBytes -= info.bytes;\n    }\n    // Don't count bytes for complex numbers as they are counted by their\n    // components.\n    if (a.dtype !== 'complex64' && a.dtype !== 'string') {\n      const bytes = a.size * util.bytesPerElement(a.dtype);\n      this.state.numBytes -= bytes;\n    }\n\n    // Remove the reference to dataId if backend dispose the data successfully\n    if (info.backend.disposeData(a.dataId)) {\n      this.removeDataId(a.dataId, info.backend);\n    }\n\n    // TODO(nsthorat): Construct an error and save the stack trace for\n    // debugging when in debug mode. Creating a stack trace is too expensive\n    // to do unconditionally.\n  }\n\n  disposeVariables(): void {\n    for (const varName in this.state.registeredVariables) {\n      const v = this.state.registeredVariables[varName];\n      this.disposeVariable(v);\n    }\n  }\n\n  disposeVariable(v: Variable): void {\n    this.disposeTensor(v);\n    if (this.state.registeredVariables[v.name] != null) {\n      delete this.state.registeredVariables[v.name];\n    }\n  }\n\n  memory(): MemoryInfo {\n    const info = this.backend.memory() as MemoryInfo;\n    info.numTensors = this.state.numTensors;\n    info.numDataBuffers = this.state.numDataBuffers;\n    info.numBytes = this.state.numBytes;\n    if (this.state.numStringTensors > 0) {\n      info.unreliable = true;\n      if (info.reasons == null) {\n        info.reasons = [];\n      }\n      info.reasons.push(\n          'Memory usage by string tensors is approximate ' +\n          '(2 bytes per character)');\n    }\n    return info;\n  }\n\n  async profile(query: () => (TensorContainer | Promise<TensorContainer>)):\n      Promise<ProfileInfo> {\n    this.state.profiling = true;\n\n    const startBytes = this.state.numBytes;\n    const startNumTensors = this.state.numTensors;\n\n    this.state.activeProfile.kernels = [];\n    this.state.activeProfile.result = await query();\n\n    this.state.profiling = false;\n\n    this.state.activeProfile.peakBytes = Math.max(\n        ...this.state.activeProfile.kernels.map(d => d.totalBytesSnapshot));\n    this.state.activeProfile.newBytes = this.state.numBytes - startBytes;\n    this.state.activeProfile.newTensors =\n        this.state.numTensors - startNumTensors;\n    for (const kernel of this.state.activeProfile.kernels) {\n      kernel.kernelTimeMs = await kernel.kernelTimeMs;\n      kernel.extraInfo = await kernel.extraInfo;\n    }\n    return this.state.activeProfile;\n  }\n\n  isTapeOn(): boolean {\n    return this.state.gradientDepth > 0 && this.state.kernelDepth === 0;\n  }\n\n  private addTapeNode(\n      kernelName: string, inputs: NamedTensorMap, outputs: Tensor[],\n      gradientsFunc: GradFunc, saved: Tensor[], attrs: NamedAttrMap): void {\n    const tapeNode: TapeNode =\n        {id: this.state.nextTapeNodeId++, kernelName, inputs, outputs, saved};\n\n    const gradConfig = getGradient(kernelName);\n    if (gradConfig != null) {\n      gradientsFunc = gradConfig.gradFunc;\n    }\n    if (gradientsFunc != null) {\n      tapeNode.gradient = (dys: Tensor[]) => {\n        // TODO(smilkov): To optimize back-prop, pass dys that are not used in\n        // the backprop graph to the user as null instead of zeros\n        dys = dys.map((dy, i) => {\n          if (dy == null) {\n            const output = outputs[i];\n            const vals = util.makeZerosTypedArray(output.size, output.dtype);\n            return this.makeTensor(vals, output.shape, output.dtype);\n          }\n          return dy;\n        });\n        // Grad functions of ops with single outputs expect a dy, while ops\n        // with multiple outputs expect dys (array of dy).\n        return gradientsFunc(dys.length > 1 ? dys : dys[0], saved, attrs);\n      };\n    }\n    this.state.activeTape.push(tapeNode);\n  }\n\n  keep<T extends Tensor>(result: T): T {\n    result.kept = true;\n    return result;\n  }\n\n  private startTape() {\n    if (this.state.gradientDepth === 0) {\n      this.state.activeTape = [];\n    }\n    this.state.gradientDepth++;\n  }\n\n  private endTape() {\n    this.state.gradientDepth--;\n  }\n\n  /**\n   * Start a scope. Use this with endScope() to achieve the same functionality\n   * as scope() without the need for a function closure.\n   */\n  startScope(name?: string) {\n    const scopeInfo: ScopeState = {\n      track: [],\n      name: 'unnamed scope',\n      id: this.state.nextScopeId++\n    };\n    if (name) {\n      scopeInfo.name = name;\n    }\n    this.state.scopeStack.push(scopeInfo);\n    this.state.activeScope = scopeInfo;\n  }\n\n  /**\n   * End a scope. Use this with startScope() to achieve the same functionality\n   * as scope() without the need for a function closure.\n   */\n  endScope(result?: TensorContainer) {\n    const tensorsToTrackInParent = getTensorsInContainer(result);\n    const tensorsToTrackInParentSet =\n        new Set(tensorsToTrackInParent.map(t => t.id));\n\n    // Dispose the arrays tracked in this scope.\n    for (let i = 0; i < this.state.activeScope.track.length; i++) {\n      const tensor = this.state.activeScope.track[i];\n      if (!tensor.kept && !tensorsToTrackInParentSet.has(tensor.id)) {\n        tensor.dispose();\n      }\n    }\n\n    const oldScope = this.state.scopeStack.pop();\n    this.state.activeScope = this.state.scopeStack.length === 0 ?\n        null :\n        this.state.scopeStack[this.state.scopeStack.length - 1];\n\n    // Track the current result in the parent scope.\n    tensorsToTrackInParent.forEach(tensor => {\n      // Only track the tensor if was allocated in the inner scope and is not\n      // globally kept.\n      if (!tensor.kept && tensor.scopeId === oldScope.id) {\n        this.track(tensor);\n      }\n    });\n  }\n\n  /**\n   * Returns gradients of `f` with respect to each of the `xs`. The gradients\n   * returned are of the same length as `xs`, but some might be null if `f`\n   * was not a function of that `x`. It also takes optional dy to multiply the\n   * gradient, which defaults to `1`.\n   */\n  gradients<T extends Tensor>(\n      f: () => T, xs: Tensor[], dy?: T,\n      allowNoGradients = false): {value: T, grads: Tensor[]} {\n    util.assert(\n        xs.length > 0, () => 'gradients() received an empty list of xs.');\n    if (dy != null && dy.dtype !== 'float32') {\n      throw new Error(`dy must have 'float32' dtype, but has '${dy.dtype}'`);\n    }\n\n    const y = this.scopedRun(\n        () => this.startTape(), () => this.endTape(),\n        () => this.tidy('forward', f));\n\n    util.assert(\n        y instanceof Tensor,\n        () => 'The result y returned by f() must be a tensor.');\n    // Filter out the nodes that don't connect x => y.\n    const filteredTape = getFilteredNodesXToY(this.state.activeTape, xs, y);\n    if (!allowNoGradients && filteredTape.length === 0 && xs.length > 0) {\n      throw new Error(\n          'Cannot compute gradient of y=f(x) with respect to x. Make sure ' +\n          'that the f you passed encloses all operations that lead from x ' +\n          'to y.');\n    }\n\n    return this.tidy('backward', () => {\n      const accumulatedGradientMap: {[tensorId: number]: Tensor} = {};\n      accumulatedGradientMap[y.id] = (dy == null) ? ones(y.shape) : dy;\n\n      // Backprop gradients through the filtered nodes.\n      backpropagateGradients(\n          accumulatedGradientMap, filteredTape,\n          // Pass the tidy function to avoid circular dep with `tape.ts`.\n          f => this.tidy(f as ScopeFn<Tensor>),\n          // Pass an add function to avoide a circular dep with `tape.ts`.\n          add);\n      const grads = xs.map(x => accumulatedGradientMap[x.id]);\n\n      if (this.state.gradientDepth === 0) {\n        // This means that we are not computing higher-order gradients\n        // and can clean up the tape.\n        this.state.activeTape.forEach(node => {\n          for (const tensor of node.saved) {\n            tensor.dispose();\n          }\n        });\n        this.state.activeTape = null;\n      }\n      return {value: y, grads};\n    });\n  }\n\n  customGrad<T extends Tensor>(f: CustomGradientFunc<T>):\n      (...args: Array<Tensor|GradSaveFunc>) => T {\n    util.assert(\n        util.isFunction(f),\n        () => 'The f passed in customGrad(f) must be a function.');\n    return (...inputs: Tensor[]): T => {\n      util.assert(\n          inputs.every(t => t instanceof Tensor),\n          () => 'The args passed in customGrad(f)(x1, x2,...) must all be ' +\n              'tensors');\n\n      let res: {\n        value: T,\n        gradFunc: (dy: T, saved: Tensor[]) => Tensor | Tensor[],\n      };\n      const inputMap: NamedTensorMap = {};\n      inputs.forEach((input, i) => {\n        inputMap[i] = input;\n      });\n\n      const forwardFunc: ForwardFunc<T> = (_, save) => {\n        res = f(...[...inputs, save]);\n        util.assert(\n            res.value instanceof Tensor,\n            () => 'The function f passed in customGrad(f) must return an ' +\n                'object where `obj.value` is a tensor');\n        util.assert(\n            util.isFunction(res.gradFunc),\n            () => 'The function f passed in customGrad(f) must return an ' +\n                'object where `obj.gradFunc` is a function.');\n        return res.value;\n      };\n\n      const backwardsFunc = (dy: T, saved: Tensor[]) => {\n        const gradRes = res.gradFunc(dy, saved);\n        const grads: Tensor[] = Array.isArray(gradRes) ? gradRes : [gradRes];\n        util.assert(\n            grads.length === inputs.length,\n            () => 'The function f passed in customGrad(f) must return an ' +\n                'object where `obj.gradFunc` is a function that returns ' +\n                'the same number of tensors as inputs passed to f(...).');\n        util.assert(\n            grads.every(t => t instanceof Tensor),\n            () => 'The function f passed in customGrad(f) must return an ' +\n                'object where `obj.gradFunc` is a function that returns ' +\n                'a list of only tensors.');\n        const gradMap: {[key: string]: () => Tensor} = {};\n        grads.forEach((grad, i) => {\n          gradMap[i] = () => grad;\n        });\n        return gradMap;\n      };\n\n      return this.runKernelFunc({\n        forwardFunc,\n        backwardsFunc,\n        inputs: inputMap,\n      });\n    };\n  }\n\n  readSync(dataId: DataId): BackendValues {\n    // Route the read to the correct backend.\n    const info = this.state.tensorInfo.get(dataId);\n    return info.backend.readSync(dataId);\n  }\n  read(dataId: DataId): Promise<BackendValues> {\n    // Route the read to the correct backend.\n    const info = this.state.tensorInfo.get(dataId);\n    return info.backend.read(dataId);\n  }\n\n  readToGPU(dataId: DataId, options?: DataToGPUOptions): GPUData {\n    // Route the read to the correct backend.\n    const info = this.state.tensorInfo.get(dataId);\n    return info.backend.readToGPU(dataId, options);\n  }\n\n  async time(query: () => void): Promise<TimingInfo> {\n    const start = now();\n    const timingInfo = await this.backend.time(query) as TimingInfo;\n    timingInfo.wallMs = now() - start;\n    return timingInfo;\n  }\n\n  /**\n   * Tracks a Tensor in the current scope to be automatically cleaned up\n   * when the current scope ends, and returns the value.\n   *\n   * @param result The Tensor to track in the current scope.\n   */\n  private track<T extends Tensor>(result: T): T {\n    if (this.state.activeScope != null) {\n      result.scopeId = this.state.activeScope.id;\n      this.state.activeScope.track.push(result);\n    }\n\n    return result;\n  }\n\n  get registeredVariables(): NamedVariableMap {\n    return this.state.registeredVariables;\n  }\n\n  /**\n   * Resets the engine state. Removes all backends but does not remove\n   * registered backend factories.\n   */\n  reset(): void {\n    // Make any pending promise obsolete.\n    this.pendingBackendInitId++;\n\n    this.state.dispose();\n    this.ENV.reset();\n    this.state = new EngineState();\n\n    for (const backendName in this.registry) {\n      this.disposeRegisteredKernels(backendName);\n      this.registry[backendName].dispose();\n      delete this.registry[backendName];\n    }\n    this.backendName = null;\n    this.backendInstance = null;\n    this.pendingBackendInit = null;\n  }\n}\n\nfunction ones(shape: number[]): Tensor {\n  const values = makeOnesTypedArray(sizeFromShape(shape), 'float32');\n  return ENGINE.makeTensor(values, shape, 'float32');\n}\n\nexport function getOrMakeEngine(): Engine {\n  const ns = getGlobalNamespace() as unknown as {_tfengine: Engine};\n  if (ns._tfengine == null) {\n    const environment = new Environment(ns);\n    ns._tfengine = new Engine(environment);\n  }\n  setEnvironmentGlobal(ns._tfengine.ENV);\n\n  // Tell the current tensor interface that the global engine is responsible\n  // for tracking.\n  setTensorTracker(() => ns._tfengine);\n  return ns._tfengine;\n}\n\nexport const ENGINE = getOrMakeEngine();\n\n/**\n * A implementation of the add op for use within engine and tape.\n *\n * This allows us to avoid a circular dependency between add.ts and engine.\n * It is exported to be available in tape tests.\n */\nexport function add(a: Tensor, b: Tensor): Tensor {\n  // We duplicate Add here to avoid a circular dependency with add.ts.\n  const inputs = {a, b};\n  return ENGINE.runKernel(Add, inputs as unknown as NamedTensorMap);\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from './engine';\nimport {env} from './environment';\nimport {getGlobalTensorClass, Tensor} from './tensor';\nimport {DataType, isWebGLData, isWebGPUData, TensorLike, WebGLData, WebGPUData} from './types';\nimport {assert, flatten, inferDtype, isTypedArray, toTypedArray} from './util';\nimport {bytesPerElement} from './util_base';\n\nexport function inferShape(\n    val: TensorLike|WebGLData|WebGPUData, dtype?: DataType): number[] {\n  let firstElem: typeof val = val;\n\n  if (isTypedArray(val)) {\n    return dtype === 'string' ? [] : [val.length];\n  }\n\n  if (isWebGLData(val)) {\n    const usedChannels = val.channels || 'RGBA';\n    return [val.height, val.width * usedChannels.length];\n  } else if (isWebGPUData(val)) {\n    return [val.buffer.size / (dtype == null ? 4 : bytesPerElement(dtype))];\n  }\n  if (!Array.isArray(val)) {\n    return [];  // Scalar.\n  }\n  const shape: number[] = [];\n\n  while (Array.isArray(firstElem) ||\n         isTypedArray(firstElem) && dtype !== 'string') {\n    shape.push(firstElem.length);\n    firstElem = firstElem[0];\n  }\n  if (Array.isArray(val) &&\n      env().getBool('TENSORLIKE_CHECK_SHAPE_CONSISTENCY')) {\n    deepAssertShapeConsistency(val, shape, []);\n  }\n\n  return shape;\n}\n\nfunction deepAssertShapeConsistency(\n    val: TensorLike, shape: number[], indices: number[]) {\n  indices = indices || [];\n  if (!(Array.isArray(val)) && !isTypedArray(val)) {\n    assert(\n        shape.length === 0,\n        () => `Element arr[${indices.join('][')}] is a primitive, ` +\n            `but should be an array/TypedArray of ${shape[0]} elements`);\n    return;\n  }\n  assert(\n      shape.length > 0,\n      () => `Element arr[${indices.join('][')}] should be a primitive, ` +\n          `but is an array of ${val.length} elements`);\n  assert(\n      val.length === shape[0],\n      () => `Element arr[${indices.join('][')}] should have ${shape[0]} ` +\n          `elements, but has ${val.length} elements`);\n  const subShape = shape.slice(1);\n  for (let i = 0; i < val.length; ++i) {\n    deepAssertShapeConsistency(val[i], subShape, indices.concat(i));\n  }\n}\n\nfunction assertDtype(\n    expectedDtype: DataType|'numeric'|'string_or_numeric',\n    actualDType: DataType, argName: string, functionName: string) {\n  if (expectedDtype === 'string_or_numeric') {\n    return;\n  }\n  if (expectedDtype == null) {\n    throw new Error(`Expected dtype cannot be null.`);\n  }\n  if (expectedDtype !== 'numeric' && expectedDtype !== actualDType ||\n      expectedDtype === 'numeric' && actualDType === 'string') {\n    throw new Error(\n        `Argument '${argName}' passed to '${functionName}' must ` +\n        `be ${expectedDtype} tensor, but got ${actualDType} tensor`);\n  }\n}\n\nexport function convertToTensor<T extends Tensor>(\n    x: T|TensorLike, argName: string, functionName: string,\n    parseAsDtype: DataType|'numeric'|'string_or_numeric' = 'numeric'): T {\n  if (x instanceof getGlobalTensorClass()) {\n    assertDtype(parseAsDtype, x.dtype, argName, functionName);\n    return x;\n  }\n  let inferredDtype = inferDtype(x);\n  // If the user expects a bool/int/float, use that info to update the\n  // inferredDtype when it is not a string.\n  if (inferredDtype !== 'string' &&\n      ['bool', 'int32', 'float32'].indexOf(parseAsDtype) >= 0) {\n    inferredDtype = parseAsDtype as DataType;\n  }\n  assertDtype(parseAsDtype, inferredDtype, argName, functionName);\n\n  if ((x == null) ||\n      (!isTypedArray(x) && !Array.isArray(x) && typeof x !== 'number' &&\n       typeof x !== 'boolean' && typeof x !== 'string')) {\n    const type = x == null ? 'null' : (x as {}).constructor.name;\n    throw new Error(\n        `Argument '${argName}' passed to '${functionName}' must be a ` +\n        `Tensor or TensorLike, but got '${type}'`);\n  }\n  const inferredShape = inferShape(x, inferredDtype);\n  if (!isTypedArray(x) && !Array.isArray(x)) {\n    x = [x] as number[];\n  }\n  const skipTypedArray = true;\n  const values = inferredDtype !== 'string' ?\n      toTypedArray(x, inferredDtype as DataType) :\n      flatten(x as string[], [], skipTypedArray) as string[];\n  return ENGINE.makeTensor(values, inferredShape, inferredDtype) as T;\n}\n\nexport function convertToTensorArray<T extends Tensor>(\n    arg: Array<T|TensorLike>, argName: string, functionName: string,\n    parseAsDtype: DataType|'numeric'|'string_or_numeric' = 'numeric'): T[] {\n  if (!Array.isArray(arg)) {\n    throw new Error(\n        `Argument ${argName} passed to ${functionName} must be a ` +\n        '`Tensor[]` or `TensorLike[]`');\n  }\n  const tensors = arg as T[];\n  return tensors.map(\n      (t, i) =>\n          convertToTensor(t, `${argName}[${i}]`, functionName, parseAsDtype));\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {isPromise} from '../util';\n\nexport const OP_SCOPE_SUFFIX = '__op';\n\n/**\n * Used for wrapping functions that perform math operations on\n * Tensors. The function will be wrapped in a named scope that cleans all\n * memory usage after the function is done.\n */\nexport function op<T extends Function>(f: {[name: string]: T}): T {\n  const keys = Object.keys(f);\n  if (keys.length !== 1) {\n    throw new Error(\n        `Please provide an object with a single key ` +\n        `(operation name) mapping to a function. Got an object with ` +\n        `${keys.length} keys.`);\n  }\n\n  let opName = keys[0];\n  const fn = f[opName];\n\n  // Strip the underscore from the end of the function name.\n  if (opName.endsWith('_')) {\n    opName = opName.substring(0, opName.length - 1);\n  }\n\n  // add an __op suffix to distinguish ops from kernels in tf.profile\n  opName = opName + OP_SCOPE_SUFFIX;\n\n  // tslint:disable-next-line:no-any\n  const f2 = (...args: any[]) => {\n    ENGINE.startScope(opName);\n    try {\n      const result = fn(...args);\n      if (isPromise(result)) {\n        console.error('Cannot return a Promise inside of tidy.');\n      }\n      ENGINE.endScope(result);\n      return result;\n    } catch (ex) {\n      ENGINE.endScope(null);\n      throw ex;\n    }\n  };\n  Object.defineProperty(f2, 'name', {value: opName, configurable: true});\n\n  // tslint:disable-next-line:no-any\n  return f2 as any as T;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Abs, AbsInputs, ComplexAbs, ComplexAbsInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes absolute value element-wise: `abs(x)`\n *\n * ```js\n * const x = tf.tensor1d([-1, 2, -3, 4]);\n *\n * x.abs().print();  // or tf.abs(x)\n * ```\n * @param x The input `tf.Tensor`.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction abs_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'abs');\n\n  if ($x.dtype === 'complex64') {\n    const inputs: ComplexAbsInputs = {x: $x};\n    return ENGINE.runKernel(ComplexAbs, inputs as unknown as NamedTensorMap);\n  } else {\n    const inputs: AbsInputs = {x: $x};\n    return ENGINE.runKernel(Abs, inputs as unknown as NamedTensorMap);\n  }\n}\n\nexport const abs = /* @__PURE__ */ op({abs_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Acos, AcosInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes acos of the input `tf.Tensor` element-wise: `acos(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, 1, -1, .7]);\n *\n * x.acos().print();  // or tf.acos(x)\n * ```\n * @param x The input tensor.\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction acos_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'acos');\n  const inputs: AcosInputs = {x: $x};\n\n  return ENGINE.runKernel(Acos, inputs as unknown as NamedTensorMap);\n}\nexport const acos = /* @__PURE__ */ op({acos_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Acosh, AcoshInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the inverse hyperbolic cos of the input `tf.Tensor` element-wise:\n * `acosh(x)`\n *\n * ```js\n * const x = tf.tensor1d([10, 1, 3, 5.7]);\n *\n * x.acosh().print();  // or tf.acosh(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction acosh_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'acosh');\n  const inputs: AcoshInputs = {x: $x};\n\n  return ENGINE.runKernel(Acosh, inputs as unknown as NamedTensorMap);\n}\nexport const acosh = /* @__PURE__ */ op({acosh_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Add, AddInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Adds two `tf.Tensor`s element-wise, A + B. Supports broadcasting.\n *\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3, 4]);\n * const b = tf.tensor1d([10, 20, 30, 40]);\n *\n * a.add(b).print();  // or tf.add(a, b)\n * ```\n *\n * ```js\n * // Broadcast add a with b.\n * const a = tf.scalar(5);\n * const b = tf.tensor1d([10, 20, 30, 40]);\n *\n * a.add(b).print();  // or tf.add(a, b)\n * ```\n * @param a The first `tf.Tensor` to add.\n * @param b The second `tf.Tensor` to add. Must have the same type as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction add_<T extends Tensor>(a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'add');\n  let $b = convertToTensor(b, 'b', 'add');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  const inputs: AddInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(Add, inputs as unknown as NamedTensorMap);\n}\n\nexport const add = /* @__PURE__ */ op({add_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {AddN, AddNInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Adds a list of `tf.Tensor`s element-wise, each with the same shape and dtype.\n *\n * ```js\n * const a = tf.tensor1d([1, 2]);\n * const b = tf.tensor1d([3, 4]);\n * const c = tf.tensor1d([5, 6]);\n *\n * tf.addN([a, b, c]).print();\n * ```\n * @param tensors A list of tensors with the same shape and dtype.\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction addN_<T extends Tensor>(tensors: Array<T|TensorLike>): T {\n  util.assert(\n      Array.isArray(tensors),\n      () => 'The argument passed to tf.addN() must be a list of tensors');\n  util.assert(\n      tensors.length >= 1,\n      () => `Must pass at least one tensor to tf.addN(), but got ` +\n          `${tensors.length}`);\n\n  const $tensors =\n      tensors.map((t, i) => convertToTensor(t, `tensors${i}`, 'addN'));\n\n  const firstTensor = $tensors[0];\n  $tensors.forEach(t => {\n    if (t.dtype !== firstTensor.dtype) {\n      throw new Error(\n          'All tensors passed to tf.addN() must have the same dtype');\n    }\n  });\n\n  $tensors.forEach(t => {\n    if (!util.arraysEqual(t.shape, firstTensor.shape)) {\n      throw new Error(\n          'All tensors passed to tf.addN() must have the same shape');\n    }\n  });\n\n  const inputs: AddNInputs = $tensors;\n\n  return ENGINE.runKernel(AddN, inputs as unknown as NamedTensorMap);\n}\n\nexport const addN = /* @__PURE__ */ op({addN_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {All, AllAttrs, AllInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the logical and of elements across dimensions of a `tf.Tensor`.\n *\n * Reduces the input along the dimensions given in `axes`. Unless `keepDims`\n * is true, the rank of the `tf.Tensor` is reduced by 1 for each entry in\n * `axes`. If `keepDims` is true, the reduced dimensions are retained with\n * length 1. If `axes` has no entries, all dimensions are reduced, and a\n * `tf.Tensor` with a single element is returned.\n *\n * ```js\n * const x = tf.tensor1d([1, 1, 1], 'bool');\n *\n * x.all().print();  // or tf.all(x)\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 1, 0, 0], [2, 2], 'bool');\n *\n * const axis = 1;\n * x.all(axis).print();  // or tf.all(x, axis)\n * ```\n *\n * @param x The input tensor. Must be of dtype bool.\n * @param axis The dimension(s) to reduce. By default it reduces\n *     all dimensions.\n * @param keepDims If true, retains reduced dimensions with size 1.\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction all_<T extends Tensor>(\n    x: Tensor|TensorLike, axis: number|number[] = null, keepDims = false): T {\n  const $x = convertToTensor(x, 'x', 'all', 'bool');\n\n  const inputs: AllInputs = {x: $x};\n  const attrs: AllAttrs = {axis, keepDims};\n\n  return ENGINE.runKernel(\n      All, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const all = /* @__PURE__ */ op({all_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Any, AnyAttrs, AnyInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the logical or of elements across dimensions of a `tf.Tensor`.\n *\n * Reduces the input along the dimensions given in `axes`. Unless `keepDims`\n * is true, the rank of the `tf.Tensor` is reduced by 1 for each entry in\n * `axes`. If `keepDims` is true, the reduced dimensions are retained with\n * length 1. If `axes` has no entries, all dimensions are reduced, and a\n * `tf.Tensor` with a single element is returned.\n *\n * ```js\n * const x = tf.tensor1d([1, 1, 1], 'bool');\n *\n * x.any().print();  // or tf.any(x)\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 1, 0, 0], [2, 2], 'bool');\n *\n * const axis = 1;\n * x.any(axis).print();  // or tf.any(x, axis)\n * ```\n *\n * @param x The input tensor. Must be of dtype bool.\n * @param axis The dimension(s) to reduce. By default it reduces\n *     all dimensions.\n * @param keepDims If true, retains reduced dimensions with size 1.\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction any_<T extends Tensor>(\n    x: Tensor|TensorLike, axis: number|number[] = null, keepDims = false): T {\n  const $x = convertToTensor(x, 'x', 'any', 'bool');\n\n  const inputs: AnyInputs = {x: $x};\n  const attrs: AnyAttrs = {axis, keepDims};\n\n  return ENGINE.runKernel(\n      Any, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\n// tslint:disable-next-line:variable-name\nexport const any = /* @__PURE__ */ op({any_});\n", "/**\n * @license\n * Copyright 2020 Google Inc. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {ArgMax, ArgMaxAttrs, ArgMaxInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Returns the indices of the maximum values along an `axis`.\n *\n * The result has the same shape as `input` with the dimension along `axis`\n * removed.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3]);\n *\n * x.argMax().print();  // or tf.argMax(x)\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 4, 3], [2, 2]);\n *\n * const axis = 1;\n * x.argMax(axis).print();  // or tf.argMax(x, axis)\n * ```\n *\n * @param x The input tensor.\n * @param axis The dimension to reduce. Defaults to 0 (outer-most dimension).\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction argMax_<T extends Tensor>(x: Tensor|TensorLike, axis = 0): T {\n  const $x = convertToTensor(x, 'x', 'argMax');\n\n  const inputs: ArgMaxInputs = {x: $x};\n  const attrs: ArgMaxAttrs = {axis};\n\n  return ENGINE.runKernel(\n      ArgMax, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const argMax = /* @__PURE__ */ op({argMax_});\n", "/**\n * @license\n * Copyright 2020 Google Inc. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {ArgMin, ArgMinAttrs, ArgMinInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Returns the indices of the minimum values along an `axis`.\n *\n * The result has the same shape as `input` with the dimension along `axis`\n * removed.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3]);\n *\n * x.argMin().print();  // or tf.argMin(x)\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 4, 3], [2, 2]);\n *\n * const axis = 1;\n * x.argMin(axis).print();  // or tf.argMin(x, axis)\n * ```\n *\n * @param x The input tensor.\n * @param axis The dimension to reduce. Defaults to 0 (outer-most dimension).\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction argMin_<T extends Tensor>(x: Tensor|TensorLike, axis = 0): T {\n  const $x = convertToTensor(x, 'x', 'argMin');\n\n  const inputs: ArgMinInputs = {x: $x};\n  const attrs: ArgMinAttrs = {axis};\n\n  return ENGINE.runKernel(\n      ArgMin, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const argMin = /* @__PURE__ */ op({argMin_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Asin, AsinInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes asin of the input `tf.Tensor` element-wise: `asin(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, 1, -1, .7]);\n *\n * x.asin().print();  // or tf.asin(x)\n * ```\n * @param x The input tensor.\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction asin_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'asin');\n  const inputs: AsinInputs = {x: $x};\n\n  return ENGINE.runKernel(Asin, inputs as unknown as NamedTensorMap);\n}\nexport const asin = /* @__PURE__ */ op({asin_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Asinh, AsinhInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes inverse hyperbolic sin of the input `tf.Tensor` element-wise:\n * `asinh(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, 1, -1, .7]);\n *\n * x.asinh().print();  // or tf.asinh(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction asinh_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'asinh');\n\n  const inputs: AsinhInputs = {x: $x};\n\n  return ENGINE.runKernel(Asinh, inputs as unknown as NamedTensorMap);\n}\nexport const asinh = /* @__PURE__ */ op({asinh_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Atan, AtanInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes atan of the input `tf.Tensor` element-wise: `atan(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, 1, -1, .7]);\n *\n * x.atan().print();  // or tf.atan(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction atan_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'atan');\n\n  const inputs: AtanInputs = {x: $x};\n\n  return ENGINE.runKernel(Atan, inputs as unknown as NamedTensorMap);\n}\nexport const atan = /* @__PURE__ */ op({atan_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Atan2, Atan2Inputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes arctangent of `tf.Tensor`s a / b element-wise: `atan2(a, b)`.\n * Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([1.0, 1.0, -1.0, .7]);\n * const b = tf.tensor1d([2.0, 13.0, 3.5, .21]);\n *\n * tf.atan2(a, b).print()\n * ```\n *\n * @param a The first tensor.\n * @param b The second tensor. Must have the same dtype as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction atan2_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'atan2');\n  let $b = convertToTensor(b, 'b', 'atan2');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  const inputs: Atan2Inputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(Atan2, inputs as unknown as NamedTensorMap);\n}\n\nexport const atan2 = /* @__PURE__ */ op({atan2_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Atanh, AtanhInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes inverse hyperbolic tan of the input `tf.Tensor` element-wise:\n * `atanh(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, .1, -.1, .7]);\n *\n * x.atanh().print();  // or tf.atanh(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction atanh_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'atanh');\n\n  const inputs: AtanhInputs = {x: $x};\n\n  return ENGINE.runKernel(Atanh, inputs as unknown as NamedTensorMap);\n}\nexport const atanh = /* @__PURE__ */ op({atanh_});\n", "/**\n * @license\n * Copyright 2020 Google Inc. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Cast, CastAttrs, CastInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {DataType, TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Casts a `tf.Tensor` to a new dtype.\n *\n * ```js\n * const x = tf.tensor1d([1.5, 2.5, 3]);\n * tf.cast(x, 'int32').print();\n * ```\n * @param x The input tensor to be casted.\n * @param dtype The dtype to cast the input tensor to.\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction cast_<T extends Tensor>(x: T|TensorLike, dtype: DataType): T {\n  const $x = convertToTensor(x, 'x', 'cast');\n\n  // Sanity checks.\n  if (!util.isValidDtype(dtype)) {\n    throw new Error(`Failed to cast to unknown dtype ${dtype}`);\n  }\n  if (dtype === 'string' && $x.dtype !== 'string' ||\n      dtype !== 'string' && $x.dtype === 'string') {\n    throw new Error('Only strings can be casted to strings');\n  }\n\n  const inputs: CastInputs = {x: $x};\n  const attrs: CastAttrs = {dtype};\n\n  return ENGINE.runKernel(\n      Cast, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const cast = /* @__PURE__ */ op({cast_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport * as util from '../util';\n\ntype PadType = 'SAME'|'VALID'|'NUMBER'|'EXPLICIT';\n\n// For NHWC should be in the following form:\n//  [[0, 0], [pad_top,pad_bottom], [pad_left, pad_right], [0, 0]]\n// For NCHW should be in the following form:\n//  [[0, 0], [0, 0], [pad_top,pad_bottom], [pad_left, pad_right]]\n// Reference: https://www.tensorflow.org/api_docs/python/tf/nn/conv2d\nexport type ExplicitPadding =\n    [[number, number], [number, number], [number, number], [number, number]];\n\nexport type PadInfo = {\n  top: number,\n  left: number,\n  right: number,\n  bottom: number,\n  type: PadType\n};\n\nexport type PadInfo3D = {\n  top: number,\n  left: number,\n  right: number,\n  bottom: number,\n  front: number,\n  back: number,\n  type: PadType\n};\n\n/**\n * Information about the forward pass of a convolution/pooling operation.\n * It includes input and output shape, strides, filter size and padding\n * information.\n */\nexport type Conv2DInfo = {\n  batchSize: number,\n  inHeight: number,\n  inWidth: number,\n  inChannels: number,\n  outHeight: number,\n  outWidth: number,\n  outChannels: number,\n  dataFormat: 'channelsFirst'|'channelsLast',\n  strideHeight: number,\n  strideWidth: number,\n  dilationHeight: number,\n  dilationWidth: number,\n  filterHeight: number,\n  filterWidth: number,\n  effectiveFilterHeight: number,\n  effectiveFilterWidth: number,\n  padInfo: PadInfo,\n  inShape: [number, number, number, number],\n  outShape: [number, number, number, number],\n  filterShape: [number, number, number, number]\n};\n\n/**\n *\n * @param inputShape Input tensor shape is of the following dimensions:\n *     `[batch, height, width, inChannels]`.\n * @param filterShape The filter shape is of the following dimensions:\n *     `[filterHeight, filterWidth, depth]`.\n * @param strides The strides of the sliding window for each dimension of the\n *     input tensor: `[strideHeight, strideWidth]`.\n *     If `strides` is a single number,\n *     then `strideHeight == strideWidth`.\n * @param pad The type of padding algorithm.\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1*1x1.\n *    - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dataFormat The data format of the input and output data.\n *     Defaults to 'NHWC'.\n * @param dilations The dilation rates: `[dilationHeight, dilationWidth]`.\n *     Defaults to `[1, 1]`. If `dilations` is a single number, then\n *     `dilationHeight == dilationWidth`.\n */\nexport function computeDilation2DInfo(\n    inputShape: [number, number, number, number],\n    filterShape: [number, number, number], strides: number|[number, number],\n    pad: 'same'|'valid'|number, dataFormat: 'NHWC' = 'NHWC',\n    dilations: number|[number, number]) {\n  // `computerConv2DInfo` require filterShape to be in the dimension of:\n  // `[filterHeight, filterWidth, depth, outDepth]`, dilation2d doesn't have\n  // outDepth, it should have the same depth as the input.\n  // Input shape: [batch, height, width, inChannels]\n  const inputChannels = inputShape[3];\n  const $filterShape =\n      [...filterShape, inputChannels] as [number, number, number, number];\n  const $dataFormat = convertConv2DDataFormat(dataFormat);\n\n  return computeConv2DInfo(\n      inputShape, $filterShape, strides, dilations, pad,\n      null /* roundingMode */, null /* depthWise */, $dataFormat);\n}\n\nexport function computePool2DInfo(\n    inShape: [number, number, number, number],\n    filterSize: [number, number]|number, strides: number|[number, number],\n    dilations: number|[number, number],\n    pad: 'same'|'valid'|number|ExplicitPadding,\n    roundingMode?: 'floor'|'round'|'ceil',\n    dataFormat: 'channelsFirst'|'channelsLast' = 'channelsLast'): Conv2DInfo {\n  const [filterHeight, filterWidth] = parseTupleParam(filterSize);\n\n  let filterShape: [number, number, number, number];\n  if (dataFormat === 'channelsLast') {\n    filterShape = [filterHeight, filterWidth, inShape[3], inShape[3]];\n  } else if (dataFormat === 'channelsFirst') {\n    filterShape = [filterHeight, filterWidth, inShape[1], inShape[1]];\n  } else {\n    throw new Error(`Unknown dataFormat ${dataFormat}`);\n  }\n\n  return computeConv2DInfo(\n      inShape, filterShape, strides, dilations, pad, roundingMode, false,\n      dataFormat);\n}\n\n/**\n * Computes the information for a forward pass of a pooling3D operation.\n */\nexport function computePool3DInfo(\n    inShape: [number, number, number, number, number],\n    filterSize: number|[number, number, number],\n    strides: number|[number, number, number],\n    dilations: number|[number, number, number], pad: 'same'|'valid'|number,\n    roundingMode?: 'floor'|'round'|'ceil',\n    dataFormat: 'NDHWC'|'NCDHW' = 'NDHWC'): Conv3DInfo {\n  const [filterDepth, filterHeight, filterWidth] = parse3TupleParam(filterSize);\n\n  let filterShape: [number, number, number, number, number];\n  let $dataFormat: 'channelsFirst'|'channelsLast';\n  if (dataFormat === 'NDHWC') {\n    $dataFormat = 'channelsLast';\n    filterShape =\n        [filterDepth, filterHeight, filterWidth, inShape[4], inShape[4]];\n  } else if (dataFormat === 'NCDHW') {\n    $dataFormat = 'channelsFirst';\n    filterShape =\n        [filterDepth, filterHeight, filterWidth, inShape[1], inShape[1]];\n  } else {\n    throw new Error(`Unknown dataFormat ${dataFormat}`);\n  }\n\n  return computeConv3DInfo(\n      inShape, filterShape, strides, dilations, pad, false, $dataFormat,\n      roundingMode);\n}\n\n/**\n * Computes the information for a forward pass of a convolution/pooling\n * operation.\n */\nexport function computeConv2DInfo(\n    inShape: [number, number, number, number],\n    filterShape: [number, number, number, number],\n    strides: number|[number, number], dilations: number|[number, number],\n    pad: 'same'|'valid'|number|ExplicitPadding,\n    roundingMode?: 'floor'|'round'|'ceil', depthwise = false,\n    dataFormat: 'channelsFirst'|'channelsLast' = 'channelsLast'): Conv2DInfo {\n  let [batchSize, inHeight, inWidth, inChannels] = [-1, -1, -1, -1];\n  if (dataFormat === 'channelsLast') {\n    [batchSize, inHeight, inWidth, inChannels] = inShape;\n  } else if (dataFormat === 'channelsFirst') {\n    [batchSize, inChannels, inHeight, inWidth] = inShape;\n  } else {\n    throw new Error(`Unknown dataFormat ${dataFormat}`);\n  }\n\n  const [filterHeight, filterWidth, , filterChannels] = filterShape;\n  const [strideHeight, strideWidth] = parseTupleParam(strides);\n  const [dilationHeight, dilationWidth] = parseTupleParam(dilations);\n\n  const effectiveFilterHeight =\n      getEffectiveFilterSize(filterHeight, dilationHeight);\n  const effectiveFilterWidth =\n      getEffectiveFilterSize(filterWidth, dilationWidth);\n  const {padInfo, outHeight, outWidth} = getPadAndOutInfo(\n      pad, inHeight, inWidth, strideHeight, strideWidth, effectiveFilterHeight,\n      effectiveFilterWidth, roundingMode, dataFormat);\n\n  const outChannels = depthwise ? filterChannels * inChannels : filterChannels;\n\n  let outShape: [number, number, number, number];\n  if (dataFormat === 'channelsFirst') {\n    outShape = [batchSize, outChannels, outHeight, outWidth];\n  } else if (dataFormat === 'channelsLast') {\n    outShape = [batchSize, outHeight, outWidth, outChannels];\n  }\n\n  return {\n    batchSize,\n    dataFormat,\n    inHeight,\n    inWidth,\n    inChannels,\n    outHeight,\n    outWidth,\n    outChannels,\n    padInfo,\n    strideHeight,\n    strideWidth,\n    filterHeight,\n    filterWidth,\n    effectiveFilterHeight,\n    effectiveFilterWidth,\n    dilationHeight,\n    dilationWidth,\n    inShape,\n    outShape,\n    filterShape\n  };\n}\n\n/**\n * Information about the forward pass of a 3D convolution/pooling operation.\n * It includes input and output shape, strides, filter size and padding\n * information.\n */\nexport type Conv3DInfo = {\n  batchSize: number,\n  inDepth: number,\n  inHeight: number,\n  inWidth: number,\n  inChannels: number,\n  outDepth: number,\n  outHeight: number,\n  outWidth: number,\n  outChannels: number,\n  dataFormat: 'channelsFirst'|'channelsLast',\n  strideDepth: number,\n  strideHeight: number,\n  strideWidth: number,\n  dilationDepth: number,\n  dilationHeight: number,\n  dilationWidth: number,\n  filterDepth: number,\n  filterHeight: number,\n  filterWidth: number,\n  effectiveFilterDepth: number,\n  effectiveFilterHeight: number,\n  effectiveFilterWidth: number,\n  padInfo: PadInfo3D,\n  inShape: [number, number, number, number, number],\n  outShape: [number, number, number, number, number],\n  filterShape: [number, number, number, number, number]\n};\n\n/**\n * Computes the information for a forward pass of a 3D convolution/pooling\n * operation.\n */\nexport function computeConv3DInfo(\n    inShape: [number, number, number, number, number],\n    filterShape: [number, number, number, number, number],\n    strides: number|[number, number, number],\n    dilations: number|[number, number, number], pad: 'same'|'valid'|number,\n    depthwise = false,\n    dataFormat: 'channelsFirst'|'channelsLast' = 'channelsLast',\n    roundingMode?: 'floor'|'round'|'ceil'): Conv3DInfo {\n  let [batchSize, inDepth, inHeight, inWidth, inChannels] =\n      [-1, -1, -1, -1, -1];\n  if (dataFormat === 'channelsLast') {\n    [batchSize, inDepth, inHeight, inWidth, inChannels] = inShape;\n  } else if (dataFormat === 'channelsFirst') {\n    [batchSize, inChannels, inDepth, inHeight, inWidth] = inShape;\n  } else {\n    throw new Error(`Unknown dataFormat ${dataFormat}`);\n  }\n\n  const [filterDepth, filterHeight, filterWidth, , filterChannels] =\n      filterShape;\n  const [strideDepth, strideHeight, strideWidth] = parse3TupleParam(strides);\n  const [dilationDepth, dilationHeight, dilationWidth] =\n      parse3TupleParam(dilations);\n\n  const effectiveFilterDepth =\n      getEffectiveFilterSize(filterDepth, dilationDepth);\n  const effectiveFilterHeight =\n      getEffectiveFilterSize(filterHeight, dilationHeight);\n  const effectiveFilterWidth =\n      getEffectiveFilterSize(filterWidth, dilationWidth);\n  const {padInfo, outDepth, outHeight, outWidth} = get3DPadAndOutInfo(\n      pad, inDepth, inHeight, inWidth, strideDepth, strideHeight, strideWidth,\n      effectiveFilterDepth, effectiveFilterHeight, effectiveFilterWidth,\n      roundingMode);\n\n  const outChannels = depthwise ? filterChannels * inChannels : filterChannels;\n\n  let outShape: [number, number, number, number, number];\n  if (dataFormat === 'channelsFirst') {\n    outShape = [batchSize, outChannels, outDepth, outHeight, outWidth];\n  } else if (dataFormat === 'channelsLast') {\n    outShape = [batchSize, outDepth, outHeight, outWidth, outChannels];\n  }\n\n  return {\n    batchSize,\n    dataFormat,\n    inDepth,\n    inHeight,\n    inWidth,\n    inChannels,\n    outDepth,\n    outHeight,\n    outWidth,\n    outChannels,\n    padInfo,\n    strideDepth,\n    strideHeight,\n    strideWidth,\n    filterDepth,\n    filterHeight,\n    filterWidth,\n    effectiveFilterDepth,\n    effectiveFilterHeight,\n    effectiveFilterWidth,\n    dilationDepth,\n    dilationHeight,\n    dilationWidth,\n    inShape,\n    outShape,\n    filterShape\n  };\n}\n\nfunction computeOutputShape2D(\n    inShape: [number, number], fieldSize: number, stride: number,\n    zeroPad?: number, roundingMode?: 'floor'|'round'|'ceil'): [number, number] {\n  if (zeroPad == null) {\n    zeroPad = computeDefaultPad(inShape, fieldSize, stride);\n  }\n  const inputRows = inShape[0];\n  const inputCols = inShape[1];\n\n  const outputRows =\n      round((inputRows - fieldSize + 2 * zeroPad) / stride + 1, roundingMode);\n  const outputCols =\n      round((inputCols - fieldSize + 2 * zeroPad) / stride + 1, roundingMode);\n\n  return [outputRows, outputCols];\n}\n\nfunction computeOutputShape4D(\n    inShape: [number, number, number, number],\n    filterShape: [number, number, number], outChannels: number,\n    strides: [number, number, number], zeroPad?: number,\n    roundingMode?: 'floor'|'round'|'ceil'): [number, number, number, number] {\n  if (zeroPad == null) {\n    zeroPad = computeDefaultPad(inShape, filterShape[0], strides[0]);\n  }\n  const outShape: [number, number, number, number] = [0, 0, 0, outChannels];\n  for (let index = 0; index < 3; index++) {\n    if (inShape[index] + 2 * zeroPad >= filterShape[index]) {\n      outShape[index] = round(\n          (inShape[index] - filterShape[index] + 2 * zeroPad) / strides[index] +\n              1,\n          roundingMode);\n    }\n  }\n  return outShape;\n}\n\nexport function computeDefaultPad(\n    inputShape: [number, number]|[number, number, number, number],\n    fieldSize: number, stride: number, dilation = 1): number {\n  const effectiveFieldSize = getEffectiveFilterSize(fieldSize, dilation);\n  return Math.floor(\n      (inputShape[0] * (stride - 1) - stride + effectiveFieldSize) / 2);\n}\n\nfunction parseTupleParam(param: number|number[]): [number, number, number] {\n  if (typeof param === 'number') {\n    return [param, param, param];\n  }\n  if (param.length === 2) {\n    return [param[0], param[1], 1];\n  }\n  return param as [number, number, number];\n}\n\nfunction parse3TupleParam(param: number|[number, number, number]):\n    [number, number, number] {\n  return typeof param === 'number' ? [param, param, param] : param;\n}\n\n/* See https://www.tensorflow.org/api_docs/python/tf/nn/atrous_conv2d\n * Atrous convolution is equivalent to standard convolution with upsampled\n * filters with effective_filter_height =\n * filter_height + (filter_height - 1) * (dilation - 1)\n * and effective_filter_width =\n * filter_width + (filter_width - 1) * (dilation - 1),\n * produced by inserting dilation - 1 zeros along consecutive elements across\n * the filters' spatial dimensions.\n * When there is a dilation, this converts a filter dimension to the\n * effective filter dimension, so it can be used in a standard convolution.\n */\nfunction getEffectiveFilterSize(filterSize: number, dilation: number) {\n  if (dilation <= 1) {\n    return filterSize;\n  }\n\n  return filterSize + (filterSize - 1) * (dilation - 1);\n}\n\nfunction getPadAndOutInfo(\n    pad: 'same'|'valid'|number|ExplicitPadding, inHeight: number,\n    inWidth: number, strideHeight: number, strideWidth: number,\n    filterHeight: number, filterWidth: number,\n    roundingMode: 'floor'|'round'|'ceil',\n    dataFormat: 'channelsFirst'|\n    'channelsLast'): {padInfo: PadInfo, outHeight: number, outWidth: number} {\n  let padInfo: PadInfo;\n  let outHeight: number;\n  let outWidth: number;\n\n  if (typeof pad === 'number') {\n    const padType = (pad === 0) ? 'VALID' : 'NUMBER';\n    padInfo = {top: pad, bottom: pad, left: pad, right: pad, type: padType};\n    const outShape = computeOutputShape2D(\n        [inHeight, inWidth], filterHeight, strideHeight, pad, roundingMode);\n    outHeight = outShape[0];\n    outWidth = outShape[1];\n  } else if (pad === 'same') {\n    outHeight = Math.ceil(inHeight / strideHeight);\n    outWidth = Math.ceil(inWidth / strideWidth);\n    const padAlongHeight =\n        Math.max(0, (outHeight - 1) * strideHeight + filterHeight - inHeight);\n    const padAlongWidth =\n        Math.max(0, (outWidth - 1) * strideWidth + filterWidth - inWidth);\n    const top = Math.floor(padAlongHeight / 2);\n    const bottom = padAlongHeight - top;\n    const left = Math.floor(padAlongWidth / 2);\n    const right = padAlongWidth - left;\n    padInfo = {top, bottom, left, right, type: 'SAME'};\n  } else if (pad === 'valid') {\n    padInfo = {top: 0, bottom: 0, left: 0, right: 0, type: 'VALID'};\n    outHeight = Math.ceil((inHeight - filterHeight + 1) / strideHeight);\n    outWidth = Math.ceil((inWidth - filterWidth + 1) / strideWidth);\n  } else if (typeof pad === 'object') {\n    const top = dataFormat === 'channelsLast' ? pad[1][0] : pad[2][0];\n    const bottom = dataFormat === 'channelsLast' ? pad[1][1] : pad[2][1];\n    const left = dataFormat === 'channelsLast' ? pad[2][0] : pad[3][0];\n    const right = dataFormat === 'channelsLast' ? pad[2][1] : pad[3][1];\n    const padType = (top === 0 && bottom === 0 && left === 0 && right === 0) ?\n        'VALID' :\n        'EXPLICIT';\n    padInfo = {top, bottom, left, right, type: padType};\n    outHeight = round(\n        (inHeight - filterHeight + top + bottom) / strideHeight + 1,\n        roundingMode);\n    outWidth = round(\n        (inWidth - filterWidth + left + right) / strideWidth + 1, roundingMode);\n  } else {\n    throw Error(`Unknown padding parameter: ${pad}`);\n  }\n  return {padInfo, outHeight, outWidth};\n}\n\nfunction get3DPadAndOutInfo(\n    pad: 'same'|'valid'|number, inDepth: number, inHeight: number,\n    inWidth: number, strideDepth: number, strideHeight: number,\n    strideWidth: number, filterDepth: number, filterHeight: number,\n    filterWidth: number, roundingMode?: 'floor'|'round'|'ceil'): {\n  padInfo: PadInfo3D,\n  outDepth: number,\n  outHeight: number,\n  outWidth: number\n} {\n  let padInfo: PadInfo3D;\n  let outDepth: number;\n  let outHeight: number;\n  let outWidth: number;\n\n  if (pad === 'valid') {\n    pad = 0;\n  }\n\n  if (typeof pad === 'number') {\n    const padType = (pad === 0) ? 'VALID' : 'NUMBER';\n    padInfo = {\n      top: pad,\n      bottom: pad,\n      left: pad,\n      right: pad,\n      front: pad,\n      back: pad,\n      type: padType\n    };\n    const outShape = computeOutputShape4D(\n        [inDepth, inHeight, inWidth, 1],\n        [filterDepth, filterHeight, filterWidth], 1,\n        [strideDepth, strideHeight, strideWidth], pad, roundingMode);\n    outDepth = outShape[0];\n    outHeight = outShape[1];\n    outWidth = outShape[2];\n  } else if (pad === 'same') {\n    outDepth = Math.ceil(inDepth / strideDepth);\n    outHeight = Math.ceil(inHeight / strideHeight);\n    outWidth = Math.ceil(inWidth / strideWidth);\n    const padAlongDepth = (outDepth - 1) * strideDepth + filterDepth - inDepth;\n    const padAlongHeight =\n        (outHeight - 1) * strideHeight + filterHeight - inHeight;\n    const padAlongWidth = (outWidth - 1) * strideWidth + filterWidth - inWidth;\n    const front = Math.floor(padAlongDepth / 2);\n    const back = padAlongDepth - front;\n    const top = Math.floor(padAlongHeight / 2);\n    const bottom = padAlongHeight - top;\n    const left = Math.floor(padAlongWidth / 2);\n    const right = padAlongWidth - left;\n\n    padInfo = {top, bottom, left, right, front, back, type: 'SAME'};\n  } else {\n    throw Error(`Unknown padding parameter: ${pad}`);\n  }\n  return {padInfo, outDepth, outHeight, outWidth};\n}\n\n/**\n * Rounds a value depending on the rounding mode\n * @param value\n * @param roundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n */\nfunction round(value: number, roundingMode?: 'floor'|'round'|'ceil') {\n  if (!roundingMode) {\n    return Math.trunc(value);\n  }\n  switch (roundingMode) {\n    case 'round':\n      // used for Caffe Conv\n      return Math.round(value);\n    case 'ceil':\n      // used for Caffe Pool\n      return Math.ceil(value);\n    case 'floor':\n      return Math.floor(value);\n    default:\n      throw new Error(`Unknown roundingMode ${roundingMode}`);\n  }\n}\n\nexport function tupleValuesAreOne(param: number|number[]): boolean {\n  const [dimA, dimB, dimC] = parseTupleParam(param);\n  return dimA === 1 && dimB === 1 && dimC === 1;\n}\n\nexport function eitherStridesOrDilationsAreOne(\n    strides: number|number[], dilations: number|number[]): boolean {\n  return tupleValuesAreOne(strides) || tupleValuesAreOne(dilations);\n}\n\nexport function stridesOrDilationsArePositive(values: number|\n                                              number[]): boolean {\n  return parseTupleParam(values).every(value => value > 0);\n}\n\n/**\n * Convert Conv2D dataFormat from 'NHWC'|'NCHW' to\n *    'channelsLast'|'channelsFirst'\n * @param dataFormat in 'NHWC'|'NCHW' mode\n * @return dataFormat in 'channelsLast'|'channelsFirst' mode\n * @throws unknown dataFormat\n */\nexport function convertConv2DDataFormat(dataFormat: 'NHWC'|'NCHW'):\n    'channelsLast'|'channelsFirst' {\n  if (dataFormat === 'NHWC') {\n    return 'channelsLast';\n  } else if (dataFormat === 'NCHW') {\n    return 'channelsFirst';\n  } else {\n    throw new Error(`Unknown dataFormat ${dataFormat}`);\n  }\n}\n\n/**\n * Check validity of pad when using dimRoundingMode.\n * @param opDesc A string of op description\n * @param pad The type of padding algorithm.\n *   - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *   - `valid` output will be smaller than input if filter is larger\n *       than 1x1.\n *   - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n * @throws unknown padding parameter\n */\nexport function checkPadOnDimRoundingMode(\n    opDesc: string, pad: 'valid'|'same'|number|ExplicitPadding,\n    dimRoundingMode?: 'floor'|'round'|'ceil') {\n  if (dimRoundingMode != null) {\n    if (typeof pad === 'string') {\n      throw Error(\n          `Error in ${opDesc}: pad must be an integer when using ` +\n          `dimRoundingMode ${dimRoundingMode} but got pad ${pad}.`);\n    } else if (typeof pad === 'number') {\n      util.assert(\n          util.isInt(pad),\n          () => `Error in ${opDesc}: pad must be an integer when using ` +\n              `dimRoundingMode ${dimRoundingMode} but got pad ${pad}.`);\n    } else if (typeof pad === 'object') {\n      (pad as ExplicitPadding).forEach(p => {\n        p.forEach(v => {\n          util.assert(\n              util.isInt(v),\n              () => `Error in ${opDesc}: pad must be an integer when using ` +\n                  `dimRoundingMode ${dimRoundingMode} but got pad ${v}.`);\n        });\n      });\n    } else {\n      throw Error(`Error in ${opDesc}: Unknown padding parameter: ${pad}`);\n    }\n  }\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Reshape, ReshapeAttrs, ReshapeInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {Rank, ShapeMap, TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Reshapes a `tf.Tensor` to a given shape.\n *\n * Given an input tensor, returns a new tensor with the same values as the\n * input tensor with shape `shape`.\n *\n * If one component of shape is the special value -1, the size of that\n * dimension is computed so that the total size remains constant. In\n * particular, a shape of [-1] flattens into 1-D. At most one component of\n * shape can be -1.\n *\n * If shape is 1-D or higher, then the operation returns a tensor with shape\n * shape filled with the values of tensor. In this case, the number of\n * elements implied by shape must be the same as the number of elements in\n * tensor.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n * x.reshape([2, 2]).print();\n * ```\n *\n * @param x The input tensor to be reshaped.\n * @param shape An array of integers defining the output tensor shape.\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction reshape_<R extends Rank>(\n    x: Tensor|TensorLike, shape: ShapeMap[R]): Tensor<R> {\n  const $x = convertToTensor(x, 'x', 'reshape', 'string_or_numeric');\n\n  const inputs: ReshapeInputs = {x: $x};\n  const attrs: ReshapeAttrs = {shape};\n  return ENGINE.runKernel(\n      Reshape, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\nexport const reshape = /* @__PURE__ */ op({reshape_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {AvgPool, AvgPoolAttrs, AvgPoolInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {cast} from './cast';\nimport * as conv_util from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes the 2D average pooling of an image.\n *\n * @param x The input tensor, of rank 4 or rank 3 of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is assumed.\n * @param filterSize The filter size: `[filterHeight, filterWidth]`. If\n *     `filterSize` is a single number, then `filterHeight == filterWidth`.\n * @param strides The strides of the pooling: `[strideHeight, strideWidth]`. If\n *     `strides` is a single number, then `strideHeight == strideWidth`.\n * @param pad The type of padding algorithm:\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n *    - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *         https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction avgPool_<T extends Tensor3D|Tensor4D>(\n    x: T|TensorLike, filterSize: [number, number]|number,\n    strides: [number, number]|number,\n    pad: 'valid'|'same'|number|conv_util.ExplicitPadding,\n    dimRoundingMode?: 'floor'|'round'|'ceil'): T {\n  const $x = convertToTensor(x, 'x', 'avgPool', 'float32');\n  const dilations = 1;\n\n  util.assert(\n      conv_util.eitherStridesOrDilationsAreOne(strides, dilations),\n      () => 'Error in avgPool: Either strides or dilations must be 1. ' +\n          `Got strides ${strides} and dilations '${dilations}'`);\n\n  let x4D = $x as Tensor4D;\n  let reshapedTo4D = false;\n  if ($x.rank === 3) {\n    reshapedTo4D = true;\n    x4D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2]]);\n  }\n\n  util.assert(\n      x4D.rank === 4,\n      () => `Error in avgPool: x must be rank 4 but got rank ${x4D.rank}.`);\n  conv_util.checkPadOnDimRoundingMode('avgPool', pad, dimRoundingMode);\n  const inputs: AvgPoolInputs = {x: x4D};\n  const attrs: AvgPoolAttrs = {filterSize, strides, pad, dimRoundingMode};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  let res = ENGINE.runKernel(\n                AvgPool, inputs as unknown as NamedTensorMap,\n                attrs as unknown as NamedAttrMap) as T;\n\n  res = cast(res, $x.dtype);\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n\n  return res;\n}\n\nexport const avgPool = /* @__PURE__ */ op({avgPool_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {AvgPool3D, AvgPool3DAttrs, AvgPool3DInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor4D, Tensor5D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {cast} from './cast';\nimport {checkPadOnDimRoundingMode} from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes the 3D average pooling.\n *\n * ```js\n * const x = tf.tensor5d([1, 2, 3, 4, 5, 6, 7, 8], [1, 2, 2, 2, 1]);\n * const result = tf.avgPool3d(x, 2, 1, 'valid');\n * result.print();\n * ```\n *\n * @param x The input tensor, of rank 5 or rank 4 of shape\n *     `[batch, depth, height, width, inChannels]`.\n * @param filterSize The filter size:\n *     `[filterDepth, filterHeight, filterWidth]`.\n *     If `filterSize` is a single number,\n *     then `filterDepth == filterHeight == filterWidth`.\n * @param strides The strides of the pooling:\n *     `[strideDepth, strideHeight, strideWidth]`.\n *     If `strides` is a single number,\n *     then `strideDepth == strideHeight == strideWidth`.\n * @param pad The type of padding algorithm.\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1*1x1.\n *    - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n * @param dataFormat An optional string from: \"NDHWC\", \"NCDHW\". Defaults to\n *     \"NDHWC\". Specify the data format of the input and output data. With the\n *     default format \"NDHWC\", the data is stored in the order of: [batch,\n *     depth, height, width, channels]. Only \"NDHWC\" is currently supported.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction avgPool3d_<T extends Tensor4D|Tensor5D>(\n    x: T|TensorLike, filterSize: [number, number, number]|number,\n    strides: [number, number, number]|number, pad: 'valid'|'same'|number,\n    dimRoundingMode?: 'floor'|'round'|'ceil',\n    dataFormat: 'NDHWC'|'NCDHW' = 'NDHWC'): T {\n  const $x = convertToTensor(x, 'x', 'avgPool3d', 'float32');\n\n  let x5D = $x as Tensor5D;\n  let reshapedTo5D = false;\n  if ($x.rank === 4) {\n    reshapedTo5D = true;\n    x5D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2], $x.shape[3]]);\n  }\n\n  util.assert(\n      x5D.rank === 5,\n      () => `Error in avgPool3d: x must be rank 5 but got rank ${x5D.rank}.`);\n  util.assert(\n      dataFormat === 'NDHWC',\n      () => `Error in avgPool3d: Only NDHWC is currently supported, ` +\n          `but got dataFormat of ${dataFormat}`);\n  util.assert(\n      (typeof strides === 'number' && strides > 0) ||\n          (Array.isArray(strides) && strides[0] > 0 && strides[1] > 0 &&\n           strides[2] > 0),\n      () => `Error in avgPool3d: Stride must be > 0, but got '${strides}'`);\n  checkPadOnDimRoundingMode('avgPool3d', pad, dimRoundingMode);\n  const inputs: AvgPool3DInputs = {x: x5D};\n  const attrs:\n      AvgPool3DAttrs = {filterSize, strides, pad, dimRoundingMode, dataFormat};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  let res = ENGINE.runKernel(\n                AvgPool3D, inputs as unknown as NamedTensorMap,\n                attrs as unknown as NamedAttrMap) as T;\n\n  res = cast(res, x5D.dtype);\n\n  if (reshapedTo5D) {\n    return reshape(\n               res, [res.shape[1], res.shape[2], res.shape[3], res.shape[4]]) as\n        T;\n  }\n\n  return res;\n}\n\nexport const avgPool3d = /* @__PURE__ */ op({avgPool3d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Identity, IdentityInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Creates a new tensor with the same values and shape as the specified\n * tensor.\n *\n * ```js\n * const x = tf.tensor([1, 2]);\n *\n * x.clone().print();\n * ```\n *\n * @param x The tensor to clone.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction clone_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'clone', 'string_or_numeric');\n  const inputs: IdentityInputs = {x: $x};\n\n  // Note this op is called tf.identity in python. Hence the kernel name used\n  // here.\n  return ENGINE.runKernel(Identity, inputs as unknown as NamedTensorMap);\n}\n\nexport const clone = /* @__PURE__ */ op({clone_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Concat, ConcatAttrs, ConcatInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensorArray} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {assert} from '../util';\n\nimport {clone} from './clone';\nimport {op} from './operation';\n\n/**\n * Concatenates a list of `tf.Tensor`s along a given axis.\n *\n * The tensors ranks and types must match, and their sizes must match in all\n * dimensions except `axis`.\n *\n * Also available are stricter rank-specific methods that assert that\n * `tensors` are of the given rank:\n *   - `tf.concat1d`\n *   - `tf.concat2d`\n *   - `tf.concat3d`\n *   - `tf.concat4d`\n *\n * Except `tf.concat1d` (which does not have axis param), all methods have\n * same signature as this method.\n *\n * ```js\n * const a = tf.tensor1d([1, 2]);\n * const b = tf.tensor1d([3, 4]);\n * a.concat(b).print();  // or a.concat(b)\n * ```\n *\n * ```js\n * const a = tf.tensor1d([1, 2]);\n * const b = tf.tensor1d([3, 4]);\n * const c = tf.tensor1d([5, 6]);\n * tf.concat([a, b, c]).print();\n * ```\n *\n * ```js\n * const a = tf.tensor2d([[1, 2], [10, 20]]);\n * const b = tf.tensor2d([[3, 4], [30, 40]]);\n * const axis = 1;\n * tf.concat([a, b], axis).print();\n * ```\n * @param tensors A list of tensors to concatenate.\n * @param axis The axis to concatenate along. Defaults to 0 (the first dim).\n *\n * @doc {heading: 'Tensors', subheading: 'Slicing and Joining'}\n */\nfunction concat_<T extends Tensor>(tensors: Array<T|TensorLike>, axis = 0): T {\n  assert(tensors.length >= 1, () => 'Pass at least one tensor to concat');\n\n  const $tensors =\n      convertToTensorArray(tensors, 'tensors', 'concat', 'string_or_numeric');\n\n  if ($tensors[0].dtype === 'complex64') {\n    $tensors.forEach(tensor => {\n      if (tensor.dtype !== 'complex64') {\n        throw new Error(`Cannot concatenate complex64 tensors with a tensor\n          with dtype ${tensor.dtype}. `);\n      }\n    });\n  }\n\n  if ($tensors.length === 1) {\n    return clone($tensors[0]);\n  }\n\n  const inputs: ConcatInputs = $tensors;\n  const attr: ConcatAttrs = {axis};\n\n  return ENGINE.runKernel(\n      Concat, inputs as unknown as NamedTensorMap,\n      attr as unknown as NamedAttrMap);\n}\n\nexport const concat = /* @__PURE__ */ op({concat_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {BatchMatMul, BatchMatMulAttrs, BatchMatMulInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the dot product of two matrices, A * B. These must be matrices.\n *\n * ```js\n * const a = tf.tensor2d([1, 2], [1, 2]);\n * const b = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * a.matMul(b).print();  // or tf.matMul(a, b)\n * ```\n * @param a First matrix in dot product operation.\n * @param b Second matrix in dot product operation.\n * @param transposeA If true, `a` is transposed before multiplication.\n * @param transposeB If true, `b` is transposed before multiplication.\n *\n * @doc {heading: 'Operations', subheading: 'Matrices'}\n */\nfunction matMul_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike, transposeA = false,\n    transposeB = false): T {\n  let $a = convertToTensor(a, 'a', 'matMul');\n  let $b = convertToTensor(b, 'b', 'matMul');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  const inputs: BatchMatMulInputs = {a: $a, b: $b};\n  const attrs: BatchMatMulAttrs = {transposeA, transposeB};\n\n  return ENGINE.runKernel(\n      BatchMatMul, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const matMul = /* @__PURE__ */ op({matMul_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Multiply, MultiplyInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Multiplies two `tf.Tensor`s element-wise, A * B. Supports broadcasting.\n *\n * We also expose `tf.mulStrict` which has the same signature as this op and\n * asserts that `a` and `b` are the same shape (does not broadcast).\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3, 4]);\n * const b = tf.tensor1d([2, 3, 4, 5]);\n *\n * a.mul(b).print();  // or tf.mul(a, b)\n * ```\n *\n * ```js\n * // Broadcast mul a with b.\n * const a = tf.tensor1d([1, 2, 3, 4]);\n * const b = tf.scalar(5);\n *\n * a.mul(b).print();  // or tf.mul(a, b)\n * ```\n * @param a The first tensor to multiply.\n * @param b The second tensor to multiply. Must have the same dtype as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction mul_<T extends Tensor>(a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'mul');\n  let $b = convertToTensor(b, 'b', 'mul');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  const inputs: MultiplyInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(Multiply, inputs as unknown as NamedTensorMap);\n}\nexport const mul = /* @__PURE__ */ op({mul_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Sigmoid, SigmoidInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes sigmoid element-wise, `1 / (1 + exp(-x))`\n *\n * ```js\n * const x = tf.tensor1d([0, -1, 2, -3]);\n *\n * x.sigmoid().print();  // or tf.sigmoid(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction sigmoid_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'sigmoid', 'float32');\n\n  const inputs: SigmoidInputs = {x: $x};\n\n  return ENGINE.runKernel(Sigmoid, inputs as unknown as NamedTensorMap);\n}\nexport const sigmoid = /* @__PURE__ */ op({sigmoid_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Slice, SliceAttrs, SliceInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {Rank, TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Extracts a slice from a `tf.Tensor` starting at coordinates `begin`\n * and is of size `size`.\n *\n * Also available are stricter rank-specific methods with the same signature\n * as this method that assert that `x` is of the given rank:\n *   - `tf.slice1d`\n *   - `tf.slice2d`\n *   - `tf.slice3d`\n *   - `tf.slice4d`\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n *\n * x.slice([1], [2]).print();\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * x.slice([1, 0], [1, 2]).print();\n * ```\n * @param x The input `tf.Tensor` to slice from.\n * @param begin The coordinates to start the slice from. The length can be\n *     less than the rank of x - the rest of the axes will have implicit 0 as\n *     start. Can also be a single number, in which case it specifies the\n *     first axis.\n * @param size The size of the slice. The length can be less than the rank of\n *     x - the rest of the axes will have implicit -1. A value of -1 requests\n *     the rest of the dimensions in the axis. Can also be a single number,\n *     in which case it specifies the size of the first axis.\n *\n * @doc {heading: 'Tensors', subheading: 'Slicing and Joining'}\n */\nfunction slice_<R extends Rank, T extends Tensor<R>>(\n    x: T|TensorLike, begin: number|number[], size?: number|number[]): T {\n  const $x = convertToTensor(x, 'x', 'slice', 'string_or_numeric');\n\n  if ($x.rank === 0) {\n    throw new Error('Slicing scalar is not possible');\n  }\n\n  const inputs: SliceInputs = {x: $x};\n  const attrs: SliceAttrs = {begin, size};\n\n  return ENGINE.runKernel(\n      Slice, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const slice = /* @__PURE__ */ op({slice_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Tanh, TanhInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes hyperbolic tangent of the input `tf.Tensor` element-wise: `tanh(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, 1, -1, 70]);\n *\n * x.tanh().print();  // or tf.tanh(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction tanh_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'tanh', 'float32');\n\n  const inputs: TanhInputs = {x: $x};\n\n  return ENGINE.runKernel(Tanh, inputs as unknown as NamedTensorMap);\n}\nexport const tanh = /* @__PURE__ */ op({tanh_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Scalar, Tensor1D, Tensor2D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {add} from './add';\nimport {concat} from './concat';\nimport {matMul} from './mat_mul';\nimport {mul} from './mul';\nimport {op} from './operation';\nimport {sigmoid} from './sigmoid';\nimport {slice} from './slice';\nimport {tanh} from './tanh';\n\n/**\n * Computes the next state and output of a BasicLSTMCell.\n *\n * Returns `[newC, newH]`.\n *\n * Derived from tf.contrib.rnn.BasicLSTMCell.\n *\n * @param forgetBias Forget bias for the cell.\n * @param lstmKernel The weights for the cell.\n * @param lstmBias The bias for the cell.\n * @param data The input to the cell.\n * @param c Previous cell state.\n * @param h Previous cell output.\n *\n * @doc {heading: 'Operations', subheading: 'RNN'}\n */\nfunction basicLSTMCell_(\n    forgetBias: Scalar|TensorLike, lstmKernel: Tensor2D|TensorLike,\n    lstmBias: Tensor1D|TensorLike, data: Tensor2D|TensorLike,\n    c: Tensor2D|TensorLike, h: Tensor2D|TensorLike): [Tensor2D, Tensor2D] {\n  const $forgetBias =\n      convertToTensor(forgetBias, 'forgetBias', 'basicLSTMCell');\n  const $lstmKernel =\n      convertToTensor(lstmKernel, 'lstmKernel', 'basicLSTMCell');\n  const $lstmBias = convertToTensor(lstmBias, 'lstmBias', 'basicLSTMCell');\n  const $data = convertToTensor(data, 'data', 'basicLSTMCell');\n  const $c = convertToTensor(c, 'c', 'basicLSTMCell');\n  const $h = convertToTensor(h, 'h', 'basicLSTMCell');\n\n  const combined = concat([$data, $h], 1);\n  const weighted = matMul(combined, $lstmKernel);\n  const res: Tensor2D = add(weighted, $lstmBias);\n\n  // i = input_gate, j = new_input, f = forget_gate, o = output_gate\n  const batchSize = res.shape[0];\n  const sliceCols = res.shape[1] / 4;\n  const sliceSize: [number, number] = [batchSize, sliceCols];\n  const i = slice(res, [0, 0], sliceSize);\n  const j = slice(res, [0, sliceCols], sliceSize);\n  const f = slice(res, [0, sliceCols * 2], sliceSize);\n  const o = slice(res, [0, sliceCols * 3], sliceSize);\n\n  const newC: Tensor2D =\n      add(mul(sigmoid(i), tanh(j)),\n          mul($c, sigmoid(add($forgetBias, f)) as Tensor2D));\n  const newH: Tensor2D = mul(tanh(newC), sigmoid(o));\n  return [newC, newH];\n}\n\nexport const basicLSTMCell = /* @__PURE__ */ op({basicLSTMCell_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {BatchToSpaceND, BatchToSpaceNDAttrs, BatchToSpaceNDInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * This operation reshapes the \"batch\" dimension 0 into `M + 1` dimensions of\n * shape `blockShape + [batch]`, interleaves these blocks back into the grid\n * defined by the spatial dimensions `[1, ..., M]`, to obtain a result with\n * the same rank as the input. The spatial dimensions of this intermediate\n * result are then optionally cropped according to `crops` to produce the\n * output. This is the reverse of `tf.spaceToBatchND`. See below for a precise\n * description.\n *\n * ```js\n * const x = tf.tensor4d([1, 2, 3, 4], [4, 1, 1, 1]);\n * const blockShape = [2, 2];\n * const crops = [[0, 0], [0, 0]];\n *\n * x.batchToSpaceND(blockShape, crops).print();\n * ```\n *\n * @param x A `tf.Tensor`. N-D with `x.shape` = `[batch] + spatialShape +\n * remainingShape`, where spatialShape has `M` dimensions.\n * @param blockShape A 1-D array. Must have shape `[M]`, all values must\n * be >= 1.\n * @param crops A 2-D array.  Must have shape `[M, 2]`, all values must be >= 0.\n * `crops[i] = [cropStart, cropEnd]` specifies the amount to crop from input\n * dimension `i + 1`, which corresponds to spatial dimension `i`. It is required\n * that `cropStart[i] + cropEnd[i] <= blockShape[i] * inputShape[i + 1]`\n *\n * This operation is equivalent to the following steps:\n *\n * 1. Reshape `x` to `reshaped` of shape: `[blockShape[0], ...,\n * blockShape[M-1], batch / prod(blockShape), x.shape[1], ...,\n * x.shape[N-1]]`\n *\n * 2. Permute dimensions of `reshaped` to produce `permuted` of shape `[batch /\n * prod(blockShape),x.shape[1], blockShape[0], ..., x.shape[M],\n * blockShape[M-1],x.shape[M+1], ..., x.shape[N-1]]`\n *\n * 3. Reshape `permuted` to produce `reshapedPermuted` of shape `[batch /\n * prod(blockShape),x.shape[1] * blockShape[0], ..., x.shape[M] *\n * blockShape[M-1],x.shape[M+1], ..., x.shape[N-1]]`\n *\n * 4. Crop the start and end of dimensions `[1, ..., M]` of `reshapedPermuted`\n * according to `crops` to produce the output of shape: `[batch /\n * prod(blockShape),x.shape[1] * blockShape[0] - crops[0,0] - crops[0,1],\n * ..., x.shape[M] * blockShape[M-1] - crops[M-1,0] -\n * crops[M-1,1],x.shape[M+1], ..., x.shape[N-1]]`\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction batchToSpaceND_<T extends Tensor>(\n    x: T|TensorLike, blockShape: number[], crops: number[][]): T {\n  const $x = convertToTensor(x, 'x', 'batchToSpaceND');\n  const prod = blockShape.reduce((a, b) => a * b);\n\n  util.assert(\n      $x.rank >= 1 + blockShape.length,\n      () => `input rank is ${$x.rank} but should be > than blockShape.length ${\n          blockShape.length}`);\n\n  util.assert(\n      crops.length === blockShape.length,\n      () => `crops.length is ${\n          crops.length} but should be equal to blockShape.length  ${\n          blockShape.length}`);\n\n  util.assert(\n      $x.shape[0] % prod === 0,\n      () => `input tensor batch is ${\n                $x.shape[0]} but is not divisible by the product of ` +\n          `the elements of blockShape ${blockShape.join(' * ')} === ${prod}`);\n\n  const inputs: BatchToSpaceNDInputs = {x: $x};\n  const attrs: BatchToSpaceNDAttrs = {blockShape, crops};\n\n  return ENGINE.runKernel(\n      BatchToSpaceND, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const batchToSpaceND = /* @__PURE__ */ op({batchToSpaceND_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor, Tensor4D} from '../tensor';\nimport {Rank} from '../types';\nimport {reshape} from './reshape';\n\nexport function xAs4D<R extends Rank>(x: Tensor<R>) {\n  let x4D: Tensor4D;\n  if (x.rank === 0 || x.rank === 1) {\n    x4D = reshape(x, [1, 1, 1, x.size]);\n  } else if (x.rank === 2) {\n    x4D = reshape(x, [1, 1, x.shape[0], x.shape[1]]);\n  } else if (x.rank === 3) {\n    x4D = reshape(x, [1, x.shape[0], x.shape[1], x.shape[2]]);\n  } else {\n    x4D = x as Tensor4D;\n  }\n\n  return x4D;\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {FusedBatchNorm, FusedBatchNormAttrs, FusedBatchNormInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor, Tensor1D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {Rank, TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {xAs4D} from './batchnorm_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Batch normalization.\n *\n * As described in\n * [http://arxiv.org/abs/1502.03167](http://arxiv.org/abs/1502.03167).\n *\n * Mean, variance, scale, and offset can be of two shapes:\n *   - The same shape as the input.\n *   - In the common case, the depth dimension is the last dimension of x, so\n *     the values would be a `tf.Tensor1D` of shape [depth].\n *\n * Also available are stricter rank-specific methods with the same signature\n * as this method that assert that parameters passed are of given rank\n *   - `tf.batchNorm2d`\n *   - `tf.batchNorm3d`\n *   - `tf.batchNorm4d`\n *\n * @param x The input Tensor.\n * @param mean A mean Tensor.\n * @param variance A variance Tensor.\n * @param offset An offset Tensor.\n * @param scale A scale Tensor.\n * @param varianceEpsilon A small float number to avoid dividing by 0.\n *\n * @doc {heading: 'Operations', subheading: 'Normalization'}\n */\nfunction batchNorm_<R extends Rank>(\n    x: Tensor<R>|TensorLike, mean: Tensor<R>|Tensor1D|TensorLike,\n    variance: Tensor<R>|Tensor1D|TensorLike,\n    offset?: Tensor<R>|Tensor1D|TensorLike,\n    scale?: Tensor<R>|Tensor1D|TensorLike,\n    varianceEpsilon?: number): Tensor<R> {\n  if (varianceEpsilon == null) {\n    varianceEpsilon = 0.001;\n  }\n  const $x = convertToTensor(x, 'x', 'batchNorm');\n  const $mean = convertToTensor(mean, 'mean', 'batchNorm');\n  const $variance = convertToTensor(variance, 'variance', 'batchNorm');\n  let $scale: Tensor<R>|Tensor1D;\n  if (scale != null) {\n    $scale = convertToTensor(scale, 'scale', 'batchNorm');\n  }\n  let $offset: Tensor<R>|Tensor1D;\n  if (offset != null) {\n    $offset = convertToTensor(offset, 'offset', 'batchNorm');\n  }\n\n  util.assert(\n      $mean.rank === $variance.rank,\n      () => 'Batch normalization gradient requires mean and variance to have ' +\n          'equal ranks.');\n  util.assert(\n      $offset == null || $mean.rank === $offset.rank,\n      () => 'Batch normalization gradient requires mean and offset to have ' +\n          'equal ranks.');\n  util.assert(\n      $scale == null || $mean.rank === $scale.rank,\n      () => 'Batch normalization gradient requires mean and scale to have ' +\n          'equal ranks.');\n\n  const x4D: Tensor4D = xAs4D($x);\n\n  const inputs: FusedBatchNormInputs = {\n    x: x4D,\n    scale: $scale,\n    offset: $offset,\n    mean: $mean,\n    variance: $variance\n  };\n\n  const attrs: FusedBatchNormAttrs = {varianceEpsilon};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  FusedBatchNorm, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as Tensor<R>;\n\n  return reshape(res, $x.shape);\n}\n\nexport const batchNorm = /* @__PURE__ */ op({batchNorm_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor1D, Tensor2D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {batchNorm} from './batchnorm';\nimport {op} from './operation';\n\n/**\n * Batch normalization, strictly for 2D. For the more relaxed version, see\n * `tf.batchNorm`.\n *\n * @param x The input Tensor.\n * @param mean A mean Tensor.\n * @param variance A variance Tensor.\n * @param offset An offset Tensor.\n * @param scale A scale Tensor.\n * @param varianceEpsilon A small float number to avoid dividing by 0.\n */\nfunction batchNorm2d_(\n    x: Tensor2D|TensorLike, mean: Tensor2D|Tensor1D|TensorLike,\n    variance: Tensor2D|Tensor1D|TensorLike,\n    offset?: Tensor2D|Tensor1D|TensorLike, scale?: Tensor2D|Tensor1D|TensorLike,\n    varianceEpsilon?: number): Tensor2D {\n  const $x = convertToTensor(x, 'x', 'batchNorm');\n  const $mean = convertToTensor(mean, 'mean', 'batchNorm');\n  const $variance = convertToTensor(variance, 'variance', 'batchNorm');\n  let $scale: Tensor2D|Tensor1D;\n  if (scale != null) {\n    $scale = convertToTensor(scale, 'scale', 'batchNorm');\n  }\n  let $offset: Tensor2D|Tensor1D;\n  if (offset != null) {\n    $offset = convertToTensor(offset, 'offset', 'batchNorm');\n  }\n  util.assert(\n      $x.rank === 2,\n      () => `Error in batchNorm2D: x must be rank 2 but got rank ` +\n          `${$x.rank}.`);\n  util.assert(\n      $mean.rank === 2 || $mean.rank === 1,\n      () => `Error in batchNorm2D: mean must be rank 2 or rank 1 but ` +\n          `got rank ${$mean.rank}.`);\n  util.assert(\n      $variance.rank === 2 || $variance.rank === 1,\n      () => `Error in batchNorm2D: variance must be rank 2 or rank 1 ` +\n          `but got rank ${$variance.rank}.`);\n  if ($scale != null) {\n    util.assert(\n        $scale.rank === 2 || $scale.rank === 1,\n        () => `Error in batchNorm2D: scale must be rank 2 or rank 1 ` +\n            `but got rank ${$scale.rank}.`);\n  }\n  if ($offset != null) {\n    util.assert(\n        $offset.rank === 2 || $offset.rank === 1,\n        () => `Error in batchNorm2D: offset must be rank 2 or rank 1 ` +\n            `but got rank ${$offset.rank}.`);\n  }\n\n  return batchNorm($x, $mean, $variance, $offset, $scale, varianceEpsilon);\n}\n\nexport const batchNorm2d = /* @__PURE__ */ op({batchNorm2d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor1D, Tensor3D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {batchNorm} from './batchnorm';\nimport {op} from './operation';\n\n/**\n * Batch normalization, strictly for 3D. For the more relaxed version, see\n * `tf.batchNorm`.\n *\n * @param x The input Tensor.\n * @param mean A mean Tensor.\n * @param variance A variance Tensor.\n * @param offset An offset Tensor.\n * @param scale A scale Tensor.\n * @param varianceEpsilon A small float number to avoid dividing by 0.\n */\nfunction batchNorm3d_(\n    x: Tensor3D|TensorLike, mean: Tensor3D|Tensor1D|TensorLike,\n    variance: Tensor3D|Tensor1D|TensorLike,\n    offset?: Tensor3D|Tensor1D|TensorLike, scale?: Tensor3D|Tensor1D|TensorLike,\n    varianceEpsilon?: number): Tensor3D {\n  const $x = convertToTensor(x, 'x', 'batchNorm');\n  const $mean = convertToTensor(mean, 'mean', 'batchNorm');\n  const $variance = convertToTensor(variance, 'variance', 'batchNorm');\n  let $scale: Tensor3D|Tensor1D;\n  if (scale != null) {\n    $scale = convertToTensor(scale, 'scale', 'batchNorm');\n  }\n  let $offset: Tensor3D|Tensor1D;\n  if (offset != null) {\n    $offset = convertToTensor(offset, 'offset', 'batchNorm');\n  }\n  util.assert(\n      $x.rank === 3,\n      () => `Error in batchNorm3D: x must be rank 3 but got rank ` +\n          `${$x.rank}.`);\n  util.assert(\n      $mean.rank === 3 || $mean.rank === 1,\n      () => `Error in batchNorm3D: mean must be rank 3 or rank 1 but ` +\n          `got rank ${$mean.rank}.`);\n  util.assert(\n      $variance.rank === 3 || $variance.rank === 1,\n      () => `Error in batchNorm3D: variance must be rank 3 or rank 1 ` +\n          `but got rank ${$variance.rank}.`);\n  if ($scale != null) {\n    util.assert(\n        $scale.rank === 3 || $scale.rank === 1,\n        () => `Error in batchNorm3D: scale must be rank 3 or rank 1 ` +\n            `but got rank ${$scale.rank}.`);\n  }\n  if ($offset != null) {\n    util.assert(\n        $offset.rank === 3 || $offset.rank === 1,\n        () => `Error in batchNorm3D: offset must be rank 3 or rank 1 ` +\n            `but got rank ${$offset.rank}.`);\n  }\n\n  return batchNorm($x, $mean, $variance, $offset, $scale, varianceEpsilon);\n}\n\nexport const batchNorm3d = /* @__PURE__ */ op({batchNorm3d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor1D, Tensor4D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {batchNorm} from './batchnorm';\nimport {op} from './operation';\n\n/**\n * Batch normalization, strictly for 4D. For the more relaxed version, see\n * `tf.batchNorm`.\n *\n * @param x The input Tensor.\n * @param mean A mean Tensor.\n * @param variance A variance Tensor.\n * @param offset An offset Tensor.\n * @param scale A scale Tensor.\n * @param varianceEpsilon A small float number to avoid dividing by 0.\n */\nfunction batchNorm4d_(\n    x: Tensor4D|TensorLike, mean: Tensor4D|Tensor1D|TensorLike,\n    variance: Tensor4D|Tensor1D|TensorLike,\n    offset?: Tensor4D|Tensor1D|TensorLike, scale?: Tensor4D|Tensor1D|TensorLike,\n    varianceEpsilon?: number): Tensor4D {\n  const $x = convertToTensor(x, 'x', 'batchNorm');\n  const $mean = convertToTensor(mean, 'mean', 'batchNorm');\n  const $variance = convertToTensor(variance, 'variance', 'batchNorm');\n  let $scale: Tensor4D|Tensor1D;\n  if (scale != null) {\n    $scale = convertToTensor(scale, 'scale', 'batchNorm');\n  }\n  let $offset: Tensor4D|Tensor1D;\n  if (offset != null) {\n    $offset = convertToTensor(offset, 'offset', 'batchNorm');\n  }\n  util.assert(\n      $x.rank === 4,\n      () => `Error in batchNorm4D: x must be rank 4 but got rank ` +\n          `${$x.rank}.`);\n  util.assert(\n      $mean.rank === 4 || $mean.rank === 1,\n      () => `Error in batchNorm4D: mean must be rank 4 or rank 1 but ` +\n          `got rank ${$mean.rank}.`);\n  util.assert(\n      $variance.rank === 4 || $variance.rank === 1,\n      () => `Error in batchNorm4D: variance must be rank 4 or rank 1 ` +\n          `but got rank ${$variance.rank}.`);\n  if ($scale != null) {\n    util.assert(\n        $scale.rank === 4 || $scale.rank === 1,\n        () => `Error in batchNorm4D: scale must be rank 4 or rank 1 ` +\n            `but got rank ${$scale.rank}.`);\n  }\n  if ($offset != null) {\n    util.assert(\n        $offset.rank === 4 || $offset.rank === 1,\n        () => `Error in batchNorm4D: offset must be rank 4 or rank 1 ` +\n            `but got rank ${$offset.rank}.`);\n  }\n  return batchNorm($x, $mean, $variance, $offset, $scale, varianceEpsilon);\n}\n\nexport const batchNorm4d = /* @__PURE__ */ op({batchNorm4d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Bincount, BincountAttrs, BincountInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor1D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Outputs a vector with length `size` and the same dtype as `weights`.\n *\n * If `weights` are empty, then index `i` stores the number of times the value\n * `i` is counted in `x`. If `weights` are non-empty, then index `i` stores the\n * sum of the value in `weights` at each index where the corresponding value in\n * `x` is `i`.\n *\n * Values in `x` outside of the range [0, size) are ignored.\n *\n * @param x The input int tensor, rank 1.\n * @param weights The weights tensor, must have the same shape as x, or a\n *     length-0 Tensor, in which case it acts as all weights equal to 1.\n * @param size Non-negative integer.\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction bincount_<T extends Tensor1D>(\n    x: T|TensorLike, weights: T|TensorLike, size: number): T {\n  const $x = convertToTensor(x, 'x', 'bincount');\n  const $weights = convertToTensor(weights, 'weights', 'bincount');\n\n  util.assert(\n      $x.dtype === 'int32',\n      () => `Error in bincount: input ` +\n          `dtype must be int32, but got ${$x.dtype}`);\n  util.assert(size >= 0, () => `size must be non-negative, but got ${size}.`);\n  util.assert(\n      $weights.size === $x.size || $weights.size === 0,\n      () => `Error in bincount: weights must have the same size as input or` +\n          `0-length, but got input shape: ${$x.shape}, weights shape: ` +\n          `${$weights.shape}.`);\n\n  const inputs: BincountInputs = {x: $x, weights: $weights};\n  const attrs: BincountAttrs = {size};\n\n  return ENGINE.runKernel(\n      Bincount, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const bincount = /* @__PURE__ */ op({bincount_});\n", "/**\n * @license\n * Copyright 2023 Google LLC.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {BitwiseAnd, BitwiseAndInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {Rank} from '../types';\nimport {arraysEqual} from '../util_base';\n\nimport {op} from './operation';\n\n/**\n * Bitwise `AND` operation for input tensors.\n *\n * Given two input tensors, returns a new tensor\n * with the `AND` calculated values.\n *\n * The method supports int32 values\n *\n *\n * ```js\n * const x = tf.tensor1d([0, 5, 3, 14], 'int32');\n * const y = tf.tensor1d([5, 0, 7, 11], 'int32');\n * tf.bitwiseAnd(x, y).print();\n * ```\n *\n * @param x The input tensor to be calculated.\n * @param y The input tensor to be calculated.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction bitwiseAnd_<R extends Rank>(x: Tensor, y: Tensor): Tensor<R> {\n  const $x = convertToTensor(x, 'x', 'bitwiseAnd');\n  const $y = convertToTensor(y, 'y', 'bitwiseAnd');\n\n  if (!arraysEqual($x.shape, $y.shape)) {\n    throw new Error(`BitwiseAnd: Tensors must have the same shape. x: ${\n        $x.shape}, y: ${$y.shape}`);\n  }\n  if ($x.dtype !== 'int32' || $y.dtype !== 'int32') {\n    throw new Error(\n        `BitwiseAnd: Only supports 'int32' values in tensor, found type of x: ${\n            $x.dtype} and type of y: ${$y.dtype}`);\n  }\n\n  const inputs: BitwiseAndInputs = {a: $x, b: $y};\n  return ENGINE.runKernel(BitwiseAnd, inputs as unknown as NamedTensorMap);\n}\nexport const bitwiseAnd = /* @__PURE__ */ op({bitwiseAnd_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport { NamedTensorMap } from '../tensor_types';\nimport { ENGINE } from '../engine';\nimport { BroadcastArgs, BroadcastArgsInputs } from '../kernel_names';\nimport { Tensor } from '../tensor';\nimport { convertToTensor } from '../tensor_util_env';\nimport { Rank, TensorLike } from '../types';\n\nimport { op } from './operation';\n\n/**\n * Return the shape of s0 op s1 with broadcast.\n *\n * compute r0, the broadcasted shape as a tensor.\n * s0, s1 and r0 are all integer vectors.\n *\n * This function returns the shape of the result of an operation between\n * two tensors of size s0 and s1 performed with broadcast.\n *\n * @param s0 A tensor representing a shape\n * @param s1 A tensor representing a shape\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction broadcastArgs_<R extends Rank>(\n  s0: Tensor | TensorLike, s1: Tensor | TensorLike): Tensor<R> {\n  const shape1Input = convertToTensor(s0, 's0', 'broadcastArgs', 'int32');\n  const shape2Input = convertToTensor(s1, 's1', 'broadcastArgs', 'int32');\n\n  if (shape1Input.rank !== 1) {\n    throw new Error(\n      'broadcastArgs(): first input must be a vector (rank=1). ' +\n      `Has rank ${shape1Input.rank}`);\n  }\n\n  if (shape2Input.rank !== 1) {\n    throw new Error(\n      'broadcastArgs(): second input must be a vector (rank=1). ' +\n      `Has rank ${shape2Input.rank}`);\n  }\n\n  const inputs: BroadcastArgsInputs = { s0: shape1Input, s1: shape2Input };\n  return ENGINE.runKernel(BroadcastArgs, inputs as unknown as NamedTensorMap);\n}\n\nexport const broadcastArgs = /* @__PURE__ */ op({ broadcastArgs_ });\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Tile, TileAttrs, TileInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {Rank, ShapeMap, TensorLike} from '../types';\nimport {assertNonNegativeIntegerDimensions} from '../util_base';\n\nimport {clone} from './clone';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Broadcast an array to a compatible shape NumPy-style.\n *\n * The tensor's shape is compared to the broadcast shape from end to beginning.\n * Ones are prepended to the tensor's shape until it has the same length as\n * the broadcast shape. If input.shape[i]==shape[i], the (i+1)-th axis is\n * already broadcast-compatible. If input.shape[i]==1 and shape[i]==N, then\n * the input tensor is tiled N times along that axis (using tf.tile).\n *\n * @param input The tensor that is to be broadcasted.\n * @param shape The input is to be broadcast to this shape.\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction broadcastTo_<R extends Rank>(\n    x: Tensor|TensorLike, shape: ShapeMap[R]): Tensor<R> {\n  let input = convertToTensor(x, 'broadcastTo', 'x');\n  const xShape = input.shape;\n\n  assertNonNegativeIntegerDimensions(shape);\n\n  if (shape.length < input.rank) {\n    throw new Error(`broadcastTo(): shape.length=${shape.length} < input.rank=${\n        input.rank}.`);\n  }\n\n  if (shape.length > input.rank) {\n    const newShape = input.shape.slice();\n    while (newShape.length < shape.length) {\n      newShape.unshift(1);\n    }\n    input = reshape(input, newShape);\n  }\n\n  const inputShape = input.shape;\n  const reps: number[] = Array.from(shape);\n  for (let i = shape.length - 1; i >= 0; i--) {\n    if (inputShape[i] === shape[i]) {\n      reps[i] = 1;\n    } else if (input.shape[i] !== 1) {\n      throw new Error(\n          `broadcastTo(): [${xShape}] cannot be broadcast to [${shape}].`);\n    }\n  }\n  const axes = reps.map((n, i) => n > 1 ? i : -1).filter(i => i >= 0);\n\n  if (axes.length === 0) {\n    return clone(input) as Tensor<R>;\n  }\n\n  // TODO call broadcastTo kernel directly once backends implement broadcstTo\n  const inputs: TileInputs = {x: input};\n  const attrs: TileAttrs = {reps};\n  return ENGINE.runKernel(\n      Tile, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const broadcastTo = /* @__PURE__ */ op({broadcastTo_});\n", "/**\n * @license\n * Copyright 2020 Google Inc. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {TensorBuffer} from '../tensor';\nimport {DataType, DataTypeMap, Rank, ShapeMap} from '../types';\nimport * as util from '../util';\n\n/**\n * Creates an empty `tf.TensorBuffer` with the specified `shape` and `dtype`.\n *\n * The values are stored in CPU as `TypedArray`. Fill the buffer using\n * `buffer.set()`, or by modifying directly `buffer.values`.\n *\n * When done, call `buffer.toTensor()` to get an immutable `tf.Tensor` with\n * those values.\n *\n * ```js\n * // Create a buffer and set values at particular indices.\n * const buffer = tf.buffer([2, 2]);\n * buffer.set(3, 0, 0);\n * buffer.set(5, 1, 0);\n *\n * // Convert the buffer back to a tensor.\n * buffer.toTensor().print();\n * ```\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param dtype The dtype of the buffer. Defaults to 'float32'.\n * @param values The values of the buffer as `TypedArray`. Defaults to\n * zeros.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function buffer<R extends Rank, D extends DataType = 'float32'>(\n    shape: ShapeMap[R], dtype: D = 'float32' as D,\n    values?: DataTypeMap[D]): TensorBuffer<R, D> {\n  dtype = dtype || 'float32' as D;\n  util.assertNonNegativeIntegerDimensions(shape);\n  return new TensorBuffer<R, D>(shape, dtype, values);\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Ceil, CeilInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes ceiling of input `tf.Tensor` element-wise: `ceil(x)`\n *\n * ```js\n * const x = tf.tensor1d([.6, 1.1, -3.3]);\n *\n * x.ceil().print();  // or tf.ceil(x)\n * ```\n * @param x The input Tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction ceil_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'ceil', 'float32');\n\n  const inputs: CeilInputs = {x: $x};\n  return ENGINE.runKernel(Ceil, inputs as unknown as NamedTensorMap);\n}\nexport const ceil = /* @__PURE__ */ op({ceil_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Fill, FillAttrs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {DataType, Rank, ShapeMap} from '../types';\nimport {inferDtype} from '../util';\nimport {assertNonNegativeIntegerDimensions} from '../util_base';\n\n/**\n * Creates a `tf.Tensor` filled with a scalar value.\n *\n * ```js\n * tf.fill([2, 2], 4).print();\n * ```\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param value The scalar value to fill the tensor with.\n * @param dtype The type of an element in the resulting tensor. Defaults to\n *     'float32' if the given param value is a number, otherwise 'string'.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction fill<R extends Rank>(\n    shape: ShapeMap[R], value: number|string, dtype?: DataType): Tensor<R> {\n  assertNonNegativeIntegerDimensions(shape);\n\n  dtype = dtype || inferDtype(value);\n  const attrs: FillAttrs = {shape, value, dtype};\n\n  return ENGINE.runKernel(Fill, {}, attrs as unknown as NamedAttrMap);\n}\n\nexport {fill};\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {ClipByValue, ClipByValueAttrs, ClipByValueInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\nimport {fill} from './fill';\n\nimport {op} from './operation';\n\n/**\n * Clips values element-wise. `max(min(x, clipValueMax), clipValueMin)`\n *\n * ```js\n * const x = tf.tensor1d([-1, 2, -3, 4]);\n *\n * x.clipByValue(-2, 3).print();  // or tf.clipByValue(x, -2, 3)\n * ```\n * @param x The input tensor.\n * @param clipValueMin Lower bound of range to be clipped to.\n * @param clipValueMax Upper bound of range to be clipped to.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction clipByValue_<T extends Tensor>(\n    x: T|TensorLike, clipValueMin: number, clipValueMax: number): T {\n  const $x = convertToTensor(x, 'x', 'clipByValue');\n  util.assert(\n      (clipValueMin <= clipValueMax),\n      () => `Error in clip: min (${clipValueMin}) must be ` +\n          `less than or equal to max (${clipValueMax}).`);\n\n  if (clipValueMin === clipValueMax) {\n    return fill($x.shape, clipValueMin, $x.dtype) as T;\n  }\n\n  const inputs: ClipByValueInputs = {x: $x};\n  const attrs: ClipByValueAttrs = {clipValueMin, clipValueMax};\n\n  return ENGINE.runKernel(\n      ClipByValue, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const clipByValue = /* @__PURE__ */ op({clipByValue_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Complex, ComplexInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Converts two real numbers to a complex number.\n *\n * Given a tensor `real` representing the real part of a complex number, and a\n * tensor `imag` representing the imaginary part of a complex number, this\n * operation returns complex numbers elementwise of the form [r0, i0, r1, i1],\n * where r represents the real part and i represents the imag part.\n *\n * The input tensors real and imag must have the same shape.\n *\n * ```js\n * const real = tf.tensor1d([2.25, 3.25]);\n * const imag = tf.tensor1d([4.75, 5.75]);\n * const complex = tf.complex(real, imag);\n *\n * complex.print();\n * ```\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction complex_<T extends Tensor>(real: T|TensorLike, imag: T|TensorLike): T {\n  const $real = convertToTensor(real, 'real', 'complex');\n  const $imag = convertToTensor(imag, 'imag', 'complex');\n  util.assertShapesMatch(\n      $real.shape, $imag.shape,\n      `real and imag shapes, ${$real.shape} and ${$imag.shape}, ` +\n          `must match in call to tf.complex().`);\n\n  const inputs: ComplexInputs = {real: $real, imag: $imag};\n  return ENGINE.runKernel(Complex, inputs as unknown as NamedTensorMap);\n}\n\nexport const complex = /* @__PURE__ */ op({complex_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor1D} from '../tensor';\nimport {TensorLike} from '../types';\n\nimport {concat} from './concat';\nimport {op} from './operation';\n\n/**\n * Concatenates a list of`tf.Tensor1D`s along an axis. See `concat` for details.\n *\n * For example, if:\n * A: shape(3) = |r1, g1, b1|\n * B: shape(2) = |r2, g2|\n * C = tf.concat1d([A, B]) == |r1, g1, b1, r2, g2|\n *\n * @param tensors A list of`tf.Tensor`s to concatenate.\n * @return The concatenated array.\n */\nfunction concat1d_(tensors: Array<Tensor1D|TensorLike>): Tensor1D {\n  return concat(tensors, 0 /* axis */);\n}\n\nexport const concat1d = /* @__PURE__ */ op({concat1d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor2D} from '../tensor';\nimport {TensorLike} from '../types';\n\nimport {concat} from './concat';\nimport {op} from './operation';\n\n/**\n * Concatenates a list of`tf.Tensor2D`s along an axis. See `concat` for details.\n *\n * For example, if:\n * A: shape(2, 3) = | r1, g1, b1 |\n *                  | r2, g2, b2 |\n *\n * B: shape(2, 3) = | r3, g3, b3 |\n *                  | r4, g4, b4 |\n *\n * C = tf.concat2d([A, B], axis)\n *\n * if axis = 0:\n * C: shape(4, 3) = | r1, g1, b1 |\n *                  | r2, g2, b2 |\n *                  | r3, g3, b3 |\n *                  | r4, g4, b4 |\n *\n * if axis = 1:\n * C = shape(2, 6) = | r1, g1, b1, r3, g3, b3 |\n *                   | r2, g2, b2, r4, g4, b4 |\n *\n *\n * @param tensors A list of `tf.Tensor`s to concatenate.\n * @param axis The axis to concatenate along.\n * @return The concatenated array.\n */\nfunction concat2d_(\n    tensors: Array<Tensor2D|TensorLike>, axis: number): Tensor2D {\n  return concat(tensors, axis);\n}\n\nexport const concat2d = /* @__PURE__ */ op({concat2d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor3D} from '../tensor';\nimport {TensorLike} from '../types';\n\nimport {concat} from './concat';\nimport {op} from './operation';\n\n/**\n * Concatenates a list of `tf.Tensor3D`s along an axis.\n * See `concat` for details.\n *\n * For example, if:\n * A: shape(2, 1, 3) = | r1, g1, b1 |\n *                     | r2, g2, b2 |\n *\n * B: shape(2, 1, 3) = | r3, g3, b3 |\n *                     | r4, g4, b4 |\n *\n * C = tf.concat3d([A, B], axis)\n *\n * if axis = 0:\n * C: shape(4, 1, 3) = | r1, g1, b1 |\n *                     | r2, g2, b2 |\n *                     | r3, g3, b3 |\n *                     | r4, g4, b4 |\n *\n * if axis = 1:\n * C: shape(2, 2, 3) = | r1, g1, b1, r3, g3, b3 |\n *                     | r2, g2, b2, r4, g4, b4 |\n *\n * if axis = 2:\n * C = shape(2, 1, 6) = | r1, g1, b1, r3, g3, b3 |\n *                      | r2, g2, b2, r4, g4, b4 |\n *\n * @param tensors A list of`tf.Tensor`s to concatenate.\n * @param axis The axis to concate along.\n * @return The concatenated array.\n */\nfunction concat3d_(\n    tensors: Array<Tensor3D|TensorLike>, axis: number): Tensor3D {\n  return concat(tensors, axis);\n}\n\nexport const concat3d = /* @__PURE__ */ op({concat3d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor4D} from '../tensor';\nimport {TensorLike} from '../types';\n\nimport {concat} from './concat';\nimport {op} from './operation';\n\n/**\n * Concatenates a list of `tf.Tensor4D`s along an axis.\n * See `concat` for details.\n *\n * @param tensors A list of `tf.Tensor`s to concatenate.\n * @param axis The axis to concate along.\n * @return The concatenated array.\n */\nfunction concat4d_(\n    tensors: Array<Tensor4D|TensorLike>, axis: number): Tensor4D {\n  return concat(tensors, axis);\n}\n\nexport const concat4d = /* @__PURE__ */ op({concat4d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Conv2D, Conv2DAttrs, Conv2DInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport * as conv_util from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes a 2D convolution over the input x.\n *\n * @param x The input tensor, of rank 4 or rank 3, of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is\n * assumed.\n * @param filter The filter, rank 4, of shape\n *     `[filterHeight, filterWidth, inDepth, outDepth]`.\n * @param strides The strides of the convolution: `[strideHeight,\n * strideWidth]`.\n * @param pad The type of padding algorithm.\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n *   - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dataFormat: An optional string from: \"NHWC\", \"NCHW\". Defaults to\n *     \"NHWC\". Specify the data format of the input and output data. With the\n *     default format \"NHWC\", the data is stored in the order of: [batch,\n *     height, width, channels].\n * @param dilations The dilation rates: `[dilationHeight, dilationWidth]`\n *     in which we sample input values across the height and width dimensions\n *     in atrous convolution. Defaults to `[1, 1]`. If `dilations` is a single\n *     number, then `dilationHeight == dilationWidth`. If it is greater than\n *     1, then all values of `strides` must be 1.\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction conv2d_<T extends Tensor3D|Tensor4D>(\n    x: T|TensorLike, filter: Tensor4D|TensorLike,\n    strides: [number, number]|number,\n    pad: 'valid'|'same'|number|conv_util.ExplicitPadding,\n    dataFormat: 'NHWC'|'NCHW' = 'NHWC',\n    dilations: [number, number]|number = [1, 1],\n    dimRoundingMode?: 'floor'|'round'|'ceil'): T {\n  const $x = convertToTensor(x, 'x', 'conv2d', 'float32');\n  const $filter = convertToTensor(filter, 'filter', 'conv2d', 'float32');\n\n  let x4D = $x as Tensor4D;\n  let reshapedTo4D = false;\n\n  if ($x.rank === 3) {\n    reshapedTo4D = true;\n    x4D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2]]);\n  }\n\n  util.assert(\n      x4D.rank === 4,\n      () => `Error in conv2d: input must be rank 4, but got rank ${x4D.rank}.`);\n  util.assert(\n      $filter.rank === 4,\n      () => `Error in conv2d: filter must be rank 4, but got rank ` +\n          `${$filter.rank}.`);\n  conv_util.checkPadOnDimRoundingMode('conv2d', pad, dimRoundingMode);\n  const inDepth = dataFormat === 'NHWC' ? x4D.shape[3] : x4D.shape[1];\n  util.assert(\n      inDepth === $filter.shape[2],\n      () => `Error in conv2d: depth of input (${inDepth}) must match ` +\n          `input depth for filter ${$filter.shape[2]}.`);\n  util.assert(\n      conv_util.eitherStridesOrDilationsAreOne(strides, dilations),\n      () => 'Error in conv2D: Either strides or dilations must be 1. ' +\n          `Got strides ${strides} and dilations '${dilations}'`);\n  util.assert(\n      conv_util.stridesOrDilationsArePositive(dilations),\n      () => 'Error in conv2D: Dilated rates should be larger than 0.');\n  util.assert(\n      conv_util.stridesOrDilationsArePositive(strides),\n      () => 'Error in conv2D: Strides should be larger than 0.');\n\n  const inputs: Conv2DInputs = {x: x4D, filter: $filter};\n  const attrs:\n      Conv2DAttrs = {strides, pad, dataFormat, dilations, dimRoundingMode};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  Conv2D, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n  return res;\n}\n\nexport const conv2d = /* @__PURE__ */ op({conv2d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor2D, Tensor3D, Tensor4D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {conv2d} from './conv2d';\nimport * as conv_util from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes a 1D convolution over the input x.\n *\n * @param x The input tensor, of rank 3 or rank 2, of shape\n *     `[batch, width, inChannels]`. If rank 2, batch of 1 is assumed.\n * @param filter The filter, rank 3, of shape\n *     `[filterWidth, inDepth, outDepth]`.\n * @param stride The number of entries by which the filter is moved right at\n *     each step.\n * @param pad The type of padding algorithm.\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n *   - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dataFormat An optional string from \"NWC\", \"NCW\". Defaults to \"NWC\",\n *     the data is stored in the order of [batch, in_width, in_channels]. Only\n *     \"NWC\" is currently supported.\n * @param dilation The dilation rate in which we sample input values in\n *     atrous convolution. Defaults to `1`. If it is greater than 1, then\n *     stride must be `1`.\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction conv1d_<T extends Tensor2D|Tensor3D>(\n    x: T|TensorLike, filter: Tensor3D|TensorLike, stride: number,\n    pad: 'valid'|'same'|number|conv_util.ExplicitPadding,\n    dataFormat: 'NWC'|'NCW' = 'NWC', dilation = 1,\n    dimRoundingMode?: 'floor'|'round'|'ceil'): T {\n  const $x = convertToTensor(x, 'x', 'conv1d');\n  const $filter = convertToTensor(filter, 'filter', 'conv1d');\n\n  let x3D = $x as Tensor3D;\n  let reshapedTo3D = false;\n  if ($x.rank === 2) {\n    reshapedTo3D = true;\n    x3D = reshape($x, [1, $x.shape[0], $x.shape[1]]);\n  }\n\n  util.assert(\n      x3D.rank === 3,\n      () => `Error in conv1d: input must be rank 3, but got rank ${x3D.rank}.`);\n  util.assert(\n      $filter.rank === 3,\n      () => `Error in conv1d: filter must be rank 3, but got rank ` +\n          `${$filter.rank}.`);\n  conv_util.checkPadOnDimRoundingMode('conv1d', pad, dimRoundingMode);\n  util.assert(\n      x3D.shape[2] === $filter.shape[1],\n      () => `Error in conv1d: depth of input (${x3D.shape[2]}) must match ` +\n          `input depth for filter ${$filter.shape[1]}.`);\n  util.assert(\n      conv_util.eitherStridesOrDilationsAreOne(stride, dilation),\n      () => 'Error in conv1D: Either stride or dilation must be 1. ' +\n          `Got stride ${stride} and dilation '${dilation}'`);\n  util.assert(\n      conv_util.stridesOrDilationsArePositive(dilation),\n      () => 'Error in conv1D: Dilated rates should be larger than 0.');\n  util.assert(\n      conv_util.stridesOrDilationsArePositive(stride),\n      () => 'Error in conv1D: Stride should be larger than 0.');\n  util.assert(\n      dataFormat === 'NWC',\n      () => `Error in conv1d: got dataFormat of ${\n          dataFormat} but only NWC is currently supported.`);\n\n  const filter4D = reshape(\n      $filter, [1, $filter.shape[0], $filter.shape[1], $filter.shape[2]]);\n  const input4D = reshape(x3D, [x3D.shape[0], 1, x3D.shape[1], x3D.shape[2]]);\n  const strides: [number, number] = [1, stride];\n  const dilations: [number, number] = [1, dilation];\n\n  const conv2dDataFormat = 'NHWC';\n\n  const res = conv2d(\n      (input4D as Tensor4D), (filter4D as Tensor4D), strides, pad,\n      conv2dDataFormat, dilations, dimRoundingMode);\n\n  if (reshapedTo3D) {\n    return reshape(res, [res.shape[2], res.shape[3]]) as T;\n  }\n\n  return reshape(res, [res.shape[0], res.shape[2], res.shape[3]]) as T;\n}\n\nexport const conv1d = /* @__PURE__ */ op({conv1d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Conv2DBackpropInput, Conv2DBackpropInputAttrs, Conv2DBackpropInputInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport * as util from '../util';\n\nimport * as conv_util from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes the derivative of the input of a 2D convolution.\n *\n * @param xShape The shape of the input: [batch, height, width, inDepth].\n * If length of 3, batch of 1 is assumed.\n * @param dy The derivative of the output, of rank 4 or rank 3 of shape\n *   `[batch, outHeight, outWidth, outDepth]`. If rank 3, batch of 1 is\n * assumed.\n * @param filter The filter, rank 4, of shape\n *     `[filterHeight, filterWidth, inDepth, outDepth]`.\n * @param strides The strides of the convolution: `[strideHeight,\n * strideWidth]`.\n * @param pad The type of padding algorithm used:\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n * @param dataFormat: An optional string from: \"NHWC\", \"NCHW\". Defaults to\n *     \"NHWC\". Specify the data format of the input and output data. With the\n *     default format \"NHWC\", the data is stored in the order of: [batch,\n *     height, width, channels].\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n */\nfunction conv2DBackpropInput_<T extends Tensor3D|Tensor4D>(\n    xShape: [number, number, number, number]|[number, number, number], dy: T,\n    filter: Tensor4D, strides: [number, number]|number,\n    pad: 'valid'|'same'|number|conv_util.ExplicitPadding,\n    dataFormat: 'NHWC'|'NCHW' = 'NHWC',\n    dimRoundingMode?: 'floor'|'round'|'ceil'): T {\n  util.assert(\n      xShape.length === dy.rank,\n      () => `Length of inShape ` +\n          `(${xShape.length}) and rank of dy (${dy.rank}) must match`);\n\n  let xShape4D = xShape as [number, number, number, number];\n  let dy4D = dy as Tensor4D;\n  let reshapedTo4D = false;\n  if (dy.rank === 3) {\n    reshapedTo4D = true;\n    dy4D = reshape(dy, [1, dy.shape[0], dy.shape[1], dy.shape[2]]);\n    xShape4D = [1, xShape[0], xShape[1], xShape[2]];\n  }\n\n  util.assert(\n      xShape4D.length === 4,\n      () =>\n          `Error in conv2dDerInput: inShape must be length 4, but got length ` +\n          `${xShape4D.length}.`);\n  util.assert(\n      dy4D.rank === 4,\n      () => `Error in conv2dDerInput: dy must be rank 4, but got ` +\n          `rank ${dy4D.rank}`);\n  util.assert(\n      filter.rank === 4,\n      () => `Error in conv2dDerInput: filter must be rank 4, but got ` +\n          `rank ${filter.rank}`);\n  const inDepth = dataFormat === 'NHWC' ? xShape4D[3] : xShape4D[1];\n  const outDepth = dataFormat === 'NHWC' ? dy4D.shape[3] : dy4D.shape[1];\n  util.assert(\n      inDepth === filter.shape[2],\n      () => `Error in conv2dDerInput: depth of input (${inDepth}) must ` +\n          `match input depth for filter ${filter.shape[2]}.`);\n  util.assert(\n      outDepth === filter.shape[3],\n      () => `Error in conv2dDerInput: depth of output (${outDepth}) must ` +\n          `match output depth for filter ${filter.shape[3]}.`);\n  conv_util.checkPadOnDimRoundingMode('conv2dDerInput', pad, dimRoundingMode);\n  const inputs: Conv2DBackpropInputInputs = {dy: dy4D, filter};\n  const attrs: Conv2DBackpropInputAttrs =\n      {strides, pad, dataFormat, dimRoundingMode, inputShape: xShape4D};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  Conv2DBackpropInput, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n  return res;\n}\n\nexport const conv2DBackpropInput = /* @__PURE__ */ op({conv2DBackpropInput_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {conv2DBackpropInput} from './conv2d_backprop_input';\nimport {ExplicitPadding} from './conv_util';\nimport {op} from './operation';\n\n/**\n * Computes the transposed 2D convolution of an image, also known as a\n * deconvolution.\n *\n * @param x The input image, of rank 4 or rank 3, of shape\n *   `[batch, height, width, inDepth]`. If rank 3, batch of 1 is assumed.\n * @param filter The filter, rank 4, of shape\n *     `[filterHeight, filterWidth, outDepth, inDepth]`.\n *     `inDepth` must match `inDepth` in `x`.\n * @param outputShape Output shape, of rank 4 or rank 3:\n *     `[batch, height, width, outDepth]`. If rank 3, batch of 1 is assumed.\n * @param strides The strides of the original convolution:\n *     `[strideHeight, strideWidth]`.\n * @param pad  The type of padding algorithm used in the non-transpose version\n *    of the op.\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction conv2dTranspose_<T extends Tensor3D|Tensor4D>(\n    x: T|TensorLike, filter: Tensor4D|TensorLike,\n    outputShape: [number, number, number, number]|[number, number, number],\n    strides: [number, number]|number,\n    pad: 'valid'|'same'|number|ExplicitPadding,\n    dimRoundingMode?: 'floor'|'round'|'ceil'): T {\n  const $x = convertToTensor(x, 'x', 'conv2dTranspose');\n  const $filter = convertToTensor(filter, 'filter', 'conv2dTranspose');\n\n  return conv2DBackpropInput(\n      outputShape, $x, $filter, strides, pad, 'NHWC', dimRoundingMode);\n}\n\nexport const conv2dTranspose = /* @__PURE__ */ op({conv2dTranspose_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Conv3D, Conv3DAttrs, Conv3DInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor4D, Tensor5D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {eitherStridesOrDilationsAreOne, stridesOrDilationsArePositive} from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes a 3D convolution over the input x.\n *\n * @param x The input tensor, of rank 5 or rank 4, of shape\n *     `[batch, depth, height, width, channels]`. If rank 4,\n * batch of 1 is assumed.\n * @param filter The filter, rank 5, of shape\n *     `[filterDepth, filterHeight, filterWidth, inChannels, outChannels]`.\n *      inChannels must match between input and filter.\n * @param strides The strides of the convolution: `[strideDepth, strideHeight,\n * strideWidth]`.\n * @param pad The type of padding algorithm.\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n *   - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dataFormat: An optional string from: \"NDHWC\", \"NCDHW\". Defaults to\n *     \"NDHWC\". Specify the data format of the input and output data. With the\n *     default format \"NDHWC\", the data is stored in the order of: [batch,\n *     depth, height, width, channels]. Only \"NDHWC\" is currently supported.\n * @param dilations The dilation rates: `[dilationDepth, dilationHeight,\n *     dilationWidth]` in which we sample input values across the height\n *     and width dimensions in atrous convolution. Defaults to `[1, 1, 1]`.\n *     If `dilations` is a single number, then\n *     `dilationDepth == dilationHeight == dilationWidth`. If it is greater\n *     than 1, then all values of `strides` must be 1.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction conv3d_<T extends Tensor4D|Tensor5D>(\n    x: T|TensorLike, filter: Tensor5D|TensorLike,\n    strides: [number, number, number]|number, pad: 'valid'|'same',\n    dataFormat: 'NDHWC'|'NCDHW' = 'NDHWC',\n    dilations: [number, number, number]|number = [1, 1, 1]): T {\n  const $x = convertToTensor(x, 'x', 'conv3d');\n  const $filter = convertToTensor(filter, 'filter', 'conv3d');\n\n  let x5D = $x as Tensor5D;\n  let reshapedTo5D = false;\n\n  if ($x.rank === 4) {\n    reshapedTo5D = true;\n    x5D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2], $x.shape[3]]);\n  }\n  util.assert(\n      x5D.rank === 5,\n      () => `Error in conv3d: input must be rank 5, but got rank ${x5D.rank}.`);\n  util.assert(\n      $filter.rank === 5,\n      () => `Error in conv3d: filter must be rank 5, but got rank ` +\n          `${$filter.rank}.`);\n  util.assert(\n      x5D.shape[4] === $filter.shape[3],\n      () => `Error in conv3d: depth of input (${x5D.shape[4]}) must match ` +\n          `input depth for filter ${$filter.shape[3]}.`);\n  util.assert(\n      eitherStridesOrDilationsAreOne(strides, dilations),\n      () => 'Error in conv3D: Either strides or dilations must be 1. ' +\n          `Got strides ${strides} and dilations '${dilations}'`);\n  util.assert(\n      dataFormat === 'NDHWC',\n      () => `Error in conv3d: got dataFormat of ${\n          dataFormat} but only NDHWC is currently supported.`);\n  util.assert(\n      stridesOrDilationsArePositive(dilations),\n      () => 'Error in conv3D: Dilated rates should be larger than 0.');\n  util.assert(\n      stridesOrDilationsArePositive(strides),\n      () => 'Error in conv3D: Strides should be larger than 0.');\n\n  const inputs: Conv3DInputs = {x: x5D, filter: $filter};\n\n  const attrs: Conv3DAttrs = {strides, pad, dataFormat, dilations};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  Conv3D, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo5D) {\n    return reshape(\n               res, [res.shape[1], res.shape[2], res.shape[3], res.shape[4]]) as\n        T;\n  }\n  return res;\n}\n\nexport const conv3d = /* @__PURE__ */ op({conv3d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Conv3DBackpropInputV2, Conv3DBackpropInputV2Attrs, Conv3DBackpropInputV2Inputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor4D, Tensor5D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport * as util from '../util';\n\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes the derivative of the input of a 3D convolution.\n *\n * @param xShape The shape of the input: [batch, depth, height, width,\n * in_channels]. If length of 4, batch of 1 is assumed.\n * @param dy The derivative of the output, of rank 5 or rank 4 of shape\n *   `[batch, outDepth, outHeight, outWidth, in_channels]`.\n * If rank 4, batch of 1 is assumed.\n * @param filter The filter, rank 5, of shape\n *     `[filterDepth, filterHeight, filterWidth, inDepth, outDepth]`.\n * @param strides The strides of the convolution: `[strideDepth, strideHeight,\n * strideWidth]`.\n * @param pad The type of padding algorithm used:\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n */\nfunction conv3DBackpropInput_<T extends Tensor4D|Tensor5D>(\n    xShape:\n        [number, number, number, number,\n         number]|[number, number, number, number],\n    dy: T, filter: Tensor5D, strides: [number, number, number]|number,\n    pad: 'valid'|'same'): T {\n  util.assert(\n      xShape.length === dy.rank,\n      () => `Length of inShape ` +\n          `(${xShape.length}) and rank of dy (${dy.rank}) must match`);\n\n  let xShape5D = xShape as [number, number, number, number, number];\n  let dy5D = dy as Tensor5D;\n  let reshapedTo5D = false;\n  if (dy.rank === 4) {\n    reshapedTo5D = true;\n    dy5D = reshape(dy, [1, dy.shape[0], dy.shape[1], dy.shape[2], dy.shape[3]]);\n    xShape5D = [1, xShape[0], xShape[1], xShape[2], xShape[3]];\n  }\n\n  const inDepth = xShape5D[4];\n  const outDepth = dy5D.shape[4];\n  util.assert(\n      xShape5D.length === 5,\n      () =>\n          `Error in conv3dDerInput: inShape must be length 5, but got length ` +\n          `${xShape5D.length}.`);\n  util.assert(\n      dy5D.rank === 5,\n      () => `Error in conv3dDerInput: dy must be rank 5, but got ` +\n          `rank ${dy5D.rank}`);\n  util.assert(\n      filter.rank === 5,\n      () => `Error in conv3dDerInput: filter must be rank 5, but got ` +\n          `rank ${filter.rank}`);\n  util.assert(\n      inDepth === filter.shape[3],\n      () => `Error in conv3dDerInput: depth of input (${inDepth}) must ` +\n          `match input depth for filter ${filter.shape[3]}.`);\n  util.assert(\n      outDepth === filter.shape[4],\n      () => `Error in conv3dDerInput: depth of output (${outDepth}) must ` +\n          `match output depth for filter ${filter.shape[4]}.`);\n\n  const inputs: Conv3DBackpropInputV2Inputs = {dy: dy5D, filter};\n\n  const attrs:\n      Conv3DBackpropInputV2Attrs = {pad, strides, inputShape: xShape5D};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  Conv3DBackpropInputV2, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo5D) {\n    return reshape(\n               res, [res.shape[1], res.shape[2], res.shape[3], res.shape[4]]) as\n        T;\n  }\n  return res;\n}\n\nexport const conv3DBackpropInput = /* @__PURE__ */ op({conv3DBackpropInput_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor4D, Tensor5D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {conv3DBackpropInput} from './conv3d_backprop_input';\nimport {op} from './operation';\n\n/**\n * Computes the transposed 3D convolution of a volume, also known as a\n * deconvolution.\n *\n * @param x The input image, of rank 5 or rank 4, of shape\n *   `[batch, depth, height, width, inDepth]`. If rank 4, batch of 1 is assumed.\n * @param filter The filter, rank 4, of shape\n *     `[depth, filterHeight, filterWidth, outDepth, inDepth]`.\n *     `inDepth` must match `inDepth` in `x`.\n * @param outputShape Output shape, of rank 5 or rank 4:\n *     `[batch, depth, height, width, outDepth]`. If rank 3, batch of 1 is\n *    assumed.\n * @param strides The strides of the original convolution:\n *     `[strideDepth, strideHeight, strideWidth]`.\n * @param pad  The type of padding algorithm used in the non-transpose version\n *    of the op.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction conv3dTranspose_<T extends Tensor4D|Tensor5D>(\n    x: T|TensorLike, filter: Tensor5D|TensorLike,\n    outputShape:\n        [number, number, number, number,\n         number]|[number, number, number, number],\n    strides: [number, number, number]|number, pad: 'valid'|'same'): T {\n  const $x = convertToTensor(x, 'x', 'conv3dTranspose');\n  const $filter = convertToTensor(filter, 'filter', 'conv3dTranspose');\n\n  return conv3DBackpropInput(outputShape, $x, $filter, strides, pad);\n}\n\nexport const conv3dTranspose = /* @__PURE__ */ op({conv3dTranspose_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Cos, CosInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes cos of the input `tf.Tensor` element-wise: `cos(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, Math.PI / 2, Math.PI * 3 / 4]);\n *\n * x.cos().print();  // or tf.cos(x)\n * ```\n * @param x The input tensor. Must be float32 type.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction cos_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'cos', 'float32');\n\n  const inputs: CosInputs = {x: $x};\n\n  return ENGINE.runKernel(Cos, inputs as unknown as NamedTensorMap);\n}\nexport const cos = /* @__PURE__ */ op({cos_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Cosh, CoshInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes hyperbolic cos of the input `tf.Tensor` element-wise: `cosh(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, 1, -1, .7]);\n *\n * x.cosh().print();  // or tf.cosh(x)\n * ```\n * @param x The input tensor. Must be float32 type.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction cosh_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'cosh', 'float32');\n  const inputs: CoshInputs = {x: $x};\n\n  return ENGINE.runKernel(Cosh, inputs as unknown as NamedTensorMap);\n}\nexport const cosh = /* @__PURE__ */ op({cosh_});\n", "/**\n * @license\n * Copyright 2022 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the 'License');\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an 'AS IS' BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport { ENGINE } from '../engine';\nimport { Cumprod, CumprodAttrs, CumprodInputs } from '../kernel_names';\nimport { NamedAttrMap } from '../kernel_registry';\nimport { Tensor } from '../tensor';\nimport { NamedTensorMap } from '../tensor_types';\nimport { convertToTensor } from '../tensor_util_env';\nimport { TensorLike } from '../types';\n\nimport { op } from './operation';\n\n/**\n * Computes the cumulative product of a `tf.Tensor` along `axis`.\n *\n * ```js\n * const x = tf.tensor([1, 2, 3, 4]);\n * x.cumprod().print();\n * ```\n * ```js\n * const x = tf.tensor([[1, 2], [3, 4]]);\n * x.cumprod().print();\n * ```\n *\n * @param x The input tensor to cumulatively multiply.\n * @param axis The axis along which to multiply. Optional. Defaults to 0.\n * @param exclusive Whether to perform exclusive cumulative product. Optional.\n *     Defaults to false. If set to true then the product of each tensor entry\n *     does not include its own value, but only the values previous to it\n *     along the specified axis.\n * @param reverse Whether to multiply in the opposite direction. Optional.\n *     Defaults to false.\n *\n * @doc {heading: 'Operations', subheading: 'Scan'}\n */\nfunction cumprod_<T extends Tensor>(\n  x: Tensor | TensorLike,\n  axis = 0,\n  exclusive = false,\n  reverse = false\n): T {\n  const $x = convertToTensor(x, 'x', 'cumprod');\n\n  const inputs: CumprodInputs = { x: $x };\n  const attrs: CumprodAttrs = { axis, exclusive, reverse };\n\n  return ENGINE.runKernel(\n    Cumprod,\n    inputs as unknown as NamedTensorMap,\n    attrs as unknown as NamedAttrMap\n  );\n}\n\nexport const cumprod = /* @__PURE__ */ op({ cumprod_ });\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Cumsum, CumsumAttrs, CumsumInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the cumulative sum of a `tf.Tensor` along `axis`.\n *\n * ```js\n * const x = tf.tensor([1, 2, 3, 4]);\n * x.cumsum().print();\n * ```\n * ```js\n * const x = tf.tensor([[1, 2], [3, 4]]);\n * x.cumsum().print();\n * ```\n *\n * @param x The input tensor to be summed.\n * @param axis The axis along which to sum. Optional. Defaults to 0.\n * @param exclusive Whether to perform exclusive cumulative sum. Optional.\n *     Defaults to false. If set to true then the sum of each tensor entry\n *     does not include its own value, but only the values previous to it\n *     along the specified axis.\n * @param reverse Whether to sum in the opposite direction. Optional.\n *     Defaults to false.\n *\n * @doc {heading: 'Operations', subheading: 'Scan'}\n */\nfunction cumsum_<T extends Tensor>(\n    x: Tensor|TensorLike, axis = 0, exclusive = false, reverse = false): T {\n  const $x = convertToTensor(x, 'x', 'cumsum');\n\n  const inputs: CumsumInputs = {x: $x};\n  const attrs: CumsumAttrs = {axis, exclusive, reverse};\n\n  return ENGINE.runKernel(\n      Cumsum, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const cumsum = /* @__PURE__ */ op({cumsum_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {DenseBincount, DenseBincountAttrs, DenseBincountInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor1D, Tensor2D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Outputs a vector with length `size` and the same dtype as `weights`.\n *\n * If `weights` are empty, then index `i` stores the number of times the value\n * `i` is counted in `x`. If `weights` are non-empty, then index `i` stores the\n * sum of the value in `weights` at each index where the corresponding value in\n * `x` is `i`.\n *\n * Values in `x` outside of the range [0, size) are ignored.\n *\n * @param x The input int tensor, rank 1 or rank 2.\n * @param weights The weights tensor, must have the same shape as x, or a\n *     length-0 Tensor, in which case it acts as all weights equal to 1.\n * @param size Non-negative integer.\n * @param binaryOutput Optional. Whether the kernel should count the appearance\n *     or number of occurrences. Defaults to False.\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction denseBincount_<T extends Tensor1D|Tensor2D>(\n    x: T|TensorLike, weights: T|TensorLike, size: number,\n    binaryOutput = false): T {\n  const $x = convertToTensor(x, 'x', 'denseBincount');\n  const $weights = convertToTensor(weights, 'weights', 'denseBincount');\n\n  util.assert(\n      $x.dtype === 'int32',\n      () => `Error in denseBincount: input ` +\n          `dtype must be int32, but got ${$x.dtype}`);\n  util.assert(\n      $x.rank <= 2,\n      () => `Error in denseBincount: input must be at most rank 2, but got ` +\n          `rank ${$x.rank}.`);\n  util.assert(size >= 0, () => `size must be non-negative, but got ${size}.`);\n  util.assert(\n      $weights.size === $x.size || $weights.size === 0,\n      () =>\n          `Error in denseBincount: weights must have the same shape as x or ` +\n          `0-length, but got x shape: ${$x.shape}, weights shape: ` +\n          `${$weights.shape}.`);\n\n  const inputs: DenseBincountInputs = {x: $x, weights: $weights};\n  const attrs: DenseBincountAttrs = {size, binaryOutput};\n\n  return ENGINE.runKernel(\n      DenseBincount, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const denseBincount = /* @__PURE__ */ op({denseBincount_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {DepthToSpace, DepthToSpaceAttrs, DepthToSpaceInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike4D} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Rearranges data from depth into blocks of spatial data. More specifically,\n * this op outputs a copy of the input tensor where values from the `depth`\n * dimension are moved in spatial blocks to the `height` and `width` dimensions.\n * The attr `blockSize` indicates the input block size and how the data is\n * moved.\n *\n *  - Chunks of data of size `blockSize * blockSize` from depth are rearranged\n * into non-overlapping blocks of size `blockSize x blockSize`\n *\n *  - The width the output tensor is `inputWidth * blockSize`, whereas the\n * height is `inputHeight * blockSize`\n *\n *  - The Y, X coordinates within each block of the output image are determined\n * by the high order component of the input channel index\n *\n *  - The depth of the input tensor must be divisible by `blockSize *\n * blockSize`\n *\n * The `dataFormat` attr specifies the layout of the input and output tensors\n * with the following options: \"NHWC\": [ `batch, height, width, channels` ]\n * \"NCHW\": [ `batch, channels, height, width` ]\n *\n * ```js\n * const x = tf.tensor4d([1, 2, 3, 4], [1, 1, 1, 4]);\n * const blockSize = 2;\n * const dataFormat = \"NHWC\";\n *\n * tf.depthToSpace(x, blockSize, dataFormat).print();\n * ```\n *\n * @param x The input tensor of rank 4\n * @param blockSIze  An `int` that is `>= 2`. The size of the spatial block\n * @param dataFormat An optional string from: \"NHWC\", \"NCHW\". Defaults to \"NHWC\"\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction depthToSpace_(\n    x: Tensor4D|TensorLike4D, blockSize: number,\n    dataFormat: 'NHWC'|'NCHW' = 'NHWC'): Tensor4D {\n  const $x = convertToTensor(x, 'x', 'depthToSpace', 'float32') as Tensor4D;\n\n  const inputHeight = (dataFormat === 'NHWC') ? $x.shape[1] : $x.shape[2];\n  const inputWidth = (dataFormat === 'NHWC') ? $x.shape[2] : $x.shape[3];\n  const inputDepth = (dataFormat === 'NHWC') ? $x.shape[3] : $x.shape[1];\n\n  util.assert(\n      blockSize > 1,\n      () => `blockSize should be > 1 for depthToSpace, but was: ${blockSize}`);\n\n  util.assert(\n      inputHeight * blockSize >= 0,\n      () => `Negative dimension size caused by overflow when multiplying\n    ${inputHeight} and ${blockSize}  for depthToSpace with input shape\n    ${$x.shape}`);\n\n  util.assert(\n      inputWidth * blockSize >= 0,\n      () => `Negative dimension size caused by overflow when multiplying\n    ${inputWidth} and ${blockSize} for depthToSpace with input shape\n        ${$x.shape}`);\n\n  util.assert(\n      (inputDepth % (blockSize * blockSize) === 0),\n      () => `Dimension size must be evenly divisible by ${\n          blockSize * blockSize} but is ${\n          inputDepth} for depthToSpace with input shape ${$x.shape}`);\n\n  const inputs: DepthToSpaceInputs = {x: $x};\n  const attrs: DepthToSpaceAttrs = {blockSize, dataFormat};\n\n  return ENGINE.runKernel(\n      DepthToSpace, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const depthToSpace = /* @__PURE__ */ op({depthToSpace_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {DepthwiseConv2dNative, DepthwiseConv2dNativeAttrs, DepthwiseConv2dNativeInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport * as conv_util from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Depthwise 2D convolution.\n *\n * Given a 4D `input` array and a `filter` array of shape\n * `[filterHeight, filterWidth, inChannels, channelMultiplier]` containing\n * `inChannels` convolutional filters of depth 1, this op applies a\n * different filter to each input channel (expanding from 1 channel to\n * `channelMultiplier` channels for each), then concatenates the results\n * together. The output has `inChannels * channelMultiplier` channels.\n *\n * See\n * [https://www.tensorflow.org/api_docs/python/tf/nn/depthwise_conv2d](\n *     https://www.tensorflow.org/api_docs/python/tf/nn/depthwise_conv2d)\n * for more details.\n *\n * @param x The input tensor, of rank 4 or rank 3, of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is\n * assumed.\n * @param filter The filter tensor, rank 4, of shape\n *     `[filterHeight, filterWidth, inChannels, channelMultiplier]`.\n * @param strides The strides of the convolution: `[strideHeight,\n * strideWidth]`. If strides is a single number, then `strideHeight ==\n * strideWidth`.\n * @param pad The type of padding algorithm.\n *   - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *   - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n *   - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dilations The dilation rates: `[dilationHeight, dilationWidth]`\n *     in which we sample input values across the height and width dimensions\n *     in atrous convolution. Defaults to `[1, 1]`. If `rate` is a single\n *     number, then `dilationHeight == dilationWidth`. If it is greater than\n *     1, then all values of `strides` must be 1.\n * @param dataFormat: An optional string from: \"NHWC\", \"NCHW\". Defaults to\n *     \"NHWC\". Specify the data format of the input and output data. With the\n *     default format \"NHWC\", the data is stored in the order of: [batch,\n *     height, width, channels]. Only \"NHWC\" is currently supported.\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction depthwiseConv2d_<T extends Tensor3D|Tensor4D>(\n    x: T|TensorLike, filter: Tensor4D|TensorLike,\n    strides: [number, number]|number,\n    pad: 'valid'|'same'|number|conv_util.ExplicitPadding,\n    dataFormat: 'NHWC'|'NCHW' = 'NHWC',\n    dilations: [number, number]|number = [1, 1],\n    dimRoundingMode?: 'floor'|'round'|'ceil'): T {\n  const $x = convertToTensor(x, 'x', 'depthwiseConv2d', 'float32');\n  const $filter =\n      convertToTensor(filter, 'filter', 'depthwiseConv2d', 'float32');\n\n  let x4D = $x as Tensor4D;\n  let reshapedTo4D = false;\n  if ($x.rank === 3) {\n    reshapedTo4D = true;\n    x4D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2]]);\n  }\n  util.assert(\n      x4D.rank === 4,\n      () => `Error in depthwiseConv2d: input must be rank 4, but got ` +\n          `rank ${x4D.rank}.`);\n  util.assert(\n      $filter.rank === 4,\n      () => `Error in depthwiseConv2d: filter must be rank 4, but got rank ` +\n          `${$filter.rank}.`);\n  const inChannels = dataFormat === 'NHWC' ? x4D.shape[3] : x4D.shape[1];\n  util.assert(\n      inChannels === $filter.shape[2],\n      () => `Error in depthwiseConv2d: number of input channels ` +\n          `(${inChannels}) must match the inChannels dimension in ` +\n          `filter ${$filter.shape[2]}.`);\n  conv_util.checkPadOnDimRoundingMode('depthwiseConv2d', pad, dimRoundingMode);\n  const inputs: DepthwiseConv2dNativeInputs = {x: x4D, filter: $filter};\n  const attrs: DepthwiseConv2dNativeAttrs =\n      {strides, pad, dataFormat, dilations, dimRoundingMode};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  DepthwiseConv2dNative, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n  return res;\n}\n\nexport const depthwiseConv2d = /* @__PURE__ */ op({depthwiseConv2d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Diag, DiagInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\n\nimport {op} from './operation';\n\n/**\n * Returns a diagonal tensor with given diagonal values.\n *\n * Given a diagonal, this operation returns a tensor with the diagonal and\n * everything else padded with zeros.\n *\n * Assume the input has dimensions `[D1,..., Dk]`, then the output is a tensor\n * of rank 2k with dimensions `[D1,..., Dk, D1,..., Dk]`\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n *\n * tf.diag(x).print()\n * ```\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4, 5, 6, 7, 8], [4, 2])\n *\n * tf.diag(x).print()\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction diag_(x: Tensor): Tensor {\n  const $x = convertToTensor(x, 'x', 'diag');\n\n  const inputs: DiagInputs = {x: $x};\n\n  return ENGINE.runKernel(Diag, inputs as unknown as NamedTensorMap);\n}\n\nexport const diag = /* @__PURE__ */ op({diag_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Dilation2D, Dilation2DAttrs, Dilation2DInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes the grayscale dilation over the input `x`.\n *\n * @param x The input tensor, rank 3 or rank 4 of shape\n *     `[batch, height, width, depth]`. If rank 3, batch of 1 is assumed.\n * @param filter The filter tensor, rank 3, of shape\n *     `[filterHeight, filterWidth, depth]`.\n * @param strides The strides of the sliding window for each dimension of the\n *     input tensor: `[strideHeight, strideWidth]`.\n *     If `strides` is a single number,\n *     then `strideHeight == strideWidth`.\n * @param pad The type of padding algorithm.\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1*1x1.\n *    - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dataFormat Specify the data format of the input and output data.\n *      Defaults to 'NHWC'. Only 'NHWC' is currently supported. With the\n *      default format \"NHWC\", the data is stored in the order of: [batch,\n *      height, width, channels].\n * @param dilations The dilation rates: `[dilationHeight, dilationWidth]`\n *     in which we sample input values across the height and width dimensions\n *     for atrous morphological dilation. Defaults to `[1, 1]`. If `dilations`\n *     is a single number, then `dilationHeight == dilationWidth`. If it is\n *     greater than 1, then all values of `strides` must be 1.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction dilation2d_<T extends Tensor3D|Tensor4D>(\n    x: T|TensorLike, filter: Tensor3D|TensorLike,\n    strides: [number, number]|number, pad: 'valid'|'same',\n    dilations: [number, number]|number = [1, 1],\n    dataFormat: 'NHWC' = 'NHWC'): T {\n  const $x = convertToTensor(x, 'x', 'dilation2d');\n  const $filter = convertToTensor(filter, 'filter', 'dilation2d');\n\n  util.assert(\n      $x.rank === 3 || $x.rank === 4,\n      () => `Error in dilation2d: input must be rank 3 or 4, but got rank ` +\n          `${$x.rank}.`);\n  util.assert(\n      $filter.rank === 3,\n      () => `Error in dilation2d: filter must be rank 3, but got rank ` +\n          `${$filter.rank}.`);\n  util.assert(\n      dataFormat === 'NHWC',\n      () => `Error in dilation2d: Only NHWC is currently supported, ` +\n          `but got dataFormat of ${dataFormat}`);\n\n  let x4D = $x as Tensor4D;\n  let reshapedTo4D = false;\n\n  if ($x.rank === 3) {\n    x4D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2]]);\n    reshapedTo4D = true;\n  }\n\n  util.assert(\n      x4D.shape[3] === $filter.shape[2],\n      () => `Error in dilation2d:  input and filter must have the same depth: ${\n          x4D.shape[3]} vs ${$filter.shape[2]}`);\n\n  const inputs: Dilation2DInputs = {x: x4D, filter: $filter};\n  const attrs: Dilation2DAttrs = {strides, pad, dilations};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  Dilation2D, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n\n  return res;\n}\n\nexport const dilation2d = /* @__PURE__ */ op({dilation2d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {FloorDiv, FloorDivInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Divides two `tf.Tensor`s element-wise, A / B. Supports broadcasting.\n * The result is rounded with floor function.\n *\n *\n * ```js\n * const a = tf.tensor1d([1, 4, 9, 16]);\n * const b = tf.tensor1d([1, 2, 3, 4]);\n *\n * a.floorDiv(b).print();  // or tf.div(a, b)\n * ```\n *\n * ```js\n * // Broadcast div a with b.\n * const a = tf.tensor1d([2, 4, 6, 8]);\n * const b = tf.scalar(2);\n *\n * a.floorDiv(b).print();  // or tf.floorDiv(a, b)\n * ```\n *\n * @param a The first tensor as the numerator.\n * @param b The second tensor as the denominator. Must have the same dtype as\n * `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction floorDiv_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'floorDiv');\n  let $b = convertToTensor(b, 'b', 'floorDiv');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  const inputs: FloorDivInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(FloorDiv, inputs as unknown as NamedTensorMap);\n}\n\nexport const floorDiv = /* @__PURE__ */ op({floorDiv_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {RealDiv, RealDivInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {floorDiv} from './floorDiv';\nimport {op} from './operation';\n\n/**\n * Divides two `tf.Tensor`s element-wise, A / B. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([1, 4, 9, 16]);\n * const b = tf.tensor1d([1, 2, 3, 4]);\n *\n * a.div(b).print();  // or tf.div(a, b)\n * ```\n *\n * ```js\n * // Broadcast div a with b.\n * const a = tf.tensor1d([2, 4, 6, 8]);\n * const b = tf.scalar(2);\n *\n * a.div(b).print();  // or tf.div(a, b)\n * ```\n *\n * @param a The first tensor as the numerator.\n * @param b The second tensor as the denominator. Must have the same dtype as\n * `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction div_<T extends Tensor>(a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'div');\n  let $b = convertToTensor(b, 'b', 'div');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  if ($a.dtype === 'int32' && $b.dtype === 'int32') {\n    return floorDiv($a, $b);\n  }\n\n  const inputs: RealDivInputs = {a: $a, b: $b};\n  const attrs = {};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  return ENGINE.runKernel(RealDiv,\n                          inputs as unknown as NamedTensorMap, attrs) as T;\n}\n\nexport const div = /* @__PURE__ */ op({div_});\n", "/**\n * @license\n * Copyright 2017 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/**\n * Returns the dimensions in the input shape that are broadcasted to\n * produce the provided output shape.\n *\n * The returned dimensions are 0-indexed and sorted. An example:\n * inShape = [4, 1, 3]\n * outShape = [5, 4, 3, 3]\n * result = [1]. Dimension 1 (2nd dimension of input) gets broadcasted 1 => 3.\n */\nexport function getBroadcastDims(\n    inShape: number[], outShape: number[]): number[] {\n  const inRank = inShape.length;\n  const dims: number[] = [];\n  for (let i = 0; i < inRank; i++) {\n    const dim = inRank - 1 - i;\n    const a = inShape[dim] || 1;\n    const b = outShape[outShape.length - 1 - i] || 1;\n    if (b > 1 && a === 1) {\n      dims.unshift(dim);\n    }\n  }\n  return dims;\n}\n\n/**\n * Returns the axes in the output space that should be reduced to produce\n * the input space.\n */\nexport function getReductionAxes(\n    inShape: number[], outShape: number[]): number[] {\n  const result: number[] = [];\n  for (let i = 0; i < outShape.length; i++) {\n    const inDim = inShape[inShape.length - i - 1];\n    const outAxis = outShape.length - i - 1;\n    const outDim = outShape[outAxis];\n    if (inDim == null || (inDim === 1 && outDim > 1)) {\n      result.unshift(outAxis);\n    }\n  }\n  return result;\n}\n\nexport function assertAndGetBroadcastShape(\n    shapeA: number[], shapeB: number[]): number[] {\n  const l = Math.max(shapeA.length, shapeB.length);\n  const result = new Array(l);\n\n  for (let i = 0; i < l; i++) {\n    let a = shapeA[shapeA.length - i - 1];\n    if (a == null) {\n      a = 1;\n    }\n    let b = shapeB[shapeB.length - i - 1];\n    if (b == null) {\n      b = 1;\n    }\n    if (a === 1) {\n      result[l - i - 1] = b;\n    } else if (b === 1) {\n      result[l - i - 1] = a;\n    } else if (a !== b) {\n      const errMsg = `Operands could not be broadcast together with shapes ` +\n          `${shapeA} and ${shapeB}.`;\n      throw Error(errMsg);\n    } else {\n      result[l - i - 1] = a;\n    }\n  }\n  return result;\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Equal, EqualInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {op} from './operation';\n\n/**\n * Returns the truth value of (a == b) element-wise. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3]);\n * const b = tf.tensor1d([2, 2, 2]);\n *\n * a.equal(b).print();\n * ```\n *\n * @param a The first input tensor.\n * @param b The second input tensor. Must have the same dtype as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction equal_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'equal', 'string_or_numeric');\n  let $b = convertToTensor(b, 'b', 'equal', 'string_or_numeric');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: EqualInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(Equal, inputs as unknown as NamedTensorMap);\n}\n\nexport const equal = /* @__PURE__ */ op({equal_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Select, SelectInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {broadcastTo} from './broadcast_to';\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {op} from './operation';\n\n/**\n * Returns the elements, either `a` or `b` depending on the `condition`.\n *\n * If the condition is true, select from `a`, otherwise select from `b`.\n *\n * ```js\n * const cond = tf.tensor1d([false, false, true], 'bool');\n * const a = tf.tensor1d([1 , 2, 3]);\n * const b = tf.tensor1d([-1, -2, -3]);\n *\n * a.where(cond, b).print();\n * ```\n *\n * @param condition The input condition. Must be of dtype bool.\n * @param a If `condition` is rank 1, `a` may have a higher rank but\n *     its first dimension must match the size of `condition`.\n * @param b A tensor with the same dtype as `a` and with shape that is\n *     compatible with `a`.\n * @return A tensor with same dtype as `a` and `b`, and shape that is\n *     broadcastable from `a` and `b`.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction where_<T extends Tensor>(\n    condition: Tensor|TensorLike, a: T|TensorLike, b: T|TensorLike): T {\n  const $a = convertToTensor(a, 'a', 'where');\n  const $b = convertToTensor(b, 'b', 'where');\n  const $condition = convertToTensor(condition, 'condition', 'where', 'bool');\n  // TODO: move this logic to forward function when the broadcastTo op is\n  // implemented in WASM.\n  // Find the broadcastable shape for $condition, $a, and $b.\n  const broadcastShape = assertAndGetBroadcastShape(\n      assertAndGetBroadcastShape($condition.shape, $a.shape), $b.shape);\n  const $broadcastedCondition = broadcastTo($condition, broadcastShape);\n  const $broadcastedA = broadcastTo($a, broadcastShape);\n  const $broadcastedB = broadcastTo($b, broadcastShape);\n\n  const inputs: SelectInputs = {\n    condition: $broadcastedCondition,\n    t: $broadcastedA,\n    e: $broadcastedB\n  };\n  return ENGINE.runKernel(Select, inputs as unknown as NamedTensorMap);\n}\n\nexport const where = /* @__PURE__ */ op({where_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {ZerosLike, ZerosLikeInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Creates a `tf.Tensor` with all elements set to 0 with the same shape as the\n * given tensor.\n *\n * ```js\n * const x = tf.tensor([1, 2]);\n * tf.zerosLike(x).print();\n * ```\n *\n * @param x The tensor of required shape.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction zerosLike_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'zerosLike');\n  const inputs: ZerosLikeInputs = {x: $x};\n  return ENGINE.runKernel(ZerosLike, inputs as unknown as NamedTensorMap);\n}\nexport const zerosLike = /* @__PURE__ */ op({zerosLike_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {div} from './div';\nimport {equal} from './equal';\nimport {op} from './operation';\nimport {where} from './where';\nimport {zerosLike} from './zeros_like';\n\n/**\n * Divides two `tf.Tensor`s element-wise, A / B. Supports broadcasting. Return 0\n * if denominator is 0.\n *\n *\n * ```js\n * const a = tf.tensor1d([1, 4, 9, 16]);\n * const b = tf.tensor1d([1, 2, 3, 4]);\n * const c = tf.tensor1d([0, 0, 0, 0]);\n *\n * a.divNoNan(b).print();  // or tf.divNoNan(a, b)\n * a.divNoNan(c).print();  // or tf.divNoNan(a, c)\n * ```\n *\n * ```js\n * // Broadcast div a with b.\n * const a = tf.tensor1d([2, 4, 6, 8]);\n * const b = tf.scalar(2);\n * const c = tf.scalar(0);\n *\n * a.divNoNan(b).print();  // or tf.divNoNan(a, b)\n * a.divNoNan(c).print();  // or tf.divNoNan(a, c)\n * ```\n *\n * @param a The first tensor as the numerator.\n * @param b The second tensor as the denominator. Must have the same dtype as\n * `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction divNoNan_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  // TODO: Make this into its own kernel.\n  let $a = convertToTensor(a, 'a', 'div');\n  let $b = convertToTensor(b, 'b', 'div');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  const divResult = div($a, $b);\n  const zeros = zerosLike(divResult);\n  const bEqualsZero = equal($b, zeros);\n  return where(bEqualsZero, zeros, divResult) as T;\n}\n\nexport const divNoNan = /* @__PURE__ */ op({divNoNan_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor,} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {matMul} from './mat_mul';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes the dot product of two matrices and/or vectors, `t1` and `t2`.\n *\n * ```js\n * const a = tf.tensor1d([1, 2]);\n * const b = tf.tensor2d([[1, 2], [3, 4]]);\n * const c = tf.tensor2d([[1, 2, 3], [4, 5, 6]]);\n *\n * a.dot(b).print();  // or tf.dot(a, b)\n * b.dot(a).print();\n * b.dot(c).print();\n * ```\n * @param t1 The first tensor in the dot operation.\n * @param t2 The second tensor in the dot operation.\n *\n * @doc {heading: 'Operations', subheading: 'Matrices'}\n */\nfunction dot_(t1: Tensor|TensorLike, t2: Tensor|TensorLike): Tensor {\n  const $t1 = convertToTensor(t1, 't1', 'dot');\n  const $t2 = convertToTensor(t2, 't2', 'dot');\n\n  util.assert(\n      ($t1.rank === 1 || $t1.rank === 2) && ($t2.rank === 1 || $t2.rank === 2),\n      () => `Error in dot: inputs must all be rank 1 or 2, but got ranks ` +\n          `${$t1.rank} and ${$t2.rank}.`);\n\n  const t1Inner = ($t1.rank === 1 ? $t1.size : $t1.shape[1]);\n  const t2Inner = ($t2.rank === 1 ? $t2.size : $t2.shape[0]);\n\n  util.assert(\n      t1Inner === t2Inner,\n      () => `Error in dot: inner dimensions of inputs must match, but got ` +\n          `${t1Inner} and ${t2Inner}.`);\n\n  if ($t1.rank === 1 && $t2.rank === 1) {\n    const t12D = reshape($t1, [1, -1]);\n    const t22D = reshape($t2, [-1, 1]);\n    const t1t2 = matMul(t12D, t22D);\n    return reshape(t1t2, []);\n  } else if ($t1.rank === 1 && $t2.rank === 2) {\n    const t12D = reshape($t1, [1, -1]);\n    const t22D = reshape($t2, [$t2.shape[0], $t2.shape[1]]);\n    const t1t2 = matMul(t12D, t22D);\n    return reshape(t1t2, [t1t2.size]);\n  } else if ($t1.rank === 2 && $t2.rank === 1) {\n    const t22D = reshape($t2, [-1, 1]);\n    const t1t2 = matMul($t1, t22D);\n    return reshape(t1t2, [t1t2.size]);\n  } else {\n    const t22D = reshape($t2, [$t2.shape[0], $t2.shape[1]]);\n    const t1t2 = matMul($t1, t22D);\n    return t1t2;\n  }\n}\n\nexport const dot = /* @__PURE__ */ op({dot_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Einsum, EinsumAttrs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\n\nimport {op} from './operation';\n\n/**\n * Tensor contraction over specified indices and outer product.\n *\n * `einsum` allows defining Tensors by defining their element-wise computation.\n * This computation is based on\n * [Einstein summation](https://en.wikipedia.org/wiki/Einstein_notation).\n *\n * Some special cases include:\n *\n * Matrix multiplication:\n * ```js\n * const x = tf.tensor2d([[1, 2, 3], [4, 5, 6]]);\n * const y = tf.tensor2d([[0, 1], [2, 3], [4, 5]]);\n * x.print();\n * y.print();\n * tf.einsum('ij,jk->ik', x, y).print();\n * ```\n *\n * Dot product:\n * ```js\n * const x = tf.tensor1d([1, 2, 3]);\n * const y = tf.tensor1d([0, 1, 2]);\n * x.print();\n * y.print();\n * tf.einsum('i,i->', x, y).print();\n * ```\n *\n * Batch dot product:\n * ```js\n * const x = tf.tensor2d([[1, 2, 3], [4, 5, 6]]);\n * const y = tf.tensor2d([[0, 1, 2], [3, 4, 5]]);\n * x.print();\n * y.print();\n * tf.einsum('bi,bi->b', x, y).print();\n * ```\n *\n * Outer prouduct:\n * ```js\n * const x = tf.tensor1d([1, 3, 5]);\n * const y = tf.tensor1d([2, 4, 6]);\n * x.print();\n * y.print();\n * tf.einsum('i,j->ij', x, y).print();\n * ```\n *\n * Matrix transpose:\n * ```js\n * const x = tf.tensor2d([[1, 2], [3, 4]]);\n * x.print();\n * tf.einsum('ij->ji', x).print();\n * ```\n *\n * Batch matrix transpose:\n * ```js\n * const x = tf.tensor3d([[[1, 2], [3, 4]], [[-1, -2], [-3, -4]]]);\n * x.print();\n * tf.einsum('bij->bji', x).print();\n * ```\n *\n * Limitations:\n *\n * This implementation of einsum has the following limitations:\n *\n * - Does not support >2 input tensors.\n * - Does not support duplicate axes for any given input tensor. E.g., equation\n *   'ii->' is not supported.\n * - The `...` notation is not supported.\n *\n * @param equation a string describing the contraction, in the same format as\n * [numpy.einsum](https://numpy.org/doc/stable/reference/generated/numpy.einsum.html).\n * @param tensors the input(s) to contract (each one a Tensor), whose shapes\n *     should be consistent with equation.\n * @returns The output tensor.\n *\n * @doc {heading: 'Tensors', subheading: 'Matrices'}\n */\nexport function einsum_(equation: string, ...tensors: Tensor[]): Tensor {\n  const $tensors =\n      tensors.map((t, i) => convertToTensor(t, `tensors${i}`, 'einsum'));\n  const attrs: EinsumAttrs = {equation};\n  return ENGINE.runKernel(\n      Einsum, $tensors as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const einsum = /* @__PURE__ */ op({einsum_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Elu, EluInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes exponential linear element-wise: `x > 0 ? x : (e ^ x) - 1`.\n *\n * ```js\n * const x = tf.tensor1d([-1, 1, -3, 2]);\n *\n * x.elu().print();  // or tf.elu(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction elu_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'elu', 'float32');\n\n  const inputs: EluInputs = {x: $x};\n\n  return ENGINE.runKernel(Elu, inputs as unknown as NamedTensorMap);\n}\n\nexport const elu = /* @__PURE__ */ op({elu_});\n", "/**\n * @license\n * Copyright 2023 Google LLC.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {Rank, ShapeMap} from '../types';\nimport {arraysEqualWithNull} from '../util_base';\n\nimport {op} from './operation';\n\n/**\n * Checks the input tensor mathes the given shape.\n *\n * Given an input tensor, returns a new tensor with the same values as the\n * input tensor with shape `shape`.\n *\n * The method supports the null value in tensor. It will still check the shapes,\n * and null is a placeholder.\n *\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n * const y = tf.tensor1d([1, null, 3, 4]);\n * const z = tf.tensor2d([1, 2, 3, 4], [2,2]);\n * tf.ensureShape(x, [4]).print();\n * tf.ensureShape(y, [4]).print();\n * tf.ensureShape(z, [null, 2]).print();\n * ```\n *\n * @param x The input tensor to be ensured.\n * @param shape A TensorShape representing the shape of this tensor, an array\n *     or null.\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction ensureShape_<R extends Rank>(x: Tensor, shape: ShapeMap[R]): Tensor {\n  const $x = convertToTensor(x, 'x', 'ensureShape', 'string_or_numeric');\n  if (!arraysEqualWithNull($x.shape, shape)) {\n    throw new Error(`EnsureShape: Shape of tensor ${\n        $x.shape} is not compatible with expected shape ${shape}`);\n  }\n\n  return x;\n}\nexport const ensureShape = /* @__PURE__ */ op({ensureShape_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Erf, ErfInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {cast} from './cast';\nimport {op} from './operation';\n\n/**\n * Computes Gauss error function of the input `tf.Tensor` element-wise:\n * `erf(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, .1, -.1, .7]);\n *\n * x.erf().print(); // or tf.erf(x);\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction erf_<T extends Tensor>(x: T|TensorLike): T {\n  let $x = convertToTensor(x, 'x', 'erf');\n  util.assert(\n      $x.dtype === 'int32' || $x.dtype === 'float32',\n      () => 'Input dtype must be `int32` or `float32`.');\n\n  if ($x.dtype === 'int32') {\n    $x = cast($x, 'float32');\n  }\n\n  const inputs: ErfInputs = {x: $x};\n  return ENGINE.runKernel(Erf, inputs as unknown as NamedTensorMap);\n}\nexport const erf = /* @__PURE__ */ op({erf_});\n", "/**\n * @license\n * Copyright 2017 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport * as util from '../util';\n\n/**\n * Returns true if the axis specifies the inner most dimensions of the\n * array.\n */\nexport function axesAreInnerMostDims(axes: number[], rank: number): boolean {\n  for (let i = 0; i < axes.length; ++i) {\n    if (axes[axes.length - i - 1] !== rank - 1 - i) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport function combineLocations(\n    outputLoc: number[], reduceLoc: number[], axes: number[]): number[] {\n  const rank = outputLoc.length + reduceLoc.length;\n  const loc = [];\n  let outIdx = 0;\n  let reduceIdx = 0;\n    for (let dim = 0; dim < rank; dim++) {\n    if (axes.indexOf(dim) === -1) {\n      loc.push(outputLoc[outIdx++]);\n    } else {\n      loc.push(reduceLoc[reduceIdx++]);\n    }\n  }\n  return loc;\n}\n\nexport function computeOutAndReduceShapes(\n    aShape: number[], axes: number[]): [number[], number[]] {\n  const outShape = [];\n  const rank = aShape.length;\n  for (let dim = 0; dim < rank; dim++) {\n    if (axes.indexOf(dim) === -1) {\n      outShape.push(aShape[dim]);\n    }\n  }\n  const reduceShape = axes.map(dim => aShape[dim]);\n  return [outShape, reduceShape];\n}\n\nexport function expandShapeToKeepDim(\n    shape: number[], axes: number[]): number[] {\n  const reduceSubShape = axes.map(x => 1);\n  return combineLocations(shape, reduceSubShape, axes);\n}\n\nexport function assertAxesAreInnerMostDims(\n    msg: string, axes: number[], rank: number): void {\n  util.assert(\n      axesAreInnerMostDims(axes, rank),\n      () => `${msg} supports only inner-most axes for now. ` +\n          `Got axes ${axes} and rank-${rank} input.`);\n}\n\n/**\n * Returns the axes permutation to be used with `tf.transpose`, if such\n * permutation is necessary. Otherwise it returns null. This method is used by\n * operations that operate only on inner-most axes.\n */\nexport function getAxesPermutation(axes: number[], rank: number): number[]|\n    null {\n  if (axesAreInnerMostDims(axes, rank)) {\n    return null;\n  }\n  const result: number[] = [];\n  for (let i = 0; i < rank; ++i) {\n    if (axes.indexOf(i) === -1) {\n      result.push(i);\n    }\n  }\n  axes.forEach(axis => result.push(axis));\n  return result;\n}\n\n/** Returns the axes permutation that undoes the original permutation. */\nexport function getUndoAxesPermutation(axes: number[]): number[] {\n  return axes.map((axis, i) => [i, axis])\n      .sort((a, b) => a[1] - b[1])\n      .map(x => x[0]);\n}\n\nexport function getInnerMostAxes(numAxes: number, rank: number): number[] {\n  const res: number[] = [];\n  for (let i = rank - numAxes; i < rank; ++i) {\n    res.push(i);\n  }\n  return res;\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Max, MaxAttrs, MaxInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the maximum of elements across dimensions of a `tf.Tensor`.\n *\n * Reduces the input along the dimensions given in `axes`. Unless `keepDims`\n * is true, the rank of the `tf.Tensor` is reduced by 1 for each entry in\n * `axes`. If `keepDims` is true, the reduced dimensions are retained with\n * length 1. If `axes` has no entries, all dimensions are reduced, and a\n * `tf.Tensor` with a single element is returned.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3]);\n *\n * x.max().print();  // or tf.max(x)\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * const axis = 1;\n * x.max(axis).print();  // or tf.max(x, axis)\n * ```\n *\n * @param x The input tensor.\n * @param axis The dimension(s) to reduce. By default it reduces\n *     all dimensions.\n * @param keepDims If true, retains reduced dimensions with size 1.\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction max_<T extends Tensor>(\n    x: Tensor|TensorLike, axis: number|number[] = null, keepDims = false): T {\n  const $x = convertToTensor(x, 'x', 'max');\n\n  const inputs: MaxInputs = {x: $x};\n  const attrs: MaxAttrs = {reductionIndices: axis, keepDims};\n\n  return ENGINE.runKernel(\n      Max, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const max = /* @__PURE__ */ op({max_});\n", "/**\n * @license\n * Copyright 2020 Google Inc. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Min, MinAttrs, MinInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the minimum value from the input.\n *\n * Reduces the input along the dimensions given in `axes`. Unless `keepDims`\n * is true, the rank of the array is reduced by 1 for each entry in `axes`.\n * If `keepDims` is true, the reduced dimensions are retained with length 1.\n * If `axes` has no entries, all dimensions are reduced, and an array with a\n * single element is returned.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3]);\n *\n * x.min().print();  // or tf.min(x)\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * const axis = 1;\n * x.min(axis).print();  // or tf.min(x, axis)\n * ```\n *\n * @param x The input Tensor.\n * @param axis The dimension(s) to reduce. By default it reduces\n *     all dimensions.\n * @param keepDims If true, retains reduced dimensions with size 1.\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction min_<T extends Tensor>(\n    x: Tensor|TensorLike, axis: number|number[] = null, keepDims = false): T {\n  const $x = convertToTensor(x, 'x', 'min');\n\n  const inputs: MinInputs = {x: $x};\n  const attrs: MinAttrs = {axis, keepDims};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  return ENGINE.runKernel(\n             Min, inputs as unknown as NamedTensorMap,\n             attrs as unknown as NamedAttrMap) as T;\n}\n\nexport const min = /* @__PURE__ */ op({min_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Pow, PowInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the power of one `tf.Tensor` to another. Supports broadcasting.\n *\n * Given a `tf.Tensor` x and a `tf.Tensor` y, this operation computes x^y for\n * corresponding elements in x and y. The result's dtype will be the upcasted\n * type of the `base` and `exp` dtypes.\n *\n * ```js\n * const a = tf.tensor([[2, 3], [4, 5]])\n * const b = tf.tensor([[1, 2], [3, 0]]).toInt();\n *\n * a.pow(b).print();  // or tf.pow(a, b)\n * ```\n *\n * ```js\n * const a = tf.tensor([[1, 2], [3, 4]])\n * const b = tf.tensor(2).toInt();\n *\n * a.pow(b).print();  // or tf.pow(a, b)\n * ```\n * We also expose `powStrict` which has the same signature as this op and\n * asserts that `base` and `exp` are the same shape (does not broadcast).\n *\n * @param base The base `tf.Tensor` to pow element-wise.\n * @param exp The exponent `tf.Tensor` to pow element-wise.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction pow_<T extends Tensor>(\n    base: Tensor|TensorLike, exp: Tensor|TensorLike): T {\n  let $base = convertToTensor(base, 'base', 'pow');\n  let $exp = convertToTensor(exp, 'exp', 'pow');\n  [$base, $exp] = makeTypesMatch($base, $exp);\n\n  const inputs: PowInputs = {a: $base, b: $exp};\n\n  return ENGINE.runKernel(Pow, inputs as unknown as NamedTensorMap);\n}\n\nexport const pow = /* @__PURE__ */ op({pow_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Tensor} from '../tensor';\nimport {isWebGLData, isWebGPUData, TensorLike, TypedArray, WebGLData, WebGPUData} from '../types';\nimport {DataType} from '../types';\nimport {assert, assertNonNegativeIntegerDimensions, flatten, inferDtype, isTypedArray, sizeFromShape, toTypedArray} from '../util';\n\n/** This is shared code across all tensor creation methods. */\nexport function makeTensor(\n    values: TensorLike|WebGLData|WebGPUData, shape: number[],\n    inferredShape: number[], dtype?: DataType): Tensor {\n  if (dtype == null) {\n    dtype = inferDtype(values);\n  } else if (dtype === 'complex64') {\n    throw new Error(\n        `Cannot construct a complex64 tensor directly. ` +\n        `Please use tf.complex(real, imag).`);\n  }\n\n  if (isWebGPUData(values) || isWebGLData(values)) {\n    if (dtype !== 'float32' && dtype !== 'int32') {\n      throw new Error(\n          `Creating tensor from GPU data only supports ` +\n          `'float32'|'int32' dtype, while the dtype is ${dtype}.`);\n    }\n    return ENGINE.backend.createTensorFromGPUData(\n        values, shape || inferredShape, dtype);\n  }\n\n  if (!isTypedArray(values) && !Array.isArray(values) &&\n      typeof values !== 'number' && typeof values !== 'boolean' &&\n      typeof values !== 'string') {\n    throw new Error(\n        'values passed to tensor(values) must be a number/boolean/string or ' +\n        'an array of numbers/booleans/strings, or a TypedArray');\n  }\n  // Verify that the shape matches the inferred shape.\n  if (shape != null) {\n    assertNonNegativeIntegerDimensions(shape);\n\n    const providedSize = sizeFromShape(shape);\n    const inferredSize = sizeFromShape(inferredShape);\n    assert(\n        providedSize === inferredSize,\n        () =>\n            `Based on the provided shape, [${shape}], the tensor should have ` +\n            `${providedSize} values but has ${inferredSize}`);\n\n    for (let i = 0; i < inferredShape.length; ++i) {\n      const inferred = inferredShape[i];\n      const flatDimsDontMatch = i === inferredShape.length - 1 ?\n          inferred !== sizeFromShape(shape.slice(i)) :\n          true;\n      assert(\n          inferredShape[i] === shape[i] || !flatDimsDontMatch,\n          () => `Error creating a new Tensor. Inferred shape ` +\n              `(${inferredShape}) does not match the provided ` +\n              `shape (${shape}). `);\n    }\n  }\n\n  if (!isTypedArray(values) && !Array.isArray(values)) {\n    values = [values] as number[];\n  }\n\n  shape = shape || inferredShape;\n  values = dtype !== 'string' ?\n      toTypedArray(values, dtype) :\n      flatten(values as string[], [], true) as string[];\n  return ENGINE.makeTensor(values as TypedArray, shape, dtype);\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Scalar} from '../tensor';\nimport {DataType} from '../types';\nimport {isTypedArray} from '../util';\nimport {makeTensor} from './tensor_ops_util';\n\n/**\n * Creates rank-0 `tf.Tensor` (scalar) with the provided value and dtype.\n *\n * The same functionality can be achieved with `tf.tensor`, but in general\n * we recommend using `tf.scalar` as it makes the code more readable.\n *\n * ```js\n * tf.scalar(3.14).print();\n * ```\n *\n * @param value The value of the scalar.\n * @param dtype The data type.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function scalar(\n    value: number|boolean|string|Uint8Array, dtype?: DataType): Scalar {\n  if (((isTypedArray(value) && dtype !== 'string') || Array.isArray(value)) &&\n      dtype !== 'complex64') {\n    throw new Error(\n        'Error creating a new Scalar: value must be a primitive ' +\n        '(number|boolean|string)');\n  }\n  if (dtype === 'string' && isTypedArray(value) &&\n      !(value instanceof Uint8Array)) {\n    throw new Error(\n        'When making a scalar from encoded string, ' +\n        'the value must be `Uint8Array`.');\n  }\n  const shape: number[] = [];\n  const inferredShape: number[] = [];\n  return makeTensor(value, shape, inferredShape, dtype) as Scalar;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Sqrt, SqrtInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes square root of the input `tf.Tensor` element-wise: `y = sqrt(x)`\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 4, -1]);\n *\n * x.sqrt().print();  // or tf.sqrt(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction sqrt_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'sqrt', 'float32');\n\n  const inputs: SqrtInputs = {x: $x};\n\n  return ENGINE.runKernel(Sqrt, inputs as unknown as NamedTensorMap);\n}\nexport const sqrt = /* @__PURE__ */ op({sqrt_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {op} from './operation';\n\n/**\n * Computes square of `x` element-wise: `x ^ 2`\n *\n * ```js\n * const x = tf.tensor1d([1, 2, Math.sqrt(2), -1]);\n *\n * x.square().print();  // or tf.square(x)\n * ```\n * @param x The input Tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction square_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'square');\n  const attrs = {};\n  return ENGINE.runKernel('Square', {x: $x}, attrs);\n}\n\nexport const square = /* @__PURE__ */ op({square_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Sum, SumAttrs, SumInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {cast} from './cast';\nimport {op} from './operation';\n\n/**\n * Computes the sum of elements across dimensions of a `tf.Tensor`.\n *\n * Reduces the input along the dimensions given in `axes`. Unless `keepDims`\n * is true, the rank of the `tf.Tensor` is reduced by 1 for each entry in\n * `axes`. If `keepDims` is true, the reduced dimensions are retained with\n * length 1. If axes has no entries, all dimensions are reduced, and a\n * `tf.Tensor` with a single element is returned.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3]);\n *\n * x.sum().print();  // or tf.sum(x)\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * const axis = 1;\n * x.sum(axis).print();  // or tf.sum(x, axis)\n * ```\n *\n * @param x The input tensor to compute the sum over. If the dtype is `bool`\n *   it will be converted to `int32` and the output dtype will be `int32`.\n * @param axis The dimension(s) to reduce. By default it reduces\n *     all dimensions.\n * @param keepDims If true, retains reduced dimensions with size 1.\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction sum_<T extends Tensor>(\n    x: Tensor|TensorLike, axis: number|number[] = null, keepDims = false): T {\n  let $x = convertToTensor(x, 'x', 'sum');\n  if ($x.dtype === 'bool') {\n    $x = cast($x, 'int32');\n  }\n\n  const inputs: SumInputs = {x: $x};\n  const attrs: SumAttrs = {axis, keepDims};\n\n  return ENGINE.runKernel(\n      Sum, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const sum = /* @__PURE__ */ op({sum_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {parseAxisParam} from '../util';\n\nimport {abs} from './abs';\nimport * as axis_util from './axis_util';\nimport {max} from './max';\nimport {min} from './min';\nimport {op} from './operation';\nimport {pow} from './pow';\nimport {reshape} from './reshape';\nimport {scalar} from './scalar';\nimport {sqrt} from './sqrt';\nimport {square} from './square';\nimport {sum} from './sum';\n\n/**\n * Computes the norm of scalar, vectors, and matrices.\n * This function can compute several different vector norms (the 1-norm, the\n * Euclidean or 2-norm, the inf-norm, and in general the p-norm for p > 0)\n * and matrix norms (Frobenius, 1-norm, and inf-norm).\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n *\n * x.norm().print();  // or tf.norm(x)\n * ```\n *\n * @param x The input array.\n * @param ord Optional. Order of the norm. Supported norm types are\n * following:\n *\n *  | ord        | norm for matrices         | norm for vectors\n *  |------------|---------------------------|---------------------\n *  |'euclidean' |Frobenius norm             |2-norm\n *  |'fro'       |Frobenius norm\t           |\n *  |Infinity    |max(sum(abs(x), axis=1))   |max(abs(x))\n *  |-Infinity   |min(sum(abs(x), axis=1))   |min(abs(x))\n *  |1           |max(sum(abs(x), axis=0))   |sum(abs(x))\n *  |2           |                           |sum(abs(x)^2)^(1/2)\n *\n * @param axis Optional. If axis is null (the default), the input is\n * considered a vector and a single vector norm is computed over the entire\n * set of values in the Tensor, i.e. norm(x, ord) is equivalent\n * to norm(x.reshape([-1]), ord). If axis is an integer, the input\n * is considered a batch of vectors, and axis determines the axis in x\n * over which to compute vector norms. If axis is a 2-tuple of integer it is\n * considered a batch of matrices and axis determines the axes in NDArray\n * over which to compute a matrix norm.\n * @param keepDims Optional. If true, the norm has the same dimensionality\n * as the input.\n *\n * @doc {heading: 'Operations', subheading: 'Matrices'}\n */\nfunction norm_(\n    x: Tensor|TensorLike, ord: number|'euclidean'|'fro' = 'euclidean',\n    axis: number|number[] = null, keepDims = false): Tensor {\n  x = convertToTensor(x, 'x', 'norm');\n\n  const norm = normImpl(x, ord, axis);\n  let keepDimsShape = norm.shape;\n  if (keepDims) {\n    const axes = parseAxisParam(axis, x.shape);\n    keepDimsShape = axis_util.expandShapeToKeepDim(norm.shape, axes);\n  }\n  return reshape(norm, keepDimsShape);\n}\n\nfunction normImpl(\n    x: Tensor, p: number|string, axis: number|number[] = null): Tensor {\n  if (x.rank === 0) {\n    return abs(x);\n  }\n\n  // consider vector when no axis is specified\n  if (x.rank !== 1 && axis === null) {\n    return normImpl(reshape(x, [-1]), p, axis);\n  }\n\n  // vector\n  if (x.rank === 1 || typeof axis === 'number' ||\n      Array.isArray(axis) && axis.length === 1) {\n    if (p === 1) {\n      return sum(abs(x), axis);\n    }\n    if (p === Infinity) {\n      return max(abs(x), axis);\n    }\n    if (p === -Infinity) {\n      return min(abs(x), axis);\n    }\n    if (p === 'euclidean' || p === 2) {\n      // norm(x, 2) = sum(abs(xi) ^ 2) ^ 1/2\n      return sqrt(sum(pow(abs(x), scalar(2, 'int32')), axis));\n    }\n\n    throw new Error(`Error in norm: invalid ord value: ${p}`);\n  }\n\n  // matrix (assumption axis[0] < axis[1])\n  if (Array.isArray(axis) && axis.length === 2) {\n    if (p === 1) {\n      return max(sum(abs(x), axis[0]), axis[1] - 1);\n    }\n    if (p === Infinity) {\n      return max(sum(abs(x), axis[1]), axis[0]);\n    }\n    if (p === -Infinity) {\n      return min(sum(abs(x), axis[1]), axis[0]);\n    }\n    if (p === 'fro' || p === 'euclidean') {\n      // norm(x) = sqrt(sum(pow(x, 2)))\n      return sqrt(sum(square(x), axis));\n    }\n\n    throw new Error(`Error in norm: invalid ord value: ${p}`);\n  }\n\n  throw new Error(`Error in norm: invalid axis: ${axis}`);\n}\n\nexport const norm = /* @__PURE__ */ op({norm_});\n", "/**\n * @license\n * Copyright 2022 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {TensorLike} from '../types';\n\nimport {norm} from './norm';\nimport {op} from './operation';\n\n/**\n * Computes the Euclidean norm of scalar, vectors, and matrices.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n *\n * x.euclideanNorm().print();  // or tf.euclideanNorm(x)\n * ```\n *\n * @param x The input array.\n * @param axis Optional. If axis is null (the default), the input is\n * considered a vector and a single vector norm is computed over the entire\n * set of values in the Tensor, i.e. euclideanNorm(x) is equivalent\n * to euclideanNorm(x.reshape([-1])). If axis is an integer, the input\n * is considered a batch of vectors, and axis determines the axis in x\n * over which to compute vector norms. If axis is a 2-tuple of integer it is\n * considered a batch of matrices and axis determines the axes in NDArray\n * over which to compute a matrix norm.\n * @param keepDims Optional. If true, the norm has the same dimensionality\n * as the input.\n *\n * @doc {heading: 'Operations', subheading: 'Matrices'}\n */\nfunction euclideanNorm_(\n    x: Tensor|TensorLike, axis: number|number[] = null,\n    keepDims = false): Tensor {\n  return norm(x, 'euclidean', axis, keepDims);\n}\n\nexport const euclideanNorm = /* @__PURE__ */ op({euclideanNorm_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Exp, ExpInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes exponential of the input `tf.Tensor` element-wise. `e ^ x`\n *\n * ```js\n * const x = tf.tensor1d([1, 2, -3]);\n *\n * x.exp().print();  // or tf.exp(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction exp_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'exp');\n\n  const inputs: ExpInputs = {x: $x};\n  return ENGINE.runKernel(Exp, inputs as unknown as NamedTensorMap);\n}\nexport const exp = /* @__PURE__ */ op({exp_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {ExpandDims, ExpandDimsAttrs, ExpandDimsInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Returns a `tf.Tensor` that has expanded rank, by inserting a dimension\n * into the tensor's shape.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n * const axis = 1;\n * x.expandDims(axis).print();\n * ```\n *\n * @param x The input tensor whose dimensions are to be expanded.\n * @param axis The dimension index at which to insert shape of `1`. Defaults\n *     to 0 (the first dimension).\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction expandDims_<T extends Tensor>(x: Tensor|TensorLike, axis = 0): T {\n  const $x = convertToTensor(x, 'x', 'expandDims', 'string_or_numeric');\n\n  util.assert(axis <= $x.rank, () => 'Axis must be <= rank of the tensor');\n\n  const inputs: ExpandDimsInputs = {input: $x};\n  const attrs: ExpandDimsAttrs = {dim: axis};\n\n  return ENGINE.runKernel(\n      ExpandDims, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const expandDims = /* @__PURE__ */ op({expandDims_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Expm1, Expm1Inputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes exponential of the input `tf.Tensor` minus one element-wise.\n * `e ^ x - 1`\n *\n * ```js\n * const x = tf.tensor1d([1, 2, -3]);\n *\n * x.expm1().print();  // or tf.expm1(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction expm1_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'expm1');\n\n  const inputs: Expm1Inputs = {x: $x};\n  return ENGINE.runKernel(Expm1, inputs as unknown as NamedTensorMap);\n}\nexport const expm1 = /* @__PURE__ */ op({expm1_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Tile, TileAttrs, TileInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Construct a tensor by repeating it the number of times given by reps.\n *\n * This operation creates a new tensor by replicating `input` `reps`\n * times. The output tensor's `i`th dimension has `input.shape[i] *\n * reps[i]` elements, and the values of `input` are replicated\n * `reps[i]` times along the `i`th dimension. For example, tiling\n * `[a, b, c, d]` by `[2]` produces `[a, b, c, d, a, b, c, d]`.\n *\n * ```js\n * const a = tf.tensor1d([1, 2]);\n *\n * a.tile([2]).print();    // or tf.tile(a, [2])\n * ```\n *\n * ```js\n * const a = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * a.tile([1, 2]).print();  // or tf.tile(a, [1,2])\n * ```\n * @param x The tensor to tile.\n * @param reps Determines the number of replications per dimension.\n *\n * @doc {heading: 'Tensors', subheading: 'Slicing and Joining'}\n */\nfunction tile_<T extends Tensor>(x: T|TensorLike, reps: number[]): T {\n  const $x = convertToTensor(x, 'x', 'tile', 'string_or_numeric');\n  util.assert(\n      $x.rank === reps.length,\n      () => `Error in transpose: rank of input ${$x.rank} ` +\n          `must match length of reps ${reps}.`);\n\n  const inputs: TileInputs = {x: $x};\n  const attrs: TileAttrs = {reps};\n\n  return ENGINE.runKernel(\n      Tile, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const tile = /* @__PURE__ */ op({tile_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor2D} from '../tensor';\nimport {DataType} from '../types';\n\nimport {buffer} from './buffer';\nimport {expandDims} from './expand_dims';\nimport {op} from './operation';\nimport {reshape} from './reshape';\nimport {tile} from './tile';\n\n/**\n * Create an identity matrix.\n *\n * @param numRows Number of rows.\n * @param numColumns Number of columns. Defaults to `numRows`.\n * @param batchShape If provided, will add the batch shape to the beginning\n *   of the shape of the returned `tf.Tensor` by repeating the identity\n *   matrix.\n * @param dtype Data type.\n * @returns Identity matrix of the specified size and data type, possibly\n *   with batch repetition if `batchShape` is specified.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction eye_(\n    numRows: number, numColumns?: number,\n    batchShape?:\n        [\n          number\n        ]|[number,\n           number]|[number, number, number]|[number, number, number, number],\n    dtype: DataType = 'float32'): Tensor2D {\n  if (numColumns == null) {\n    numColumns = numRows;\n  }\n  const buff = buffer([numRows, numColumns], dtype);\n  const n = numRows <= numColumns ? numRows : numColumns;\n  for (let i = 0; i < n; ++i) {\n    buff.set(1, i, i);\n  }\n  const out: Tensor2D = reshape(buff.toTensor(), [numRows, numColumns]);\n  if (batchShape == null) {\n    return out;\n  } else {\n    if (batchShape.length === 1) {\n      return tile(expandDims(out, 0), [batchShape[0], 1, 1]) as Tensor2D;\n    } else if (batchShape.length === 2) {\n      // tslint:disable-next-line:no-unnecessary-type-assertion\n      return tile(\n                 expandDims(expandDims(out, 0), 0),\n                 [batchShape[0], batchShape[1], 1, 1]) as Tensor2D;\n    } else if (batchShape.length === 3) {\n      // tslint:disable-next-line:no-unnecessary-type-assertion\n      return tile(expandDims(expandDims(expandDims(out, 0), 0), 0), [\n               batchShape[0], batchShape[1], batchShape[2], 1, 1\n             ]) as Tensor2D;\n    } else {\n      throw new Error(\n          `eye() currently supports only 1D and 2D ` +\n          // tslint:disable-next-line:no-any\n          `batchShapes, but received ${(batchShape as any).length}D.`);\n    }\n  }\n}\n\nexport const eye = /* @__PURE__ */ op({eye_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Floor, FloorInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes floor of input `tf.Tensor` element-wise: `floor(x)`.\n *\n * ```js\n * const x = tf.tensor1d([.6, 1.1, -3.3]);\n *\n * x.floor().print();  // or tf.floor(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction floor_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'floor', 'float32');\n\n  const inputs: FloorInputs = {x: $x};\n  return ENGINE.runKernel(Floor, inputs as unknown as NamedTensorMap);\n}\nexport const floor = /* @__PURE__ */ op({floor_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {GatherV2, GatherV2Attrs, GatherV2Inputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Gather slices from tensor `x`'s axis `axis` according to `indices`.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n * const indices = tf.tensor1d([1, 3, 3], 'int32');\n *\n * x.gather(indices).print();\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n * const indices = tf.tensor1d([1, 1, 0], 'int32');\n *\n * x.gather(indices).print();\n * ```\n * @param x The input tensor whose slices are to be gathered.\n * @param indices The indices of the values to extract.\n * @param axis The axis over which to select values. Defaults to 0.\n * @param batchDims Optional. The number of batch dimensions. It must be less\n *     than or equal to rank(indices). Defaults to 0.\n *     The output tensor will have shape of\n *     `x.shape[:axis] + indices.shape[batchDims:] + x.shape[axis + 1:]`\n *\n * @doc {heading: 'Tensors', subheading: 'Slicing and Joining'}\n */\nfunction gather_<T extends Tensor>(\n    x: T|TensorLike, indices: Tensor|TensorLike, axis = 0, batchDims = 0): T {\n  const $x = convertToTensor(x, 'x', 'gather');\n  const $indices = convertToTensor(indices, 'indices', 'gather', 'int32');\n\n  const inputs: GatherV2Inputs = {x: $x, indices: $indices};\n  const attrs: GatherV2Attrs = {axis, batchDims};\n\n  return ENGINE.runKernel(\n      GatherV2, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const gather = /* @__PURE__ */ op({gather_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Greater, GreaterInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {op} from './operation';\n\n/**\n * Returns the truth value of (a > b) element-wise. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3]);\n * const b = tf.tensor1d([2, 2, 2]);\n *\n * a.greater(b).print();\n * ```\n *\n * @param a The first input tensor.\n * @param b The second input tensor. Must have the same dtype as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction greater_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'greater', 'string_or_numeric');\n  let $b = convertToTensor(b, 'b', 'greater', 'string_or_numeric');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: GreaterInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(Greater, inputs as unknown as NamedTensorMap);\n}\n\nexport const greater = /* @__PURE__ */ op({greater_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {GreaterEqual, GreaterEqualInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {op} from './operation';\n\n/**\n * Returns the truth value of (a >= b) element-wise. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3]);\n * const b = tf.tensor1d([2, 2, 2]);\n *\n * a.greaterEqual(b).print();\n * ```\n *\n * @param a The first input tensor.\n * @param b The second input tensor. Must have the same dtype as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction greaterEqual_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'greaterEqual', 'string_or_numeric');\n  let $b = convertToTensor(b, 'b', 'greaterEqual', 'string_or_numeric');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: GreaterEqualInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(GreaterEqual, inputs as unknown as NamedTensorMap);\n}\n\nexport const greaterEqual = /* @__PURE__ */ op({greaterEqual_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Imag, ImagInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {op} from './operation';\n/**\n * Returns the imaginary part of a complex (or real) tensor.\n *\n * Given a tensor input, this operation returns a tensor of type float that is\n * the imaginary part of each element in input considered as a complex number.\n * If input is real, a tensor of all zeros is returned.\n *\n * ```js\n * const x = tf.complex([-2.25, 3.25], [4.75, 5.75]);\n * tf.imag(x).print();\n * ```\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction imag_<T extends Tensor>(input: T|TensorLike): T {\n  const $input = convertToTensor(input, 'input', 'imag');\n\n  const inputs: ImagInputs = {input: $input};\n  return ENGINE.runKernel(Imag, inputs as unknown as NamedTensorMap);\n}\n\nexport const imag = /* @__PURE__ */ op({imag_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {IsFinite, IsFiniteInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Returns which elements of x are finite.\n *\n * ```js\n * const x = tf.tensor1d([NaN, Infinity, -Infinity, 0, 1]);\n *\n * x.isFinite().print();  // or tf.isNaN(x)\n * ```\n * @param x The input Tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction isFinite_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'isFinite');\n\n  const inputs: IsFiniteInputs = {x: $x};\n\n  return ENGINE.runKernel(IsFinite, inputs as unknown as NamedTensorMap);\n}\nexport const isFinite = /* @__PURE__ */ op({isFinite_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {IsInf, IsInfInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Returns which elements of x are Infinity or -Infinity.\n *\n * ```js\n * const x = tf.tensor1d([NaN, Infinity, -Infinity, 0, 1]);\n *\n * x.isInf().print();  // or tf.isNaN(x)\n * ```\n * @param x The input Tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction isInf_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'isInf');\n\n  const inputs: IsInfInputs = {x: $x};\n\n  return ENGINE.runKernel(IsInf, inputs as unknown as NamedTensorMap);\n}\nexport const isInf = /* @__PURE__ */ op({isInf_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {IsNan, IsNanInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Returns which elements of x are NaN.\n *\n * ```js\n * const x = tf.tensor1d([NaN, Infinity, -Infinity, 0, 1]);\n *\n * x.isNaN().print();  // or tf.isNaN(x)\n * ```\n * @param x The input Tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction isNaN_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'isNaN');\n  const inputs: IsNanInputs = {x: $x};\n\n  return ENGINE.runKernel(IsNan, inputs as unknown as NamedTensorMap);\n}\nexport const isNaN = /* @__PURE__ */ op({isNaN_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {LeakyRelu, LeakyReluAttrs, LeakyReluInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes leaky rectified linear element-wise.\n *\n * See\n * [http://web.stanford.edu/~awni/papers/relu_hybrid_icml2013_final.pdf](\n *     http://web.stanford.edu/~awni/papers/relu_hybrid_icml2013_final.pdf)\n *\n * ```js\n * const x = tf.tensor1d([-1, 2, -3, 4]);\n *\n * x.leakyRelu(0.1).print();  // or tf.leakyRelu(x, 0.1)\n * ```\n * @param x The input tensor.\n * @param alpha The scaling factor for negative values, defaults to 0.2.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction leakyRelu_<T extends Tensor>(x: T|TensorLike, alpha = 0.2): T {\n  const $x = convertToTensor(x, 'x', 'leakyRelu');\n\n  const inputs: LeakyReluInputs = {x: $x};\n  const attrs: LeakyReluAttrs = {alpha};\n\n  return ENGINE.runKernel(\n      LeakyRelu, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const leakyRelu = /* @__PURE__ */ op({leakyRelu_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Less, LessInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {op} from './operation';\n\n/**\n * Returns the truth value of (a < b) element-wise. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3]);\n * const b = tf.tensor1d([2, 2, 2]);\n *\n * a.less(b).print();\n * ```\n * @param a The first input tensor.\n * @param b The second input tensor. Must have the same dtype as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction less_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'less', 'string_or_numeric');\n  let $b = convertToTensor(b, 'b', 'less', 'string_or_numeric');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: LessInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(Less, inputs as unknown as NamedTensorMap);\n}\n\nexport const less = /* @__PURE__ */ op({less_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {LessEqual, LessEqualInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {op} from './operation';\n\n/**\n * Returns the truth value of (a <= b) element-wise. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3]);\n * const b = tf.tensor1d([2, 2, 2]);\n *\n * a.lessEqual(b).print();\n * ```\n *\n * @param a The first input tensor.\n * @param b The second input tensor. Must have the same dtype as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction lessEqual_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'lessEqual', 'string_or_numeric');\n  let $b = convertToTensor(b, 'b', 'lessEqual', 'string_or_numeric');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: LessEqualInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(LessEqual, inputs as unknown as NamedTensorMap);\n}\n\nexport const lessEqual = /* @__PURE__ */ op({lessEqual_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {LinSpace, LinSpaceAttrs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor1D} from '../tensor';\n\n/**\n * Return an evenly spaced sequence of numbers over the given interval.\n *\n * ```js\n * tf.linspace(0, 9, 10).print();\n * ```\n * @param start The start value of the sequence.\n * @param stop The end value of the sequence.\n * @param num The number of values to generate.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function linspace(start: number, stop: number, num: number): Tensor1D {\n  if (num <= 0) {\n    throw new Error('The number of values should be positive.');\n  }\n\n  const attrs: LinSpaceAttrs = {start, stop, num};\n  return ENGINE.runKernel(LinSpace, {}, attrs as unknown as NamedAttrMap);\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {LRN, LRNAttrs, LRNInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Normalizes the activation of a local neighborhood across or within\n * channels.\n *\n * @param x The input tensor. The 4-D input tensor is treated as a 3-D array\n *     of 1D vectors (along the last dimension), and each vector is\n *     normalized independently.\n * @param depthRadius The number of adjacent channels in the 1D normalization\n *     window.\n * @param bias A constant bias term for the basis.\n * @param alpha A scale factor, usually positive.\n * @param beta An exponent.\n *\n * @doc {heading: 'Operations', subheading: 'Normalization'}\n */\nfunction localResponseNormalization_<T extends Tensor3D|Tensor4D>(\n    x: T|TensorLike, depthRadius = 5, bias = 1, alpha = 1, beta = 0.5): T {\n  const $x = convertToTensor(x, 'x', 'localResponseNormalization');\n  util.assert(\n      $x.rank === 4 || $x.rank === 3,\n      () => `Error in localResponseNormalization: x must be rank 3 or 4 but got\n               rank ${$x.rank}.`);\n  util.assert(\n      util.isInt(depthRadius),\n      () => `Error in localResponseNormalization: depthRadius must be an ` +\n          `integer but got depthRadius ${depthRadius}.`);\n\n  let x4D = $x as Tensor4D;\n  let reshapedTo4D = false;\n  if ($x.rank === 3) {\n    reshapedTo4D = true;\n    x4D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2]]);\n  }\n\n  const inputs: LRNInputs = {x: x4D};\n\n  const attrs: LRNAttrs = {depthRadius, bias, alpha, beta};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  LRN, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  } else {\n    return res;\n  }\n}\n\nexport const localResponseNormalization = /* @__PURE__ */ op({localResponseNormalization_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Log, LogInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes natural logarithm of the input `tf.Tensor` element-wise: `ln(x)`\n *\n * ```js\n * const x = tf.tensor1d([1, 2, Math.E]);\n *\n * x.log().print();  // or tf.log(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction log_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'log', 'float32');\n\n  const inputs: LogInputs = {x: $x};\n  return ENGINE.runKernel(Log, inputs as unknown as NamedTensorMap);\n}\nexport const log = /* @__PURE__ */ op({log_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Log1p, Log1pInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes natural logarithm of the input `tf.Tensor` plus one\n * element-wise: `ln(1 + x)`\n *\n * ```js\n * const x = tf.tensor1d([1, 2, Math.E - 1]);\n *\n * x.log1p().print();  // or tf.log1p(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction log1p_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'log1p');\n\n  const inputs: Log1pInputs = {x: $x};\n  return ENGINE.runKernel(Log1p, inputs as unknown as NamedTensorMap);\n}\nexport const log1p = /* @__PURE__ */ op({log1p_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {CustomGradientFunc, ENGINE} from './engine';\nimport {Scalar, Tensor, Variable} from './tensor';\nimport {NamedTensorMap} from './tensor_types';\nimport {convertToTensor, convertToTensorArray} from './tensor_util_env';\nimport {TensorLike} from './types';\nimport * as util from './util';\n\n/**\n * Provided `f(x)`, returns another function `g(x, dy?)`, which gives the\n * gradient of `f(x)` with respect to `x`.\n *\n * If `dy` is provided, the gradient of `f(x).mul(dy).sum()` with respect to\n * `x` is computed instead. `f(x)` must take a single tensor `x` and return a\n * single tensor `y`. If `f()` takes multiple inputs, use `tf.grads` instead.\n *\n * ```js\n * // f(x) = x ^ 2\n * const f = x => x.square();\n * // f'(x) = 2x\n * const g = tf.grad(f);\n *\n * const x = tf.tensor1d([2, 3]);\n * g(x).print();\n * ```\n *\n * ```js\n * // f(x) = x ^ 3\n * const f = x => x.pow(tf.scalar(3, 'int32'));\n * // f'(x) = 3x ^ 2\n * const g = tf.grad(f);\n * // f''(x) = 6x\n * const gg = tf.grad(g);\n *\n * const x = tf.tensor1d([2, 3]);\n * gg(x).print();\n * ```\n *\n * @param f The function f(x), to compute gradient for.\n *\n * @doc {heading: 'Training', subheading: 'Gradients'}\n */\nfunction grad(f: (x: Tensor) => Tensor): (\n    x: TensorLike|Tensor, dy?: TensorLike|Tensor) => Tensor {\n  util.assert(\n      util.isFunction(f), () => 'The f passed in grad(f) must be a function');\n  return (x: TensorLike|Tensor, dy?: TensorLike|Tensor): Tensor => {\n    // x can be of any dtype, thus null as the last argument.\n    const $x = convertToTensor(x, 'x', 'tf.grad', 'string_or_numeric');\n    const $dy: Tensor =\n        (dy != null) ? convertToTensor(dy, 'dy', 'tf.grad') : null;\n    return ENGINE.tidy(() => {\n      const {value, grads} = ENGINE.gradients(() => f($x), [$x], $dy);\n      if ($dy != null) {\n        util.assertShapesMatch(\n            value.shape, $dy.shape,\n            'The shape of dy passed in grad(f)(x, dy) must match the shape ' +\n                'returned by f(x)');\n      }\n      checkGrads(grads);\n      return grads[0];\n    });\n  };\n}\n\n/**\n * Provided `f(x1, x2,...)`, returns another function `g([x1, x2,...], dy?)`,\n * which gives an array of gradients of `f()` with respect to each input\n * [`x1`,`x2`,...].\n *\n * If `dy` is passed when calling `g()`, the gradient of\n * `f(x1,...).mul(dy).sum()` with respect to each input is computed instead.\n * The provided `f` must take one or more tensors and return a single tensor\n * `y`. If `f()` takes a single input, we recommend using `tf.grad` instead.\n *\n * ```js\n * // f(a, b) = a * b\n * const f = (a, b) => a.mul(b);\n * // df / da = b, df / db = a\n * const g = tf.grads(f);\n *\n * const a = tf.tensor1d([2, 3]);\n * const b = tf.tensor1d([-2, -3]);\n * const [da, db] = g([a, b]);\n * console.log('da');\n * da.print();\n * console.log('db');\n * db.print();\n * ```\n *\n * @param f The function `f(x1, x2,...)` to compute gradients for.\n *\n * @doc {heading: 'Training', subheading: 'Gradients'}\n */\nfunction grads(f: (...args: Tensor[]) => Tensor): (\n    args: Array<Tensor|TensorLike>, dy?: Tensor|TensorLike) => Tensor[] {\n  util.assert(\n      util.isFunction(f), () => 'The f passed in grads(f) must be a function');\n  return (args: Array<Tensor|TensorLike>, dy?: Tensor|TensorLike): Tensor[] => {\n    util.assert(\n        Array.isArray(args),\n        () => 'The args passed in grads(f)(args) must be an array ' +\n            'of `Tensor`s or `TensorLike`s');\n    // args can be of any dtype, thus null as the last argument.\n    const $args =\n        convertToTensorArray(args, 'args', 'tf.grads', 'string_or_numeric');\n    const $dy: Tensor =\n        (dy != null) ? convertToTensor(dy, 'dy', 'tf.grads') : null;\n    return ENGINE.tidy(() => {\n      const {value, grads} = ENGINE.gradients(() => f(...$args), $args, $dy);\n      if ($dy != null) {\n        util.assertShapesMatch(\n            value.shape, $dy.shape,\n            'The shape of dy passed in grads(f)([x1,...], dy) must ' +\n                'match the shape returned by f([x1,...])');\n      }\n      checkGrads(grads);\n      return grads;\n    });\n  };\n}\n\n/**\n * Like `tf.grad`, but also returns the value of `f()`. Useful when `f()`\n * returns a metric you want to show.\n *\n * The result is a rich object with the following properties:\n * - grad: The gradient of `f(x)` w.r.t. `x` (result of `tf.grad`).\n * - value: The value returned by `f(x)`.\n *\n * ```js\n * // f(x) = x ^ 2\n * const f = x => x.square();\n * // f'(x) = 2x\n * const g = tf.valueAndGrad(f);\n *\n * const x = tf.tensor1d([2, 3]);\n * const {value, grad} = g(x);\n *\n * console.log('value');\n * value.print();\n * console.log('grad');\n * grad.print();\n * ```\n *\n * @doc {heading: 'Training', subheading: 'Gradients'}\n */\nfunction valueAndGrad<I extends Tensor, O extends Tensor>(f: (x: I) => O): (\n    x: I, dy?: O) => {\n  value: O;\n  grad: I;\n} {\n  util.assert(\n      util.isFunction(f),\n      () => 'The f passed in valueAndGrad(f) must be a function');\n  return (x: I, dy?: O) => {\n    util.assert(\n        x instanceof Tensor,\n        () => 'The x passed in valueAndGrad(f)(x) must be a tensor');\n    util.assert(\n        dy == null || dy instanceof Tensor,\n        () => 'The dy passed in valueAndGrad(f)(x, dy) must be a tensor');\n    const {grads, value} = ENGINE.gradients(() => f(x), [x], dy);\n    checkGrads(grads);\n    return {grad: grads[0] as I, value};\n  };\n}\n\n/**\n * Like `tf.grads`, but returns also the value of `f()`. Useful when `f()`\n * returns a metric you want to show.\n *\n * The result is a rich object with the following properties:\n * - grads: The gradients of `f()` w.r.t. each input (result of `tf.grads`).\n * - value: The value returned by `f(x)`.\n *\n * ```js\n * // f(a, b) = a * b\n * const f = (a, b) => a.mul(b);\n * // df/da = b, df/db = a\n * const g = tf.valueAndGrads(f);\n *\n * const a = tf.tensor1d([2, 3]);\n * const b = tf.tensor1d([-2, -3]);\n * const {value, grads} = g([a, b]);\n *\n * const [da, db] = grads;\n *\n * console.log('value');\n * value.print();\n *\n * console.log('da');\n * da.print();\n * console.log('db');\n * db.print();\n * ```\n *\n * @doc {heading: 'Training', subheading: 'Gradients'}\n */\nfunction valueAndGrads<O extends Tensor>(f: (...args: Tensor[]) => O): (\n    args: Tensor[], dy?: O) => {\n  grads: Tensor[];\n  value: O;\n} {\n  util.assert(\n      util.isFunction(f),\n      () => 'The f passed in valueAndGrads(f) must be a function');\n  return (args: Tensor[], dy?: O) => {\n    util.assert(\n        Array.isArray(args) && args.every(arg => arg instanceof Tensor),\n        () => 'The args passed in valueAndGrads(f)(args) must be array of ' +\n            'tensors');\n    util.assert(\n        dy == null || dy instanceof Tensor,\n        () => 'The dy passed in valueAndGrads(f)(args, dy) must be a tensor');\n    const res = ENGINE.gradients(() => f(...args), args, dy);\n    if (dy != null) {\n      util.assertShapesMatch(\n          res.value.shape, dy.shape,\n          'The shape of dy passed in valueAndGrads(f)([x1,...], dy) must ' +\n              'match the shape returned by f([x1,...])');\n    }\n    checkGrads(res.grads);\n    return res;\n  };\n}\n\n/**\n * Computes and returns the gradient of f(x) with respect to the list of\n * trainable variables provided by `varList`. If no list is provided, it\n * defaults to all trainable variables.\n *\n * ```js\n * const a = tf.variable(tf.tensor1d([3, 4]));\n * const b = tf.variable(tf.tensor1d([5, 6]));\n * const x = tf.tensor1d([1, 2]);\n *\n * // f(a, b) = a * x ^ 2 + b * x\n * const f = () => a.mul(x.square()).add(b.mul(x)).sum();\n * // df/da = x ^ 2, df/db = x\n * const {value, grads} = tf.variableGrads(f);\n *\n * Object.keys(grads).forEach(varName => grads[varName].print());\n * ```\n *\n * @param f The function to execute. f() should return a scalar.\n * @param varList The list of variables to compute the gradients with respect\n *     to. Defaults to all trainable variables.\n * @returns An object with the following keys and values:\n *   - `value`: The value of the function `f`.\n *   - `grads`: A map from the names of the variables to the gradients.\n *     If the `varList` argument is provided explicitly and contains a subset of\n *     non-trainable variables, this map in the return value will contain keys\n *     that map the names of the non-trainable variables to `null`.\n *\n * @doc {heading: 'Training', subheading: 'Gradients'}\n */\nfunction variableGrads(f: () => Scalar, varList?: Variable[]):\n    {value: Scalar, grads: NamedTensorMap} {\n  util.assert(\n      util.isFunction(f),\n      () => 'The f passed in variableGrads(f) must be a function');\n  util.assert(\n      varList == null ||\n          Array.isArray(varList) && varList.every(v => v instanceof Variable),\n      () =>\n          'The varList passed in variableGrads(f, varList) must be an array ' +\n          'of variables');\n\n  const specifiedVarList = varList != null;\n  if (!specifiedVarList) {\n    // Get all of the trainable variables.\n    varList = [];\n    for (const varName in ENGINE.registeredVariables) {\n      varList.push(ENGINE.registeredVariables[varName]);\n    }\n  }\n\n  const specifiedNonTrainable: Variable[] =\n      specifiedVarList ? varList.filter(variable => !variable.trainable) : null;\n\n  // Prune non-trainable variables.\n  const originalVarCount = varList.length;\n  varList = varList.filter(variable => variable.trainable);\n  util.assert(\n      varList.length > 0,\n      () => `variableGrads() expects at least one of the input variables to ` +\n          `be trainable, but none of the ${originalVarCount} variables is ` +\n          `trainable.`);\n\n  const allowNoGradients = true;\n  const {value, grads} = ENGINE.gradients(f, varList, null, allowNoGradients);\n\n  util.assert(\n      grads.some(g => g != null),\n      () => 'Cannot find a connection between any variable and the result of ' +\n          'the loss function y=f(x). Please make sure the operations that ' +\n          'use variables are inside the function f passed to minimize().');\n  util.assert(\n      value.rank === 0,\n      () => `The f passed in variableGrads(f) must return a scalar, but it ` +\n          `returned a rank-${value.rank} tensor`);\n\n  const namedGrads: NamedTensorMap = {};\n  varList.forEach((v, i) => {\n    if (grads[i] != null) {\n      namedGrads[v.name] = grads[i];\n    }\n  });\n  if (specifiedNonTrainable != null) {\n    // If varList is explicitly provided and contains non-trainable values,\n    // add them to the returned gradients with `null` values.\n    specifiedNonTrainable.forEach(v => namedGrads[v.name] = null);\n  }\n  return {value, grads: namedGrads};\n}\n\n/**\n * Overrides the gradient computation of a function `f`.\n *\n * Takes a function\n * `f(...inputs, save) => {value: Tensor, gradFunc: (dy, saved) => Tensor[]}`\n * and returns another function `g(...inputs)` which takes the same inputs as\n * `f`. When called, `g` returns `f().value`. In backward mode, custom gradients\n * with respect to each input of `f` are computed using `f().gradFunc`.\n *\n * The `save` function passed to `f` should be used for saving tensors needed\n * in the gradient. And the `saved` passed to the `gradFunc` is a\n * `NamedTensorMap`, which contains those saved tensors.\n *\n * ```js\n * const customOp = tf.customGrad((x, save) => {\n *   // Save x to make sure it's available later for the gradient.\n *   save([x]);\n *   // Override gradient of our custom x ^ 2 op to be dy * abs(x);\n *   return {\n *     value: x.square(),\n *     // Note `saved.x` which points to the `x` we saved earlier.\n *     gradFunc: (dy, saved) => [dy.mul(saved[0].abs())]\n *   };\n * });\n *\n * const x = tf.tensor1d([-1, -2, 3]);\n * const dx = tf.grad(x => customOp(x));\n *\n * console.log(`f(x):`);\n * customOp(x).print();\n * console.log(`f'(x):`);\n * dx(x).print();\n * ```\n *\n * @param f The function to evaluate in forward mode, which should return\n *     `{value: Tensor, gradFunc: (dy, saved) => Tensor[]}`, where `gradFunc`\n *     returns the custom gradients of `f` with respect to its inputs.\n *\n * @doc {heading: 'Training', subheading: 'Gradients'}\n */\nfunction customGrad<T extends Tensor>(f: CustomGradientFunc<T>):\n    (...args: Tensor[]) => T {\n  return ENGINE.customGrad(f);\n}\n\nfunction checkGrads(grads: Tensor[]) {\n  const numNullGradients = grads.filter(g => g == null).length;\n  if (numNullGradients > 0) {\n    throw new Error(\n        `Cannot compute gradient of y=f(x) with respect to x. Make sure that\n    the f you passed encloses all operations that lead from x to y.`);\n  }\n}\n\nexport {\n  customGrad,\n  variableGrads,\n  valueAndGrad,\n  valueAndGrads,\n  grad,\n  grads,\n};\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Neg, NegInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes `-1 * x` element-wise.\n *\n * ```js\n * const x = tf.tensor2d([1, 2, -2, 0], [2, 2]);\n *\n * x.neg().print();  // or tf.neg(x)\n * ```\n *\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction neg_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'neg');\n\n  const inputs: NegInputs = {x: $x};\n  return ENGINE.runKernel(Neg, inputs as unknown as NamedTensorMap);\n}\nexport const neg = /* @__PURE__ */ op({neg_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Softplus, SoftplusInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes softplus of the input `tf.Tensor` element-wise: `log(exp(x) + 1)`\n *\n * ```js\n * const x = tf.tensor1d([0, 1, -1, .7]);\n *\n * x.softplus().print();  // or tf.softplus(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction softplus_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'softplus');\n\n  const inputs: SoftplusInputs = {x: $x};\n  return ENGINE.runKernel(Softplus, inputs as unknown as NamedTensorMap);\n}\nexport const softplus = /* @__PURE__ */ op({softplus_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {customGrad} from '../gradients';\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {mul} from './mul';\nimport {neg} from './neg';\nimport {op} from './operation';\nimport {sigmoid} from './sigmoid';\nimport {softplus} from './softplus';\n\n/**\n * Computes log sigmoid of the input `tf.Tensor` element-wise:\n * `logSigmoid(x)`. For numerical stability, we use `-tf.softplus(-x)`.\n *\n * ```js\n * const x = tf.tensor1d([0, 1, -1, .7]);\n *\n * x.logSigmoid().print();  // or tf.logSigmoid(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction logSigmoid_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'logSigmoid');\n\n  // Use a custom gradient to maintain previous implementation.\n  // There is no LogSigmoid kernel in TF so we can't use engine.runKernel\n  // directly\n  const customOp = customGrad((x: Tensor) => {\n    // TODO(yassogba) we can remove the chained softplus call here only\n    // after backends have modualrized softplus at which point we can call\n    // engine runKernel(..., Sotfplus, ...) directly.\n    const value = neg(softplus(neg(x)));\n\n    const gradFunc = (dy: T) => {\n      const derX = mul(dy, sigmoid(neg(x)));\n      return derX;\n    };\n    return {value, gradFunc};\n  });\n\n  return customOp($x) as T;\n}\nexport const logSigmoid = /* @__PURE__ */ op({logSigmoid_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Sub, SubInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Subtracts two `tf.Tensor`s element-wise, A - B. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([10, 20, 30, 40]);\n * const b = tf.tensor1d([1, 2, 3, 4]);\n *\n * a.sub(b).print();  // or tf.sub(a, b)\n * ```\n *\n * ```js\n * // Broadcast subtract a with b.\n * const a = tf.tensor1d([10, 20, 30, 40]);\n * const b = tf.scalar(5);\n *\n * a.sub(b).print();  // or tf.sub(a, b)\n * ```\n * @param a The first `tf.Tensor` to subtract from.\n * @param b The second `tf.Tensor` to be subtracted. Must have the same dtype as\n * `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction sub_<T extends Tensor>(a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'sub');\n  let $b = convertToTensor(b, 'b', 'sub');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  const inputs: SubInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(Sub, inputs as unknown as NamedTensorMap);\n}\n\nexport const sub = /* @__PURE__ */ op({sub_});\n", "/**\n * @license\n * Copyright 2020 Google Inc. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {customGrad} from '../gradients';\n\nimport {Tensor} from '../tensor';\nimport {GradSaveFunc} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {cast} from './cast';\nimport {exp} from './exp';\nimport {log} from './log';\nimport {max} from './max';\nimport {mul} from './mul';\nimport {op} from './operation';\nimport {sub} from './sub';\nimport {sum} from './sum';\n\n/**\n * Computes the log softmax.\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3]);\n *\n * a.logSoftmax().print();  // or tf.logSoftmax(a)\n * ```\n *\n * ```js\n * const a = tf.tensor2d([2, 4, 6, 1, 2, 3], [2, 3]);\n *\n * a.logSoftmax().print();  // or tf.logSoftmax(a)\n * ```\n *\n * @param logits The logits array.\n * @param axis The dimension softmax would be performed on. Defaults to `-1`\n *     which indicates the last dimension.\n *\n * @doc {heading: 'Operations', subheading: 'Normalization'}\n */\nfunction logSoftmax_<T extends Tensor>(logits: T|TensorLike, axis = -1): T {\n  const $logits = convertToTensor(logits, 'logits', 'logSoftmax');\n\n  if (axis === -1) {\n    axis = $logits.rank - 1;\n  }\n  if (axis !== $logits.rank - 1) {\n    throw Error(\n        'Log Softmax along a non-last dimension is not yet supported. ' +\n        `Logits was rank ${$logits.rank} and axis was ${axis}`);\n  }\n\n  // const forward: ForwardFunc<Tensor> = (backend, save) => {\n  //   const keepDims = true;\n  //   const xMax = max(logits, axis, true);\n  //   const shifted = sub(logits, xMax);\n  //   const value =\n  //       sub(cast(shifted, 'float32'), log(sum(exp(shifted), axis,\n  //       keepDims)));\n  //   save([value]);\n  //   return value;\n  // };\n\n  // Use a custom gradient for numerical stability.\n  const customOp = customGrad((logits: Tensor, save: GradSaveFunc) => {\n    const keepDims = true;\n    const xMax = max(logits, axis, true);\n    const shifted = sub(logits, xMax);\n    const value =\n        sub(cast(shifted, 'float32'), log(sum(exp(shifted), axis, keepDims)));\n    save([value]);\n\n    const gradFunc = (dy: Tensor, saved: Tensor[]) => {\n      const [value] = saved;\n      const keepDims = true;\n      const softmax = exp(value);\n      return sub(dy, mul(sum(dy, axis, keepDims), softmax));\n    };\n    return {value, gradFunc};\n  });\n\n  return customOp($logits) as T;\n\n  // TODO Use Engine.runKernel when CPU/WebGL/WASM backends implement this.\n  // const inputs: LogSoftmaxInputs = {logits: $logits};\n  // const attrs: LogSoftmaxAttrs = {axis};\n  // return ENGINE.runKernel(\n  //            LogSoftmax, inputs as unknown as NamedTensorMap,\n  //            attrs as unknown as NamedAttrMap);\n}\n\nexport const logSoftmax = /* @__PURE__ */ op({logSoftmax_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {parseAxisParam} from '../util';\n\nimport {add} from './add';\nimport {expandShapeToKeepDim} from './axis_util';\nimport {exp} from './exp';\nimport {log} from './log';\nimport {max} from './max';\nimport {op} from './operation';\nimport {reshape} from './reshape';\nimport {sub} from './sub';\nimport {sum} from './sum';\n\n/**\n * Computes the log(sum(exp(elements across the reduction dimensions))).\n *\n * Reduces the input along the dimensions given in `axis`. Unless `keepDims`\n * is true, the rank of the array is reduced by 1 for each entry in `axis`.\n * If `keepDims` is true, the reduced dimensions are retained with length 1.\n * If `axis` has no entries, all dimensions are reduced, and an array with a\n * single element is returned.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3]);\n *\n * x.logSumExp().print();  // or tf.logSumExp(x)\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * const axis = 1;\n * x.logSumExp(axis).print();  // or tf.logSumExp(a, axis)\n * ```\n * @param x The input tensor.\n * @param axis The dimension(s) to reduce. If null (the default),\n *     reduces all dimensions.\n * @param keepDims If true, retains reduced dimensions with length\n *     of 1. Defaults to false.\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction logSumExp_<T extends Tensor>(\n    x: Tensor|TensorLike, axis: number|number[] = null, keepDims = false): T {\n  const $x = convertToTensor(x, 'x', 'logSumExp');\n\n  const axes = parseAxisParam(axis, $x.shape);\n  const xMax = max($x, axes, true /* keepDims */);\n  const a = sub($x, xMax);\n  const b = exp(a);\n  const c = sum(b, axes);\n  const d = log(c);\n  const res = add(reshape(xMax, d.shape), d);\n\n  if (keepDims) {\n    const newShape = expandShapeToKeepDim(res.shape, axes);\n    return reshape(res, newShape) as T;\n  }\n  return res as T;\n}\n\nexport const logSumExp = /* @__PURE__ */ op({logSumExp_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {LogicalAnd, LogicalAndInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {op} from './operation';\n\n/**\n * Returns the truth value of `a AND b` element-wise. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([false, false, true, true], 'bool');\n * const b = tf.tensor1d([false, true, false, true], 'bool');\n *\n * a.logicalAnd(b).print();\n * ```\n *\n * @param a The first input tensor. Must be of dtype bool.\n * @param b The second input tensor. Must be of dtype bool.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction logicalAnd_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  const $a = convertToTensor(a, 'a', 'logicalAnd', 'bool');\n  const $b = convertToTensor(b, 'b', 'logicalAnd', 'bool');\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: LogicalAndInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(LogicalAnd, inputs as unknown as NamedTensorMap);\n}\n\nexport const logicalAnd = /* @__PURE__ */ op({logicalAnd_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {LogicalNot, LogicalNotInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {op} from './operation';\n\n/**\n * Returns the truth value of `NOT x` element-wise.\n *\n * ```js\n * const a = tf.tensor1d([false, true], 'bool');\n *\n * a.logicalNot().print();\n * ```\n *\n * @param x The input tensor. Must be of dtype 'bool'.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction logicalNot_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'logicalNot', 'bool');\n  const inputs: LogicalNotInputs = {x: $x};\n  return ENGINE.runKernel(LogicalNot, inputs as unknown as NamedTensorMap);\n}\n\nexport const logicalNot = /* @__PURE__ */ op({logicalNot_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {LogicalOr, LogicalOrInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {op} from './operation';\n\n/**\n * Returns the truth value of `a OR b` element-wise. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([false, false, true, true], 'bool');\n * const b = tf.tensor1d([false, true, false, true], 'bool');\n *\n * a.logicalOr(b).print();\n * ```\n * @param a The first input tensor. Must be of dtype bool.\n * @param b The second input tensor. Must be of dtype bool.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction logicalOr_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  const $a = convertToTensor(a, 'a', 'logicalOr', 'bool');\n  const $b = convertToTensor(b, 'b', 'logicalOr', 'bool');\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: LogicalOrInputs = {a: $a, b: $b};\n  return ENGINE.runKernel(LogicalOr, inputs as unknown as NamedTensorMap);\n}\nexport const logicalOr = /* @__PURE__ */ op({logicalOr_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {logicalAnd} from './logical_and';\nimport {logicalNot} from './logical_not';\nimport {logicalOr} from './logical_or';\nimport {op} from './operation';\n\n/**\n * Returns the truth value of `a XOR b` element-wise. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([false, false, true, true], 'bool');\n * const b = tf.tensor1d([false, true, false, true], 'bool');\n *\n * a.logicalXor(b).print();\n * ```\n *\n * @param a The first input tensor. Must be of dtype bool.\n * @param b The second input tensor. Must be of dtype bool.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction logicalXor_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  const $a = convertToTensor(a, 'a', 'logicalXor', 'bool');\n  const $b = convertToTensor(b, 'b', 'logicalXor', 'bool');\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  // x ^ y = (x | y) & ~(x & y)\n  return logicalAnd(logicalOr(a, b), logicalNot(logicalAnd(a, b)));\n}\n\nexport const logicalXor = /* @__PURE__ */ op({logicalXor_});\n", "/**\n * @license\n * Copyright 2022 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {SearchSorted, SearchSortedAttrs, SearchSortedInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {sizeFromShape} from '../util_base';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\nconst INT32_MAX = 2147483648;\n/**\n * Searches for where a value would go in a sorted sequence.\n *\n * This is not a method for checking containment (like javascript in).\n *\n * The typical use case for this operation is \"binning\", \"bucketing\", or\n * \"discretizing\". The values are assigned to bucket-indices based on the edges\n * listed in 'sortedSequence'. This operation returns the bucket-index for each\n * value.\n *\n * The side argument controls which index is returned if a value lands exactly\n * on an edge.\n *\n * The axis is not settable for this operation. It always operates on the\n * innermost dimension (axis=-1). The operation will accept any number of outer\n * dimensions.\n *\n * Note: This operation assumes that 'sortedSequence' is sorted along the\n * innermost axis, maybe using 'sort(..., axis=-1)'. If the sequence is not\n * sorted no error is raised and the content of the returned tensor is not well\n * defined.\n *\n * ```js\n * const edges = tf.tensor1d([-1, 3.3, 9.1, 10.0]);\n * let values = tf.tensor1d([0.0, 4.1, 12.0]);\n * const result1 = tf.searchSorted(edges, values, 'left');\n * result1.print(); // [1, 2, 4]\n *\n * const seq = tf.tensor1d([0, 3, 9, 10, 10]);\n * values = tf.tensor1d([0, 4, 10]);\n * const result2 = tf.searchSorted(seq, values, 'left');\n * result2.print(); // [0, 2, 3]\n * const result3 = tf.searchSorted(seq, values, 'right');\n * result3.print(); // [1, 2, 5]\n *\n * const sortedSequence = tf.tensor2d([[0., 3., 8., 9., 10.],\n *                                     [1., 2., 3., 4., 5.]]);\n * values = tf.tensor2d([[9.8, 2.1, 4.3],\n *                       [0.1, 6.6, 4.5, ]]);\n * const result4 = tf.searchSorted(sortedSequence, values, 'left');\n * result4.print(); // [[4, 1, 2], [0, 5, 4]]\n * ```\n * @param sortedSequence: N-D. Sorted sequence.\n * @param values: N-D. Search values.\n * @param side: 'left'|'right'. Defaults to 'left'. 'left' corresponds to lower\n *     bound and 'right' to upper bound.\n * @return An N-D int32 tensor the size of values containing the result of\n *     applying either lower bound or upper bound (depending on side) to each\n *     value. The result is not a global index to the entire Tensor, but the\n *     index in the last dimension.\n * @doc {heading: 'Operations', subheading: 'Evaluation'}\n */\nfunction searchSorted_(\n    sortedSequence: Tensor|TensorLike, values: Tensor|TensorLike,\n    side: 'left'|'right' = 'left'): Tensor {\n  const $sortedSequence =\n      convertToTensor(sortedSequence, 'sortedSequence', 'searchSorted');\n  const $values = convertToTensor(values, 'values', 'searchSorted');\n\n  const sequenceSize = $sortedSequence.shape[$sortedSequence.shape.length - 1];\n  const valuesSize = $values.shape[$values.shape.length - 1];\n  const $sortedSequence2D = reshape($sortedSequence, [-1, sequenceSize]);\n  const $values2D = reshape($values, [-1, valuesSize]);\n\n  if ($sortedSequence2D.rank < 2) {\n    throw new Error(`Sorted input argument must be at least 2-dimensional`);\n  }\n  if ($sortedSequence2D.shape[0] !== $values2D.shape[0]) {\n    throw new Error(\n        `Leading dimension of 'sortedSequence' and 'values' must match.`);\n  }\n  if (sizeFromShape($values2D.shape) >= INT32_MAX) {\n    throw new Error(`values tensor size must less than ${INT32_MAX}`);\n  }\n  if ($sortedSequence2D.shape[1] >= INT32_MAX) {\n    throw new Error(`trailing dim_size must less than ${\n        INT32_MAX} for int32 output type, was ${$sortedSequence2D.shape[1]}`);\n  }\n\n  const inputs: SearchSortedInputs = {\n    sortedSequence: $sortedSequence2D,\n    values: $values2D,\n  };\n  const attrs: SearchSortedAttrs = {side};\n\n  return ENGINE.runKernel(SearchSorted, inputs as {}, attrs as {});\n}\n\nexport const searchSorted = /* @__PURE__ */ op({searchSorted_});\n", "/**\n * @license\n * Copyright 2022 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {TensorLike} from '../types';\nimport {searchSorted} from './search_sorted';\n\n/**\n * Searches for where a value would go in a sorted sequence.\n *\n * This is not a method for checking containment (like javascript in).\n *\n * The typical use case for this operation is \"binning\", \"bucketing\", or\n * \"discretizing\". The values are assigned to bucket-indices based on the edges\n * listed in 'sortedSequence'. This operation returns the bucket-index for each\n * value.\n *\n * The index returned corresponds to the first edge greater than or equal to the\n * value.\n *\n * The axis is not settable for this operation. It always operates on the\n * innermost dimension (axis=-1). The operation will accept any number of outer\n * dimensions.\n *\n * Note: This operation assumes that 'lowerBound' is sorted along the\n * innermost axis, maybe using 'sort(..., axis=-1)'. If the sequence is not\n * sorted no error is raised and the content of the returned tensor is not well\n * defined.\n *\n * ```js\n * const edges = tf.tensor1d([-1, 3.3, 9.1, 10.0]);\n * let values = tf.tensor1d([0.0, 4.1, 12.0]);\n * const result1 = tf.lowerBound(edges, values);\n * result1.print(); // [1, 2, 4]\n *\n * const seq = tf.tensor1d([0, 3, 9, 10, 10]);\n * values = tf.tensor1d([0, 4, 10]);\n * const result2 = tf.lowerBound(seq, values);\n * result2.print(); // [0, 2, 3]\n *\n * const sortedSequence = tf.tensor2d([[0., 3., 8., 9., 10.],\n *                                     [1., 2., 3., 4., 5.]]);\n * values = tf.tensor2d([[9.8, 2.1, 4.3],\n *                       [0.1, 6.6, 4.5, ]]);\n * const result3 = tf.lowerBound(sortedSequence, values);\n * result3.print(); // [[4, 1, 2], [0, 5, 4]]\n * ```\n * @param sortedSequence: N-D. Sorted sequence.\n * @param values: N-D. Search values.\n * @return An N-D int32 tensor the size of values containing the result of\n *     applying lower bound to each value. The result is not a global index to\n *     the entire Tensor, but the index in the last dimension.\n * @doc {heading: 'Operations', subheading: 'Evaluation'}\n */\nexport function lowerBound(\n    sortedSequence: Tensor|TensorLike, values: Tensor|TensorLike): Tensor {\n  return searchSorted(sortedSequence, values, 'left');\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {MaxPool, MaxPoolAttrs, MaxPoolInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport * as conv_util from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes the 2D max pooling of an image.\n *\n * @param x The input tensor, of rank 4 or rank 3 of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is assumed.\n * @param filterSize The filter size: `[filterHeight, filterWidth]`. If\n *     `filterSize` is a single number, then `filterHeight == filterWidth`.\n * @param strides The strides of the pooling: `[strideHeight, strideWidth]`. If\n *     `strides` is a single number, then `strideHeight == strideWidth`.\n * @param dilations The dilation rates: `[dilationHeight, dilationWidth]`\n *     in which we sample input values across the height and width dimensions\n *     in dilated pooling. Defaults to `[1, 1]`. If `dilations` is a single\n *     number, then `dilationHeight == dilationWidth`. If it is greater than\n *     1, then all values of `strides` must be 1.\n * @param pad The type of padding algorithm.\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n *    - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n */\nfunction maxPool_<T extends Tensor3D|Tensor4D>(\n    x: T|TensorLike, filterSize: [number, number]|number,\n    strides: [number, number]|number,\n    pad: 'valid'|'same'|number|conv_util.ExplicitPadding,\n    dimRoundingMode?: 'floor'|'round'|'ceil'): T {\n  const $x = convertToTensor(x, 'x', 'maxPool');\n  const dilations = 1;\n\n  let x4D = $x as Tensor4D;\n  let reshapedTo4D = false;\n  if ($x.rank === 3) {\n    reshapedTo4D = true;\n    x4D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2]]);\n  }\n\n  util.assert(\n      x4D.rank === 4,\n      () => `Error in maxPool: input must be rank 4 but got rank ${x4D.rank}.`);\n  util.assert(\n      conv_util.eitherStridesOrDilationsAreOne(strides, dilations),\n      () => 'Error in maxPool: Either strides or dilations must be 1. ' +\n          `Got strides ${strides} and dilations '${dilations}'`);\n  conv_util.checkPadOnDimRoundingMode('maxPool', pad, dimRoundingMode);\n  const inputs: MaxPoolInputs = {x: x4D};\n  const attrs: MaxPoolAttrs = {filterSize, strides, pad, dimRoundingMode};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  MaxPool, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n  return res;\n}\n\nexport const maxPool = /* @__PURE__ */ op({maxPool_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {MaxPool3D, MaxPool3DAttrs, MaxPool3DInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor4D, Tensor5D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {checkPadOnDimRoundingMode} from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes the 3D max pooling.\n *\n * ```js\n * const x = tf.tensor5d([1, 2, 3, 4, 5, 6, 7, 8], [1, 2, 2, 2, 1]);\n * const result = tf.maxPool3d(x, 2, 1, 'valid');\n * result.print();\n * ```\n *\n * @param x The input tensor, of rank 5 or rank 4 of shape\n *     `[batch, depth, height, width, inChannels]`.\n * @param filterSize The filter size:\n *     `[filterDepth, filterHeight, filterWidth]`.\n *     If `filterSize` is a single number,\n *     then `filterDepth == filterHeight == filterWidth`.\n * @param strides The strides of the pooling:\n *     `[strideDepth, strideHeight, strideWidth]`.\n *     If `strides` is a single number,\n *     then `strideDepth == strideHeight == strideWidth`.\n * @param pad The type of padding algorithm.\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1*1x1.\n *    - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n * @param dataFormat An optional string from: \"NDHWC\", \"NCDHW\". Defaults to\n *     \"NDHWC\". Specify the data format of the input and output data. With the\n *     default format \"NDHWC\", the data is stored in the order of: [batch,\n *     depth, height, width, channels]. Only \"NDHWC\" is currently supported.\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction maxPool3d_<T extends Tensor4D|Tensor5D>(\n    x: T|TensorLike, filterSize: [number, number, number]|number = [1, 1, 1],\n    strides: [number, number, number]|number, pad: 'valid'|'same'|number,\n    dimRoundingMode?: 'floor'|'round'|'ceil',\n    dataFormat: 'NDHWC'|'NCDHW' = 'NDHWC'): T {\n  const $x = convertToTensor(x, 'x', 'maxPool3d');\n\n  let x5D = $x as Tensor5D;\n  let reshapedTo5D = false;\n  if ($x.rank === 4) {\n    reshapedTo5D = true;\n    x5D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2], $x.shape[3]]);\n  }\n\n  util.assert(\n      x5D.rank === 5,\n      () => `Error in maxPool3d: x must be rank 5 but got rank ${x5D.rank}.`);\n  util.assert(\n      dataFormat === 'NDHWC',\n      () => `Error in maxPool3d: Only NDHWC is currently supported, ` +\n          `but got dataFormat of ${dataFormat}`);\n  checkPadOnDimRoundingMode('maxPool3d', pad, dimRoundingMode);\n  const inputs: MaxPool3DInputs = {x: x5D};\n  const attrs:\n      MaxPool3DAttrs = {filterSize, strides, pad, dimRoundingMode, dataFormat};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  MaxPool3D, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo5D) {\n    return reshape(\n               res, [res.shape[1], res.shape[2], res.shape[3], res.shape[4]]) as\n        T;\n  }\n\n  return res;\n}\n\nexport const maxPool3d = /* @__PURE__ */ op({maxPool3d_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {MaxPoolWithArgmax, MaxPoolWithArgmaxAttrs, MaxPoolWithArgmaxInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the 2D max pooling of an image with Argmax index.\n * The indices in argmax are flattened, so that a maximum value at position `[b,\n * y, x, c]` becomes flattened index: `(y * width + x) * channels + c` if\n * include_batch_in_index is False; `((b * height + y) * width + x) * channels\n * +c` if include_batch_in_index is True.\n *\n * The indices returned are always in `[0, height) x [0, width)` before\n * flattening.\n *\n * @param x The input tensor, of rank 4 or rank 3 of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is assumed.\n * @param filterSize The filter size: `[filterHeight, filterWidth]`. If\n *     `filterSize` is a single number, then `filterHeight == filterWidth`.\n * @param strides The strides of the pooling: `[strideHeight, strideWidth]`. If\n *     `strides` is a single number, then `strideHeight == strideWidth`.\n * @param dataFormat An optional string from: \"NDHWC\", \"NCDHW\". Defaults to\n *     \"NDHWC\". Specify the data format of the input and output data. With the\n *     default format \"NDHWC\", the data is stored in the order of: [batch,\n *     depth, height, width, channels]. Only \"NDHWC\" is currently supported.\n * @param pad The type of padding algorithm.\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n *    - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param includeBatchIndex Defaults to False. Whether to include batch\n *    dimension in flattened index of argmax.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction maxPoolWithArgmax_<T extends Tensor4D>(\n    x: T|TensorLike, filterSize: [number, number]|number,\n    strides: [number, number]|number, pad: 'valid'|'same'|number,\n    includeBatchInIndex = false): NamedTensorMap {\n  const $x = convertToTensor(x, 'x', 'maxPoolWithArgmax');\n\n  const inputs: MaxPoolWithArgmaxInputs = {x: $x};\n  const attrs:\n      MaxPoolWithArgmaxAttrs = {filterSize, strides, pad, includeBatchInIndex};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const result = ENGINE.runKernel(\n                     MaxPoolWithArgmax, inputs as unknown as NamedTensorMap,\n                     attrs as unknown as NamedAttrMap) as Tensor[];\n\n  return {result: result[0], indexes: result[1]};\n}\n\nexport const maxPoolWithArgmax = /* @__PURE__ */ op({maxPoolWithArgmax_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Maximum, MaximumInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {cast} from './cast';\nimport {op} from './operation';\n\n/**\n * Returns the max of a and b (`a > b ? a : b`) element-wise.\n * Supports broadcasting.\n *\n * We also expose `tf.maximumStrict` which has the same signature as this op and\n * asserts that `a` and `b` are the same shape (does not broadcast).\n *\n * ```js\n * const a = tf.tensor1d([1, 4, 3, 16]);\n * const b = tf.tensor1d([1, 2, 9, 4]);\n *\n * a.maximum(b).print();  // or tf.maximum(a, b)\n * ```\n *\n * ```js\n * // Broadcast maximum a with b.\n * const a = tf.tensor1d([2, 4, 6, 8]);\n * const b = tf.scalar(5);\n *\n * a.maximum(b).print();  // or tf.maximum(a, b)\n * ```\n *\n * @param a The first tensor.\n * @param b The second tensor. Must have the same type as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction maximum_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'maximum');\n  let $b = convertToTensor(b, 'b', 'maximum');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  if ($a.dtype === 'bool') {\n    $a = cast($a, 'int32');\n    $b = cast($b, 'int32');\n  }\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: MaximumInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(Maximum, inputs as unknown as NamedTensorMap);\n}\n\nexport const maximum = /* @__PURE__ */ op({maximum_});\n", "/**\n * @license\n * Copyright 2020 Google Inc. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Mean, MeanAttrs, MeanInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the mean of elements across dimensions of a `tf.Tensor`.\n *\n * Reduces `x` along the dimensions given in `axis`. Unless `keepDims` is\n * true, the rank of the `tf.Tensor` is reduced by 1 for each entry in `axis`.\n * If `keepDims` is true, the reduced dimensions are retained with length 1.\n * If `axis` has no entries, all dimensions are reduced, and a `tf.Tensor` with\n * a single element is returned.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3]);\n *\n * x.mean().print();  // or tf.mean(a)\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * const axis = 1;\n * x.mean(axis).print();  // or tf.mean(x, axis)\n * ```\n *\n * @param x The input tensor.\n * @param axis The dimension(s) to reduce. By default it reduces\n *     all dimensions.\n * @param keepDims If true, retains reduced dimensions with size 1.\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction mean_<T extends Tensor>(\n    x: Tensor|TensorLike, axis: number|number[] = null, keepDims = false): T {\n  const $x = convertToTensor(x, 'x', 'mean');\n\n  const inputs: MeanInputs = {x: $x};\n  const attrs: MeanAttrs = {axis, keepDims};\n\n  return ENGINE.runKernel(\n      Mean, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const mean = /* @__PURE__ */ op({mean_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Tensor} from '../tensor';\nimport {DataType, Rank, ShapeMap} from '../types';\nimport {assertNonNegativeIntegerDimensions, makeZerosTypedArray, sizeFromShape} from '../util';\n\nimport {complex} from './complex';\n\n/**\n * Creates a `tf.Tensor` with all elements set to 0.\n *\n * ```js\n * tf.zeros([2, 2]).print();\n * ```\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param dtype The type of an element in the resulting tensor. Can\n *     be 'float32', 'int32' or 'bool'. Defaults to 'float'.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function zeros<R extends Rank>(\n    shape: ShapeMap[R], dtype: DataType = 'float32'): Tensor<R> {\n  assertNonNegativeIntegerDimensions(shape);\n  if (dtype === 'complex64') {\n    const real = zeros(shape, 'float32');\n    const imag = zeros(shape, 'float32');\n    return complex(real, imag);\n  }\n  const values = makeZerosTypedArray(sizeFromShape(shape), dtype);\n  return ENGINE.makeTensor(values, shape, dtype) as Tensor<R>;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Tensor} from '../tensor';\nimport {DataType, Rank, ShapeMap} from '../types';\nimport {makeOnesTypedArray, sizeFromShape} from '../util';\nimport {assertNonNegativeIntegerDimensions} from '../util_base';\nimport {complex} from './complex';\nimport {zeros} from './zeros';\n\n/**\n * Creates a `tf.Tensor` with all elements set to 1.\n *\n * ```js\n * tf.ones([2, 2]).print();\n * ```\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param dtype The type of an element in the resulting tensor. Defaults to\n *     'float'.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function ones<R extends Rank>(\n    shape: ShapeMap[R], dtype: DataType = 'float32'): Tensor<R> {\n  assertNonNegativeIntegerDimensions(shape);\n  if (dtype === 'complex64') {\n    const real = ones(shape, 'float32');\n    const imag = zeros(shape, 'float32');\n    return complex(real, imag);\n  }\n  const values = makeOnesTypedArray(sizeFromShape(shape), dtype);\n  return ENGINE.makeTensor(values, shape, dtype) as Tensor<R>;\n}\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {matMul} from './mat_mul';\nimport {ones} from './ones';\nimport {reshape} from './reshape';\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {sizeFromShape} from '../util_base';\n\n/**\n * Broadcasts parameters for evaluation on an N-D grid.\n *\n * Given N one-dimensional coordinate arrays `*args`, returns a list `outputs`\n * of N-D coordinate arrays for evaluating expressions on an N-D grid.\n *\n * Notes:\n * `meshgrid` supports cartesian ('xy') and matrix ('ij') indexing conventions.\n * When the `indexing` argument is set to 'xy' (the default), the broadcasting\n * instructions for the first two dimensions are swapped.\n * Examples:\n * Calling `const [X, Y] = meshgrid(x, y)` with the tensors\n *\n * ```javascript\n * const x = [1, 2, 3];\n * const y = [4, 5, 6];\n * const [X, Y] = tf.meshgrid(x, y);\n * // X = [[1, 2, 3],\n * //      [1, 2, 3],\n * //      [1, 2, 3]]\n * // Y = [[4, 4, 4],\n * //      [5, 5, 5],\n * //      [6, 6, 6]]\n * ```\n *\n * @param x Tensor with rank geq 1.\n * @param y Tensor with rank geq 1.\n * @param indexing\n *\n * @doc {heading: 'Operations', subheading: 'Slicing and Joining'}\n */\nexport function meshgrid<T extends Tensor>(\n    x?: T|TensorLike, y?: T|TensorLike, {indexing = 'xy'} = {}): T[] {\n  if (indexing !== 'xy' && indexing !== 'ij') {\n    throw new TypeError(\n        `${indexing} is not a valid third argument to meshgrid`);\n  }\n  if (x === undefined) {\n    return [];\n  }\n  let $x = convertToTensor(\n      x, 'x', 'meshgrid', x instanceof Tensor ? x.dtype : 'float32');\n\n  if (y === undefined) {\n    return [$x];\n  }\n  let $y = convertToTensor(\n      y, 'y', 'meshgrid', y instanceof Tensor ? y.dtype : 'float32');\n\n  const w = sizeFromShape($x.shape);\n  const h = sizeFromShape($y.shape);\n\n  if (indexing === 'xy') {\n    $x = reshape($x, [1, -1]) as T;\n    $y = reshape($y, [-1, 1]) as T;\n    return [\n      matMul(ones([h, 1], $x.dtype), $x),\n      matMul($y, ones([1, w], $y.dtype)),\n    ];\n  }\n\n  $x = reshape($x, [-1, 1]) as T;\n  $y = reshape($y, [1, -1]) as T;\n  return [\n    matMul($x, ones([1, h], $x.dtype)),\n    matMul(ones([w, 1], $y.dtype), $y),\n  ];\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Minimum, MinimumInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {cast} from './cast';\nimport {op} from './operation';\n\n/**\n * Returns the min of a and b (`a < b ? a : b`) element-wise.\n * Supports broadcasting.\n *\n * We also expose `minimumStrict` which has the same signature as this op and\n * asserts that `a` and `b` are the same shape (does not broadcast).\n *\n * ```js\n * const a = tf.tensor1d([1, 4, 3, 16]);\n * const b = tf.tensor1d([1, 2, 9, 4]);\n *\n * a.minimum(b).print();  // or tf.minimum(a, b)\n * ```\n *\n * ```js\n * // Broadcast minimum a with b.\n * const a = tf.tensor1d([2, 4, 6, 8]);\n * const b = tf.scalar(5);\n *\n * a.minimum(b).print();  // or tf.minimum(a, b)\n * ```\n *\n * @param a The first tensor.\n * @param b The second tensor. Must have the same type as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction minimum_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'minimum');\n  let $b = convertToTensor(b, 'b', 'minimum');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  if ($a.dtype === 'bool') {\n    $a = cast($a, 'int32');\n    $b = cast($b, 'int32');\n  }\n\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: MinimumInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(Minimum, inputs as unknown as NamedTensorMap);\n}\n\nexport const minimum = /* @__PURE__ */ op({minimum_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {MirrorPad, MirrorPadAttrs, MirrorPadInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Pads a `tf.Tensor` using mirror padding.\n *\n * This operation implements the `REFLECT` and `SYMMETRIC` modes of pad.\n *\n * ```js\n * const x = tf.range(0, 9).reshape([1, 1, 3, 3]);\n * x.mirrorPad([[0, 0], [0, 0], [2, 2], [2, 2]], 'reflect').print();\n * ```\n * @param x The tensor to pad.\n * @param paddings An array of length `R` (the rank of the tensor), where\n * each element is a length-2 tuple of ints `[padBefore, padAfter]`,\n * specifying how much to pad along each dimension of the tensor.\n * In \"reflect\" mode, the padded regions do not include the borders,\n * while in \"symmetric\" mode the padded regions do include the borders.\n * For example, if the input is `[1, 2, 3]` and paddings is `[0, 2]`,\n * then the output is `[1, 2, 3, 2, 1]` in \"reflect\" mode, and\n * `[1, 2, 3, 3, 2]` in \"symmetric\" mode.\n * If `mode` is \"reflect\" then both `paddings[D, 0]` and `paddings[D, 1]`\n * must be no greater than `x.shape[D] - 1`. If mode is \"symmetric\"\n * then both `paddings[D, 0]` and `paddings[D, 1]` must be no greater than\n * `x.shape[D]`\n * @param mode String to specify padding mode. Can be `'reflect' | 'symmetric'`\n */\n/** @doc {heading: 'Tensors', subheading: 'Transformations'} */\nfunction mirrorPad_<T extends Tensor>(\n    x: T|TensorLike, paddings: Array<[number, number]>,\n    mode: 'reflect'|'symmetric'): T {\n  util.assert(\n      mode === 'reflect' || mode === 'symmetric',\n      () => `Invalid mode. Mode must be either reflect or symmetric. ` +\n          `Got ${mode}.`);\n\n  const $x = convertToTensor(x, 'x', 'mirrorPad');\n  if ($x.rank === 0) {\n    throw new Error(\n        'mirrorPad(scalar) is not defined. ' +\n        'Pass non-scalar to mirrorPad');\n  }\n  util.assert(\n      paddings.length === $x.rank,\n      () => `Padding doesn't match input. Must be ${$x.rank}. ` +\n          `Got ${paddings.length}.`);\n  const shapeOffset = mode === 'reflect' ? 1 : 0;\n  for (let i = 0; i < $x.rank; i++) {\n    util.assert(\n        paddings[i].length === 2,\n        () => `Invalid number of paddings. Must be length of 2 each.`);\n    util.assert(\n        paddings[i][0] >= 0 && paddings[i][0] <= $x.shape[i] - shapeOffset &&\n            paddings[i][1] >= 0 && paddings[i][1] <= $x.shape[i] - shapeOffset,\n        () => `Padding in dimension ${i} cannot be greater than or equal ` +\n            `to ${$x.shape[i] - shapeOffset} or less than 0 for input of ` +\n            `shape ${$x.shape}`);\n  }\n\n  const attrs: MirrorPadAttrs = {paddings, mode};\n  const inputs: MirrorPadInputs = {x: $x};\n  return ENGINE.runKernel(\n      MirrorPad, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const mirrorPad = /* @__PURE__ */ op({mirrorPad_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Mod, ModInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Returns the mod of a and b element-wise.\n * `floor(x / y) * y + mod(x, y) = x`\n * Supports broadcasting.\n *\n * We also expose `tf.modStrict` which has the same signature as this op and\n * asserts that `a` and `b` are the same shape (does not broadcast).\n *\n * ```js\n * const a = tf.tensor1d([1, 4, 3, 16]);\n * const b = tf.tensor1d([1, 2, 9, 4]);\n *\n * a.mod(b).print();  // or tf.mod(a, b)\n * ```\n *\n * ```js\n * // Broadcast a mod b.\n * const a = tf.tensor1d([2, 4, 6, 8]);\n * const b = tf.scalar(5);\n *\n * a.mod(b).print();  // or tf.mod(a, b)\n * ```\n *\n * @param a The first tensor.\n * @param b The second tensor. Must have the same type as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction mod_<T extends Tensor>(a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'mod');\n  let $b = convertToTensor(b, 'b', 'mod');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  const inputs: ModInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(Mod, inputs as unknown as NamedTensorMap);\n}\n\nexport const mod = /* @__PURE__ */ op({mod_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {parseAxisParam} from '../util';\n\nimport {expandShapeToKeepDim} from './axis_util';\nimport {cast} from './cast';\nimport {mean} from './mean';\nimport {op} from './operation';\nimport {reshape} from './reshape';\nimport {square} from './square';\nimport {sub} from './sub';\n\n/**\n * Calculates the mean and variance of `x`. The mean and variance are\n * calculated by aggregating the contents of `x` across `axes`. If `x` is\n * 1-D and `axes = [0]` this is just the mean and variance of a vector.\n *\n * @param x The input tensor.\n * @param axis The dimension(s) along with to compute mean and\n *     variance. By default it reduces all dimensions.\n * @param keepDims If true, the moments have the same dimensionality as the\n *     input.\n * @return An object with two keys: `mean` and `variance`.\n *\n * @doc {heading: 'Operations', subheading: 'Normalization'}\n */\nfunction moments_(\n    x: Tensor|TensorLike, axis: number|number[] = null,\n    keepDims = false): {mean: Tensor, variance: Tensor} {\n  x = convertToTensor(x, 'x', 'moments');\n  const axes = parseAxisParam(axis, x.shape);\n  const xMean = mean(x, axes, keepDims);\n  let keepDimsShape = xMean.shape;\n  if (!keepDims) {\n    keepDimsShape = expandShapeToKeepDim(xMean.shape, axes);\n  }\n  const devSquared =\n      square(sub(cast(x, 'float32'), reshape(xMean, keepDimsShape)));\n  const variance = mean(devSquared, axes, keepDims);\n  return {mean: xMean, variance};\n}\n\nexport const moments = /* @__PURE__ */ op({moments_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor2D} from '../tensor';\nimport {convertToTensor, convertToTensorArray} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {op} from './operation';\n\n/**\n * @docalias (data: Tensor2D, c: Tensor2D, h: Tensor2D): [Tensor2D, Tensor2D]\n */\nexport type LSTMCellFunc = {\n  (data: Tensor2D, c: Tensor2D, h: Tensor2D): [Tensor2D, Tensor2D];\n};\n\n/**\n * Computes the next states and outputs of a stack of LSTMCells.\n *\n * Each cell output is used as input to the next cell.\n *\n * Returns `[cellState, cellOutput]`.\n *\n * Derived from tf.contrib.rn.MultiRNNCell.\n *\n * @param lstmCells Array of LSTMCell functions.\n * @param data The input to the cell.\n * @param c Array of previous cell states.\n * @param h Array of previous cell outputs.\n *\n * @doc {heading: 'Operations', subheading: 'RNN'}\n */\nfunction multiRNNCell_(\n    lstmCells: LSTMCellFunc[], data: Tensor2D|TensorLike,\n    c: Array<Tensor2D|TensorLike>,\n    h: Array<Tensor2D|TensorLike>): [Tensor2D[], Tensor2D[]] {\n  const $data = convertToTensor(data, 'data', 'multiRNNCell');\n  const $c = convertToTensorArray(c, 'c', 'multiRNNCell');\n  const $h = convertToTensorArray(h, 'h', 'multiRNNCell');\n\n  let input = $data;\n  const newStates = [];\n  for (let i = 0; i < lstmCells.length; i++) {\n    const output = lstmCells[i](input, $c[i], $h[i]);\n    newStates.push(output[0]);\n    newStates.push(output[1]);\n    input = output[1];\n  }\n  const newC: Tensor2D[] = [];\n  const newH: Tensor2D[] = [];\n  for (let i = 0; i < newStates.length; i += 2) {\n    newC.push(newStates[i]);\n    newH.push(newStates[i + 1]);\n  }\n  return [newC, newH];\n}\nexport const multiRNNCell = /* @__PURE__ */ op({multiRNNCell_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Multinomial, MultinomialAttrs, MultinomialInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor1D, Tensor2D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Creates a `tf.Tensor` with values drawn from a multinomial distribution.\n *\n * ```js\n * const probs = tf.tensor([.75, .25]);\n * tf.multinomial(probs, 3).print();\n * ```\n *\n * @param logits 1D array with unnormalized log-probabilities, or\n *     2D array of shape `[batchSize, numOutcomes]`. See the `normalized`\n *     parameter.\n * @param numSamples Number of samples to draw for each row slice.\n * @param seed The seed number.\n * @param normalized Whether the provided `logits` are normalized true\n *     probabilities (sum to 1). Defaults to false.\n * @return 1D array of shape `[numSamples]`, or 2D array of shape\n *     `[batchSize, numSamples]`, depending on the rank of the input.\n *\n * @doc {heading: 'Tensors', subheading: 'Random'}\n */\nfunction multinomial_(\n    logits: Tensor1D|Tensor2D|TensorLike, numSamples: number, seed?: number,\n    normalized = false): Tensor1D|Tensor2D {\n  const $logits = convertToTensor(logits, 'logits', 'multinomial');\n  const numOutcomes = $logits.size;\n  const origRank = $logits.rank;\n  if (numOutcomes < 2) {\n    throw new Error(\n        `Error in multinomial: you need at least 2 outcomes, but got ` +\n        `${numOutcomes}.`);\n  }\n  if (origRank > 2) {\n    throw new Error(`Rank of probabilities must be 1 or 2, but is ${origRank}`);\n  }\n  // TODO(lina128): Investigate correct seed behavior. The code seems not allow\n  // setting see to 0.\n  seed = seed || Math.random();\n\n  // The kernel only accepts (and returns) rank 2 tensors.\n  const logits2D: Tensor2D =\n      origRank === 1 ? reshape($logits, [1, -1]) : $logits as Tensor2D;\n\n  const inputs: MultinomialInputs = {logits: logits2D};\n  const attrs: MultinomialAttrs = {numSamples, seed, normalized};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  Multinomial, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as Tensor2D;\n\n  // tslint:disable-next-line:no-unnecessary-type-assertion\n  return origRank === 1 ? reshape(res, [res.size]) as Tensor1D : res;\n}\n\nexport const multinomial = /* @__PURE__ */ op({multinomial_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {NotEqual, NotEqualInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {op} from './operation';\n\n/**\n * Returns the truth value of (a != b) element-wise. Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3]);\n * const b = tf.tensor1d([0, 2, 3]);\n *\n * a.notEqual(b).print();\n * ```\n * @param a The first input tensor.\n * @param b The second input tensor. Must have the same dtype as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nfunction notEqual_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'notEqual', 'string_or_numeric');\n  let $b = convertToTensor(b, 'b', 'notEqual', 'string_or_numeric');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: NotEqualInputs = {a: $a, b: $b};\n\n  return ENGINE.runKernel(NotEqual, inputs as unknown as NamedTensorMap);\n}\n\nexport const notEqual = /* @__PURE__ */ op({notEqual_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {OneHot, OneHotAttrs, OneHotInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {DataType, TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Creates a one-hot `tf.Tensor`. The locations represented by `indices` take\n * value `onValue` (defaults to 1), while all other locations take value\n * `offValue` (defaults to 0). If `indices` is rank `R`, the output has rank\n * `R+1` with the last axis of size `depth`.\n * `indices` used to encode prediction class must start from 0. For example,\n *  if you have 3 classes of data, class 1 should be encoded as 0, class 2\n *  should be 1, and class 3 should be 2.\n *\n * ```js\n * tf.oneHot(tf.tensor1d([0, 1], 'int32'), 3).print();\n * ```\n *\n * @param indices `tf.Tensor` of indices with dtype `int32`. Indices must\n * start from 0.\n * @param depth The depth of the one hot dimension.\n * @param onValue A number used to fill in the output when the index matches\n * the location.\n * @param offValue A number used to fill in the output when the index does\n *     not match the location.\n * @param dtype The dtype of the output tensor, default to 'int32'.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction oneHot_(\n    indices: Tensor|TensorLike, depth: number, onValue = 1, offValue = 0,\n    dtype: DataType = 'int32'): Tensor {\n  if (depth < 2) {\n    throw new Error(`Error in oneHot: depth must be >=2, but it is ${depth}`);\n  }\n  const $indices = convertToTensor(indices, 'indices', 'oneHot', 'int32');\n\n  const inputs: OneHotInputs = {indices: $indices};\n  const attrs: OneHotAttrs = {dtype, depth, onValue, offValue};\n\n  return ENGINE.runKernel(\n      OneHot, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const oneHot = /* @__PURE__ */ op({oneHot_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {OnesLike, OnesLikeInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Creates a `tf.Tensor` with all elements set to 1 with the same shape as the\n * given tensor.\n *\n * ```js\n * const x = tf.tensor([1, 2]);\n * tf.onesLike(x).print();\n * ```\n * @param x A tensor.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction onesLike_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'onesLike');\n\n  const inputs: OnesLikeInputs = {x: $x};\n  return ENGINE.runKernel(OnesLike, inputs as unknown as NamedTensorMap);\n}\n\nexport const onesLike = /* @__PURE__ */ op({onesLike_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor1D, Tensor2D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {matMul} from './mat_mul';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes the outer product of two vectors, `v1` and `v2`.\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3]);\n * const b = tf.tensor1d([3, 4, 5]);\n *\n * tf.outerProduct(a, b).print();\n * ```\n * @param v1 The first vector in the outer product operation.\n * @param v2 The second vector in the outer product operation.\n *\n * @doc {heading: 'Operations', subheading: 'Matrices'}\n */\nfunction outerProduct_(\n    v1: Tensor1D|TensorLike, v2: Tensor1D|TensorLike): Tensor2D {\n  const $v1 = convertToTensor(v1, 'v1', 'outerProduct');\n  const $v2 = convertToTensor(v2, 'v2', 'outerProduct');\n\n  util.assert(\n      $v1.rank === 1 && $v2.rank === 1,\n      () => `Error in outerProduct: inputs must be rank 1, but got ranks ` +\n          `${$v1.rank} and ${$v2.rank}.`);\n\n  const v12D = reshape($v1, [-1, 1]);\n  const v22D = reshape($v2, [1, -1]);\n  return matMul(v12D, v22D);\n}\n\nexport const outerProduct = /* @__PURE__ */ op({outerProduct_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {PadV2, PadV2Attrs, PadV2Inputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Pads a `tf.Tensor` with a given value and paddings.\n *\n * This operation implements `CONSTANT` mode. For `REFLECT` and `SYMMETRIC`,\n * refer to `tf.mirrorPad`.\n *\n * Also available are stricter rank-specific methods with the same signature\n * as this method that assert that `paddings` is of given length.\n *   - `tf.pad1d`\n *   - `tf.pad2d`\n *   - `tf.pad3d`\n *   - `tf.pad4d`\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n * x.pad([[1, 2]]).print();\n * ```\n * @param x The tensor to pad.\n * @param paddings An array of length `R` (the rank of the tensor), where\n * each element is a length-2 tuple of ints `[padBefore, padAfter]`,\n * specifying how much to pad along each dimension of the tensor.\n * @param constantValue The pad value to use. Defaults to 0.\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction pad_<T extends Tensor>(\n    x: T|TensorLike, paddings: Array<[number, number]>, constantValue = 0): T {\n  const $x = convertToTensor(x, 'x', 'pad');\n  if ($x.rank === 0) {\n    throw new Error('pad(scalar) is not defined. Pass non-scalar to pad');\n  }\n\n  const attrs: PadV2Attrs = {paddings, constantValue};\n  const inputs: PadV2Inputs = {x: $x};\n  return ENGINE.runKernel(\n      PadV2, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const pad = /* @__PURE__ */ op({pad_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor1D} from '../tensor';\nimport {TensorLike} from '../types';\nimport {assert} from '../util';\nimport {op} from './operation';\nimport {pad} from './pad';\n\n/**\n * Pads a `tf.Tensor1D` with a given value and paddings. See `pad` for details.\n */\nfunction pad1d_(\n    x: Tensor1D|TensorLike, paddings: [number, number],\n    constantValue = 0): Tensor1D {\n  assert(\n      paddings.length === 2,\n      () => 'Invalid number of paddings. Must be length of 2.');\n  return pad(x, [paddings], constantValue);\n}\n\nexport const pad1d = /* @__PURE__ */ op({pad1d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor2D} from '../tensor';\nimport {TensorLike} from '../types';\nimport {assert} from '../util';\nimport {op} from './operation';\nimport {pad} from './pad';\n\n/**\n * Pads a `tf.Tensor2D` with a given value and paddings. See `pad` for details.\n */\nfunction pad2d_(\n    x: Tensor2D|TensorLike, paddings: [[number, number], [number, number]],\n    constantValue = 0): Tensor2D {\n  assert(\n      paddings.length === 2 && paddings[0].length === 2 &&\n          paddings[1].length === 2,\n      () => 'Invalid number of paddings. Must be length of 2 each.');\n  return pad(x, paddings, constantValue);\n}\n\nexport const pad2d = /* @__PURE__ */ op({pad2d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor3D} from '../tensor';\nimport {TensorLike} from '../types';\nimport {assert} from '../util';\nimport {op} from './operation';\nimport {pad} from './pad';\n\n/**\n * Pads a `tf.Tensor3D` with a given value and paddings. See `pad` for details.\n */\nfunction pad3d_(\n    x: Tensor3D|TensorLike,\n    paddings: [[number, number], [number, number], [number, number]],\n    constantValue = 0): Tensor3D {\n  assert(\n      paddings.length === 3 && paddings[0].length === 2 &&\n          paddings[1].length === 2 && paddings[2].length === 2,\n      () => 'Invalid number of paddings. Must be length of 2 each.');\n  return pad(x, paddings, constantValue);\n}\n\nexport const pad3d = /* @__PURE__ */ op({pad3d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor4D} from '../tensor';\nimport {TensorLike} from '../types';\nimport {assert} from '../util';\nimport {op} from './operation';\nimport {pad} from './pad';\n\n/**\n * Pads a `tf.Tensor4D` with a given value and paddings. See `pad` for details.\n */\nfunction pad4d_(\n    x: Tensor4D|TensorLike,\n    paddings:\n        [\n          [number, number], [number, number], [number, number], [number, number]\n        ],\n    constantValue = 0): Tensor4D {\n  assert(\n      paddings.length === 4 && paddings[0].length === 2 &&\n          paddings[1].length === 2 && paddings[2].length === 2 &&\n          paddings[3].length === 2,\n      () => 'Invalid number of paddings. Must be length of 2 each.');\n  return pad(x, paddings, constantValue);\n}\n\nexport const pad4d = /* @__PURE__ */ op({pad4d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {SpaceToBatchND, SpaceToBatchNDAttrs, SpaceToBatchNDInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * This operation divides \"spatial\" dimensions `[1, ..., M]` of the input into\n * a grid of blocks of shape `blockShape`, and interleaves these blocks with\n * the \"batch\" dimension (0) such that in the output, the spatial\n * dimensions `[1, ..., M]` correspond to the position within the grid,\n * and the batch dimension combines both the position within a spatial block\n * and the original batch position. Prior to division into blocks,\n * the spatial dimensions of the input are optionally zero padded\n * according to `paddings`. See below for a precise description.\n *\n * ```js\n * const x = tf.tensor4d([1, 2, 3, 4], [1, 2, 2, 1]);\n * const blockShape = [2, 2];\n * const paddings = [[0, 0], [0, 0]];\n *\n * x.spaceToBatchND(blockShape, paddings).print();\n * ```\n *\n * @param x A `tf.Tensor`. N-D with `x.shape` = `[batch] + spatialShape +\n * remainingShape`, where spatialShape has `M` dimensions.\n * @param blockShape A 1-D array. Must have shape `[M]`, all values must\n * be >= 1.\n * @param paddings A 2-D array. Must have shape `[M, 2]`, all values must be >=\n *     0. `paddings[i] = [padStart, padEnd]` specifies the amount to zero-pad\n * from input dimension `i + 1`, which corresponds to spatial dimension `i`. It\n * is required that\n * `(inputShape[i + 1] + padStart + padEnd) % blockShape[i] === 0`\n *\n * This operation is equivalent to the following steps:\n *\n * 1. Zero-pad the start and end of dimensions `[1, ..., M]` of the input\n * according to `paddings` to produce `padded` of shape paddedShape.\n *\n * 2. Reshape `padded` to `reshapedPadded` of shape:\n * `[batch] + [paddedShape[1] / blockShape[0], blockShape[0], ...,\n * paddedShape[M] / blockShape[M-1], blockShape[M-1]] + remainingShape`\n *\n * 3. Permute dimensions of `reshapedPadded` to produce `permutedReshapedPadded`\n * of shape: `blockShape + [batch] + [paddedShape[1] / blockShape[0], ...,\n * paddedShape[M] / blockShape[M-1]] + remainingShape`\n *\n * 4. Reshape `permutedReshapedPadded` to flatten `blockShape` into the\n * batch dimension, producing an output tensor of shape:\n * `[batch * prod(blockShape)] + [paddedShape[1] / blockShape[0], ...,\n * paddedShape[M] / blockShape[M-1]] + remainingShape`\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction spaceToBatchND_<T extends Tensor>(\n    x: T|TensorLike, blockShape: number[], paddings: number[][]): T {\n  const $x = convertToTensor(x, 'x', 'spaceToBatchND');\n\n  util.assert(\n      $x.rank >= 1 + blockShape.length,\n      () => `input rank ${$x.rank} should be > than [blockShape] ${\n          blockShape.length}`);\n\n  util.assert(\n      paddings.length === blockShape.length,\n      () => `paddings.shape[0] ${\n          paddings.length} must be equal to [blockShape] ${blockShape.length}`);\n\n  util.assert(\n      $x.shape.reduce(\n          (a, b, i) => {\n            if (i > 0 && i <= blockShape.length) {\n              return a &&\n                  ((b + paddings[i - 1][0] + paddings[i - 1][1]) %\n                       blockShape[i - 1] ===\n                   0);\n            }\n            return a;\n          },\n          true),\n      () => `input spatial dimensions ${$x.shape.slice(1)} with paddings ${\n          paddings.toString()} must be divisible by blockShapes ${\n          blockShape.toString()}`);\n\n  const inputs: SpaceToBatchNDInputs = {x: $x};\n  const attrs: SpaceToBatchNDAttrs = {blockShape, paddings};\n\n  return ENGINE.runKernel(\n      SpaceToBatchND, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const spaceToBatchND = /* @__PURE__ */ op({spaceToBatchND_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {avgPool} from './avg_pool';\nimport {batchToSpaceND} from './batch_to_space_nd';\nimport * as conv_util from './conv_util';\nimport {maxPool} from './max_pool';\nimport {op} from './operation';\nimport {reshape} from './reshape';\nimport {spaceToBatchND} from './space_to_batch_nd';\n\n/**\n * Performs an N-D pooling operation\n *\n * @param input The input tensor, of rank 4 or rank 3 of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is assumed.\n * @param windowShape The filter size: `[filterHeight, filterWidth]`. If\n *     `filterSize` is a single number, then `filterHeight == filterWidth`.\n * @param poolingType The type of pooling, either 'max' or 'avg'.\n * @param pad The type of padding algorithm:\n *    - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *    - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n *    - For more info, see this guide:\n *     [https://www.tensorflow.org/api_guides/python/nn#Convolution](\n *         https://www.tensorflow.org/api_guides/python/nn#Convolution)\n * @param dilations The dilation rates: `[dilationHeight, dilationWidth]`\n *     in which we sample input values across the height and width dimensions\n *     in dilated pooling. Defaults to `[1, 1]`. If `dilationRate` is a single\n *     number, then `dilationHeight == dilationWidth`. If it is greater than\n *     1, then all values of `strides` must be 1.\n * @param strides The strides of the pooling: `[strideHeight, strideWidth]`. If\n *     `strides` is a single number, then `strideHeight == strideWidth`.\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction pool_<T extends Tensor3D|Tensor4D>(\n    input: T|TensorLike, windowShape: [number, number]|number,\n    poolingType: 'avg'|'max',\n    pad: 'valid'|'same'|number|conv_util.ExplicitPadding,\n    dilations?: [number, number]|number, strides?: [number, number]|number,\n    dimRoundingMode?: 'floor'|'round'|'ceil') {\n  if (dilations == null) {\n    dilations = [1, 1];\n  }\n  if (strides == null) {\n    strides = 1;\n  }\n  if (pad === 0) {\n    pad = 'valid';\n  }\n\n  const $x = convertToTensor(input, 'x', 'maxPool');\n  let x4D = $x as Tensor4D;\n  let reshapedTo4D = false;\n\n  if ($x.rank === 3) {\n    reshapedTo4D = true;\n    x4D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2]]);\n  }\n\n  util.assert(\n      conv_util.eitherStridesOrDilationsAreOne(strides, dilations),\n      () => 'Error in pool: Either strides or dilations must be 1. ' +\n          `Got strides ${strides} and dilations '${dilations}'`);\n\n  const convInfo = conv_util.computePool2DInfo(\n      x4D.shape, windowShape, strides, dilations, pad);\n  const dilation: [number, number] =\n      [convInfo.dilationHeight, convInfo.dilationWidth];\n\n  // The following implementation does batchToSpace(pool(spaceToBatch(x)))\n  // whenever dilation > 1 since the TF kernels do not support dilation > 1.\n  // tslint:disable-next-line:max-line-length\n  // https://github.com/tensorflow/tensorflow/blob/50f6bb67dc98c9b74630b6047aae7a4f8a40fd02/tensorflow/python/ops/nn_ops.py#L1037\n\n  let basePadding: number[][];\n  if (pad === 'same') {\n    basePadding = withSpaceToBatchBasePaddings(\n        [convInfo.filterHeight, convInfo.filterWidth], dilation);\n  } else {\n    basePadding = [[0, 0], [0, 0]];\n  }\n\n  const isDilationOne = dilation[0] === 1 && dilation[1] === 1;\n  const [adjustedPadding, adjustedCrops] = requiredSpaceToBatchPaddings(\n      [convInfo.inHeight, convInfo.inWidth], dilation, basePadding);\n  const convertedPad = isDilationOne ? pad : 'valid';\n  const convertedX =\n      isDilationOne ? x4D : spaceToBatchND(x4D, dilation, adjustedPadding);\n\n  const forwardOp = poolingType === 'avg' ?\n      () => avgPool(convertedX, windowShape, strides, convertedPad,\n                    dimRoundingMode) :\n      () => maxPool(convertedX, windowShape, strides, convertedPad,\n                    dimRoundingMode);\n  const y = forwardOp();\n\n  const res = isDilationOne ? y : batchToSpaceND(y, dilation, adjustedCrops);\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n\n  return res as T;\n}\n\n// Helper function to compute crops and paddings for pool with dilation > 1.\n// tslint:disable-next-line:max-line-length\n// https://github.com/tensorflow/tensorflow/blob/50f6bb67dc98c9b74630b6047aae7a4f8a40fd02/tensorflow/python/ops/array_ops.py#L2184\nfunction requiredSpaceToBatchPaddings(\n    inputShape: [number, number], blockShape: [number, number],\n    basePadding: number[][]) {\n  const padStart = basePadding.map(b => b[0]);\n  const origPadEnd = basePadding.map(b => b[1]);\n  const fullInputShape = inputShape.concat(padStart, origPadEnd);\n  const padEndExtra = blockShape.map((b, i) => (b - fullInputShape[i] % b) % b);\n  const padEnd = origPadEnd.map((s, i) => s + padEndExtra[i]);\n  const paddings = blockShape.map((_, i) => [padStart[i], padEnd[i]]);\n  const crops = blockShape.map((_, i) => [0, padEndExtra[i]]);\n  return [paddings, crops];\n}\n\n// Helper function to compute base paddings for pool with dilation > 1.\n// tslint:disable-next-line:max-line-length\n// https://github.com/tensorflow/tensorflow/blob/50f6bb67dc98c9b74630b6047aae7a4f8a40fd02/tensorflow/python/ops/nn_ops.py#L524\nfunction withSpaceToBatchBasePaddings(\n    filterShape: [number, number], dilation: [number, number]) {\n  // Spatial dimensions of the filters and the upsampled filters in which we\n  // introduce (rate - 1) zeros between consecutive filter values.\n  const dilatedFilterShape = filterShape.map((s, i) => {\n    return s + (s - 1) * (dilation[i] - 1);\n  });\n  const padExtraShape = dilatedFilterShape.map(s => s - 1);\n\n  // When padding is odd, we pad more at end, following the same\n  // convention as conv2d.\n  const padExtraStart = padExtraShape.map(s => Math.floor(s / 2));\n  const padExtraEnd = padExtraShape.map((s, i) => s - padExtraStart[i]);\n  return padExtraShape.map((_, i) => {\n    return [padExtraStart[i], padExtraEnd[i]];\n  });\n}\n\nexport const pool = /* @__PURE__ */ op({pool_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Prelu, PreluInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes leaky rectified linear element-wise with parametric alphas.\n *\n * `x < 0 ? alpha * x : f(x) = x`\n *\n * ```js\n * const x = tf.tensor1d([-1, 2, -3, 4]);\n * const alpha = tf.scalar(0.1);\n *\n * x.prelu(alpha).print();  // or tf.prelu(x, alpha)\n * ```\n * @param x The input tensor.\n * @param alpha Scaling factor for negative values.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction prelu_<T extends Tensor>(x: T|TensorLike, alpha: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'prelu');\n  const $alpha = convertToTensor(alpha, 'alpha', 'prelu');\n\n  const inputs: PreluInputs = {x: $x, alpha: $alpha};\n  return ENGINE.runKernel(Prelu, inputs as unknown as NamedTensorMap);\n}\n\nexport const prelu = /* @__PURE__ */ op({prelu_});\n", "/**\n * @license\n * Copyright 2020 Google Inc. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\n\n/**\n * Prints information about the `tf.Tensor` including its data.\n *\n * ```js\n * const verbose = true;\n * tf.tensor2d([1, 2, 3, 4], [2, 2]).print(verbose);\n * ```\n * @param x The tensor to be printed.\n * @param verbose Whether to print verbose information about the ` Tensor`,\n * including dtype and size.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function print<T extends Tensor>(x: T, verbose = false): void {\n  console.log(x.toString(verbose));\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Prod, ProdAttrs, ProdInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {cast} from './cast';\nimport {op} from './operation';\n\n/**\n * Computes the product of elements across dimensions of a `tf.Tensor`.\n *\n * Reduces the input along the dimensions given in `axes`. Unless `keepDims`\n * is true, the rank of the `tf.Tensor` is reduced by 1 for each entry in\n * `axes`. If `keepDims` is true, the reduced dimensions are retained with\n * length 1. If `axes` has no entries, all dimensions are reduced, and a\n * `tf.Tensor` with a single element is returned.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3]);\n *\n * x.prod().print();  // or tf.prod(x)\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * const axis = 1;\n * x.prod(axis).print();  // or tf.prod(x, axis)\n * ```\n *\n * @param x The input tensor to compute the product over. If the dtype is `bool`\n *   it will be converted to `int32` and the output dtype will be `int32`.\n * @param axis The dimension(s) to reduce. By default it reduces\n *     all dimensions.\n * @param keepDims If true, retains reduced dimensions with size 1.\n *\n * @doc {heading: 'Operations', subheading: 'Reduction'}\n */\nfunction prod_<T extends Tensor>(\n    x: Tensor|TensorLike, axis: number|number[] = null, keepDims = false): T {\n  let $x = convertToTensor(x, 'x', 'prod');\n\n  if ($x.dtype === 'bool') {\n    // bool is not an allowed type for the underlying kernel.\n    $x = cast($x, 'int32');\n  }\n\n  const inputs: ProdInputs = {x: $x};\n  const attrs: ProdAttrs = {axis, keepDims};\n\n  return ENGINE.runKernel(\n      Prod, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const prod = /* @__PURE__ */ op({prod_});\n", "/**\n * @license\n * Copyright 2022 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {RaggedGather, RaggedGatherAttrs, RaggedGatherInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {op} from './operation';\n\n/**\n * Gather ragged slices from params axis 0 according to indices.\n *\n * @param paramsNestedSplits: A list of at least 1 Tensor with type 'int32' The\n *     nestedRowSplits tensors that define the row-partitioning for the params\n *     RaggedTensor input.\n * @param paramsDenseValues: A Tensor. The flatValues for the params\n *     RaggedTensor.\n * @param indices: A Tensor. Must be one of type: int32. Indices in the\n *     outermost dimension of params of the values that should be gathered.\n * @param outputRaggedRank: An int that is >= 0. The ragged rank of the output\n *     RaggedTensor. outputNestedSplits will contain this number of rowSplits\n *     tensors. This value should equal indices.shape.ndims + params.raggedRank\n *     - 1.\n * @return A map with the following properties:\n *     - outputNestedSplits: A list of outputRaggedRank Tensor objects with the\n * same type as paramsNestedSplits.\n *     - outputDenseValues: A Tensor. Has the same type as paramsDenseValues.\n * @doc {heading: 'Operations', subheading: 'Ragged'}\n */\n\ninterface RaggedGatherMap {\n  outputNestedSplits: Tensor[];\n  outputDenseValues: Tensor;\n}\n\nfunction raggedGather_(\n    paramsNestedSplits: Tensor[], paramsDenseValues: Tensor|TensorLike,\n    indices: Tensor|TensorLike, outputRaggedRank: number): RaggedGatherMap {\n  const $paramsNestedSplits = paramsNestedSplits.map(\n      (t, i) => convertToTensor(t, `tensors${i}`, 'raggedGather', 'int32'));\n  const $paramsDenseValues =\n      convertToTensor(paramsDenseValues, 'paramsDenseValues', 'raggedGather');\n  const $indices = convertToTensor(indices, 'indices', 'raggedGather', 'int32');\n\n  const inputs: RaggedGatherInputs = {\n    paramsNestedSplits: $paramsNestedSplits,\n    paramsDenseValues: $paramsDenseValues,\n    indices: $indices,\n  };\n  const attrs: RaggedGatherAttrs = {outputRaggedRank};\n\n  const result: Tensor[] =\n      ENGINE.runKernel(RaggedGather, inputs as {}, attrs as {});\n  return {\n    outputNestedSplits: result.slice(0, result.length - 1),\n    outputDenseValues: result[result.length - 1],\n  };\n}\n\nexport const raggedGather = /* @__PURE__ */ op({raggedGather_});\n", "/**\n * @license\n * Copyright 2022 Google LLC.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {RaggedRange, RaggedRangeInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {op} from './operation';\n\n/**\n * Returns a RaggedTensor result composed from rtDenseValues and rtNestedSplits,\n * such that result[i] = [starts[i], starts[i] + deltas[i], ..., limits[i]]).\n *\n * @param starts: A Tensor. Must be one of the following types:\n *     'float32', 'int32'. The starts of each range.\n * @param limits: A Tensor. Must have the same type as starts. The limits of\n *     each range.\n * @param deltas: A Tensor. Must have the same type as starts. The deltas of\n *     each range.\n * @return A map with the following properties:\n *     - rtNestedSplits: A Tensor of type 'int32'.\n *     - rtDenseValues: A Tensor. Has the same type as starts.\n */\n\nfunction raggedRange_(\n    starts: Tensor|TensorLike, limits: Tensor|TensorLike,\n    deltas: Tensor|TensorLike): NamedTensorMap {\n  const $starts = convertToTensor(starts, 'starts', 'raggedRange');\n  const $limits =\n      convertToTensor(limits, 'limits', 'raggedRange', $starts.dtype);\n  const $deltas =\n      convertToTensor(deltas, 'deltas', 'raggedRange', $starts.dtype);\n\n  const inputs: RaggedRangeInputs = {\n    starts: $starts,\n    limits: $limits,\n    deltas: $deltas,\n  };\n\n  const result: Tensor[] = ENGINE.runKernel(RaggedRange, inputs as {});\n  return {\n    rtNestedSplits: result[0],\n    rtDenseValues: result[1],\n  };\n}\n\nexport const raggedRange = /* @__PURE__ */ op({raggedRange_});\n", "/**\n * @license\n * Copyright 2022 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {RaggedTensorToTensor, RaggedTensorToTensorAttrs, RaggedTensorToTensorInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {op} from './operation';\n\n/**\n * Create a dense tensor from a ragged tensor, possibly altering its shape.\n *\n * The raggedTensorToTensor op creates a dense tensor from am array of row\n * partition tensors, a value vector, and default values. If the shape is\n * unspecified, the minimal shape required to contain all the elements in the\n * ragged tensor (the natural shape) will be used. If some dimensions are left\n * unspecified, then the size of the natural shape is used in that dimension.\n *\n * The defaultValue will be broadcast to the output shape. After that, the\n * values from the ragged tensor overwrite the default values. Note that the\n * defaultValue must have less dimensions than the value.\n *\n * The row partition tensors are in the order of the dimensions. At present, the\n * types can be: \"ROW_SPLITS\": the row_splits tensor from the ragged tensor.\n *   \"VALUE_ROWIDS\": the value_rowids tensor from the ragged tensor.\n *   \"FIRST_DIM_SIZE\": if value_rowids is used for the first dimension, then it\n * is preceded by \"FIRST_DIM_SIZE\".\n * ```\n * @param shape: A Tensor. Must be one of the following types: 'int32'. The\n *     desired shape of the output tensor. If left unspecified (empty), the\n *     minimal shape required to contain all the elements in the ragged tensor\n *     (the natural shape) will be used. If some dimensions are left\n *     unspecified, then the size of the natural shape is used in that\n *     dimension.\n *\n *     Note that dense dimensions cannot be modified by the shape argument.\n *     Trying to change the size of a dense dimension will cause the op to fail.\n *     Examples: natural shape: [4, 5, 6] shape: -1 output shape: [4, 5, 6]\n *\n *     natural shape: [4, 5, 6] shape: [3, -1, 2] output shape: [3, 5, 2]\n *\n *     natural shape: [4, 5, 6] shape: [3, 7, 2] output shape: [3, 7, 2]\n * @param values: A Tensor. A 1D tensor representing the values of the ragged\n *     tensor.\n * @param defaultValue: A Tensor. Must have the same type as values. The\n *     defaultValue when the shape is larger than the ragged tensor. The\n *     defaultValue is broadcast until it is the shape of the output tensor,\n *     and then overwritten by values in the ragged tensor. The default value\n *     must be compatible with this broadcast operation, and must have fewer\n *     dimensions than the value tensor.\n * @param rowPartitionTensors: A list of at least 1 Tensor objects with the same\n *     type in: 'int32'.\n * @param rowPartitionTypes: A list of strings. The types of the row partition\n *     tensors. At present, these can be:\n *     \"ROW_SPLITS\": the row_splits tensor from the ragged tensor.\n *     \"VALUE_ROWIDS\": the value_rowids tensor from the ragged tensor.\n *     \"FIRST_DIM_SIZE\": if value_rowids is used for the first dimension, then\n *         it is preceded by \"FIRST_DIM_SIZE\". The tensors are in the order of\n *         the dimensions.\n * @return A Tensor. Has the same type as values.\n * @doc {heading: 'Operations', subheading: 'Ragged'}\n */\nfunction raggedTensorToTensor_(\n    shape: Tensor|TensorLike, values: Tensor|TensorLike,\n    defaultValue: Tensor|TensorLike, rowPartitionTensors: Tensor[],\n    rowPartitionTypes: string[]): Tensor {\n  const $shape =\n      convertToTensor(shape, 'shape', 'raggedTensorToTensor', 'int32');\n  const $values = convertToTensor(values, 'values', 'raggedTensorToTensor');\n  const $defaultValue = convertToTensor(\n      defaultValue, 'defaultValue', 'raggedTensorToTensor', $values.dtype);\n  const $rowPartitionTensors = rowPartitionTensors.map(\n      (t, i) =>\n          convertToTensor(t, `tensors${i}`, 'raggedTensorToTensor', 'int32'));\n\n  const inputs: RaggedTensorToTensorInputs = {\n    shape: $shape,\n    values: $values,\n    defaultValue: $defaultValue,\n    rowPartitionTensors: $rowPartitionTensors\n  };\n  const attrs: RaggedTensorToTensorAttrs = {rowPartitionTypes};\n\n  return ENGINE.runKernel(RaggedTensorToTensor, inputs as {}, attrs as {});\n}\n\nexport const raggedTensorToTensor = /* @__PURE__ */ op({raggedTensorToTensor_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Tensor} from '../tensor';\nimport {DataType, Rank, ShapeMap} from '../types';\nimport {sizeFromShape} from '../util';\nimport {assertNonNegativeIntegerDimensions} from '../util_base';\n\nimport {op} from './operation';\n\n/**\n * Creates a `tf.Tensor` with values sampled from a random number generator\n * function defined by the user.\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param randFunction A random number generator function which is called\n * for each element in the output tensor.\n * @param dtype The data type of the output tensor. Defaults to 'float32'.\n *\n * @doc {heading: 'Tensors', subheading: 'Random'}\n */\nfunction rand_<R extends Rank>(\n    shape: ShapeMap[R], randFunction: () => number,\n    dtype?: DataType): Tensor<R> {\n  assertNonNegativeIntegerDimensions(shape);\n  const size = sizeFromShape(shape);\n  let values = null;\n  if (dtype == null || dtype === 'float32') {\n    values = new Float32Array(size);\n  } else if (dtype === 'int32') {\n    values = new Int32Array(size);\n  } else if (dtype === 'bool') {\n    values = new Uint8Array(size);\n  } else {\n    throw new Error(`Unknown data type ${dtype}`);\n  }\n  for (let i = 0; i < size; i++) {\n    values[i] = randFunction();\n  }\n  return ENGINE.makeTensor(values, shape, dtype) as Tensor<R>;\n}\n\nexport const rand = /* @__PURE__ */ op({rand_});\n", "// A port of an algorithm by Johannes Baagøe <baagoe@baagoe.com>, 2010\n// http://baagoe.com/en/RandomMusings/javascript/\n// https://github.com/nquinlan/better-random-numbers-for-javascript-mirror\n// Original work is under MIT license -\n\n// Copyright (C) 2010 by Johannes Baagøe <baagoe@baagoe.org>\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\n\n\n(function(global, module, define) {\n\nfunction Alea(seed) {\n  var me = this, mash = Mash();\n\n  me.next = function() {\n    var t = 2091639 * me.s0 + me.c * 2.3283064365386963e-10; // 2^-32\n    me.s0 = me.s1;\n    me.s1 = me.s2;\n    return me.s2 = t - (me.c = t | 0);\n  };\n\n  // Apply the seeding algorithm from Baagoe.\n  me.c = 1;\n  me.s0 = mash(' ');\n  me.s1 = mash(' ');\n  me.s2 = mash(' ');\n  me.s0 -= mash(seed);\n  if (me.s0 < 0) { me.s0 += 1; }\n  me.s1 -= mash(seed);\n  if (me.s1 < 0) { me.s1 += 1; }\n  me.s2 -= mash(seed);\n  if (me.s2 < 0) { me.s2 += 1; }\n  mash = null;\n}\n\nfunction copy(f, t) {\n  t.c = f.c;\n  t.s0 = f.s0;\n  t.s1 = f.s1;\n  t.s2 = f.s2;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  var xg = new Alea(seed),\n      state = opts && opts.state,\n      prng = xg.next;\n  prng.int32 = function() { return (xg.next() * 0x100000000) | 0; }\n  prng.double = function() {\n    return prng() + (prng() * 0x200000 | 0) * 1.1102230246251565e-16; // 2^-53\n  };\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nfunction Mash() {\n  var n = 0xefc8249d;\n\n  var mash = function(data) {\n    data = String(data);\n    for (var i = 0; i < data.length; i++) {\n      n += data.charCodeAt(i);\n      var h = 0.02519603282416938 * n;\n      n = h >>> 0;\n      h -= n;\n      h *= n;\n      n = h >>> 0;\n      h -= n;\n      n += h * 0x100000000; // 2^32\n    }\n    return (n >>> 0) * 2.3283064365386963e-10; // 2^-32\n  };\n\n  return mash;\n}\n\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.alea = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n", "// A Javascript implementaion of the \"xor128\" prng algorithm by\n// George Marsaglia.  See http://www.jstatsoft.org/v08/i14/paper\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this, strseed = '';\n\n  me.x = 0;\n  me.y = 0;\n  me.z = 0;\n  me.w = 0;\n\n  // Set up generator function.\n  me.next = function() {\n    var t = me.x ^ (me.x << 11);\n    me.x = me.y;\n    me.y = me.z;\n    me.z = me.w;\n    return me.w ^= (me.w >>> 19) ^ t ^ (t >>> 8);\n  };\n\n  if (seed === (seed | 0)) {\n    // Integer seed.\n    me.x = seed;\n  } else {\n    // String seed.\n    strseed += seed;\n  }\n\n  // Mix in string seed, then discard an initial batch of 64 values.\n  for (var k = 0; k < strseed.length + 64; k++) {\n    me.x ^= strseed.charCodeAt(k) | 0;\n    me.next();\n  }\n}\n\nfunction copy(f, t) {\n  t.x = f.x;\n  t.y = f.y;\n  t.z = f.z;\n  t.w = f.w;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xor128 = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n", "// A Javascript implementaion of the \"xorwow\" prng algorithm by\n// George Marsaglia.  See http://www.jstatsoft.org/v08/i14/paper\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this, strseed = '';\n\n  // Set up generator function.\n  me.next = function() {\n    var t = (me.x ^ (me.x >>> 2));\n    me.x = me.y; me.y = me.z; me.z = me.w; me.w = me.v;\n    return (me.d = (me.d + 362437 | 0)) +\n       (me.v = (me.v ^ (me.v << 4)) ^ (t ^ (t << 1))) | 0;\n  };\n\n  me.x = 0;\n  me.y = 0;\n  me.z = 0;\n  me.w = 0;\n  me.v = 0;\n\n  if (seed === (seed | 0)) {\n    // Integer seed.\n    me.x = seed;\n  } else {\n    // String seed.\n    strseed += seed;\n  }\n\n  // Mix in string seed, then discard an initial batch of 64 values.\n  for (var k = 0; k < strseed.length + 64; k++) {\n    me.x ^= strseed.charCodeAt(k) | 0;\n    if (k == strseed.length) {\n      me.d = me.x << 10 ^ me.x >>> 4;\n    }\n    me.next();\n  }\n}\n\nfunction copy(f, t) {\n  t.x = f.x;\n  t.y = f.y;\n  t.z = f.z;\n  t.w = f.w;\n  t.v = f.v;\n  t.d = f.d;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xorwow = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n", "// A Javascript implementaion of the \"xorshift7\" algorithm by\n// François Panneton and Pierre L'ecuyer:\n// \"On the Xorgshift Random Number Generators\"\n// http://saluc.engr.uconn.edu/refs/crypto/rng/panneton05onthexorshift.pdf\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this;\n\n  // Set up generator function.\n  me.next = function() {\n    // Update xor generator.\n    var X = me.x, i = me.i, t, v, w;\n    t = X[i]; t ^= (t >>> 7); v = t ^ (t << 24);\n    t = X[(i + 1) & 7]; v ^= t ^ (t >>> 10);\n    t = X[(i + 3) & 7]; v ^= t ^ (t >>> 3);\n    t = X[(i + 4) & 7]; v ^= t ^ (t << 7);\n    t = X[(i + 7) & 7]; t = t ^ (t << 13); v ^= t ^ (t << 9);\n    X[i] = v;\n    me.i = (i + 1) & 7;\n    return v;\n  };\n\n  function init(me, seed) {\n    var j, w, X = [];\n\n    if (seed === (seed | 0)) {\n      // Seed state array using a 32-bit integer.\n      w = X[0] = seed;\n    } else {\n      // Seed state using a string.\n      seed = '' + seed;\n      for (j = 0; j < seed.length; ++j) {\n        X[j & 7] = (X[j & 7] << 15) ^\n            (seed.charCodeAt(j) + X[(j + 1) & 7] << 13);\n      }\n    }\n    // Enforce an array length of 8, not all zeroes.\n    while (X.length < 8) X.push(0);\n    for (j = 0; j < 8 && X[j] === 0; ++j);\n    if (j == 8) w = X[7] = -1; else w = X[j];\n\n    me.x = X;\n    me.i = 0;\n\n    // Discard an initial 256 values.\n    for (j = 256; j > 0; --j) {\n      me.next();\n    }\n  }\n\n  init(me, seed);\n}\n\nfunction copy(f, t) {\n  t.x = f.x.slice();\n  t.i = f.i;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  if (seed == null) seed = +(new Date);\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (state.x) copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xorshift7 = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n", "// A Javascript implementaion of Richard Brent's Xorgens xor4096 algorithm.\n//\n// This fast non-cryptographic random number generator is designed for\n// use in Monte-Carlo algorithms. It combines a long-period xorshift\n// generator with a Weyl generator, and it passes all common batteries\n// of stasticial tests for randomness while consuming only a few nanoseconds\n// for each prng generated.  For background on the generator, see Brent's\n// paper: \"Some long-period random number generators using shifts and xors.\"\n// http://arxiv.org/pdf/1004.3115v1.pdf\n//\n// Usage:\n//\n// var xor4096 = require('xor4096');\n// random = xor4096(1);                        // Seed with int32 or string.\n// assert.equal(random(), 0.1520436450538547); // (0, 1) range, 53 bits.\n// assert.equal(random.int32(), 1806534897);   // signed int32, 32 bits.\n//\n// For nonzero numeric keys, this impelementation provides a sequence\n// identical to that by Brent's xorgens 3 implementaion in C.  This\n// implementation also provides for initalizing the generator with\n// string seeds, or for saving and restoring the state of the generator.\n//\n// On Chrome, this prng benchmarks about 2.1 times slower than\n// Javascript's built-in Math.random().\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this;\n\n  // Set up generator function.\n  me.next = function() {\n    var w = me.w,\n        X = me.X, i = me.i, t, v;\n    // Update Weyl generator.\n    me.w = w = (w + 0x61c88647) | 0;\n    // Update xor generator.\n    v = X[(i + 34) & 127];\n    t = X[i = ((i + 1) & 127)];\n    v ^= v << 13;\n    t ^= t << 17;\n    v ^= v >>> 15;\n    t ^= t >>> 12;\n    // Update Xor generator array state.\n    v = X[i] = v ^ t;\n    me.i = i;\n    // Result is the combination.\n    return (v + (w ^ (w >>> 16))) | 0;\n  };\n\n  function init(me, seed) {\n    var t, v, i, j, w, X = [], limit = 128;\n    if (seed === (seed | 0)) {\n      // Numeric seeds initialize v, which is used to generates X.\n      v = seed;\n      seed = null;\n    } else {\n      // String seeds are mixed into v and X one character at a time.\n      seed = seed + '\\0';\n      v = 0;\n      limit = Math.max(limit, seed.length);\n    }\n    // Initialize circular array and weyl value.\n    for (i = 0, j = -32; j < limit; ++j) {\n      // Put the unicode characters into the array, and shuffle them.\n      if (seed) v ^= seed.charCodeAt((j + 32) % seed.length);\n      // After 32 shuffles, take v as the starting w value.\n      if (j === 0) w = v;\n      v ^= v << 10;\n      v ^= v >>> 15;\n      v ^= v << 4;\n      v ^= v >>> 13;\n      if (j >= 0) {\n        w = (w + 0x61c88647) | 0;     // Weyl.\n        t = (X[j & 127] ^= (v + w));  // Combine xor and weyl to init array.\n        i = (0 == t) ? i + 1 : 0;     // Count zeroes.\n      }\n    }\n    // We have detected all zeroes; make the key nonzero.\n    if (i >= 128) {\n      X[(seed && seed.length || 0) & 127] = -1;\n    }\n    // Run the generator 512 times to further mix the state before using it.\n    // Factoring this as a function slows the main generator, so it is just\n    // unrolled here.  The weyl generator is not advanced while warming up.\n    i = 127;\n    for (j = 4 * 128; j > 0; --j) {\n      v = X[(i + 34) & 127];\n      t = X[i = ((i + 1) & 127)];\n      v ^= v << 13;\n      t ^= t << 17;\n      v ^= v >>> 15;\n      t ^= t >>> 12;\n      X[i] = v ^ t;\n    }\n    // Storing state as object members is faster than using closure variables.\n    me.w = w;\n    me.X = X;\n    me.i = i;\n  }\n\n  init(me, seed);\n}\n\nfunction copy(f, t) {\n  t.i = f.i;\n  t.w = f.w;\n  t.X = f.X.slice();\n  return t;\n};\n\nfunction impl(seed, opts) {\n  if (seed == null) seed = +(new Date);\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (state.X) copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xor4096 = impl;\n}\n\n})(\n  this,                                     // window object or global\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n", "// A Javascript implementaion of the \"Tyche-i\" prng algorithm by\n// Samuel Neves and Filipe Araujo.\n// See https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this, strseed = '';\n\n  // Set up generator function.\n  me.next = function() {\n    var b = me.b, c = me.c, d = me.d, a = me.a;\n    b = (b << 25) ^ (b >>> 7) ^ c;\n    c = (c - d) | 0;\n    d = (d << 24) ^ (d >>> 8) ^ a;\n    a = (a - b) | 0;\n    me.b = b = (b << 20) ^ (b >>> 12) ^ c;\n    me.c = c = (c - d) | 0;\n    me.d = (d << 16) ^ (c >>> 16) ^ a;\n    return me.a = (a - b) | 0;\n  };\n\n  /* The following is non-inverted tyche, which has better internal\n   * bit diffusion, but which is about 25% slower than tyche-i in JS.\n  me.next = function() {\n    var a = me.a, b = me.b, c = me.c, d = me.d;\n    a = (me.a + me.b | 0) >>> 0;\n    d = me.d ^ a; d = d << 16 ^ d >>> 16;\n    c = me.c + d | 0;\n    b = me.b ^ c; b = b << 12 ^ d >>> 20;\n    me.a = a = a + b | 0;\n    d = d ^ a; me.d = d = d << 8 ^ d >>> 24;\n    me.c = c = c + d | 0;\n    b = b ^ c;\n    return me.b = (b << 7 ^ b >>> 25);\n  }\n  */\n\n  me.a = 0;\n  me.b = 0;\n  me.c = 2654435769 | 0;\n  me.d = 1367130551;\n\n  if (seed === Math.floor(seed)) {\n    // Integer seed.\n    me.a = (seed / 0x100000000) | 0;\n    me.b = seed | 0;\n  } else {\n    // String seed.\n    strseed += seed;\n  }\n\n  // Mix in string seed, then discard an initial batch of 64 values.\n  for (var k = 0; k < strseed.length + 20; k++) {\n    me.b ^= strseed.charCodeAt(k) | 0;\n    me.next();\n  }\n}\n\nfunction copy(f, t) {\n  t.a = f.a;\n  t.b = f.b;\n  t.c = f.c;\n  t.d = f.d;\n  return t;\n};\n\nfunction impl(seed, opts) {\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.tychei = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n", "/*\nCopyright 2019 David Bau.\n\nPermission is hereby granted, free of charge, to any person obtaining\na copy of this software and associated documentation files (the\n\"Software\"), to deal in the Software without restriction, including\nwithout limitation the rights to use, copy, modify, merge, publish,\ndistribute, sublicense, and/or sell copies of the Software, and to\npermit persons to whom the Software is furnished to do so, subject to\nthe following conditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\nCLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n*/\n\n(function (global, pool, math) {\n//\n// The following constants are related to IEEE 754 limits.\n//\n\nvar width = 256,        // each RC4 output is 0 <= x < 256\n    chunks = 6,         // at least six RC4 outputs for each double\n    digits = 52,        // there are 52 significant digits in a double\n    rngname = 'random', // rngname: name for Math.random and Math.seedrandom\n    startdenom = math.pow(width, chunks),\n    significance = math.pow(2, digits),\n    overflow = significance * 2,\n    mask = width - 1,\n    nodecrypto;         // node.js crypto module, initialized at the bottom.\n\n//\n// seedrandom()\n// This is the seedrandom function described above.\n//\nfunction seedrandom(seed, options, callback) {\n  var key = [];\n  options = (options == true) ? { entropy: true } : (options || {});\n\n  // Flatten the seed string or build one from local entropy if needed.\n  var shortseed = mixkey(flatten(\n    options.entropy ? [seed, tostring(pool)] :\n    (seed == null) ? autoseed() : seed, 3), key);\n\n  // Use the seed to initialize an ARC4 generator.\n  var arc4 = new ARC4(key);\n\n  // This function returns a random double in [0, 1) that contains\n  // randomness in every bit of the mantissa of the IEEE 754 value.\n  var prng = function() {\n    var n = arc4.g(chunks),             // Start with a numerator n < 2 ^ 48\n        d = startdenom,                 //   and denominator d = 2 ^ 48.\n        x = 0;                          //   and no 'extra last byte'.\n    while (n < significance) {          // Fill up all significant digits by\n      n = (n + x) * width;              //   shifting numerator and\n      d *= width;                       //   denominator and generating a\n      x = arc4.g(1);                    //   new least-significant-byte.\n    }\n    while (n >= overflow) {             // To avoid rounding up, before adding\n      n /= 2;                           //   last byte, shift everything\n      d /= 2;                           //   right using integer math until\n      x >>>= 1;                         //   we have exactly the desired bits.\n    }\n    return (n + x) / d;                 // Form the number within [0, 1).\n  };\n\n  prng.int32 = function() { return arc4.g(4) | 0; }\n  prng.quick = function() { return arc4.g(4) / 0x100000000; }\n  prng.double = prng;\n\n  // Mix the randomness into accumulated entropy.\n  mixkey(tostring(arc4.S), pool);\n\n  // Calling convention: what to return as a function of prng, seed, is_math.\n  return (options.pass || callback ||\n      function(prng, seed, is_math_call, state) {\n        if (state) {\n          // Load the arc4 state from the given state if it has an S array.\n          if (state.S) { copy(state, arc4); }\n          // Only provide the .state method if requested via options.state.\n          prng.state = function() { return copy(arc4, {}); }\n        }\n\n        // If called as a method of Math (Math.seedrandom()), mutate\n        // Math.random because that is how seedrandom.js has worked since v1.0.\n        if (is_math_call) { math[rngname] = prng; return seed; }\n\n        // Otherwise, it is a newer calling convention, so return the\n        // prng directly.\n        else return prng;\n      })(\n  prng,\n  shortseed,\n  'global' in options ? options.global : (this == math),\n  options.state);\n}\n\n//\n// ARC4\n//\n// An ARC4 implementation.  The constructor takes a key in the form of\n// an array of at most (width) integers that should be 0 <= x < (width).\n//\n// The g(count) method returns a pseudorandom integer that concatenates\n// the next (count) outputs from ARC4.  Its return value is a number x\n// that is in the range 0 <= x < (width ^ count).\n//\nfunction ARC4(key) {\n  var t, keylen = key.length,\n      me = this, i = 0, j = me.i = me.j = 0, s = me.S = [];\n\n  // The empty key [] is treated as [0].\n  if (!keylen) { key = [keylen++]; }\n\n  // Set up S using the standard key scheduling algorithm.\n  while (i < width) {\n    s[i] = i++;\n  }\n  for (i = 0; i < width; i++) {\n    s[i] = s[j = mask & (j + key[i % keylen] + (t = s[i]))];\n    s[j] = t;\n  }\n\n  // The \"g\" method returns the next (count) outputs as one number.\n  (me.g = function(count) {\n    // Using instance members instead of closure state nearly doubles speed.\n    var t, r = 0,\n        i = me.i, j = me.j, s = me.S;\n    while (count--) {\n      t = s[i = mask & (i + 1)];\n      r = r * width + s[mask & ((s[i] = s[j = mask & (j + t)]) + (s[j] = t))];\n    }\n    me.i = i; me.j = j;\n    return r;\n    // For robust unpredictability, the function call below automatically\n    // discards an initial batch of values.  This is called RC4-drop[256].\n    // See http://google.com/search?q=rsa+fluhrer+response&btnI\n  })(width);\n}\n\n//\n// copy()\n// Copies internal state of ARC4 to or from a plain object.\n//\nfunction copy(f, t) {\n  t.i = f.i;\n  t.j = f.j;\n  t.S = f.S.slice();\n  return t;\n};\n\n//\n// flatten()\n// Converts an object tree to nested arrays of strings.\n//\nfunction flatten(obj, depth) {\n  var result = [], typ = (typeof obj), prop;\n  if (depth && typ == 'object') {\n    for (prop in obj) {\n      try { result.push(flatten(obj[prop], depth - 1)); } catch (e) {}\n    }\n  }\n  return (result.length ? result : typ == 'string' ? obj : obj + '\\0');\n}\n\n//\n// mixkey()\n// Mixes a string seed into a key that is an array of integers, and\n// returns a shortened string seed that is equivalent to the result key.\n//\nfunction mixkey(seed, key) {\n  var stringseed = seed + '', smear, j = 0;\n  while (j < stringseed.length) {\n    key[mask & j] =\n      mask & ((smear ^= key[mask & j] * 19) + stringseed.charCodeAt(j++));\n  }\n  return tostring(key);\n}\n\n//\n// autoseed()\n// Returns an object for autoseeding, using window.crypto and Node crypto\n// module if available.\n//\nfunction autoseed() {\n  try {\n    var out;\n    if (nodecrypto && (out = nodecrypto.randomBytes)) {\n      // The use of 'out' to remember randomBytes makes tight minified code.\n      out = out(width);\n    } else {\n      out = new Uint8Array(width);\n      (global.crypto || global.msCrypto).getRandomValues(out);\n    }\n    return tostring(out);\n  } catch (e) {\n    var browser = global.navigator,\n        plugins = browser && browser.plugins;\n    return [+new Date, global, plugins, global.screen, tostring(pool)];\n  }\n}\n\n//\n// tostring()\n// Converts an array of charcodes to a string\n//\nfunction tostring(a) {\n  return String.fromCharCode.apply(0, a);\n}\n\n//\n// When seedrandom.js is loaded, we immediately mix a few bits\n// from the built-in RNG into the entropy pool.  Because we do\n// not want to interfere with deterministic PRNG state later,\n// seedrandom will not call math.random on its own again after\n// initialization.\n//\nmixkey(math.random(), pool);\n\n//\n// Nodejs and AMD support: export the implementation as a module using\n// either convention.\n//\nif ((typeof module) == 'object' && module.exports) {\n  module.exports = seedrandom;\n  // When in node.js, try using crypto package for autoseeding.\n  try {\n    nodecrypto = require('crypto');\n  } catch (ex) {}\n} else if ((typeof define) == 'function' && define.amd) {\n  define(function() { return seedrandom; });\n} else {\n  // When included as a plain script, set up Math.seedrandom global.\n  math['seed' + rngname] = seedrandom;\n}\n\n\n// End anonymous scope, and pass initial values.\n})(\n  // global: `self` in browsers (including strict mode and web workers),\n  // otherwise `this` in Node and other environments\n  (typeof self !== 'undefined') ? self : this,\n  [],     // pool: entropy pool starts empty\n  Math    // math: package containing random, pow, and seedrandom\n);\n", "// A library of seedable RNGs implemented in Javascript.\n//\n// Usage:\n//\n// var seedrandom = require('seedrandom');\n// var random = seedrandom(1); // or any seed.\n// var x = random();       // 0 <= x < 1.  Every bit is random.\n// var x = random.quick(); // 0 <= x < 1.  32 bits of randomness.\n\n// alea, a 53-bit multiply-with-carry generator by Johannes Baagøe.\n// Period: ~2^116\n// Reported to pass all BigCrush tests.\nvar alea = require('./lib/alea');\n\n// xor128, a pure xor-shift generator by George Marsaglia.\n// Period: 2^128-1.\n// Reported to fail: MatrixRank and LinearComp.\nvar xor128 = require('./lib/xor128');\n\n// xorwow, George Marsaglia's 160-bit xor-shift combined plus weyl.\n// Period: 2^192-2^32\n// Reported to fail: CollisionOver, SimpPoker, and LinearComp.\nvar xorwow = require('./lib/xorwow');\n\n// xorshift7, by François Panneton and Pierre L'ecuyer, takes\n// a different approach: it adds robustness by allowing more shifts\n// than Marsaglia's original three.  It is a 7-shift generator\n// with 256 bits, that passes BigCrush with no systmatic failures.\n// Period 2^256-1.\n// No systematic BigCrush failures reported.\nvar xorshift7 = require('./lib/xorshift7');\n\n// xor4096, by Richard Brent, is a 4096-bit xor-shift with a\n// very long period that also adds a Weyl generator. It also passes\n// BigCrush with no systematic failures.  Its long period may\n// be useful if you have many generators and need to avoid\n// collisions.\n// Period: 2^4128-2^32.\n// No systematic BigCrush failures reported.\nvar xor4096 = require('./lib/xor4096');\n\n// Tyche-i, by Samuel Neves and Filipe Araujo, is a bit-shifting random\n// number generator derived from ChaCha, a modern stream cipher.\n// https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf\n// Period: ~2^127\n// No systematic BigCrush failures reported.\nvar tychei = require('./lib/tychei');\n\n// The original ARC4-based prng included in this library.\n// Period: ~2^1600\nvar sr = require('./seedrandom');\n\nsr.alea = alea;\nsr.xor128 = xor128;\nsr.xorwow = xorwow;\nsr.xorshift7 = xorshift7;\nsr.xor4096 = xor4096;\nsr.tychei = tychei;\n\nmodule.exports = sr;\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport * as seedrandom from 'seedrandom';\n\nimport {expectNumbersClose, testEpsilon} from '../test_util';\nimport {TypedArray} from '../types';\n\nexport interface RandomBase {\n  nextValue(): number;\n}\n\nexport interface RandomGamma {\n  nextValue(): number;\n}\n\nexport interface RandNormalDataTypes {\n  float32: Float32Array;\n  int32: Int32Array;\n}\n\nexport interface RandGammaDataTypes {\n  float32: Float32Array;\n  int32: Int32Array;\n}\n\n// https://en.wikipedia.org/wiki/Marsaglia_polar_method\nexport class MPRandGauss implements RandomBase {\n  private mean: number;\n  private stdDev: number;\n  private nextVal: number;\n  private dtype?: keyof RandNormalDataTypes;\n  private truncated?: boolean;\n  private upper?: number;\n  private lower?: number;\n  private random: seedrandom.prng;\n\n  constructor(\n      mean: number, stdDeviation: number, dtype?: keyof RandNormalDataTypes,\n      truncated?: boolean, seed?: number) {\n    this.mean = mean;\n    this.stdDev = stdDeviation;\n    this.dtype = dtype;\n    this.nextVal = NaN;\n    this.truncated = truncated;\n    if (this.truncated) {\n      this.upper = this.mean + this.stdDev * 2;\n      this.lower = this.mean - this.stdDev * 2;\n    }\n    const seedValue = seed ? seed : Math.random();\n    this.random = seedrandom.alea(seedValue.toString());\n  }\n\n  /** Returns next sample from a Gaussian distribution. */\n  public nextValue(): number {\n    if (!isNaN(this.nextVal)) {\n      const value = this.nextVal;\n      this.nextVal = NaN;\n      return value;\n    }\n\n    let resultX: number, resultY: number;\n    let isValid = false;\n    while (!isValid) {\n      let v1: number, v2: number, s: number;\n      do {\n        v1 = 2 * this.random() - 1;\n        v2 = 2 * this.random() - 1;\n        s = v1 * v1 + v2 * v2;\n      } while (s >= 1 || s === 0);\n\n      const mul = Math.sqrt(-2.0 * Math.log(s) / s);\n      resultX = this.mean + this.stdDev * v1 * mul;\n      resultY = this.mean + this.stdDev * v2 * mul;\n\n      if (!this.truncated || this.isValidTruncated(resultX)) {\n        isValid = true;\n      }\n    }\n\n    if (!this.truncated || this.isValidTruncated(resultY)) {\n      this.nextVal = this.convertValue(resultY);\n    }\n    return this.convertValue(resultX);\n  }\n\n  /** Handles proper rounding for non-floating-point numbers. */\n  private convertValue(value: number): number {\n    if (this.dtype == null || this.dtype === 'float32') {\n      return value;\n    }\n    return Math.round(value);\n  }\n\n  /** Returns true if less than 2-standard-deviations from the mean. */\n  private isValidTruncated(value: number): boolean {\n    return value <= this.upper && value >= this.lower;\n  }\n}\n\n// Marsaglia, George, and Wai Wan Tsang. 2000. \"A Simple Method for Generating\n// Gamma Variables.\"\nexport class RandGamma implements RandomGamma {\n  private alpha: number;\n  private beta: number;\n  private d: number;\n  private c: number;\n  private dtype?: keyof RandGammaDataTypes;\n  private randu: seedrandom.prng;\n  private randn: MPRandGauss;\n\n  constructor(\n      alpha: number, beta: number, dtype: keyof RandGammaDataTypes,\n      seed?: number) {\n    this.alpha = alpha;\n    this.beta = 1 / beta;  // convert rate to scale parameter\n    this.dtype = dtype;\n\n    const seedValue = seed ? seed : Math.random();\n    this.randu = seedrandom.alea(seedValue.toString());\n    this.randn = new MPRandGauss(0, 1, dtype, false, this.randu());\n\n    if (alpha < 1) {\n      this.d = alpha + (2 / 3);\n    } else {\n      this.d = alpha - (1 / 3);\n    }\n    this.c = 1 / Math.sqrt(9 * this.d);\n  }\n\n  /** Returns next sample from a gamma distribution. */\n  public nextValue(): number {\n    let x2: number, v0: number, v1: number, x: number, u: number, v: number;\n    while (true) {\n      do {\n        x = this.randn.nextValue();\n        v = 1 + (this.c * x);\n      } while (v <= 0);\n      v *= v * v;\n      x2 = x * x;\n      v0 = 1 - (0.331 * x2 * x2);\n      v1 = (0.5 * x2) + (this.d * (1 - v + Math.log(v)));\n      u = this.randu();\n      if (u < v0 || Math.log(u) < v1) {\n        break;\n      }\n    }\n    v = (1 / this.beta) * this.d * v;\n    if (this.alpha < 1) {\n      v *= Math.pow(this.randu(), 1 / this.alpha);\n    }\n    return this.convertValue(v);\n  }\n  /** Handles proper rounding for non-floating-point numbers. */\n  private convertValue(value: number): number {\n    if (this.dtype === 'float32') {\n      return value;\n    }\n    return Math.round(value);\n  }\n}\n\nexport class UniformRandom implements RandomBase {\n  private min: number;\n  private range: number;\n  private random: seedrandom.prng;\n  private dtype?: keyof RandNormalDataTypes;\n\n  constructor(\n      min = 0, max = 1, dtype?: keyof RandNormalDataTypes,\n      seed?: string|number) {\n    this.min = min;\n    this.range = max - min;\n    this.dtype = dtype;\n    if (seed == null) {\n      seed = Math.random();\n    }\n    if (typeof seed === 'number') {\n      seed = seed.toString();\n    }\n\n    if (!this.canReturnFloat() && this.range <= 1) {\n      throw new Error(\n          `The difference between ${min} - ${max} <= 1 and dtype is not float`);\n    }\n    this.random = seedrandom.alea(seed);\n  }\n\n  /** Handles proper rounding for non floating point numbers. */\n  private canReturnFloat = () =>\n      (this.dtype == null || this.dtype === 'float32');\n\n  private convertValue(value: number): number {\n    if (this.canReturnFloat()) {\n      return value;\n    }\n    return Math.round(value);\n  }\n\n  nextValue() {\n    return this.convertValue(this.min + this.range * this.random());\n  }\n}\n\nexport function jarqueBeraNormalityTest(values: TypedArray|number[]) {\n  // https://en.wikipedia.org/wiki/Jarque%E2%80%93Bera_test\n  const n = values.length;\n  const s = skewness(values);\n  const k = kurtosis(values);\n  const jb = n / 6 * (Math.pow(s, 2) + 0.25 * Math.pow(k - 3, 2));\n  // JB test requires 2-degress of freedom from Chi-Square @ 0.95:\n  // http://www.itl.nist.gov/div898/handbook/eda/section3/eda3674.htm\n  const CHI_SQUARE_2DEG = 5.991;\n  if (jb > CHI_SQUARE_2DEG) {\n    throw new Error(`Invalid p-value for JB: ${jb}`);\n  }\n}\n\nexport function expectArrayInMeanStdRange(\n    actual: TypedArray|number[], expectedMean: number, expectedStdDev: number,\n    epsilon?: number) {\n  if (epsilon == null) {\n    epsilon = testEpsilon();\n  }\n  const actualMean = mean(actual);\n  expectNumbersClose(actualMean, expectedMean, epsilon);\n  expectNumbersClose(\n      standardDeviation(actual, actualMean), expectedStdDev, epsilon);\n}\n\nfunction mean(values: TypedArray|number[]) {\n  let sum = 0;\n  for (let i = 0; i < values.length; i++) {\n    sum += values[i];\n  }\n  return sum / values.length;\n}\n\nfunction standardDeviation(values: TypedArray|number[], mean: number) {\n  let squareDiffSum = 0;\n  for (let i = 0; i < values.length; i++) {\n    const diff = values[i] - mean;\n    squareDiffSum += diff * diff;\n  }\n  return Math.sqrt(squareDiffSum / values.length);\n}\n\nfunction kurtosis(values: TypedArray|number[]) {\n  // https://en.wikipedia.org/wiki/Kurtosis\n  const valuesMean = mean(values);\n  const n = values.length;\n  let sum2 = 0;\n  let sum4 = 0;\n  for (let i = 0; i < n; i++) {\n    const v = values[i] - valuesMean;\n    sum2 += Math.pow(v, 2);\n    sum4 += Math.pow(v, 4);\n  }\n  return (1 / n) * sum4 / Math.pow((1 / n) * sum2, 2);\n}\n\nfunction skewness(values: TypedArray|number[]) {\n  // https://en.wikipedia.org/wiki/Skewness\n  const valuesMean = mean(values);\n  const n = values.length;\n  let sum2 = 0;\n  let sum3 = 0;\n  for (let i = 0; i < n; i++) {\n    const v = values[i] - valuesMean;\n    sum2 += Math.pow(v, 2);\n    sum3 += Math.pow(v, 3);\n  }\n  return (1 / n) * sum3 / Math.pow((1 / (n - 1)) * sum2, 3 / 2);\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {Rank, ShapeMap} from '../types';\nimport {assertNonNegativeIntegerDimensions} from '../util_base';\n\nimport {buffer} from './buffer';\nimport {op} from './operation';\nimport {RandGamma} from './rand_util';\n\n/**\n * Creates a `tf.Tensor` with values sampled from a gamma distribution.\n *\n * ```js\n * tf.randomGamma([2, 2], 1).print();\n * ```\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param alpha The shape parameter of the gamma distribution.\n * @param beta The inverse scale parameter of the gamma distribution. Defaults\n *     to 1.\n * @param dtype The data type of the output. Defaults to float32.\n * @param seed The seed for the random number generator.\n *\n * @doc {heading: 'Tensors', subheading: 'Random'}\n */\nfunction randomGamma_<R extends Rank>(\n    shape: ShapeMap[R], alpha: number, beta = 1,\n    dtype: 'float32'|'int32' = 'float32', seed?: number): Tensor<R> {\n  assertNonNegativeIntegerDimensions(shape);\n  if (beta == null) {\n    beta = 1;\n  }\n  if (dtype == null) {\n    dtype = 'float32';\n  }\n  if (dtype !== 'float32' && dtype !== 'int32') {\n    throw new Error(`Unsupported data type ${dtype}`);\n  }\n  const rgamma = new RandGamma(alpha, beta, dtype, seed);\n  const res = buffer(shape, dtype);\n  for (let i = 0; i < res.values.length; i++) {\n    res.values[i] = rgamma.nextValue();\n  }\n  return res.toTensor();\n}\n\nexport const randomGamma = /* @__PURE__ */ op({randomGamma_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {DataType, Rank, ShapeMap} from '../types';\nimport {assertNonNegativeIntegerDimensions} from '../util_base';\n\nimport {buffer} from './buffer';\nimport {op} from './operation';\nimport {MPRandGauss} from './rand_util';\n\n/**\n * Creates a `tf.Tensor` with values sampled from a normal distribution.\n *\n * ```js\n * tf.randomNormal([2, 2]).print();\n * ```\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param mean The mean of the normal distribution.\n * @param stdDev The standard deviation of the normal distribution.\n * @param dtype The data type of the output.\n * @param seed The seed for the random number generator.\n *\n * @doc {heading: 'Tensors', subheading: 'Random'}\n */\nfunction randomNormal_<R extends Rank>(\n    shape: ShapeMap[R], mean = 0, stdDev = 1, dtype?: 'float32'|'int32',\n    seed?: number): Tensor<R> {\n  assertNonNegativeIntegerDimensions(shape);\n  if (dtype != null && (dtype as DataType) === 'bool') {\n    throw new Error(`Unsupported data type ${dtype}`);\n  }\n  const randGauss =\n      new MPRandGauss(mean, stdDev, dtype, false /* truncated */, seed);\n  const res = buffer(shape, dtype);\n  for (let i = 0; i < res.values.length; i++) {\n    res.values[i] = randGauss.nextValue();\n  }\n  return res.toTensor();\n}\n\nexport const randomNormal = /* @__PURE__ */ op({randomNormal_});\n", "/**\n * @license\n * Copyright 2022 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {DataType, Rank, ShapeMap} from '../types';\n\nimport {op} from './operation';\nimport {randomNormal} from './random_normal';\n\n/**\n * Creates a `tf.Tensor` with values sampled from a normal distribution.\n *\n * The generated values will have mean 0 and standard deviation 1.\n *\n * ```js\n * tf.randomStandardNormal([2, 2]).print();\n * ```\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param dtype The data type of the output.\n * @param seed The seed for the random number generator.\n *\n * @doc {heading: 'Tensors', subheading: 'Random'}\n */\nfunction randomStandardNormal_<R extends Rank>(\n    shape: ShapeMap[R], dtype?: 'float32'|'int32', seed?: number): Tensor<R> {\n  if (dtype != null && (dtype as DataType) === 'bool') {\n    throw new Error(`Unsupported data type ${dtype}`);\n  }\n  return randomNormal(shape, 0, 1, dtype, seed);\n}\n\nexport const randomStandardNormal = /* @__PURE__ */ op({randomStandardNormal_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {DataType, Rank, ShapeMap} from '../types';\nimport {assertNonNegativeIntegerDimensions} from '../util_base';\n\nimport {buffer} from './buffer';\nimport {op} from './operation';\nimport {UniformRandom} from './rand_util';\n\n/**\n * Creates a `tf.Tensor` with values sampled from a uniform distribution.\n *\n * The generated values follow a uniform distribution in the range [minval,\n * maxval). The lower bound minval is included in the range, while the upper\n * bound maxval is excluded.\n *\n * ```js\n * tf.randomUniform([2, 2]).print();\n * ```\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param minval The lower bound on the range of random values to generate.\n *   Defaults to 0.\n * @param maxval The upper bound on the range of random values to generate.\n *   Defaults to 1.\n * @param dtype The data type of the output tensor. Defaults to 'float32'.\n * @param seed An optional int. Defaults to 0. If seed is set to be non-zero,\n *   the random number generator is seeded by the given seed. Otherwise, it is\n *   seeded by a random seed.\n *\n * @doc {heading: 'Tensors', subheading: 'Random'}\n */\nfunction randomUniform_<R extends Rank>(\n    shape: ShapeMap[R], minval = 0, maxval = 1, dtype: DataType = 'float32',\n    seed?: number|string): Tensor<R> {\n  assertNonNegativeIntegerDimensions(shape);\n  const res = buffer(shape, dtype);\n  const random = new UniformRandom(minval, maxval, null, seed);\n  for (let i = 0; i < res.values.length; i++) {\n    res.values[i] = random.nextValue();\n  }\n  return res.toTensor();\n}\n\nexport const randomUniform = /* @__PURE__ */ op({randomUniform_});\n", "/**\n * @license\n * Copyright 2023 Google LLC.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {Rank, ShapeMap} from '../types';\nimport {op} from './operation';\nimport {randomUniform} from './random_uniform';\n\n/**\n * Creates a `tf.Tensor` with integers sampled from a uniform distribution.\n *\n * The generated values are uniform integers in the range [minval, maxval). The\n * lower bound minval is included in the range, while the upper bound maxval is\n * excluded.\n *\n * ```js\n * tf.randomUniformInt([2, 2], 0, 10).print();\n * ```\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param minval Inclusive lower bound on the generated integers.\n * @param maxval Exclusive upper bound on the generated integers.\n * @param seed An optional int. Defaults to 0. If seed is set to be non-zero,\n *   the random number generator is seeded by the given seed. Otherwise, it is\n *   seeded by a random seed.\n *\n * @doc {heading: 'Tensors', subheading: 'Random'}\n */\nfunction randomUniformInt_<R extends Rank>(\n  shape: ShapeMap[R], minval: number, maxval: number,\n    seed?: number|string): Tensor<R> {\n  // TODO(mattsoulanille): Handle optional seed2 input.\n  return randomUniform(shape, minval, maxval, 'int32', seed);\n}\n\nexport const randomUniformInt = /* @__PURE__ */ op({randomUniformInt_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Range, RangeAttrs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor1D} from '../tensor';\n\n/**\n * Creates a new `tf.Tensor1D` filled with the numbers in the range provided.\n *\n * The tensor is a half-open interval meaning it includes start, but\n * excludes stop. Decrementing ranges and negative step values are also\n * supported.\n *\n *\n * ```js\n * tf.range(0, 9, 2).print();\n * ```\n *\n * @param start An integer start value\n * @param stop An integer stop value\n * @param step An integer increment (will default to 1 or -1)\n * @param dtype The data type of the output tensor. Defaults to 'float32'.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function range(\n    start: number, stop: number, step = 1,\n    dtype: 'float32'|'int32' = 'float32'): Tensor1D {\n  if (step === 0) {\n    throw new Error('Cannot have a step of zero');\n  }\n\n  const attrs: RangeAttrs = {start, stop, step, dtype};\n\n  return ENGINE.runKernel(Range, {} /* inputs */,\n      attrs as unknown as NamedAttrMap);\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Real, RealInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {op} from './operation';\n\n/**\n * Returns the real part of a complex (or real) tensor.\n *\n * Given a tensor input, this operation returns a tensor of type float that is\n * the real part of each element in input considered as a complex number.\n *\n * If the input is real, it simply makes a clone.\n *\n * ```js\n * const x = tf.complex([-2.25, 3.25], [4.75, 5.75]);\n * tf.real(x).print();\n * ```\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction real_<T extends Tensor>(input: T|TensorLike): T {\n  const $input = convertToTensor(input, 'input', 'real');\n\n  const inputs: RealInputs = {input: $input};\n  return ENGINE.runKernel(Real, inputs as unknown as NamedTensorMap);\n}\n\nexport const real = /* @__PURE__ */ op({real_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Reciprocal, ReciprocalInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes reciprocal of x element-wise: `1 / x`\n *\n * ```js\n * const x = tf.tensor1d([0, 1, 2]);\n *\n * x.reciprocal().print();  // or tf.reciprocal(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction reciprocal_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'reciprocal');\n\n  const inputs: ReciprocalInputs = {x: $x};\n  return ENGINE.runKernel(Reciprocal, inputs as unknown as NamedTensorMap);\n}\nexport const reciprocal = /* @__PURE__ */ op({reciprocal_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Relu, ReluInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes rectified linear element-wise: `max(x, 0)`.\n *\n * ```js\n * const x = tf.tensor1d([-1, 2, -3, 4]);\n *\n * x.relu().print();  // or tf.relu(x)\n * ```\n * @param x The input tensor. If the dtype is `bool`, the output dtype will be\n *     `int32`.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction relu_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'relu');\n\n  const inputs: ReluInputs = {x: $x};\n\n  return ENGINE.runKernel(Relu, inputs as unknown as NamedTensorMap);\n}\n\nexport const relu = /* @__PURE__ */ op({relu_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Relu6, Relu6Inputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes rectified linear 6 element-wise: `min(max(x, 0), 6)`.\n *\n * ```js\n * const x = tf.tensor1d([-1, 2, -3, 8]);\n *\n * x.relu6().print();  // or tf.relu6(x)\n * ```\n * @param x The input tensor. If the dtype is `bool`, the output dtype will be\n *     `int32`.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction relu6_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'relu6');\n\n  const inputs: Relu6Inputs = {x: $x};\n\n  return ENGINE.runKernel(Relu6, inputs as unknown as NamedTensorMap);\n}\n\nexport const relu6 = /* @__PURE__ */ op({relu6_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Reverse, ReverseAttrs, ReverseInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Reverses a `tf.Tensor` along a specified axis.\n *\n * Also available are stricter rank-specific methods that assert that `x` is\n * of the given rank:\n *   - `tf.reverse1d`\n *   - `tf.reverse2d`\n *   - `tf.reverse3d`\n *   - `tf.reverse4d`\n *\n * Except `tf.reverse1d` (which does not have axis param), all methods have\n * same signature as this method.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n *\n * x.reverse().print();\n * ```\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * const axis = 1;\n * x.reverse(axis).print();\n * ```\n * @param x The input tensor to be reversed.\n * @param axis The set of dimensions to reverse. Must be in the\n *     range [-rank(x), rank(x)). Defaults to all axes.\n *\n * @doc {heading: 'Tensors', subheading: 'Slicing and Joining'}\n */\nfunction reverse_<T extends Tensor>(\n    x: T|TensorLike, axis?: number|number[]): T {\n  const $x = convertToTensor(x, 'x', 'reverse');\n\n  const inputs: ReverseInputs = {x: $x};\n  const attrs: ReverseAttrs = {dims: axis};\n\n  return ENGINE.runKernel(\n      Reverse, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const reverse = /* @__PURE__ */ op({reverse_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor1D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\nimport {op} from './operation';\nimport {reverse} from './reverse';\n\n/**\n * Reverses a `tf.Tensor1D`.\n *\n * @param x The input tensor.\n */\nfunction reverse1d_(x: Tensor1D|TensorLike): Tensor1D {\n  const $x = convertToTensor(x, 'x', 'reverse');\n  util.assert(\n      $x.rank === 1,\n      () => `Error in reverse1D: x must be rank 1 but got rank ${$x.rank}.`);\n  return reverse($x, 0);\n}\n\nexport const reverse1d = /* @__PURE__ */ op({reverse1d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor2D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\nimport {op} from './operation';\nimport {reverse} from './reverse';\n\n/**\n * Reverses a `tf.Tensor2D` along a specified axis.\n *\n * @param x The input tensor.\n * @param axis The set of dimensions to reverse. Must be in the\n *     range [-rank(x), rank(x)). Defaults to all axes.\n */\nfunction reverse2d_(x: Tensor2D|TensorLike, axis?: number|number[]): Tensor2D {\n  const $x = convertToTensor(x, 'x', 'reverse');\n  util.assert(\n      $x.rank === 2,\n      () => `Error in reverse2D: x must be rank 2 but got rank ${$x.rank}.`);\n  return reverse($x, axis);\n}\n\nexport const reverse2d = /* @__PURE__ */ op({reverse2d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor3D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\nimport {op} from './operation';\nimport {reverse} from './reverse';\n\n/**\n * Reverses a `tf.Tensor3D` along a specified axis.\n *\n * @param x The input tensor.\n * @param axis The set of dimensions to reverse. Must be in the\n *     range [-rank(x), rank(x)). Defaults to all axes.\n */\nfunction reverse3d_(x: Tensor3D|TensorLike, axis?: number|number[]): Tensor3D {\n  const $x = convertToTensor(x, 'x', 'reverse');\n  util.assert(\n      $x.rank === 3,\n      () => `Error in reverse3D: x must be rank 3 but got rank ${$x.rank}.`);\n  return reverse($x, axis);\n}\n\nexport const reverse3d = /* @__PURE__ */ op({reverse3d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor4D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\nimport {op} from './operation';\nimport {reverse} from './reverse';\n\n/**\n * Reverses a `tf.Tensor4D` along a specified axis.\n *\n * @param x The input tensor.\n * @param axis The set of dimensions to reverse. Must be in the\n *     range [-rank(x), rank(x)). Defaults to all axes.\n */\nfunction reverse4d_(x: Tensor4D|TensorLike, axis?: number|number[]): Tensor4D {\n  const $x = convertToTensor(x, 'x', 'reverse');\n  util.assert(\n      $x.rank === 4,\n      () => `Error in reverse4D: x must be rank 4 but got rank ${$x.rank}.`);\n  return reverse($x, axis);\n}\n\nexport const reverse4d = /* @__PURE__ */ op({reverse4d_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Round, RoundInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes round of input `tf.Tensor` element-wise: `round(x)`.\n * It implements banker's rounding.\n *\n * ```js\n * const x = tf.tensor1d([.6, 1.1, -3.3]);\n *\n * x.round().print();  // or tf.round(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction round_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'round');\n  const inputs: RoundInputs = {x: $x};\n\n  return ENGINE.runKernel(Round, inputs as unknown as NamedTensorMap);\n}\n\nexport const round = /* @__PURE__ */ op({round_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Rsqrt, RsqrtInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes reciprocal of square root of the input `tf.Tensor` element-wise:\n * `y = 1 / sqrt(x)`\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 4, -1]);\n *\n * x.rsqrt().print();  // or tf.rsqrt(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction rsqrt_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'rsqrt', 'float32');\n\n  const inputs: RsqrtInputs = {x: $x};\n\n  return ENGINE.runKernel(Rsqrt, inputs as unknown as NamedTensorMap);\n}\nexport const rsqrt = /* @__PURE__ */ op({rsqrt_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Selu, SeluInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes scaled exponential linear element-wise.\n *\n * `x < 0 ? scale * alpha * (exp(x) - 1) : scale * x`\n *\n * ```js\n * const x = tf.tensor1d([-1, 2, -3, 4]);\n *\n * x.selu().print();  // or tf.selu(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction selu_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'selu');\n\n  const inputs: SeluInputs = {x: $x};\n\n  return ENGINE.runKernel(Selu, inputs as unknown as NamedTensorMap);\n}\n\nexport const selu = /* @__PURE__ */ op({selu_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {conv2d} from './conv2d';\nimport {depthwiseConv2d} from './depthwise_conv2d';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * 2-D convolution with separable filters.\n *\n * Performs a depthwise convolution that acts separately on channels followed\n * by a pointwise convolution that mixes channels. Note that this is\n * separability between dimensions [1, 2] and 3, not spatial separability\n * between dimensions 1 and 2.\n *\n * See\n * [https://www.tensorflow.org/api_docs/python/tf/nn/separable_conv2d](\n *     https://www.tensorflow.org/api_docs/python/tf/nn/separable_conv2d)\n * for more details.\n *\n * @param x The input tensor, of rank 4 or rank 3, of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is\n * assumed.\n * @param depthwiseFilter The depthwise filter tensor, rank 4, of shape\n *     `[filterHeight, filterWidth, inChannels, channelMultiplier]`. This is\n *     the filter used in the first step.\n * @param pointwiseFilter The pointwise filter tensor, rank 4, of shape\n *     `[1, 1, inChannels * channelMultiplier, outChannels]`. This is\n *     the filter used in the second step.\n * @param strides The strides of the convolution: `[strideHeight,\n * strideWidth]`. If strides is a single number, then `strideHeight ==\n * strideWidth`.\n * @param pad The type of padding algorithm.\n *   - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *   - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n *   - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dilations The dilation rates: `[dilationHeight, dilationWidth]`\n *     in which we sample input values across the height and width dimensions\n *     in atrous convolution. Defaults to `[1, 1]`. If `rate` is a single\n *     number, then `dilationHeight == dilationWidth`. If it is greater than\n *     1, then all values of `strides` must be 1.\n * @param dataFormat: An optional string from: \"NHWC\", \"NCHW\". Defaults to\n *     \"NHWC\". Specify the data format of the input and output data. With the\n *     default format \"NHWC\", the data is stored in the order of: [batch,\n *     height, width, channels]. Only \"NHWC\" is currently supported.\n *\n * @doc {heading: 'Operations', subheading: 'Convolution'}\n */\nfunction separableConv2d_<T extends Tensor3D|Tensor4D>(\n    x: T|TensorLike, depthwiseFilter: Tensor4D|TensorLike,\n    pointwiseFilter: Tensor4D|TensorLike, strides: [number, number]|number,\n    pad: 'valid'|'same', dilation: [number, number]|number = [1, 1],\n    dataFormat: 'NHWC'|'NCHW' = 'NHWC'): T {\n  const $x = convertToTensor(x, 'x', 'separableConv2d');\n  const $depthwiseFilter =\n      convertToTensor(depthwiseFilter, 'depthwiseFilter', 'separableConv2d');\n  const $pointwiseFilter =\n      convertToTensor(pointwiseFilter, 'pointwiseFilter', 'separableConv2d');\n\n  let x4D = $x as Tensor4D;\n  let reshapedTo4D = false;\n  if ($x.rank === 3) {\n    reshapedTo4D = true;\n    x4D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2]]);\n  }\n\n  if (dataFormat === 'NCHW') {\n    throw new Error(\n        'separableConv2d currently does not support dataFormat NCHW; only ' +\n        'NHWC is supported');\n  }\n\n  util.assert(\n      x4D.rank === 4,\n      () => `Error in separableConv2d: input must be rank 4, but got ` +\n          `rank ${x4D.rank}.`);\n  util.assert(\n      $depthwiseFilter.rank === 4,\n      () => `Error in separableConv2d: depthwise filter must be rank 4, but ` +\n          `got rank ${$depthwiseFilter.rank}.`);\n  util.assert(\n      $pointwiseFilter.rank === 4,\n      () => `Error in separableConv2d: pointwise filter must be rank 4, but ` +\n          `got rank ${$depthwiseFilter.rank}.`);\n  util.assert(\n      $pointwiseFilter.shape[0] === 1,\n      () =>\n          `Error in separableConv2d: the first dimension of pointwise filter ` +\n          ` must be 1, but got ${$pointwiseFilter.shape[0]}.`);\n  util.assert(\n      $pointwiseFilter.shape[1] === 1,\n      () => `Error in separableConv2d: the second dimension of pointwise ` +\n          `filter must be 1, but got ${$pointwiseFilter.shape[1]}.`);\n\n  const inChannels = $depthwiseFilter.shape[2];\n  const channelMultiplier = $depthwiseFilter.shape[3];\n  util.assert(\n      $pointwiseFilter.shape[2] === inChannels * channelMultiplier,\n      () =>\n          `Error in separableConv2d: the third dimension of pointwise filter ` +\n          `must be ${inChannels * channelMultiplier}, ` +\n          `but got ${$pointwiseFilter.shape[2]}.`);\n\n  const depthwise = depthwiseConv2d(\n      x4D, $depthwiseFilter, strides, pad, dataFormat, dilation);\n  const pointwiseStride = 1;\n  const res =\n      conv2d(depthwise, $pointwiseFilter, pointwiseStride, 'valid', dataFormat);\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n  return res as T;\n}\n\nexport const separableConv2d = /* @__PURE__ */ op({separableConv2d_});\n", "/**\n * @license\n * Copyright 2020 Google Inc. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor, TensorBuffer} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\n/**\n * Computes the difference between two lists of numbers.\n *\n * Given a Tensor `x` and a Tensor `y`, this operation returns a Tensor `out`\n * that represents all values that are in `x` but not in `y`. The returned\n * Tensor `out` is sorted in the same order that the numbers appear in `x`\n * (duplicates are preserved). This operation also returns a Tensor indices that\n * represents the position of each out element in `x`. In other words:\n *\n * `out[i] = x[idx[i]] for i in [0, 1, ..., out.length - 1]`\n *\n * ```js\n * const x = [1, 2, 3, 4, 5, 6];\n * const y = [1, 3, 5];\n *\n * const [out, indices] = await tf.setdiff1dAsync(x, y);\n * out.print(); // [2, 4, 6]\n * indices.print(); // [1, 3, 5]\n * ```\n *\n * @param x 1-D Tensor. Values to keep.\n * @param y 1-D Tensor. Must have the same type as x. Values to exclude in the\n *     output.\n * @returns Promise of Tensor tuple [out, indices].\n *  out: Tensor with the same type as x.\n *  indices: A Tensor of type int32.\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nasync function setdiff1dAsync_(\n    x: Tensor|TensorLike, y: Tensor|TensorLike): Promise<[Tensor, Tensor]> {\n  const $x = convertToTensor(x, 'x', 'setdiff1d');\n  const $y = convertToTensor(y, 'y', 'setdiff1d');\n\n  util.assert(\n      $x.dtype === $y.dtype,\n      () => `x and y should have the same dtype, but got x (${\n          $x.dtype}) and y (${$y.dtype}).`);\n\n  util.assert(\n      $x.rank === 1, () => `x should be 1D tensor, but got x (${$x.shape}).`);\n\n  util.assert(\n      $y.rank === 1, () => `y should be 1D tensor, but got y (${$y.shape}).`);\n\n  const xVals = await $x.data();\n  const yVals = await $y.data();\n  const ySet = new Set(yVals);\n\n  let outputSize = 0;\n  for (let i = 0; i < xVals.length; i++) {\n    if (!ySet.has(xVals[i])) {\n      outputSize++;\n    }\n  }\n\n  const buffer = new TensorBuffer([outputSize], $x.dtype);\n  const indices = new TensorBuffer([outputSize], 'int32');\n  for (let i = 0, p = 0; i < xVals.length; i++) {\n    if (!ySet.has(xVals[i])) {\n      buffer.values[p] = xVals[i];\n      indices.values[p] = i;\n      p++;\n    }\n  }\n  return [buffer.toTensor(), indices.toTensor()];\n}\nexport const setdiff1dAsync = setdiff1dAsync_;\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Sign, SignInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Returns an element-wise indication of the sign of a number.\n *\n * ```js\n * const x = tf.tensor1d([.6, 1.1, -3.3, NaN, 0]);\n *\n * x.sign().print();  // or tf.sign(x)\n * ```\n * @param x The input Tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction sign_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'sign');\n  const inputs: SignInputs = {x: $x};\n  return ENGINE.runKernel(Sign, inputs as unknown as NamedTensorMap);\n}\nexport const sign = /* @__PURE__ */ op({sign_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Sin, SinInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes sin of the input Tensor element-wise: `sin(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, Math.PI / 2, Math.PI * 3 / 4]);\n *\n * x.sin().print();  // or tf.sin(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction sin_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'sin', 'float32');\n\n  const inputs: SinInputs = {x: $x};\n\n  return ENGINE.runKernel(Sin, inputs as unknown as NamedTensorMap);\n}\nexport const sin = /* @__PURE__ */ op({sin_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Sinh, SinhInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes hyperbolic sin of the input `tf.Tensor` element-wise: `sinh(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, 1, -1, .7]);\n *\n * x.sinh().print();  // or tf.sinh(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction sinh_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'sinh');\n  const inputs: SinhInputs = {x: $x};\n\n  return ENGINE.runKernel(Sinh, inputs as unknown as NamedTensorMap);\n}\nexport const sinh = /* @__PURE__ */ op({sinh_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor1D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\nimport {slice} from './slice';\n\n/**\n * Extracts a 1D slice from 1D array starting at coordinates `begin` and is\n * of length `size`. See `slice` for details.\n */\nfunction slice1d_(\n    x: Tensor1D|TensorLike, begin: number, size: number): Tensor1D {\n  const $x = convertToTensor(x, 'x', 'slice1d');\n  util.assert(\n      $x.rank === 1,\n      () =>\n          `slice1d expects a rank-1 tensor, but got a rank-${$x.rank} tensor`);\n  return slice($x, [begin], [size]);\n}\nexport const slice1d = /* @__PURE__ */ op({slice1d_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor2D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\nimport {slice} from './slice';\n\n/**\n * Extracts a 2D slice from a 2D array starting at coordinates `begin` and\n * is of size `size`. See `slice` for details.\n */\nfunction slice2d_(\n    x: Tensor2D|TensorLike, begin: [number, number],\n    size: [number, number]): Tensor2D {\n  const $x = convertToTensor(x, 'x', 'slice2d');\n  util.assert(\n      $x.rank === 2,\n      () =>\n          `slice2d expects a rank-2 tensor, but got a rank-${$x.rank} tensor`);\n  return slice($x, begin, size);\n}\nexport const slice2d = /* @__PURE__ */ op({slice2d_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor3D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\nimport {slice} from './slice';\n\n/**\n * Extracts a 3D slice from a 3D array starting at coordinates `begin` and\n * is of size `size`. See `slice` for details.\n */\nfunction slice3d_(\n    x: Tensor3D|TensorLike, begin: [number, number, number],\n    size: [number, number, number]): Tensor3D {\n  const $x = convertToTensor(x, 'x', 'slice3d');\n  util.assert(\n      $x.rank === 3,\n      () =>\n          `slice3d expects a rank-3 tensor, but got a rank-${$x.rank} tensor`);\n  return slice($x, begin, size);\n}\nexport const slice3d = /* @__PURE__ */ op({slice3d_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor4D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\nimport {slice} from './slice';\n\n/**\n * Extracts a 4D slice from a 4D array starting at coordinates `begin` and\n * is of size `size`. See `slice` for details.\n */\nfunction slice4d_(\n    x: Tensor4D|TensorLike, begin: [number, number, number, number],\n    size: [number, number, number, number]): Tensor4D {\n  const $x = convertToTensor(x, 'x', 'slice4d');\n  util.assert(\n      $x.rank === 4,\n      () =>\n          `slice4d expects a rank-4 tensor, but got a rank-${$x.rank} tensor`);\n  return slice($x, begin, size);\n}\nexport const slice4d = /* @__PURE__ */ op({slice4d_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Softmax, SoftmaxAttrs, SoftmaxInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes the softmax normalized vector given the logits.\n *\n * ```js\n * const a = tf.tensor1d([1, 2, 3]);\n *\n * a.softmax().print();  // or tf.softmax(a)\n * ```\n *\n * ```js\n * const a = tf.tensor2d([2, 4, 6, 1, 2, 3], [2, 3]);\n *\n * a.softmax().print();  // or tf.softmax(a)\n * ```\n *\n * @param logits The logits array.\n * @param dim The dimension softmax would be performed on. Defaults to `-1`\n *     which indicates the last dimension.\n *\n * @doc {heading: 'Operations', subheading: 'Normalization'}\n */\nfunction softmax_<T extends Tensor>(logits: T|TensorLike, dim = -1): T {\n  const $logits = convertToTensor(logits, 'logits', 'softmax', 'float32');\n\n  if (dim === -1) {\n    dim = $logits.rank - 1;\n  }\n  if (dim !== $logits.rank - 1) {\n    throw Error(\n        'Softmax along a non-last dimension is not yet supported. ' +\n        `Logits was rank ${$logits.rank} and dim was ${dim}`);\n  }\n\n  const inputs: SoftmaxInputs = {logits: $logits};\n  const attrs: SoftmaxAttrs = {dim};\n\n  return ENGINE.runKernel(\n      Softmax, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const softmax = /* @__PURE__ */ op({softmax_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {FFT, FFTInputs} from '../../kernel_names';\nimport {Tensor} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {assert} from '../../util';\nimport {op} from '../operation';\n\n/**\n * Fast Fourier transform.\n *\n * Computes the 1-dimensional discrete Fourier transform over the inner-most\n * dimension of input.\n *\n * ```js\n * const real = tf.tensor1d([1, 2, 3]);\n * const imag = tf.tensor1d([1, 2, 3]);\n * const x = tf.complex(real, imag);\n *\n * x.fft().print();  // tf.spectral.fft(x).print();\n * ```\n * @param input The complex input to compute an fft over.\n *\n * @doc {heading: 'Operations', subheading: 'Spectral', namespace: 'spectral'}\n */\nfunction fft_(input: Tensor): Tensor {\n  assert(\n      input.dtype === 'complex64',\n      () => `The dtype for tf.spectral.fft() must be complex64 ` +\n          `but got ${input.dtype}.`);\n\n  const inputs: FFTInputs = {input};\n\n  return ENGINE.runKernel(FFT, inputs as unknown as NamedTensorMap);\n}\n\nexport const fft = /* @__PURE__ */ op({fft_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {IFFT, IFFTInputs} from '../../kernel_names';\nimport {Tensor} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {assert} from '../../util';\nimport {op} from '../operation';\n\n/**\n * Inverse fast Fourier transform.\n *\n * Computes the inverse 1-dimensional discrete Fourier transform over the\n * inner-most dimension of input.\n *\n * ```js\n * const real = tf.tensor1d([1, 2, 3]);\n * const imag = tf.tensor1d([1, 2, 3]);\n * const x = tf.complex(real, imag);\n *\n * x.ifft().print();  // tf.spectral.ifft(x).print();\n * ```\n * @param input The complex input to compute an ifft over.\n *\n * @doc {heading: 'Operations', subheading: 'Spectral', namespace: 'spectral'}\n */\nfunction ifft_(input: Tensor): Tensor {\n  assert(\n      input.dtype === 'complex64',\n      () => `The dtype for tf.spectral.ifft() must be complex64 ` +\n          `but got ${input.dtype}.`);\n\n  const inputs: IFFTInputs = {input};\n\n  return ENGINE.runKernel(IFFT, inputs as unknown as NamedTensorMap);\n}\n\nexport const ifft = /* @__PURE__ */ op({ifft_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor, Tensor2D} from '../../tensor';\nimport {complex} from '../complex';\nimport {concat} from '../concat';\nimport {imag} from '../imag';\nimport {mul} from '../mul';\nimport {op} from '../operation';\nimport {real} from '../real';\nimport {reshape} from '../reshape';\nimport {reverse} from '../reverse';\nimport {scalar} from '../scalar';\nimport {slice} from '../slice';\n\nimport {ifft} from './ifft';\n\n/**\n * Inversed real value input fast Fourier transform.\n *\n * Computes the 1-dimensional inversed discrete Fourier transform over the\n * inner-most dimension of the real input.\n *\n * ```js\n * const real = tf.tensor1d([1, 2, 3]);\n * const imag = tf.tensor1d([0, 0, 0]);\n * const x = tf.complex(real, imag);\n *\n * x.irfft().print();\n * ```\n * @param input The real value input to compute an irfft over.\n *\n * @doc {heading: 'Operations', subheading: 'Spectral', namespace: 'spectral'}\n */\nfunction irfft_(input: Tensor): Tensor {\n  const innerDimensionSize = input.shape[input.shape.length - 1];\n  const batch = input.size / innerDimensionSize;\n  let ret: Tensor;\n  if (innerDimensionSize <= 2) {\n    const complexInput = reshape(input, [batch, innerDimensionSize]);\n    ret = ifft(complexInput);\n  } else {\n    // The length of unique components of the DFT of a real-valued signal\n    // is 2 * (input_len - 1)\n    const outputShape = [batch, 2 * (innerDimensionSize - 1)];\n    const realInput = reshape(real(input), [batch, innerDimensionSize]);\n    const imagInput = reshape(imag(input), [batch, innerDimensionSize]);\n\n    const realConjugate =\n        reverse(slice(realInput, [0, 1], [batch, innerDimensionSize - 2]), 1);\n    const imagConjugate: Tensor2D = mul(\n        reverse(slice(imagInput, [0, 1], [batch, innerDimensionSize - 2]), 1),\n        scalar(-1));\n\n    const r = concat([realInput, realConjugate], 1);\n    const i = concat([imagInput, imagConjugate], 1);\n    const complexInput =\n        reshape(complex(r, i), [outputShape[0], outputShape[1]]);\n    ret = ifft(complexInput);\n  }\n  ret = real(ret);\n  // reshape the result if the input is 3D tensor.\n  if (input.rank === 3 && input.shape[0] !== 0) {\n    const temp = ret;\n    const batch = input.shape[0];\n    ret = reshape(ret, [batch, ret.shape[0] / batch, ret.shape[1]]);\n    temp.dispose();\n  }\n  return ret;\n}\n\nexport const irfft = /* @__PURE__ */ op({irfft_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {SplitV, SplitVAttrs, SplitVInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Splits a `tf.Tensor` into sub tensors.\n *\n * If `numOrSizeSplits` is a number, splits `x` along dimension `axis`\n * into `numOrSizeSplits` smaller tensors.\n * Requires that `numOrSizeSplits` evenly divides `x.shape[axis]`.\n *\n * If `numOrSizeSplits` is a number array, splits `x` into\n * `numOrSizeSplits.length` pieces. The shape of the `i`-th piece has the\n * same size as `x` except along dimension `axis` where the size is\n * `numOrSizeSplits[i]`.\n *\n * ```js\n * const x = tf.tensor2d([1, 2, 3, 4, 5, 6, 7, 8], [2, 4]);\n * const [a, b] = tf.split(x, 2, 1);\n * a.print();\n * b.print();\n *\n * const [c, d, e] = tf.split(x, [1, 2, 1], 1);\n * c.print();\n * d.print();\n * e.print();\n * ```\n *\n * @param x The input tensor to split.\n * @param numOrSizeSplits Either an integer indicating the number of\n * splits along the axis or an array of integers containing the sizes of\n * each output tensor along the axis. If a number then it must evenly divide\n * `x.shape[axis]`; otherwise the sum of sizes must match `x.shape[axis]`.\n * Can contain one -1 indicating that dimension is to be inferred.\n * @param axis The dimension along which to split. Defaults to 0 (the first\n * dim).\n *\n * @doc {heading: 'Tensors', subheading: 'Slicing and Joining'}\n */\nfunction split_<T extends Tensor>(\n    x: Tensor|TensorLike, numOrSizeSplits: number[]|number, axis = 0): T[] {\n  const $x = convertToTensor(x, 'x', 'split');\n\n  const inputs: SplitVInputs = {x: $x};\n  const attr: SplitVAttrs = {numOrSizeSplits, axis};\n\n  return ENGINE.runKernel(\n             SplitV, inputs as unknown as NamedTensorMap,\n             attr as unknown as NamedAttrMap) as unknown as T[];\n}\n\nexport const split = /* @__PURE__ */ op({split_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../../tensor';\nimport {assert} from '../../util';\nimport {complex} from '../complex';\nimport {concat} from '../concat';\nimport {imag} from '../imag';\nimport {op} from '../operation';\nimport {real} from '../real';\nimport {reshape} from '../reshape';\nimport {slice} from '../slice';\nimport {split} from '../split';\nimport {zeros} from '../zeros';\nimport {zerosLike} from '../zeros_like';\n\nimport {fft} from './fft';\n\n/**\n * Real value input fast Fourier transform.\n *\n * Computes the 1-dimensional discrete Fourier transform over the\n * inner-most dimension of the real input.\n *\n * ```js\n * const real = tf.tensor1d([1, 2, 3]);\n *\n * real.rfft().print();\n * ```\n * @param input The real value input to compute an rfft over.\n *\n * @doc {heading: 'Operations', subheading: 'Spectral', namespace: 'spectral'}\n */\nfunction rfft_(input: Tensor, fftLength?: number): Tensor {\n  assert(\n      input.dtype === 'float32',\n      () => `The dtype for rfft() must be real value but got ${input.dtype}`);\n\n  let innerDimensionSize = input.shape[input.shape.length - 1];\n  const batch = input.size / innerDimensionSize;\n\n  let adjustedInput: Tensor;\n  if (fftLength != null && fftLength < innerDimensionSize) {\n    // Need to crop\n    const begin = input.shape.map(v => 0);\n    const size = input.shape.map(v => v);\n    size[input.shape.length - 1] = fftLength;\n    adjustedInput = slice(input, begin, size);\n    innerDimensionSize = fftLength;\n  } else if (fftLength != null && fftLength > innerDimensionSize) {\n    // Need to pad with zeros\n    const zerosShape = input.shape.map(v => v);\n    zerosShape[input.shape.length - 1] = fftLength - innerDimensionSize;\n    adjustedInput = concat([input, zeros(zerosShape)], input.shape.length - 1);\n    innerDimensionSize = fftLength;\n  } else {\n    adjustedInput = input;\n  }\n\n  // Complement the input with zero imaginary numbers.\n  const zerosInput = zerosLike(adjustedInput);\n  const complexInput =\n      reshape(complex(adjustedInput, zerosInput), [batch, innerDimensionSize]);\n\n  const ret = fft(complexInput);\n\n  // Exclude complex conjugations. These conjugations are put symmetrically.\n  const half = Math.floor(innerDimensionSize / 2) + 1;\n  const realValues = real(ret);\n  const imagValues = imag(ret);\n  const realComplexConjugate = split(\n      realValues, [half, innerDimensionSize - half],\n      realValues.shape.length - 1);\n  const imagComplexConjugate = split(\n      imagValues, [half, innerDimensionSize - half],\n      imagValues.shape.length - 1);\n\n  const outputShape = adjustedInput.shape.slice();\n  outputShape[adjustedInput.shape.length - 1] = half;\n\n  return reshape(\n      complex(realComplexConjugate[0], imagComplexConjugate[0]), outputShape);\n}\n\nexport const rfft = /* @__PURE__ */ op({rfft_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {SquaredDifference, SquaredDifferenceInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {makeTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {assertAndGetBroadcastShape} from './broadcast_util';\nimport {op} from './operation';\n\n/**\n * Returns (a - b) * (a - b) element-wise.\n * Supports broadcasting.\n *\n * ```js\n * const a = tf.tensor1d([1, 4, 3, 16]);\n * const b = tf.tensor1d([1, 2, 9, 4]);\n *\n * a.squaredDifference(b).print();  // or tf.squaredDifference(a, b)\n * ```\n *\n * ```js\n * // Broadcast squared difference  a with b.\n * const a = tf.tensor1d([2, 4, 6, 8]);\n * const b = tf.scalar(5);\n *\n * a.squaredDifference(b).print();  // or tf.squaredDifference(a, b)\n * ```\n *\n * @param a The first tensor.\n * @param b The second tensor. Must have the same type as `a`.\n *\n * @doc {heading: 'Operations', subheading: 'Arithmetic'}\n */\nfunction squaredDifference_<T extends Tensor>(\n    a: Tensor|TensorLike, b: Tensor|TensorLike): T {\n  let $a = convertToTensor(a, 'a', 'squaredDifference');\n  let $b = convertToTensor(b, 'b', 'squaredDifference');\n  [$a, $b] = makeTypesMatch($a, $b);\n\n  assertAndGetBroadcastShape($a.shape, $b.shape);\n\n  const inputs: SquaredDifferenceInputs = {a: $a, b: $b};\n  const attrs = {};\n\n  return ENGINE.runKernel(\n      SquaredDifference, inputs as unknown as NamedTensorMap, attrs);\n}\n\nexport const squaredDifference = /* @__PURE__ */ op({squaredDifference_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {squeezeShape} from '../util';\n\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Removes dimensions of size 1 from the shape of a `tf.Tensor`.\n *\n * ```js\n * const x = tf.tensor([1, 2, 3, 4], [1, 1, 4]);\n * x.squeeze().print();\n * ```\n *\n * @param x The input tensor to be squeezed.\n * @param axis An optional list of numbers. If specified, only\n *     squeezes the dimensions listed. The dimension index starts at 0. It\n * is an error to squeeze a dimension that is not 1.\n *\n * @doc {heading: 'Tensors', subheading: 'Transformations'}\n */\nfunction squeeze_<T extends Tensor>(x: Tensor|TensorLike, axis?: number[]): T {\n  const $x = convertToTensor(x, 'x', 'squeeze', 'string_or_numeric');\n  return reshape($x, squeezeShape($x.shape, axis).newShape) as T;\n}\n\nexport const squeeze = /* @__PURE__ */ op({squeeze_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Pack, PackAttrs, PackInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensorArray} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Stacks a list of rank-`R` `tf.Tensor`s into one rank-`(R+1)` `tf.Tensor`.\n *\n * ```js\n * const a = tf.tensor1d([1, 2]);\n * const b = tf.tensor1d([3, 4]);\n * const c = tf.tensor1d([5, 6]);\n * tf.stack([a, b, c]).print();\n * ```\n *\n * @param tensors A list of tensor objects with the same shape and dtype.\n * @param axis The axis to stack along. Defaults to 0 (the first dim).\n *\n * @doc {heading: 'Tensors', subheading: 'Slicing and Joining'}\n */\nfunction stack_<T extends Tensor>(\n    tensors: Array<T|TensorLike>, axis = 0): Tensor {\n  const $tensors =\n      convertToTensorArray(tensors, 'tensors', 'stack', 'string_or_numeric');\n\n  util.assert(\n      $tensors.length >= 1, () => 'Pass at least one tensor to tf.stack');\n\n  if ($tensors.length > 0) {\n    util.assert(\n        axis <= $tensors[0].rank, () => 'Axis must be <= rank of the tensor');\n  }\n\n  const inputs: PackInputs = $tensors;\n  const attrs: PackAttrs = {axis};\n\n  return ENGINE.runKernel(\n      Pack, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const stack = /* @__PURE__ */ op({stack_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Step, StepAttrs, StepInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes step of the input `tf.Tensor` element-wise: `x > 0 ? 1 : alpha`\n *\n * ```js\n * const x = tf.tensor1d([0, 2, -1, -3]);\n *\n * x.step(.5).print();  // or tf.step(x, .5)\n * ```\n * @param x The input tensor.\n * @param alpha The gradient when input is negative. Defaults to 0.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction step_<T extends Tensor>(x: T|TensorLike, alpha = 0.0): T {\n  const $x = convertToTensor(x, 'x', 'step');\n\n  const inputs: StepInputs = {x: $x};\n  const attrs: StepAttrs = {alpha};\n\n  return ENGINE.runKernel(\n      Step, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\nexport const step = /* @__PURE__ */ op({step_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {StridedSlice, StridedSliceAttrs, StridedSliceInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Extracts a strided slice of a tensor.\n *\n * Roughly speaking, this op extracts a slice of size (end-begin)/stride from\n * the given input tensor (x). Starting at the location specified by begin the\n * slice continues by adding stride to the index until all dimensions are not\n * less than end. Note that a stride can be negative, which causes a reverse\n * slice.\n *\n * ```js\n * const t = tf.tensor3d([1, 1, 1 ,2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6],\n *    [3, 2, 3]);\n * t.stridedSlice([1, 0, 0], [2, 1, 3], [1, 1, 1]).print()  // [[[3, 3, 3]]]\n * t.stridedSlice([1, 0, 0], [2, 2, 3], [1, 1, 1]).print()  // [[[3, 3, 3],\n *                                                     // [4, 4, 4]]]\n * t.stridedSlice([1, -1, 0], [2, -3, 3], [1, -1, 1]).print() // [[[4, 4, 4],\n *                                                     // [3, 3, 3]]]\n * ```\n *\n * @param x The tensor to stride slice.\n * @param begin The coordinates to start the slice from.\n * @param end: The coordinates to end the slice at.\n * @param strides: The size of the slice.\n * @param beginMask: If the ith bit of beginMask is set, begin[i] is ignored\n *      and the fullest possible range in that dimension is used instead.\n * @param endMask: If the ith bit of endMask is set, end[i] is ignored\n *      and the fullest possible range in that dimension is used instead.\n * @param shrinkAxisMask: a bitmask where bit i implies that\n * the ith specification should shrink the dimensionality. begin and end must\n * imply a slice of size 1 in the dimension.\n *\n * @doc {heading: 'Operations', subheading: 'Slicing and Joining'}\n */\nfunction stridedSlice_(\n    x: Tensor|TensorLike, begin: number[], end: number[], strides?: number[],\n    beginMask = 0, endMask = 0, ellipsisMask = 0, newAxisMask = 0,\n    shrinkAxisMask = 0): Tensor {\n  const $x = convertToTensor(x, 'x', 'stridedSlice', 'string_or_numeric');\n\n  const inputs: StridedSliceInputs = {x: $x};\n  const attrs: StridedSliceAttrs = {\n    begin,\n    end,\n    strides,\n    beginMask,\n    endMask,\n    ellipsisMask,\n    newAxisMask,\n    shrinkAxisMask\n  };\n\n  return ENGINE.runKernel(\n      StridedSlice, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const stridedSlice = /* @__PURE__ */ op({stridedSlice_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Tan, TanInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Computes tan of the input `tf.Tensor` element-wise, `tan(x)`\n *\n * ```js\n * const x = tf.tensor1d([0, Math.PI / 2, Math.PI * 3 / 4]);\n *\n * x.tan().print();  // or tf.tan(x)\n * ```\n * @param x The input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Basic math'}\n */\nfunction tan_<T extends Tensor>(x: T|TensorLike): T {\n  const $x = convertToTensor(x, 'x', 'tan', 'float32');\n\n  const inputs: TanInputs = {x: $x};\n\n  return ENGINE.runKernel(Tan, inputs as unknown as NamedTensorMap);\n}\nexport const tan = /* @__PURE__ */ op({tan_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {inferShape} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {DataType, Rank, ShapeMap, WebGLData, WebGPUData} from '../types';\n\nimport {makeTensor} from './tensor_ops_util';\n\n/**\n * Creates a `tf.Tensor` with the provided values, shape and dtype.\n *\n * ```js\n * // Pass an array of values to create a vector.\n * tf.tensor([1, 2, 3, 4]).print();\n * ```\n *\n * ```js\n * // Pass a nested array of values to make a matrix or a higher\n * // dimensional tensor.\n * tf.tensor([[1, 2], [3, 4]]).print();\n * ```\n *\n * ```js\n * // Pass a flat array and specify a shape yourself.\n * tf.tensor([1, 2, 3, 4], [2, 2]).print();\n * ```\n *\n * ```js\n * // Pass a `WebGLData` object and specify a shape yourself.\n *\n * // This makes it possible for TF.js applications to avoid GPU / CPU sync.\n * // For example, if your application includes a preprocessing step on the GPU,\n * // you could upload the GPU output directly to TF.js, rather than first\n * // downloading the values.\n *\n * // Example for WebGL2:\n * if (tf.findBackend('custom-webgl') == null) {\n *   const customCanvas = document.createElement('canvas');\n *   const customBackend = new tf.MathBackendWebGL(customCanvas);\n *   tf.registerBackend('custom-webgl', () => customBackend);\n * }\n * const savedBackend = tf.getBackend();\n * await tf.setBackend('custom-webgl');\n * const gl = tf.backend().gpgpu.gl;\n * const texture = gl.createTexture();\n * const tex2d = gl.TEXTURE_2D;\n * const width = 2;\n * const height = 2;\n *\n * gl.bindTexture(tex2d, texture);\n * gl.texParameteri(tex2d, gl.TEXTURE_WRAP_S, gl.CLAMP_TO_EDGE);\n * gl.texParameteri(tex2d, gl.TEXTURE_WRAP_T, gl.CLAMP_TO_EDGE);\n * gl.texParameteri(tex2d, gl.TEXTURE_MIN_FILTER, gl.NEAREST);\n * gl.texParameteri(tex2d, gl.TEXTURE_MAG_FILTER, gl.NEAREST);\n * gl.texImage2D(\n *   tex2d, 0, gl.RGBA32F, // internalFormat\n *   width, height, 0,\n *   gl.RGBA, // textureFormat\n *   gl.FLOAT, // textureType\n *   new Float32Array([0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15])\n * );\n *\n * // Currently, the `texture` has 4 pixels:\n * // Pixel0 is {R:0, G:1, B:2, A:3}\n * // Pixel1 is {R:4, G:5, B:6, A:7}\n * // Pixel2 is {R:8, G:9, B:10, A:11}\n * // Pixel3 is {R:12, G:13, B:14, A:15}\n *\n * const logicalShape = [height * width * 2];\n * const a = tf.tensor({texture, height, width, channels: 'BR'}, logicalShape);\n * a.print();\n * // Tensor value will be [2, 0, 6, 4, 10, 8, 14, 12], since [2, 0] is the\n * // values of 'B' and 'R' channels of Pixel0, [6, 4] is the values of 'B' and\n * 'R'\n * // channels of Pixel1...\n *\n * // For postprocessing on the GPU, it's possible to retrieve the texture\n * // backing any tensor by calling the tensor's `dataToGPU` method like\n * // so:\n *\n * const tex = a.dataToGPU();\n * await tf.setBackend(savedBackend);\n * ```\n *\n * ```js\n * // Pass a `WebGPUData` object and specify a shape yourself.\n *\n * // This makes it possible for TF.js applications to avoid GPU / CPU sync.\n * // For example, if your application includes a preprocessing step on the GPU,\n * // you could upload the GPU output directly to TF.js, rather than first\n * // downloading the values. Unlike WebGL, this optionally supports zero copy\n * // by WebGPUData.zeroCopy. When zeroCopy is false or undefined(default), this\n * // passing GPUBuffer can be destroyed after tensor is created. When zeroCopy\n * // is true, this GPUBuffer is bound directly by the tensor, so do not destroy\n * // this GPUBuffer until all access is done.\n *\n * // Example for WebGPU:\n * function createGPUBufferFromData(device, data, dtype) {\n *   const bytesPerElement = 4;\n *   const sizeInBytes = data.length * bytesPerElement;\n *\n *   const gpuWriteBuffer = device.createBuffer({\n *     mappedAtCreation: true,\n *     size: sizeInBytes,\n *     usage: GPUBufferUsage.MAP_WRITE | GPUBufferUsage.COPY_SRC\n *   });\n *   const arrayBuffer = gpuWriteBuffer.getMappedRange();\n *   if (dtype === 'float32') {\n *     new Float32Array(arrayBuffer).set(data);\n *   } else if (dtype === 'int32') {\n *     new Int32Array(arrayBuffer).set(data);\n *   } else {\n *     throw new Error(\n *         `Creating tensor from GPUBuffer only supports` +\n *         `'float32'|'int32' dtype, while the dtype is ${dtype}.`);\n *   }\n *   gpuWriteBuffer.unmap();\n *\n *   const gpuReadBuffer = device.createBuffer({\n *     mappedAtCreation: false,\n *     size: sizeInBytes,\n *     usage: GPUBufferUsage.COPY_DST | GPUBufferUsage.STORAGE |\n *         GPUBufferUsage.COPY_SRC\n *   });\n *\n *   const copyEncoder = device.createCommandEncoder();\n *   copyEncoder.copyBufferToBuffer(\n *       gpuWriteBuffer, 0, gpuReadBuffer, 0, sizeInBytes);\n *   const copyCommands = copyEncoder.finish();\n *   device.queue.submit([copyCommands]);\n *   gpuWriteBuffer.destroy();\n *   return gpuReadBuffer;\n * }\n *\n * const savedBackend = tf.getBackend();\n * await tf.setBackend('webgpu').catch(\n *     () => {throw new Error(\n *         'Failed to use WebGPU backend. Please use Chrome Canary to run.')});\n * const dtype = 'float32';\n * const device = tf.backend().device;\n * const aData = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16];\n * const bData = [1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4];\n * const expected = [2, 4, 6, 8, 6, 8, 10, 12, 10, 12, 14, 16, 14, 16, 18, 20];\n * const aBuffer = createGPUBufferFromData(device, aData, dtype);\n * const shape = [aData.length];\n * // To use zeroCopy, use {buffer: aBuffer, zeroCopy: true} instead and destroy\n * // aBuffer untill all access is done.\n * const a = tf.tensor({buffer: aBuffer}, shape, dtype);\n * const b = tf.tensor(bData, shape, dtype);\n * const result = tf.add(a, b);\n * result.print();\n * a.dispose();\n * b.dispose();\n * result.dispose();\n * aBuffer.destroy();\n * await tf.setBackend(savedBackend);\n * ```\n * @param values The values of the tensor. Can be nested array of numbers,\n * or a flat array, or a `TypedArray`(At the moment it supports Uint8Array,\n * Uint8ClampedArray, Int32Array, Float32Array) data types, or a `WebGLData`\n * object, or a `WebGPUData` object. If the values are strings, they will be\n * encoded as utf-8 and kept as `Uint8Array[]`. If the values is a `WebGLData`\n * object, the dtype could only be 'float32' or 'int32' and the object has to\n * have: 1. texture, a `WebGLTexture`, the texture must share the same\n * `WebGLRenderingContext` with TFJS's WebGL backend (you could create a custom\n * WebGL backend from your texture's canvas) and the internal texture format\n * for the input texture must be floating point or normalized integer; 2.\n * height, the height of the texture; 3. width, the width of the texture; 4.\n * channels, a non-empty subset of 'RGBA', indicating the values of which\n * channels will be passed to the tensor, such as 'R' or 'BR' (The order of the \n * channels affect the order of tensor values. ). (If the values passed from \n * texture is less than the tensor size, zeros will be padded at the rear.). If \n * the values is a `WebGPUData` object, the dtype could only be 'float32' or\n * 'int32 and the object has to have: buffer, a `GPUBuffer`. The buffer must:\n * 1. share the same `GPUDevice` with TFJS's WebGPU backend; 2. buffer.usage\n * should at least support GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_SRC; 3.\n * buffer.size should not be smaller than the byte size of tensor shape.\n * WebGPUData optionally supports zero copy by flag zeroCopy. When zeroCopy is\n * false or undefined(default),this passing GPUBuffer can be destroyed after\n * tensor is created. When zeroCopy is true, this GPUBuffer is bound directly\n * by the tensor, so do not destroy this GPUBuffer until all access is done.\n * @param shape The shape of the tensor. Optional. If not provided,\n *   it is inferred from `values`.\n * @param dtype The data type.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function tensor<R extends Rank>(\n    values: TensorLike|WebGLData|WebGPUData, shape?: ShapeMap[R],\n    dtype?: DataType): Tensor<R> {\n  const inferredShape = inferShape(values, dtype);\n  return makeTensor(values, shape, inferredShape, dtype) as Tensor<R>;\n}", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor1D} from '../tensor';\nimport {inferShape} from '../tensor_util_env';\nimport {TensorLike1D} from '../types';\nimport {DataType} from '../types';\nimport {assertNonNull} from '../util';\nimport {makeTensor} from './tensor_ops_util';\n\n/**\n * Creates rank-1 `tf.Tensor` with the provided values, shape and dtype.\n *\n * The same functionality can be achieved with `tf.tensor`, but in general\n * we recommend using `tf.tensor1d` as it makes the code more readable.\n *\n * ```js\n * tf.tensor1d([1, 2, 3]).print();\n * ```\n *\n * @param values The values of the tensor. Can be array of numbers,\n *     or a `TypedArray`.\n * @param dtype The data type.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function tensor1d(values: TensorLike1D, dtype?: DataType): Tensor1D {\n  assertNonNull(values);\n  const inferredShape = inferShape(values, dtype);\n  if (inferredShape.length !== 1) {\n    throw new Error('tensor1d() requires values to be a flat/TypedArray');\n  }\n  const shape: number[] = null;\n  return makeTensor(values, shape, inferredShape, dtype) as Tensor1D;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor2D} from '../tensor';\nimport {inferShape} from '../tensor_util_env';\nimport {TensorLike2D} from '../types';\nimport {DataType} from '../types';\nimport {assertNonNull} from '../util';\nimport {makeTensor} from './tensor_ops_util';\n\n/**\n * Creates rank-2 `tf.Tensor` with the provided values, shape and dtype.\n *\n * The same functionality can be achieved with `tf.tensor`, but in general\n * we recommend using `tf.tensor2d` as it makes the code more readable.\n *\n *  ```js\n * // Pass a nested array.\n * tf.tensor2d([[1, 2], [3, 4]]).print();\n * ```\n * ```js\n * // Pass a flat array and specify a shape.\n * tf.tensor2d([1, 2, 3, 4], [2, 2]).print();\n * ```\n *\n * @param values The values of the tensor. Can be nested array of numbers,\n *     or a flat array, or a `TypedArray`.\n * @param shape The shape of the tensor. If not provided, it is inferred from\n *     `values`.\n * @param dtype The data type.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function tensor2d(\n    values: TensorLike2D, shape?: [number, number],\n    dtype?: DataType): Tensor2D {\n  assertNonNull(values);\n  if (shape != null && shape.length !== 2) {\n    throw new Error('tensor2d() requires shape to have two numbers');\n  }\n  const inferredShape = inferShape(values, dtype);\n  if (inferredShape.length !== 2 && inferredShape.length !== 1) {\n    throw new Error(\n        'tensor2d() requires values to be number[][] or flat/TypedArray');\n  }\n  if (inferredShape.length === 1 && shape == null) {\n    throw new Error(\n        'tensor2d() requires shape to be provided when `values` ' +\n        'are a flat/TypedArray');\n  }\n  return makeTensor(values, shape, inferredShape, dtype) as Tensor2D;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor3D} from '../tensor';\nimport {inferShape} from '../tensor_util_env';\nimport {TensorLike3D} from '../types';\nimport {DataType} from '../types';\nimport {assertNonNull} from '../util';\nimport {makeTensor} from './tensor_ops_util';\n\n/**\n * Creates rank-3 `tf.Tensor` with the provided values, shape and dtype.\n *\n * The same functionality can be achieved with `tf.tensor`, but in general\n * we recommend using `tf.tensor3d` as it makes the code more readable.\n *\n *  ```js\n * // Pass a nested array.\n * tf.tensor3d([[[1], [2]], [[3], [4]]]).print();\n * ```\n * ```js\n * // Pass a flat array and specify a shape.\n * tf.tensor3d([1, 2, 3, 4], [2, 2, 1]).print();\n * ```\n *\n * @param values The values of the tensor. Can be nested array of numbers,\n *     or a flat array, or a `TypedArray`.\n * @param shape The shape of the tensor. If not provided,  it is inferred from\n *     `values`.\n * @param dtype The data type.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function tensor3d(\n    values: TensorLike3D, shape?: [number, number, number],\n    dtype?: DataType): Tensor3D {\n  assertNonNull(values);\n  if (shape != null && shape.length !== 3) {\n    throw new Error('tensor3d() requires shape to have three numbers');\n  }\n  const inferredShape = inferShape(values, dtype);\n  if (inferredShape.length !== 3 && inferredShape.length !== 1) {\n    throw new Error(\n        'tensor3d() requires values to be number[][][] or flat/TypedArray');\n  }\n  if (inferredShape.length === 1 && shape == null) {\n    throw new Error(\n        'tensor3d() requires shape to be provided when `values` ' +\n        'are a flat array');\n  }\n  return makeTensor(values, shape, inferredShape, dtype) as Tensor3D;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor4D} from '../tensor';\nimport {inferShape} from '../tensor_util_env';\nimport {TensorLike4D} from '../types';\nimport {DataType} from '../types';\nimport {assertNonNull} from '../util';\nimport {makeTensor} from './tensor_ops_util';\n\n/**\n * Creates rank-4 `tf.Tensor` with the provided values, shape and dtype.\n *\n * The same functionality can be achieved with `tf.tensor`, but in general\n * we recommend using `tf.tensor4d` as it makes the code more readable.\n *\n *  ```js\n * // Pass a nested array.\n * tf.tensor4d([[[[1], [2]], [[3], [4]]]]).print();\n * ```\n * ```js\n * // Pass a flat array and specify a shape.\n * tf.tensor4d([1, 2, 3, 4], [1, 2, 2, 1]).print();\n * ```\n *\n * @param values The values of the tensor. Can be nested array of numbers,\n *     or a flat array, or a `TypedArray`.\n * @param shape The shape of the tensor. Optional. If not provided,\n *   it is inferred from `values`.\n * @param dtype The data type.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function tensor4d(\n    values: TensorLike4D, shape?: [number, number, number, number],\n    dtype?: DataType): Tensor4D {\n  assertNonNull(values);\n  if (shape != null && shape.length !== 4) {\n    throw new Error('tensor4d() requires shape to have four numbers');\n  }\n  const inferredShape = inferShape(values, dtype);\n  if (inferredShape.length !== 4 && inferredShape.length !== 1) {\n    throw new Error(\n        'tensor4d() requires values to be number[][][][] or flat/TypedArray');\n  }\n  if (inferredShape.length === 1 && shape == null) {\n    throw new Error(\n        'tensor4d() requires shape to be provided when `values` ' +\n        'are a flat array');\n  }\n  return makeTensor(values, shape, inferredShape, dtype) as Tensor4D;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor5D} from '../tensor';\nimport {inferShape} from '../tensor_util_env';\nimport {TensorLike5D} from '../types';\nimport {DataType} from '../types';\nimport {assertNonNull} from '../util';\nimport {makeTensor} from './tensor_ops_util';\n\n/**\n * Creates rank-5 `tf.Tensor` with the provided values, shape and dtype.\n *\n * The same functionality can be achieved with `tf.tensor`, but in general\n * we recommend using `tf.tensor5d` as it makes the code more readable.\n *\n *  ```js\n * // Pass a nested array.\n * tf.tensor5d([[[[[1],[2]],[[3],[4]]],[[[5],[6]],[[7],[8]]]]]).print();\n * ```\n * ```js\n * // Pass a flat array and specify a shape.\n * tf.tensor5d([1, 2, 3, 4, 5, 6, 7, 8], [1, 2, 2, 2, 1]).print();\n * ```\n *\n * @param values The values of the tensor. Can be nested array of numbers,\n *     or a flat array, or a `TypedArray`.\n * @param shape The shape of the tensor. Optional. If not provided,\n *   it is inferred from `values`.\n * @param dtype The data type.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function tensor5d(\n    values: TensorLike5D, shape?: [number, number, number, number, number],\n    dtype?: DataType): Tensor5D {\n  assertNonNull(values);\n  if (shape != null && shape.length !== 5) {\n    throw new Error('tensor5d() requires shape to have five numbers');\n  }\n  const inferredShape = inferShape(values, dtype);\n  if (inferredShape.length !== 5 && inferredShape.length !== 1) {\n    throw new Error(\n        'tensor5d() requires values to be ' +\n        'number[][][][][] or flat/TypedArray');\n  }\n  if (inferredShape.length === 1 && shape == null) {\n    throw new Error(\n        'tensor5d() requires shape to be provided when `values` ' +\n        'are a flat array');\n  }\n  return makeTensor(values, shape, inferredShape, dtype) as Tensor5D;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor6D} from '../tensor';\nimport {inferShape} from '../tensor_util_env';\nimport {TensorLike6D} from '../types';\nimport {DataType} from '../types';\nimport {assertNonNull} from '../util';\nimport {makeTensor} from './tensor_ops_util';\n\n/**\n * Creates rank-6 `tf.Tensor` with the provided values, shape and dtype.\n *\n * The same functionality can be achieved with `tf.tensor`, but in general\n * we recommend using `tf.tensor6d` as it makes the code more readable.\n *\n *  ```js\n * // Pass a nested array.\n * tf.tensor6d([[[[[[1],[2]],[[3],[4]]],[[[5],[6]],[[7],[8]]]]]]).print();\n * ```\n * ```js\n * // Pass a flat array and specify a shape.\n * tf.tensor6d([1, 2, 3, 4, 5, 6, 7, 8], [1, 1, 2, 2, 2, 1]).print();\n * ```\n *\n * @param values The values of the tensor. Can be nested array of numbers,\n *     or a flat array, or a `TypedArray`.\n * @param shape The shape of the tensor. Optional. If not provided,\n *   it is inferred from `values`.\n * @param dtype The data type.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function tensor6d(\n    values: TensorLike6D,\n    shape?: [number, number, number, number, number, number],\n    dtype?: DataType): Tensor6D {\n  assertNonNull(values);\n  if (shape != null && shape.length !== 6) {\n    throw new Error('tensor6d() requires shape to have six numbers');\n  }\n  const inferredShape = inferShape(values, dtype);\n  if (inferredShape.length !== 6 && inferredShape.length !== 1) {\n    throw new Error(\n        'tensor6d() requires values to be number[][][][][][] or ' +\n        'flat/TypedArray');\n  }\n  if (inferredShape.length === 1 && shape == null) {\n    throw new Error(\n        'tensor6d() requires shape to be provided when `values` ' +\n        'are a flat array');\n  }\n  shape = shape ||\n      inferredShape as [number, number, number, number, number, number];\n  return makeTensor(values, shape, inferredShape, dtype) as Tensor6D;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport { TensorInfo } from '../tensor_info';\nimport {Tensor} from '../tensor';\nimport {computeStrides, sizeFromShape} from '../util';\n\n/**\n * Check whether updates.shape = indices.shape[:batchDim] +\n * shape[sliceDim:]\n *\n * @param x The input tensor.\n */\nexport function validateUpdateShape(\n    shape: number[], indices: Tensor, updates: Tensor) {\n  const sliceDim = (indices.rank > 1) ? indices.shape[indices.rank - 1] : 1;\n  const batchDim = (indices.rank > 1) ? indices.rank - 1 : 1;\n\n  const shapeError = 'Must have updates.shape = indices.shape[:batchDim] + ' +\n      `shape[sliceDim:], got updates.shape: ${updates.shape}` +\n      `, indices.shape: ${indices.shape}, shape: ${shape}` +\n      `, sliceDim: ${sliceDim}, and batchDim: ${batchDim}.`;\n\n  if (updates.rank < batchDim) {\n    throw new Error(shapeError + ` update.rank < ${batchDim}. `);\n  }\n  if (shape.length < sliceDim + (updates.rank - batchDim)) {\n    throw new Error(\n        shapeError +\n        ` Output shape length < ${sliceDim + (updates.rank - batchDim)}`);\n  }\n  if (updates.rank !== batchDim + shape.length - sliceDim) {\n    throw new Error(\n        shapeError + ` update.rank != ${batchDim + shape.length - sliceDim}`);\n  }\n  for (let d = 0; d < batchDim; ++d) {\n    if (updates.shape[d] !== indices.shape[d]) {\n      throw new Error(\n          shapeError +\n          ` updates.shape[${d}] (${updates.shape[d]}) != indices.shape[${d}] (${\n              indices.shape[d]}).`);\n    }\n  }\n  for (let d = 0; d < updates.rank - batchDim; ++d) {\n    if (updates.shape[d + batchDim] !== shape[d + sliceDim]) {\n      throw new Error(\n          shapeError +\n          ` updates.shape[${d + batchDim}] (${\n              updates.shape[d + batchDim]}) != shape[${d + batchDim}] (${\n              shape[d + batchDim]})`);\n    }\n  }\n}\n\nexport interface ScatterShapeInfo {\n  sliceRank: number;\n  numUpdates: number;\n  sliceSize: number;\n  strides: number[];\n  outputSize: number;\n}\n/**\n * Validate scatter nd inputs.\n *\n * @param update The tensor contains the update values.\n * @param indices The tensor contains the indices for the update values.\n * @param shape The shape of the output tensor.\n */\nexport function validateInput(\n    updates: Tensor, indices: Tensor, shape: number[]) {\n  if (indices.rank < 1) {\n    throw new Error(\n        'tf.scatterND() expects the indices to be rank 1 or higher,' +\n        ` but the rank was ${indices.rank}.`);\n  }\n  if (updates.rank < 1) {\n    throw new Error(\n        'tf.scatterND() expects the updates to be rank 1 or higher,' +\n        ` but the rank was ${updates.rank}.`);\n  }\n  if (indices.dtype !== 'int32') {\n    throw new Error(`The dtype of 'indices' should be int32, but got dtype: ${\n        indices.dtype}`);\n  }\n  if (shape.length < 1) {\n    throw new Error(\n        `Output rank must be greater or equal to 1, but got shape: ${shape}`);\n  }\n\n  if (shape.length === 0) {\n    if (indices.size === 0) {\n      throw new Error(`Indices specified for empty output. indices shape: ${\n          indices.shape}`);\n    }\n    if (updates.size === 0) {\n      throw new Error(`Updates specified for empty output. updates shape: ${\n          updates.shape}`);\n    }\n  }\n\n  validateUpdateShape(shape, indices, updates);\n}\n\n/**\n * Calculate the shape information for the output.\n *\n * @param update The tensor contains the update values.\n * @param indices The tensor contains the indices for the update values.\n * @param shape The shape of the output tensor.\n *\n * @returns ScatterShapeInfo\n */\nexport function calculateShapes(\n    updates: TensorInfo, indices: TensorInfo,\n    shape: number[]): ScatterShapeInfo {\n  // Calculate the number of dimensions in indices\n  const indicesRank = indices.shape.length;\n  const sliceRank = (indicesRank > 1) ? indices.shape[indicesRank - 1] : 1;\n\n  // Calculate the number of elements that make up each slice of our updated\n  // tensor. This allows us to work with flattened tensors and copy over whole\n  // slices at a time.\n  const totalNd = shape.length;\n\n  let sliceSize = 1;\n  for (let i = sliceRank; i < totalNd; ++i) {\n    sliceSize *= shape[i];\n  }\n\n  const safeSliceDim = (sliceRank < 1) ? 1 : sliceRank;\n  const numUpdates = sizeFromShape(indices.shape) / safeSliceDim;\n\n  const strides = [...computeStrides(shape.slice(0, sliceRank)), 1];\n  const outputSize = sizeFromShape(shape);\n  return {sliceRank, numUpdates, sliceSize, strides, outputSize};\n}\n", "/**\n * @license\n * Copyright 2022 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {TensorScatterUpdate, TensorScatterUpdateAttrs, TensorScatterUpdateInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {Rank, TensorLike} from '../types';\n\nimport {op} from './operation';\nimport * as scatter_nd_util from './scatter_nd_util';\n\n/**\n * Creates a new tensor by applying sparse updates to individual\n * values or slices to the passed in tensor according to\n * indices. This operator is the similar to scatterNd op, except that the\n * udpates are scattered on an existing tensor (as opposed to a zero-tensor).\n *\n * If indices contains duplicates, then we pick the last update for the index.\n *\n * If an out of bound index is found on CPU, an error is returned.\n *\n * Warning: There are some GPU specific semantics for this operation.\n *  - If an out of bound index is found, the index is ignored.\n *  - The order in which updates are applied is nondeterministic, so the output\n * will be nondeterministic if indices contains duplicates.\n * ```js\n * const shape = [8];\n * const tensor = tf.ones(shape);\n * const indices = tf.tensor2d([4, 3, 1, 7], [4, 1], 'int32');\n * const updates = tf.tensor1d([9, 10, 11, 12]);\n *\n * tf.tensorScatterUpdate(tensor, indices, updates).print();\n *    //[1, 11, 1, 10, 9, 1, 1, 12]\n * ```\n *\n * @param tensor A Tensor. Tensor to copy/update.\n * @param indices The tensor contains the indices into the output tensor, must\n *     have at least 2 axes: (num_updates, index_depth).\n * @param updates The tensor contains the value for the indices.\n *\n * @doc {heading: 'Operations', subheading: 'Slicing and Joining'}\n */\nfunction tensorScatterUpdate_<R extends Rank>(\n    tensor: Tensor<R>|TensorLike, indices: Tensor|TensorLike,\n    updates: Tensor|TensorLike): Tensor<R> {\n  const $tensor = convertToTensor(tensor, 'tensor', 'tensorScatterupdate');\n  const $indices =\n      convertToTensor(indices, 'indices', 'tensorScatterupdate', 'int32');\n  const $updates = convertToTensor(updates, 'updates', 'tensorScatterupdate');\n  scatter_nd_util.validateInput($updates, $indices, $tensor.shape);\n  if ($tensor.dtype !== $updates.dtype) {\n    throw new Error(\n        `tensor and updates must have the same dtype, instead they are ${\n            $tensor.dtype} and ${$updates.dtype}.`);\n  }\n\n  const inputs: TensorScatterUpdateInputs = {\n    tensor: $tensor,\n    indices: $indices,\n    updates: $updates\n  };\n  const attrs: TensorScatterUpdateAttrs = {};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  return ENGINE.runKernel(\n             TensorScatterUpdate, inputs as unknown as NamedTensorMap,\n             attrs as unknown as NamedAttrMap) as Tensor<R>;\n}\n\nexport const tensorScatterUpdate = op({tensorScatterUpdate_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {TopK, TopKAttrs, TopKInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\nimport {op} from './operation';\n\n/**\n * Finds the values and indices of the `k` largest entries along the last\n * dimension.\n *\n * If the input is a vector (rank=1), finds the k largest entries in the vector\n * and outputs their values and indices as vectors. Thus values[j] is the j-th\n * largest entry in input, and its index is indices[j].\n * For higher rank inputs, computes the top k entries along the last dimension.\n *\n * If two elements are equal, the lower-index element appears first.\n *\n * ```js\n * const a = tf.tensor2d([[1, 5], [4, 3]]);\n * const {values, indices} = tf.topk(a);\n * values.print();\n * indices.print();\n * ```\n * @param x 1-D or higher `tf.Tensor` with last dimension being at least `k`.\n * @param k Number of top elements to look for along the last dimension.\n * @param sorted If true, the resulting `k` elements will be sorted by the\n *     values in descending order.\n *\n * @doc {heading: 'Operations', subheading: 'Evaluation'}\n */\nfunction topk_<T extends Tensor>(\n    x: T|TensorLike, k = 1, sorted = true): {values: T, indices: T} {\n  const $x = convertToTensor(x, 'x', 'topk');\n  if ($x.rank === 0) {\n    throw new Error('topk() expects the input to be of rank 1 or higher');\n  }\n  const lastDim = $x.shape[$x.shape.length - 1];\n\n  if (k < 0) {\n    throw new Error(`'k' passed to topk() must be >= 0 but got ${k}`);\n  }\n\n  if (k > lastDim) {\n    throw new Error(\n        `'k' passed to topk() must be <= the last dimension (${lastDim}) ` +\n        `but got ${k}`);\n  }\n\n  const inputs: TopKInputs = {x: $x};\n  const attrs: TopKAttrs = {k, sorted};\n\n  const [values, indices] = ENGINE.runKernel(\n      TopK, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap) as [T, T];\n\n  return {values, indices};\n}\n\nexport const topk = /* @__PURE__ */ op({topk_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {DataType, Rank, ShapeMap} from '../types';\nimport {assertNonNegativeIntegerDimensions} from '../util_base';\n\nimport {buffer} from './buffer';\nimport {op} from './operation';\nimport {MPRandGauss} from './rand_util';\n\n/**\n * Creates a `tf.Tensor` with values sampled from a truncated normal\n * distribution.\n *\n * ```js\n * tf.truncatedNormal([2, 2]).print();\n * ```\n *\n * The generated values follow a normal distribution with specified mean and\n * standard deviation, except that values whose magnitude is more than 2\n * standard deviations from the mean are dropped and re-picked.\n *\n * @param shape An array of integers defining the output tensor shape.\n * @param mean The mean of the normal distribution.\n * @param stdDev The standard deviation of the normal distribution.\n * @param dtype The data type of the output tensor.\n * @param seed The seed for the random number generator.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nfunction truncatedNormal_<R extends Rank>(\n    shape: ShapeMap[R], mean = 0, stdDev = 1, dtype?: 'float32'|'int32',\n    seed?: number): Tensor<R> {\n  assertNonNegativeIntegerDimensions(shape);\n  if (dtype != null && (dtype as DataType) === 'bool') {\n    throw new Error(`Unsupported data type $ { dtype }`);\n  }\n  const randGauss =\n      new MPRandGauss(mean, stdDev, dtype, true /* truncated */, seed);\n  const res = buffer(shape, dtype);\n  for (let i = 0; i < res.values.length; i++) {\n    res.values[i] = randGauss.nextValue();\n  }\n  return res.toTensor();\n}\n\nexport const truncatedNormal = /* @__PURE__ */ op({truncatedNormal_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Unique, UniqueAttrs, UniqueInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor, Tensor1D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {assert} from '../util';\n\nimport {op} from './operation';\n\n/**\n * Finds unique elements along an axis of a tensor.\n *\n * It returns a tensor `values` containing all of the unique elements along the\n * `axis` of the given tensor `x` in the same order that they occur along the\n * `axis` in `x`; `x` does not need to be sorted. It also returns a tensor\n * `indices` the same size as the number of the elements in `x` along the `axis`\n * dimension. It contains the index in the unique output `values`.\n *\n * ```js\n * // A 1-D tensor\n * const a = tf.tensor1d([1, 1, 2, 4, 4, 4, 7, 8, 8]);\n * const {values, indices} = tf.unique(a);\n * values.print();   // [1, 2, 4, 7, 8,]\n * indices.print();  // [0, 0, 1, 2, 2, 2, 3, 4, 4]\n * ```\n *\n * ```js\n * // A 2-D tensor with axis=0\n * //\n * // 'a' is: [[1, 0, 0],\n * //          [1, 0, 0],\n * //          [2, 0, 0]]\n * const a = tf.tensor2d([[1, 0, 0], [1, 0, 0], [2, 0, 0]]);\n * const {values, indices} = tf.unique(a, 0)\n * values.print();   // [[1, 0, 0],\n *                   //  [2, 0, 0]]\n * indices.print();  // [0, 0, 1]\n * ```\n *\n * ```js\n * // A 2-D tensor with axis=1\n * //\n * // 'a' is: [[1, 0, 0],\n * //          [1, 0, 0],\n * //          [2, 0, 0]]\n * const a = tf.tensor2d([[1, 0, 0], [1, 0, 0], [2, 0, 0]]);\n * const {values, indices} = tf.unique(a, 1)\n * values.print();   // [[1, 0],\n *                   //  [1, 0],\n *                   //  [2, 0]]\n * indices.print();  // [0, 1, 1]\n * ```\n * @param x A tensor (int32, string, bool).\n * @param axis The axis of the tensor to find the unique elements.\n * @returns [uniqueElements, indices] (see above for details)\n *\n * @doc {heading: 'Operations', subheading: 'Evaluation'}\n */\nfunction unique_<T extends Tensor>(\n    x: T|TensorLike, axis = 0): {values: T, indices: Tensor1D} {\n  const $x = convertToTensor(x, 'x', 'unique', 'string_or_numeric');\n  assert($x.rank > 0, () => 'The input tensor must be at least 1D');\n\n  const inputs: UniqueInputs = {x: $x};\n  const attrs: UniqueAttrs = {axis};\n  const [values, indices] = ENGINE.runKernel(\n      Unique, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap) as [T, Tensor1D];\n  return {values, indices};\n}\n\nexport const unique = /* @__PURE__ */ op({unique_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {UnsortedSegmentSum, UnsortedSegmentSumAttrs, UnsortedSegmentSumInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor, Tensor1D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {assert, isInt} from '../util';\n\nimport {op} from './operation';\n\n/**\n * Computes the sum along segments of a `tf.Tensor`.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 3, 4]);\n * const segmentIds = tf.tensor1d([1, 2, 0, 1], 'int32');\n * const numSegments = 3;\n *\n * x.unsortedSegmentSum(segmentIds, numSegments).print()\n * //or tf.unsortedSegmentSum(x, segmentIds, numSegments)\n * ```\n * @param x The `tf.Tensor` that will be summed along its segments.\n * @param segmentIds A `tf.Tensor1D` whose rank is equal to the rank of `x`'s\n * dimension along the `axis`.  Maps each element of `x` to a segment.\n * @param numSegments The number of distinct `segmentIds`.\n *\n * @doc {heading: 'Operations', subheading: 'Segment'}\n */\nfunction unsortedSegmentSum_<T extends Tensor>(\n    x: T|TensorLike, segmentIds: Tensor1D|TensorLike, numSegments: number): T {\n  const $x = convertToTensor(x, 'x', 'unsortedSegmentSum');\n  const $segmentIds =\n      convertToTensor(segmentIds, 'segmentIds', 'unsortedSegmentSum', 'int32');\n  assert(isInt(numSegments), () => 'numSegments must be of dtype int');\n\n  const inputs: UnsortedSegmentSumInputs = {x: $x, segmentIds: $segmentIds};\n  const attrs: UnsortedSegmentSumAttrs = {numSegments};\n\n  return ENGINE.runKernel(\n      UnsortedSegmentSum, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const unsortedSegmentSum = /* @__PURE__ */ op({unsortedSegmentSum_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Unpack, UnpackAttrs, UnpackInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {op} from './operation';\n\n/**\n * Unstacks a `tf.Tensor` of rank-`R` into a list of rank-`(R-1)` `tf.Tensor`s.\n *\n * ```js\n * const a = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n *\n * tf.unstack(a).forEach(tensor => tensor.print());\n * ```\n *\n * @param x A tensor object.\n * @param axis The axis to unstack along. Defaults to 0 (the first dim).\n *\n * @doc {heading: 'Tensors', subheading: 'Slicing and Joining'}\n */\nfunction unstack_(x: Tensor|TensorLike, axis = 0): Tensor[] {\n  const $x = convertToTensor(x, 'x', 'unstack', 'string_or_numeric');\n  util.assert(\n      axis >= -$x.shape.length && axis < $x.shape.length,\n      () =>\n          `Axis = ${axis} is not in [-${$x.shape.length}, ${$x.shape.length})`);\n\n  const inputs: UnpackInputs = {value: $x};\n  const attrs: UnpackAttrs = {axis};\n\n  return ENGINE.runKernel(\n      Unpack, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const unstack = /* @__PURE__ */ op({unstack_});\n", "/**\n * @license\n * Copyright 2022 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {TensorLike} from '../types';\nimport {searchSorted} from './search_sorted';\n\n/**\n * Searches for where a value would go in a sorted sequence.\n *\n * This is not a method for checking containment (like javascript in).\n *\n * The typical use case for this operation is \"binning\", \"bucketing\", or\n * \"discretizing\". The values are assigned to bucket-indices based on the edges\n * listed in 'sortedSequence'. This operation returns the bucket-index for each\n * value.\n *\n * The index returned corresponds to the first edge greater than the value.\n *\n * The axis is not settable for this operation. It always operates on the\n * innermost dimension (axis=-1). The operation will accept any number of outer\n * dimensions.\n *\n * Note: This operation assumes that 'upperBound' is sorted along the\n * innermost axis, maybe using 'sort(..., axis=-1)'. If the sequence is not\n * sorted no error is raised and the content of the returned tensor is not well\n * defined.\n *\n * ```js\n * const seq = tf.tensor1d([0, 3, 9, 10, 10]);\n * const values = tf.tensor1d([0, 4, 10]);\n * const result = tf.upperBound(seq, values);\n * result.print(); // [1, 2, 5]\n * ```\n * @param sortedSequence: N-D. Sorted sequence.\n * @param values: N-D. Search values.\n * @return An N-D int32 tensor the size of values containing the result of\n *     applying upper bound to each value. The result is not a global index to\n *     the entire Tensor, but the index in the last dimension.\n * @doc {heading: 'Operations', subheading: 'Evaluation'}\n */\nexport function upperBound(\n    sortedSequence: Tensor|TensorLike, values: Tensor|TensorLike): Tensor {\n  return searchSorted(sortedSequence, values, 'right');\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {Tensor, Variable} from '../tensor';\nimport {DataType, Rank} from '../types';\n\n/**\n * Creates a new variable with the provided initial value.\n * ```js\n * const x = tf.variable(tf.tensor([1, 2, 3]));\n * x.assign(tf.tensor([4, 5, 6]));\n *\n * x.print();\n * ```\n *\n * @param initialValue Initial value for the tensor.\n * @param trainable If true, optimizers are allowed to update it.\n * @param name Name of the variable. Defaults to a unique id.\n * @param dtype If set, initialValue will be converted to the given type.\n *\n * @doc {heading: 'Tensors', subheading: 'Creation'}\n */\nexport function variable<R extends Rank>(\n    initialValue: Tensor<R>, trainable = true, name?: string,\n    dtype?: DataType): Variable<R> {\n  return ENGINE.makeVariable(initialValue, trainable, name, dtype) as\n      Variable<R>;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/** An implementation of the Where kernel shared between cpu and webgl */\n\nimport {buffer} from '../ops/buffer';\nimport {Tensor2D} from '../tensor';\nimport {TypedArray} from '../types';\n\nexport function whereImpl(condShape: number[], condVals: TypedArray): Tensor2D {\n  const indices = [];\n  for (let i = 0; i < condVals.length; i++) {\n    if (condVals[i]) {\n      indices.push(i);\n    }\n  }\n\n  const inBuffer = buffer(condShape, 'int32');\n\n  const out = buffer([indices.length, condShape.length], 'int32');\n  for (let i = 0; i < indices.length; i++) {\n    const loc = inBuffer.indexToLoc(indices[i]);\n    const offset = i * condShape.length;\n    out.values.set(loc, offset);\n  }\n  return out.toTensor() as Tensor2D;\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {whereImpl} from '../backends/where_impl';\nimport {Tensor, Tensor2D} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\n\n/**\n * Returns the coordinates of true elements of condition.\n *\n * The coordinates are returned in a 2-D tensor where the first dimension (rows)\n * represents the number of true elements, and the second dimension (columns)\n * represents the coordinates of the true elements. Keep in mind, the shape of\n * the output tensor can vary depending on how many true values there are in\n * input. Indices are output in row-major order. The resulting tensor has the\n * shape `[numTrueElems, condition.rank]`.\n *\n * This is analogous to calling the python `tf.where(cond)` without an x or y.\n *\n * ```js\n * const cond = tf.tensor1d([false, false, true], 'bool');\n * const result = await tf.whereAsync(cond);\n * result.print();\n * ```\n *\n * @doc {heading: 'Operations', subheading: 'Logical'}\n */\nasync function whereAsync_(condition: Tensor|TensorLike): Promise<Tensor2D> {\n  const $condition =\n      convertToTensor(condition, 'condition', 'whereAsync', 'bool');\n  const vals = await $condition.data();\n  const res = whereImpl($condition.shape, vals);\n  if (condition !== $condition) {\n    $condition.dispose();\n  }\n  return res;\n}\n\nexport const whereAsync = whereAsync_;\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {gather} from './gather';\nimport {reshape} from './reshape';\nimport {squeeze} from './squeeze';\nimport {whereAsync} from './where_async';\n\n/**\n * Apply boolean mask to tensor.\n *\n * ```js\n * const tensor = tf.tensor2d([1, 2, 3, 4, 5, 6], [3, 2]);\n * const mask = tf.tensor1d([1, 0, 1], 'bool');\n * const result = await tf.booleanMaskAsync(tensor, mask);\n * result.print();\n * ```\n *\n * @param tensor N-D tensor.\n * @param mask K-D boolean tensor, K <= N and K must be known statically.\n * @param axis A 0-D int Tensor representing the axis in tensor to mask from.\n *     By default, axis is 0 which will mask from the first dimension.\n *     Otherwise K + axis <= N.\n *\n * @doc {heading: 'Tensors', subheading: 'Slicing and Joining'}\n */\nasync function booleanMaskAsync_(\n    tensor: Tensor|TensorLike, mask: Tensor|TensorLike,\n    axis?: number): Promise<Tensor> {\n  const $tensor = convertToTensor(tensor, 'tensor', 'boolMask');\n  const $mask = convertToTensor(mask, 'mask', 'boolMask', 'bool');\n\n  const axisFrom = axis == null ? 0 : axis;\n  const maskDim = $mask.rank;\n  const tensorShape = $tensor.shape;\n\n  util.assert(maskDim > 0, () => 'mask cannot be scalar');\n  util.assertShapesMatch(\n      tensorShape.slice(axisFrom, axisFrom + maskDim), $mask.shape,\n      `mask's shape must match the first K dimensions of tensor's shape,`);\n\n  let leadingSize = 1;\n  for (let i = axisFrom; i < axisFrom + maskDim; i++) {\n    leadingSize *= tensorShape[i];\n  }\n  const targetTensorShape =\n      tensorShape.slice(0, axisFrom)\n          .concat([leadingSize], tensorShape.slice(axisFrom + maskDim));\n  const reshapedTensor = reshape($tensor, targetTensorShape);\n  const reshapedMask = reshape($mask, [-1]);\n  const positivePositions = await whereAsync(reshapedMask);\n  const indices = squeeze(positivePositions, [1]);\n\n  const res = gather(reshapedTensor, indices, axisFrom);\n\n  // Ensure no memory leak.\n  if (tensor !== $tensor) {\n    $tensor.dispose();\n  }\n  if (mask !== $mask) {\n    $mask.dispose();\n  }\n  indices.dispose();\n  reshapedTensor.dispose();\n  reshapedMask.dispose();\n  positivePositions.dispose();\n\n  return res;\n}\n\nexport const booleanMaskAsync = booleanMaskAsync_;\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {KernelBackend} from './backends/backend';\nimport {ENGINE, Engine, MemoryInfo, ProfileInfo, ScopeFn, TimingInfo} from './engine';\nimport {env} from './environment';\n\nimport {Platform} from './platforms/platform';\nimport {setDeprecationWarningFn, Tensor} from './tensor';\nimport {TensorContainer} from './tensor_types';\nimport {getTensorsInContainer} from './tensor_util';\n\n/**\n * Enables production mode which disables correctness checks in favor of\n * performance.\n *\n * @doc {heading: 'Environment'}\n */\nexport function enableProdMode(): void {\n  env().set('PROD', true);\n}\n\n/**\n * Enables debug mode which will log information about all executed kernels:\n * the elapsed time of the kernel execution, as well as the rank, shape, and\n * size of the output tensor.\n *\n * Debug mode will significantly slow down your application as it will\n * download the result of every operation to the CPU. This should not be used in\n * production. Debug mode does not affect the timing information of the kernel\n * execution as we do not measure download time in the kernel execution time.\n *\n * See also: `tf.profile`, `tf.memory`.\n *\n * @doc {heading: 'Environment'}\n */\nexport function enableDebugMode(): void {\n  env().set('DEBUG', true);\n}\n\n/** Globally disables deprecation warnings */\nexport function disableDeprecationWarnings(): void {\n  env().set('DEPRECATION_WARNINGS_ENABLED', false);\n  console.warn(`TensorFlow.js deprecation warnings have been disabled.`);\n}\n\n/** Warn users about deprecated functionality. */\nexport function deprecationWarn(msg: string) {\n  if (env().getBool('DEPRECATION_WARNINGS_ENABLED')) {\n    console.warn(\n        msg + ' You can disable deprecation warnings with ' +\n        'tf.disableDeprecationWarnings().');\n  }\n}\nsetDeprecationWarningFn(deprecationWarn);\n\n/**\n * Dispose all variables kept in backend engine.\n *\n * @doc {heading: 'Environment'}\n */\nexport function disposeVariables(): void {\n  ENGINE.disposeVariables();\n}\n\n/**\n * It returns the global engine that keeps track of all tensors and backends.\n *\n * @doc {heading: 'Environment'}\n */\nexport function engine(): Engine {\n  return ENGINE;\n}\n\n/**\n * Returns memory info at the current time in the program. The result is an\n * object with the following properties:\n *\n * - `numBytes`: Number of bytes allocated (undisposed) at this time.\n * - `numTensors`: Number of unique tensors allocated.\n * - `numDataBuffers`: Number of unique data buffers allocated\n *   (undisposed) at this time, which is ≤ the number of tensors\n *   (e.g. `a.reshape(newShape)` makes a new Tensor that shares the same\n *   data buffer with `a`).\n * - `unreliable`: True if the memory usage is unreliable. See `reasons` when\n *    `unreliable` is true.\n * - `reasons`: `string[]`, reasons why the memory is unreliable, present if\n *    `unreliable` is true.\n *\n * WebGL Properties:\n * - `numBytesInGPU`: Number of bytes allocated (undisposed) in the GPU only at\n *     this time.\n *\n * @doc {heading: 'Performance', subheading: 'Memory'}\n */\nexport function memory(): MemoryInfo {\n  return ENGINE.memory();\n}\n\n/**\n * Executes the provided function `f()` and returns a promise that resolves\n * with information about the function's memory use:\n * - `newBytes`: the number of new bytes allocated\n * - `newTensors`: the number of new tensors created\n * - `peakBytes`: the peak number of bytes allocated\n * - `kernels`: an array of objects for each kernel involved that reports\n * their input and output shapes, number of bytes used, and number of new\n * tensors created.\n * - `kernelNames`: an array of unique strings with just the names of the\n * kernels in the `kernels` array.\n *\n * ```js\n * const profile = await tf.profile(() => {\n *   const x = tf.tensor1d([1, 2, 3]);\n *   let x2 = x.square();\n *   x2.dispose();\n *   x2 = x.square();\n *   x2.dispose();\n *   return x;\n * });\n *\n * console.log(`newBytes: ${profile.newBytes}`);\n * console.log(`newTensors: ${profile.newTensors}`);\n * console.log(`byte usage over all kernels: ${profile.kernels.map(k =>\n * k.totalBytesSnapshot)}`);\n * ```\n *\n *\n * @doc {heading: 'Performance', subheading: 'Profile'}\n */\nexport function profile(f: () => (TensorContainer | Promise<TensorContainer>)):\n    Promise<ProfileInfo> {\n  return ENGINE.profile(f);\n}\n\n/**\n * Executes the provided function `fn` and after it is executed, cleans up all\n * intermediate tensors allocated by `fn` except those returned by `fn`.\n * `fn` must not return a Promise (async functions not allowed). The returned\n * result can be a complex object.\n *\n * Using this method helps avoid memory leaks. In general, wrap calls to\n * operations in `tf.tidy` for automatic memory cleanup.\n *\n * NOTE: Variables do *not* get cleaned up when inside a tidy(). If you want to\n * dispose variables, please use `tf.disposeVariables` or call dispose()\n * directly on variables.\n *\n * ```js\n * // y = 2 ^ 2 + 1\n * const y = tf.tidy(() => {\n *   // a, b, and one will be cleaned up when the tidy ends.\n *   const one = tf.scalar(1);\n *   const a = tf.scalar(2);\n *   const b = a.square();\n *\n *   console.log('numTensors (in tidy): ' + tf.memory().numTensors);\n *\n *   // The value returned inside the tidy function will return\n *   // through the tidy, in this case to the variable y.\n *   return b.add(one);\n * });\n *\n * console.log('numTensors (outside tidy): ' + tf.memory().numTensors);\n * y.print();\n * ```\n *\n * @param nameOrFn The name of the closure, or the function to execute.\n *     If a name is provided, the 2nd argument should be the function.\n *     If debug mode is on, the timing and the memory usage of the function\n *     will be tracked and displayed on the console using the provided name.\n * @param fn The function to execute.\n *\n * @doc {heading: 'Performance', subheading: 'Memory'}\n */\nexport function tidy<T extends TensorContainer>(\n    nameOrFn: string|ScopeFn<T>, fn?: ScopeFn<T>): T {\n  return ENGINE.tidy(nameOrFn, fn);\n}\n\n/**\n * Disposes any `tf.Tensor`s found within the provided object.\n *\n * @param container an object that may be a `tf.Tensor` or may directly\n *     contain `tf.Tensor`s, such as a `Tensor[]` or `{key: Tensor, ...}`. If\n *     the object is not a `tf.Tensor` or does not contain `Tensors`, nothing\n *     happens. In general it is safe to pass any object here, except that\n *     `Promise`s are not supported.\n *\n * @doc {heading: 'Performance', subheading: 'Memory'}\n */\nexport function dispose(container: TensorContainer) {\n  const tensors = getTensorsInContainer(container);\n  tensors.forEach(tensor => tensor.dispose());\n}\n\n/**\n * Keeps a `tf.Tensor` generated inside a `tf.tidy` from being disposed\n * automatically.\n *\n * ```js\n * let b;\n * const y = tf.tidy(() => {\n *   const one = tf.scalar(1);\n *   const a = tf.scalar(2);\n *\n *   // b will not be cleaned up by the tidy. a and one will be cleaned up\n *   // when the tidy ends.\n *   b = tf.keep(a.square());\n *\n *   console.log('numTensors (in tidy): ' + tf.memory().numTensors);\n *\n *   // The value returned inside the tidy function will return\n *   // through the tidy, in this case to the variable y.\n *   return b.add(one);\n * });\n *\n * console.log('numTensors (outside tidy): ' + tf.memory().numTensors);\n * console.log('y:');\n * y.print();\n * console.log('b:');\n * b.print();\n * ```\n *\n * @param result The tensor to keep from being disposed.\n *\n * @doc {heading: 'Performance', subheading: 'Memory'}\n */\nexport function keep<T extends Tensor>(result: T): T {\n  return ENGINE.keep(result);\n}\n\n/**\n * Executes `f()` and returns a promise that resolves with timing\n * information.\n *\n * The result is an object with the following properties:\n *\n * - `wallMs`: Wall execution time.\n * - `kernelMs`: Kernel execution time, ignoring data transfer. If using the\n * WebGL backend and the query timer extension is not available, this will\n * return an error object.\n * - On `WebGL` The following additional properties exist:\n *   - `uploadWaitMs`: CPU blocking time on texture uploads.\n *   - `downloadWaitMs`: CPU blocking time on texture downloads (readPixels).\n *\n * ```js\n * const x = tf.randomNormal([20, 20]);\n * const time = await tf.time(() => x.matMul(x));\n *\n * console.log(`kernelMs: ${time.kernelMs}, wallTimeMs: ${time.wallMs}`);\n * ```\n *\n * @param f The function to execute and time.\n *\n * @doc {heading: 'Performance', subheading: 'Timing'}\n */\nexport function time(f: () => void): Promise<TimingInfo> {\n  return ENGINE.time(f);\n}\n\n/**\n * Sets the backend (cpu, webgl, wasm, etc) responsible for creating tensors and\n * executing operations on those tensors. Returns a promise that resolves\n * to a boolean if the backend initialization was successful.\n *\n * Note this disposes the current backend, if any, as well as any tensors\n * associated with it. A new backend is initialized, even if it is of the\n * same type as the previous one.\n *\n * @param backendName The name of the backend. Currently supports\n *     `'webgl'|'cpu'` in the browser, `'tensorflow'` under node.js\n *     (requires tfjs-node), and `'wasm'` (requires tfjs-backend-wasm).\n *\n * @doc {heading: 'Backends'}\n */\nexport function setBackend(backendName: string): Promise<boolean> {\n  return ENGINE.setBackend(backendName);\n}\n\n/**\n * Returns a promise that resolves when the currently selected backend (or the\n * highest priority one) has initialized. Await this promise when you are using\n * a backend that has async initialization.\n *\n * @doc {heading: 'Backends'}\n */\nexport function ready(): Promise<void> {\n  return ENGINE.ready();\n}\n\n/**\n * Returns the current backend name (cpu, webgl, etc). The backend is\n * responsible for creating tensors and executing operations on those tensors.\n *\n * @doc {heading: 'Backends'}\n */\nexport function getBackend(): string {\n  return ENGINE.backendName;\n}\n\n/**\n * Removes a backend and the registered factory.\n *\n * @doc {heading: 'Backends'}\n */\nexport function removeBackend(name: string): void {\n  ENGINE.removeBackend(name);\n}\n\n/**\n * Finds the backend registered under the provided name. Returns null if the\n * name is not in the registry, or the registration hasn't finished yet.\n */\nexport function findBackend(name: string): KernelBackend {\n  return ENGINE.findBackend(name);\n}\n\n/**\n * Finds the backend factory registered under the provided name. Returns a\n * function that produces a new backend when called. Returns null if the name\n * is not in the registry.\n */\nexport function findBackendFactory(name: string): () =>\n    KernelBackend | Promise<KernelBackend> {\n  return ENGINE.findBackendFactory(name);\n}\n\n/**\n * Registers a global backend. The registration should happen when importing\n * a module file (e.g. when importing `backend_webgl.ts`), and is used for\n * modular builds (e.g. custom tfjs bundle with only webgl support).\n *\n * @param factory The backend factory function. When called, it should\n * return a backend instance, or a promise of an instance.\n * @param priority The priority of the backend (higher = more important).\n *     In case multiple backends are registered, the priority is used to find\n *     the best backend. Defaults to 1.\n * @return False if there is already a registered backend under this name, true\n *     if not.\n *\n * @doc {heading: 'Backends'}\n */\nexport function registerBackend(\n    name: string, factory: () => KernelBackend | Promise<KernelBackend>,\n    priority = 1): boolean {\n  return ENGINE.registerBackend(name, factory, priority);\n}\n\n/**\n * Gets the current backend. If no backends have been initialized, this will\n * attempt to initialize the best backend. Will throw an error if the highest\n * priority backend has async initialization, in which case you should call\n * 'await tf.ready()' before running other code.\n *\n * @doc {heading: 'Backends'}\n */\nexport function backend(): KernelBackend {\n  return ENGINE.backend;\n}\n\n/**\n * Sets the global platform.\n *\n * @param platformName The name of this platform.\n * @param platform A platform implementation.\n */\nexport function setPlatform(platformName: string, platform: Platform) {\n  env().setPlatform(platformName, platform);\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {tidy} from '../globals';\nimport {Transpose, TransposeAttrs, TransposeInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\nimport {complex} from './complex';\nimport {imag} from './imag';\nimport {neg} from './neg';\nimport {op} from './operation';\nimport {real} from './real';\n\n/**\n * Transposes the `tf.Tensor`. Permutes the dimensions according to `perm`.\n *\n * The returned `tf.Tensor`'s dimension `i` will correspond to the input\n * dimension `perm[i]`. If `perm` is not given, it is set to `[n-1...0]`,\n * where `n` is the rank of the input `tf.Tensor`. Hence by default, this\n * operation performs a regular matrix transpose on 2-D input `tf.Tensor`s.\n *\n * ```js\n * const a = tf.tensor2d([1, 2, 3, 4, 5, 6], [2, 3]);\n *\n * a.transpose().print();  // or tf.transpose(a)\n * ```\n *\n * @param x The tensor to transpose.\n * @param perm The permutation of the dimensions of a.\n * @param conjugate Will conjugate complex input if true.\n *\n * @doc {heading: 'Operations', subheading: 'Matrices'}\n */\nfunction transpose_<T extends Tensor>(\n    x: T|TensorLike, perm?: number[], conjugate?: boolean): T {\n  const $x = convertToTensor(x, 'x', 'transpose');\n\n  if (perm == null) {\n    perm = $x.shape.map((s, i) => i).reverse();\n  }\n  util.assert(\n      $x.rank === perm.length,\n      () => `Error in transpose: rank of input ${$x.rank} ` +\n          `must match length of perm ${perm}.`);\n  perm.forEach(axis => {\n    util.assert(\n        axis >= 0 && axis < $x.rank,\n        () => `All entries in 'perm' must be between 0 and ${$x.rank - 1}` +\n            ` but got ${perm}`);\n  });\n\n  if ($x.rank <= 1) {\n    return $x.clone();\n  }\n\n  const inputs: TransposeInputs = {x: $x};\n  const attrs: TransposeAttrs = {perm};\n\n  if ($x.dtype === 'complex64') {\n    return tidy(() => {\n      let $real = real($x);\n      let $imag = imag($x);\n      $real = ENGINE.runKernel(\n          Transpose, {x: $real} as unknown as NamedTensorMap,\n          attrs as unknown as NamedAttrMap);\n      $imag = ENGINE.runKernel(\n          Transpose, {x: $imag} as unknown as NamedTensorMap,\n          attrs as unknown as NamedAttrMap);\n      if (conjugate) {\n        $imag = neg($imag);\n      }\n      return complex($real, $imag);\n    });\n  }\n\n  return ENGINE.runKernel(\n      Transpose, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const transpose = /* @__PURE__ */ op({transpose_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Scalar, Tensor} from '../tensor';\nimport {assertTypesMatch} from '../tensor_util';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {add} from './add';\nimport {div} from './div';\nimport {mul} from './mul';\nimport {op} from './operation';\nimport {pow} from './pow';\nimport {scalar} from './scalar';\nimport {sub} from './sub';\n\n/**\n * Compute the moving average of a variable.\n *\n * Without zeroDebias, the moving average operation is defined by:\n *   `v += delta`\n * where\n *   `delta = (1 - decay) * (x - v)`\n *\n * With zeroDebias (default), the `delta` term is scaled to debias the\n * effect of the (assumed) zero-initialization of `v`.\n *   `delta /= (1 - decay ^ step)`\n *\n * For more details on the zero-debiasing algorithm, see:\n *   https://arxiv.org/abs/1412.6980\n *\n * Note that this function is completely stateless and does not keep track of\n * step count. The step count needs to be maintained by the caller and passed\n * in as `step`.\n *\n * @param v The current moving average value.\n * @param x New input value, must have the same shape and dtype as `v`.\n * @param decay The decay factor. Typical values are 0.95 and 0.99.\n * @param step Step count.\n * @param zeroDebias: Whether zeroDebias is to be performed (default: `true`).\n * @returns The new moving average value.\n *\n * @doc {heading: 'Operations', subheading: 'Moving Average'}\n */\nfunction movingAverage_<T extends Tensor>(\n    v: T|TensorLike, x: T|TensorLike, decay: number|Scalar,\n    step?: number|Scalar, zeroDebias = true): T {\n  const $v = convertToTensor(v, 'v', 'movingAverage');\n  const $x = convertToTensor(x, 'x', 'movingAverage');\n  const $decay = convertToTensor(decay, 'decay', 'movingAverage');\n\n  assertTypesMatch($v, $x);\n  util.assert(\n      util.arraysEqual($v.shape, $x.shape), () => 'Shape mismatch in v and x');\n\n  const one = scalar(1);\n  const oneMinusDecay = sub(one, $decay);\n\n  let update = mul(sub($x, $v), oneMinusDecay);\n  if (zeroDebias) {\n    util.assert(\n        step != null, () => 'When using zeroDebias: true, step is required.');\n    const $step = convertToTensor(step, 'step', 'movingAverage');\n    update = div(update, sub(one, pow($decay, $step)));\n  }\n  return add($v, update);\n}\n\nexport const movingAverage = /* @__PURE__ */ op({movingAverage_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {ScatterNd, ScatterNdAttrs, ScatterNdInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {Rank, ShapeMap, TensorLike} from '../types';\nimport {assertNonNegativeIntegerDimensions} from '../util_base';\n\nimport {op} from './operation';\nimport * as scatter_nd_util from './scatter_nd_util';\n\n/**\n * Creates a new tensor by applying sparse updates to individual\n * values or slices within a zero tensor of the given shape tensor according to\n * indices. This operator is the inverse of the `tf.gatherND` operator which\n * extracts values or slices from a given tensor.\n *\n * ```js\n * const indices = tf.tensor2d([4, 3, 1, 7], [4, 1], 'int32');\n * const updates = tf.tensor1d([9, 10, 11, 12]);\n * const shape = [8];\n * tf.scatterND(indices, updates, shape).print() //[0, 11, 0, 10, 9, 0, 0, 12]\n * ```\n *\n * @param indices The tensor contains the indices into the output tensor.\n * @param updates The tensor contains the value for the indices.\n * @param shape: The shape of the output tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Slicing and Joining'}\n */\nfunction scatterND_<R extends Rank>(\n    indices: Tensor|TensorLike, updates: Tensor|TensorLike,\n    shape: ShapeMap[R]): Tensor<R> {\n  assertNonNegativeIntegerDimensions(shape);\n  const $indices = convertToTensor(indices, 'indices', 'scatterND', 'int32');\n  const $updates = convertToTensor(updates, 'updates', 'scatterND');\n  scatter_nd_util.validateInput($updates, $indices, shape);\n\n  const inputs: ScatterNdInputs = {indices: $indices, updates: $updates};\n  const attrs: ScatterNdAttrs = {shape};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  return ENGINE.runKernel(\n             ScatterNd, inputs as unknown as NamedTensorMap,\n             attrs as unknown as NamedAttrMap) as Tensor<R>;\n}\n\nexport const scatterND = /* @__PURE__ */ op({scatterND_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor} from '../tensor';\n\n/**\n * Validate sparseToDense inputs.\n *\n * @param sparseIndices A 0-D, 1-D, or 2-D Tensor of type int32.\n * sparseIndices[i] contains the complete index where sparseValues[i] will be\n * placed.\n * @param sparseValues A 0-D or 1-D Tensor. Values\n * corresponding to each row of sparseIndices, or a scalar value to be used for\n * all sparse indices.\n * @param outputShape number[]. Shape of the dense output tensor.\n * @param validateIndices boolean. indice validation is not supported, error\n * will be thrown if it is set.\n */\nexport function validateInput(\n    sparseIndices: Tensor, sparseValues: Tensor, outputShape: number[],\n    defaultValues: Tensor) {\n  if (sparseIndices.dtype !== 'int32') {\n    throw new Error(\n        'tf.sparseToDense() expects the indices to be int32 type,' +\n        ` but the dtype was ${sparseIndices.dtype}.`);\n  }\n  if (sparseIndices.rank > 2) {\n    throw new Error(\n        'sparseIndices should be a scalar, vector, or matrix,' +\n        ` but got shape ${sparseIndices.shape}.`);\n  }\n\n  const numElems = sparseIndices.rank > 0 ? sparseIndices.shape[0] : 1;\n  const numDims = sparseIndices.rank > 1 ? sparseIndices.shape[1] : 1;\n\n  if (outputShape.length !== numDims) {\n    throw new Error(\n        'outputShape has incorrect number of elements:,' +\n        ` ${outputShape.length}, should be: ${numDims}.`);\n  }\n\n  const numValues = sparseValues.size;\n  if (!(sparseValues.rank === 0 ||\n        sparseValues.rank === 1 && numValues === numElems)) {\n    throw new Error(\n        'sparseValues has incorrect shape ' +\n        `${sparseValues.shape}, should be [] or [${numElems}]`);\n  }\n\n  if (sparseValues.dtype !== defaultValues.dtype) {\n    throw new Error('sparseValues.dtype must match defaultValues.dtype');\n  }\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../engine';\nimport {SparseToDense, SparseToDenseAttrs, SparseToDenseInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport * as sparse_to_dense from '../ops/sparse_to_dense_util';\nimport {Scalar, Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {Rank, ScalarLike, ShapeMap, TensorLike} from '../types';\nimport {assertNonNegativeIntegerDimensions} from '../util_base';\n\nimport {op} from './operation';\n\n/**\n * Converts a sparse representation into a dense tensor.\n *\n * Builds an array dense with shape outputShape such that:\n *\n * // If sparseIndices is scalar\n * dense[i] = (i == sparseIndices ? sparseValues : defaultValue)\n *\n * // If sparseIndices is a vector, then for each i\n * dense[sparseIndices[i]] = sparseValues[i]\n *\n * // If sparseIndices is an n by d matrix, then for each i in [0, n)\n * dense[sparseIndices[i][0], ..., sparseIndices[i][d-1]] = sparseValues[i]\n * All other values in dense are set to defaultValue. If sparseValues is a\n * scalar, all sparse indices are set to this single value.\n *\n * If indices are repeated the final value is summed over all values for those\n * indices.\n *\n * ```js\n * const indices = tf.tensor1d([4, 5, 6, 1, 2, 3], 'int32');\n * const values = tf.tensor1d([10, 11, 12, 13, 14, 15], 'float32');\n * const shape = [8];\n * tf.sparseToDense(indices, values, shape).print();\n * ```\n *\n * @param sparseIndices A 0-D, 1-D, or 2-D Tensor of type int32.\n * sparseIndices[i] contains the complete index where sparseValues[i] will be\n * placed.\n * @param sparseValues A 0-D or 1-D Tensor. Values\n * corresponding to each row of sparseIndices, or a scalar value to be used for\n * all sparse indices.\n * @param outputShape Shape of the dense output tensor. The type is inferred.\n * @param defaultValue Scalar. Value to set for indices not specified in\n * sparseIndices. Defaults to zero.\n *\n * @doc {heading: 'Operations', subheading: 'Normalization'}\n */\nfunction sparseToDense_<R extends Rank>(\n    sparseIndices: Tensor|TensorLike, sparseValues: Tensor|TensorLike,\n    outputShape: ShapeMap[R], defaultValue: Scalar|ScalarLike = 0): Tensor<R> {\n  assertNonNegativeIntegerDimensions(outputShape);\n\n  const $sparseIndices =\n      convertToTensor(sparseIndices, 'sparseIndices', 'sparseToDense', 'int32');\n  const $sparseValues = convertToTensor(\n      sparseValues, 'sparseValues', 'sparseToDense', 'string_or_numeric');\n  const $defaultValue = convertToTensor(\n      defaultValue, 'defaultValue', 'sparseToDense', $sparseValues.dtype);\n\n  sparse_to_dense.validateInput(\n      $sparseIndices, $sparseValues, outputShape, $defaultValue);\n\n  const inputs: SparseToDenseInputs = {\n    sparseIndices: $sparseIndices,\n    sparseValues: $sparseValues,\n    defaultValue: $defaultValue\n  };\n\n  const attrs: SparseToDenseAttrs = {outputShape};\n\n  return ENGINE.runKernel(\n      SparseToDense, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const sparseToDense = /* @__PURE__ */ op({sparseToDense_});\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {GatherNd, GatherNdInputs} from '../kernel_names';\nimport {Tensor} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {op} from './operation';\n\n/**\n * Gather slices from input tensor into a Tensor with shape specified by\n * `indices`.\n *\n * `indices` is a K-dimensional integer tensor, best thought of as a\n * (K-1)-dimensional tensor of indices into input, where each element defines a\n * slice of input:\n * output[\\\\(i_0, ..., i_{K-2}\\\\)] = input[indices[\\\\(i_0, ..., i_{K-2}\\\\)]]\n *\n * Whereas in `tf.gather`, `indices` defines slices into the first dimension of\n * input, in `tf.gatherND`, `indices` defines slices into the first N dimensions\n * of input, where N = indices.shape[-1].\n *\n * The last dimension of indices can be at most the rank of input:\n * indices.shape[-1] <= input.rank\n *\n * The last dimension of `indices` corresponds to elements\n * (if indices.shape[-1] == input.rank) or slices\n * (if indices.shape[-1] < input.rank) along dimension indices.shape[-1] of\n * input.\n * The output tensor has shape\n * indices.shape[:-1] + input.shape[indices.shape[-1]:]\n *\n * Note that on CPU, if an out of bound index is found, an error is returned. On\n * GPU, if an out of bound index is found, a 0 is stored in the corresponding\n * output value.\n *\n * ```js\n * const indices = tf.tensor2d([0, 1, 1, 0], [2,2], 'int32');\n * const input = tf.tensor2d([9, 10, 11, 12], [2, 2]);\n * tf.gatherND(input, indices).print() // [10, 11]\n * ```\n *\n * @param x The tensor from which to gather values.\n * @param indices Index tensor, must be of type int32.\n *\n * @doc {heading: 'Operations', subheading: 'Slicing and Joining'}\n */\nfunction gatherND_(x: Tensor|TensorLike, indices: Tensor|TensorLike): Tensor {\n  const $indices = convertToTensor(indices, 'indices', 'gatherND', 'int32');\n  const $x = convertToTensor(x, 'x', 'gatherND', 'string_or_numeric');\n\n  const inputs: GatherNdInputs = {params: $x, indices: $indices};\n\n  return ENGINE.runKernel(GatherNd, inputs as unknown as NamedTensorMap);\n}\n\nexport const gatherND = /* @__PURE__ */ op({gatherND_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport * as util from '../util';\n\n/**\n * Normalize noise shape based on provided tensor and noise shape.\n *\n * @param x Tensor.\n * @param noiseShape The shape for the randomly generated keep/drop flags, as\n *   an array of numbers. Optional.\n * @returns Normalized noise shape.\n */\nexport function getNoiseShape(x: Tensor, noiseShape?: number[]): number[] {\n  if (noiseShape == null) {\n    return x.shape.slice();\n  }\n  if (util.arraysEqual(x.shape, noiseShape)) {\n    return noiseShape;\n  }\n  if (x.shape.length === noiseShape.length) {\n    const newDimension: number[] = [];\n    for (let i = 0; i < x.shape.length; i++) {\n      if (noiseShape[i] == null && x.shape[i] != null) {\n        newDimension.push(x.shape[i]);\n      } else {\n        newDimension.push(noiseShape[i]);\n      }\n    }\n    return newDimension;\n  }\n\n  return noiseShape;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport * as util from '../util';\n\nimport {add} from './add';\nimport {div} from './div';\nimport {getNoiseShape} from './dropout_util';\nimport {floor} from './floor';\nimport {mul} from './mul';\nimport {op} from './operation';\nimport {randomUniform} from './random_uniform';\n\n/**\n * Computes dropout.\n *\n * ```js\n * const x = tf.tensor1d([1, 2, 2, 1]);\n * const rate = 0.75;\n * const output = tf.dropout(x, rate);\n * output.print();\n * ```\n *\n * @param x A floating point Tensor or TensorLike.\n * @param rate A float in the range [0, 1). The probability that each element\n *   of x is discarded.\n * @param noiseShape An array of numbers of type int32, representing the\n * shape for randomly generated keep/drop flags. If the noiseShape has null\n * value, it will be automatically replaced with the x's relative dimension\n * size. Optional.\n * @param seed Used to create random seeds. Optional.\n * @returns A Tensor of the same shape of x.\n *\n * @doc {heading: 'Operations', subheading: 'Dropout'}\n */\nfunction dropout_(\n    x: Tensor|TensorLike, rate: number, noiseShape?: number[],\n    seed?: number|string): Tensor {\n  const $x = convertToTensor(x, 'x', 'dropout');\n\n  util.assert(\n      $x.dtype === 'float32',\n      () => `x has to be a floating point tensor since it's going to be ` +\n          `scaled, but got a ${$x.dtype} tensor instead.`);\n  util.assert(\n      rate >= 0 && rate < 1,\n      () => `rate must be a float in the range [0, 1), but got ${rate}.`);\n\n  if (rate === 0) {\n    return x instanceof Tensor ? $x.clone() : $x;\n  }\n\n  const $noiseShape = getNoiseShape($x, noiseShape);\n  const keepProb = 1 - rate;\n  const multiplier = div(\n      floor(add(randomUniform($noiseShape, 0, 1, 'float32', seed), keepProb)),\n      keepProb);\n\n  return mul($x, multiplier);\n}\n\nexport const dropout = /* @__PURE__ */ op({dropout_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor1D} from '../tensor';\nimport {tensor1d} from './tensor1d';\n\nexport function enclosingPowerOfTwo(value: number) {\n  // Return 2**N for integer N such that 2**N >= value.\n  return Math.floor(Math.pow(2, Math.ceil(Math.log(value) / Math.log(2.0))));\n}\n\nexport function cosineWindow(\n    windowLength: number, a: number, b: number): Tensor1D {\n  const even = 1 - windowLength % 2;\n  const newValues = new Float32Array(windowLength);\n  for (let i = 0; i < windowLength; ++i) {\n    const cosArg = (2.0 * Math.PI * i) / (windowLength + even - 1);\n    newValues[i] = a - b * Math.cos(cosArg);\n  }\n  return tensor1d(newValues, 'float32');\n}\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\nimport {convertToTensor} from '../tensor_util_env';\nimport {TensorLike} from '../types';\nimport {assert, assertShapesMatch, getTypedArrayFromDType} from '../util';\nimport {tensor} from './tensor';\n\n/**\n * Returns whether the targets are in the top K predictions.\n *\n * ```js\n * const predictions = tf.tensor2d([[20, 10, 40, 30], [30, 50, -20, 10]]);\n * const targets = tf.tensor1d([2, 0]);\n * const precision = await tf.inTopKAsync(predictions, targets);\n * precision.print();\n * ```\n * @param predictions 2-D or higher `tf.Tensor` with last dimension being\n *     at least `k`.\n * @param targets 1-D or higher `tf.Tensor`.\n * @param k Optional Number of top elements to look at for computing precision,\n *     default to 1.\n *\n * @doc {heading: 'Operations', subheading: 'Evaluation'}\n */\nasync function inTopKAsync_<T extends Tensor, U extends Tensor>(\n    predictions: T|TensorLike, targets: U|TensorLike, k = 1): Promise<U> {\n  const $predictions = convertToTensor(predictions, 'predictions', 'inTopK');\n  const $targets = convertToTensor(targets, 'targets', 'inTopK');\n\n  assert(\n      $predictions.rank > 1,\n      () => 'inTopK() expects the predictions to be of rank 2 or higher, ' +\n          `but got ${$predictions.rank}`);\n  assert(\n      $predictions.rank - 1 === $targets.rank,\n      () => `predictions rank should be 1 larger than ` +\n          `targets rank, but got predictions rank ` +\n          `${$predictions.rank} and targets rank ${$targets.rank}`);\n  assertShapesMatch(\n      $predictions.shape.slice(0, $predictions.shape.length - 1),\n      $targets.shape,\n      `predictions's shape should be align with the targets' shape, ` +\n          'except the last dimension.');\n  const lastDim = $predictions.shape[$predictions.shape.length - 1];\n  assert(\n      k > 0 && k <= lastDim,\n      () => `'k' passed to inTopK() must be > 0 && <= the predictions last ` +\n          `dimension (${lastDim}), but got ${k}`);\n\n  const predictionsVals = await $predictions.data();\n  const targetsVals = await $targets.data();\n\n  // Reshape predictionsVals into a 2d tensor [batch, lastDim]\n  // and look up topK along lastDim.\n  const [batch, size] = [predictionsVals.length / lastDim, lastDim];\n  const precision = getTypedArrayFromDType('bool', batch);\n\n  for (let b = 0; b < batch; b++) {\n    const offset = b * size;\n    const vals = predictionsVals.subarray(offset, offset + size);\n    const valAndInd: Array<{value: number, index: number}> = [];\n    for (let i = 0; i < vals.length; i++) {\n      valAndInd.push({value: vals[i], index: i});\n    }\n    valAndInd.sort((a, b) => b.value - a.value);\n\n    precision[b] = 0;\n    for (let i = 0; i < k; i++) {\n      if (valAndInd[i].index === targetsVals[b]) {\n        precision[b] = 1;\n        break;\n      }\n    }\n  }\n\n  if (predictions !== $predictions) {\n    $predictions.dispose();\n  }\n  if (targets !== $targets) {\n    $targets.dispose();\n  }\n\n  // Output precision has the same shape as targets.\n  return tensor(precision, $targets.shape, 'bool') as U;\n}\n\nexport const inTopKAsync = inTopKAsync_;\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {Conv2DBackpropFilter, Conv2DBackpropFilterAttrs, Conv2DBackpropFilterInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\nimport * as util from '../util';\n\nimport * as conv_util from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\n/**\n * Computes the derivative of the filter of a 2D convolution.\n *\n * @param x The input tensor, of rank 4 or rank 3 of shape\n *     [batch, height, width, inChannels]. If rank 3, batch of 1 is assumed.\n * @param dy The dy image, of rank 4 or rank 3, of shape\n *     [batch, height, width, outDepth]. If rank 3, batch of 1 is assumed.\n * @param filterShape The shape of the filter, length 4,\n *     [filterHeight, filterWidth, inDepth, outDepth].\n * @param strides The strides of the convolution: [strideHeight,\n * strideWidth].\n * @param pad A string from: 'same', 'valid'. The type of padding algorithm\n *     used in the forward prop of the op.\n * @param dataFormat: An optional string from: \"NHWC\", \"NCHW\". Defaults to\n *     \"NHWC\". Specify the data format of the input and output data. With the\n *     default format \"NHWC\", the data is stored in the order of: [batch,\n *     height, width, channels].\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n */\nfunction conv2DBackpropFilter_<T extends Tensor3D|Tensor4D>(\n    x: T, dy: T, filterShape: [number, number, number, number],\n    strides: [number, number]|number,\n    pad: 'valid'|'same'|number|conv_util.ExplicitPadding,\n    dataFormat: 'NHWC'|'NCHW' = 'NHWC',\n    dimRoundingMode?: 'floor'|'round'|'ceil'): Tensor4D {\n  let x4D = x as Tensor4D;\n  if (x.rank === 3) {\n    x4D = reshape(x, [1, x.shape[0], x.shape[1], x.shape[2]]);\n  }\n  let dy4D = dy as Tensor4D;\n  if (dy4D.rank === 3) {\n    dy4D = reshape(dy, [1, dy.shape[0], dy.shape[1], dy.shape[2]]);\n  }\n  util.assert(\n      x4D.rank === 4,\n      () => `Error in conv2dDerFilter: input must be rank 4, but got shape ` +\n          `${x4D.shape}.`);\n  util.assert(\n      dy4D.rank === 4,\n      () => `Error in conv2dDerFilter: dy must be rank 4, but got shape ` +\n          `${dy4D.shape}.`);\n  util.assert(\n      filterShape.length === 4,\n      () => `Error in conv2dDerFilter: filterShape must be length 4, but got ` +\n          `${filterShape}.`);\n  const inDepth = dataFormat === 'NHWC' ? x4D.shape[3] : x4D.shape[1];\n  const outDepth = dataFormat === 'NHWC' ? dy4D.shape[3] : dy4D.shape[1];\n  util.assert(\n      inDepth === filterShape[2],\n      () => `Error in conv2dDerFilter: depth of input ${inDepth}) must ` +\n          `match input depth in filter (${filterShape[2]}.`);\n  util.assert(\n      outDepth === filterShape[3],\n      () => `Error in conv2dDerFilter: depth of dy (${outDepth}) must ` +\n          `match output depth for filter (${filterShape[3]}).`);\n  conv_util.checkPadOnDimRoundingMode('conv2dDerFilter', pad, dimRoundingMode);\n  const inputs: Conv2DBackpropFilterInputs = {x: x4D, dy: dy4D};\n  const attrs: Conv2DBackpropFilterAttrs =\n      {strides, pad, dataFormat, dimRoundingMode, filterShape};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  return ENGINE.runKernel(\n             Conv2DBackpropFilter, inputs as unknown as NamedTensorMap,\n             attrs as unknown as NamedAttrMap) as Tensor4D;\n}\n\nexport const conv2DBackpropFilter = /* @__PURE__ */ op({conv2DBackpropFilter_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../tensor';\n\nimport * as broadcast_util from './broadcast_util';\nimport {elu} from './elu';\nimport {Activation} from './fused_types';\nimport {leakyRelu} from './leaky_relu';\nimport {mul} from './mul';\nimport {prelu} from './prelu';\nimport {relu} from './relu';\nimport {relu6} from './relu6';\nimport {reshape} from './reshape';\nimport {sigmoid} from './sigmoid';\nimport {step} from './step';\nimport {sum} from './sum';\n\n// Returns gradient for fused activation.\nexport function getFusedDyActivation(\n    dy: Tensor, y: Tensor, activation: Activation): Tensor {\n  if (activation == null || activation === 'linear') {\n    return dy;\n  }\n  if (activation === 'relu') {\n    return mul(dy, step(y));\n  }\n  throw new Error(\n      `Cannot compute gradient for fused activation ${activation}.`);\n}\n\n// Returns gradient for fused bias.\nexport function getFusedBiasGradient(\n    bias: Tensor, dyActivation: Tensor): Tensor {\n  let res = dyActivation;\n  const reduceAxes =\n      broadcast_util.getReductionAxes(bias.shape, dyActivation.shape);\n  if (reduceAxes.length > 0) {\n    res = sum(res, reduceAxes);\n  }\n  return reshape(res, bias.shape);\n}\n\nexport function applyActivation(\n    x: Tensor, activation: Activation, preluActivationWeights?: Tensor,\n    leakyreluAlpha?: number): Tensor {\n  if (activation === 'linear') {\n    return x;\n  } else if (activation === 'relu') {\n    return relu(x);\n  } else if (activation === 'elu') {\n    return elu(x);\n  } else if (activation === 'relu6') {\n    return relu6(x);\n  } else if (activation === 'prelu') {\n    return prelu(x, preluActivationWeights);\n  } else if (activation === 'leakyrelu') {\n    return leakyRelu(x, leakyreluAlpha);\n  } else if (activation === 'sigmoid') {\n    return sigmoid(x);\n  }\n  throw new Error(`Unknown fused activation ${activation}.`);\n}\n\n// Whether we should call fused ops.\nexport const shouldFuse = (gradientDepth: number, activation: Activation) => {\n  const gradientMode = gradientDepth > 0;\n  return !gradientMode || activation === 'linear';\n};\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {customGrad} from '../../gradients';\nimport {FusedConv2D, FusedConv2DAttrs, FusedConv2DInputs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor, Tensor3D, Tensor4D} from '../../tensor';\nimport {GradSaveFunc, NamedTensorMap} from '../../tensor_types';\nimport {makeTypesMatch} from '../../tensor_util';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\nimport {add} from '../add';\nimport * as broadcast_util from '../broadcast_util';\nimport {conv2d as unfusedConv2d} from '../conv2d';\nimport {conv2DBackpropFilter} from '../conv2d_backprop_filter';\nimport {conv2DBackpropInput} from '../conv2d_backprop_input';\nimport * as conv_util from '../conv_util';\nimport {Activation} from '../fused_types';\nimport {applyActivation, getFusedBiasGradient, getFusedDyActivation, shouldFuse} from '../fused_util';\nimport {op} from '../operation';\nimport {reshape} from '../reshape';\n\n/**\n * Computes a 2D convolution over the input x, optionally fused with adding a\n * bias and applying an activation.\n *\n * ```js\n * const inputDepth = 2;\n * const inShape = [2, 2, 2, inputDepth];\n * const outputDepth = 2;\n * const fSize = 1;\n * const pad = 0;\n * const strides = 1;\n *\n * const x = tf.tensor4d( [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n * 16], inShape);\n * const w = tf.tensor4d([-1, 1, -2, 0.5], [fSize, fSize, inputDepth,\n * outputDepth]);\n *\n * tf.fused.conv2d({ x, filter: w, strides, pad, dataFormat: 'NHWC',\n * dilations: [1, 1], bias: tf.scalar(5), activation: 'relu' }).print();\n * ```\n *\n * @param obj An object with the following properties:\n * @param x The input tensor, of rank 4 or rank 3, of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is\n * assumed.\n * @param filter The filter, rank 4, of shape\n *     `[filterHeight, filterWidth, inDepth, outDepth]`.\n * @param strides The strides of the convolution: `[strideHeight,\n * strideWidth]`.\n * @param pad The type of padding algorithm.\n *   - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *   - `valid` output will be smaller than input if filter is larger\n *       than 1x1.\n *   - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dataFormat An optional string from: \"NHWC\", \"NCHW\". Defaults to\n *     \"NHWC\". Specify the data format of the input and output data. With the\n *     default format \"NHWC\", the data is stored in the order of: [batch,\n *     height, width, channels]. Only \"NHWC\" is currently supported.\n * @param dilations The dilation rates: `[dilationHeight, dilationWidth]`\n *     in which we sample input values across the height and width dimensions\n *     in atrous convolution. Defaults to `[1, 1]`. If `dilations` is a single\n *     number, then `dilationHeight == dilationWidth`. If it is greater than\n *     1, then all values of `strides` must be 1.\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n * @param bias Tensor to be added to the result.\n * @param activation Name of activation kernel (defaults to `linear`) to be\n *     applied\n *      after biasAdd.\n * @param preluActivationWeights Tensor of prelu weights to be applied as part\n *     of a `prelu` activation, typically the same shape as `x`.\n * @param leakyreluAlpha Optional. Alpha to be applied as part of a `leakyrelu`\n *     activation.\n */\nfunction fusedConv2d_<T extends Tensor3D|Tensor4D>({\n  x,\n  filter,\n  strides,\n  pad,\n  dataFormat = 'NHWC',\n  dilations = [1, 1],\n  dimRoundingMode,\n  bias,\n  activation = 'linear',\n  preluActivationWeights,\n  leakyreluAlpha\n}: {\n  x: T|TensorLike,\n  filter: Tensor4D|TensorLike,\n  strides: [number, number]|number,\n  pad: 'valid'|'same'|number|conv_util.ExplicitPadding,\n  dataFormat?: 'NHWC'|'NCHW',\n  dilations?: [number, number]|number,\n  dimRoundingMode?: 'floor'|'round'|'ceil',\n  bias?: Tensor|TensorLike,\n  activation?: Activation,\n  preluActivationWeights?: Tensor,\n  leakyreluAlpha?: number\n}): T {\n  activation = activation || 'linear';\n\n  if (shouldFuse(ENGINE.state.gradientDepth, activation) === false) {\n    // TODO: Transpose bias and preluActivationWeights properly for NCHW\n    // format before computation.\n    util.assert(\n        dataFormat === 'NHWC',\n        () => `Error in fused conv2d: got dataFormat of ${dataFormat} but ` +\n            `only NHWC is currently supported for the case of gradient depth ` +\n            `is 0 and the activation is not linear.`);\n\n    let result = unfusedConv2d(\n        x, filter, strides, pad, dataFormat, dilations, dimRoundingMode);\n    if (bias != null) {\n      result = add(result, bias);\n    }\n\n    return applyActivation(\n               result, activation, preluActivationWeights, leakyreluAlpha) as T;\n  }\n\n  const $x = convertToTensor(x, 'x', 'conv2d', 'float32');\n  const $filter = convertToTensor(filter, 'filter', 'conv2d', 'float32');\n\n  let x4D = $x as Tensor4D;\n  let reshapedTo4D = false;\n\n  if ($x.rank === 3) {\n    reshapedTo4D = true;\n    x4D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2]]);\n  }\n  util.assert(\n      x4D.rank === 4,\n      () => `Error in fused conv2d: input must be rank 4, but got rank ` +\n          `${x4D.rank}.`);\n  util.assert(\n      $filter.rank === 4,\n      () => `Error in fused conv2d: filter must be rank 4, but got rank ` +\n          `${$filter.rank}.`);\n  conv_util.checkPadOnDimRoundingMode('fused conv2d', pad, dimRoundingMode);\n  const inputChannels = dataFormat === 'NHWC' ? x4D.shape[3] : x4D.shape[1];\n  util.assert(\n      $filter.shape[2] === inputChannels,\n      () => `Error in conv2d: depth of input (${inputChannels}) must match ` +\n          `input depth for filter ${$filter.shape[2]}.`);\n  util.assert(\n      conv_util.eitherStridesOrDilationsAreOne(strides, dilations),\n      () => 'Error in conv2D: Either strides or dilations must be 1. ' +\n          `Got strides ${strides} and dilations '${dilations}'`);\n\n  const convInfo = conv_util.computeConv2DInfo(\n      x4D.shape, $filter.shape, strides, dilations, pad, dimRoundingMode);\n\n  let $bias: Tensor;\n  if (bias != null) {\n    $bias = convertToTensor(bias, 'bias', 'fused conv2d');\n    [$bias] = makeTypesMatch($bias, $x);\n\n    // According to TensorFlow, the bias is supposed be a 1-D tensor or a\n    // scalar.\n    //\n    // 3-D or 4-D bias is not disabled for NHWC format, because they are\n    // currently being used in some cases. For examplem in our code base,\n    // https://github.com/tensorflow/tfjs/blob/b53bd47e880367ae57493f0ea628abaf08db2d5d/tfjs-core/src/ops/fused/fused_conv2d_test.ts#L1972.\n    if (dataFormat === 'NHWC') {\n      broadcast_util.assertAndGetBroadcastShape(convInfo.outShape, $bias.shape);\n    } else {\n      util.assert(\n          $bias.shape.length <= 1,\n          () => `Error in fused conv2d: only supports scalar or 1-D Tensor ` +\n              `bias for NCHW format but got the bias of ` +\n              `rank-${$bias.shape.length}.`);\n\n      util.assert(\n          $bias.shape.length === 0 || $bias.shape[0] === convInfo.outChannels ||\n              $bias.shape[0] === 1,\n          () => `Error in fused conv2d: bias shape (${$bias.shape}) is not ` +\n              `compatible with the number of output channels ` +\n              `(${convInfo.outChannels})`);\n    }\n  }\n\n  let $preluActivationWeights: Tensor;\n  if (preluActivationWeights != null) {\n    // PReLU's activation weights could be a scalar, a 1-D tensor or a 3-D\n    // tensor.\n    const alphaShape = preluActivationWeights.shape;\n    util.assert(\n        alphaShape.length <= 1 || alphaShape.length === 3,\n        () => `Error in fused conv2d: only supports scalar, 1-D Tensor or ` +\n            `3-D Tensor PReLU activation weights but got a tensor of ` +\n            `rank-${alphaShape.length}.`);\n\n    if (alphaShape.length === 1) {\n      // Whether the data format is NCHW or NHWC, the 1-D PReLU activation\n      // weights tensor should be aligned with the output channels of conv2d\n      // result.\n      util.assert(\n          alphaShape[0] === 1 || alphaShape[0] === convInfo.outChannels,\n          () => `Error in fused conv2d: PReLU activation weights ` +\n              `(${alphaShape}) is not compatible with the number of output ` +\n              `channels (${convInfo.outChannels}).`);\n    } else if (alphaShape.length === 3) {\n      // Whether the data format is NCHW or NHWC, the PReLU activation weights\n      // tensor should has the compatible shape with the result of conv2d.\n      try {\n        broadcast_util.assertAndGetBroadcastShape(\n            alphaShape, convInfo.outShape);\n      } catch (e) {\n        const errMsg =\n            `Error in fused conv2d: PReLU activation weights (${alphaShape}) ` +\n            `is not compatible with the output shape of the conv2d ` +\n            `(${convInfo.outShape}).`;\n        throw Error(errMsg);\n      }\n    }\n\n    $preluActivationWeights = convertToTensor(\n        preluActivationWeights, 'prelu weights', 'fused conv2d');\n  }\n\n  const grad = (dy: Tensor4D, saved: Tensor[]) => {\n    util.assert(\n        dataFormat === 'NHWC',\n        () => `Error in gradient of fused conv2D: got dataFormat of ${\n            dataFormat} but only NHWC is currently supported.`);\n\n    const [$filter, x4D, y, $bias] =\n        saved as [Tensor4D, Tensor4D, Tensor4D, Tensor];\n\n    const dyActivation = getFusedDyActivation(dy, y, activation) as Tensor4D;\n\n    util.assert(\n        conv_util.tupleValuesAreOne(dilations),\n        () => 'Error in gradient of fused conv2D: ' +\n            `dilation rates greater than 1 ` +\n            `are not yet supported in gradients. Got dilations '${dilations}'`);\n\n    const xDer =\n        conv2DBackpropInput(x4D.shape, dyActivation, $filter, strides, pad);\n    const filterDer =\n        conv2DBackpropFilter(x4D, dyActivation, $filter.shape, strides, pad);\n    const der: Tensor[] = [xDer, filterDer];\n\n    if ($bias != null) {\n      const biasDer = getFusedBiasGradient($bias, dyActivation);\n      der.push(biasDer);\n    }\n    return der;\n  };\n\n  const inputs: FusedConv2DInputs = {\n    x: x4D,\n    filter: $filter,\n    bias: $bias,\n    preluActivationWeights: $preluActivationWeights\n  };\n\n  const attrs: FusedConv2DAttrs = {\n    strides,\n    pad,\n    dataFormat,\n    dilations,\n    dimRoundingMode,\n    activation,\n    leakyreluAlpha\n  };\n\n  // Depending on the the params passed in we will have different number of\n  // inputs and thus a a different number of elements in the gradient.\n  if (bias == null) {\n    const customOp =\n        customGrad((x4D: Tensor4D, filter: Tensor4D, save: GradSaveFunc) => {\n          let res: Tensor4D|Tensor3D =\n              // tslint:disable-next-line: no-unnecessary-type-assertion\n              ENGINE.runKernel(\n                  FusedConv2D, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap);\n\n          save([filter, x4D, res]);\n\n          if (reshapedTo4D) {\n            // tslint:disable-next-line: no-unnecessary-type-assertion\n            res = reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as\n                Tensor3D;\n          }\n\n          return {value: res, gradFunc: grad};\n        });\n    return customOp(x4D, $filter) as T;\n  } else {\n    const customOpWithBias = customGrad(\n        (x4D: Tensor4D, filter: Tensor4D, bias: Tensor, save: GradSaveFunc) => {\n          let res: Tensor4D|Tensor3D = ENGINE.runKernel(\n              FusedConv2D, inputs as unknown as NamedTensorMap,\n              attrs as unknown as NamedAttrMap);\n\n          save([filter, x4D, res, bias]);\n\n          if (reshapedTo4D) {\n            // tslint:disable-next-line: no-unnecessary-type-assertion\n            res = reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as\n                Tensor3D;\n          }\n\n          return {value: res, gradFunc: grad};\n        });\n\n    return customOpWithBias(x4D, $filter, $bias) as T;\n  }\n}\nexport const conv2d = /* @__PURE__ */ op({fusedConv2d_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {DepthwiseConv2dNativeBackpropFilter, DepthwiseConv2dNativeBackpropFilterAttrs, DepthwiseConv2dNativeBackpropFilterInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\n\nimport {ExplicitPadding} from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\nfunction depthwiseConv2dNativeBackpropFilter_<T extends Tensor3D|Tensor4D>(\n    x: T, dy: T, filterShape: [number, number, number, number],\n    strides: [number, number]|number,\n    pad: 'valid'|'same'|number|ExplicitPadding,\n    dilations: [number, number]|number = [1, 1],\n    dimRoundingMode?: 'floor'|'round'|'ceil'): Tensor4D {\n  let x4D = x as Tensor4D;\n  if (x.rank === 3) {\n    x4D = reshape(x, [1, x.shape[0], x.shape[1], x.shape[2]]);\n  }\n  let dy4D = dy as Tensor4D;\n  if (dy4D.rank === 3) {\n    dy4D = reshape(dy, [1, dy.shape[0], dy.shape[1], dy.shape[2]]);\n  }\n\n  const inputs: DepthwiseConv2dNativeBackpropFilterInputs = {x: x4D, dy: dy4D};\n  const attrs: DepthwiseConv2dNativeBackpropFilterAttrs =\n      {strides, pad, dimRoundingMode, dilations, filterShape};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  return ENGINE.runKernel(\n             DepthwiseConv2dNativeBackpropFilter,\n             inputs as unknown as NamedTensorMap,\n             attrs as unknown as NamedAttrMap) as Tensor4D;\n}\n\nexport const depthwiseConv2dNativeBackpropFilter =\n    op({depthwiseConv2dNativeBackpropFilter_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../engine';\nimport {DepthwiseConv2dNativeBackpropInput, DepthwiseConv2dNativeBackpropInputAttrs, DepthwiseConv2dNativeBackpropInputInputs} from '../kernel_names';\nimport {NamedAttrMap} from '../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../tensor';\nimport {NamedTensorMap} from '../tensor_types';\n\nimport {ExplicitPadding} from './conv_util';\nimport {op} from './operation';\nimport {reshape} from './reshape';\n\nfunction depthwiseConv2dNativeBackpropInput_<T extends Tensor3D|Tensor4D>(\n    xShape: [number, number, number, number], dy: T, filter: Tensor4D,\n    strides: [number, number]|number,\n    pad: 'valid'|'same'|number|ExplicitPadding,\n    dilations: [number, number]|number = [1, 1],\n    dimRoundingMode?: 'floor'|'round'|'ceil'): T {\n  let dy4D = dy as Tensor4D;\n  let reshapedTo4D = false;\n  if (dy.rank === 3) {\n    reshapedTo4D = true;\n    dy4D = reshape(dy, [1, dy.shape[0], dy.shape[1], dy.shape[2]]);\n  }\n\n  const inputs: DepthwiseConv2dNativeBackpropInputInputs = {dy: dy4D, filter};\n  const attrs: DepthwiseConv2dNativeBackpropInputAttrs =\n      {strides, pad, dimRoundingMode, dilations, inputShape: xShape};\n\n  const res =\n      // tslint:disable-next-line: no-unnecessary-type-assertion\n      ENGINE.runKernel(\n          DepthwiseConv2dNativeBackpropInput,\n          inputs as unknown as NamedTensorMap,\n          attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n  return res;\n}\n\nexport const depthwiseConv2dNativeBackpropInput =\n    op({depthwiseConv2dNativeBackpropInput_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {customGrad} from '../../gradients';\nimport {FusedDepthwiseConv2D, FusedDepthwiseConv2DAttrs, FusedDepthwiseConv2DInputs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor, Tensor3D, Tensor4D} from '../../tensor';\nimport {GradSaveFunc, NamedTensorMap} from '../../tensor_types';\nimport {makeTypesMatch} from '../../tensor_util';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\nimport {add} from '../add';\nimport * as broadcast_util from '../broadcast_util';\nimport * as conv_util from '../conv_util';\nimport {depthwiseConv2d as unfusedDepthwiseConv2d} from '../depthwise_conv2d';\nimport {depthwiseConv2dNativeBackpropFilter} from '../depthwise_conv2d_native_backprop_filter';\nimport {depthwiseConv2dNativeBackpropInput} from '../depthwise_conv2d_native_backprop_input';\nimport {Activation} from '../fused_types';\nimport {applyActivation, getFusedBiasGradient, getFusedDyActivation, shouldFuse} from '../fused_util';\nimport {op} from '../operation';\nimport {reshape} from '../reshape';\n\n/**\n * Computes depthwise 2D convolution, optionally fused with adding a\n * bias and applying an activation.\n *\n * Given a 4D `input` array and a `filter` array of shape\n * `[filterHeight, filterWidth, inChannels, channelMultiplier]` containing\n * `inChannels` convolutional filters of depth 1, this op applies a\n * different filter to each input channel (expanding from 1 channel to\n * `channelMultiplier` channels for each), then concatenates the results\n * together. The output has `inChannels * channelMultiplier` channels.\n *\n * See\n * [https://www.tensorflow.org/api_docs/python/tf/nn/depthwise_conv2d](\n *     https://www.tensorflow.org/api_docs/python/tf/nn/depthwise_conv2d)\n * for more details.\n *\n * @param obj An object with the following properties:\n * @param x The input tensor, of rank 4 or rank 3, of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is\n * assumed.\n * @param filter The filter tensor, rank 4, of shape\n *     `[filterHeight, filterWidth, inChannels, channelMultiplier]`.\n * @param strides The strides of the convolution: `[strideHeight,\n * strideWidth]`. If strides is a single number, then `strideHeight ==\n * strideWidth`.\n * @param pad The type of padding algorithm.\n *   - `same` and stride 1: output will be of same size as input,\n *       regardless of filter size.\n *   - `valid`: output will be smaller than input if filter is larger\n *       than 1x1.\n *   - For more info, see this guide:\n *     [https://www.tensorflow.org/api_docs/python/tf/nn/convolution](\n *          https://www.tensorflow.org/api_docs/python/tf/nn/convolution)\n * @param dilations The dilation rates: `[dilationHeight, dilationWidth]`\n *     in which we sample input values across the height and width dimensions\n *     in atrous convolution. Defaults to `[1, 1]`. If `rate` is a single\n *     number, then `dilationHeight == dilationWidth`. If it is greater than\n *     1, then all values of `strides` must be 1.\n * @param dataFormat: An optional string from: \"NHWC\", \"NCHW\". Defaults to\n *     \"NHWC\". Specify the data format of the input and output data. With the\n *     default format \"NHWC\", the data is stored in the order of: [batch,\n *     height, width, channels]. Only \"NHWC\" is currently supported.\n * @param dimRoundingMode A string from: 'ceil', 'round', 'floor'. If none is\n *     provided, it will default to truncate.\n * @param bias Tensor to be added to the result.\n * @param activation Name of activation kernel (defaults to `linear`).\n * @param preluActivationWeights Tensor of prelu weights to be applied as part\n *     of a `prelu` activation, typically the same shape as `x`.\n * @param leakyreluAlpha Optional. Alpha to be applied as part of a `leakyrelu`\n *     activation.\n */\nfunction fusedDepthwiseConv2d_<T extends Tensor3D|Tensor4D>({\n  x,\n  filter,\n  strides,\n  pad,\n  dataFormat = 'NHWC',\n  dilations = [1, 1],\n  dimRoundingMode,\n  bias,\n  activation = 'linear',\n  preluActivationWeights,\n  leakyreluAlpha\n}: {\n  x: T|TensorLike,\n  filter: Tensor4D|TensorLike,\n  strides: [number, number]|number,\n  pad: 'valid'|'same'|number,\n  dataFormat?: 'NHWC'|'NCHW',\n  dilations?: [number, number]|number,\n  dimRoundingMode?: 'floor'|'round'|'ceil',\n  bias?: Tensor|TensorLike,\n  activation?: Activation,\n  preluActivationWeights?: Tensor,\n  leakyreluAlpha?: number\n}): T {\n  if (shouldFuse(ENGINE.state.gradientDepth, activation) === false) {\n    let result = unfusedDepthwiseConv2d(\n        x, filter, strides, pad, dataFormat, dilations, dimRoundingMode);\n    if (bias != null) {\n      result = add(result, bias);\n    }\n\n    return applyActivation(\n               result, activation, preluActivationWeights, leakyreluAlpha) as T;\n  }\n\n  const $x = convertToTensor(x, 'x', 'depthwiseConv2d', 'float32');\n  const $filter =\n      convertToTensor(filter, 'filter', 'depthwiseConv2d', 'float32');\n\n  let x4D = $x as Tensor4D;\n  let reshapedTo4D = false;\n  if ($x.rank === 3) {\n    reshapedTo4D = true;\n    x4D = reshape($x, [1, $x.shape[0], $x.shape[1], $x.shape[2]]);\n  }\n  util.assert(\n      x4D.rank === 4,\n      () => `Error in fused depthwiseConv2d: input must be rank 4, but got ` +\n          `rank ${x4D.rank}.`);\n  util.assert(\n      $filter.rank === 4,\n      () => `Error in fused depthwiseConv2d: filter must be rank 4, ` +\n          `but got rank ${$filter.rank}.`);\n  util.assert(\n      x4D.shape[3] === $filter.shape[2],\n      () => `Error in fused depthwiseConv2d: number of input channels ` +\n          `(${x4D.shape[3]}) must match the inChannels dimension in ` +\n          `filter ${$filter.shape[2]}.`);\n  if (dilations == null) {\n    dilations = [1, 1];\n  }\n  util.assert(\n      conv_util.eitherStridesOrDilationsAreOne(strides, dilations),\n      () =>\n          'Error in fused depthwiseConv2d: Either strides or dilations must ' +\n          `be 1. Got strides ${strides} and dilations '${dilations}'`);\n  conv_util.checkPadOnDimRoundingMode(\n      'fused depthwiseConv2d', pad, dimRoundingMode);\n  const convInfo = conv_util.computeConv2DInfo(\n      x4D.shape, $filter.shape, strides, dilations, pad, dimRoundingMode,\n      true /* depthwise */);\n\n  let $bias: Tensor;\n  if (bias != null) {\n    $bias = convertToTensor(bias, 'bias', 'fused conv2d');\n    [$bias] = makeTypesMatch($bias, $x);\n\n    broadcast_util.assertAndGetBroadcastShape(convInfo.outShape, $bias.shape);\n  }\n\n  let $preluActivationWeights: Tensor;\n  if (preluActivationWeights != null) {\n    $preluActivationWeights = convertToTensor(\n        preluActivationWeights, 'prelu weights', 'fused depthwiseConv2d');\n  }\n\n  const grad = (dy: Tensor4D, saved: Tensor[]) => {\n    util.assert(\n        conv_util.tupleValuesAreOne(dilations),\n        () => 'Error in gradient of fused depthwiseConv2d: dilation rates ' +\n            `greater than 1 are not yet supported. Got dilations ` +\n            `'${dilations}'`);\n    const [$filter, x4D, y, bias] = saved;\n\n    const dyActivation = getFusedDyActivation(dy, y, activation) as Tensor4D;\n\n    const xDer = depthwiseConv2dNativeBackpropInput(\n        (x4D as Tensor4D).shape, dyActivation, $filter as Tensor4D, strides,\n        pad, dilations, dimRoundingMode);\n    const filterDer = depthwiseConv2dNativeBackpropFilter(\n        x4D as Tensor4D, dyActivation, ($filter as Tensor4D).shape, strides,\n        pad, dilations, dimRoundingMode);\n\n    if (bias != null) {\n      const biasDer = getFusedBiasGradient($bias, dyActivation);\n      return [xDer, filterDer, biasDer];\n    }\n    return [xDer, filterDer];\n  };\n\n  const inputs: FusedDepthwiseConv2DInputs = {\n    x: x4D,\n    filter: $filter,\n    bias: $bias,\n    preluActivationWeights: $preluActivationWeights\n  };\n  const attrs: FusedDepthwiseConv2DAttrs = {\n    strides,\n    pad,\n    dataFormat,\n    dilations,\n    dimRoundingMode,\n    activation,\n    leakyreluAlpha\n  };\n\n  // Depending on the the params passed in we will have different number of\n  // inputs and thus a a different number of elements in the gradient.\n  if (bias == null) {\n    const customOp =\n        customGrad((x4D: Tensor4D, filter: Tensor4D, save: GradSaveFunc) => {\n          // tslint:disable-next-line: no-unnecessary-type-assertion\n          let res: Tensor4D|Tensor3D = ENGINE.runKernel(\n              FusedDepthwiseConv2D, inputs as unknown as NamedTensorMap,\n              attrs as unknown as NamedAttrMap);\n\n          save([filter, x4D, res]);\n\n          if (reshapedTo4D) {\n            // tslint:disable-next-line: no-unnecessary-type-assertion\n            res = reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as\n                Tensor3D;\n          }\n\n          return {value: res, gradFunc: grad};\n        });\n    return customOp(x4D, $filter) as T;\n  } else {\n    const customOpWithBias = customGrad(\n        (x4D: Tensor4D, filter: Tensor4D, bias: Tensor, save: GradSaveFunc) => {\n          // tslint:disable-next-line: no-unnecessary-type-assertion\n          let res: Tensor4D|Tensor3D = ENGINE.runKernel(\n              FusedDepthwiseConv2D, inputs as unknown as NamedTensorMap,\n              attrs as unknown as NamedAttrMap);\n\n          save([filter, x4D, res, bias]);\n\n          if (reshapedTo4D) {\n            // tslint:disable-next-line: no-unnecessary-type-assertion\n            res = reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as\n                Tensor3D;\n          }\n\n          return {value: res, gradFunc: grad};\n        });\n\n    return customOpWithBias(x4D, $filter, $bias) as T;\n  }\n}\nexport const depthwiseConv2d = /* @__PURE__ */ op({fusedDepthwiseConv2d_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {customGrad} from '../../gradients';\nimport {_FusedMatMul, _FusedMatMulAttrs, _FusedMatMulInputs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor, Tensor3D} from '../../tensor';\nimport {GradSaveFunc, NamedTensorMap} from '../../tensor_types';\nimport {makeTypesMatch} from '../../tensor_util';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\n\nimport {add} from '../add';\nimport * as broadcast_util from '../broadcast_util';\nimport {Activation} from '../fused_types';\nimport {applyActivation, getFusedBiasGradient, getFusedDyActivation, shouldFuse} from '../fused_util';\nimport {matMul as unfusedMatMul} from '../mat_mul';\nimport {op} from '../operation';\nimport {reshape} from '../reshape';\n\n/**\n * Computes the dot product of two matrices with optional activation and bias.\n *\n * ```js\n * const a = tf.tensor2d([-1, -2], [1, 2]);\n * const b = tf.tensor2d([1, 2, 3, 4], [2, 2]);\n * const bias = tf.tensor2d([1, 2], [1, 2]);\n *\n * tf.fused.matMul({a, b, bias, activation: 'relu'}).print();\n * ```\n *\n * @param obj An object with the following properties:\n * - `a` First matrix in dot product operation.\n * - `b` Second matrix in dot product operation.\n * - `transposeA` If true, `a` is transposed before multiplication.\n * - `transposeB` If true, `b` is transposed before multiplication.\n * - `bias` Matrix to be added to the result.\n * - `activation` Name of activation kernel (defaults to `linear`).\n * - `preluActivationWeights` Tensor of prelu weights.\n * - `leakyreluAlpha` Alpha of leakyrelu.\n */\nfunction fusedMatMul_({\n  a,\n  b,\n  transposeA = false,\n  transposeB = false,\n  bias,\n  activation = 'linear',\n  preluActivationWeights,\n  leakyreluAlpha = 0.2,\n}: {\n  a: Tensor|TensorLike,\n  b: Tensor|TensorLike,\n  transposeA?: boolean,\n  transposeB?: boolean,\n  bias?: Tensor|TensorLike,\n  activation?: Activation,\n  preluActivationWeights?: Tensor\n  leakyreluAlpha?: number\n}): Tensor {\n    if (shouldFuse(ENGINE.state.gradientDepth, activation) === false) {\n      let result = unfusedMatMul(a, b, transposeA, transposeB);\n      if (bias != null) {\n        result = add(result, bias);\n      }\n\n      return applyActivation(\n                 result, activation, preluActivationWeights, leakyreluAlpha);\n    }\n\n    let $a = convertToTensor(a, 'a', 'fused matMul');\n    let $b = convertToTensor(b, 'b', 'fused matMul');\n    [$a, $b] = makeTypesMatch($a, $b);\n\n    const innerShapeA =\n        transposeA ? $a.shape[$a.rank - 2] : $a.shape[$a.rank - 1];\n    const innerShapeB =\n        transposeB ? $b.shape[$b.rank - 1] : $b.shape[$b.rank - 2];\n\n    const outerShapeA =\n        transposeA ? $a.shape[$a.rank - 1] : $a.shape[$a.rank - 2];\n    const outerShapeB =\n        transposeB ? $b.shape[$b.rank - 2] : $b.shape[$b.rank - 1];\n\n    const outerDimsA = $a.shape.slice(0, -2);\n    const outerDimsB = $b.shape.slice(0, -2);\n    const batchDimA = util.sizeFromShape(outerDimsA);\n    const batchDimB = util.sizeFromShape(outerDimsB);\n\n    util.assert(\n        innerShapeA === innerShapeB,\n        () => `Error in fused matMul: inner shapes (${innerShapeA}) and (` +\n            `${innerShapeB}) of Tensors with shapes ${$a.shape} and ` +\n            `${$b.shape} and transposeA=${transposeA}` +\n            ` and transposeB=${transposeB} must match.`);\n\n    const outShapeOuterDims = broadcast_util.assertAndGetBroadcastShape(\n        $a.shape.slice(0, -2), $b.shape.slice(0, -2));\n    const outShape = outShapeOuterDims.concat([outerShapeA, outerShapeB]);\n\n    const a3D: Tensor3D = transposeA ?\n        reshape($a, [batchDimA, innerShapeA, outerShapeA]) :\n        reshape($a, [batchDimA, outerShapeA, innerShapeA]);\n    const b3D: Tensor3D = transposeB ?\n        reshape($b, [batchDimB, outerShapeB, innerShapeB]) :\n        reshape($b, [batchDimB, innerShapeB, outerShapeB]);\n\n    let $bias: Tensor;\n    if (bias != null) {\n      $bias = convertToTensor(bias, 'bias', 'fused matMul');\n      [$bias] = makeTypesMatch($bias, $a);\n\n      broadcast_util.assertAndGetBroadcastShape(outShape, $bias.shape);\n    }\n\n    let $preluActivationWeights: Tensor;\n    if (preluActivationWeights != null) {\n      $preluActivationWeights = convertToTensor(\n          preluActivationWeights, 'prelu weights', 'fused matMul');\n    }\n\n    const grad = (dy: Tensor3D, saved: Tensor[]) => {\n      const [a3D, b3D, y, $bias] = saved;\n      // we reshape dy because the result of the forward is not\n      // necessarily going to be a 3d tensor due to a reshape done at the end of\n      // the customOp.\n      const dyActivation =\n          getFusedDyActivation(reshape(dy, y.shape), y, activation);\n      let aDer: Tensor;\n      let bDer: Tensor;\n\n      if (!transposeA && !transposeB) {\n        aDer = unfusedMatMul(dyActivation, b3D, false, true);\n        bDer = unfusedMatMul(a3D, dyActivation, true, false);\n      } else if (!transposeA && transposeB) {\n        aDer = unfusedMatMul(dyActivation, b3D, false, false);\n        bDer = unfusedMatMul(dyActivation, a3D, true, false);\n      } else if (transposeA && !transposeB) {\n        aDer = unfusedMatMul(b3D, dyActivation, false, true);\n        bDer = unfusedMatMul(a3D, dyActivation, false, false);\n      } else {\n        aDer = unfusedMatMul(b3D, dyActivation, true, true);\n        bDer = unfusedMatMul(dyActivation, a3D, true, true);\n      }\n\n      if (bias != null) {\n        const biasDer = getFusedBiasGradient($bias, dyActivation);\n        return [aDer, bDer, biasDer];\n      } else {\n        return [aDer, bDer];\n      }\n    };\n\n    const inputs: _FusedMatMulInputs = {\n      a: a3D,\n      b: b3D,\n      bias: $bias,\n      preluActivationWeights: $preluActivationWeights\n    };\n    const attrs: _FusedMatMulAttrs =\n        {transposeA, transposeB, activation, leakyreluAlpha};\n\n    // Depending on the the params passed in we will have different number of\n    // inputs and thus a a different number of elements in the gradient.\n    if (bias == null) {\n      const customOp =\n          customGrad((a3D: Tensor3D, b3D: Tensor3D, save: GradSaveFunc) => {\n            const res =\n                // tslint:disable-next-line: no-unnecessary-type-assertion\n                ENGINE.runKernel(\n                    _FusedMatMul, inputs as unknown as NamedTensorMap,\n                    attrs as unknown as NamedAttrMap) as Tensor;\n\n            save([a3D, b3D, res]);\n\n            return {value: reshape(res, outShape), gradFunc: grad};\n          });\n      return customOp(a3D, b3D);\n    } else {\n      const customOpWithBias = customGrad(\n          (a3D: Tensor3D, b3D: Tensor3D, $bias: Tensor, save: GradSaveFunc) => {\n            const res =\n                // tslint:disable-next-line: no-unnecessary-type-assertion\n                ENGINE.runKernel(\n                    _FusedMatMul, inputs as unknown as NamedTensorMap,\n                    attrs as unknown as NamedAttrMap) as Tensor;\n\n            save([a3D, b3D, res, $bias]);\n\n            return {value: reshape(res, outShape), gradFunc: grad};\n          });\n\n      return customOpWithBias(a3D, b3D, $bias);\n    }\n  }\n\n  export const matMul = /* @__PURE__ */ op({fusedMatMul_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {conv2d} from './fused/conv2d';\nimport {depthwiseConv2d} from './fused/depthwise_conv2d';\nimport {matMul} from './fused/mat_mul';\nimport {Activation} from './fused_types';\n\nexport {Activation, conv2d, depthwiseConv2d, matMul};\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor1D} from '../../tensor';\nimport {op} from '../operation';\nimport {cosineWindow} from '../signal_ops_util';\n\n/**\n * Generate a hamming window.\n *\n * See: https://en.wikipedia.org/wiki/Window_function#Hann_and_Hamming_windows\n *\n * ```js\n * tf.signal.hammingWindow(10).print();\n * ```\n * @param The length of window\n *\n * @doc {heading: 'Operations', subheading: 'Signal', namespace: 'signal'}\n */\nfunction hammingWindow_(windowLength: number): Tensor1D {\n  return cosineWindow(windowLength, 0.54, 0.46);\n}\nexport const hammingWindow = /* @__PURE__ */ op({hammingWindow_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor1D} from '../../tensor';\nimport {op} from '../operation';\nimport {cosineWindow} from '../signal_ops_util';\n\n/**\n * Generate a Hann window.\n *\n * See: https://en.wikipedia.org/wiki/Window_function#Hann_and_Hamming_windows\n *\n * ```js\n * tf.signal.hannWindow(10).print();\n * ```\n * @param The length of window\n *\n * @doc {heading: 'Operations', subheading: 'Signal', namespace: 'signal'}\n */\nfunction hannWindow_(windowLength: number): Tensor1D {\n  return cosineWindow(windowLength, 0.5, 0.5);\n}\n\nexport const hannWindow = /* @__PURE__ */ op({hannWindow_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor, Tensor1D} from '../../tensor';\nimport {concat} from '../concat';\nimport {fill} from '../fill';\nimport {op} from '../operation';\nimport {reshape} from '../reshape';\nimport {slice} from '../slice';\nimport {tensor2d} from '../tensor2d';\n\n/**\n * Expands input into frames of frameLength.\n * Slides a window size with frameStep.\n *\n * ```js\n * tf.signal.frame([1, 2, 3], 2, 1).print();\n * ```\n * @param signal The input tensor to be expanded\n * @param frameLength Length of each frame\n * @param frameStep The frame hop size in samples.\n * @param padEnd Whether to pad the end of signal with padValue.\n * @param padValue A number to use where the input signal does\n *     not exist when padEnd is True.\n *\n * @doc {heading: 'Operations', subheading: 'Signal', namespace: 'signal'}\n */\nfunction frame_(\n    signal: Tensor1D, frameLength: number, frameStep: number, padEnd = false,\n    padValue = 0): Tensor {\n  let start = 0;\n  const output: Tensor[] = [];\n  while (start + frameLength <= signal.size) {\n    output.push(slice(signal, start, frameLength));\n    start += frameStep;\n  }\n\n  if (padEnd) {\n    while (start < signal.size) {\n      const padLen = (start + frameLength) - signal.size;\n      const pad = concat([\n        slice(signal, start, frameLength - padLen), fill([padLen], padValue)\n      ]);\n      output.push(pad);\n      start += frameStep;\n    }\n  }\n\n  if (output.length === 0) {\n    return tensor2d([], [0, frameLength]);\n  }\n\n  return reshape(concat(output), [output.length, frameLength]);\n}\nexport const frame = /* @__PURE__ */ op({frame_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor, Tensor1D} from '../../tensor';\nimport {mul} from '../mul';\nimport {op} from '../operation';\nimport {enclosingPowerOfTwo} from '../signal_ops_util';\nimport {rfft} from '../spectral/rfft';\n\nimport {frame} from './frame';\nimport {hannWindow} from './hann_window';\n\n/**\n * Computes the Short-time Fourier Transform of signals\n * See: https://en.wikipedia.org/wiki/Short-time_Fourier_transform\n *\n * ```js\n * const input = tf.tensor1d([1, 1, 1, 1, 1])\n * tf.signal.stft(input, 3, 1).print();\n * ```\n * @param signal 1-dimensional real value tensor.\n * @param frameLength The window length of samples.\n * @param frameStep The number of samples to step.\n * @param fftLength The size of the FFT to apply.\n * @param windowFn A callable that takes a window length and returns 1-d tensor.\n *\n * @doc {heading: 'Operations', subheading: 'Signal', namespace: 'signal'}\n */\nfunction stft_(\n    signal: Tensor1D, frameLength: number, frameStep: number,\n    fftLength?: number,\n    windowFn: (length: number) => Tensor1D = hannWindow): Tensor {\n  if (fftLength == null) {\n    fftLength = enclosingPowerOfTwo(frameLength);\n  }\n  const framedSignal = frame(signal, frameLength, frameStep);\n  const windowedSignal = mul(framedSignal, windowFn(frameLength));\n  return rfft(windowedSignal, fftLength);\n}\nexport const stft = /* @__PURE__ */ op({stft_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {CropAndResize, CropAndResizeAttrs, CropAndResizeInputs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor1D, Tensor2D, Tensor4D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\n\nimport {op} from '../operation';\n\n/**\n * Extracts crops from the input image tensor and resizes them using bilinear\n * sampling or nearest neighbor sampling (possibly with aspect ratio change)\n * to a common output size specified by cropSize.\n *\n * @param image 4d tensor of shape `[batch,imageHeight,imageWidth, depth]`,\n *     where imageHeight and imageWidth must be positive, specifying the\n *     batch of images from which to take crops\n * @param boxes 2d float32 tensor of shape `[numBoxes, 4]`. Each entry is\n *     `[y1, x1, y2, x2]`, where `(y1, x1)` and `(y2, x2)` are the normalized\n *     coordinates of the box in the `boxInd[i]`th image in the batch\n * @param boxInd 1d int32 tensor of shape `[numBoxes]` with values in range\n *     `[0, batch)` that specifies the image that the `i`-th box refers to.\n * @param cropSize 1d int32 tensor of 2 elements `[cropHeigh, cropWidth]`\n *     specifying the size to which all crops are resized to.\n * @param method Optional string from `'bilinear' | 'nearest'`,\n *     defaults to bilinear, which specifies the sampling method for resizing\n * @param extrapolationValue A threshold for deciding when to remove boxes based\n *     on score. Defaults to 0.\n * @return A 4D tensor of the shape `[numBoxes,cropHeight,cropWidth,depth]`\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nfunction cropAndResize_(\n    image: Tensor4D|TensorLike,\n    boxes: Tensor2D|TensorLike,\n    boxInd: Tensor1D|TensorLike,\n    cropSize: [number, number],\n    method: 'bilinear'|'nearest' = 'bilinear',\n    extrapolationValue = 0,\n    ): Tensor4D {\n  const $image = convertToTensor(image, 'image', 'cropAndResize');\n  const $boxes = convertToTensor(boxes, 'boxes', 'cropAndResize', 'float32');\n  const $boxInd = convertToTensor(boxInd, 'boxInd', 'cropAndResize', 'int32');\n\n  const numBoxes = $boxes.shape[0];\n\n  util.assert(\n      $image.rank === 4,\n      () => 'Error in cropAndResize: image must be rank 4,' +\n          `but got rank ${$image.rank}.`);\n  util.assert(\n      $boxes.rank === 2 && $boxes.shape[1] === 4,\n      () => `Error in cropAndResize: boxes must be have size [${numBoxes},4] ` +\n          `but had shape ${$boxes.shape}.`);\n  util.assert(\n      $boxInd.rank === 1 && $boxInd.shape[0] === numBoxes,\n      () => `Error in cropAndResize: boxInd must be have size [${numBoxes}] ` +\n          `but had shape ${$boxes.shape}.`);\n  util.assert(\n      cropSize.length === 2,\n      () => `Error in cropAndResize: cropSize must be of length 2, but got ` +\n          `length ${cropSize.length}.`);\n  util.assert(\n      cropSize[0] >= 1 && cropSize[1] >= 1,\n      () => `cropSize must be atleast [1,1], but was ${cropSize}`);\n  util.assert(\n      method === 'bilinear' || method === 'nearest',\n      () => `method must be bilinear or nearest, but was ${method}`);\n\n  const inputs:\n      CropAndResizeInputs = {image: $image, boxes: $boxes, boxInd: $boxInd};\n  const attrs: CropAndResizeAttrs = {method, extrapolationValue, cropSize};\n  const res = ENGINE.runKernel(\n      CropAndResize, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n  return res as Tensor4D;\n}\n\nexport const cropAndResize = /* @__PURE__ */ op({cropAndResize_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {FlipLeftRight, FlipLeftRightInputs} from '../../kernel_names';\nimport {Tensor4D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\nimport {op} from '../operation';\n\n/**\n * Flips the image left to right. Currently available in the CPU, WebGL, and\n * WASM backends.\n *\n * @param image 4d tensor of shape `[batch, imageHeight, imageWidth, depth]`.\n */\n/** @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'} */\nfunction flipLeftRight_(image: Tensor4D|TensorLike): Tensor4D {\n  const $image = convertToTensor(image, 'image', 'flipLeftRight', 'float32');\n\n  util.assert(\n      $image.rank === 4,\n      () => 'Error in flipLeftRight: image must be rank 4,' +\n          `but got rank ${$image.rank}.`);\n\n  const inputs: FlipLeftRightInputs = {image: $image};\n  const res =\n      ENGINE.runKernel(FlipLeftRight, inputs as unknown as NamedTensorMap, {});\n  return res as Tensor4D;\n}\n\nexport const flipLeftRight = /* @__PURE__ */ op({flipLeftRight_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor2D, Tensor3D, Tensor4D, Tensor5D, Tensor6D} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\n\nimport {op} from '../operation';\nimport {tile} from '../tile';\n\n/**\n * Converts images from grayscale to RGB format.\n *\n * @param image A grayscale tensor to convert. The `image`'s last dimension must\n *     be size 1 with at least a two-dimensional shape.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nfunction grayscaleToRGB_<T extends Tensor2D|Tensor3D|Tensor4D|Tensor5D|\n                         Tensor6D>(image: T|TensorLike): T {\n  const $image = convertToTensor(image, 'image', 'grayscaleToRGB');\n\n  const lastDimsIdx = $image.rank - 1;\n  const lastDims = $image.shape[lastDimsIdx];\n\n  util.assert(\n      $image.rank >= 2,\n      () => 'Error in grayscaleToRGB: images must be at least rank 2, ' +\n          `but got rank ${$image.rank}.`);\n\n  util.assert(\n      lastDims === 1,\n      () => 'Error in grayscaleToRGB: last dimension of a grayscale image ' +\n          `should be size 1, but got size ${lastDims}.`);\n\n  const reps = new Array($image.rank);\n\n  reps.fill(1, 0, lastDimsIdx);\n  reps[lastDimsIdx] = 3;\n\n  return tile($image, reps);\n}\n\nexport const grayscaleToRGB = /* @__PURE__ */ op({grayscaleToRGB_});\n", "/**\n * @license\n * Copyright 2023 Google LLC.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor2D, Tensor3D, Tensor4D, Tensor5D, Tensor6D} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\nimport {cast} from '../cast';\nimport {einsum} from '../einsum';\nimport {expandDims} from '../expand_dims';\nimport {op} from '../operation';\nimport {tensor1d} from '../tensor1d';\n\n/**\n * Converts images from RGB format to grayscale.\n *\n * @param image A RGB tensor to convert. The `image`'s last dimension must\n *     be size 3 with at least a two-dimensional shape.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nfunction rgbToGrayscale_<T extends Tensor2D|Tensor3D|Tensor4D|Tensor5D|\n                         Tensor6D>(image: T|TensorLike): T {\n  const $image = convertToTensor(image, 'image', 'RGBToGrayscale');\n\n  const lastDimsIdx = $image.rank - 1;\n  const lastDims = $image.shape[lastDimsIdx];\n\n  util.assert(\n      $image.rank >= 2,\n      () => 'Error in RGBToGrayscale: images must be at least rank 2, ' +\n          `but got rank ${$image.rank}.`);\n\n  util.assert(\n      lastDims === 3,\n      () => 'Error in RGBToGrayscale: last dimension of an RGB image ' +\n          `should be size 3, but got size ${lastDims}.`);\n\n  // Remember original dtype so we can convert back if needed\n  const origDtype = $image.dtype;\n  const fltImage = cast($image, 'float32');\n\n  const rgbWeights = tensor1d([0.2989, 0.5870, 0.1140]);\n\n  let grayFloat;\n  switch ($image.rank) {\n    case 2:\n      grayFloat = einsum('ij,j->i', fltImage, rgbWeights);\n      break;\n    case 3:\n      grayFloat = einsum('ijk,k->ij', fltImage, rgbWeights);\n      break;\n    case 4:\n      grayFloat = einsum('ijkl,l->ijk', fltImage, rgbWeights);\n      break;\n    case 5:\n      grayFloat = einsum('ijklm,m->ijkl', fltImage, rgbWeights);\n      break;\n    case 6:\n      grayFloat = einsum('ijklmn,n->ijklm', fltImage, rgbWeights);\n      break;\n    default:\n      throw new Error('Not a valid tensor rank.');\n  }\n  grayFloat = expandDims(grayFloat, -1);\n\n  return cast(grayFloat, origDtype) as T;\n}\n\nexport const rgbToGrayscale = /* @__PURE__ */ op({rgbToGrayscale_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {RotateWithOffset, RotateWithOffsetAttrs, RotateWithOffsetInputs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor4D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\n\nimport {op} from '../operation';\n\n/**\n * Rotates the input image tensor counter-clockwise with an optional offset\n * center of rotation. Currently available in the CPU, WebGL, and WASM backends.\n *\n * @param image 4d tensor of shape `[batch, imageHeight, imageWidth, depth]`.\n * @param radians The amount of rotation.\n * @param fillValue The value to fill in the empty space leftover\n *     after rotation. Can be either a single grayscale value (0-255), or an\n *     array of three numbers `[red, green, blue]` specifying the red, green,\n *     and blue channels. Defaults to `0` (black).\n * @param center The center of rotation. Can be either a single value (0-1), or\n *     an array of two numbers `[centerX, centerY]`. Defaults to `0.5` (rotates\n *     the image around its center).\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nfunction rotateWithOffset_(\n    image: Tensor4D|TensorLike, radians: number,\n    fillValue: number|[number, number, number] = 0,\n    center: number|[number, number] = 0.5): Tensor4D {\n  const $image = convertToTensor(image, 'image', 'rotateWithOffset', 'float32');\n\n  util.assert(\n      $image.rank === 4,\n      () => 'Error in rotateWithOffset: image must be rank 4,' +\n          `but got rank ${$image.rank}.`);\n\n  const inputs: RotateWithOffsetInputs = {image: $image};\n  const attrs: RotateWithOffsetAttrs = {radians, fillValue, center};\n  const res = ENGINE.runKernel(\n      RotateWithOffset, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n  return res as Tensor4D;\n}\n\nexport const rotateWithOffset = /* @__PURE__ */ op({rotateWithOffset_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor1D, Tensor2D} from '../tensor';\nimport * as util from '../util';\n\nfunction nonMaxSuppSanityCheck(\n    boxes: Tensor2D, scores: Tensor1D, maxOutputSize: number,\n    iouThreshold: number, scoreThreshold: number, softNmsSigma?: number): {\n  maxOutputSize: number,\n  iouThreshold: number,\n  scoreThreshold: number,\n  softNmsSigma: number\n} {\n  if (iouThreshold == null) {\n    iouThreshold = 0.5;\n  }\n  if (scoreThreshold == null) {\n    scoreThreshold = Number.NEGATIVE_INFINITY;\n  }\n  if (softNmsSigma == null) {\n    softNmsSigma = 0.0;\n  }\n\n  const numBoxes = boxes.shape[0];\n  maxOutputSize = Math.min(maxOutputSize, numBoxes);\n\n  util.assert(\n      0 <= iouThreshold && iouThreshold <= 1,\n      () => `iouThreshold must be in [0, 1], but was '${iouThreshold}'`);\n  util.assert(\n      boxes.rank === 2,\n      () => `boxes must be a 2D tensor, but was of rank '${boxes.rank}'`);\n  util.assert(\n      boxes.shape[1] === 4,\n      () =>\n          `boxes must have 4 columns, but 2nd dimension was ${boxes.shape[1]}`);\n  util.assert(scores.rank === 1, () => 'scores must be a 1D tensor');\n  util.assert(\n      scores.shape[0] === numBoxes,\n      () => `scores has incompatible shape with boxes. Expected ${numBoxes}, ` +\n          `but was ${scores.shape[0]}`);\n  util.assert(\n      0 <= softNmsSigma && softNmsSigma <= 1,\n      () => `softNmsSigma must be in [0, 1], but was '${softNmsSigma}'`);\n  return {maxOutputSize, iouThreshold, scoreThreshold, softNmsSigma};\n}\n\nexport {nonMaxSuppSanityCheck};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {NonMaxSuppressionV3} from '../../kernel_names';\nimport {Tensor1D, Tensor2D} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {nonMaxSuppSanityCheck} from '../nonmax_util';\nimport {op} from '../operation';\n\n/**\n * Performs non maximum suppression of bounding boxes based on\n * iou (intersection over union).\n *\n * @param boxes a 2d tensor of shape `[numBoxes, 4]`. Each entry is\n *     `[y1, x1, y2, x2]`, where `(y1, x1)` and `(y2, x2)` are the corners of\n *     the bounding box.\n * @param scores a 1d tensor providing the box scores of shape `[numBoxes]`.\n * @param maxOutputSize The maximum number of boxes to be selected.\n * @param iouThreshold A float representing the threshold for deciding whether\n *     boxes overlap too much with respect to IOU. Must be between [0, 1].\n *     Defaults to 0.5 (50% box overlap).\n * @param scoreThreshold A threshold for deciding when to remove boxes based\n *     on score. Defaults to -inf, which means any score is accepted.\n * @return A 1D tensor with the selected box indices.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nfunction nonMaxSuppression_(\n    boxes: Tensor2D|TensorLike, scores: Tensor1D|TensorLike,\n    maxOutputSize: number, iouThreshold = 0.5,\n    scoreThreshold = Number.NEGATIVE_INFINITY): Tensor1D {\n  const $boxes =\n      convertToTensor(boxes, 'boxes', 'nonMaxSuppression', 'float32');\n  const $scores =\n      convertToTensor(scores, 'scores', 'nonMaxSuppression', 'float32');\n\n  const inputs = nonMaxSuppSanityCheck(\n      $boxes, $scores, maxOutputSize, iouThreshold, scoreThreshold);\n  maxOutputSize = inputs.maxOutputSize;\n  iouThreshold = inputs.iouThreshold;\n  scoreThreshold = inputs.scoreThreshold;\n\n  const attrs = {maxOutputSize, iouThreshold, scoreThreshold};\n  return ENGINE.runKernel(\n      NonMaxSuppressionV3, {boxes: $boxes, scores: $scores}, attrs);\n}\n\nexport const nonMaxSuppression = /* @__PURE__ */ op({nonMaxSuppression_});\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/**\n * Inserts a value into a sorted array. This method allows duplicate, meaning it\n * allows inserting duplicate value, in which case, the element will be inserted\n * at the lowest index of the value.\n * @param arr The array to modify.\n * @param element The element to insert.\n * @param comparator Optional. If no comparator is specified, elements are\n * compared using array_util.defaultComparator, which is suitable for Strings\n * and Numbers in ascending arrays. If the array contains multiple instances of\n * the target value, the left-most instance will be returned. To provide a\n * comparator, it should take 2 arguments to compare and return a negative,\n * zero, or a positive number.\n */\nexport function binaryInsert<T>(\n    arr: T[], element: T, comparator?: (a: T, b: T) => number) {\n  const index = binarySearch(arr, element, comparator);\n  const insertionPoint = index < 0 ? -(index + 1) : index;\n  arr.splice(insertionPoint, 0, element);\n}\n\n/**\n * Searches the array for the target using binary search, returns the index\n * of the found element, or position to insert if element not found. If no\n * comparator is specified, elements are compared using array_\n * util.defaultComparator, which is suitable for Strings and Numbers in\n * ascending arrays. If the array contains multiple instances of the target\n * value, the left-most instance will be returned.\n * @param arr The array to be searched in.\n * @param target The target to be searched for.\n * @param comparator Should take 2 arguments to compare and return a negative,\n *    zero, or a positive number.\n * @return Lowest index of the target value if found, otherwise the insertion\n *    point where the target should be inserted, in the form of\n *    (-insertionPoint - 1).\n */\nexport function binarySearch<T>(\n    arr: T[], target: T, comparator?: (a: T, b: T) => number) {\n  return binarySearch_(arr, target, comparator || defaultComparator);\n}\n\n/**\n * Compares its two arguments for order.\n * @param a The first element to be compared.\n * @param b The second element to be compared.\n * @return A negative number, zero, or a positive number as the first\n *     argument is less than, equal to, or greater than the second.\n */\nfunction defaultComparator<T>(a: T, b: T): number {\n  return a > b ? 1 : a < b ? -1 : 0;\n}\n\nfunction binarySearch_<T>(\n    arr: T[], target: T, comparator: (a: T, b: T) => number) {\n  let left = 0;\n  let right = arr.length;\n  let middle = 0;\n  let found = false;\n  while (left < right) {\n    middle = left + ((right - left) >>> 1);\n    const compareResult = comparator(target, arr[middle]);\n    if (compareResult > 0) {\n      left = middle + 1;\n    } else {\n      right = middle;\n      // If compareResult is 0, the value is found. We record it is found,\n      // and then keep looking because there may be duplicate.\n      found = !compareResult;\n    }\n  }\n\n  return found ? left : -left - 1;\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {TypedArray} from '../types';\nimport {binaryInsert} from './non_max_suppression_util';\n\n/**\n * Implementation of the NonMaxSuppression kernel shared between webgl and cpu.\n */\ninterface Candidate {\n  score: number;\n  boxIndex: number;\n  suppressBeginIndex: number;\n}\n\ninterface NonMaxSuppressionResult {\n  selectedIndices: number[];\n  selectedScores?: number[];\n  validOutputs?: number;\n}\n\nexport function nonMaxSuppressionV3Impl(\n    boxes: TypedArray, scores: TypedArray, maxOutputSize: number,\n    iouThreshold: number, scoreThreshold: number): NonMaxSuppressionResult {\n  return nonMaxSuppressionImpl_(\n      boxes, scores, maxOutputSize, iouThreshold, scoreThreshold,\n      0 /* softNmsSigma */);\n}\n\nexport function nonMaxSuppressionV4Impl(\n    boxes: TypedArray, scores: TypedArray, maxOutputSize: number,\n    iouThreshold: number, scoreThreshold: number,\n    padToMaxOutputSize: boolean): NonMaxSuppressionResult {\n  return nonMaxSuppressionImpl_(\n      boxes, scores, maxOutputSize, iouThreshold, scoreThreshold,\n      0 /* softNmsSigma */, false /* returnScoresTensor */,\n      padToMaxOutputSize /* padToMaxOutputSize */, true\n      /* returnValidOutputs */);\n}\n\nexport function nonMaxSuppressionV5Impl(\n    boxes: TypedArray, scores: TypedArray, maxOutputSize: number,\n    iouThreshold: number, scoreThreshold: number,\n    softNmsSigma: number): NonMaxSuppressionResult {\n  return nonMaxSuppressionImpl_(\n      boxes, scores, maxOutputSize, iouThreshold, scoreThreshold, softNmsSigma,\n      true /* returnScoresTensor */);\n}\n\nfunction nonMaxSuppressionImpl_(\n    boxes: TypedArray, scores: TypedArray, maxOutputSize: number,\n    iouThreshold: number, scoreThreshold: number, softNmsSigma: number,\n    returnScoresTensor = false, padToMaxOutputSize = false,\n    returnValidOutputs = false): NonMaxSuppressionResult {\n  // The list is sorted in ascending order, so that we can always pop the\n  // candidate with the largest score in O(1) time.\n  const candidates = [];\n\n  for (let i = 0; i < scores.length; i++) {\n    if (scores[i] > scoreThreshold) {\n      candidates.push({score: scores[i], boxIndex: i, suppressBeginIndex: 0});\n    }\n  }\n\n  candidates.sort(ascendingComparator);\n\n  // If softNmsSigma is 0, the outcome of this algorithm is exactly same as\n  // before.\n  const scale = softNmsSigma > 0 ? (-0.5 / softNmsSigma) : 0.0;\n\n  const selectedIndices: number[] = [];\n  const selectedScores: number[] = [];\n\n  while (selectedIndices.length < maxOutputSize && candidates.length > 0) {\n    const candidate = candidates.pop();\n    const {score: originalScore, boxIndex, suppressBeginIndex} = candidate;\n\n    if (originalScore < scoreThreshold) {\n      break;\n    }\n\n    // Overlapping boxes are likely to have similar scores, therefore we\n    // iterate through the previously selected boxes backwards in order to\n    // see if candidate's score should be suppressed. We use\n    // suppressBeginIndex to track and ensure a candidate can be suppressed\n    // by a selected box no more than once. Also, if the overlap exceeds\n    // iouThreshold, we simply ignore the candidate.\n    let ignoreCandidate = false;\n    for (let j = selectedIndices.length - 1; j >= suppressBeginIndex; --j) {\n      const iou = intersectionOverUnion(boxes, boxIndex, selectedIndices[j]);\n\n      if (iou >= iouThreshold) {\n        ignoreCandidate = true;\n        break;\n      }\n\n      candidate.score =\n          candidate.score * suppressWeight(iouThreshold, scale, iou);\n\n      if (candidate.score <= scoreThreshold) {\n        break;\n      }\n    }\n\n    // At this point, if `candidate.score` has not dropped below\n    // `scoreThreshold`, then we know that we went through all of the\n    // previous selections and can safely update `suppressBeginIndex` to the\n    // end of the selected array. Then we can re-insert the candidate with\n    // the updated score and suppressBeginIndex back in the candidate list.\n    // If on the other hand, `candidate.score` has dropped below the score\n    // threshold, we will not add it back to the candidates list.\n    candidate.suppressBeginIndex = selectedIndices.length;\n\n    if (!ignoreCandidate) {\n      // Candidate has passed all the tests, and is not suppressed, so\n      // select the candidate.\n      if (candidate.score === originalScore) {\n        selectedIndices.push(boxIndex);\n        selectedScores.push(candidate.score);\n      } else if (candidate.score > scoreThreshold) {\n        // Candidate's score is suppressed but is still high enough to be\n        // considered, so add back to the candidates list.\n        binaryInsert(candidates, candidate, ascendingComparator);\n      }\n    }\n  }\n\n  // NonMaxSuppressionV4 feature: padding output to maxOutputSize.\n  const validOutputs = selectedIndices.length;\n  const elemsToPad = maxOutputSize - validOutputs;\n\n  if (padToMaxOutputSize && elemsToPad > 0) {\n    selectedIndices.push(...new Array(elemsToPad).fill(0));\n    selectedScores.push(...new Array(elemsToPad).fill(0.0));\n  }\n\n  const result: NonMaxSuppressionResult = {selectedIndices};\n\n  if (returnScoresTensor) {\n    result['selectedScores'] = selectedScores;\n  }\n\n  if (returnValidOutputs) {\n    result['validOutputs'] = validOutputs;\n  }\n\n  return result;\n}\n\nfunction intersectionOverUnion(boxes: TypedArray, i: number, j: number) {\n  const iCoord = boxes.subarray(i * 4, i * 4 + 4);\n  const jCoord = boxes.subarray(j * 4, j * 4 + 4);\n  const yminI = Math.min(iCoord[0], iCoord[2]);\n  const xminI = Math.min(iCoord[1], iCoord[3]);\n  const ymaxI = Math.max(iCoord[0], iCoord[2]);\n  const xmaxI = Math.max(iCoord[1], iCoord[3]);\n  const yminJ = Math.min(jCoord[0], jCoord[2]);\n  const xminJ = Math.min(jCoord[1], jCoord[3]);\n  const ymaxJ = Math.max(jCoord[0], jCoord[2]);\n  const xmaxJ = Math.max(jCoord[1], jCoord[3]);\n  const areaI = (ymaxI - yminI) * (xmaxI - xminI);\n  const areaJ = (ymaxJ - yminJ) * (xmaxJ - xminJ);\n  if (areaI <= 0 || areaJ <= 0) {\n    return 0.0;\n  }\n  const intersectionYmin = Math.max(yminI, yminJ);\n  const intersectionXmin = Math.max(xminI, xminJ);\n  const intersectionYmax = Math.min(ymaxI, ymaxJ);\n  const intersectionXmax = Math.min(xmaxI, xmaxJ);\n  const intersectionArea = Math.max(intersectionYmax - intersectionYmin, 0.0) *\n      Math.max(intersectionXmax - intersectionXmin, 0.0);\n  return intersectionArea / (areaI + areaJ - intersectionArea);\n}\n\n// A Gaussian penalty function, this method always returns values in [0, 1].\n// The weight is a function of similarity, the more overlap two boxes are, the\n// smaller the weight is,meaning highly overlapping boxes will be significantly\n// penalized. On the other hand, a non-overlapping box will not be penalized.\nfunction suppressWeight(iouThreshold: number, scale: number, iou: number) {\n  const weight = Math.exp(scale * iou * iou);\n  return iou <= iouThreshold ? weight : 0.0;\n}\n\nfunction ascendingComparator(c1: Candidate, c2: Candidate) {\n  // For objects with same scores, we make the object with the larger index go\n  // first. In an array that pops from the end, this means that the object with\n  // the smaller index will be popped first. This ensures the same output as\n  // the TensorFlow python version.\n  return (c1.score - c2.score) ||\n      ((c1.score === c2.score) && (c2.boxIndex - c1.boxIndex));\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {nonMaxSuppressionV3Impl} from '../../backends/non_max_suppression_impl';\nimport {Tensor1D, Tensor2D} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {nonMaxSuppSanityCheck} from '../nonmax_util';\nimport {tensor1d} from '../tensor1d';\n\n/**\n * Performs non maximum suppression of bounding boxes based on\n * iou (intersection over union).\n *\n * This is the async version of `nonMaxSuppression`\n *\n * @param boxes a 2d tensor of shape `[numBoxes, 4]`. Each entry is\n *     `[y1, x1, y2, x2]`, where `(y1, x1)` and `(y2, x2)` are the corners of\n *     the bounding box.\n * @param scores a 1d tensor providing the box scores of shape `[numBoxes]`.\n * @param maxOutputSize The maximum number of boxes to be selected.\n * @param iouThreshold A float representing the threshold for deciding whether\n *     boxes overlap too much with respect to IOU. Must be between [0, 1].\n *     Defaults to 0.5 (50% box overlap).\n * @param scoreThreshold A threshold for deciding when to remove boxes based\n *     on score. Defaults to -inf, which means any score is accepted.\n * @return A 1D tensor with the selected box indices.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nasync function nonMaxSuppressionAsync_(\n    boxes: Tensor2D|TensorLike, scores: Tensor1D|TensorLike,\n    maxOutputSize: number, iouThreshold = 0.5,\n    scoreThreshold = Number.NEGATIVE_INFINITY): Promise<Tensor1D> {\n  const $boxes = convertToTensor(boxes, 'boxes', 'nonMaxSuppressionAsync');\n  const $scores = convertToTensor(scores, 'scores', 'nonMaxSuppressionAsync');\n\n  const inputs = nonMaxSuppSanityCheck(\n      $boxes, $scores, maxOutputSize, iouThreshold, scoreThreshold);\n  maxOutputSize = inputs.maxOutputSize;\n  iouThreshold = inputs.iouThreshold;\n  scoreThreshold = inputs.scoreThreshold;\n\n  const boxesAndScores = await Promise.all([$boxes.data(), $scores.data()]);\n  const boxesVals = boxesAndScores[0];\n  const scoresVals = boxesAndScores[1];\n\n  // We call a cpu based impl directly with the typedarray data  here rather\n  // than a kernel because all kernels are synchronous (and thus cannot await\n  // .data()).\n  const {selectedIndices} = nonMaxSuppressionV3Impl(\n      boxesVals, scoresVals, maxOutputSize, iouThreshold, scoreThreshold);\n  if ($boxes !== boxes) {\n    $boxes.dispose();\n  }\n  if ($scores !== scores) {\n    $scores.dispose();\n  }\n\n  return tensor1d(selectedIndices, 'int32');\n}\n\nexport const nonMaxSuppressionAsync = nonMaxSuppressionAsync_;\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {NonMaxSuppressionV5, NonMaxSuppressionV5Attrs, NonMaxSuppressionV5Inputs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor, Tensor1D, Tensor2D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\n\nimport {nonMaxSuppSanityCheck} from '../nonmax_util';\nimport {op} from '../operation';\n\n/**\n * Performs non maximum suppression of bounding boxes based on\n * iou (intersection over union).\n *\n * This op also supports a Soft-NMS mode (cf.\n * Bodla et al, https://arxiv.org/abs/1704.04503) where boxes reduce the score\n * of other overlapping boxes, therefore favoring different regions of the image\n * with high scores. To enable this Soft-NMS mode, set the `softNmsSigma`\n * parameter to be larger than 0.\n *\n * @param boxes a 2d tensor of shape `[numBoxes, 4]`. Each entry is\n *     `[y1, x1, y2, x2]`, where `(y1, x1)` and `(y2, x2)` are the corners of\n *     the bounding box.\n * @param scores a 1d tensor providing the box scores of shape `[numBoxes]`.\n * @param maxOutputSize The maximum number of boxes to be selected.\n * @param iouThreshold A float representing the threshold for deciding whether\n *     boxes overlap too much with respect to IOU. Must be between [0, 1].\n *     Defaults to 0.5 (50% box overlap).\n * @param scoreThreshold A threshold for deciding when to remove boxes based\n *     on score. Defaults to -inf, which means any score is accepted.\n * @param softNmsSigma A float representing the sigma parameter for Soft NMS.\n *     When sigma is 0, it falls back to nonMaxSuppression.\n * @return A map with the following properties:\n *     - selectedIndices: A 1D tensor with the selected box indices.\n *     - selectedScores: A 1D tensor with the corresponding scores for each\n *       selected box.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nfunction nonMaxSuppressionWithScore_(\n    boxes: Tensor2D|TensorLike, scores: Tensor1D|TensorLike,\n    maxOutputSize: number, iouThreshold = 0.5,\n    scoreThreshold = Number.NEGATIVE_INFINITY,\n    softNmsSigma = 0.0): NamedTensorMap {\n  const $boxes = convertToTensor(boxes, 'boxes', 'nonMaxSuppression');\n  const $scores = convertToTensor(scores, 'scores', 'nonMaxSuppression');\n\n  const params = nonMaxSuppSanityCheck(\n      $boxes, $scores, maxOutputSize, iouThreshold, scoreThreshold,\n      softNmsSigma);\n  maxOutputSize = params.maxOutputSize;\n  iouThreshold = params.iouThreshold;\n  scoreThreshold = params.scoreThreshold;\n  softNmsSigma = params.softNmsSigma;\n\n  const inputs: NonMaxSuppressionV5Inputs = {boxes: $boxes, scores: $scores};\n  const attrs: NonMaxSuppressionV5Attrs =\n      {maxOutputSize, iouThreshold, scoreThreshold, softNmsSigma};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const result = ENGINE.runKernel(\n                     NonMaxSuppressionV5, inputs as unknown as NamedTensorMap,\n                     attrs as unknown as NamedAttrMap) as Tensor[];\n\n  return {selectedIndices: result[0], selectedScores: result[1]};\n}\n\nexport const nonMaxSuppressionWithScore = /* @__PURE__ */ op({nonMaxSuppressionWithScore_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {nonMaxSuppressionV5Impl} from '../../backends/non_max_suppression_impl';\nimport {Tensor1D, Tensor2D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {nonMaxSuppSanityCheck} from '../nonmax_util';\nimport {tensor1d} from '../tensor1d';\n\n/**\n * Asynchronously performs non maximum suppression of bounding boxes based on\n * iou (intersection over union).\n *\n * This op also supports a Soft-NMS mode (cf.\n * Bodla et al, https://arxiv.org/abs/1704.04503) where boxes reduce the score\n * of other overlapping boxes, therefore favoring different regions of the image\n * with high scores. To enable this Soft-NMS mode, set the `softNmsSigma`\n * parameter to be larger than 0.\n *\n * @param boxes a 2d tensor of shape `[numBoxes, 4]`. Each entry is\n *     `[y1, x1, y2, x2]`, where `(y1, x1)` and `(y2, x2)` are the corners of\n *     the bounding box.\n * @param scores a 1d tensor providing the box scores of shape `[numBoxes]`.\n * @param maxOutputSize The maximum number of boxes to be selected.\n * @param iouThreshold A float representing the threshold for deciding whether\n *     boxes overlap too much with respect to IOU. Must be between [0, 1].\n *     Defaults to 0.5 (50% box overlap).\n * @param scoreThreshold A threshold for deciding when to remove boxes based\n *     on score. Defaults to -inf, which means any score is accepted.\n * @param softNmsSigma A float representing the sigma parameter for Soft NMS.\n *     When sigma is 0, it falls back to nonMaxSuppression.\n * @return A map with the following properties:\n *     - selectedIndices: A 1D tensor with the selected box indices.\n *     - selectedScores: A 1D tensor with the corresponding scores for each\n *       selected box.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nasync function nonMaxSuppressionWithScoreAsync_(\n    boxes: Tensor2D|TensorLike, scores: Tensor1D|TensorLike,\n    maxOutputSize: number, iouThreshold = 0.5,\n    scoreThreshold = Number.NEGATIVE_INFINITY,\n    softNmsSigma = 0.0): Promise<NamedTensorMap> {\n  const $boxes = convertToTensor(boxes, 'boxes', 'nonMaxSuppressionAsync');\n  const $scores = convertToTensor(scores, 'scores', 'nonMaxSuppressionAsync');\n\n  const params = nonMaxSuppSanityCheck(\n      $boxes, $scores, maxOutputSize, iouThreshold, scoreThreshold,\n      softNmsSigma);\n  maxOutputSize = params.maxOutputSize;\n  iouThreshold = params.iouThreshold;\n  scoreThreshold = params.scoreThreshold;\n  softNmsSigma = params.softNmsSigma;\n\n  const boxesAndScores = await Promise.all([$boxes.data(), $scores.data()]);\n  const boxesVals = boxesAndScores[0];\n  const scoresVals = boxesAndScores[1];\n\n  // We call a cpu based impl directly with the typedarray data  here rather\n  // than a kernel because all kernels are synchronous (and thus cannot await\n  // .data()).\n  const {selectedIndices, selectedScores} = nonMaxSuppressionV5Impl(\n      boxesVals, scoresVals, maxOutputSize, iouThreshold, scoreThreshold,\n      softNmsSigma);\n\n  if ($boxes !== boxes) {\n    $boxes.dispose();\n  }\n  if ($scores !== scores) {\n    $scores.dispose();\n  }\n\n  return {\n    selectedIndices: tensor1d(selectedIndices, 'int32'),\n    selectedScores: tensor1d(selectedScores)\n  };\n}\n\nexport const nonMaxSuppressionWithScoreAsync = nonMaxSuppressionWithScoreAsync_;\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {NonMaxSuppressionV4, NonMaxSuppressionV4Attrs, NonMaxSuppressionV4Inputs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor, Tensor1D, Tensor2D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\n\nimport {nonMaxSuppSanityCheck} from '../nonmax_util';\nimport {op} from '../operation';\n\n/**\n * Asynchronously performs non maximum suppression of bounding boxes based on\n * iou (intersection over union), with an option to pad results.\n *\n * @param boxes a 2d tensor of shape `[numBoxes, 4]`. Each entry is\n *     `[y1, x1, y2, x2]`, where `(y1, x1)` and `(y2, x2)` are the corners of\n *     the bounding box.\n * @param scores a 1d tensor providing the box scores of shape `[numBoxes]`.\n * @param maxOutputSize The maximum number of boxes to be selected.\n * @param iouThreshold A float representing the threshold for deciding whether\n *     boxes overlap too much with respect to IOU. Must be between [0, 1].\n *     Defaults to 0.5 (50% box overlap).\n * @param scoreThreshold A threshold for deciding when to remove boxes based\n *     on score. Defaults to -inf, which means any score is accepted.\n * @param padToMaxOutputSize Defaults to false. If true, size of output\n *     `selectedIndices` is padded to maxOutputSize.\n * @return A map with the following properties:\n *     - selectedIndices: A 1D tensor with the selected box indices.\n *     - validOutputs: A scalar denoting how many elements in `selectedIndices`\n *       are valid. Valid elements occur first, then padding.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nfunction nonMaxSuppressionPadded_(\n    boxes: Tensor2D|TensorLike, scores: Tensor1D|TensorLike,\n    maxOutputSize: number, iouThreshold = 0.5,\n    scoreThreshold = Number.NEGATIVE_INFINITY,\n    padToMaxOutputSize = false): NamedTensorMap {\n  const $boxes = convertToTensor(boxes, 'boxes', 'nonMaxSuppression');\n  const $scores = convertToTensor(scores, 'scores', 'nonMaxSuppression');\n\n  const params = nonMaxSuppSanityCheck(\n      $boxes, $scores, maxOutputSize, iouThreshold, scoreThreshold,\n      null /* softNmsSigma */);\n  const $maxOutputSize = params.maxOutputSize;\n  const $iouThreshold = params.iouThreshold;\n  const $scoreThreshold = params.scoreThreshold;\n\n  const inputs: NonMaxSuppressionV4Inputs = {boxes: $boxes, scores: $scores};\n  const attrs: NonMaxSuppressionV4Attrs = {\n    maxOutputSize: $maxOutputSize,\n    iouThreshold: $iouThreshold,\n    scoreThreshold: $scoreThreshold,\n    padToMaxOutputSize\n  };\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const result = ENGINE.runKernel(\n                     NonMaxSuppressionV4, inputs as unknown as NamedTensorMap,\n                     attrs as unknown as NamedAttrMap) as Tensor[];\n\n  return {selectedIndices: result[0], validOutputs: result[1]};\n}\n\nexport const nonMaxSuppressionPadded = /* @__PURE__ */ op({nonMaxSuppressionPadded_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {nonMaxSuppressionV4Impl} from '../../backends/non_max_suppression_impl';\nimport {Tensor1D, Tensor2D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {nonMaxSuppSanityCheck} from '../nonmax_util';\nimport {scalar} from '../scalar';\nimport {tensor1d} from '../tensor1d';\n\n/**\n * Asynchronously performs non maximum suppression of bounding boxes based on\n * iou (intersection over union), with an option to pad results.\n *\n * @param boxes a 2d tensor of shape `[numBoxes, 4]`. Each entry is\n *     `[y1, x1, y2, x2]`, where `(y1, x1)` and `(y2, x2)` are the corners of\n *     the bounding box.\n * @param scores a 1d tensor providing the box scores of shape `[numBoxes]`.\n * @param maxOutputSize The maximum number of boxes to be selected.\n * @param iouThreshold A float representing the threshold for deciding whether\n *     boxes overlap too much with respect to IOU. Must be between [0, 1].\n *     Defaults to 0.5 (50% box overlap).\n * @param scoreThreshold A threshold for deciding when to remove boxes based\n *     on score. Defaults to -inf, which means any score is accepted.\n * @param padToMaxOutputSize Defaults to false. If true, size of output\n *     `selectedIndices` is padded to maxOutputSize.\n * @return A map with the following properties:\n *     - selectedIndices: A 1D tensor with the selected box indices.\n *     - validOutputs: A scalar denoting how many elements in `selectedIndices`\n *       are valid. Valid elements occur first, then padding.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nasync function nonMaxSuppressionPaddedAsync_(\n    boxes: Tensor2D|TensorLike, scores: Tensor1D|TensorLike,\n    maxOutputSize: number, iouThreshold = 0.5,\n    scoreThreshold = Number.NEGATIVE_INFINITY,\n    padToMaxOutputSize = false): Promise<NamedTensorMap> {\n  const $boxes = convertToTensor(boxes, 'boxes', 'nonMaxSuppressionAsync');\n  const $scores = convertToTensor(scores, 'scores', 'nonMaxSuppressionAsync');\n\n  const params = nonMaxSuppSanityCheck(\n      $boxes, $scores, maxOutputSize, iouThreshold, scoreThreshold,\n      null /* softNmsSigma */);\n  const $maxOutputSize = params.maxOutputSize;\n  const $iouThreshold = params.iouThreshold;\n  const $scoreThreshold = params.scoreThreshold;\n\n  const [boxesVals, scoresVals] =\n      await Promise.all([$boxes.data(), $scores.data()]);\n\n  // We call a cpu based impl directly with the typedarray data here rather\n  // than a kernel because all kernels are synchronous (and thus cannot await\n  // .data()).\n  const {selectedIndices, validOutputs} = nonMaxSuppressionV4Impl(\n      boxesVals, scoresVals, $maxOutputSize, $iouThreshold, $scoreThreshold,\n      padToMaxOutputSize);\n\n  if ($boxes !== boxes) {\n    $boxes.dispose();\n  }\n  if ($scores !== scores) {\n    $scores.dispose();\n  }\n\n  return {\n    selectedIndices: tensor1d(selectedIndices, 'int32'),\n    validOutputs: scalar(validOutputs, 'int32')\n  };\n}\n\nexport const nonMaxSuppressionPaddedAsync = nonMaxSuppressionPaddedAsync_;\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {ResizeBilinear, ResizeBilinearAttrs, ResizeBilinearInputs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\n\nimport {op} from '../operation';\nimport {reshape} from '../reshape';\n\n/**\n * Bilinear resize a single 3D image or a batch of 3D images to a new shape.\n *\n * @param images The images, of rank 4 or rank 3, of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is assumed.\n * @param size The new shape `[newHeight, newWidth]` to resize the\n *     images to. Each channel is resized individually.\n * @param alignCorners Defaults to `false`. If true, rescale\n *     input by `(new_height - 1) / (height - 1)`, which exactly aligns the 4\n *     corners of images and resized images. If false, rescale by\n *     `new_height / height`. Treat similarly the width dimension.\n * @param halfPixelCenters Defaults to `false`. Whether to assume pixel centers\n *     are at 0.5, which would make the floating point coordinates of the top\n *     left pixel 0.5, 0.5.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nfunction resizeBilinear_<T extends Tensor3D|Tensor4D>(\n    images: T|TensorLike, size: [number, number], alignCorners = false,\n    halfPixelCenters = false): T {\n  const $images = convertToTensor(images, 'images', 'resizeBilinear');\n\n  util.assert(\n      $images.rank === 3 || $images.rank === 4,\n      () => `Error in resizeBilinear: x must be rank 3 or 4, but got ` +\n          `rank ${$images.rank}.`);\n  util.assert(\n      size.length === 2,\n      () => `Error in resizeBilinear: new shape must 2D, but got shape ` +\n          `${size}.`);\n  util.assert(\n      halfPixelCenters === false || alignCorners === false,\n      () => `Error in resizeBilinear: If halfPixelCenters is true, ` +\n          `alignCorners must be false.`);\n\n  let batchImages = $images as Tensor4D;\n  let reshapedTo4D = false;\n  if ($images.rank === 3) {\n    reshapedTo4D = true;\n    batchImages = reshape(\n        $images, [1, $images.shape[0], $images.shape[1], $images.shape[2]]);\n  }\n\n  const [] = size;\n\n  const inputs: ResizeBilinearInputs = {images: batchImages};\n  const attrs: ResizeBilinearAttrs = {alignCorners, halfPixelCenters, size};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  ResizeBilinear, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n  return res;\n}\n\nexport const resizeBilinear = /* @__PURE__ */ op({resizeBilinear_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {ResizeNearestNeighbor, ResizeNearestNeighborAttrs, ResizeNearestNeighborInputs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor3D, Tensor4D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\n\nimport {op} from '../operation';\nimport {reshape} from '../reshape';\n\n/**\n * NearestNeighbor resize a batch of 3D images to a new shape.\n *\n * @param images The images, of rank 4 or rank 3, of shape\n *     `[batch, height, width, inChannels]`. If rank 3, batch of 1 is assumed.\n * @param size The new shape `[newHeight, newWidth]` to resize the\n *     images to. Each channel is resized individually.\n * @param alignCorners Defaults to False. If true, rescale\n *     input by `(new_height - 1) / (height - 1)`, which exactly aligns the 4\n *     corners of images and resized images. If false, rescale by\n *     `new_height / height`. Treat similarly the width dimension.\n * @param halfPixelCenters Defaults to `false`. Whether to assume pixels are of\n *      half the actual dimensions, and yield more accurate resizes. This flag\n *      would also make the floating point coordinates of the top left pixel\n *      0.5, 0.5.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nfunction resizeNearestNeighbor_<T extends Tensor3D|Tensor4D>(\n    images: T|TensorLike, size: [number, number], alignCorners = false,\n    halfPixelCenters = false): T {\n  const $images = convertToTensor(images, 'images', 'resizeNearestNeighbor');\n\n  util.assert(\n      $images.rank === 3 || $images.rank === 4,\n      () => `Error in resizeNearestNeighbor: x must be rank 3 or 4, but got ` +\n          `rank ${$images.rank}.`);\n  util.assert(\n      size.length === 2,\n      () =>\n          `Error in resizeNearestNeighbor: new shape must 2D, but got shape ` +\n          `${size}.`);\n  util.assert(\n      $images.dtype === 'float32' || $images.dtype === 'int32',\n      () => '`images` must have `int32` or `float32` as dtype');\n  util.assert(\n      halfPixelCenters === false || alignCorners === false,\n      () => `Error in resizeNearestNeighbor: If halfPixelCenters is true, ` +\n          `alignCorners must be false.`);\n  let batchImages = $images as Tensor4D;\n  let reshapedTo4D = false;\n  if ($images.rank === 3) {\n    reshapedTo4D = true;\n    batchImages = reshape(\n        $images, [1, $images.shape[0], $images.shape[1], $images.shape[2]]);\n  }\n  const [] = size;\n\n  const inputs: ResizeNearestNeighborInputs = {images: batchImages};\n  const attrs:\n      ResizeNearestNeighborAttrs = {alignCorners, halfPixelCenters, size};\n\n  // tslint:disable-next-line: no-unnecessary-type-assertion\n  const res = ENGINE.runKernel(\n                  ResizeNearestNeighbor, inputs as unknown as NamedTensorMap,\n                  attrs as unknown as NamedAttrMap) as T;\n\n  if (reshapedTo4D) {\n    return reshape(res, [res.shape[1], res.shape[2], res.shape[3]]) as T;\n  }\n  return res;\n}\n\nexport const resizeNearestNeighbor = /* @__PURE__ */ op({resizeNearestNeighbor_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * https://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport { Tensor1D, Tensor3D } from '../../tensor';\nimport { tensor1d } from '../tensor1d';\nimport { TensorLike } from '../../types';\nimport { op } from '../operation';\nimport { cast } from '../cast';\nimport { split } from '../split';\nimport { bincount } from '../bincount';\nimport { lessEqual } from '../less_equal';\nimport { greater } from '../greater';\nimport { sum } from '../sum';\nimport { add } from '../add';\nimport { mul } from '../mul';\nimport { div } from '../div';\nimport { sub } from '../sub';\nimport { round } from '../round';\nimport { where } from '../where';\nimport { fill } from '../fill';\nimport {slice} from '../slice';\nimport { range } from '../range';\nimport { tensor } from '../tensor';\nimport * as util from '../../util';\nimport { convertToTensor } from '../../tensor_util_env';\n\n/**\n * Performs image binarization with corresponding threshold\n * (depends on the method)value, which creates a binary image from a grayscale.\n * @param image 3d tensor of shape [imageHeight,imageWidth, depth],\n * where imageHeight and imageWidth must be positive.The image color\n * range should be [0, 255].\n * @param method Optional string from `'binary' | 'otsu'`\n * which specifies the method for thresholding. Defaults to 'binary'.\n * @param inverted Optional boolean whichspecifies\n * if colours should be inverted. Defaults to false.\n * @param threshValue Optional number which defines threshold value from 0 to 1.\n * Defaults to 0.5.\n * @return A 3d tensor of shape [imageHeight,imageWidth, depth], which\n * contains binarized image.\n */\n\nfunction threshold_(\n    image: Tensor3D | TensorLike,\n    method = 'binary',\n    inverted = false,\n    threshValue = 0.5\n): Tensor3D {\n    const $image = convertToTensor(image, 'image', 'threshold');\n\n    /* 0.2989, 0.5870, 0.1140 are represent luma coefficients in CCIR601.\n\tReference for converting between RGB and grayscale: https://en.wikipedia.org/wiki/Luma_%28video%29  */\n\n    const RED_INTENCITY_COEF = 0.2989;\n    const GREEN_INTENCITY_COEF = 0.5870;\n    const BLUE_INTENCITY_COEF = 0.1140;\n    const totalPixelsInImage = $image.shape[0] * $image.shape[1];\n\n    let $threshold = mul(tensor1d([threshValue]), 255);\n    let r, g, b, grayscale;\n\n    util.assert(\n        $image.rank === 3,\n        () => 'Error in threshold: image must be rank 3,' +\n            `but got rank ${$image.rank}.`);\n\n    util.assert(\n        $image.shape[2] === 3 || $image.shape[2]=== 1,\n        () => 'Error in threshold: ' +\n            'image color channel must be equal to 3 or 1' +\n            `but got ${$image.shape[2]}.`);\n\n    util.assert(\n      $image.dtype === 'int32' || $image.dtype === 'float32',\n      () => 'Error in dtype: image dtype must be int32 or float32,' +\n          `but got dtype ${$image.dtype}.`);\n\n    util.assert(\n      method === 'otsu' || method === 'binary',\n      () => `Method must be binary or otsu, but was ${method}`);\n\n    if ($image.shape[2] === 3) {\n        [r, g, b] = split($image, [1, 1, 1], -1);\n        const $r = mul(r,RED_INTENCITY_COEF);\n        const $g = mul(g,GREEN_INTENCITY_COEF);\n        const $b = mul(b,BLUE_INTENCITY_COEF);\n        grayscale = add(add($r, $g), $b);\n    } else {\n        grayscale = image;\n    }\n\n    if (method === 'otsu') {\n        const $histogram = bincount(cast(round(grayscale), 'int32') as Tensor1D,\n            tensor([]),\n            256);\n        $threshold = otsu($histogram, totalPixelsInImage);\n    }\n\n    const invCondition = inverted ?\n        lessEqual(grayscale, $threshold) : greater(grayscale, $threshold);\n\n    const result = cast(mul(invCondition,255), 'int32');\n\n    return result as Tensor3D;\n}\n\nfunction otsu(histogram: Tensor1D, total: number):Tensor1D {\n\n    let bestThresh = tensor1d([-1]);\n    let bestInBetVar = tensor1d([0]);\n    let cInBetVar = tensor1d([0]);\n    let classFirst, classSecond, meanFirst,\n        meanSec, weightForeground, weightBack;\n\n    for (let index = 0; index < histogram.size-1; index++) {\n\n        classFirst = slice(histogram, 0, index + 1);\n\n        classSecond = slice(histogram,index + 1);\n\n        weightForeground = div(sum(classFirst),total);\n\n        weightBack = div(sum(classSecond),total);\n\n        const meanFirstDivA = sum(mul(classFirst, range(0, classFirst.size)));\n\n        meanFirst = div(meanFirstDivA, sum(classFirst) );\n\n        const meanSecFill = fill(classSecond.shape, classFirst.size);\n        const meanSecAdd = add(range(0,classSecond.size),meanSecFill);\n        const meanSecMul = mul(classSecond, (meanSecAdd));\n        meanSec = div(sum(meanSecMul), sum(classSecond));\n\n        const cInBetVarSubA = sub(meanFirst, meanSec);\n        const cInBetVarSubB = sub(meanFirst, meanSec);\n        const cInBetVarMul = mul(weightForeground, weightBack);\n        cInBetVar = mul(mul(cInBetVarMul,cInBetVarSubA), cInBetVarSubB);\n\n        const condition = greater(cInBetVar, bestInBetVar);\n\n        bestInBetVar = where(condition, cInBetVar, bestInBetVar);\n\n        bestThresh = where(condition, tensor1d([index]), bestThresh);\n\n    }\n    return bestThresh;\n}\n\nexport const threshold = /* @__PURE__ */ op({ threshold_ });\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../../engine';\nimport {Transform, TransformAttrs, TransformInputs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor2D, Tensor4D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport * as util from '../../util';\n\nimport {op} from '../operation';\n\n/**\n * Applies the given transform(s) to the image(s).\n *\n * @param image 4d tensor of shape `[batch, imageHeight, imageWidth, depth]`.\n * @param transforms Projective transform matrix/matrices. A tensor1d of length\n *     8 or tensor of size N x 8. If one row of transforms is [a0, a1, a2, b0,\n *     b1, b2, c0, c1], then it maps the output point (x, y) to a transformed\n *     input point (x', y') = ((a0 x + a1 y + a2) / k, (b0 x + b1 y + b2) / k),\n *     where k = c0 x + c1 y + 1. The transforms are inverted compared to the\n *     transform mapping input points to output points.\n * @param interpolation Interpolation mode.\n *     Supported values: 'nearest', 'bilinear'. Default to 'nearest'.\n * @param fillMode Points outside the boundaries of the input are filled\n *     according to the given mode, one of 'constant', 'reflect', 'wrap',\n *     'nearest'. Default to 'constant'.\n *     'reflect': (d c b a | a b c d | d c b a ) The input is extended by\n *     reflecting about the edge of the last pixel.\n *     'constant': (k k k k | a b c d | k k k k) The input is extended by\n *     filling all values beyond the edge with the same constant value k.\n *     'wrap': (a b c d | a b c d | a b c d) The input is extended by\n *     wrapping around to the opposite edge.\n *     'nearest': (a a a a | a b c d | d d d d) The input is extended by\n *     the nearest pixel.\n * @param fillValue A float represents the value to be filled outside the\n *     boundaries when fillMode is 'constant'.\n * @param Output dimension after the transform, [height, width]. If undefined,\n *     output is the same size as input image.\n *\n * @doc {heading: 'Operations', subheading: 'Images', namespace: 'image'}\n */\nfunction transform_(\n    image: Tensor4D|TensorLike, transforms: Tensor2D|TensorLike,\n    interpolation: 'nearest'|'bilinear' = 'nearest',\n    fillMode: 'constant'|'reflect'|'wrap'|'nearest' = 'constant', fillValue = 0,\n    outputShape?: [number, number]): Tensor4D {\n  const $image = convertToTensor(image, 'image', 'transform', 'float32');\n  const $transforms =\n      convertToTensor(transforms, 'transforms', 'transform', 'float32');\n\n  util.assert(\n      $image.rank === 4,\n      () => 'Error in transform: image must be rank 4,' +\n          `but got rank ${$image.rank}.`);\n\n  util.assert(\n      $transforms.rank === 2 &&\n          ($transforms.shape[0] === $image.shape[0] ||\n           $transforms.shape[0] === 1) &&\n          $transforms.shape[1] === 8,\n      () => `Error in transform: Input transform should be batch x 8 or 1 x 8`);\n\n  util.assert(\n      outputShape == null || outputShape.length === 2,\n      () =>\n          'Error in transform: outputShape must be [height, width] or null, ' +\n          `but got ${outputShape}.`);\n\n  const inputs: TransformInputs = {image: $image, transforms: $transforms};\n  const attrs:\n      TransformAttrs = {interpolation, fillMode, fillValue, outputShape};\n\n  return ENGINE.runKernel(\n      Transform, inputs as unknown as NamedTensorMap,\n      attrs as unknown as NamedAttrMap);\n}\n\nexport const transform = /* @__PURE__ */ op({transform_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Scalar, Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {assert} from '../../util';\n\nimport {greaterEqual} from '../greater_equal';\nimport {less} from '../less';\nimport {lessEqual} from '../less_equal';\nimport {logicalAnd} from '../logical_and';\nimport {minimum} from '../minimum';\nimport {neg} from '../neg';\nimport {op} from '../operation';\nimport {range} from '../range';\nimport {reshape} from '../reshape';\nimport {stack} from '../stack';\nimport {sub} from '../sub';\nimport {unstack} from '../unstack';\nimport {where} from '../where';\nimport {zeros} from '../zeros';\n\n/**\n * Copy a tensor setting everything outside a central band in each innermost\n * matrix to zero.\n *\n * The band part is computed as follows: Assume input has `k` dimensions\n * `[I, J, K, ..., M, N]`, then the output is a tensor with the same shape where\n * `band[i, j, k, ..., m, n] = in_band(m, n) * input[i, j, k, ..., m, n]`.\n * The indicator function\n * `in_band(m, n) = (num_lower < 0 || (m-n) <= num_lower)`\n * `&& (num_upper < 0 || (n-m) <= num_upper)`\n *\n * ```js\n * const x = tf.tensor2d([[ 0,  1,  2, 3],\n *                        [-1,  0,  1, 2],\n *                        [-2, -1,  0, 1],\n *                        [-3, -2, -1, 0]]);\n * let y = tf.linalg.bandPart(x, 1, -1);\n * y.print(); // [[ 0,  1,  2, 3],\n *            //  [-1,  0,  1, 2],\n *            //  [ 0, -1,  0, 1],\n *            //  [ 0, 0 , -1, 0]]\n * let z = tf.linalg.bandPart(x, 2, 1);\n * z.print(); // [[ 0,  1,  0, 0],\n *            //  [-1,  0,  1, 0],\n *            //  [-2, -1,  0, 1],\n *            //  [ 0, -2, -1, 0]]\n * ```\n *\n * @param x Rank `k` tensor\n * @param numLower Number of subdiagonals to keep.\n *   If negative, keep entire lower triangle.\n * @param numUpper Number of subdiagonals to keep.\n *   If negative, keep entire upper triangle.\n * @returns Rank `k` tensor of the same shape as input.\n *   The extracted banded tensor.\n *\n * @doc {heading:'Operations', subheading:'Linear Algebra', namespace:'linalg'}\n */\nfunction bandPart_<T extends Tensor>(\n    a: T|TensorLike, numLower: number|Scalar, numUpper: number|Scalar): T {\n  const $a = convertToTensor(a, 'a', 'bandPart');\n  assert(\n      $a.rank >= 2,\n      () => `bandPart(): Rank must be at least 2, got ${$a.rank}.`);\n\n  const shape = $a.shape;\n  const [M, N] = $a.shape.slice(-2);\n\n  let $numLower: Scalar;\n  let $numUpper: Scalar;\n  if (typeof numLower === 'number') {\n    assert(\n        numLower % 1 === 0,\n        () => `bandPart(): numLower must be an integer, got ${numLower}.`);\n    assert(\n        numLower <= M,\n        () => `bandPart(): numLower (${numLower})` +\n            ` must not be greater than the number of rows (${M}).`);\n    $numLower =\n        convertToTensor(numLower < 0 ? M : numLower, 'numLower', 'bandPart') as\n        Scalar;\n  } else {\n    assert(\n        numLower.dtype === 'int32',\n        () => `bandPart(): numLower's dtype must be an int32.`);\n    // If numLower is a Scalar, checking `numLower <= M` could hurt performance,\n    // but minimum(numLower, M) could avoid unexpected results.\n    $numLower = where(less(numLower, 0), M, minimum(numLower, M)) as Scalar;\n  }\n\n  if (typeof numUpper === 'number') {\n    assert(\n        numUpper % 1 === 0,\n        () => `bandPart(): numUpper must be an integer, got ${numUpper}.`);\n    assert(\n        numUpper <= N,\n        () => `bandPart(): numUpper (${numUpper})` +\n            ` must not be greater than the number of columns (${N}).`);\n    $numUpper =\n        convertToTensor(numUpper < 0 ? N : numUpper, 'numUpper', 'bandPart') as\n        Scalar;\n  } else {\n    assert(\n        numUpper.dtype === 'int32',\n        () => `bandPart(): numUpper's dtype must be an int32.`);\n    $numUpper = where(less(numUpper, 0), N, minimum(numUpper, N)) as Scalar;\n  }\n\n  const i = reshape(range(0, M, 1, 'int32'), [-1, 1]);\n  const j = range(0, N, 1, 'int32');\n  const ij = sub(i, j);\n\n  const inBand =\n      logicalAnd(lessEqual(ij, $numLower), greaterEqual(ij, neg($numUpper)));\n\n  const zero = zeros([M, N], $a.dtype);\n\n  return reshape(\n             stack(unstack(reshape($a, [-1, M, N]))\n                       .map(mat => where(inBand, mat, zero))),\n             shape) as T;\n}\n\nexport const bandPart = /* @__PURE__ */ op({bandPart_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {Tensor1D, Tensor2D} from '../../tensor';\nimport {assert} from '../../util';\n\nimport {div} from '../div';\nimport {mul} from '../mul';\nimport {norm} from '../norm';\nimport {op} from '../operation';\nimport {split} from '../split';\nimport {squeeze} from '../squeeze';\nimport {stack} from '../stack';\nimport {sub} from '../sub';\nimport {sum} from '../sum';\n\n/**\n * Gram-Schmidt orthogonalization.\n *\n * ```js\n * const x = tf.tensor2d([[1, 2], [3, 4]]);\n * let y = tf.linalg.gramSchmidt(x);\n * y.print();\n * console.log('Orthogonalized:');\n * y.dot(y.transpose()).print();  // should be nearly the identity matrix.\n * console.log('First row direction maintained:');\n * const data = await y.array();\n * console.log(data[0][1] / data[0][0]);  // should be nearly 2.\n * ```\n *\n * @param xs The vectors to be orthogonalized, in one of the two following\n *   formats:\n *   - An Array of `tf.Tensor1D`.\n *   - A `tf.Tensor2D`, i.e., a matrix, in which case the vectors are the rows\n *     of `xs`.\n *   In each case, all the vectors must have the same length and the length\n *   must be greater than or equal to the number of vectors.\n * @returns The orthogonalized and normalized vectors or matrix.\n *   Orthogonalization means that the vectors or the rows of the matrix\n *   are orthogonal (zero inner products). Normalization means that each\n *   vector or each row of the matrix has an L2 norm that equals `1`.\n *\n * @doc {heading:'Operations', subheading:'Linear Algebra', namespace:'linalg'}\n */\nfunction gramSchmidt_(xs: Tensor1D[]|Tensor2D): Tensor1D[]|Tensor2D {\n  let inputIsTensor2D: boolean;\n  if (Array.isArray(xs)) {\n    inputIsTensor2D = false;\n    assert(\n        xs != null && xs.length > 0,\n        () => 'Gram-Schmidt process: input must not be null, undefined, or ' +\n            'empty');\n    const dim = xs[0].shape[0];\n    for (let i = 1; i < xs.length; ++i) {\n      assert(\n          xs[i].shape[0] === dim,\n          () =>\n              'Gram-Schmidt: Non-unique lengths found in the input vectors: ' +\n              `(${(xs as Tensor1D[])[i].shape[0]} vs. ${dim})`);\n    }\n  } else {\n    inputIsTensor2D = true;\n    xs = split(xs, xs.shape[0], 0).map(x => squeeze(x, [0]));\n  }\n\n  assert(\n      xs.length <= xs[0].shape[0],\n      () => `Gram-Schmidt: Number of vectors (${\n                (xs as Tensor1D[]).length}) exceeds ` +\n          `number of dimensions (${(xs as Tensor1D[])[0].shape[0]}).`);\n\n  const ys: Tensor1D[] = [];\n  const xs1d = xs;\n  for (let i = 0; i < xs.length; ++i) {\n    ys.push(ENGINE.tidy(() => {\n      let x = xs1d[i];\n      if (i > 0) {\n        for (let j = 0; j < i; ++j) {\n          const proj = mul(sum(mul(ys[j], x)), ys[j]);\n          x = sub(x, proj);\n        }\n      }\n      return div(x, norm(x, 'euclidean'));\n    }));\n  }\n\n  if (inputIsTensor2D) {\n    return stack(ys, 0) as Tensor2D;\n  } else {\n    return ys;\n  }\n}\n\nexport const gramSchmidt = /* @__PURE__ */ op({gramSchmidt_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {ENGINE} from '../../engine';\nimport {dispose} from '../../globals';\nimport {Tensor, Tensor2D} from '../../tensor';\nimport {assert} from '../../util';\n\nimport {clone} from '../clone';\nimport {concat} from '../concat';\nimport {div} from '../div';\nimport {eye} from '../eye';\nimport {greater} from '../greater';\nimport {matMul} from '../mat_mul';\nimport {mul} from '../mul';\nimport {neg} from '../neg';\nimport {norm} from '../norm';\nimport {op} from '../operation';\nimport {reshape} from '../reshape';\nimport {slice} from '../slice';\nimport {stack} from '../stack';\nimport {sub} from '../sub';\nimport {tensor2d} from '../tensor2d';\nimport {transpose} from '../transpose';\nimport {unstack} from '../unstack';\nimport {where} from '../where';\n\n/**\n * Compute QR decomposition of m-by-n matrix using Householder transformation.\n *\n * Implementation based on\n *   [http://www.cs.cornell.edu/~bindel/class/cs6210-f09/lec18.pdf]\n * (http://www.cs.cornell.edu/~bindel/class/cs6210-f09/lec18.pdf)\n *\n * ```js\n * const a = tf.tensor2d([[1, 2], [3, 4]]);\n * let [q, r] = tf.linalg.qr(a);\n * console.log('Q');\n * q.print();\n * console.log('R');\n * r.print();\n * console.log('Orthogonalized');\n * q.dot(q.transpose()).print()  // should be nearly the identity matrix.\n * console.log('Reconstructed');\n * q.dot(r).print(); // should be nearly [[1, 2], [3, 4]];\n * ```\n *\n * @param x The `tf.Tensor` to be QR-decomposed. Must have rank >= 2. Suppose\n *   it has the shape `[..., M, N]`.\n * @param fullMatrices An optional boolean parameter. Defaults to `false`.\n *   If `true`, compute full-sized `Q`. If `false` (the default),\n *   compute only the leading N columns of `Q` and `R`.\n * @returns An `Array` of two `tf.Tensor`s: `[Q, R]`. `Q` is a unitary matrix,\n *   i.e., its columns all have unit norm and are mutually orthogonal.\n *   If `M >= N`,\n *     If `fullMatrices` is `false` (default),\n *       - `Q` has a shape of `[..., M, N]`,\n *       - `R` has a shape of `[..., N, N]`.\n *     If `fullMatrices` is `true` (default),\n *       - `Q` has a shape of `[..., M, M]`,\n *       - `R` has a shape of `[..., M, N]`.\n *   If `M < N`,\n *     - `Q` has a shape of `[..., M, M]`,\n *     - `R` has a shape of `[..., M, N]`.\n * @throws If the rank of `x` is less than 2.\n *\n * @doc {heading:'Operations',\n *       subheading:'Linear Algebra',\n *       namespace:'linalg'}\n */\nfunction qr_(x: Tensor, fullMatrices = false): [Tensor, Tensor] {\n  assert(\n      x.rank >= 2,\n      () => `qr() requires input tensor to have a rank >= 2, but got rank ${\n          x.rank}`);\n\n  if (x.rank === 2) {\n    return qr2d(x as Tensor2D, fullMatrices);\n  } else {\n    // Rank > 2.\n    // TODO(cais): Below we split the input into individual 2D tensors,\n    //   perform QR decomposition on them and then stack the results back\n    //   together. We should explore whether this can be parallelized.\n    const outerDimsProd = x.shape.slice(0, x.shape.length - 2)\n                              .reduce((value, prev) => value * prev);\n    const x2ds = unstack(\n        reshape(\n            x,\n            [\n              outerDimsProd, x.shape[x.shape.length - 2],\n              x.shape[x.shape.length - 1]\n            ]),\n        0);\n    const q2ds: Tensor2D[] = [];\n    const r2ds: Tensor2D[] = [];\n    x2ds.forEach(x2d => {\n      const [q2d, r2d] = qr2d(x2d as Tensor2D, fullMatrices);\n      q2ds.push(q2d);\n      r2ds.push(r2d);\n    });\n    const q = reshape(stack(q2ds, 0), x.shape);\n    const r = reshape(stack(r2ds, 0), x.shape);\n    return [q, r];\n  }\n}\n\nfunction qr2d(x: Tensor2D, fullMatrices = false): [Tensor2D, Tensor2D] {\n  return ENGINE.tidy(() => {\n    assert(\n        x.shape.length === 2,\n        () => `qr2d() requires a 2D Tensor, but got a ${\n            x.shape.length}D Tensor.`);\n\n    const m = x.shape[0];\n    const n = x.shape[1];\n\n    let q = eye(m);    // Orthogonal transform so far.\n    let r = clone(x);  // Transformed matrix so far.\n\n    const one2D = tensor2d([[1]], [1, 1]);\n    let w: Tensor2D = clone(one2D);\n\n    const iters = m >= n ? n : m;\n    for (let j = 0; j < iters; ++j) {\n      // This tidy within the for-loop ensures we clean up temporary\n      // tensors as soon as they are no longer needed.\n      const rTemp = r;\n      const wTemp = w;\n      const qTemp = q;\n      [w, r, q] = ENGINE.tidy((): [Tensor2D, Tensor2D, Tensor2D] => {\n        // Find H = I - tau * w * w', to put zeros below R(j, j).\n        const rjEnd1 = slice(r, [j, j], [m - j, 1]);\n        const normX = norm(rjEnd1);\n        const rjj = slice(r, [j, j], [1, 1]);\n\n        // The sign() function returns 0 on 0, which causes division by zero.\n        const s = where(greater(rjj, 0), tensor2d([[-1]]), tensor2d([[1]]));\n\n        const u1 = sub(rjj, mul(s, normX));\n        const wPre = div(rjEnd1, u1);\n        if (wPre.shape[0] === 1) {\n          w = clone(one2D);\n        } else {\n          w = concat(\n              [\n                one2D,\n                slice(wPre, [1, 0], [wPre.shape[0] - 1, wPre.shape[1]]) as\n                    Tensor2D\n              ],\n              0);\n        }\n        const tau = neg(div(matMul(s, u1), normX)) as Tensor2D;\n\n        // -- R := HR, Q := QH.\n        const rjEndAll = slice(r, [j, 0], [m - j, n]);\n        const tauTimesW: Tensor2D = mul(tau, w);\n        const wT: Tensor2D = transpose(w);\n        if (j === 0) {\n          r = sub(rjEndAll, matMul(tauTimesW, matMul(wT, rjEndAll)));\n        } else {\n          const rTimesTau: Tensor2D =\n              sub(rjEndAll, matMul(tauTimesW, matMul(wT, rjEndAll)));\n          r = concat([slice(r, [0, 0], [j, n]), rTimesTau], 0);\n        }\n        const tawTimesWT: Tensor2D = transpose(tauTimesW);\n        const qAllJEnd = slice(q, [0, j], [m, q.shape[1] - j]);\n        if (j === 0) {\n          q = sub(qAllJEnd, matMul(matMul(qAllJEnd, w), tawTimesWT));\n        } else {\n          const qTimesTau: Tensor2D =\n              sub(qAllJEnd, matMul(matMul(qAllJEnd, w), tawTimesWT));\n          q = concat([slice(q, [0, 0], [m, j]), qTimesTau], 1);\n        }\n        return [w, r, q];\n      });\n      dispose([rTemp, wTemp, qTemp]);\n    }\n\n    if (!fullMatrices && m > n) {\n      q = slice(q, [0, 0], [m, n]);\n      r = slice(r, [0, 0], [n, n]);\n    }\n\n    return [q, r];\n  }) as [Tensor2D, Tensor2D];\n}\n\nexport const qr = /* @__PURE__ */ op({qr_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nexport enum Reduction {\n  NONE,\n  MEAN,\n  SUM,\n  SUM_BY_NONZERO_WEIGHTS\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\n\nimport {cast} from '../cast';\nimport {div} from '../div';\nimport {Reduction} from '../loss_ops_utils';\nimport {mean} from '../mean';\nimport {mul} from '../mul';\nimport {notEqual} from '../not_equal';\nimport {ones} from '../ones';\nimport {op} from '../operation';\nimport {scalar} from '../scalar';\nimport {sum} from '../sum';\n\n/**\n * Computes the weighted loss between two tensors.\n *\n * @param losses Tensor of shape `[batch_size, d1, ..., dN]`.\n * @param weights Tensor whose rank is either 0, or the same rank as\n *    `losses`, and must be broadcastable to `losses` (i.e., all\n *    dimensions must be either `1`, or the same as the corresponding\n *    `losses` dimension).\n *\n * @doc {heading: 'Training', subheading: 'Losses', namespace: 'losses'}\n */\nfunction computeWeightedLoss_<T extends Tensor, O extends Tensor>(\n    losses: T|TensorLike, weights?: Tensor|TensorLike,\n    reduction = Reduction.SUM_BY_NONZERO_WEIGHTS): O {\n  const $losses = convertToTensor(losses, 'losses', 'computeWeightedLoss');\n  let $weights: Tensor = null;\n  if (weights != null) {\n    $weights = convertToTensor(weights, 'weights', 'computeWeightedLoss');\n  }\n\n  const weightedLoss = ($weights == null) ? $losses : mul($losses, $weights);\n\n  if (reduction === Reduction.NONE) {\n    return weightedLoss as O;\n  }\n  if (reduction === Reduction.SUM) {\n    return sum(weightedLoss);\n  }\n  if (reduction === Reduction.MEAN) {\n    if ($weights == null) {\n      return mean(weightedLoss);\n    } else {\n      const broadcastFactor = $losses.size / $weights.size;\n      const result = div(sum(weightedLoss), sum($weights));\n      return broadcastFactor > 1 ? div(result, scalar(broadcastFactor)) :\n                                   result as O;\n    }\n  }\n  if (reduction === Reduction.SUM_BY_NONZERO_WEIGHTS) {\n    if ($weights == null) {\n      return div(sum(weightedLoss), scalar($losses.size));\n    } else {\n      const broadcastedWeights = mul($weights, ones($losses.shape));\n\n      const numNonZeros =\n          cast(sum(notEqual(broadcastedWeights, scalar(0))), 'float32');\n      return div(sum(weightedLoss), numNonZeros);\n    }\n  }\n\n  throw Error(`Unknown reduction: ${reduction}`);\n}\nexport const computeWeightedLoss = /* @__PURE__ */ op({computeWeightedLoss_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {assertShapesMatch} from '../../util';\nimport {abs} from '../abs';\nimport {Reduction} from '../loss_ops_utils';\nimport {op} from '../operation';\nimport {sub} from '../sub';\n\nimport {computeWeightedLoss} from './compute_weighted_loss';\n\n/**\n * Computes the absolute difference loss between two tensors.\n *\n * @param labels The ground truth output tensor, same dimensions as\n *    'predictions'.\n * @param predictions The predicted outputs.\n * @param weights Tensor whose rank is either 0, or the same rank as\n *    `labels`, and must be broadcastable to `labels` (i.e., all dimensions\n *    must be either `1`, or the same as the corresponding `losses`\n *    dimension).\n * @param reduction Type of reduction to apply to loss. Should be of type\n *    `Reduction`\n *\n * @doc {heading: 'Training', subheading: 'Losses', namespace: 'losses'}\n */\nfunction absoluteDifference_<T extends Tensor, O extends Tensor>(\n    labels: T|TensorLike, predictions: T|TensorLike,\n    weights?: Tensor|TensorLike,\n    reduction = Reduction.SUM_BY_NONZERO_WEIGHTS): O {\n  const $labels = convertToTensor(labels, 'labels', 'absoluteDifference');\n  const $predictions =\n      convertToTensor(predictions, 'predictions', 'absoluteDifference');\n  let $weights: Tensor = null;\n  if (weights != null) {\n    $weights = convertToTensor(weights, 'weights', 'absoluteDifference');\n  }\n  assertShapesMatch(\n      $labels.shape, $predictions.shape, 'Error in absoluteDifference: ');\n\n  const losses = abs(sub($labels, $predictions));\n  return computeWeightedLoss(losses, $weights, reduction);\n}\n\nexport const absoluteDifference = /* @__PURE__ */ op({absoluteDifference_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {assertShapesMatch} from '../../util';\nimport {Reduction} from '../loss_ops_utils';\nimport {mul} from '../mul';\nimport {op} from '../operation';\nimport {scalar} from '../scalar';\nimport {sub} from '../sub';\nimport {sum} from '../sum';\n\nimport {computeWeightedLoss} from './compute_weighted_loss';\n\n/**\n * Computes the cosine distance loss between two tensors.\n *\n * @param labels The ground truth output tensor, same dimensions as\n *    'predictions'.\n * @param predictions The predicted outputs.\n * @param axis The dimension along which the cosine distance is computed.\n * @param weights Tensor whose rank is either 0, or the same rank as\n *    `labels`, and must be broadcastable to `labels` (i.e., all dimensions\n *    must be either `1`, or the same as the corresponding `losses`\n *    dimension).\n * @param reduction Type of reduction to apply to loss. Should be of type\n *    `Reduction`\n *\n * @doc {heading: 'Training', subheading: 'Losses', namespace: 'losses'}\n */\nfunction cosineDistance_<T extends Tensor, O extends Tensor>(\n    labels: T|TensorLike, predictions: T|TensorLike, axis: number,\n    weights?: Tensor|TensorLike,\n    reduction = Reduction.SUM_BY_NONZERO_WEIGHTS): O {\n  const $labels = convertToTensor(labels, 'labels', 'cosineDistance');\n  const $predictions =\n      convertToTensor(predictions, 'predictions', 'cosineDistance');\n  let $weights: Tensor = null;\n  if (weights != null) {\n    $weights = convertToTensor(weights, 'weights', 'cosineDistance');\n  }\n  assertShapesMatch(\n      $labels.shape, $predictions.shape, 'Error in cosineDistance: ');\n\n  const one = scalar(1);\n  const losses = sub(one, sum(mul($labels, $predictions), axis, true));\n  return computeWeightedLoss(losses, $weights, reduction);\n}\nexport const cosineDistance = /* @__PURE__ */ op({cosineDistance_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {assertShapesMatch} from '../../util';\nimport {Reduction} from '../loss_ops_utils';\nimport {mul} from '../mul';\nimport {op} from '../operation';\nimport {relu} from '../relu';\nimport {scalar} from '../scalar';\nimport {sub} from '../sub';\n\nimport {computeWeightedLoss} from './compute_weighted_loss';\n\n/**\n * Computes the Hinge loss between two tensors.\n *\n * @param labels The ground truth output tensor, same dimensions as\n *    'predictions'.\n * @param predictions The predicted outputs.\n * @param weights Tensor whose rank is either 0, or the same rank as\n *    `labels`, and must be broadcastable to `labels` (i.e., all dimensions\n *    must be either `1`, or the same as the corresponding `losses`\n *    dimension).\n * @param reduction Type of reduction to apply to loss. Should be of type\n *    `Reduction`\n *\n * @doc {heading: 'Training', subheading: 'Losses', namespace: 'losses'}\n */\nfunction hingeLoss_<T extends Tensor, O extends Tensor>(\n    labels: T|TensorLike, predictions: T|TensorLike,\n    weights?: Tensor|TensorLike,\n    reduction = Reduction.SUM_BY_NONZERO_WEIGHTS): O {\n  let $labels = convertToTensor(labels, 'labels', 'hingeLoss');\n  const $predictions = convertToTensor(predictions, 'predictions', 'hingeLoss');\n  let $weights: Tensor = null;\n  if (weights != null) {\n    $weights = convertToTensor(weights, 'weights', 'hingeLoss');\n  }\n  assertShapesMatch($labels.shape, $predictions.shape, 'Error in hingeLoss: ');\n\n  const one = scalar(1);\n  // Convert binary labels to (-1, 1)\n  $labels = sub(mul(scalar(2), $labels), one);\n  const losses = relu(sub(one, mul($labels, $predictions)));\n  return computeWeightedLoss(losses, $weights, reduction);\n}\nexport const hingeLoss = /* @__PURE__ */ op({hingeLoss_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {assertShapesMatch} from '../../util';\nimport {abs} from '../abs';\nimport {add} from '../add';\nimport {Reduction} from '../loss_ops_utils';\nimport {minimum} from '../minimum';\nimport {mul} from '../mul';\nimport {op} from '../operation';\nimport {scalar} from '../scalar';\nimport {square} from '../square';\nimport {sub} from '../sub';\n\nimport {computeWeightedLoss} from './compute_weighted_loss';\n\n/**\n * Computes the Huber loss between two tensors.\n *\n * @param labels The ground truth output tensor, same dimensions as\n *    'predictions'.\n * @param predictions The predicted outputs.\n * @param weights Tensor whose rank is either 0, or the same rank as\n *    `labels`, and must be broadcastable to `labels` (i.e., all dimensions\n *    must be either `1`, or the same as the corresponding `losses`\n *    dimension).\n * @param delta Point where Huber loss changes from quadratic to linear.\n * @param reduction Type of reduction to apply to loss. Should be of type\n *    `Reduction`.\n *\n * @doc {heading: 'Training', subheading: 'Losses', namespace: 'losses'}\n */\nfunction huberLoss_<T extends Tensor, O extends Tensor>(\n    labels: T|TensorLike, predictions: T|TensorLike,\n    weights?: Tensor|TensorLike, delta = 1.0,\n    reduction = Reduction.SUM_BY_NONZERO_WEIGHTS): O {\n  const $labels = convertToTensor(labels, 'labels', 'huberLoss');\n  const $predictions = convertToTensor(predictions, 'predictions', 'huberLoss');\n  let $weights: Tensor = null;\n  if (weights != null) {\n    $weights = convertToTensor(weights, 'weights', 'huberLoss');\n  }\n  assertShapesMatch($labels.shape, $predictions.shape, 'Error in huberLoss: ');\n\n  const deltaScalar = scalar(delta);\n  const error = abs(sub($predictions, $labels));\n  const quadratic = minimum(error, deltaScalar);\n  const linear = sub(error, quadratic);\n\n  const losses =\n      add(mul(scalar(0.5), square(quadratic)), mul(deltaScalar, linear));\n  return computeWeightedLoss(losses, $weights, reduction);\n}\nexport const huberLoss = /* @__PURE__ */ op({huberLoss_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {assertShapesMatch} from '../../util';\nimport {add} from '../add';\nimport {log} from '../log';\nimport {Reduction} from '../loss_ops_utils';\nimport {mul} from '../mul';\nimport {neg} from '../neg';\nimport {op} from '../operation';\nimport {scalar} from '../scalar';\nimport {sub} from '../sub';\n\nimport {computeWeightedLoss} from './compute_weighted_loss';\n\n/**\n * Computes the log loss between two tensors.\n *\n * @param labels The ground truth output tensor, same dimensions as\n *    'predictions'.\n * @param predictions The predicted outputs.\n * @param weights Tensor whose rank is either 0, or the same rank as\n *    `labels`, and must be broadcastable to `labels` (i.e., all dimensions\n *    must be either `1`, or the same as the corresponding `losses`\n *    dimension).\n * @param epsilon A small increment to avoid taking log of zero\n * @param reduction Type of reduction to apply to loss. Should be of type\n *    `Reduction`\n *\n * @doc {heading: 'Training', subheading: 'Losses', namespace: 'losses'}\n */\nfunction logLoss_<T extends Tensor, O extends Tensor>(\n    labels: T|TensorLike, predictions: T|TensorLike,\n    weights?: Tensor|TensorLike, epsilon = 1e-7,\n    reduction = Reduction.SUM_BY_NONZERO_WEIGHTS): O {\n  const $labels = convertToTensor(labels, 'labels', 'logLoss');\n  const $predictions = convertToTensor(predictions, 'predictions', 'logLoss');\n  let $weights: Tensor = null;\n  if (weights != null) {\n    $weights = convertToTensor(weights, 'weights', 'logLoss');\n  }\n  assertShapesMatch($labels.shape, $predictions.shape, 'Error in logLoss: ');\n\n  const one = scalar(1);\n  const epsilonScalar = scalar(epsilon);\n\n  const l1 = neg(mul($labels, log(add($predictions, epsilonScalar))));\n  const l2 =\n      mul(sub(one, $labels), log(add(sub(one, $predictions), epsilonScalar)));\n  const losses = sub(l1, l2);\n  return computeWeightedLoss(losses, $weights, reduction);\n}\nexport const logLoss = /* @__PURE__ */ op({logLoss_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {assertShapesMatch} from '../../util';\nimport {Reduction} from '../loss_ops_utils';\nimport {op} from '../operation';\nimport {squaredDifference} from '../squared_difference';\n\nimport {computeWeightedLoss} from './compute_weighted_loss';\n\n/**\n * Computes the mean squared error between two tensors.\n *\n * @param labels The ground truth output tensor, same dimensions as\n *    'predictions'.\n * @param predictions The predicted outputs.\n * @param weights Tensor whose rank is either 0, or the same rank as\n *    `labels`, and must be broadcastable to `labels` (i.e., all dimensions\n *    must be either `1`, or the same as the corresponding `losses`\n *    dimension).\n * @param reduction Type of reduction to apply to loss. Should be of type\n *    `Reduction`\n *\n * @doc {heading: 'Training', subheading: 'Losses', namespace: 'losses'}\n */\nfunction meanSquaredError_<T extends Tensor, O extends Tensor>(\n    labels: T|TensorLike, predictions: T|TensorLike,\n    weights?: Tensor|TensorLike,\n    reduction = Reduction.SUM_BY_NONZERO_WEIGHTS): O {\n  const $labels = convertToTensor(labels, 'labels', 'meanSquaredError');\n  const $predictions =\n      convertToTensor(predictions, 'predictions', 'meanSquaredError');\n  let $weights: Tensor = null;\n  if (weights != null) {\n    $weights = convertToTensor(weights, 'weights', 'meanSquaredError');\n  }\n  assertShapesMatch(\n      $labels.shape, $predictions.shape, 'Error in meanSquaredError: ');\n\n  const losses = squaredDifference($labels, $predictions);\n  return computeWeightedLoss(losses, $weights, reduction);\n}\nexport const meanSquaredError = /* @__PURE__ */ op({meanSquaredError_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {assertShapesMatch} from '../../util';\nimport {abs} from '../abs';\nimport {add} from '../add';\nimport {exp} from '../exp';\nimport {log1p} from '../log1p';\nimport {Reduction} from '../loss_ops_utils';\nimport {mul} from '../mul';\nimport {neg} from '../neg';\nimport {op} from '../operation';\nimport {relu} from '../relu';\nimport {scalar} from '../scalar';\nimport {sub} from '../sub';\n\nimport {computeWeightedLoss} from './compute_weighted_loss';\n\nfunction sigmoidCrossEntropyWithLogits_<T extends Tensor, O extends Tensor>(\n    labels: T|TensorLike, logits: T|TensorLike): O {\n  const $labels =\n      convertToTensor(labels, 'labels', 'sigmoidCrossEntropyWithLogits');\n  const $logits =\n      convertToTensor(logits, 'logits', 'sigmoidCrossEntropyWithLogits');\n  assertShapesMatch(\n      $labels.shape, $logits.shape, 'Error in sigmoidCrossEntropyWithLogits: ');\n\n  /**\n   * Implementation Details:\n   *\n   * For brevity, let `x = logits`, `z = labels`.  The logistic loss is\n   *     z * -log(sigmoid(x)) + (1 - z) * -log(1 - sigmoid(x))\n   *   = z * -log(1 / (1 + exp(-x))) + (1 - z) * -log(exp(-x) / (1 + exp(-x)))\n   *   = z * log(1 + exp(-x)) + (1 - z) * (-log(exp(-x)) + log(1 + exp(-x)))\n   *   = z * log(1 + exp(-x)) + (1 - z) * (x + log(1 + exp(-x))\n   *   = (1 - z) * x + log(1 + exp(-x))\n   *   = x - x * z + log(1 + exp(-x))\n   *\n   *   For x < 0, to avoid overflow in exp(-x), we reformulate the above\n   *     x - x * z + log(1 + exp(-x))\n   *   = log(exp(x)) - x * z + log(1 + exp(-x))\n   *   = - x * z + log(1 + exp(x))\n   *\n   * Hence, to ensure stability and avoid overflow, the implementation uses\n   * this equivalent formulation:\n   *     max(x, 0) - x * z + log(1 + exp(-abs(x)))\n   */\n  const maxOutput = relu($logits);\n  const outputXTarget = mul($logits, $labels);\n  const sigmoidOutput = log1p(exp(neg(abs($logits))));\n\n  return add(sub(maxOutput, outputXTarget), sigmoidOutput);\n}\n\n/**\n * Computes the sigmoid cross entropy loss between two tensors.\n *\n * If labelSmoothing is nonzero, smooth the labels towards 1/2:\n *\n *   newMulticlassLabels = multiclassLabels * (1 - labelSmoothing)\n *                         + 0.5 * labelSmoothing\n *\n * @param multiClassLabels The ground truth output tensor of shape\n * [batch_size, num_classes], same dimensions as 'predictions'.\n * @param logits The predicted outputs.\n * @param weights Tensor whose rank is either 0, or the same rank as\n *    `labels`, and must be broadcastable to `labels` (i.e., all dimensions\n *    must be either `1`, or the same as the corresponding `losses`\n *    dimension).\n * @param labelSmoothing If greater than 0, then smooth the labels.\n * @param reduction Type of reduction to apply to loss. Should be of type\n *    `Reduction`\n *\n * @doc { heading: 'Training', subheading: 'Losses', namespace: 'losses' }\n */\nfunction sigmoidCrossEntropy_<T extends Tensor, O extends Tensor>(\n    multiClassLabels: T|TensorLike, logits: T|TensorLike,\n    weights?: Tensor|TensorLike, labelSmoothing = 0,\n    reduction = Reduction.SUM_BY_NONZERO_WEIGHTS): O {\n  let $multiClassLabels = convertToTensor(\n      multiClassLabels, 'multiClassLabels', 'sigmoidCrossEntropy');\n  const $logits = convertToTensor(logits, 'logits', 'sigmoidCrossEntropy');\n  let $weights: Tensor = null;\n  if (weights != null) {\n    $weights = convertToTensor(weights, 'weights', 'sigmoidCrossEntropy');\n  }\n  assertShapesMatch(\n      $multiClassLabels.shape, $logits.shape, 'Error in sigmoidCrossEntropy: ');\n\n  if (labelSmoothing > 0) {\n    const labelSmoothingScalar = scalar(labelSmoothing);\n    const one = scalar(1);\n    const half = scalar(0.5);\n\n    $multiClassLabels =\n        add(mul($multiClassLabels, sub(one, labelSmoothingScalar)),\n            mul(half, labelSmoothingScalar));\n  }\n  const losses = sigmoidCrossEntropyWithLogits_($multiClassLabels, $logits);\n\n  return computeWeightedLoss(losses, $weights, reduction);\n}\n\nexport const sigmoidCrossEntropy = /* @__PURE__ */ op({sigmoidCrossEntropy_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {customGrad} from '../../gradients';\nimport {Tensor} from '../../tensor';\nimport {GradSaveFunc} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {assertShapesMatch} from '../../util';\nimport {add} from '../add';\nimport {expandShapeToKeepDim} from '../axis_util';\nimport {cast} from '../cast';\nimport {div} from '../div';\nimport {exp} from '../exp';\nimport {logSumExp} from '../log_sum_exp';\nimport {Reduction} from '../loss_ops_utils';\nimport {mul} from '../mul';\nimport {neg} from '../neg';\nimport {op} from '../operation';\nimport {reshape} from '../reshape';\nimport {scalar} from '../scalar';\nimport {sub} from '../sub';\nimport {sum} from '../sum';\n\nimport {computeWeightedLoss} from './compute_weighted_loss';\n\n/**\n * Computes softmax cross entropy between logits and labels.\n *\n * Measures the probability error in discrete classification tasks in which\n * the classes are mutually exclusive (each entry is in exactly one class).\n * For example, each CIFAR-10 image is labeled with one and only one label: an\n * image can be a dog or a truck, but not both.\n *\n * `NOTE`: While the classes are mutually exclusive, their probabilities need\n * not be. All that is required is that each row of labels is a valid\n * probability distribution. If they are not, the computation of the gradient\n * will be incorrect.\n *\n * `WARNING`: This op expects unscaled logits, since it performs a softmax on\n * logits internally for efficiency. Do not call this op with the output of\n * softmax, as it will produce incorrect results.\n *\n * logits and labels must have the same shape, e.g. [batch_size, num_classes]\n * and the same dtype.\n * @param labels The labels array.\n * @param logits The logits array.\n * @param dim The dimension softmax would be performed on. Defaults to `-1`\n *     which indicates the last dimension.\n */\nfunction softmaxCrossEntropyWithLogits_<T extends Tensor, O extends Tensor>(\n    labels: T, logits: T, dim = -1): O {\n  if (dim === -1) {\n    dim = logits.rank - 1;\n  }\n\n  if (dim !== logits.rank - 1) {\n    throw Error(\n        `Softmax cross entropy along a non-last dimension is not yet ` +\n        `supported. Labels / logits was rank ${logits.rank} ` +\n        `and dim was ${dim}`);\n  }\n  // Use a custom gradient for numerical stability.\n  const customOp =\n      customGrad((labels: Tensor, logits: Tensor, save: GradSaveFunc) => {\n        // Reference:\n        //   1. http://cs231n.github.io/linear-classify/#softmax\n        //   2. https://blog.feedly.com/tricks-of-the-trade-logsumexp/\n        const keepDims = true;\n        const lse = logSumExp(logits, [dim], keepDims);\n        const logResult = sub(cast(logits, 'float32'), lse);\n        save([labels, logResult]);\n\n        const costVector = neg(mul(logResult, labels));\n        const value: O = sum(costVector, [dim]);\n\n        const gradFunc = (dy: O, saved: Tensor[]) => {\n          const [labels, logResult] = saved;\n          const dyShape = expandShapeToKeepDim(dy.shape, [dim]);\n          return [\n            mul(reshape(dy, dyShape),\n                sub(cast(labels, 'float32'), exp(logResult))),\n            mul(reshape(dy, dyShape),\n                sub(exp(logResult), cast(labels, 'float32'))),\n          ];\n        };\n        return {value, gradFunc};\n      });\n\n  return customOp(labels, logits);\n}\n\n/**\n * Computes the softmax cross entropy loss between two tensors.\n *\n * If labelSmoothing is nonzero, smooth the labels towards 1/2:\n *\n *   newOnehotLabels = onehotLabels * (1 - labelSmoothing)\n *                         + labelSmoothing / numClasses\n *\n * @param onehotLabels One hot encoded labels\n *    [batch_size, num_classes], same dimensions as 'predictions'.\n * @param logits The predicted outputs.\n * @param weights Tensor whose rank is either 0, or 1, and must be\n *    broadcastable to `loss`  of shape [batch_size]\n * @param labelSmoothing If greater than 0, then smooth the labels.\n * @param reduction Type of reduction to apply to loss. Should be of type\n *    `Reduction`\n *\n * @doc { heading: 'Training', subheading: 'Losses', namespace: 'losses' }\n */\nfunction softmaxCrossEntropy_<T extends Tensor, O extends Tensor>(\n    onehotLabels: T|TensorLike, logits: T|TensorLike,\n    weights?: Tensor|TensorLike, labelSmoothing = 0,\n    reduction = Reduction.SUM_BY_NONZERO_WEIGHTS): O {\n  let $onehotLabels =\n      convertToTensor(onehotLabels, 'onehotLabels', 'softmaxCrossEntropy');\n  const $logits = convertToTensor(logits, 'logits', 'softmaxCrossEntropy');\n  let $weights: Tensor = null;\n\n  if (weights != null) {\n    $weights = convertToTensor(weights, 'weights', 'softmaxCrossEntropy');\n  }\n\n  assertShapesMatch(\n      $onehotLabels.shape, $logits.shape, 'Error in softmaxCrossEntropy: ');\n\n  if (labelSmoothing > 0) {\n    const labelSmoothingScalar = scalar(labelSmoothing);\n    const one = scalar(1);\n    const numClasses = scalar($onehotLabels.shape[1]);\n\n    $onehotLabels =\n        add(mul($onehotLabels, sub(one, labelSmoothingScalar)),\n            div(labelSmoothingScalar, numClasses));\n  }\n\n  const losses = softmaxCrossEntropyWithLogits_($onehotLabels, $logits);\n\n  return computeWeightedLoss(losses, $weights, reduction);\n}\n\nexport const softmaxCrossEntropy = /* @__PURE__ */ op({softmaxCrossEntropy_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {SparseFillEmptyRows, SparseFillEmptyRowsInputs} from '../../kernel_names';\nimport {Scalar, Tensor, Tensor1D, Tensor2D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {ScalarLike, TensorLike} from '../../types';\nimport {op} from '../operation';\n\n/**\n * The input SparseTensor is represented via the map of inputs {`indices`,\n * `values`, `denseShape`}. The output SparseTensor has the same `denseShape`\n * but with indices `outputIndices` and values `outputValues`. This op inserts a\n * single entry for every row that doesn't have any values. The index is created\n * as `[row, 0, ..., 0]` and the inserted value is `defaultValue`.\n *\n * For example, suppose `spInput` has shape [5, 6] and non-empty values:\n * [0, 1]: a\n * [0, 3]: b\n * [2, 0]: c\n * [3, 1]: d\n *\n * Rows 1 and 4 are empty, so the output will be of shape [5, 6] with values:\n * [0, 1]: a\n * [0, 3]: b\n * [1, 0]: `defaultValue`\n * [2, 0]: c\n * [3, 1]: d\n * [4, 0]: `defaultValue`\n *\n * The output SparseTensor will be in row-major order and will have the same\n * shape as the input.\n *\n * This op also returns an indicator vector shaped [dense_shape[0]] such that\n * emptyRowIndicator[i] = True iff row i was an empty row.\n *\n * And a reverse index map vector shaped [indices.shape[0]] that is used during\n * backpropagation, reverseIndexMap[i] = outi s.t. indices[i, j] ==\n * outputIndices[outi, j] for all j\n *\n * ```js\n * const result = tf.sparse.sparseFillEmptyRows(\n *   [[0, 0], [1, 0], [1, 3], [1, 4], [3, 2], [3, 3]],\n *   [0, 10, 13, 14, 32, 33], [5, 6], -1);\n * console.log(result);\n * result['outputIndices'].print(); // [[0, 0], [1, 0], [1, 3], [1, 4],\n *                                  //  [2, 0], [3, 2], [3, 3], [4, 0]]\n * result['outputValues'].print(); // [0, 10, 13, 14,-1, 32, 33, -1]\n * result['emptyRowIndicator'].print(); // [false, false, true, false, true]\n * result['reverseIndexMap'].print(); // [0, 1, 2, 3, 5, 6]\n * ```\n * @param indices: 2-D. The indices of the sparse tensor.\n * @param values: 1-D. The values of the sparse tensor.\n * @param denseShape: 1-D. The shape of the sparse tensor.\n * @param defaultValue: 0-D. Default value to insert into location [row, 0, ...,\n *     0] for rows missing from the input sparse tensor.\n * @return A map with the following properties:\n *     - outputIndices\n *     - outputValues: 1-D. The values of the filled sparse tensor.\n *     - emptyRowIndicator: 1-D. Whether the dense row was missing in the input\n * sparse tensor.\n *     - reverseIndexMap: 1-D. A map from the input indices to the output\n * indices.\n * @doc {heading: 'Operations', subheading: 'Sparse'}\n */\nfunction sparseFillEmptyRows_(\n    indices: Tensor2D|TensorLike, values: Tensor1D|TensorLike,\n    denseShape: Tensor1D|TensorLike,\n    defaultValue: Scalar|ScalarLike): NamedTensorMap {\n  const $indices =\n      convertToTensor(indices, 'indices', 'sparseFillEmptyRows', 'int32');\n  const $values = convertToTensor(values, 'values', 'sparseFillEmptyRows');\n  const $denseShape =\n      convertToTensor(denseShape, 'denseShape', 'sparseFillEmptyRows', 'int32');\n  const $defaultValue = convertToTensor(\n      defaultValue, 'defaultValue', 'sparseFillEmptyRows', $values.dtype);\n\n  if ($indices.rank !== 2) {\n    throw new Error(`Indices should be Tensor2D but received shape\n        ${$indices.shape}`);\n  }\n  if ($values.rank !== 1) {\n    throw new Error(\n        `Values should be Tensor1D but received shape ${$values.shape}`);\n  }\n  if ($denseShape.rank !== 1) {\n    throw new Error(`Dense shape should be Tensor1D but received shape ${\n        $denseShape.shape}`);\n  }\n  if ($defaultValue.rank !== 0) {\n    throw new Error(`Default value should be a scalar but received shape ${\n        $defaultValue.shape}`);\n  }\n\n  const inputs: SparseFillEmptyRowsInputs = {\n    indices: $indices,\n    values: $values,\n    denseShape: $denseShape,\n    defaultValue: $defaultValue\n  };\n\n  const result: Tensor[] = ENGINE.runKernel(SparseFillEmptyRows, inputs as {});\n  return {\n    outputIndices: result[0],\n    outputValues: result[1],\n    emptyRowIndicator: result[2],\n    reverseIndexMap: result[3]\n  };\n}\n\nexport const sparseFillEmptyRows = /* @__PURE__ */ op({sparseFillEmptyRows_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {SparseReshape, SparseReshapeInputs} from '../../kernel_names';\nimport {Tensor, Tensor1D, Tensor2D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {op} from '../operation';\n\n/**\n * This operation has the same semantics as reshape on the represented dense\n * tensor. The `inputIndices` are recomputed based on the requested `newShape`.\n * If one component of `newShape` is the special value -1, the size of that\n * dimension is computed so that the total dense size remains constant. At most\n * one component of `newShape` can be -1. The number of dense elements implied\n * by `newShape` must be the same as the number of dense elements originally\n * implied by `inputShape`. Reshaping does not affect the order of values in the\n * SparseTensor. If the input tensor has rank R_in and N non-empty values, and\n * `newShape` has length R_out, then `inputIndices` has shape [N, R_in],\n * `inputShape` has length R_in, `outputIndices` has shape [N, R_out], and\n * `outputShape` has length R_out.\n *\n * ```js\n * const result = tf.sparse.sparseReshape(\n *   [[0, 0, 0], [0, 0, 1], [0, 1, 0], [1, 0, 0], [1, 2, 3]],\n *   [2, 3, 6], [9, -1]);\n * console.log(result);\n * result['outputIndices'].print(); //[[0, 0], [0, 1], [1, 2], [4, 2], [8, 1]]\n * result['outputShape'].print(); // [9, 4]\n * ```\n * @param inputIndices: 2-D. N x R_in matrix with the indices of non-empty\n * values in a SparseTensor.\n * @param inputShape: 1-D. R_in Tensor1D with the input SparseTensor's dense\n * shape.\n * @param newShape: 1-D. R_out Tensor1D with the requested new dense shape.\n * @return A map with the following properties:\n *     - outputIndices: 2-D. N x R_out matrix with the updated indices of\n *       non-empty values in the output SparseTensor.\n *     - outputShape: 1-D. R_out vector with the full dense shape of the output\n *       SparseTensor. This is the same as newShape but with any -1 dimensions\n *        filled in.\n * @doc {heading: 'Operations', subheading: 'Sparse'}\n */\nfunction sparseReshape_(\n    inputIndices: Tensor2D|TensorLike, inputShape: Tensor1D|TensorLike,\n    newShape: Tensor1D|TensorLike): NamedTensorMap {\n  const $inputIndices =\n      convertToTensor(inputIndices, 'inputIndices', 'sparseReshape', 'int32');\n  const $inputShape =\n      convertToTensor(inputShape, 'inputShape', 'sparseReshape', 'int32');\n  const $newShape =\n      convertToTensor(newShape, 'newShape', 'sparseReshape', 'int32');\n\n  if ($inputIndices.rank !== 2) {\n    throw new Error(`Input indices should be Tensor2D but received shape\n        ${$inputIndices.shape}`);\n  }\n  if ($inputShape.rank !== 1) {\n    throw new Error(`Input shape should be Tensor1D but received shape ${\n        $inputShape.shape}`);\n  }\n  if ($newShape.rank !== 1) {\n    throw new Error(\n        `New shape should be Tensor1D but received shape ${$newShape.shape}`);\n  }\n\n  const inputs: SparseReshapeInputs = {\n    inputIndices: $inputIndices,\n    inputShape: $inputShape,\n    newShape: $newShape\n  };\n  const result: Tensor[] = ENGINE.runKernel(SparseReshape, inputs as {});\n  return {outputIndices: result[0], outputShape: result[1]};\n}\n\nexport const sparseReshape = /* @__PURE__ */ op({sparseReshape_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {SparseSegmentMean, SparseSegmentMeanInputs} from '../../kernel_names';\nimport {Tensor, Tensor1D} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {op} from '../operation';\n\n/**\n * Computes the mean along sparse segments of a tensor.\n *\n * ```js\n * const c = tf.tensor2d([[1,2,3,4], [-1,-2,-3,-4], [6,7,8,9]]);\n * // Select two rows, one segment.\n * const result1 = tf.sparse.sparseSegmentMean(c,\n *                                           tf.tensor1d([0, 1], 'int32'),\n *                                           tf.tensor1d([0, 0], 'int32'));\n * result1.print(); // [[0, 0, 0, 0]]\n *\n * // Select two rows, two segments.\n * const result2 = tf.sparse.sparseSegmentMean(c,\n *                                             tf.tensor1d([0, 1], 'int32'),\n *                                             tf.tensor1d([0, 1], 'int32'));\n * result2.print(); // [[1, 2, 3, 4], [-1, -2, -3, -4]]\n *\n * // Select all rows, two segments.\n * const result3 = tf.sparse.sparseSegmentMean(c,\n *                                             tf.tensor1d([0, 1, 2], 'int32'),\n *                                             tf.tensor1d([0, 1, 1], 'int32'));\n * result3.print(); // [[1.0, 2.0, 3.0, 4.0], [2.5, 2.5, 2.5, 2.5]]\n * ```\n * @param data: A Tensor of at least one dimension with data that will be\n *     assembled in the output.\n * @param indices: A 1-D Tensor with indices into data. Has same rank as\n *     segmentIds.\n * @param segmentIds: A 1-D Tensor with indices into the output Tensor. Values\n *     should be sorted and can be repeated.\n * @return Has same shape as data, except for dimension 0 which has equal to\n *         the number of segments.\n *\n * @doc {heading: 'Operations', subheading: 'Sparse'}\n */\nfunction sparseSegmentMean_(\n    data: Tensor|TensorLike, indices: Tensor1D|TensorLike,\n    segmentIds: Tensor1D|TensorLike): Tensor {\n  const $data = convertToTensor(data, 'data', 'sparseSegmentMean');\n  const $indices =\n      convertToTensor(indices, 'indices', 'sparseSegmentMean', 'int32');\n  const $segmentIds =\n      convertToTensor(segmentIds, 'segmentIds', 'sparseSegmentMean', 'int32');\n\n  if ($data.rank < 1) {\n    throw new Error(\n        `Data should be at least 1 dimensional but received scalar`);\n  }\n  if ($indices.rank !== 1) {\n    throw new Error(`Indices should be Tensor1D but received shape\n          ${$indices.shape}`);\n  }\n  if ($segmentIds.rank !== 1) {\n    throw new Error(`Segment ids should be Tensor1D but received shape\n          ${$segmentIds.shape}`);\n  }\n\n  const inputs: SparseSegmentMeanInputs = {\n    data: $data,\n    indices: $indices,\n    segmentIds: $segmentIds\n  };\n\n  return ENGINE.runKernel(SparseSegmentMean, inputs as {});\n}\n\nexport const sparseSegmentMean = /* @__PURE__ */ op({sparseSegmentMean_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {SparseSegmentSum, SparseSegmentSumInputs} from '../../kernel_names';\nimport {Tensor, Tensor1D} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {op} from '../operation';\n\n/**\n * Computes the sum along sparse segments of a tensor.\n *\n * ```js\n * const c = tf.tensor2d([[1,2,3,4], [-1,-2,-3,-4], [5,6,7,8]]);\n * // Select two rows, one segment.\n * const result1 = tf.sparse.sparseSegmentSum(c,\n *                                           tf.tensor1d([0, 1], 'int32'),\n *                                           tf.tensor1d([0, 0], 'int32'));\n * result1.print(); // [[0, 0, 0, 0]]\n *\n * // Select two rows, two segments.\n * const result2 = tf.sparse.sparseSegmentSum(c,\n *                                           tf.tensor1d([0, 1], 'int32'),\n *                                           tf.tensor1d([0, 1], 'int32'));\n * result2.print(); // [[1, 2, 3, 4], [-1, -2, -3, -4]]\n *\n * // Select all rows, two segments.\n * const result3 = tf.sparse.sparseSegmentSum(c,\n *                                           tf.tensor1d([0, 1, 2], 'int32'),\n *                                           tf.tensor1d([0, 0, 1], 'int32'));\n * result3.print(); // [[0, 0, 0, 0], [5, 6, 7, 8]]\n * ```\n * @param data: A Tensor of at least one dimension with data that will be\n *     assembled in the output.\n * @param indices: A 1-D Tensor with indices into data. Has same rank as\n *     segmentIds.\n * @param segmentIds: A 1-D Tensor with indices into the output Tensor. Values\n *     should be sorted and can be repeated.\n * @return Has same shape as data, except for dimension 0 which has equal to\n *         the number of segments.\n *\n * @doc {heading: 'Operations', subheading: 'Sparse'}\n */\nfunction sparseSegmentSum_(\n    data: Tensor|TensorLike, indices: Tensor1D|TensorLike,\n    segmentIds: Tensor1D|TensorLike): Tensor {\n  const $data = convertToTensor(data, 'data', 'sparseSegmentSum');\n  const $indices =\n      convertToTensor(indices, 'indices', 'sparseSegmentSum', 'int32');\n  const $segmentIds =\n      convertToTensor(segmentIds, 'segmentIds', 'sparseSegmentSum', 'int32');\n\n  if ($data.rank < 1) {\n    throw new Error(\n        `Data should be at least 1 dimensional but received scalar`);\n  }\n  if ($indices.rank !== 1) {\n    throw new Error(`Indices should be Tensor1D but received shape\n         ${$indices.shape}`);\n  }\n  if ($segmentIds.rank !== 1) {\n    throw new Error(`Segment ids should be Tensor1D but received shape\n         ${$segmentIds.shape}`);\n  }\n\n  const inputs: SparseSegmentSumInputs = {\n    data: $data,\n    indices: $indices,\n    segmentIds: $segmentIds\n  };\n\n  return ENGINE.runKernel(SparseSegmentSum, inputs as {});\n}\n\nexport const sparseSegmentSum = /* @__PURE__ */ op({sparseSegmentSum_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {StringNGrams, StringNGramsAttrs, StringNGramsInputs} from '../../kernel_names';\nimport {Tensor, Tensor1D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {op} from '../operation';\n\n/**\n * Creates ngrams from ragged string data.\n *\n * This op accepts a ragged tensor with 1 ragged dimension containing only\n * strings and outputs a ragged tensor with 1 ragged dimension containing ngrams\n * of that string, joined along the innermost axis.\n *\n * ```js\n * const result = tf.string.stringNGrams(\n *   ['a', 'b', 'c', 'd'], tf.tensor1d([0, 2, 4], 'int32'),\n *   '|', [1, 2], 'LP', 'RP', -1, false);\n * result['nGrams'].print(); // ['a', 'b', 'LP|a', 'a|b', 'b|RP',\n *                           //  'c', 'd', 'LP|c', 'c|d', 'd|RP']\n * result['nGramsSplits'].print(); // [0, 5, 10]\n * ```\n * @param data: The values tensor of the ragged string tensor to make ngrams out\n *     of. Must be a 1D string tensor.\n * @param dataSplits: The splits tensor of the ragged string tensor to make\n *     ngrams out of.\n * @param separator: The string to append between elements of the token. Use \"\"\n *     for no separator.\n * @param nGramWidths: The sizes of the ngrams to create.\n * @param leftPad: The string to use to pad the left side of the ngram sequence.\n *     Only used if pad_width !== 0.\n * @param rightPad: The string to use to pad the right side of the ngram\n *     sequence. Only used if pad_width !== 0.\n * @param padWidth: The number of padding elements to add to each side of each\n *     sequence. Note that padding will never be greater than `nGramWidths`-1\n *     regardless of this value. If `padWidth`=-1, then add max(`nGramWidths`)-1\n *     elements.\n * @param preserveShortSequences: If true, then ensure that at least one ngram\n *     is generated for each input sequence. In particular, if an input sequence\n *     is shorter than min(ngramWidth) + 2*padWidth, then generate a single\n *     ngram containing the entire sequence. If false, then no ngrams are\n *     generated for these short input sequences.\n * @return A map with the following properties:\n *     - nGrams: The values tensor of the output ngrams ragged tensor.\n *     - nGramsSplits: The splits tensor of the output ngrams ragged tensor.\n *\n * @doc {heading: 'Operations', subheading: 'String'}\n */\nfunction stringNGrams_(\n    data: Tensor1D|TensorLike, dataSplits: Tensor|TensorLike, separator: string,\n    nGramWidths: number[], leftPad: string, rightPad: string, padWidth: number,\n    preserveShortSequences: boolean): NamedTensorMap {\n  const $data = convertToTensor(data, 'data', 'stringNGrams', 'string');\n  if ($data.dtype !== 'string') {\n    throw new Error('Data must be of datatype string');\n  }\n  if ($data.shape.length !== 1) {\n    throw new Error(`Data must be a vector, saw: ${$data.shape}`);\n  }\n\n  const $dataSplits = convertToTensor(dataSplits, 'dataSplits', 'stringNGrams');\n  if ($dataSplits.dtype !== 'int32') {\n    throw new Error('Data splits must be of datatype int32');\n  }\n\n  const attrs: StringNGramsAttrs = {\n    separator,\n    nGramWidths,\n    leftPad,\n    rightPad,\n    padWidth,\n    preserveShortSequences\n  };\n\n  const inputs: StringNGramsInputs = {data: $data, dataSplits: $dataSplits};\n  const result: Tensor[] =\n      ENGINE.runKernel(StringNGrams, inputs as {}, attrs as {});\n  return {nGrams: result[0], nGramsSplits: result[1]};\n}\n\nexport const stringNGrams = /* @__PURE__ */ op({stringNGrams_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {StringSplit, StringSplitAttrs, StringSplitInputs} from '../../kernel_names';\nimport {Scalar, Tensor, Tensor1D} from '../../tensor';\nimport {NamedTensorMap} from '../../tensor_types';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {ScalarLike, TensorLike} from '../../types';\nimport {op} from '../operation';\n\n/**\n * Split elements of `input` based on `delimiter` into a SparseTensor .\n *\n * Let N be the size of source (typically N will be the batch size). Split each\n * element of `input` based on `delimiter` and return a SparseTensor containing\n * the splitted tokens. Empty tokens are ignored if `skipEmpty` is set to True.\n *\n * `delimiter` can be empty, or a string of split characters. If `delimiter` is\n * an empty string, each element of `input` is split into individual\n * character strings. Otherwise every character of `delimiter` is a potential\n * split point.\n *\n * ```js\n * const result = tf.string.stringSplit(['hello world',  'a b c'], ' ');\n * result['indices'].print(); // [[0, 0], [0, 1], [1, 0], [1, 1], [1, 2]]\n * result['values'].print(); // ['hello', 'world', 'a', 'b', 'c']\n * result['shape'].print(); // [2, 3]\n * ```\n * @param input: 1-D. Strings to split.\n * @param delimiter: 0-D. Delimiter characters, or empty string.\n * @param skipEmpty: Optional. If true, skip the empty strings from the result.\n *     Defaults to true.\n * @return A map with the following properties:\n *     - indices: A dense matrix of int32 representing the indices of the sparse\n *       tensor.\n *     - values: A vector of strings corresponding to the splited values.\n *     - shape: a length-2 vector of int32 representing the shape of the sparse\n * tensor, where the first value is N and the second value is the maximum number\n * of tokens in a single input entry.\n *\n * @doc {heading: 'Operations', subheading: 'String'}\n */\nfunction stringSplit_(\n    input: Tensor1D|TensorLike, delimiter: Scalar|ScalarLike,\n    skipEmpty = true): NamedTensorMap {\n  const $input = convertToTensor(input, 'input', 'stringSplit', 'string');\n  const $delimiter =\n      convertToTensor(delimiter, 'delimiter', 'stringSplit', 'string');\n\n  if ($input.rank !== 1) {\n    throw new Error(\n        `Input should be Tensor1D but received shape ${$input.shape}`);\n  }\n  if ($delimiter.rank !== 0) {\n    throw new Error(\n        `Delimiter should be a scalar but received shape ${$delimiter.shape}`);\n  }\n\n  const attrs: StringSplitAttrs = {skipEmpty};\n  const inputs: StringSplitInputs = {input: $input, delimiter: $delimiter};\n  const result: Tensor[] =\n      ENGINE.runKernel(StringSplit, inputs as {}, attrs as {});\n  return {indices: result[0], values: result[1], shape: result[2]};\n}\n\nexport const stringSplit = /* @__PURE__ */ op({stringSplit_});\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {StringToHashBucketFast, StringToHashBucketFastAttrs, StringToHashBucketFastInputs} from '../../kernel_names';\nimport {Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {op} from '../operation';\n\n/**\n * Converts each string in the input Tensor to its hash mod by a number of\n * buckets.\n *\n * The hash function is deterministic on the content of the string within the\n * process and will never change. However, it is not suitable for cryptography.\n * This function may be used when CPU time is scarce and inputs are trusted or\n * unimportant. There is a risk of adversaries constructing inputs that all hash\n * to the same bucket.\n *\n * ```js\n * const result = tf.string.stringToHashBucketFast(\n *   ['Hello', 'TensorFlow', '2.x'], 3);\n * result.print(); // [0, 2, 2]\n * ```\n * @param input: The strings to assign a hash bucket.\n * @param numBuckets: The number of buckets.\n * @return A Tensor of the same shape as the input tensor.\n *\n * @doc {heading: 'Operations', subheading: 'String'}\n */\nfunction stringToHashBucketFast_(\n    input: Tensor|TensorLike, numBuckets: number): Tensor {\n  const $input =\n      convertToTensor(input, 'input', 'stringToHashBucketFast', 'string');\n  const attrs: StringToHashBucketFastAttrs = {numBuckets};\n\n  if (numBuckets <= 0) {\n    throw new Error(`Number of buckets must be at least 1`);\n  }\n\n  const inputs: StringToHashBucketFastInputs = {input: $input};\n  return ENGINE.runKernel(StringToHashBucketFast, inputs as {}, attrs as {});\n}\n\nexport const stringToHashBucketFast = /* @__PURE__ */ op({stringToHashBucketFast_});\n", "/**\n * @license\n * Copyright 2023 Google LLC.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ENGINE} from '../../engine';\nimport {StaticRegexReplace, StaticRegexReplaceAttrs} from '../../kernel_names';\nimport {NamedAttrMap} from '../../kernel_registry';\nimport {Tensor} from '../../tensor';\nimport {convertToTensor} from '../../tensor_util_env';\nimport {TensorLike} from '../../types';\nimport {op} from '../operation';\n\n/**\n * Replace the match of a `pattern` in `input` with `rewrite`.\n *\n * ```js\n * const result = tf.string.staticRegexReplace(\n *     ['format       this   spacing      better'], ' +', ' ');\n * result.print(); // ['format this spacing better']\n * ```\n * @param input: A Tensor of type string. The text to be processed.\n * @param pattern: A string. The regular expression to match the input.\n * @param rewrite: A string. The rewrite to be applied to the matched\n *     expression.\n * @param replaceGlobal: An optional bool. Defaults to True. If True, the\n *     replacement is global, otherwise the replacement is done only on the\n *     first match.\n * @return A Tensor of type string.\n *\n * @doc {heading: 'Operations', subheading: 'String'}\n */\nfunction staticRegexReplace_(\n  input: Tensor | TensorLike, pattern: string, rewrite: string,\n  replaceGlobal=true): Tensor {\n\n  const $input = convertToTensor(input, 'input', 'staticRegexReplace',\n                                 'string');\n  const attrs: StaticRegexReplaceAttrs = {pattern, rewrite, replaceGlobal};\n  return ENGINE.runKernel(StaticRegexReplace, {x: $input},\n                          attrs as unknown as NamedAttrMap);\n}\n\nexport const staticRegexReplace = /* @__PURE__ */ op({staticRegexReplace_});\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n// Modularized ops.\nexport {abs} from './abs';\nexport {acos} from './acos';\nexport {acosh} from './acosh';\nexport {add} from './add';\nexport {addN} from './add_n';\nexport {all} from './all';\nexport {any} from './any';\nexport {argMax} from './arg_max';\nexport {argMin} from './arg_min';\nexport {asin} from './asin';\nexport {asinh} from './asinh';\nexport {atan} from './atan';\nexport {atan2} from './atan2';\nexport {atanh} from './atanh';\nexport {avgPool} from './avg_pool';\nexport {avgPool3d} from './avg_pool_3d';\nexport {basicLSTMCell} from './basic_lstm_cell';\nexport {batchToSpaceND} from './batch_to_space_nd';\nexport {batchNorm} from './batchnorm';\nexport {batchNorm2d} from './batchnorm2d';\nexport {batchNorm3d} from './batchnorm3d';\nexport {batchNorm4d} from './batchnorm4d';\nexport {bincount} from './bincount';\nexport {bitwiseAnd} from './bitwise_and';\nexport {broadcastArgs} from './broadcast_args';\nexport {broadcastTo} from './broadcast_to';\nexport {buffer} from './buffer';\nexport {cast} from './cast';\nexport {ceil} from './ceil';\nexport {clipByValue} from './clip_by_value';\nexport {clone} from './clone';\nexport {complex} from './complex';\nexport {concat} from './concat';\nexport {concat1d} from './concat_1d';\nexport {concat2d} from './concat_2d';\nexport {concat3d} from './concat_3d';\nexport {concat4d} from './concat_4d';\nexport {conv1d} from './conv1d';\nexport {conv2d} from './conv2d';\nexport {conv2dTranspose} from './conv2d_transpose';\nexport {conv3d} from './conv3d';\nexport {conv3dTranspose} from './conv3d_transpose';\nexport {cos} from './cos';\nexport {cosh} from './cosh';\nexport {cumprod} from './cumprod';\nexport {cumsum} from './cumsum';\nexport {denseBincount} from './dense_bincount';\nexport {depthToSpace} from './depth_to_space';\nexport {depthwiseConv2d} from './depthwise_conv2d';\nexport {diag} from './diag';\nexport {dilation2d} from './dilation2d';\nexport {div} from './div';\nexport {divNoNan} from './div_no_nan';\nexport {dot} from './dot';\nexport {einsum} from './einsum';\nexport {elu} from './elu';\nexport {ensureShape} from './ensure_shape';\nexport {equal} from './equal';\nexport {erf} from './erf';\nexport {euclideanNorm} from './euclidean_norm';\nexport {exp} from './exp';\nexport {expandDims} from './expand_dims';\nexport {expm1} from './expm1';\nexport {eye} from './eye';\nexport {fill} from './fill';\nexport {floor} from './floor';\nexport {floorDiv} from './floorDiv';\nexport {gather} from './gather';\nexport {greater} from './greater';\nexport {greaterEqual} from './greater_equal';\nexport {imag} from './imag';\nexport {isFinite} from './is_finite';\nexport {isInf} from './is_inf';\nexport {isNaN} from './is_nan';\nexport {leakyRelu} from './leaky_relu';\nexport {less} from './less';\nexport {lessEqual} from './less_equal';\nexport {linspace} from './linspace';\nexport {localResponseNormalization} from './local_response_normalization';\nexport {log} from './log';\nexport {log1p} from './log1p';\nexport {logSigmoid} from './log_sigmoid';\nexport {logSoftmax} from './log_softmax';\nexport {logSumExp} from './log_sum_exp';\nexport {logicalAnd} from './logical_and';\nexport {logicalNot} from './logical_not';\nexport {logicalOr} from './logical_or';\nexport {logicalXor} from './logical_xor';\nexport {lowerBound} from './lower_bound';\nexport {matMul} from './mat_mul';\nexport {max} from './max';\nexport {maxPool} from './max_pool';\nexport {maxPool3d} from './max_pool_3d';\nexport {maxPoolWithArgmax} from './max_pool_with_argmax';\nexport {maximum} from './maximum';\nexport {mean} from './mean';\nexport {meshgrid} from './meshgrid';\nexport {min} from './min';\nexport {minimum} from './minimum';\nexport {mirrorPad} from './mirror_pad';\nexport {mod} from './mod';\nexport {moments} from './moments';\nexport {mul} from './mul';\nexport {LSTMCellFunc, multiRNNCell} from './multi_rnn_cell';\nexport {multinomial} from './multinomial';\nexport {neg} from './neg';\nexport {notEqual} from './not_equal';\nexport {oneHot} from './one_hot';\nexport {ones} from './ones';\nexport {onesLike} from './ones_like';\nexport {outerProduct} from './outer_product';\nexport {pad} from './pad';\nexport {pad1d} from './pad1d';\nexport {pad2d} from './pad2d';\nexport {pad3d} from './pad3d';\nexport {pad4d} from './pad4d';\nexport {pool} from './pool';\nexport {pow} from './pow';\nexport {prelu} from './prelu';\nexport {print} from './print';\nexport {prod} from './prod';\nexport {raggedGather} from './ragged_gather';\nexport {raggedRange} from './ragged_range';\nexport {raggedTensorToTensor} from './ragged_tensor_to_tensor';\nexport {rand} from './rand';\nexport {randomGamma} from './random_gamma';\nexport {randomNormal} from './random_normal';\nexport {randomStandardNormal} from './random_standard_normal';\nexport {randomUniform} from './random_uniform';\nexport {randomUniformInt} from './random_uniform_int';\nexport {range} from './range';\nexport {real} from './real';\nexport {reciprocal} from './reciprocal';\nexport {relu} from './relu';\nexport {relu6} from './relu6';\nexport {reshape} from './reshape';\nexport {reverse} from './reverse';\nexport {reverse1d} from './reverse_1d';\nexport {reverse2d} from './reverse_2d';\nexport {reverse3d} from './reverse_3d';\nexport {reverse4d} from './reverse_4d';\nexport {round} from './round';\nexport {rsqrt} from './rsqrt';\nexport {scalar} from './scalar';\nexport {selu} from './selu';\nexport {separableConv2d} from './separable_conv2d';\nexport {setdiff1dAsync} from './setdiff1d_async';\nexport {sigmoid} from './sigmoid';\nexport {sign} from './sign';\nexport {sin} from './sin';\nexport {sinh} from './sinh';\nexport {slice} from './slice';\nexport {slice1d} from './slice1d';\nexport {slice2d} from './slice2d';\nexport {slice3d} from './slice3d';\nexport {slice4d} from './slice4d';\nexport {softmax} from './softmax';\nexport {softplus} from './softplus';\nexport {spaceToBatchND} from './space_to_batch_nd';\nexport {fft} from './spectral/fft';\nexport {ifft} from './spectral/ifft';\nexport {irfft} from './spectral/irfft';\nexport {rfft} from './spectral/rfft';\nexport {split} from './split';\nexport {sqrt} from './sqrt';\nexport {square} from './square';\nexport {squaredDifference} from './squared_difference';\nexport {squeeze} from './squeeze';\nexport {stack} from './stack';\nexport {step} from './step';\nexport {stridedSlice} from './strided_slice';\nexport {sub} from './sub';\nexport {sum} from './sum';\nexport {tan} from './tan';\nexport {tanh} from './tanh';\nexport {tensor} from './tensor';\nexport {tensor1d} from './tensor1d';\nexport {tensor2d} from './tensor2d';\nexport {tensor3d} from './tensor3d';\nexport {tensor4d} from './tensor4d';\nexport {tensor5d} from './tensor5d';\nexport {tensor6d} from './tensor6d';\nexport {tensorScatterUpdate} from './tensor_scatter_update';\nexport {tile} from './tile';\nexport {topk} from './topk';\nexport {truncatedNormal} from './truncated_normal';\nexport {unique} from './unique';\nexport {unsortedSegmentSum} from './unsorted_segment_sum';\nexport {unstack} from './unstack';\nexport {upperBound} from './upper_bound';\nexport {variable} from './variable';\nexport {where} from './where';\nexport {whereAsync} from './where_async';\nexport {zeros} from './zeros';\nexport {zerosLike} from './zeros_like';\n\nexport * from './boolean_mask';\nexport * from './transpose';\nexport * from './norm';\nexport * from './moving_average';\nexport * from './scatter_nd';\nexport * from './search_sorted';\nexport * from './sparse_to_dense';\nexport * from './gather_nd';\nexport * from './dropout';\nexport * from './signal_ops_util';\nexport * from './in_top_k';\n\nexport {op, OP_SCOPE_SUFFIX} from './operation';\n\nimport {rfft} from './spectral/rfft';\nimport {fft} from './spectral/fft';\nimport {ifft} from './spectral/ifft';\nimport {irfft} from './spectral/irfft';\nconst spectral = {\n  fft,\n  ifft,\n  rfft,\n  irfft\n};\n\nimport * as fused from './fused_ops';\n\nimport {hammingWindow} from './signal/hamming_window';\nimport {hannWindow} from './signal/hann_window';\nimport {frame} from './signal/frame';\nimport {stft} from './signal/stft';\nconst signal = {\n  hammingWindow,\n  hannWindow,\n  frame,\n  stft,\n};\n\n// Image Ops namespace\nimport {cropAndResize} from './image/crop_and_resize';\nimport {flipLeftRight} from './image/flip_left_right';\nimport {grayscaleToRGB} from './image/grayscale_to_rgb';\nimport {rgbToGrayscale} from './image/rgb_to_grayscale';\nimport {rotateWithOffset} from './image/rotate_with_offset';\nimport {nonMaxSuppression} from './image/non_max_suppression';\nimport {nonMaxSuppressionAsync} from './image/non_max_suppression_async';\nimport {nonMaxSuppressionWithScore} from './image/non_max_suppression_with_score';\nimport {nonMaxSuppressionWithScoreAsync} from './image/non_max_suppression_with_score_async';\nimport {nonMaxSuppressionPadded} from './image/non_max_suppression_padded';\nimport {nonMaxSuppressionPaddedAsync} from './image/non_max_suppression_padded_async';\nimport {resizeBilinear} from './image/resize_bilinear';\nimport {resizeNearestNeighbor} from './image/resize_nearest_neighbor';\nimport {threshold} from './image/threshold';\nimport {transform} from './image/transform';\nconst image = {\n  flipLeftRight,\n  grayscaleToRGB,\n  resizeNearestNeighbor,\n  resizeBilinear,\n  rgbToGrayscale,\n  rotateWithOffset,\n  cropAndResize,\n  nonMaxSuppression,\n  nonMaxSuppressionAsync,\n  nonMaxSuppressionWithScore,\n  nonMaxSuppressionWithScoreAsync,\n  nonMaxSuppressionPadded,\n  nonMaxSuppressionPaddedAsync,\n  threshold,\n  transform\n};\n\n// linalg namespace\nimport {bandPart} from './linalg/band_part';\nimport {gramSchmidt} from './linalg/gram_schmidt';\nimport {qr} from './linalg/qr';\nconst linalg = {\n  bandPart,\n  gramSchmidt,\n  qr\n};\n\n// losses namespace;\nimport {absoluteDifference} from './losses/absolute_difference';\nimport {computeWeightedLoss} from './losses/compute_weighted_loss';\nimport {cosineDistance} from './losses/cosine_distance';\nimport {hingeLoss} from './losses/hinge_loss';\nimport {huberLoss} from './losses/huber_loss';\nimport {logLoss} from './losses/log_loss';\nimport {meanSquaredError} from './losses/mean_squared_error';\nimport {sigmoidCrossEntropy} from './losses/sigmoid_cross_entropy';\nimport {softmaxCrossEntropy} from './losses/softmax_cross_entropy';\nconst losses = {\n  absoluteDifference,\n  computeWeightedLoss,\n  cosineDistance,\n  hingeLoss,\n  huberLoss,\n  logLoss,\n  meanSquaredError,\n  sigmoidCrossEntropy,\n  softmaxCrossEntropy\n};\n\nimport {sparseFillEmptyRows} from './sparse/sparse_fill_empty_rows';\nimport {sparseReshape} from './sparse/sparse_reshape';\nimport {sparseSegmentMean} from './sparse/sparse_segment_mean';\nimport {sparseSegmentSum} from './sparse/sparse_segment_sum';\nconst sparse = {\n  sparseFillEmptyRows,\n  sparseReshape,\n  sparseSegmentMean,\n  sparseSegmentSum\n};\n\nimport {stringNGrams} from './string/string_n_grams';\nimport {stringSplit} from './string/string_split';\nimport {stringToHashBucketFast} from './string/string_to_hash_bucket_fast';\nimport {staticRegexReplace} from './string/static_regex_replace';\n// tslint:disable-next-line:variable-name\nconst string = {\n  stringNGrams,\n  stringSplit,\n  stringToHashBucketFast,\n  staticRegexReplace,\n};\n\n// Second level exports.\nexport {image, linalg, losses, spectral, fused, signal, sparse, string};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/**\n * This file exports ops used by the converters executors. By default it\n * re-exports all ops. In a custom build this is aliased to a file that will\n * only exports ops for a given model.json.\n */\nexport * from './ops';\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '@tensorflow/tfjs-core';\n// tslint:disable-next-line: no-imports-from-dist\nimport * as tfOps from '@tensorflow/tfjs-core/dist/ops/ops_for_converter';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport {InternalOpExecutor, Node} from '../types';\n\nimport {getParamValue} from './utils';\n\nexport const executeOp: InternalOpExecutor =\n    (node: Node, tensorMap: NamedTensorsMap,\n     context: ExecutionContext, ops = tfOps): Tensor[] => {\n      switch (node.op) {\n        case 'BiasAdd':\n        case 'AddV2':\n        case 'Add': {\n          return [ops.add(\n              (getParamValue('a', node, tensorMap, context) as Tensor),\n              getParamValue('b', node, tensorMap, context) as Tensor)];\n        }\n        case 'AddN': {\n          return [ops.addN((\n              getParamValue('tensors', node, tensorMap, context) as Tensor[]))];\n        }\n        case 'FloorMod':\n        case 'Mod':\n          return [ops.mod(\n              getParamValue('a', node, tensorMap, context) as Tensor,\n              getParamValue('b', node, tensorMap, context) as Tensor)];\n        case 'Mul':\n          return [ops.mul(\n              getParamValue('a', node, tensorMap, context) as Tensor,\n              getParamValue('b', node, tensorMap, context) as Tensor)];\n        case 'RealDiv':\n        case 'Div': {\n          return [ops.div(\n              getParamValue('a', node, tensorMap, context) as Tensor,\n              getParamValue('b', node, tensorMap, context) as Tensor)];\n        }\n        case 'DivNoNan': {\n          return [ops.divNoNan(\n              getParamValue('a', node, tensorMap, context) as Tensor,\n              getParamValue('b', node, tensorMap, context) as Tensor)];\n        }\n        case 'FloorDiv': {\n          return [ops.floorDiv(\n              getParamValue('a', node, tensorMap, context) as Tensor,\n              getParamValue('b', node, tensorMap, context) as Tensor)];\n        }\n        case 'Sub': {\n          return [ops.sub(\n              getParamValue('a', node, tensorMap, context) as Tensor,\n              getParamValue('b', node, tensorMap, context) as Tensor)];\n        }\n        case 'Minimum': {\n          return [ops.minimum(\n              getParamValue('a', node, tensorMap, context) as Tensor,\n              getParamValue('b', node, tensorMap, context) as Tensor)];\n        }\n        case 'Maximum': {\n          return [ops.maximum(\n              getParamValue('a', node, tensorMap, context) as Tensor,\n              getParamValue('b', node, tensorMap, context) as Tensor)];\n        }\n        case 'Pow': {\n          return [ops.pow(\n              getParamValue('a', node, tensorMap, context) as Tensor,\n              getParamValue('b', node, tensorMap, context) as Tensor)];\n        }\n        case 'SquaredDifference': {\n          return [ops.squaredDifference(\n              getParamValue('a', node, tensorMap, context) as Tensor,\n              getParamValue('b', node, tensorMap, context) as Tensor)];\n        }\n        default:\n          throw TypeError(`Node type ${node.op} is not implemented`);\n      }\n    };\n\nexport const CATEGORY = 'arithmetic';\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '@tensorflow/tfjs-core';\n// tslint:disable-next-line: no-imports-from-dist\nimport * as tfOps from '@tensorflow/tfjs-core/dist/ops/ops_for_converter';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport {InternalOpExecutor, Node} from '../types';\n\nimport {getParamValue, getTensor} from './utils';\n\nexport const executeOp: InternalOpExecutor =\n    (node: Node, tensorMap: NamedTensorsMap, context: ExecutionContext,\n     ops = tfOps): Tensor[] => {\n      switch (node.op) {\n        case 'Abs':\n        case 'ComplexAbs':\n          return [ops.abs(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Acos':\n          return [ops.acos(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Acosh':\n          return [ops.acosh(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Asin':\n          return [ops.asin(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Asinh':\n          return [ops.asinh(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Atan':\n          return [ops.atan(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Atan2':\n          return [ops.atan2(\n              getParamValue('x', node, tensorMap, context) as Tensor,\n              getParamValue('y', node, tensorMap, context) as Tensor)];\n        case 'Atanh':\n          return [ops.atanh(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Ceil':\n          return [ops.ceil(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Complex':\n          return [ops.complex(\n              getParamValue('real', node, tensorMap, context) as Tensor,\n              getParamValue('imag', node, tensorMap, context) as Tensor)];\n        case 'Cos':\n          return [ops.cos(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Cosh':\n          return [ops.cosh(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Elu':\n          return [ops.elu(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Erf':\n          return [ops.erf(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Exp':\n          return [ops.exp(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Expm1': {\n          return [ops.expm1(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        }\n        case 'Floor':\n          return [ops.floor(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Log':\n          return [ops.log(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Log1p': {\n          return [ops.log1p(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        }\n        case 'Imag':\n          return [ops.imag(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n\n        case 'Neg':\n          return [ops.neg(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Reciprocal': {\n          return [ops.reciprocal(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        }\n        case 'Real':\n          return [ops.real(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Relu':\n          return [ops.relu(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Round': {\n          return [ops.round(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        }\n        case 'Selu':\n          return [ops.selu(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Sigmoid':\n          return [ops.sigmoid(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Sin':\n          return [ops.sin(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Sign': {\n          return [ops.sign(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        }\n        case 'Sinh': {\n          return [ops.sinh(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        }\n        case 'Softplus': {\n          return [ops.softplus(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        }\n        case 'Sqrt': {\n          return [ops.sqrt(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        }\n        case 'Square': {\n          return [ops.square(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        }\n        case 'Tanh': {\n          return [ops.tanh(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        }\n        case 'Tan':\n          return [ops.tan(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'ClipByValue':\n          return [ops.clipByValue(\n              getParamValue('x', node, tensorMap, context) as Tensor,\n              getParamValue('clipValueMin', node, tensorMap, context) as number,\n              getParamValue('clipValueMax', node, tensorMap, context) as\n                  number)];\n        case 'Relu6':\n          return [ops.relu6(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        case 'Rsqrt':\n          return [ops.rsqrt(getTensor(node.inputNames[0], tensorMap, context))];\n        case 'LeakyRelu':\n          return [ops.leakyRelu(\n              getParamValue('x', node, tensorMap, context) as Tensor,\n              getParamValue('alpha', node, tensorMap, context) as number)];\n        case 'Prelu':\n          return [ops.prelu(\n              getParamValue('x', node, tensorMap, context) as Tensor,\n              getParamValue('alpha', node, tensorMap, context) as Tensor)];\n        case 'IsNan':\n          return [ops.isNaN(getTensor(node.inputNames[0], tensorMap, context))];\n        case 'IsInf':\n          return [ops.isInf(getTensor(node.inputNames[0], tensorMap, context))];\n        case 'IsFinite':\n          return [ops.isFinite(\n              getTensor(node.inputNames[0], tensorMap, context))];\n        default:\n          throw TypeError(`Node type ${node.op} is not implemented`);\n      }\n    };\n\nexport const CATEGORY = 'basic_math';\n", "\n/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n/**\n * This differs from util.assertShapesMatch in that it allows values of\n * negative one, an undefined size of a dimensinon, in a shape to match\n * anything.\n */\n\nimport {Tensor, util} from '@tensorflow/tfjs-core';\n\n/**\n * Used by TensorList and TensorArray to verify if elementShape matches, support\n * negative value as the dim shape.\n * @param shapeA\n * @param shapeB\n * @param errorMessagePrefix\n */\nexport function assertShapesMatchAllowUndefinedSize(\n    shapeA: number|number[], shapeB: number|number[],\n    errorMessagePrefix = ''): void {\n  // constant shape means unknown rank\n  if (typeof shapeA === 'number' || typeof shapeB === 'number') {\n    return;\n  }\n  util.assert(\n      shapeA.length === shapeB.length,\n      () => errorMessagePrefix + ` Shapes ${shapeA} and ${shapeB} must match`);\n  for (let i = 0; i < shapeA.length; i++) {\n    const dim0 = shapeA[i];\n    const dim1 = shapeB[i];\n    util.assert(\n        dim0 < 0 || dim1 < 0 || dim0 === dim1,\n        () =>\n            errorMessagePrefix + ` Shapes ${shapeA} and ${shapeB} must match`);\n  }\n}\n\nexport function fullDefinedShape(elementShape: number|number[]): boolean {\n  if (typeof elementShape === 'number' || elementShape.some(dim => dim < 0)) {\n    return false;\n  }\n  return true;\n}\n/**\n * Generate the output element shape from the list elementShape, list tensors\n * and input param.\n * @param listElementShape\n * @param tensors\n * @param elementShape\n */\nexport function inferElementShape(\n    listElementShape: number|number[], tensors: Tensor[],\n    elementShape: number|number[]): number[] {\n  let partialShape = mergeElementShape(listElementShape, elementShape);\n  const notfullDefinedShape = !fullDefinedShape(partialShape);\n  if (notfullDefinedShape && tensors.length === 0) {\n    throw new Error(\n        `Tried to calculate elements of an empty list` +\n        ` with non-fully-defined elementShape: ${partialShape}`);\n  }\n  if (notfullDefinedShape) {\n    tensors.forEach(tensor => {\n      partialShape = mergeElementShape(tensor.shape, partialShape);\n    });\n  }\n  if (!fullDefinedShape(partialShape)) {\n    throw new Error(`Non-fully-defined elementShape: ${partialShape}`);\n  }\n  return partialShape as number[];\n}\n\nexport function mergeElementShape(\n    elementShapeA: number|number[], elementShapeB: number|number[]): number|\n    number[] {\n  if (typeof elementShapeA === 'number') {\n    return elementShapeB;\n  }\n  if (typeof elementShapeB === 'number') {\n    return elementShapeA;\n  }\n\n  if (elementShapeA.length !== elementShapeB.length) {\n    throw new Error(`Incompatible ranks during merge: ${elementShapeA} vs. ${\n        elementShapeB}`);\n  }\n\n  const result: number[] = [];\n  for (let i = 0; i < elementShapeA.length; ++i) {\n    const dim0 = elementShapeA[i];\n    const dim1 = elementShapeB[i];\n    if (dim0 >= 0 && dim1 >= 0 && dim0 !== dim1) {\n      throw new Error(`Incompatible shape during merge: ${elementShapeA} vs. ${\n          elementShapeB}`);\n    }\n    result[i] = dim0 >= 0 ? dim0 : dim1;\n  }\n  return result;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {concat, DataType, keep, reshape, scalar, slice, stack, Tensor, tensor, tidy, unstack} from '@tensorflow/tfjs-core';\n\nimport {assertShapesMatchAllowUndefinedSize} from './tensor_utils';\n\nexport interface TensorWithState {\n  tensor?: Tensor;\n  written?: boolean;\n  read?: boolean;\n  cleared?: boolean;\n}\n/**\n * The TensorArray object keeps an array of Tensors.  It\n * allows reading from the array and writing to the array.\n */\nexport class TensorArray {\n  private tensors: TensorWithState[] = [];\n  private closed_ = false;\n  readonly idTensor: Tensor;\n  constructor(\n      readonly name: string, readonly dtype: DataType, private maxSize: number,\n      private elementShape: number[], readonly identicalElementShapes: boolean,\n      readonly dynamicSize: boolean, readonly clearAfterRead: boolean) {\n    this.idTensor = scalar(0);\n    keep(this.idTensor);\n  }\n\n  get id() {\n    return this.idTensor.id;\n  }\n\n  get closed() {\n    return this.closed_;\n  }\n\n  /**\n   * Dispose the tensors and idTensor and mark the TensoryArray as closed.\n   */\n  clearAndClose(keepIds?: Set<number>) {\n    this.tensors.forEach(tensor => {\n      if (keepIds == null || !keepIds.has(tensor.tensor.id)) {\n        tensor.tensor.dispose();\n      }\n    });\n    this.tensors = [];\n    this.closed_ = true;\n    this.idTensor.dispose();\n  }\n\n  size(): number {\n    return this.tensors.length;\n  }\n\n  /**\n   * Read the value at location index in the TensorArray.\n   * @param index Number the index to read from.\n   */\n  read(index: number): Tensor {\n    if (this.closed_) {\n      throw new Error(`TensorArray ${this.name} has already been closed.`);\n    }\n\n    if (index < 0 || index >= this.size()) {\n      throw new Error(`Tried to read from index ${index}, but array size is: ${\n          this.size()}`);\n    }\n\n    const tensorWithState = this.tensors[index];\n    if (tensorWithState.cleared) {\n      throw new Error(\n          `TensorArray ${this.name}: Could not read index ${\n              index} twice because it was cleared after a previous read ` +\n          `(perhaps try setting clear_after_read = false?).`);\n    }\n\n    if (this.clearAfterRead) {\n      tensorWithState.cleared = true;\n    }\n\n    tensorWithState.read = true;\n    return tensorWithState.tensor;\n  }\n\n  /**\n   * Helper method to read multiple tensors from the specified indices.\n   */\n  readMany(indices: number[]): Tensor[] {\n    return indices.map(index => this.read(index));\n  }\n\n  /**\n   * Write value into the index of the TensorArray.\n   * @param index number the index to write to.\n   * @param tensor\n   */\n  write(index: number, tensor: Tensor) {\n    if (this.closed_) {\n      throw new Error(`TensorArray ${this.name} has already been closed.`);\n    }\n\n    if (index < 0 || !this.dynamicSize && index >= this.maxSize) {\n      throw new Error(`Tried to write to index ${\n          index}, but array is not resizeable and size is: ${this.maxSize}`);\n    }\n\n    const t = this.tensors[index] || {};\n\n    if (tensor.dtype !== this.dtype) {\n      throw new Error(`TensorArray ${\n          this.name}: Could not write to TensorArray index ${index},\n          because the value dtype is ${\n          tensor.dtype}, but TensorArray dtype is ${this.dtype}.`);\n    }\n\n    // Set the shape for the first time write to unknow shape tensor array\n    if (this.size() === 0 &&\n        (this.elementShape == null || this.elementShape.length === 0)) {\n      this.elementShape = tensor.shape;\n    }\n\n    assertShapesMatchAllowUndefinedSize(\n        this.elementShape, tensor.shape,\n        `TensorArray ${this.name}: Could not write to TensorArray index ${\n            index}.`);\n\n    if (t.read) {\n      throw new Error(\n          `TensorArray ${this.name}: Could not write to TensorArray index ${\n              index}, because it has already been read.`);\n    }\n\n    if (t.written) {\n      throw new Error(\n          `TensorArray ${this.name}: Could not write to TensorArray index ${\n              index}, because it has already been written.`);\n    }\n\n    t.tensor = tensor;\n    keep(tensor);\n    t.written = true;\n\n    this.tensors[index] = t;\n  }\n\n  /**\n   * Helper method to write multiple tensors to the specified indices.\n   */\n  writeMany(indices: number[], tensors: Tensor[]) {\n    if (indices.length !== tensors.length) {\n      throw new Error(\n          `TensorArray ${this.name}: could not write multiple tensors,` +\n          `because the index size: ${\n              indices.length} is not the same as tensors size: ${\n              tensors.length}.`);\n    }\n\n    indices.forEach((i, index) => this.write(i, tensors[index]));\n  }\n\n  /**\n   * Return selected values in the TensorArray as a packed Tensor. All of\n   * selected values must have been written and their shapes must all match.\n   * @param [indices] number[] Optional. Taking values in [0, max_value). If the\n   *    TensorArray is not dynamic, max_value=size(). If not specified returns\n   *    all tensors in the original order.\n   * @param [dtype]\n   */\n  gather(indices?: number[], dtype?: DataType): Tensor {\n    if (!!dtype && dtype !== this.dtype) {\n      throw new Error(`TensorArray dtype is ${\n          this.dtype} but gather requested dtype ${dtype}`);\n    }\n\n    if (!indices) {\n      indices = [];\n      for (let i = 0; i < this.size(); i++) {\n        indices.push(i);\n      }\n    } else {\n      indices = indices.slice(0, this.size());\n    }\n\n    if (indices.length === 0) {\n      return tensor([], [0].concat(this.elementShape));\n    }\n\n    // Read all the PersistentTensors into a vector to keep track of\n    // their memory.\n    const tensors = this.readMany(indices);\n\n    assertShapesMatchAllowUndefinedSize(\n        this.elementShape, tensors[0].shape, 'TensorArray shape mismatch: ');\n\n    return stack(tensors, 0);\n  }\n\n  /**\n   * Return the values in the TensorArray as a concatenated Tensor.\n   */\n  concat(dtype?: DataType): Tensor {\n    if (!!dtype && dtype !== this.dtype) {\n      throw new Error(`TensorArray dtype is ${\n          this.dtype} but concat requested dtype ${dtype}`);\n    }\n\n    if (this.size() === 0) {\n      return tensor([], [0].concat(this.elementShape));\n    }\n\n    const indices = [];\n    for (let i = 0; i < this.size(); i++) {\n      indices.push(i);\n    }\n    // Collect all the tensors from the tensors array.\n    const tensors = this.readMany(indices);\n\n    assertShapesMatchAllowUndefinedSize(\n        this.elementShape, tensors[0].shape,\n        `TensorArray shape mismatch: tensor array shape (${\n            this.elementShape}) vs first tensor shape (${tensors[0].shape})`);\n\n    return concat(tensors, 0);\n  }\n\n  /**\n   * Scatter the values of a Tensor in specific indices of a TensorArray.\n   * @param indices number[] values in [0, max_value). If the\n   *    TensorArray is not dynamic, max_value=size().\n   * @param tensor Tensor input tensor.\n   */\n  scatter(indices: number[], tensor: Tensor) {\n    if (tensor.dtype !== this.dtype) {\n      throw new Error(`TensorArray dtype is ${\n          this.dtype} but tensor has dtype ${tensor.dtype}`);\n    }\n\n    if (indices.length !== tensor.shape[0]) {\n      throw new Error(`Expected len(indices) == tensor.shape[0], but saw: ${\n          indices.length} vs. ${tensor.shape[0]}`);\n    }\n\n    const maxIndex = Math.max(...indices);\n\n    if (!this.dynamicSize && maxIndex >= this.maxSize) {\n      throw new Error(\n          `Max index must be < array size (${maxIndex}  vs. ${this.maxSize})`);\n    }\n\n    this.writeMany(indices, unstack(tensor, 0));\n  }\n\n  /**\n   * Split the values of a Tensor into the TensorArray.\n   * @param length number[] with the lengths to use when splitting value along\n   *    its first dimension.\n   * @param tensor Tensor, the tensor to split.\n   */\n  split(length: number[], tensor: Tensor) {\n    if (tensor.dtype !== this.dtype) {\n      throw new Error(`TensorArray dtype is ${\n          this.dtype} but tensor has dtype ${tensor.dtype}`);\n    }\n    let totalLength = 0;\n    const cumulativeLengths = length.map(len => {\n      totalLength += len;\n      return totalLength;\n    });\n\n    if (totalLength !== tensor.shape[0]) {\n      throw new Error(`Expected sum of lengths to be equal to\n          tensor.shape[0], but sum of lengths is\n        ${totalLength}, and tensor's shape is: ${tensor.shape}`);\n    }\n\n    if (!this.dynamicSize && length.length !== this.maxSize) {\n      throw new Error(\n          `TensorArray's size is not equal to the size of lengths (${\n              this.maxSize} vs. ${length.length}), ` +\n          'and the TensorArray is not marked as dynamically resizeable');\n    }\n\n    const elementPerRow = totalLength === 0 ? 0 : tensor.size / totalLength;\n    const tensors: Tensor[] = [];\n    tidy(() => {\n      tensor = reshape(tensor, [1, totalLength, elementPerRow]);\n      for (let i = 0; i < length.length; ++i) {\n        const previousLength = (i === 0) ? 0 : cumulativeLengths[i - 1];\n        const indices = [0, previousLength, 0];\n        const sizes = [1, length[i], elementPerRow];\n        tensors[i] = reshape(slice(tensor, indices, sizes), this.elementShape);\n      }\n      return tensors;\n    });\n    const indices = [];\n    for (let i = 0; i < length.length; i++) {\n      indices[i] = i;\n    }\n    this.writeMany(indices, tensors);\n  }\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {concat, DataType, keep, reshape, scalar, slice, stack, Tensor, tensor, tidy, unstack} from '@tensorflow/tfjs-core';\n\nimport {assertShapesMatchAllowUndefinedSize, inferElementShape, mergeElementShape} from './tensor_utils';\n\n/**\n * TensorList stores a container of `tf.Tensor` objects, which are accessible\n * via tensors field.\n *\n * In order to get a copy of the underlying list, use the copy method:\n * ```\n *    TensorList b = a.copy();\n *    b.tensors().pushBack(t);  // This does not modify a.tensors().\n * ```\n *\n * Note that this is not a deep copy: the memory locations of the underlying\n * tensors will still point to the same locations of the corresponding tensors\n * in the original.\n */\n\nexport class TensorList {\n  readonly idTensor: Tensor;\n  maxNumElements: number;\n\n  get id() {\n    return this.idTensor.id;\n  }\n  /**\n   *\n   * @param tensors list of tensors\n   * @param elementShape shape of each tensor, this can be a single number (any\n   * shape is allowed) or partial shape (dim = -1).\n   * @param elementDtype data type of each tensor\n   * @param maxNumElements The maximum allowed size of `tensors`. Defaults to -1\n   *   meaning that the size of `tensors` is unbounded.\n   */\n  constructor(\n      readonly tensors: Tensor[], readonly elementShape: number|number[],\n      readonly elementDtype: DataType, maxNumElements = -1) {\n    if (tensors != null) {\n      tensors.forEach(tensor => {\n        if (elementDtype !== tensor.dtype) {\n          throw new Error(`Invalid data types; op elements ${\n              elementDtype}, but list elements ${tensor.dtype}`);\n        }\n        assertShapesMatchAllowUndefinedSize(\n            elementShape, tensor.shape, 'TensorList shape mismatch: ');\n\n        keep(tensor);\n      });\n    }\n    this.idTensor = scalar(0);\n    this.maxNumElements = maxNumElements;\n    keep(this.idTensor);\n  }\n\n  /**\n   * Get a new TensorList containing a copy of the underlying tensor container.\n   */\n  copy(): TensorList {\n    return new TensorList(\n        [...this.tensors], this.elementShape, this.elementDtype);\n  }\n\n  /**\n   * Dispose the tensors and idTensor and clear the tensor list.\n   */\n  clearAndClose(keepIds?: Set<number>) {\n    this.tensors.forEach(tensor => {\n      if (keepIds == null || !keepIds.has(tensor.id)) {\n        tensor.dispose();\n      }\n    });\n    this.tensors.length = 0;\n    this.idTensor.dispose();\n  }\n  /**\n   * The size of the tensors in the tensor list.\n   */\n  size() {\n    return this.tensors.length;\n  }\n\n  /**\n   * Return a tensor that stacks a list of rank-R tf.Tensors into one rank-(R+1)\n   * tf.Tensor.\n   * @param elementShape shape of each tensor\n   * @param elementDtype data type of each tensor\n   * @param numElements the number of elements to stack\n   */\n  stack(elementShape: number[], elementDtype: DataType, numElements = -1):\n      Tensor {\n    if (elementDtype !== this.elementDtype) {\n      throw new Error(`Invalid data types; op elements ${\n          elementDtype}, but list elements ${this.elementDtype}`);\n    }\n    if (numElements !== -1 && this.tensors.length !== numElements) {\n      throw new Error(`Operation expected a list with ${\n          numElements} elements but got a list with ${\n          this.tensors.length} elements.`);\n    }\n    assertShapesMatchAllowUndefinedSize(\n        elementShape, this.elementShape, 'TensorList shape mismatch: ');\n    const outputElementShape =\n        inferElementShape(this.elementShape, this.tensors, elementShape);\n    return tidy(() => {\n      const reshapedTensors =\n          this.tensors.map(tensor => reshape(tensor, outputElementShape));\n      return stack(reshapedTensors, 0);\n    });\n  }\n\n  /**\n   * Pop a tensor from the end of the list.\n   * @param elementShape shape of the tensor\n   * @param elementDtype data type of the tensor\n   */\n  popBack(elementShape: number[], elementDtype: DataType): Tensor {\n    if (elementDtype !== this.elementDtype) {\n      throw new Error(`Invalid data types; op elements ${\n          elementDtype}, but list elements ${this.elementDtype}`);\n    }\n\n    if (this.size() === 0) {\n      throw new Error('Trying to pop from an empty list.');\n    }\n    const outputElementShape =\n        inferElementShape(this.elementShape, this.tensors, elementShape);\n    const tensor = this.tensors.pop();\n    tensor.kept = false;\n\n    assertShapesMatchAllowUndefinedSize(\n        tensor.shape, elementShape, 'TensorList shape mismatch: ');\n\n    return reshape(tensor, outputElementShape);\n  }\n\n  /**\n   * Push a tensor to the end of the list.\n   * @param tensor Tensor to be pushed.\n   */\n  pushBack(tensor: Tensor) {\n    if (tensor.dtype !== this.elementDtype) {\n      throw new Error(`Invalid data types; op elements ${\n          tensor.dtype}, but list elements ${this.elementDtype}`);\n    }\n\n    assertShapesMatchAllowUndefinedSize(\n        tensor.shape, this.elementShape, 'TensorList shape mismatch: ');\n\n    if (this.maxNumElements === this.size()) {\n      throw new Error(`Trying to push element into a full list.`);\n    }\n    keep(tensor);\n    this.tensors.push(tensor);\n  }\n\n  /**\n   * Update the size of the list.\n   * @param size the new size of the list.\n   */\n  resize(size: number) {\n    if (size < 0) {\n      throw new Error(\n          `TensorListResize expects size to be non-negative. Got: ${size}`);\n    }\n\n    if (this.maxNumElements !== -1 && size > this.maxNumElements) {\n      throw new Error(`TensorListResize input size ${\n          size} is greater maxNumElement ${this.maxNumElements}.`);\n    }\n\n    const destTensorList: TensorList = new TensorList(\n        [], this.elementShape, this.elementDtype, this.maxNumElements);\n    destTensorList.tensors.length = size;\n    for (let i = 0; i < Math.min(this.tensors.length, size); ++i) {\n      destTensorList.tensors[i] = this.tensors[i];\n    }\n    return destTensorList;\n  }\n\n  /**\n   * Retrieve the element at the provided index\n   * @param elementShape shape of the tensor\n   * @param elementDtype dtype of the tensor\n   * @param elementIndex index of the tensor\n   */\n  getItem(elementIndex: number, elementShape: number[], elementDtype: DataType):\n      Tensor {\n    if (elementDtype !== this.elementDtype) {\n      throw new Error(`Invalid data types; op elements ${\n          elementDtype}, but list elements ${this.elementDtype}`);\n    }\n    if (elementIndex < 0 || elementIndex > this.tensors.length) {\n      throw new Error(`Trying to access element ${\n          elementIndex} in a list with ${this.tensors.length} elements.`);\n    }\n\n    if (this.tensors[elementIndex] == null) {\n      throw new Error(`element at index ${elementIndex} is null.`);\n    }\n\n    assertShapesMatchAllowUndefinedSize(\n        this.tensors[elementIndex].shape, elementShape,\n        'TensorList shape mismatch: ');\n    const outputElementShape =\n        inferElementShape(this.elementShape, this.tensors, elementShape);\n    return reshape(this.tensors[elementIndex], outputElementShape);\n  }\n\n  /**\n   * Set the tensor at the index\n   * @param elementIndex index of the tensor\n   * @param tensor the tensor to be inserted into the list\n   */\n  setItem(elementIndex: number, tensor: Tensor) {\n    if (tensor.dtype !== this.elementDtype) {\n      throw new Error(`Invalid data types; op elements ${\n          tensor.dtype}, but list elements ${this.elementDtype}`);\n    }\n\n    if (elementIndex < 0 ||\n        this.maxNumElements !== -1 && elementIndex >= this.maxNumElements) {\n      throw new Error(`Trying to set element ${\n          elementIndex} in a list with max ${this.maxNumElements} elements.`);\n    }\n\n    assertShapesMatchAllowUndefinedSize(\n        this.elementShape, tensor.shape, 'TensorList shape mismatch: ');\n    keep(tensor);\n\n    // dispose the previous value if it is replacing.\n    if (this.tensors[elementIndex] != null) {\n      this.tensors[elementIndex].kept = false;\n    }\n\n    this.tensors[elementIndex] = tensor;\n  }\n\n  /**\n   * Return selected values in the TensorList as a stacked Tensor. All of\n   * selected values must have been written and their shapes must all match.\n   * @param indices indices of tensors to gather\n   * @param elementDtype output tensor dtype\n   * @param elementShape output tensor element shape\n   */\n  gather(indices: number[], elementDtype: DataType, elementShape: number[]):\n      Tensor {\n    if (elementDtype !== this.elementDtype) {\n      throw new Error(`Invalid data types; op elements ${\n          elementDtype}, but list elements ${this.elementDtype}`);\n    }\n\n    assertShapesMatchAllowUndefinedSize(\n        this.elementShape, elementShape, 'TensorList shape mismatch: ');\n\n    // When indices is greater than the size of the list, indices beyond the\n    // size of the list are ignored.\n    indices = indices.slice(0, this.size());\n    const outputElementShape =\n        inferElementShape(this.elementShape, this.tensors, elementShape);\n    if (indices.length === 0) {\n      return tensor([], [0].concat(outputElementShape));\n    }\n\n    return tidy(() => {\n      const tensors =\n          indices.map(i => reshape(this.tensors[i], outputElementShape));\n      return stack(tensors, 0);\n    });\n  }\n\n  /**\n   * Return the values in the TensorList as a concatenated Tensor.\n   * @param elementDtype output tensor dtype\n   * @param elementShape output tensor element shape\n   */\n  concat(elementDtype: DataType, elementShape: number[]): Tensor {\n    if (!!elementDtype && elementDtype !== this.elementDtype) {\n      throw new Error(`TensorList dtype is ${\n          this.elementDtype} but concat requested dtype ${elementDtype}`);\n    }\n\n    assertShapesMatchAllowUndefinedSize(\n        this.elementShape, elementShape, 'TensorList shape mismatch: ');\n    const outputElementShape =\n        inferElementShape(this.elementShape, this.tensors, elementShape);\n\n    if (this.size() === 0) {\n      return tensor([], [0].concat(outputElementShape));\n    }\n    return tidy(() => {\n      const tensors = this.tensors.map(t => reshape(t, outputElementShape));\n      return concat(tensors, 0);\n    });\n  }\n}\n\n/**\n * Creates a TensorList which, when stacked, has the value of tensor.\n * @param tensor from tensor\n * @param elementShape output tensor element shape\n */\nexport function fromTensor(\n    tensor: Tensor, elementShape: number[], elementDtype: DataType) {\n  const dtype = tensor.dtype;\n  if (tensor.shape.length < 1) {\n    throw new Error(\n        `Tensor must be at least a vector, but saw shape: ${tensor.shape}`);\n  }\n  if (tensor.dtype !== elementDtype) {\n    throw new Error(`Invalid data types; op elements ${\n        tensor.dtype}, but list elements ${elementDtype}`);\n  }\n  const tensorElementShape = tensor.shape.slice(1);\n  assertShapesMatchAllowUndefinedSize(\n      tensorElementShape, elementShape, 'TensorList shape mismatch: ');\n  const tensorList: Tensor[] = unstack(tensor);\n  return new TensorList(tensorList, elementShape, dtype);\n}\n\n/**\n * Return a TensorList of the given size with empty elements.\n * @param elementShape the shape of the future elements of the list\n * @param elementDtype the desired type of elements in the list\n * @param numElements the number of elements to reserve\n * @param maxNumElements the maximum number of elements in th list\n */\nexport function reserve(\n    elementShape: number[], elementDtype: DataType, numElements: number,\n    maxNumElements: number) {\n  return new TensorList([], elementShape, elementDtype, maxNumElements);\n}\n\n/**\n * Put tensors at specific indices of a stacked tensor into a TensorList.\n * @param indices list of indices on how to scatter the tensor.\n * @param tensor input tensor.\n * @param elementShape the shape of the future elements of the list\n * @param numElements the number of elements to scatter\n */\nexport function scatter(\n    tensor: Tensor, indices: number[], elementShape: number[],\n    numElements?: number): TensorList {\n  if (indices.length !== tensor.shape[0]) {\n    throw new Error(`Expected len(indices) == tensor.shape[0], but saw: ${\n        indices.length} vs. ${tensor.shape[0]}`);\n  }\n\n  const maxIndex = Math.max(...indices);\n\n  if (numElements != null && numElements !== -1 && maxIndex >= numElements) {\n    throw new Error(\n        `Max index must be < array size (${maxIndex}  vs. ${numElements})`);\n  }\n\n  const list = new TensorList([], elementShape, tensor.dtype, numElements);\n  const tensors = unstack(tensor, 0);\n  indices.forEach((value, index) => {\n    list.setItem(value, tensors[index]);\n  });\n  return list;\n}\n\n/**\n * Split the values of a Tensor into a TensorList.\n * @param length the lengths to use when splitting value along\n *    its first dimension.\n * @param tensor the tensor to split.\n * @param elementShape the shape of the future elements of the list\n */\nexport function split(\n    tensor: Tensor, length: number[], elementShape: number[]) {\n  let totalLength = 0;\n  const cumulativeLengths = length.map(len => {\n    totalLength += len;\n    return totalLength;\n  });\n\n  if (totalLength !== tensor.shape[0]) {\n    throw new Error(`Expected sum of lengths to be equal to\n          tensor.shape[0], but sum of lengths is\n        ${totalLength}, and tensor's shape is: ${tensor.shape}`);\n  }\n\n  const shapeWithoutFirstDim = tensor.shape.slice(1);\n  const outputElementShape =\n      mergeElementShape(shapeWithoutFirstDim, elementShape);\n  const elementPerRow = totalLength === 0 ? 0 : tensor.size / totalLength;\n  const tensors: Tensor[] = tidy(() => {\n    const tensors = [];\n    tensor = reshape(tensor, [1, totalLength, elementPerRow]);\n    for (let i = 0; i < length.length; ++i) {\n      const previousLength = (i === 0) ? 0 : cumulativeLengths[i - 1];\n      const indices = [0, previousLength, 0];\n      const sizes = [1, length[i], elementPerRow];\n      tensors[i] = reshape(\n          slice(tensor, indices, sizes), outputElementShape as number[]);\n    }\n    tensor.dispose();\n    return tensors;\n  });\n\n  const list = new TensorList([], elementShape, tensor.dtype, length.length);\n\n  for (let i = 0; i < tensors.length; i++) {\n    list.setItem(i, tensors[i]);\n  }\n  return list;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {DataType, scalar, Tensor} from '@tensorflow/tfjs-core';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport {TensorArray} from '../../executor/tensor_array';\nimport {fromTensor, reserve, scatter, split} from '../../executor/tensor_list';\nimport {InternalOpAsyncExecutor, Node} from '../types';\n\nimport {cloneTensor, getParamValue, getTensor} from './utils';\n\nexport const executeOp: InternalOpAsyncExecutor = async(\n    node: Node, tensorMap: NamedTensorsMap,\n    context: ExecutionContext): Promise<Tensor[]> => {\n  switch (node.op) {\n    case 'If':\n    case 'StatelessIf': {\n      const thenFunc =\n          getParamValue('thenBranch', node, tensorMap, context) as string;\n      const elseFunc =\n          getParamValue('elseBranch', node, tensorMap, context) as string;\n      const cond = getParamValue('cond', node, tensorMap, context) as Tensor;\n      const args = getParamValue('args', node, tensorMap, context) as Tensor[];\n      const condValue = await cond.data();\n      if (condValue[0]) {\n        return context.functionMap[thenFunc].executeFunctionAsync(\n            args, context.tensorArrayMap, context.tensorListMap);\n      } else {\n        return context.functionMap[elseFunc].executeFunctionAsync(\n            args, context.tensorArrayMap, context.tensorListMap);\n      }\n    }\n    case 'While':\n    case 'StatelessWhile': {\n      const bodyFunc =\n          getParamValue('body', node, tensorMap, context) as string;\n      const condFunc =\n          getParamValue('cond', node, tensorMap, context) as string;\n      const args = getParamValue('args', node, tensorMap, context) as Tensor[];\n\n      // Calculate the condition of the loop\n      const condResult =\n          (await context.functionMap[condFunc].executeFunctionAsync(\n              args, context.tensorArrayMap, context.tensorListMap));\n      const argIds = args.map(tensor => tensor.id);\n      let condValue = await condResult[0].data();\n      // Dispose the intermediate tensors for condition function\n      condResult.forEach(tensor => {\n        if (!tensor.kept && argIds.indexOf(tensor.id) === -1) {\n          tensor.dispose();\n        }\n      });\n\n      let result: Tensor[] = args;\n\n      while (condValue[0]) {\n        // Record the previous result for intermediate tensor tracking\n        const origResult = result;\n        // Execution the body of the loop\n        result = await context.functionMap[bodyFunc].executeFunctionAsync(\n            result, context.tensorArrayMap, context.tensorListMap);\n        const resultIds = result.map(tensor => tensor.id);\n\n        // Dispose the intermediate tensor for body function that is not global\n        // kept, not input/output of the body function\n        origResult.forEach(tensor => {\n          if (!tensor.kept && argIds.indexOf(tensor.id) === -1 &&\n              resultIds.indexOf(tensor.id) === -1) {\n            tensor.dispose();\n          }\n        });\n\n        // Recalcuate the condition of the loop using the latest results.\n        const condResult =\n            (await context.functionMap[condFunc].executeFunctionAsync(\n                result, context.tensorArrayMap, context.tensorListMap));\n        condValue = await condResult[0].data();\n        // Dispose the intermediate tensors for condition function\n        condResult.forEach(tensor => {\n          if (!tensor.kept && argIds.indexOf(tensor.id) === -1 &&\n              resultIds.indexOf(tensor.id) === -1) {\n            tensor.dispose();\n          }\n        });\n      }\n      return result;\n    }\n    case 'LoopCond': {\n      const pred = getParamValue('pred', node, tensorMap, context) as Tensor;\n      return [cloneTensor(pred)];\n    }\n    case 'Switch': {\n      const pred = getParamValue('pred', node, tensorMap, context) as Tensor;\n      let data = getParamValue('data', node, tensorMap, context) as Tensor;\n      if (!data.kept) {\n        data = cloneTensor(data);\n      }\n      // Outputs nodes :0 => false, :1 => true\n      return (await pred.data())[0] ? [undefined, data] : [data, undefined];\n    }\n    case 'Merge': {\n      const inputName = node.inputNames.find(\n          name => getTensor(name, tensorMap, context) !== undefined);\n      if (inputName) {\n        const data = getTensor(inputName, tensorMap, context);\n        return [cloneTensor(data)];\n      }\n      return undefined;\n    }\n    case 'Enter': {\n      const frameId =\n          getParamValue('frameName', node, tensorMap, context) as string;\n      const data = getParamValue('tensor', node, tensorMap, context) as Tensor;\n      context.enterFrame(frameId);\n      return [cloneTensor(data)];\n    }\n    case 'Exit': {\n      const data = getParamValue('tensor', node, tensorMap, context) as Tensor;\n      context.exitFrame();\n      return [cloneTensor(data)];\n    }\n    case 'NextIteration': {\n      const data = getParamValue('tensor', node, tensorMap, context) as Tensor;\n      context.nextIteration();\n      return [cloneTensor(data)];\n    }\n    case 'TensorArrayV3': {\n      const size = getParamValue('size', node, tensorMap, context) as number;\n      const dtype =\n          getParamValue('dtype', node, tensorMap, context) as DataType;\n      const elementShape =\n          getParamValue('elementShape', node, tensorMap, context) as number[];\n      const dynamicSize =\n          getParamValue('dynamicSize', node, tensorMap, context) as boolean;\n      const clearAfterRead =\n          getParamValue('clearAfterRead', node, tensorMap, context) as boolean;\n      const identicalElementShapes =\n          getParamValue('identicalElementShapes', node, tensorMap, context) as\n          boolean;\n      const name = getParamValue('name', node, tensorMap, context) as string;\n      const tensorArray = new TensorArray(\n          name, dtype, size, elementShape, identicalElementShapes, dynamicSize,\n          clearAfterRead);\n      context.addTensorArray(tensorArray);\n      return [tensorArray.idTensor, scalar(1.0)];\n    }\n    case 'TensorArrayWriteV3': {\n      const id =\n          getParamValue('tensorArrayId', node, tensorMap, context) as Tensor;\n      const index = getParamValue('index', node, tensorMap, context) as number;\n      const writeTensor =\n          getParamValue('tensor', node, tensorMap, context) as Tensor;\n      const writeTensorArray = context.getTensorArray(id.id);\n      writeTensorArray.write(index, writeTensor);\n      return [writeTensorArray.idTensor];\n    }\n    case 'TensorArrayReadV3': {\n      const readId =\n          getParamValue('tensorArrayId', node, tensorMap, context) as Tensor;\n      const readIndex =\n          getParamValue('index', node, tensorMap, context) as number;\n      const readTensorArray = context.getTensorArray(readId.id);\n      return [readTensorArray.read(readIndex)];\n    }\n    case 'TensorArrayGatherV3': {\n      const gatherId =\n          getParamValue('tensorArrayId', node, tensorMap, context) as Tensor;\n      const gatherIndices =\n          getParamValue('indices', node, tensorMap, context) as number[];\n      const gatherDtype =\n          getParamValue('dtype', node, tensorMap, context) as DataType;\n      const gatherTensorArray = context.getTensorArray(gatherId.id);\n      return [gatherTensorArray.gather(gatherIndices, gatherDtype)];\n    }\n    case 'TensorArrayScatterV3': {\n      const scatterId =\n          getParamValue('tensorArrayId', node, tensorMap, context) as Tensor;\n      const scatterIndices =\n          getParamValue('indices', node, tensorMap, context) as number[];\n      const scatterTensor =\n          getParamValue('tensor', node, tensorMap, context) as Tensor;\n      const scatterTensorArray = context.getTensorArray(scatterId.id);\n      scatterTensorArray.scatter(scatterIndices, scatterTensor);\n      return [scatterTensorArray.idTensor];\n    }\n    case 'TensorArrayConcatV3': {\n      const concatId =\n          getParamValue('tensorArrayId', node, tensorMap, context) as Tensor;\n      const concatTensorArray = context.getTensorArray(concatId.id);\n      const concatDtype =\n          getParamValue('dtype', node, tensorMap, context) as DataType;\n      return [concatTensorArray.concat(concatDtype)];\n    }\n    case 'TensorArraySplitV3': {\n      const splitId =\n          getParamValue('tensorArrayId', node, tensorMap, context) as Tensor;\n      const splitTensor =\n          getParamValue('tensor', node, tensorMap, context) as Tensor;\n      const lengths =\n          getParamValue('lengths', node, tensorMap, context) as number[];\n      const splitTensorArray = context.getTensorArray(splitId.id);\n      splitTensorArray.split(lengths, splitTensor);\n      return [splitTensorArray.idTensor];\n    }\n    case 'TensorArraySizeV3': {\n      const sizeId =\n          getParamValue('tensorArrayId', node, tensorMap, context) as Tensor;\n      const sizeTensorArray = context.getTensorArray(sizeId.id);\n      return [scalar(sizeTensorArray.size(), 'int32')];\n    }\n    case 'TensorArrayCloseV3': {\n      const closeId =\n          getParamValue('tensorArrayId', node, tensorMap, context) as Tensor;\n      const closeTensorArray = context.getTensorArray(closeId.id);\n      closeTensorArray.clearAndClose();\n      return [closeTensorArray.idTensor];\n    }\n    case 'TensorListSetItem': {\n      const idTensor =\n          getParamValue('tensorListId', node, tensorMap, context) as Tensor;\n      const index = getParamValue('index', node, tensorMap, context) as number;\n      const writeTensor =\n          getParamValue('tensor', node, tensorMap, context) as Tensor;\n      const tensorList = context.getTensorList(idTensor.id);\n      tensorList.setItem(index, writeTensor);\n      return [tensorList.idTensor];\n    }\n    case 'TensorListGetItem': {\n      const idTensor =\n          getParamValue('tensorListId', node, tensorMap, context) as Tensor;\n      const readIndex =\n          getParamValue('index', node, tensorMap, context) as number;\n      const elementShape =\n          getParamValue('elementShape', node, tensorMap, context) as number[];\n\n      const elementDType =\n          getParamValue('elementDType', node, tensorMap, context) as DataType;\n      const tensorList = context.getTensorList(idTensor.id);\n      return [tensorList.getItem(readIndex, elementShape, elementDType)];\n    }\n    case 'TensorListScatterV2':\n    case 'TensorListScatter': {\n      const scatterIndices =\n          getParamValue('indices', node, tensorMap, context) as number[];\n      const scatterTensor =\n          getParamValue('tensor', node, tensorMap, context) as Tensor;\n      const elementShape =\n          getParamValue('elementShape', node, tensorMap, context) as number[];\n      const numElements =\n          getParamValue('numElements', node, tensorMap, context) as number;\n      const tensorList =\n          scatter(scatterTensor, scatterIndices, elementShape, numElements);\n      context.addTensorList(tensorList);\n      return [tensorList.idTensor];\n    }\n    case 'TensorListReserve':\n    case 'EmptyTensorList': {\n      const elementShape =\n          getParamValue('elementShape', node, tensorMap, context) as number[];\n      const elementDtype =\n          getParamValue('elementDType', node, tensorMap, context) as DataType;\n      let numElementsParam;\n\n      if (node.op === 'TensorListReserve') {\n        numElementsParam = 'numElements';\n      } else {\n        numElementsParam = 'maxNumElements';\n      }\n\n      const numElements =\n          getParamValue(numElementsParam, node, tensorMap, context) as number;\n      const maxNumElements = node.op === 'TensorListReserve' ? -1 : numElements;\n      const tensorList =\n          reserve(elementShape, elementDtype, numElements, maxNumElements);\n      context.addTensorList(tensorList);\n      return [tensorList.idTensor];\n    }\n    case 'TensorListGather': {\n      const gatherId =\n          getParamValue('tensorListId', node, tensorMap, context) as Tensor;\n      const gatherIndices =\n          getParamValue('indices', node, tensorMap, context) as number[];\n      const elementShape =\n          getParamValue('elementShape', node, tensorMap, context) as number[];\n      const elementDtype =\n          getParamValue('elementDType', node, tensorMap, context) as DataType;\n      const tensorList = context.getTensorList(gatherId.id);\n      return [tensorList.gather(gatherIndices, elementDtype, elementShape)];\n    }\n    case 'TensorListStack': {\n      const idTensor =\n          getParamValue('tensorListId', node, tensorMap, context) as Tensor;\n      const elementShape =\n          getParamValue('elementShape', node, tensorMap, context) as number[];\n      const elementDtype =\n          getParamValue('elementDType', node, tensorMap, context) as DataType;\n      const numElements =\n          getParamValue('numElements', node, tensorMap, context) as number;\n      const tensorList = context.getTensorList(idTensor.id);\n      return [tensorList.stack(elementShape, elementDtype, numElements)];\n    }\n    case 'TensorListFromTensor': {\n      const tensor =\n          getParamValue('tensor', node, tensorMap, context) as Tensor;\n      const elementShape =\n          getParamValue('elementShape', node, tensorMap, context) as number[];\n      const elementDtype =\n          getParamValue('elementDType', node, tensorMap, context) as DataType;\n      const tensorList = fromTensor(tensor, elementShape, elementDtype);\n      context.addTensorList(tensorList);\n      return [tensorList.idTensor];\n    }\n    case 'TensorListConcat':\n    case 'TensorListConcatV2': {\n      const concatId =\n          getParamValue('tensorListId', node, tensorMap, context) as Tensor;\n      const tensorList = context.getTensorList(concatId.id);\n      const concatDtype =\n          getParamValue('dtype', node, tensorMap, context) as DataType;\n      const elementShape =\n          getParamValue('elementShape', node, tensorMap, context) as number[];\n      return [tensorList.concat(concatDtype, elementShape)];\n    }\n    case 'TensorListPushBack': {\n      const idTensor =\n          getParamValue('tensorListId', node, tensorMap, context) as Tensor;\n      const writeTensor =\n          getParamValue('tensor', node, tensorMap, context) as Tensor;\n      const tensorList = context.getTensorList(idTensor.id);\n      tensorList.pushBack(writeTensor);\n      return [tensorList.idTensor];\n    }\n    case 'TensorListPopBack': {\n      const idTensor =\n          getParamValue('tensorListId', node, tensorMap, context) as Tensor;\n      const elementShape =\n          getParamValue('elementShape', node, tensorMap, context) as number[];\n      const elementDType =\n          getParamValue('elementDType', node, tensorMap, context) as DataType;\n      const tensorList = context.getTensorList(idTensor.id);\n      return [tensorList.popBack(elementShape, elementDType)];\n    }\n    case 'TensorListSplit': {\n      const splitTensor =\n          getParamValue('tensor', node, tensorMap, context) as Tensor;\n      const elementShape =\n          getParamValue('elementShape', node, tensorMap, context) as number[];\n      const lengths =\n          getParamValue('lengths', node, tensorMap, context) as number[];\n\n      const tensorList = split(splitTensor, lengths, elementShape);\n      context.addTensorList(tensorList);\n      return [tensorList.idTensor];\n    }\n    case 'TensorListLength': {\n      const idTensor =\n          getParamValue('tensorListId', node, tensorMap, context) as Tensor;\n      const tensorList = context.getTensorList(idTensor.id);\n      return [scalar(tensorList.size(), 'int32')];\n    }\n    case 'TensorListResize': {\n      const idTensor =\n          getParamValue('tensorListId', node, tensorMap, context) as Tensor;\n      const size = getParamValue('size', node, tensorMap, context) as number;\n\n      const srcTensorList = context.getTensorList(idTensor.id);\n      const destTensorList = srcTensorList.resize(size);\n      context.addTensorList(destTensorList);\n      return [destTensorList.idTensor];\n    }\n    default:\n      throw TypeError(`Node type ${node.op} is not implemented`);\n  }\n};\n\nexport const CATEGORY = 'control';\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Rank, Tensor, Tensor3D, Tensor4D, Tensor5D} from '@tensorflow/tfjs-core';\n// tslint:disable-next-line: no-imports-from-dist\nimport * as tfOps from '@tensorflow/tfjs-core/dist/ops/ops_for_converter';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport {InternalOpExecutor, Node} from '../types';\n\nimport {getPadding, getParamValue} from './utils';\n\nfunction fusedConvAndDepthWiseParams(\n    node: Node, tensorMap: NamedTensorsMap, context: ExecutionContext) {\n  const [extraOp, activationFunc] =\n      (getParamValue('fusedOps', node, tensorMap, context) as string[]);\n\n  const isBiasAdd = extraOp === 'biasadd';\n  const noBiasAdd = !isBiasAdd;\n  const isPrelu = activationFunc === 'prelu';\n  const isBatchNorm = extraOp === 'fusedbatchnorm';\n\n  const numArgs =\n      (getParamValue('numArgs', node, tensorMap, context) as number);\n  if (isBiasAdd) {\n    if (isPrelu && numArgs !== 2) {\n      throw new Error(\n          'FusedConv2d and DepthwiseConv2d with BiasAdd and Prelu ' +\n          'must have two extra arguments: bias and alpha.');\n    }\n    if (!isPrelu && isBiasAdd && numArgs !== 1) {\n      throw new Error(\n          'FusedConv2d and DepthwiseConv2d with BiasAdd must have ' +\n          'one extra argument: bias.');\n    }\n  }\n  if (isBatchNorm) {\n    throw new Error(\n        'FusedConv2d and DepthwiseConv2d with FusedBatchNorm is not supported');\n  }\n  const stride = getParamValue('strides', node, tensorMap, context) as number[];\n  const pad = getPadding(node, tensorMap, context);\n  const dataFormat =\n      (getParamValue('dataFormat', node, tensorMap, context) as string)\n          .toUpperCase();\n  const dilations =\n      getParamValue('dilations', node, tensorMap, context) as number[];\n  let [biasArg, preluArg] =\n      getParamValue('args', node, tensorMap, context) as Tensor[];\n  if (noBiasAdd) {\n    preluArg = biasArg;\n    biasArg = undefined;\n  }\n  const leakyreluAlpha =\n      getParamValue('leakyreluAlpha', node, tensorMap, context) as number;\n\n  return {\n    stride,\n    pad,\n    dataFormat,\n    dilations,\n    biasArg,\n    preluArg,\n    activationFunc,\n    leakyreluAlpha\n  };\n}\n\nexport const executeOp: InternalOpExecutor =\n    (node: Node, tensorMap: NamedTensorsMap,\n     context: ExecutionContext, ops = tfOps): Tensor[] => {\n      switch (node.op) {\n        case 'Conv1D': {\n          const stride =\n              getParamValue('stride', node, tensorMap, context) as number;\n          const pad = getParamValue('pad', node, tensorMap, context);\n          const dataFormat =\n              (getParamValue('dataFormat', node, tensorMap, context) as string)\n                  .toUpperCase();\n          const dilation =\n              getParamValue('dilation', node, tensorMap, context) as number;\n          return [ops.conv1d(\n              getParamValue('x', node, tensorMap, context) as Tensor3D,\n              getParamValue('filter', node, tensorMap, context) as Tensor3D,\n              stride, pad as 'valid' | 'same', dataFormat as 'NWC' | 'NCW',\n              dilation)];\n        }\n        case 'Conv2D': {\n          const stride =\n              getParamValue('strides', node, tensorMap, context) as number[];\n          const pad = getPadding(node, tensorMap, context);\n          const dataFormat =\n              (getParamValue('dataFormat', node, tensorMap, context) as string)\n                  .toUpperCase();\n          const dilations =\n              getParamValue('dilations', node, tensorMap, context) as number[];\n          return [ops.conv2d(\n              getParamValue('x', node, tensorMap, context) as Tensor3D |\n                  Tensor4D,\n              getParamValue('filter', node, tensorMap, context) as Tensor4D,\n              [stride[1], stride[2]], pad as 'valid' | 'same',\n              dataFormat as 'NHWC' | 'NCHW', [dilations[1], dilations[2]])];\n        }\n        case '_FusedConv2D': {\n          const {\n            stride,\n            pad,\n            dataFormat,\n            dilations,\n            biasArg,\n            preluArg,\n            activationFunc,\n            leakyreluAlpha\n          } = fusedConvAndDepthWiseParams(node, tensorMap, context);\n\n          return [ops.fused.conv2d({\n            x: getParamValue('x', node, tensorMap, context) as Tensor3D |\n                Tensor4D,\n            filter: getParamValue('filter', node, tensorMap, context) as\n                Tensor4D,\n            strides: [stride[1], stride[2]],\n            pad: pad as 'valid' | 'same',\n            dataFormat: dataFormat as 'NHWC' | 'NCHW',\n            dilations: [dilations[1], dilations[2]],\n            bias: biasArg,\n            activation: activationFunc as tfOps.fused.Activation,\n            preluActivationWeights: preluArg,\n            leakyreluAlpha\n          })];\n        }\n\n        case 'FusedDepthwiseConv2dNative': {\n          const {\n            stride,\n            pad,\n            dataFormat,\n            dilations,\n            biasArg,\n            preluArg,\n            activationFunc,\n            leakyreluAlpha,\n          } = fusedConvAndDepthWiseParams(node, tensorMap, context);\n\n          return [ops.fused.depthwiseConv2d({\n            x: getParamValue('x', node, tensorMap, context) as Tensor3D |\n                Tensor4D,\n            filter: getParamValue('filter', node, tensorMap, context) as\n                Tensor4D,\n            strides: [stride[1], stride[2]],\n            pad: pad as 'valid' | 'same',\n            dataFormat: dataFormat as 'NHWC' | 'NCHW',\n            dilations: [dilations[1], dilations[2]],\n            bias: biasArg,\n            activation: activationFunc as tfOps.fused.Activation,\n            preluActivationWeights: preluArg,\n            leakyreluAlpha\n          })];\n        }\n        case 'Conv2DBackpropInput':\n        case 'Conv2dTranspose': {\n          const shape = getParamValue(\n                            'outputShape', node, tensorMap,\n                            context) as [number, number, number] |\n              [number, number, number, number];\n          const stride =\n              getParamValue('strides', node, tensorMap, context) as number[];\n          const pad = getPadding(node, tensorMap, context);\n          return [ops.conv2dTranspose(\n              getParamValue('x', node, tensorMap, context) as Tensor3D |\n                  Tensor4D,\n              getParamValue('filter', node, tensorMap, context) as Tensor4D,\n              shape, [stride[1], stride[2]], pad as 'valid' | 'same')];\n        }\n        case 'DepthwiseConv2dNative':\n        case 'DepthwiseConv2d': {\n          const stride =\n              getParamValue('strides', node, tensorMap, context) as number[];\n          const pad = getPadding(node, tensorMap, context);\n          const dilations =\n              getParamValue('dilations', node, tensorMap, context) as number[];\n          const dataFormat =\n              (getParamValue('dataFormat', node, tensorMap, context) as string)\n                  .toUpperCase();\n\n          return [ops.depthwiseConv2d(\n              getParamValue('input', node, tensorMap, context) as Tensor3D |\n                  Tensor4D,\n              getParamValue('filter', node, tensorMap, context) as Tensor4D,\n              [stride[1], stride[2]], pad as 'valid' | 'same',\n              dataFormat as 'NHWC' | 'NCHW', [dilations[1], dilations[2]])];\n        }\n        case 'Conv3D': {\n          const stride =\n              getParamValue('strides', node, tensorMap, context) as number[];\n          const pad = getParamValue('pad', node, tensorMap, context);\n          const dataFormat =\n              (getParamValue('dataFormat', node, tensorMap, context) as string)\n                  .toUpperCase();\n          const dilations =\n              getParamValue('dilations', node, tensorMap, context) as number[];\n          return [ops.conv3d(\n              getParamValue('x', node, tensorMap, context) as Tensor4D |\n                  Tensor<Rank.R5>,\n              getParamValue('filter', node, tensorMap, context) as\n                  Tensor<Rank.R5>,\n              [stride[1], stride[2], stride[3]], pad as 'valid' | 'same',\n              dataFormat as 'NDHWC' | 'NCDHW',\n              [dilations[1], dilations[2], dilations[3]])];\n        }\n        case 'AvgPool': {\n          const stride =\n              getParamValue('strides', node, tensorMap, context) as number[];\n          const pad = getParamValue('pad', node, tensorMap, context);\n          const kernelSize =\n              getParamValue('kernelSize', node, tensorMap, context) as number[];\n\n          return [ops.avgPool(\n              getParamValue('x', node, tensorMap, context) as Tensor3D |\n                  Tensor4D,\n              [kernelSize[1], kernelSize[2]], [stride[1], stride[2]],\n              pad as 'valid' | 'same')];\n        }\n        case 'MaxPool': {\n          const stride =\n              getParamValue('strides', node, tensorMap, context) as number[];\n          const pad = getParamValue('pad', node, tensorMap, context);\n          const kernelSize =\n              getParamValue('kernelSize', node, tensorMap, context) as number[];\n\n          return [ops.maxPool(\n              getParamValue('x', node, tensorMap, context) as Tensor3D |\n                  Tensor4D,\n              [kernelSize[1], kernelSize[2]], [stride[1], stride[2]],\n              pad as 'valid' | 'same')];\n        }\n        case 'MaxPoolWithArgmax': {\n          const stride =\n              getParamValue('strides', node, tensorMap, context) as number[];\n          const pad = getParamValue('pad', node, tensorMap, context);\n          const kernelSize =\n              getParamValue('kernelSize', node, tensorMap, context) as number[];\n          const includeBatchInIndex =\n              getParamValue('includeBatchInIndex', node, tensorMap, context) as\n              boolean;\n          const {result, indexes} = ops.maxPoolWithArgmax(\n              getParamValue('x', node, tensorMap, context) as Tensor4D,\n              [kernelSize[1], kernelSize[2]], [stride[1], stride[2]],\n              pad as 'valid' | 'same', includeBatchInIndex);\n          return [result, indexes];\n        }\n        case 'AvgPool3D': {\n          const stride =\n              getParamValue('strides', node, tensorMap, context) as number[];\n          const pad = getParamValue('pad', node, tensorMap, context);\n          const kernelSize =\n              getParamValue('kernelSize', node, tensorMap, context) as number[];\n\n          return [ops.avgPool3d(\n              getParamValue('x', node, tensorMap, context) as Tensor5D,\n              [kernelSize[1], kernelSize[2], kernelSize[3]],\n              [stride[1], stride[2], stride[3]], pad as 'valid' | 'same')];\n        }\n\n        case 'MaxPool3D': {\n          const stride =\n              getParamValue('strides', node, tensorMap, context) as number[];\n          const pad = getParamValue('pad', node, tensorMap, context);\n          const kernelSize =\n              getParamValue('kernelSize', node, tensorMap, context) as number[];\n\n          return [ops.maxPool3d(\n              getParamValue('x', node, tensorMap, context) as Tensor5D,\n              [kernelSize[1], kernelSize[2], kernelSize[3]],\n              [stride[1], stride[2], stride[3]], pad as 'valid' | 'same')];\n        }\n\n        case 'Dilation2D': {\n          const strides =\n              getParamValue('strides', node, tensorMap, context) as number[];\n          const pad = getParamValue('pad', node, tensorMap, context);\n          const dilations =\n              getParamValue('dilations', node, tensorMap, context) as number[];\n\n          // strides: [1, stride_height, stride_width, 1].\n          const strideHeight = strides[1];\n          const strideWidth = strides[2];\n\n          // dilations: [1, dilation_height, dilation_width, 1].\n          const dilationHeight = dilations[1];\n          const dilationWidth = dilations[2];\n\n          return [ops.dilation2d(\n              getParamValue('x', node, tensorMap, context) as Tensor3D |\n                  Tensor4D,\n              getParamValue('filter', node, tensorMap, context) as Tensor3D,\n              [strideHeight, strideWidth], pad as 'valid' | 'same',\n              [dilationHeight, dilationWidth], 'NHWC' /* dataFormat */)];\n        }\n\n        default:\n          throw TypeError(`Node type ${node.op} is not implemented`);\n      }\n    };\n\nexport const CATEGORY = 'convolution';\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {DataType, Tensor, Tensor1D} from '@tensorflow/tfjs-core';\n// tslint:disable-next-line: no-imports-from-dist\nimport * as tfOps from '@tensorflow/tfjs-core/dist/ops/ops_for_converter';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport {InternalOpExecutor, Node} from '../types';\n\nimport {getParamValue} from './utils';\n\nexport const executeOp: InternalOpExecutor =\n    (node: Node, tensorMap: NamedTensorsMap, context: ExecutionContext,\n     ops = tfOps): Tensor[] => {\n      switch (node.op) {\n        case 'Fill': {\n          const shape =\n              getParamValue('shape', node, tensorMap, context) as number[];\n          const dtype =\n              getParamValue('dtype', node, tensorMap, context) as DataType;\n          const value =\n              getParamValue('value', node, tensorMap, context) as number;\n          return [ops.fill(shape, value, dtype)];\n        }\n        case 'LinSpace': {\n          const start =\n              getParamValue('start', node, tensorMap, context) as number;\n          const stop =\n              getParamValue('stop', node, tensorMap, context) as number;\n          const num = getParamValue('num', node, tensorMap, context) as number;\n          return [ops.linspace(start, stop, num)];\n        }\n        case 'Multinomial': {\n          const logits =\n              getParamValue('logits', node, tensorMap, context) as Tensor1D;\n          const numSamples =\n              getParamValue('numSamples', node, tensorMap, context) as number;\n          const seed =\n              getParamValue('seed', node, tensorMap, context) as number;\n          return [ops.multinomial(logits, numSamples, seed)];\n        }\n        case 'OneHot': {\n          const indices =\n              getParamValue('indices', node, tensorMap, context) as Tensor1D;\n          const depth =\n              getParamValue('depth', node, tensorMap, context) as number;\n          const onValue =\n              getParamValue('onValue', node, tensorMap, context) as number;\n          const offValue =\n              getParamValue('offValue', node, tensorMap, context) as number;\n          const dtype =\n              getParamValue('dtype', node, tensorMap, context) as DataType;\n          return [ops.oneHot(indices, depth, onValue, offValue, dtype)];\n        }\n        case 'Ones': {\n          return [ops.ones(\n              getParamValue('shape', node, tensorMap, context) as number[],\n              getParamValue('dtype', node, tensorMap, context) as DataType)];\n        }\n        case 'OnesLike': {\n          return [ops.onesLike(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        }\n        case 'RandomStandardNormal': {\n          return [ops.randomStandardNormal(\n              getParamValue('shape', node, tensorMap, context) as number[],\n              getParamValue('dtype', node, tensorMap, context) as 'float32' |\n                  'int32',\n              getParamValue('seed', node, tensorMap, context) as number)];\n        }\n        case 'RandomUniform': {\n          return [ops.randomUniform(\n              // tslint:disable-next-line:no-any\n              getParamValue('shape', node, tensorMap, context) as any,\n              getParamValue('minval', node, tensorMap, context) as number,\n              getParamValue('maxval', node, tensorMap, context) as number,\n              getParamValue('dtype', node, tensorMap, context) as DataType)];\n        }\n        case 'RandomUniformInt': {\n          return [ops.randomUniformInt(\n              getParamValue('shape', node, tensorMap, context) as number[],\n              getParamValue('minval', node, tensorMap, context) as number,\n              getParamValue('maxval', node, tensorMap, context) as number,\n              getParamValue('seed', node, tensorMap, context) as number)];\n        }\n        case 'Range': {\n          const start =\n              getParamValue('start', node, tensorMap, context) as number;\n          const stop =\n              getParamValue('stop', node, tensorMap, context) as number;\n          const step =\n              getParamValue('step', node, tensorMap, context) as number;\n          return [ops.range(\n              start, stop, step,\n              getParamValue('dtype', node, tensorMap, context) as 'float32' |\n                  'int32')];\n        }\n        case 'TruncatedNormal': {\n          const shape =\n              getParamValue('shape', node, tensorMap, context) as number[];\n          const mean =\n              getParamValue('mean', node, tensorMap, context) as number;\n          const stdDev =\n              getParamValue('stdDev', node, tensorMap, context) as number;\n          const seed =\n              getParamValue('seed', node, tensorMap, context) as number;\n          return [ops.truncatedNormal(\n              shape, mean, stdDev,\n              getParamValue('dtype', node, tensorMap, context) as 'float32' |\n                  'int32',\n              seed)];\n        }\n        case 'Zeros': {\n          return [ops.zeros(\n              getParamValue('shape', node, tensorMap, context) as number[],\n              getParamValue('dtype', node, tensorMap, context) as DataType)];\n        }\n        case 'ZerosLike': {\n          return [ops.zerosLike(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        }\n        default:\n          throw TypeError(`Node type ${node.op} is not implemented`);\n      }\n    };\n\nexport const CATEGORY = 'creation';\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor, Tensor1D, Tensor2D} from '@tensorflow/tfjs-core';\n// tslint:disable-next-line: no-imports-from-dist\nimport * as tfOps from '@tensorflow/tfjs-core/dist/ops/ops_for_converter';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport { ResourceManager } from '../../executor/resource_manager';\nimport {InternalOpAsyncExecutor, Node} from '../types';\n\nimport {getParamValue} from './utils';\n\nfunction nmsParams(\n    node: Node, tensorMap: NamedTensorsMap, context: ExecutionContext) {\n  const boxes = getParamValue('boxes', node, tensorMap, context) as Tensor;\n  const scores = getParamValue('scores', node, tensorMap, context) as Tensor;\n  const maxOutputSize =\n      getParamValue('maxOutputSize', node, tensorMap, context) as number;\n  const iouThreshold =\n      getParamValue('iouThreshold', node, tensorMap, context) as number;\n  const scoreThreshold =\n      getParamValue('scoreThreshold', node, tensorMap, context) as number;\n  const softNmsSigma =\n      getParamValue('softNmsSigma', node, tensorMap, context) as number;\n\n  return {\n    boxes,\n    scores,\n    maxOutputSize,\n    iouThreshold,\n    scoreThreshold,\n    softNmsSigma\n  };\n}\n\nexport const executeOp: InternalOpAsyncExecutor = async(\n    node: Node, tensorMap: NamedTensorsMap,\n    context: ExecutionContext, resourceManager: ResourceManager,\n    ops = tfOps): Promise<Tensor[]> => {\n  switch (node.op) {\n    case 'NonMaxSuppressionV5': {\n      const {\n        boxes,\n        scores,\n        maxOutputSize,\n        iouThreshold,\n        scoreThreshold,\n        softNmsSigma\n      } = nmsParams(node, tensorMap, context);\n\n      const result = await ops.image.nonMaxSuppressionWithScoreAsync(\n          boxes as Tensor2D, scores as Tensor1D, maxOutputSize, iouThreshold,\n          scoreThreshold, softNmsSigma);\n\n      return [result.selectedIndices, result.selectedScores];\n    }\n    case 'NonMaxSuppressionV4': {\n      const {boxes, scores, maxOutputSize, iouThreshold, scoreThreshold} =\n          nmsParams(node, tensorMap, context);\n\n      const padToMaxOutputSize =\n          getParamValue('padToMaxOutputSize', node, tensorMap, context) as\n          boolean;\n\n      const result = await ops.image.nonMaxSuppressionPaddedAsync(\n          boxes as Tensor2D, scores as Tensor1D, maxOutputSize, iouThreshold,\n          scoreThreshold, padToMaxOutputSize);\n\n      return [result.selectedIndices, result.validOutputs];\n    }\n    case 'NonMaxSuppressionV3':\n    case 'NonMaxSuppressionV2': {\n      const {boxes, scores, maxOutputSize, iouThreshold, scoreThreshold} =\n          nmsParams(node, tensorMap, context);\n\n      return [await ops.image.nonMaxSuppressionAsync(\n          boxes as Tensor2D, scores as Tensor1D, maxOutputSize, iouThreshold,\n          scoreThreshold)];\n    }\n    case 'Where': {\n      const condition = ops.cast(\n          (getParamValue('condition', node, tensorMap, context) as Tensor),\n          'bool');\n      const result = [await ops.whereAsync(condition)];\n      condition.dispose();\n      return result;\n    }\n    case 'ListDiff': {\n      return ops.setdiff1dAsync(\n          getParamValue('x', node, tensorMap, context) as Tensor,\n          getParamValue('y', node, tensorMap, context) as Tensor);\n    }\n    default:\n      throw TypeError(`Node type ${node.op} is not implemented`);\n  }\n};\n\nexport const CATEGORY = 'dynamic';\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '@tensorflow/tfjs-core';\n// tslint:disable-next-line: no-imports-from-dist\nimport * as tfOps from '@tensorflow/tfjs-core/dist/ops/ops_for_converter';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport {InternalOpExecutor, Node} from '../types';\n\nimport {getParamValue} from './utils';\n\nexport const executeOp: InternalOpExecutor =\n    (node: Node, tensorMap: NamedTensorsMap, context: ExecutionContext,\n     ops = tfOps):\n        Tensor[] => {\n          switch (node.op) {\n            case 'LowerBound': {\n              const sortedSequence =\n                  getParamValue('sortedSequence', node, tensorMap, context) as\n                  Tensor;\n              const values =\n                  getParamValue('values', node, tensorMap, context) as Tensor;\n              return [ops.lowerBound(sortedSequence, values)];\n            }\n            case 'TopKV2': {\n              const x = getParamValue('x', node, tensorMap, context) as Tensor;\n              const k = getParamValue('k', node, tensorMap, context) as number;\n              const sorted =\n                  getParamValue('sorted', node, tensorMap, context) as boolean;\n              const result = ops.topk(x, k, sorted);\n              return [result.values, result.indices];\n            }\n            case 'UpperBound': {\n              const sortedSequence =\n                  getParamValue('sortedSequence', node, tensorMap, context) as\n                  Tensor;\n              const values =\n                  getParamValue('values', node, tensorMap, context) as Tensor;\n              return [ops.upperBound(sortedSequence, values)];\n            }\n            case 'Unique': {\n              const x = getParamValue('x', node, tensorMap, context) as Tensor;\n              const result = ops.unique(x);\n              return [result.values, result.indices];\n            }\n            case 'UniqueV2': {\n              const x = getParamValue('x', node, tensorMap, context) as Tensor;\n              const axis =\n                  getParamValue('axis', node, tensorMap, context) as number;\n              const result = ops.unique(x, axis);\n              return [result.values, result.indices];\n            }\n            default:\n              throw TypeError(`Node type ${node.op} is not implemented`);\n          }\n        };\n\nexport const CATEGORY = 'evaluation';\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '@tensorflow/tfjs-core';\n// tslint:disable-next-line: no-imports-from-dist\nimport * as tfOps from '@tensorflow/tfjs-core/dist/ops/ops_for_converter';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport {InternalOpExecutor, Node} from '../types';\n\nimport {cloneTensor, getParamValue, getTensor} from './utils';\n\nexport const executeOp: InternalOpExecutor =\n    (node: Node, tensorMap: NamedTensorsMap,\n     context: ExecutionContext, ops = tfOps): Tensor[] => {\n      switch (node.op) {\n        case 'Const': {\n          return tensorMap[node.name];\n        }\n        case 'PlaceholderWithDefault':\n          const def =\n              getParamValue('default', node, tensorMap, context) as Tensor;\n          return [getTensor(node.name, tensorMap, context) || def];\n        case 'Placeholder':\n          return [getTensor(node.name, tensorMap, context)];\n        case 'Identity':\n        case 'StopGradient':\n        case 'FakeQuantWithMinMaxVars': {  // This op is currently ignored.\n          const data = getParamValue('x', node, tensorMap, context) as Tensor;\n          return [cloneTensor(data)];\n        }\n        case 'IdentityN':\n          return (getParamValue('x', node, tensorMap, context) as Tensor[])\n              .map((t: Tensor) => cloneTensor(t));\n        case 'Snapshot':\n          const snapshot =\n              (getParamValue('x', node, tensorMap, context) as Tensor);\n          return [cloneTensor(snapshot)];\n        case 'Shape':\n          return [ops.tensor1d(\n              (getParamValue('x', node, tensorMap, context) as Tensor).shape,\n              'int32')];\n        case 'ShapeN':\n          return (getParamValue('x', node, tensorMap, context) as Tensor[])\n              .map((t: Tensor) => ops.tensor1d(t.shape));\n        case 'Size':\n          return [ops.scalar(\n              (getParamValue('x', node, tensorMap, context) as Tensor).size,\n              'int32')];\n        case 'Rank':\n          return [ops.scalar(\n              (getParamValue('x', node, tensorMap, context) as Tensor).rank,\n              'int32')];\n        case 'NoOp':\n          return [ops.scalar(1)];\n        case 'Print':\n          const input = getParamValue('x', node, tensorMap, context) as Tensor;\n          const data =\n              getParamValue('data', node, tensorMap, context) as Tensor[];\n          const message =\n              getParamValue('message', node, tensorMap, context) as string;\n          const summarize =\n              getParamValue('summarize', node, tensorMap, context) as number;\n          console.warn(\n              'The graph has a tf.print() operation,' +\n              'usually used for debugging, which slows down performance.');\n          console.log(message);\n          for (let i = 0; i < data.length; i++) {\n            console.log(Array.prototype.slice.call(data[i].dataSync())\n                            .slice(0, summarize));\n          }\n          return [input];\n\n        default:\n          throw TypeError(`Node type ${node.op} is not implemented`);\n      }\n    };\n\nexport const CATEGORY = 'graph';\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {DataType, keep, scalar, stack, Tensor, tidy, unstack, util} from '@tensorflow/tfjs-core';\n// tslint:disable-next-line: no-imports-from-dist\nimport * as tfOps from '@tensorflow/tfjs-core/dist/ops/ops_for_converter';\n\n/**\n * Hashtable contains a set of tensors, which can be accessed by key.\n */\nexport class HashTable {\n  readonly handle: Tensor;\n\n  // tslint:disable-next-line: no-any\n  private tensorMap: Map<any, Tensor>;\n\n  get id() {\n    return this.handle.id;\n  }\n\n  /**\n   * Constructor of HashTable. Creates a hash table.\n   *\n   * @param keyDType `dtype` of the table keys.\n   * @param valueDType `dtype` of the table values.\n   */\n  constructor(readonly keyDType: DataType, readonly valueDType: DataType) {\n    this.handle = scalar(0);\n    // tslint:disable-next-line: no-any\n    this.tensorMap = new Map<any, Tensor>();\n\n    keep(this.handle);\n  }\n\n  /**\n   * Dispose the tensors and handle and clear the hashtable.\n   */\n  clearAndClose() {\n    this.tensorMap.forEach(value => value.dispose());\n    this.tensorMap.clear();\n    this.handle.dispose();\n  }\n\n  /**\n   * The number of items in the hash table.\n   */\n  size(): number {\n    return this.tensorMap.size;\n  }\n\n  /**\n   * The number of items in the hash table as a rank-0 tensor.\n   */\n  tensorSize(): Tensor {\n    return tfOps.scalar(this.size(), 'int32');\n  }\n\n  /**\n   * Replaces the contents of the table with the specified keys and values.\n   * @param keys Keys to store in the hashtable.\n   * @param values Values to store in the hashtable.\n   */\n  async import(keys: Tensor, values: Tensor): Promise<Tensor> {\n    this.checkKeyAndValueTensor(keys, values);\n\n    // We only store the primitive values of the keys, this allows lookup\n    // to be O(1).\n    const $keys = await keys.data();\n\n    // Clear the hashTable before inserting new values.\n    this.tensorMap.forEach(value => value.dispose());\n    this.tensorMap.clear();\n\n    return tidy(() => {\n      const $values = unstack(values);\n\n      const keysLength = $keys.length;\n      const valuesLength = $values.length;\n\n      util.assert(\n          keysLength === valuesLength,\n          () => `The number of elements doesn't match, keys has ` +\n              `${keysLength} elements, the values has ${valuesLength} ` +\n              `elements.`);\n\n      for (let i = 0; i < keysLength; i++) {\n        const key = $keys[i];\n        const value = $values[i];\n\n        keep(value);\n        this.tensorMap.set(key, value);\n      }\n\n      return this.handle;\n    });\n  }\n\n  /**\n   * Looks up keys in a hash table, outputs the corresponding values.\n   *\n   * Performs batch lookups, for every element in the key tensor, `find`\n   * stacks the corresponding value into the return tensor.\n   *\n   * If an element is not present in the table, the given `defaultValue` is\n   * used.\n   *\n   * @param keys Keys to look up. Must have the same type as the keys of the\n   *     table.\n   * @param defaultValue The scalar `defaultValue` is the value output for keys\n   *     not present in the table. It must also be of the same type as the\n   *     table values.\n   */\n  async find(keys: Tensor, defaultValue: Tensor): Promise<Tensor> {\n    this.checkKeyAndValueTensor(keys, defaultValue);\n\n    const $keys = await keys.data();\n\n    return tidy(() => {\n      const result: Tensor[] = [];\n\n      for (let i = 0; i < $keys.length; i++) {\n        const key = $keys[i];\n\n        const value = this.findWithDefault(key, defaultValue);\n        result.push(value);\n      }\n\n      return stack(result);\n    });\n  }\n\n  // tslint:disable-next-line: no-any\n  private findWithDefault(key: any, defaultValue: Tensor): Tensor {\n    const result = this.tensorMap.get(key);\n\n    return result != null ? result : defaultValue;\n  }\n\n  private checkKeyAndValueTensor(key: Tensor, value: Tensor) {\n    if (key.dtype !== this.keyDType) {\n      throw new Error(\n          `Expect key dtype ${this.keyDType}, but got ` +\n          `${key.dtype}`);\n    }\n\n    if (value.dtype !== this.valueDType) {\n      throw new Error(\n          `Expect value dtype ${this.valueDType}, but got ` +\n          `${value.dtype}`);\n    }\n  }\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {DataType, Tensor} from '@tensorflow/tfjs-core';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport {HashTable} from '../../executor/hash_table';\nimport {ResourceManager} from '../../executor/resource_manager';\nimport {InternalOpAsyncExecutor, Node} from '../types';\n\nimport {getParamValue} from './utils';\n\nexport const executeOp: InternalOpAsyncExecutor = async(\n    node: Node, tensorMap: NamedTensorsMap, context: ExecutionContext,\n    resourceManager: ResourceManager): Promise<Tensor[]> => {\n  switch (node.op) {\n    case 'HashTable':\n    case 'HashTableV2': {\n      const existingTableHandle =\n          resourceManager.getHashTableHandleByName(node.name);\n      // Table is shared with initializer.\n      if (existingTableHandle != null) {\n        return [existingTableHandle];\n      } else {\n        const keyDType =\n            getParamValue('keyDType', node, tensorMap, context) as DataType;\n        const valueDType =\n            getParamValue('valueDType', node, tensorMap, context) as DataType;\n\n        const hashTable = new HashTable(keyDType, valueDType);\n        resourceManager.addHashTable(node.name, hashTable);\n        return [hashTable.handle];\n      }\n    }\n    case 'InitializeTable':\n    case 'InitializeTableV2':\n    case 'LookupTableImport':\n    case 'LookupTableImportV2': {\n      const handle = getParamValue(\n                         'tableHandle', node, tensorMap, context,\n                         resourceManager) as Tensor;\n      const keys = getParamValue('keys', node, tensorMap, context) as Tensor;\n      const values =\n          getParamValue('values', node, tensorMap, context) as Tensor;\n\n      const hashTable = resourceManager.getHashTableById(handle.id);\n\n      return [await hashTable.import(keys, values)];\n    }\n    case 'LookupTableFind':\n    case 'LookupTableFindV2': {\n      const handle = getParamValue(\n                         'tableHandle', node, tensorMap, context,\n                         resourceManager) as Tensor;\n      const keys = getParamValue('keys', node, tensorMap, context) as Tensor;\n      const defaultValue =\n          getParamValue('defaultValue', node, tensorMap, context) as Tensor;\n\n      const hashTable = resourceManager.getHashTableById(handle.id);\n      return [await hashTable.find(keys, defaultValue)];\n    }\n    case 'LookupTableSize':\n    case 'LookupTableSizeV2': {\n      const handle = getParamValue(\n                         'tableHandle', node, tensorMap, context,\n                         resourceManager) as Tensor;\n\n      const hashTable = resourceManager.getHashTableById(handle.id);\n      return [hashTable.tensorSize()];\n    }\n    default:\n      throw TypeError(`Node type ${node.op} is not implemented`);\n  }\n};\n\nexport const CATEGORY = 'hash_table';\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor, Tensor1D, Tensor2D, Tensor3D, Tensor4D} from '@tensorflow/tfjs-core';\n// tslint:disable-next-line: no-imports-from-dist\nimport * as tfOps from '@tensorflow/tfjs-core/dist/ops/ops_for_converter';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport {InternalOpExecutor, Node} from '../types';\n\nimport {getParamValue} from './utils';\n\nexport const executeOp: InternalOpExecutor =\n    (node: Node, tensorMap: NamedTensorsMap,\n     context: ExecutionContext, ops = tfOps): Tensor[] => {\n      switch (node.op) {\n        case 'ResizeBilinear': {\n          const images =\n              getParamValue('images', node, tensorMap, context) as Tensor;\n          const size =\n              getParamValue('size', node, tensorMap, context) as number[];\n          const alignCorners =\n              getParamValue('alignCorners', node, tensorMap, context) as\n              boolean;\n          const halfPixelCenters =\n              getParamValue('halfPixelCenters', node, tensorMap, context) as\n              boolean;\n          return [ops.image.resizeBilinear(\n              images as Tensor3D | Tensor4D, [size[0], size[1]], alignCorners,\n              halfPixelCenters)];\n        }\n        case 'ResizeNearestNeighbor': {\n          const images =\n              getParamValue('images', node, tensorMap, context) as Tensor;\n          const size =\n              getParamValue('size', node, tensorMap, context) as number[];\n          const alignCorners =\n              getParamValue('alignCorners', node, tensorMap, context) as\n              boolean;\n          const halfPixelCenters =\n              getParamValue('halfPixelCenters', node, tensorMap, context) as\n              boolean;\n          return [ops.image.resizeNearestNeighbor(\n              images as Tensor3D | Tensor4D, [size[0], size[1]], alignCorners,\n              halfPixelCenters)];\n        }\n        case 'CropAndResize': {\n          const image =\n              getParamValue('image', node, tensorMap, context) as Tensor;\n          const boxes =\n              getParamValue('boxes', node, tensorMap, context) as Tensor;\n          const boxInd =\n              getParamValue('boxInd', node, tensorMap, context) as Tensor;\n          const cropSize =\n              getParamValue('cropSize', node, tensorMap, context) as number[];\n          const method =\n              getParamValue('method', node, tensorMap, context) as string;\n          const extrapolationValue =\n              getParamValue('extrapolationValue', node, tensorMap, context) as\n              number;\n          return [ops.image.cropAndResize(\n              image as Tensor4D, boxes as Tensor2D, boxInd as Tensor1D,\n              cropSize as [number, number], method as 'bilinear' | 'nearest',\n              extrapolationValue)];\n        }\n        case 'ImageProjectiveTransformV3': {\n          const images =\n              getParamValue('images', node, tensorMap, context) as Tensor;\n          const transforms =\n              getParamValue('transforms', node, tensorMap, context) as Tensor;\n          const outputShape =\n              getParamValue('outputShape', node, tensorMap, context) as\n              number[];\n          const fillValue =\n              getParamValue('fillValue', node, tensorMap, context) as number;\n          const interpolation =\n              getParamValue('interpolation', node, tensorMap, context) as\n              string;\n          const fillMode =\n              getParamValue('fillMode', node, tensorMap, context) as string;\n          return [ops.image.transform(\n              images as Tensor4D,\n              transforms as Tensor2D,\n              interpolation.toLowerCase() as 'bilinear' | 'nearest',\n              fillMode.toLowerCase() as 'constant' | 'reflect' | 'wrap' | 'nearest',\n              fillValue,\n              outputShape as [number, number])];\n        }\n        default:\n          throw TypeError(`Node type ${node.op} is not implemented`);\n      }\n    };\n\nexport const CATEGORY = 'image';\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '@tensorflow/tfjs-core';\n// tslint:disable-next-line: no-imports-from-dist\nimport * as tfOps from '@tensorflow/tfjs-core/dist/ops/ops_for_converter';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport {InternalOpExecutor, Node} from '../types';\n\nimport {getParamValue} from './utils';\n\nexport const executeOp: InternalOpExecutor =\n    (node: Node, tensorMap: NamedTensorsMap, context: ExecutionContext,\n     ops = tfOps): Tensor[] => {\n      switch (node.op) {\n        case 'Equal': {\n          return [ops.equal(\n              getParamValue('a', node, tensorMap, context) as Tensor,\n              getParamValue('b', node, tensorMap, context) as Tensor)];\n        }\n        case 'NotEqual': {\n          return [ops.notEqual(\n              getParamValue('a', node, tensorMap, context) as Tensor,\n              getParamValue('b', node, tensorMap, context) as Tensor)];\n        }\n        case 'Greater': {\n          return [ops.greater(\n              getParamValue('a', node, tensorMap, context) as Tensor,\n              getParamValue('b', node, tensorMap, context) as Tensor)];\n        }\n        case 'GreaterEqual': {\n          return [ops.greaterEqual(\n              getParamValue('a', node, tensorMap, context) as Tensor,\n              getParamValue('b', node, tensorMap, context) as Tensor)];\n        }\n        case 'Less': {\n          return [ops.less(\n              getParamValue('a', node, tensorMap, context) as Tensor,\n              getParamValue('b', node, tensorMap, context) as Tensor)];\n        }\n        case 'LessEqual': {\n          return [ops.lessEqual(\n              getParamValue('a', node, tensorMap, context) as Tensor,\n              getParamValue('b', node, tensorMap, context) as Tensor)];\n        }\n        case 'LogicalAnd': {\n          return [ops.logicalAnd(\n              getParamValue('a', node, tensorMap, context) as Tensor,\n              getParamValue('b', node, tensorMap, context) as Tensor)];\n        }\n        case 'LogicalNot': {\n          return [ops.logicalNot(\n              getParamValue('a', node, tensorMap, context) as Tensor)];\n        }\n        case 'LogicalOr': {\n          return [ops.logicalOr(\n              getParamValue('a', node, tensorMap, context) as Tensor,\n              getParamValue('b', node, tensorMap, context) as Tensor)];\n        }\n        case 'Select':\n        case 'SelectV2': {\n          return [ops.where(\n              getParamValue('condition', node, tensorMap, context) as Tensor,\n              getParamValue('a', node, tensorMap, context) as Tensor,\n              getParamValue('b', node, tensorMap, context) as Tensor)];\n        }\n        case 'BitwiseAnd': {\n          return [ops.bitwiseAnd(\n              getParamValue('a', node, tensorMap, context) as Tensor,\n              getParamValue('b', node, tensorMap, context) as Tensor)];\n        }\n        default:\n          throw TypeError(`Node type ${node.op} is not implemented`);\n      }\n    };\n\nexport const CATEGORY = 'logical';\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Scalar, Tensor, Tensor2D} from '@tensorflow/tfjs-core';\n// tslint:disable-next-line: no-imports-from-dist\nimport * as tfOps from '@tensorflow/tfjs-core/dist/ops/ops_for_converter';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport {InternalOpExecutor, Node} from '../types';\n\nimport {getParamValue} from './utils';\n\nexport const executeOp: InternalOpExecutor =\n    (node: Node, tensorMap: NamedTensorsMap, context: ExecutionContext,\n     ops = tfOps): Tensor[] => {\n      switch (node.op) {\n        case 'BatchMatMul':\n        case 'BatchMatMulV2':\n        case 'MatMul':\n          return [ops.matMul(\n              getParamValue('a', node, tensorMap, context) as Tensor2D,\n              getParamValue('b', node, tensorMap, context) as Tensor2D,\n              getParamValue('transposeA', node, tensorMap, context) as boolean,\n              getParamValue('transposeB', node, tensorMap, context) as\n                  boolean)];\n\n        case 'Einsum':\n          return [ops.einsum(\n              getParamValue('equation', node, tensorMap, context) as string,\n              ...getParamValue('tensors', node, tensorMap, context) as\n                  Tensor[])];\n\n        case 'Transpose':\n          return [ops.transpose(\n              getParamValue('x', node, tensorMap, context) as Tensor,\n              getParamValue('perm', node, tensorMap, context) as number[])];\n\n        case '_FusedMatMul':\n          const [extraOp, activationFunc] =\n              (getParamValue('fusedOps', node, tensorMap, context) as string[]);\n\n          const isBiasAdd = extraOp === 'biasadd';\n          const isPrelu = activationFunc === 'prelu';\n\n          const numArgs =\n              (getParamValue('numArgs', node, tensorMap, context) as number);\n          const leakyreluAlpha =\n              getParamValue('leakyreluAlpha', node, tensorMap, context) as\n              number;\n\n          if (isBiasAdd) {\n            if (isPrelu && numArgs !== 2) {\n              throw new Error(\n                  'Fused MatMul with BiasAdd and Prelu must have two ' +\n                  'extra arguments: bias and alpha.');\n            }\n            if (!isPrelu && numArgs !== 1) {\n              throw new Error(\n                  'Fused MatMul with BiasAdd must have one extra argument: bias.');\n            }\n          }\n          const [biasArg, preluArg] =\n              getParamValue('args', node, tensorMap, context) as Tensor[];\n          return [ops.fused.matMul({\n            a: getParamValue('a', node, tensorMap, context) as Tensor2D,\n            b: getParamValue('b', node, tensorMap, context) as Tensor2D,\n            transposeA: getParamValue('transposeA', node, tensorMap, context) as\n                boolean,\n            transposeB: getParamValue('transposeB', node, tensorMap, context) as\n                boolean,\n            bias: biasArg,\n            activation: activationFunc as tfOps.fused.Activation,\n            preluActivationWeights: preluArg,\n            leakyreluAlpha\n          })];\n\n        case 'MatrixBandPart':\n          return [ops.linalg.bandPart(\n              getParamValue('a', node, tensorMap, context) as Tensor2D,\n              getParamValue('numLower', node, tensorMap, context) as Scalar,\n              getParamValue('numUpper', node, tensorMap, context) as Scalar)];\n\n        default:\n          throw TypeError(`Node type ${node.op} is not implemented`);\n      }\n    };\n\nexport const CATEGORY = 'matrices';\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor, Tensor3D, Tensor4D} from '@tensorflow/tfjs-core';\n// tslint:disable-next-line: no-imports-from-dist\nimport * as tfOps from '@tensorflow/tfjs-core/dist/ops/ops_for_converter';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport {InternalOpExecutor, Node} from '../types';\n\nimport {getParamValue} from './utils';\n\nexport const executeOp: InternalOpExecutor =\n    (node: Node, tensorMap: NamedTensorsMap,\n     context: ExecutionContext, ops = tfOps): Tensor[] => {\n      switch (node.op) {\n        case 'EuclideanNorm':\n          return [ops.euclideanNorm(\n              getParamValue('x', node, tensorMap, context) as Tensor,\n              getParamValue('axis', node, tensorMap, context) as number[],\n              getParamValue('keepDims', node, tensorMap, context) as boolean)];\n        case 'FusedBatchNorm':\n        case 'FusedBatchNormV2': {\n          return [ops.batchNorm(\n              getParamValue('x', node, tensorMap, context) as Tensor,\n              getParamValue('mean', node, tensorMap, context) as Tensor,\n              getParamValue('variance', node, tensorMap, context) as Tensor,\n              getParamValue('offset', node, tensorMap, context) as Tensor,\n              getParamValue('scale', node, tensorMap, context) as Tensor,\n              getParamValue('epsilon', node, tensorMap, context) as number)];\n        }\n        case 'FusedBatchNormV3': {\n          return [ops.batchNorm(\n              getParamValue('x', node, tensorMap, context) as Tensor,\n              getParamValue('mean', node, tensorMap, context) as Tensor,\n              getParamValue('variance', node, tensorMap, context) as Tensor,\n              getParamValue('offset', node, tensorMap, context) as Tensor,\n              getParamValue('scale', node, tensorMap, context) as Tensor,\n              getParamValue('epsilon', node, tensorMap, context) as number)];\n        }\n        case 'LRN': {\n          return [ops.localResponseNormalization(\n              getParamValue('x', node, tensorMap, context) as Tensor3D |\n                  Tensor4D,\n              getParamValue('radius', node, tensorMap, context) as number,\n              getParamValue('bias', node, tensorMap, context) as number,\n              getParamValue('alpha', node, tensorMap, context) as number,\n              getParamValue('beta', node, tensorMap, context) as number)];\n        }\n        case 'Softmax': {\n          return [ops.softmax(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        }\n        case 'LogSoftmax': {\n          return [ops.logSoftmax(\n              getParamValue('x', node, tensorMap, context) as Tensor)];\n        }\n        default:\n          throw TypeError(`Node type ${node.op} is not implemented`);\n      }\n    };\n\nexport const CATEGORY = 'normalization';\n", "/**\n * @license\n * Copyright 2022 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor, Tensor1D} from '@tensorflow/tfjs-core';\n// tslint:disable-next-line: no-imports-from-dist\nimport * as tfOps from '@tensorflow/tfjs-core/dist/ops/ops_for_converter';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport {InternalOpExecutor, Node} from '../types';\n\nimport {getParamValue} from './utils';\n\nexport const executeOp: InternalOpExecutor =\n    (node: Node, tensorMap: NamedTensorsMap, context: ExecutionContext,\n     ops = tfOps): Tensor[] => {\n      switch (node.op) {\n        case 'RaggedGather': {\n          const {\n            outputNestedSplits,\n            outputDenseValues,\n          } =\n              ops.raggedGather(\n                  getParamValue(\n                      'paramsNestedSplits', node, tensorMap, context) as\n                      Tensor[],\n                  getParamValue(\n                      'paramsDenseValues', node, tensorMap, context) as Tensor,\n                  getParamValue('indices', node, tensorMap, context) as Tensor,\n                  getParamValue('outputRaggedRank', node, tensorMap, context) as\n                      number);\n          return outputNestedSplits.concat(outputDenseValues);\n        }\n        case 'RaggedRange': {\n          const {rtNestedSplits, rtDenseValues} = ops.raggedRange(\n              getParamValue('starts', node, tensorMap, context) as Tensor,\n              getParamValue('limits', node, tensorMap, context) as Tensor,\n              getParamValue('splits', node, tensorMap, context) as Tensor);\n          return [rtNestedSplits, rtDenseValues];\n        }\n        case 'RaggedTensorToTensor': {\n          return [ops.raggedTensorToTensor(\n              getParamValue('shape', node, tensorMap, context) as Tensor,\n              getParamValue('values', node, tensorMap, context) as Tensor1D,\n              getParamValue('defaultValue', node, tensorMap, context) as Tensor,\n              getParamValue('rowPartitionTensors', node, tensorMap, context) as\n                  Tensor[],\n              getParamValue('rowPartitionTypes', node, tensorMap, context) as\n                  string[])];\n        }\n        default:\n          throw TypeError(`Node type ${node.op} is not implemented`);\n      }\n    };\n\nexport const CATEGORY = 'ragged';\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor, Tensor1D, Tensor2D} from '@tensorflow/tfjs-core';\n// tslint:disable-next-line: no-imports-from-dist\nimport * as tfOps from '@tensorflow/tfjs-core/dist/ops/ops_for_converter';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport {InternalOpExecutor, Node} from '../types';\n\nimport {getParamValue} from './utils';\n\nexport const executeOp: InternalOpExecutor =\n    (node: Node, tensorMap: NamedTensorsMap,\n     context: ExecutionContext, ops = tfOps): Tensor[] => {\n      switch (node.op) {\n        case 'Max': {\n          const axis =\n              getParamValue('axis', node, tensorMap, context) as number[];\n          const keepDims =\n              getParamValue('keepDims', node, tensorMap, context) as boolean;\n          return [ops.max(\n              getParamValue('x', node, tensorMap, context) as Tensor, axis,\n              keepDims)];\n        }\n        case 'Mean': {\n          const axis =\n              getParamValue('axis', node, tensorMap, context) as number[];\n          const keepDims =\n              getParamValue('keepDims', node, tensorMap, context) as boolean;\n          return [ops.mean(\n              getParamValue('x', node, tensorMap, context) as Tensor, axis,\n              keepDims)];\n        }\n        case 'Min': {\n          const axis =\n              getParamValue('axis', node, tensorMap, context) as number[];\n          const keepDims =\n              getParamValue('keepDims', node, tensorMap, context) as boolean;\n          return [ops.min(\n              getParamValue('x', node, tensorMap, context) as Tensor, axis,\n              keepDims)];\n        }\n        case 'Sum': {\n          const axis =\n              getParamValue('axis', node, tensorMap, context) as number[];\n          const keepDims =\n              getParamValue('keepDims', node, tensorMap, context) as boolean;\n          return [ops.sum(\n              getParamValue('x', node, tensorMap, context) as Tensor, axis,\n              keepDims)];\n        }\n        case 'All': {\n          const axis =\n              getParamValue('axis', node, tensorMap, context) as number[];\n          const keepDims =\n              getParamValue('keepDims', node, tensorMap, context) as boolean;\n          return [ops.all(\n              getParamValue('x', node, tensorMap, context) as Tensor, axis,\n              keepDims)];\n        }\n        case 'Any': {\n          const axis =\n              getParamValue('axis', node, tensorMap, context) as number[];\n          const keepDims =\n              getParamValue('keepDims', node, tensorMap, context) as boolean;\n          return [ops.any(\n              getParamValue('x', node, tensorMap, context) as Tensor, axis,\n              keepDims)];\n        }\n        case 'ArgMax': {\n          const axis =\n              getParamValue('axis', node, tensorMap, context) as number;\n          return [ops.argMax(\n              getParamValue('x', node, tensorMap, context) as Tensor, axis)];\n        }\n        case 'ArgMin': {\n          const axis =\n              getParamValue('axis', node, tensorMap, context) as number;\n          return [ops.argMin(\n              getParamValue('x', node, tensorMap, context) as Tensor, axis)];\n        }\n        case 'Prod': {\n          const axis =\n              getParamValue('axis', node, tensorMap, context) as number[];\n          const keepDims =\n              getParamValue('keepDims', node, tensorMap, context) as boolean;\n          return [ops.prod(\n              getParamValue('x', node, tensorMap, context) as Tensor, axis,\n              keepDims)];\n        }\n        case 'Cumprod': {\n          const axis =\n              getParamValue('axis', node, tensorMap, context) as number;\n          const exclusive =\n              getParamValue('exclusive', node, tensorMap, context) as boolean;\n          const reverse =\n              getParamValue('reverse', node, tensorMap, context) as boolean;\n          return [ops.cumprod(\n              getParamValue('x', node, tensorMap, context) as Tensor, axis,\n              exclusive, reverse)];\n        }\n        case 'Cumsum': {\n          const axis =\n              getParamValue('axis', node, tensorMap, context) as number;\n          const exclusive =\n              getParamValue('exclusive', node, tensorMap, context) as boolean;\n          const reverse =\n              getParamValue('reverse', node, tensorMap, context) as boolean;\n          return [ops.cumsum(\n              getParamValue('x', node, tensorMap, context) as Tensor, axis,\n              exclusive, reverse)];\n        }\n        case 'Bincount':\n          const x = getParamValue('x', node, tensorMap, context) as Tensor1D;\n          const weights =\n              getParamValue('weights', node, tensorMap, context) as Tensor1D;\n          const size =\n              getParamValue('size', node, tensorMap, context) as number;\n\n          return [ops.bincount(x, weights, size)];\n        case 'DenseBincount': {\n          const x = getParamValue('x', node, tensorMap, context) as Tensor1D |\n              Tensor2D;\n          const weights =\n              getParamValue('weights', node, tensorMap, context) as Tensor1D |\n              Tensor2D;\n          const size =\n              getParamValue('size', node, tensorMap, context) as number;\n\n          const binaryOutput =\n              getParamValue('binaryOutput', node, tensorMap, context) as\n              boolean;\n\n          return [ops.denseBincount(x, weights, size, binaryOutput)];\n        }\n        default:\n          throw TypeError(`Node type ${node.op} is not implemented`);\n      }\n    };\n\nexport const CATEGORY = 'reduction';\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Scalar, Tensor, Tensor1D, tidy, util} from '@tensorflow/tfjs-core';\n// tslint:disable-next-line: no-imports-from-dist\nimport * as tfOps from '@tensorflow/tfjs-core/dist/ops/ops_for_converter';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport {InternalOpExecutor, Node} from '../types';\n\nimport {getParamValue} from './utils';\n\nexport const executeOp: InternalOpExecutor =\n    (node: Node, tensorMap: NamedTensorsMap, context: ExecutionContext,\n     ops = tfOps): Tensor[] => {\n      switch (node.op) {\n        case 'ConcatV2':\n        case 'Concat': {\n          const n = getParamValue('n', node, tensorMap, context) as number;\n          const axis =\n              getParamValue('axis', node, tensorMap, context) as number;\n          let inputs =\n              getParamValue('tensors', node, tensorMap, context) as Tensor[];\n          inputs = inputs.slice(0, n);\n          return [ops.concat(inputs, axis)];\n        }\n        case 'Gather': {\n          const input = getParamValue('x', node, tensorMap, context) as Tensor;\n          const indices =\n              getParamValue('indices', node, tensorMap, context) as Tensor1D;\n          return [ops.gather(input, ops.cast(indices, 'int32'), 0)];\n        }\n        case 'GatherV2': {\n          const axis =\n              getParamValue('axis', node, tensorMap, context) as number;\n          const batchDims =\n              getParamValue('batchDims', node, tensorMap, context) as number;\n          const input = getParamValue('x', node, tensorMap, context) as Tensor;\n          const indices =\n              getParamValue('indices', node, tensorMap, context) as Tensor1D;\n          return [ops.gather(\n              input, ops.cast(indices, 'int32'), axis, batchDims)];\n        }\n        case 'Reverse': {\n          const dims =\n              getParamValue('dims', node, tensorMap, context) as boolean[];\n          const axis = [];\n          for (let i = 0; i < dims.length; i++) {\n            if (dims[i]) {\n              axis.push(i);\n            }\n          }\n          const input = getParamValue('x', node, tensorMap, context) as Tensor;\n          return [ops.reverse(input, axis)];\n        }\n        case 'ReverseV2': {\n          const axis =\n              getParamValue('axis', node, tensorMap, context) as number[];\n          const input = getParamValue('x', node, tensorMap, context) as Tensor;\n          return [ops.reverse(input, axis)];\n        }\n        case 'Slice': {\n          // tslint:disable-next-line:no-any\n          const begin = getParamValue('begin', node, tensorMap, context) as any;\n          // tslint:disable-next-line:no-any\n          const size = getParamValue('size', node, tensorMap, context) as any;\n          return [ops.slice(\n              getParamValue('x', node, tensorMap, context) as Tensor, begin,\n              size)];\n        }\n        case 'StridedSlice': {\n          const begin =\n              getParamValue('begin', node, tensorMap, context) as number[];\n          const end =\n              getParamValue('end', node, tensorMap, context) as number[];\n          const strides =\n              getParamValue('strides', node, tensorMap, context) as number[];\n          const beginMask =\n              getParamValue('beginMask', node, tensorMap, context) as number;\n          const endMask =\n              getParamValue('endMask', node, tensorMap, context) as number;\n          const ellipsisMask =\n              getParamValue('ellipsisMask', node, tensorMap, context) as number;\n          const newAxisMask =\n              getParamValue('newAxisMask', node, tensorMap, context) as number;\n          const shrinkAxisMask =\n              getParamValue('shrinkAxisMask', node, tensorMap, context) as\n              number;\n          const tensor = getParamValue('x', node, tensorMap, context) as Tensor;\n\n          return [ops.stridedSlice(\n              tensor, begin, end, strides, beginMask, endMask, ellipsisMask,\n              newAxisMask, shrinkAxisMask)];\n        }\n        case 'Pack': {\n          return tidy(() => {\n            const axis =\n                getParamValue('axis', node, tensorMap, context) as number;\n            const tensors =\n                getParamValue('tensors', node, tensorMap, context) as Tensor[];\n            // Reshape the tensors to the first tensor's shape if they don't\n            // match.\n            const shape = tensors[0].shape;\n            const squeezedShape = ops.squeeze(tensors[0]).shape;\n            const mapped = tensors.map(tensor => {\n              const sameShape = util.arraysEqual(tensor.shape, shape);\n              if (!sameShape &&\n                  !util.arraysEqual(ops.squeeze(tensor).shape, squeezedShape)) {\n                throw new Error('the input tensors shape does not match');\n              }\n              return sameShape ? tensor : ops.reshape(tensor, shape);\n            });\n            return [ops.stack(mapped, axis)];\n          });\n        }\n        case 'Unpack': {\n          const axis =\n              getParamValue('axis', node, tensorMap, context) as number;\n          const tensor =\n              getParamValue('tensor', node, tensorMap, context) as Tensor;\n          return ops.unstack(tensor, axis);\n        }\n        case 'Tile': {\n          const reps =\n              getParamValue('reps', node, tensorMap, context) as number[];\n          return [ops.tile(\n              getParamValue('x', node, tensorMap, context) as Tensor, reps)];\n        }\n        case 'Split':\n        case 'SplitV': {\n          const axis =\n              getParamValue('axis', node, tensorMap, context) as number;\n          const numOrSizeSplits =\n              getParamValue('numOrSizeSplits', node, tensorMap, context) as\n                  number |\n              number[];\n          const tensor = getParamValue('x', node, tensorMap, context) as Tensor;\n\n          return ops.split(tensor, numOrSizeSplits, axis);\n        }\n        case 'ScatterNd': {\n          const indices =\n              getParamValue('indices', node, tensorMap, context) as Tensor;\n          const values =\n              getParamValue('values', node, tensorMap, context) as Tensor;\n          const shape =\n              getParamValue('shape', node, tensorMap, context) as number[];\n          return [ops.scatterND(indices, values, shape)];\n        }\n        case 'GatherNd': {\n          const x = getParamValue('x', node, tensorMap, context) as Tensor;\n          const indices =\n              getParamValue('indices', node, tensorMap, context) as Tensor;\n          return [ops.gatherND(x, indices)];\n        }\n        case 'SparseToDense': {\n          const indices =\n              getParamValue('sparseIndices', node, tensorMap, context) as\n              Tensor;\n          const shape =\n              getParamValue('outputShape', node, tensorMap, context) as\n              number[];\n          const sparseValues =\n              getParamValue('sparseValues', node, tensorMap, context) as Tensor;\n          const defaultValue =\n              getParamValue('defaultValue', node, tensorMap, context) as Scalar;\n          return [ops.sparseToDense(\n              indices, sparseValues, shape,\n              sparseValues.dtype === defaultValue.dtype ?\n                  defaultValue :\n                  ops.cast(defaultValue, sparseValues.dtype))];\n        }\n        case 'TensorScatterUpdate': {\n          const indices =\n              getParamValue('indices', node, tensorMap, context) as Tensor;\n          const values =\n              getParamValue('values', node, tensorMap, context) as Tensor;\n          const tensor =\n              getParamValue('tensor', node, tensorMap, context) as Tensor;\n          return [ops.tensorScatterUpdate(tensor, indices, values)];\n        }\n        default:\n          throw TypeError(`Node type ${node.op} is not implemented`);\n      }\n    };\n\nexport const CATEGORY = 'slice_join';\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Scalar, Tensor, Tensor1D, Tensor2D} from '@tensorflow/tfjs-core';\n// tslint:disable-next-line: no-imports-from-dist\nimport * as tfOps from '@tensorflow/tfjs-core/dist/ops/ops_for_converter';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport {InternalOpExecutor, Node} from '../types';\n\nimport {getParamValue} from './utils';\n\nexport const executeOp: InternalOpExecutor =\n    (node: Node, tensorMap: NamedTensorsMap,\n     context: ExecutionContext, ops = tfOps): Tensor[] => {\n      switch (node.op) {\n        case 'SparseFillEmptyRows': {\n          const {\n            outputIndices,\n            outputValues,\n            emptyRowIndicator,\n            reverseIndexMap\n          } =\n              ops.sparse.sparseFillEmptyRows(\n                  getParamValue('indices', node, tensorMap, context) as\n                      Tensor2D,\n                  getParamValue('values', node, tensorMap, context) as Tensor1D,\n                  getParamValue('denseShape', node, tensorMap, context) as\n                      Tensor1D,\n                  getParamValue('defaultValue', node, tensorMap, context) as\n                      Scalar);\n          return [\n            outputIndices, outputValues, emptyRowIndicator, reverseIndexMap\n          ];\n        }\n        case 'SparseReshape': {\n          const {outputIndices, outputShape} = ops.sparse.sparseReshape(\n              getParamValue('inputIndices', node, tensorMap, context) as\n                  Tensor2D,\n              getParamValue('inputShape', node, tensorMap, context) as Tensor1D,\n              getParamValue('newShape', node, tensorMap, context) as Tensor1D);\n          return [outputIndices, outputShape];\n        }\n        case 'SparseSegmentMean': {\n          const outputData = ops.sparse.sparseSegmentMean(\n              getParamValue('data', node, tensorMap, context) as Tensor,\n              getParamValue('indices', node, tensorMap, context) as Tensor1D,\n              getParamValue('segmentIds', node, tensorMap, context) as\n                  Tensor1D);\n          return [outputData];\n        }\n        case 'SparseSegmentSum': {\n          const outputData = ops.sparse.sparseSegmentSum(\n              getParamValue('data', node, tensorMap, context) as Tensor,\n              getParamValue('indices', node, tensorMap, context) as Tensor1D,\n              getParamValue('segmentIds', node, tensorMap, context) as\n                  Tensor1D);\n          return [outputData];\n        }\n        default:\n          throw TypeError(`Node type ${node.op} is not implemented`);\n      }\n    };\n\nexport const CATEGORY = 'sparse';\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor} from '@tensorflow/tfjs-core';\n// tslint:disable-next-line: no-imports-from-dist\nimport * as tfOps from '@tensorflow/tfjs-core/dist/ops/ops_for_converter';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport {InternalOpExecutor, Node} from '../types';\n\nimport {getParamValue} from './utils';\n\nexport const executeOp: InternalOpExecutor =\n    (node: Node, tensorMap: NamedTensorsMap, context: ExecutionContext,\n     ops = tfOps): Tensor[] => {\n          switch (node.op) {\n            case 'FFT': {\n              return [ops.fft(\n                  getParamValue('x', node, tensorMap, context) as Tensor)];\n            }\n            case 'IFFT': {\n              return [ops.ifft(\n                  getParamValue('x', node, tensorMap, context) as Tensor)];\n            }\n            case 'RFFT': {\n              return [ops.rfft(\n                  getParamValue('x', node, tensorMap, context) as Tensor)];\n            }\n            case 'IRFFT': {\n              return [ops.irfft(\n                  getParamValue('x', node, tensorMap, context) as Tensor)];\n            }\n            default:\n              throw TypeError(`Node type ${node.op} is not implemented`);\n          }\n        };\n\nexport const CATEGORY = 'spectral';\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Scalar, Tensor, Tensor1D} from '@tensorflow/tfjs-core';\n// tslint:disable-next-line: no-imports-from-dist\nimport * as tfOps from '@tensorflow/tfjs-core/dist/ops/ops_for_converter';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport {InternalOpExecutor, Node} from '../types';\n\nimport {getParamValue} from './utils';\n\nexport const executeOp: InternalOpExecutor =\n    (node: Node, tensorMap: NamedTensorsMap,\n     context: ExecutionContext, ops = tfOps): Tensor[] => {\n      switch (node.op) {\n        case 'StaticRegexReplace': {\n          return [ops.string.staticRegexReplace(\n            getParamValue('input', node, tensorMap, context) as Tensor,\n            getParamValue('pattern', node, tensorMap, context) as string,\n            getParamValue('rewrite', node, tensorMap, context) as string,\n            getParamValue('replaceGlobal', node, tensorMap, context) as boolean,\n          )];\n        }\n        case 'StringNGrams': {\n          const {nGrams, nGramsSplits} = ops.string.stringNGrams(\n              getParamValue('data', node, tensorMap, context) as Tensor1D,\n              getParamValue('dataSplits', node, tensorMap, context) as Tensor,\n              getParamValue('separator', node, tensorMap, context) as string,\n              getParamValue('nGramWidths', node, tensorMap, context) as\n                  number[],\n              getParamValue('leftPad', node, tensorMap, context) as string,\n              getParamValue('rightPad', node, tensorMap, context) as string,\n              getParamValue('padWidth', node, tensorMap, context) as number,\n              getParamValue(\n                  'preserveShortSequences', node, tensorMap, context) as\n                  boolean);\n          return [nGrams, nGramsSplits];\n        }\n        case 'StringSplit': {\n          const {indices, values, shape} = ops.string.stringSplit(\n              getParamValue('input', node, tensorMap, context) as Tensor1D,\n              getParamValue('delimiter', node, tensorMap, context) as Scalar,\n              getParamValue('skipEmpty', node, tensorMap, context) as boolean);\n          return [indices, values, shape];\n        }\n        case 'StringToHashBucketFast': {\n          const output = ops.string.stringToHashBucketFast(\n              getParamValue('input', node, tensorMap, context) as Tensor,\n              getParamValue('numBuckets', node, tensorMap, context) as number);\n          return [output];\n        }\n        default:\n          throw TypeError(`Node type ${node.op} is not implemented`);\n      }\n    };\n\nexport const CATEGORY = 'string';\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Tensor, Tensor4D} from '@tensorflow/tfjs-core';\n// tslint:disable-next-line: no-imports-from-dist\nimport * as tfOps from '@tensorflow/tfjs-core/dist/ops/ops_for_converter';\n\nimport {NamedTensorsMap} from '../../data/types';\nimport {ExecutionContext} from '../../executor/execution_context';\nimport {InternalOpExecutor, Node} from '../types';\n\nimport {getParamValue} from './utils';\n\nexport const executeOp: InternalOpExecutor =\n    (node: Node, tensorMap: NamedTensorsMap, context: ExecutionContext,\n     ops = tfOps): Tensor[] => {\n      switch (node.op) {\n        case 'Cast': {\n          return [ops.cast(\n              getParamValue('x', node, tensorMap, context) as Tensor,\n              getParamValue('dtype', node, tensorMap, context) as 'int32' |\n                  'float32' | 'bool')];\n        }\n        case 'ExpandDims': {\n          const axis =\n              getParamValue('axis', node, tensorMap, context) as number;\n          return [ops.expandDims(\n              getParamValue('x', node, tensorMap, context) as Tensor, axis)];\n        }\n        case 'Squeeze': {\n          const axis =\n              getParamValue('axis', node, tensorMap, context) as number[];\n          return [ops.squeeze(\n              getParamValue('x', node, tensorMap, context) as Tensor, axis)];\n        }\n\n        case 'Reshape': {\n          return [ops.reshape(\n              getParamValue('x', node, tensorMap, context) as Tensor,\n              getParamValue('shape', node, tensorMap, context) as number[])];\n        }\n        case 'EnsureShape': {\n          return [ops.ensureShape(\n              getParamValue('x', node, tensorMap, context) as Tensor,\n              getParamValue('shape', node, tensorMap, context) as number[])];\n        }\n        case 'MirrorPad': {\n          return [ops.mirrorPad(\n              getParamValue('x', node, tensorMap, context) as Tensor,\n              getParamValue('padding', node, tensorMap, context) as\n                  Array<[number, number]>,\n              getParamValue('mode', node, tensorMap, context) as 'reflect' |\n                  'symmetric')];\n        }\n        case 'PadV2':\n        case 'Pad': {\n          return [ops.pad(\n              getParamValue('x', node, tensorMap, context) as Tensor,\n              getParamValue('padding', node, tensorMap, context) as\n                  Array<[number, number]>,\n              getParamValue('constantValue', node, tensorMap, context) as\n                  number)];\n        }\n        case 'SpaceToBatchND': {\n          const blockShape =\n              getParamValue('blockShape', node, tensorMap, context) as number[];\n          const paddings =\n              getParamValue('paddings', node, tensorMap, context) as number[][];\n          return [ops.spaceToBatchND(\n              getParamValue('x', node, tensorMap, context) as Tensor,\n              blockShape, paddings)];\n        }\n        case 'BatchToSpaceND': {\n          const blockShape =\n              getParamValue('blockShape', node, tensorMap, context) as number[];\n          const crops =\n              getParamValue('crops', node, tensorMap, context) as number[][];\n          return [ops.batchToSpaceND(\n              getParamValue('x', node, tensorMap, context) as Tensor,\n              blockShape, crops)];\n        }\n        case 'DepthToSpace': {\n          const blockSize =\n              getParamValue('blockSize', node, tensorMap, context) as number;\n          const dataFormat =\n              (getParamValue('dataFormat', node, tensorMap, context) as\n               string).toUpperCase() as 'NHWC' |\n              'NCHW';\n          return [ops.depthToSpace(\n              getParamValue('x', node, tensorMap, context) as Tensor4D,\n              blockSize, dataFormat)];\n        }\n        case 'BroadcastTo': {\n          return [ops.broadcastTo(\n              getParamValue('x', node, tensorMap, context) as Tensor,\n              getParamValue('shape', node, tensorMap, context) as number[])];\n        }\n        case 'BroadcastArgs': {\n          return [ops.broadcastArgs(\n              getParamValue('s0', node, tensorMap, context) as Tensor,\n              getParamValue('s1', node, tensorMap, context) as Tensor)];\n        }\n        default:\n          throw TypeError(`Node type ${node.op} is not implemented`);\n      }\n    };\n\nexport const CATEGORY = 'transformation';\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport * as tfc from '@tensorflow/tfjs-core';\n\nimport {NamedTensorsMap} from '../data/types';\nimport {ExecutionContext} from '../executor/execution_context';\nimport {ResourceManager} from '../executor/resource_manager';\n\nimport {NodeValueImpl} from './custom_op/node_value_impl';\nimport {getRegisteredOp} from './custom_op/register';\nimport * as arithmetic from './executors/arithmetic_executor';\nimport * as basicMath from './executors/basic_math_executor';\nimport * as control from './executors/control_executor';\nimport * as convolution from './executors/convolution_executor';\nimport * as creation from './executors/creation_executor';\nimport * as dynamic from './executors/dynamic_executor';\nimport * as evaluation from './executors/evaluation_executor';\nimport * as graph from './executors/graph_executor';\nimport * as hashTable from './executors/hash_table_executor';\nimport * as image from './executors/image_executor';\nimport * as logical from './executors/logical_executor';\nimport * as matrices from './executors/matrices_executor';\nimport * as normalization from './executors/normalization_executor';\nimport * as ragged from './executors/ragged_executor';\nimport * as reduction from './executors/reduction_executor';\nimport * as sliceJoin from './executors/slice_join_executor';\nimport * as sparse from './executors/sparse_executor';\nimport * as spectral from './executors/spectral_executor';\nimport * as string from './executors/string_executor';\nimport * as transformation from './executors/transformation_executor';\nimport {Node} from './types';\n\n/**\n * Executes the op defined by the node object.\n * @param node\n * @param tensorMap contains tensors for executed nodes and weights\n * @param context contains tensors and information for running the current node.\n * @param resourceManager Optional. Contains global resources of the model.\n */\nexport function executeOp(\n    node: Node, tensorMap: NamedTensorsMap, context: ExecutionContext,\n    resourceManager?: ResourceManager, tidy = tfc.tidy): tfc.Tensor[]|\n    Promise<tfc.Tensor[]> {\n  const value =\n      ((node: Node, tensorMap: NamedTensorsMap, context: ExecutionContext) => {\n        switch (node.category) {\n          case 'arithmetic':\n            return tidy(() => arithmetic.executeOp(node, tensorMap, context));\n          case 'basic_math':\n            return tidy(() => basicMath.executeOp(node, tensorMap, context));\n          case 'control':\n            return control.executeOp(node, tensorMap, context);\n          case 'convolution':\n            return tidy(() => convolution.executeOp(node, tensorMap, context));\n          case 'creation':\n            return tidy(() => creation.executeOp(node, tensorMap, context));\n          case 'dynamic':\n            return dynamic.executeOp(node, tensorMap, context);\n          case 'evaluation':\n            return tidy(() => evaluation.executeOp(node, tensorMap, context));\n          case 'image':\n            return tidy(() => image.executeOp(node, tensorMap, context));\n          case 'graph':\n            return tidy(() => graph.executeOp(node, tensorMap, context));\n          case 'logical':\n            return tidy(() => logical.executeOp(node, tensorMap, context));\n          case 'matrices':\n            return tidy(() => matrices.executeOp(node, tensorMap, context));\n          case 'normalization':\n            return tidy(\n                () => normalization.executeOp(node, tensorMap, context));\n          case 'ragged':\n            return tidy(() => ragged.executeOp(node, tensorMap, context));\n          case 'reduction':\n            return tidy(() => reduction.executeOp(node, tensorMap, context));\n          case 'slice_join':\n            return tidy(() => sliceJoin.executeOp(node, tensorMap, context));\n          case 'sparse':\n            return tidy(() => sparse.executeOp(node, tensorMap, context));\n          case 'spectral':\n            return tidy(() => spectral.executeOp(node, tensorMap, context));\n          case 'string':\n            return tidy(() => string.executeOp(node, tensorMap, context));\n          case 'transformation':\n            return tidy(\n                () => transformation.executeOp(node, tensorMap, context));\n          case 'hash_table':\n            return hashTable.executeOp(\n                node, tensorMap, context, resourceManager);\n          case 'custom':\n            const opMapper = getRegisteredOp(node.op);\n            if (opMapper && opMapper.customExecutor) {\n              return opMapper.customExecutor(\n                  new NodeValueImpl(node, tensorMap, context));\n            } else {\n              throw TypeError(`Custom op ${node.op} is not registered.`);\n            }\n          default:\n            throw TypeError(\n                `Unknown op '${node.op}'. File an issue at ` +\n                `https://github.com/tensorflow/tfjs/issues so we can add it` +\n                `, or register a custom execution with tf.registerOp()`);\n        }\n      })(node, tensorMap, context);\n  if (tfc.util.isPromise(value)) {\n    return value.then((data) => [].concat(data));\n  }\n  return [].concat(value);\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Tensor} from '@tensorflow/tfjs-core';\n\nimport {NamedTensorsMap, TensorArrayMap, TensorListMap} from '../data/types';\n\nimport {TensorArray} from './tensor_array';\nimport {TensorList} from './tensor_list';\nimport {FunctionExecutor} from './types';\n\nexport interface ExecutionContextInfo {\n  id: number;           // the unique id of the context info\n  frameName: string;    // The frame name of the loop, this comes from\n                        // the TensorFlow NodeDef.\n  iterationId: number;  // The iteration id of the loop\n}\n\n/**\n * ExecutionContext captures the runtime environment of the node. It keeps\n * track of the current frame and iteration for the control flow ops.\n *\n * For example, typical Dynamic RNN model may contain loops, for which\n * TensorFlow will generate graphs with Enter/Exit nodes to control the\n * current execution frame, and NextIteration Nodes for iteration id increment.\n * For model with branch logic, TensorFLow will generate Switch/Merge ops.\n */\nexport class ExecutionContext {\n  private rootContext = {id: 0, frameName: '', iterationId: 0};\n  private contexts: ExecutionContextInfo[] = [this.rootContext];\n  private lastId = 0;\n  private _currentContextIds: string[];\n\n  constructor(\n      readonly weightMap: NamedTensorsMap = {},\n      readonly tensorArrayMap: TensorArrayMap = {},\n      readonly tensorListMap: TensorListMap = {},\n      readonly functionMap: {[key: string]: FunctionExecutor} = {},\n      readonly parseNodeNameCache?: Map<string, [string, number, string?]>) {\n    this.generateCurrentContextIds();\n  }\n\n  private newFrame(id: number, frameName: string) {\n    return {id, frameName, iterationId: 0};\n  }\n\n  /**\n   * Set the current context\n   * @param contexts: ExecutionContextInfo[] the current path of execution\n   * frames\n   */\n  set currentContext(contexts: ExecutionContextInfo[]) {\n    if (this.contexts !== contexts) {\n      this.contexts = contexts;\n      this.generateCurrentContextIds();\n    }\n  }\n\n  get currentContext(): ExecutionContextInfo[] {\n    return this.contexts;\n  }\n\n  /**\n   * Returns the current context in string format.\n   */\n  get currentContextId(): string {\n    return this._currentContextIds[0];\n  }\n\n  /**\n   * Returns the current context and all parent contexts in string format.\n   * This allow access to the nodes in the current and parent frames.\n   */\n  get currentContextIds(): string[] {\n    return this._currentContextIds;\n  }\n\n  private generateCurrentContextIds() {\n    const names = [];\n    for (let i = 0; i < this.contexts.length - 1; i++) {\n      const contexts = this.contexts.slice(0, this.contexts.length - i);\n      names.push(this.contextIdforContexts(contexts));\n    }\n    names.push('');\n    this._currentContextIds = names;\n  }\n\n  private contextIdforContexts(contexts: ExecutionContextInfo[]) {\n    return contexts ?\n        contexts\n            .map(\n                context => (context.id === 0 && context.iterationId === 0) ?\n                    '' :\n                    `${context.frameName}-${context.iterationId}`)\n            .join('/') :\n        '';\n  }\n\n  /**\n   * Enter a new frame, a new context is pushed on the current context list.\n   * @param frameId new frame id\n   */\n  enterFrame(frameId: string) {\n    if (this.contexts) {\n      this.lastId++;\n      this.contexts = this.contexts.slice();\n      this.contexts.push(this.newFrame(this.lastId, frameId));\n      this._currentContextIds.unshift(this.contextIdforContexts(this.contexts));\n    }\n  }\n\n  /**\n   * Exit the current frame, the last context is removed from the current\n   * context list.\n   */\n  exitFrame() {\n    if (this.contexts && this.contexts.length > 1) {\n      this.contexts = this.contexts.slice();\n      this.contexts.splice(-1);\n      this.currentContextIds.shift();\n    } else {\n      throw new Error('Cannot exit frame, the context is empty');\n    }\n  }\n\n  /**\n   * Enter the next iteration of a loop, the iteration id of last context is\n   * increased.\n   */\n  nextIteration() {\n    if (this.contexts && this.contexts.length > 0) {\n      this.contexts = this.contexts.slice();\n      this.lastId++;\n      const context =\n          Object.assign({}, this.contexts[this.contexts.length - 1]);\n      context.iterationId += 1;\n      context.id = this.lastId;\n      this.contexts.splice(-1, 1, context);\n      this._currentContextIds.splice(\n          0, 1, this.contextIdforContexts(this.contexts));\n    } else {\n      throw new Error('Cannot increase frame iteration, the context is empty');\n    }\n  }\n\n  getWeight(name: string): Tensor[] {\n    return this.weightMap[name];\n  }\n\n  addTensorArray(tensorArray: TensorArray) {\n    this.tensorArrayMap[tensorArray.id] = tensorArray;\n  }\n\n  getTensorArray(id: number): TensorArray {\n    return this.tensorArrayMap[id];\n  }\n\n  addTensorList(tensorList: TensorList) {\n    this.tensorListMap[tensorList.id] = tensorList;\n  }\n\n  getTensorList(id: number): TensorList {\n    return this.tensorListMap[id];\n  }\n\n  dispose(keepIds: Set<number>) {\n    for (const key in this.tensorArrayMap) {\n      this.tensorArrayMap[key].clearAndClose(keepIds);\n    }\n\n    for (const key in this.tensorListMap) {\n      this.tensorListMap[key].clearAndClose(keepIds);\n    }\n  }\n}\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {NamedTensorMap} from '@tensorflow/tfjs-core';\n\nimport {NamedTensorsMap} from '../data/types';\nimport {parseNodeName} from '../operations/executors/utils';\nimport {Graph, Node} from '../operations/types';\n\nexport interface ExecutionInfo {\n  inputs: NamedTensorMap;\n  outputs: Node[];\n  usedNodes: Set<string>;\n  missingInputs: string[];\n  dynamicNode: Node;\n  syncInputs: string[];\n}\n\n/**\n * Given graph inputs and desired outputs, find the minimal set of nodes\n * to execute in order to compute the outputs. In addition return other useful\n * info such:\n * - Missing inputs needed to compute the output.\n * - Whether the subgraph contains dynamic ops (control flow, dynamic shape).\n * - Alternative inputs in order to avoid async (dynamic op) execution.\n */\nexport function getExecutionSubgraph(\n    inputs: NamedTensorMap, outputs: Node[], weightMap: NamedTensorsMap,\n    initNodes?: Node[]): ExecutionInfo {\n  const usedNodes = new Set<string>();\n  const missingInputs: string[] = [];\n  let dynamicNode: Node = null;\n  let syncInputs: string[] = null;\n\n  // Start with the outputs, going backwards and find all the nodes that are\n  // needed to compute those outputs.\n  const seen = new Set<string>();\n  const inputNodeNames =\n      new Set(Object.keys(inputs).map((name) => parseNodeName(name)[0]));\n\n  initNodes = initNodes || [];\n  const initNodeNames =\n      new Set(initNodes.map((node) => parseNodeName(node.name)[0]));\n\n  const frontier = [...outputs];\n  while (frontier.length > 0) {\n    const node = frontier.pop();\n    if (isControlFlow(node) || isDynamicShape(node) || isHashTable(node)) {\n      if (dynamicNode == null) {\n        dynamicNode = node;\n        syncInputs = dynamicNode.children.map(child => child.name)\n                         .filter(name => usedNodes.has(name));\n      }\n    }\n    usedNodes.add(node.name);\n\n    // Weights are dead end since we already have their values.\n    if (weightMap[node.name] != null) {\n      continue;\n    }\n    // This node is a dead end since it's one of the user-provided inputs.\n    if (inputNodeNames.has(node.name)) {\n      continue;\n    }\n    // This node is a dead end since it doesn't have any inputs.\n    if (initNodeNames.has(node.name)) {\n      continue;\n    }\n    if (node.inputs.length === 0) {\n      missingInputs.push(node.name);\n      continue;\n    }\n    node.inputs.forEach(input => {\n      // Don't add to the frontier if it is already there.\n      if (seen.has(input.name)) {\n        return;\n      }\n      seen.add(input.name);\n      frontier.push(input);\n    });\n  }\n  return {inputs, outputs, usedNodes, missingInputs, dynamicNode, syncInputs};\n}\n\n/**\n * Given the execution info, return a list of nodes in topological order that\n * need to be executed to compute the output.\n */\nexport function getNodesInTopologicalOrder(\n    graph: Graph, executionInfo: ExecutionInfo): Node[] {\n  const {usedNodes, inputs} = executionInfo;\n  const inputNodes = Object.keys(inputs)\n                         .map(name => parseNodeName(name)[0])\n                         .map(name => graph.nodes[name]);\n  const initNodes = graph.initNodes || [];\n\n  const isUsed = (node: Node|string) =>\n      usedNodes.has(typeof node === 'string' ? node : node.name);\n\n  function unique(nodes: Node[]): Node[] {\n    return [...new Map(nodes.map((node) => [node.name, node])).values()];\n  }\n  const predefinedNodes = unique([\n                            ...inputNodes,\n                            ...graph.weights,\n                            ...initNodes,\n                          ]).filter(isUsed);\n  const allNodes = unique([\n                     ...predefinedNodes,\n                     ...Object.values(graph.nodes),\n                   ]).filter(isUsed);\n  const nameToNode =\n      new Map<string, Node>(allNodes.map((node) => [node.name, node]));\n\n  const inCounts: Record<string, number> = {};\n  for (const node of allNodes) {\n    inCounts[node.name] = inCounts[node.name] || 0;\n    for (const child of node.children) {\n      // When the child is unused, set in counts to infinity so that it will\n      // never be decreased to 0 and added to the execution list.\n      if (!isUsed(child)) {\n        inCounts[child.name] = Number.POSITIVE_INFINITY;\n      }\n      inCounts[child.name] = (inCounts[child.name] || 0) + 1;\n    }\n  }\n\n  // Build execution order for all used nodes regardless whether they are\n  // predefined or not.\n  const frontier = Object.entries(inCounts)\n                       .filter(([, inCount]) => inCount === 0)\n                       .map(([name]) => name);\n  const orderedNodeNames = [...frontier];\n  while (frontier.length > 0) {\n    const nodeName = frontier.pop();\n    const node = nameToNode.get(nodeName)!;\n    for (const child of node.children.filter(isUsed)) {\n      if (--inCounts[child.name] === 0) {\n        orderedNodeNames.push(child.name);\n        frontier.push(child.name);\n      }\n    }\n  }\n\n  const orderedNodes = orderedNodeNames.map((name) => nameToNode.get(name));\n  const filteredOrderedNodes =\n      filterPredefinedReachableNodes(orderedNodes, predefinedNodes);\n\n  // TODO: Turn validation on/off with tf env flag.\n  validateNodesExecutionOrder(filteredOrderedNodes, predefinedNodes);\n\n  return filteredOrderedNodes;\n}\n\n/**\n * This is a helper function of `getNodesInTopologicalOrder`.\n * Returns ordered nodes reachable by at least one predefined node.\n * This can help us filter out redundant nodes from the returned node list.\n * For example:\n * If we have four nodes with dependencies like this:\n *   a --> b --> c --> d\n * when node `c` is predefined (e.g. given as an input tensor), we can\n * skip node `a` and `b` since their outputs will never be used.\n *\n * @param orderedNodes Graph nodes in execution order.\n * @param predefinedNodes Graph inputs, weights, and init nodes. Nodes in this\n *     list must have distinct names.\n */\nfunction filterPredefinedReachableNodes(\n    orderedNodes: Node[], predefinedNodes: Node[]) {\n  const nameToNode =\n      new Map<string, Node>(orderedNodes.map((node) => [node.name, node]));\n\n  // TODO: Filter out more nodes when >=2 nodes are predefined in a path.\n  const stack = predefinedNodes.map((node) => node.name);\n  const predefinedReachableNodeNames = new Set(stack);\n  // Perform a DFS starting from the set of all predefined nodes\n  // to find the set of all nodes reachable from the predefined nodes.\n  while (stack.length > 0) {\n    const nodeName = stack.pop();\n    const node = nameToNode.get(nodeName)!;\n    for (const child of node.children) {\n      if (!nameToNode.has(child.name) ||\n          predefinedReachableNodeNames.has(child.name)) {\n        continue;\n      }\n      predefinedReachableNodeNames.add(child.name);\n      stack.push(child.name);\n    }\n  }\n\n  // Filter out unreachable nodes and build the ordered node list.\n  const filteredOrderedNodes = orderedNodes.filter(\n      (node) => predefinedReachableNodeNames.has(node.name));\n\n  return filteredOrderedNodes;\n}\n\nclass NodesExecutionOrderError extends Error {\n  constructor(message: string) {\n    super(`NodesExecutionOrderError: ${message}`);\n  }\n}\n\n/**\n * This is a helper function of `getNodesInTopologicalOrder`.\n * Validates property: given nodes `a` and `b`, Order(a) > Order(b) if `a`\n * is a child of `b`. This function throws an error if validation fails.\n *\n * @param orderedNodes Graph nodes in execution order.\n * @param predefinedNodes Graph inputs, weights, and init nodes. Nodes in this\n *     list must have distinct names.\n */\nfunction validateNodesExecutionOrder(\n    orderedNodes: Node[], predefinedNodes: Node[]) {\n  const nodeNameToOrder = new Map<string, number>(\n      orderedNodes.map((node, order) => [node.name, order]));\n  const predefinedNodeNames = new Set(predefinedNodes.map((node) => node.name));\n  const isPredefined = (node: Node|string) =>\n      predefinedNodeNames.has(typeof node === 'string' ? node : node.name);\n  const willBeExecutedNodeNames =\n      new Set(orderedNodes.map((node) => node.name));\n  const willBeExecuted = (node: Node|string) =>\n      willBeExecutedNodeNames.has(typeof node === 'string' ? node : node.name);\n\n  for (const node of orderedNodes) {\n    for (const child of node.children.filter(willBeExecuted)) {\n      if (!nodeNameToOrder.has(child.name)) {\n        throw new NodesExecutionOrderError(\n            `Child ${child.name} of node ${node.name} is unreachable.`);\n      }\n      if (nodeNameToOrder.get(node.name) > nodeNameToOrder.get(child.name)) {\n        throw new NodesExecutionOrderError(`Node ${\n            node.name} is scheduled to run after its child ${child.name}.`);\n      }\n    }\n    if (!isPredefined(node)) {\n      for (const input of node.inputs) {\n        if (!nodeNameToOrder.has(input.name)) {\n          throw new NodesExecutionOrderError(\n              `Input ${input.name} of node ${node.name} is unreachable.`);\n        }\n        if (nodeNameToOrder.get(input.name) > nodeNameToOrder.get(node.name)) {\n          throw new NodesExecutionOrderError(`Node ${\n              node.name} is scheduled to run before its input ${input.name}.`);\n        }\n      }\n    }\n  }\n}\n\n/**\n * Given the execution info, return a map from node name to the disposable\n * node name list after its execution.\n *\n * @returns A map from node name to disposable nodes after its\n *     execution. That is, for a node `x`, `nodeLiveUntilMap[x]` indicates\n *     all nodes which their intermediate tensors should be disposed after `x`\n *     being executed.\n */\nexport function getNodeLiveUntilMap(orderedNodes: Node[]): Map<string, Node[]> {\n  const nodeNameToOrder = new Map<string, number>(\n      orderedNodes.map((node, order) => [node.name, order]));\n\n  const INF_LIFE = Number.MAX_SAFE_INTEGER;\n  // Make control flow nodes (and consequently their direct parents)\n  // live forever since they're tricky to track correctly.\n  const selfLifespans = orderedNodes.map(\n      (node, nodeOrder) => isControlFlow(node) ? INF_LIFE : nodeOrder);\n  const getSelfLifeSpan = (node: Node) => {\n    const selfLife = selfLifespans[nodeNameToOrder.get(node.name)!];\n    if (selfLife == null) {\n      // If nodeToOrder does not contain the node, it is unused or\n      // unreachable in graph.\n      return -1;\n    }\n    return selfLife;\n  };\n\n  // `liveUntil[i]` points to the last node in the `orderedNodes` array that\n  // may depend on tensors from node `i`. It indicates that all the\n  // intermediate tensors from `orderedNodes[i]` should be disposed after\n  // `orderedNodes[liveUntil[i]]` is executed.\n  // A node lives long enough to pass on its tensors to its children.\n  // It lives until at least `max(node's position, children's positions)`.\n  const liveUntilOrders = orderedNodes.map((node, nodeOrder) => {\n    return node.children.map(getSelfLifeSpan)\n        .reduce((a, b) => Math.max(a, b), selfLifespans[nodeOrder]);\n  });\n\n  // liveUntilMap:\n  // - Key: Name of a node `x`\n  // - Values: All nodes whose intermediate tensors should be disposed\n  //           after `x` is executed.\n  const liveUntilMap = new Map<string, Node[]>();\n  for (let nodeOrder = 0; nodeOrder < orderedNodes.length; ++nodeOrder) {\n    const liveUntilOrder = liveUntilOrders[nodeOrder];\n    if (liveUntilOrder === INF_LIFE) {\n      continue;\n    }\n    const node = orderedNodes[nodeOrder];\n    const liveUntilNode = orderedNodes[liveUntilOrder];\n    if (!liveUntilMap.has(liveUntilNode.name)) {\n      liveUntilMap.set(liveUntilNode.name, []);\n    }\n    liveUntilMap.get(liveUntilNode.name)!.push(node);\n  }\n  return liveUntilMap;\n}\n\nconst CONTROL_FLOW_OPS = new Set([\n  'Switch', 'Merge', 'Enter', 'Exit', 'NextIteration', 'StatelessIf',\n  'StatelessWhile', 'if', 'While'\n]);\nconst DYNAMIC_SHAPE_OPS = new Set([\n  'NonMaxSuppressionV2', 'NonMaxSuppressionV3', 'NonMaxSuppressionV5', 'Where'\n]);\nconst HASH_TABLE_OPS = new Set([\n  'HashTable', 'HashTableV2', 'LookupTableImport', 'LookupTableImportV2',\n  'LookupTableFind', 'LookupTableFindV2', 'LookupTableSize', 'LookupTableSizeV2'\n]);\n\nexport function isControlFlow(node: Node) {\n  return CONTROL_FLOW_OPS.has(node.op);\n}\n\nexport function isDynamicShape(node: Node) {\n  return DYNAMIC_SHAPE_OPS.has(node.op);\n}\n\nexport function isHashTable(node: Node) {\n  return HASH_TABLE_OPS.has(node.op);\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {DataType, env, keep, NamedTensorMap, Tensor, tidy, util} from '@tensorflow/tfjs-core';\n\nimport {ISignatureDef} from '../data/compiled_api';\nimport {NamedTensorsMap, TensorArrayMap, TensorInfo, TensorListMap} from '../data/types';\nimport {getNodeNameAndIndex, getParamValue, getTensor, getTensorsForCurrentContext, parseNodeName} from '../operations/executors/utils';\nimport {executeOp} from '../operations/operation_executor';\nimport {Graph, Node} from '../operations/types';\n\nimport {ExecutionContext, ExecutionContextInfo} from './execution_context';\nimport {getExecutionSubgraph, getNodeLiveUntilMap, getNodesInTopologicalOrder, isControlFlow} from './model_analysis';\nimport {ResourceManager} from './resource_manager';\nimport {FunctionExecutor} from './types';\n\ninterface NodeWithContexts {\n  contexts: ExecutionContextInfo[];\n  node: Node;\n}\n\nexport class GraphExecutor implements FunctionExecutor {\n  private compiledMap = new Map<string, ReturnType<typeof this.compile>>();\n  private parseNodeNameCache = new Map<string, [string, number, string?]>();\n  private _weightMap: NamedTensorsMap = {};\n  private _weightIds: number[];\n  private _signature: ISignatureDef;\n  private _inputs: Node[];\n  private _outputs: Node[];\n  private _initNodes: Node[];  // Internal init nodes to start initialization.\n  private SEPARATOR = ',';\n  private _functions: {[key: string]: Graph} = {};\n  private _functionExecutorMap: {[key: string]: FunctionExecutor} = {};\n  private _resourceManager: ResourceManager;\n  private clonedTensorsMap: NamedTensorsMap;\n  private keepIntermediateTensors = false;\n\n  get weightIds(): number[] {\n    return this.parent ? this.parent.weightIds : this._weightIds;\n  }\n\n  get functionExecutorMap(): {[key: string]: FunctionExecutor} {\n    return this.parent ? this.parent.functionExecutorMap :\n                         this._functionExecutorMap;\n  }\n\n  get weightMap(): NamedTensorsMap {\n    return this.parent ? this.parent.weightMap : this._weightMap;\n  }\n\n  set weightMap(weightMap: NamedTensorsMap) {\n    const weightIds = Object.keys(weightMap).map(\n        key => weightMap[key].map(tensor => tensor.id));\n    this._weightIds = [].concat(...weightIds);\n    this._weightMap = weightMap;\n  }\n\n  /**\n   * Set `ResourceManager` shared by executors of a model.\n   * @param resourceManager: `ResourceManager` of the `GraphModel`.\n   */\n  set resourceManager(resourceManager: ResourceManager) {\n    this._resourceManager = resourceManager;\n  }\n\n  get inputs(): TensorInfo[] {\n    return this._inputs.map(node => {\n      return {\n        name: node.name,\n        shape: node.attrParams['shape'] ?\n            node.attrParams['shape'].value as number[] :\n            undefined,\n        dtype: node.attrParams['dtype'] ?\n            node.attrParams['dtype'].value as DataType :\n            undefined\n      };\n    });\n  }\n\n  get outputs(): TensorInfo[] {\n    return this._outputs.map(node => {\n      return {\n        name: node.name,\n        shape: node.attrParams['shape'] ?\n            node.attrParams['shape'].value as number[] :\n            undefined,\n        dtype: node.attrParams['dtype'] ?\n            node.attrParams['dtype'].value as DataType :\n            undefined\n      };\n    });\n  }\n\n  get inputNodes(): string[] {\n    return this._inputs.map(node => node.signatureKey || node.name);\n  }\n\n  get outputNodes(): string[] {\n    return this._outputs.map((node) => {\n      const name = node.signatureKey || node.name;\n      return node.defaultOutput ? (`${name}:${node.defaultOutput}`) : name;\n    });\n  }\n\n  get functions(): {[key: string]: ISignatureDef} {\n    return Object.keys(this._functions).reduce((map, key) => {\n      map[key] = this._functions[key].signature;\n      return map;\n    }, {} as {[key: string]: ISignatureDef});\n  }\n\n  /**\n   *\n   * @param graph Graph the model or function graph to be executed.\n   * @param parent When building function exector you need to set the parent\n   * executor. Since the weights and function executor maps are set at parant\n   * level, that function executor can access the function maps and weight maps\n   * through the parent.\n   */\n  constructor(private graph: Graph, private parent?: GraphExecutor) {\n    this._outputs = graph.outputs;\n    this._inputs = graph.inputs;\n    this._initNodes = graph.initNodes;\n    this._signature = graph.signature;\n    this._functions = graph.functions;\n    // create sub-graph executors\n    if (graph.functions != null) {\n      Object.keys(graph.functions).forEach(name => {\n        this._functionExecutorMap[name] =\n            new GraphExecutor(graph.functions[name], this);\n      });\n    }\n  }\n\n  private getCompilationKey(inputs: Node[], outputs: Node[]): string {\n    const sortedInputs = inputs.map(node => node.name).sort();\n    const sortedOutputs = outputs.map(node => node.name).sort();\n    return sortedInputs.join(this.SEPARATOR) + '--' +\n        sortedOutputs.join(this.SEPARATOR);\n  }\n\n  /**\n   * Compiles the inference graph and returns the minimal set of nodes that are\n   * required for execution, in the correct execution order.\n   * @returns {Object} compilation The compile result.\n   * @returns {Node[]} compilation.orderedNodes Nodes in the correct execution\n   *     order.\n   * @returns {Map<string, Node[]>} compilation.nodeLiveUntilMap A map from node\n   *     to disposable nodes after its execution. That is, for a node `x`,\n   *     `nodeLiveUntilMap[x]` indicates all nodes whose intermediate\n   *     tensors should be disposed after `x` is executed.\n   */\n  private compile(inputs: NamedTensorMap, outputs: Node[]):\n      {orderedNodes: Node[], nodeLiveUntilMap: Map<string, Node[]>} {\n    const executionInfo =\n        getExecutionSubgraph(inputs, outputs, this.weightMap, this._initNodes);\n    const {missingInputs, dynamicNode, syncInputs} = executionInfo;\n    if (dynamicNode != null) {\n      throw new Error(\n          `This execution contains the node '${dynamicNode.name}', which has ` +\n          `the dynamic op '${dynamicNode.op}'. Please use ` +\n          `model.executeAsync() instead. Alternatively, to avoid the ` +\n          `dynamic ops, specify the inputs [${syncInputs}]`);\n    }\n\n    if (missingInputs.length > 0) {\n      const outNames = outputs.map(n => n.name);\n      const inNames = Object.keys(inputs);\n      throw new Error(\n          `Cannot compute the outputs [${outNames}] from the provided inputs ` +\n          `[${inNames}]. Missing the following inputs: [${missingInputs}]`);\n    }\n\n    const orderedNodes = getNodesInTopologicalOrder(this.graph, executionInfo);\n    const nodeLiveUntilMap = getNodeLiveUntilMap(orderedNodes);\n    return {orderedNodes, nodeLiveUntilMap};\n  }\n\n  private cloneAndKeepTensor(tensor: Tensor) {\n    if (tensor == null) {\n      return null;\n    }\n    const clone = tensor.clone();\n    // Keep the clone because`model.execute()` may be called within\n    // a `tidy()`, but the user may inspect these tensors after the\n    // tidy.\n    keep(clone);\n    return clone;\n  }\n\n  private cloneTensorList(tensors: Tensor[]) {\n    if (!tensors) {\n      return null;\n    }\n    const clonedTensor = tensors.map(tensor => {\n      return this.cloneAndKeepTensor(tensor);\n    });\n    return clonedTensor;\n  }\n\n  private cloneTensorMap(tensorsMap: NamedTensorsMap): NamedTensorsMap {\n    return Object.fromEntries(\n        Object.entries(tensorsMap).map(([name, tensorsList]) => {\n          return [name, this.cloneTensorList(tensorsList)];\n        }));\n  }\n\n  /**\n   * Executes the inference for given input tensors.\n   * @param inputs Tensor map for the model inputs, keyed by the input node\n   * names.\n   * @param outputs Optional. output node name from the Tensorflow model, if\n   * no outputs are specified, the default outputs of the model would be used.\n   * You can inspect intermediate nodes of the model by adding them to the\n   * outputs array.\n   */\n  execute(inputs: NamedTensorMap, outputs?: string[]): Tensor[] {\n    // Dispose any tensors from a prior run to avoid leaking them.\n    this.disposeIntermediateTensors();\n    inputs = this.mapInputs(inputs);\n    const names = Object.keys(inputs).sort();\n    this.checkInputs(inputs);\n    this.checkInputShapeAndType(inputs);\n    outputs = this.mapOutputs(outputs);\n    this.checkOutputs(outputs);\n    const inputNodes =\n        names.map(name => this.graph.nodes[parseNodeName(name)[0]]);\n    const outputNodeNames = outputs.map(name => parseNodeName(name)[0]);\n    const outputNodeNameSet = new Set(outputNodeNames);\n    let outputNodes = outputNodeNames.map(name => this.graph.nodes[name]);\n    // If no outputs are specified, then use the default outputs of the model.\n    if (outputNodes.length === 0) {\n      outputNodes = this._outputs;\n    }\n\n    const compilationKey = this.getCompilationKey(inputNodes, outputNodes);\n\n    // Do nothing if the compiled graph cache contains the input.\n    let compilation = this.compiledMap.get(compilationKey);\n    if (compilation == null) {\n      compilation = this.compile(inputs, outputNodes);\n      this.compiledMap.set(compilationKey, compilation);\n    }\n\n    // Keep tensors if KEEP_INTERMEDIATE_TENSORS is on.\n    try {\n      this.keepIntermediateTensors = env().getBool('KEEP_INTERMEDIATE_TENSORS');\n    } catch (e) {\n      this.keepIntermediateTensors = false;\n      console.warn(e.message);\n    }\n    const tensorArrayMap: TensorArrayMap = {};\n    const tensorListMap: TensorListMap = {};\n\n    return tidy(() => {\n      const context = new ExecutionContext(\n          this.weightMap, tensorArrayMap, tensorListMap,\n          this.functionExecutorMap, this.parseNodeNameCache);\n      const tensorsMap: NamedTensorsMap = {...this.weightMap};\n      if (this.keepIntermediateTensors) {\n        this.clonedTensorsMap = this.cloneTensorMap(this.weightMap);\n      }\n\n      Object.keys(inputs).forEach(name => {\n        const [nodeName, index] = parseNodeName(name, context);\n        const tensors: Tensor[] = [];\n        tensors[index] = inputs[name];\n        tensorsMap[nodeName] = tensors;\n        if (this.keepIntermediateTensors) {\n          this.clonedTensorsMap[nodeName] = this.cloneTensorList(tensors);\n        }\n      });\n\n      const tensorsToKeep = this.getFrozenTensorIds(tensorsMap);\n      const {orderedNodes, nodeLiveUntilMap} = compilation;\n      for (const node of orderedNodes) {\n        if (tensorsMap[node.name]) {\n          continue;\n        }\n        const tensors =\n            executeOp(node, tensorsMap, context, this._resourceManager) as\n            Tensor[];\n        if (util.isPromise(tensors)) {\n          throw new Error(\n              `The execution of the op '${node.op}' returned a promise. ` +\n              `Please use model.executeAsync() instead.`);\n        }\n        tensorsMap[node.name] = tensors;\n        if (this.keepIntermediateTensors) {\n          this.clonedTensorsMap[node.name] = this.cloneTensorList(tensors);\n        }\n        this.checkTensorForDisposalWithNodeLiveUntilInfo(\n            node, tensorsMap, context, tensorsToKeep, outputNodeNameSet,\n            nodeLiveUntilMap.get(node.name));\n      }\n\n      // dispose the context for the root executor\n      if (this.parent == null) {\n        context.dispose(tensorsToKeep);\n      }\n\n      return outputs.map(name => getTensor(name, tensorsMap, context));\n    });\n  }\n\n  private getFrozenTensorIds(tensorMap: NamedTensorsMap): Set<number> {\n    const ids = [].concat.apply(\n        [],\n        Object.keys(tensorMap)\n            .map(key => tensorMap[key])\n            .map(tensors => tensors.map(tensor => tensor.id)));\n    return new Set(ids);\n  }\n\n  private checkTensorForDisposal(\n      nodeName: string, node: Node, tensorMap: NamedTensorsMap,\n      context: ExecutionContext, tensorsToKeep: Set<number>,\n      outputNodeNameSet: Set<string>,\n      intermediateTensorConsumerCount: {[key: string]: number}) {\n    // Skip output nodes and any control flow nodes, since its dependency is\n    // tricky to track correctly.\n    if (isControlFlow(node) || outputNodeNameSet.has(nodeName)) {\n      return;\n    }\n\n    for (const tensor of tensorMap[nodeName]) {\n      if (tensor == null) {\n        continue;\n      }\n      intermediateTensorConsumerCount[tensor.id] =\n          (intermediateTensorConsumerCount[tensor.id] || 0) +\n          node.children.length;\n    }\n\n    for (const input of node.inputs) {\n      // Skip any control flow nodes, since its dependency is tricky to track\n      // correctly.\n      if (isControlFlow(input)) {\n        continue;\n      }\n\n      const tensors =\n          getTensorsForCurrentContext(input.name, tensorMap, context);\n      if (tensors == null) {\n        continue;\n      }\n\n      for (const tensor of tensors) {\n        if (!tensor || tensor.kept || tensorsToKeep.has(tensor.id)) {\n          continue;\n        }\n\n        // Only intermediate nodes' tensors have counts set, not marked as\n        // kept, and not in `tensorsToKeep`.\n        // Input and weight nodes' tensors should exist in `tensorsToKeep`.\n        // Output and control flow nodes' tensors should never have count set.\n        const count = intermediateTensorConsumerCount[tensor.id];\n        if (count === 1) {\n          tensor.dispose();\n          delete intermediateTensorConsumerCount[tensor.id];\n        } else if (count != null) {\n          intermediateTensorConsumerCount[tensor.id]--;\n        }\n      }\n    }\n  }\n\n  private checkTensorForDisposalWithNodeLiveUntilInfo(\n      node: Node, tensorMap: NamedTensorsMap, context: ExecutionContext,\n      tensorsToKeep: Set<number>, outputNodeNameSet: Set<string>,\n      liveUntilNodes?: Node[]) {\n    function isNonDisposableNode(node: Node) {\n      // Skip output nodes and any control flow nodes, since its dependency is\n      // tricky to track correctly.\n      return isControlFlow(node) || outputNodeNameSet.has(node.name);\n    }\n\n    if (isControlFlow(node) || liveUntilNodes == null) {\n      return;\n    }\n\n    for (const nodeToDispose of liveUntilNodes) {\n      if (isNonDisposableNode(nodeToDispose)) {\n        continue;\n      }\n      const tensors = getTensorsForCurrentContext(\n          nodeToDispose.name, tensorMap, context);\n      for (const tensor of tensors) {\n        if (!tensor || tensor.kept || tensorsToKeep.has(tensor.id)) {\n          continue;\n        }\n        tensor.dispose();\n      }\n    }\n  }\n\n  /**\n   * Executes the inference for given input tensors in Async fashion.\n   * @param inputs Tensor map for the model inputs, keyed by the input node\n   * names.\n   * @param outputs output node name from the Tensorflow model, if no outputs\n   * are specified, the default outputs of the model would be used. You can\n   * inspect intermediate nodes of the model by adding them to the outputs\n   * array.\n   */\n  async executeAsync(inputs: NamedTensorMap, outputs?: string[]):\n      Promise<Tensor[]> {\n    return this._executeAsync(inputs, outputs);\n  }\n\n  disposeIntermediateTensors() {\n    if (!this.clonedTensorsMap) {\n      return;\n    }\n    Object.values(this.clonedTensorsMap).forEach(tensorsList => {\n      for (const tensor of tensorsList) {\n        if (tensor && !tensor.isDisposed) {\n          tensor.dispose();\n        }\n      }\n    });\n\n    this.clonedTensorsMap = null;\n  }\n\n  getIntermediateTensors(): NamedTensorsMap {\n    return this.clonedTensorsMap;\n  }\n\n  /**\n   * Executes the inference for given input tensors in Async fashion.\n   * @param inputs Tensor map for the model inputs, keyed by the input node\n   * names.\n   * @param outputs Optional. output node name from the Tensorflow model,\n   * if no outputs are specified, the default outputs of the model would be\n   * used. You can inspect intermediate nodes of the model by adding them to\n   * the outputs array.\n   * @param isFunctionExecution Optional. Flag for executing a function.\n   * @param tensorArrayMap Optional, global TensorArray map by id. Used for\n   * function execution.\n   * @param tensorArrayMap Optional global TensorList map by id. Used for\n   * function execution.\n   */\n  private async _executeAsync(\n      inputs: NamedTensorMap, outputs?: string[], isFunctionExecution = false,\n      tensorArrayMap: TensorArrayMap = {},\n      tensorListMap: TensorListMap = {}): Promise<Tensor[]> {\n    // Dispose any tensors from a prior run to avoid leaking them.\n    this.disposeIntermediateTensors();\n    if (!isFunctionExecution) {\n      inputs = this.mapInputs(inputs);\n      this.checkInputs(inputs);\n      this.checkInputShapeAndType(inputs);\n      outputs = this.mapOutputs(outputs);\n      this.checkOutputs(outputs);\n    }\n\n    // Keep tensors if KEEP_INTERMEDIATE_TENSORS is on.\n    try {\n      this.keepIntermediateTensors = env().getBool('KEEP_INTERMEDIATE_TENSORS');\n    } catch (e) {\n      this.keepIntermediateTensors = false;\n      console.warn(e.message);\n    }\n\n    const context = new ExecutionContext(\n        this.weightMap, tensorArrayMap, tensorListMap, this.functionExecutorMap,\n        this.parseNodeNameCache);\n\n    if (this.keepIntermediateTensors) {\n      this.clonedTensorsMap = this.cloneTensorMap(this.weightMap);\n    }\n\n    // Graph with control flow op requires runtime evaluation of the execution\n    // order, while without control flow the execution order is pre-determined\n    // in the compile method.\n    const tensorsMap = await this.executeWithControlFlow(\n        inputs, context, outputs, isFunctionExecution);\n    const results = outputs.map(name => getTensor(name, tensorsMap, context));\n\n    // dispose all the intermediate tensors\n    const outputIds = results.map(t => t.id);\n    const inputIds = Object.keys(inputs).map(name => inputs[name].id);\n    const keepIds =\n        new Set<number>([...outputIds, ...inputIds, ...this.weightIds]);\n\n    Object.values(tensorsMap).forEach(tensorsList => {\n      tensorsList.forEach(tensor => {\n        if (tensor && !tensor.isDisposed && !keepIds.has(tensor.id)) {\n          tensor.dispose();\n        }\n      });\n    });\n\n    // dispose the context for the root executor\n    if (this.parent == null) {\n      context.dispose(keepIds);\n    }\n\n    return results;\n  }\n\n  async executeFunctionAsync(\n      inputs: Tensor[], tensorArrayMap: TensorArrayMap,\n      tensorListMap: TensorListMap): Promise<Tensor[]> {\n    const mappedInputs = inputs.reduce((map, tensor, index) => {\n      map[this.inputs[index].name] = tensor;\n      return map;\n    }, {} as NamedTensorMap);\n\n    return this._executeAsync(\n        mappedInputs, this.outputNodes, true, tensorArrayMap, tensorListMap);\n  }\n\n  /**\n   * When there are control flow nodes in the graph, the graph execution use\n   * ExecutionContext to keep track of the frames and loop iterators.\n   * @param inputs placeholder tensors for the graph.\n   * @param context the execution context object for current execution.\n   * @param outputNames Optional. output node name from the Tensorflow model,\n   * if no outputs are specified, the default outputs of the model would be\n   * used. You can inspect intermediate nodes of the model by adding them to\n   * the outputs array.\n   * @param isFunctionExecution Flag for executing a function.\n   */\n  private async executeWithControlFlow(\n      inputs: NamedTensorMap, context: ExecutionContext, outputNames?: string[],\n      isFunctionExecution?: boolean): Promise<NamedTensorsMap> {\n    const names = Object.keys(inputs);\n    const inputNodes =\n        names.map(name => this.graph.nodes[parseNodeName(name)[0]]);\n    const outputNodeNames = outputNames.map(name => parseNodeName(name)[0]);\n    const outputNodeNameSet = new Set(outputNodeNames);\n    let outputNodes = outputNodeNames.map(name => this.graph.nodes[name]);\n\n    // If no outputs are specified, then use the default outputs of the model.\n    if (outputNodes.length === 0) {\n      outputNodes = this._outputs;\n    }\n\n    const {usedNodes, missingInputs, dynamicNode, syncInputs} =\n        getExecutionSubgraph(\n            inputs, outputNodes, this.weightMap, this._initNodes);\n\n    // First nodes to execute include inputNodes, weights, and initNodes.\n    const stack: NodeWithContexts[] = [\n      ...inputNodes, ...this.graph.weights, ...(this._initNodes || [])\n    ].map(node => {\n      return {node, contexts: context.currentContext};\n    });\n    const tensorsMap: NamedTensorsMap = {...this.weightMap};\n    Object.keys(inputs).forEach(name => {\n      const [nodeName, index] = parseNodeName(name);\n      const tensors: Tensor[] = [];\n      tensors[index] = inputs[name];\n      tensorsMap[nodeName] = tensors;\n    });\n    const intermediateTensorConsumerCount: {[key: number]: number} = {};\n    const tensorsToKeep = this.getFrozenTensorIds(tensorsMap);\n    const added: {[key: string]: boolean} = {};\n    while (stack.length > 0) {\n      const promises = this.processStack(\n          inputNodes, stack, context, tensorsMap, added, tensorsToKeep,\n          outputNodeNameSet, intermediateTensorConsumerCount, usedNodes);\n      await Promise.all(promises);\n    }\n    if (dynamicNode == null && !isFunctionExecution) {\n      console.warn(\n          `This model execution did not contain any nodes with control flow ` +\n          `or dynamic output shapes. You can use model.execute() instead.`);\n    }\n    const missingOutputs =\n        outputNodes\n            .filter(\n                node => !isControlFlow(node) &&\n                    !getTensor(node.name, tensorsMap, context))\n            .map(node => node.name);\n    if (missingOutputs.length > 0) {\n      let alternativeMsg = '';\n      if (dynamicNode != null) {\n        alternativeMsg =\n            `Alternatively, to avoid the dynamic ops, use model.execute() ` +\n            `and specify the inputs [${syncInputs}]`;\n      }\n      throw new Error(\n          `Cannot compute the outputs [${missingOutputs}] from the provided ` +\n          `inputs [${names}]. Consider providing the following inputs: ` +\n          `[${missingInputs}]. ${alternativeMsg}`);\n    }\n    return tensorsMap;\n  }\n\n  private processStack(\n      inputNodes: Node[], stack: NodeWithContexts[], context: ExecutionContext,\n      tensorMap: NamedTensorsMap, added: {[key: string]: boolean},\n      tensorsToKeep: Set<number>, outputNodeNameSet: Set<string>,\n      intermediateTensorConsumerCount: {[key: number]: number},\n      usedNodes: Set<string>) {\n    const promises: Array<Promise<Tensor[]>> = [];\n    while (stack.length > 0) {\n      const item = stack.pop();\n      context.currentContext = item.contexts;\n      let nodeName = '';\n      // The tensor of the Enter op with isConstant set should be set\n      // in the parent scope, so it will be available as constant for the\n      // whole loop.\n      if (item.node.op === 'Enter' &&\n          getParamValue('isConstant', item.node, tensorMap, context)) {\n        [nodeName] = getNodeNameAndIndex(item.node.name, context);\n      }\n\n      // only process nodes that are not in the tensorMap yet, this include\n      // inputNodes and internal initNodes.\n      if (tensorMap[item.node.name] == null) {\n        const tensors =\n            executeOp(item.node, tensorMap, context, this._resourceManager);\n        if (!nodeName) {\n          [nodeName] = getNodeNameAndIndex(item.node.name, context);\n        }\n        const currentContext = context.currentContext;\n        if (util.isPromise(tensors)) {\n          promises.push(tensors.then(t => {\n            tensorMap[nodeName] = t;\n            if (this.keepIntermediateTensors) {\n              this.clonedTensorsMap[nodeName] = this.cloneTensorList(t);\n            }\n            context.currentContext = currentContext;\n            this.checkTensorForDisposal(\n                nodeName, item.node, tensorMap, context, tensorsToKeep,\n                outputNodeNameSet, intermediateTensorConsumerCount);\n            this.processChildNodes(\n                item.node, stack, context, tensorMap, added, usedNodes);\n            return t;\n          }));\n        } else {\n          tensorMap[nodeName] = tensors;\n          if (this.keepIntermediateTensors) {\n            this.clonedTensorsMap[nodeName] = this.cloneTensorList(tensors);\n          }\n          this.checkTensorForDisposal(\n              nodeName, item.node, tensorMap, context, tensorsToKeep,\n              outputNodeNameSet, intermediateTensorConsumerCount);\n          this.processChildNodes(\n              item.node, stack, context, tensorMap, added, usedNodes);\n        }\n      } else {\n        this.processChildNodes(\n            item.node, stack, context, tensorMap, added, usedNodes);\n      }\n    }\n    return promises;\n  }\n\n  private processChildNodes(\n      node: Node, stack: NodeWithContexts[], context: ExecutionContext,\n      tensorMap: NamedTensorsMap, added: {[key: string]: boolean},\n      usedNodes: Set<string>) {\n    node.children.forEach((childNode) => {\n      const [nodeName, ] = getNodeNameAndIndex(childNode.name, context);\n      if (added[nodeName] || !usedNodes.has(childNode.name)) {\n        return;\n      }\n      // Merge op can be pushed if any of its inputs has value.\n      if (childNode.op === 'Merge') {\n        if (childNode.inputNames.some(name => {\n              return !!getTensor(name, tensorMap, context);\n            })) {\n          added[nodeName] = true;\n          stack.push({contexts: context.currentContext, node: childNode});\n        }\n      } else  // Otherwise all inputs must to have value.\n          if (childNode.inputNames.every(name => {\n                return !!getTensor(name, tensorMap, context);\n              })) {\n        added[nodeName] = true;\n        stack.push({contexts: context.currentContext, node: childNode});\n      }\n    });\n  }\n\n  /**\n   * Releases the memory used by the weight tensors.\n   */\n  dispose() {\n    Object.keys(this.weightMap)\n        .forEach(\n            key => this.weightMap[key].forEach(tensor => tensor.dispose()));\n  }\n\n  private checkInputShapeAndType(inputs: NamedTensorMap) {\n    Object.keys(inputs).forEach(name => {\n      const input = inputs[name];\n      const [nodeName, ] = parseNodeName(name);\n      const node = this.graph.nodes[nodeName];\n      if (node.attrParams['shape'] && node.attrParams['shape'].value) {\n        const shape = node.attrParams['shape'].value as number[];\n        const match = shape.length === input.shape.length &&\n            input.shape.every(\n                (dim, index) => shape[index] === -1 || shape[index] === dim);\n        util.assert(\n            match,\n            () => `The shape of dict['${node.name}'] provided in ` +\n                `model.execute(dict) must be [${shape}], but was ` +\n                `[${input.shape}]`);\n      }\n      if (node.attrParams['dtype'] && node.attrParams['dtype'].value) {\n        util.assert(\n            input.dtype === node.attrParams['dtype'].value as string,\n            () => `The dtype of dict['${node.name}'] provided in ` +\n                `model.execute(dict) must be ` +\n                `${node.attrParams['dtype'].value}, but was ${input.dtype}`);\n      }\n    });\n  }\n\n  private mapInputs(inputs: NamedTensorMap) {\n    const result: NamedTensorMap = {};\n    for (const inputName in inputs) {\n      const tensor = this._signature ?.inputs ?.[inputName];\n      if (tensor != null) {\n        result[tensor.name] = inputs[inputName];\n      } else {\n        result[inputName] = inputs[inputName];\n      }\n    }\n    return result;\n  }\n\n  private checkInputs(inputs: NamedTensorMap) {\n    const notInGraph = Object.keys(inputs).filter(name => {\n      const [nodeName] = parseNodeName(name);\n      return this.graph.nodes[nodeName] == null;\n    });\n    if (notInGraph.length > 0) {\n      throw new Error(\n          `The dict provided in model.execute(dict) has ` +\n          `keys: [${notInGraph}] that are not part of graph`);\n    }\n  }\n\n  private mapOutputs(outputs: string[]) {\n    return outputs.map(name => {\n      const tensor = this._signature ?.outputs ?.[name];\n      if (tensor != null) {\n        return tensor.name;\n      }\n      return name;\n    }, {});\n  }\n\n  private checkOutputs(outputs: string[]): void {\n    outputs.forEach(name => {\n      const [normalizedName] = parseNodeName(name);\n      if (!this.graph.nodes[normalizedName]) {\n        throw new Error(`The output '${name}' is not found in the graph`);\n      }\n    });\n  }\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {HashTableMap, NamedTensorMap} from '../data/types';\nimport {HashTable} from './hash_table';\n\n/**\n * Contains global resources of a model.\n */\nexport class ResourceManager {\n  constructor(\n      readonly hashTableNameToHandle: NamedTensorMap = {},\n      readonly hashTableMap: HashTableMap = {}) {}\n\n  /**\n   * Register a `HashTable` in the resource manager.\n   *\n   * The `HashTable` can be retrieved by `resourceManager.getHashTableById`,\n   * where id is the table handle tensor's id.\n   *\n   * @param name Op node name that creates the `HashTable`.\n   * @param hashTable The `HashTable` to be added to resource manager.\n   */\n  addHashTable(name: string, hashTable: HashTable) {\n    this.hashTableNameToHandle[name] = hashTable.handle;\n    this.hashTableMap[hashTable.id] = hashTable;\n  }\n\n  /**\n   * Get the table handle by node name.\n   * @param name Op node name that creates the `HashTable`. This name is also\n   *     used in the inputs list of lookup and import `HashTable` ops.\n   */\n  getHashTableHandleByName(name: string) {\n    return this.hashTableNameToHandle[name];\n  }\n\n  /**\n   * Get the actual `HashTable` by its handle tensor's id.\n   * @param id The id of the handle tensor.\n   */\n  getHashTableById(id: number): HashTable {\n    return this.hashTableMap[id];\n  }\n\n  /**\n   * Dispose `ResourceManager`, including its hashTables and tensors in them.\n   */\n  dispose() {\n    for (const key in this.hashTableMap) {\n      this.hashTableMap[key].clearAndClose();\n      delete this.hashTableMap[key];\n    }\n\n    for (const name in this.hashTableNameToHandle) {\n      this.hashTableNameToHandle[name].dispose();\n      delete this.hashTableNameToHandle[name];\n    }\n  }\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/* Type definitions for exporting and importing of models. */\n\n/**\n * A map from Tensor dtype to number of bytes per element of the Tensor.\n */\nexport const DTYPE_VALUE_SIZE_MAP: {[dtype: string]: number} = {\n  'float32': 4,\n  'float16': 2,\n  'int32': 4,\n  'uint16': 2,\n  'uint8': 1,\n  'bool': 1,\n  'complex64': 8\n};\n\n/**\n * A weight manifest.\n *\n * The weight manifest consists of an ordered list of weight-manifest groups.\n * Each weight-manifest group (\"group\" for short hereafter) consists of a\n * number of weight values stored in a number of paths.\n * See the documentation of `WeightManifestGroupConfig` below for more details.\n */\nexport declare type WeightsManifestConfig = WeightsManifestGroupConfig[];\n\n/**\n * A weight-manifest group.\n *\n * Consists of an ordered list of weight values encoded in binary format,\n * stored in an ordered list of paths.\n */\nexport declare interface WeightsManifestGroupConfig {\n  /**\n   * An ordered list of paths.\n   *\n   * Paths are intentionally abstract in order to be general. For example, they\n   * can be relative URL paths or relative paths on the file system.\n   */\n  paths: string[];\n\n  /**\n   * Specifications of the weights stored in the paths.\n   */\n  weights: WeightsManifestEntry[];\n}\n\n/**\n * Group to which the weight belongs.\n *\n * - 'optimizer': Weight from a stateful optimizer.\n */\nexport type WeightGroup = 'model'|'optimizer';\n\n/**\n * An entry in the weight manifest.\n *\n * The entry contains specification of a weight.\n */\nexport declare interface WeightsManifestEntry {\n  /**\n   * Name of the weight, e.g., 'Dense_1/bias'\n   */\n  name: string;\n\n  /**\n   * Shape of the weight.\n   */\n  shape: number[];\n\n  /**\n   * Data type of the weight.\n   */\n  dtype: 'float32'|'int32'|'bool'|'string'|'complex64';\n\n  /**\n   * Type of the weight.\n   *\n   * Optional.\n   *\n   * The value 'optimizer' indicates the weight belongs to an optimizer\n   * (i.e., used only during model training and not during inference).\n   */\n  group?: WeightGroup;\n\n  /**\n   * Information for dequantization of the weight.\n   */\n  quantization?: {\n    scale?: number,  // The scaling constant to multiply by.\n    min?: number,    // The (possibly nudged) minimum weight to add.\n       dtype: 'uint16'|'uint8'|'float16'  // The dtype of the quantized weights.\n  };\n}\n\n/**\n * Options for saving a model.\n * @innamespace io\n */\nexport interface SaveConfig {\n  /**\n   * Whether to save only the trainable weights of the model, ignoring the\n   * non-trainable ones.\n   */\n  trainableOnly?: boolean;\n\n  /**\n   * Whether the optimizer will be saved (if exists).\n   *\n   * Default: `false`.\n   */\n  includeOptimizer?: boolean;\n}\n\n/**\n * Result of a saving operation.\n */\nexport interface SaveResult {\n  /**\n   * Information about the model artifacts saved.\n   */\n  modelArtifactsInfo: ModelArtifactsInfo;\n\n  /**\n   * HTTP responses from the server that handled the model-saving request (if\n   * any). This is applicable only to server-based saving routes.\n   */\n  responses?: Response[];\n\n  /**\n   * Error messages and related data (if any).\n   */\n  errors?: Array<{}|string>;\n}\n\nexport declare interface ModelArtifactsInfo {\n  /**\n   * Timestamp for when the model is saved.\n   */\n  dateSaved: Date;\n\n  /**\n   * TODO (cais,yassogba) consider removing GraphDef as GraphDefs now\n   * come in a JSON format and none of our IOHandlers support a non json\n   * format. We could conder replacing this with 'Binary' if we want to\n   * allow future handlers to save to non json formats (though they will\n   * probably want more information than 'Binary').\n   * Type of the model topology\n   *\n   * Type of the model topology\n   *\n   * Possible values:\n   *   - JSON: JSON config (human-readable, e.g., Keras JSON).\n   *   - GraphDef: TensorFlow\n   *     [GraphDef](https://www.tensorflow.org/extend/tool_developers/#graphdef)\n   *     protocol buffer (binary).\n   */\n  modelTopologyType: 'JSON'|'GraphDef';\n\n  /**\n   * Size of model topology (Keras JSON or GraphDef), in bytes.\n   */\n  modelTopologyBytes?: number;\n\n  /**\n   * Size of weight specification or manifest, in bytes.\n   */\n  weightSpecsBytes?: number;\n\n  /**\n   * Size of weight value data, in bytes.\n   */\n  weightDataBytes?: number;\n}\n\n/** Model training configuration. */\nexport declare interface TrainingConfig {\n  // TODO(cais): Tighten the typing once keras spec is available to tfjs-core.\n  // See\n  // tslint:disable-next-line:max-line-length\n  // https://github.com/tensorflow/tfjs-layers/blob/master/src/keras_format/training_config.ts\n  /** Optimizer used for the model training. */\n  optimizer_config: {};\n\n  // TODO(cais): Tighten the typing once keras spec is available to tfjs-core.\n  /** Loss function(s) for the model's output(s). */\n  loss: string|string[]|{[key: string]: string};\n\n  // TODO(cais): Tighten the typing once keras spec is available to tfjs-core.\n  /** Metric function(s) for the model's output(s). */\n  metrics?: string[]|{[key: string]: string};\n\n  // TODO(cais): Tighten the typing once keras spec is available to tfjs-core.\n  weighted_metrics?: string[];\n\n  // TODO(cais): Tighten the typing once keras spec is available to tfjs-core.\n  sample_weight_mode?: string;\n\n  loss_weights?: number[]|{[key: string]: number};\n}\n\nexport type WeightData = ArrayBuffer | ArrayBuffer[];\n\n/**\n * The serialized artifacts of a model, including topology and weights.\n *\n * The `modelTopology`, `trainingConfig`, `weightSpecs` and `weightData` fields\n * of this interface are optional, in order to support topology- or weights-only\n * saving and loading.\n *\n * Note this interface is used internally in IOHandlers.  For the file format\n * written to disk as `model.json`, see `ModelJSON`.\n */\nexport declare interface ModelArtifacts {\n  /**\n   * Model topology.\n   *\n   * For Keras-style `tf.Model`s, this is a JSON object.\n   * For TensorFlow-style models (e.g., `SavedModel`), this is the JSON\n   * encoding of the `GraphDef` protocol buffer.\n   */\n  modelTopology?: {}|ArrayBuffer;\n\n  /**\n   * Serialized configuration for the model's training.\n   */\n  trainingConfig?: TrainingConfig;\n\n  /**\n   * Weight specifications.\n   *\n   * This corresponds to the weightsData below.\n   */\n  weightSpecs?: WeightsManifestEntry[];\n\n  /**\n   * Binary buffer(s) for all weight values in the order specified by\n   * `weightSpecs`. This may be a single ArrayBuffer of all the weights\n   * concatenated together or an Array of ArrayBuffers containing the weights\n   * (weights may be sharded across multiple ArrayBuffers).\n   */\n  weightData?: WeightData;\n\n  /**\n   * Returns a stream of the weights. Some models are too large to fit in\n   * V8's memory heap, and `getWeightStream` loads their weights without storing\n   * them all in memory at the same time.\n   */\n  getWeightStream?: () => ReadableStream<ArrayBuffer>;\n\n  /**\n   * Hard-coded format name for models saved from TensorFlow.js or converted\n   * by TensorFlow.js Converter.\n   */\n  format?: string;\n\n  /**\n   * What library is responsible for originally generating this artifact.\n   *\n   * Used for debugging purposes. E.g., 'TensorFlow.js v1.0.0'.\n   */\n  generatedBy?: string;\n\n  /**\n   * What library or tool is responsible for converting the original model\n   * to this format, applicable only if the model is output by a converter.\n   *\n   * Used for debugging purposes.  E.g., 'TensorFlow.js Converter v1.0.0'.\n   *\n   * A value of `null` means the model artifacts are generated without any\n   * conversion process (e.g., saved directly from a TensorFlow.js\n   * `tf.LayersModel` instance.)\n   */\n  convertedBy?: string|null;\n\n  /**\n   * Inputs and outputs signature for saved model.\n   */\n  signature?: {};\n\n  /**\n   * User-defined metadata about the model.\n   */\n  userDefinedMetadata?: {[key: string]: {}};\n\n  /**\n   * Initializer for the model.\n   */\n  modelInitializer?: {};\n\n  /**\n   * Inputs and outputs signature for model initializer.\n   */\n  initializerSignature?: {};\n}\n\n/**\n * The on-disk format of the `model.json` file.\n *\n * TF.js 1.0 always populates the optional fields when writing model.json.\n * Prior versions did not provide those fields.\n */\nexport declare interface ModelJSON {\n  /**\n   * Model topology.\n   *\n   * For Keras-style `tf.Model`s, this is a JSON object.\n   * For TensorFlow-style models (e.g., `SavedModel`), this is the JSON\n   * encoding of the `GraphDef` protocol buffer.\n   */\n  modelTopology: {};\n\n  /** Model training configuration. */\n  trainingConfig?: TrainingConfig;\n\n  /**\n   * Weights manifest.\n   *\n   * The weights manifest consists of an ordered list of weight-manifest\n   * groups. Each weight-manifest group consists of a number of weight values\n   * stored in a number of paths. See the documentation of\n   * `WeightsManifestConfig` for more details.\n   */\n  weightsManifest: WeightsManifestConfig;\n\n  /**\n   * Hard-coded format name for models saved from TensorFlow.js or converted\n   * by TensorFlow.js Converter.\n   */\n  format?: string;\n\n  /**\n   * What library is responsible for originally generating this artifact.\n   *\n   * Used for debugging purposes. E.g., 'TensorFlow.js v1.0.0'.\n   */\n  generatedBy?: string;\n\n  /**\n   * What library or tool is responsible for converting the original model\n   * to this format, applicable only if the model is output by a converter.\n   *\n   * Used for debugging purposes.  E.g., 'TensorFlow.js Converter v1.0.0'.\n   *\n   * A value of `null` means the model artifacts are generated without any\n   * conversion process (e.g., saved directly from a TensorFlow.js\n   * `tf.LayersModel` instance.)\n   */\n  convertedBy?: string|null;\n\n  /**\n   * Inputs and outputs signature for saved model.\n   */\n  signature?: {};\n\n  /**\n   * User-defined metadata about the model.\n   */\n  userDefinedMetadata?: {[key: string]: {}};\n\n  /**\n   * Initializer for the model.\n   */\n  modelInitializer?: {};\n\n  /**\n   * Inputs and outputs signature for model initializer.\n   */\n  initializerSignature?: {};\n}\n\n/**\n * Type definition for handlers of loading operations.\n */\nexport type LoadHandler = () => Promise<ModelArtifacts>;\n\n/**\n * Type definition for handlers of saving operations.\n */\nexport type SaveHandler = (modelArtifact: ModelArtifacts) =>\n    Promise<SaveResult>;\n\n/**\n * Interface for a model import/export handler.\n *\n * The `save` and `load` handlers are both optional, in order to allow handlers\n * that support only saving or loading.\n */\n// tslint:disable-next-line:interface-name\nexport interface IOHandler {\n  save?: SaveHandler;\n  load?: LoadHandler;\n}\n\n/**\n * Type definition for handlers of synchronous loading operations.\n */\nexport type LoadHandlerSync = () => ModelArtifacts;\n\n/**\n * Type definition for handlers of synchronous saving operations.\n */\nexport type SaveHandlerSync = (modelArtifact: ModelArtifacts) => SaveResult;\n\n/**\n * Interface for a synchronous model import/export handler.\n *\n * The `save` and `load` handlers are both optional, in order to allow handlers\n * that support only saving or loading.\n */\n// tslint:disable-next-line:interface-name\nexport type IOHandlerSync = {\n  save?: SaveHandlerSync;\n  load?: LoadHandlerSync;\n};\n\n/**\n * An interface for the manager of a model store.\n *\n * A model store is defined as a storage medium on which multiple models can\n * be stored. Each stored model has a unique `path` as its identifier.\n * A `ModelStoreManager` for the store allows actions including\n *\n * - Listing the models stored in the store.\n * - Deleting a model from the store.\n */\nexport interface ModelStoreManager {\n  /**\n   * List all models in the model store.\n   *\n   * @returns A dictionary mapping paths of existing models to their\n   *   model artifacts info. Model artifacts info include type of the model's\n   *   topology, byte sizes of the topology, weights, etc.\n   */\n  listModels(): Promise<{[path: string]: ModelArtifactsInfo}>;\n\n  /**\n   * Remove a model specified by `path`.\n   *\n   * @param path\n   * @returns ModelArtifactsInfo of the deleted model (if and only if deletion\n   *   is successful).\n   * @throws Error if deletion fails, e.g., if no model exists at `path`.\n   */\n  removeModel(path: string): Promise<ModelArtifactsInfo>;\n}\n\n/**\n * Callback for the progress of a long-running action such as an HTTP\n * request for a large binary object.\n *\n * `fraction` should be a number in the [0, 1] interval, indicating how\n * much of the action has completed.\n */\nexport type OnProgressCallback = (fraction: number) => void;\n\n/** @innamespace io */\nexport interface LoadOptions {\n  /**\n   * RequestInit (options) for HTTP requests.\n   *\n   * For detailed information on the supported fields, see\n   * [https://developer.mozilla.org/en-US/docs/Web/API/Request/Request](\n   *     https://developer.mozilla.org/en-US/docs/Web/API/Request/Request)\n   */\n  requestInit?: RequestInit;\n\n  /**\n   * Progress callback.\n   */\n  onProgress?: OnProgressCallback;\n\n  /**\n   * A function used to override the `window.fetch` function.\n   */\n  fetchFunc?: typeof fetch;\n\n  /**\n   * Strict loading model: whether extraneous weights or missing\n   * weights should trigger an `Error`.\n   *\n   * If `true`, require that the provided weights exactly match those\n   * required by the layers. `false` means that both extra weights\n   * and missing weights will be silently ignored.\n   *\n   * Default: `true`.\n   */\n  strict?: boolean;\n\n  /**\n   * Path prefix for weight files, by default this is calculated from the\n   * path of the model JSON file.\n   *\n   * For instance, if the path to the model JSON file is\n   * `http://localhost/foo/model.json`, then the default path prefix will be\n   * `http://localhost/foo/`. If a weight file has the path value\n   * `group1-shard1of2` in the weight manifest, then the weight file will be\n   * loaded from `http://localhost/foo/group1-shard1of2` by default. However,\n   * if you provide a `weightPathPrefix` value of\n   * `http://localhost/foo/alt-weights`, then the weight file will be loaded\n   * from the path `http://localhost/foo/alt-weights/group1-shard1of2` instead.\n   */\n  weightPathPrefix?: string;\n\n  /**\n   * Whether the module or model is to be loaded from TF Hub.\n   *\n   * Setting this to `true` allows passing a TF-Hub module URL, omitting the\n   * standard model file name and the query parameters.\n   *\n   * Default: `false`.\n   */\n  fromTFHub?: boolean;\n\n  /**\n   * An async function to convert weight file name to URL. The weight file\n   * names are stored in model.json's weightsManifest.paths field. By default we\n   * consider weight files are colocated with the model.json file. For example:\n   *     model.json URL: https://www.google.com/models/1/model.json\n   *     group1-shard1of1.bin url:\n   *        https://www.google.com/models/1/group1-shard1of1.bin\n   *\n   * With this func you can convert the weight file name to any URL.\n   */\n  weightUrlConverter?: (weightFileName: string) => Promise<string>;\n\n  /**\n   * Whether to stream the model directly to the backend or cache all its\n   * weights on CPU first. Useful for large models.\n   */\n  streamWeights?: boolean;\n}\n\n/**\n * Additional options for Platform.fetch\n */\nexport interface RequestDetails {\n  /**\n   * Is this request for a binary file (as opposed to a json file)\n   */\n  isBinary?: boolean;\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {complex} from '../ops/complex';\nimport {tensor} from '../ops/tensor';\nimport {NamedTensor, NamedTensorMap} from '../tensor_types';\nimport {TypedArray} from '../types';\nimport {sizeFromShape} from '../util';\n\nimport {DTYPE_VALUE_SIZE_MAP, ModelArtifacts, ModelArtifactsInfo, ModelJSON, WeightData, WeightGroup, WeightsManifestConfig, WeightsManifestEntry} from './types';\nimport {CompositeArrayBuffer} from './composite_array_buffer';\nimport {Tensor} from '../tensor';\nimport {backend} from '../globals';\nimport {DataId} from '../tensor_info';\nimport {env} from '../environment';\nimport {getBackend} from '../globals';\n\n/** Number of bytes reserved for the length of the string. (32bit integer). */\nconst NUM_BYTES_STRING_LENGTH = 4;\n\n/**\n * Encode a map from names to weight values as an ArrayBuffer, along with an\n * `Array` of `WeightsManifestEntry` as specification of the encoded weights.\n *\n * This function does not perform sharding.\n *\n * This function is the reverse of `decodeWeights`.\n *\n * @param tensors A map (\"dict\") from names to tensors.\n * @param group Group to which the weights belong (optional).\n * @returns A `Promise` of\n *   - A flat `ArrayBuffer` with all the binary values of the `Tensor`s\n *     concatenated.\n *   - An `Array` of `WeightManifestEntry`s, carrying information including\n *     tensor names, `dtype`s and shapes.\n * @throws Error: on unsupported tensor `dtype`.\n */\nexport async function encodeWeights(\n    tensors: NamedTensorMap|NamedTensor[], group?: WeightGroup):\n    Promise<{data: ArrayBuffer, specs: WeightsManifestEntry[]}> {\n  // TODO(adarob, cais): Support quantization.\n  const specs: WeightsManifestEntry[] = [];\n  const dataPromises: Array<Promise<TypedArray>> = [];\n\n  const names: string[] = Array.isArray(tensors) ?\n      tensors.map(tensor => tensor.name) :\n      Object.keys(tensors);\n\n  for (let i = 0; i < names.length; ++i) {\n    const name = names[i];\n    const t = Array.isArray(tensors) ? tensors[i].tensor : tensors[name];\n    if (t.dtype !== 'float32' && t.dtype !== 'int32' && t.dtype !== 'bool' &&\n        t.dtype !== 'string' && t.dtype !== 'complex64') {\n      throw new Error(`Unsupported dtype in weight '${name}': ${t.dtype}`);\n    }\n    const spec: WeightsManifestEntry = {name, shape: t.shape, dtype: t.dtype};\n    if (t.dtype === 'string') {\n      const utf8bytes = new Promise<TypedArray>(async resolve => {\n        const vals = await t.bytes() as Uint8Array[];\n        const totalNumBytes = vals.reduce((p, c) => p + c.length, 0) +\n            NUM_BYTES_STRING_LENGTH * vals.length;\n        const bytes = new Uint8Array(totalNumBytes);\n        let offset = 0;\n        for (let i = 0; i < vals.length; i++) {\n          const val = vals[i];\n          const bytesOfLength =\n              new Uint8Array(new Uint32Array([val.length]).buffer);\n          bytes.set(bytesOfLength, offset);\n          offset += NUM_BYTES_STRING_LENGTH;\n          bytes.set(val, offset);\n          offset += val.length;\n        }\n        resolve(bytes);\n      });\n      dataPromises.push(utf8bytes);\n    } else {\n      dataPromises.push(t.data());\n    }\n    if (group != null) {\n      spec.group = group;\n    }\n    specs.push(spec);\n  }\n\n  const tensorValues = await Promise.all(dataPromises);\n  return {data: concatenateTypedArrays(tensorValues), specs};\n}\n\n/**\n * Decode flat ArrayBuffer as weights.\n *\n * This function does not handle sharding.\n *\n * This function is the reverse of `encodeWeights`.\n *\n * @param weightData A flat ArrayBuffer or an array of ArrayBuffers carrying the\n *   binary values of the tensors concatenated in the order specified in\n *   `specs`.\n * @param specs Specifications of the names, dtypes and shapes of the tensors\n *   whose value are encoded by `buffer`.\n * @return A map from tensor name to tensor value, with the names corresponding\n *   to names in `specs`.\n * @throws Error, if any of the tensors has unsupported dtype.\n */\nexport function decodeWeights(\n    weightData: WeightData,\n    specs: WeightsManifestEntry[]): NamedTensorMap {\n  // TODO(adarob, cais): Support quantization.\n  const compositeBuffer = new CompositeArrayBuffer(weightData);\n  const out: NamedTensorMap = {};\n  let offset = 0;\n  for (const spec of specs) {\n    const byteLength = getWeightBytelength(spec, (start, end) => {\n      return compositeBuffer.slice(offset + start, offset + end);\n    });\n    out[spec.name] = decodeWeight(spec, compositeBuffer\n      .slice(offset, offset + byteLength));\n    offset += byteLength;\n  }\n  return out;\n}\n\nfunction getWeightBytelength(spec: WeightsManifestEntry,\n  slice: (start: number, end: number) => ArrayBuffer): number {\n\n  const size = sizeFromShape(spec.shape);\n  let bytesPerValue: number;\n  if ('quantization' in spec) {\n    const quantization = spec.quantization;\n    bytesPerValue = DTYPE_VALUE_SIZE_MAP[quantization.dtype];\n  } else if (spec.dtype === 'string') {\n    // Can not statically determine string length.\n    let byteLength = 0;\n    for (let i = 0; i < size; i++) {\n      byteLength += NUM_BYTES_STRING_LENGTH + new Uint32Array(\n        slice(byteLength, byteLength + NUM_BYTES_STRING_LENGTH))[0];\n    }\n    return byteLength;\n  } else {\n    bytesPerValue = DTYPE_VALUE_SIZE_MAP[spec.dtype];\n  }\n\n  return size * bytesPerValue;\n}\n\nasync function getWeightBytelengthAsync(\n  spec: WeightsManifestEntry,\n  slice: (start: number, end: number) => Promise<ArrayBuffer>\n): Promise<number> {\n\n  const size = sizeFromShape(spec.shape);\n  let bytesPerValue: number;\n  if ('quantization' in spec) {\n    const quantization = spec.quantization;\n    bytesPerValue = DTYPE_VALUE_SIZE_MAP[quantization.dtype];\n  } else if (spec.dtype === 'string') {\n    // Can not statically determine string length.\n    let byteLength = 0;\n    for (let i = 0; i < size; i++) {\n      byteLength += NUM_BYTES_STRING_LENGTH + new Uint32Array(\n        await slice(byteLength, byteLength + NUM_BYTES_STRING_LENGTH))[0];\n    }\n    return byteLength;\n  } else {\n    bytesPerValue = DTYPE_VALUE_SIZE_MAP[spec.dtype];\n  }\n\n  return size * bytesPerValue;\n}\n\nfunction decodeWeight(\n  spec: WeightsManifestEntry,\n  byteBuffer: ArrayBuffer): Tensor {\n\n  const name = spec.name;\n  const dtype = spec.dtype;\n  const shape = spec.shape;\n  const size = sizeFromShape(shape);\n  let values: TypedArray | string[] | Uint8Array[];\n  let offset = 0;\n\n  if ('quantization' in spec) {\n    const quantization = spec.quantization;\n    if (quantization.dtype === 'uint8' || quantization.dtype === 'uint16') {\n      if (!('min' in quantization && 'scale' in quantization)) {\n        throw new Error(\n            `Weight ${spec.name} with quantization ${quantization.dtype} ` +\n            `doesn't have corresponding metadata min and scale.`);\n      }\n    } else if (quantization.dtype === 'float16') {\n      if (dtype !== 'float32') {\n        throw new Error(\n            `Weight ${spec.name} is quantized with ${quantization.dtype} ` +\n            `which only supports weights of type float32 not ${dtype}.`);\n      }\n    } else {\n      throw new Error(\n          `Weight ${spec.name} has unknown ` +\n          `quantization dtype ${quantization.dtype}. ` +\n          `Supported quantization dtypes are: ` +\n          `'uint8', 'uint16', and 'float16'.`);\n    }\n    const quantizationSizeFactor = DTYPE_VALUE_SIZE_MAP[quantization.dtype];\n    const quantizedArray = (quantization.dtype === 'uint8') ?\n      new Uint8Array(byteBuffer) :\n      new Uint16Array(byteBuffer);\n    if (dtype === 'float32') {\n      if (quantization.dtype === 'uint8' || quantization.dtype === 'uint16') {\n        values = new Float32Array(quantizedArray.length);\n        for (let i = 0; i < quantizedArray.length; i++) {\n          const v = quantizedArray[i];\n          values[i] = v * quantization.scale + quantization.min;\n        }\n      } else if (quantization.dtype === 'float16') {\n        // TODO: This is inefficient. Make getFloat16Decoder efficient.\n        const float16Decode = getFloat16Decoder();\n        values = float16Decode(quantizedArray as Uint16Array);\n      } else {\n        throw new Error(\n          `Unsupported quantization type ${quantization.dtype} ` +\n          `for weight type float32.`);\n      }\n    } else if (dtype === 'int32') {\n      if (quantization.dtype !== 'uint8' && quantization.dtype !== 'uint16') {\n        throw new Error(\n          `Unsupported quantization type ${quantization.dtype} ` +\n          `for weight type int32.`);\n      }\n      values = new Int32Array(quantizedArray.length);\n      for (let i = 0; i < quantizedArray.length; i++) {\n        const v = quantizedArray[i];\n        values[i] = Math.round(v * quantization.scale + quantization.min);\n      }\n    } else {\n      throw new Error(`Unsupported dtype in weight '${name}': ${dtype}`);\n    }\n    offset += size * quantizationSizeFactor;\n  } else if (dtype === 'string') {\n    const size = sizeFromShape(spec.shape);\n    values = [];\n    for (let i = 0; i < size; i++) {\n      const byteLength = new Uint32Array(\n        byteBuffer.slice(offset, offset + NUM_BYTES_STRING_LENGTH))[0];\n      offset += NUM_BYTES_STRING_LENGTH;\n      const bytes = new Uint8Array(\n        byteBuffer.slice(offset, offset + byteLength));\n      (values as Uint8Array[]).push(bytes);\n      offset += byteLength;\n    }\n  } else {\n    const dtypeFactor = DTYPE_VALUE_SIZE_MAP[dtype];\n    if (dtype === 'float32') {\n      values = new Float32Array(byteBuffer);\n    } else if (dtype === 'int32') {\n      values = new Int32Array(byteBuffer);\n    } else if (dtype === 'bool') {\n      values = new Uint8Array(byteBuffer);\n    } else if (dtype === 'complex64') {\n      values = new Float32Array(byteBuffer);\n      const real = new Float32Array(values.length / 2);\n      const image = new Float32Array(values.length / 2);\n      for (let i = 0; i < real.length; i++) {\n        real[i] = values[i * 2];\n        image[i] = values[i * 2 + 1];\n      }\n      const realTensor = tensor(real, shape, 'float32');\n      const imageTensor = tensor(image, shape, 'float32');\n      const complexTensor = complex(realTensor, imageTensor);\n      realTensor.dispose();\n      imageTensor.dispose();\n      return complexTensor;\n    } else {\n      throw new Error(`Unsupported dtype in weight '${name}': ${dtype}`);\n    }\n    offset += size * dtypeFactor;\n  }\n  return tensor(values, shape, dtype);\n}\n\nasync function readToLength(reader: ReadableStreamDefaultReader<ArrayBuffer>,\n                            initialData: ArrayBuffer,\n                            length: number): Promise<ArrayBuffer> {\n  let data = new Uint8Array(initialData);\n\n  while (data.byteLength < length) {\n    const {done, value} = await reader.read();\n    if (done && value == null) {\n      const missing  = length - data.byteLength;\n      throw new Error(`Reader is done but ${missing} bytes are still expected`);\n    }\n\n    // TODO: Don't create a new array every loop.\n    const newData = new Uint8Array(data.length + value.byteLength);\n    newData.set(data, 0);\n    newData.set(new Uint8Array(value), data.length);\n    data = newData;\n  }\n\n  return data.buffer;\n}\n\nexport async function decodeWeightsStream(\n  weightStream: ReadableStream<ArrayBuffer>,\n  specs: WeightsManifestEntry[]): Promise<NamedTensorMap> {\n\n  const tensors: NamedTensorMap = {};\n  const reader = weightStream.getReader();\n  let data = new ArrayBuffer(0);\n\n  for (const spec of specs) {\n    const byteLength = await getWeightBytelengthAsync(spec,\n                                                      async (start, end) => {\n      data = await readToLength(reader, data, end);\n      return data.slice(start, end);\n    });\n    data = await readToLength(reader, data, byteLength);\n\n    // Slice the tensor out\n    const tensorData = data.slice(0, byteLength);\n    data = data.slice(byteLength);\n\n    const weightTensor = decodeWeight(spec, tensorData);\n    tensors[spec.name] = weightTensor;\n\n    // TODO(mattsoulanille): Better way to call uploadToGPU.\n    // TODO(mattsoulanille): Make this work for webgl too.\n    if (getBackend() === 'webgpu') {\n      const b = backend();\n\n      if ('uploadToGPU' in b &&\n        sizeFromShape(weightTensor.shape) >= (env()\n          .get('WEBGPU_CPU_HANDOFF_SIZE_THRESHOLD') as number)) {\n        (b.uploadToGPU as (dataId: DataId) => void)(weightTensor.dataId);\n      }\n    }\n  }\n\n  return tensors;\n}\n\n/**\n * Concatenate TypedArrays into an ArrayBuffer.\n */\nexport function concatenateTypedArrays(xs: TypedArray[]): ArrayBuffer {\n  // TODO(adarob, cais): Support quantization.\n  if (xs === null) {\n    throw new Error(`Invalid input value: ${JSON.stringify(xs)}`);\n  }\n\n  let totalByteLength = 0;\n\n  // `normalizedXs` is here for this reason: a `TypedArray`'s `buffer'\n  // can have a different byte length from that of the `TypedArray` itself,\n  // for example, when the `TypedArray` is created from an offset in an\n  // `ArrayBuffer`. `normliazedXs` holds `TypedArray`s whose `buffer`s match\n  // the `TypedArray` in byte length. If an element of `xs` does not show\n  // this property, a new `TypedArray` that satisfy this property will be\n  // constructed and pushed into `normalizedXs`.\n  const normalizedXs: TypedArray[] = [];\n  xs.forEach((x: TypedArray) => {\n    totalByteLength += x.byteLength;\n    // tslint:disable:no-any\n    normalizedXs.push(\n        x.byteLength === x.buffer.byteLength ? x :\n                                               new (x.constructor as any)(x));\n    if (!(x as any instanceof Float32Array || x as any instanceof Int32Array ||\n          x as any instanceof Uint8Array)) {\n      throw new Error(`Unsupported TypedArray subtype: ${x.constructor.name}`);\n    }\n    // tslint:enable:no-any\n  });\n\n  const y = new Uint8Array(totalByteLength);\n  let offset = 0;\n  normalizedXs.forEach((x: TypedArray) => {\n    y.set(new Uint8Array(x.buffer), offset);\n    offset += x.byteLength;\n  });\n\n  return y.buffer;\n}\n\n// Use Buffer on Node.js instead of Blob/atob/btoa\nconst useNodeBuffer = typeof Buffer !== 'undefined' &&\n    (typeof Blob === 'undefined' || typeof atob === 'undefined' ||\n     typeof btoa === 'undefined');\n\n/**\n * Calculate the byte length of a JavaScript string.\n *\n * Note that a JavaScript string can contain wide characters, therefore the\n * length of the string is not necessarily equal to the byte length.\n *\n * @param str Input string.\n * @returns Byte length.\n */\nexport function stringByteLength(str: string): number {\n  if (useNodeBuffer) {\n    return Buffer.byteLength(str, 'utf8');\n  }\n  return new Blob([str]).size;\n}\n\n/**\n * Encode an ArrayBuffer as a base64 encoded string.\n *\n * @param buffer `ArrayBuffer` to be converted.\n * @returns A string that base64-encodes `buffer`.\n */\nexport function arrayBufferToBase64String(buffer: ArrayBuffer): string {\n  if (useNodeBuffer) {\n    return Buffer.from(buffer).toString('base64');\n  }\n  const buf = new Uint8Array(buffer);\n  let s = '';\n  for (let i = 0, l = buf.length; i < l; i++) {\n    s += String.fromCharCode(buf[i]);\n  }\n  return btoa(s);\n}\n\n/**\n * Decode a base64 string as an ArrayBuffer.\n *\n * @param str Base64 string.\n * @returns Decoded `ArrayBuffer`.\n */\nexport function base64StringToArrayBuffer(str: string): ArrayBuffer {\n  if (useNodeBuffer) {\n    const buf = Buffer.from(str, 'base64');\n    return buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);\n  }\n  const s = atob(str);\n  const buffer = new Uint8Array(s.length);\n  for (let i = 0; i < s.length; ++i) {\n    buffer.set([s.charCodeAt(i)], i);\n  }\n  return buffer.buffer;\n}\n\n/**\n * Concatenate a number of ArrayBuffers into one.\n *\n * @param buffers An array of ArrayBuffers to concatenate, or a single\n *     ArrayBuffer.\n * @returns Result of concatenating `buffers` in order.\n *\n * @deprecated Use tf.io.CompositeArrayBuffer.join() instead.\n */\nexport function concatenateArrayBuffers(buffers: ArrayBuffer[]\n      | ArrayBuffer): ArrayBuffer {\n  return CompositeArrayBuffer.join(buffers);\n}\n\n/**\n * Get the basename of a path.\n *\n * Behaves in a way analogous to Linux's basename command.\n *\n * @param path\n */\nexport function basename(path: string): string {\n  const SEPARATOR = '/';\n  path = path.trim();\n  while (path.endsWith(SEPARATOR)) {\n    path = path.slice(0, path.length - 1);\n  }\n  const items = path.split(SEPARATOR);\n  return items[items.length - 1];\n}\n\n/**\n * Create `ModelJSON` from `ModelArtifacts`.\n *\n * @param artifacts Model artifacts, describing the model and its weights.\n * @param manifest Weight manifest, describing where the weights of the\n *     `ModelArtifacts` are stored, and some metadata about them.\n * @returns Object representing the `model.json` file describing the model\n *     artifacts and weights\n */\nexport function getModelJSONForModelArtifacts(\n    artifacts: ModelArtifacts, manifest: WeightsManifestConfig): ModelJSON {\n  const result: ModelJSON = {\n    modelTopology: artifacts.modelTopology,\n    format: artifacts.format,\n    generatedBy: artifacts.generatedBy,\n    convertedBy: artifacts.convertedBy,\n    weightsManifest: manifest\n  };\n  if (artifacts.signature != null) {\n    result.signature = artifacts.signature;\n  }\n  if (artifacts.userDefinedMetadata != null) {\n    result.userDefinedMetadata = artifacts.userDefinedMetadata;\n  }\n  if (artifacts.modelInitializer != null) {\n    result.modelInitializer = artifacts.modelInitializer;\n  }\n  if (artifacts.initializerSignature != null) {\n    result.initializerSignature = artifacts.initializerSignature;\n  }\n  if (artifacts.trainingConfig != null) {\n    result.trainingConfig = artifacts.trainingConfig;\n  }\n  return result;\n}\n\n/**\n * Create `ModelArtifacts` from a JSON file and weights.\n *\n * @param modelJSON Object containing the parsed JSON of `model.json`\n * @param weightSpecs The list of WeightsManifestEntry for the model. Must be\n *     passed if the modelJSON has a weightsManifest.\n * @param weightData An ArrayBuffer or array of ArrayBuffers of weight data for\n *     the model corresponding to the weights in weightSpecs. Must be passed if\n *     the modelJSON has a weightsManifest.\n * @returns A Promise of the `ModelArtifacts`, as described by the JSON file.\n */\nexport function getModelArtifactsForJSONSync(\n    modelJSON: ModelJSON, weightSpecs?: WeightsManifestEntry[],\n    weightData?: WeightData): ModelArtifacts {\n\n  const modelArtifacts: ModelArtifacts = {\n    modelTopology: modelJSON.modelTopology,\n    format: modelJSON.format,\n    generatedBy: modelJSON.generatedBy,\n    convertedBy: modelJSON.convertedBy\n  };\n\n  if (modelJSON.trainingConfig != null) {\n    modelArtifacts.trainingConfig = modelJSON.trainingConfig;\n  }\n  if (modelJSON.weightsManifest != null) {\n    if (!weightSpecs) {\n      throw new Error('modelJSON has weightsManifest but weightSpecs is null');\n    }\n    if (!weightData) {\n      throw new Error('modelJSON has weightsManifest but weightData is null');\n    }\n    modelArtifacts.weightSpecs = weightSpecs;\n    modelArtifacts.weightData = weightData;\n  }\n  if (modelJSON.signature != null) {\n    modelArtifacts.signature = modelJSON.signature;\n  }\n  if (modelJSON.userDefinedMetadata != null) {\n    modelArtifacts.userDefinedMetadata = modelJSON.userDefinedMetadata;\n  }\n  if (modelJSON.modelInitializer != null) {\n    modelArtifacts.modelInitializer = modelJSON.modelInitializer;\n  }\n  if (modelJSON.initializerSignature != null) {\n    modelArtifacts.initializerSignature = modelJSON.initializerSignature;\n  }\n\n  return modelArtifacts;\n}\n\n/**\n * Create `ModelArtifacts` from a JSON file.\n *\n * @param modelJSON Object containing the parsed JSON of `model.json`\n * @param loadWeights Function that takes the JSON file's weights manifest,\n *     reads weights from the listed path(s), and returns a Promise of the\n *     weight manifest entries along with the weights data.\n * @returns A Promise of the `ModelArtifacts`, as described by the JSON file.\n */\nexport async function getModelArtifactsForJSON(\n    modelJSON: ModelJSON,\n    loadWeights: (weightsManifest: WeightsManifestConfig) => Promise<[\n      /* weightSpecs */ WeightsManifestEntry[], WeightData,\n    ]>): Promise<ModelArtifacts> {\n  let weightSpecs: WeightsManifestEntry[] | undefined;\n  let weightData: WeightData | undefined;\n\n  if (modelJSON.weightsManifest != null) {\n    [weightSpecs, weightData] = await loadWeights(modelJSON.weightsManifest);\n  }\n\n  return getModelArtifactsForJSONSync(modelJSON, weightSpecs, weightData);\n}\n\n/**\n * Populate ModelArtifactsInfo fields for a model with JSON topology.\n * @param modelArtifacts\n * @returns A ModelArtifactsInfo object.\n */\nexport function getModelArtifactsInfoForJSON(modelArtifacts: ModelArtifacts):\n    ModelArtifactsInfo {\n  if (modelArtifacts.modelTopology instanceof ArrayBuffer) {\n    throw new Error('Expected JSON model topology, received ArrayBuffer.');\n  }\n\n  return {\n    dateSaved: new Date(),\n    modelTopologyType: 'JSON',\n    modelTopologyBytes: modelArtifacts.modelTopology == null ?\n        0 :\n        stringByteLength(JSON.stringify(modelArtifacts.modelTopology)),\n    weightSpecsBytes: modelArtifacts.weightSpecs == null ?\n        0 :\n        stringByteLength(JSON.stringify(modelArtifacts.weightSpecs)),\n    weightDataBytes: modelArtifacts.weightData == null ?\n        0 :\n        new CompositeArrayBuffer(modelArtifacts.weightData).byteLength,\n  };\n}\n\n/**\n * Concatenate the weights stored in a WeightsManifestConfig into a list of\n * WeightsManifestEntry\n *\n * @param weightsManifest The WeightsManifestConfig to extract weights from.\n * @returns A list of WeightsManifestEntry of the weights in the weightsManifest\n */\nexport function getWeightSpecs(weightsManifest: WeightsManifestConfig):\n    WeightsManifestEntry[] {\n  const weightSpecs: WeightsManifestEntry[] = [];\n  for (const entry of weightsManifest) {\n    weightSpecs.push(...entry.weights);\n  }\n  return weightSpecs;\n}\n\n/**\n * Computes mantisa table for casting Float16 to Float32\n * See http://www.fox-toolkit.org/ftp/fasthalffloatconversion.pdf\n *\n * @returns Uint32Array, 2048 mantissa lookup values.\n */\nfunction computeFloat16MantisaTable(): Uint32Array {\n  const convertMantissa = (i: number): number => {\n    let m = i << 13;\n    let e = 0;\n\n    while ((m & 0x00800000) === 0) {\n      e -= 0x00800000;\n      m <<= 1;\n    }\n    m &= ~0x00800000;\n    e += 0x38800000;\n\n    return m | e;\n  };\n\n  const mantisaTable = new Uint32Array(2048);\n\n  mantisaTable[0] = 0;\n  for (let i = 1; i < 1024; i++) {\n    mantisaTable[i] = convertMantissa(i);\n  }\n  for (let i = 1024; i < 2048; i++) {\n    mantisaTable[i] = 0x38000000 + ((i - 1024) << 13);\n  }\n\n  return mantisaTable;\n}\n\n/**\n * Computes exponent table for casting Float16 to Float32\n * See http://www.fox-toolkit.org/ftp/fasthalffloatconversion.pdf\n *\n * @returns Uint32Array, 64 exponent lookup values.\n */\nfunction computeFloat16ExponentTable(): Uint32Array {\n  const exponentTable = new Uint32Array(64);\n\n  exponentTable[0] = 0;\n  exponentTable[31] = 0x47800000;\n  exponentTable[32] = 0x80000000;\n  exponentTable[63] = 0xc7800000;\n  for (let i = 1; i < 31; i++) {\n    exponentTable[i] = i << 23;\n  }\n  for (let i = 33; i < 63; i++) {\n    exponentTable[i] = 0x80000000 + ((i - 32) << 23);\n  }\n\n  return exponentTable;\n}\n\n/**\n * Computes offset table for casting Float16 to Float32\n * See http://www.fox-toolkit.org/ftp/fasthalffloatconversion.pdf\n *\n * @returns Uint32Array, 6d offset values.\n */\nfunction computeFloat16OffsetTable(): Uint32Array {\n  const offsetTable = new Uint32Array(64);\n\n  for (let i = 0; i < 64; i++) {\n    offsetTable[i] = 1024;\n  }\n  offsetTable[0] = offsetTable[32] = 0;\n\n  return offsetTable;\n}\n\n/**\n * Retrieve a Float16 decoder which will decode a ByteArray of Float16 values\n * to a Float32Array.\n *\n * @returns Function (buffer: Uint16Array) => Float32Array which decodes\n *          the Uint16Array of Float16 bytes to a Float32Array.\n */\nexport function getFloat16Decoder(): (buffer: Uint16Array) => Float32Array {\n  // Algorithm is based off of\n  // http://www.fox-toolkit.org/ftp/fasthalffloatconversion.pdf\n\n  // Cache lookup tables\n  const mantisaTable = computeFloat16MantisaTable();\n  const exponentTable = computeFloat16ExponentTable();\n  const offsetTable = computeFloat16OffsetTable();\n\n  return (quantizedArray: Uint16Array) => {\n    const buffer = new ArrayBuffer(4 * quantizedArray.length);\n    const bufferUint32View = new Uint32Array(buffer);\n    for (let index = 0; index < quantizedArray.length; index++) {\n      const float16Bits = quantizedArray[index];\n      const float32Bits =\n          mantisaTable[offsetTable[float16Bits >> 10] + (float16Bits & 0x3ff)] +\n          exponentTable[float16Bits >> 10];\n      bufferUint32View[index] = float32Bits;\n    }\n    return new Float32Array(buffer);\n  };\n}\n", "/**\n * @license\n * Copyright 2018 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {dispose, InferenceModel, io, ModelPredictConfig, NamedTensorMap, Tensor, util} from '@tensorflow/tfjs-core';\n\nimport * as tensorflow from '../data/compiled_api';\nimport {NamedTensorsMap, TensorInfo} from '../data/types';\nimport {OperationMapper} from '../operations/operation_mapper';\n\nimport {GraphExecutor} from './graph_executor';\nimport {ResourceManager} from './resource_manager';\n// tslint:disable-next-line: no-imports-from-dist\nimport {decodeWeightsStream} from '@tensorflow/tfjs-core/dist/io/io_utils';\n\nexport const TFHUB_SEARCH_PARAM = '?tfjs-format=file';\nexport const DEFAULT_MODEL_NAME = 'model.json';\ntype Url = string|io.IOHandler|io.IOHandlerSync;\ntype UrlIOHandler<T extends Url> = T extends string ? io.IOHandler : T;\n\n/**\n * A `tf.GraphModel` is a directed, acyclic graph built from a\n * SavedModel GraphDef and allows inference execution.\n *\n * A `tf.GraphModel` can only be created by loading from a model converted from\n * a [TensorFlow SavedModel](https://www.tensorflow.org/guide/saved_model) using\n * the command line converter tool and loaded via `tf.loadGraphModel`.\n *\n * @doc {heading: 'Models', subheading: 'Classes'}\n */\nexport class GraphModel<ModelURL extends Url = string | io.IOHandler> implements\n    InferenceModel {\n  private executor: GraphExecutor;\n  private version = 'n/a';\n  private handler: UrlIOHandler<ModelURL>;\n  private artifacts: io.ModelArtifacts;\n  private initializer: GraphExecutor;\n  private resourceIdToCapturedInput: {[key: number]: Tensor};\n  private resourceManager: ResourceManager;\n  private signature: tensorflow.ISignatureDef;\n  private initializerSignature: tensorflow.ISignatureDef;\n  private structuredOutputKeys: string[];\n  private readonly io: typeof io;\n\n  // Returns the version information for the tensorflow model GraphDef.\n  get modelVersion(): string {\n    return this.version;\n  }\n\n  get inputNodes(): string[] {\n    return this.executor.inputNodes;\n  }\n\n  get outputNodes(): string[] {\n    return this.executor.outputNodes;\n  }\n\n  get inputs(): TensorInfo[] {\n    return this.executor.inputs;\n  }\n\n  get outputs(): TensorInfo[] {\n    return this.executor.outputs;\n  }\n\n  get weights(): NamedTensorsMap {\n    return this.executor.weightMap;\n  }\n\n  get metadata(): {} {\n    return this.artifacts.userDefinedMetadata;\n  }\n\n  get modelSignature(): {} {\n    return this.signature;\n  }\n\n  get modelStructuredOutputKeys(): {} {\n    return this.structuredOutputKeys;\n  }\n\n  /**\n   * @param modelUrl url for the model, or an `io.IOHandler`.\n   * @param weightManifestUrl url for the weight file generated by\n   * scripts/convert.py script.\n   * @param requestOption options for Request, which allows to send credentials\n   * and custom headers.\n   * @param onProgress Optional, progress callback function, fired periodically\n   * before the load is completed.\n   */\n  constructor(\n      private modelUrl: ModelURL, private loadOptions: io.LoadOptions = {},\n      tfio = io) {\n    this.io = tfio;\n    if (loadOptions == null) {\n      this.loadOptions = {};\n    }\n    this.resourceManager = new ResourceManager();\n  }\n\n  private findIOHandler() {\n    type IOHandler = UrlIOHandler<ModelURL>;\n    const path = this.modelUrl;\n    if ((path as io.IOHandler).load != null) {\n      // Path is an IO Handler.\n      this.handler = path as IOHandler;\n    } else if (this.loadOptions.requestInit != null) {\n      this.handler = this.io.browserHTTPRequest(\n                         path as string, this.loadOptions) as IOHandler;\n    } else {\n      const handlers =\n          this.io.getLoadHandlers(path as string, this.loadOptions);\n      if (handlers.length === 0) {\n        // For backward compatibility: if no load handler can be found,\n        // assume it is a relative http path.\n        handlers.push(\n            this.io.browserHTTPRequest(path as string, this.loadOptions));\n      } else if (handlers.length > 1) {\n        throw new Error(\n            `Found more than one (${handlers.length}) load handlers for ` +\n            `URL '${[path]}'`);\n      }\n      this.handler = handlers[0] as IOHandler;\n    }\n  }\n\n  /**\n   * Loads the model and weight files, construct the in memory weight map and\n   * compile the inference graph.\n   */\n  load(): UrlIOHandler<ModelURL> extends io.IOHandlerSync? boolean:\n                                             Promise<boolean> {\n    type IOHandler = UrlIOHandler<ModelURL>;\n    this.findIOHandler();\n    if (this.handler.load == null) {\n      throw new Error(\n          'Cannot proceed with model loading because the IOHandler provided ' +\n          'does not have the `load` method implemented.');\n    }\n\n    type Result =\n        IOHandler extends io.IOHandlerSync ? boolean : Promise<boolean>;\n\n    const loadResult = this.handler.load() as ReturnType<IOHandler['load']>;\n    if (util.isPromise(loadResult)) {\n      return loadResult.then(artifacts => {\n        if (artifacts.getWeightStream == null) {\n          return this.loadSync(artifacts);\n        }\n        return this.loadStreaming(artifacts);\n      }) as Result;\n    }\n\n    return this.loadSync(loadResult) as Result;\n  }\n\n  /**\n   * Synchronously construct the in memory weight map and\n   * compile the inference graph.\n   *\n   * @doc {heading: 'Models', subheading: 'Classes', ignoreCI: true}\n   */\n  loadSync(artifacts: io.ModelArtifacts) {\n    const weightMap = this.io.decodeWeights(\n        artifacts.weightData, artifacts.weightSpecs);\n\n    return this.loadWithWeightMap(artifacts, weightMap);\n  }\n\n  private async loadStreaming(artifacts: io.ModelArtifacts): Promise<boolean> {\n    if (artifacts.getWeightStream == null) {\n      throw new Error('Model artifacts missing streamWeights function');\n    }\n\n    const weightMap = await decodeWeightsStream(\n      artifacts.getWeightStream(), artifacts.weightSpecs);\n\n    return this.loadWithWeightMap(artifacts, weightMap);\n  }\n\n  private loadWithWeightMap(artifacts: io.ModelArtifacts,\n                            weightMap: NamedTensorMap) {\n    this.artifacts = artifacts;\n    const graph = this.artifacts.modelTopology as tensorflow.IGraphDef;\n\n    let signature = this.artifacts.signature;\n    if (this.artifacts.userDefinedMetadata != null) {\n      const metadata = this.artifacts.userDefinedMetadata;\n      if (metadata.signature != null) {\n        signature = metadata.signature;\n      }\n\n      if (metadata.structuredOutputKeys != null) {\n        this.structuredOutputKeys = metadata.structuredOutputKeys as string[];\n      }\n    }\n    this.signature = signature;\n\n    this.version = `${graph.versions.producer}.${graph.versions.minConsumer}`;\n    this.executor = new GraphExecutor(\n        OperationMapper.Instance.transformGraph(graph, this.signature));\n    this.executor.weightMap = this.convertTensorMapToTensorsMap(weightMap);\n    // Attach a model-level resourceManager to each executor to share resources,\n    // such as `HashTable`.\n    this.executor.resourceManager = this.resourceManager;\n\n    if (artifacts.modelInitializer != null &&\n        (artifacts.modelInitializer as tensorflow.IGraphDef).node != null) {\n      const initializer =\n          OperationMapper.Instance.transformGraph(artifacts.modelInitializer);\n      this.initializer = new GraphExecutor(initializer);\n      this.initializer.weightMap = this.executor.weightMap;\n      // Attach a model-level resourceManager to the initializer, the\n      // hashTables created from when executing the initializer will be stored\n      // in the resourceManager.\n      this.initializer.resourceManager = this.resourceManager;\n      this.initializerSignature = artifacts.initializerSignature;\n    }\n\n    return true;\n  }\n\n  /**\n   * Save the configuration and/or weights of the GraphModel.\n   *\n   * An `IOHandler` is an object that has a `save` method of the proper\n   * signature defined. The `save` method manages the storing or\n   * transmission of serialized data (\"artifacts\") that represent the\n   * model's topology and weights onto or via a specific medium, such as\n   * file downloads, local storage, IndexedDB in the web browser and HTTP\n   * requests to a server. TensorFlow.js provides `IOHandler`\n   * implementations for a number of frequently used saving mediums, such as\n   * `tf.io.browserDownloads` and `tf.io.browserLocalStorage`. See `tf.io`\n   * for more details.\n   *\n   * This method also allows you to refer to certain types of `IOHandler`s\n   * as URL-like string shortcuts, such as 'localstorage://' and\n   * 'indexeddb://'.\n   *\n   * Example 1: Save `model`'s topology and weights to browser [local\n   * storage](https://developer.mozilla.org/en-US/docs/Web/API/Window/localStorage);\n   * then load it back.\n   *\n   * ```js\n   * const modelUrl =\n   *    'https://storage.googleapis.com/tfjs-models/savedmodel/mobilenet_v2_1.0_224/model.json';\n   * const model = await tf.loadGraphModel(modelUrl);\n   * const zeros = tf.zeros([1, 224, 224, 3]);\n   * model.predict(zeros).print();\n   *\n   * const saveResults = await model.save('localstorage://my-model-1');\n   *\n   * const loadedModel = await tf.loadGraphModel('localstorage://my-model-1');\n   * console.log('Prediction from loaded model:');\n   * model.predict(zeros).print();\n   * ```\n   *\n   * @param handlerOrURL An instance of `IOHandler` or a URL-like,\n   * scheme-based string shortcut for `IOHandler`.\n   * @param config Options for saving the model.\n   * @returns A `Promise` of `SaveResult`, which summarizes the result of\n   * the saving, such as byte sizes of the saved artifacts for the model's\n   *   topology and weight values.\n   *\n   * @doc {heading: 'Models', subheading: 'Classes', ignoreCI: true}\n   */\n  async save(handlerOrURL: io.IOHandler|string, config?: io.SaveConfig):\n      Promise<io.SaveResult> {\n    if (typeof handlerOrURL === 'string') {\n      const handlers = this.io.getSaveHandlers(handlerOrURL);\n      if (handlers.length === 0) {\n        throw new Error(\n            `Cannot find any save handlers for URL '${handlerOrURL}'`);\n      } else if (handlers.length > 1) {\n        throw new Error(\n            `Found more than one (${handlers.length}) save handlers for ` +\n            `URL '${handlerOrURL}'`);\n      }\n      handlerOrURL = handlers[0];\n    }\n    if (handlerOrURL.save == null) {\n      throw new Error(\n          'GraphModel.save() cannot proceed because the IOHandler ' +\n          'provided does not have the `save` attribute defined.');\n    }\n\n    return handlerOrURL.save(this.artifacts);\n  }\n\n  private addStructuredOutputNames(outputTensors: Tensor|Tensor[]) {\n    if (this.structuredOutputKeys) {\n      const outputTensorsArray =\n          outputTensors instanceof Tensor ? [outputTensors] : outputTensors;\n      const outputTensorMap: NamedTensorMap = {};\n\n      outputTensorsArray.forEach(\n          (outputTensor, i) => outputTensorMap[this.structuredOutputKeys[i]] =\n              outputTensor);\n\n      return outputTensorMap;\n    }\n    return outputTensors;\n  }\n\n  /**\n   * Execute the inference for the input tensors.\n   *\n   * @param input The input tensors, when there is single input for the model,\n   * inputs param should be a `tf.Tensor`. For models with multiple inputs,\n   * inputs params should be in either `tf.Tensor`[] if the input order is\n   * fixed, or otherwise NamedTensorMap format.\n   *\n   * For model with multiple inputs, we recommend you use NamedTensorMap as the\n   * input type, if you use `tf.Tensor`[], the order of the array needs to\n   * follow the\n   * order of inputNodes array. @see {@link GraphModel.inputNodes}\n   *\n   * You can also feed any intermediate nodes using the NamedTensorMap as the\n   * input type. For example, given the graph\n   *    InputNode => Intermediate => OutputNode,\n   * you can execute the subgraph Intermediate => OutputNode by calling\n   *    model.execute('IntermediateNode' : tf.tensor(...));\n   *\n   * This is useful for models that uses tf.dynamic_rnn, where the intermediate\n   * state needs to be fed manually.\n   *\n   * For batch inference execution, the tensors for each input need to be\n   * concatenated together. For example with mobilenet, the required input shape\n   * is [1, 244, 244, 3], which represents the [batch, height, width, channel].\n   * If we are provide a batched data of 100 images, the input tensor should be\n   * in the shape of [100, 244, 244, 3].\n   *\n   * @param config Prediction configuration for specifying the batch size.\n   * Currently the batch size option is ignored for graph model.\n   *\n   * @returns Inference result tensors. If the model is converted and it\n   * originally had structured_outputs in tensorflow, then a NamedTensorMap\n   * will be returned matching the structured_outputs. If no structured_outputs\n   * are present, the output will be single `tf.Tensor` if the model has single\n   * output node, otherwise Tensor[].\n   *\n   * @doc {heading: 'Models', subheading: 'Classes'}\n   */\n  predict(inputs: Tensor|Tensor[]|NamedTensorMap, config?: ModelPredictConfig):\n      Tensor|Tensor[]|NamedTensorMap {\n    const outputTensors = this.execute(inputs, this.outputNodes);\n    return this.addStructuredOutputNames(outputTensors);\n  }\n\n  /**\n   * Execute the inference for the input tensors in async fashion, use this\n   * method when your model contains control flow ops.\n   *\n   * @param input The input tensors, when there is single input for the model,\n   * inputs param should be a `tf.Tensor`. For models with mutliple inputs,\n   * inputs params should be in either `tf.Tensor`[] if the input order is\n   * fixed, or otherwise NamedTensorMap format.\n   *\n   * For model with multiple inputs, we recommend you use NamedTensorMap as the\n   * input type, if you use `tf.Tensor`[], the order of the array needs to\n   * follow the\n   * order of inputNodes array. @see {@link GraphModel.inputNodes}\n   *\n   * You can also feed any intermediate nodes using the NamedTensorMap as the\n   * input type. For example, given the graph\n   *    InputNode => Intermediate => OutputNode,\n   * you can execute the subgraph Intermediate => OutputNode by calling\n   *    model.execute('IntermediateNode' : tf.tensor(...));\n   *\n   * This is useful for models that uses tf.dynamic_rnn, where the intermediate\n   * state needs to be fed manually.\n   *\n   * For batch inference execution, the tensors for each input need to be\n   * concatenated together. For example with mobilenet, the required input shape\n   * is [1, 244, 244, 3], which represents the [batch, height, width, channel].\n   * If we are provide a batched data of 100 images, the input tensor should be\n   * in the shape of [100, 244, 244, 3].\n   *\n   * @param config Prediction configuration for specifying the batch size.\n   * Currently the batch size option is ignored for graph model.\n   *\n   * @returns A Promise of inference result tensors. If the model is converted\n   * and it originally had structured_outputs in tensorflow, then a\n   * NamedTensorMap will be returned matching the structured_outputs. If no\n   * structured_outputs are present, the output will be single `tf.Tensor` if\n   * the model has single output node, otherwise Tensor[].\n   *\n   * @doc {heading: 'Models', subheading: 'Classes'}\n   */\n  async predictAsync(\n      inputs: Tensor|Tensor[]|NamedTensorMap,\n      config?: ModelPredictConfig): Promise<Tensor|Tensor[]|NamedTensorMap> {\n    const outputTensors = await this.executeAsync(inputs, this.outputNodes);\n    return this.addStructuredOutputNames(outputTensors);\n  }\n\n  private normalizeInputs(inputs: Tensor|Tensor[]|\n                          NamedTensorMap): NamedTensorMap {\n    if (!(inputs instanceof Tensor) && !Array.isArray(inputs)) {\n      // The input is already a NamedTensorMap.\n      const signatureInputs = this.signature?.inputs;\n      if (signatureInputs != null) {\n        for (const input in signatureInputs) {\n          const tensor = signatureInputs[input];\n          if (tensor.resourceId != null) {\n            inputs[input] = this.resourceIdToCapturedInput[tensor.resourceId];\n          }\n        }\n      }\n      return inputs;\n    }\n    inputs = Array.isArray(inputs) ? inputs : [inputs];\n\n    const numCapturedInputs =\n        Object.keys(this.resourceIdToCapturedInput).length;\n    if (inputs.length + numCapturedInputs !== this.inputNodes.length) {\n      throw new Error(`Input tensor count mismatch, the graph model has ${\n          this.inputNodes.length -\n          numCapturedInputs} non-resource placeholders, while there are ${\n          inputs.length} input tensors provided.`);\n    }\n\n    let inputIndex = 0;\n    return this.inputNodes.reduce((map, inputName) => {\n      const resourceId = this.signature?.inputs?.[inputName]?.resourceId;\n      if (resourceId != null) {\n        map[inputName] = this.resourceIdToCapturedInput[resourceId];\n      } else {\n        map[inputName] = (inputs as Tensor[])[inputIndex++];\n      }\n      return map;\n    }, {} as NamedTensorMap);\n  }\n\n  private normalizeOutputs(outputs: string|string[]): string[] {\n    outputs = outputs || this.outputNodes;\n    return !Array.isArray(outputs) ? [outputs] : outputs;\n  }\n\n  private executeInitializerGraph() {\n    if (this.initializer == null) {\n      return [];\n    }\n    if (this.initializerSignature == null) {\n      return this.initializer.execute({}, []);\n    } else {\n      return this.initializer.execute(\n          {}, Object.keys(this.initializerSignature.outputs));\n    }\n  }\n\n  private async executeInitializerGraphAsync() {\n    if (this.initializer == null) {\n      return [];\n    }\n    if (this.initializerSignature == null) {\n      return this.initializer.executeAsync({}, []);\n    } else {\n      return this.initializer.executeAsync(\n          {}, Object.keys(this.initializerSignature.outputs));\n    }\n  }\n\n  private setResourceIdToCapturedInput(outputs: Tensor[]) {\n    this.resourceIdToCapturedInput = {};\n\n    if (this.initializerSignature) {\n      const signatureOutputs = this.initializerSignature.outputs;\n      const outputNames = Object.keys(signatureOutputs);\n      for (let i = 0; i < outputNames.length; i++) {\n        const outputName = outputNames[i];\n        const tensorInfo = signatureOutputs[outputName];\n        this.resourceIdToCapturedInput[tensorInfo.resourceId] = outputs[i];\n      }\n    }\n  }\n\n  /**\n   * Executes inference for the model for given input tensors.\n   * @param inputs tensor, tensor array or tensor map of the inputs for the\n   * model, keyed by the input node names.\n   * @param outputs output node name from the TensorFlow model, if no\n   * outputs are specified, the default outputs of the model would be used.\n   * You can inspect intermediate nodes of the model by adding them to the\n   * outputs array.\n   *\n   * @returns A single tensor if provided with a single output or no outputs\n   * are provided and there is only one default output, otherwise return a\n   * tensor array. The order of the tensor array is the same as the outputs\n   * if provided, otherwise the order of outputNodes attribute of the model.\n   *\n   * @doc {heading: 'Models', subheading: 'Classes'}\n   */\n  execute(inputs: Tensor|Tensor[]|NamedTensorMap, outputs?: string|string[]):\n      Tensor|Tensor[] {\n    if (this.resourceIdToCapturedInput == null) {\n      this.setResourceIdToCapturedInput(this.executeInitializerGraph());\n    }\n    inputs = this.normalizeInputs(inputs);\n    outputs = this.normalizeOutputs(outputs);\n    const result = this.executor.execute(inputs, outputs);\n    return result.length > 1 ? result : result[0];\n  }\n\n  /**\n   * Executes inference for the model for given input tensors in async\n   * fashion, use this method when your model contains control flow ops.\n   * @param inputs tensor, tensor array or tensor map of the inputs for the\n   * model, keyed by the input node names.\n   * @param outputs output node name from the TensorFlow model, if no outputs\n   * are specified, the default outputs of the model would be used. You can\n   * inspect intermediate nodes of the model by adding them to the outputs\n   * array.\n   *\n   * @returns A Promise of single tensor if provided with a single output or\n   * no outputs are provided and there is only one default output, otherwise\n   * return a tensor map.\n   *\n   * @doc {heading: 'Models', subheading: 'Classes'}\n   */\n  async executeAsync(\n      inputs: Tensor|Tensor[]|NamedTensorMap,\n      outputs?: string|string[]): Promise<Tensor|Tensor[]> {\n    if (this.resourceIdToCapturedInput == null) {\n      this.setResourceIdToCapturedInput(\n          await this.executeInitializerGraphAsync());\n    }\n    inputs = this.normalizeInputs(inputs);\n    outputs = this.normalizeOutputs(outputs);\n    const result = await this.executor.executeAsync(inputs, outputs);\n    return result.length > 1 ? result : result[0];\n  }\n\n  /**\n   * Get intermediate tensors for model debugging mode (flag\n   * KEEP_INTERMEDIATE_TENSORS is true).\n   *\n   * @doc {heading: 'Models', subheading: 'Classes'}\n   */\n  getIntermediateTensors(): NamedTensorsMap {\n    return this.executor.getIntermediateTensors();\n  }\n\n  /**\n   * Dispose intermediate tensors for model debugging mode (flag\n   * KEEP_INTERMEDIATE_TENSORS is true).\n   *\n   * @doc {heading: 'Models', subheading: 'Classes'}\n   */\n  disposeIntermediateTensors() {\n    this.executor.disposeIntermediateTensors();\n  }\n\n  private convertTensorMapToTensorsMap(map: NamedTensorMap): NamedTensorsMap {\n    return Object.keys(map).reduce((newMap: NamedTensorsMap, key) => {\n      newMap[key] = [map[key]];\n      return newMap;\n    }, {});\n  }\n\n  /**\n   * Releases the memory used by the weight tensors and resourceManager.\n   *\n   * @doc {heading: 'Models', subheading: 'Classes'}\n   */\n  dispose() {\n    this.executor.dispose();\n\n    if (this.initializer) {\n      this.initializer.dispose();\n      if (this.resourceIdToCapturedInput) {\n        dispose(this.resourceIdToCapturedInput);\n      }\n    }\n\n    this.resourceManager.dispose();\n  }\n}\n\n/**\n * Load a graph model given a URL to the model definition.\n *\n * Example of loading MobileNetV2 from a URL and making a prediction with a\n * zeros input:\n *\n * ```js\n * const modelUrl =\n *    'https://storage.googleapis.com/tfjs-models/savedmodel/mobilenet_v2_1.0_224/model.json';\n * const model = await tf.loadGraphModel(modelUrl);\n * const zeros = tf.zeros([1, 224, 224, 3]);\n * model.predict(zeros).print();\n * ```\n *\n * Example of loading MobileNetV2 from a TF Hub URL and making a prediction\n * with a zeros input:\n *\n * ```js\n * const modelUrl =\n *    'https://tfhub.dev/google/imagenet/mobilenet_v2_140_224/classification/2';\n * const model = await tf.loadGraphModel(modelUrl, {fromTFHub: true});\n * const zeros = tf.zeros([1, 224, 224, 3]);\n * model.predict(zeros).print();\n * ```\n * @param modelUrl The url or an `io.IOHandler` that loads the model.\n * @param options Options for the HTTP request, which allows to send\n *     credentials\n *    and custom headers.\n *\n * @doc {heading: 'Models', subheading: 'Loading'}\n */\nexport async function loadGraphModel(\n    modelUrl: string|io.IOHandler, options: io.LoadOptions = {},\n    tfio = io): Promise<GraphModel> {\n  if (modelUrl == null) {\n    throw new Error(\n        'modelUrl in loadGraphModel() cannot be null. Please provide a url ' +\n        'or an IOHandler that loads the model');\n  }\n  if (options == null) {\n    options = {};\n  }\n\n  if (options.fromTFHub && typeof modelUrl === 'string') {\n    modelUrl = getTFHubUrl(modelUrl);\n  }\n  const model = new GraphModel(modelUrl, options, tfio);\n  await model.load();\n  return model;\n}\n\n/**\n * Load a graph model given a synchronous IO handler with a 'load' method.\n *\n * @param modelSource The `io.IOHandlerSync` that loads the model, or the\n *     `io.ModelArtifacts` that encode the model, or a tuple of\n *     `[io.ModelJSON, ArrayBuffer]` of which the first element encodes the\n *      model and the second contains the weights.\n *\n * @doc {heading: 'Models', subheading: 'Loading'}\n */\nexport function loadGraphModelSync(\n    modelSource: io.IOHandlerSync|\n    io.ModelArtifacts|[io.ModelJSON, /* Weights */ ArrayBuffer]):\n    GraphModel<io.IOHandlerSync> {\n  if (modelSource == null) {\n    throw new Error(\n        'modelUrl in loadGraphModelSync() cannot be null. Please provide ' +\n        'model artifacts or an IOHandler that loads the model');\n  }\n\n  let ioHandler: io.IOHandlerSync;\n  if (modelSource instanceof Array) {\n    const [modelJSON, weights] = modelSource;\n    if (!modelJSON) {\n      throw new Error('modelJSON must be the first element of the array');\n    }\n    if (!weights || !(weights instanceof ArrayBuffer)) {\n      throw new Error(\n          'An ArrayBuffer of weights must be the second element of' +\n          ' the array');\n    }\n    if (!('modelTopology' in modelJSON)) {\n      throw new Error('Model JSON is missing \\'modelTopology\\'');\n    }\n    if (!('weightsManifest' in modelJSON)) {\n      throw new Error('Model JSON is missing \\'weightsManifest\\'');\n    }\n\n    const weightSpecs = io.getWeightSpecs(modelJSON.weightsManifest);\n    const modelArtifacts =\n        io.getModelArtifactsForJSONSync(modelJSON, weightSpecs, weights);\n    ioHandler = io.fromMemorySync(modelArtifacts);\n  } else if ('load' in modelSource) {\n    // Then modelSource is already an IOHandlerSync.\n    ioHandler = modelSource;\n  } else if (\n      'modelTopology' in modelSource && 'weightSpecs' in modelSource &&\n      'weightData' in modelSource) {\n    // modelSource is of type ModelArtifacts.\n    ioHandler = io.fromMemorySync(modelSource);\n  } else {\n    throw new Error('Unknown model format');\n  }\n\n  const model = new GraphModel(ioHandler);\n  model.load();\n  return model;\n}\n\nfunction getTFHubUrl(modelUrl: string): string {\n  if (!modelUrl.endsWith('/')) {\n    modelUrl = (modelUrl) + '/';\n  }\n  return `${modelUrl}${DEFAULT_MODEL_NAME}${TFHUB_SEARCH_PARAM}`;\n}\n", "/** @license See the LICENSE file. */\n\n// This code is auto-generated, do not modify this file!\nconst version = '4.22.0';\nexport {version};\n", "import fs from \"fs\";\nimport path from \"path\";\nimport zlib from \"zlib\";\nimport { TfjsEmbedder } from \"./tfjs-embedder.ts\";\nimport { logToolResult } from \"./logger.ts\";\n\nexport interface UseCaseResult {\n  id: string;\n  description: string;\n  category: string;\n  featuresUsed?: string[];\n  tokenCount: number;\n  similarity: number;\n}\n\nlet cachedVectors: { id: string; description: string; category: string; featuresUsed: string[]; tokenCount: number; vector: number[]; norm: number }[] | null = null;\n\nfunction dotProduct(a: number[], b: number[]): number {\n  let dotProduct = 0;\n  for (let i = 0; i < a.length; i++) {\n    dotProduct += a[i] * b[i];\n  }\n  return dotProduct;\n}\n\nfunction calculateNorm(v: number[]): number {\n  let sum = 0;\n  for (const val of v) {\n    sum += val * val;\n  }\n  return Math.sqrt(sum);\n}\n\nexport async function searchUseCases(query: string, limit = 5, minSimilarity = 0.3, embedder?: any): Promise<UseCaseResult[]> {\n  const actualEmbedder = embedder || TfjsEmbedder.getInstance();\n  const queryVector = await actualEmbedder.embed(query);\n  const queryNorm = calculateNorm(queryVector);\n\n  if (!cachedVectors) {\n    const VECTORS_FILE = path.join(import.meta.dirname, \"use-cases.vectors.gen.json.gz\");\n    if (!fs.existsSync(VECTORS_FILE)) {\n      return [];\n    }\n\n    const compressed = fs.readFileSync(VECTORS_FILE);\n    const jsonContent = zlib.gunzipSync(compressed).toString(\"utf-8\");\n    const items: any[] = JSON.parse(jsonContent);\n\n    cachedVectors = items.map(item => ({\n      id: item.id,\n      description: item.description,\n      category: item.category,\n      featuresUsed: item.featuresUsed || [],\n      tokenCount: item.tokenCount || 0,\n      vector: item.vector,\n      norm: item.vector ? calculateNorm(item.vector) : 0\n    })).filter(item => item.vector);\n  }\n\n  const resultsMap = new Map<string, { item: (typeof cachedVectors)[0]; similarity: number }>();\n\n  for (const item of cachedVectors) {\n    if (item.norm === 0 || queryNorm === 0) continue;\n    \n    const sim = dotProduct(queryVector, item.vector) / (queryNorm * item.norm);\n    \n    if (sim < minSimilarity) continue;\n\n    const existing = resultsMap.get(item.id);\n    if (!existing || sim > existing.similarity) {\n      resultsMap.set(item.id, { item, similarity: sim });\n    }\n  }\n\n  const results = Array.from(resultsMap.values());\n\n  // Sort by similarity descending\n  results.sort((a, b) => b.similarity - a.similarity);\n\n  const limitedResults = results.slice(0, limit).map(r => ({\n    id: r.item.id,\n    description: r.item.description,\n    category: r.item.category,\n    featuresUsed: r.item.featuresUsed?.length ? r.item.featuresUsed : undefined,\n    tokenCount: r.item.tokenCount,\n    similarity: parseFloat(r.similarity.toFixed(4))\n  }));\n\n  // Log the result\n  logToolResult(\"search_use_cases\", limitedResults.map(r => ({ id: r.id, similarity: r.similarity })));\n\n  return limitedResults;\n}\n", "import { setBackend, tensor2d, Tensor } from \"@tensorflow/tfjs-core\";\nimport { loadGraphModel, GraphModel } from \"@tensorflow/tfjs-converter\";\nimport { BertTokenizer } from \"@huggingface/transformers\";\nimport \"./tfjs-kernels.ts\";\nimport path from \"path\";\nimport fs from \"fs\";\n\n// Custom IOHandler for loading TFJS models from disk in Node without fetch\nfunction createNodeFileSystemIOHandler(modelJsonPath: string) {\n  return {\n    load: async () => {\n      const dir = path.dirname(modelJsonPath);\n      const modelJson = JSON.parse(await fs.promises.readFile(modelJsonPath, \"utf-8\"));\n      const modelTopology = modelJson.modelTopology;\n      const weightsManifest = modelJson.weightsManifest;\n      const weightSpecs: any[] = [];\n\n      // NOTE: Simplified assuming 1 shard for MiniLM (group1-shard1of1.bin).\n      // If we go back to multiple shards in the future, restore the loops:\n      // for (const manifest of weightsManifest) { weightSpecs.push(...manifest.weights); for (const shardPath of manifest.paths) shardPromises.push(fs.promises.readFile(path.resolve(dir, shardPath))); }\n      const manifest = weightsManifest[0];\n      weightSpecs.push(...manifest.weights);\n      const shardPath = manifest.paths[0];\n      const fullPath = path.resolve(dir, shardPath);\n      const weightData = (await fs.promises.readFile(fullPath)).buffer;\n\n      return {\n        modelTopology,\n        weightSpecs,\n        weightData\n      };\n    }\n  };\n}\n\nexport class TfjsEmbedder {\n  private static instance: TfjsEmbedder;\n  private model: GraphModel | null = null;\n  private tokenizer: any = null;\n  public modelName = \"tfjs:all-MiniLM-L6-v2\";\n\n  private constructor() {}\n\n  public static getInstance(): TfjsEmbedder {\n    if (!TfjsEmbedder.instance) {\n      TfjsEmbedder.instance = new TfjsEmbedder();\n    }\n    return TfjsEmbedder.instance;\n  }\n\n  public static clearInstance() {\n    TfjsEmbedder.instance = null as any;\n  }\n\n  public async init() {\n    if (this.model) return;\n\n    const benchmarkDir = path.resolve(import.meta.dirname);\n    const modelPath = path.resolve(benchmarkDir, \"tfjs_model_minilm/model.json\");\n\n    try {\n        const ioHandler = createNodeFileSystemIOHandler(modelPath);\n\n        // Silence TFJS console warning about node backend\n        const oldLog = console.log;\n        const oldWarn = console.warn;\n        console.log = () => {};\n        console.warn = () => {};\n\n        try {\n            await setBackend('cpu');\n            this.model = await loadGraphModel(ioHandler as any);\n        } finally {\n            console.log = oldLog;\n            console.warn = oldWarn;\n        }\n\n        // Use local_files_only first to avoid a network request to huggingface.\n        try {\n            this.tokenizer = await BertTokenizer.from_pretrained(\"Xenova/all-MiniLM-L6-v2\", { local_files_only: true });\n        } catch (e) {\n            this.tokenizer = await BertTokenizer.from_pretrained(\"Xenova/all-MiniLM-L6-v2\");\n        }\n    } catch (e) {\n        console.error(\"Failed to load TFJS model:\", e);\n        throw e;\n    }\n  }\n\n  public async embed(text: string): Promise<number[]> {\n    if (!this.model || !this.tokenizer) {\n        await this.init();\n    }\n    if (!this.model || !this.tokenizer) {\n        throw new Error(\"Failed to initialize TFJS Embedder\");\n    }\n\n    const tokenized = await this.tokenizer(text, { padding: true, truncation: true });\n\n    // Extract data and convert to numbers (handling BigInt if present)\n    const extractData = (tensor: any) => {\n        const data = tensor.data || tensor;\n        return Array.from(data).map((x: any) => Number(x));\n    };\n\n    const inputIdsData = extractData(tokenized.input_ids);\n    const attentionMaskData = extractData(tokenized.attention_mask);\n    const tokenTypeIdsData = extractData(tokenized.token_type_ids);\n\n    const inputIds = tensor2d([inputIdsData], undefined, 'int32');\n    const attentionMask = tensor2d([attentionMaskData], undefined, 'int32');\n    const tokenTypeIds = tensor2d([tokenTypeIdsData], undefined, 'int32');\n\n    const result = this.model.predict({\n        \"input_ids\": inputIds,\n        \"attention_mask\": attentionMask,\n        \"token_type_ids\": tokenTypeIds\n    }) as Tensor;\n\n    const data = await result.data();\n\n    // Cleanup tensors\n    inputIds.dispose();\n    attentionMask.dispose();\n    tokenTypeIds.dispose();\n    result.dispose();\n\n    return Array.from(data);\n  }\n\n  public shutdown() {\n    // No-op: we use custom IO handler instead of local server now\n  }\n}\n", "\n/**\n * A base class for creating callable objects.\n * See [here](https://stackoverflow.com/q/76073890) for more information.\n * \n * @type {new () => {(...args: any[]): any, _call(...args: any[]): any}}\n */\nexport const Callable = /** @type {any} */ (class {\n    /**\n    * Creates a new instance of the Callable class.\n    */\n    constructor() {\n        /**\n         * Creates a closure that delegates to a private method '_call' with the given arguments.\n         * @type {any}\n         * @param {...any} args Zero or more arguments to pass to the '_call' method.\n         * @returns {*} The result of calling the '_call' method.\n         */\n        let closure = function (...args) {\n            return closure._call(...args)\n        }\n        return Object.setPrototypeOf(closure, new.target.prototype)\n    }\n\n    /**\n     * This method should be implemented in subclasses to provide the\n     * functionality of the callable object.\n     *\n     * @param {any[]} args\n     * @throws {Error} If the subclass does not implement the `_call` method.\n     */\n    _call(...args) {\n        throw Error('Must implement _call method in subclass')\n    }\n});\n", "\n/**\n * @file Core utility functions/classes for Transformers.js.\n *\n * These are only used internally, meaning an end-user shouldn't\n * need to access anything here.\n *\n * @module utils/core\n */\n\n/**\n * @typedef {Object} InitiateProgressInfo\n * @property {'initiate'} status\n * @property {string} name The model id or directory path.\n * @property {string} file The name of the file.\n */\n\n/**\n * @typedef {Object} DownloadProgressInfo\n * @property {'download'} status\n * @property {string} name The model id or directory path.\n * @property {string} file The name of the file.\n */\n\n/**\n * @typedef {Object} ProgressStatusInfo\n * @property {'progress'} status\n * @property {string} name The model id or directory path.\n * @property {string} file The name of the file.\n * @property {number} progress A number between 0 and 100.\n * @property {number} loaded The number of bytes loaded.\n * @property {number} total The total number of bytes to be loaded.\n */\n\n/**\n * @typedef {Object} DoneProgressInfo\n * @property {'done'} status\n * @property {string} name The model id or directory path.\n * @property {string} file The name of the file.\n */\n\n/**\n * @typedef {Object} ReadyProgressInfo\n * @property {'ready'} status\n * @property {string} task The loaded task.\n * @property {string} model The loaded model.\n */\n\n/**\n * @typedef {InitiateProgressInfo | DownloadProgressInfo | ProgressStatusInfo | DoneProgressInfo | ReadyProgressInfo} ProgressInfo\n */\n\n/**\n * A callback function that is called with progress information.\n * @callback ProgressCallback\n * @param {ProgressInfo} progressInfo\n * @returns {void}\n */\n\n/**\n * Helper function to dispatch progress callbacks.\n *\n * @param {ProgressCallback | null | undefined} progress_callback The progress callback function to dispatch.\n * @param {ProgressInfo} data The data to pass to the progress callback function.\n * @returns {void}\n * @private\n */\nexport function dispatchCallback(progress_callback, data) {\n    if (progress_callback) progress_callback(data);\n}\n\n/**\n * Reverses the keys and values of an object.\n *\n * @param {Object} data The object to reverse.\n * @returns {Object} The reversed object.\n * @see https://ultimatecourses.com/blog/reverse-object-keys-and-values-in-javascript\n */\nexport function reverseDictionary(data) {\n    // https://ultimatecourses.com/blog/reverse-object-keys-and-values-in-javascript\n    return Object.fromEntries(Object.entries(data).map(([key, value]) => [value, key]));\n}\n\n/**\n * Escapes regular expression special characters from a string by replacing them with their escaped counterparts.\n *\n * @param {string} string The string to escape.\n * @returns {string} The escaped string.\n */\nexport function escapeRegExp(string) {\n    return string.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&'); // $& means the whole matched string\n}\n\n/**\n * Check if a value is a typed array.\n * @param {*} val The value to check.\n * @returns {boolean} True if the value is a `TypedArray`, false otherwise.\n *\n * Adapted from https://stackoverflow.com/a/71091338/13989043\n */\nexport function isTypedArray(val) {\n    return val?.prototype?.__proto__?.constructor?.name === 'TypedArray';\n}\n\n\n/**\n * Check if a value is an integer.\n * @param {*} x The value to check.\n * @returns {boolean} True if the value is a string, false otherwise.\n */\nexport function isIntegralNumber(x) {\n    return Number.isInteger(x) || typeof x === 'bigint'\n}\n\n/**\n * Determine if a provided width or height is nullish.\n * @param {*} x The value to check.\n * @returns {boolean} True if the value is `null`, `undefined` or `-1`, false otherwise.\n */\nexport function isNullishDimension(x) {\n    return x === null || x === undefined || x === -1;\n}\n\n/**\n * Calculates the dimensions of a nested array.\n *\n * @param {any[]} arr The nested array to calculate dimensions for.\n * @returns {number[]} An array containing the dimensions of the input array.\n */\nexport function calculateDimensions(arr) {\n    const dimensions = [];\n    let current = arr;\n    while (Array.isArray(current)) {\n        dimensions.push(current.length);\n        current = current[0];\n    }\n    return dimensions;\n}\n\n/**\n * Replicate python's .pop() method for objects.\n * @param {Object} obj The object to pop from.\n * @param {string} key The key to pop.\n * @param {*} defaultValue The default value to return if the key does not exist.\n * @returns {*} The value of the popped key.\n * @throws {Error} If the key does not exist and no default value is provided.\n */\nexport function pop(obj, key, defaultValue = undefined) {\n    const value = obj[key];\n    if (value !== undefined) {\n        delete obj[key];\n        return value;\n    }\n    if (defaultValue === undefined) {\n        throw Error(`Key ${key} does not exist in object.`)\n    }\n    return defaultValue;\n}\n\n/**\n * Efficiently merge arrays, creating a new copy.\n * Adapted from https://stackoverflow.com/a/6768642/13989043\n * @param  {Array[]} arrs Arrays to merge.\n * @returns {Array} The merged array.\n */\nexport function mergeArrays(...arrs) {\n    return Array.prototype.concat.apply([], arrs);\n}\n\n/**\n * Compute the Cartesian product of given arrays\n * @param {...Array} a Arrays to compute the product\n * @returns {Array} Returns the computed Cartesian product as an array\n * @private\n */\nexport function product(...a) {\n    // Cartesian product of items\n    // Adapted from https://stackoverflow.com/a/43053803\n    return a.reduce((a, b) => a.flatMap(d => b.map(e => [d, e])));\n}\n\n/**\n * Calculates the index offset for a given index and window size.\n * @param {number} i The index.\n * @param {number} w The window size.\n * @returns {number} The index offset.\n */\nexport function calculateReflectOffset(i, w) {\n    return Math.abs((i + w) % (2 * w) - w);\n}\n\n/**\n * Save blob file on the web.\n * @param {string} path The path to save the blob to\n * @param {Blob} blob The blob to save\n */\nexport function saveBlob(path, blob){\n    // Convert the canvas content to a data URL\n    const dataURL = URL.createObjectURL(blob);\n\n    // Create an anchor element with the data URL as the href attribute\n    const downloadLink = document.createElement('a');\n    downloadLink.href = dataURL;\n\n    // Set the download attribute to specify the desired filename for the downloaded image\n    downloadLink.download = path;\n\n    // Trigger the download\n    downloadLink.click();\n\n    // Clean up: remove the anchor element from the DOM\n    downloadLink.remove();\n\n    // Revoke the Object URL to free up memory\n    URL.revokeObjectURL(dataURL);\n}\n\n/**\n *\n * @param {Object} o\n * @param {string[]} props\n * @returns {Object}\n */\nexport function pick(o, props) {\n    return Object.assign(\n        {},\n        ...props.map((prop) => {\n            if (o[prop] !== undefined) {\n                return { [prop]: o[prop] };\n            }\n        })\n    );\n}\n\n/**\n * Calculate the length of a string, taking multi-byte characters into account.\n * This mimics the behavior of Python's `len` function.\n * @param {string} s The string to calculate the length of.\n * @returns {number} The length of the string.\n */\nexport function len(s) {\n    let length = 0;\n    for (const c of s) ++length;\n    return length;\n}\n\n/**\n * Count the occurrences of a value in an array or string.\n * This mimics the behavior of Python's `count` method.\n * @param {any[]|string} arr The array or string to search.\n * @param {any} value The value to count.\n */\nexport function count(arr, value) {\n    let count = 0;\n    for (const v of arr) {\n        if (v === value) ++count;\n    }\n    return count;\n}\n", "\n/**\n * @file Utility functions to interact with the Hugging Face Hub (https://huggingface.co/models)\n *\n * @module utils/hub\n */\n\nimport fs from 'node:fs';\nimport path from 'node:path';\n\nimport { apis, env } from '../env.js';\nimport { dispatchCallback } from './core.js';\n\n/**\n * @typedef {boolean|number} ExternalData Whether to load the model using the external data format (used for models >= 2GB in size).\n * If `true`, the model will be loaded using the external data format.\n * If a number, this many chunks will be loaded using the external data format (of the form: \"model.onnx_data[_{chunk_number}]\").\n */\nexport const MAX_EXTERNAL_DATA_CHUNKS = 100;\n\n/**\n * @typedef {Object} PretrainedOptions Options for loading a pretrained model.\n * @property {import('./core.js').ProgressCallback} [progress_callback=null] If specified, this function will be called during model construction, to provide the user with progress updates.\n * @property {import('../configs.js').PretrainedConfig} [config=null] Configuration for the model to use instead of an automatically loaded configuration. Configuration can be automatically loaded when:\n * - The model is a model provided by the library (loaded with the *model id* string of a pretrained model).\n * - The model is loaded by supplying a local directory as `pretrained_model_name_or_path` and a configuration JSON file named *config.json* is found in the directory.\n * @property {string} [cache_dir=null] Path to a directory in which a downloaded pretrained model configuration should be cached if the standard cache should not be used.\n * @property {boolean} [local_files_only=false] Whether or not to only look at local files (e.g., not try downloading the model).\n * @property {string} [revision='main'] The specific model version to use. It can be a branch name, a tag name, or a commit id,\n * since we use a git-based system for storing models and other artifacts on huggingface.co, so `revision` can be any identifier allowed by git.\n * NOTE: This setting is ignored for local requests.\n */\n\n/**\n * @typedef {Object} ModelSpecificPretrainedOptions Options for loading a pretrained model.\n * @property {string} [subfolder='onnx'] In case the relevant files are located inside a subfolder of the model repo on huggingface.co,\n * you can specify the folder name here.\n * @property {string} [model_file_name=null] If specified, load the model with this name (excluding the .onnx suffix). Currently only valid for encoder- or decoder-only models.\n * @property {import(\"./devices.js\").DeviceType|Record<string, import(\"./devices.js\").DeviceType>} [device=null] The device to run the model on. If not specified, the device will be chosen from the environment settings.\n * @property {import(\"./dtypes.js\").DataType|Record<string, import(\"./dtypes.js\").DataType>} [dtype=null] The data type to use for the model. If not specified, the data type will be chosen from the environment settings.\n * @property {ExternalData|Record<string, ExternalData>} [use_external_data_format=false] Whether to load the model using the external data format (used for models >= 2GB in size).\n * @property {import('onnxruntime-common').InferenceSession.SessionOptions} [session_options] (Optional) User-specified session options passed to the runtime. If not provided, suitable defaults will be chosen.\n */\n\n/**\n * @typedef {PretrainedOptions & ModelSpecificPretrainedOptions} PretrainedModelOptions Options for loading a pretrained model.\n */\n\n/**\n * Mapping from file extensions to MIME types.\n */\nconst CONTENT_TYPE_MAP = {\n    'txt': 'text/plain',\n    'html': 'text/html',\n    'css': 'text/css',\n    'js': 'text/javascript',\n    'json': 'application/json',\n    'png': 'image/png',\n    'jpg': 'image/jpeg',\n    'jpeg': 'image/jpeg',\n    'gif': 'image/gif',\n}\nclass FileResponse {\n\n    /**\n     * Creates a new `FileResponse` object.\n     * @param {string} filePath\n     */\n    constructor(filePath) {\n        this.filePath = filePath;\n        this.headers = new Headers();\n\n        this.exists = fs.existsSync(filePath);\n        if (this.exists) {\n            this.status = 200;\n            this.statusText = 'OK';\n\n            let stats = fs.statSync(filePath);\n            this.headers.set('content-length', stats.size.toString());\n\n            this.updateContentType();\n\n            const stream = fs.createReadStream(filePath);\n            this.body = new ReadableStream({\n                start(controller) {\n                    stream.on('data', (chunk) => controller.enqueue(chunk));\n                    stream.on('end', () => controller.close());\n                    stream.on('error', (err) => controller.error(err));\n                },\n                cancel() {\n                    stream.destroy();\n                }\n            });\n        } else {\n            this.status = 404;\n            this.statusText = 'Not Found';\n            this.body = null;\n        }\n    }\n\n    /**\n     * Updates the 'content-type' header property of the response based on the extension of\n     * the file specified by the filePath property of the current object.\n     * @returns {void}\n     */\n    updateContentType() {\n        // Set content-type header based on file extension\n        const extension = this.filePath.toString().split('.').pop().toLowerCase();\n        this.headers.set('content-type', CONTENT_TYPE_MAP[extension] ?? 'application/octet-stream');\n    }\n\n    /**\n     * Clone the current FileResponse object.\n     * @returns {FileResponse} A new FileResponse object with the same properties as the current object.\n     */\n    clone() {\n        let response = new FileResponse(this.filePath);\n        response.exists = this.exists;\n        response.status = this.status;\n        response.statusText = this.statusText;\n        response.headers = new Headers(this.headers);\n        return response;\n    }\n\n    /**\n     * Reads the contents of the file specified by the filePath property and returns a Promise that\n     * resolves with an ArrayBuffer containing the file's contents.\n     * @returns {Promise<ArrayBuffer>} A Promise that resolves with an ArrayBuffer containing the file's contents.\n     * @throws {Error} If the file cannot be read.\n     */\n    async arrayBuffer() {\n        const data = await fs.promises.readFile(this.filePath);\n        return /** @type {ArrayBuffer} */ (data.buffer);\n    }\n\n    /**\n     * Reads the contents of the file specified by the filePath property and returns a Promise that\n     * resolves with a Blob containing the file's contents.\n     * @returns {Promise<Blob>} A Promise that resolves with a Blob containing the file's contents.\n     * @throws {Error} If the file cannot be read.\n     */\n    async blob() {\n        const data = await fs.promises.readFile(this.filePath);\n        return new Blob([data], { type: this.headers.get('content-type') });\n    }\n\n    /**\n     * Reads the contents of the file specified by the filePath property and returns a Promise that\n     * resolves with a string containing the file's contents.\n     * @returns {Promise<string>} A Promise that resolves with a string containing the file's contents.\n     * @throws {Error} If the file cannot be read.\n     */\n    async text() {\n        const data = await fs.promises.readFile(this.filePath, 'utf8');\n        return data;\n    }\n\n    /**\n     * Reads the contents of the file specified by the filePath property and returns a Promise that\n     * resolves with a parsed JavaScript object containing the file's contents.\n     *\n     * @returns {Promise<Object>} A Promise that resolves with a parsed JavaScript object containing the file's contents.\n     * @throws {Error} If the file cannot be read.\n     */\n    async json() {\n        return JSON.parse(await this.text());\n    }\n}\n\n/**\n * Determines whether the given string is a valid URL.\n * @param {string|URL} string The string to test for validity as an URL.\n * @param {string[]} [protocols=null] A list of valid protocols. If specified, the protocol must be in this list.\n * @param {string[]} [validHosts=null] A list of valid hostnames. If specified, the URL's hostname must be in this list.\n * @returns {boolean} True if the string is a valid URL, false otherwise.\n */\nfunction isValidUrl(string, protocols = null, validHosts = null) {\n    let url;\n    try {\n        url = new URL(string);\n    } catch (_) {\n        return false;\n    }\n    if (protocols && !protocols.includes(url.protocol)) {\n        return false;\n    }\n    if (validHosts && !validHosts.includes(url.hostname)) {\n        return false;\n    }\n    return true;\n}\n\nconst REPO_ID_REGEX = /^(\\b[\\w\\-.]+\\b\\/)?\\b[\\w\\-.]{1,96}\\b$/;\n\n/**\n * Tests whether a string is a valid Hugging Face model ID or not.\n * Adapted from https://github.com/huggingface/huggingface_hub/blob/6378820ebb03f071988a96c7f3268f5bdf8f9449/src/huggingface_hub/utils/_validators.py#L119-L170\n *\n * @param {string} string The string to test\n * @returns {boolean} True if the string is a valid model ID, false otherwise.\n */\nfunction isValidHfModelId(string) {\n    if (!REPO_ID_REGEX.test(string)) return false;\n    if (string.includes(\"..\") || string.includes(\"--\")) return false;\n    if (string.endsWith(\".git\") || string.endsWith(\".ipynb\")) return false;\n    return true;\n}\n\n/**\n * Helper function to get a file, using either the Fetch API or FileSystem API.\n *\n * @param {URL|string} urlOrPath The URL/path of the file to get.\n * @returns {Promise<FileResponse|Response>} A promise that resolves to a FileResponse object (if the file is retrieved using the FileSystem API), or a Response object (if the file is retrieved using the Fetch API).\n */\nexport async function getFile(urlOrPath) {\n\n    if (env.useFS && !isValidUrl(urlOrPath, [\"http:\", \"https:\", \"blob:\"])) {\n        return new FileResponse(\n          urlOrPath instanceof URL\n            ? urlOrPath.protocol === \"file:\"\n              ? urlOrPath.pathname\n              : urlOrPath.toString()\n            : urlOrPath,\n        );\n    } else if (typeof process !== 'undefined' && process?.release?.name === 'node') {\n        const IS_CI = !!process.env?.TESTING_REMOTELY;\n        const version = env.version;\n\n        const headers = new Headers();\n        headers.set('User-Agent', `transformers.js/${version}; is_ci/${IS_CI};`);\n\n        // Check whether we are making a request to the Hugging Face Hub.\n        const isHFURL = isValidUrl(urlOrPath, ['http:', 'https:'], ['huggingface.co', 'hf.co']);\n        if (isHFURL) {\n            // If an access token is present in the environment variables,\n            // we add it to the request headers.\n            // NOTE: We keep `HF_ACCESS_TOKEN` for backwards compatibility (as a fallback).\n            const token = process.env?.HF_TOKEN ?? process.env?.HF_ACCESS_TOKEN;\n            if (token) {\n                headers.set('Authorization', `Bearer ${token}`);\n            }\n        }\n        return fetch(urlOrPath, { headers });\n    } else {\n        // Running in a browser-environment, so we use default headers\n        // NOTE: We do not allow passing authorization headers in the browser,\n        // since this would require exposing the token to the client.\n        return fetch(urlOrPath);\n    }\n}\n\nconst ERROR_MAPPING = {\n    // 4xx errors (https://developer.mozilla.org/en-US/docs/Web/HTTP/Status#client_error_responses)\n    400: 'Bad request error occurred while trying to load file',\n    401: 'Unauthorized access to file',\n    403: 'Forbidden access to file',\n    404: 'Could not locate file',\n    408: 'Request timeout error occurred while trying to load file',\n\n    // 5xx errors (https://developer.mozilla.org/en-US/docs/Web/HTTP/Status#server_error_responses)\n    500: 'Internal server error error occurred while trying to load file',\n    502: 'Bad gateway error occurred while trying to load file',\n    503: 'Service unavailable error occurred while trying to load file',\n    504: 'Gateway timeout error occurred while trying to load file',\n}\n/**\n * Helper method to handle fatal errors that occur while trying to load a file from the Hugging Face Hub.\n * @param {number} status The HTTP status code of the error.\n * @param {string} remoteURL The URL of the file that could not be loaded.\n * @param {boolean} fatal Whether to raise an error if the file could not be loaded.\n * @returns {null} Returns `null` if `fatal = true`.\n * @throws {Error} If `fatal = false`.\n */\nfunction handleError(status, remoteURL, fatal) {\n    if (!fatal) {\n        // File was not loaded correctly, but it is optional.\n        // TODO in future, cache the response?\n        return null;\n    }\n\n    const message = ERROR_MAPPING[status] ?? `Error (${status}) occurred while trying to load file`;\n    throw Error(`${message}: \"${remoteURL}\".`);\n}\n\nclass FileCache {\n    /**\n     * Instantiate a `FileCache` object.\n     * @param {string} path\n     */\n    constructor(path) {\n        this.path = path;\n    }\n\n    /**\n     * Checks whether the given request is in the cache.\n     * @param {string} request\n     * @returns {Promise<FileResponse | undefined>}\n     */\n    async match(request) {\n\n        let filePath = path.join(this.path, request);\n        let file = new FileResponse(filePath);\n\n        if (file.exists) {\n            return file;\n        } else {\n            return undefined;\n        }\n    }\n\n    /**\n     * Adds the given response to the cache.\n     * @param {string} request\n     * @param {Response} response\n     * @param {(data: {progress: number, loaded: number, total: number}) => void} [progress_callback] Optional.\n     * The function to call with progress updates\n     * @returns {Promise<void>}\n     */\n    async put(request, response, progress_callback = undefined) {\n        let filePath = path.join(this.path, request);\n\n        try {\n            const contentLength = response.headers.get('Content-Length');\n            const total = parseInt(contentLength ?? '0');\n            let loaded = 0;\n\n            await fs.promises.mkdir(path.dirname(filePath), { recursive: true });\n            const fileStream = fs.createWriteStream(filePath);\n            const reader = response.body.getReader();\n\n            while (true) {\n                const { done, value } = await reader.read();\n                if (done) {\n                    break;\n                }\n\n                await new Promise((resolve, reject) => {\n                    fileStream.write(value, (err) => {\n                        if (err) {\n                            reject(err);\n                            return;\n                        }\n                        resolve();\n                    });\n                });\n\n                loaded += value.length;\n                const progress = total ? (loaded / total) * 100 : 0;\n\n                progress_callback?.({ progress, loaded, total });\n            }\n\n            fileStream.close();\n        } catch (error) {\n            // Clean up the file if an error occurred during download\n            try {\n                await fs.promises.unlink(filePath);\n            } catch { }\n            throw error;\n        }\n    }\n\n    // TODO add the rest?\n    // addAll(requests: RequestInfo[]): Promise<void>;\n    // delete(request: RequestInfo | URL, options?: CacheQueryOptions): Promise<boolean>;\n    // keys(request?: RequestInfo | URL, options?: CacheQueryOptions): Promise<ReadonlyArray<Request>>;\n    // match(request: RequestInfo | URL, options?: CacheQueryOptions): Promise<Response | undefined>;\n    // matchAll(request?: RequestInfo | URL, options?: CacheQueryOptions): Promise<ReadonlyArray<Response>>;\n}\n\n/**\n *\n * @param {FileCache|Cache} cache The cache to search\n * @param {string[]} names The names of the item to search for\n * @returns {Promise<FileResponse|Response|undefined>} The item from the cache, or undefined if not found.\n */\nasync function tryCache(cache, ...names) {\n    for (let name of names) {\n        try {\n            let result = await cache.match(name);\n            if (result) return result;\n        } catch (e) {\n            continue;\n        }\n    }\n    return undefined;\n}\n\n/**\n * Retrieves a file from either a remote URL using the Fetch API or from the local file system using the FileSystem API.\n * If the filesystem is available and `env.useCache = true`, the file will be downloaded and cached.\n *\n * @param {string} path_or_repo_id This can be either:\n * - a string, the *model id* of a model repo on huggingface.co.\n * - a path to a *directory* potentially containing the file.\n * @param {string} filename The name of the file to locate in `path_or_repo`.\n * @param {boolean} [fatal=true] Whether to throw an error if the file is not found.\n * @param {PretrainedOptions} [options] An object containing optional parameters.\n * @param {boolean} [return_path=false] Whether to return the path of the file instead of the file content.\n *\n * @throws Will throw an error if the file is not found and `fatal` is true.\n * @returns {Promise<string|Uint8Array>} A Promise that resolves with the file content as a Uint8Array if `return_path` is false, or the file path as a string if `return_path` is true.\n */\nexport async function getModelFile(path_or_repo_id, filename, fatal = true, options = {}, return_path = false) {\n\n    if (!env.allowLocalModels) {\n        // User has disabled local models, so we just make sure other settings are correct.\n\n        if (options.local_files_only) {\n            throw Error(\"Invalid configuration detected: local models are disabled (`env.allowLocalModels=false`) but you have requested to only use local models (`local_files_only=true`).\")\n        } else if (!env.allowRemoteModels) {\n            throw Error(\"Invalid configuration detected: both local and remote models are disabled. Fix by setting `env.allowLocalModels` or `env.allowRemoteModels` to `true`.\")\n        }\n    }\n\n    // Initiate file retrieval\n    dispatchCallback(options.progress_callback, {\n        status: 'initiate',\n        name: path_or_repo_id,\n        file: filename\n    })\n\n    // First, check if the a caching backend is available\n    // If no caching mechanism available, will download the file every time\n    let cache;\n    if (!cache && env.useCustomCache) {\n        // Allow the user to specify a custom cache system.\n        if (!env.customCache) {\n            throw Error('`env.useCustomCache=true`, but `env.customCache` is not defined.')\n        }\n\n        // Check that the required methods are defined:\n        if (!env.customCache.match || !env.customCache.put) {\n            throw new Error(\n                \"`env.customCache` must be an object which implements the `match` and `put` functions of the Web Cache API. \" +\n                \"For more information, see https://developer.mozilla.org/en-US/docs/Web/API/Cache\"\n            )\n        }\n        cache = env.customCache;\n    }\n\n    if (!cache && env.useBrowserCache) {\n        if (typeof caches === 'undefined') {\n            throw Error('Browser cache is not available in this environment.')\n        }\n        try {\n            // In some cases, the browser cache may be visible, but not accessible due to security restrictions.\n            // For example, when running an application in an iframe, if a user attempts to load the page in\n            // incognito mode, the following error is thrown: `DOMException: Failed to execute 'open' on 'CacheStorage':\n            // An attempt was made to break through the security policy of the user agent.`\n            // So, instead of crashing, we just ignore the error and continue without using the cache.\n            cache = await caches.open('transformers-cache');\n        } catch (e) {\n            console.warn('An error occurred while opening the browser cache:', e);\n        }\n    }\n\n    if (!cache && env.useFSCache) {\n        if (!apis.IS_FS_AVAILABLE) {\n            throw Error('File System Cache is not available in this environment.');\n        }\n\n        // If `cache_dir` is not specified, use the default cache directory\n        cache = new FileCache(options.cache_dir ?? env.cacheDir);\n    }\n\n    const revision = options.revision ?? 'main';\n    const requestURL = pathJoin(path_or_repo_id, filename);\n\n    const validModelId = isValidHfModelId(path_or_repo_id);\n    const localPath = validModelId\n        ? pathJoin(env.localModelPath, requestURL)\n        : requestURL;\n    const remoteURL = pathJoin(\n        env.remoteHost,\n        env.remotePathTemplate\n            .replaceAll('{model}', path_or_repo_id)\n            .replaceAll('{revision}', encodeURIComponent(revision)),\n        filename\n    );\n\n    /** @type {string} */\n    let cacheKey;\n    const proposedCacheKey = cache instanceof FileCache\n        // Choose cache key for filesystem cache\n        // When using the main revision (default), we use the request URL as the cache key.\n        // If a specific revision is requested, we account for this in the cache key.\n        ? revision === 'main' ? requestURL : pathJoin(path_or_repo_id, revision, filename)\n        : remoteURL;\n\n    // Whether to cache the final response in the end.\n    let toCacheResponse = false;\n\n    /** @type {Response|FileResponse|undefined} */\n    let response;\n\n    if (cache) {\n        // A caching system is available, so we try to get the file from it.\n        //  1. We first try to get from cache using the local path. In some environments (like deno),\n        //     non-URL cache keys are not allowed. In these cases, `response` will be undefined.\n        //  2. If no response is found, we try to get from cache using the remote URL or file system cache.\n        response = await tryCache(cache, localPath, proposedCacheKey);\n    }\n\n    const cacheHit = response !== undefined;\n    if (response === undefined) {\n        // Caching not available, or file is not cached, so we perform the request\n\n        if (env.allowLocalModels) {\n            // Accessing local models is enabled, so we try to get the file locally.\n            // If request is a valid HTTP URL, we skip the local file check. Otherwise, we try to get the file locally.\n            const isURL = isValidUrl(requestURL, ['http:', 'https:']);\n            if (!isURL) {\n                try {\n                    response = await getFile(localPath);\n                    cacheKey = localPath; // Update the cache key to be the local path\n                } catch (e) {\n                    // Something went wrong while trying to get the file locally.\n                    // NOTE: error handling is done in the next step (since `response` will be undefined)\n                    console.warn(`Unable to load from local path \"${localPath}\": \"${e}\"`);\n                }\n            } else if (options.local_files_only) {\n                throw new Error(`\\`local_files_only=true\\`, but attempted to load a remote file from: ${requestURL}.`);\n            } else if (!env.allowRemoteModels) {\n                throw new Error(`\\`env.allowRemoteModels=false\\`, but attempted to load a remote file from: ${requestURL}.`);\n            }\n        }\n\n        if (response === undefined || response.status === 404) {\n            // File not found locally. This means either:\n            // - The user has disabled local file access (`env.allowLocalModels=false`)\n            // - the path is a valid HTTP url (`response === undefined`)\n            // - the path is not a valid HTTP url and the file is not present on the file system or local server (`response.status === 404`)\n\n            if (options.local_files_only || !env.allowRemoteModels) {\n                // User requested local files only, but the file is not found locally.\n                if (fatal) {\n                    throw Error(`\\`local_files_only=true\\` or \\`env.allowRemoteModels=false\\` and file was not found locally at \"${localPath}\".`);\n                } else {\n                    // File not found, but this file is optional.\n                    // TODO in future, cache the response?\n                    return null;\n                }\n            }\n            if (!validModelId) {\n                // Before making any requests to the remote server, we check if the model ID is valid.\n                // This prevents unnecessary network requests for invalid model IDs.\n                throw Error(`Local file missing at \"${localPath}\" and download aborted due to invalid model ID \"${path_or_repo_id}\".`);\n            }\n\n            // File not found locally, so we try to download it from the remote server\n            response = await getFile(remoteURL);\n\n            if (response.status !== 200) {\n                return handleError(response.status, remoteURL, fatal);\n            }\n\n            // Success! We use the proposed cache key from earlier\n            cacheKey = proposedCacheKey;\n        }\n\n        // Only cache the response if:\n        toCacheResponse =\n            cache                              // 1. A caching system is available\n            && typeof Response !== 'undefined' // 2. `Response` is defined (i.e., we are in a browser-like environment)\n            && response instanceof Response    // 3. result is a `Response` object (i.e., not a `FileResponse`)\n            && response.status === 200         // 4. request was successful (status code 200)\n    }\n\n    // Start downloading\n    dispatchCallback(options.progress_callback, {\n        status: 'download',\n        name: path_or_repo_id,\n        file: filename\n    })\n\n    let result;\n    if (!(apis.IS_NODE_ENV && return_path)) {\n        /** @type {Uint8Array} */\n        let buffer;\n\n        if (!options.progress_callback) {\n            // If no progress callback is specified, we can use the `.arrayBuffer()`\n            // method to read the response.\n            buffer = new Uint8Array(await response.arrayBuffer());\n\n        } else if (\n            cacheHit // The item is being read from the cache\n            &&\n            typeof navigator !== 'undefined' && /firefox/i.test(navigator.userAgent) // We are in Firefox\n        ) {\n            // Due to bug in Firefox, we cannot display progress when loading from cache.\n            // Fortunately, since this should be instantaneous, this should not impact users too much.\n            buffer = new Uint8Array(await response.arrayBuffer());\n\n            // For completeness, we still fire the final progress callback\n            dispatchCallback(options.progress_callback, {\n                status: 'progress',\n                name: path_or_repo_id,\n                file: filename,\n                progress: 100,\n                loaded: buffer.length,\n                total: buffer.length,\n            })\n        } else {\n            buffer = await readResponse(response, data => {\n                dispatchCallback(options.progress_callback, {\n                    status: 'progress',\n                    name: path_or_repo_id,\n                    file: filename,\n                    ...data,\n                })\n            })\n        }\n        result = buffer;\n    }\n\n    if (\n        // Only cache web responses\n        // i.e., do not cache FileResponses (prevents duplication)\n        toCacheResponse && cacheKey\n        &&\n        // Check again whether request is in cache. If not, we add the response to the cache\n        (await cache.match(cacheKey) === undefined)\n    ) {\n        if (!result) {\n            // We haven't yet read the response body, so we need to do so now.\n            // Ensure progress updates include consistent metadata.\n            const wrapped_progress = options.progress_callback\n                ? (data) => dispatchCallback(options.progress_callback, {\n                    status: 'progress',\n                    name: path_or_repo_id,\n                    file: filename,\n                    ...data,\n                })\n                : undefined;\n            await cache.put(cacheKey, /** @type {Response} */(response), wrapped_progress);\n        } else {\n            // NOTE: We use `new Response(buffer, ...)` instead of `response.clone()` to handle LFS files\n            await cache.put(cacheKey, new Response(result, {\n                headers: response.headers\n            }))\n                .catch(err => {\n                    // Do not crash if unable to add to cache (e.g., QuotaExceededError).\n                    // Rather, log a warning and proceed with execution.\n                    console.warn(`Unable to add response to browser cache: ${err}.`);\n                });\n        }\n    }\n    dispatchCallback(options.progress_callback, {\n        status: 'done',\n        name: path_or_repo_id,\n        file: filename\n    });\n\n    if (result) {\n        if (!apis.IS_NODE_ENV && return_path) {\n            throw new Error(\"Cannot return path in a browser environment.\")\n        }\n        return result;\n    }\n    if (response instanceof FileResponse) {\n        return response.filePath;\n    }\n\n    // Otherwise, return the cached response (most likely a `FileResponse`).\n    // NOTE: A custom cache may return a Response, or a string (file path)\n    const cachedResponse = await cache?.match(cacheKey);\n    if (cachedResponse instanceof FileResponse) {\n        return cachedResponse.filePath;\n    } else if (cachedResponse instanceof Response) {\n        return new Uint8Array(await cachedResponse.arrayBuffer());\n    } else if (typeof cachedResponse === 'string') {\n        return cachedResponse;\n    }\n\n    throw new Error(\"Unable to get model file path or buffer.\");\n}\n\n/**\n * Fetches a text file from a given path and file name.\n *\n * @param {string} modelPath The path to the directory containing the file.\n * @param {string} fileName The name of the file to fetch.\n * @param {boolean} [fatal=true] Whether to throw an error if the file is not found.\n * @param {PretrainedOptions} [options] An object containing optional parameters.\n * @returns {Promise<string|null>} The text content of the file.\n * @throws Will throw an error if the file is not found and `fatal` is true.\n */\nexport async function getModelText(modelPath, fileName, fatal = true, options = {}) {\n    const buffer = await getModelFile(modelPath, fileName, fatal, options, false);\n    if (buffer === null) {\n        return null;\n    }\n\n    const decoder = new TextDecoder('utf-8');\n    return decoder.decode(/** @type {Uint8Array} */(buffer));\n}\n\n/**\n * Fetches a JSON file from a given path and file name.\n *\n * @param {string} modelPath The path to the directory containing the file.\n * @param {string} fileName The name of the file to fetch.\n * @param {boolean} [fatal=true] Whether to throw an error if the file is not found.\n * @param {PretrainedOptions} [options] An object containing optional parameters.\n * @returns {Promise<Object>} The JSON data parsed into a JavaScript object.\n * @throws Will throw an error if the file is not found and `fatal` is true.\n */\nexport async function getModelJSON(modelPath, fileName, fatal = true, options = {}) {\n    const text = await getModelText(modelPath, fileName, fatal, options);\n    if (text === null) {\n        // Return empty object\n        return {};\n    }\n\n    return JSON.parse(text);\n}\n/**\n * Read and track progress when reading a Response object\n *\n * @param {Response|FileResponse} response The Response object to read\n * @param {(data: {progress: number, loaded: number, total: number}) => void} progress_callback The function to call with progress updates\n * @returns {Promise<Uint8Array>} A Promise that resolves with the Uint8Array buffer\n */\nasync function readResponse(response, progress_callback) {\n\n    const contentLength = response.headers.get('Content-Length');\n    if (contentLength === null) {\n        console.warn('Unable to determine content-length from response headers. Will expand buffer when needed.')\n    }\n    let total = parseInt(contentLength ?? '0');\n    let buffer = new Uint8Array(total);\n    let loaded = 0;\n\n    const reader = response.body.getReader();\n    async function read() {\n        const { done, value } = await reader.read();\n        if (done) return;\n\n        const newLoaded = loaded + value.length;\n        if (newLoaded > total) {\n            total = newLoaded;\n\n            // Adding the new data will overflow buffer.\n            // In this case, we extend the buffer\n            const newBuffer = new Uint8Array(total);\n\n            // copy contents\n            newBuffer.set(buffer);\n\n            buffer = newBuffer;\n        }\n        buffer.set(value, loaded);\n        loaded = newLoaded;\n\n        const progress = (loaded / total) * 100;\n\n        // Call your function here\n        progress_callback({ progress, loaded, total });\n\n        return read();\n    }\n\n    // Actually read\n    await read();\n\n    return buffer;\n}\n\n/**\n * Joins multiple parts of a path into a single path, while handling leading and trailing slashes.\n *\n * @param {...string} parts Multiple parts of a path.\n * @returns {string} A string representing the joined path.\n */\nfunction pathJoin(...parts) {\n    // https://stackoverflow.com/a/55142565\n    parts = parts.map((part, index) => {\n        if (index) {\n            part = part.replace(new RegExp('^/'), '');\n        }\n        if (index !== parts.length - 1) {\n            part = part.replace(new RegExp('/$'), '');\n        }\n        return part;\n    })\n    return parts.join('/');\n}\n", "/**\n * @file Module used to configure Transformers.js.\n * \n * **Example:** Disable remote models.\n * ```javascript\n * import { env } from '@huggingface/transformers';\n * env.allowRemoteModels = false;\n * ```\n * \n * **Example:** Set local model path.\n * ```javascript\n * import { env } from '@huggingface/transformers';\n * env.localModelPath = '/path/to/local/models/';\n * ```\n * \n * **Example:** Set cache directory.\n * ```javascript\n * import { env } from '@huggingface/transformers';\n * env.cacheDir = '/path/to/cache/directory/';\n * ```\n * \n * @module env\n */\n\nimport fs from 'node:fs';\nimport path from 'node:path';\nimport url from 'node:url';\n\nconst VERSION = '3.8.1';\n\n// Check if various APIs are available (depends on environment)\nconst IS_BROWSER_ENV = typeof window !== \"undefined\" && typeof window.document !== \"undefined\";\nconst IS_WEBWORKER_ENV = typeof self !== \"undefined\" && (['DedicatedWorkerGlobalScope', 'ServiceWorkerGlobalScope', 'SharedWorkerGlobalScope'].includes(self.constructor?.name));\nconst IS_WEB_CACHE_AVAILABLE = typeof self !== \"undefined\" && 'caches' in self;\nconst IS_WEBGPU_AVAILABLE = typeof navigator !== 'undefined' && 'gpu' in navigator;\nconst IS_WEBNN_AVAILABLE = typeof navigator !== 'undefined' && 'ml' in navigator;\n\nconst IS_PROCESS_AVAILABLE = typeof process !== 'undefined';\nconst IS_NODE_ENV = IS_PROCESS_AVAILABLE && process?.release?.name === 'node';\nconst IS_FS_AVAILABLE = !isEmpty(fs);\nconst IS_PATH_AVAILABLE = !isEmpty(path);\n\n// Runtime detection\nconst IS_DENO_RUNTIME = typeof globalThis.Deno !== 'undefined';\nconst IS_BUN_RUNTIME = typeof globalThis.Bun !== 'undefined';\n\n/**\n * A read-only object containing information about the APIs available in the current environment.\n */\nexport const apis = Object.freeze({\n    /** Whether we are running in a browser environment (and not a web worker) */\n    IS_BROWSER_ENV,\n\n    /** Whether we are running in a web worker environment */\n    IS_WEBWORKER_ENV,\n\n    /** Whether the Cache API is available */\n    IS_WEB_CACHE_AVAILABLE,\n\n    /** Whether the WebGPU API is available */\n    IS_WEBGPU_AVAILABLE,\n\n    /** Whether the WebNN API is available */\n    IS_WEBNN_AVAILABLE,\n\n    /** Whether the Node.js process API is available */\n    IS_PROCESS_AVAILABLE,\n\n    /** Whether we are running in a Node.js-like environment (node, deno, bun) */\n    IS_NODE_ENV,\n\n    /** Whether the filesystem API is available */\n    IS_FS_AVAILABLE,\n\n    /** Whether the path API is available */\n    IS_PATH_AVAILABLE,\n});\n\nconst RUNNING_LOCALLY = IS_FS_AVAILABLE && IS_PATH_AVAILABLE;\n\nlet dirname__ = './';\nif (RUNNING_LOCALLY) {\n    // NOTE: We wrap `import.meta` in a call to `Object` to prevent Webpack from trying to bundle it in CommonJS.\n    // Although we get the warning: \"Accessing import.meta directly is unsupported (only property access or destructuring is supported)\",\n    // it is safe to ignore since the bundled value (`{}`) isn't used for CommonJS environments (we use __dirname instead).\n    const _import_meta_url = Object(import.meta).url;\n\n    if (_import_meta_url) {\n        dirname__ = path.dirname(path.dirname(url.fileURLToPath(_import_meta_url))) // ESM\n    } else if (typeof __dirname !== 'undefined') {\n        dirname__ = path.dirname(__dirname) // CommonJS\n    }\n}\n\n// Only used for environments with access to file system\nconst DEFAULT_CACHE_DIR = RUNNING_LOCALLY\n    ? path.join(dirname__, '/.cache/')\n    : null;\n\n// Set local model path, based on available APIs\nconst DEFAULT_LOCAL_MODEL_PATH = '/models/';\nconst localModelPath = RUNNING_LOCALLY\n    ? path.join(dirname__, DEFAULT_LOCAL_MODEL_PATH)\n    : DEFAULT_LOCAL_MODEL_PATH;\n\n/**\n * Global variable given visible to users to control execution. This provides users a simple way to configure Transformers.js.\n * @typedef {Object} TransformersEnvironment\n * @property {string} version This version of Transformers.js.\n * @property {{onnx: Partial<import('onnxruntime-common').Env>}} backends Expose environment variables of different backends,\n * allowing users to set these variables if they want to.\n * @property {boolean} allowRemoteModels Whether to allow loading of remote files, defaults to `true`.\n * If set to `false`, it will have the same effect as setting `local_files_only=true` when loading pipelines, models, tokenizers, processors, etc.\n * @property {string} remoteHost Host URL to load models from. Defaults to the Hugging Face Hub.\n * @property {string} remotePathTemplate Path template to fill in and append to `remoteHost` when loading models.\n * @property {boolean} allowLocalModels Whether to allow loading of local files, defaults to `false` if running in-browser, and `true` otherwise.\n * If set to `false`, it will skip the local file check and try to load the model from the remote host.\n * @property {string} localModelPath Path to load local models from. Defaults to `/models/`.\n * @property {boolean} useFS Whether to use the file system to load files. By default, it is `true` if available.\n * @property {boolean} useBrowserCache Whether to use Cache API to cache models. By default, it is `true` if available.\n * @property {boolean} useFSCache Whether to use the file system to cache files. By default, it is `true` if available.\n * @property {string} cacheDir The directory to use for caching files with the file system. By default, it is `./.cache`.\n * @property {boolean} useCustomCache Whether to use a custom cache system (defined by `customCache`), defaults to `false`.\n * @property {Object} customCache The custom cache to use. Defaults to `null`. Note: this must be an object which\n * implements the `match` and `put` functions of the Web Cache API. For more information, see https://developer.mozilla.org/en-US/docs/Web/API/Cache.\n * If you wish, you may also return a `Promise<string>` from the `match` function if you'd like to use a file path instead of `Promise<Response>`.\n */\n\n/** @type {TransformersEnvironment} */\nexport const env = {\n    version: VERSION,\n\n    /////////////////// Backends settings ///////////////////\n    // NOTE: These will be populated later by the backends themselves.\n    backends: {\n        // onnxruntime-web/onnxruntime-node\n        onnx: {},\n    },\n\n    /////////////////// Model settings ///////////////////\n    allowRemoteModels: true,\n    remoteHost: 'https://huggingface.co/',\n    remotePathTemplate: '{model}/resolve/{revision}/',\n\n    allowLocalModels: !(IS_BROWSER_ENV || IS_WEBWORKER_ENV),\n    localModelPath: localModelPath,\n    useFS: IS_FS_AVAILABLE,\n\n    /////////////////// Cache settings ///////////////////\n    useBrowserCache: IS_WEB_CACHE_AVAILABLE && !IS_DENO_RUNTIME,\n\n    useFSCache: IS_FS_AVAILABLE,\n    cacheDir: DEFAULT_CACHE_DIR,\n\n    useCustomCache: false,\n    customCache: null,\n    //////////////////////////////////////////////////////\n}\n\n\n/**\n * @param {Object} obj\n * @private\n */\nfunction isEmpty(obj) {\n    return Object.keys(obj).length === 0;\n}\n", "\n/**\n * @file Helper module for mathematical processing. \n * \n * These functions and classes are only used internally, \n * meaning an end-user shouldn't need to access anything here.\n * \n * @module utils/maths\n */\n\n/**\n * @typedef {Int8Array | Uint8Array | Uint8ClampedArray | Int16Array | Uint16Array | Int32Array | Uint32Array | Float16Array | Float32Array | Float64Array} TypedArray\n * @typedef {BigInt64Array | BigUint64Array} BigTypedArray\n * @typedef {TypedArray | BigTypedArray} AnyTypedArray\n */\n\n/**\n * @param {TypedArray} input\n */\nexport function interpolate_data(input, [in_channels, in_height, in_width], [out_height, out_width], mode = 'bilinear', align_corners = false) {\n    // TODO use mode and align_corners\n\n    // Output image dimensions\n    const x_scale = out_width / in_width;\n    const y_scale = out_height / in_height;\n\n    // Output image\n    // @ts-ignore\n    const out_img = new input.constructor(out_height * out_width * in_channels);\n\n    // Pre-calculate strides\n    const inStride = in_height * in_width;\n    const outStride = out_height * out_width;\n\n    for (let i = 0; i < out_height; ++i) {\n        for (let j = 0; j < out_width; ++j) {\n            // Calculate output offset\n            const outOffset = i * out_width + j;\n\n            // Calculate input pixel coordinates\n            const x = (j + 0.5) / x_scale - 0.5;\n            const y = (i + 0.5) / y_scale - 0.5;\n\n            // Calculate the four nearest input pixels\n            // We also check if the input pixel coordinates are within the image bounds\n            let x1 = Math.floor(x);\n            let y1 = Math.floor(y);\n            const x2 = Math.min(x1 + 1, in_width - 1);\n            const y2 = Math.min(y1 + 1, in_height - 1);\n\n            x1 = Math.max(x1, 0);\n            y1 = Math.max(y1, 0);\n\n\n            // Calculate the fractional distances between the input pixel and the four nearest pixels\n            const s = x - x1;\n            const t = y - y1;\n\n            // Perform bilinear interpolation\n            const w1 = (1 - s) * (1 - t);\n            const w2 = s * (1 - t);\n            const w3 = (1 - s) * t;\n            const w4 = s * t;\n\n            // Calculate the four nearest input pixel indices\n            const yStride = y1 * in_width;\n            const xStride = y2 * in_width;\n            const idx1 = yStride + x1;\n            const idx2 = yStride + x2;\n            const idx3 = xStride + x1;\n            const idx4 = xStride + x2;\n\n            for (let k = 0; k < in_channels; ++k) {\n                // Calculate channel offset\n                const cOffset = k * inStride;\n\n                out_img[k * outStride + outOffset] =\n                    w1 * input[cOffset + idx1] +\n                    w2 * input[cOffset + idx2] +\n                    w3 * input[cOffset + idx3] +\n                    w4 * input[cOffset + idx4];\n            }\n        }\n    }\n\n    return out_img;\n}\n\n\n/**\n * Helper method to permute a `AnyTypedArray` directly\n * @template {AnyTypedArray} T \n * @param {T} array \n * @param {number[]} dims \n * @param {number[]} axes \n * @returns {[T, number[]]} The permuted array and the new shape.\n */\nexport function permute_data(array, dims, axes) {\n    // Calculate the new shape of the permuted array\n    // and the stride of the original array\n    const shape = new Array(axes.length);\n    const stride = new Array(axes.length);\n\n    for (let i = axes.length - 1, s = 1; i >= 0; --i) {\n        stride[i] = s;\n        shape[i] = dims[axes[i]];\n        s *= shape[i];\n    }\n\n    // Precompute inverse mapping of stride\n    const invStride = axes.map((_, i) => stride[axes.indexOf(i)]);\n\n    // Create the permuted array with the new shape\n    // @ts-ignore\n    const permutedData = new array.constructor(array.length);\n\n    // Permute the original array to the new array\n    for (let i = 0; i < array.length; ++i) {\n        let newIndex = 0;\n        for (let j = dims.length - 1, k = i; j >= 0; --j) {\n            newIndex += (k % dims[j]) * invStride[j];\n            k = Math.floor(k / dims[j]);\n        }\n        permutedData[newIndex] = array[i];\n    }\n\n    return [permutedData, shape];\n}\n\n\n/**\n * Compute the softmax of an array of numbers.\n * @template {TypedArray|number[]} T\n * @param {T} arr The array of numbers to compute the softmax of.\n * @returns {T} The softmax array.\n */\nexport function softmax(arr) {\n    // Compute the maximum value in the array\n    const maxVal = max(arr)[0];\n\n    // Compute the exponentials of the array values\n    const exps = arr.map(x => Math.exp(x - maxVal));\n\n    // Compute the sum of the exponentials\n    // @ts-ignore\n    const sumExps = exps.reduce((acc, val) => acc + val, 0);\n\n    // Compute the softmax values\n    const softmaxArr = exps.map(x => x / sumExps);\n\n    return /** @type {T} */(softmaxArr);\n}\n\n/**\n * Calculates the logarithm of the softmax function for the input array.\n * @template {TypedArray|number[]} T\n * @param {T} arr The input array to calculate the log_softmax function for.\n * @returns {T} The resulting log_softmax array.\n */\nexport function log_softmax(arr) {\n    // Compute the maximum value in the array\n    const maxVal = max(arr)[0];\n\n    // Compute the sum of the exponentials\n    let sumExps = 0;\n    for(let i = 0; i < arr.length; ++i) {\n        sumExps += Math.exp(arr[i] - maxVal);\n    }\n\n    // Compute the log of the sum\n    const logSum = Math.log(sumExps);\n\n    // Compute the softmax values\n    const logSoftmaxArr = arr.map(x => x - maxVal - logSum);\n\n    return /** @type {T} */(logSoftmaxArr);\n}\n\n/**\n * Calculates the dot product of two arrays.\n * @param {number[]} arr1 The first array.\n * @param {number[]} arr2 The second array.\n * @returns {number} The dot product of arr1 and arr2.\n */\nexport function dot(arr1, arr2) {\n    let result = 0;\n    for (let i = 0; i < arr1.length; ++i) {\n        result += arr1[i] * arr2[i];\n    }\n    return result;\n}\n\n/**\n * Computes the cosine similarity between two arrays.\n *\n * @param {number[]} arr1 The first array.\n * @param {number[]} arr2 The second array.\n * @returns {number} The cosine similarity between the two arrays.\n */\nexport function cos_sim(arr1, arr2) {\n    // Calculate dot product of the two arrays\n    const dotProduct = dot(arr1, arr2);\n\n    // Calculate the magnitude of the first array\n    const magnitudeA = magnitude(arr1);\n\n    // Calculate the magnitude of the second array\n    const magnitudeB = magnitude(arr2);\n\n    // Calculate the cosine similarity\n    const cosineSimilarity = dotProduct / (magnitudeA * magnitudeB);\n\n    return cosineSimilarity;\n}\n\n/**\n * Calculates the magnitude of a given array.\n * @param {number[]} arr The array to calculate the magnitude of.\n * @returns {number} The magnitude of the array.\n */\nexport function magnitude(arr) {\n    return Math.sqrt(arr.reduce((acc, val) => acc + val * val, 0));\n}\n\n\n/**\n * Returns the value and index of the minimum element in an array.\n * @template {number[]|bigint[]|AnyTypedArray} T\n * @param {T} arr array of numbers.\n * @returns {T extends bigint[]|BigTypedArray ? [bigint, number] : [number, number]} the value and index of the minimum element, of the form: [valueOfMin, indexOfMin]\n * @throws {Error} If array is empty.\n */\nexport function min(arr) {\n    if (arr.length === 0) throw Error('Array must not be empty');\n    let min = arr[0];\n    let indexOfMin = 0;\n    for (let i = 1; i < arr.length; ++i) {\n        if (arr[i] < min) {\n            min = arr[i];\n            indexOfMin = i;\n        }\n    }\n    return /** @type {T extends bigint[]|BigTypedArray ? [bigint, number] : [number, number]} */([min, indexOfMin]);\n}\n\n\n/**\n * Returns the value and index of the maximum element in an array.\n * @template {number[]|bigint[]|AnyTypedArray} T\n * @param {T} arr array of numbers.\n * @returns {T extends bigint[]|BigTypedArray ? [bigint, number] : [number, number]} the value and index of the maximum element, of the form: [valueOfMax, indexOfMax]\n * @throws {Error} If array is empty.\n */\nexport function max(arr) {\n    if (arr.length === 0) throw Error('Array must not be empty');\n    let max = arr[0];\n    let indexOfMax = 0;\n    for (let i = 1; i < arr.length; ++i) {\n        if (arr[i] > max) {\n            max = arr[i];\n            indexOfMax = i;\n        }\n    }\n    return /** @type {T extends bigint[]|BigTypedArray ? [bigint, number] : [number, number]} */([max, indexOfMax]);\n}\n\nfunction isPowerOfTwo(number) {\n    // Check if the number is greater than 0 and has only one bit set to 1\n    return (number > 0) && ((number & (number - 1)) === 0);\n}\n\n/**\n * Implementation of Radix-4 FFT.\n * \n * P2FFT class provides functionality for performing Fast Fourier Transform on arrays\n * which are a power of two in length.\n * Code adapted from https://www.npmjs.com/package/fft.js\n */\nclass P2FFT {\n    /**\n     * @param {number} size The size of the input array. Must be a power of two larger than 1.\n     * @throws {Error} FFT size must be a power of two larger than 1.\n     */\n    constructor(size) {\n        this.size = size | 0; // convert to a 32-bit signed integer\n        if (this.size <= 1 || !isPowerOfTwo(this.size))\n            throw new Error('FFT size must be a power of two larger than 1');\n\n        this._csize = size << 1;\n\n        this.table = new Float64Array(this.size * 2);\n        for (let i = 0; i < this.table.length; i += 2) {\n            const angle = Math.PI * i / this.size;\n            this.table[i] = Math.cos(angle);\n            this.table[i + 1] = -Math.sin(angle);\n        }\n\n        // Find size's power of two\n        let power = 0;\n        for (let t = 1; this.size > t; t <<= 1)\n            ++power;\n\n        // Calculate initial step's width:\n        //   * If we are full radix-4, it is 2x smaller to give inital len=8\n        //   * Otherwise it is the same as `power` to give len=4\n        this._width = power % 2 === 0 ? power - 1 : power;\n\n        // Pre-compute bit-reversal patterns\n        this._bitrev = new Int32Array(1 << this._width);\n        for (let j = 0; j < this._bitrev.length; ++j) {\n            this._bitrev[j] = 0;\n            for (let shift = 0; shift < this._width; shift += 2) {\n                const revShift = this._width - shift - 2;\n                this._bitrev[j] |= ((j >>> shift) & 3) << revShift;\n            }\n        }\n    }\n\n    /**\n     * Create a complex number array with size `2 * size`\n     *\n     * @returns {Float64Array} A complex number array with size `2 * size`\n     */\n    createComplexArray() {\n        return new Float64Array(this._csize);\n    }\n\n    /**\n     * Converts a complex number representation stored in a Float64Array to an array of real numbers.\n     * \n     * @param {Float64Array} complex The complex number representation to be converted.\n     * @param {number[]} [storage] An optional array to store the result in.\n     * @returns {number[]} An array of real numbers representing the input complex number representation.\n     */\n    fromComplexArray(complex, storage) {\n        const res = storage || new Array(complex.length >>> 1);\n        for (let i = 0; i < complex.length; i += 2)\n            res[i >>> 1] = complex[i];\n        return res;\n    }\n\n    /**\n     * Convert a real-valued input array to a complex-valued output array.\n     * @param {Float64Array} input The real-valued input array.\n     * @param {Float64Array} [storage] Optional buffer to store the output array.\n     * @returns {Float64Array} The complex-valued output array.\n     */\n    toComplexArray(input, storage) {\n        const res = storage || this.createComplexArray();\n        for (let i = 0; i < res.length; i += 2) {\n            res[i] = input[i >>> 1];\n            res[i + 1] = 0;\n        }\n        return res;\n    }\n\n    /**\n     * Performs a Fast Fourier Transform (FFT) on the given input data and stores the result in the output buffer.\n     * \n     * @param {Float64Array} out The output buffer to store the result.\n     * @param {Float64Array} data The input data to transform.\n     * \n     * @throws {Error} Input and output buffers must be different.\n     * \n     * @returns {void}\n     */\n    transform(out, data) {\n        if (out === data)\n            throw new Error('Input and output buffers must be different');\n\n        this._transform4(out, data, 1 /* DONE */);\n    }\n\n    /**\n     * Performs a real-valued forward FFT on the given input buffer and stores the result in the given output buffer.\n     * The input buffer must contain real values only, while the output buffer will contain complex values. The input and\n     * output buffers must be different.\n     *\n     * @param {Float64Array} out The output buffer.\n     * @param {Float64Array} data The input buffer containing real values.\n     *\n     * @throws {Error} If the input and output buffers are the same.\n     */\n    realTransform(out, data) {\n        if (out === data)\n            throw new Error('Input and output buffers must be different');\n\n        this._realTransform4(out, data, 1 /* DONE */);\n    }\n\n    /**\n     * Performs an inverse FFT transformation on the given `data` array, and stores the result in `out`.\n     * The `out` array must be a different buffer than the `data` array. The `out` array will contain the\n     * result of the transformation. The `data` array will not be modified.\n     * \n     * @param {Float64Array} out The output buffer for the transformed data.\n     * @param {Float64Array} data The input data to transform.\n     * @throws {Error} If `out` and `data` refer to the same buffer.\n     * @returns {void}\n     */\n    inverseTransform(out, data) {\n        if (out === data)\n            throw new Error('Input and output buffers must be different');\n\n        this._transform4(out, data, -1 /* DONE */);\n        for (let i = 0; i < out.length; ++i)\n            out[i] /= this.size;\n    }\n\n    /**\n     * Performs a radix-4 implementation of a discrete Fourier transform on a given set of data.\n     *\n     * @param {Float64Array} out The output buffer for the transformed data.\n     * @param {Float64Array} data The input buffer of data to be transformed.\n     * @param {number} inv A scaling factor to apply to the transform.\n     * @returns {void}\n     */\n    _transform4(out, data, inv) {\n        // radix-4 implementation\n\n        const size = this._csize;\n\n        // Initial step (permute and transform)\n        const width = this._width;\n        let step = 1 << width;\n        let len = (size / step) << 1;\n\n        let outOff;\n        let t;\n        const bitrev = this._bitrev;\n        if (len === 4) {\n            for (outOff = 0, t = 0; outOff < size; outOff += len, ++t) {\n                const off = bitrev[t];\n                this._singleTransform2(data, out, outOff, off, step);\n            }\n        } else {\n            // len === 8\n            for (outOff = 0, t = 0; outOff < size; outOff += len, ++t) {\n                const off = bitrev[t];\n                this._singleTransform4(data, out, outOff, off, step, inv);\n            }\n        }\n\n        // Loop through steps in decreasing order\n        const table = this.table;\n        for (step >>= 2; step >= 2; step >>= 2) {\n            len = (size / step) << 1;\n            const quarterLen = len >>> 2;\n\n            // Loop through offsets in the data\n            for (outOff = 0; outOff < size; outOff += len) {\n                // Full case\n                const limit = outOff + quarterLen - 1;\n                for (let i = outOff, k = 0; i < limit; i += 2, k += step) {\n                    const A = i;\n                    const B = A + quarterLen;\n                    const C = B + quarterLen;\n                    const D = C + quarterLen;\n\n                    // Original values\n                    const Ar = out[A];\n                    const Ai = out[A + 1];\n                    const Br = out[B];\n                    const Bi = out[B + 1];\n                    const Cr = out[C];\n                    const Ci = out[C + 1];\n                    const Dr = out[D];\n                    const Di = out[D + 1];\n\n                    const tableBr = table[k];\n                    const tableBi = inv * table[k + 1];\n                    const MBr = Br * tableBr - Bi * tableBi;\n                    const MBi = Br * tableBi + Bi * tableBr;\n\n                    const tableCr = table[2 * k];\n                    const tableCi = inv * table[2 * k + 1];\n                    const MCr = Cr * tableCr - Ci * tableCi;\n                    const MCi = Cr * tableCi + Ci * tableCr;\n\n                    const tableDr = table[3 * k];\n                    const tableDi = inv * table[3 * k + 1];\n                    const MDr = Dr * tableDr - Di * tableDi;\n                    const MDi = Dr * tableDi + Di * tableDr;\n\n                    // Pre-Final values\n                    const T0r = Ar + MCr;\n                    const T0i = Ai + MCi;\n                    const T1r = Ar - MCr;\n                    const T1i = Ai - MCi;\n                    const T2r = MBr + MDr;\n                    const T2i = MBi + MDi;\n                    const T3r = inv * (MBr - MDr);\n                    const T3i = inv * (MBi - MDi);\n\n                    // Final values\n                    out[A] = T0r + T2r;\n                    out[A + 1] = T0i + T2i;\n                    out[B] = T1r + T3i;\n                    out[B + 1] = T1i - T3r;\n                    out[C] = T0r - T2r;\n                    out[C + 1] = T0i - T2i;\n                    out[D] = T1r - T3i;\n                    out[D + 1] = T1i + T3r;\n                }\n            }\n        }\n    }\n\n    /**\n     * Performs a radix-2 implementation of a discrete Fourier transform on a given set of data.\n     *\n     * @param {Float64Array} data The input buffer of data to be transformed.\n     * @param {Float64Array} out The output buffer for the transformed data.\n     * @param {number} outOff The offset at which to write the output data.\n     * @param {number} off The offset at which to begin reading the input data.\n     * @param {number} step The step size for indexing the input data.\n     * @returns {void}\n     */\n    _singleTransform2(data, out, outOff, off, step) {\n        // radix-2 implementation\n        // NOTE: Only called for len=4\n\n        const evenR = data[off];\n        const evenI = data[off + 1];\n        const oddR = data[off + step];\n        const oddI = data[off + step + 1];\n\n        out[outOff] = evenR + oddR;\n        out[outOff + 1] = evenI + oddI;\n        out[outOff + 2] = evenR - oddR;\n        out[outOff + 3] = evenI - oddI;\n    }\n\n    /**\n     * Performs radix-4 transformation on input data of length 8\n     *\n     * @param {Float64Array} data Input data array of length 8\n     * @param {Float64Array} out Output data array of length 8\n     * @param {number} outOff Index of output array to start writing from\n     * @param {number} off Index of input array to start reading from\n     * @param {number} step Step size between elements in input array\n     * @param {number} inv Scaling factor for inverse transform\n     * \n     * @returns {void}\n     */\n    _singleTransform4(data, out, outOff, off, step, inv) {\n        // radix-4\n        // NOTE: Only called for len=8\n        const step2 = step * 2;\n        const step3 = step * 3;\n\n        // Original values\n        const Ar = data[off];\n        const Ai = data[off + 1];\n        const Br = data[off + step];\n        const Bi = data[off + step + 1];\n        const Cr = data[off + step2];\n        const Ci = data[off + step2 + 1];\n        const Dr = data[off + step3];\n        const Di = data[off + step3 + 1];\n\n        // Pre-Final values\n        const T0r = Ar + Cr;\n        const T0i = Ai + Ci;\n        const T1r = Ar - Cr;\n        const T1i = Ai - Ci;\n        const T2r = Br + Dr;\n        const T2i = Bi + Di;\n        const T3r = inv * (Br - Dr);\n        const T3i = inv * (Bi - Di);\n\n        // Final values\n        out[outOff] = T0r + T2r;\n        out[outOff + 1] = T0i + T2i;\n        out[outOff + 2] = T1r + T3i;\n        out[outOff + 3] = T1i - T3r;\n        out[outOff + 4] = T0r - T2r;\n        out[outOff + 5] = T0i - T2i;\n        out[outOff + 6] = T1r - T3i;\n        out[outOff + 7] = T1i + T3r;\n    }\n\n    /**\n     * Real input radix-4 implementation\n     * @param {Float64Array} out Output array for the transformed data\n     * @param {Float64Array} data Input array of real data to be transformed\n     * @param {number} inv The scale factor used to normalize the inverse transform\n     */\n    _realTransform4(out, data, inv) {\n        // Real input radix-4 implementation\n        const size = this._csize;\n\n        // Initial step (permute and transform)\n        const width = this._width;\n        let step = 1 << width;\n        let len = (size / step) << 1;\n\n        let outOff;\n        let t;\n        const bitrev = this._bitrev;\n        if (len === 4) {\n            for (outOff = 0, t = 0; outOff < size; outOff += len, ++t) {\n                const off = bitrev[t];\n                this._singleRealTransform2(data, out, outOff, off >>> 1, step >>> 1);\n            }\n        } else {\n            // len === 8\n            for (outOff = 0, t = 0; outOff < size; outOff += len, ++t) {\n                const off = bitrev[t];\n                this._singleRealTransform4(data, out, outOff, off >>> 1, step >>> 1, inv);\n            }\n        }\n\n        // Loop through steps in decreasing order\n        const table = this.table;\n        for (step >>= 2; step >= 2; step >>= 2) {\n            len = (size / step) << 1;\n            const halfLen = len >>> 1;\n            const quarterLen = halfLen >>> 1;\n            const hquarterLen = quarterLen >>> 1;\n\n            // Loop through offsets in the data\n            for (outOff = 0; outOff < size; outOff += len) {\n                for (let i = 0, k = 0; i <= hquarterLen; i += 2, k += step) {\n                    const A = outOff + i;\n                    const B = A + quarterLen;\n                    const C = B + quarterLen;\n                    const D = C + quarterLen;\n\n                    // Original values\n                    const Ar = out[A];\n                    const Ai = out[A + 1];\n                    const Br = out[B];\n                    const Bi = out[B + 1];\n                    const Cr = out[C];\n                    const Ci = out[C + 1];\n                    const Dr = out[D];\n                    const Di = out[D + 1];\n\n                    // Middle values\n                    const MAr = Ar;\n                    const MAi = Ai;\n\n                    const tableBr = table[k];\n                    const tableBi = inv * table[k + 1];\n                    const MBr = Br * tableBr - Bi * tableBi;\n                    const MBi = Br * tableBi + Bi * tableBr;\n\n                    const tableCr = table[2 * k];\n                    const tableCi = inv * table[2 * k + 1];\n                    const MCr = Cr * tableCr - Ci * tableCi;\n                    const MCi = Cr * tableCi + Ci * tableCr;\n\n                    const tableDr = table[3 * k];\n                    const tableDi = inv * table[3 * k + 1];\n                    const MDr = Dr * tableDr - Di * tableDi;\n                    const MDi = Dr * tableDi + Di * tableDr;\n\n                    // Pre-Final values\n                    const T0r = MAr + MCr;\n                    const T0i = MAi + MCi;\n                    const T1r = MAr - MCr;\n                    const T1i = MAi - MCi;\n                    const T2r = MBr + MDr;\n                    const T2i = MBi + MDi;\n                    const T3r = inv * (MBr - MDr);\n                    const T3i = inv * (MBi - MDi);\n\n                    // Final values\n                    out[A] = T0r + T2r;\n                    out[A + 1] = T0i + T2i;\n                    out[B] = T1r + T3i;\n                    out[B + 1] = T1i - T3r;\n\n                    // Output final middle point\n                    if (i === 0) {\n                        out[C] = T0r - T2r;\n                        out[C + 1] = T0i - T2i;\n                        continue;\n                    }\n\n                    // Do not overwrite ourselves\n                    if (i === hquarterLen)\n                        continue;\n\n                    const SA = outOff + quarterLen - i;\n                    const SB = outOff + halfLen - i;\n\n                    out[SA] = T1r - inv * T3i;\n                    out[SA + 1] = -T1i - inv * T3r;\n                    out[SB] = T0r - inv * T2r;\n                    out[SB + 1] = -T0i + inv * T2i;\n                }\n            }\n        }\n\n        // Complete the spectrum by adding its mirrored negative frequency components.\n        const half = size >>> 1;\n        for (let i = 2; i < half; i += 2) {\n            out[size - i] = out[i];\n            out[size - i + 1] = -out[i + 1];\n        }\n    }\n\n    /**\n     * Performs a single real input radix-2 transformation on the provided data\n     * \n     * @param {Float64Array} data The input data array\n     * @param {Float64Array} out The output data array\n     * @param {number} outOff The output offset\n     * @param {number} off The input offset\n     * @param {number} step The step\n     * \n     * @returns {void}\n     */\n    _singleRealTransform2(data, out, outOff, off, step) {\n        // radix-2 implementation\n        // NOTE: Only called for len=4\n\n        const evenR = data[off];\n        const oddR = data[off + step];\n\n        out[outOff] = evenR + oddR;\n        out[outOff + 1] = 0;\n        out[outOff + 2] = evenR - oddR;\n        out[outOff + 3] = 0;\n    }\n\n    /**\n     * Computes a single real-valued transform using radix-4 algorithm.\n     * This method is only called for len=8.\n     *\n     * @param {Float64Array} data The input data array.\n     * @param {Float64Array} out The output data array.\n     * @param {number} outOff The offset into the output array.\n     * @param {number} off The offset into the input array.\n     * @param {number} step The step size for the input array.\n     * @param {number} inv The value of inverse.\n     */\n    _singleRealTransform4(data, out, outOff, off, step, inv) {\n        // radix-4\n        // NOTE: Only called for len=8\n        const step2 = step * 2;\n        const step3 = step * 3;\n\n        // Original values\n        const Ar = data[off];\n        const Br = data[off + step];\n        const Cr = data[off + step2];\n        const Dr = data[off + step3];\n\n        // Pre-Final values\n        const T0r = Ar + Cr;\n        const T1r = Ar - Cr;\n        const T2r = Br + Dr;\n        const T3r = inv * (Br - Dr);\n\n        // Final values\n        out[outOff] = T0r + T2r;\n        out[outOff + 1] = 0;\n        out[outOff + 2] = T1r;\n        out[outOff + 3] = -T3r;\n        out[outOff + 4] = T0r - T2r;\n        out[outOff + 5] = 0;\n        out[outOff + 6] = T1r;\n        out[outOff + 7] = T3r;\n    }\n}\n\n/**\n * NP2FFT class provides functionality for performing Fast Fourier Transform on arrays\n * which are not a power of two in length. In such cases, the chirp-z transform is used.\n * \n * For more information, see: https://math.stackexchange.com/questions/77118/non-power-of-2-ffts/77156#77156\n */\nclass NP2FFT {\n\n    /**\n     * Constructs a new NP2FFT object.\n     * @param {number} fft_length The length of the FFT\n     */\n    constructor(fft_length) {\n        // Helper variables\n        const a = 2 * (fft_length - 1);\n        const b = 2 * (2 * fft_length - 1);\n        const nextP2 = 2 ** (Math.ceil(Math.log2(b)))\n        this.bufferSize = nextP2;\n        this._a = a;\n\n        // Define buffers\n        // Compute chirp for transform\n        const chirp = new Float64Array(b);\n        const ichirp = new Float64Array(nextP2);\n        this._chirpBuffer = new Float64Array(nextP2);\n        this._buffer1 = new Float64Array(nextP2);\n        this._buffer2 = new Float64Array(nextP2);\n        this._outBuffer1 = new Float64Array(nextP2);\n        this._outBuffer2 = new Float64Array(nextP2);\n\n        // Compute complex exponentiation\n        const theta = -2 * Math.PI / fft_length;\n        const baseR = Math.cos(theta);\n        const baseI = Math.sin(theta);\n\n        // Precompute helper for chirp-z transform\n        for (let i = 0; i < b >> 1; ++i) {\n            // Compute complex power:\n            const e = (i + 1 - fft_length) ** 2 / 2.0;\n\n            // Compute the modulus and argument of the result\n            const result_mod = Math.sqrt(baseR ** 2 + baseI ** 2) ** e;\n            const result_arg = e * Math.atan2(baseI, baseR);\n\n            // Convert the result back to rectangular form\n            // and assign to chirp and ichirp\n            const i2 = 2 * i;\n            chirp[i2] = result_mod * Math.cos(result_arg);\n            chirp[i2 + 1] = result_mod * Math.sin(result_arg);\n\n            // conjugate\n            ichirp[i2] = chirp[i2];\n            ichirp[i2 + 1] = - chirp[i2 + 1];\n        }\n        this._slicedChirpBuffer = chirp.subarray(a, b);\n\n        // create object to perform Fast Fourier Transforms\n        // with `nextP2` complex numbers\n        this._f = new P2FFT(nextP2 >> 1);\n        this._f.transform(this._chirpBuffer, ichirp);\n    }\n\n    _transform(output, input, real) {\n        const ib1 = this._buffer1;\n        const ib2 = this._buffer2;\n        const ob2 = this._outBuffer1;\n        const ob3 = this._outBuffer2;\n        const cb = this._chirpBuffer;\n        const sb = this._slicedChirpBuffer;\n        const a = this._a;\n\n        if (real) {\n            // Real multiplication\n            for (let j = 0; j < sb.length; j += 2) {\n                const j2 = j + 1\n                const j3 = j >> 1;\n\n                const a_real = input[j3];\n                ib1[j] = a_real * sb[j];\n                ib1[j2] = a_real * sb[j2];\n            }\n        } else {\n            // Complex multiplication\n            for (let j = 0; j < sb.length; j += 2) {\n                const j2 = j + 1\n                ib1[j] = input[j] * sb[j] - input[j2] * sb[j2];\n                ib1[j2] = input[j] * sb[j2] + input[j2] * sb[j];\n            }\n        }\n        this._f.transform(ob2, ib1);\n\n        for (let j = 0; j < cb.length; j += 2) {\n            const j2 = j + 1;\n\n            ib2[j] = ob2[j] * cb[j] - ob2[j2] * cb[j2];\n            ib2[j2] = ob2[j] * cb[j2] + ob2[j2] * cb[j];\n        }\n        this._f.inverseTransform(ob3, ib2);\n\n        for (let j = 0; j < ob3.length; j += 2) {\n            const a_real = ob3[j + a];\n            const a_imag = ob3[j + a + 1];\n            const b_real = sb[j];\n            const b_imag = sb[j + 1];\n\n            output[j] = a_real * b_real - a_imag * b_imag;\n            output[j + 1] = a_real * b_imag + a_imag * b_real;\n        }\n    }\n\n    transform(output, input) {\n        this._transform(output, input, false);\n    }\n\n    realTransform(output, input) {\n        this._transform(output, input, true);\n    }\n}\n\nexport class FFT {\n    constructor(fft_length) {\n        this.fft_length = fft_length;\n        this.isPowerOfTwo = isPowerOfTwo(fft_length);\n        if (this.isPowerOfTwo) {\n            this.fft = new P2FFT(fft_length);\n            this.outputBufferSize = 2 * fft_length;\n        } else {\n            this.fft = new NP2FFT(fft_length);\n            this.outputBufferSize = this.fft.bufferSize;\n        }\n    }\n\n    realTransform(out, input) {\n        this.fft.realTransform(out, input);\n    }\n\n    transform(out, input) {\n        this.fft.transform(out, input);\n    }\n}\n\n\n/**\n * Performs median filter on the provided data. Padding is done by mirroring the data.\n * @param {AnyTypedArray} data The input array\n * @param {number} windowSize The window size\n */\nexport function medianFilter(data, windowSize) {\n\n    if (windowSize % 2 === 0 || windowSize <= 0) {\n        throw new Error('Window size must be a positive odd number');\n    }\n\n    // @ts-ignore\n    const outputArray = new data.constructor(data.length);\n\n    // @ts-ignore\n    const buffer = new data.constructor(windowSize); // Reusable array for storing values\n\n    const halfWindowSize = Math.floor(windowSize / 2);\n\n    for (let i = 0; i < data.length; ++i) {\n        let valuesIndex = 0;\n\n        for (let j = -halfWindowSize; j <= halfWindowSize; ++j) {\n            let index = i + j;\n            if (index < 0) {\n                index = Math.abs(index);\n            } else if (index >= data.length) {\n                index = 2 * (data.length - 1) - index;\n            }\n\n            buffer[valuesIndex++] = data[index];\n        }\n\n        buffer.sort();\n        outputArray[i] = buffer[halfWindowSize];\n    }\n\n    return outputArray;\n}\n\n/**\n * Helper function to round a number to a given number of decimals\n * @param {number} num The number to round\n * @param {number} decimals The number of decimals\n * @returns {number} The rounded number\n */\nexport function round(num, decimals) {\n    const pow = Math.pow(10, decimals);\n    return Math.round(num * pow) / pow;\n}\n\n/**\n * Helper function to round a number to the nearest integer, with ties rounded to the nearest even number.\n * Also known as \"bankers' rounding\". This is the default rounding mode in python. For example:\n * 1.5 rounds to 2 and 2.5 rounds to 2.\n * \n * @param {number} x The number to round\n * @returns {number} The rounded number\n */\nexport function bankers_round(x) {\n    const r = Math.round(x);\n    const br = Math.abs(x) % 1 === 0.5 ? (r % 2 === 0 ? r : r - 1) : r;\n    return br;\n}\n\n\n/**\n * Measures similarity between two temporal sequences (e.g., input audio and output tokens\n * to generate token-level timestamps).\n * @param {number[][]} matrix \n * @returns {number[][]}\n */\nexport function dynamic_time_warping(matrix) {\n    const output_length = matrix.length;\n    const input_length = matrix[0].length;\n\n    const outputShape = [output_length + 1, input_length + 1];\n\n    const cost = Array.from(\n        { length: outputShape[0] },\n        () => Array(outputShape[1]).fill(Infinity)\n    );\n    cost[0][0] = 0;\n\n    const trace = Array.from(\n        { length: outputShape[0] },\n        () => Array(outputShape[1]).fill(-1)\n    );\n\n    for (let j = 1; j < outputShape[1]; ++j) {\n        for (let i = 1; i < outputShape[0]; ++i) {\n            const c0 = cost[i - 1][j - 1];\n            const c1 = cost[i - 1][j];\n            const c2 = cost[i][j - 1];\n\n            let c, t;\n            if (c0 < c1 && c0 < c2) {\n                c = c0;\n                t = 0;\n            } else if (c1 < c0 && c1 < c2) {\n                c = c1;\n                t = 1;\n            } else {\n                c = c2;\n                t = 2;\n            }\n            cost[i][j] = matrix[i - 1][j - 1] + c;\n            trace[i][j] = t;\n        }\n    }\n\n    for (let i = 0; i < outputShape[1]; ++i) { // trace[0, :] = 2\n        trace[0][i] = 2;\n    }\n    for (let i = 0; i < outputShape[0]; ++i) { // trace[:, 0] = 1\n        trace[i][0] = 1;\n    }\n\n    // backtrace\n    let i = output_length;\n    let j = input_length;\n    let text_indices = [];\n    let time_indices = [];\n    while (i > 0 || j > 0) {\n        text_indices.push(i - 1);\n        time_indices.push(j - 1);\n\n        switch (trace[i][j]) {\n            case 0:\n                --i; --j;\n                break;\n            case 1:\n                --i;\n                break;\n            case 2:\n                --j;\n                break;\n            default:\n                throw new Error(\n                    `Internal error in dynamic time warping. Unexpected trace[${i}, ${j}]. Please file a bug report.`\n                )\n        }\n    }\n\n    text_indices.reverse();\n    time_indices.reverse();\n\n    return [text_indices, time_indices];\n\n}\n", "export default new Proxy({}, {\n  // Return a dummy function for everything to satisfy instanceof checks\n  get: () => () => {}\n});\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\n/**\n * # ONNX Runtime JavaScript API\n *\n * ONNX Runtime JavaScript API is a unified API for all JavaScript usages, including the following NPM packages:\n *\n * - [onnxruntime-node](https://www.npmjs.com/package/onnxruntime-node)\n * - [onnxruntime-web](https://www.npmjs.com/package/onnxruntime-web)\n * - [onnxruntime-react-native](https://www.npmjs.com/package/onnxruntime-react-native)\n *\n * See also:\n * - [Get Started](https://onnxruntime.ai/docs/get-started/with-javascript/)\n * - [Inference examples](https://github.com/microsoft/onnxruntime-inference-examples/tree/main/js)\n *\n * @packageDocumentation\n */\n\nexport * from './backend.js';\nexport * from './env.js';\nexport * from './inference-session.js';\nexport * from './tensor.js';\nexport * from './tensor-conversion.js';\nexport * from './tensor-factory.js';\nexport * from './trace.js';\nexport * from './onnx-model.js';\nexport * from './onnx-value.js';\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { Backend } from './backend.js';\nimport { InferenceSession } from './inference-session.js';\n\ninterface BackendInfo {\n  backend: Backend;\n  priority: number;\n\n  initPromise?: Promise<void>;\n  initialized?: boolean;\n  aborted?: boolean;\n  error?: string;\n}\n\nconst backends: Map<string, BackendInfo> = new Map();\nconst backendsSortedByPriority: string[] = [];\n\n/**\n * Register a backend.\n *\n * @param name - the name as a key to lookup as an execution provider.\n * @param backend - the backend object.\n * @param priority - an integer indicating the priority of the backend. Higher number means higher priority. if priority\n * < 0, it will be considered as a 'beta' version and will not be used as a fallback backend by default.\n *\n * @ignore\n */\nexport const registerBackend = (name: string, backend: Backend, priority: number): void => {\n  if (backend && typeof backend.init === 'function' && typeof backend.createInferenceSessionHandler === 'function') {\n    const currentBackend = backends.get(name);\n    if (currentBackend === undefined) {\n      backends.set(name, { backend, priority });\n    } else if (currentBackend.priority > priority) {\n      // same name is already registered with a higher priority. skip registeration.\n      return;\n    } else if (currentBackend.priority === priority) {\n      if (currentBackend.backend !== backend) {\n        throw new Error(`cannot register backend \"${name}\" using priority ${priority}`);\n      }\n    }\n\n    if (priority >= 0) {\n      const i = backendsSortedByPriority.indexOf(name);\n      if (i !== -1) {\n        backendsSortedByPriority.splice(i, 1);\n      }\n\n      for (let i = 0; i < backendsSortedByPriority.length; i++) {\n        if (backends.get(backendsSortedByPriority[i])!.priority <= priority) {\n          backendsSortedByPriority.splice(i, 0, name);\n          return;\n        }\n      }\n      backendsSortedByPriority.push(name);\n    }\n    return;\n  }\n\n  throw new TypeError('not a valid backend');\n};\n\n/**\n * Try to resolve and initialize a backend.\n *\n * @param backendName - the name of the backend.\n * @returns the backend instance if resolved and initialized successfully, or an error message if failed.\n */\nconst tryResolveAndInitializeBackend = async (backendName: string): Promise<Backend | string> => {\n  const backendInfo = backends.get(backendName);\n  if (!backendInfo) {\n    return 'backend not found.';\n  }\n\n  if (backendInfo.initialized) {\n    return backendInfo.backend;\n  } else if (backendInfo.aborted) {\n    return backendInfo.error!;\n  } else {\n    const isInitializing = !!backendInfo.initPromise;\n    try {\n      if (!isInitializing) {\n        backendInfo.initPromise = backendInfo.backend.init(backendName);\n      }\n      await backendInfo.initPromise;\n      backendInfo.initialized = true;\n      return backendInfo.backend;\n    } catch (e) {\n      if (!isInitializing) {\n        backendInfo.error = `${e}`;\n        backendInfo.aborted = true;\n      }\n      return backendInfo.error!;\n    } finally {\n      delete backendInfo.initPromise;\n    }\n  }\n};\n\n/**\n * Resolve execution providers from the specific session options.\n *\n * @param options - the session options object.\n * @returns a promise that resolves to a tuple of an initialized backend instance and a session options object with\n * filtered EP list.\n *\n * @ignore\n */\nexport const resolveBackendAndExecutionProviders = async (\n  options: InferenceSession.SessionOptions,\n): Promise<[backend: Backend, options: InferenceSession.SessionOptions]> => {\n  // extract backend hints from session options\n  const eps = options.executionProviders || [];\n  const backendHints = eps.map((i) => (typeof i === 'string' ? i : i.name));\n  const backendNames = backendHints.length === 0 ? backendsSortedByPriority : backendHints;\n\n  // try to resolve and initialize all requested backends\n  let backend: Backend | undefined;\n  const errors = [];\n  const availableBackendNames = new Set<string>();\n  for (const backendName of backendNames) {\n    const resolveResult = await tryResolveAndInitializeBackend(backendName);\n    if (typeof resolveResult === 'string') {\n      errors.push({ name: backendName, err: resolveResult });\n    } else {\n      if (!backend) {\n        backend = resolveResult;\n      }\n      if (backend === resolveResult) {\n        availableBackendNames.add(backendName);\n      }\n    }\n  }\n\n  // if no backend is available, throw error.\n  if (!backend) {\n    throw new Error(`no available backend found. ERR: ${errors.map((e) => `[${e.name}] ${e.err}`).join(', ')}`);\n  }\n\n  // for each explicitly requested backend, if it's not available, output warning message.\n  for (const { name, err } of errors) {\n    if (backendHints.includes(name)) {\n      // eslint-disable-next-line no-console\n      console.warn(\n        `removing requested execution provider \"${name}\" from session options because it is not available: ${err}`,\n      );\n    }\n  }\n\n  const filteredEps = eps.filter((i) => availableBackendNames.has(typeof i === 'string' ? i : i.name));\n\n  return [\n    backend,\n    new Proxy(options, {\n      get: (target, prop) => {\n        if (prop === 'executionProviders') {\n          return filteredEps;\n        }\n        return Reflect.get(target, prop);\n      },\n    }),\n  ];\n};\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\n// This file is generated by /js/scripts/update-version.ts\n// Do not modify file content manually.\n\nexport const version = '1.22.0-dev.20250409-89f8206ba4';\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { Env } from './env.js';\nimport { version } from './version.js';\n\ntype LogLevelType = Env['logLevel'];\n\nlet logLevelValue: Required<LogLevelType> = 'warning';\n\nexport const env: Env = {\n  wasm: {} as Env.WebAssemblyFlags,\n  webgl: {} as Env.WebGLFlags,\n  webgpu: {} as Env.WebGpuFlags,\n  versions: { common: version },\n\n  set logLevel(value: LogLevelType) {\n    if (value === undefined) {\n      return;\n    }\n    if (typeof value !== 'string' || ['verbose', 'info', 'warning', 'error', 'fatal'].indexOf(value) === -1) {\n      throw new Error(`Unsupported logging level: ${value}`);\n    }\n    logLevelValue = value;\n  },\n  get logLevel(): Required<LogLevelType> {\n    return logLevelValue;\n  },\n};\n\n// set property 'logLevel' so that they can be correctly transferred to worker by `postMessage()`.\nObject.defineProperty(env, 'logLevel', { enumerable: true });\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { env as envImpl } from './env-impl.js';\nimport { TryGetGlobalType } from './type-helper.js';\n\nexport declare namespace Env {\n  export type WasmPathPrefix = string;\n  export interface WasmFilePaths {\n    /**\n     * Specify the override path for the main .wasm file.\n     *\n     * This path should be an absolute path.\n     *\n     * If not modified, the filename of the .wasm file is:\n     * - `ort-wasm-simd-threaded.wasm` for default build\n     * - `ort-wasm-simd-threaded.jsep.wasm` for JSEP build (with WebGPU and WebNN)\n     */\n    wasm?: URL | string;\n    /**\n     * Specify the override path for the main .mjs file.\n     *\n     * This path should be an absolute path.\n     *\n     * If not modified, the filename of the .mjs file is:\n     * - `ort-wasm-simd-threaded.mjs` for default build\n     * - `ort-wasm-simd-threaded.jsep.mjs` for JSEP build (with WebGPU and WebNN)\n     */\n    mjs?: URL | string;\n  }\n  export type WasmPrefixOrFilePaths = WasmPathPrefix | WasmFilePaths;\n  export interface WebAssemblyFlags {\n    /**\n     * set or get number of thread(s). If omitted or set to 0, number of thread(s) will be determined by system. If set\n     * to 1, no worker thread will be spawned.\n     *\n     * This setting is available only when WebAssembly multithread feature is available in current context.\n     *\n     * @defaultValue `0`\n     */\n    numThreads?: number;\n\n    /**\n     * set a value indicating whether to enable SIMD.\n     *\n     * ONNX Runtime will perform feature detection based on the value of this property. Specifically, when the value is\n     * set to:\n     * - `undefined`, `true` or `\"fixed\"`: will check availability of Fixed-width SIMD.\n     * - `\"relaxed\"`: will check availability of Relaxed SIMD.\n     * - `false`: will not perform SIMD feature checking.\n     *\n     * Setting this property does not make ONNX Runtime to switch to the corresponding runtime automatically. User need\n     * to set `wasmPaths` or `wasmBinary` property to load the corresponding runtime.\n     *\n     * This setting is available only when WebAssembly SIMD feature is available in current context.\n     *\n     * @defaultValue `true`\n     */\n    simd?: boolean | 'fixed' | 'relaxed';\n\n    /**\n     * set or get a boolean value indicating whether to enable trace.\n     *\n     * @defaultValue `false`\n     *\n     * @deprecated Use `env.trace` instead. If `env.trace` is set, this property will be ignored.\n     */\n    trace?: boolean;\n\n    /**\n     * Set or get a number specifying the timeout for initialization of WebAssembly backend, in milliseconds. A zero\n     * value indicates no timeout is set.\n     *\n     * @defaultValue `0`\n     */\n    initTimeout?: number;\n\n    /**\n     * Set a custom URL prefix to the .wasm/.mjs files, or an object of overrides for both .wasm/.mjs file. The override\n     * path should be an absolute path.\n     */\n    wasmPaths?: WasmPrefixOrFilePaths;\n\n    /**\n     * Set a custom buffer which contains the WebAssembly binary. If this property is set, the `wasmPaths` property will\n     * be ignored.\n     */\n    wasmBinary?: ArrayBufferLike | Uint8Array;\n\n    /**\n     * Set or get a boolean value indicating whether to proxy the execution of main thread to a worker thread.\n     *\n     * @defaultValue `false`\n     */\n    proxy?: boolean;\n  }\n\n  export interface WebGLFlags {\n    /**\n     * Set or get the WebGL Context ID (webgl or webgl2).\n     *\n     * @defaultValue `'webgl2'`\n     */\n    contextId?: 'webgl' | 'webgl2';\n    /**\n     * Get the WebGL rendering context.\n     */\n    readonly context: WebGLRenderingContext;\n    /**\n     * Set or get the maximum batch size for matmul. 0 means to disable batching.\n     *\n     * @deprecated\n     */\n    matmulMaxBatchSize?: number;\n    /**\n     * Set or get the texture cache mode.\n     *\n     * @defaultValue `'full'`\n     */\n    textureCacheMode?: 'initializerOnly' | 'full';\n    /**\n     * Set or get the packed texture mode\n     *\n     * @defaultValue `false`\n     */\n    pack?: boolean;\n    /**\n     * Set or get whether enable async download.\n     *\n     * @defaultValue `false`\n     */\n    async?: boolean;\n  }\n\n  export interface WebGpuProfilingDataV1TensorMetadata {\n    dims: readonly number[];\n    dataType: string;\n  }\n  export interface WebGpuProfilingDataV1 {\n    version: 1;\n    inputsMetadata: readonly WebGpuProfilingDataV1TensorMetadata[];\n    outputsMetadata: readonly WebGpuProfilingDataV1TensorMetadata[];\n    kernelId: number;\n    kernelType: string;\n    kernelName: string;\n    programName: string;\n    startTime: number;\n    endTime: number;\n  }\n\n  export type WebGpuProfilingData = WebGpuProfilingDataV1;\n\n  export interface WebGpuFlags {\n    /**\n     * Set or get the profiling mode.\n     *\n     * @deprecated Use `env.webgpu.profiling.mode` instead. If `env.webgpu.profiling.mode` is set, this property will be\n     * ignored.\n     */\n    profilingMode?: 'off' | 'default';\n    /**\n     * Set or get the profiling configuration.\n     */\n    profiling: {\n      /**\n       * Set or get the profiling mode.\n       *\n       * @defaultValue `'off'`\n       */\n      mode?: 'off' | 'default';\n\n      /**\n       * Set or get a callback function when a profiling data is received. If not set, the profiling data will be\n       * printed to console.\n       */\n      ondata?: (data: WebGpuProfilingData) => void;\n    };\n    /**\n     * Set or get the power preference.\n     *\n     * Setting this property only has effect before the first WebGPU inference session is created. The value will be\n     * used as options for `navigator.gpu.requestAdapter()`.\n     *\n     * See {@link https://gpuweb.github.io/gpuweb/#dictdef-gpurequestadapteroptions} for more details.\n     *\n     * @defaultValue `undefined`\n     *\n     * @deprecated Create your own GPUAdapter, use it to create a GPUDevice instance and set {@link device} property if\n     * you want to use a specific power preference.\n     */\n    powerPreference?: 'low-power' | 'high-performance';\n    /**\n     * Set or get the force fallback adapter flag.\n     *\n     * Setting this property only has effect before the first WebGPU inference session is created. The value will be\n     * used as options for `navigator.gpu.requestAdapter()`.\n     *\n     * See {@link https://gpuweb.github.io/gpuweb/#dictdef-gpurequestadapteroptions} for more details.\n     *\n     * @defaultValue `undefined`\n     *\n     * @deprecated Create your own GPUAdapter, use it to create a GPUDevice instance and set {@link device} property if\n     * you want to use a specific fallback option.\n     */\n    forceFallbackAdapter?: boolean;\n    /**\n     * Set or get the adapter for WebGPU.\n     *\n     * Setting this property only has effect before the first WebGPU inference session is created. The value will be\n     * used as the GPU adapter for the underlying WebGPU backend to create GPU device.\n     *\n     * If this property is not set, it will be available to get after the first WebGPU inference session is created. The\n     * value will be the GPU adapter that created by the underlying WebGPU backend.\n     *\n     * When use with TypeScript, the type of this property is `GPUAdapter` defined in \"@webgpu/types\".\n     *\n     * @deprecated It is no longer recommended to use this property. The latest WebGPU spec adds `GPUDevice.adapterInfo`\n     * (https://www.w3.org/TR/webgpu/#dom-gpudevice-adapterinfo), which allows to get the adapter information from the\n     * device. When it's available, there is no need to set/get the {@link adapter} property.\n     */\n    adapter: TryGetGlobalType<'GPUAdapter'>;\n    /**\n     * Set or get the GPU device for WebGPU.\n     *\n     * There are 3 valid scenarios of accessing this property:\n     * - Set a value before the first WebGPU inference session is created. The value will be used by the WebGPU backend\n     * to perform calculations. If the value is not a `GPUDevice` object, an error will be thrown.\n     * - Get the value before the first WebGPU inference session is created. This will try to create a new GPUDevice\n     * instance. Returns a `Promise` that resolves to a `GPUDevice` object.\n     * - Get the value after the first WebGPU inference session is created. Returns a resolved `Promise` to the\n     * `GPUDevice` object used by the WebGPU backend.\n     */\n    get device(): Promise<TryGetGlobalType<'GPUDevice'>>;\n    set device(value: TryGetGlobalType<'GPUDevice'>);\n    /**\n     * Set or get whether validate input content.\n     *\n     * @defaultValue `false`\n     */\n    validateInputContent?: boolean;\n  }\n}\n\nexport interface Env {\n  /**\n   * set the severity level for logging.\n   *\n   * @defaultValue `'warning'`\n   */\n  logLevel?: 'verbose' | 'info' | 'warning' | 'error' | 'fatal';\n\n  /**\n   * Indicate whether run in debug mode.\n   *\n   * @defaultValue `false`\n   */\n  debug?: boolean;\n\n  /**\n   * set or get a boolean value indicating whether to enable trace.\n   *\n   * @defaultValue `false`\n   */\n  trace?: boolean;\n\n  /**\n   * Get version of the current package.\n   */\n  readonly versions: {\n    readonly common: string;\n    readonly web?: string;\n    readonly node?: string;\n    // eslint-disable-next-line @typescript-eslint/naming-convention\n    readonly 'react-native'?: string;\n  };\n\n  /**\n   * Represent a set of flags for WebAssembly\n   */\n  readonly wasm: Env.WebAssemblyFlags;\n\n  /**\n   * Represent a set of flags for WebGL\n   */\n  readonly webgl: Env.WebGLFlags;\n\n  /**\n   * Represent a set of flags for WebGPU\n   */\n  readonly webgpu: Env.WebGpuFlags;\n\n  [name: string]: unknown;\n}\n\n/**\n * Represent a set of flags as a global singleton.\n */\nexport const env: Env = envImpl;\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { TensorToDataUrlOptions, TensorToImageDataOptions } from './tensor-conversion.js';\nimport { Tensor } from './tensor.js';\n\n/**\n * implementation of Tensor.toDataURL()\n */\nexport const tensorToDataURL = (tensor: Tensor, options?: TensorToDataUrlOptions): string => {\n  const canvas = typeof document !== 'undefined' ? document.createElement('canvas') : new OffscreenCanvas(1, 1);\n  canvas.width = tensor.dims[3];\n  canvas.height = tensor.dims[2];\n  const pixels2DContext = canvas.getContext('2d') as\n    | CanvasRenderingContext2D\n    | OffscreenCanvasRenderingContext2D\n    | null;\n\n  if (pixels2DContext != null) {\n    // Default values for height and width & format\n    let width: number;\n    let height: number;\n    if (options?.tensorLayout !== undefined && options.tensorLayout === 'NHWC') {\n      width = tensor.dims[2];\n      height = tensor.dims[3];\n    } else {\n      // Default layout is NCWH\n      width = tensor.dims[3];\n      height = tensor.dims[2];\n    }\n\n    const inputformat = options?.format !== undefined ? options.format : 'RGB';\n\n    const norm = options?.norm;\n    let normMean: [number, number, number, number];\n    let normBias: [number, number, number, number];\n    if (norm === undefined || norm.mean === undefined) {\n      normMean = [255, 255, 255, 255];\n    } else {\n      if (typeof norm.mean === 'number') {\n        normMean = [norm.mean, norm.mean, norm.mean, norm.mean];\n      } else {\n        normMean = [norm.mean[0], norm.mean[1], norm.mean[2], 0];\n        if (norm.mean[3] !== undefined) {\n          normMean[3] = norm.mean[3];\n        }\n      }\n    }\n    if (norm === undefined || norm.bias === undefined) {\n      normBias = [0, 0, 0, 0];\n    } else {\n      if (typeof norm.bias === 'number') {\n        normBias = [norm.bias, norm.bias, norm.bias, norm.bias];\n      } else {\n        normBias = [norm.bias[0], norm.bias[1], norm.bias[2], 0];\n        if (norm.bias[3] !== undefined) {\n          normBias[3] = norm.bias[3];\n        }\n      }\n    }\n\n    const stride = height * width;\n    // Default pointer assignments\n    let rTensorPointer = 0,\n      gTensorPointer = stride,\n      bTensorPointer = stride * 2,\n      aTensorPointer = -1;\n\n    // Updating the pointer assignments based on the input image format\n    if (inputformat === 'RGBA') {\n      rTensorPointer = 0;\n      gTensorPointer = stride;\n      bTensorPointer = stride * 2;\n      aTensorPointer = stride * 3;\n    } else if (inputformat === 'RGB') {\n      rTensorPointer = 0;\n      gTensorPointer = stride;\n      bTensorPointer = stride * 2;\n    } else if (inputformat === 'RBG') {\n      rTensorPointer = 0;\n      bTensorPointer = stride;\n      gTensorPointer = stride * 2;\n    }\n\n    for (let i = 0; i < height; i++) {\n      for (let j = 0; j < width; j++) {\n        const R = ((tensor.data[rTensorPointer++] as number) - normBias[0]) * normMean[0]; // R value\n        const G = ((tensor.data[gTensorPointer++] as number) - normBias[1]) * normMean[1]; // G value\n        const B = ((tensor.data[bTensorPointer++] as number) - normBias[2]) * normMean[2]; // B value\n        const A = aTensorPointer === -1 ? 255 : ((tensor.data[aTensorPointer++] as number) - normBias[3]) * normMean[3]; // A value\n        // eslint-disable-next-line @typescript-eslint/restrict-plus-operands\n        pixels2DContext.fillStyle = 'rgba(' + R + ',' + G + ',' + B + ',' + A + ')';\n        pixels2DContext.fillRect(j, i, 1, 1);\n      }\n    }\n    if ('toDataURL' in canvas) {\n      return canvas.toDataURL();\n    } else {\n      throw new Error('toDataURL is not supported');\n    }\n  } else {\n    throw new Error('Can not access image data');\n  }\n};\n\n/**\n * implementation of Tensor.toImageData()\n */\nexport const tensorToImageData = (tensor: Tensor, options?: TensorToImageDataOptions): ImageData => {\n  const pixels2DContext =\n    typeof document !== 'undefined'\n      ? document.createElement('canvas').getContext('2d')\n      : (new OffscreenCanvas(1, 1).getContext('2d') as OffscreenCanvasRenderingContext2D);\n  let image: ImageData;\n  if (pixels2DContext != null) {\n    // Default values for height and width & format\n    let width: number;\n    let height: number;\n    let channels: number;\n    if (options?.tensorLayout !== undefined && options.tensorLayout === 'NHWC') {\n      width = tensor.dims[2];\n      height = tensor.dims[1];\n      channels = tensor.dims[3];\n    } else {\n      // Default layout is NCWH\n      width = tensor.dims[3];\n      height = tensor.dims[2];\n      channels = tensor.dims[1];\n    }\n    const inputformat = options !== undefined ? (options.format !== undefined ? options.format : 'RGB') : 'RGB';\n\n    const norm = options?.norm;\n    let normMean: [number, number, number, number];\n    let normBias: [number, number, number, number];\n    if (norm === undefined || norm.mean === undefined) {\n      normMean = [255, 255, 255, 255];\n    } else {\n      if (typeof norm.mean === 'number') {\n        normMean = [norm.mean, norm.mean, norm.mean, norm.mean];\n      } else {\n        normMean = [norm.mean[0], norm.mean[1], norm.mean[2], 255];\n        if (norm.mean[3] !== undefined) {\n          normMean[3] = norm.mean[3];\n        }\n      }\n    }\n    if (norm === undefined || norm.bias === undefined) {\n      normBias = [0, 0, 0, 0];\n    } else {\n      if (typeof norm.bias === 'number') {\n        normBias = [norm.bias, norm.bias, norm.bias, norm.bias];\n      } else {\n        normBias = [norm.bias[0], norm.bias[1], norm.bias[2], 0];\n        if (norm.bias[3] !== undefined) {\n          normBias[3] = norm.bias[3];\n        }\n      }\n    }\n\n    const stride = height * width;\n    if (options !== undefined) {\n      if (\n        (options.format !== undefined && channels === 4 && options.format !== 'RGBA') ||\n        (channels === 3 && options.format !== 'RGB' && options.format !== 'BGR')\n      ) {\n        throw new Error(\"Tensor format doesn't match input tensor dims\");\n      }\n    }\n\n    // Default pointer assignments\n    const step = 4;\n    let rImagePointer = 0,\n      gImagePointer = 1,\n      bImagePointer = 2,\n      aImagePointer = 3;\n    let rTensorPointer = 0,\n      gTensorPointer = stride,\n      bTensorPointer = stride * 2,\n      aTensorPointer = -1;\n\n    // Updating the pointer assignments based on the input image format\n    if (inputformat === 'RGBA') {\n      rTensorPointer = 0;\n      gTensorPointer = stride;\n      bTensorPointer = stride * 2;\n      aTensorPointer = stride * 3;\n    } else if (inputformat === 'RGB') {\n      rTensorPointer = 0;\n      gTensorPointer = stride;\n      bTensorPointer = stride * 2;\n    } else if (inputformat === 'RBG') {\n      rTensorPointer = 0;\n      bTensorPointer = stride;\n      gTensorPointer = stride * 2;\n    }\n\n    image = pixels2DContext.createImageData(width, height);\n\n    for (\n      let i = 0;\n      i < height * width;\n      rImagePointer += step, gImagePointer += step, bImagePointer += step, aImagePointer += step, i++\n    ) {\n      image.data[rImagePointer] = ((tensor.data[rTensorPointer++] as number) - normBias[0]) * normMean[0]; // R value\n      image.data[gImagePointer] = ((tensor.data[gTensorPointer++] as number) - normBias[1]) * normMean[1]; // G value\n      image.data[bImagePointer] = ((tensor.data[bTensorPointer++] as number) - normBias[2]) * normMean[2]; // B value\n      image.data[aImagePointer] =\n        aTensorPointer === -1 ? 255 : ((tensor.data[aTensorPointer++] as number) - normBias[3]) * normMean[3]; // A value\n    }\n  } else {\n    throw new Error('Can not access image data');\n  }\n  return image;\n};\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport {\n  OptionsDimensions,\n  OptionsFormat,\n  OptionsNormalizationParameters,\n  OptionsTensorFormat,\n  OptionsTensorLayout,\n  TensorFromGpuBufferOptions,\n  TensorFromImageBitmapOptions,\n  TensorFromImageDataOptions,\n  TensorFromImageElementOptions,\n  TensorFromMLTensorOptions,\n  TensorFromTextureOptions,\n  TensorFromUrlOptions,\n} from './tensor-factory.js';\nimport { Tensor } from './tensor-impl.js';\nimport { Tensor as TensorInterface } from './tensor.js';\n\ninterface BufferToTensorOptions\n  extends OptionsDimensions,\n    OptionsTensorLayout,\n    OptionsNormalizationParameters,\n    OptionsFormat,\n    OptionsTensorFormat {}\n\n/**\n * Create a new tensor object from image object\n *\n * @param buffer - Extracted image buffer data - assuming RGBA format\n * @param imageFormat - input image configuration - required configurations height, width, format\n * @param tensorFormat - output tensor configuration - Default is RGB format\n */\nexport const bufferToTensor = (buffer: Uint8ClampedArray | undefined, options: BufferToTensorOptions): Tensor => {\n  if (buffer === undefined) {\n    throw new Error('Image buffer must be defined');\n  }\n  if (options.height === undefined || options.width === undefined) {\n    throw new Error('Image height and width must be defined');\n  }\n  if (options.tensorLayout === 'NHWC') {\n    throw new Error('NHWC Tensor layout is not supported yet');\n  }\n\n  const { height, width } = options;\n\n  const norm = options.norm ?? { mean: 255, bias: 0 };\n  let normMean: [number, number, number, number];\n  let normBias: [number, number, number, number];\n\n  if (typeof norm.mean === 'number') {\n    normMean = [norm.mean, norm.mean, norm.mean, norm.mean];\n  } else {\n    normMean = [norm.mean![0], norm.mean![1], norm.mean![2], norm.mean![3] ?? 255];\n  }\n\n  if (typeof norm.bias === 'number') {\n    normBias = [norm.bias, norm.bias, norm.bias, norm.bias];\n  } else {\n    normBias = [norm.bias![0], norm.bias![1], norm.bias![2], norm.bias![3] ?? 0];\n  }\n\n  const inputformat = options.format !== undefined ? options.format : 'RGBA';\n  // default value is RGBA since imagedata and HTMLImageElement uses it\n\n  const outputformat =\n    options.tensorFormat !== undefined ? (options.tensorFormat !== undefined ? options.tensorFormat : 'RGB') : 'RGB';\n  const stride = height * width;\n  const float32Data = outputformat === 'RGBA' ? new Float32Array(stride * 4) : new Float32Array(stride * 3);\n\n  // Default pointer assignments\n  let step = 4,\n    rImagePointer = 0,\n    gImagePointer = 1,\n    bImagePointer = 2,\n    aImagePointer = 3;\n  let rTensorPointer = 0,\n    gTensorPointer = stride,\n    bTensorPointer = stride * 2,\n    aTensorPointer = -1;\n\n  // Updating the pointer assignments based on the input image format\n  if (inputformat === 'RGB') {\n    step = 3;\n    rImagePointer = 0;\n    gImagePointer = 1;\n    bImagePointer = 2;\n    aImagePointer = -1;\n  }\n\n  // Updating the pointer assignments based on the output tensor format\n  if (outputformat === 'RGBA') {\n    aTensorPointer = stride * 3;\n  } else if (outputformat === 'RBG') {\n    rTensorPointer = 0;\n    bTensorPointer = stride;\n    gTensorPointer = stride * 2;\n  } else if (outputformat === 'BGR') {\n    bTensorPointer = 0;\n    gTensorPointer = stride;\n    rTensorPointer = stride * 2;\n  }\n\n  for (\n    let i = 0;\n    i < stride;\n    i++, rImagePointer += step, bImagePointer += step, gImagePointer += step, aImagePointer += step\n  ) {\n    float32Data[rTensorPointer++] = (buffer[rImagePointer] + normBias[0]) / normMean[0];\n    float32Data[gTensorPointer++] = (buffer[gImagePointer] + normBias[1]) / normMean[1];\n    float32Data[bTensorPointer++] = (buffer[bImagePointer] + normBias[2]) / normMean[2];\n    if (aTensorPointer !== -1 && aImagePointer !== -1) {\n      float32Data[aTensorPointer++] = (buffer[aImagePointer] + normBias[3]) / normMean[3];\n    }\n  }\n\n  // Float32Array -> ort.Tensor\n  const outputTensor =\n    outputformat === 'RGBA'\n      ? new Tensor('float32', float32Data, [1, 4, height, width])\n      : new Tensor('float32', float32Data, [1, 3, height, width]);\n  return outputTensor;\n};\n\n/**\n * implementation of Tensor.fromImage().\n */\nexport const tensorFromImage = async (\n  image: ImageData | HTMLImageElement | ImageBitmap | string,\n  options?:\n    | TensorFromImageDataOptions\n    | TensorFromImageElementOptions\n    | TensorFromImageBitmapOptions\n    | TensorFromUrlOptions,\n): Promise<Tensor> => {\n  // checking the type of image object\n  const isHTMLImageEle = typeof HTMLImageElement !== 'undefined' && image instanceof HTMLImageElement;\n  const isImageDataEle = typeof ImageData !== 'undefined' && image instanceof ImageData;\n  const isImageBitmap = typeof ImageBitmap !== 'undefined' && image instanceof ImageBitmap;\n  const isString = typeof image === 'string';\n\n  let data: Uint8ClampedArray | undefined;\n  let bufferToTensorOptions: BufferToTensorOptions = options ?? {};\n\n  const createCanvas = () => {\n    if (typeof document !== 'undefined') {\n      return document.createElement('canvas');\n    } else if (typeof OffscreenCanvas !== 'undefined') {\n      return new OffscreenCanvas(1, 1);\n    } else {\n      throw new Error('Canvas is not supported');\n    }\n  };\n  const createCanvasContext = (canvas: HTMLCanvasElement | OffscreenCanvas) => {\n    if (typeof HTMLCanvasElement !== 'undefined' && canvas instanceof HTMLCanvasElement) {\n      return canvas.getContext('2d');\n    } else if (canvas instanceof OffscreenCanvas) {\n      return canvas.getContext('2d') as OffscreenCanvasRenderingContext2D;\n    } else {\n      return null;\n    }\n  };\n  // filling and checking image configuration options\n  if (isHTMLImageEle) {\n    // HTMLImageElement - image object - format is RGBA by default\n    const canvas = createCanvas();\n    canvas.width = image.width;\n    canvas.height = image.height;\n    const pixels2DContext = createCanvasContext(canvas);\n\n    if (pixels2DContext != null) {\n      let height = image.height;\n      let width = image.width;\n      if (options !== undefined && options.resizedHeight !== undefined && options.resizedWidth !== undefined) {\n        height = options.resizedHeight;\n        width = options.resizedWidth;\n      }\n\n      if (options !== undefined) {\n        bufferToTensorOptions = options;\n        if (options.tensorFormat !== undefined) {\n          throw new Error('Image input config format must be RGBA for HTMLImageElement');\n        } else {\n          bufferToTensorOptions.tensorFormat = 'RGBA';\n        }\n        bufferToTensorOptions.height = height;\n        bufferToTensorOptions.width = width;\n      } else {\n        bufferToTensorOptions.tensorFormat = 'RGBA';\n        bufferToTensorOptions.height = height;\n        bufferToTensorOptions.width = width;\n      }\n\n      pixels2DContext.drawImage(image, 0, 0);\n      data = pixels2DContext.getImageData(0, 0, width, height).data;\n    } else {\n      throw new Error('Can not access image data');\n    }\n  } else if (isImageDataEle) {\n    let height: number;\n    let width: number;\n\n    if (options !== undefined && options.resizedWidth !== undefined && options.resizedHeight !== undefined) {\n      height = options.resizedHeight;\n      width = options.resizedWidth;\n    } else {\n      height = image.height;\n      width = image.width;\n    }\n\n    if (options !== undefined) {\n      bufferToTensorOptions = options;\n    }\n    bufferToTensorOptions.format = 'RGBA';\n    bufferToTensorOptions.height = height;\n    bufferToTensorOptions.width = width;\n\n    if (options !== undefined) {\n      const tempCanvas = createCanvas();\n\n      tempCanvas.width = width;\n      tempCanvas.height = height;\n\n      const pixels2DContext = createCanvasContext(tempCanvas);\n\n      if (pixels2DContext != null) {\n        pixels2DContext.putImageData(image, 0, 0);\n        data = pixels2DContext.getImageData(0, 0, width, height).data;\n      } else {\n        throw new Error('Can not access image data');\n      }\n    } else {\n      data = image.data;\n    }\n  } else if (isImageBitmap) {\n    // ImageBitmap - image object - format must be provided by user\n    if (options === undefined) {\n      throw new Error('Please provide image config with format for Imagebitmap');\n    }\n\n    const canvas = createCanvas();\n    canvas.width = image.width;\n    canvas.height = image.height;\n    const pixels2DContext = createCanvasContext(canvas);\n\n    if (pixels2DContext != null) {\n      const height = image.height;\n      const width = image.width;\n      pixels2DContext.drawImage(image, 0, 0, width, height);\n      data = pixels2DContext.getImageData(0, 0, width, height).data;\n      bufferToTensorOptions.height = height;\n      bufferToTensorOptions.width = width;\n      return bufferToTensor(data, bufferToTensorOptions);\n    } else {\n      throw new Error('Can not access image data');\n    }\n  } else if (isString) {\n    return new Promise((resolve, reject) => {\n      const canvas = createCanvas();\n      const context = createCanvasContext(canvas);\n      if (!image || !context) {\n        return reject();\n      }\n      const newImage = new Image();\n      newImage.crossOrigin = 'Anonymous';\n      newImage.src = image;\n      newImage.onload = () => {\n        canvas.width = newImage.width;\n        canvas.height = newImage.height;\n        context.drawImage(newImage, 0, 0, canvas.width, canvas.height);\n        const img = context.getImageData(0, 0, canvas.width, canvas.height);\n\n        bufferToTensorOptions.height = canvas.height;\n        bufferToTensorOptions.width = canvas.width;\n        resolve(bufferToTensor(img.data, bufferToTensorOptions));\n      };\n    });\n  } else {\n    throw new Error('Input data provided is not supported - aborted tensor creation');\n  }\n\n  if (data !== undefined) {\n    return bufferToTensor(data, bufferToTensorOptions);\n  } else {\n    throw new Error('Input data provided is not supported - aborted tensor creation');\n  }\n};\n\n/**\n * implementation of Tensor.fromTexture().\n */\nexport const tensorFromTexture = <T extends TensorInterface.TextureDataTypes>(\n  texture: TensorInterface.TextureType,\n  options: TensorFromTextureOptions<T>,\n): Tensor => {\n  const { width, height, download, dispose } = options;\n  // Always assume RGBAF32. TODO: support different texture format\n  const dims = [1, height, width, 4];\n  return new Tensor({ location: 'texture', type: 'float32', texture, dims, download, dispose });\n};\n\n/**\n * implementation of Tensor.fromGpuBuffer().\n */\nexport const tensorFromGpuBuffer = <T extends TensorInterface.GpuBufferDataTypes>(\n  gpuBuffer: TensorInterface.GpuBufferType,\n  options: TensorFromGpuBufferOptions<T>,\n): Tensor => {\n  const { dataType, dims, download, dispose } = options;\n  return new Tensor({ location: 'gpu-buffer', type: dataType ?? 'float32', gpuBuffer, dims, download, dispose });\n};\n\n/**\n * implementation of Tensor.fromMLTensor().\n */\nexport const tensorFromMLTensor = <T extends TensorInterface.MLTensorDataTypes>(\n  mlTensor: TensorInterface.MLTensorType,\n  options: TensorFromMLTensorOptions<T>,\n): Tensor => {\n  const { dataType, dims, download, dispose } = options;\n  return new Tensor({ location: 'ml-tensor', type: dataType ?? 'float32', mlTensor, dims, download, dispose });\n};\n\n/**\n * implementation of Tensor.fromPinnedBuffer().\n */\nexport const tensorFromPinnedBuffer = <T extends TensorInterface.CpuPinnedDataTypes>(\n  type: T,\n  buffer: TensorInterface.DataTypeMap[T],\n  dims?: readonly number[],\n): Tensor => new Tensor({ location: 'cpu-pinned', type, data: buffer, dims: dims ?? [buffer.length] });\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { Tensor } from './tensor.js';\n\nexport type SupportedTypedArrayConstructors =\n  | Float32ArrayConstructor\n  | Uint8ArrayConstructor\n  | Int8ArrayConstructor\n  | Uint16ArrayConstructor\n  | Int16ArrayConstructor\n  | Int32ArrayConstructor\n  | BigInt64ArrayConstructor\n  | Uint8ArrayConstructor\n  | Float64ArrayConstructor\n  | Uint32ArrayConstructor\n  | BigUint64ArrayConstructor;\nexport type SupportedTypedArray = InstanceType<SupportedTypedArrayConstructors>;\n\n// a runtime map that maps type string to TypedArray constructor. Should match Tensor.DataTypeMap.\nexport const NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP = new Map<string, SupportedTypedArrayConstructors>([\n  ['float32', Float32Array],\n  ['uint8', Uint8Array],\n  ['int8', Int8Array],\n  ['uint16', Uint16Array],\n  ['int16', Int16Array],\n  ['int32', Int32Array],\n  ['bool', Uint8Array],\n  ['float64', Float64Array],\n  ['uint32', Uint32Array],\n  ['int4', Uint8Array],\n  ['uint4', Uint8Array],\n]);\n\n// a runtime map that maps type string to TypedArray constructor. Should match Tensor.DataTypeMap.\nexport const NUMERIC_TENSOR_TYPEDARRAY_TO_TYPE_MAP = new Map<SupportedTypedArrayConstructors, Tensor.Type>([\n  [Float32Array, 'float32'],\n  [Uint8Array, 'uint8'],\n  [Int8Array, 'int8'],\n  [Uint16Array, 'uint16'],\n  [Int16Array, 'int16'],\n  [Int32Array, 'int32'],\n  [Float64Array, 'float64'],\n  [Uint32Array, 'uint32'],\n]);\n\n// the following code allows delaying execution of BigInt/Float16Array checking. This allows lazy initialization for\n// NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP and NUMERIC_TENSOR_TYPEDARRAY_TO_TYPE_MAP, which allows BigInt/Float16Array\n// polyfill if available.\nlet isTypedArrayChecked = false;\nexport const checkTypedArray = () => {\n  if (!isTypedArrayChecked) {\n    isTypedArrayChecked = true;\n    const isBigInt64ArrayAvailable = typeof BigInt64Array !== 'undefined' && BigInt64Array.from;\n    const isBigUint64ArrayAvailable = typeof BigUint64Array !== 'undefined' && BigUint64Array.from;\n\n    // eslint-disable-next-line @typescript-eslint/naming-convention, @typescript-eslint/no-explicit-any\n    const Float16Array = (globalThis as any).Float16Array;\n    const isFloat16ArrayAvailable = typeof Float16Array !== 'undefined' && Float16Array.from;\n\n    if (isBigInt64ArrayAvailable) {\n      NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP.set('int64', BigInt64Array);\n      NUMERIC_TENSOR_TYPEDARRAY_TO_TYPE_MAP.set(BigInt64Array, 'int64');\n    }\n    if (isBigUint64ArrayAvailable) {\n      NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP.set('uint64', BigUint64Array);\n      NUMERIC_TENSOR_TYPEDARRAY_TO_TYPE_MAP.set(BigUint64Array, 'uint64');\n    }\n    if (isFloat16ArrayAvailable) {\n      NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP.set('float16', Float16Array);\n      NUMERIC_TENSOR_TYPEDARRAY_TO_TYPE_MAP.set(Float16Array, 'float16');\n    } else {\n      // if Float16Array is not available, use 'Uint16Array' to store the data.\n      NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP.set('float16', Uint16Array);\n    }\n  }\n};\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport {\n  CpuPinnedConstructorParameters,\n  GpuBufferConstructorParameters,\n  MLTensorConstructorParameters,\n  TextureConstructorParameters,\n} from './tensor-factory.js';\nimport { Tensor } from './tensor-impl.js';\n\n/**\n * calculate size from dims.\n *\n * @param dims the dims array. May be an illegal input.\n */\nexport const calculateSize = (dims: readonly unknown[]): number => {\n  let size = 1;\n  for (let i = 0; i < dims.length; i++) {\n    const dim = dims[i];\n    if (typeof dim !== 'number' || !Number.isSafeInteger(dim)) {\n      throw new TypeError(`dims[${i}] must be an integer, got: ${dim}`);\n    }\n    if (dim < 0) {\n      throw new RangeError(`dims[${i}] must be a non-negative integer, got: ${dim}`);\n    }\n    size *= dim;\n  }\n  return size;\n};\n\n/**\n * implementation of Tensor.reshape()\n */\nexport const tensorReshape = (tensor: Tensor, dims: readonly number[]): Tensor => {\n  switch (tensor.location) {\n    case 'cpu':\n      return new Tensor(tensor.type, tensor.data, dims);\n    case 'cpu-pinned':\n      return new Tensor({\n        location: 'cpu-pinned',\n        data: tensor.data as CpuPinnedConstructorParameters['data'],\n        type: tensor.type as CpuPinnedConstructorParameters['type'],\n        dims,\n      });\n    case 'texture':\n      return new Tensor({\n        location: 'texture',\n        texture: tensor.texture,\n        type: tensor.type as TextureConstructorParameters['type'],\n        dims,\n      });\n    case 'gpu-buffer':\n      return new Tensor({\n        location: 'gpu-buffer',\n        gpuBuffer: tensor.gpuBuffer,\n        type: tensor.type as GpuBufferConstructorParameters['type'],\n        dims,\n      });\n    case 'ml-tensor':\n      return new Tensor({\n        location: 'ml-tensor',\n        mlTensor: tensor.mlTensor,\n        type: tensor.type as MLTensorConstructorParameters['type'],\n        dims,\n      });\n    default:\n      throw new Error(`tensorReshape: tensor location ${tensor.location} is not supported`);\n  }\n};\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { tensorToDataURL, tensorToImageData } from './tensor-conversion-impl.js';\nimport { TensorToDataUrlOptions, TensorToImageDataOptions } from './tensor-conversion.js';\nimport {\n  tensorFromGpuBuffer,\n  tensorFromImage,\n  tensorFromMLTensor,\n  tensorFromPinnedBuffer,\n  tensorFromTexture,\n} from './tensor-factory-impl.js';\nimport {\n  CpuPinnedConstructorParameters,\n  GpuBufferConstructorParameters,\n  MLTensorConstructorParameters,\n  TensorFromGpuBufferOptions,\n  TensorFromImageBitmapOptions,\n  TensorFromImageDataOptions,\n  TensorFromImageElementOptions,\n  TensorFromMLTensorOptions,\n  TensorFromTextureOptions,\n  TensorFromUrlOptions,\n  TextureConstructorParameters,\n} from './tensor-factory.js';\nimport {\n  checkTypedArray,\n  NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP,\n  NUMERIC_TENSOR_TYPEDARRAY_TO_TYPE_MAP,\n  SupportedTypedArray,\n  SupportedTypedArrayConstructors,\n} from './tensor-impl-type-mapping.js';\nimport { calculateSize, tensorReshape } from './tensor-utils-impl.js';\nimport { Tensor as TensorInterface } from './tensor.js';\n\n// type aliases for those exported from Tensor interface\n\ntype TensorType = TensorInterface.Type;\ntype TensorDataType = TensorInterface.DataType;\ntype TensorDataLocation = TensorInterface.DataLocation;\ntype TensorTextureType = TensorInterface.TextureType;\ntype TensorGpuBufferType = TensorInterface.GpuBufferType;\ntype TensorMLTensorType = TensorInterface.MLTensorType;\n\n/**\n * the implementation of Tensor interface.\n *\n * @ignore\n */\nexport class Tensor implements TensorInterface {\n  // #region constructors\n\n  /**\n   * Construct a new CPU tensor object from the given type, data and dims.\n   */\n  constructor(\n    type: TensorType,\n    data: TensorDataType | Uint8ClampedArray | readonly string[] | readonly number[] | readonly boolean[],\n    dims?: readonly number[],\n  );\n  /**\n   * Construct a new CPU tensor object from the given data and dims. Type is inferred from data.\n   */\n  constructor(\n    data: TensorDataType | Uint8ClampedArray | readonly string[] | readonly boolean[],\n    dims?: readonly number[],\n  );\n  /**\n   * Construct a new tensor object from the pinned CPU data with the given type and dims.\n   *\n   * Tensor's location will be set to 'cpu-pinned'.\n   *\n   * @param params - Specify the parameters to construct the tensor.\n   */\n  constructor(params: CpuPinnedConstructorParameters);\n  /**\n   * Construct a new tensor object from the WebGL texture with the given type and dims.\n   *\n   * Tensor's location will be set to 'texture'.\n   *\n   * @param params - Specify the parameters to construct the tensor.\n   */\n  constructor(params: TextureConstructorParameters);\n  /**\n   * Construct a new tensor object from the WebGPU buffer with the given type and dims.\n   *\n   * Tensor's location will be set to 'gpu-buffer'.\n   *\n   * @param params - Specify the parameters to construct the tensor.\n   */\n  constructor(params: GpuBufferConstructorParameters);\n\n  /**\n   * Construct a new tensor object from the WebNN MLTensor with the given type and dims.\n   *\n   * Tensor's location will be set to 'ml-tensor'.\n   *\n   * @param params - Specify the parameters to construct the tensor.\n   */\n  constructor(params: MLTensorConstructorParameters);\n\n  /**\n   * implementation.\n   */\n  constructor(\n    arg0:\n      | TensorType\n      | TensorDataType\n      | Uint8ClampedArray\n      | readonly string[]\n      | readonly boolean[]\n      | CpuPinnedConstructorParameters\n      | TextureConstructorParameters\n      | GpuBufferConstructorParameters\n      | MLTensorConstructorParameters,\n    arg1?: TensorDataType | Uint8ClampedArray | readonly number[] | readonly string[] | readonly boolean[],\n    arg2?: readonly number[],\n  ) {\n    // perform one-time check for BigInt/Float16Array support\n    checkTypedArray();\n\n    let type: TensorType;\n    let dims: readonly number[];\n\n    if (typeof arg0 === 'object' && 'location' in arg0) {\n      //\n      // constructing tensor from specific location\n      //\n      this.dataLocation = arg0.location;\n      type = arg0.type;\n      dims = arg0.dims;\n      switch (arg0.location) {\n        case 'cpu-pinned': {\n          const expectedTypedArrayConstructor = NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP.get(type);\n          if (!expectedTypedArrayConstructor) {\n            throw new TypeError(`unsupported type \"${type}\" to create tensor from pinned buffer`);\n          }\n          if (!(arg0.data instanceof expectedTypedArrayConstructor)) {\n            throw new TypeError(`buffer should be of type ${expectedTypedArrayConstructor.name}`);\n          }\n          this.cpuData = arg0.data;\n          break;\n        }\n        case 'texture': {\n          if (type !== 'float32') {\n            throw new TypeError(`unsupported type \"${type}\" to create tensor from texture`);\n          }\n          this.gpuTextureData = arg0.texture;\n          this.downloader = arg0.download;\n          this.disposer = arg0.dispose;\n          break;\n        }\n        case 'gpu-buffer': {\n          if (\n            type !== 'float32' &&\n            type !== 'float16' &&\n            type !== 'int32' &&\n            type !== 'int64' &&\n            type !== 'uint32' &&\n            type !== 'uint8' &&\n            type !== 'bool' &&\n            type !== 'uint4' &&\n            type !== 'int4'\n          ) {\n            throw new TypeError(`unsupported type \"${type}\" to create tensor from gpu buffer`);\n          }\n          this.gpuBufferData = arg0.gpuBuffer;\n          this.downloader = arg0.download;\n          this.disposer = arg0.dispose;\n          break;\n        }\n        case 'ml-tensor': {\n          if (\n            type !== 'float32' &&\n            type !== 'float16' &&\n            type !== 'int32' &&\n            type !== 'int64' &&\n            type !== 'uint32' &&\n            type !== 'uint64' &&\n            type !== 'int8' &&\n            type !== 'uint8' &&\n            type !== 'bool' &&\n            type !== 'uint4' &&\n            type !== 'int4'\n          ) {\n            throw new TypeError(`unsupported type \"${type}\" to create tensor from MLTensor`);\n          }\n          this.mlTensorData = arg0.mlTensor;\n          this.downloader = arg0.download;\n          this.disposer = arg0.dispose;\n          break;\n        }\n        default:\n          throw new Error(`Tensor constructor: unsupported location '${this.dataLocation}'`);\n      }\n    } else {\n      //\n      // constructing tensor of location 'cpu'\n      //\n      let data: TensorDataType;\n      let maybeDims: typeof arg1 | typeof arg2;\n      // check whether arg0 is type or data\n      if (typeof arg0 === 'string') {\n        //\n        // Override: constructor(type, data, ...)\n        //\n        type = arg0;\n        maybeDims = arg2;\n        if (arg0 === 'string') {\n          // string tensor\n          if (!Array.isArray(arg1)) {\n            throw new TypeError(\"A string tensor's data must be a string array.\");\n          }\n          // we don't check whether every element in the array is string; this is too slow. we assume it's correct and\n          // error will be populated at inference\n          data = arg1;\n        } else {\n          // numeric tensor\n          const typedArrayConstructor = NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP.get(arg0);\n          if (typedArrayConstructor === undefined) {\n            throw new TypeError(`Unsupported tensor type: ${arg0}.`);\n          }\n          if (Array.isArray(arg1)) {\n            if ((arg0 === 'float16' && typedArrayConstructor === Uint16Array) || arg0 === 'uint4' || arg0 === 'int4') {\n              // - 'float16':\n              //   When no Float16Array polyfill is used, we cannot create 'float16' tensor from number array.\n              //\n              //   Throw error here because when user try to use number array as data,\n              //   e.g. new Tensor('float16', [1, 2, 3, 4], dims)), it will actually call\n              //   Uint16Array.from(arg1) which generates wrong data.\n              //\n              // - 'uint4' and 'int4':\n              //   Uint8Array.from(arg1) will generate wrong data for 'uint4' and 'int4' tensor.\n              //\n              throw new TypeError(\n                `Creating a ${arg0} tensor from number array is not supported. Please use ${typedArrayConstructor.name} as data.`,\n              );\n            } else if (arg0 === 'uint64' || arg0 === 'int64') {\n              // use 'as any' here because:\n              // 1. TypeScript's check on type of 'Array.isArray()' does not work with readonly arrays.\n              // see https://github.com/microsoft/TypeScript/issues/17002\n              // 2. TypeScript's check on union type of '(BigInt64ArrayConstructor|BigUint64ArrayConstructor).from()'\n              // does not accept parameter mapFn.\n              // 3. parameters of 'SupportedTypedArrayConstructors.from()' does not match the requirement of the union\n              // type.\n\n              // assume 'arg1' is of type \"readonly number[]|readonly bigint[]\" here.\n\n              // eslint-disable-next-line @typescript-eslint/no-explicit-any\n              data = (typedArrayConstructor as any).from(arg1, BigInt);\n            } else {\n              // assume 'arg1' is of type \"readonly number[]\" here.\n              // eslint-disable-next-line @typescript-eslint/no-explicit-any\n              data = (typedArrayConstructor as any).from(arg1);\n            }\n          } else if (arg1 instanceof typedArrayConstructor) {\n            data = arg1;\n          } else if (arg1 instanceof Uint8ClampedArray) {\n            if (arg0 === 'uint8') {\n              data = Uint8Array.from(arg1);\n            } else {\n              throw new TypeError(`A Uint8ClampedArray tensor's data must be type of uint8`);\n            }\n          } else if (arg0 === 'float16' && arg1 instanceof Uint16Array && typedArrayConstructor !== Uint16Array) {\n            // when Float16Array is available and data is of type Uint16Array.\n            // We allow Uint16Array to be passed in as data for 'float16' tensor until Float16Array is generally\n            // supported in JavaScript environment.\n\n            // eslint-disable-next-line @typescript-eslint/no-explicit-any\n            data = new (globalThis as any).Float16Array(arg1.buffer, arg1.byteOffset, arg1.length);\n          } else {\n            throw new TypeError(`A ${type} tensor's data must be type of ${typedArrayConstructor}`);\n          }\n        }\n      } else {\n        //\n        // Override: constructor(data, ...)\n        //\n        maybeDims = arg1;\n        if (Array.isArray(arg0)) {\n          // only boolean[] and string[] is supported\n          if (arg0.length === 0) {\n            throw new TypeError('Tensor type cannot be inferred from an empty array.');\n          }\n          const firstElementType = typeof arg0[0];\n          if (firstElementType === 'string') {\n            type = 'string';\n            data = arg0;\n          } else if (firstElementType === 'boolean') {\n            type = 'bool';\n            // 'arg0' is of type 'boolean[]'. Uint8Array.from(boolean[]) actually works, but typescript thinks this is\n            // wrong type. We use 'as any' to make it happy.\n            // eslint-disable-next-line @typescript-eslint/no-explicit-any\n            data = Uint8Array.from(arg0 as any[]);\n          } else {\n            throw new TypeError(`Invalid element type of data array: ${firstElementType}.`);\n          }\n        } else if (arg0 instanceof Uint8ClampedArray) {\n          type = 'uint8';\n          data = Uint8Array.from(arg0);\n        } else {\n          // get tensor type from TypedArray\n          const mappedType = NUMERIC_TENSOR_TYPEDARRAY_TO_TYPE_MAP.get(\n            arg0.constructor as SupportedTypedArrayConstructors,\n          );\n          if (mappedType === undefined) {\n            throw new TypeError(`Unsupported type for tensor data: ${arg0.constructor}.`);\n          }\n          type = mappedType;\n          data = arg0 as SupportedTypedArray;\n        }\n      }\n\n      // type and data is processed, now processing dims\n      if (maybeDims === undefined) {\n        // assume 1-D tensor if dims omitted\n        maybeDims = [data.length];\n      } else if (!Array.isArray(maybeDims)) {\n        throw new TypeError(\"A tensor's dims must be a number array\");\n      }\n      dims = maybeDims as readonly number[];\n\n      this.cpuData = data;\n      this.dataLocation = 'cpu';\n    }\n\n    // perform check on dims\n    const size = calculateSize(dims);\n    // if data is on CPU, check whether data length matches tensor size\n    if (this.cpuData && size !== this.cpuData.length) {\n      if ((type === 'uint4' || type === 'int4') && Math.ceil(size / 2) === this.cpuData.length) {\n        // for (u)int4, the data length is half of the tensor size. So we check this special case when size is odd.\n      } else {\n        throw new Error(`Tensor's size(${size}) does not match data length(${this.cpuData.length}).`);\n      }\n    }\n\n    this.type = type;\n    this.dims = dims;\n    this.size = size;\n  }\n  // #endregion\n\n  // #region factory\n  static async fromImage(\n    image: ImageData | HTMLImageElement | ImageBitmap | string,\n    options?:\n      | TensorFromImageDataOptions\n      | TensorFromImageElementOptions\n      | TensorFromImageBitmapOptions\n      | TensorFromUrlOptions,\n  ): Promise<TensorInterface> {\n    return tensorFromImage(image, options);\n  }\n\n  static fromTexture<T extends TensorInterface.TextureDataTypes>(\n    texture: TensorTextureType,\n    options: TensorFromTextureOptions<T>,\n  ): TensorInterface {\n    return tensorFromTexture(texture, options);\n  }\n\n  static fromGpuBuffer<T extends TensorInterface.GpuBufferDataTypes>(\n    gpuBuffer: TensorGpuBufferType,\n    options: TensorFromGpuBufferOptions<T>,\n  ): TensorInterface {\n    return tensorFromGpuBuffer(gpuBuffer, options);\n  }\n\n  static fromMLTensor<T extends TensorInterface.MLTensorDataTypes>(\n    mlTensor: TensorMLTensorType,\n    options: TensorFromMLTensorOptions<T>,\n  ): TensorInterface {\n    return tensorFromMLTensor(mlTensor, options);\n  }\n\n  static fromPinnedBuffer<T extends TensorInterface.CpuPinnedDataTypes>(\n    type: T,\n    buffer: TensorInterface.DataTypeMap[T],\n    dims?: readonly number[],\n  ): Tensor {\n    return tensorFromPinnedBuffer(type, buffer, dims);\n  }\n\n  // #endregion\n\n  // #region conversions\n  toDataURL(options?: TensorToDataUrlOptions): string {\n    return tensorToDataURL(this, options);\n  }\n\n  toImageData(options?: TensorToImageDataOptions): ImageData {\n    return tensorToImageData(this, options);\n  }\n  // #endregion\n\n  // #region public fields\n  readonly dims: readonly number[];\n  readonly type: TensorType;\n  readonly size: number;\n  // #endregion\n\n  // #region private fields\n\n  /**\n   * stores the location of the data.\n   */\n  private dataLocation: TensorDataLocation;\n\n  /**\n   * stores the data on CPU, if location is 'cpu' or 'cpu-pinned'. otherwise empty.\n   */\n  private cpuData?: TensorDataType;\n\n  /**\n   * stores the underlying texture when location is 'texture'. otherwise empty.\n   */\n  private gpuTextureData?: TensorTextureType;\n\n  /**\n   * stores the underlying GPU buffer when location is 'gpu-buffer'. otherwise empty.\n   */\n  private gpuBufferData?: TensorGpuBufferType;\n\n  /**\n   * stores the underlying WebNN MLTensor when location is 'ml-tensor'. otherwise empty.\n   */\n  private mlTensorData?: TensorMLTensorType;\n\n  /**\n   * stores an optional downloader function to download data from GPU to CPU.\n   */\n  private downloader?(): Promise<TensorDataType>;\n\n  /**\n   * a flag indicating whether the data is being downloaded from GPU to CPU.\n   */\n  private isDownloading?: boolean;\n\n  /**\n   * stores an optional disposer function to dispose the underlying data.\n   */\n  private disposer?(): void;\n  // #endregion\n\n  // #region properties\n  get data(): TensorDataType {\n    this.ensureValid();\n    if (!this.cpuData) {\n      throw new Error(\n        'The data is not on CPU. Use `getData()` to download GPU data to CPU, ' +\n          'or use `texture` or `gpuBuffer` property to access the GPU data directly.',\n      );\n    }\n    return this.cpuData;\n  }\n\n  get location(): TensorDataLocation {\n    return this.dataLocation;\n  }\n\n  get texture(): TensorTextureType {\n    this.ensureValid();\n    if (!this.gpuTextureData) {\n      throw new Error('The data is not stored as a WebGL texture.');\n    }\n    return this.gpuTextureData;\n  }\n\n  get gpuBuffer(): TensorGpuBufferType {\n    this.ensureValid();\n    if (!this.gpuBufferData) {\n      throw new Error('The data is not stored as a WebGPU buffer.');\n    }\n    return this.gpuBufferData;\n  }\n\n  get mlTensor(): TensorMLTensorType {\n    this.ensureValid();\n    if (!this.mlTensorData) {\n      throw new Error('The data is not stored as a WebNN MLTensor.');\n    }\n    return this.mlTensorData;\n  }\n  // #endregion\n\n  // #region methods\n\n  async getData(releaseData?: boolean): Promise<TensorDataType> {\n    this.ensureValid();\n    switch (this.dataLocation) {\n      case 'cpu':\n      case 'cpu-pinned':\n        return this.data;\n      case 'texture':\n      case 'gpu-buffer':\n      case 'ml-tensor': {\n        if (!this.downloader) {\n          throw new Error('The current tensor is not created with a specified data downloader.');\n        }\n        if (this.isDownloading) {\n          throw new Error('The current tensor is being downloaded.');\n        }\n        try {\n          this.isDownloading = true;\n          const data = await this.downloader();\n          this.downloader = undefined;\n          this.dataLocation = 'cpu';\n          this.cpuData = data;\n\n          if (releaseData && this.disposer) {\n            this.disposer();\n            this.disposer = undefined;\n          }\n\n          return data;\n        } finally {\n          this.isDownloading = false;\n        }\n      }\n      default:\n        throw new Error(`cannot get data from location: ${this.dataLocation}`);\n    }\n  }\n\n  dispose(): void {\n    if (this.isDownloading) {\n      throw new Error('The current tensor is being downloaded.');\n    }\n\n    if (this.disposer) {\n      this.disposer();\n      this.disposer = undefined;\n    }\n    this.cpuData = undefined;\n    this.gpuTextureData = undefined;\n    this.gpuBufferData = undefined;\n    this.mlTensorData = undefined;\n    this.downloader = undefined;\n    this.isDownloading = undefined;\n\n    this.dataLocation = 'none';\n  }\n\n  // #endregion\n\n  // #region tensor utilities\n  private ensureValid(): void {\n    if (this.dataLocation === 'none') {\n      throw new Error('The tensor is disposed.');\n    }\n  }\n\n  reshape(dims: readonly number[]): TensorInterface {\n    this.ensureValid();\n    if (this.downloader || this.disposer) {\n      throw new Error('Cannot reshape a tensor that owns GPU resource.');\n    }\n    return tensorReshape(this, dims);\n  }\n  // #endregion\n}\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { TensorFactory } from './tensor-factory.js';\nimport { Tensor as TensorImpl } from './tensor-impl.js';\nimport { TypedTensorUtils } from './tensor-utils.js';\nimport { TryGetGlobalType } from './type-helper.js';\n\n/* eslint-disable @typescript-eslint/no-redeclare */\n\n/**\n * represent a basic tensor with specified dimensions and data type.\n */\ninterface TypedTensorBase<T extends Tensor.Type> {\n  /**\n   * Get the dimensions of the tensor.\n   */\n  readonly dims: readonly number[];\n  /**\n   * Get the data type of the tensor.\n   */\n  readonly type: T;\n  /**\n   * Get the buffer data of the tensor.\n   *\n   * If the data is not on CPU (eg. it's in the form of WebGL texture or WebGPU buffer), throw error.\n   */\n  readonly data: Tensor.DataTypeMap[T];\n  /**\n   * Get the location of the data.\n   */\n  readonly location: Tensor.DataLocation;\n  /**\n   * Get the WebGL texture that holds the tensor data.\n   *\n   * If the data is not on GPU as WebGL texture, throw error.\n   */\n  readonly texture: Tensor.TextureType;\n  /**\n   * Get the WebGPU buffer that holds the tensor data.\n   *\n   * If the data is not on GPU as WebGPU buffer, throw error.\n   */\n  readonly gpuBuffer: Tensor.GpuBufferType;\n\n  /**\n   * Get the WebNN MLTensor that holds the tensor data.\n   *\n   * If the data is not in a WebNN MLTensor, throw error.\n   */\n  readonly mlTensor: Tensor.MLTensorType;\n\n  /**\n   * Get the buffer data of the tensor.\n   *\n   * If the data is on CPU, returns the data immediately.\n   * If the data is on GPU, downloads the data and returns the promise.\n   *\n   * @param releaseData - whether release the data on GPU. Ignore if data is already on CPU.\n   */\n  getData(releaseData?: boolean): Promise<Tensor.DataTypeMap[T]>;\n\n  /**\n   * Dispose the tensor data.\n   *\n   * If the data is on CPU, remove its internal reference to the underlying data.\n   * If the data is on GPU, release the data on GPU.\n   *\n   * After calling this function, the tensor is considered no longer valid. Its location will be set to 'none'.\n   */\n  dispose(): void;\n}\n\nexport declare namespace Tensor {\n  interface DataTypeMap {\n    float32: Float32Array;\n    uint8: Uint8Array;\n    int8: Int8Array;\n    uint16: Uint16Array;\n    int16: Int16Array;\n    int32: Int32Array;\n    int64: BigInt64Array;\n    string: string[];\n    bool: Uint8Array;\n    float16: Uint16Array; // Keep using Uint16Array until we have a concrete solution for float 16.\n    float64: Float64Array;\n    uint32: Uint32Array;\n    uint64: BigUint64Array;\n    // complex64: never;\n    // complex128: never;\n    // bfloat16: never;\n    uint4: Uint8Array;\n    int4: Int8Array;\n  }\n\n  interface ElementTypeMap {\n    float32: number;\n    uint8: number;\n    int8: number;\n    uint16: number;\n    int16: number;\n    int32: number;\n    int64: bigint;\n    string: string;\n    bool: boolean;\n    float16: number; // Keep using Uint16Array until we have a concrete solution for float 16.\n    float64: number;\n    uint32: number;\n    uint64: bigint;\n    // complex64: never;\n    // complex128: never;\n    // bfloat16: never;\n    uint4: number;\n    int4: number;\n  }\n\n  type DataType = DataTypeMap[Type];\n  type ElementType = ElementTypeMap[Type];\n\n  /**\n   * supported data types for constructing a tensor from a pinned CPU buffer\n   */\n  export type CpuPinnedDataTypes = Exclude<Tensor.Type, 'string'>;\n\n  /**\n   * type alias for WebGL texture\n   */\n  export type TextureType = WebGLTexture;\n\n  /**\n   * supported data types for constructing a tensor from a WebGL texture\n   */\n  export type TextureDataTypes = 'float32';\n\n  type GpuBufferTypeFallback = { size: number; mapState: 'unmapped' | 'pending' | 'mapped' };\n  /**\n   * type alias for WebGPU buffer\n   */\n  export type GpuBufferType = TryGetGlobalType<'GPUBuffer', GpuBufferTypeFallback>;\n\n  type MLTensorTypeFallback = { destroy(): void };\n  /**\n   * type alias for WebNN MLTensor\n   *\n   * The specification for WebNN's MLTensor is currently in flux.\n   */\n  export type MLTensorType = TryGetGlobalType<'MLTensor', MLTensorTypeFallback>;\n\n  /**\n   * supported data types for constructing a tensor from a WebGPU buffer\n   */\n  export type GpuBufferDataTypes = 'float32' | 'float16' | 'int32' | 'int64' | 'uint32' | 'uint8' | 'bool';\n\n  /**\n   * supported data types for constructing a tensor from a WebNN MLTensor\n   */\n  export type MLTensorDataTypes =\n    | 'float32'\n    | 'float16'\n    | 'int8'\n    | 'uint8'\n    | 'int32'\n    | 'uint32'\n    | 'int64'\n    | 'uint64'\n    | 'bool'\n    | 'uint4'\n    | 'int4';\n\n  /**\n   * represent where the tensor data is stored\n   */\n  export type DataLocation = 'none' | 'cpu' | 'cpu-pinned' | 'texture' | 'gpu-buffer' | 'ml-tensor';\n\n  /**\n   * represent the data type of a tensor\n   */\n  export type Type = keyof DataTypeMap;\n}\n\n/**\n * Represent multi-dimensional arrays to feed to or fetch from model inferencing.\n */\nexport interface TypedTensor<T extends Tensor.Type> extends TypedTensorBase<T>, TypedTensorUtils<T> {}\n/**\n * Represent multi-dimensional arrays to feed to or fetch from model inferencing.\n */\nexport interface Tensor extends TypedTensorBase<Tensor.Type>, TypedTensorUtils<Tensor.Type> {}\n\n/**\n * type TensorConstructor defines the constructors of 'Tensor' to create CPU tensor instances.\n */\nexport interface TensorConstructor extends TensorFactory {\n  // #region CPU tensor - specify element type\n  /**\n   * Construct a new string tensor object from the given type, data and dims.\n   *\n   * @param type - Specify the element type.\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (\n    type: 'string',\n    data: Tensor.DataTypeMap['string'] | readonly string[],\n    dims?: readonly number[],\n  ): TypedTensor<'string'>;\n\n  /**\n   * Construct a new bool tensor object from the given type, data and dims.\n   *\n   * @param type - Specify the element type.\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (\n    type: 'bool',\n    data: Tensor.DataTypeMap['bool'] | readonly boolean[],\n    dims?: readonly number[],\n  ): TypedTensor<'bool'>;\n\n  /**\n   * Construct a new uint8 tensor object from a Uint8ClampedArray, data and dims.\n   *\n   * @param type - Specify the element type.\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (type: 'uint8', data: Uint8ClampedArray, dims?: readonly number[]): TypedTensor<'uint8'>;\n\n  /**\n   * Construct a new 64-bit integer typed tensor object from the given type, data and dims.\n   *\n   * @param type - Specify the element type.\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new <T extends 'uint64' | 'int64'>(\n    type: T,\n    data: Tensor.DataTypeMap[T] | readonly bigint[] | readonly number[],\n    dims?: readonly number[],\n  ): TypedTensor<T>;\n\n  /**\n   * Construct a new numeric tensor object from the given type, data and dims.\n   *\n   * @param type - Specify the element type.\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new <T extends Exclude<Tensor.Type, 'string' | 'bool' | 'uint64' | 'int64'>>(\n    type: T,\n    data: Tensor.DataTypeMap[T] | readonly number[],\n    dims?: readonly number[],\n  ): TypedTensor<T>;\n  // #endregion\n\n  // #region CPU tensor - infer element types\n\n  /**\n   * Construct a new float32 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: Float32Array, dims?: readonly number[]): TypedTensor<'float32'>;\n\n  /**\n   * Construct a new int8 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: Int8Array, dims?: readonly number[]): TypedTensor<'int8'>;\n\n  /**\n   * Construct a new uint8 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: Uint8Array, dims?: readonly number[]): TypedTensor<'uint8'>;\n\n  /**\n   * Construct a new uint8 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: Uint8ClampedArray, dims?: readonly number[]): TypedTensor<'uint8'>;\n\n  /**\n   * Construct a new uint16 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: Uint16Array, dims?: readonly number[]): TypedTensor<'uint16'>;\n\n  /**\n   * Construct a new int16 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: Int16Array, dims?: readonly number[]): TypedTensor<'int16'>;\n\n  /**\n   * Construct a new int32 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: Int32Array, dims?: readonly number[]): TypedTensor<'int32'>;\n\n  /**\n   * Construct a new int64 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: BigInt64Array, dims?: readonly number[]): TypedTensor<'int64'>;\n\n  /**\n   * Construct a new string tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: readonly string[], dims?: readonly number[]): TypedTensor<'string'>;\n\n  /**\n   * Construct a new bool tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: readonly boolean[], dims?: readonly number[]): TypedTensor<'bool'>;\n\n  /**\n   * Construct a new float64 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: Float64Array, dims?: readonly number[]): TypedTensor<'float64'>;\n\n  /**\n   * Construct a new uint32 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: Uint32Array, dims?: readonly number[]): TypedTensor<'uint32'>;\n\n  /**\n   * Construct a new uint64 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: BigUint64Array, dims?: readonly number[]): TypedTensor<'uint64'>;\n\n  // #endregion\n\n  // #region CPU tensor - fall back to non-generic tensor type declaration\n\n  /**\n   * Construct a new tensor object from the given type, data and dims.\n   *\n   * @param type - Specify the element type.\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (\n    type: Tensor.Type,\n    data: Tensor.DataType | readonly number[] | readonly string[] | readonly bigint[] | readonly boolean[],\n    dims?: readonly number[],\n  ): Tensor;\n\n  /**\n   * Construct a new tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: Tensor.DataType, dims?: readonly number[]): Tensor;\n  // #endregion\n}\n\n// eslint-disable-next-line @typescript-eslint/naming-convention\nexport const Tensor = TensorImpl as TensorConstructor;\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { env } from './env-impl.js';\n\n/**\n * @ignore\n */\nexport const TRACE = (deviceType: string, label: string) => {\n  if (typeof env.trace === 'undefined' ? !env.wasm.trace : !env.trace) {\n    return;\n  }\n  // eslint-disable-next-line no-console\n  console.timeStamp(`${deviceType}::ORT::${label}`);\n};\n\nconst TRACE_FUNC = (msg: string, extraMsg?: string) => {\n  const stack = new Error().stack?.split(/\\r\\n|\\r|\\n/g) || [];\n  let hasTraceFunc = false;\n  for (let i = 0; i < stack.length; i++) {\n    if (hasTraceFunc && !stack[i].includes('TRACE_FUNC')) {\n      let label = `FUNC_${msg}::${stack[i].trim().split(' ')[1]}`;\n      if (extraMsg) {\n        label += `::${extraMsg}`;\n      }\n      TRACE('CPU', label);\n      return;\n    }\n    if (stack[i].includes('TRACE_FUNC')) {\n      hasTraceFunc = true;\n    }\n  }\n};\n\n/**\n * @ignore\n */\nexport const TRACE_FUNC_BEGIN = (extraMsg?: string) => {\n  if (typeof env.trace === 'undefined' ? !env.wasm.trace : !env.trace) {\n    return;\n  }\n  TRACE_FUNC('BEGIN', extraMsg);\n};\n\n/**\n * @ignore\n */\nexport const TRACE_FUNC_END = (extraMsg?: string) => {\n  if (typeof env.trace === 'undefined' ? !env.wasm.trace : !env.trace) {\n    return;\n  }\n  TRACE_FUNC('END', extraMsg);\n};\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { resolveBackendAndExecutionProviders } from './backend-impl.js';\nimport { InferenceSessionHandler } from './backend.js';\nimport { InferenceSession as InferenceSessionInterface } from './inference-session.js';\nimport { OnnxValue } from './onnx-value.js';\nimport { Tensor } from './tensor.js';\nimport { TRACE_FUNC_BEGIN, TRACE_FUNC_END } from './trace.js';\n\ntype SessionOptions = InferenceSessionInterface.SessionOptions;\ntype RunOptions = InferenceSessionInterface.RunOptions;\ntype FeedsType = InferenceSessionInterface.FeedsType;\ntype FetchesType = InferenceSessionInterface.FetchesType;\ntype ReturnType = InferenceSessionInterface.ReturnType;\n\nexport class InferenceSession implements InferenceSessionInterface {\n  private constructor(handler: InferenceSessionHandler) {\n    this.handler = handler;\n  }\n  run(feeds: FeedsType, options?: RunOptions): Promise<ReturnType>;\n  run(feeds: FeedsType, fetches: FetchesType, options?: RunOptions): Promise<ReturnType>;\n  async run(feeds: FeedsType, arg1?: FetchesType | RunOptions, arg2?: RunOptions): Promise<ReturnType> {\n    TRACE_FUNC_BEGIN();\n    const fetches: { [name: string]: OnnxValue | null } = {};\n    let options: RunOptions = {};\n    // check inputs\n    if (typeof feeds !== 'object' || feeds === null || feeds instanceof Tensor || Array.isArray(feeds)) {\n      throw new TypeError(\n        \"'feeds' must be an object that use input names as keys and OnnxValue as corresponding values.\",\n      );\n    }\n\n    let isFetchesEmpty = true;\n    // determine which override is being used\n    if (typeof arg1 === 'object') {\n      if (arg1 === null) {\n        throw new TypeError('Unexpected argument[1]: cannot be null.');\n      }\n      if (arg1 instanceof Tensor) {\n        throw new TypeError(\"'fetches' cannot be a Tensor\");\n      }\n\n      if (Array.isArray(arg1)) {\n        if (arg1.length === 0) {\n          throw new TypeError(\"'fetches' cannot be an empty array.\");\n        }\n        isFetchesEmpty = false;\n        // output names\n        for (const name of arg1) {\n          if (typeof name !== 'string') {\n            throw new TypeError(\"'fetches' must be a string array or an object.\");\n          }\n          if (this.outputNames.indexOf(name) === -1) {\n            throw new RangeError(`'fetches' contains invalid output name: ${name}.`);\n          }\n          fetches[name] = null;\n        }\n\n        if (typeof arg2 === 'object' && arg2 !== null) {\n          options = arg2;\n        } else if (typeof arg2 !== 'undefined') {\n          throw new TypeError(\"'options' must be an object.\");\n        }\n      } else {\n        // decide whether arg1 is fetches or options\n        // if any output name is present and its value is valid OnnxValue, we consider it fetches\n        let isFetches = false;\n        const arg1Keys = Object.getOwnPropertyNames(arg1);\n        for (const name of this.outputNames) {\n          if (arg1Keys.indexOf(name) !== -1) {\n            const v = (arg1 as InferenceSessionInterface.NullableOnnxValueMapType)[name];\n            if (v === null || v instanceof Tensor) {\n              isFetches = true;\n              isFetchesEmpty = false;\n              fetches[name] = v;\n            }\n          }\n        }\n\n        if (isFetches) {\n          if (typeof arg2 === 'object' && arg2 !== null) {\n            options = arg2;\n          } else if (typeof arg2 !== 'undefined') {\n            throw new TypeError(\"'options' must be an object.\");\n          }\n        } else {\n          options = arg1 as RunOptions;\n        }\n      }\n    } else if (typeof arg1 !== 'undefined') {\n      throw new TypeError(\"Unexpected argument[1]: must be 'fetches' or 'options'.\");\n    }\n\n    // check if all inputs are in feed\n    for (const name of this.inputNames) {\n      if (typeof feeds[name] === 'undefined') {\n        throw new Error(`input '${name}' is missing in 'feeds'.`);\n      }\n    }\n\n    // if no fetches is specified, we use the full output names list\n    if (isFetchesEmpty) {\n      for (const name of this.outputNames) {\n        fetches[name] = null;\n      }\n    }\n\n    // feeds, fetches and options are prepared\n\n    const results = await this.handler.run(feeds, fetches, options);\n    const returnValue: { [name: string]: OnnxValue } = {};\n    for (const key in results) {\n      if (Object.hasOwnProperty.call(results, key)) {\n        const result = results[key];\n        if (result instanceof Tensor) {\n          returnValue[key] = result;\n        } else {\n          returnValue[key] = new Tensor(result.type, result.data, result.dims);\n        }\n      }\n    }\n    TRACE_FUNC_END();\n    return returnValue;\n  }\n\n  async release(): Promise<void> {\n    return this.handler.dispose();\n  }\n\n  static create(path: string, options?: SessionOptions): Promise<InferenceSessionInterface>;\n  static create(buffer: ArrayBufferLike, options?: SessionOptions): Promise<InferenceSessionInterface>;\n  static create(\n    buffer: ArrayBufferLike,\n    byteOffset: number,\n    byteLength?: number,\n    options?: SessionOptions,\n  ): Promise<InferenceSessionInterface>;\n  static create(buffer: Uint8Array, options?: SessionOptions): Promise<InferenceSessionInterface>;\n  static async create(\n    arg0: string | ArrayBufferLike | Uint8Array,\n    arg1?: SessionOptions | number,\n    arg2?: number,\n    arg3?: SessionOptions,\n  ): Promise<InferenceSessionInterface> {\n    TRACE_FUNC_BEGIN();\n    // either load from a file or buffer\n    let filePathOrUint8Array: string | Uint8Array;\n    let options: SessionOptions = {};\n\n    if (typeof arg0 === 'string') {\n      filePathOrUint8Array = arg0;\n      if (typeof arg1 === 'object' && arg1 !== null) {\n        options = arg1;\n      } else if (typeof arg1 !== 'undefined') {\n        throw new TypeError(\"'options' must be an object.\");\n      }\n    } else if (arg0 instanceof Uint8Array) {\n      filePathOrUint8Array = arg0;\n      if (typeof arg1 === 'object' && arg1 !== null) {\n        options = arg1;\n      } else if (typeof arg1 !== 'undefined') {\n        throw new TypeError(\"'options' must be an object.\");\n      }\n    } else if (\n      arg0 instanceof ArrayBuffer ||\n      (typeof SharedArrayBuffer !== 'undefined' && arg0 instanceof SharedArrayBuffer)\n    ) {\n      const buffer = arg0;\n      let byteOffset = 0;\n      let byteLength = arg0.byteLength;\n      if (typeof arg1 === 'object' && arg1 !== null) {\n        options = arg1;\n      } else if (typeof arg1 === 'number') {\n        byteOffset = arg1;\n        if (!Number.isSafeInteger(byteOffset)) {\n          throw new RangeError(\"'byteOffset' must be an integer.\");\n        }\n        if (byteOffset < 0 || byteOffset >= buffer.byteLength) {\n          throw new RangeError(`'byteOffset' is out of range [0, ${buffer.byteLength}).`);\n        }\n        byteLength = arg0.byteLength - byteOffset;\n        if (typeof arg2 === 'number') {\n          byteLength = arg2;\n          if (!Number.isSafeInteger(byteLength)) {\n            throw new RangeError(\"'byteLength' must be an integer.\");\n          }\n          if (byteLength <= 0 || byteOffset + byteLength > buffer.byteLength) {\n            throw new RangeError(`'byteLength' is out of range (0, ${buffer.byteLength - byteOffset}].`);\n          }\n          if (typeof arg3 === 'object' && arg3 !== null) {\n            options = arg3;\n          } else if (typeof arg3 !== 'undefined') {\n            throw new TypeError(\"'options' must be an object.\");\n          }\n        } else if (typeof arg2 !== 'undefined') {\n          throw new TypeError(\"'byteLength' must be a number.\");\n        }\n      } else if (typeof arg1 !== 'undefined') {\n        throw new TypeError(\"'options' must be an object.\");\n      }\n      filePathOrUint8Array = new Uint8Array(buffer, byteOffset, byteLength);\n    } else {\n      throw new TypeError(\"Unexpected argument[0]: must be 'path' or 'buffer'.\");\n    }\n\n    // resolve backend, update session options with validated EPs, and create session handler\n    const [backend, optionsWithValidatedEPs] = await resolveBackendAndExecutionProviders(options);\n    const handler = await backend.createInferenceSessionHandler(filePathOrUint8Array, optionsWithValidatedEPs);\n    TRACE_FUNC_END();\n    return new InferenceSession(handler);\n  }\n\n  startProfiling(): void {\n    this.handler.startProfiling();\n  }\n  endProfiling(): void {\n    this.handler.endProfiling();\n  }\n\n  get inputNames(): readonly string[] {\n    return this.handler.inputNames;\n  }\n  get outputNames(): readonly string[] {\n    return this.handler.outputNames;\n  }\n\n  get inputMetadata(): readonly InferenceSessionInterface.ValueMetadata[] {\n    return this.handler.inputMetadata;\n  }\n\n  get outputMetadata(): readonly InferenceSessionInterface.ValueMetadata[] {\n    return this.handler.outputMetadata;\n  }\n\n  private handler: InferenceSessionHandler;\n}\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { InferenceSession as InferenceSessionImpl } from './inference-session-impl.js';\nimport { OnnxModelOptions } from './onnx-model.js';\nimport { OnnxValue, OnnxValueDataLocation } from './onnx-value.js';\nimport type { Tensor } from './tensor.js';\nimport { TryGetGlobalType } from './type-helper.js';\n\n/* eslint-disable @typescript-eslint/no-redeclare */\n\nexport declare namespace InferenceSession {\n  // #region input/output types\n\n  type OnnxValueMapType = { readonly [name: string]: OnnxValue };\n  type NullableOnnxValueMapType = { readonly [name: string]: OnnxValue | null };\n\n  /**\n   * A feeds (model inputs) is an object that uses input names as keys and OnnxValue as corresponding values.\n   */\n  type FeedsType = OnnxValueMapType;\n\n  /**\n   * A fetches (model outputs) could be one of the following:\n   *\n   * - Omitted. Use model's output names definition.\n   * - An array of string indicating the output names.\n   * - An object that use output names as keys and OnnxValue or null as corresponding values.\n   *\n   * @remark\n   * different from input argument, in output, OnnxValue is optional. If an OnnxValue is present it will be\n   * used as a pre-allocated value by the inference engine; if omitted, inference engine will allocate buffer\n   * internally.\n   */\n  type FetchesType = readonly string[] | NullableOnnxValueMapType;\n\n  /**\n   * A inferencing return type is an object that uses output names as keys and OnnxValue as corresponding values.\n   */\n  type ReturnType = OnnxValueMapType;\n\n  // #endregion\n\n  // #region session options\n\n  /**\n   * A set of configurations for session behavior.\n   */\n  export interface SessionOptions extends OnnxModelOptions {\n    /**\n     * An array of execution provider options.\n     *\n     * An execution provider option can be a string indicating the name of the execution provider,\n     * or an object of corresponding type.\n     */\n    executionProviders?: readonly ExecutionProviderConfig[];\n\n    /**\n     * The intra OP threads number.\n     *\n     * This setting is available only in ONNXRuntime (Node.js binding and react-native).\n     */\n    intraOpNumThreads?: number;\n\n    /**\n     * The inter OP threads number.\n     *\n     * This setting is available only in ONNXRuntime (Node.js binding and react-native).\n     */\n    interOpNumThreads?: number;\n\n    /**\n     * The free dimension override.\n     *\n     * This setting is available only in ONNXRuntime (Node.js binding and react-native) or WebAssembly backend\n     */\n    freeDimensionOverrides?: { readonly [dimensionName: string]: number };\n\n    /**\n     * The optimization level.\n     *\n     * This setting is available only in ONNXRuntime (Node.js binding and react-native) or WebAssembly backend\n     */\n    graphOptimizationLevel?: 'disabled' | 'basic' | 'extended' | 'all';\n\n    /**\n     * Whether enable CPU memory arena.\n     *\n     * This setting is available only in ONNXRuntime (Node.js binding and react-native) or WebAssembly backend\n     */\n    enableCpuMemArena?: boolean;\n\n    /**\n     * Whether enable memory pattern.\n     *\n     * This setting is available only in ONNXRuntime (Node.js binding and react-native) or WebAssembly backend\n     */\n    enableMemPattern?: boolean;\n\n    /**\n     * Execution mode.\n     *\n     * This setting is available only in ONNXRuntime (Node.js binding and react-native) or WebAssembly backend\n     */\n    executionMode?: 'sequential' | 'parallel';\n\n    /**\n     * Optimized model file path.\n     *\n     * If this setting is specified, the optimized model will be dumped. In browser, a blob will be created\n     * with a pop-up window.\n     */\n    optimizedModelFilePath?: string;\n\n    /**\n     * Whether enable profiling.\n     *\n     * This setting is a placeholder for a future use.\n     */\n    enableProfiling?: boolean;\n\n    /**\n     * File prefix for profiling.\n     *\n     * This setting is a placeholder for a future use.\n     */\n    profileFilePrefix?: string;\n\n    /**\n     * Log ID.\n     *\n     * This setting is available only in ONNXRuntime (Node.js binding and react-native) or WebAssembly backend\n     */\n    logId?: string;\n\n    /**\n     * Log severity level. See\n     * https://github.com/microsoft/onnxruntime/blob/main/include/onnxruntime/core/common/logging/severity.h\n     *\n     * This setting is available only in ONNXRuntime (Node.js binding and react-native) or WebAssembly backend\n     */\n    logSeverityLevel?: 0 | 1 | 2 | 3 | 4;\n\n    /**\n     * Log verbosity level.\n     *\n     * This setting is available only in WebAssembly backend. Will support Node.js binding and react-native later\n     */\n    logVerbosityLevel?: number;\n\n    /**\n     * Specify string as a preferred data location for all outputs, or an object that use output names as keys and a\n     * preferred data location as corresponding values.\n     *\n     * This setting is available only in ONNXRuntime Web for WebGL and WebGPU EP.\n     */\n    preferredOutputLocation?: OnnxValueDataLocation | { readonly [outputName: string]: OnnxValueDataLocation };\n\n    /**\n     * Whether enable graph capture.\n     * This setting is available only in ONNXRuntime Web for WebGPU EP.\n     */\n    enableGraphCapture?: boolean;\n\n    /**\n     * Store configurations for a session. See\n     * https://github.com/microsoft/onnxruntime/blob/main/include/onnxruntime/core/session/\n     * onnxruntime_session_options_config_keys.h\n     *\n     * This setting is available only in WebAssembly backend. Will support Node.js binding and react-native later\n     *\n     * @example\n     * ```js\n     * extra: {\n     *   session: {\n     *     set_denormal_as_zero: \"1\",\n     *     disable_prepacking: \"1\"\n     *   },\n     *   optimization: {\n     *     enable_gelu_approximation: \"1\"\n     *   }\n     * }\n     * ```\n     */\n    extra?: Record<string, unknown>;\n  }\n\n  // #region execution providers\n\n  // Currently, we have the following backends to support execution providers:\n  // Backend Node.js binding: supports 'cpu', 'dml' (win32), 'coreml' (macOS) and 'cuda' (linux).\n  // Backend WebAssembly: supports 'cpu', 'wasm', 'webgpu' and 'webnn'.\n  // Backend ONNX.js: supports 'webgl'.\n  // Backend React Native: supports 'cpu', 'xnnpack', 'coreml' (iOS), 'nnapi' (Android).\n  interface ExecutionProviderOptionMap {\n    coreml: CoreMLExecutionProviderOption;\n    cpu: CpuExecutionProviderOption;\n    cuda: CudaExecutionProviderOption;\n    dml: DmlExecutionProviderOption;\n    nnapi: NnapiExecutionProviderOption;\n    tensorrt: TensorRtExecutionProviderOption;\n    wasm: WebAssemblyExecutionProviderOption;\n    webgl: WebGLExecutionProviderOption;\n    webgpu: WebGpuExecutionProviderOption;\n    webnn: WebNNExecutionProviderOption;\n    qnn: QnnExecutionProviderOption;\n    xnnpack: XnnpackExecutionProviderOption;\n  }\n\n  type ExecutionProviderName = keyof ExecutionProviderOptionMap;\n  type ExecutionProviderConfig =\n    | ExecutionProviderOptionMap[ExecutionProviderName]\n    | ExecutionProviderOption\n    | ExecutionProviderName\n    | string;\n\n  export interface ExecutionProviderOption {\n    readonly name: string;\n  }\n  export interface CpuExecutionProviderOption extends ExecutionProviderOption {\n    readonly name: 'cpu';\n    useArena?: boolean;\n  }\n  export interface CudaExecutionProviderOption extends ExecutionProviderOption {\n    readonly name: 'cuda';\n    deviceId?: number;\n  }\n  export interface DmlExecutionProviderOption extends ExecutionProviderOption {\n    readonly name: 'dml';\n    deviceId?: number;\n  }\n  export interface TensorRtExecutionProviderOption extends ExecutionProviderOption {\n    readonly name: 'tensorrt';\n    deviceId?: number;\n  }\n  export interface WebAssemblyExecutionProviderOption extends ExecutionProviderOption {\n    readonly name: 'wasm';\n  }\n  export interface WebGLExecutionProviderOption extends ExecutionProviderOption {\n    readonly name: 'webgl';\n    // TODO: add flags\n  }\n  export interface XnnpackExecutionProviderOption extends ExecutionProviderOption {\n    readonly name: 'xnnpack';\n  }\n  export interface WebGpuExecutionProviderOption extends ExecutionProviderOption {\n    readonly name: 'webgpu';\n    preferredLayout?: 'NCHW' | 'NHWC';\n  }\n\n  // #region WebNN options\n\n  interface WebNNExecutionProviderName extends ExecutionProviderOption {\n    readonly name: 'webnn';\n  }\n\n  /**\n   * Represents a set of options for creating a WebNN MLContext.\n   *\n   * @see https://www.w3.org/TR/webnn/#dictdef-mlcontextoptions\n   */\n  export interface WebNNContextOptions {\n    deviceType?: 'cpu' | 'gpu' | 'npu';\n    numThreads?: number;\n    powerPreference?: 'default' | 'low-power' | 'high-performance';\n  }\n\n  /**\n   * Represents a set of options for WebNN execution provider without MLContext.\n   */\n  export interface WebNNOptionsWithoutMLContext extends WebNNExecutionProviderName, WebNNContextOptions {\n    context?: never;\n  }\n\n  /**\n   * Represents a set of options for WebNN execution provider with MLContext.\n   *\n   * When MLContext is provided, the deviceType is also required so that the WebNN EP can determine the preferred\n   * channel layout.\n   *\n   * @see https://www.w3.org/TR/webnn/#dom-ml-createcontext\n   */\n  export interface WebNNOptionsWithMLContext\n    extends WebNNExecutionProviderName,\n      Omit<WebNNContextOptions, 'deviceType'>,\n      Required<Pick<WebNNContextOptions, 'deviceType'>> {\n    context: TryGetGlobalType<'MLContext'>;\n  }\n\n  /**\n   * Represents a set of options for WebNN execution provider with MLContext which is created from GPUDevice.\n   *\n   * @see https://www.w3.org/TR/webnn/#dom-ml-createcontext-gpudevice\n   */\n  export interface WebNNOptionsWebGpu extends WebNNExecutionProviderName {\n    context: TryGetGlobalType<'MLContext'>;\n    gpuDevice: TryGetGlobalType<'GPUDevice'>;\n  }\n\n  /**\n   * Options for WebNN execution provider.\n   */\n  export type WebNNExecutionProviderOption =\n    | WebNNOptionsWithoutMLContext\n    | WebNNOptionsWithMLContext\n    | WebNNOptionsWebGpu;\n\n  // #endregion\n\n  export interface QnnExecutionProviderOption extends ExecutionProviderOption {\n    readonly name: 'qnn';\n    /**\n     * Specify the QNN backend type. E.g., 'cpu' or 'htp'.\n     * Mutually exclusive with `backendPath`.\n     *\n     * @default 'htp'\n     */\n    backendType?: string;\n    /**\n     * Specify a path to the QNN backend library.\n     * Mutually exclusive with `backendType`.\n     */\n    backendPath?: string;\n    /**\n     * Specify whether to enable HTP FP16 precision.\n     *\n     * @default true\n     */\n    enableFp16Precision?: boolean;\n  }\n  export interface CoreMLExecutionProviderOption extends ExecutionProviderOption {\n    readonly name: 'coreml';\n    /**\n     * The bit flags for CoreML execution provider.\n     *\n     * ```\n     * COREML_FLAG_USE_CPU_ONLY = 0x001\n     * COREML_FLAG_ENABLE_ON_SUBGRAPH = 0x002\n     * COREML_FLAG_ONLY_ENABLE_DEVICE_WITH_ANE = 0x004\n     * COREML_FLAG_ONLY_ALLOW_STATIC_INPUT_SHAPES = 0x008\n     * COREML_FLAG_CREATE_MLPROGRAM = 0x010\n     * COREML_FLAG_USE_CPU_AND_GPU = 0x020\n     * ```\n     *\n     * See include/onnxruntime/core/providers/coreml/coreml_provider_factory.h for more details.\n     *\n     * This flag is available only in ONNXRuntime (Node.js binding).\n     */\n    coreMlFlags?: number;\n    /**\n     * Specify whether to use CPU only in CoreML EP.\n     *\n     * This setting is available only in ONNXRuntime (react-native).\n     */\n    useCPUOnly?: boolean;\n    useCPUAndGPU?: boolean;\n    /**\n     * Specify whether to enable CoreML EP on subgraph.\n     *\n     * This setting is available only in ONNXRuntime (react-native).\n     */\n    enableOnSubgraph?: boolean;\n    /**\n     * Specify whether to only enable CoreML EP for Apple devices with ANE (Apple Neural Engine).\n     *\n     * This setting is available only in ONNXRuntime (react-native).\n     */\n    onlyEnableDeviceWithANE?: boolean;\n  }\n  export interface NnapiExecutionProviderOption extends ExecutionProviderOption {\n    readonly name: 'nnapi';\n    useFP16?: boolean;\n    useNCHW?: boolean;\n    cpuDisabled?: boolean;\n    cpuOnly?: boolean;\n  }\n  // #endregion\n\n  // #endregion\n\n  // #region run options\n\n  /**\n   * A set of configurations for inference run behavior\n   */\n  export interface RunOptions {\n    /**\n     * Log severity level. See\n     * https://github.com/microsoft/onnxruntime/blob/main/include/onnxruntime/core/common/logging/severity.h\n     *\n     * This setting is available only in ONNXRuntime (Node.js binding and react-native) or WebAssembly backend\n     */\n    logSeverityLevel?: 0 | 1 | 2 | 3 | 4;\n\n    /**\n     * Log verbosity level.\n     *\n     * This setting is available only in WebAssembly backend. Will support Node.js binding and react-native later\n     */\n    logVerbosityLevel?: number;\n\n    /**\n     * Terminate all incomplete OrtRun calls as soon as possible if true\n     *\n     * This setting is available only in WebAssembly backend. Will support Node.js binding and react-native later\n     */\n    terminate?: boolean;\n\n    /**\n     * A tag for the Run() calls using this\n     *\n     * This setting is available only in ONNXRuntime (Node.js binding and react-native) or WebAssembly backend\n     */\n    tag?: string;\n\n    /**\n     * Set a single run configuration entry. See\n     * https://github.com/microsoft/onnxruntime/blob/main/include/onnxruntime/core/session/\n     * onnxruntime_run_options_config_keys.h\n     *\n     * This setting is available only in WebAssembly backend. Will support Node.js binding and react-native later\n     *\n     * @example\n     *\n     * ```js\n     * extra: {\n     *   memory: {\n     *     enable_memory_arena_shrinkage: \"1\",\n     *   }\n     * }\n     * ```\n     */\n    extra?: Record<string, unknown>;\n  }\n\n  // #endregion\n\n  // #region value metadata\n\n  /**\n   * The common part of the value metadata type for both tensor and non-tensor values.\n   */\n  export interface ValueMetadataBase {\n    /**\n     * The name of the specified input or output.\n     */\n    readonly name: string;\n  }\n\n  /**\n   * Represents the metadata of a non-tensor value.\n   */\n  export interface NonTensorValueMetadata extends ValueMetadataBase {\n    /**\n     * Get a value indicating whether the value is a tensor.\n     */\n    readonly isTensor: false;\n  }\n\n  /**\n   * Represents the metadata of a tensor value.\n   */\n  export interface TensorValueMetadata extends ValueMetadataBase {\n    /**\n     * Get a value indicating whether the value is a tensor.\n     */\n    readonly isTensor: true;\n    /**\n     * Get the data type of the tensor.\n     */\n    readonly type: Tensor.Type;\n    /**\n     * Get the shape of the tensor.\n     *\n     * If the shape is not defined, the value will an empty array. Otherwise, it will be an array representing the shape\n     * of the tensor. Each element in the array can be a number or a string. If the element is a number, it represents\n     * the corresponding dimension size. If the element is a string, it represents a symbolic dimension.\n     */\n    readonly shape: ReadonlyArray<number | string>;\n  }\n\n  /**\n   * Represents the metadata of a value.\n   */\n  export type ValueMetadata = NonTensorValueMetadata | TensorValueMetadata;\n\n  // #endregion\n}\n\n/**\n * Represent a runtime instance of an ONNX model.\n */\nexport interface InferenceSession {\n  // #region run()\n\n  /**\n   * Execute the model asynchronously with the given feeds and options.\n   *\n   * @param feeds - Representation of the model input. See type description of `InferenceSession.InputType` for detail.\n   * @param options - Optional. A set of options that controls the behavior of model inference.\n   * @returns A promise that resolves to a map, which uses output names as keys and OnnxValue as corresponding values.\n   */\n  run(feeds: InferenceSession.FeedsType, options?: InferenceSession.RunOptions): Promise<InferenceSession.ReturnType>;\n\n  /**\n   * Execute the model asynchronously with the given feeds, fetches and options.\n   *\n   * @param feeds - Representation of the model input. See type description of `InferenceSession.InputType` for detail.\n   * @param fetches - Representation of the model output. See type description of `InferenceSession.OutputType` for\n   * detail.\n   * @param options - Optional. A set of options that controls the behavior of model inference.\n   * @returns A promise that resolves to a map, which uses output names as keys and OnnxValue as corresponding values.\n   */\n  run(\n    feeds: InferenceSession.FeedsType,\n    fetches: InferenceSession.FetchesType,\n    options?: InferenceSession.RunOptions,\n  ): Promise<InferenceSession.ReturnType>;\n\n  // #endregion\n\n  // #region release()\n\n  /**\n   * Release the inference session and the underlying resources.\n   */\n  release(): Promise<void>;\n\n  // #endregion\n\n  // #region profiling\n\n  /**\n   * Start profiling.\n   */\n  startProfiling(): void;\n\n  /**\n   * End profiling.\n   */\n  endProfiling(): void;\n\n  // #endregion\n\n  // #region metadata\n\n  /**\n   * Get input names of the loaded model.\n   */\n  readonly inputNames: readonly string[];\n\n  /**\n   * Get output names of the loaded model.\n   */\n  readonly outputNames: readonly string[];\n\n  /**\n   * Get input metadata of the loaded model.\n   */\n  readonly inputMetadata: readonly InferenceSession.ValueMetadata[];\n\n  /**\n   * Get output metadata of the loaded model.\n   */\n  readonly outputMetadata: readonly InferenceSession.ValueMetadata[];\n\n  // #endregion\n}\n\nexport interface InferenceSessionFactory {\n  // #region create()\n\n  /**\n   * Create a new inference session and load model asynchronously from an ONNX model file.\n   *\n   * @param uri - The URI or file path of the model to load.\n   * @param options - specify configuration for creating a new inference session.\n   * @returns A promise that resolves to an InferenceSession object.\n   */\n  create(uri: string, options?: InferenceSession.SessionOptions): Promise<InferenceSession>;\n\n  /**\n   * Create a new inference session and load model asynchronously from an array bufer.\n   *\n   * @param buffer - An ArrayBuffer representation of an ONNX model.\n   * @param options - specify configuration for creating a new inference session.\n   * @returns A promise that resolves to an InferenceSession object.\n   */\n  create(buffer: ArrayBufferLike, options?: InferenceSession.SessionOptions): Promise<InferenceSession>;\n\n  /**\n   * Create a new inference session and load model asynchronously from segment of an array bufer.\n   *\n   * @param buffer - An ArrayBuffer representation of an ONNX model.\n   * @param byteOffset - The beginning of the specified portion of the array buffer.\n   * @param byteLength - The length in bytes of the array buffer.\n   * @param options - specify configuration for creating a new inference session.\n   * @returns A promise that resolves to an InferenceSession object.\n   */\n  create(\n    buffer: ArrayBufferLike,\n    byteOffset: number,\n    byteLength?: number,\n    options?: InferenceSession.SessionOptions,\n  ): Promise<InferenceSession>;\n\n  /**\n   * Create a new inference session and load model asynchronously from a Uint8Array.\n   *\n   * @param buffer - A Uint8Array representation of an ONNX model.\n   * @param options - specify configuration for creating a new inference session.\n   * @returns A promise that resolves to an InferenceSession object.\n   */\n  create(buffer: Uint8Array, options?: InferenceSession.SessionOptions): Promise<InferenceSession>;\n\n  // #endregion\n}\n\n// eslint-disable-next-line @typescript-eslint/naming-convention\nexport const InferenceSession: InferenceSessionFactory = InferenceSessionImpl;\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nexport const isNode = !!(typeof process !== 'undefined' && process.versions && process.versions.node);\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport type { OrtWasmModule } from './wasm-types';\nimport { isNode } from './wasm-utils-env';\n\n/**\n * The origin of the current location.\n *\n * In Node.js, this is undefined.\n */\nconst origin = isNode || typeof location === 'undefined' ? undefined : location.origin;\n\n/**\n * Some bundlers (eg. Webpack) will rewrite `import.meta.url` to a file URL at compile time.\n *\n * This function checks if `import.meta.url` starts with `file:`, but using the `>` and `<` operators instead of\n * `startsWith` function so that code minimizers can remove the dead code correctly.\n *\n * For example, if we use terser to minify the following code:\n * ```js\n * if (\"file://hard-coded-filename\".startsWith(\"file:\")) {\n *   console.log(1)\n * } else {\n *   console.log(2)\n * }\n *\n * if (\"file://hard-coded-filename\" > \"file:\" && \"file://hard-coded-filename\" < \"file;\") {\n *   console.log(3)\n * } else {\n *   console.log(4)\n * }\n * ```\n *\n * The minified code will be:\n * ```js\n * \"file://hard-coded-filename\".startsWith(\"file:\")?console.log(1):console.log(2),console.log(3);\n * ```\n *\n * (use Terser 5.39.0 with default options, https://try.terser.org/)\n *\n * @returns true if the import.meta.url is hardcoded as a file URI.\n */\nexport const isEsmImportMetaUrlHardcodedAsFileUri =\n  BUILD_DEFS.IS_ESM && BUILD_DEFS.ESM_IMPORT_META_URL! > 'file:' && BUILD_DEFS.ESM_IMPORT_META_URL! < 'file;';\n\nconst getScriptSrc = (): string | undefined => {\n  // if Nodejs, return undefined\n  if (isNode) {\n    return undefined;\n  }\n  // if It's ESM, use import.meta.url\n  if (BUILD_DEFS.IS_ESM) {\n    // For ESM, if the import.meta.url is a file URL, this usually means the bundler rewrites `import.meta.url` to\n    // the file path at compile time. In this case, this file path cannot be used to determine the runtime URL.\n    //\n    // We need to use the URL constructor like this:\n    // ```js\n    // new URL('actual-bundle-name.js', import.meta.url).href\n    // ```\n    // So that bundler can preprocess the URL correctly.\n    if (isEsmImportMetaUrlHardcodedAsFileUri) {\n      // if the rewritten URL is a relative path, we need to use the origin to resolve the URL.\n\n      // The following is a workaround for Vite.\n      //\n      // Vite uses a bundler(rollup/rolldown) that does not rewrite `import.meta.url` to a file URL. So in theory, this\n      // code path should not be executed in Vite. However, the bundler does not know it and it still try to load the\n      // following pattern:\n      // - `return new URL('filename', import.meta.url).href`\n      //\n      // By replacing the pattern above with the following code, we can skip the resource loading behavior:\n      // - `const URL2 = URL; return new URL2('filename', import.meta.url).href;`\n      //\n      // And it still works in Webpack.\n      const URL2 = URL;\n      return new URL(new URL2(BUILD_DEFS.BUNDLE_FILENAME, BUILD_DEFS.ESM_IMPORT_META_URL).href, origin).href;\n    }\n\n    return BUILD_DEFS.ESM_IMPORT_META_URL;\n  }\n\n  return typeof document !== 'undefined'\n    ? (document.currentScript as HTMLScriptElement)?.src\n    : // use `self.location.href` if available\n      typeof self !== 'undefined'\n      ? self.location?.href\n      : undefined;\n};\n\n/**\n * The classic script source URL. This is not always available in non ESModule environments.\n *\n * In Node.js, this is undefined.\n */\nexport const scriptSrc = getScriptSrc();\n\n/**\n * Infer the wasm path prefix from the script source URL.\n *\n * @returns The inferred wasm path prefix, or undefined if the script source URL is not available or is a blob URL.\n */\nexport const inferWasmPathPrefixFromScriptSrc = (): string | undefined => {\n  if (scriptSrc && !scriptSrc.startsWith('blob:')) {\n    return scriptSrc.substring(0, scriptSrc.lastIndexOf('/') + 1);\n  }\n  return undefined;\n};\n\n/**\n * Check if the given filename with prefix is from the same origin.\n */\nconst isSameOrigin = (filename: string, prefixOverride?: string) => {\n  try {\n    const baseUrl = prefixOverride ?? scriptSrc;\n    const url = baseUrl ? new URL(filename, baseUrl) : new URL(filename);\n    return url.origin === origin;\n  } catch {\n    return false;\n  }\n};\n\n/**\n * Normalize the inputs to an absolute URL with the given prefix override. If failed, return undefined.\n */\nconst normalizeUrl = (filename: string, prefixOverride?: string) => {\n  const baseUrl = prefixOverride ?? scriptSrc;\n  try {\n    const url = baseUrl ? new URL(filename, baseUrl) : new URL(filename);\n    return url.href;\n  } catch {\n    return undefined;\n  }\n};\n\n/**\n * Create a fallback URL if an absolute URL cannot be created by the normalizeUrl function.\n */\nconst fallbackUrl = (filename: string, prefixOverride?: string) => `${prefixOverride ?? './'}${filename}`;\n\n/**\n * This helper function is used to preload a module from a URL.\n *\n * If the origin of the worker URL is different from the current origin, the worker cannot be loaded directly.\n * See discussions in https://github.com/webpack-contrib/worker-loader/issues/154\n *\n * In this case, we will fetch the worker URL and create a new Blob URL with the same origin as a workaround.\n *\n * @param absoluteUrl - The absolute URL to preload.\n *\n * @returns - A promise that resolves to a new Blob URL\n */\nconst preload = async (absoluteUrl: string): Promise<string> => {\n  const response = await fetch(absoluteUrl, { credentials: 'same-origin' });\n  const blob = await response.blob();\n  return URL.createObjectURL(blob);\n};\n\n/**\n * This helper function is used to dynamically import a module from a URL.\n *\n * The build script has special handling for this function to ensure that the URL is not bundled into the final output.\n *\n * @param url - The URL to import.\n *\n * @returns - A promise that resolves to the default export of the module.\n */\nconst dynamicImportDefault = async <T>(url: string): Promise<T> =>\n  (await import(/* webpackIgnore: true */ url)).default;\n\n/**\n * The proxy worker factory imported from the proxy worker module.\n *\n * This is only available when the WebAssembly proxy is not disabled.\n */\nconst createProxyWorker: ((urlOverride?: string) => Worker) | undefined =\n  // eslint-disable-next-line @typescript-eslint/no-require-imports, @typescript-eslint/no-var-requires\n  BUILD_DEFS.DISABLE_WASM_PROXY ? undefined : require('./proxy-worker/main').default;\n\n/**\n * Import the proxy worker.\n *\n * This function will perform the following steps:\n * 1. If a preload is needed, it will preload the module and return the object URL.\n * 2. Use the proxy worker factory to create the proxy worker.\n *\n * @returns - A promise that resolves to a tuple of 2 elements:\n *            - The object URL of the preloaded module, or undefined if no preload is needed.\n *            - The proxy worker.\n */\nexport const importProxyWorker = async (): Promise<[undefined | string, Worker]> => {\n  if (!scriptSrc) {\n    throw new Error('Failed to load proxy worker: cannot determine the script source URL.');\n  }\n\n  // If the script source is from the same origin, we can use the embedded proxy module directly.\n  if (isSameOrigin(scriptSrc)) {\n    return [undefined, createProxyWorker!()];\n  }\n\n  // Otherwise, need to preload\n  const url = await preload(scriptSrc);\n  return [url, createProxyWorker!(url)];\n};\n\n/**\n * The embedded WebAssembly module.\n *\n * This is only available in ESM and when embedding is not disabled.\n */\nconst embeddedWasmModule: EmscriptenModuleFactory<OrtWasmModule> | undefined =\n  BUILD_DEFS.IS_ESM && BUILD_DEFS.ENABLE_BUNDLE_WASM_JS\n    ? // eslint-disable-next-line @typescript-eslint/no-require-imports, @typescript-eslint/no-var-requires\n      require(\n        !BUILD_DEFS.DISABLE_JSEP\n          ? '../../dist/ort-wasm-simd-threaded.jsep.mjs'\n          : '../../dist/ort-wasm-simd-threaded.mjs',\n      ).default\n    : undefined;\n\n/**\n * Import the WebAssembly module.\n *\n * This function will perform the following steps:\n * 1. If the embedded module exists and no custom URL is specified, use the embedded module.\n * 2. If a preload is needed, it will preload the module and return the object URL.\n * 3. Otherwise, it will perform a dynamic import of the module.\n *\n * @returns - A promise that resolves to a tuple of 2 elements:\n *            - The object URL of the preloaded module, or undefined if no preload is needed.\n *            - The default export of the module, which is a factory function to create the WebAssembly module.\n */\nexport const importWasmModule = async (\n  urlOverride: string | undefined,\n  prefixOverride: string | undefined,\n  isMultiThreaded: boolean,\n): Promise<[undefined | string, EmscriptenModuleFactory<OrtWasmModule>]> => {\n  if (!urlOverride && !prefixOverride && embeddedWasmModule && scriptSrc && isSameOrigin(scriptSrc)) {\n    return [undefined, embeddedWasmModule];\n  } else {\n    const wasmModuleFilename = !BUILD_DEFS.DISABLE_JSEP\n      ? 'ort-wasm-simd-threaded.jsep.mjs'\n      : 'ort-wasm-simd-threaded.mjs';\n    const wasmModuleUrl = urlOverride ?? normalizeUrl(wasmModuleFilename, prefixOverride);\n    // need to preload if all of the following conditions are met:\n    // 1. not in Node.js.\n    //    - Node.js does not have the same origin policy for creating workers.\n    // 2. multi-threaded is enabled.\n    //    - If multi-threaded is disabled, no worker will be created. So we don't need to preload the module.\n    // 3. the absolute URL is available.\n    //    - If the absolute URL is failed to be created, the origin cannot be determined. In this case, we will not\n    //    preload the module.\n    // 4. the worker URL is not from the same origin.\n    //    - If the worker URL is from the same origin, we can create the worker directly.\n    const needPreload = !isNode && isMultiThreaded && wasmModuleUrl && !isSameOrigin(wasmModuleUrl, prefixOverride);\n    const url = needPreload\n      ? await preload(wasmModuleUrl)\n      : (wasmModuleUrl ?? fallbackUrl(wasmModuleFilename, prefixOverride));\n    return [needPreload ? url : undefined, await dynamicImportDefault<EmscriptenModuleFactory<OrtWasmModule>>(url)];\n  }\n};\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { Env } from 'onnxruntime-common';\n\nimport type { OrtWasmModule } from './wasm-types';\nimport { importWasmModule, inferWasmPathPrefixFromScriptSrc } from './wasm-utils-import';\n\nlet wasm: OrtWasmModule | undefined;\nlet initialized = false;\nlet initializing = false;\nlet aborted = false;\n\nconst isMultiThreadSupported = (): boolean => {\n  // If 'SharedArrayBuffer' is not available, WebAssembly threads will not work.\n  if (typeof SharedArrayBuffer === 'undefined') {\n    return false;\n  }\n\n  try {\n    // Test for transferability of SABs (for browsers. needed for Firefox)\n    // https://groups.google.com/forum/#!msg/mozilla.dev.platform/IHkBZlHETpA/dwsMNchWEQAJ\n    if (typeof MessageChannel !== 'undefined') {\n      new MessageChannel().port1.postMessage(new SharedArrayBuffer(1));\n    }\n\n    // Test for WebAssembly threads capability (for both browsers and Node.js)\n    // This typed array is a WebAssembly program containing threaded instructions.\n    return WebAssembly.validate(\n      new Uint8Array([\n        0, 97, 115, 109, 1, 0, 0, 0, 1, 4, 1, 96, 0, 0, 3, 2, 1, 0, 5, 4, 1, 3, 1, 1, 10, 11, 1, 9, 0, 65, 0, 254, 16,\n        2, 0, 26, 11,\n      ]),\n    );\n  } catch (e) {\n    return false;\n  }\n};\n\nconst isSimdSupported = (): boolean => {\n  try {\n    // Test for WebAssembly SIMD capability (for both browsers and Node.js)\n    // This typed array is a WebAssembly program containing SIMD instructions.\n\n    // The binary data is generated from the following code by wat2wasm:\n    //\n    // (module\n    //   (type $t0 (func))\n    //   (func $f0 (type $t0)\n    //     (drop\n    //       (i32x4.dot_i16x8_s\n    //         (i8x16.splat\n    //           (i32.const 0))\n    //         (v128.const i32x4 0x00000000 0x00000000 0x00000000 0x00000000)))))\n\n    return WebAssembly.validate(\n      new Uint8Array([\n        0, 97, 115, 109, 1, 0, 0, 0, 1, 4, 1, 96, 0, 0, 3, 2, 1, 0, 10, 30, 1, 28, 0, 65, 0, 253, 15, 253, 12, 0, 0, 0,\n        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 253, 186, 1, 26, 11,\n      ]),\n    );\n  } catch (e) {\n    return false;\n  }\n};\n\nconst isRelaxedSimdSupported = (): boolean => {\n  try {\n    // Test for WebAssembly Relaxed SIMD capability (for both browsers and Node.js)\n    // This typed array is a WebAssembly program containing Relaxed SIMD instructions.\n\n    // The binary data is generated from the following code by wat2wasm:\n    // (module\n    //   (func (result v128)\n    //      i32.const 1\n    //      i8x16.splat\n    //      i32.const 2\n    //      i8x16.splat\n    //      i32.const 3\n    //      i8x16.splat\n    //      i32x4.relaxed_dot_i8x16_i7x16_add_s\n    //   )\n    //  )\n    return WebAssembly.validate(\n      new Uint8Array([\n        0, 97, 115, 109, 1, 0, 0, 0, 1, 5, 1, 96, 0, 1, 123, 3, 2, 1, 0, 10, 19, 1, 17, 0, 65, 1, 253, 15, 65, 2, 253,\n        15, 65, 3, 253, 15, 253, 147, 2, 11,\n      ]),\n    );\n  } catch (e) {\n    return false;\n  }\n};\n\nexport const initializeWebAssembly = async (flags: Env.WebAssemblyFlags): Promise<void> => {\n  if (initialized) {\n    return Promise.resolve();\n  }\n  if (initializing) {\n    throw new Error(\"multiple calls to 'initializeWebAssembly()' detected.\");\n  }\n  if (aborted) {\n    throw new Error(\"previous call to 'initializeWebAssembly()' failed.\");\n  }\n\n  initializing = true;\n\n  // wasm flags are already initialized\n  const timeout = flags.initTimeout!;\n  let numThreads = flags.numThreads!;\n\n  // ensure SIMD is supported\n  if (flags.simd === false) {\n    // skip SIMD feature checking as it is disabled explicitly by user\n  } else if (flags.simd === 'relaxed') {\n    // check if relaxed SIMD is supported\n    if (!isRelaxedSimdSupported()) {\n      throw new Error('Relaxed WebAssembly SIMD is not supported in the current environment.');\n    }\n  } else if (!isSimdSupported()) {\n    throw new Error('WebAssembly SIMD is not supported in the current environment.');\n  }\n\n  // check if multi-threading is supported\n  const multiThreadSupported = isMultiThreadSupported();\n  if (numThreads > 1 && !multiThreadSupported) {\n    if (typeof self !== 'undefined' && !self.crossOriginIsolated) {\n      // eslint-disable-next-line no-console\n      console.warn(\n        'env.wasm.numThreads is set to ' +\n          numThreads +\n          ', but this will not work unless you enable crossOriginIsolated mode. ' +\n          'See https://web.dev/cross-origin-isolation-guide/ for more info.',\n      );\n    }\n\n    // eslint-disable-next-line no-console\n    console.warn(\n      'WebAssembly multi-threading is not supported in the current environment. ' + 'Falling back to single-threading.',\n    );\n\n    // set flags.numThreads to 1 so that OrtInit() will not create a global thread pool.\n    flags.numThreads = numThreads = 1;\n  }\n\n  const wasmPaths = flags.wasmPaths;\n  const wasmPrefixOverride = typeof wasmPaths === 'string' ? wasmPaths : undefined;\n  const mjsPathOverrideFlag = (wasmPaths as Env.WasmFilePaths)?.mjs;\n  const mjsPathOverride = (mjsPathOverrideFlag as URL)?.href ?? mjsPathOverrideFlag;\n  const wasmPathOverrideFlag = (wasmPaths as Env.WasmFilePaths)?.wasm;\n  const wasmPathOverride = (wasmPathOverrideFlag as URL)?.href ?? wasmPathOverrideFlag;\n  const wasmBinaryOverride = flags.wasmBinary;\n\n  const [objectUrl, ortWasmFactory] = await importWasmModule(mjsPathOverride, wasmPrefixOverride, numThreads > 1);\n\n  let isTimeout = false;\n\n  const tasks: Array<Promise<void>> = [];\n\n  // promise for timeout\n  if (timeout > 0) {\n    tasks.push(\n      new Promise((resolve) => {\n        setTimeout(() => {\n          isTimeout = true;\n          resolve();\n        }, timeout);\n      }),\n    );\n  }\n\n  // promise for module initialization\n  tasks.push(\n    new Promise((resolve, reject) => {\n      const config: Partial<OrtWasmModule> = {\n        /**\n         * The number of threads. WebAssembly will create (Module.numThreads - 1) workers. If it is 1, no worker will be\n         * created.\n         */\n        numThreads,\n      };\n\n      if (wasmBinaryOverride) {\n        // Set a custom buffer which contains the WebAssembly binary. This will skip the wasm file fetching.\n        config.wasmBinary = wasmBinaryOverride;\n      } else if (wasmPathOverride || wasmPrefixOverride) {\n        // A callback function to locate the WebAssembly file. The function should return the full path of the file.\n        //\n        // Since Emscripten 3.1.58, this function is only called for the .wasm file.\n        config.locateFile = (fileName) => wasmPathOverride ?? wasmPrefixOverride + fileName;\n      } else if (mjsPathOverride && mjsPathOverride.indexOf('blob:') !== 0) {\n        // if mjs path is specified, use it as the base path for the .wasm file.\n        config.locateFile = (fileName) => new URL(fileName, mjsPathOverride).href;\n      } else if (objectUrl) {\n        const inferredWasmPathPrefix = inferWasmPathPrefixFromScriptSrc();\n        if (inferredWasmPathPrefix) {\n          // if the wasm module is preloaded, use the inferred wasm path as the base path for the .wasm file.\n          config.locateFile = (fileName) => inferredWasmPathPrefix + fileName;\n        }\n      }\n\n      ortWasmFactory(config).then(\n        // wasm module initialized successfully\n        (module) => {\n          initializing = false;\n          initialized = true;\n          wasm = module;\n          resolve();\n          if (objectUrl) {\n            URL.revokeObjectURL(objectUrl);\n          }\n        },\n        // wasm module failed to initialize\n        (what) => {\n          initializing = false;\n          aborted = true;\n          reject(what);\n        },\n      );\n    }),\n  );\n\n  await Promise.race(tasks);\n\n  if (isTimeout) {\n    throw new Error(`WebAssembly backend initializing failed due to timeout: ${timeout}ms`);\n  }\n};\n\nexport const getInstance = (): OrtWasmModule => {\n  if (initialized && wasm) {\n    return wasm;\n  }\n\n  throw new Error('WebAssembly is not initialized yet.');\n};\n\nexport const dispose = (): void => {\n  if (initialized && !initializing && !aborted) {\n    // TODO: currently \"PThread.terminateAllThreads()\" is not exposed in the wasm module.\n    //       And this function is not yet called by any code.\n    //       If it is needed in the future, we should expose it in the wasm module and uncomment the following line.\n\n    // wasm?.PThread?.terminateAllThreads();\n    wasm = undefined;\n\n    initializing = false;\n    initialized = false;\n    aborted = true;\n  }\n};\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { getInstance } from './wasm-factory';\n\nexport const allocWasmString = (data: string, allocs: number[]): number => {\n  const wasm = getInstance();\n\n  const dataLength = wasm.lengthBytesUTF8(data) + 1;\n  const dataOffset = wasm._malloc(dataLength);\n  wasm.stringToUTF8(data, dataOffset, dataLength);\n  allocs.push(dataOffset);\n\n  return dataOffset;\n};\n\ninterface ExtraOptionsHandler {\n  (name: string, value: string): void;\n}\n\nexport const iterateExtraOptions = (\n  options: Record<string, unknown>,\n  prefix: string,\n  seen: WeakSet<Record<string, unknown>>,\n  handler: ExtraOptionsHandler,\n): void => {\n  if (typeof options == 'object' && options !== null) {\n    if (seen.has(options)) {\n      throw new Error('Circular reference in options');\n    } else {\n      seen.add(options);\n    }\n  }\n\n  Object.entries(options).forEach(([key, value]) => {\n    const name = prefix ? prefix + key : key;\n    if (typeof value === 'object') {\n      iterateExtraOptions(value as Record<string, unknown>, name + '.', seen, handler);\n    } else if (typeof value === 'string' || typeof value === 'number') {\n      handler(name, value.toString());\n    } else if (typeof value === 'boolean') {\n      handler(name, value ? '1' : '0');\n    } else {\n      throw new Error(`Can't handle extra config type: ${typeof value}`);\n    }\n  });\n};\n\n/**\n * check web assembly API's last error and throw error if any error occurred.\n * @param message a message used when an error occurred.\n */\nexport const checkLastError = (message: string): void => {\n  const wasm = getInstance();\n\n  const stack = wasm.stackSave();\n  try {\n    const ptrSize = wasm.PTR_SIZE;\n    const paramsOffset = wasm.stackAlloc(2 * ptrSize);\n    wasm._OrtGetLastError(paramsOffset, paramsOffset + ptrSize);\n    const errorCode = Number(wasm.getValue(paramsOffset, ptrSize === 4 ? 'i32' : 'i64'));\n    const errorMessagePointer = wasm.getValue(paramsOffset + ptrSize, '*');\n    const errorMessage = errorMessagePointer ? wasm.UTF8ToString(errorMessagePointer) : '';\n    throw new Error(`${message} ERROR_CODE: ${errorCode}, ERROR_MESSAGE: ${errorMessage}`);\n  } finally {\n    wasm.stackRestore(stack);\n  }\n};\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { InferenceSession } from 'onnxruntime-common';\n\nimport { getInstance } from './wasm-factory';\nimport { allocWasmString, checkLastError, iterateExtraOptions } from './wasm-utils';\n\nexport const setRunOptions = (options: InferenceSession.RunOptions): [number, number[]] => {\n  const wasm = getInstance();\n  let runOptionsHandle = 0;\n  const allocs: number[] = [];\n\n  const runOptions: InferenceSession.RunOptions = options || {};\n\n  try {\n    if (options?.logSeverityLevel === undefined) {\n      runOptions.logSeverityLevel = 2; // Default to warning\n    } else if (\n      typeof options.logSeverityLevel !== 'number' ||\n      !Number.isInteger(options.logSeverityLevel) ||\n      options.logSeverityLevel < 0 ||\n      options.logSeverityLevel > 4\n    ) {\n      throw new Error(`log serverity level is not valid: ${options.logSeverityLevel}`);\n    }\n\n    if (options?.logVerbosityLevel === undefined) {\n      runOptions.logVerbosityLevel = 0; // Default to 0\n    } else if (typeof options.logVerbosityLevel !== 'number' || !Number.isInteger(options.logVerbosityLevel)) {\n      throw new Error(`log verbosity level is not valid: ${options.logVerbosityLevel}`);\n    }\n\n    if (options?.terminate === undefined) {\n      runOptions.terminate = false;\n    }\n\n    let tagDataOffset = 0;\n    if (options?.tag !== undefined) {\n      tagDataOffset = allocWasmString(options.tag, allocs);\n    }\n\n    runOptionsHandle = wasm._OrtCreateRunOptions(\n      runOptions.logSeverityLevel!,\n      runOptions.logVerbosityLevel!,\n      !!runOptions.terminate!,\n      tagDataOffset,\n    );\n    if (runOptionsHandle === 0) {\n      checkLastError(\"Can't create run options.\");\n    }\n\n    if (options?.extra !== undefined) {\n      iterateExtraOptions(options.extra, '', new WeakSet<Record<string, unknown>>(), (key, value) => {\n        const keyDataOffset = allocWasmString(key, allocs);\n        const valueDataOffset = allocWasmString(value, allocs);\n\n        if (wasm._OrtAddRunConfigEntry(runOptionsHandle, keyDataOffset, valueDataOffset) !== 0) {\n          checkLastError(`Can't set a run config entry: ${key} - ${value}.`);\n        }\n      });\n    }\n\n    return [runOptionsHandle, allocs];\n  } catch (e) {\n    if (runOptionsHandle !== 0) {\n      wasm._OrtReleaseRunOptions(runOptionsHandle);\n    }\n    allocs.forEach((alloc) => wasm._free(alloc));\n    throw e;\n  }\n};\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport type { InferenceSession } from 'onnxruntime-common';\n\nimport { getInstance } from './wasm-factory';\nimport { allocWasmString, checkLastError, iterateExtraOptions } from './wasm-utils';\n\nconst getGraphOptimzationLevel = (graphOptimizationLevel: string | unknown): number => {\n  switch (graphOptimizationLevel) {\n    case 'disabled':\n      return 0;\n    case 'basic':\n      return 1;\n    case 'extended':\n      return 2;\n    case 'all':\n      return 99;\n    default:\n      throw new Error(`unsupported graph optimization level: ${graphOptimizationLevel}`);\n  }\n};\n\nconst getExecutionMode = (executionMode: 'sequential' | 'parallel'): number => {\n  switch (executionMode) {\n    case 'sequential':\n      return 0;\n    case 'parallel':\n      return 1;\n    default:\n      throw new Error(`unsupported execution mode: ${executionMode}`);\n  }\n};\n\nconst appendDefaultOptions = (options: InferenceSession.SessionOptions): void => {\n  if (!options.extra) {\n    options.extra = {};\n  }\n  if (!options.extra.session) {\n    options.extra.session = {};\n  }\n  const session = options.extra.session as Record<string, string>;\n  if (!session.use_ort_model_bytes_directly) {\n    // eslint-disable-next-line camelcase\n    session.use_ort_model_bytes_directly = '1';\n  }\n\n  // if using JSEP with WebGPU, always disable memory pattern\n  if (\n    options.executionProviders &&\n    options.executionProviders.some((ep) => (typeof ep === 'string' ? ep : ep.name) === 'webgpu')\n  ) {\n    options.enableMemPattern = false;\n  }\n};\n\nconst appendSessionConfig = (sessionOptionsHandle: number, key: string, value: string, allocs: number[]): void => {\n  const keyDataOffset = allocWasmString(key, allocs);\n  const valueDataOffset = allocWasmString(value, allocs);\n  if (getInstance()._OrtAddSessionConfigEntry(sessionOptionsHandle, keyDataOffset, valueDataOffset) !== 0) {\n    checkLastError(`Can't set a session config entry: ${key} - ${value}.`);\n  }\n};\n\nconst appendEpOption = (epOptions: Array<[number, number]>, key: string, value: string, allocs: number[]): void => {\n  const keyDataOffset = allocWasmString(key, allocs);\n  const valueDataOffset = allocWasmString(value, allocs);\n  epOptions.push([keyDataOffset, valueDataOffset]);\n};\n\nconst setExecutionProviders = async (\n  sessionOptionsHandle: number,\n  executionProviders: readonly InferenceSession.ExecutionProviderConfig[],\n  allocs: number[],\n): Promise<void> => {\n  for (const ep of executionProviders) {\n    let epName = typeof ep === 'string' ? ep : ep.name;\n    const epOptions: Array<[number, number]> = [];\n\n    // check EP name\n    switch (epName) {\n      case 'webnn':\n        epName = 'WEBNN';\n        if (typeof ep !== 'string') {\n          const webnnOptions = ep as InferenceSession.WebNNExecutionProviderOption;\n          // const context = (webnnOptions as InferenceSession.WebNNOptionsWithMLContext)?.context;\n          const deviceType = (webnnOptions as InferenceSession.WebNNContextOptions)?.deviceType;\n          if (deviceType) {\n            appendSessionConfig(sessionOptionsHandle, 'deviceType', deviceType, allocs);\n          }\n        }\n        break;\n      case 'webgpu':\n        if (BUILD_DEFS.USE_WEBGPU_EP) {\n          epName = 'WebGPU';\n          let customDevice: GPUDevice | undefined;\n\n          if (typeof ep !== 'string') {\n            const customOptions = ep as unknown as { device: GPUDevice };\n            if (customOptions.device) {\n              if (typeof GPUDevice !== 'undefined' && customOptions.device instanceof GPUDevice) {\n                customDevice = customOptions.device;\n              } else {\n                throw new Error('Invalid GPU device set in WebGPU EP options.');\n              }\n            }\n\n            // TODO: handle more options\n          }\n\n          const info = getInstance().webgpuRegisterDevice!(customDevice);\n          if (info) {\n            const [deviceId, instanceHandle, deviceHandle] = info;\n            appendEpOption(epOptions, 'deviceId', deviceId.toString(), allocs);\n            appendEpOption(epOptions, 'webgpuInstance', instanceHandle.toString(), allocs);\n            appendEpOption(epOptions, 'webgpuDevice', deviceHandle.toString(), allocs);\n          }\n        } else {\n          epName = 'JS';\n          if (typeof ep !== 'string') {\n            const webgpuOptions = ep as InferenceSession.WebGpuExecutionProviderOption;\n            if (webgpuOptions?.preferredLayout) {\n              if (webgpuOptions.preferredLayout !== 'NCHW' && webgpuOptions.preferredLayout !== 'NHWC') {\n                throw new Error(`preferredLayout must be either 'NCHW' or 'NHWC': ${webgpuOptions.preferredLayout}`);\n              }\n              appendSessionConfig(sessionOptionsHandle, 'preferredLayout', webgpuOptions.preferredLayout, allocs);\n            }\n          }\n        }\n        break;\n      case 'wasm':\n      case 'cpu':\n        continue;\n      default:\n        throw new Error(`not supported execution provider: ${epName}`);\n    }\n\n    const epNameDataOffset = allocWasmString(epName, allocs);\n    const epOptionsCount = epOptions.length;\n    let keysOffset = 0;\n    let valuesOffset = 0;\n    if (epOptionsCount > 0) {\n      keysOffset = getInstance()._malloc(epOptionsCount * getInstance().PTR_SIZE);\n      allocs.push(keysOffset);\n      valuesOffset = getInstance()._malloc(epOptionsCount * getInstance().PTR_SIZE);\n      allocs.push(valuesOffset);\n      for (let i = 0; i < epOptionsCount; i++) {\n        getInstance().setValue(keysOffset + i * getInstance().PTR_SIZE, epOptions[i][0], '*');\n        getInstance().setValue(valuesOffset + i * getInstance().PTR_SIZE, epOptions[i][1], '*');\n      }\n    }\n    if (\n      (await getInstance()._OrtAppendExecutionProvider(\n        sessionOptionsHandle,\n        epNameDataOffset,\n        keysOffset,\n        valuesOffset,\n        epOptionsCount,\n      )) !== 0\n    ) {\n      checkLastError(`Can't append execution provider: ${epName}.`);\n    }\n  }\n};\n\nexport const setSessionOptions = async (options?: InferenceSession.SessionOptions): Promise<[number, number[]]> => {\n  const wasm = getInstance();\n  let sessionOptionsHandle = 0;\n  const allocs: number[] = [];\n\n  const sessionOptions: InferenceSession.SessionOptions = options || {};\n  appendDefaultOptions(sessionOptions);\n\n  try {\n    const graphOptimizationLevel = getGraphOptimzationLevel(sessionOptions.graphOptimizationLevel ?? 'all');\n    const executionMode = getExecutionMode(sessionOptions.executionMode ?? 'sequential');\n    const logIdDataOffset =\n      typeof sessionOptions.logId === 'string' ? allocWasmString(sessionOptions.logId, allocs) : 0;\n\n    const logSeverityLevel = sessionOptions.logSeverityLevel ?? 2; // Default to 2 - warning\n    if (!Number.isInteger(logSeverityLevel) || logSeverityLevel < 0 || logSeverityLevel > 4) {\n      throw new Error(`log serverity level is not valid: ${logSeverityLevel}`);\n    }\n\n    const logVerbosityLevel = sessionOptions.logVerbosityLevel ?? 0; // Default to 0 - verbose\n    if (!Number.isInteger(logVerbosityLevel) || logVerbosityLevel < 0 || logVerbosityLevel > 4) {\n      throw new Error(`log verbosity level is not valid: ${logVerbosityLevel}`);\n    }\n\n    const optimizedModelFilePathOffset =\n      typeof sessionOptions.optimizedModelFilePath === 'string'\n        ? allocWasmString(sessionOptions.optimizedModelFilePath, allocs)\n        : 0;\n\n    sessionOptionsHandle = wasm._OrtCreateSessionOptions(\n      graphOptimizationLevel,\n      !!sessionOptions.enableCpuMemArena,\n      !!sessionOptions.enableMemPattern,\n      executionMode,\n      !!sessionOptions.enableProfiling,\n      0,\n      logIdDataOffset,\n      logSeverityLevel,\n      logVerbosityLevel,\n      optimizedModelFilePathOffset,\n    );\n    if (sessionOptionsHandle === 0) {\n      checkLastError(\"Can't create session options.\");\n    }\n\n    if (sessionOptions.executionProviders) {\n      await setExecutionProviders(sessionOptionsHandle, sessionOptions.executionProviders, allocs);\n    }\n\n    if (sessionOptions.enableGraphCapture !== undefined) {\n      if (typeof sessionOptions.enableGraphCapture !== 'boolean') {\n        throw new Error(`enableGraphCapture must be a boolean value: ${sessionOptions.enableGraphCapture}`);\n      }\n      appendSessionConfig(\n        sessionOptionsHandle,\n        'enableGraphCapture',\n        sessionOptions.enableGraphCapture.toString(),\n        allocs,\n      );\n    }\n\n    if (sessionOptions.freeDimensionOverrides) {\n      for (const [name, value] of Object.entries(sessionOptions.freeDimensionOverrides)) {\n        if (typeof name !== 'string') {\n          throw new Error(`free dimension override name must be a string: ${name}`);\n        }\n        if (typeof value !== 'number' || !Number.isInteger(value) || value < 0) {\n          throw new Error(`free dimension override value must be a non-negative integer: ${value}`);\n        }\n        const nameOffset = allocWasmString(name, allocs);\n        if (wasm._OrtAddFreeDimensionOverride(sessionOptionsHandle, nameOffset, value) !== 0) {\n          checkLastError(`Can't set a free dimension override: ${name} - ${value}.`);\n        }\n      }\n    }\n\n    if (sessionOptions.extra !== undefined) {\n      iterateExtraOptions(sessionOptions.extra, '', new WeakSet<Record<string, unknown>>(), (key, value) => {\n        appendSessionConfig(sessionOptionsHandle, key, value, allocs);\n      });\n    }\n\n    return [sessionOptionsHandle, allocs];\n  } catch (e) {\n    if (sessionOptionsHandle !== 0) {\n      if (wasm._OrtReleaseSessionOptions(sessionOptionsHandle) !== 0) {\n        checkLastError(\"Can't release session options.\");\n      }\n    }\n    allocs.forEach((alloc) => wasm._free(alloc));\n    throw e;\n  }\n};\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { Tensor } from 'onnxruntime-common';\n\n// a dummy type declaration for Float16Array in case any polyfill is available.\ndeclare global {\n  // eslint-disable-next-line @typescript-eslint/naming-convention, @typescript-eslint/no-explicit-any\n  const Float16Array: any;\n}\n\n// This file includes common definitions. They do NOT have dependency on the WebAssembly instance.\n\n/**\n * Copied from ONNX definition. Use this to drop dependency 'onnx_proto' to decrease compiled .js file size.\n */\nexport const enum DataType {\n  undefined = 0,\n  float = 1,\n  uint8 = 2,\n  int8 = 3,\n  uint16 = 4,\n  int16 = 5,\n  int32 = 6,\n  int64 = 7,\n  string = 8,\n  bool = 9,\n  float16 = 10,\n  double = 11,\n  uint32 = 12,\n  uint64 = 13,\n  complex64 = 14,\n  complex128 = 15,\n  bfloat16 = 16,\n\n  // 4-bit data-types\n  uint4 = 21,\n  int4 = 22,\n}\n\n/**\n * Map string tensor data to enum value\n */\nexport const tensorDataTypeStringToEnum = (type: string): DataType => {\n  switch (type) {\n    case 'int8':\n      return DataType.int8;\n    case 'uint8':\n      return DataType.uint8;\n    case 'bool':\n      return DataType.bool;\n    case 'int16':\n      return DataType.int16;\n    case 'uint16':\n      return DataType.uint16;\n    case 'int32':\n      return DataType.int32;\n    case 'uint32':\n      return DataType.uint32;\n    case 'float16':\n      return DataType.float16;\n    case 'float32':\n      return DataType.float;\n    case 'float64':\n      return DataType.double;\n    case 'string':\n      return DataType.string;\n    case 'int64':\n      return DataType.int64;\n    case 'uint64':\n      return DataType.uint64;\n    case 'int4':\n      return DataType.int4;\n    case 'uint4':\n      return DataType.uint4;\n\n    default:\n      throw new Error(`unsupported data type: ${type}`);\n  }\n};\n\n/**\n * Map enum value to string tensor data\n */\nexport const tensorDataTypeEnumToString = (typeProto: DataType): Tensor.Type => {\n  switch (typeProto) {\n    case DataType.int8:\n      return 'int8';\n    case DataType.uint8:\n      return 'uint8';\n    case DataType.bool:\n      return 'bool';\n    case DataType.int16:\n      return 'int16';\n    case DataType.uint16:\n      return 'uint16';\n    case DataType.int32:\n      return 'int32';\n    case DataType.uint32:\n      return 'uint32';\n    case DataType.float16:\n      return 'float16';\n    case DataType.float:\n      return 'float32';\n    case DataType.double:\n      return 'float64';\n    case DataType.string:\n      return 'string';\n    case DataType.int64:\n      return 'int64';\n    case DataType.uint64:\n      return 'uint64';\n    case DataType.int4:\n      return 'int4';\n    case DataType.uint4:\n      return 'uint4';\n\n    default:\n      throw new Error(`unsupported data type: ${typeProto}`);\n  }\n};\n\n/**\n * get tensor size in bytes by the given data type and dimensions\n * @returns size in integer or undefined if the data type is not supported\n */\nexport const calculateTensorSizeInBytes = (\n  dateType: number,\n  dimsOrSize: readonly number[] | number,\n): number | undefined => {\n  const elementSize = [\n    -1, // undefined = 0\n    4, // float = 1\n    1, // uint8 = 2\n    1, // int8 = 3\n    2, // uint16 = 4\n    2, // int16 = 5\n    4, // int32 = 6\n    8, // int64 = 7\n    -1, // string = 8\n    1, // bool = 9\n    2, // float16 = 10\n    8, // double = 11\n    4, // uint32 = 12\n    8, // uint64 = 13\n    -1, // complex64 = 14\n    -1, // complex128 = 15\n    -1, // bfloat16 = 16\n    -1, // FLOAT8E4M3FN = 17\n    -1, // FLOAT8E4M3FNUZ = 18\n    -1, // FLOAT8E5M2 = 19\n    -1, // FLOAT8E5M2FNUZ = 20\n    0.5, // uint4 = 21\n    0.5, // int4 = 22\n  ][dateType];\n\n  const size = typeof dimsOrSize === 'number' ? dimsOrSize : dimsOrSize.reduce((a, b) => a * b, 1);\n  return elementSize > 0 ? Math.ceil(size * elementSize) : undefined;\n};\n\n/**\n * get typed array constructor by the given tensor type\n */\nexport const tensorTypeToTypedArrayConstructor = (\n  type: Tensor.Type,\n):\n  | Float32ArrayConstructor\n  | Uint8ArrayConstructor\n  | Int8ArrayConstructor\n  | Uint16ArrayConstructor\n  | Int16ArrayConstructor\n  | Int32ArrayConstructor\n  | BigInt64ArrayConstructor\n  | Uint8ArrayConstructor\n  | Float64ArrayConstructor\n  | Uint32ArrayConstructor\n  | BigUint64ArrayConstructor => {\n  switch (type) {\n    case 'float16':\n      // allow Float16Array polyfill.\n      return typeof Float16Array !== 'undefined' && Float16Array.from ? Float16Array : Uint16Array;\n    case 'float32':\n      return Float32Array;\n    case 'uint8':\n      return Uint8Array;\n    case 'int8':\n      return Int8Array;\n    case 'uint16':\n      return Uint16Array;\n    case 'int16':\n      return Int16Array;\n    case 'int32':\n      return Int32Array;\n    case 'bool':\n      return Uint8Array;\n    case 'float64':\n      return Float64Array;\n    case 'uint32':\n      return Uint32Array;\n    case 'int64':\n      return BigInt64Array;\n    case 'uint64':\n      return BigUint64Array;\n    default:\n      throw new Error(`unsupported type: ${type}`);\n  }\n};\n\n/**\n * Map string log level to integer value\n */\nexport const logLevelStringToEnum = (logLevel?: 'verbose' | 'info' | 'warning' | 'error' | 'fatal'): number => {\n  switch (logLevel) {\n    case 'verbose':\n      return 0;\n    case 'info':\n      return 1;\n    case 'warning':\n      return 2;\n    case 'error':\n      return 3;\n    case 'fatal':\n      return 4;\n    default:\n      throw new Error(`unsupported logging level: ${logLevel}`);\n  }\n};\n\n/**\n * Check whether the given tensor type is supported by GPU buffer\n */\nexport const isGpuBufferSupportedType = (type: Tensor.Type): type is Tensor.GpuBufferDataTypes =>\n  type === 'float32' ||\n  type === 'float16' ||\n  type === 'int32' ||\n  type === 'int64' ||\n  type === 'uint32' ||\n  type === 'uint8' ||\n  type === 'bool' ||\n  type === 'uint4' ||\n  type === 'int4';\n\n/**\n * Check whether the given tensor type is supported by WebNN MLTensor\n */\nexport const isMLTensorSupportedType = (type: Tensor.Type): type is Tensor.MLTensorDataTypes =>\n  type === 'float32' ||\n  type === 'float16' ||\n  type === 'int32' ||\n  type === 'int64' ||\n  type === 'uint32' ||\n  type === 'uint64' ||\n  type === 'int8' ||\n  type === 'uint8' ||\n  type === 'bool' ||\n  type === 'uint4' ||\n  type === 'int4';\n\n/**\n * Map string data location to integer value\n */\nexport const dataLocationStringToEnum = (location: Tensor.DataLocation): number => {\n  switch (location) {\n    case 'none':\n      return 0;\n    case 'cpu':\n      return 1;\n    case 'cpu-pinned':\n      return 2;\n    case 'texture':\n      return 3;\n    case 'gpu-buffer':\n      return 4;\n    case 'ml-tensor':\n      return 5;\n    default:\n      throw new Error(`unsupported data location: ${location}`);\n  }\n};\n\n/**\n * Map integer data location to string value\n */\nexport const dataLocationEnumToString = (location: number): Tensor.DataLocation | undefined =>\n  (['none', 'cpu', 'cpu-pinned', 'texture', 'gpu-buffer', 'ml-tensor'] as const)[location];\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { isNode } from './wasm-utils-env';\n\n/**\n * Load a file into a Uint8Array.\n *\n * @param file - the file to load. Can be a URL/path, a Blob, an ArrayBuffer, or a Uint8Array.\n * @returns a Uint8Array containing the file data.\n */\nexport const loadFile = async (file: string | Blob | ArrayBufferLike | Uint8Array): Promise<Uint8Array> => {\n  if (typeof file === 'string') {\n    if (isNode) {\n      // load file into ArrayBuffer in Node.js\n      try {\n        const { readFile } = require('node:fs/promises');\n        return new Uint8Array(await readFile(file));\n      } catch (e) {\n        if (e.code === 'ERR_FS_FILE_TOO_LARGE') {\n          // file is too large, use fs.createReadStream instead\n          const { createReadStream } = require('node:fs');\n          const stream = createReadStream(file);\n          const chunks: Uint8Array[] = [];\n          for await (const chunk of stream) {\n            chunks.push(chunk);\n          }\n          return new Uint8Array(Buffer.concat(chunks));\n        }\n        throw e;\n      }\n    } else {\n      // load file into ArrayBuffer in browsers\n      const response = await fetch(file);\n      if (!response.ok) {\n        throw new Error(`failed to load external data file: ${file}`);\n      }\n      const contentLengthHeader = response.headers.get('Content-Length');\n      const fileSize = contentLengthHeader ? parseInt(contentLengthHeader, 10) : 0;\n      if (fileSize < 1073741824 /* 1GB */) {\n        // when Content-Length header is not set, we cannot determine the file size. We assume it is small enough to\n        // load into memory.\n        return new Uint8Array(await response.arrayBuffer());\n      } else {\n        // file is too large, use stream instead\n        if (!response.body) {\n          throw new Error(`failed to load external data file: ${file}, no response body.`);\n        }\n        const reader = response.body.getReader();\n\n        let buffer;\n        try {\n          // try to create ArrayBuffer directly\n          buffer = new ArrayBuffer(fileSize);\n        } catch (e) {\n          if (e instanceof RangeError) {\n            // use WebAssembly Memory to allocate larger ArrayBuffer\n            const pages = Math.ceil(fileSize / 65536);\n            buffer = new WebAssembly.Memory({ initial: pages, maximum: pages }).buffer;\n          } else {\n            throw e;\n          }\n        }\n\n        let offset = 0;\n        // eslint-disable-next-line no-constant-condition\n        while (true) {\n          const { done, value } = await reader.read();\n          if (done) {\n            break;\n          }\n          const chunkSize = value.byteLength;\n          const chunk = new Uint8Array(buffer, offset, chunkSize);\n          chunk.set(value);\n          offset += chunkSize;\n        }\n        return new Uint8Array(buffer, 0, fileSize);\n      }\n    }\n  } else if (file instanceof Blob) {\n    return new Uint8Array(await file.arrayBuffer());\n  } else if (file instanceof Uint8Array) {\n    return file;\n  } else {\n    return new Uint8Array(file);\n  }\n};\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\n// WebNN API currently does not have a TypeScript definition file. This file is a workaround with types generated from\n// WebNN API specification.\n// https://github.com/webmachinelearning/webnn/issues/677\n/// <reference path=\"jsep/webnn/webnn.d.ts\" />\n\nimport { Env, InferenceSession, Tensor } from 'onnxruntime-common';\n\nimport {\n  SerializableInternalBuffer,\n  SerializableSessionMetadata,\n  SerializableTensorMetadata,\n  TensorMetadata,\n} from './proxy-messages';\nimport { setRunOptions } from './run-options';\nimport { setSessionOptions } from './session-options';\nimport {\n  calculateTensorSizeInBytes,\n  dataLocationStringToEnum,\n  isGpuBufferSupportedType,\n  isMLTensorSupportedType,\n  logLevelStringToEnum,\n  tensorDataTypeEnumToString,\n  tensorDataTypeStringToEnum,\n  tensorTypeToTypedArrayConstructor,\n} from './wasm-common';\nimport { getInstance } from './wasm-factory';\nimport { allocWasmString, checkLastError } from './wasm-utils';\nimport { loadFile } from './wasm-utils-load-file';\n\n// #region Initializations\n\n/**\n * There are 4 different \"initialization\" steps for ORT. They happen in different places and different time.\n *\n * 1. JavaScript initialization for onnxruntime-common and onnxruntime-web.\n *    This is the first initialization step. In this step, onnxruntime-web calls onnxruntime-common's registerBackend()\n * function multiple times to register all the available backends. The backend registration is very fast. It only\n * registers the backend name with the uninitialized backend object. No heavy initialization is done in this step.\n *    Refer to web/lib/index.ts for the backend registration.\n *\n * 2. WebAssembly artifact initialization.\n *    This happens when any registered wasm backend is used for the first time (ie. `ort.InferenceSession.create()` is\n * called). In this step, onnxruntime-web does the followings:\n *     - create a proxy worker and make sure the proxy worker is ready to receive messages, if proxy is enabled.\n *     - perform feature detection, locate correct WebAssembly artifact path and call the Emscripten generated\n * JavaScript code to initialize the WebAssembly runtime.\n *         - if proxy is enabled, this step happens in the proxy worker using message 'init-wasm'.\n *         - downloading the 'ort-wasm{...}.wasm' file is done in this step.\n *         - if multi-thread is enabled, one or more webworker will be created to initialize the PThread threadpool.\n *\n * 3. ORT environment initialization.\n *    This happens after step 2. In this step, onnxruntime-web performs ONNX Runtime environment initialization.\n * Function `_OrtInit()` is called in this step.\n *     - if proxy is enabled, this step happens in the proxy worker using message 'init-ort'.\n *     - logging level (ort.env.logLevel) and thread number (ort.env.wasm.numThreads) are set in this step.\n *\n * 4. Session initialization.\n *    This happens when `ort.InferenceSession.create()` is called. Unlike the first 3 steps (they only called once),\n * this step will be done for each session. In this step, onnxruntime-web does the followings:\n *    If the parameter is a URL:\n *    - download the model data from the URL.\n *    - copy the model data to the WASM heap. (proxy: 'copy-from')\n *    - dereference the model buffer. This step allows the original ArrayBuffer to be garbage collected.\n *    - call `_OrtCreateSession()` to create the session. (proxy: 'create')\n *\n *    If the parameter is a Uint8Array object:\n *    - copy the model data to the WASM heap. (proxy: 'copy-from')\n *    - call `_OrtCreateSession()` to create the session. (proxy: 'create')\n *\n *\n */\n\n/**\n * initialize ORT environment.\n *\n * @param numThreads SetGlobalIntraOpNumThreads(numThreads)\n * @param loggingLevel CreateEnv(static_cast<OrtLoggingLevel>(logging_level))\n */\nconst initOrt = (numThreads: number, loggingLevel: number): void => {\n  const errorCode = getInstance()._OrtInit(numThreads, loggingLevel);\n  if (errorCode !== 0) {\n    checkLastError(\"Can't initialize onnxruntime.\");\n  }\n};\n\n/**\n * initialize runtime environment.\n * @param env passed in the environment config object.\n */\nexport const initRuntime = async (env: Env): Promise<void> => {\n  // init ORT\n  initOrt(env.wasm.numThreads!, logLevelStringToEnum(env.logLevel));\n};\n\n/**\n * perform EP specific initialization.\n *\n * @param env\n * @param epName\n */\nexport const initEp = async (env: Env, epName: string): Promise<void> => {\n  // initialize ASYNCIFY support\n  getInstance().asyncInit?.();\n\n  if (epName === 'webgpu' && BUILD_DEFS.USE_WEBGPU_EP) {\n    getInstance().webgpuInit!((device) => {\n      env.webgpu.device = device;\n    });\n  }\n\n  if (!BUILD_DEFS.DISABLE_JSEP) {\n    // eslint-disable-next-line @typescript-eslint/no-require-imports, @typescript-eslint/no-var-requires\n    const initJsep = require('./jsep/init').init;\n\n    if (epName === 'webgpu' && !BUILD_DEFS.USE_WEBGPU_EP) {\n      // perform WebGPU availability check\n      if (typeof navigator === 'undefined' || !navigator.gpu) {\n        throw new Error('WebGPU is not supported in current environment');\n      }\n\n      let adapter = env.webgpu.adapter as GPUAdapter | null;\n      if (!adapter) {\n        // if adapter is not set, request a new adapter.\n        const powerPreference = env.webgpu.powerPreference;\n        if (\n          powerPreference !== undefined &&\n          powerPreference !== 'low-power' &&\n          powerPreference !== 'high-performance'\n        ) {\n          throw new Error(`Invalid powerPreference setting: \"${powerPreference}\"`);\n        }\n        const forceFallbackAdapter = env.webgpu.forceFallbackAdapter;\n        if (forceFallbackAdapter !== undefined && typeof forceFallbackAdapter !== 'boolean') {\n          throw new Error(`Invalid forceFallbackAdapter setting: \"${forceFallbackAdapter}\"`);\n        }\n        adapter = await navigator.gpu.requestAdapter({ powerPreference, forceFallbackAdapter });\n        if (!adapter) {\n          throw new Error(\n            'Failed to get GPU adapter. ' +\n              'You may need to enable flag \"--enable-unsafe-webgpu\" if you are using Chrome.',\n          );\n        }\n      } else {\n        // if adapter is set, validate it.\n        if (\n          typeof adapter.limits !== 'object' ||\n          typeof adapter.features !== 'object' ||\n          typeof adapter.requestDevice !== 'function'\n        ) {\n          throw new Error('Invalid GPU adapter set in `env.webgpu.adapter`. It must be a GPUAdapter object.');\n        }\n      }\n\n      await initJsep('webgpu', getInstance(), env, adapter);\n    }\n    if (epName === 'webnn') {\n      // perform WebNN availability check\n      if (typeof navigator === 'undefined' || !(navigator as unknown as { ml: unknown }).ml) {\n        throw new Error('WebNN is not supported in current environment');\n      }\n\n      await initJsep('webnn', getInstance(), env);\n    }\n  }\n};\n\n// #endregion Initializations\n\n/**\n * valid data locations for input/output tensors.\n */\ntype SupportedTensorDataLocationForInputOutput = 'cpu' | 'cpu-pinned' | 'gpu-buffer' | 'ml-tensor';\n\ntype IOBindingState = {\n  /**\n   * the handle of IO binding.\n   */\n  readonly handle: number;\n\n  /**\n   * the preferred location for each output tensor.\n   *\n   * value is one of 'cpu', 'cpu-pinned', 'gpu-buffer', 'ml-tensor'.\n   */\n  readonly outputPreferredLocations: readonly SupportedTensorDataLocationForInputOutput[];\n\n  /**\n   * enum value of the preferred location for each output tensor.\n   */\n  readonly outputPreferredLocationsEncoded: readonly number[];\n};\n\n/**\n *  tuple elements are: InferenceSession ID; inputNamesUTF8Encoded; outputNamesUTF8Encoded; bindingState\n */\ntype SessionMetadata = [\n  inferenceSessionId: number,\n  inputNamesUTF8Encoded: number[],\n  outputNamesUTF8Encoded: number[],\n  bindingState: IOBindingState | null,\n  enableGraphCapture: boolean,\n  inputOutputBound: boolean,\n];\n\nconst activeSessions = new Map<number, SessionMetadata>();\n\n/**\n * get the input/output count of the session.\n * @param sessionHandle the handle representing the session. should be non-zero.\n * @returns a tuple including 2 numbers, representing the input count and output count.\n */\nconst getSessionInputOutputCount = (sessionHandle: number): [number, number] => {\n  const wasm = getInstance();\n  const stack = wasm.stackSave();\n  try {\n    const ptrSize = wasm.PTR_SIZE;\n    const dataOffset = wasm.stackAlloc(2 * ptrSize);\n    const errorCode = wasm._OrtGetInputOutputCount(sessionHandle, dataOffset, dataOffset + ptrSize);\n    if (errorCode !== 0) {\n      checkLastError(\"Can't get session input/output count.\");\n    }\n    const type = ptrSize === 4 ? 'i32' : 'i64';\n    return [Number(wasm.getValue(dataOffset, type)), Number(wasm.getValue(dataOffset + ptrSize, type))];\n  } finally {\n    wasm.stackRestore(stack);\n  }\n};\n\nconst getSessionInputOutputMetadata = (\n  sessionHandle: number,\n  index: number,\n): [nameOffset: number, elementType: number, dims?: Array<number | string>] => {\n  const wasm = getInstance();\n  const stack = wasm.stackSave();\n  let metadataOffset = 0;\n  try {\n    const ptrSize = wasm.PTR_SIZE;\n    const dataOffset = wasm.stackAlloc(2 * ptrSize);\n    const errorCode = wasm._OrtGetInputOutputMetadata(sessionHandle, index, dataOffset, dataOffset + ptrSize);\n    if (errorCode !== 0) {\n      checkLastError(\"Can't get session input/output metadata.\");\n    }\n    const nameOffset = Number(wasm.getValue(dataOffset, '*'));\n    metadataOffset = Number(wasm.getValue(dataOffset + ptrSize, '*'));\n    // get element type\n    const elementType = wasm.HEAP32[metadataOffset / 4];\n    if (elementType === 0) {\n      return [nameOffset, 0]; // non-tensor\n    }\n\n    // get dims count\n    const dimsCount = wasm.HEAPU32[metadataOffset / 4 + 1];\n    // get dims\n    const dims: Array<number | string> = [];\n    for (let i = 0; i < dimsCount; i++) {\n      const symbolicDimNameOffset = Number(wasm.getValue(metadataOffset + 8 + i * ptrSize, '*'));\n      dims.push(\n        symbolicDimNameOffset !== 0\n          ? wasm.UTF8ToString(symbolicDimNameOffset)\n          : Number(wasm.getValue(metadataOffset + 8 + (i + dimsCount) * ptrSize, '*')),\n      );\n    }\n    return [nameOffset, elementType, dims];\n  } finally {\n    wasm.stackRestore(stack);\n    if (metadataOffset !== 0) {\n      wasm._OrtFree(metadataOffset);\n    }\n  }\n};\n\n/**\n * allocate the memory and memcpy the external buffer.\n *\n * @param model - the external buffer containing the model data. Must not be the same buffer as the WASM heap.\n * @returns a 2-elements tuple - the pointer and size of the allocated buffer\n */\nexport const copyFromExternalBuffer = (model: Uint8Array): [number, number] => {\n  const wasm = getInstance();\n  const modelDataOffset = wasm._malloc(model.byteLength);\n  if (modelDataOffset === 0) {\n    throw new Error(`Can't create a session. failed to allocate a buffer of size ${model.byteLength}.`);\n  }\n  wasm.HEAPU8.set(model, modelDataOffset);\n  return [modelDataOffset, model.byteLength];\n};\n\n/**\n * create an inference session from a model data buffer.\n *\n * @param modelData - either a Uint8Array object representing the model data, or a 2-elements tuple containing the\n *     pointer and size of the model data buffer.\n * @param options an optional session options object.\n * @returns a 3-elements tuple containing [session handle, input names, output names]\n */\nexport const createSession = async (\n  modelData: Uint8Array | SerializableInternalBuffer,\n  options?: InferenceSession.SessionOptions,\n): Promise<SerializableSessionMetadata> => {\n  let modelDataOffset: number, modelDataLength: number;\n  const wasm = getInstance();\n\n  if (Array.isArray(modelData)) {\n    // if model data is an array, it must be a 2-elements tuple containing the pointer and size of the model data\n    [modelDataOffset, modelDataLength] = modelData;\n  } else if (modelData.buffer === wasm.HEAPU8.buffer) {\n    // if model data uses the same buffer as the WASM heap, we don't need to copy it.\n    [modelDataOffset, modelDataLength] = [modelData.byteOffset, modelData.byteLength];\n  } else {\n    // otherwise, copy the model data to the WASM heap.\n    [modelDataOffset, modelDataLength] = copyFromExternalBuffer(modelData);\n  }\n\n  let sessionHandle = 0;\n  let sessionOptionsHandle = 0;\n  let ioBindingHandle = 0;\n  let allocs: number[] = [];\n  const inputNamesUTF8Encoded = [];\n  const outputNamesUTF8Encoded = [];\n\n  try {\n    [sessionOptionsHandle, allocs] = await setSessionOptions(options);\n\n    if (options?.externalData && wasm.mountExternalData) {\n      const loadingPromises = [];\n      for (const file of options.externalData) {\n        const path = typeof file === 'string' ? file : file.path;\n        loadingPromises.push(\n          loadFile(typeof file === 'string' ? file : file.data).then((data) => {\n            wasm.mountExternalData(path, data);\n          }),\n        );\n      }\n\n      // wait for all external data files to be loaded\n      await Promise.all(loadingPromises);\n    }\n\n    for (const provider of options?.executionProviders ?? []) {\n      const providerName = typeof provider === 'string' ? provider : provider.name;\n      if (providerName === 'webnn') {\n        wasm.shouldTransferToMLTensor = false;\n        if (typeof provider !== 'string') {\n          const webnnOptions = provider as InferenceSession.WebNNExecutionProviderOption;\n          const context = (webnnOptions as InferenceSession.WebNNOptionsWithMLContext)?.context;\n          const gpuDevice = (webnnOptions as InferenceSession.WebNNOptionsWebGpu)?.gpuDevice;\n          const deviceType = (webnnOptions as InferenceSession.WebNNContextOptions)?.deviceType;\n          const powerPreference = (webnnOptions as InferenceSession.WebNNContextOptions)?.powerPreference;\n          if (context) {\n            wasm.currentContext = context as MLContext;\n          } else if (gpuDevice) {\n            wasm.currentContext = await wasm.webnnCreateMLContext!(gpuDevice);\n          } else {\n            wasm.currentContext = await wasm.webnnCreateMLContext!({ deviceType, powerPreference });\n          }\n        } else {\n          wasm.currentContext = await wasm.webnnCreateMLContext!();\n        }\n        break;\n      }\n    }\n\n    sessionHandle = await wasm._OrtCreateSession(modelDataOffset, modelDataLength, sessionOptionsHandle);\n    wasm.webgpuOnCreateSession?.(sessionHandle);\n    if (sessionHandle === 0) {\n      checkLastError(\"Can't create a session.\");\n    }\n\n    wasm.jsepOnCreateSession?.();\n\n    // clear current MLContext after session creation\n    if (wasm.currentContext) {\n      wasm.webnnRegisterMLContext!(sessionHandle, wasm.currentContext);\n      wasm.currentContext = undefined;\n      wasm.shouldTransferToMLTensor = true;\n    }\n\n    const [inputCount, outputCount] = getSessionInputOutputCount(sessionHandle);\n\n    const enableGraphCapture = !!options?.enableGraphCapture;\n\n    const inputNames = [];\n    const outputNames = [];\n    const inputMetadata: InferenceSession.ValueMetadata[] = [];\n    const outputMetadata: InferenceSession.ValueMetadata[] = [];\n    const outputPreferredLocations: SupportedTensorDataLocationForInputOutput[] = [];\n    for (let i = 0; i < inputCount; i++) {\n      const [nameOffset, elementType, shape] = getSessionInputOutputMetadata(sessionHandle, i);\n      if (nameOffset === 0) {\n        checkLastError(\"Can't get an input name.\");\n      }\n      inputNamesUTF8Encoded.push(nameOffset);\n      const name = wasm.UTF8ToString(nameOffset);\n      inputNames.push(name);\n      inputMetadata.push(\n        elementType === 0\n          ? { name, isTensor: false }\n          : { name, isTensor: true, type: tensorDataTypeEnumToString(elementType), shape: shape! },\n      );\n    }\n    for (let i = 0; i < outputCount; i++) {\n      const [nameOffset, elementType, shape] = getSessionInputOutputMetadata(sessionHandle, i + inputCount);\n      if (nameOffset === 0) {\n        checkLastError(\"Can't get an output name.\");\n      }\n      outputNamesUTF8Encoded.push(nameOffset);\n      const nameString = wasm.UTF8ToString(nameOffset);\n      outputNames.push(nameString);\n      outputMetadata.push(\n        elementType === 0\n          ? { name: nameString, isTensor: false }\n          : { name: nameString, isTensor: true, type: tensorDataTypeEnumToString(elementType), shape: shape! },\n      );\n\n      if (!BUILD_DEFS.DISABLE_JSEP) {\n        if (enableGraphCapture && options?.preferredOutputLocation === undefined) {\n          outputPreferredLocations.push('gpu-buffer');\n          continue;\n        }\n        const location =\n          typeof options?.preferredOutputLocation === 'string'\n            ? options.preferredOutputLocation\n            : (options?.preferredOutputLocation?.[nameString] ?? 'cpu');\n        if (location !== 'cpu' && location !== 'cpu-pinned' && location !== 'gpu-buffer' && location !== 'ml-tensor') {\n          throw new Error(`Not supported preferred output location: ${location}.`);\n        }\n        if (enableGraphCapture && location !== 'gpu-buffer') {\n          throw new Error(\n            `Not supported preferred output location: ${location}. Only 'gpu-buffer' location is supported when enableGraphCapture is true.`,\n          );\n        }\n        outputPreferredLocations.push(location);\n      }\n    }\n\n    // use IO binding only when at least one output is preferred to be on GPU.\n    let bindingState: IOBindingState | null = null;\n    if (!BUILD_DEFS.DISABLE_JSEP && outputPreferredLocations.some((l) => l === 'gpu-buffer' || l === 'ml-tensor')) {\n      ioBindingHandle = wasm._OrtCreateBinding(sessionHandle);\n      if (ioBindingHandle === 0) {\n        checkLastError(\"Can't create IO binding.\");\n      }\n\n      bindingState = {\n        handle: ioBindingHandle,\n        outputPreferredLocations,\n        outputPreferredLocationsEncoded: outputPreferredLocations.map((l) => dataLocationStringToEnum(l)),\n      };\n    }\n\n    activeSessions.set(sessionHandle, [\n      sessionHandle,\n      inputNamesUTF8Encoded,\n      outputNamesUTF8Encoded,\n      bindingState,\n      enableGraphCapture,\n      false,\n    ]);\n    return [sessionHandle, inputNames, outputNames, inputMetadata, outputMetadata];\n  } catch (e) {\n    inputNamesUTF8Encoded.forEach((buf) => wasm._OrtFree(buf));\n    outputNamesUTF8Encoded.forEach((buf) => wasm._OrtFree(buf));\n\n    if (ioBindingHandle !== 0) {\n      if (wasm._OrtReleaseBinding(ioBindingHandle) !== 0) {\n        checkLastError(\"Can't release IO binding.\");\n      }\n    }\n\n    if (sessionHandle !== 0) {\n      if (wasm._OrtReleaseSession(sessionHandle) !== 0) {\n        checkLastError(\"Can't release session.\");\n      }\n    }\n    throw e;\n  } finally {\n    wasm._free(modelDataOffset);\n    if (sessionOptionsHandle !== 0) {\n      if (wasm._OrtReleaseSessionOptions(sessionOptionsHandle) !== 0) {\n        checkLastError(\"Can't release session options.\");\n      }\n    }\n    allocs.forEach((alloc) => wasm._free(alloc));\n\n    // unmount external data if necessary\n    wasm.unmountExternalData?.();\n  }\n};\n\nexport const releaseSession = (sessionId: number): void => {\n  const wasm = getInstance();\n  const session = activeSessions.get(sessionId);\n  if (!session) {\n    throw new Error(`cannot release session. invalid session id: ${sessionId}`);\n  }\n  const [sessionHandle, inputNamesUTF8Encoded, outputNamesUTF8Encoded, ioBindingState, enableGraphCapture] = session;\n\n  if (ioBindingState) {\n    if (enableGraphCapture) {\n      if (wasm._OrtClearBoundOutputs(ioBindingState.handle) !== 0) {\n        checkLastError(\"Can't clear bound outputs.\");\n      }\n    }\n    if (wasm._OrtReleaseBinding(ioBindingState.handle) !== 0) {\n      checkLastError(\"Can't release IO binding.\");\n    }\n  }\n\n  wasm.jsepOnReleaseSession?.(sessionId);\n  wasm.webnnOnReleaseSession?.(sessionId);\n  wasm.webgpuOnReleaseSession?.(sessionId);\n\n  inputNamesUTF8Encoded.forEach((buf) => wasm._OrtFree(buf));\n  outputNamesUTF8Encoded.forEach((buf) => wasm._OrtFree(buf));\n  if (wasm._OrtReleaseSession(sessionHandle) !== 0) {\n    checkLastError(\"Can't release session.\");\n  }\n  activeSessions.delete(sessionId);\n};\n\nexport const prepareInputOutputTensor = async (\n  tensor: TensorMetadata | null,\n  tensorHandles: number[],\n  allocs: number[],\n  sessionId: number,\n  tensorNameUTF8Encoded: number,\n  index: number,\n  enableGraphCapture = false,\n): Promise<void> => {\n  if (!tensor) {\n    tensorHandles.push(0);\n    return;\n  }\n\n  const wasm = getInstance();\n  const ptrSize = wasm.PTR_SIZE;\n\n  const dataType = tensor[0];\n  const dims = tensor[1];\n  const location = tensor[3];\n  let actualLocation = location;\n\n  let rawData: number;\n  let dataByteLength: number;\n\n  if (dataType === 'string' && (location === 'gpu-buffer' || location === 'ml-tensor')) {\n    throw new Error('String tensor is not supported on GPU.');\n  }\n\n  if (enableGraphCapture && location !== 'gpu-buffer') {\n    throw new Error(\n      `External buffer must be provided for input/output index ${index} when enableGraphCapture is true.`,\n    );\n  }\n\n  if (location === 'gpu-buffer') {\n    const gpuBuffer = tensor[2].gpuBuffer;\n    dataByteLength = calculateTensorSizeInBytes(tensorDataTypeStringToEnum(dataType), dims)!;\n\n    if (BUILD_DEFS.USE_WEBGPU_EP) {\n      const registerBuffer = wasm.webgpuRegisterBuffer;\n      if (!registerBuffer) {\n        throw new Error('Tensor location \"gpu-buffer\" is not supported without using WebGPU.');\n      }\n\n      rawData = registerBuffer(gpuBuffer, sessionId);\n    } else {\n      const registerBuffer = wasm.jsepRegisterBuffer;\n      if (!registerBuffer) {\n        throw new Error('Tensor location \"gpu-buffer\" is not supported without using WebGPU.');\n      }\n      rawData = registerBuffer(sessionId, index, gpuBuffer, dataByteLength);\n    }\n  } else if (location === 'ml-tensor') {\n    const mlTensor = tensor[2].mlTensor as MLTensor;\n    dataByteLength = calculateTensorSizeInBytes(tensorDataTypeStringToEnum(dataType), dims)!;\n\n    const registerMLTensor = wasm.webnnRegisterMLTensor;\n    if (!registerMLTensor) {\n      throw new Error('Tensor location \"ml-tensor\" is not supported without using WebNN.');\n    }\n    rawData = registerMLTensor(sessionId, mlTensor, tensorDataTypeStringToEnum(dataType), dims);\n  } else {\n    const data = tensor[2];\n\n    if (Array.isArray(data)) {\n      // string tensor\n      dataByteLength = ptrSize * data.length;\n      rawData = wasm._malloc(dataByteLength);\n      allocs.push(rawData);\n      for (let i = 0; i < data.length; i++) {\n        if (typeof data[i] !== 'string') {\n          throw new TypeError(`tensor data at index ${i} is not a string`);\n        }\n        wasm.setValue(rawData + i * ptrSize, allocWasmString(data[i], allocs), '*');\n      }\n    } else {\n      const isGraphInput = wasm.webnnIsGraphInput;\n      if (dataType !== 'string' && isGraphInput) {\n        const tensorName = wasm.UTF8ToString(tensorNameUTF8Encoded);\n        // Promote the tensor to 'ml-tensor' if it is a graph input.\n        if (isGraphInput(sessionId, tensorName)) {\n          const dataTypeEnum = tensorDataTypeStringToEnum(dataType);\n          dataByteLength = calculateTensorSizeInBytes(dataTypeEnum, dims)!;\n          actualLocation = 'ml-tensor';\n          const createTemporaryTensor = wasm.webnnCreateTemporaryTensor;\n          const uploadTensor = wasm.webnnUploadTensor;\n          if (!createTemporaryTensor || !uploadTensor) {\n            throw new Error('Tensor location \"ml-tensor\" is not supported without using WebNN.');\n          }\n          const tensorId = await createTemporaryTensor(sessionId, dataTypeEnum, dims as number[]);\n          uploadTensor(tensorId, new Uint8Array(data.buffer, data.byteOffset, data.byteLength));\n          rawData = tensorId;\n        } else {\n          dataByteLength = data.byteLength;\n          rawData = wasm._malloc(dataByteLength);\n          allocs.push(rawData);\n          wasm.HEAPU8.set(new Uint8Array(data.buffer, data.byteOffset, dataByteLength), rawData);\n        }\n      } else {\n        dataByteLength = data.byteLength;\n        rawData = wasm._malloc(dataByteLength);\n        allocs.push(rawData);\n        wasm.HEAPU8.set(new Uint8Array(data.buffer, data.byteOffset, dataByteLength), rawData);\n      }\n    }\n  }\n\n  const stack = wasm.stackSave();\n  const dimsOffset = wasm.stackAlloc(4 * dims.length);\n  try {\n    dims.forEach((d, index) => wasm.setValue(dimsOffset + index * ptrSize, d, ptrSize === 4 ? 'i32' : 'i64'));\n    const tensor = wasm._OrtCreateTensor(\n      tensorDataTypeStringToEnum(dataType),\n      rawData,\n      dataByteLength,\n      dimsOffset,\n      dims.length,\n      dataLocationStringToEnum(actualLocation),\n    );\n    if (tensor === 0) {\n      checkLastError(`Can't create tensor for input/output. session=${sessionId}, index=${index}.`);\n    }\n    tensorHandles.push(tensor);\n  } finally {\n    wasm.stackRestore(stack);\n  }\n};\n\n/**\n * perform inference run\n */\nexport const run = async (\n  sessionId: number,\n  inputIndices: number[],\n  inputTensors: TensorMetadata[],\n  outputIndices: number[],\n  outputTensors: Array<TensorMetadata | null>,\n  options: InferenceSession.RunOptions,\n): Promise<TensorMetadata[]> => {\n  const wasm = getInstance();\n  const ptrSize = wasm.PTR_SIZE;\n  const session = activeSessions.get(sessionId);\n  if (!session) {\n    throw new Error(`cannot run inference. invalid session id: ${sessionId}`);\n  }\n  const sessionHandle = session[0];\n  const inputNamesUTF8Encoded = session[1];\n  const outputNamesUTF8Encoded = session[2];\n  const ioBindingState = session[3];\n  const enableGraphCapture = session[4];\n  const inputOutputBound = session[5];\n\n  const inputCount = inputIndices.length;\n  const outputCount = outputIndices.length;\n\n  let runOptionsHandle = 0;\n  let runOptionsAllocs: number[] = [];\n\n  const inputTensorHandles: number[] = [];\n  const outputTensorHandles: number[] = [];\n  const inputOutputAllocs: number[] = [];\n\n  const beforeRunStack = wasm.stackSave();\n  const inputValuesOffset = wasm.stackAlloc(inputCount * ptrSize);\n  const inputNamesOffset = wasm.stackAlloc(inputCount * ptrSize);\n  const outputValuesOffset = wasm.stackAlloc(outputCount * ptrSize);\n  const outputNamesOffset = wasm.stackAlloc(outputCount * ptrSize);\n\n  try {\n    [runOptionsHandle, runOptionsAllocs] = setRunOptions(options);\n\n    // create input tensors\n    for (let i = 0; i < inputCount; i++) {\n      await prepareInputOutputTensor(\n        inputTensors[i],\n        inputTensorHandles,\n        inputOutputAllocs,\n        sessionId,\n        inputNamesUTF8Encoded[inputIndices[i]],\n        inputIndices[i],\n        enableGraphCapture,\n      );\n    }\n\n    // create output tensors\n    for (let i = 0; i < outputCount; i++) {\n      await prepareInputOutputTensor(\n        outputTensors[i],\n        outputTensorHandles,\n        inputOutputAllocs,\n        sessionId,\n        outputNamesUTF8Encoded[outputIndices[i]],\n        inputCount + outputIndices[i],\n        enableGraphCapture,\n      );\n    }\n\n    for (let i = 0; i < inputCount; i++) {\n      wasm.setValue(inputValuesOffset + i * ptrSize, inputTensorHandles[i], '*');\n      wasm.setValue(inputNamesOffset + i * ptrSize, inputNamesUTF8Encoded[inputIndices[i]], '*');\n    }\n    for (let i = 0; i < outputCount; i++) {\n      wasm.setValue(outputValuesOffset + i * ptrSize, outputTensorHandles[i], '*');\n      wasm.setValue(outputNamesOffset + i * ptrSize, outputNamesUTF8Encoded[outputIndices[i]], '*');\n    }\n\n    if (!BUILD_DEFS.DISABLE_JSEP && ioBindingState && !inputOutputBound) {\n      const { handle, outputPreferredLocations, outputPreferredLocationsEncoded } = ioBindingState;\n\n      if (inputNamesUTF8Encoded.length !== inputCount) {\n        throw new Error(\n          `input count from feeds (${inputCount}) is expected to be always equal to model's input count (${inputNamesUTF8Encoded.length}).`,\n        );\n      }\n\n      // process inputs\n      for (let i = 0; i < inputCount; i++) {\n        const index = inputIndices[i];\n        const errorCode = await wasm._OrtBindInput(handle, inputNamesUTF8Encoded[index], inputTensorHandles[i]);\n        if (errorCode !== 0) {\n          checkLastError(`Can't bind input[${i}] for session=${sessionId}.`);\n        }\n      }\n\n      // process pre-allocated outputs\n      for (let i = 0; i < outputCount; i++) {\n        const index = outputIndices[i];\n        const location = outputTensors[i]?.[3]; // undefined means output is not pre-allocated.\n\n        if (location) {\n          // output is pre-allocated. bind the tensor.\n          const errorCode = wasm._OrtBindOutput(handle, outputNamesUTF8Encoded[index], outputTensorHandles[i], 0);\n          if (errorCode !== 0) {\n            checkLastError(`Can't bind pre-allocated output[${i}] for session=${sessionId}.`);\n          }\n        } else {\n          // output is not pre-allocated. reset preferred location.\n          const errorCode = wasm._OrtBindOutput(\n            handle,\n            outputNamesUTF8Encoded[index],\n            0,\n            outputPreferredLocationsEncoded[index],\n          );\n          if (errorCode !== 0) {\n            checkLastError(`Can't bind output[${i}] to ${outputPreferredLocations[i]} for session=${sessionId}.`);\n          }\n        }\n      }\n      activeSessions.set(sessionId, [\n        sessionHandle,\n        inputNamesUTF8Encoded,\n        outputNamesUTF8Encoded,\n        ioBindingState,\n        enableGraphCapture,\n        true,\n      ]);\n    }\n\n    wasm.jsepOnRunStart?.(sessionHandle);\n    wasm.webnnOnRunStart?.(sessionHandle);\n\n    let errorCode: number;\n    if (!BUILD_DEFS.DISABLE_JSEP && ioBindingState) {\n      errorCode = await wasm._OrtRunWithBinding(\n        sessionHandle,\n        ioBindingState.handle,\n        outputCount,\n        outputValuesOffset,\n        runOptionsHandle,\n      );\n    } else {\n      errorCode = await wasm._OrtRun(\n        sessionHandle,\n        inputNamesOffset,\n        inputValuesOffset,\n        inputCount,\n        outputNamesOffset,\n        outputCount,\n        outputValuesOffset,\n        runOptionsHandle,\n      );\n    }\n\n    if (errorCode !== 0) {\n      checkLastError('failed to call OrtRun().');\n    }\n\n    const output: TensorMetadata[] = [];\n\n    for (let i = 0; i < outputCount; i++) {\n      const tensor = Number(wasm.getValue(outputValuesOffset + i * ptrSize, '*'));\n      if (tensor === outputTensorHandles[i]) {\n        // output tensor is pre-allocated. no need to copy data.\n        output.push(outputTensors[i]!);\n        continue;\n      }\n\n      const beforeGetTensorDataStack = wasm.stackSave();\n      // stack allocate 4 pointer value\n      const tensorDataOffset = wasm.stackAlloc(4 * ptrSize);\n\n      let keepOutputTensor = false;\n      let type: Tensor.Type | undefined,\n        dataOffset = 0;\n      try {\n        const errorCode = wasm._OrtGetTensorData(\n          tensor,\n          tensorDataOffset,\n          tensorDataOffset + ptrSize,\n          tensorDataOffset + 2 * ptrSize,\n\n          tensorDataOffset + 3 * ptrSize,\n        );\n        if (errorCode !== 0) {\n          checkLastError(`Can't access output tensor data on index ${i}.`);\n        }\n        const valueType = ptrSize === 4 ? 'i32' : 'i64';\n        const dataType = Number(wasm.getValue(tensorDataOffset, valueType));\n        dataOffset = wasm.getValue(tensorDataOffset + ptrSize, '*');\n        const dimsOffset = wasm.getValue(tensorDataOffset + ptrSize * 2, '*');\n        const dimsLength = Number(wasm.getValue(tensorDataOffset + ptrSize * 3, valueType));\n        const dims = [];\n        for (let i = 0; i < dimsLength; i++) {\n          dims.push(Number(wasm.getValue(dimsOffset + i * ptrSize, valueType)));\n        }\n        if (wasm._OrtFree(dimsOffset) !== 0) {\n          checkLastError(\"Can't free memory for tensor dims.\");\n        }\n        const size = dims.reduce((a, b) => a * b, 1);\n        type = tensorDataTypeEnumToString(dataType);\n\n        const preferredLocation = ioBindingState?.outputPreferredLocations[outputIndices[i]];\n\n        if (type === 'string') {\n          if (preferredLocation === 'gpu-buffer' || preferredLocation === 'ml-tensor') {\n            throw new Error('String tensor is not supported on GPU.');\n          }\n          const stringData: string[] = [];\n          for (let i = 0; i < size; i++) {\n            const offset = wasm.getValue(dataOffset + i * ptrSize, '*');\n            const nextOffset = wasm.getValue(dataOffset + (i + 1) * ptrSize, '*');\n            const maxBytesToRead = i === size - 1 ? undefined : nextOffset - offset;\n            stringData.push(wasm.UTF8ToString(offset, maxBytesToRead));\n          }\n          output.push([type, dims, stringData, 'cpu']);\n        } else {\n          // If a certain output's preferred location is GPU but the tensor is empty, we still need to create a CPU\n          // tensor for it. There is no mapping GPU buffer for an empty tensor.\n          if (preferredLocation === 'gpu-buffer' && size > 0) {\n            const getBuffer = BUILD_DEFS.USE_WEBGPU_EP ? wasm.webgpuGetBuffer : wasm.jsepGetBuffer;\n            if (!getBuffer) {\n              throw new Error('preferredLocation \"gpu-buffer\" is not supported without using WebGPU.');\n            }\n            const gpuBuffer = getBuffer(dataOffset);\n            const bufferSize = calculateTensorSizeInBytes(dataType, size);\n            if (bufferSize === undefined || !isGpuBufferSupportedType(type)) {\n              throw new Error(`Unsupported data type: ${type}`);\n            }\n\n            // do not release the tensor right now. it will be released when user calls tensor.dispose().\n            keepOutputTensor = true;\n\n            if (BUILD_DEFS.USE_WEBGPU_EP) {\n              wasm.webgpuRegisterBuffer!(gpuBuffer, sessionId, dataOffset);\n              const downloadDataFunction = wasm.webgpuCreateDownloader!(gpuBuffer, bufferSize, sessionId);\n              output.push([\n                type,\n                dims,\n                {\n                  gpuBuffer,\n                  download: async () => {\n                    const arrayBuffer = await downloadDataFunction();\n                    const data = new (tensorTypeToTypedArrayConstructor(type!))(arrayBuffer);\n                    return data as Tensor.DataTypeMap[Tensor.GpuBufferDataTypes];\n                  },\n                  dispose: () => {\n                    if (wasm._OrtReleaseTensor(tensor) !== 0) {\n                      checkLastError(\"Can't release tensor.\");\n                    }\n                  },\n                },\n                'gpu-buffer',\n              ]);\n            } else {\n              output.push([\n                type,\n                dims,\n                {\n                  gpuBuffer,\n                  download: wasm.jsepCreateDownloader!(gpuBuffer, bufferSize, type),\n                  dispose: () => {\n                    if (wasm._OrtReleaseTensor(tensor) !== 0) {\n                      checkLastError(\"Can't release tensor.\");\n                    }\n                  },\n                },\n                'gpu-buffer',\n              ]);\n            }\n          } else if (preferredLocation === 'ml-tensor' && size > 0) {\n            const ensureTensor = wasm.webnnEnsureTensor;\n            const isInt64Supported = wasm.webnnIsInt64Supported;\n            if (!ensureTensor || !isInt64Supported) {\n              throw new Error('preferredLocation \"ml-tensor\" is not supported without using WebNN.');\n            }\n            const tensorSize = calculateTensorSizeInBytes(dataType, size);\n            if (tensorSize === undefined || !isMLTensorSupportedType(type)) {\n              throw new Error(`Unsupported data type: ${type}`);\n            }\n            if (type === 'int64' && !isInt64Supported(sessionId)) {\n              throw new Error(\n                `preferredLocation \"ml-tensor\" for int64 output is not supported by current WebNN Context.`,\n              );\n            }\n\n            // If the graph has been partitioned, the output tensor may have not been created. For this reason, we use\n            // ensureTensor to get/create the MLTensor. In which case, we don't need to copy the data if a new tensor\n            // has been created.\n            const mlTensor = await ensureTensor(sessionId, dataOffset, dataType, dims, false);\n\n            // do not release the tensor right now. it will be released when user calls tensor.dispose().\n            keepOutputTensor = true;\n\n            output.push([\n              type,\n              dims,\n              {\n                mlTensor,\n                download: wasm.webnnCreateMLTensorDownloader!(dataOffset, type),\n                dispose: () => {\n                  wasm.webnnReleaseTensorId!(dataOffset);\n                  wasm._OrtReleaseTensor(tensor);\n                },\n              },\n              'ml-tensor',\n            ]);\n          } else {\n            const typedArrayConstructor = tensorTypeToTypedArrayConstructor(type);\n            const data = new typedArrayConstructor(size);\n            new Uint8Array(data.buffer, data.byteOffset, data.byteLength).set(\n              wasm.HEAPU8.subarray(dataOffset, dataOffset + data.byteLength),\n            );\n            output.push([type, dims, data, 'cpu']);\n          }\n        }\n      } finally {\n        wasm.stackRestore(beforeGetTensorDataStack);\n        if (type === 'string' && dataOffset) {\n          wasm._free(dataOffset);\n        }\n        if (!keepOutputTensor) {\n          wasm._OrtReleaseTensor(tensor);\n        }\n        wasm.webnnOnRunEnd?.(sessionHandle);\n      }\n    }\n\n    if (ioBindingState && !enableGraphCapture) {\n      if (wasm._OrtClearBoundOutputs(ioBindingState.handle) !== 0) {\n        checkLastError(\"Can't clear bound outputs.\");\n      }\n      activeSessions.set(sessionId, [\n        sessionHandle,\n        inputNamesUTF8Encoded,\n        outputNamesUTF8Encoded,\n        ioBindingState,\n        enableGraphCapture,\n        false,\n      ]);\n    }\n    return output;\n  } finally {\n    wasm.stackRestore(beforeRunStack);\n\n    if (BUILD_DEFS.USE_WEBGPU_EP) {\n      inputTensors.forEach((t) => {\n        if (t && t[3] === 'gpu-buffer') {\n          wasm.webgpuUnregisterBuffer!(t[2].gpuBuffer);\n        }\n      });\n      outputTensors.forEach((t) => {\n        if (t && t[3] === 'gpu-buffer') {\n          wasm.webgpuUnregisterBuffer!(t[2].gpuBuffer);\n        }\n      });\n    }\n    inputTensorHandles.forEach((v) => wasm._OrtReleaseTensor(v));\n    outputTensorHandles.forEach((v) => wasm._OrtReleaseTensor(v));\n    inputOutputAllocs.forEach((p) => wasm._free(p));\n\n    if (runOptionsHandle !== 0) {\n      wasm._OrtReleaseRunOptions(runOptionsHandle);\n    }\n    runOptionsAllocs.forEach((p) => wasm._free(p));\n  }\n};\n\n/**\n * end profiling\n */\nexport const endProfiling = (sessionId: number): void => {\n  const wasm = getInstance();\n  const session = activeSessions.get(sessionId);\n  if (!session) {\n    throw new Error('invalid session id');\n  }\n  const sessionHandle = session[0];\n\n  // profile file name is not used yet, but it must be freed.\n  const profileFileName = wasm._OrtEndProfiling(sessionHandle);\n  if (profileFileName === 0) {\n    checkLastError(\"Can't get an profile file name.\");\n  }\n  wasm._OrtFree(profileFileName);\n};\n\nexport const extractTransferableBuffers = (tensors: readonly SerializableTensorMetadata[]): ArrayBufferLike[] => {\n  const buffers: ArrayBufferLike[] = [];\n  for (const tensor of tensors) {\n    const data = tensor[2];\n    if (!Array.isArray(data) && 'buffer' in data) {\n      buffers.push(data.buffer);\n    }\n  }\n  return buffers;\n};\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { env, InferenceSession } from 'onnxruntime-common';\n\nimport {\n  OrtWasmMessage,\n  SerializableInternalBuffer,\n  SerializableSessionMetadata,\n  SerializableTensorMetadata,\n  TensorMetadata,\n} from './proxy-messages';\nimport * as core from './wasm-core-impl';\nimport { initializeWebAssembly } from './wasm-factory';\nimport {\n  importProxyWorker,\n  inferWasmPathPrefixFromScriptSrc,\n  isEsmImportMetaUrlHardcodedAsFileUri,\n} from './wasm-utils-import';\n\nconst isProxy = (): boolean => !!env.wasm.proxy && typeof document !== 'undefined';\nlet proxyWorker: Worker | undefined;\nlet initializing = false;\nlet initialized = false;\nlet aborted = false;\nlet temporaryObjectUrl: string | undefined;\n\ntype PromiseCallbacks<T = void> = [resolve: (result: T) => void, reject: (reason: unknown) => void];\nlet initWasmCallbacks: PromiseCallbacks;\nconst queuedCallbacks: Map<OrtWasmMessage['type'], Array<PromiseCallbacks<unknown>>> = new Map();\n\nconst enqueueCallbacks = (type: OrtWasmMessage['type'], callbacks: PromiseCallbacks<unknown>): void => {\n  const queue = queuedCallbacks.get(type);\n  if (queue) {\n    queue.push(callbacks);\n  } else {\n    queuedCallbacks.set(type, [callbacks]);\n  }\n};\n\nconst ensureWorker = (): void => {\n  if (initializing || !initialized || aborted || !proxyWorker) {\n    throw new Error('worker not ready');\n  }\n};\n\nconst onProxyWorkerMessage = (ev: MessageEvent<OrtWasmMessage>): void => {\n  switch (ev.data.type) {\n    case 'init-wasm':\n      initializing = false;\n      if (ev.data.err) {\n        aborted = true;\n        initWasmCallbacks[1](ev.data.err);\n      } else {\n        initialized = true;\n        initWasmCallbacks[0]();\n      }\n      if (temporaryObjectUrl) {\n        URL.revokeObjectURL(temporaryObjectUrl);\n        temporaryObjectUrl = undefined;\n      }\n      break;\n    case 'init-ep':\n    case 'copy-from':\n    case 'create':\n    case 'release':\n    case 'run':\n    case 'end-profiling': {\n      const callbacks = queuedCallbacks.get(ev.data.type)!;\n      if (ev.data.err) {\n        callbacks.shift()![1](ev.data.err);\n      } else {\n        callbacks.shift()![0](ev.data.out!);\n      }\n      break;\n    }\n    default:\n  }\n};\n\nexport const initializeWebAssemblyAndOrtRuntime = async (): Promise<void> => {\n  if (initialized) {\n    return;\n  }\n  if (initializing) {\n    throw new Error(\"multiple calls to 'initWasm()' detected.\");\n  }\n  if (aborted) {\n    throw new Error(\"previous call to 'initWasm()' failed.\");\n  }\n\n  initializing = true;\n\n  if (!BUILD_DEFS.DISABLE_WASM_PROXY && isProxy()) {\n    return new Promise<void>((resolve, reject) => {\n      proxyWorker?.terminate();\n\n      void importProxyWorker().then(([objectUrl, worker]) => {\n        try {\n          proxyWorker = worker;\n          proxyWorker.onerror = (ev: ErrorEvent) => reject(ev);\n          proxyWorker.onmessage = onProxyWorkerMessage;\n          initWasmCallbacks = [resolve, reject];\n          const message: OrtWasmMessage = { type: 'init-wasm', in: env };\n\n          // if the proxy worker is loaded from a blob URL, we need to make sure the path information is not lost.\n          //\n          // when `env.wasm.wasmPaths` is not set, we need to pass the path information to the worker.\n          //\n          if (!BUILD_DEFS.ENABLE_BUNDLE_WASM_JS && !message.in!.wasm.wasmPaths && objectUrl) {\n            // for a build not bundled the wasm JS, we need to pass the path prefix to the worker.\n            // the path prefix will be used to resolve the path to both the wasm JS and the wasm file.\n            const inferredWasmPathPrefix = inferWasmPathPrefixFromScriptSrc();\n            if (inferredWasmPathPrefix) {\n              message.in!.wasm.wasmPaths = inferredWasmPathPrefix;\n            }\n          }\n\n          if (\n            BUILD_DEFS.IS_ESM &&\n            BUILD_DEFS.ENABLE_BUNDLE_WASM_JS &&\n            !message.in!.wasm.wasmPaths &&\n            (objectUrl || isEsmImportMetaUrlHardcodedAsFileUri)\n          ) {\n            // for a build bundled the wasm JS, if either of the following conditions is met:\n            // - the proxy worker is loaded from a blob URL\n            // - `import.meta.url` is a file URL, it means it is overwriten by the bundler.\n            //\n            // in either case, the path information is lost, we need to pass the path of the .wasm file to the worker.\n            // we need to use the bundler preferred URL format:\n            // new URL('filename', import.meta.url)\n            // so that the bundler can handle the file using corresponding loaders.\n            message.in!.wasm.wasmPaths = {\n              wasm: !BUILD_DEFS.DISABLE_JSEP\n                ? new URL('ort-wasm-simd-threaded.jsep.wasm', BUILD_DEFS.ESM_IMPORT_META_URL).href\n                : new URL('ort-wasm-simd-threaded.wasm', BUILD_DEFS.ESM_IMPORT_META_URL).href,\n            };\n          }\n          proxyWorker.postMessage(message);\n          temporaryObjectUrl = objectUrl;\n        } catch (e) {\n          reject(e);\n        }\n      }, reject);\n    });\n  } else {\n    try {\n      await initializeWebAssembly(env.wasm);\n      await core.initRuntime(env);\n      initialized = true;\n    } catch (e) {\n      aborted = true;\n      throw e;\n    } finally {\n      initializing = false;\n    }\n  }\n};\n\nexport const initializeOrtEp = async (epName: string): Promise<void> => {\n  if (!BUILD_DEFS.DISABLE_WASM_PROXY && isProxy()) {\n    ensureWorker();\n    return new Promise<void>((resolve, reject) => {\n      enqueueCallbacks('init-ep', [resolve, reject]);\n      const message: OrtWasmMessage = { type: 'init-ep', in: { epName, env } };\n      proxyWorker!.postMessage(message);\n    });\n  } else {\n    await core.initEp(env, epName);\n  }\n};\n\nexport const copyFromExternalBuffer = async (buffer: Uint8Array): Promise<SerializableInternalBuffer> => {\n  if (!BUILD_DEFS.DISABLE_WASM_PROXY && isProxy()) {\n    ensureWorker();\n    return new Promise<SerializableInternalBuffer>((resolve, reject) => {\n      enqueueCallbacks('copy-from', [resolve, reject]);\n      const message: OrtWasmMessage = { type: 'copy-from', in: { buffer } };\n      proxyWorker!.postMessage(message, [buffer.buffer]);\n    });\n  } else {\n    return core.copyFromExternalBuffer(buffer);\n  }\n};\n\nexport const createSession = async (\n  model: SerializableInternalBuffer | Uint8Array,\n  options?: InferenceSession.SessionOptions,\n): Promise<SerializableSessionMetadata> => {\n  if (!BUILD_DEFS.DISABLE_WASM_PROXY && isProxy()) {\n    // check unsupported options\n    if (options?.preferredOutputLocation) {\n      throw new Error('session option \"preferredOutputLocation\" is not supported for proxy.');\n    }\n    ensureWorker();\n    return new Promise<SerializableSessionMetadata>((resolve, reject) => {\n      enqueueCallbacks('create', [resolve, reject]);\n      const message: OrtWasmMessage = { type: 'create', in: { model, options: { ...options } } };\n      const transferable: Transferable[] = [];\n      if (model instanceof Uint8Array) {\n        transferable.push(model.buffer);\n      }\n      proxyWorker!.postMessage(message, transferable);\n    });\n  } else {\n    return core.createSession(model, options);\n  }\n};\n\nexport const releaseSession = async (sessionId: number): Promise<void> => {\n  if (!BUILD_DEFS.DISABLE_WASM_PROXY && isProxy()) {\n    ensureWorker();\n    return new Promise<void>((resolve, reject) => {\n      enqueueCallbacks('release', [resolve, reject]);\n      const message: OrtWasmMessage = { type: 'release', in: sessionId };\n      proxyWorker!.postMessage(message);\n    });\n  } else {\n    core.releaseSession(sessionId);\n  }\n};\n\nexport const run = async (\n  sessionId: number,\n  inputIndices: number[],\n  inputs: TensorMetadata[],\n  outputIndices: number[],\n  outputs: Array<TensorMetadata | null>,\n  options: InferenceSession.RunOptions,\n): Promise<TensorMetadata[]> => {\n  if (!BUILD_DEFS.DISABLE_WASM_PROXY && isProxy()) {\n    // check inputs location\n    if (inputs.some((t) => t[3] !== 'cpu')) {\n      throw new Error('input tensor on GPU is not supported for proxy.');\n    }\n    // check outputs location\n    if (outputs.some((t) => t)) {\n      throw new Error('pre-allocated output tensor is not supported for proxy.');\n    }\n    ensureWorker();\n    return new Promise<SerializableTensorMetadata[]>((resolve, reject) => {\n      enqueueCallbacks('run', [resolve, reject]);\n      const serializableInputs = inputs as SerializableTensorMetadata[]; // every input is on CPU.\n      const message: OrtWasmMessage = {\n        type: 'run',\n        in: { sessionId, inputIndices, inputs: serializableInputs, outputIndices, options },\n      };\n      proxyWorker!.postMessage(message, core.extractTransferableBuffers(serializableInputs));\n    });\n  } else {\n    return core.run(sessionId, inputIndices, inputs, outputIndices, outputs, options);\n  }\n};\n\nexport const endProfiling = async (sessionId: number): Promise<void> => {\n  if (!BUILD_DEFS.DISABLE_WASM_PROXY && isProxy()) {\n    ensureWorker();\n    return new Promise<void>((resolve, reject) => {\n      enqueueCallbacks('end-profiling', [resolve, reject]);\n      const message: OrtWasmMessage = { type: 'end-profiling', in: sessionId };\n      proxyWorker!.postMessage(message);\n    });\n  } else {\n    core.endProfiling(sessionId);\n  }\n};\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport {\n  InferenceSession,\n  InferenceSessionHandler,\n  SessionHandler,\n  Tensor,\n  TRACE_FUNC_BEGIN,\n  TRACE_FUNC_END,\n} from 'onnxruntime-common';\n\nimport { SerializableInternalBuffer, TensorMetadata } from './proxy-messages';\nimport { copyFromExternalBuffer, createSession, endProfiling, releaseSession, run } from './proxy-wrapper';\nimport { isGpuBufferSupportedType, isMLTensorSupportedType } from './wasm-common';\nimport { isNode } from './wasm-utils-env';\nimport { loadFile } from './wasm-utils-load-file';\n\nexport const encodeTensorMetadata = (tensor: Tensor, getName: () => string): TensorMetadata => {\n  switch (tensor.location) {\n    case 'cpu':\n      return [tensor.type, tensor.dims, tensor.data, 'cpu'];\n    case 'gpu-buffer':\n      return [tensor.type, tensor.dims, { gpuBuffer: tensor.gpuBuffer }, 'gpu-buffer'];\n    case 'ml-tensor':\n      return [tensor.type, tensor.dims, { mlTensor: tensor.mlTensor }, 'ml-tensor'];\n    default:\n      throw new Error(`invalid data location: ${tensor.location} for ${getName()}`);\n  }\n};\n\nexport const decodeTensorMetadata = (tensor: TensorMetadata): Tensor => {\n  switch (tensor[3]) {\n    case 'cpu':\n      return new Tensor(tensor[0], tensor[2], tensor[1]);\n    case 'gpu-buffer': {\n      const dataType = tensor[0];\n      if (!isGpuBufferSupportedType(dataType)) {\n        throw new Error(`not supported data type: ${dataType} for deserializing GPU tensor`);\n      }\n      const { gpuBuffer, download, dispose } = tensor[2];\n      return Tensor.fromGpuBuffer(gpuBuffer, { dataType, dims: tensor[1], download, dispose });\n    }\n    case 'ml-tensor': {\n      const dataType = tensor[0];\n      if (!isMLTensorSupportedType(dataType)) {\n        throw new Error(`not supported data type: ${dataType} for deserializing MLTensor tensor`);\n      }\n      const { mlTensor, download, dispose } = tensor[2];\n      return Tensor.fromMLTensor(mlTensor, { dataType, dims: tensor[1], download, dispose });\n    }\n    default:\n      throw new Error(`invalid data location: ${tensor[3]}`);\n  }\n};\n\nexport class OnnxruntimeWebAssemblySessionHandler implements InferenceSessionHandler {\n  private sessionId: number;\n\n  inputNames: readonly string[];\n  outputNames: readonly string[];\n  inputMetadata: readonly InferenceSession.ValueMetadata[];\n  outputMetadata: readonly InferenceSession.ValueMetadata[];\n\n  async fetchModelAndCopyToWasmMemory(path: string): Promise<SerializableInternalBuffer> {\n    // fetch model from url and move to wasm heap.\n    return copyFromExternalBuffer(await loadFile(path));\n  }\n\n  async loadModel(pathOrBuffer: string | Uint8Array, options?: InferenceSession.SessionOptions): Promise<void> {\n    TRACE_FUNC_BEGIN();\n    let model: Parameters<typeof createSession>[0];\n\n    if (typeof pathOrBuffer === 'string') {\n      if (isNode) {\n        // node\n        model = await loadFile(pathOrBuffer);\n      } else {\n        // browser\n        // fetch model and copy to wasm heap.\n        model = await this.fetchModelAndCopyToWasmMemory(pathOrBuffer);\n      }\n    } else {\n      model = pathOrBuffer;\n    }\n\n    [this.sessionId, this.inputNames, this.outputNames, this.inputMetadata, this.outputMetadata] = await createSession(\n      model,\n      options,\n    );\n    TRACE_FUNC_END();\n  }\n\n  async dispose(): Promise<void> {\n    return releaseSession(this.sessionId);\n  }\n\n  async run(\n    feeds: SessionHandler.FeedsType,\n    fetches: SessionHandler.FetchesType,\n    options: InferenceSession.RunOptions,\n  ): Promise<SessionHandler.ReturnType> {\n    TRACE_FUNC_BEGIN();\n    const inputArray: Tensor[] = [];\n    const inputIndices: number[] = [];\n    Object.entries(feeds).forEach((kvp) => {\n      const name = kvp[0];\n      const tensor = kvp[1];\n      const index = this.inputNames.indexOf(name);\n      if (index === -1) {\n        throw new Error(`invalid input '${name}'`);\n      }\n      inputArray.push(tensor);\n      inputIndices.push(index);\n    });\n\n    const outputArray: Array<Tensor | null> = [];\n    const outputIndices: number[] = [];\n    Object.entries(fetches).forEach((kvp) => {\n      const name = kvp[0];\n      const tensor = kvp[1];\n      const index = this.outputNames.indexOf(name);\n      if (index === -1) {\n        throw new Error(`invalid output '${name}'`);\n      }\n      outputArray.push(tensor);\n      outputIndices.push(index);\n    });\n\n    const inputs = inputArray.map((t, i) =>\n      encodeTensorMetadata(t, () => `input \"${this.inputNames[inputIndices[i]]}\"`),\n    );\n    const outputs = outputArray.map((t, i) =>\n      t ? encodeTensorMetadata(t, () => `output \"${this.outputNames[outputIndices[i]]}\"`) : null,\n    );\n\n    const results = await run(this.sessionId, inputIndices, inputs, outputIndices, outputs, options);\n\n    const resultMap: SessionHandler.ReturnType = {};\n    for (let i = 0; i < results.length; i++) {\n      resultMap[this.outputNames[outputIndices[i]]] = outputArray[i] ?? decodeTensorMetadata(results[i]);\n    }\n    TRACE_FUNC_END();\n    return resultMap;\n  }\n\n  startProfiling(): void {\n    // TODO: implement profiling\n  }\n\n  endProfiling(): void {\n    void endProfiling(this.sessionId);\n  }\n}\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { Backend, env, InferenceSession, InferenceSessionHandler } from 'onnxruntime-common';\n\nimport { initializeOrtEp, initializeWebAssemblyAndOrtRuntime } from './wasm/proxy-wrapper';\nimport { OnnxruntimeWebAssemblySessionHandler } from './wasm/session-handler-inference';\n\n/**\n * This function initializes all flags for WebAssembly.\n *\n * Those flags are accessible from `ort.env.wasm`. Users are allow to set those flags before the first inference session\n * being created, to override default value.\n */\nexport const initializeFlags = (): void => {\n  if (typeof env.wasm.initTimeout !== 'number' || env.wasm.initTimeout < 0) {\n    env.wasm.initTimeout = 0;\n  }\n\n  const simd = env.wasm.simd;\n  if (typeof simd !== 'boolean' && simd !== undefined && simd !== 'fixed' && simd !== 'relaxed') {\n    // eslint-disable-next-line no-console\n    console.warn(\n      `Property \"env.wasm.simd\" is set to unknown value \"${simd}\". Reset it to \\`false\\` and ignore SIMD feature checking.`,\n    );\n    env.wasm.simd = false;\n  }\n\n  if (typeof env.wasm.proxy !== 'boolean') {\n    env.wasm.proxy = false;\n  }\n\n  if (typeof env.wasm.trace !== 'boolean') {\n    env.wasm.trace = false;\n  }\n\n  if (typeof env.wasm.numThreads !== 'number' || !Number.isInteger(env.wasm.numThreads) || env.wasm.numThreads <= 0) {\n    // The following logic only applies when `ort.env.wasm.numThreads` is not set by user. We will always honor user's\n    // setting if it is provided.\n\n    // Browser: when crossOriginIsolated is false, SharedArrayBuffer is not available so WebAssembly threads will not\n    // work. In this case, we will set numThreads to 1.\n    //\n    // There is an exception: when the browser is configured to force-enable SharedArrayBuffer (e.g. Chromuim with\n    // --enable-features=SharedArrayBuffer), it is possible that `self.crossOriginIsolated` is false and\n    // SharedArrayBuffer is available at the same time. This is usually for testing. In this case,  we will still set\n    // numThreads to 1 here. If we want to enable multi-threading in test, we should set `ort.env.wasm.numThreads` to a\n    // value greater than 1.\n    if (typeof self !== 'undefined' && !self.crossOriginIsolated) {\n      env.wasm.numThreads = 1;\n    } else {\n      const numCpuLogicalCores =\n        typeof navigator === 'undefined' ? require('node:os').cpus().length : navigator.hardwareConcurrency;\n      env.wasm.numThreads = Math.min(4, Math.ceil((numCpuLogicalCores || 1) / 2));\n    }\n  }\n};\n\nexport class OnnxruntimeWebAssemblyBackend implements Backend {\n  /**\n   * This function initializes the WebAssembly backend.\n   *\n   * This function will be called only once for each backend name. It will be called the first time when\n   * `ort.InferenceSession.create()` is called with a registered backend name.\n   *\n   * @param backendName - the registered backend name.\n   */\n  async init(backendName: string): Promise<void> {\n    // populate wasm flags\n    initializeFlags();\n\n    // init wasm\n    await initializeWebAssemblyAndOrtRuntime();\n\n    // performe EP specific initialization\n    await initializeOrtEp(backendName);\n  }\n  createInferenceSessionHandler(\n    path: string,\n    options?: InferenceSession.SessionOptions,\n  ): Promise<InferenceSessionHandler>;\n  createInferenceSessionHandler(\n    buffer: Uint8Array,\n    options?: InferenceSession.SessionOptions,\n  ): Promise<InferenceSessionHandler>;\n  async createInferenceSessionHandler(\n    pathOrBuffer: string | Uint8Array,\n    options?: InferenceSession.SessionOptions,\n  ): Promise<InferenceSessionHandler> {\n    const handler = new OnnxruntimeWebAssemblySessionHandler();\n    await handler.loadModel(pathOrBuffer, options);\n    return handler;\n  }\n}\n\nexport const wasmBackend = new OnnxruntimeWebAssemblyBackend();\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\n/* eslint-disable @typescript-eslint/no-var-requires, @typescript-eslint/no-require-imports */\n\n// We use \"require\" instead of \"import\" here because import statement must be put in top level. Our current code does\n// not allow bundler to tree-shaking code as expected because some codes are treated as having side effects.\n// So we import code inside the if-clause to allow bundler remove the code safely.\n\nexport * from 'onnxruntime-common';\nimport * as ort from 'onnxruntime-common';\nexport default ort;\n\nimport { registerBackend, env } from 'onnxruntime-common';\nimport { version } from './version';\n\nif (!BUILD_DEFS.DISABLE_WEBGL) {\n  const onnxjsBackend = require('./backend-onnxjs').onnxjsBackend;\n  registerBackend('webgl', onnxjsBackend, -10);\n}\n\nif (!BUILD_DEFS.DISABLE_WASM) {\n  const wasmBackend = require('./backend-wasm').wasmBackend;\n  if (!BUILD_DEFS.DISABLE_JSEP) {\n    registerBackend('webgpu', wasmBackend, 5);\n    registerBackend('webnn', wasmBackend, 5);\n  }\n  registerBackend('cpu', wasmBackend, 10);\n  registerBackend('wasm', wasmBackend, 10);\n}\n\nObject.defineProperty(env.versions, 'web', { value: version, enumerable: true });\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\n// This file is generated by /js/scripts/update-version.ts\n// Do not modify file content manually.\n\nexport const version = '1.22.0-dev.20250409-89f8206ba4';\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\n// This file is generated by /js/scripts/update-version.ts\n// Do not modify file content manually.\n\nexport const version = '1.25.1';\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { Env } from './env.js';\nimport { version } from './version.js';\n\ntype LogLevelType = Env['logLevel'];\n\nlet logLevelValue: Required<LogLevelType> = 'warning';\n\nexport const env: Env = {\n  wasm: {} as Env.WebAssemblyFlags,\n  webgl: {} as Env.WebGLFlags,\n  webgpu: {} as Env.WebGpuFlags,\n  versions: { common: version },\n\n  set logLevel(value: LogLevelType) {\n    if (value === undefined) {\n      return;\n    }\n    if (typeof value !== 'string' || ['verbose', 'info', 'warning', 'error', 'fatal'].indexOf(value) === -1) {\n      throw new Error(`Unsupported logging level: ${value}`);\n    }\n    logLevelValue = value;\n  },\n  get logLevel(): Required<LogLevelType> {\n    return logLevelValue;\n  },\n};\n\n// set property 'logLevel' so that they can be correctly transferred to worker by `postMessage()`.\nObject.defineProperty(env, 'logLevel', { enumerable: true });\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { TensorToDataUrlOptions, TensorToImageDataOptions } from './tensor-conversion.js';\nimport { Tensor } from './tensor.js';\n\n/**\n * implementation of Tensor.toDataURL()\n */\nexport const tensorToDataURL = (tensor: Tensor, options?: TensorToDataUrlOptions): string => {\n  const canvas = typeof document !== 'undefined' ? document.createElement('canvas') : new OffscreenCanvas(1, 1);\n  canvas.width = tensor.dims[3];\n  canvas.height = tensor.dims[2];\n  const pixels2DContext = canvas.getContext('2d') as\n    | CanvasRenderingContext2D\n    | OffscreenCanvasRenderingContext2D\n    | null;\n\n  if (pixels2DContext != null) {\n    // Default values for height and width & format\n    let width: number;\n    let height: number;\n    if (options?.tensorLayout !== undefined && options.tensorLayout === 'NHWC') {\n      width = tensor.dims[2];\n      height = tensor.dims[3];\n    } else {\n      // Default layout is NCWH\n      width = tensor.dims[3];\n      height = tensor.dims[2];\n    }\n\n    const inputformat = options?.format !== undefined ? options.format : 'RGB';\n\n    const norm = options?.norm;\n    let normMean: [number, number, number, number];\n    let normBias: [number, number, number, number];\n    if (norm === undefined || norm.mean === undefined) {\n      normMean = [255, 255, 255, 255];\n    } else {\n      if (typeof norm.mean === 'number') {\n        normMean = [norm.mean, norm.mean, norm.mean, norm.mean];\n      } else {\n        normMean = [norm.mean[0], norm.mean[1], norm.mean[2], 0];\n        if (norm.mean[3] !== undefined) {\n          normMean[3] = norm.mean[3];\n        }\n      }\n    }\n    if (norm === undefined || norm.bias === undefined) {\n      normBias = [0, 0, 0, 0];\n    } else {\n      if (typeof norm.bias === 'number') {\n        normBias = [norm.bias, norm.bias, norm.bias, norm.bias];\n      } else {\n        normBias = [norm.bias[0], norm.bias[1], norm.bias[2], 0];\n        if (norm.bias[3] !== undefined) {\n          normBias[3] = norm.bias[3];\n        }\n      }\n    }\n\n    const stride = height * width;\n    // Default pointer assignments\n    let rTensorPointer = 0,\n      gTensorPointer = stride,\n      bTensorPointer = stride * 2,\n      aTensorPointer = -1;\n\n    // Updating the pointer assignments based on the input image format\n    if (inputformat === 'RGBA') {\n      rTensorPointer = 0;\n      gTensorPointer = stride;\n      bTensorPointer = stride * 2;\n      aTensorPointer = stride * 3;\n    } else if (inputformat === 'RGB') {\n      rTensorPointer = 0;\n      gTensorPointer = stride;\n      bTensorPointer = stride * 2;\n    } else if (inputformat === 'RBG') {\n      rTensorPointer = 0;\n      bTensorPointer = stride;\n      gTensorPointer = stride * 2;\n    }\n\n    for (let i = 0; i < height; i++) {\n      for (let j = 0; j < width; j++) {\n        const R = ((tensor.data[rTensorPointer++] as number) - normBias[0]) * normMean[0]; // R value\n        const G = ((tensor.data[gTensorPointer++] as number) - normBias[1]) * normMean[1]; // G value\n        const B = ((tensor.data[bTensorPointer++] as number) - normBias[2]) * normMean[2]; // B value\n        const A = aTensorPointer === -1 ? 255 : ((tensor.data[aTensorPointer++] as number) - normBias[3]) * normMean[3]; // A value\n\n        pixels2DContext.fillStyle = 'rgba(' + R + ',' + G + ',' + B + ',' + A + ')';\n        pixels2DContext.fillRect(j, i, 1, 1);\n      }\n    }\n    if ('toDataURL' in canvas) {\n      return canvas.toDataURL();\n    } else {\n      throw new Error('toDataURL is not supported');\n    }\n  } else {\n    throw new Error('Can not access image data');\n  }\n};\n\n/**\n * implementation of Tensor.toImageData()\n */\nexport const tensorToImageData = (tensor: Tensor, options?: TensorToImageDataOptions): ImageData => {\n  const pixels2DContext =\n    typeof document !== 'undefined'\n      ? document.createElement('canvas').getContext('2d')\n      : (new OffscreenCanvas(1, 1).getContext('2d') as OffscreenCanvasRenderingContext2D);\n  let image: ImageData;\n  if (pixels2DContext != null) {\n    // Default values for height and width & format\n    let width: number;\n    let height: number;\n    let channels: number;\n    if (options?.tensorLayout !== undefined && options.tensorLayout === 'NHWC') {\n      width = tensor.dims[2];\n      height = tensor.dims[1];\n      channels = tensor.dims[3];\n    } else {\n      // Default layout is NCWH\n      width = tensor.dims[3];\n      height = tensor.dims[2];\n      channels = tensor.dims[1];\n    }\n    const inputformat = options !== undefined ? (options.format !== undefined ? options.format : 'RGB') : 'RGB';\n\n    const norm = options?.norm;\n    let normMean: [number, number, number, number];\n    let normBias: [number, number, number, number];\n    if (norm === undefined || norm.mean === undefined) {\n      normMean = [255, 255, 255, 255];\n    } else {\n      if (typeof norm.mean === 'number') {\n        normMean = [norm.mean, norm.mean, norm.mean, norm.mean];\n      } else {\n        normMean = [norm.mean[0], norm.mean[1], norm.mean[2], 255];\n        if (norm.mean[3] !== undefined) {\n          normMean[3] = norm.mean[3];\n        }\n      }\n    }\n    if (norm === undefined || norm.bias === undefined) {\n      normBias = [0, 0, 0, 0];\n    } else {\n      if (typeof norm.bias === 'number') {\n        normBias = [norm.bias, norm.bias, norm.bias, norm.bias];\n      } else {\n        normBias = [norm.bias[0], norm.bias[1], norm.bias[2], 0];\n        if (norm.bias[3] !== undefined) {\n          normBias[3] = norm.bias[3];\n        }\n      }\n    }\n\n    const stride = height * width;\n    if (options !== undefined) {\n      if (\n        (options.format !== undefined && channels === 4 && options.format !== 'RGBA') ||\n        (channels === 3 && options.format !== 'RGB' && options.format !== 'BGR')\n      ) {\n        throw new Error(\"Tensor format doesn't match input tensor dims\");\n      }\n    }\n\n    // Default pointer assignments\n    const step = 4;\n    let rImagePointer = 0,\n      gImagePointer = 1,\n      bImagePointer = 2,\n      aImagePointer = 3;\n    let rTensorPointer = 0,\n      gTensorPointer = stride,\n      bTensorPointer = stride * 2,\n      aTensorPointer = -1;\n\n    // Updating the pointer assignments based on the input image format\n    if (inputformat === 'RGBA') {\n      rTensorPointer = 0;\n      gTensorPointer = stride;\n      bTensorPointer = stride * 2;\n      aTensorPointer = stride * 3;\n    } else if (inputformat === 'RGB') {\n      rTensorPointer = 0;\n      gTensorPointer = stride;\n      bTensorPointer = stride * 2;\n    } else if (inputformat === 'RBG') {\n      rTensorPointer = 0;\n      bTensorPointer = stride;\n      gTensorPointer = stride * 2;\n    }\n\n    image = pixels2DContext.createImageData(width, height);\n\n    for (\n      let i = 0;\n      i < height * width;\n      rImagePointer += step, gImagePointer += step, bImagePointer += step, aImagePointer += step, i++\n    ) {\n      image.data[rImagePointer] = ((tensor.data[rTensorPointer++] as number) - normBias[0]) * normMean[0]; // R value\n      image.data[gImagePointer] = ((tensor.data[gTensorPointer++] as number) - normBias[1]) * normMean[1]; // G value\n      image.data[bImagePointer] = ((tensor.data[bTensorPointer++] as number) - normBias[2]) * normMean[2]; // B value\n      image.data[aImagePointer] =\n        aTensorPointer === -1 ? 255 : ((tensor.data[aTensorPointer++] as number) - normBias[3]) * normMean[3]; // A value\n    }\n  } else {\n    throw new Error('Can not access image data');\n  }\n  return image;\n};\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport {\n  OptionsDimensions,\n  OptionsFormat,\n  OptionsNormalizationParameters,\n  OptionsTensorFormat,\n  OptionsTensorLayout,\n  TensorFromGpuBufferOptions,\n  TensorFromImageBitmapOptions,\n  TensorFromImageDataOptions,\n  TensorFromImageElementOptions,\n  TensorFromMLTensorOptions,\n  TensorFromTextureOptions,\n  TensorFromUrlOptions,\n} from './tensor-factory.js';\nimport { Tensor } from './tensor-impl.js';\nimport { Tensor as TensorInterface } from './tensor.js';\n\ninterface BufferToTensorOptions\n  extends OptionsDimensions,\n    OptionsTensorLayout,\n    OptionsNormalizationParameters,\n    OptionsFormat,\n    OptionsTensorFormat {}\n\n/**\n * Create a new tensor object from image object\n *\n * @param buffer - Extracted image buffer data - assuming RGBA format\n * @param imageFormat - input image configuration - required configurations height, width, format\n * @param tensorFormat - output tensor configuration - Default is RGB format\n */\nexport const bufferToTensor = (buffer: Uint8ClampedArray | undefined, options: BufferToTensorOptions): Tensor => {\n  if (buffer === undefined) {\n    throw new Error('Image buffer must be defined');\n  }\n  if (options.height === undefined || options.width === undefined) {\n    throw new Error('Image height and width must be defined');\n  }\n  if (options.tensorLayout === 'NHWC') {\n    throw new Error('NHWC Tensor layout is not supported yet');\n  }\n\n  const { height, width } = options;\n\n  const norm = options.norm ?? { mean: 255, bias: 0 };\n  let normMean: [number, number, number, number];\n  let normBias: [number, number, number, number];\n\n  if (typeof norm.mean === 'number') {\n    normMean = [norm.mean, norm.mean, norm.mean, norm.mean];\n  } else {\n    normMean = [norm.mean![0], norm.mean![1], norm.mean![2], norm.mean![3] ?? 255];\n  }\n\n  if (typeof norm.bias === 'number') {\n    normBias = [norm.bias, norm.bias, norm.bias, norm.bias];\n  } else {\n    normBias = [norm.bias![0], norm.bias![1], norm.bias![2], norm.bias![3] ?? 0];\n  }\n\n  const inputformat = options.format !== undefined ? options.format : 'RGBA';\n  // default value is RGBA since imagedata and HTMLImageElement uses it\n\n  const outputformat =\n    options.tensorFormat !== undefined ? (options.tensorFormat !== undefined ? options.tensorFormat : 'RGB') : 'RGB';\n  const stride = height * width;\n  const float32Data = outputformat === 'RGBA' ? new Float32Array(stride * 4) : new Float32Array(stride * 3);\n\n  // Default pointer assignments\n  let step = 4,\n    rImagePointer = 0,\n    gImagePointer = 1,\n    bImagePointer = 2,\n    aImagePointer = 3;\n  let rTensorPointer = 0,\n    gTensorPointer = stride,\n    bTensorPointer = stride * 2,\n    aTensorPointer = -1;\n\n  // Updating the pointer assignments based on the input image format\n  if (inputformat === 'RGB') {\n    step = 3;\n    rImagePointer = 0;\n    gImagePointer = 1;\n    bImagePointer = 2;\n    aImagePointer = -1;\n  }\n\n  // Updating the pointer assignments based on the output tensor format\n  if (outputformat === 'RGBA') {\n    aTensorPointer = stride * 3;\n  } else if (outputformat === 'RBG') {\n    rTensorPointer = 0;\n    bTensorPointer = stride;\n    gTensorPointer = stride * 2;\n  } else if (outputformat === 'BGR') {\n    bTensorPointer = 0;\n    gTensorPointer = stride;\n    rTensorPointer = stride * 2;\n  }\n\n  for (\n    let i = 0;\n    i < stride;\n    i++, rImagePointer += step, bImagePointer += step, gImagePointer += step, aImagePointer += step\n  ) {\n    float32Data[rTensorPointer++] = (buffer[rImagePointer] + normBias[0]) / normMean[0];\n    float32Data[gTensorPointer++] = (buffer[gImagePointer] + normBias[1]) / normMean[1];\n    float32Data[bTensorPointer++] = (buffer[bImagePointer] + normBias[2]) / normMean[2];\n    if (aTensorPointer !== -1 && aImagePointer !== -1) {\n      float32Data[aTensorPointer++] = (buffer[aImagePointer] + normBias[3]) / normMean[3];\n    }\n  }\n\n  // Float32Array -> ort.Tensor\n  const outputTensor =\n    outputformat === 'RGBA'\n      ? new Tensor('float32', float32Data, [1, 4, height, width])\n      : new Tensor('float32', float32Data, [1, 3, height, width]);\n  return outputTensor;\n};\n\n/**\n * implementation of Tensor.fromImage().\n */\nexport const tensorFromImage = async (\n  image: ImageData | HTMLImageElement | ImageBitmap | string,\n  options?:\n    | TensorFromImageDataOptions\n    | TensorFromImageElementOptions\n    | TensorFromImageBitmapOptions\n    | TensorFromUrlOptions,\n): Promise<Tensor> => {\n  // checking the type of image object\n  const isHTMLImageEle = typeof HTMLImageElement !== 'undefined' && image instanceof HTMLImageElement;\n  const isImageDataEle = typeof ImageData !== 'undefined' && image instanceof ImageData;\n  const isImageBitmap = typeof ImageBitmap !== 'undefined' && image instanceof ImageBitmap;\n  const isString = typeof image === 'string';\n\n  let data: Uint8ClampedArray | undefined;\n  let bufferToTensorOptions: BufferToTensorOptions = options ?? {};\n\n  const createCanvas = () => {\n    if (typeof document !== 'undefined') {\n      return document.createElement('canvas');\n    } else if (typeof OffscreenCanvas !== 'undefined') {\n      return new OffscreenCanvas(1, 1);\n    } else {\n      throw new Error('Canvas is not supported');\n    }\n  };\n  const createCanvasContext = (canvas: HTMLCanvasElement | OffscreenCanvas) => {\n    if (typeof HTMLCanvasElement !== 'undefined' && canvas instanceof HTMLCanvasElement) {\n      return canvas.getContext('2d');\n    } else if (canvas instanceof OffscreenCanvas) {\n      return canvas.getContext('2d') as OffscreenCanvasRenderingContext2D;\n    } else {\n      return null;\n    }\n  };\n  // filling and checking image configuration options\n  if (isHTMLImageEle) {\n    // HTMLImageElement - image object - format is RGBA by default\n    const canvas = createCanvas();\n    canvas.width = image.width;\n    canvas.height = image.height;\n    const pixels2DContext = createCanvasContext(canvas);\n\n    if (pixels2DContext != null) {\n      let height = image.height;\n      let width = image.width;\n      if (options !== undefined && options.resizedHeight !== undefined && options.resizedWidth !== undefined) {\n        height = options.resizedHeight;\n        width = options.resizedWidth;\n      }\n\n      if (options !== undefined) {\n        bufferToTensorOptions = options;\n        if (options.tensorFormat !== undefined) {\n          throw new Error('Image input config format must be RGBA for HTMLImageElement');\n        } else {\n          bufferToTensorOptions.tensorFormat = 'RGBA';\n        }\n        bufferToTensorOptions.height = height;\n        bufferToTensorOptions.width = width;\n      } else {\n        bufferToTensorOptions.tensorFormat = 'RGBA';\n        bufferToTensorOptions.height = height;\n        bufferToTensorOptions.width = width;\n      }\n\n      pixels2DContext.drawImage(image, 0, 0);\n      data = pixels2DContext.getImageData(0, 0, width, height).data;\n    } else {\n      throw new Error('Can not access image data');\n    }\n  } else if (isImageDataEle) {\n    let height: number;\n    let width: number;\n\n    if (options !== undefined && options.resizedWidth !== undefined && options.resizedHeight !== undefined) {\n      height = options.resizedHeight;\n      width = options.resizedWidth;\n    } else {\n      height = image.height;\n      width = image.width;\n    }\n\n    if (options !== undefined) {\n      bufferToTensorOptions = options;\n    }\n    bufferToTensorOptions.format = 'RGBA';\n    bufferToTensorOptions.height = height;\n    bufferToTensorOptions.width = width;\n\n    if (options !== undefined) {\n      const tempCanvas = createCanvas();\n\n      tempCanvas.width = width;\n      tempCanvas.height = height;\n\n      const pixels2DContext = createCanvasContext(tempCanvas);\n\n      if (pixels2DContext != null) {\n        pixels2DContext.putImageData(image, 0, 0);\n        data = pixels2DContext.getImageData(0, 0, width, height).data;\n      } else {\n        throw new Error('Can not access image data');\n      }\n    } else {\n      data = image.data;\n    }\n  } else if (isImageBitmap) {\n    // ImageBitmap - image object - format must be provided by user\n    if (options === undefined) {\n      throw new Error('Please provide image config with format for Imagebitmap');\n    }\n\n    const canvas = createCanvas();\n    canvas.width = image.width;\n    canvas.height = image.height;\n    const pixels2DContext = createCanvasContext(canvas);\n\n    if (pixels2DContext != null) {\n      const height = image.height;\n      const width = image.width;\n      pixels2DContext.drawImage(image, 0, 0, width, height);\n      data = pixels2DContext.getImageData(0, 0, width, height).data;\n      bufferToTensorOptions.height = height;\n      bufferToTensorOptions.width = width;\n      return bufferToTensor(data, bufferToTensorOptions);\n    } else {\n      throw new Error('Can not access image data');\n    }\n  } else if (isString) {\n    return new Promise((resolve, reject) => {\n      const canvas = createCanvas();\n      const context = createCanvasContext(canvas);\n      if (!image || !context) {\n        return reject();\n      }\n      const newImage = new Image();\n      newImage.crossOrigin = 'Anonymous';\n      newImage.src = image;\n      newImage.onload = () => {\n        canvas.width = newImage.width;\n        canvas.height = newImage.height;\n        context.drawImage(newImage, 0, 0, canvas.width, canvas.height);\n        const img = context.getImageData(0, 0, canvas.width, canvas.height);\n\n        bufferToTensorOptions.height = canvas.height;\n        bufferToTensorOptions.width = canvas.width;\n        resolve(bufferToTensor(img.data, bufferToTensorOptions));\n      };\n    });\n  } else {\n    throw new Error('Input data provided is not supported - aborted tensor creation');\n  }\n\n  if (data !== undefined) {\n    return bufferToTensor(data, bufferToTensorOptions);\n  } else {\n    throw new Error('Input data provided is not supported - aborted tensor creation');\n  }\n};\n\n/**\n * implementation of Tensor.fromTexture().\n */\nexport const tensorFromTexture = <T extends TensorInterface.TextureDataTypes>(\n  texture: TensorInterface.TextureType,\n  options: TensorFromTextureOptions<T>,\n): Tensor => {\n  const { width, height, download, dispose } = options;\n  // Always assume RGBAF32. TODO: support different texture format\n  const dims = [1, height, width, 4];\n  return new Tensor({ location: 'texture', type: 'float32', texture, dims, download, dispose });\n};\n\n/**\n * implementation of Tensor.fromGpuBuffer().\n */\nexport const tensorFromGpuBuffer = <T extends TensorInterface.GpuBufferDataTypes>(\n  gpuBuffer: TensorInterface.GpuBufferType,\n  options: TensorFromGpuBufferOptions<T>,\n): Tensor => {\n  const { dataType, dims, download, dispose } = options;\n  return new Tensor({ location: 'gpu-buffer', type: dataType ?? 'float32', gpuBuffer, dims, download, dispose });\n};\n\n/**\n * implementation of Tensor.fromMLTensor().\n */\nexport const tensorFromMLTensor = <T extends TensorInterface.MLTensorDataTypes>(\n  mlTensor: TensorInterface.MLTensorType,\n  options: TensorFromMLTensorOptions<T>,\n): Tensor => {\n  const { dataType, dims, download, dispose } = options;\n  return new Tensor({ location: 'ml-tensor', type: dataType ?? 'float32', mlTensor, dims, download, dispose });\n};\n\n/**\n * implementation of Tensor.fromPinnedBuffer().\n */\nexport const tensorFromPinnedBuffer = <T extends TensorInterface.CpuPinnedDataTypes>(\n  type: T,\n  buffer: TensorInterface.DataTypeMap[T],\n  dims?: readonly number[],\n): Tensor => new Tensor({ location: 'cpu-pinned', type, data: buffer, dims: dims ?? [buffer.length] });\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { Tensor } from './tensor.js';\n\nexport type SupportedTypedArrayConstructors =\n  | Float32ArrayConstructor\n  | Uint8ArrayConstructor\n  | Int8ArrayConstructor\n  | Uint16ArrayConstructor\n  | Int16ArrayConstructor\n  | Int32ArrayConstructor\n  | BigInt64ArrayConstructor\n  | Uint8ArrayConstructor\n  | Float64ArrayConstructor\n  | Uint32ArrayConstructor\n  | BigUint64ArrayConstructor;\nexport type SupportedTypedArray = InstanceType<SupportedTypedArrayConstructors>;\n\n// a runtime map that maps type string to TypedArray constructor. Should match Tensor.DataTypeMap.\nexport const NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP = new Map<string, SupportedTypedArrayConstructors>([\n  ['float32', Float32Array],\n  ['uint8', Uint8Array],\n  ['int8', Int8Array],\n  ['uint16', Uint16Array],\n  ['int16', Int16Array],\n  ['int32', Int32Array],\n  ['bool', Uint8Array],\n  ['float64', Float64Array],\n  ['uint32', Uint32Array],\n  ['int4', Uint8Array],\n  ['uint4', Uint8Array],\n]);\n\n// a runtime map that maps type string to TypedArray constructor. Should match Tensor.DataTypeMap.\nexport const NUMERIC_TENSOR_TYPEDARRAY_TO_TYPE_MAP = new Map<SupportedTypedArrayConstructors, Tensor.Type>([\n  [Float32Array, 'float32'],\n  [Uint8Array, 'uint8'],\n  [Int8Array, 'int8'],\n  [Uint16Array, 'uint16'],\n  [Int16Array, 'int16'],\n  [Int32Array, 'int32'],\n  [Float64Array, 'float64'],\n  [Uint32Array, 'uint32'],\n]);\n\n// the following code allows delaying execution of BigInt/Float16Array checking. This allows lazy initialization for\n// NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP and NUMERIC_TENSOR_TYPEDARRAY_TO_TYPE_MAP, which allows BigInt/Float16Array\n// polyfill if available.\nlet isTypedArrayChecked = false;\nexport const checkTypedArray = () => {\n  if (!isTypedArrayChecked) {\n    isTypedArrayChecked = true;\n    const isBigInt64ArrayAvailable = typeof BigInt64Array !== 'undefined' && BigInt64Array.from;\n    const isBigUint64ArrayAvailable = typeof BigUint64Array !== 'undefined' && BigUint64Array.from;\n\n    // eslint-disable-next-line @typescript-eslint/naming-convention, @typescript-eslint/no-explicit-any\n    const Float16Array = (globalThis as any).Float16Array;\n    const isFloat16ArrayAvailable = typeof Float16Array !== 'undefined' && Float16Array.from;\n\n    if (isBigInt64ArrayAvailable) {\n      NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP.set('int64', BigInt64Array);\n      NUMERIC_TENSOR_TYPEDARRAY_TO_TYPE_MAP.set(BigInt64Array, 'int64');\n    }\n    if (isBigUint64ArrayAvailable) {\n      NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP.set('uint64', BigUint64Array);\n      NUMERIC_TENSOR_TYPEDARRAY_TO_TYPE_MAP.set(BigUint64Array, 'uint64');\n    }\n    if (isFloat16ArrayAvailable) {\n      NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP.set('float16', Float16Array);\n      NUMERIC_TENSOR_TYPEDARRAY_TO_TYPE_MAP.set(Float16Array, 'float16');\n    } else {\n      // if Float16Array is not available, use 'Uint16Array' to store the data.\n      NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP.set('float16', Uint16Array);\n    }\n  }\n};\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport {\n  CpuPinnedConstructorParameters,\n  GpuBufferConstructorParameters,\n  MLTensorConstructorParameters,\n  TextureConstructorParameters,\n} from './tensor-factory.js';\nimport { Tensor } from './tensor-impl.js';\n\n/**\n * calculate size from dims.\n *\n * @param dims the dims array. May be an illegal input.\n */\nexport const calculateSize = (dims: readonly unknown[]): number => {\n  let size = 1;\n  for (let i = 0; i < dims.length; i++) {\n    const dim = dims[i];\n    if (typeof dim !== 'number' || !Number.isSafeInteger(dim)) {\n      throw new TypeError(`dims[${i}] must be an integer, got: ${dim}`);\n    }\n    if (dim < 0) {\n      throw new RangeError(`dims[${i}] must be a non-negative integer, got: ${dim}`);\n    }\n    size *= dim;\n  }\n  return size;\n};\n\n/**\n * implementation of Tensor.reshape()\n */\nexport const tensorReshape = (tensor: Tensor, dims: readonly number[]): Tensor => {\n  switch (tensor.location) {\n    case 'cpu':\n      return new Tensor(tensor.type, tensor.data, dims);\n    case 'cpu-pinned':\n      return new Tensor({\n        location: 'cpu-pinned',\n        data: tensor.data as CpuPinnedConstructorParameters['data'],\n        type: tensor.type as CpuPinnedConstructorParameters['type'],\n        dims,\n      });\n    case 'texture':\n      return new Tensor({\n        location: 'texture',\n        texture: tensor.texture,\n        type: tensor.type as TextureConstructorParameters['type'],\n        dims,\n      });\n    case 'gpu-buffer':\n      return new Tensor({\n        location: 'gpu-buffer',\n        gpuBuffer: tensor.gpuBuffer,\n        type: tensor.type as GpuBufferConstructorParameters['type'],\n        dims,\n      });\n    case 'ml-tensor':\n      return new Tensor({\n        location: 'ml-tensor',\n        mlTensor: tensor.mlTensor,\n        type: tensor.type as MLTensorConstructorParameters['type'],\n        dims,\n      });\n    default:\n      throw new Error(`tensorReshape: tensor location ${tensor.location} is not supported`);\n  }\n};\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { tensorToDataURL, tensorToImageData } from './tensor-conversion-impl.js';\nimport { TensorToDataUrlOptions, TensorToImageDataOptions } from './tensor-conversion.js';\nimport {\n  tensorFromGpuBuffer,\n  tensorFromImage,\n  tensorFromMLTensor,\n  tensorFromPinnedBuffer,\n  tensorFromTexture,\n} from './tensor-factory-impl.js';\nimport {\n  CpuPinnedConstructorParameters,\n  GpuBufferConstructorParameters,\n  MLTensorConstructorParameters,\n  TensorFromGpuBufferOptions,\n  TensorFromImageBitmapOptions,\n  TensorFromImageDataOptions,\n  TensorFromImageElementOptions,\n  TensorFromMLTensorOptions,\n  TensorFromTextureOptions,\n  TensorFromUrlOptions,\n  TextureConstructorParameters,\n} from './tensor-factory.js';\nimport {\n  checkTypedArray,\n  NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP,\n  NUMERIC_TENSOR_TYPEDARRAY_TO_TYPE_MAP,\n  SupportedTypedArray,\n  SupportedTypedArrayConstructors,\n} from './tensor-impl-type-mapping.js';\nimport { calculateSize, tensorReshape } from './tensor-utils-impl.js';\nimport { Tensor as TensorInterface } from './tensor.js';\n\n// type aliases for those exported from Tensor interface\n\ntype TensorType = TensorInterface.Type;\ntype TensorDataType = TensorInterface.DataType;\ntype TensorDataLocation = TensorInterface.DataLocation;\ntype TensorTextureType = TensorInterface.TextureType;\ntype TensorGpuBufferType = TensorInterface.GpuBufferType;\ntype TensorMLTensorType = TensorInterface.MLTensorType;\n\n/**\n * the implementation of Tensor interface.\n *\n * @ignore\n */\nexport class Tensor implements TensorInterface {\n  // #region constructors\n\n  /**\n   * Construct a new CPU tensor object from the given type, data and dims.\n   */\n  constructor(\n    type: TensorType,\n    data: TensorDataType | Uint8ClampedArray | readonly string[] | readonly number[] | readonly boolean[],\n    dims?: readonly number[],\n  );\n  /**\n   * Construct a new CPU tensor object from the given data and dims. Type is inferred from data.\n   */\n  constructor(\n    data: TensorDataType | Uint8ClampedArray | readonly string[] | readonly boolean[],\n    dims?: readonly number[],\n  );\n  /**\n   * Construct a new tensor object from the pinned CPU data with the given type and dims.\n   *\n   * Tensor's location will be set to 'cpu-pinned'.\n   *\n   * @param params - Specify the parameters to construct the tensor.\n   */\n  constructor(params: CpuPinnedConstructorParameters);\n  /**\n   * Construct a new tensor object from the WebGL texture with the given type and dims.\n   *\n   * Tensor's location will be set to 'texture'.\n   *\n   * @param params - Specify the parameters to construct the tensor.\n   */\n  constructor(params: TextureConstructorParameters);\n  /**\n   * Construct a new tensor object from the WebGPU buffer with the given type and dims.\n   *\n   * Tensor's location will be set to 'gpu-buffer'.\n   *\n   * @param params - Specify the parameters to construct the tensor.\n   */\n  constructor(params: GpuBufferConstructorParameters);\n\n  /**\n   * Construct a new tensor object from the WebNN MLTensor with the given type and dims.\n   *\n   * Tensor's location will be set to 'ml-tensor'.\n   *\n   * @param params - Specify the parameters to construct the tensor.\n   */\n  constructor(params: MLTensorConstructorParameters);\n\n  /**\n   * implementation.\n   */\n  constructor(\n    arg0:\n      | TensorType\n      | TensorDataType\n      | Uint8ClampedArray\n      | readonly string[]\n      | readonly boolean[]\n      | CpuPinnedConstructorParameters\n      | TextureConstructorParameters\n      | GpuBufferConstructorParameters\n      | MLTensorConstructorParameters,\n    arg1?: TensorDataType | Uint8ClampedArray | readonly number[] | readonly string[] | readonly boolean[],\n    arg2?: readonly number[],\n  ) {\n    // perform one-time check for BigInt/Float16Array support\n    checkTypedArray();\n\n    let type: TensorType;\n    let dims: readonly number[];\n\n    if (typeof arg0 === 'object' && 'location' in arg0) {\n      //\n      // constructing tensor from specific location\n      //\n      this.dataLocation = arg0.location;\n      type = arg0.type;\n      dims = arg0.dims;\n      switch (arg0.location) {\n        case 'cpu-pinned': {\n          const expectedTypedArrayConstructor = NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP.get(type);\n          if (!expectedTypedArrayConstructor) {\n            throw new TypeError(`unsupported type \"${type}\" to create tensor from pinned buffer`);\n          }\n          if (!(arg0.data instanceof expectedTypedArrayConstructor)) {\n            throw new TypeError(`buffer should be of type ${expectedTypedArrayConstructor.name}`);\n          }\n          this.cpuData = arg0.data;\n          break;\n        }\n        case 'texture': {\n          if (type !== 'float32') {\n            throw new TypeError(`unsupported type \"${type}\" to create tensor from texture`);\n          }\n          this.gpuTextureData = arg0.texture;\n          this.downloader = arg0.download;\n          this.disposer = arg0.dispose;\n          break;\n        }\n        case 'gpu-buffer': {\n          if (\n            type !== 'float32' &&\n            type !== 'float16' &&\n            type !== 'int32' &&\n            type !== 'int64' &&\n            type !== 'uint32' &&\n            type !== 'uint8' &&\n            type !== 'bool' &&\n            type !== 'uint4' &&\n            type !== 'int4'\n          ) {\n            throw new TypeError(`unsupported type \"${type}\" to create tensor from gpu buffer`);\n          }\n          this.gpuBufferData = arg0.gpuBuffer;\n          this.downloader = arg0.download;\n          this.disposer = arg0.dispose;\n          break;\n        }\n        case 'ml-tensor': {\n          if (\n            type !== 'float32' &&\n            type !== 'float16' &&\n            type !== 'int32' &&\n            type !== 'int64' &&\n            type !== 'uint32' &&\n            type !== 'uint64' &&\n            type !== 'int8' &&\n            type !== 'uint8' &&\n            type !== 'bool' &&\n            type !== 'uint4' &&\n            type !== 'int4'\n          ) {\n            throw new TypeError(`unsupported type \"${type}\" to create tensor from MLTensor`);\n          }\n          this.mlTensorData = arg0.mlTensor;\n          this.downloader = arg0.download;\n          this.disposer = arg0.dispose;\n          break;\n        }\n        default:\n          throw new Error(`Tensor constructor: unsupported location '${this.dataLocation}'`);\n      }\n    } else {\n      //\n      // constructing tensor of location 'cpu'\n      //\n      let data: TensorDataType;\n      let maybeDims: typeof arg1 | typeof arg2;\n      // check whether arg0 is type or data\n      if (typeof arg0 === 'string') {\n        //\n        // Override: constructor(type, data, ...)\n        //\n        type = arg0;\n        maybeDims = arg2;\n        if (arg0 === 'string') {\n          // string tensor\n          if (!Array.isArray(arg1)) {\n            throw new TypeError(\"A string tensor's data must be a string array.\");\n          }\n          // we don't check whether every element in the array is string; this is too slow. we assume it's correct and\n          // error will be populated at inference\n          data = arg1;\n        } else {\n          // numeric tensor\n          const typedArrayConstructor = NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP.get(arg0);\n          if (typedArrayConstructor === undefined) {\n            throw new TypeError(`Unsupported tensor type: ${arg0}.`);\n          }\n          if (Array.isArray(arg1)) {\n            if ((arg0 === 'float16' && typedArrayConstructor === Uint16Array) || arg0 === 'uint4' || arg0 === 'int4') {\n              // - 'float16':\n              //   When no Float16Array polyfill is used, we cannot create 'float16' tensor from number array.\n              //\n              //   Throw error here because when user try to use number array as data,\n              //   e.g. new Tensor('float16', [1, 2, 3, 4], dims)), it will actually call\n              //   Uint16Array.from(arg1) which generates wrong data.\n              //\n              // - 'uint4' and 'int4':\n              //   Uint8Array.from(arg1) will generate wrong data for 'uint4' and 'int4' tensor.\n              //\n              throw new TypeError(\n                `Creating a ${arg0} tensor from number array is not supported. Please use ${typedArrayConstructor.name} as data.`,\n              );\n            } else if (arg0 === 'uint64' || arg0 === 'int64') {\n              // use 'as any' here because:\n              // 1. TypeScript's check on type of 'Array.isArray()' does not work with readonly arrays.\n              // see https://github.com/microsoft/TypeScript/issues/17002\n              // 2. TypeScript's check on union type of '(BigInt64ArrayConstructor|BigUint64ArrayConstructor).from()'\n              // does not accept parameter mapFn.\n              // 3. parameters of 'SupportedTypedArrayConstructors.from()' does not match the requirement of the union\n              // type.\n\n              // assume 'arg1' is of type \"readonly number[]|readonly bigint[]\" here.\n\n              // eslint-disable-next-line @typescript-eslint/no-explicit-any\n              data = (typedArrayConstructor as any).from(arg1, BigInt);\n            } else {\n              // assume 'arg1' is of type \"readonly number[]\" here.\n              // eslint-disable-next-line @typescript-eslint/no-explicit-any\n              data = (typedArrayConstructor as any).from(arg1);\n            }\n          } else if (arg1 instanceof typedArrayConstructor) {\n            data = arg1;\n          } else if (arg1 instanceof Uint8ClampedArray) {\n            if (arg0 === 'uint8') {\n              data = Uint8Array.from(arg1);\n            } else {\n              throw new TypeError(`A Uint8ClampedArray tensor's data must be type of uint8`);\n            }\n          } else if (arg0 === 'float16' && arg1 instanceof Uint16Array && typedArrayConstructor !== Uint16Array) {\n            // when Float16Array is available and data is of type Uint16Array.\n            // We allow Uint16Array to be passed in as data for 'float16' tensor until Float16Array is generally\n            // supported in JavaScript environment.\n\n            // eslint-disable-next-line @typescript-eslint/no-explicit-any\n            data = new (globalThis as any).Float16Array(arg1.buffer, arg1.byteOffset, arg1.length);\n          } else {\n            throw new TypeError(`A ${type} tensor's data must be type of ${typedArrayConstructor}`);\n          }\n        }\n      } else {\n        //\n        // Override: constructor(data, ...)\n        //\n        maybeDims = arg1;\n        if (Array.isArray(arg0)) {\n          // only boolean[] and string[] is supported\n          if (arg0.length === 0) {\n            throw new TypeError('Tensor type cannot be inferred from an empty array.');\n          }\n          const firstElementType = typeof arg0[0];\n          if (firstElementType === 'string') {\n            type = 'string';\n            data = arg0;\n          } else if (firstElementType === 'boolean') {\n            type = 'bool';\n            // 'arg0' is of type 'boolean[]'. Uint8Array.from(boolean[]) actually works, but typescript thinks this is\n            // wrong type. We use 'as any' to make it happy.\n            // eslint-disable-next-line @typescript-eslint/no-explicit-any\n            data = Uint8Array.from(arg0 as any[]);\n          } else {\n            throw new TypeError(`Invalid element type of data array: ${firstElementType}.`);\n          }\n        } else if (arg0 instanceof Uint8ClampedArray) {\n          type = 'uint8';\n          data = Uint8Array.from(arg0);\n        } else {\n          // get tensor type from TypedArray\n          const mappedType = NUMERIC_TENSOR_TYPEDARRAY_TO_TYPE_MAP.get(\n            arg0.constructor as SupportedTypedArrayConstructors,\n          );\n          if (mappedType === undefined) {\n            throw new TypeError(`Unsupported type for tensor data: ${arg0.constructor}.`);\n          }\n          type = mappedType;\n          data = arg0 as SupportedTypedArray;\n        }\n      }\n\n      // type and data is processed, now processing dims\n      if (maybeDims === undefined) {\n        // assume 1-D tensor if dims omitted\n        maybeDims = [data.length];\n      } else if (!Array.isArray(maybeDims)) {\n        throw new TypeError(\"A tensor's dims must be a number array\");\n      }\n      dims = maybeDims as readonly number[];\n\n      this.cpuData = data;\n      this.dataLocation = 'cpu';\n    }\n\n    // perform check on dims\n    const size = calculateSize(dims);\n    // if data is on CPU, check whether data length matches tensor size\n    if (this.cpuData && size !== this.cpuData.length) {\n      if ((type === 'uint4' || type === 'int4') && Math.ceil(size / 2) === this.cpuData.length) {\n        // for (u)int4, the data length is half of the tensor size. So we check this special case when size is odd.\n      } else {\n        throw new Error(`Tensor's size(${size}) does not match data length(${this.cpuData.length}).`);\n      }\n    }\n\n    this.type = type;\n    this.dims = dims;\n    this.size = size;\n  }\n  // #endregion\n\n  // #region factory\n  static async fromImage(\n    image: ImageData | HTMLImageElement | ImageBitmap | string,\n    options?:\n      | TensorFromImageDataOptions\n      | TensorFromImageElementOptions\n      | TensorFromImageBitmapOptions\n      | TensorFromUrlOptions,\n  ): Promise<TensorInterface> {\n    return tensorFromImage(image, options);\n  }\n\n  static fromTexture<T extends TensorInterface.TextureDataTypes>(\n    texture: TensorTextureType,\n    options: TensorFromTextureOptions<T>,\n  ): TensorInterface {\n    return tensorFromTexture(texture, options);\n  }\n\n  static fromGpuBuffer<T extends TensorInterface.GpuBufferDataTypes>(\n    gpuBuffer: TensorGpuBufferType,\n    options: TensorFromGpuBufferOptions<T>,\n  ): TensorInterface {\n    return tensorFromGpuBuffer(gpuBuffer, options);\n  }\n\n  static fromMLTensor<T extends TensorInterface.MLTensorDataTypes>(\n    mlTensor: TensorMLTensorType,\n    options: TensorFromMLTensorOptions<T>,\n  ): TensorInterface {\n    return tensorFromMLTensor(mlTensor, options);\n  }\n\n  static fromPinnedBuffer<T extends TensorInterface.CpuPinnedDataTypes>(\n    type: T,\n    buffer: TensorInterface.DataTypeMap[T],\n    dims?: readonly number[],\n  ): Tensor {\n    return tensorFromPinnedBuffer(type, buffer, dims);\n  }\n\n  // #endregion\n\n  // #region conversions\n  toDataURL(options?: TensorToDataUrlOptions): string {\n    return tensorToDataURL(this, options);\n  }\n\n  toImageData(options?: TensorToImageDataOptions): ImageData {\n    return tensorToImageData(this, options);\n  }\n  // #endregion\n\n  // #region public fields\n  readonly dims: readonly number[];\n  readonly type: TensorType;\n  readonly size: number;\n  // #endregion\n\n  // #region private fields\n\n  /**\n   * stores the location of the data.\n   */\n  private dataLocation: TensorDataLocation;\n\n  /**\n   * stores the data on CPU, if location is 'cpu' or 'cpu-pinned'. otherwise empty.\n   */\n  private cpuData?: TensorDataType;\n\n  /**\n   * stores the underlying texture when location is 'texture'. otherwise empty.\n   */\n  private gpuTextureData?: TensorTextureType;\n\n  /**\n   * stores the underlying GPU buffer when location is 'gpu-buffer'. otherwise empty.\n   */\n  private gpuBufferData?: TensorGpuBufferType;\n\n  /**\n   * stores the underlying WebNN MLTensor when location is 'ml-tensor'. otherwise empty.\n   */\n  private mlTensorData?: TensorMLTensorType;\n\n  /**\n   * stores an optional downloader function to download data from GPU to CPU.\n   */\n  private downloader?(): Promise<TensorDataType>;\n\n  /**\n   * a flag indicating whether the data is being downloaded from GPU to CPU.\n   */\n  private isDownloading?: boolean;\n\n  /**\n   * stores an optional disposer function to dispose the underlying data.\n   */\n  private disposer?(): void;\n  // #endregion\n\n  // #region properties\n  get data(): TensorDataType {\n    this.ensureValid();\n    if (!this.cpuData) {\n      throw new Error(\n        'The data is not on CPU. Use `getData()` to download GPU data to CPU, ' +\n          'or use `texture` or `gpuBuffer` property to access the GPU data directly.',\n      );\n    }\n    return this.cpuData;\n  }\n\n  get location(): TensorDataLocation {\n    return this.dataLocation;\n  }\n\n  get texture(): TensorTextureType {\n    this.ensureValid();\n    if (!this.gpuTextureData) {\n      throw new Error('The data is not stored as a WebGL texture.');\n    }\n    return this.gpuTextureData;\n  }\n\n  get gpuBuffer(): TensorGpuBufferType {\n    this.ensureValid();\n    if (!this.gpuBufferData) {\n      throw new Error('The data is not stored as a WebGPU buffer.');\n    }\n    return this.gpuBufferData;\n  }\n\n  get mlTensor(): TensorMLTensorType {\n    this.ensureValid();\n    if (!this.mlTensorData) {\n      throw new Error('The data is not stored as a WebNN MLTensor.');\n    }\n    return this.mlTensorData;\n  }\n  // #endregion\n\n  // #region methods\n\n  async getData(releaseData?: boolean): Promise<TensorDataType> {\n    this.ensureValid();\n    switch (this.dataLocation) {\n      case 'cpu':\n      case 'cpu-pinned':\n        return this.data;\n      case 'texture':\n      case 'gpu-buffer':\n      case 'ml-tensor': {\n        if (!this.downloader) {\n          throw new Error('The current tensor is not created with a specified data downloader.');\n        }\n        if (this.isDownloading) {\n          throw new Error('The current tensor is being downloaded.');\n        }\n        try {\n          this.isDownloading = true;\n          const data = await this.downloader();\n          this.downloader = undefined;\n          this.dataLocation = 'cpu';\n          this.cpuData = data;\n\n          if (releaseData && this.disposer) {\n            this.disposer();\n            this.disposer = undefined;\n          }\n\n          return data;\n        } finally {\n          this.isDownloading = false;\n        }\n      }\n      default:\n        throw new Error(`cannot get data from location: ${this.dataLocation}`);\n    }\n  }\n\n  dispose(): void {\n    if (this.isDownloading) {\n      throw new Error('The current tensor is being downloaded.');\n    }\n\n    if (this.disposer) {\n      this.disposer();\n      this.disposer = undefined;\n    }\n    this.cpuData = undefined;\n    this.gpuTextureData = undefined;\n    this.gpuBufferData = undefined;\n    this.mlTensorData = undefined;\n    this.downloader = undefined;\n    this.isDownloading = undefined;\n\n    this.dataLocation = 'none';\n  }\n\n  // #endregion\n\n  // #region tensor utilities\n  private ensureValid(): void {\n    if (this.dataLocation === 'none') {\n      throw new Error('The tensor is disposed.');\n    }\n  }\n\n  reshape(dims: readonly number[]): TensorInterface {\n    this.ensureValid();\n    if (this.downloader || this.disposer) {\n      throw new Error('Cannot reshape a tensor that owns GPU resource.');\n    }\n    return tensorReshape(this, dims);\n  }\n  // #endregion\n}\n", "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\nimport { TensorFactory } from './tensor-factory.js';\nimport { Tensor as TensorImpl } from './tensor-impl.js';\nimport { TypedTensorUtils } from './tensor-utils.js';\nimport { TryGetGlobalType } from './type-helper.js';\n\n/* eslint-disable @typescript-eslint/no-redeclare */\n\n/**\n * represent a basic tensor with specified dimensions and data type.\n */\ninterface TypedTensorBase<T extends Tensor.Type> {\n  /**\n   * Get the dimensions of the tensor.\n   */\n  readonly dims: readonly number[];\n  /**\n   * Get the data type of the tensor.\n   */\n  readonly type: T;\n  /**\n   * Get the buffer data of the tensor.\n   *\n   * If the data is not on CPU (eg. it's in the form of WebGL texture or WebGPU buffer), throw error.\n   */\n  readonly data: Tensor.DataTypeMap[T];\n  /**\n   * Get the location of the data.\n   */\n  readonly location: Tensor.DataLocation;\n  /**\n   * Get the WebGL texture that holds the tensor data.\n   *\n   * If the data is not on GPU as WebGL texture, throw error.\n   */\n  readonly texture: Tensor.TextureType;\n  /**\n   * Get the WebGPU buffer that holds the tensor data.\n   *\n   * If the data is not on GPU as WebGPU buffer, throw error.\n   */\n  readonly gpuBuffer: Tensor.GpuBufferType;\n\n  /**\n   * Get the WebNN MLTensor that holds the tensor data.\n   *\n   * If the data is not in a WebNN MLTensor, throw error.\n   */\n  readonly mlTensor: Tensor.MLTensorType;\n\n  /**\n   * Get the buffer data of the tensor.\n   *\n   * If the data is on CPU, returns the data immediately.\n   * If the data is on GPU, downloads the data and returns the promise.\n   *\n   * @param releaseData - whether release the data on GPU. Ignore if data is already on CPU.\n   */\n  getData(releaseData?: boolean): Promise<Tensor.DataTypeMap[T]>;\n\n  /**\n   * Dispose the tensor data.\n   *\n   * If the data is on CPU, remove its internal reference to the underlying data.\n   * If the data is on GPU, release the data on GPU.\n   *\n   * After calling this function, the tensor is considered no longer valid. Its location will be set to 'none'.\n   */\n  dispose(): void;\n}\n\nexport declare namespace Tensor {\n  interface DataTypeMap {\n    float32: Float32Array;\n    uint8: Uint8Array;\n    int8: Int8Array;\n    uint16: Uint16Array;\n    int16: Int16Array;\n    int32: Int32Array;\n    int64: BigInt64Array;\n    string: string[];\n    bool: Uint8Array;\n    float16: Uint16Array; // Keep using Uint16Array until we have a concrete solution for float 16.\n    float64: Float64Array;\n    uint32: Uint32Array;\n    uint64: BigUint64Array;\n    // complex64: never;\n    // complex128: never;\n    // bfloat16: never;\n    uint4: Uint8Array;\n    int4: Int8Array;\n  }\n\n  interface ElementTypeMap {\n    float32: number;\n    uint8: number;\n    int8: number;\n    uint16: number;\n    int16: number;\n    int32: number;\n    int64: bigint;\n    string: string;\n    bool: boolean;\n    float16: number; // Keep using Uint16Array until we have a concrete solution for float 16.\n    float64: number;\n    uint32: number;\n    uint64: bigint;\n    // complex64: never;\n    // complex128: never;\n    // bfloat16: never;\n    uint4: number;\n    int4: number;\n  }\n\n  type DataType = DataTypeMap[Type];\n  type ElementType = ElementTypeMap[Type];\n\n  /**\n   * supported data types for constructing a tensor from a pinned CPU buffer\n   */\n  export type CpuPinnedDataTypes = Exclude<Tensor.Type, 'string'>;\n\n  /**\n   * type alias for WebGL texture\n   */\n  export type TextureType = WebGLTexture;\n\n  /**\n   * supported data types for constructing a tensor from a WebGL texture\n   */\n  export type TextureDataTypes = 'float32';\n\n  type GpuBufferTypeFallback = { size: number; mapState: 'unmapped' | 'pending' | 'mapped' };\n  /**\n   * type alias for WebGPU buffer\n   */\n  export type GpuBufferType = TryGetGlobalType<'GPUBuffer', GpuBufferTypeFallback>;\n\n  type MLTensorTypeFallback = { destroy(): void };\n  /**\n   * type alias for WebNN MLTensor\n   *\n   * The specification for WebNN's MLTensor is currently in flux.\n   */\n  export type MLTensorType = TryGetGlobalType<'MLTensor', MLTensorTypeFallback>;\n\n  /**\n   * supported data types for constructing a tensor from a WebGPU buffer\n   */\n  export type GpuBufferDataTypes = 'float32' | 'float16' | 'int32' | 'int64' | 'uint32' | 'uint8' | 'bool';\n\n  /**\n   * supported data types for constructing a tensor from a WebNN MLTensor\n   */\n  export type MLTensorDataTypes =\n    | 'float32'\n    | 'float16'\n    | 'int8'\n    | 'uint8'\n    | 'int32'\n    | 'uint32'\n    | 'int64'\n    | 'uint64'\n    | 'bool'\n    | 'uint4'\n    | 'int4';\n\n  /**\n   * represent where the tensor data is stored\n   */\n  export type DataLocation = 'none' | 'cpu' | 'cpu-pinned' | 'texture' | 'gpu-buffer' | 'ml-tensor';\n\n  /**\n   * represent the data type of a tensor\n   */\n  export type Type = keyof DataTypeMap;\n}\n\n/**\n * Represent multi-dimensional arrays to feed to or fetch from model inferencing.\n */\nexport interface TypedTensor<T extends Tensor.Type> extends TypedTensorBase<T>, TypedTensorUtils<T> {}\n/**\n * Represent multi-dimensional arrays to feed to or fetch from model inferencing.\n */\nexport interface Tensor extends TypedTensorBase<Tensor.Type>, TypedTensorUtils<Tensor.Type> {}\n\n/**\n * type TensorConstructor defines the constructors of 'Tensor' to create CPU tensor instances.\n */\nexport interface TensorConstructor extends TensorFactory {\n  // #region CPU tensor - specify element type\n  /**\n   * Construct a new string tensor object from the given type, data and dims.\n   *\n   * @param type - Specify the element type.\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (\n    type: 'string',\n    data: Tensor.DataTypeMap['string'] | readonly string[],\n    dims?: readonly number[],\n  ): TypedTensor<'string'>;\n\n  /**\n   * Construct a new bool tensor object from the given type, data and dims.\n   *\n   * @param type - Specify the element type.\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (\n    type: 'bool',\n    data: Tensor.DataTypeMap['bool'] | readonly boolean[],\n    dims?: readonly number[],\n  ): TypedTensor<'bool'>;\n\n  /**\n   * Construct a new uint8 tensor object from a Uint8ClampedArray, data and dims.\n   *\n   * @param type - Specify the element type.\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (type: 'uint8', data: Uint8ClampedArray, dims?: readonly number[]): TypedTensor<'uint8'>;\n\n  /**\n   * Construct a new 64-bit integer typed tensor object from the given type, data and dims.\n   *\n   * @param type - Specify the element type.\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new <T extends 'uint64' | 'int64'>(\n    type: T,\n    data: Tensor.DataTypeMap[T] | readonly bigint[] | readonly number[],\n    dims?: readonly number[],\n  ): TypedTensor<T>;\n\n  /**\n   * Construct a new numeric tensor object from the given type, data and dims.\n   *\n   * @param type - Specify the element type.\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new <T extends Exclude<Tensor.Type, 'string' | 'bool' | 'uint64' | 'int64'>>(\n    type: T,\n    data: Tensor.DataTypeMap[T] | readonly number[],\n    dims?: readonly number[],\n  ): TypedTensor<T>;\n  // #endregion\n\n  // #region CPU tensor - infer element types\n\n  /**\n   * Construct a new float32 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: Float32Array, dims?: readonly number[]): TypedTensor<'float32'>;\n\n  /**\n   * Construct a new int8 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: Int8Array, dims?: readonly number[]): TypedTensor<'int8'>;\n\n  /**\n   * Construct a new uint8 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: Uint8Array, dims?: readonly number[]): TypedTensor<'uint8'>;\n\n  /**\n   * Construct a new uint8 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: Uint8ClampedArray, dims?: readonly number[]): TypedTensor<'uint8'>;\n\n  /**\n   * Construct a new uint16 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: Uint16Array, dims?: readonly number[]): TypedTensor<'uint16'>;\n\n  /**\n   * Construct a new int16 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: Int16Array, dims?: readonly number[]): TypedTensor<'int16'>;\n\n  /**\n   * Construct a new int32 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: Int32Array, dims?: readonly number[]): TypedTensor<'int32'>;\n\n  /**\n   * Construct a new int64 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: BigInt64Array, dims?: readonly number[]): TypedTensor<'int64'>;\n\n  /**\n   * Construct a new string tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: readonly string[], dims?: readonly number[]): TypedTensor<'string'>;\n\n  /**\n   * Construct a new bool tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: readonly boolean[], dims?: readonly number[]): TypedTensor<'bool'>;\n\n  /**\n   * Construct a new float64 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: Float64Array, dims?: readonly number[]): TypedTensor<'float64'>;\n\n  /**\n   * Construct a new uint32 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: Uint32Array, dims?: readonly number[]): TypedTensor<'uint32'>;\n\n  /**\n   * Construct a new uint64 tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: BigUint64Array, dims?: readonly number[]): TypedTensor<'uint64'>;\n\n  // #endregion\n\n  // #region CPU tensor - fall back to non-generic tensor type declaration\n\n  /**\n   * Construct a new tensor object from the given type, data and dims.\n   *\n   * @param type - Specify the element type.\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (\n    type: Tensor.Type,\n    data: Tensor.DataType | readonly number[] | readonly string[] | readonly bigint[] | readonly boolean[],\n    dims?: readonly number[],\n  ): Tensor;\n\n  /**\n   * Construct a new tensor object from the given data and dims.\n   *\n   * @param data - Specify the CPU tensor data.\n   * @param dims - Specify the dimension of the tensor. If omitted, a 1-D tensor is assumed.\n   */\n  new (data: Tensor.DataType, dims?: readonly number[]): Tensor;\n  // #endregion\n}\n\n// eslint-disable-next-line @typescript-eslint/naming-convention\nexport const Tensor = TensorImpl as TensorConstructor;\n", "/**\n * @file Handler file for choosing the correct version of ONNX Runtime, based on the environment.\n * Ideally, we could import the `onnxruntime-web` and `onnxruntime-node` packages only when needed,\n * but dynamic imports don't seem to work with the current webpack version and/or configuration.\n * This is possibly due to the experimental nature of top-level await statements.\n * So, we just import both packages, and use the appropriate one based on the environment:\n *   - When running in node, we use `onnxruntime-node`.\n *   - When running in the browser, we use `onnxruntime-web` (`onnxruntime-node` is not bundled).\n * \n * This module is not directly exported, but can be accessed through the environment variables:\n * ```javascript\n * import { env } from '@huggingface/transformers';\n * console.log(env.backends.onnx);\n * ```\n * \n * @module backends/onnx\n */\n\nimport { env, apis } from '../env.js';\n\n// NOTE: Import order matters here. We need to import `onnxruntime-node` before `onnxruntime-web`.\n// In either case, we select the default export if it exists, otherwise we use the named export.\nimport * as ONNX_NODE from 'onnxruntime-node';\nimport * as ONNX_WEB from 'onnxruntime-web';\n\nexport { Tensor } from 'onnxruntime-common';\n\n/**\n * @typedef {import('onnxruntime-common').InferenceSession.ExecutionProviderConfig} ONNXExecutionProviders\n */\n\n/** @type {Record<import(\"../utils/devices.js\").DeviceType, ONNXExecutionProviders>} */\nconst DEVICE_TO_EXECUTION_PROVIDER_MAPPING = Object.freeze({\n    auto: null, // Auto-detect based on device and environment\n    gpu: null, // Auto-detect GPU\n    cpu: 'cpu', // CPU\n    wasm: 'wasm', // WebAssembly\n    webgpu: 'webgpu', // WebGPU\n    cuda: 'cuda', // CUDA\n    dml: 'dml', // DirectML\n\n    webnn: { name: 'webnn', deviceType: 'cpu' }, // WebNN (default)\n    'webnn-npu': { name: 'webnn', deviceType: 'npu' }, // WebNN NPU\n    'webnn-gpu': { name: 'webnn', deviceType: 'gpu' }, // WebNN GPU\n    'webnn-cpu': { name: 'webnn', deviceType: 'cpu' }, // WebNN CPU\n});\n\n/** \n * The list of supported devices, sorted by priority/performance.\n * @type {import(\"../utils/devices.js\").DeviceType[]}\n */\nconst supportedDevices = [];\n\n/** @type {ONNXExecutionProviders[]} */\nlet defaultDevices;\nlet ONNX;\nconst ORT_SYMBOL = Symbol.for('onnxruntime');\n\nif (ORT_SYMBOL in globalThis) {\n    // If the JS runtime exposes their own ONNX runtime, use it\n    ONNX = globalThis[ORT_SYMBOL];\n\n} else if (apis.IS_NODE_ENV) {\n    ONNX = ONNX_NODE.default ?? ONNX_NODE;\n\n    // Updated as of ONNX Runtime 1.20.1\n    // The following table lists the supported versions of ONNX Runtime Node.js binding provided with pre-built binaries.\n    // | EPs/Platforms | Windows x64 | Windows arm64 | Linux x64         | Linux arm64 | MacOS x64 | MacOS arm64 |\n    // | ------------- | ----------- | ------------- | ----------------- | ----------- | --------- | ----------- |\n    // | CPU           | \u2714\uFE0F          | \u2714\uFE0F            | \u2714\uFE0F                | \u2714\uFE0F          | \u2714\uFE0F        | \u2714\uFE0F          |\n    // | DirectML      | \u2714\uFE0F          | \u2714\uFE0F            | \u274C                | \u274C          | \u274C        | \u274C          |\n    // | CUDA          | \u274C          | \u274C            | \u2714\uFE0F (CUDA v11.8)   | \u274C          | \u274C        | \u274C          |\n    switch (process.platform) {\n        case 'win32': // Windows x64 and Windows arm64\n            supportedDevices.push('dml');\n            break;\n        case 'linux': // Linux x64 and Linux arm64\n            if (process.arch === 'x64') {\n                supportedDevices.push('cuda');\n            }\n            break;\n        case 'darwin': // MacOS x64 and MacOS arm64\n            break;\n    }\n\n    supportedDevices.push('cpu');\n    defaultDevices = ['cpu'];\n} else {\n    ONNX = ONNX_WEB;\n\n    if (apis.IS_WEBNN_AVAILABLE) {\n        // TODO: Only push supported providers (depending on available hardware)\n        supportedDevices.push('webnn-npu', 'webnn-gpu', 'webnn-cpu', 'webnn');\n    }\n\n    if (apis.IS_WEBGPU_AVAILABLE) {\n        supportedDevices.push('webgpu');\n    }\n\n    supportedDevices.push('wasm');\n    defaultDevices = ['wasm'];\n}\n\n// @ts-ignore\nconst InferenceSession = ONNX.InferenceSession;\n\n/**\n * Map a device to the execution providers to use for the given device.\n * @param {import(\"../utils/devices.js\").DeviceType|\"auto\"|null} [device=null] (Optional) The device to run the inference on.\n * @returns {ONNXExecutionProviders[]} The execution providers to use for the given device.\n */\nexport function deviceToExecutionProviders(device = null) {\n    // Use the default execution providers if the user hasn't specified anything\n    if (!device) return defaultDevices;\n\n    // Handle overloaded cases\n    switch (device) {\n        case \"auto\":\n            return supportedDevices;\n        case \"gpu\":\n            return supportedDevices.filter(x =>\n                [\"webgpu\", \"cuda\", \"dml\", \"webnn-gpu\"].includes(x),\n            );\n    }\n\n    if (supportedDevices.includes(device)) {\n        return [DEVICE_TO_EXECUTION_PROVIDER_MAPPING[device] ?? device];\n    }\n\n    throw new Error(`Unsupported device: \"${device}\". Should be one of: ${supportedDevices.join(', ')}.`)\n}\n\n\n/**\n * To prevent multiple calls to `initWasm()`, we store the first call in a Promise\n * that is resolved when the first InferenceSession is created. Subsequent calls\n * will wait for this Promise to resolve before creating their own InferenceSession.\n * @type {Promise<any>|null}\n */\nlet wasmInitPromise = null;\n\n/**\n * Create an ONNX inference session.\n * @param {Uint8Array|string} buffer_or_path The ONNX model buffer or path.\n * @param {import('onnxruntime-common').InferenceSession.SessionOptions} session_options ONNX inference session options.\n * @param {Object} session_config ONNX inference session configuration.\n * @returns {Promise<import('onnxruntime-common').InferenceSession & { config: Object}>} The ONNX inference session.\n */\nexport async function createInferenceSession(buffer_or_path, session_options, session_config) {\n    if (wasmInitPromise) {\n        // A previous session has already initialized the WASM runtime\n        // so we wait for it to resolve before creating this new session.\n        await wasmInitPromise;\n    }\n\n    const sessionPromise = InferenceSession.create(buffer_or_path, session_options);\n    wasmInitPromise ??= sessionPromise;\n    const session = await sessionPromise;\n    session.config = session_config;\n    return session;\n}\n\n\n/**\n * Currently, Transformers.js doesn't support simultaneous execution of sessions in WASM/WebGPU.\n * For this reason, we need to chain the inference calls (otherwise we get \"Error: Session already started\").\n * @type {Promise<any>}\n */\nlet webInferenceChain = Promise.resolve();\n\nconst IS_WEB_ENV = apis.IS_BROWSER_ENV || apis.IS_WEBWORKER_ENV;\n\n/**\n * Run an inference session.\n * @param {import('onnxruntime-common').InferenceSession} session The ONNX inference session.\n * @param {Record<string, import('onnxruntime-common').Tensor>} ortFeed The input tensors.\n * @returns {Promise<Record<string, import('onnxruntime-common').Tensor>>} The output tensors.\n */\nexport async function runInferenceSession(session, ortFeed) {\n    const run = () => session.run(ortFeed);\n    const output = await (IS_WEB_ENV\n        ? (webInferenceChain = webInferenceChain.then(run))\n        : run()\n    );\n    return output;\n}\n\n\n/**\n * Check if an object is an ONNX tensor.\n * @param {any} x The object to check\n * @returns {boolean} Whether the object is an ONNX tensor.\n */\nexport function isONNXTensor(x) {\n    return x instanceof ONNX.Tensor;\n}\n\n/** @type {import('onnxruntime-common').Env} */\n// @ts-ignore\nconst ONNX_ENV = ONNX?.env;\nif (ONNX_ENV?.wasm) {\n    // Initialize wasm backend with suitable default settings.\n\n    // (Optional) Set path to wasm files. This will override the default path search behavior of onnxruntime-web.\n    // By default, we only do this if we are not in a service worker and the wasmPaths are not already set.\n    if (\n        // @ts-ignore Cannot find name 'ServiceWorkerGlobalScope'.ts(2304)\n        !(typeof ServiceWorkerGlobalScope !== 'undefined' && self instanceof ServiceWorkerGlobalScope)\n        && !ONNX_ENV.wasm.wasmPaths\n    ) {\n        ONNX_ENV.wasm.wasmPaths = `https://cdn.jsdelivr.net/npm/@huggingface/transformers@${env.version}/dist/`;\n    }\n\n    // TODO: Add support for loading WASM files from cached buffer when we upgrade to onnxruntime-web@1.19.0\n    // https://github.com/microsoft/onnxruntime/pull/21534\n\n    // Users may wish to proxy the WASM backend to prevent the UI from freezing,\n    // However, this is not necessary when using WebGPU, so we default to false.\n    ONNX_ENV.wasm.proxy = false;\n}\n\nif (ONNX_ENV?.webgpu) {\n    ONNX_ENV.webgpu.powerPreference = 'high-performance';\n}\n\n/**\n * Check if ONNX's WASM backend is being proxied.\n * @returns {boolean} Whether ONNX's WASM backend is being proxied.\n */\nexport function isONNXProxy() {\n    // TODO: Update this when allowing non-WASM backends.\n    return ONNX_ENV?.wasm?.proxy;\n}\n\n// Expose ONNX environment variables to `env.backends.onnx`\nenv.backends.onnx = ONNX_ENV;\n", "/**\n * @file Helper module for `Tensor` processing.\n *\n * These functions and classes are only used internally,\n * meaning an end-user shouldn't need to access anything here.\n *\n * @module utils/tensor\n */\n\nimport {\n    interpolate_data,\n    max,\n    min,\n    permute_data\n} from './maths.js';\n\nimport {\n    Tensor as ONNXTensor, isONNXTensor,\n} from '../backends/onnx.js';\n\nimport { TensorOpRegistry } from '../ops/registry.js';\n\nexport const DataTypeMap = Object.freeze({\n    float32: Float32Array,\n    // @ts-ignore ts(2552) Limited availability of Float16Array across browsers:\n    // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Float16Array\n    float16: typeof Float16Array !== \"undefined\" ? Float16Array: Uint16Array,\n    float64: Float64Array,\n    string: Array, // string[]\n    int8: Int8Array,\n    uint8: Uint8Array,\n    int16: Int16Array,\n    uint16: Uint16Array,\n    int32: Int32Array,\n    uint32: Uint32Array,\n    int64: BigInt64Array,\n    uint64: BigUint64Array,\n    bool: Uint8Array,\n    uint4: Uint8Array,\n    int4: Int8Array,\n});\n\n/**\n * @typedef {keyof typeof DataTypeMap} DataType\n * @typedef {import('./maths.js').AnyTypedArray | any[]} DataArray\n */\n\n\nexport class Tensor {\n    /** @type {number[]} Dimensions of the tensor. */\n    get dims() {\n        // @ts-ignore\n        return this.ort_tensor.dims;\n    }\n    set dims(value) {\n        // FIXME: ONNXTensor declares dims as readonly so one needs to use the constructor() if dims change.\n        // @ts-ignore\n        this.ort_tensor.dims = value;\n    }\n\n    /** @type {DataType} Type of the tensor. */\n    get type() {\n        return this.ort_tensor.type;\n    };\n\n    /** @type {DataArray} The data stored in the tensor. */\n    get data() {\n        return this.ort_tensor.data;\n    }\n\n    /** @type {number} The number of elements in the tensor. */\n    get size() {\n        return this.ort_tensor.size;\n    };\n\n    /** @type {string} The location of the tensor data. */\n    get location() {\n        return this.ort_tensor.location;\n    };\n\n    ort_tensor;\n\n    /**\n     * Create a new Tensor or copy an existing Tensor.\n     * @param {[DataType, DataArray, number[]]|[ONNXTensor]} args\n     */\n    constructor(...args) {\n        if (isONNXTensor(args[0])) {\n            this.ort_tensor = /** @type {ONNXTensor} */ (args[0]);\n        } else {\n            // Create new tensor\n            this.ort_tensor = new ONNXTensor(\n                /** @type {DataType} */(args[0]),\n                // @ts-expect-error ts(2769) Type 'number' is not assignable to type 'bigint'.\n                /** @type {Exclude<import('./maths.js').AnyTypedArray, Uint8ClampedArray>} */(args[1]),\n                args[2],\n            );\n        }\n\n        return new Proxy(this, {\n            get: (obj, key) => {\n                if (typeof key === 'string') {\n                    let index = Number(key);\n                    if (Number.isInteger(index)) {\n                        // key is an integer (i.e., index)\n                        return obj._getitem(index);\n                    }\n                }\n                // @ts-ignore\n                return obj[key];\n            },\n            set: (obj, key, value) => {\n                // TODO allow setting of data\n\n                // @ts-ignore\n                return obj[key] = value;\n            }\n        });\n    }\n\n    dispose() {\n        this.ort_tensor.dispose();\n        // this.ort_tensor = undefined;\n    }\n\n    /**\n     * Returns an iterator object for iterating over the tensor data in row-major order.\n     * If the tensor has more than one dimension, the iterator will yield subarrays.\n     * @returns {Iterator} An iterator object for iterating over the tensor data in row-major order.\n     */\n    *[Symbol.iterator]() {\n        const [iterLength, ...iterDims] = this.dims;\n\n        if (iterDims.length > 0) {\n            const iterSize = iterDims.reduce((a, b) => a * b);\n            for (let i = 0; i < iterLength; ++i) {\n                yield this._subarray(i, iterSize, iterDims);\n            }\n        } else {\n            yield* this.data\n        }\n\n    }\n\n    /**\n     * Index into a Tensor object.\n     * @param {number} index The index to access.\n     * @returns {Tensor} The data at the specified index.\n     */\n    _getitem(index) {\n        const [iterLength, ...iterDims] = this.dims;\n\n        index = safeIndex(index, iterLength);\n\n        if (iterDims.length > 0) {\n            const iterSize = iterDims.reduce((a, b) => a * b);\n            return this._subarray(index, iterSize, iterDims);\n        } else {\n            return new Tensor(this.type, [this.data[index]], iterDims);\n        }\n    }\n\n    /**\n     * @param {number|bigint} item The item to search for in the tensor\n     * @returns {number} The index of the first occurrence of item in the tensor data.\n     */\n    indexOf(item) {\n        const this_data = this.data;\n        for (let index = 0; index < this_data.length; ++index) {\n            // Note: == instead of === so we can match Ints with BigInts\n            if (this_data[index] == item) {\n                return index;\n            }\n        }\n        return -1;\n    }\n\n    /**\n     * @param {number} index\n     * @param {number} iterSize\n     * @param {any} iterDims\n     * @returns {Tensor}\n     */\n    _subarray(index, iterSize, iterDims) {\n        const o1 = index * iterSize;\n        const o2 = (index + 1) * iterSize;\n\n        // We use subarray if available (typed array), otherwise we use slice (normal array)\n        const data =\n            ('subarray' in this.data)\n                ? this.data.subarray(o1, o2)\n                : this.data.slice(o1, o2);\n        return new Tensor(this.type, data, iterDims);\n    }\n\n    /**\n     * Returns the value of this tensor as a standard JavaScript Number. This only works\n     * for tensors with one element. For other cases, see `Tensor.tolist()`.\n     * @returns {number|bigint} The value of this tensor as a standard JavaScript Number.\n     * @throws {Error} If the tensor has more than one element.\n     */\n    item() {\n        const this_data = this.data;\n        if (this_data.length !== 1) {\n            throw new Error(`a Tensor with ${this_data.length} elements cannot be converted to Scalar`);\n        }\n        return this_data[0];\n    }\n\n    /**\n     * Convert tensor data to a n-dimensional JS list\n     * @returns {Array}\n     */\n    tolist() {\n        return reshape(this.data, this.dims)\n    }\n\n    /**\n     * Return a new Tensor with the sigmoid function applied to each element.\n     * @returns {Tensor} The tensor with the sigmoid function applied.\n     */\n    sigmoid() {\n        return this.clone().sigmoid_();\n    }\n\n    /**\n     * Applies the sigmoid function to the tensor in place.\n     * @returns {Tensor} Returns `this`.\n     */\n    sigmoid_() {\n        const this_data = this.data;\n        for (let i = 0; i < this_data.length; ++i) {\n            this_data[i] = 1 / (1 + Math.exp(-this_data[i]));\n        }\n        return this;\n    }\n\n    /**\n     * Return a new Tensor with a callback function applied to each element.\n     * @param {Function} callback - The function to apply to each element. It should take three arguments:\n     *                              the current element, its index, and the tensor's data array.\n     * @returns {Tensor} A new Tensor with the callback function applied to each element.\n     */\n    map(callback) {\n        return this.clone().map_(callback);\n    }\n\n    /**\n     * Apply a callback function to each element of the tensor in place.\n     * @param {Function} callback - The function to apply to each element. It should take three arguments:\n     *                              the current element, its index, and the tensor's data array.\n     * @returns {Tensor} Returns `this`.\n     */\n    map_(callback) {\n        const this_data = this.data;\n        for (let i = 0; i < this_data.length; ++i) {\n            this_data[i] = callback(this_data[i], i, this_data);\n        }\n        return this;\n    }\n\n    /**\n     * Return a new Tensor with every element multiplied by a constant.\n     * @param {number} val The value to multiply by.\n     * @returns {Tensor} The new tensor.\n     */\n    mul(val) {\n        return this.clone().mul_(val);\n    }\n\n    /**\n     * Multiply the tensor by a constant in place.\n     * @param {number} val The value to multiply by.\n     * @returns {Tensor} Returns `this`.\n     */\n    mul_(val) {\n        const this_data = this.data;\n        for (let i = 0; i < this_data.length; ++i) {\n            this_data[i] *= val;\n        }\n        return this;\n    }\n\n    /**\n     * Return a new Tensor with every element divided by a constant.\n     * @param {number} val The value to divide by.\n     * @returns {Tensor} The new tensor.\n     */\n    div(val) {\n        return this.clone().div_(val);\n    }\n\n    /**\n     * Divide the tensor by a constant in place.\n     * @param {number} val The value to divide by.\n     * @returns {Tensor} Returns `this`.\n     */\n    div_(val) {\n        const this_data = this.data;\n        for (let i = 0; i < this_data.length; ++i) {\n            this_data[i] /= val;\n        }\n        return this;\n    }\n\n    /**\n     * Return a new Tensor with every element added by a constant.\n     * @param {number} val The value to add by.\n     * @returns {Tensor} The new tensor.\n     */\n    add(val) {\n        return this.clone().add_(val);\n    }\n\n    /**\n     * Add the tensor by a constant in place.\n     * @param {number} val The value to add by.\n     * @returns {Tensor} Returns `this`.\n     */\n    add_(val) {\n        const this_data = this.data;\n        for (let i = 0; i < this_data.length; ++i) {\n            this_data[i] += val;\n        }\n        return this;\n    }\n\n    /**\n     * Return a new Tensor with every element subtracted by a constant.\n     * @param {number} val The value to subtract by.\n     * @returns {Tensor} The new tensor.\n     */\n    sub(val) {\n        return this.clone().sub_(val);\n    }\n\n    /**\n     * Subtract the tensor by a constant in place.\n     * @param {number} val The value to subtract by.\n     * @returns {Tensor} Returns `this`.\n     */\n    sub_(val) {\n        const this_data = this.data;\n        for (let i = 0; i < this_data.length; ++i) {\n            this_data[i] -= val;\n        }\n        return this;\n    }\n\n    /**\n     * Creates a deep copy of the current Tensor.\n     * @returns {Tensor} A new Tensor with the same type, data, and dimensions as the original.\n     */\n    clone() {\n        return new Tensor(this.type, this.data.slice(), this.dims.slice());\n    }\n\n    /**\n     * Performs a slice operation on the Tensor along specified dimensions.\n     *\n     * Consider a Tensor that has a dimension of [4, 7]:\n     * ```\n     * [ 1,  2,  3,  4,  5,  6,  7]\n     * [ 8,  9, 10, 11, 12, 13, 14]\n     * [15, 16, 17, 18, 19, 20, 21]\n     * [22, 23, 24, 25, 26, 27, 28]\n     * ```\n     * We can slice against the two dims of row and column, for instance in this\n     * case we can start at the second element, and return to the second last,\n     * like this:\n     * ```\n     * tensor.slice([1, -1], [1, -1]);\n     * ```\n     * which would return:\n     * ```\n     * [  9, 10, 11, 12, 13 ]\n     * [ 16, 17, 18, 19, 20 ]\n     * ```\n     *\n     * @param {...(number|number[]|null)} slices The slice specifications for each dimension.\n     * - If a number is given, then a single element is selected.\n     * - If an array of two numbers is given, then a range of elements [start, end (exclusive)] is selected.\n     * - If null is given, then the entire dimension is selected.\n     * @returns {Tensor} A new Tensor containing the selected elements.\n     * @throws {Error} If the slice input is invalid.\n     */\n    slice(...slices) {\n        // This allows for slicing with ranges and numbers\n        const newTensorDims = [];\n        const newOffsets = [];\n\n        // slices is an array of numbers or arrays of numbers\n        // e.g., slices = [0, [1, 3], null, [0, 3]]\n        for (let sliceIndex = 0; sliceIndex < this.dims.length; ++sliceIndex) {\n            let slice = slices[sliceIndex];\n\n            if (slice === null || slice === undefined) {\n                // null or undefined means take the whole dimension\n                newOffsets.push([0, this.dims[sliceIndex]]);\n                newTensorDims.push(this.dims[sliceIndex]);\n\n            } else if (typeof slice === 'number') {\n                slice = safeIndex(slice, this.dims[sliceIndex], sliceIndex);\n\n                // A number means take a single element\n                newOffsets.push([slice, slice + 1]);\n\n            } else if (Array.isArray(slice) && slice.length === 2) {\n                // An array of length 2 means take a range of elements\n                let [start, end] = slice;\n                start = start === null\n                    ? 0\n                    : safeIndex(start, this.dims[sliceIndex], sliceIndex, false);\n                end = end === null\n                    ? this.dims[sliceIndex]\n                    : safeIndex(end, this.dims[sliceIndex], sliceIndex, false);\n\n                if (start > end) {\n                    throw new Error(`Invalid slice: ${slice}`);\n                }\n\n                const offsets = [\n                    Math.max(start, 0),\n                    Math.min(end, this.dims[sliceIndex])\n                ];\n\n                newOffsets.push(offsets);\n                newTensorDims.push(offsets[1] - offsets[0]);\n\n            } else {\n                throw new Error(`Invalid slice: ${slice}`);\n            }\n        }\n\n        const newDims = newOffsets.map(([start, end]) => end - start);\n        const newBufferSize = newDims.reduce((a, b) => a * b);\n\n        const this_data = this.data;\n        // Allocate memory\n        // @ts-ignore\n        const data = new this_data.constructor(newBufferSize);\n\n        // Precompute strides\n        const stride = this.stride();\n\n        // Detect if the slice is contiguous\n        let isContiguous = true;\n        for (let i = 1; i < newDims.length; ++i) {\n            if (newOffsets[i][0] !== 0 || newOffsets[i][1] !== this.dims[i]) {\n                isContiguous = false;\n                break;\n            }\n        }\n\n        if (isContiguous) {\n            // Perform bulk copy for contiguous slices to improve performance\n            const start = newOffsets[0][0] * stride[0];\n            const end = newOffsets[0][1] * stride[0];\n\n            if (ArrayBuffer.isView(this_data)) {\n                // If this.data is a TypedArray, use subarray\n                // @ts-ignore\n                data.set(this_data.subarray(start, end));\n            } else if (Array.isArray(this_data)) {\n                // If this.data is a plain array, use slice\n                const slicedData = this_data.slice(start, end);\n                for (let i = 0; i < slicedData.length; ++i) {\n                    data[i] = slicedData[i];\n                }\n            } else {\n                throw new Error(\"Unsupported data type for slicing\");\n            }\n        } else {\n            // Fallback to manual copying for non-contiguous slices\n            for (let i = 0; i < newBufferSize; ++i) {\n                let originalIndex = 0;\n                for (let j = newDims.length - 1, num = i; j >= 0; --j) {\n                    const size = newDims[j];\n                    originalIndex += ((num % size) + newOffsets[j][0]) * stride[j];\n                    num = Math.floor(num / size);\n                }\n                data[i] = this_data[originalIndex];\n            }\n        }\n\n        return new Tensor(this.type, data, newTensorDims);\n    }\n\n    /**\n     * Return a permuted version of this Tensor, according to the provided dimensions.\n     * @param  {...number} dims Dimensions to permute.\n     * @returns {Tensor} The permuted tensor.\n     */\n    permute(...dims) {\n        return permute(this, dims);\n    }\n\n    // TODO: implement transpose. For now (backwards compatibility), it's just an alias for permute()\n    transpose(...dims) {\n        return this.permute(...dims);\n    }\n\n    /**\n     * Returns the sum of each row of the input tensor in the given dimension dim.\n     *\n     * @param {number} [dim=null] The dimension or dimensions to reduce. If `null`, all dimensions are reduced.\n     * @param {boolean} keepdim Whether the output tensor has `dim` retained or not.\n     * @returns The summed tensor\n     */\n    sum(dim = null, keepdim = false) {\n        return this.norm(1, dim, keepdim);\n    }\n\n    /**\n     * Returns the matrix norm or vector norm of a given tensor.\n     * @param {number|string} [p='fro'] The order of norm\n     * @param {number} [dim=null] Specifies which dimension of the tensor to calculate the norm across.\n     * If dim is None, the norm will be calculated across all dimensions of input.\n     * @param {boolean} [keepdim=false] Whether the output tensors have dim retained or not.\n     * @returns {Tensor} The norm of the tensor.\n     */\n    norm(p = 'fro', dim = null, keepdim = false) {\n        if (p === 'fro') {\n            // NOTE: Since we only support integer dims, Frobenius norm produces the same result as p=2.\n            p = 2;\n        } else if (typeof p === 'string') {\n            throw Error(`Unsupported norm: ${p}`);\n        }\n\n        const this_data = this.data;\n        const fn = (a, b) => a + (b ** p);\n\n        if (dim === null) {\n            // @ts-ignore\n            const val = this_data.reduce(fn, 0) ** (1 / p);\n            return new Tensor(this.type, [val], []);\n        }\n\n        const [type, result, resultDims] = reduce_helper(fn, this, dim, keepdim);\n\n        if (p !== 1) {\n            for (let i = 0; i < result.length; ++i) {\n                result[i] = result[i] ** (1 / p);\n            }\n        }\n        return new Tensor(type, result, resultDims);\n    }\n\n    /**\n     * Performs `L_p` normalization of inputs over specified dimension. Operates in place.\n     * @param {number} [p=2] The exponent value in the norm formulation\n     * @param {number} [dim=1] The dimension to reduce\n     * @returns {Tensor} `this` for operation chaining.\n     */\n    normalize_(p = 2.0, dim = 1) {\n        dim = safeIndex(dim, this.dims.length);\n\n        const norm = this.norm(p, dim, true);\n\n        const this_data = this.data;\n        const norm_data = norm.data;\n        for (let i = 0; i < this_data.length; ++i) {\n\n            // Calculate the index in the resulting array\n            let resultIndex = 0;\n\n            for (let j = this.dims.length - 1, num = i, resultMultiplier = 1; j >= 0; --j) {\n                const size = this.dims[j];\n                if (j !== dim) {\n                    const index = num % size;\n                    resultIndex += index * resultMultiplier;\n                    resultMultiplier *= this.dims[j];\n                }\n                num = Math.floor(num / size);\n            }\n\n            // Divide by normalized value\n            this_data[i] /= norm_data[resultIndex];\n        }\n\n        return this;\n    }\n\n    /**\n     * Performs `L_p` normalization of inputs over specified dimension.\n     * @param {number} [p=2] The exponent value in the norm formulation\n     * @param {number} [dim=1] The dimension to reduce\n     * @returns {Tensor} The normalized tensor.\n     */\n    normalize(p = 2.0, dim = 1) {\n        return this.clone().normalize_(p, dim);\n    }\n\n    /**\n     * Compute and return the stride of this tensor.\n     * Stride is the jump necessary to go from one element to the next one in the specified dimension dim.\n     * @returns {number[]} The stride of this tensor.\n     */\n    stride() {\n        return dimsToStride(this.dims);\n    }\n\n    /**\n     * Returns a tensor with all specified dimensions of input of size 1 removed.\n     *\n     * NOTE: The returned tensor shares the storage with the input tensor, so changing the contents of one will change the contents of the other.\n     * If you would like a copy, use `tensor.clone()` before squeezing.\n     *\n     * @param {number|number[]} [dim=null] If given, the input will be squeezed only in the specified dimensions.\n     * @returns {Tensor} The squeezed tensor\n     */\n    squeeze(dim = null) {\n        return new Tensor(\n            this.type,\n            this.data,\n            calc_squeeze_dims(this.dims, dim)\n        )\n    }\n\n    /**\n     * In-place version of @see {@link Tensor.squeeze}\n     */\n    squeeze_(dim = null) {\n        this.dims = calc_squeeze_dims(this.dims, dim);\n        return this;\n    }\n\n    /**\n     * Returns a new tensor with a dimension of size one inserted at the specified position.\n     *\n     * NOTE: The returned tensor shares the same underlying data with this tensor.\n     *\n     * @param {number} dim The index at which to insert the singleton dimension\n     * @returns {Tensor} The unsqueezed tensor\n     */\n    unsqueeze(dim = null) {\n        return new Tensor(\n            this.type,\n            this.data,\n            calc_unsqueeze_dims(this.dims, dim)\n        );\n    }\n\n    /**\n     * In-place version of @see {@link Tensor.unsqueeze}\n     */\n    unsqueeze_(dim = null) {\n        this.dims = calc_unsqueeze_dims(this.dims, dim);\n        return this;\n    }\n\n    /**\n     * In-place version of @see {@link Tensor.flatten}\n     */\n    flatten_(start_dim = 0, end_dim = -1) {\n        // TODO validate inputs\n        end_dim = (end_dim + this.dims.length) % this.dims.length;\n\n        let dimsToKeepBefore = this.dims.slice(0, start_dim);\n        let dimsToFlatten = this.dims.slice(start_dim, end_dim + 1);\n        let dimsToKeepAfter = this.dims.slice(end_dim + 1);\n\n        this.dims = [...dimsToKeepBefore, dimsToFlatten.reduce((a, b) => a * b, 1), ...dimsToKeepAfter]\n        return this;\n    }\n\n    /**\n     * Flattens input by reshaping it into a one-dimensional tensor.\n     * If `start_dim` or `end_dim` are passed, only dimensions starting with `start_dim`\n     * and ending with `end_dim` are flattened. The order of elements in input is unchanged.\n     * @param {number} start_dim the first dim to flatten\n     * @param {number} end_dim the last dim to flatten\n     * @returns {Tensor} The flattened tensor.\n     */\n    flatten(start_dim = 0, end_dim = -1) {\n        return this.clone().flatten_(start_dim, end_dim);\n    }\n\n    /**\n     * Returns a new tensor with the same data as the `self` tensor but of a different `shape`.\n     * @param  {...number} dims the desired size\n     * @returns {Tensor} The tensor with the same data but different shape\n     */\n    view(...dims) {\n        // TODO: validate dims\n        let inferredIndex = -1;\n        for (let i = 0; i < dims.length; ++i) {\n            if (dims[i] === -1) {\n                if (inferredIndex !== -1) {\n                    throw new Error(\"Only one dimension can be inferred\");\n                }\n                inferredIndex = i;\n            }\n        }\n\n        const this_data = this.data;\n        if (inferredIndex !== -1) {\n            // Some dimension must be inferred\n            const productOther = dims.reduce((product, curr, index) => {\n                return index !== inferredIndex ? product * curr : product\n            }, 1);\n\n            dims[inferredIndex] = this_data.length / productOther;\n        }\n        return new Tensor(this.type, this_data, dims); // NOTE: uses same underlying storage\n    }\n\n    neg_() {\n        const this_data = this.data;\n        for (let i = 0; i < this_data.length; ++i) {\n            this_data[i] = -this_data[i];\n        }\n        return this;\n    }\n    neg() {\n        return this.clone().neg_();\n    }\n\n    /**\n     * Computes input > val element-wise.\n     * @param {number} val The value to compare with.\n     * @returns {Tensor} A boolean tensor that is `true` where input is greater than other and `false` elsewhere.\n     */\n    gt(val) {\n        const mask = new Uint8Array(this.data.length);\n        const this_data = this.data;\n        for (let i = 0; i < this_data.length; ++i) {\n            mask[i] = this_data[i] > val ? 1 : 0;\n        }\n        return new Tensor('bool', mask, this.dims);\n    }\n\n    /**\n     * Computes input < val element-wise.\n     * @param {number} val The value to compare with.\n     * @returns {Tensor} A boolean tensor that is `true` where input is less than other and `false` elsewhere.\n     */\n    lt(val) {\n        const mask = new Uint8Array(this.data.length);\n        const this_data = this.data;\n        for (let i = 0; i < this_data.length; ++i) {\n            mask[i] = this_data[i] < val ? 1 : 0;\n        }\n        return new Tensor('bool', mask, this.dims);\n    }\n\n    /**\n     * In-place version of @see {@link Tensor.clamp}\n     */\n    clamp_(min, max) {\n        const this_data = this.data;\n        for (let i = 0; i < this_data.length; ++i) {\n            this_data[i] = Math.min(Math.max(this_data[i], min), max);\n        }\n        return this;\n    }\n\n    /**\n     * Clamps all elements in input into the range [ min, max ]\n     * @param {number} min lower-bound of the range to be clamped to\n     * @param {number} max upper-bound of the range to be clamped to\n     * @returns {Tensor} the output tensor.\n     */\n    clamp(min, max) {\n        return this.clone().clamp_(min, max);\n    }\n\n    /**\n     * In-place version of @see {@link Tensor.round}\n     */\n    round_() {\n        const this_data = this.data;\n        for (let i = 0; i < this_data.length; ++i) {\n            this_data[i] = Math.round(this_data[i]);\n        }\n        return this;\n    }\n\n    /**\n     * Rounds elements of input to the nearest integer.\n     * @returns {Tensor} the output tensor.\n     */\n    round() {\n        return this.clone().round_();\n    }\n\n    mean(dim = null, keepdim = false) {\n        return mean(this, dim, keepdim);\n    }\n\n    min(dim = null, keepdim = false) {\n        if (dim === null) {\n            // None to reduce over all dimensions.\n            const val = min(this.data)[0];\n            return new Tensor(this.type, [val], [/* scalar */]);\n        }\n        const [type, result, resultDims] = reduce_helper((a, b) => Math.min(a, b), this, dim, keepdim, Infinity);\n        return new Tensor(type, result, resultDims);\n    }\n\n    max(dim = null, keepdim = false) {\n        if (dim === null) {\n            // None to reduce over all dimensions.\n            const val = max(this.data)[0];\n            return new Tensor(this.type, [val], [/* scalar */]);\n        }\n        const [type, result, resultDims] = reduce_helper((a, b) => Math.max(a, b), this, dim, keepdim, -Infinity);\n        return new Tensor(type, result, resultDims);\n    }\n\n    argmin(dim = null, keepdim = false) {\n        if (dim !== null) {\n            throw new Error(\"`dim !== null` not yet implemented.\");\n        }\n        const index = min(this.data)[1];\n        return new Tensor('int64', [BigInt(index)], []);\n    }\n    argmax(dim = null, keepdim = false) {\n        if (dim !== null) {\n            throw new Error(\"`dim !== null` not yet implemented.\");\n        }\n        const index = max(this.data)[1];\n        return new Tensor('int64', [BigInt(index)], []);\n    }\n\n    /**\n     * Performs Tensor dtype conversion.\n     * @param {DataType} type The desired data type.\n     * @returns {Tensor} The converted tensor.\n     */\n    to(type) {\n        // If the self Tensor already has the correct dtype, then self is returned.\n        if (this.type === type) return this;\n\n        // Otherwise, the returned tensor is a copy of self with the desired dtype.\n        if (!DataTypeMap.hasOwnProperty(type)) {\n            throw new Error(`Unsupported type: ${type}`);\n        }\n\n        // Handle special cases where a mapping function is needed (e.g., where one type is a bigint and the other is a number)\n        let map_fn;\n        const is_source_bigint = ['int64', 'uint64'].includes(this.type);\n        const is_dest_bigint = ['int64', 'uint64'].includes(type);\n        if (is_source_bigint && !is_dest_bigint) {\n            // TypeError: Cannot convert a BigInt value to a number\n            map_fn = Number;\n        } else if (!is_source_bigint && is_dest_bigint) {\n            // TypeError: Cannot convert [x] to a BigInt\n            if (['float16', 'float32', 'float64'].includes(this.type)) {\n                map_fn = (x) => BigInt(Math.floor(x));\n            } else {\n                map_fn = BigInt;\n            }\n        }\n\n        // @ts-ignore\n        return new Tensor(type, DataTypeMap[type].from(this.data, map_fn), this.dims);\n    }\n}\n\n/**\n * This creates a nested array of a given type and depth (see examples).\n *\n * @example\n *   NestArray<string, 1>; // string[]\n * @example\n *   NestArray<number, 2>; // number[][]\n * @example\n *   NestArray<string, 3>; // string[][][] etc.\n * @template T\n * @template {number} Depth\n * @template {never[]} [Acc=[]]\n * @typedef {Acc['length'] extends Depth ? T : NestArray<T[], Depth, [...Acc, never]>} NestArray\n */\n\n/**\n * Reshapes a 1-dimensional array into an n-dimensional array, according to the provided dimensions.\n *\n * @example\n *   reshape([10                    ], [1      ]); // Type: number[]      Value: [10]\n *   reshape([1, 2, 3, 4            ], [2, 2   ]); // Type: number[][]    Value: [[1, 2], [3, 4]]\n *   reshape([1, 2, 3, 4, 5, 6, 7, 8], [2, 2, 2]); // Type: number[][][]  Value: [[[1, 2], [3, 4]], [[5, 6], [7, 8]]]\n *   reshape([1, 2, 3, 4, 5, 6, 7, 8], [4, 2   ]); // Type: number[][]    Value: [[1, 2], [3, 4], [5, 6], [7, 8]]\n * @param {T[]|DataArray} data The input array to reshape.\n * @param {DIM} dimensions The target shape/dimensions.\n * @template T\n * @template {[number]|number[]} DIM\n * @returns {NestArray<T, DIM[\"length\"]>} The reshaped array.\n */\nfunction reshape(data, dimensions) {\n\n    const totalElements = data.length;\n    const dimensionSize = dimensions.reduce((a, b) => a * b);\n\n    if (totalElements !== dimensionSize) {\n        throw Error(`cannot reshape array of size ${totalElements} into shape (${dimensions})`);\n    }\n\n    /** @type {any} */\n    let reshapedArray = data;\n\n    for (let i = dimensions.length - 1; i >= 0; i--) {\n        reshapedArray = reshapedArray.reduce((acc, val) => {\n            let lastArray = acc[acc.length - 1];\n\n            if (lastArray.length < dimensions[i]) {\n                lastArray.push(val);\n            } else {\n                acc.push([val]);\n            }\n\n            return acc;\n        }, [[]]);\n    }\n\n    return reshapedArray[0];\n}\n\n/**\n * Permutes a tensor according to the provided axes.\n * @param {any} tensor The input tensor to permute.\n * @param {Array} axes The axes to permute the tensor along.\n * @returns {Tensor} The permuted tensor.\n */\nexport function permute(tensor, axes) {\n    const [permutedData, shape] = permute_data(tensor.data, tensor.dims, axes);\n    return new Tensor(tensor.type, permutedData, shape);\n}\n\n\n/**\n * Interpolates an Tensor to the given size.\n * @param {Tensor} input The input tensor to interpolate. Data must be channel-first (i.e., [c, h, w])\n * @param {number[]} size The output size of the image\n * @param {string} mode The interpolation mode\n * @param {boolean} align_corners Whether to align corners.\n * @returns {Tensor} The interpolated tensor.\n */\nexport function interpolate(input, [out_height, out_width], mode = 'bilinear', align_corners = false) {\n\n    // Input image dimensions\n    const in_channels = input.dims.at(-3) ?? 1;\n    const in_height = input.dims.at(-2);\n    const in_width = input.dims.at(-1);\n\n    let output = interpolate_data(\n        /** @type {import('./maths.js').TypedArray}*/(input.data),\n        [in_channels, in_height, in_width],\n        [out_height, out_width],\n        mode,\n        align_corners\n    );\n    return new Tensor(input.type, output, [in_channels, out_height, out_width]);\n}\n\n\n/**\n * Down/up samples the input.\n * Inspired by https://pytorch.org/docs/stable/generated/torch.nn.functional.interpolate.html.\n * @param {Tensor} input the input tensor\n * @param {Object} options the options for the interpolation\n * @param {[number, number]|[number, number, number]|[number, number, number, number]} [options.size=null] output spatial size.\n * @param {\"nearest\"|\"bilinear\"|\"bicubic\"} [options.mode='bilinear'] algorithm used for upsampling\n * @returns {Promise<Tensor>} The interpolated tensor.\n */\nexport async function interpolate_4d(input, {\n    size = null,\n    mode = 'bilinear',\n} = {}) {\n\n    // Error checking\n    if (input.dims.length !== 4) {\n        throw new Error('`interpolate_4d` currently only supports 4D input.');\n    }\n    if (!size) {\n        // TODO: support scale_factor\n        throw new Error('`interpolate_4d` requires a `size` argument.');\n    }\n\n    // Fill in missing dimensions\n    let targetDims;\n    if (size.length === 2) {\n        targetDims = [...input.dims.slice(0, 2), ...size];\n    } else if (size.length === 3) {\n        targetDims = [input.dims[0], ...size];\n    } else if (size.length === 4) {\n        targetDims = size;\n    } else {\n        throw new Error('`size` must be of length 2, 3, or 4.');\n    }\n\n    let op;\n    if (mode === 'nearest') {\n        op = await TensorOpRegistry.nearest_interpolate_4d;\n    } else if (mode === 'bilinear') {\n        op = await TensorOpRegistry.bilinear_interpolate_4d;\n    } else if (mode === 'bicubic') {\n        op = await TensorOpRegistry.bicubic_interpolate_4d;\n    } else {\n        throw new Error(`Unsupported mode: ${mode}`);\n    }\n\n    const sizeTensor = new Tensor('int64', new BigInt64Array(targetDims.map(BigInt)), [targetDims.length]);\n    return await op({ x: input, s: sizeTensor });\n}\n\n/**\n * Matrix product of two tensors.\n * Inspired by https://pytorch.org/docs/stable/generated/torch.matmul.html\n * @param {Tensor} a the first tensor to be multiplied\n * @param {Tensor} b the second tensor to be multiplied\n * @returns {Promise<Tensor>} The matrix product of the two tensors.\n */\nexport async function matmul(a, b) {\n    const op = await TensorOpRegistry.matmul;\n    return await op({ a, b });\n}\n\n/**\n * Computes the one dimensional Fourier transform of real-valued input.\n * Inspired by https://pytorch.org/docs/stable/generated/torch.fft.rfft.html\n * @param {Tensor} x the real input tensor\n * @param {Tensor} a The dimension along which to take the one dimensional real FFT.\n * @returns {Promise<Tensor>} the output tensor.\n */\nexport async function rfft(x, a) {\n    const op = await TensorOpRegistry.rfft;\n    return await op({ x, a });\n}\n\n\n/**\n * Returns the k largest elements of the given input tensor.\n * Inspired by https://pytorch.org/docs/stable/generated/torch.topk.html\n * @param {Tensor} x the input tensor\n * @param {number} [k] the k in \"top-k\"\n * @returns {Promise<[Tensor, Tensor]>} the output tuple of (Tensor, LongTensor) of top-k elements and their indices.\n */\nexport async function topk(x, k) {\n    const op = await TensorOpRegistry.top_k;\n\n    if (k == null) {\n        k = x.dims.at(-1);\n    } else {\n        k = Math.min(k, x.dims.at(-1));\n    }\n    return await op({\n        x,\n        k: new Tensor(\n            'int64',\n            [BigInt(k)],\n            [1]\n        )\n    });\n}\n\n\nconst arrayToIndexTensor = (array) => new Tensor('int64', array, [array.length]);\n/**\n * Slice a multidimensional float32 tensor.\n * @param {Tensor} data: Tensor of data to extract slices from\n * @param {number[]} starts: 1-D array of starting indices of corresponding axis in axes\n * @param {number[]} ends: 1-D array of ending indices (exclusive) of corresponding axis in axes\n * @param {number[]} axes: 1-D array of axes that starts and ends apply to\n * @param {number[]} [steps]: 1-D array of slice step of corresponding axis in axes.\n * @returns {Promise<Tensor>} Sliced data tensor.\n */\nexport async function slice(data, starts, ends, axes, steps) {\n    const op = await TensorOpRegistry.slice;\n    return await op({\n        x: data,\n        s: arrayToIndexTensor(starts),\n        e: arrayToIndexTensor(ends),\n        a: arrayToIndexTensor(axes),\n        t: arrayToIndexTensor(steps ?? new Array(axes.length).fill(1)),\n    });\n}\n\n\n/**\n * Perform mean pooling of the last hidden state followed by a normalization step.\n * @param {Tensor} last_hidden_state Tensor of shape [batchSize, seqLength, embedDim]\n * @param {Tensor} attention_mask Tensor of shape [batchSize, seqLength]\n * @returns {Tensor} Returns a new Tensor of shape [batchSize, embedDim].\n */\nexport function mean_pooling(last_hidden_state, attention_mask) {\n    // last_hidden_state: [batchSize, seqLength, embedDim]\n    // attention_mask:    [batchSize, seqLength]\n    const lastHiddenStateData = last_hidden_state.data;\n    const attentionMaskData = attention_mask.data;\n\n    const shape = [last_hidden_state.dims[0], last_hidden_state.dims[2]];\n\n    // @ts-ignore\n    const returnedData = new lastHiddenStateData.constructor(shape[0] * shape[1]);\n    const [batchSize, seqLength, embedDim] = last_hidden_state.dims;\n\n    let outIndex = 0;\n    for (let i = 0; i < batchSize; ++i) {\n        const offset = i * embedDim * seqLength;\n\n        for (let k = 0; k < embedDim; ++k) {\n            let sum = 0;\n            let count = 0;\n\n            const attnMaskOffset = i * seqLength;\n            const offset2 = offset + k;\n            // Pool over all words in sequence\n            for (let j = 0; j < seqLength; ++j) {\n                // index into attention mask\n                const attn = Number(attentionMaskData[attnMaskOffset + j]);\n\n                count += attn;\n                sum += lastHiddenStateData[offset2 + j * embedDim] * attn;\n            }\n\n            const avg = sum / count;\n            returnedData[outIndex++] = avg;\n        }\n    }\n\n    return new Tensor(\n        last_hidden_state.type,\n        returnedData,\n        shape\n    )\n}\n\n/**\n * Apply Layer Normalization for last certain number of dimensions.\n * @param {Tensor} input The input tensor\n * @param {number[]} normalized_shape input shape from an expected input of size\n * @param {Object} options The options for the layer normalization\n * @param {number} [options.eps=1e-5] A value added to the denominator for numerical stability.\n * @returns {Tensor} The normalized tensor.\n */\nexport function layer_norm(input, normalized_shape, {\n    eps = 1e-5,\n} = {}) {\n    if (input.dims.length !== 2) {\n        throw new Error('`layer_norm` currently only supports 2D input.');\n    }\n\n    const [batchSize, featureDim] = input.dims;\n\n    if (normalized_shape.length !== 1 && normalized_shape[0] !== featureDim) {\n        throw new Error('`normalized_shape` must be a 1D array with shape `[input.dims[1]]`.');\n    }\n\n    const [std, mean] = std_mean(input, 1, 0, true);\n    const stdData = /** @type {Float32Array} */(std.data);\n    const meanData = /** @type {Float32Array} */(mean.data);\n\n    const inputData = /** @type {Float32Array} */(input.data);\n\n    // @ts-ignore\n    const returnedData = new inputData.constructor(inputData.length);\n\n    for (let i = 0; i < batchSize; ++i) {\n        const offset = i * featureDim;\n        for (let j = 0; j < featureDim; ++j) {\n            const offset2 = offset + j;\n            returnedData[offset2] = (inputData[offset2] - meanData[i]) / (stdData[i] + eps);\n        }\n    }\n    return new Tensor(input.type, returnedData, input.dims);\n}\n\n/**\n * Helper function to calculate new dimensions when performing a squeeze operation.\n * @param {number[]} dims The dimensions of the tensor.\n * @param {number|number[]|null} dim The dimension(s) to squeeze.\n * @returns {number[]} The new dimensions.\n * @private\n */\nfunction calc_squeeze_dims(dims, dim) {\n    dims = dims.slice();\n    if (dim === null) {\n        dims = dims.filter((d) => d !== 1);\n    } else if (typeof dim === 'number') {\n        if (dims[dim] === 1) {\n            dims.splice(dim, 1);\n        }\n    } else if (Array.isArray(dim)) {\n        dims = dims.filter((x, i) => {\n            return x !== 1 || !dim.includes(i);\n        });\n    }\n    return dims;\n}\n\n/**\n * Helper function to calculate new dimensions when performing an unsqueeze operation.\n * @param {number[]} dims The dimensions of the tensor.\n * @param {number} dim The dimension to unsqueeze.\n * @returns {number[]} The new dimensions.\n * @private\n */\nfunction calc_unsqueeze_dims(dims, dim) {\n    // Dimension out of range (e.g., \"expected to be in range of [-4, 3], but got 4\")\n    // + 1 since we allow inserting at the end (i.e. dim = -1)\n    dim = safeIndex(dim, dims.length + 1);\n    dims = dims.slice();\n    // Insert 1 into specified dimension\n    dims.splice(dim, 0, 1);\n    return dims;\n}\n\n/**\n * Safely calculate the index for an array of a given size, allowing negative indexing.\n * @param {number} index The index that will be used.\n * @param {number} size The size of the array.\n * @param {number} [dimension=null] The dimension that the index is for (optional).\n * @returns {number} The index, guaranteed to be non-negative and less than `arrayLength`.\n *\n * @throws {Error} If the index is out of range.\n * @private\n */\nfunction safeIndex(index, size, dimension = null, boundsCheck = true) {\n    if (index < -size || index >= size) {\n        if (boundsCheck) {\n            throw new Error(`IndexError: index ${index} is out of bounds for dimension${dimension === null ? '' : ' ' + dimension} with size ${size}`);\n        } else {\n            return index < -size ? 0 : size;\n        }\n    }\n\n    if (index < 0) {\n        // Negative indexing, ensuring positive index\n        index = ((index % size) + size) % size;\n    }\n    return index;\n}\n\n/**\n * Concatenates an array of tensors along a specified dimension.\n * @param {Tensor[]} tensors The array of tensors to concatenate.\n * @param {number} dim The dimension to concatenate along.\n * @returns {Tensor} The concatenated tensor.\n */\nexport function cat(tensors, dim = 0) {\n    dim = safeIndex(dim, tensors[0].dims.length);\n\n    // TODO do validation of shapes\n\n    const resultDims = tensors[0].dims.slice();\n    resultDims[dim] = tensors.reduce((a, b) => a + b.dims[dim], 0);\n\n    // Create a new array to store the accumulated values\n    const resultSize = resultDims.reduce((a, b) => a * b, 1);\n    // @ts-ignore\n    const result = new tensors[0].data.constructor(resultSize);\n\n    // Create output tensor of same type as first\n    const resultType = tensors[0].type;\n\n    if (dim === 0) {\n        // Handle special case for performance reasons\n\n        let offset = 0;\n        for (const tensor of tensors) {\n            const tensorData = tensor.data;\n            result.set(tensorData, offset);\n            offset += tensorData.length;\n        }\n\n    } else {\n\n        let currentDim = 0;\n\n        for (let t = 0; t < tensors.length; ++t) {\n            const { data, dims } = tensors[t];\n\n            // Iterate over the data array\n            for (let i = 0; i < data.length; ++i) {\n                // Calculate the index in the resulting array\n                let resultIndex = 0;\n\n                for (let j = dims.length - 1, num = i, resultMultiplier = 1; j >= 0; --j) {\n                    const size = dims[j];\n                    let index = num % size;\n                    if (j === dim) {\n                        index += currentDim;\n                    }\n                    resultIndex += index * resultMultiplier;\n                    resultMultiplier *= resultDims[j];\n                    num = Math.floor(num / size);\n                }\n                // Accumulate the value at the current index\n                result[resultIndex] = data[i];\n            }\n\n            currentDim += dims[dim];\n        }\n    }\n    return new Tensor(resultType, result, resultDims);\n}\n\n/**\n * Stack an array of tensors along a specified dimension.\n * @param {Tensor[]} tensors The array of tensors to stack.\n * @param {number} dim The dimension to stack along.\n * @returns {Tensor} The stacked tensor.\n */\nexport function stack(tensors, dim = 0) {\n    // TODO do validation of shapes\n    // NOTE: stack expects each tensor to be equal size\n    return cat(tensors.map(t => t.unsqueeze(dim)), dim);\n}\n\n\n/**\n * @param {(previousValue: any, currentValue: any, currentIndex?: number, resultIndex?: number) => any} callbackfn\n * @param {Tensor} input the input tensor.\n * @param {number|null} dim the dimension to reduce.\n * @param {boolean} keepdim whether the output tensor has dim retained or not.\n * @returns {[DataType, any, number[]]} The reduced tensor data.\n */\nfunction reduce_helper(callbackfn, input, dim = null, keepdim = false, initialValue = null) {\n    const inputData = input.data;\n    const inputDims = input.dims;\n\n    // Negative indexing\n    dim = safeIndex(dim, inputDims.length);\n\n    // Calculate the shape of the resulting array after summation\n    const resultDims = inputDims.slice(); // Copy the original dimensions\n    resultDims[dim] = 1; // Remove the specified axis\n\n    // Create a new array to store the accumulated values\n    // @ts-ignore\n    const result = new inputData.constructor(inputData.length / inputDims[dim]);\n    if (initialValue !== null) {\n        result.fill(initialValue);\n    }\n\n    // Iterate over the data array\n    for (let i = 0; i < inputData.length; ++i) {\n\n        // Calculate the index in the resulting array\n        let resultIndex = 0;\n\n        for (let j = inputDims.length - 1, num = i, resultMultiplier = 1; j >= 0; --j) {\n            const size = inputDims[j];\n            if (j !== dim) {\n                const index = num % size;\n                resultIndex += index * resultMultiplier;\n                resultMultiplier *= resultDims[j];\n            }\n            num = Math.floor(num / size);\n        }\n\n        // Accumulate the value at the current index\n        result[resultIndex] = callbackfn(result[resultIndex], inputData[i], i, resultIndex);\n    }\n\n    if (!keepdim) resultDims.splice(dim, 1);\n\n    return [input.type, result, resultDims];\n}\n\n\n/**\n * Calculates the standard deviation and mean over the dimensions specified by dim. dim can be a single dimension or `null` to reduce over all dimensions.\n * @param {Tensor} input the input tenso\n * @param {number|null} dim the dimension to reduce. If None, all dimensions are reduced.\n * @param {number} correction difference between the sample size and sample degrees of freedom. Defaults to Bessel's correction, correction=1.\n * @param {boolean} keepdim whether the output tensor has dim retained or not.\n * @returns {Tensor[]} A tuple of (std, mean) tensors.\n */\nexport function std_mean(input, dim = null, correction = 1, keepdim = false) {\n    const inputData = /** @type {Float32Array} */(input.data);\n    const inputDims = input.dims;\n\n    if (dim === null) {\n        // None to reduce over all dimensions.\n        const sum = inputData.reduce((a, b) => a + b, 0);\n        const mean = sum / inputData.length;\n        const std = Math.sqrt(inputData.reduce((a, b) => a + (b - mean) ** 2, 0) / (inputData.length - correction));\n\n        const meanTensor = new Tensor(input.type, [mean], [/* scalar */]);\n        const stdTensor = new Tensor(input.type, [std], [/* scalar */]);\n\n        return [stdTensor, meanTensor];\n    }\n    dim = safeIndex(dim, inputDims.length);\n    const meanTensor = mean(input, dim, keepdim);\n    const meanTensorData = meanTensor.data;\n\n    // Compute squared sum\n    const [type, result, resultDims] = reduce_helper((a, b, i, j) => a + (b - meanTensorData[j]) ** 2, input, dim, keepdim);\n\n    // Square root of the squared sum\n    for (let i = 0; i < result.length; ++i) {\n        result[i] = Math.sqrt(result[i] / (inputDims[dim] - correction));\n    }\n\n    const stdTensor = new Tensor(type, result, resultDims);\n\n    return [stdTensor, meanTensor];\n}\n\n/**\n * Returns the mean value of each row of the input tensor in the given dimension dim.\n * @param {Tensor} input the input tensor.\n * @param {number|null} dim the dimension to reduce.\n * @param {boolean} keepdim whether the output tensor has dim retained or not.\n * @returns {Tensor} A new tensor with means taken along the specified dimension.\n */\nexport function mean(input, dim = null, keepdim = false) {\n    const inputDims = input.dims;\n    const inputData = /** @type {Float32Array} */(input.data);\n\n    if (dim === null) {\n        // None to reduce over all dimensions.\n        const val = inputData.reduce((a, b) => a + b, 0);\n        return new Tensor(input.type, [val / inputData.length], [/* scalar */]);\n    }\n    dim = safeIndex(dim, inputDims.length);\n\n    // Compute sum\n    const [type, result, resultDims] = reduce_helper((a, b) => a + b, input, dim, keepdim);\n\n    // Divide by number of elements in the dimension\n    if (inputDims[dim] !== 1) {\n        for (let i = 0; i < result.length; ++i) {\n            result[i] /= inputDims[dim];\n        }\n    }\n\n    return new Tensor(type, result, resultDims);\n}\n\n\nfunction dimsToStride(dims) {\n    const stride = new Array(dims.length);\n    for (let i = dims.length - 1, s2 = 1; i >= 0; --i) {\n        stride[i] = s2;\n        s2 *= dims[i];\n    }\n    return stride;\n}\n\nfunction fullHelper(size, fill_value, dtype, cls) {\n    const numElements = size.reduce((a, b) => a * b, 1);\n    return new Tensor(\n        dtype,\n        new cls(numElements).fill(fill_value),\n        size\n    )\n}\n\n/**\n * Creates a tensor of size size filled with fill_value. The tensor's dtype is inferred from fill_value.\n * @param {number[]} size A sequence of integers defining the shape of the output tensor.\n * @param {number|bigint|boolean} fill_value The value to fill the output tensor with.\n * @returns {Tensor} The filled tensor.\n */\nexport function full(size, fill_value) {\n    let dtype;\n    let typedArrayCls;\n    if (typeof fill_value === 'number') {\n        dtype = 'float32';\n        typedArrayCls = Float32Array;\n    } else if (typeof fill_value === 'bigint') {\n        dtype = 'int64';\n        typedArrayCls = BigInt64Array;\n    } else if (typeof fill_value === 'boolean') {\n        dtype = 'bool';\n        typedArrayCls = Uint8Array;\n    } else {\n        // TODO: support other dtypes\n        throw new Error(`Unsupported data type: ${typeof fill_value}`);\n    }\n    return fullHelper(size, fill_value, dtype, typedArrayCls);\n}\n\nexport function full_like(tensor, fill_value) {\n    return full(tensor.dims, fill_value);\n}\n\n/**\n * Returns a tensor filled with the scalar value 1, with the shape defined by the variable argument size.\n * @param {number[]} size A sequence of integers defining the shape of the output tensor.\n * @returns {Tensor} The ones tensor.\n */\nexport function ones(size) {\n    return fullHelper(size, 1n, 'int64', BigInt64Array);\n}\n\n/**\n * Returns a tensor filled with the scalar value 1, with the same size as input.\n * @param {Tensor} tensor The size of input will determine size of the output tensor.\n * @returns {Tensor} The ones tensor.\n */\nexport function ones_like(tensor) {\n    return ones(tensor.dims);\n}\n\n/**\n * Returns a tensor filled with the scalar value 0, with the shape defined by the variable argument size.\n * @param {number[]} size A sequence of integers defining the shape of the output tensor.\n * @returns {Tensor} The zeros tensor.\n */\nexport function zeros(size) {\n    return fullHelper(size, 0n, 'int64', BigInt64Array);\n}\n\n/**\n * Returns a tensor filled with the scalar value 0, with the same size as input.\n * @param {Tensor} tensor The size of input will determine size of the output tensor.\n * @returns {Tensor} The zeros tensor.\n */\nexport function zeros_like(tensor) {\n    return zeros(tensor.dims);\n}\n\n/**\n * Returns a tensor filled with random numbers from a uniform distribution on the interval [0, 1)\n * @param {number[]} size A sequence of integers defining the shape of the output tensor.\n * @returns {Tensor} The random tensor.\n */\nexport function rand(size) {\n    const length = size.reduce((a, b) => a * b, 1);\n    return new Tensor(\n        \"float32\",\n        Float32Array.from({ length }, () => Math.random()),\n        size,\n    )\n}\n\n/**\n * Returns a tensor filled with random numbers from a normal distribution with mean 0 and variance 1 (also called the standard normal distribution).\n * @param {number[]} size A sequence of integers defining the shape of the output tensor.\n * @returns {Tensor} The random tensor.\n */\nexport function randn(size) {\n    const length = size.reduce((a, b) => a * b, 1);\n\n    // Box-Muller transform\n    function boxMullerRandom() {\n        // NOTE: 1 - Math.random() is used to avoid log(0)\n        const u = 1 - Math.random();\n        const v = 1 - Math.random();\n        return Math.sqrt(-2.0 * Math.log(u)) * Math.cos(2.0 * Math.PI * v);\n    }\n\n    return new Tensor(\n        \"float32\",\n        Float32Array.from({ length }, () => boxMullerRandom()),\n        size,\n    )\n}\n\n/**\n * Quantizes the embeddings tensor to binary or unsigned binary precision.\n * @param {Tensor} tensor The tensor to quantize.\n * @param {'binary'|'ubinary'} precision The precision to use for quantization.\n * @returns {Tensor} The quantized tensor.\n */\nexport function quantize_embeddings(tensor, precision) {\n    if (tensor.dims.length !== 2) {\n        throw new Error(\"The tensor must have 2 dimensions\");\n    }\n    if (tensor.dims.at(-1) % 8 !== 0) {\n        throw new Error(\"The last dimension of the tensor must be a multiple of 8\");\n    }\n    if (!['binary', 'ubinary'].includes(precision)) {\n        throw new Error(\"The precision must be either 'binary' or 'ubinary'\");\n    }\n\n    const signed = precision === 'binary';\n    const dtype = signed ? 'int8' : 'uint8';\n\n    // Create a typed array to store the packed bits\n    const cls = signed ? Int8Array : Uint8Array;\n    const inputData = tensor.data;\n    const outputData = new cls(inputData.length / 8);\n\n    // Iterate over each number in the array\n    for (let i = 0; i < inputData.length; ++i) {\n        // Determine if the number is greater than 0\n        const bit = inputData[i] > 0 ? 1 : 0;\n\n        // Calculate the index in the typed array and the position within the byte\n        const arrayIndex = Math.floor(i / 8);\n        const bitPosition = i % 8;\n\n        // Pack the bit into the typed array\n        outputData[arrayIndex] |= bit << (7 - bitPosition);\n        if (signed && bitPosition === 0) {\n            outputData[arrayIndex] -= 128;\n        }\n    };\n\n    return new Tensor(dtype, outputData, [tensor.dims[0], tensor.dims[1] / 8]);\n}\n", "\n/**\n * @file Custom data structures.\n * \n * These are only used internally, meaning an end-user shouldn't\n * need to access anything here.\n * \n * @module utils/data-structures\n */\n\n\n/**\n * Efficient Heap-based Implementation of a Priority Queue.\n * It uses an array-based binary heap, where the root is at index `0`, and the\n * children of node `i` are located at indices `2i + 1` and `2i + 2`, respectively.\n * \n * Adapted from the following sources:\n * - https://stackoverflow.com/a/42919752/13989043 (original)\n * - https://github.com/belladoreai/llama-tokenizer-js (minor improvements)\n */\nexport class PriorityQueue {\n\n    /**\n     * Create a new PriorityQueue.\n     * @param {function(any, any): boolean} comparator Comparator function to determine priority. Defaults to a MaxHeap.\n     */\n    constructor(comparator = (a, b) => a > b, maxSize = Infinity) {\n        this._heap = [];\n        this._comparator = comparator;\n        this._maxSize = maxSize;\n    }\n\n    /**\n     * The size of the queue\n     */\n    get size() {\n        return this._heap.length;\n    }\n\n    /**\n     * Check if the queue is empty.\n     * @returns {boolean} `true` if the queue is empty, `false` otherwise.\n     */\n    isEmpty() {\n        return this.size === 0;\n    }\n\n    /**\n     * Return the element with the highest priority in the queue.\n     * @returns {any} The highest priority element in the queue.\n     */\n    peek() {\n        return this._heap[0];\n    }\n\n    /**\n     * Add one or more elements to the queue.\n     * @param  {...any} values The values to push into the queue.\n     * @returns {number} The new size of the queue.\n     */\n    push(...values) {\n        return this.extend(values);\n    }\n\n    /**\n     * Add multiple elements to the queue.\n     * @param {any[]} values The values to push into the queue.\n     * @returns {number} The new size of the queue.\n     */\n    extend(values) {\n        for (const value of values) {\n            if (this.size < this._maxSize) {\n                this._heap.push(value);\n                this._siftUp();\n            } else {\n                // Get index of value with the lowest priority\n                const smallest = this._smallest();\n\n                // If the new value has higher priority than the smallest value in the heap\n                // then replace the smallest value with the new value and update the heap\n                if (this._comparator(value, this._heap[smallest])) {\n                    this._heap[smallest] = value;\n                    this._siftUpFrom(smallest);\n                }\n            }\n        }\n        return this.size;\n    }\n\n    /**\n     * Remove and return the element with the highest priority in the queue.\n     * @returns {any} The element with the highest priority in the queue.\n     */\n    pop() {\n        const poppedValue = this.peek();\n        const bottom = this.size - 1;\n        if (bottom > 0) {\n            this._swap(0, bottom);\n        }\n        this._heap.pop();\n        this._siftDown();\n        return poppedValue;\n    }\n\n    /**\n     * Replace the element with the highest priority in the queue with a new value.\n     * @param {*} value The new value.\n     * @returns {*} The replaced value.\n     */\n    replace(value) {\n        const replacedValue = this.peek();\n        this._heap[0] = value;\n        this._siftDown();\n        return replacedValue;\n    }\n\n    /**\n     * Compute the index for the parent of the node at index `i`.\n     * @param {number} i The index of the node to get the parent of.\n     * @returns {number} The index of the parent node.\n     * @private\n     */\n    _parent(i) {\n        return ((i + 1) >>> 1) - 1;\n    }\n\n    /**\n     * Compute the index for the left child of the node at index `i`.\n     * @param {number} i The index of the node to get the left child of.\n     * @returns {number} The index of the left child.\n     * @private\n     */\n    _left(i) {\n        return (i << 1) + 1;\n    }\n\n    /**\n     * Compute the index for the right child of the node at index `i`.\n     * @param {number} i The index of the node to get the right child of.\n     * @returns {number} The index of the right child.\n     * @private\n     */\n    _right(i) {\n        return (i + 1) << 1;\n    }\n\n    /**\n     * Check if the element at index `i` is greater than the element at index `j`.\n     * @param {number} i The index of the first element to compare.\n     * @param {number} j The index of the second element to compare.\n     * @returns {boolean} `true` if the element at index `i` is greater than the element at index `j`, `false` otherwise.\n     * @private\n     */\n    _greater(i, j) {\n        return this._comparator(this._heap[i], this._heap[j]);\n    }\n\n    /**\n     * Swap the elements at indices `i` and `j`.\n     * @param {number} i The index of the first element to swap.\n     * @param {number} j The index of the second element to swap.\n     * @private\n     */\n    _swap(i, j) {\n        const temp = this._heap[i];\n        this._heap[i] = this._heap[j];\n        this._heap[j] = temp;\n    }\n\n    /**\n     * Maintain the heap property by updating positions in the heap,\n     * starting at the last element and moving up the heap.\n     * @private\n     */\n    _siftUp() {\n        this._siftUpFrom(this.size - 1);\n    }\n\n    /**\n     * Helper function to sift up from a given node.\n     * @param {number} node The index of the node to start sifting up from.\n     */\n    _siftUpFrom(node) {\n        while (node > 0 && this._greater(node, this._parent(node))) {\n            this._swap(node, this._parent(node));\n            node = this._parent(node);\n        }\n    }\n\n    /**\n     * Maintain the heap property by updating positions in the heap,\n     * starting at the first element and moving down the heap.\n     * @private\n     */\n    _siftDown() {\n        let node = 0;\n        while (\n            (this._left(node) < this.size && this._greater(this._left(node), node)) ||\n            (this._right(node) < this.size && this._greater(this._right(node), node))\n        ) {\n            const maxChild = (this._right(node) < this.size && this._greater(this._right(node), this._left(node)))\n                ? this._right(node)\n                : this._left(node);\n            this._swap(node, maxChild);\n            node = maxChild;\n        }\n    }\n\n    /**\n     * Get the index of the smallest element in the heap. Since we use an array-based heap,\n     * the index can be computed without needing to traverse the heap.\n     * @private\n     */\n    _smallest() {\n        return (2 ** (Math.floor(Math.log2(this.size))) - 1);\n    }\n}\n\n/**\n * A trie structure to efficiently store and search for strings.\n */\nexport class CharTrie {\n    constructor() {\n        this.root = CharTrieNode.default();\n    }\n\n    /**\n     * Adds one or more `texts` to the trie.\n     * @param {string[]} texts The strings to add to the trie.\n     */\n    extend(texts) {\n        for (const text of texts) {\n            this.push(text);\n        }\n    }\n\n    /**\n     * Adds text to the trie.\n     * @param {string} text The string to add to the trie.\n     */\n    push(text) {\n        let node = this.root;\n        for (const ch of text) {\n            let child = node.children.get(ch);\n            if (child === undefined) {\n                child = CharTrieNode.default();\n                node.children.set(ch, child);\n            }\n            node = child;\n        }\n        node.isLeaf = true;\n    }\n\n    /**\n     * Searches the trie for all strings with a common prefix of `text`.\n     * @param {string} text The common prefix to search for.\n     * @yields {string} Each string in the trie that has `text` as a prefix.\n     */\n    *commonPrefixSearch(text) {\n        let node = this.root;\n        if (node === undefined) return;\n\n        let prefix = \"\";\n        for (const ch of text) {\n            prefix += ch;\n            node = node.children.get(ch);\n            if (node === undefined) return;\n            if (node.isLeaf) {\n                yield prefix;\n            }\n        }\n    }\n}\n\n/**\n * Represents a node in a character trie.\n */\nclass CharTrieNode {\n    /**\n     * Create a new CharTrieNode.\n     * @param {boolean} isLeaf Whether the node is a leaf node or not.\n     * @param {Map<string, CharTrieNode>} children A map containing the node's children, where the key is a character and the value is a `CharTrieNode`.\n     */\n    constructor(isLeaf, children) {\n        this.isLeaf = isLeaf;\n        this.children = children;\n    }\n\n    /**\n     * Returns a new `CharTrieNode` instance with default values.\n     * @returns {CharTrieNode} A new `CharTrieNode` instance with `isLeaf` set to `false` and an empty `children` map.\n     */\n    static default() {\n        return new CharTrieNode(false, new Map());\n    }\n}\n\n/**\n * A lattice data structure to be used for tokenization.\n */\nexport class TokenLattice {\n    /**\n     * Creates a new TokenLattice instance.\n     *\n     * @param {string} sentence The input sentence to be tokenized.\n     * @param {number} bosTokenId The beginning-of-sequence token ID.\n     * @param {number} eosTokenId The end-of-sequence token ID.\n     */\n    constructor(sentence, bosTokenId, eosTokenId) {\n        this.chars = Array.from(sentence);\n        this.len = this.chars.length;\n        this.bosTokenId = bosTokenId;\n        this.eosTokenId = eosTokenId;\n        this.nodes = [];\n        this.beginNodes = Array.from({ length: this.len + 1 }, () => []);\n        this.endNodes = Array.from({ length: this.len + 1 }, () => []);\n\n        const bos = new TokenLatticeNode(this.bosTokenId, 0, 0, 0, 0.0);\n        const eos = new TokenLatticeNode(this.eosTokenId, 1, this.len, 0, 0.0);\n        this.nodes.push(bos.clone());\n        this.nodes.push(eos.clone());\n        this.beginNodes[this.len].push(eos);\n        this.endNodes[0].push(bos);\n    }\n\n    /**\n     * Inserts a new token node into the token lattice.\n     *\n     * @param {number} pos The starting position of the token.\n     * @param {number} length The length of the token.\n     * @param {number} score The score of the token.\n     * @param {number} tokenId The token ID of the token.\n     */\n    insert(pos, length, score, tokenId) {\n        const nodeId = this.nodes.length;\n        const node = new TokenLatticeNode(tokenId, nodeId, pos, length, score);\n        this.beginNodes[pos].push(node);\n        this.endNodes[pos + length].push(node);\n        this.nodes.push(node);\n    }\n\n    /**\n     * Implements the Viterbi algorithm to compute the most likely sequence of tokens.\n     *\n     * @returns {TokenLatticeNode[]} The most likely sequence of tokens.\n     */\n    viterbi() {\n        const len = this.len;\n        let pos = 0;\n        while (pos <= len) {\n            if (this.beginNodes[pos].length == 0) {\n                return [];\n            }\n            for (let rnode of this.beginNodes[pos]) {\n                rnode.prev = null;\n                let bestScore = 0.0;\n                let bestNode = null;\n                for (let lnode of this.endNodes[pos]) {\n                    const score = lnode.backtraceScore + rnode.score;\n                    if (bestNode === null || score > bestScore) {\n                        bestNode = lnode.clone();\n                        bestScore = score;\n                    }\n                }\n\n                if (bestNode !== null) {\n                    rnode.prev = bestNode;\n                    rnode.backtraceScore = bestScore;\n                } else {\n                    return [];\n                }\n            }\n            ++pos;\n        }\n\n        const results = [];\n        const root = this.beginNodes[len][0];\n        const prev = root.prev;\n        if (prev === null) {\n            return [];\n        }\n\n        let node = prev.clone();\n        while (node.prev !== null) {\n            results.push(node.clone());\n            const n = node.clone();\n            node = n.prev.clone();\n        }\n\n        results.reverse();\n        return results;\n    }\n\n    /**\n     * @param {TokenLatticeNode} node\n     * @returns {string} The array of nodes representing the most likely sequence of tokens.\n     */\n    piece(node) {\n        return this.chars.slice(node.pos, node.pos + node.length).join('');\n    }\n\n    /**\n     * @returns {string[]} The most likely sequence of tokens.\n     */\n    tokens() {\n        const nodes = this.viterbi();\n        return nodes.map(x => this.piece(x));\n    }\n\n    /**\n     * @returns {number[]} The most likely sequence of token ids.\n     */\n    tokenIds() {\n        const nodes = this.viterbi();\n        return nodes.map(x => x.tokenId);\n    }\n}\nclass TokenLatticeNode {\n    /**\n     * Represents a node in a token lattice for a given sentence.\n     * @param {number} tokenId The ID of the token associated with this node.\n     * @param {number} nodeId The ID of this node.\n     * @param {number} pos The starting position of the token in the sentence.\n     * @param {number} length The length of the token.\n     * @param {number} score The score associated with the token.\n     */\n    constructor(tokenId, nodeId, pos, length, score) {\n        this.tokenId = tokenId;\n        this.nodeId = nodeId;\n        this.pos = pos;\n        this.length = length;\n        this.score = score;\n        this.prev = null;\n        this.backtraceScore = 0.0;\n    }\n\n    /**\n     * Returns a clone of this node.\n     * @returns {TokenLatticeNode} A clone of this node.\n     */\n    clone() {\n        const n = new TokenLatticeNode(this.tokenId, this.nodeId, this.pos, this.length, this.score);\n        n.prev = this.prev;\n        n.backtraceScore = this.backtraceScore;\n        return n;\n    }\n}\n\n/**\n * A data structure which uses a trie to split a string into tokens based on a dictionary.\n * It can also use a regular expression to preprocess the input text before splitting.\n * \n * NOTE: To ensure multi-byte characters are handled correctly, we operate at byte-level instead of character-level.\n */\nexport class DictionarySplitter {\n    /**\n     * @param {string[]} dictionary The dictionary of words to use for splitting.\n     */\n    constructor(dictionary) {\n        this.trie = this._buildTrie(dictionary);\n    }\n\n    /**\n     * Builds a trie from the given dictionary.\n     * @param {string[]} dictionary The dictionary of words to build the trie from.\n     * @returns {Object} The root node of the trie.\n     * @private\n     */\n    _buildTrie(dictionary) {\n        const trie = Object.create(null);\n        for (const word of dictionary) {\n            let node = trie;\n            for (let i = 0; i < word.length; ++i) {\n                node = (node[word[i]] ??= Object.create(null));\n            }\n            node.end = word;\n        }\n        return trie;\n    }\n\n    /**\n     * Splits the input text into tokens based on the dictionary.\n     * @param {string} text The input text to split.\n     * @returns {string[]} An array of tokens.\n     */\n    split(text) {\n        const result = [];\n        const n = text.length;\n        let start = 0;\n        let i = 0;\n\n        while (i < n) {\n            let node = this.trie;\n            let match = null;\n            let j = i;\n\n            while (j < n && (node = node[text[j]])) {\n                if (node.end) {\n                    // Always keep the last (i.e., longest) match.\n                    match = node.end;\n                }\n                ++j;\n            }\n\n            if (match) {\n                if (i > start) {\n                    result.push(text.slice(start, i));\n                }\n                result.push(match);\n                i += match.length;\n                start = i;\n            } else {\n                ++i;\n            }\n        }\n        if (start < n) {\n            result.push(text.slice(start));\n        }\n        return result;\n    }\n}\n\n/**\n* A simple Least Recently Used (LRU) cache implementation in JavaScript.\n* This cache stores key-value pairs and evicts the least recently used item\n* when the capacity is exceeded.\n*/\nexport class LRUCache {\n    /**\n     * Creates an LRUCache instance.\n     * @param {number} capacity The maximum number of items the cache can hold.\n     */\n    constructor(capacity) {\n        this.capacity = capacity;\n        this.cache = new Map();\n    }\n\n    /**\n     * Retrieves the value associated with the given key and marks the key as recently used.\n     * @param {any} key The key to retrieve.\n     * @returns {any} The value associated with the key, or undefined if the key does not exist.\n     */\n    get(key) {\n        if (!this.cache.has(key)) return undefined;\n        const value = this.cache.get(key);\n        this.cache.delete(key);\n        this.cache.set(key, value);\n        return value;\n    }\n\n    /**\n     * Inserts or updates the key-value pair in the cache.\n     * If the key already exists, it is updated and marked as recently used.\n     * If the cache exceeds its capacity, the least recently used item is evicted.\n     * @param {any} key The key to add or update.\n     * @param {any} value The value to associate with the key.\n     */\n    put(key, value) {\n        if (this.cache.has(key)) {\n            this.cache.delete(key);\n        }\n        this.cache.set(key, value);\n        if (this.cache.size > this.capacity) {\n            this.cache.delete(this.cache.keys().next().value);\n        }\n    }\n\n    /**\n     * Clears the cache.\n     */\n    clear() {\n        this.cache.clear();\n    }\n}\n", "// src/lexer.ts\nvar TOKEN_TYPES = Object.freeze({\n  Text: \"Text\",\n  // The text between Jinja statements or expressions\n  NumericLiteral: \"NumericLiteral\",\n  // e.g., 123, 1.0\n  StringLiteral: \"StringLiteral\",\n  // 'string'\n  Identifier: \"Identifier\",\n  // Variables, functions, statements, booleans, etc.\n  Equals: \"Equals\",\n  // =\n  OpenParen: \"OpenParen\",\n  // (\n  CloseParen: \"CloseParen\",\n  // )\n  OpenStatement: \"OpenStatement\",\n  // {%\n  CloseStatement: \"CloseStatement\",\n  // %}\n  OpenExpression: \"OpenExpression\",\n  // {{\n  CloseExpression: \"CloseExpression\",\n  // }}\n  OpenSquareBracket: \"OpenSquareBracket\",\n  // [\n  CloseSquareBracket: \"CloseSquareBracket\",\n  // ]\n  OpenCurlyBracket: \"OpenCurlyBracket\",\n  // {\n  CloseCurlyBracket: \"CloseCurlyBracket\",\n  // }\n  Comma: \"Comma\",\n  // ,\n  Dot: \"Dot\",\n  // .\n  Colon: \"Colon\",\n  // :\n  Pipe: \"Pipe\",\n  // |\n  CallOperator: \"CallOperator\",\n  // ()\n  AdditiveBinaryOperator: \"AdditiveBinaryOperator\",\n  // + - ~\n  MultiplicativeBinaryOperator: \"MultiplicativeBinaryOperator\",\n  // * / %\n  ComparisonBinaryOperator: \"ComparisonBinaryOperator\",\n  // < > <= >= == !=\n  UnaryOperator: \"UnaryOperator\",\n  // ! - +\n  Comment: \"Comment\"\n  // {# ... #}\n});\nvar Token = class {\n  /**\n   * Constructs a new Token.\n   * @param {string} value The raw value as seen inside the source code.\n   * @param {TokenType} type The type of token.\n   */\n  constructor(value, type) {\n    this.value = value;\n    this.type = type;\n  }\n};\nfunction isWord(char) {\n  return /\\w/.test(char);\n}\nfunction isInteger(char) {\n  return /[0-9]/.test(char);\n}\nfunction isWhitespace(char) {\n  return /\\s/.test(char);\n}\nvar ORDERED_MAPPING_TABLE = [\n  // Control sequences\n  [\"{%\", TOKEN_TYPES.OpenStatement],\n  [\"%}\", TOKEN_TYPES.CloseStatement],\n  [\"{{\", TOKEN_TYPES.OpenExpression],\n  [\"}}\", TOKEN_TYPES.CloseExpression],\n  // Single character tokens\n  [\"(\", TOKEN_TYPES.OpenParen],\n  [\")\", TOKEN_TYPES.CloseParen],\n  [\"{\", TOKEN_TYPES.OpenCurlyBracket],\n  [\"}\", TOKEN_TYPES.CloseCurlyBracket],\n  [\"[\", TOKEN_TYPES.OpenSquareBracket],\n  [\"]\", TOKEN_TYPES.CloseSquareBracket],\n  [\",\", TOKEN_TYPES.Comma],\n  [\".\", TOKEN_TYPES.Dot],\n  [\":\", TOKEN_TYPES.Colon],\n  [\"|\", TOKEN_TYPES.Pipe],\n  // Comparison operators\n  [\"<=\", TOKEN_TYPES.ComparisonBinaryOperator],\n  [\">=\", TOKEN_TYPES.ComparisonBinaryOperator],\n  [\"==\", TOKEN_TYPES.ComparisonBinaryOperator],\n  [\"!=\", TOKEN_TYPES.ComparisonBinaryOperator],\n  [\"<\", TOKEN_TYPES.ComparisonBinaryOperator],\n  [\">\", TOKEN_TYPES.ComparisonBinaryOperator],\n  // Arithmetic operators\n  [\"+\", TOKEN_TYPES.AdditiveBinaryOperator],\n  [\"-\", TOKEN_TYPES.AdditiveBinaryOperator],\n  [\"~\", TOKEN_TYPES.AdditiveBinaryOperator],\n  [\"*\", TOKEN_TYPES.MultiplicativeBinaryOperator],\n  [\"/\", TOKEN_TYPES.MultiplicativeBinaryOperator],\n  [\"%\", TOKEN_TYPES.MultiplicativeBinaryOperator],\n  // Assignment operator\n  [\"=\", TOKEN_TYPES.Equals]\n];\nvar ESCAPE_CHARACTERS = /* @__PURE__ */ new Map([\n  [\"n\", \"\\n\"],\n  // New line\n  [\"t\", \"\t\"],\n  // Horizontal tab\n  [\"r\", \"\\r\"],\n  // Carriage return\n  [\"b\", \"\\b\"],\n  // Backspace\n  [\"f\", \"\\f\"],\n  // Form feed\n  [\"v\", \"\\v\"],\n  // Vertical tab\n  [\"'\", \"'\"],\n  // Single quote\n  ['\"', '\"'],\n  // Double quote\n  [\"\\\\\", \"\\\\\"]\n  // Backslash\n]);\nfunction preprocess(template, options = {}) {\n  if (template.endsWith(\"\\n\")) {\n    template = template.slice(0, -1);\n  }\n  if (options.lstrip_blocks) {\n    template = template.replace(/^[ \\t]*({[#%-])/gm, \"$1\");\n  }\n  if (options.trim_blocks) {\n    template = template.replace(/([#%-]})\\n/g, \"$1\");\n  }\n  return template.replace(/{%\\s*(end)?generation\\s*%}/gs, \"\");\n}\nfunction tokenize(source, options = {}) {\n  const tokens = [];\n  const src = preprocess(source, options);\n  let cursorPosition = 0;\n  let curlyBracketDepth = 0;\n  const consumeWhile = (predicate) => {\n    let str = \"\";\n    while (predicate(src[cursorPosition])) {\n      if (src[cursorPosition] === \"\\\\\") {\n        ++cursorPosition;\n        if (cursorPosition >= src.length)\n          throw new SyntaxError(\"Unexpected end of input\");\n        const escaped = src[cursorPosition++];\n        const unescaped = ESCAPE_CHARACTERS.get(escaped);\n        if (unescaped === void 0) {\n          throw new SyntaxError(`Unexpected escaped character: ${escaped}`);\n        }\n        str += unescaped;\n        continue;\n      }\n      str += src[cursorPosition++];\n      if (cursorPosition >= src.length)\n        throw new SyntaxError(\"Unexpected end of input\");\n    }\n    return str;\n  };\n  const stripTrailingWhitespace = () => {\n    const lastToken = tokens.at(-1);\n    if (lastToken && lastToken.type === TOKEN_TYPES.Text) {\n      lastToken.value = lastToken.value.trimEnd();\n      if (lastToken.value === \"\") {\n        tokens.pop();\n      }\n    }\n  };\n  const skipLeadingWhitespace = () => {\n    while (cursorPosition < src.length && isWhitespace(src[cursorPosition])) {\n      ++cursorPosition;\n    }\n  };\n  main:\n    while (cursorPosition < src.length) {\n      const lastTokenType = tokens.at(-1)?.type;\n      if (lastTokenType === void 0 || lastTokenType === TOKEN_TYPES.CloseStatement || lastTokenType === TOKEN_TYPES.CloseExpression || lastTokenType === TOKEN_TYPES.Comment) {\n        let text = \"\";\n        while (cursorPosition < src.length && // Keep going until we hit the next Jinja statement or expression\n        !(src[cursorPosition] === \"{\" && (src[cursorPosition + 1] === \"%\" || src[cursorPosition + 1] === \"{\" || src[cursorPosition + 1] === \"#\"))) {\n          text += src[cursorPosition++];\n        }\n        if (text.length > 0) {\n          tokens.push(new Token(text, TOKEN_TYPES.Text));\n          continue;\n        }\n      }\n      if (src[cursorPosition] === \"{\" && src[cursorPosition + 1] === \"#\") {\n        cursorPosition += 2;\n        const stripBefore = src[cursorPosition] === \"-\";\n        if (stripBefore) {\n          ++cursorPosition;\n        }\n        let comment = \"\";\n        while (src[cursorPosition] !== \"#\" || src[cursorPosition + 1] !== \"}\") {\n          if (cursorPosition + 2 >= src.length) {\n            throw new SyntaxError(\"Missing end of comment tag\");\n          }\n          comment += src[cursorPosition++];\n        }\n        const stripAfter = comment.endsWith(\"-\");\n        if (stripAfter) {\n          comment = comment.slice(0, -1);\n        }\n        if (stripBefore) {\n          stripTrailingWhitespace();\n        }\n        tokens.push(new Token(comment, TOKEN_TYPES.Comment));\n        cursorPosition += 2;\n        if (stripAfter) {\n          skipLeadingWhitespace();\n        }\n        continue;\n      }\n      if (src.slice(cursorPosition, cursorPosition + 3) === \"{%-\") {\n        stripTrailingWhitespace();\n        tokens.push(new Token(\"{%\", TOKEN_TYPES.OpenStatement));\n        cursorPosition += 3;\n        continue;\n      }\n      if (src.slice(cursorPosition, cursorPosition + 3) === \"{{-\") {\n        stripTrailingWhitespace();\n        tokens.push(new Token(\"{{\", TOKEN_TYPES.OpenExpression));\n        curlyBracketDepth = 0;\n        cursorPosition += 3;\n        continue;\n      }\n      consumeWhile(isWhitespace);\n      if (src.slice(cursorPosition, cursorPosition + 3) === \"-%}\") {\n        tokens.push(new Token(\"%}\", TOKEN_TYPES.CloseStatement));\n        cursorPosition += 3;\n        skipLeadingWhitespace();\n        continue;\n      }\n      if (src.slice(cursorPosition, cursorPosition + 3) === \"-}}\") {\n        tokens.push(new Token(\"}}\", TOKEN_TYPES.CloseExpression));\n        cursorPosition += 3;\n        skipLeadingWhitespace();\n        continue;\n      }\n      const char = src[cursorPosition];\n      if (char === \"-\" || char === \"+\") {\n        const lastTokenType2 = tokens.at(-1)?.type;\n        if (lastTokenType2 === TOKEN_TYPES.Text || lastTokenType2 === void 0) {\n          throw new SyntaxError(`Unexpected character: ${char}`);\n        }\n        switch (lastTokenType2) {\n          case TOKEN_TYPES.Identifier:\n          case TOKEN_TYPES.NumericLiteral:\n          case TOKEN_TYPES.StringLiteral:\n          case TOKEN_TYPES.CloseParen:\n          case TOKEN_TYPES.CloseSquareBracket:\n            break;\n          default: {\n            ++cursorPosition;\n            const num = consumeWhile(isInteger);\n            tokens.push(\n              new Token(`${char}${num}`, num.length > 0 ? TOKEN_TYPES.NumericLiteral : TOKEN_TYPES.UnaryOperator)\n            );\n            continue;\n          }\n        }\n      }\n      for (const [seq, type] of ORDERED_MAPPING_TABLE) {\n        if (seq === \"}}\" && curlyBracketDepth > 0) {\n          continue;\n        }\n        const slice2 = src.slice(cursorPosition, cursorPosition + seq.length);\n        if (slice2 === seq) {\n          tokens.push(new Token(seq, type));\n          if (type === TOKEN_TYPES.OpenExpression) {\n            curlyBracketDepth = 0;\n          } else if (type === TOKEN_TYPES.OpenCurlyBracket) {\n            ++curlyBracketDepth;\n          } else if (type === TOKEN_TYPES.CloseCurlyBracket) {\n            --curlyBracketDepth;\n          }\n          cursorPosition += seq.length;\n          continue main;\n        }\n      }\n      if (char === \"'\" || char === '\"') {\n        ++cursorPosition;\n        const str = consumeWhile((c) => c !== char);\n        tokens.push(new Token(str, TOKEN_TYPES.StringLiteral));\n        ++cursorPosition;\n        continue;\n      }\n      if (isInteger(char)) {\n        let num = consumeWhile(isInteger);\n        if (src[cursorPosition] === \".\" && isInteger(src[cursorPosition + 1])) {\n          ++cursorPosition;\n          const frac = consumeWhile(isInteger);\n          num = `${num}.${frac}`;\n        }\n        tokens.push(new Token(num, TOKEN_TYPES.NumericLiteral));\n        continue;\n      }\n      if (isWord(char)) {\n        const word = consumeWhile(isWord);\n        tokens.push(new Token(word, TOKEN_TYPES.Identifier));\n        continue;\n      }\n      throw new SyntaxError(`Unexpected character: ${char}`);\n    }\n  return tokens;\n}\n\n// src/ast.ts\nvar Statement = class {\n  type = \"Statement\";\n};\nvar Program = class extends Statement {\n  constructor(body) {\n    super();\n    this.body = body;\n  }\n  type = \"Program\";\n};\nvar If = class extends Statement {\n  constructor(test, body, alternate) {\n    super();\n    this.test = test;\n    this.body = body;\n    this.alternate = alternate;\n  }\n  type = \"If\";\n};\nvar For = class extends Statement {\n  constructor(loopvar, iterable, body, defaultBlock) {\n    super();\n    this.loopvar = loopvar;\n    this.iterable = iterable;\n    this.body = body;\n    this.defaultBlock = defaultBlock;\n  }\n  type = \"For\";\n};\nvar Break = class extends Statement {\n  type = \"Break\";\n};\nvar Continue = class extends Statement {\n  type = \"Continue\";\n};\nvar SetStatement = class extends Statement {\n  constructor(assignee, value, body) {\n    super();\n    this.assignee = assignee;\n    this.value = value;\n    this.body = body;\n  }\n  type = \"Set\";\n};\nvar Macro = class extends Statement {\n  constructor(name, args, body) {\n    super();\n    this.name = name;\n    this.args = args;\n    this.body = body;\n  }\n  type = \"Macro\";\n};\nvar Comment = class extends Statement {\n  constructor(value) {\n    super();\n    this.value = value;\n  }\n  type = \"Comment\";\n};\nvar Expression = class extends Statement {\n  type = \"Expression\";\n};\nvar MemberExpression = class extends Expression {\n  constructor(object, property, computed) {\n    super();\n    this.object = object;\n    this.property = property;\n    this.computed = computed;\n  }\n  type = \"MemberExpression\";\n};\nvar CallExpression = class extends Expression {\n  constructor(callee, args) {\n    super();\n    this.callee = callee;\n    this.args = args;\n  }\n  type = \"CallExpression\";\n};\nvar Identifier = class extends Expression {\n  /**\n   * @param {string} value The name of the identifier\n   */\n  constructor(value) {\n    super();\n    this.value = value;\n  }\n  type = \"Identifier\";\n};\nvar Literal = class extends Expression {\n  constructor(value) {\n    super();\n    this.value = value;\n  }\n  type = \"Literal\";\n};\nvar IntegerLiteral = class extends Literal {\n  type = \"IntegerLiteral\";\n};\nvar FloatLiteral = class extends Literal {\n  type = \"FloatLiteral\";\n};\nvar StringLiteral = class extends Literal {\n  type = \"StringLiteral\";\n};\nvar ArrayLiteral = class extends Literal {\n  type = \"ArrayLiteral\";\n};\nvar TupleLiteral = class extends Literal {\n  type = \"TupleLiteral\";\n};\nvar ObjectLiteral = class extends Literal {\n  type = \"ObjectLiteral\";\n};\nvar BinaryExpression = class extends Expression {\n  constructor(operator, left, right) {\n    super();\n    this.operator = operator;\n    this.left = left;\n    this.right = right;\n  }\n  type = \"BinaryExpression\";\n};\nvar FilterExpression = class extends Expression {\n  constructor(operand, filter) {\n    super();\n    this.operand = operand;\n    this.filter = filter;\n  }\n  type = \"FilterExpression\";\n};\nvar FilterStatement = class extends Statement {\n  constructor(filter, body) {\n    super();\n    this.filter = filter;\n    this.body = body;\n  }\n  type = \"FilterStatement\";\n};\nvar SelectExpression = class extends Expression {\n  constructor(lhs, test) {\n    super();\n    this.lhs = lhs;\n    this.test = test;\n  }\n  type = \"SelectExpression\";\n};\nvar TestExpression = class extends Expression {\n  constructor(operand, negate, test) {\n    super();\n    this.operand = operand;\n    this.negate = negate;\n    this.test = test;\n  }\n  type = \"TestExpression\";\n};\nvar UnaryExpression = class extends Expression {\n  constructor(operator, argument) {\n    super();\n    this.operator = operator;\n    this.argument = argument;\n  }\n  type = \"UnaryExpression\";\n};\nvar SliceExpression = class extends Expression {\n  constructor(start = void 0, stop = void 0, step = void 0) {\n    super();\n    this.start = start;\n    this.stop = stop;\n    this.step = step;\n  }\n  type = \"SliceExpression\";\n};\nvar KeywordArgumentExpression = class extends Expression {\n  constructor(key, value) {\n    super();\n    this.key = key;\n    this.value = value;\n  }\n  type = \"KeywordArgumentExpression\";\n};\nvar SpreadExpression = class extends Expression {\n  constructor(argument) {\n    super();\n    this.argument = argument;\n  }\n  type = \"SpreadExpression\";\n};\nvar CallStatement = class extends Statement {\n  constructor(call, callerArgs, body) {\n    super();\n    this.call = call;\n    this.callerArgs = callerArgs;\n    this.body = body;\n  }\n  type = \"CallStatement\";\n};\nvar Ternary = class extends Expression {\n  constructor(condition, trueExpr, falseExpr) {\n    super();\n    this.condition = condition;\n    this.trueExpr = trueExpr;\n    this.falseExpr = falseExpr;\n  }\n  type = \"Ternary\";\n};\n\n// src/parser.ts\nfunction parse(tokens) {\n  const program = new Program([]);\n  let current = 0;\n  function expect(type, error) {\n    const prev = tokens[current++];\n    if (!prev || prev.type !== type) {\n      throw new Error(`Parser Error: ${error}. ${prev.type} !== ${type}.`);\n    }\n    return prev;\n  }\n  function expectIdentifier(name) {\n    if (!isIdentifier(name)) {\n      throw new SyntaxError(`Expected ${name}`);\n    }\n    ++current;\n  }\n  function parseAny() {\n    switch (tokens[current].type) {\n      case TOKEN_TYPES.Comment:\n        return new Comment(tokens[current++].value);\n      case TOKEN_TYPES.Text:\n        return parseText();\n      case TOKEN_TYPES.OpenStatement:\n        return parseJinjaStatement();\n      case TOKEN_TYPES.OpenExpression:\n        return parseJinjaExpression();\n      default:\n        throw new SyntaxError(`Unexpected token type: ${tokens[current].type}`);\n    }\n  }\n  function is(...types) {\n    return current + types.length <= tokens.length && types.every((type, i) => type === tokens[current + i].type);\n  }\n  function isStatement(...names) {\n    return tokens[current]?.type === TOKEN_TYPES.OpenStatement && tokens[current + 1]?.type === TOKEN_TYPES.Identifier && names.includes(tokens[current + 1]?.value);\n  }\n  function isIdentifier(...names) {\n    return current + names.length <= tokens.length && names.every((name, i) => tokens[current + i].type === \"Identifier\" && name === tokens[current + i].value);\n  }\n  function parseText() {\n    return new StringLiteral(expect(TOKEN_TYPES.Text, \"Expected text token\").value);\n  }\n  function parseJinjaStatement() {\n    expect(TOKEN_TYPES.OpenStatement, \"Expected opening statement token\");\n    if (tokens[current].type !== TOKEN_TYPES.Identifier) {\n      throw new SyntaxError(`Unknown statement, got ${tokens[current].type}`);\n    }\n    const name = tokens[current].value;\n    let result;\n    switch (name) {\n      case \"set\":\n        ++current;\n        result = parseSetStatement();\n        break;\n      case \"if\":\n        ++current;\n        result = parseIfStatement();\n        expect(TOKEN_TYPES.OpenStatement, \"Expected {% token\");\n        expectIdentifier(\"endif\");\n        expect(TOKEN_TYPES.CloseStatement, \"Expected %} token\");\n        break;\n      case \"macro\":\n        ++current;\n        result = parseMacroStatement();\n        expect(TOKEN_TYPES.OpenStatement, \"Expected {% token\");\n        expectIdentifier(\"endmacro\");\n        expect(TOKEN_TYPES.CloseStatement, \"Expected %} token\");\n        break;\n      case \"for\":\n        ++current;\n        result = parseForStatement();\n        expect(TOKEN_TYPES.OpenStatement, \"Expected {% token\");\n        expectIdentifier(\"endfor\");\n        expect(TOKEN_TYPES.CloseStatement, \"Expected %} token\");\n        break;\n      case \"call\": {\n        ++current;\n        let callerArgs = null;\n        if (is(TOKEN_TYPES.OpenParen)) {\n          callerArgs = parseArgs();\n        }\n        const callee = parsePrimaryExpression();\n        if (callee.type !== \"Identifier\") {\n          throw new SyntaxError(`Expected identifier following call statement`);\n        }\n        const callArgs = parseArgs();\n        expect(TOKEN_TYPES.CloseStatement, \"Expected closing statement token\");\n        const body = [];\n        while (!isStatement(\"endcall\")) {\n          body.push(parseAny());\n        }\n        expect(TOKEN_TYPES.OpenStatement, \"Expected '{%'\");\n        expectIdentifier(\"endcall\");\n        expect(TOKEN_TYPES.CloseStatement, \"Expected closing statement token\");\n        const callExpr = new CallExpression(callee, callArgs);\n        result = new CallStatement(callExpr, callerArgs, body);\n        break;\n      }\n      case \"break\":\n        ++current;\n        expect(TOKEN_TYPES.CloseStatement, \"Expected closing statement token\");\n        result = new Break();\n        break;\n      case \"continue\":\n        ++current;\n        expect(TOKEN_TYPES.CloseStatement, \"Expected closing statement token\");\n        result = new Continue();\n        break;\n      case \"filter\": {\n        ++current;\n        let filterNode = parsePrimaryExpression();\n        if (filterNode instanceof Identifier && is(TOKEN_TYPES.OpenParen)) {\n          filterNode = parseCallExpression(filterNode);\n        }\n        expect(TOKEN_TYPES.CloseStatement, \"Expected closing statement token\");\n        const filterBody = [];\n        while (!isStatement(\"endfilter\")) {\n          filterBody.push(parseAny());\n        }\n        expect(TOKEN_TYPES.OpenStatement, \"Expected '{%'\");\n        expectIdentifier(\"endfilter\");\n        expect(TOKEN_TYPES.CloseStatement, \"Expected '%}'\");\n        result = new FilterStatement(filterNode, filterBody);\n        break;\n      }\n      default:\n        throw new SyntaxError(`Unknown statement type: ${name}`);\n    }\n    return result;\n  }\n  function parseJinjaExpression() {\n    expect(TOKEN_TYPES.OpenExpression, \"Expected opening expression token\");\n    const result = parseExpression();\n    expect(TOKEN_TYPES.CloseExpression, \"Expected closing expression token\");\n    return result;\n  }\n  function parseSetStatement() {\n    const left = parseExpressionSequence();\n    let value = null;\n    const body = [];\n    if (is(TOKEN_TYPES.Equals)) {\n      ++current;\n      value = parseExpressionSequence();\n    } else {\n      expect(TOKEN_TYPES.CloseStatement, \"Expected %} token\");\n      while (!isStatement(\"endset\")) {\n        body.push(parseAny());\n      }\n      expect(TOKEN_TYPES.OpenStatement, \"Expected {% token\");\n      expectIdentifier(\"endset\");\n    }\n    expect(TOKEN_TYPES.CloseStatement, \"Expected closing statement token\");\n    return new SetStatement(left, value, body);\n  }\n  function parseIfStatement() {\n    const test = parseExpression();\n    expect(TOKEN_TYPES.CloseStatement, \"Expected closing statement token\");\n    const body = [];\n    const alternate = [];\n    while (!isStatement(\"elif\", \"else\", \"endif\")) {\n      body.push(parseAny());\n    }\n    if (isStatement(\"elif\")) {\n      ++current;\n      ++current;\n      const result = parseIfStatement();\n      alternate.push(result);\n    } else if (isStatement(\"else\")) {\n      ++current;\n      ++current;\n      expect(TOKEN_TYPES.CloseStatement, \"Expected closing statement token\");\n      while (!isStatement(\"endif\")) {\n        alternate.push(parseAny());\n      }\n    }\n    return new If(test, body, alternate);\n  }\n  function parseMacroStatement() {\n    const name = parsePrimaryExpression();\n    if (name.type !== \"Identifier\") {\n      throw new SyntaxError(`Expected identifier following macro statement`);\n    }\n    const args = parseArgs();\n    expect(TOKEN_TYPES.CloseStatement, \"Expected closing statement token\");\n    const body = [];\n    while (!isStatement(\"endmacro\")) {\n      body.push(parseAny());\n    }\n    return new Macro(name, args, body);\n  }\n  function parseExpressionSequence(primary = false) {\n    const fn = primary ? parsePrimaryExpression : parseExpression;\n    const expressions = [fn()];\n    const isTuple = is(TOKEN_TYPES.Comma);\n    while (isTuple) {\n      ++current;\n      expressions.push(fn());\n      if (!is(TOKEN_TYPES.Comma)) {\n        break;\n      }\n    }\n    return isTuple ? new TupleLiteral(expressions) : expressions[0];\n  }\n  function parseForStatement() {\n    const loopVariable = parseExpressionSequence(true);\n    if (!(loopVariable instanceof Identifier || loopVariable instanceof TupleLiteral)) {\n      throw new SyntaxError(`Expected identifier/tuple for the loop variable, got ${loopVariable.type} instead`);\n    }\n    if (!isIdentifier(\"in\")) {\n      throw new SyntaxError(\"Expected `in` keyword following loop variable\");\n    }\n    ++current;\n    const iterable = parseExpression();\n    expect(TOKEN_TYPES.CloseStatement, \"Expected closing statement token\");\n    const body = [];\n    while (!isStatement(\"endfor\", \"else\")) {\n      body.push(parseAny());\n    }\n    const alternative = [];\n    if (isStatement(\"else\")) {\n      ++current;\n      ++current;\n      expect(TOKEN_TYPES.CloseStatement, \"Expected closing statement token\");\n      while (!isStatement(\"endfor\")) {\n        alternative.push(parseAny());\n      }\n    }\n    return new For(loopVariable, iterable, body, alternative);\n  }\n  function parseExpression() {\n    return parseIfExpression();\n  }\n  function parseIfExpression() {\n    const a = parseLogicalOrExpression();\n    if (isIdentifier(\"if\")) {\n      ++current;\n      const test = parseLogicalOrExpression();\n      if (isIdentifier(\"else\")) {\n        ++current;\n        const falseExpr = parseIfExpression();\n        return new Ternary(test, a, falseExpr);\n      } else {\n        return new SelectExpression(a, test);\n      }\n    }\n    return a;\n  }\n  function parseLogicalOrExpression() {\n    let left = parseLogicalAndExpression();\n    while (isIdentifier(\"or\")) {\n      const operator = tokens[current];\n      ++current;\n      const right = parseLogicalAndExpression();\n      left = new BinaryExpression(operator, left, right);\n    }\n    return left;\n  }\n  function parseLogicalAndExpression() {\n    let left = parseLogicalNegationExpression();\n    while (isIdentifier(\"and\")) {\n      const operator = tokens[current];\n      ++current;\n      const right = parseLogicalNegationExpression();\n      left = new BinaryExpression(operator, left, right);\n    }\n    return left;\n  }\n  function parseLogicalNegationExpression() {\n    let right;\n    while (isIdentifier(\"not\")) {\n      const operator = tokens[current];\n      ++current;\n      const arg = parseLogicalNegationExpression();\n      right = new UnaryExpression(operator, arg);\n    }\n    return right ?? parseComparisonExpression();\n  }\n  function parseComparisonExpression() {\n    let left = parseAdditiveExpression();\n    while (true) {\n      let operator;\n      if (isIdentifier(\"not\", \"in\")) {\n        operator = new Token(\"not in\", TOKEN_TYPES.Identifier);\n        current += 2;\n      } else if (isIdentifier(\"in\")) {\n        operator = tokens[current++];\n      } else if (is(TOKEN_TYPES.ComparisonBinaryOperator)) {\n        operator = tokens[current++];\n      } else {\n        break;\n      }\n      const right = parseAdditiveExpression();\n      left = new BinaryExpression(operator, left, right);\n    }\n    return left;\n  }\n  function parseAdditiveExpression() {\n    let left = parseMultiplicativeExpression();\n    while (is(TOKEN_TYPES.AdditiveBinaryOperator)) {\n      const operator = tokens[current];\n      ++current;\n      const right = parseMultiplicativeExpression();\n      left = new BinaryExpression(operator, left, right);\n    }\n    return left;\n  }\n  function parseCallMemberExpression() {\n    const member = parseMemberExpression(parsePrimaryExpression());\n    if (is(TOKEN_TYPES.OpenParen)) {\n      return parseCallExpression(member);\n    }\n    return member;\n  }\n  function parseCallExpression(callee) {\n    let expression = new CallExpression(callee, parseArgs());\n    expression = parseMemberExpression(expression);\n    if (is(TOKEN_TYPES.OpenParen)) {\n      expression = parseCallExpression(expression);\n    }\n    return expression;\n  }\n  function parseArgs() {\n    expect(TOKEN_TYPES.OpenParen, \"Expected opening parenthesis for arguments list\");\n    const args = parseArgumentsList();\n    expect(TOKEN_TYPES.CloseParen, \"Expected closing parenthesis for arguments list\");\n    return args;\n  }\n  function parseArgumentsList() {\n    const args = [];\n    while (!is(TOKEN_TYPES.CloseParen)) {\n      let argument;\n      if (tokens[current].type === TOKEN_TYPES.MultiplicativeBinaryOperator && tokens[current].value === \"*\") {\n        ++current;\n        const expr = parseExpression();\n        argument = new SpreadExpression(expr);\n      } else {\n        argument = parseExpression();\n        if (is(TOKEN_TYPES.Equals)) {\n          ++current;\n          if (!(argument instanceof Identifier)) {\n            throw new SyntaxError(`Expected identifier for keyword argument`);\n          }\n          const value = parseExpression();\n          argument = new KeywordArgumentExpression(argument, value);\n        }\n      }\n      args.push(argument);\n      if (is(TOKEN_TYPES.Comma)) {\n        ++current;\n      }\n    }\n    return args;\n  }\n  function parseMemberExpressionArgumentsList() {\n    const slices = [];\n    let isSlice = false;\n    while (!is(TOKEN_TYPES.CloseSquareBracket)) {\n      if (is(TOKEN_TYPES.Colon)) {\n        slices.push(void 0);\n        ++current;\n        isSlice = true;\n      } else {\n        slices.push(parseExpression());\n        if (is(TOKEN_TYPES.Colon)) {\n          ++current;\n          isSlice = true;\n        }\n      }\n    }\n    if (slices.length === 0) {\n      throw new SyntaxError(`Expected at least one argument for member/slice expression`);\n    }\n    if (isSlice) {\n      if (slices.length > 3) {\n        throw new SyntaxError(`Expected 0-3 arguments for slice expression`);\n      }\n      return new SliceExpression(...slices);\n    }\n    return slices[0];\n  }\n  function parseMemberExpression(object) {\n    while (is(TOKEN_TYPES.Dot) || is(TOKEN_TYPES.OpenSquareBracket)) {\n      const operator = tokens[current];\n      ++current;\n      let property;\n      const computed = operator.type === TOKEN_TYPES.OpenSquareBracket;\n      if (computed) {\n        property = parseMemberExpressionArgumentsList();\n        expect(TOKEN_TYPES.CloseSquareBracket, \"Expected closing square bracket\");\n      } else {\n        property = parsePrimaryExpression();\n        if (property.type !== \"Identifier\") {\n          throw new SyntaxError(`Expected identifier following dot operator`);\n        }\n      }\n      object = new MemberExpression(object, property, computed);\n    }\n    return object;\n  }\n  function parseMultiplicativeExpression() {\n    let left = parseTestExpression();\n    while (is(TOKEN_TYPES.MultiplicativeBinaryOperator)) {\n      const operator = tokens[current++];\n      const right = parseTestExpression();\n      left = new BinaryExpression(operator, left, right);\n    }\n    return left;\n  }\n  function parseTestExpression() {\n    let operand = parseFilterExpression();\n    while (isIdentifier(\"is\")) {\n      ++current;\n      const negate = isIdentifier(\"not\");\n      if (negate) {\n        ++current;\n      }\n      const filter = parsePrimaryExpression();\n      if (!(filter instanceof Identifier)) {\n        throw new SyntaxError(`Expected identifier for the test`);\n      }\n      operand = new TestExpression(operand, negate, filter);\n    }\n    return operand;\n  }\n  function parseFilterExpression() {\n    let operand = parseCallMemberExpression();\n    while (is(TOKEN_TYPES.Pipe)) {\n      ++current;\n      let filter = parsePrimaryExpression();\n      if (!(filter instanceof Identifier)) {\n        throw new SyntaxError(`Expected identifier for the filter`);\n      }\n      if (is(TOKEN_TYPES.OpenParen)) {\n        filter = parseCallExpression(filter);\n      }\n      operand = new FilterExpression(operand, filter);\n    }\n    return operand;\n  }\n  function parsePrimaryExpression() {\n    const token = tokens[current++];\n    switch (token.type) {\n      case TOKEN_TYPES.NumericLiteral: {\n        const num = token.value;\n        return num.includes(\".\") ? new FloatLiteral(Number(num)) : new IntegerLiteral(Number(num));\n      }\n      case TOKEN_TYPES.StringLiteral: {\n        let value = token.value;\n        while (is(TOKEN_TYPES.StringLiteral)) {\n          value += tokens[current++].value;\n        }\n        return new StringLiteral(value);\n      }\n      case TOKEN_TYPES.Identifier:\n        return new Identifier(token.value);\n      case TOKEN_TYPES.OpenParen: {\n        const expression = parseExpressionSequence();\n        expect(TOKEN_TYPES.CloseParen, \"Expected closing parenthesis, got ${tokens[current].type} instead.\");\n        return expression;\n      }\n      case TOKEN_TYPES.OpenSquareBracket: {\n        const values = [];\n        while (!is(TOKEN_TYPES.CloseSquareBracket)) {\n          values.push(parseExpression());\n          if (is(TOKEN_TYPES.Comma)) {\n            ++current;\n          }\n        }\n        ++current;\n        return new ArrayLiteral(values);\n      }\n      case TOKEN_TYPES.OpenCurlyBracket: {\n        const values = /* @__PURE__ */ new Map();\n        while (!is(TOKEN_TYPES.CloseCurlyBracket)) {\n          const key = parseExpression();\n          expect(TOKEN_TYPES.Colon, \"Expected colon between key and value in object literal\");\n          const value = parseExpression();\n          values.set(key, value);\n          if (is(TOKEN_TYPES.Comma)) {\n            ++current;\n          }\n        }\n        ++current;\n        return new ObjectLiteral(values);\n      }\n      default:\n        throw new SyntaxError(`Unexpected token: ${token.type}`);\n    }\n  }\n  while (current < tokens.length) {\n    program.body.push(parseAny());\n  }\n  return program;\n}\n\n// src/utils.ts\nfunction range(start, stop, step = 1) {\n  if (stop === void 0) {\n    stop = start;\n    start = 0;\n  }\n  if (step === 0) {\n    throw new Error(\"range() step must not be zero\");\n  }\n  const result = [];\n  if (step > 0) {\n    for (let i = start; i < stop; i += step) {\n      result.push(i);\n    }\n  } else {\n    for (let i = start; i > stop; i += step) {\n      result.push(i);\n    }\n  }\n  return result;\n}\nfunction slice(array, start, stop, step = 1) {\n  const direction = Math.sign(step);\n  if (direction >= 0) {\n    start = (start ??= 0) < 0 ? Math.max(array.length + start, 0) : Math.min(start, array.length);\n    stop = (stop ??= array.length) < 0 ? Math.max(array.length + stop, 0) : Math.min(stop, array.length);\n  } else {\n    start = (start ??= array.length - 1) < 0 ? Math.max(array.length + start, -1) : Math.min(start, array.length - 1);\n    stop = (stop ??= -1) < -1 ? Math.max(array.length + stop, -1) : Math.min(stop, array.length - 1);\n  }\n  const result = [];\n  for (let i = start; direction * i < direction * stop; i += step) {\n    result.push(array[i]);\n  }\n  return result;\n}\nfunction titleCase(value) {\n  return value.replace(/\\b\\w/g, (c) => c.toUpperCase());\n}\nfunction strftime_now(format2) {\n  return strftime(/* @__PURE__ */ new Date(), format2);\n}\nfunction strftime(date, format2) {\n  const monthFormatterLong = new Intl.DateTimeFormat(void 0, { month: \"long\" });\n  const monthFormatterShort = new Intl.DateTimeFormat(void 0, { month: \"short\" });\n  const pad2 = (n) => n < 10 ? \"0\" + n : n.toString();\n  return format2.replace(/%[YmdbBHM%]/g, (token) => {\n    switch (token) {\n      case \"%Y\":\n        return date.getFullYear().toString();\n      case \"%m\":\n        return pad2(date.getMonth() + 1);\n      case \"%d\":\n        return pad2(date.getDate());\n      case \"%b\":\n        return monthFormatterShort.format(date);\n      case \"%B\":\n        return monthFormatterLong.format(date);\n      case \"%H\":\n        return pad2(date.getHours());\n      case \"%M\":\n        return pad2(date.getMinutes());\n      case \"%%\":\n        return \"%\";\n      default:\n        return token;\n    }\n  });\n}\nfunction escapeRegExp(s) {\n  return s.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\");\n}\nfunction replace(str, oldvalue, newvalue, count) {\n  if (count === 0)\n    return str;\n  let remaining = count == null || count < 0 ? Infinity : count;\n  const pattern = oldvalue.length === 0 ? new RegExp(\"(?=)\", \"gu\") : new RegExp(escapeRegExp(oldvalue), \"gu\");\n  return str.replaceAll(pattern, (match) => {\n    if (remaining > 0) {\n      --remaining;\n      return newvalue;\n    }\n    return match;\n  });\n}\n\n// src/runtime.ts\nvar BreakControl = class extends Error {\n};\nvar ContinueControl = class extends Error {\n};\nvar RuntimeValue = class {\n  type = \"RuntimeValue\";\n  value;\n  /**\n   * A collection of built-in functions for this type.\n   */\n  builtins = /* @__PURE__ */ new Map();\n  /**\n   * Creates a new RuntimeValue.\n   */\n  constructor(value = void 0) {\n    this.value = value;\n  }\n  /**\n   * Determines truthiness or falsiness of the runtime value.\n   * This function should be overridden by subclasses if it has custom truthiness criteria.\n   * @returns {BooleanValue} BooleanValue(true) if the value is truthy, BooleanValue(false) otherwise.\n   */\n  __bool__() {\n    return new BooleanValue(!!this.value);\n  }\n  toString() {\n    return String(this.value);\n  }\n};\nvar IntegerValue = class extends RuntimeValue {\n  type = \"IntegerValue\";\n};\nvar FloatValue = class extends RuntimeValue {\n  type = \"FloatValue\";\n  toString() {\n    return this.value % 1 === 0 ? this.value.toFixed(1) : this.value.toString();\n  }\n};\nvar StringValue = class extends RuntimeValue {\n  type = \"StringValue\";\n  builtins = /* @__PURE__ */ new Map([\n    [\n      \"upper\",\n      new FunctionValue(() => {\n        return new StringValue(this.value.toUpperCase());\n      })\n    ],\n    [\n      \"lower\",\n      new FunctionValue(() => {\n        return new StringValue(this.value.toLowerCase());\n      })\n    ],\n    [\n      \"strip\",\n      new FunctionValue(() => {\n        return new StringValue(this.value.trim());\n      })\n    ],\n    [\n      \"title\",\n      new FunctionValue(() => {\n        return new StringValue(titleCase(this.value));\n      })\n    ],\n    [\n      \"capitalize\",\n      new FunctionValue(() => {\n        return new StringValue(this.value.charAt(0).toUpperCase() + this.value.slice(1));\n      })\n    ],\n    [\"length\", new IntegerValue(this.value.length)],\n    [\n      \"rstrip\",\n      new FunctionValue(() => {\n        return new StringValue(this.value.trimEnd());\n      })\n    ],\n    [\n      \"lstrip\",\n      new FunctionValue(() => {\n        return new StringValue(this.value.trimStart());\n      })\n    ],\n    [\n      \"startswith\",\n      new FunctionValue((args) => {\n        if (args.length === 0) {\n          throw new Error(\"startswith() requires at least one argument\");\n        }\n        const pattern = args[0];\n        if (pattern instanceof StringValue) {\n          return new BooleanValue(this.value.startsWith(pattern.value));\n        } else if (pattern instanceof ArrayValue) {\n          for (const item of pattern.value) {\n            if (!(item instanceof StringValue)) {\n              throw new Error(\"startswith() tuple elements must be strings\");\n            }\n            if (this.value.startsWith(item.value)) {\n              return new BooleanValue(true);\n            }\n          }\n          return new BooleanValue(false);\n        }\n        throw new Error(\"startswith() argument must be a string or tuple of strings\");\n      })\n    ],\n    [\n      \"endswith\",\n      new FunctionValue((args) => {\n        if (args.length === 0) {\n          throw new Error(\"endswith() requires at least one argument\");\n        }\n        const pattern = args[0];\n        if (pattern instanceof StringValue) {\n          return new BooleanValue(this.value.endsWith(pattern.value));\n        } else if (pattern instanceof ArrayValue) {\n          for (const item of pattern.value) {\n            if (!(item instanceof StringValue)) {\n              throw new Error(\"endswith() tuple elements must be strings\");\n            }\n            if (this.value.endsWith(item.value)) {\n              return new BooleanValue(true);\n            }\n          }\n          return new BooleanValue(false);\n        }\n        throw new Error(\"endswith() argument must be a string or tuple of strings\");\n      })\n    ],\n    [\n      \"split\",\n      // follows Python's `str.split(sep=None, maxsplit=-1)` function behavior\n      // https://docs.python.org/3.13/library/stdtypes.html#str.split\n      new FunctionValue((args) => {\n        const sep = args[0] ?? new NullValue();\n        if (!(sep instanceof StringValue || sep instanceof NullValue)) {\n          throw new Error(\"sep argument must be a string or null\");\n        }\n        const maxsplit = args[1] ?? new IntegerValue(-1);\n        if (!(maxsplit instanceof IntegerValue)) {\n          throw new Error(\"maxsplit argument must be a number\");\n        }\n        let result = [];\n        if (sep instanceof NullValue) {\n          const text = this.value.trimStart();\n          for (const { 0: match, index } of text.matchAll(/\\S+/g)) {\n            if (maxsplit.value !== -1 && result.length >= maxsplit.value && index !== void 0) {\n              result.push(match + text.slice(index + match.length));\n              break;\n            }\n            result.push(match);\n          }\n        } else {\n          if (sep.value === \"\") {\n            throw new Error(\"empty separator\");\n          }\n          result = this.value.split(sep.value);\n          if (maxsplit.value !== -1 && result.length > maxsplit.value) {\n            result.push(result.splice(maxsplit.value).join(sep.value));\n          }\n        }\n        return new ArrayValue(result.map((part) => new StringValue(part)));\n      })\n    ],\n    [\n      \"replace\",\n      new FunctionValue((args) => {\n        if (args.length < 2) {\n          throw new Error(\"replace() requires at least two arguments\");\n        }\n        const oldValue = args[0];\n        const newValue = args[1];\n        if (!(oldValue instanceof StringValue && newValue instanceof StringValue)) {\n          throw new Error(\"replace() arguments must be strings\");\n        }\n        let count;\n        if (args.length > 2) {\n          if (args[2].type === \"KeywordArgumentsValue\") {\n            count = args[2].value.get(\"count\") ?? new NullValue();\n          } else {\n            count = args[2];\n          }\n        } else {\n          count = new NullValue();\n        }\n        if (!(count instanceof IntegerValue || count instanceof NullValue)) {\n          throw new Error(\"replace() count argument must be a number or null\");\n        }\n        return new StringValue(replace(this.value, oldValue.value, newValue.value, count.value));\n      })\n    ]\n  ]);\n};\nvar BooleanValue = class extends RuntimeValue {\n  type = \"BooleanValue\";\n};\nvar NON_ASCII_CHARS = /[\\x7f-\\uffff]/g;\nfunction makeAsciiSafe(str) {\n  return str.replace(NON_ASCII_CHARS, (char) => \"\\\\u\" + char.charCodeAt(0).toString(16).padStart(4, \"0\"));\n}\nfunction toJSON(input, options = {}, depth = 0, convertUndefinedToNull = true) {\n  const { indent = null, ensureAscii = false, separators = null, sortKeys = false } = options;\n  let itemSeparator;\n  let keySeparator;\n  if (separators) {\n    [itemSeparator, keySeparator] = separators;\n  } else if (indent) {\n    itemSeparator = \",\";\n    keySeparator = \": \";\n  } else {\n    itemSeparator = \", \";\n    keySeparator = \": \";\n  }\n  switch (input.type) {\n    case \"NullValue\":\n      return \"null\";\n    case \"UndefinedValue\":\n      return convertUndefinedToNull ? \"null\" : \"undefined\";\n    case \"IntegerValue\":\n    case \"FloatValue\":\n    case \"BooleanValue\":\n      return JSON.stringify(input.value);\n    case \"StringValue\": {\n      let result = JSON.stringify(input.value);\n      if (ensureAscii) {\n        result = makeAsciiSafe(result);\n      }\n      return result;\n    }\n    case \"ArrayValue\":\n    case \"ObjectValue\": {\n      const indentValue = indent ? \" \".repeat(indent) : \"\";\n      const basePadding = \"\\n\" + indentValue.repeat(depth);\n      const childrenPadding = basePadding + indentValue;\n      if (input.type === \"ArrayValue\") {\n        const core = input.value.map((x) => toJSON(x, options, depth + 1, convertUndefinedToNull));\n        return indent ? `[${childrenPadding}${core.join(`${itemSeparator}${childrenPadding}`)}${basePadding}]` : `[${core.join(itemSeparator)}]`;\n      } else {\n        let entries = Array.from(input.value.entries());\n        if (sortKeys) {\n          entries = entries.sort(([a], [b]) => a.localeCompare(b));\n        }\n        const core = entries.map(([key, value]) => {\n          let keyStr = JSON.stringify(key);\n          if (ensureAscii) {\n            keyStr = makeAsciiSafe(keyStr);\n          }\n          const v = `${keyStr}${keySeparator}${toJSON(value, options, depth + 1, convertUndefinedToNull)}`;\n          return indent ? `${childrenPadding}${v}` : v;\n        });\n        return indent ? `{${core.join(itemSeparator)}${basePadding}}` : `{${core.join(itemSeparator)}}`;\n      }\n    }\n    default:\n      throw new Error(`Cannot convert to JSON: ${input.type}`);\n  }\n}\nvar ObjectValue = class extends RuntimeValue {\n  type = \"ObjectValue\";\n  /**\n   * NOTE: necessary to override since all JavaScript arrays are considered truthy,\n   * while only non-empty Python arrays are consider truthy.\n   *\n   * e.g.,\n   *  - JavaScript:  {} && 5 -> 5\n   *  - Python:      {} and 5 -> {}\n   */\n  __bool__() {\n    return new BooleanValue(this.value.size > 0);\n  }\n  builtins = /* @__PURE__ */ new Map([\n    [\n      \"get\",\n      new FunctionValue(([key, defaultValue]) => {\n        if (!(key instanceof StringValue)) {\n          throw new Error(`Object key must be a string: got ${key.type}`);\n        }\n        return this.value.get(key.value) ?? defaultValue ?? new NullValue();\n      })\n    ],\n    [\"items\", new FunctionValue(() => this.items())],\n    [\"keys\", new FunctionValue(() => this.keys())],\n    [\"values\", new FunctionValue(() => this.values())],\n    [\n      \"dictsort\",\n      new FunctionValue((args) => {\n        let kwargs = /* @__PURE__ */ new Map();\n        const positionalArgs = args.filter((arg) => {\n          if (arg instanceof KeywordArgumentsValue) {\n            kwargs = arg.value;\n            return false;\n          }\n          return true;\n        });\n        const caseSensitive = positionalArgs.at(0) ?? kwargs.get(\"case_sensitive\") ?? new BooleanValue(false);\n        if (!(caseSensitive instanceof BooleanValue)) {\n          throw new Error(\"case_sensitive must be a boolean\");\n        }\n        const by = positionalArgs.at(1) ?? kwargs.get(\"by\") ?? new StringValue(\"key\");\n        if (!(by instanceof StringValue)) {\n          throw new Error(\"by must be a string\");\n        }\n        if (![\"key\", \"value\"].includes(by.value)) {\n          throw new Error(\"by must be either 'key' or 'value'\");\n        }\n        const reverse = positionalArgs.at(2) ?? kwargs.get(\"reverse\") ?? new BooleanValue(false);\n        if (!(reverse instanceof BooleanValue)) {\n          throw new Error(\"reverse must be a boolean\");\n        }\n        const items = Array.from(this.value.entries()).map(([key, value]) => new ArrayValue([new StringValue(key), value])).sort((a, b) => {\n          const index = by.value === \"key\" ? 0 : 1;\n          const aVal = a.value[index];\n          const bVal = b.value[index];\n          const result = compareRuntimeValues(aVal, bVal, caseSensitive.value);\n          return reverse.value ? -result : result;\n        });\n        return new ArrayValue(items);\n      })\n    ]\n  ]);\n  items() {\n    return new ArrayValue(\n      Array.from(this.value.entries()).map(([key, value]) => new ArrayValue([new StringValue(key), value]))\n    );\n  }\n  keys() {\n    return new ArrayValue(Array.from(this.value.keys()).map((key) => new StringValue(key)));\n  }\n  values() {\n    return new ArrayValue(Array.from(this.value.values()));\n  }\n  toString() {\n    return toJSON(this, {}, 0, false);\n  }\n};\nvar KeywordArgumentsValue = class extends ObjectValue {\n  type = \"KeywordArgumentsValue\";\n};\nvar ArrayValue = class extends RuntimeValue {\n  type = \"ArrayValue\";\n  builtins = /* @__PURE__ */ new Map([[\"length\", new IntegerValue(this.value.length)]]);\n  /**\n   * NOTE: necessary to override since all JavaScript arrays are considered truthy,\n   * while only non-empty Python arrays are consider truthy.\n   *\n   * e.g.,\n   *  - JavaScript:  [] && 5 -> 5\n   *  - Python:      [] and 5 -> []\n   */\n  __bool__() {\n    return new BooleanValue(this.value.length > 0);\n  }\n  toString() {\n    return toJSON(this, {}, 0, false);\n  }\n};\nvar TupleValue = class extends ArrayValue {\n  type = \"TupleValue\";\n};\nvar FunctionValue = class extends RuntimeValue {\n  type = \"FunctionValue\";\n};\nvar NullValue = class extends RuntimeValue {\n  type = \"NullValue\";\n};\nvar UndefinedValue = class extends RuntimeValue {\n  type = \"UndefinedValue\";\n};\nvar Environment = class {\n  constructor(parent) {\n    this.parent = parent;\n  }\n  /**\n   * The variables declared in this environment.\n   */\n  variables = /* @__PURE__ */ new Map([\n    [\n      \"namespace\",\n      new FunctionValue((args) => {\n        if (args.length === 0) {\n          return new ObjectValue(/* @__PURE__ */ new Map());\n        }\n        if (args.length !== 1 || !(args[0] instanceof ObjectValue)) {\n          throw new Error(\"`namespace` expects either zero arguments or a single object argument\");\n        }\n        return args[0];\n      })\n    ]\n  ]);\n  /**\n   * The tests available in this environment.\n   */\n  tests = /* @__PURE__ */ new Map([\n    [\"boolean\", (operand) => operand.type === \"BooleanValue\"],\n    [\"callable\", (operand) => operand instanceof FunctionValue],\n    [\n      \"odd\",\n      (operand) => {\n        if (!(operand instanceof IntegerValue)) {\n          throw new Error(`cannot odd on ${operand.type}`);\n        }\n        return operand.value % 2 !== 0;\n      }\n    ],\n    [\n      \"even\",\n      (operand) => {\n        if (!(operand instanceof IntegerValue)) {\n          throw new Error(`cannot even on ${operand.type}`);\n        }\n        return operand.value % 2 === 0;\n      }\n    ],\n    [\"false\", (operand) => operand.type === \"BooleanValue\" && !operand.value],\n    [\"true\", (operand) => operand.type === \"BooleanValue\" && operand.value],\n    [\"none\", (operand) => operand.type === \"NullValue\"],\n    [\"string\", (operand) => operand.type === \"StringValue\"],\n    [\"number\", (operand) => operand instanceof IntegerValue || operand instanceof FloatValue],\n    [\"integer\", (operand) => operand instanceof IntegerValue],\n    [\"iterable\", (operand) => operand.type === \"ArrayValue\" || operand.type === \"StringValue\"],\n    [\"mapping\", (operand) => operand.type === \"ObjectValue\"],\n    [\n      \"lower\",\n      (operand) => {\n        const str = operand.value;\n        return operand.type === \"StringValue\" && str === str.toLowerCase();\n      }\n    ],\n    [\n      \"upper\",\n      (operand) => {\n        const str = operand.value;\n        return operand.type === \"StringValue\" && str === str.toUpperCase();\n      }\n    ],\n    [\"none\", (operand) => operand.type === \"NullValue\"],\n    [\"defined\", (operand) => operand.type !== \"UndefinedValue\"],\n    [\"undefined\", (operand) => operand.type === \"UndefinedValue\"],\n    [\"equalto\", (a, b) => a.value === b.value],\n    [\"eq\", (a, b) => a.value === b.value]\n  ]);\n  /**\n   * Set the value of a variable in the current environment.\n   */\n  set(name, value) {\n    return this.declareVariable(name, convertToRuntimeValues(value));\n  }\n  declareVariable(name, value) {\n    if (this.variables.has(name)) {\n      throw new SyntaxError(`Variable already declared: ${name}`);\n    }\n    this.variables.set(name, value);\n    return value;\n  }\n  // private assignVariable(name: string, value: AnyRuntimeValue): AnyRuntimeValue {\n  // \tconst env = this.resolve(name);\n  // \tenv.variables.set(name, value);\n  // \treturn value;\n  // }\n  /**\n   * Set variable in the current scope.\n   * See https://jinja.palletsprojects.com/en/3.0.x/templates/#assignments for more information.\n   */\n  setVariable(name, value) {\n    this.variables.set(name, value);\n    return value;\n  }\n  /**\n   * Resolve the environment in which the variable is declared.\n   * @param {string} name The name of the variable.\n   * @returns {Environment} The environment in which the variable is declared.\n   */\n  resolve(name) {\n    if (this.variables.has(name)) {\n      return this;\n    }\n    if (this.parent) {\n      return this.parent.resolve(name);\n    }\n    throw new Error(`Unknown variable: ${name}`);\n  }\n  lookupVariable(name) {\n    try {\n      return this.resolve(name).variables.get(name) ?? new UndefinedValue();\n    } catch {\n      return new UndefinedValue();\n    }\n  }\n};\nfunction setupGlobals(env) {\n  env.set(\"false\", false);\n  env.set(\"true\", true);\n  env.set(\"none\", null);\n  env.set(\"raise_exception\", (args) => {\n    throw new Error(args);\n  });\n  env.set(\"range\", range);\n  env.set(\"strftime_now\", strftime_now);\n  env.set(\"True\", true);\n  env.set(\"False\", false);\n  env.set(\"None\", null);\n}\nfunction getAttributeValue(item, attributePath) {\n  const parts = attributePath.split(\".\");\n  let value = item;\n  for (const part of parts) {\n    if (value instanceof ObjectValue) {\n      value = value.value.get(part) ?? new UndefinedValue();\n    } else if (value instanceof ArrayValue) {\n      const index = parseInt(part, 10);\n      if (!isNaN(index) && index >= 0 && index < value.value.length) {\n        value = value.value[index];\n      } else {\n        return new UndefinedValue();\n      }\n    } else {\n      return new UndefinedValue();\n    }\n  }\n  return value;\n}\nfunction compareRuntimeValues(a, b, caseSensitive = false) {\n  if (a instanceof NullValue && b instanceof NullValue) {\n    return 0;\n  }\n  if (a instanceof NullValue || b instanceof NullValue) {\n    throw new Error(`Cannot compare ${a.type} with ${b.type}`);\n  }\n  if (a instanceof UndefinedValue && b instanceof UndefinedValue) {\n    return 0;\n  }\n  if (a instanceof UndefinedValue || b instanceof UndefinedValue) {\n    throw new Error(`Cannot compare ${a.type} with ${b.type}`);\n  }\n  const isNumericLike = (v) => v instanceof IntegerValue || v instanceof FloatValue || v instanceof BooleanValue;\n  const getNumericValue = (v) => {\n    if (v instanceof BooleanValue) {\n      return v.value ? 1 : 0;\n    }\n    return v.value;\n  };\n  if (isNumericLike(a) && isNumericLike(b)) {\n    const aNum = getNumericValue(a);\n    const bNum = getNumericValue(b);\n    return aNum < bNum ? -1 : aNum > bNum ? 1 : 0;\n  }\n  if (a.type !== b.type) {\n    throw new Error(`Cannot compare different types: ${a.type} and ${b.type}`);\n  }\n  switch (a.type) {\n    case \"StringValue\": {\n      let aStr = a.value;\n      let bStr = b.value;\n      if (!caseSensitive) {\n        aStr = aStr.toLowerCase();\n        bStr = bStr.toLowerCase();\n      }\n      return aStr < bStr ? -1 : aStr > bStr ? 1 : 0;\n    }\n    default:\n      throw new Error(`Cannot compare type: ${a.type}`);\n  }\n}\nvar Interpreter = class {\n  global;\n  constructor(env) {\n    this.global = env ?? new Environment();\n  }\n  /**\n   * Run the program.\n   */\n  run(program) {\n    return this.evaluate(program, this.global);\n  }\n  /**\n   * Evaluates expressions following the binary operation type.\n   */\n  evaluateBinaryExpression(node, environment) {\n    const left = this.evaluate(node.left, environment);\n    switch (node.operator.value) {\n      case \"and\":\n        return left.__bool__().value ? this.evaluate(node.right, environment) : left;\n      case \"or\":\n        return left.__bool__().value ? left : this.evaluate(node.right, environment);\n    }\n    const right = this.evaluate(node.right, environment);\n    switch (node.operator.value) {\n      case \"==\":\n        return new BooleanValue(left.value == right.value);\n      case \"!=\":\n        return new BooleanValue(left.value != right.value);\n    }\n    if (left instanceof UndefinedValue || right instanceof UndefinedValue) {\n      if (right instanceof UndefinedValue && [\"in\", \"not in\"].includes(node.operator.value)) {\n        return new BooleanValue(node.operator.value === \"not in\");\n      }\n      throw new Error(`Cannot perform operation ${node.operator.value} on undefined values`);\n    } else if (left instanceof NullValue || right instanceof NullValue) {\n      throw new Error(\"Cannot perform operation on null values\");\n    } else if (node.operator.value === \"~\") {\n      return new StringValue(left.value.toString() + right.value.toString());\n    } else if ((left instanceof IntegerValue || left instanceof FloatValue) && (right instanceof IntegerValue || right instanceof FloatValue)) {\n      const a = left.value, b = right.value;\n      switch (node.operator.value) {\n        case \"+\":\n        case \"-\":\n        case \"*\": {\n          const res = node.operator.value === \"+\" ? a + b : node.operator.value === \"-\" ? a - b : a * b;\n          const isFloat = left instanceof FloatValue || right instanceof FloatValue;\n          return isFloat ? new FloatValue(res) : new IntegerValue(res);\n        }\n        case \"/\":\n          return new FloatValue(a / b);\n        case \"%\": {\n          const rem = a % b;\n          const isFloat = left instanceof FloatValue || right instanceof FloatValue;\n          return isFloat ? new FloatValue(rem) : new IntegerValue(rem);\n        }\n        case \"<\":\n          return new BooleanValue(a < b);\n        case \">\":\n          return new BooleanValue(a > b);\n        case \">=\":\n          return new BooleanValue(a >= b);\n        case \"<=\":\n          return new BooleanValue(a <= b);\n      }\n    } else if (left instanceof ArrayValue && right instanceof ArrayValue) {\n      switch (node.operator.value) {\n        case \"+\":\n          return new ArrayValue(left.value.concat(right.value));\n      }\n    } else if (right instanceof ArrayValue) {\n      const member = right.value.find((x) => x.value === left.value) !== void 0;\n      switch (node.operator.value) {\n        case \"in\":\n          return new BooleanValue(member);\n        case \"not in\":\n          return new BooleanValue(!member);\n      }\n    }\n    if (left instanceof StringValue || right instanceof StringValue) {\n      switch (node.operator.value) {\n        case \"+\":\n          return new StringValue(left.value.toString() + right.value.toString());\n      }\n    }\n    if (left instanceof StringValue && right instanceof StringValue) {\n      switch (node.operator.value) {\n        case \"in\":\n          return new BooleanValue(right.value.includes(left.value));\n        case \"not in\":\n          return new BooleanValue(!right.value.includes(left.value));\n      }\n    }\n    if (left instanceof StringValue && right instanceof ObjectValue) {\n      switch (node.operator.value) {\n        case \"in\":\n          return new BooleanValue(right.value.has(left.value));\n        case \"not in\":\n          return new BooleanValue(!right.value.has(left.value));\n      }\n    }\n    throw new SyntaxError(`Unknown operator \"${node.operator.value}\" between ${left.type} and ${right.type}`);\n  }\n  evaluateArguments(args, environment) {\n    const positionalArguments = [];\n    const keywordArguments = /* @__PURE__ */ new Map();\n    for (const argument of args) {\n      if (argument.type === \"SpreadExpression\") {\n        const spreadNode = argument;\n        const val = this.evaluate(spreadNode.argument, environment);\n        if (!(val instanceof ArrayValue)) {\n          throw new Error(`Cannot unpack non-iterable type: ${val.type}`);\n        }\n        for (const item of val.value) {\n          positionalArguments.push(item);\n        }\n      } else if (argument.type === \"KeywordArgumentExpression\") {\n        const kwarg = argument;\n        keywordArguments.set(kwarg.key.value, this.evaluate(kwarg.value, environment));\n      } else {\n        if (keywordArguments.size > 0) {\n          throw new Error(\"Positional arguments must come before keyword arguments\");\n        }\n        positionalArguments.push(this.evaluate(argument, environment));\n      }\n    }\n    return [positionalArguments, keywordArguments];\n  }\n  applyFilter(operand, filterNode, environment) {\n    if (filterNode.type === \"Identifier\") {\n      const filter = filterNode;\n      if (filter.value === \"tojson\") {\n        return new StringValue(toJSON(operand, {}));\n      }\n      if (operand instanceof ArrayValue) {\n        switch (filter.value) {\n          case \"list\":\n            return operand;\n          case \"first\":\n            return operand.value[0];\n          case \"last\":\n            return operand.value[operand.value.length - 1];\n          case \"length\":\n            return new IntegerValue(operand.value.length);\n          case \"reverse\":\n            return new ArrayValue(operand.value.slice().reverse());\n          case \"sort\": {\n            return new ArrayValue(operand.value.slice().sort((a, b) => compareRuntimeValues(a, b, false)));\n          }\n          case \"join\":\n            return new StringValue(operand.value.map((x) => x.value).join(\"\"));\n          case \"string\":\n            return new StringValue(toJSON(operand, {}, 0, false));\n          case \"unique\": {\n            const seen = /* @__PURE__ */ new Set();\n            const output = [];\n            for (const item of operand.value) {\n              if (!seen.has(item.value)) {\n                seen.add(item.value);\n                output.push(item);\n              }\n            }\n            return new ArrayValue(output);\n          }\n          default:\n            throw new Error(`Unknown ArrayValue filter: ${filter.value}`);\n        }\n      } else if (operand instanceof StringValue) {\n        switch (filter.value) {\n          case \"length\":\n          case \"upper\":\n          case \"lower\":\n          case \"title\":\n          case \"capitalize\": {\n            const builtin = operand.builtins.get(filter.value);\n            if (builtin instanceof FunctionValue) {\n              return builtin.value(\n                /* no arguments */\n                [],\n                environment\n              );\n            } else if (builtin instanceof IntegerValue) {\n              return builtin;\n            } else {\n              throw new Error(`Unknown StringValue filter: ${filter.value}`);\n            }\n          }\n          case \"trim\":\n            return new StringValue(operand.value.trim());\n          case \"indent\":\n            return new StringValue(\n              operand.value.split(\"\\n\").map(\n                (x, i) => (\n                  // By default, don't indent the first line or empty lines\n                  i === 0 || x.length === 0 ? x : \"    \" + x\n                )\n              ).join(\"\\n\")\n            );\n          case \"join\":\n          case \"string\":\n            return operand;\n          case \"int\": {\n            const val = parseInt(operand.value, 10);\n            return new IntegerValue(isNaN(val) ? 0 : val);\n          }\n          case \"float\": {\n            const val = parseFloat(operand.value);\n            return new FloatValue(isNaN(val) ? 0 : val);\n          }\n          default:\n            throw new Error(`Unknown StringValue filter: ${filter.value}`);\n        }\n      } else if (operand instanceof IntegerValue || operand instanceof FloatValue) {\n        switch (filter.value) {\n          case \"abs\":\n            return operand instanceof IntegerValue ? new IntegerValue(Math.abs(operand.value)) : new FloatValue(Math.abs(operand.value));\n          case \"int\":\n            return new IntegerValue(Math.floor(operand.value));\n          case \"float\":\n            return new FloatValue(operand.value);\n          default:\n            throw new Error(`Unknown NumericValue filter: ${filter.value}`);\n        }\n      } else if (operand instanceof ObjectValue) {\n        switch (filter.value) {\n          case \"items\":\n            return new ArrayValue(\n              Array.from(operand.value.entries()).map(([key, value]) => new ArrayValue([new StringValue(key), value]))\n            );\n          case \"length\":\n            return new IntegerValue(operand.value.size);\n          default: {\n            const builtin = operand.builtins.get(filter.value);\n            if (builtin) {\n              if (builtin instanceof FunctionValue) {\n                return builtin.value([], environment);\n              }\n              return builtin;\n            }\n            throw new Error(`Unknown ObjectValue filter: ${filter.value}`);\n          }\n        }\n      } else if (operand instanceof BooleanValue) {\n        switch (filter.value) {\n          case \"bool\":\n            return new BooleanValue(operand.value);\n          case \"int\":\n            return new IntegerValue(operand.value ? 1 : 0);\n          case \"float\":\n            return new FloatValue(operand.value ? 1 : 0);\n          case \"string\":\n            return new StringValue(operand.value ? \"true\" : \"false\");\n          default:\n            throw new Error(`Unknown BooleanValue filter: ${filter.value}`);\n        }\n      }\n      throw new Error(`Cannot apply filter \"${filter.value}\" to type: ${operand.type}`);\n    } else if (filterNode.type === \"CallExpression\") {\n      const filter = filterNode;\n      if (filter.callee.type !== \"Identifier\") {\n        throw new Error(`Unknown filter: ${filter.callee.type}`);\n      }\n      const filterName = filter.callee.value;\n      if (filterName === \"tojson\") {\n        const [, kwargs] = this.evaluateArguments(filter.args, environment);\n        const indent = kwargs.get(\"indent\") ?? new NullValue();\n        if (!(indent instanceof IntegerValue || indent instanceof NullValue)) {\n          throw new Error(\"If set, indent must be a number\");\n        }\n        const ensureAscii = kwargs.get(\"ensure_ascii\") ?? new BooleanValue(false);\n        if (!(ensureAscii instanceof BooleanValue)) {\n          throw new Error(\"If set, ensure_ascii must be a boolean\");\n        }\n        const sortKeys = kwargs.get(\"sort_keys\") ?? new BooleanValue(false);\n        if (!(sortKeys instanceof BooleanValue)) {\n          throw new Error(\"If set, sort_keys must be a boolean\");\n        }\n        const separatorsArg = kwargs.get(\"separators\") ?? new NullValue();\n        let separators = null;\n        if (separatorsArg instanceof ArrayValue || separatorsArg instanceof TupleValue) {\n          if (separatorsArg.value.length !== 2) {\n            throw new Error(\"separators must be a tuple of two strings\");\n          }\n          const [itemSep, keySep] = separatorsArg.value;\n          if (!(itemSep instanceof StringValue) || !(keySep instanceof StringValue)) {\n            throw new Error(\"separators must be a tuple of two strings\");\n          }\n          separators = [itemSep.value, keySep.value];\n        } else if (!(separatorsArg instanceof NullValue)) {\n          throw new Error(\"If set, separators must be a tuple of two strings\");\n        }\n        return new StringValue(\n          toJSON(operand, {\n            indent: indent.value,\n            ensureAscii: ensureAscii.value,\n            sortKeys: sortKeys.value,\n            separators\n          })\n        );\n      } else if (filterName === \"join\") {\n        let value;\n        if (operand instanceof StringValue) {\n          value = Array.from(operand.value);\n        } else if (operand instanceof ArrayValue) {\n          value = operand.value.map((x) => x.value);\n        } else {\n          throw new Error(`Cannot apply filter \"${filterName}\" to type: ${operand.type}`);\n        }\n        const [args, kwargs] = this.evaluateArguments(filter.args, environment);\n        const separator = args.at(0) ?? kwargs.get(\"separator\") ?? new StringValue(\"\");\n        if (!(separator instanceof StringValue)) {\n          throw new Error(\"separator must be a string\");\n        }\n        return new StringValue(value.join(separator.value));\n      } else if (filterName === \"int\" || filterName === \"float\") {\n        const [args, kwargs] = this.evaluateArguments(filter.args, environment);\n        const defaultValue = args.at(0) ?? kwargs.get(\"default\") ?? (filterName === \"int\" ? new IntegerValue(0) : new FloatValue(0));\n        if (operand instanceof StringValue) {\n          const val = filterName === \"int\" ? parseInt(operand.value, 10) : parseFloat(operand.value);\n          return isNaN(val) ? defaultValue : filterName === \"int\" ? new IntegerValue(val) : new FloatValue(val);\n        } else if (operand instanceof IntegerValue || operand instanceof FloatValue) {\n          return operand;\n        } else if (operand instanceof BooleanValue) {\n          return filterName === \"int\" ? new IntegerValue(operand.value ? 1 : 0) : new FloatValue(operand.value ? 1 : 0);\n        } else {\n          throw new Error(`Cannot apply filter \"${filterName}\" to type: ${operand.type}`);\n        }\n      } else if (filterName === \"default\") {\n        const [args, kwargs] = this.evaluateArguments(filter.args, environment);\n        const defaultValue = args[0] ?? new StringValue(\"\");\n        const booleanValue = args[1] ?? kwargs.get(\"boolean\") ?? new BooleanValue(false);\n        if (!(booleanValue instanceof BooleanValue)) {\n          throw new Error(\"`default` filter flag must be a boolean\");\n        }\n        if (operand instanceof UndefinedValue || booleanValue.value && !operand.__bool__().value) {\n          return defaultValue;\n        }\n        return operand;\n      }\n      if (operand instanceof ArrayValue) {\n        switch (filterName) {\n          case \"sort\": {\n            const [args, kwargs] = this.evaluateArguments(filter.args, environment);\n            const reverse = args.at(0) ?? kwargs.get(\"reverse\") ?? new BooleanValue(false);\n            if (!(reverse instanceof BooleanValue)) {\n              throw new Error(\"reverse must be a boolean\");\n            }\n            const caseSensitive = args.at(1) ?? kwargs.get(\"case_sensitive\") ?? new BooleanValue(false);\n            if (!(caseSensitive instanceof BooleanValue)) {\n              throw new Error(\"case_sensitive must be a boolean\");\n            }\n            const attribute = args.at(2) ?? kwargs.get(\"attribute\") ?? new NullValue();\n            if (!(attribute instanceof StringValue || attribute instanceof IntegerValue || attribute instanceof NullValue)) {\n              throw new Error(\"attribute must be a string, integer, or null\");\n            }\n            const getSortValue = (item) => {\n              if (attribute instanceof NullValue) {\n                return item;\n              }\n              const attrPath = attribute instanceof IntegerValue ? String(attribute.value) : attribute.value;\n              return getAttributeValue(item, attrPath);\n            };\n            return new ArrayValue(\n              operand.value.slice().sort((a, b) => {\n                const aVal = getSortValue(a);\n                const bVal = getSortValue(b);\n                const result = compareRuntimeValues(aVal, bVal, caseSensitive.value);\n                return reverse.value ? -result : result;\n              })\n            );\n          }\n          case \"selectattr\":\n          case \"rejectattr\": {\n            const select = filterName === \"selectattr\";\n            if (operand.value.some((x) => !(x instanceof ObjectValue))) {\n              throw new Error(`\\`${filterName}\\` can only be applied to array of objects`);\n            }\n            if (filter.args.some((x) => x.type !== \"StringLiteral\")) {\n              throw new Error(`arguments of \\`${filterName}\\` must be strings`);\n            }\n            const [attr, testName, value] = filter.args.map((x) => this.evaluate(x, environment));\n            let testFunction;\n            if (testName) {\n              const test = environment.tests.get(testName.value);\n              if (!test) {\n                throw new Error(`Unknown test: ${testName.value}`);\n              }\n              testFunction = test;\n            } else {\n              testFunction = (...x) => x[0].__bool__().value;\n            }\n            const filtered = operand.value.filter((item) => {\n              const a = item.value.get(attr.value);\n              const result = a ? testFunction(a, value) : false;\n              return select ? result : !result;\n            });\n            return new ArrayValue(filtered);\n          }\n          case \"map\": {\n            const [, kwargs] = this.evaluateArguments(filter.args, environment);\n            if (kwargs.has(\"attribute\")) {\n              const attr = kwargs.get(\"attribute\");\n              if (!(attr instanceof StringValue)) {\n                throw new Error(\"attribute must be a string\");\n              }\n              const defaultValue = kwargs.get(\"default\");\n              const mapped = operand.value.map((item) => {\n                if (!(item instanceof ObjectValue)) {\n                  throw new Error(\"items in map must be an object\");\n                }\n                const value = getAttributeValue(item, attr.value);\n                return value instanceof UndefinedValue ? defaultValue ?? new UndefinedValue() : value;\n              });\n              return new ArrayValue(mapped);\n            } else {\n              throw new Error(\"`map` expressions without `attribute` set are not currently supported.\");\n            }\n          }\n        }\n        throw new Error(`Unknown ArrayValue filter: ${filterName}`);\n      } else if (operand instanceof StringValue) {\n        switch (filterName) {\n          case \"indent\": {\n            const [args, kwargs] = this.evaluateArguments(filter.args, environment);\n            const width = args.at(0) ?? kwargs.get(\"width\") ?? new IntegerValue(4);\n            if (!(width instanceof IntegerValue)) {\n              throw new Error(\"width must be a number\");\n            }\n            const first = args.at(1) ?? kwargs.get(\"first\") ?? new BooleanValue(false);\n            const blank = args.at(2) ?? kwargs.get(\"blank\") ?? new BooleanValue(false);\n            const lines = operand.value.split(\"\\n\");\n            const indent = \" \".repeat(width.value);\n            const indented = lines.map(\n              (x, i) => !first.value && i === 0 || !blank.value && x.length === 0 ? x : indent + x\n            );\n            return new StringValue(indented.join(\"\\n\"));\n          }\n          case \"replace\": {\n            const replaceFn = operand.builtins.get(\"replace\");\n            if (!(replaceFn instanceof FunctionValue)) {\n              throw new Error(\"replace filter not available\");\n            }\n            const [args, kwargs] = this.evaluateArguments(filter.args, environment);\n            return replaceFn.value([...args, new KeywordArgumentsValue(kwargs)], environment);\n          }\n        }\n        throw new Error(`Unknown StringValue filter: ${filterName}`);\n      } else if (operand instanceof ObjectValue) {\n        const builtin = operand.builtins.get(filterName);\n        if (builtin && builtin instanceof FunctionValue) {\n          const [args, kwargs] = this.evaluateArguments(filter.args, environment);\n          if (kwargs.size > 0) {\n            args.push(new KeywordArgumentsValue(kwargs));\n          }\n          return builtin.value(args, environment);\n        }\n        throw new Error(`Unknown ObjectValue filter: ${filterName}`);\n      } else {\n        throw new Error(`Cannot apply filter \"${filterName}\" to type: ${operand.type}`);\n      }\n    }\n    throw new Error(`Unknown filter: ${filterNode.type}`);\n  }\n  /**\n   * Evaluates expressions following the filter operation type.\n   */\n  evaluateFilterExpression(node, environment) {\n    const operand = this.evaluate(node.operand, environment);\n    return this.applyFilter(operand, node.filter, environment);\n  }\n  /**\n   * Evaluates expressions following the test operation type.\n   */\n  evaluateTestExpression(node, environment) {\n    const operand = this.evaluate(node.operand, environment);\n    const test = environment.tests.get(node.test.value);\n    if (!test) {\n      throw new Error(`Unknown test: ${node.test.value}`);\n    }\n    const result = test(operand);\n    return new BooleanValue(node.negate ? !result : result);\n  }\n  /**\n   * Evaluates expressions following the select operation type.\n   */\n  evaluateSelectExpression(node, environment) {\n    const predicate = this.evaluate(node.test, environment);\n    if (!predicate.__bool__().value) {\n      return new UndefinedValue();\n    }\n    return this.evaluate(node.lhs, environment);\n  }\n  /**\n   * Evaluates expressions following the unary operation type.\n   */\n  evaluateUnaryExpression(node, environment) {\n    const argument = this.evaluate(node.argument, environment);\n    switch (node.operator.value) {\n      case \"not\":\n        return new BooleanValue(!argument.value);\n      default:\n        throw new SyntaxError(`Unknown operator: ${node.operator.value}`);\n    }\n  }\n  evaluateTernaryExpression(node, environment) {\n    const cond = this.evaluate(node.condition, environment);\n    return cond.__bool__().value ? this.evaluate(node.trueExpr, environment) : this.evaluate(node.falseExpr, environment);\n  }\n  evalProgram(program, environment) {\n    return this.evaluateBlock(program.body, environment);\n  }\n  evaluateBlock(statements, environment) {\n    let result = \"\";\n    for (const statement of statements) {\n      const lastEvaluated = this.evaluate(statement, environment);\n      if (lastEvaluated.type !== \"NullValue\" && lastEvaluated.type !== \"UndefinedValue\") {\n        result += lastEvaluated.toString();\n      }\n    }\n    return new StringValue(result);\n  }\n  evaluateIdentifier(node, environment) {\n    return environment.lookupVariable(node.value);\n  }\n  evaluateCallExpression(expr, environment) {\n    const [args, kwargs] = this.evaluateArguments(expr.args, environment);\n    if (kwargs.size > 0) {\n      args.push(new KeywordArgumentsValue(kwargs));\n    }\n    const fn = this.evaluate(expr.callee, environment);\n    if (fn.type !== \"FunctionValue\") {\n      throw new Error(`Cannot call something that is not a function: got ${fn.type}`);\n    }\n    return fn.value(args, environment);\n  }\n  evaluateSliceExpression(object, expr, environment) {\n    if (!(object instanceof ArrayValue || object instanceof StringValue)) {\n      throw new Error(\"Slice object must be an array or string\");\n    }\n    const start = this.evaluate(expr.start, environment);\n    const stop = this.evaluate(expr.stop, environment);\n    const step = this.evaluate(expr.step, environment);\n    if (!(start instanceof IntegerValue || start instanceof UndefinedValue)) {\n      throw new Error(\"Slice start must be numeric or undefined\");\n    }\n    if (!(stop instanceof IntegerValue || stop instanceof UndefinedValue)) {\n      throw new Error(\"Slice stop must be numeric or undefined\");\n    }\n    if (!(step instanceof IntegerValue || step instanceof UndefinedValue)) {\n      throw new Error(\"Slice step must be numeric or undefined\");\n    }\n    if (object instanceof ArrayValue) {\n      return new ArrayValue(slice(object.value, start.value, stop.value, step.value));\n    } else {\n      return new StringValue(slice(Array.from(object.value), start.value, stop.value, step.value).join(\"\"));\n    }\n  }\n  evaluateMemberExpression(expr, environment) {\n    const object = this.evaluate(expr.object, environment);\n    let property;\n    if (expr.computed) {\n      if (expr.property.type === \"SliceExpression\") {\n        return this.evaluateSliceExpression(object, expr.property, environment);\n      } else {\n        property = this.evaluate(expr.property, environment);\n      }\n    } else {\n      property = new StringValue(expr.property.value);\n    }\n    let value;\n    if (object instanceof ObjectValue) {\n      if (!(property instanceof StringValue)) {\n        throw new Error(`Cannot access property with non-string: got ${property.type}`);\n      }\n      value = object.value.get(property.value) ?? object.builtins.get(property.value);\n    } else if (object instanceof ArrayValue || object instanceof StringValue) {\n      if (property instanceof IntegerValue) {\n        value = object.value.at(property.value);\n        if (object instanceof StringValue) {\n          value = new StringValue(object.value.at(property.value));\n        }\n      } else if (property instanceof StringValue) {\n        value = object.builtins.get(property.value);\n      } else {\n        throw new Error(`Cannot access property with non-string/non-number: got ${property.type}`);\n      }\n    } else {\n      if (!(property instanceof StringValue)) {\n        throw new Error(`Cannot access property with non-string: got ${property.type}`);\n      }\n      value = object.builtins.get(property.value);\n    }\n    return value instanceof RuntimeValue ? value : new UndefinedValue();\n  }\n  evaluateSet(node, environment) {\n    const rhs = node.value ? this.evaluate(node.value, environment) : this.evaluateBlock(node.body, environment);\n    if (node.assignee.type === \"Identifier\") {\n      const variableName = node.assignee.value;\n      environment.setVariable(variableName, rhs);\n    } else if (node.assignee.type === \"TupleLiteral\") {\n      const tuple = node.assignee;\n      if (!(rhs instanceof ArrayValue)) {\n        throw new Error(`Cannot unpack non-iterable type in set: ${rhs.type}`);\n      }\n      const arr = rhs.value;\n      if (arr.length !== tuple.value.length) {\n        throw new Error(`Too ${tuple.value.length > arr.length ? \"few\" : \"many\"} items to unpack in set`);\n      }\n      for (let i = 0; i < tuple.value.length; ++i) {\n        const elem = tuple.value[i];\n        if (elem.type !== \"Identifier\") {\n          throw new Error(`Cannot unpack to non-identifier in set: ${elem.type}`);\n        }\n        environment.setVariable(elem.value, arr[i]);\n      }\n    } else if (node.assignee.type === \"MemberExpression\") {\n      const member = node.assignee;\n      const object = this.evaluate(member.object, environment);\n      if (!(object instanceof ObjectValue)) {\n        throw new Error(\"Cannot assign to member of non-object\");\n      }\n      if (member.property.type !== \"Identifier\") {\n        throw new Error(\"Cannot assign to member with non-identifier property\");\n      }\n      object.value.set(member.property.value, rhs);\n    } else {\n      throw new Error(`Invalid LHS inside assignment expression: ${JSON.stringify(node.assignee)}`);\n    }\n    return new NullValue();\n  }\n  evaluateIf(node, environment) {\n    const test = this.evaluate(node.test, environment);\n    return this.evaluateBlock(test.__bool__().value ? node.body : node.alternate, environment);\n  }\n  evaluateFor(node, environment) {\n    const scope = new Environment(environment);\n    let test, iterable;\n    if (node.iterable.type === \"SelectExpression\") {\n      const select = node.iterable;\n      iterable = this.evaluate(select.lhs, scope);\n      test = select.test;\n    } else {\n      iterable = this.evaluate(node.iterable, scope);\n    }\n    if (!(iterable instanceof ArrayValue || iterable instanceof ObjectValue)) {\n      throw new Error(`Expected iterable or object type in for loop: got ${iterable.type}`);\n    }\n    if (iterable instanceof ObjectValue) {\n      iterable = iterable.keys();\n    }\n    const items = [];\n    const scopeUpdateFunctions = [];\n    for (let i = 0; i < iterable.value.length; ++i) {\n      const loopScope = new Environment(scope);\n      const current = iterable.value[i];\n      let scopeUpdateFunction;\n      if (node.loopvar.type === \"Identifier\") {\n        scopeUpdateFunction = (scope2) => scope2.setVariable(node.loopvar.value, current);\n      } else if (node.loopvar.type === \"TupleLiteral\") {\n        const loopvar = node.loopvar;\n        if (current.type !== \"ArrayValue\") {\n          throw new Error(`Cannot unpack non-iterable type: ${current.type}`);\n        }\n        const c = current;\n        if (loopvar.value.length !== c.value.length) {\n          throw new Error(`Too ${loopvar.value.length > c.value.length ? \"few\" : \"many\"} items to unpack`);\n        }\n        scopeUpdateFunction = (scope2) => {\n          for (let j = 0; j < loopvar.value.length; ++j) {\n            if (loopvar.value[j].type !== \"Identifier\") {\n              throw new Error(`Cannot unpack non-identifier type: ${loopvar.value[j].type}`);\n            }\n            scope2.setVariable(loopvar.value[j].value, c.value[j]);\n          }\n        };\n      } else {\n        throw new Error(`Invalid loop variable(s): ${node.loopvar.type}`);\n      }\n      if (test) {\n        scopeUpdateFunction(loopScope);\n        const testValue = this.evaluate(test, loopScope);\n        if (!testValue.__bool__().value) {\n          continue;\n        }\n      }\n      items.push(current);\n      scopeUpdateFunctions.push(scopeUpdateFunction);\n    }\n    let result = \"\";\n    let noIteration = true;\n    for (let i = 0; i < items.length; ++i) {\n      const loop = /* @__PURE__ */ new Map([\n        [\"index\", new IntegerValue(i + 1)],\n        [\"index0\", new IntegerValue(i)],\n        [\"revindex\", new IntegerValue(items.length - i)],\n        [\"revindex0\", new IntegerValue(items.length - i - 1)],\n        [\"first\", new BooleanValue(i === 0)],\n        [\"last\", new BooleanValue(i === items.length - 1)],\n        [\"length\", new IntegerValue(items.length)],\n        [\"previtem\", i > 0 ? items[i - 1] : new UndefinedValue()],\n        [\"nextitem\", i < items.length - 1 ? items[i + 1] : new UndefinedValue()]\n      ]);\n      scope.setVariable(\"loop\", new ObjectValue(loop));\n      scopeUpdateFunctions[i](scope);\n      try {\n        const evaluated = this.evaluateBlock(node.body, scope);\n        result += evaluated.value;\n      } catch (err) {\n        if (err instanceof ContinueControl) {\n          continue;\n        }\n        if (err instanceof BreakControl) {\n          break;\n        }\n        throw err;\n      }\n      noIteration = false;\n    }\n    if (noIteration) {\n      const defaultEvaluated = this.evaluateBlock(node.defaultBlock, scope);\n      result += defaultEvaluated.value;\n    }\n    return new StringValue(result);\n  }\n  /**\n   * See https://jinja.palletsprojects.com/en/3.1.x/templates/#macros for more information.\n   */\n  evaluateMacro(node, environment) {\n    environment.setVariable(\n      node.name.value,\n      new FunctionValue((args, scope) => {\n        const macroScope = new Environment(scope);\n        args = args.slice();\n        let kwargs;\n        if (args.at(-1)?.type === \"KeywordArgumentsValue\") {\n          kwargs = args.pop();\n        }\n        for (let i = 0; i < node.args.length; ++i) {\n          const nodeArg = node.args[i];\n          const passedArg = args[i];\n          if (nodeArg.type === \"Identifier\") {\n            const identifier = nodeArg;\n            if (!passedArg) {\n              throw new Error(`Missing positional argument: ${identifier.value}`);\n            }\n            macroScope.setVariable(identifier.value, passedArg);\n          } else if (nodeArg.type === \"KeywordArgumentExpression\") {\n            const kwarg = nodeArg;\n            const value = passedArg ?? // Try positional arguments first\n            kwargs?.value.get(kwarg.key.value) ?? // Look in user-passed kwargs\n            this.evaluate(kwarg.value, macroScope);\n            macroScope.setVariable(kwarg.key.value, value);\n          } else {\n            throw new Error(`Unknown argument type: ${nodeArg.type}`);\n          }\n        }\n        return this.evaluateBlock(node.body, macroScope);\n      })\n    );\n    return new NullValue();\n  }\n  evaluateCallStatement(node, environment) {\n    const callerFn = new FunctionValue((callerArgs, callerEnv) => {\n      const callBlockEnv = new Environment(callerEnv);\n      if (node.callerArgs) {\n        for (let i = 0; i < node.callerArgs.length; ++i) {\n          const param = node.callerArgs[i];\n          if (param.type !== \"Identifier\") {\n            throw new Error(`Caller parameter must be an identifier, got ${param.type}`);\n          }\n          callBlockEnv.setVariable(param.value, callerArgs[i] ?? new UndefinedValue());\n        }\n      }\n      return this.evaluateBlock(node.body, callBlockEnv);\n    });\n    const [macroArgs, macroKwargs] = this.evaluateArguments(node.call.args, environment);\n    macroArgs.push(new KeywordArgumentsValue(macroKwargs));\n    const fn = this.evaluate(node.call.callee, environment);\n    if (fn.type !== \"FunctionValue\") {\n      throw new Error(`Cannot call something that is not a function: got ${fn.type}`);\n    }\n    const newEnv = new Environment(environment);\n    newEnv.setVariable(\"caller\", callerFn);\n    return fn.value(macroArgs, newEnv);\n  }\n  evaluateFilterStatement(node, environment) {\n    const rendered = this.evaluateBlock(node.body, environment);\n    return this.applyFilter(rendered, node.filter, environment);\n  }\n  evaluate(statement, environment) {\n    if (!statement)\n      return new UndefinedValue();\n    switch (statement.type) {\n      case \"Program\":\n        return this.evalProgram(statement, environment);\n      case \"Set\":\n        return this.evaluateSet(statement, environment);\n      case \"If\":\n        return this.evaluateIf(statement, environment);\n      case \"For\":\n        return this.evaluateFor(statement, environment);\n      case \"Macro\":\n        return this.evaluateMacro(statement, environment);\n      case \"CallStatement\":\n        return this.evaluateCallStatement(statement, environment);\n      case \"Break\":\n        throw new BreakControl();\n      case \"Continue\":\n        throw new ContinueControl();\n      case \"IntegerLiteral\":\n        return new IntegerValue(statement.value);\n      case \"FloatLiteral\":\n        return new FloatValue(statement.value);\n      case \"StringLiteral\":\n        return new StringValue(statement.value);\n      case \"ArrayLiteral\":\n        return new ArrayValue(statement.value.map((x) => this.evaluate(x, environment)));\n      case \"TupleLiteral\":\n        return new TupleValue(statement.value.map((x) => this.evaluate(x, environment)));\n      case \"ObjectLiteral\": {\n        const mapping = /* @__PURE__ */ new Map();\n        for (const [key, value] of statement.value) {\n          const evaluatedKey = this.evaluate(key, environment);\n          if (!(evaluatedKey instanceof StringValue)) {\n            throw new Error(`Object keys must be strings: got ${evaluatedKey.type}`);\n          }\n          mapping.set(evaluatedKey.value, this.evaluate(value, environment));\n        }\n        return new ObjectValue(mapping);\n      }\n      case \"Identifier\":\n        return this.evaluateIdentifier(statement, environment);\n      case \"CallExpression\":\n        return this.evaluateCallExpression(statement, environment);\n      case \"MemberExpression\":\n        return this.evaluateMemberExpression(statement, environment);\n      case \"UnaryExpression\":\n        return this.evaluateUnaryExpression(statement, environment);\n      case \"BinaryExpression\":\n        return this.evaluateBinaryExpression(statement, environment);\n      case \"FilterExpression\":\n        return this.evaluateFilterExpression(statement, environment);\n      case \"FilterStatement\":\n        return this.evaluateFilterStatement(statement, environment);\n      case \"TestExpression\":\n        return this.evaluateTestExpression(statement, environment);\n      case \"SelectExpression\":\n        return this.evaluateSelectExpression(statement, environment);\n      case \"Ternary\":\n        return this.evaluateTernaryExpression(statement, environment);\n      case \"Comment\":\n        return new NullValue();\n      default:\n        throw new SyntaxError(`Unknown node type: ${statement.type}`);\n    }\n  }\n};\nfunction convertToRuntimeValues(input) {\n  switch (typeof input) {\n    case \"number\":\n      return Number.isInteger(input) ? new IntegerValue(input) : new FloatValue(input);\n    case \"string\":\n      return new StringValue(input);\n    case \"boolean\":\n      return new BooleanValue(input);\n    case \"undefined\":\n      return new UndefinedValue();\n    case \"object\":\n      if (input === null) {\n        return new NullValue();\n      } else if (Array.isArray(input)) {\n        return new ArrayValue(input.map(convertToRuntimeValues));\n      } else {\n        return new ObjectValue(\n          new Map(Object.entries(input).map(([key, value]) => [key, convertToRuntimeValues(value)]))\n        );\n      }\n    case \"function\":\n      return new FunctionValue((args, _scope) => {\n        const result = input(...args.map((x) => x.value)) ?? null;\n        return convertToRuntimeValues(result);\n      });\n    default:\n      throw new Error(`Cannot convert to runtime value: ${input}`);\n  }\n}\n\n// src/format.ts\nvar NEWLINE = \"\\n\";\nvar OPEN_STATEMENT = \"{%- \";\nvar CLOSE_STATEMENT = \" -%}\";\nfunction getBinaryOperatorPrecedence(expr) {\n  switch (expr.operator.type) {\n    case \"MultiplicativeBinaryOperator\":\n      return 4;\n    case \"AdditiveBinaryOperator\":\n      return 3;\n    case \"ComparisonBinaryOperator\":\n      return 2;\n    case \"Identifier\":\n      if (expr.operator.value === \"and\")\n        return 1;\n      if (expr.operator.value === \"in\" || expr.operator.value === \"not in\")\n        return 2;\n      return 0;\n  }\n  return 0;\n}\nfunction format(program, indent = \"\t\") {\n  const indentStr = typeof indent === \"number\" ? \" \".repeat(indent) : indent;\n  const body = formatStatements(program.body, 0, indentStr);\n  return body.replace(/\\n$/, \"\");\n}\nfunction createStatement(...text) {\n  return OPEN_STATEMENT + text.join(\" \") + CLOSE_STATEMENT;\n}\nfunction formatStatements(stmts, depth, indentStr) {\n  return stmts.map((stmt) => formatStatement(stmt, depth, indentStr)).join(NEWLINE);\n}\nfunction formatStatement(node, depth, indentStr) {\n  const pad = indentStr.repeat(depth);\n  switch (node.type) {\n    case \"Program\":\n      return formatStatements(node.body, depth, indentStr);\n    case \"If\":\n      return formatIf(node, depth, indentStr);\n    case \"For\":\n      return formatFor(node, depth, indentStr);\n    case \"Set\":\n      return formatSet(node, depth, indentStr);\n    case \"Macro\":\n      return formatMacro(node, depth, indentStr);\n    case \"Break\":\n      return pad + createStatement(\"break\");\n    case \"Continue\":\n      return pad + createStatement(\"continue\");\n    case \"CallStatement\":\n      return formatCallStatement(node, depth, indentStr);\n    case \"FilterStatement\":\n      return formatFilterStatement(node, depth, indentStr);\n    case \"Comment\":\n      return pad + \"{# \" + node.value + \" #}\";\n    default:\n      return pad + \"{{- \" + formatExpression(node) + \" -}}\";\n  }\n}\nfunction formatIf(node, depth, indentStr) {\n  const pad = indentStr.repeat(depth);\n  const clauses = [];\n  let current = node;\n  while (current) {\n    clauses.push({ test: current.test, body: current.body });\n    if (current.alternate.length === 1 && current.alternate[0].type === \"If\") {\n      current = current.alternate[0];\n    } else {\n      break;\n    }\n  }\n  let out = pad + createStatement(\"if\", formatExpression(clauses[0].test)) + NEWLINE + formatStatements(clauses[0].body, depth + 1, indentStr);\n  for (let i = 1; i < clauses.length; ++i) {\n    out += NEWLINE + pad + createStatement(\"elif\", formatExpression(clauses[i].test)) + NEWLINE + formatStatements(clauses[i].body, depth + 1, indentStr);\n  }\n  if (current && current.alternate.length > 0) {\n    out += NEWLINE + pad + createStatement(\"else\") + NEWLINE + formatStatements(current.alternate, depth + 1, indentStr);\n  }\n  out += NEWLINE + pad + createStatement(\"endif\");\n  return out;\n}\nfunction formatFor(node, depth, indentStr) {\n  const pad = indentStr.repeat(depth);\n  let formattedIterable = \"\";\n  if (node.iterable.type === \"SelectExpression\") {\n    const n = node.iterable;\n    formattedIterable = `${formatExpression(n.lhs)} if ${formatExpression(n.test)}`;\n  } else {\n    formattedIterable = formatExpression(node.iterable);\n  }\n  let out = pad + createStatement(\"for\", formatExpression(node.loopvar), \"in\", formattedIterable) + NEWLINE + formatStatements(node.body, depth + 1, indentStr);\n  if (node.defaultBlock.length > 0) {\n    out += NEWLINE + pad + createStatement(\"else\") + NEWLINE + formatStatements(node.defaultBlock, depth + 1, indentStr);\n  }\n  out += NEWLINE + pad + createStatement(\"endfor\");\n  return out;\n}\nfunction formatSet(node, depth, indentStr) {\n  const pad = indentStr.repeat(depth);\n  const left = formatExpression(node.assignee);\n  const right = node.value ? formatExpression(node.value) : \"\";\n  const value = pad + createStatement(\"set\", `${left}${node.value ? \" = \" + right : \"\"}`);\n  if (node.body.length === 0) {\n    return value;\n  }\n  return value + NEWLINE + formatStatements(node.body, depth + 1, indentStr) + NEWLINE + pad + createStatement(\"endset\");\n}\nfunction formatMacro(node, depth, indentStr) {\n  const pad = indentStr.repeat(depth);\n  const args = node.args.map(formatExpression).join(\", \");\n  return pad + createStatement(\"macro\", `${node.name.value}(${args})`) + NEWLINE + formatStatements(node.body, depth + 1, indentStr) + NEWLINE + pad + createStatement(\"endmacro\");\n}\nfunction formatCallStatement(node, depth, indentStr) {\n  const pad = indentStr.repeat(depth);\n  const params = node.callerArgs && node.callerArgs.length > 0 ? `(${node.callerArgs.map(formatExpression).join(\", \")})` : \"\";\n  const callExpr = formatExpression(node.call);\n  let out = pad + createStatement(`call${params}`, callExpr) + NEWLINE;\n  out += formatStatements(node.body, depth + 1, indentStr) + NEWLINE;\n  out += pad + createStatement(\"endcall\");\n  return out;\n}\nfunction formatFilterStatement(node, depth, indentStr) {\n  const pad = indentStr.repeat(depth);\n  const spec = node.filter.type === \"Identifier\" ? node.filter.value : formatExpression(node.filter);\n  let out = pad + createStatement(\"filter\", spec) + NEWLINE;\n  out += formatStatements(node.body, depth + 1, indentStr) + NEWLINE;\n  out += pad + createStatement(\"endfilter\");\n  return out;\n}\nfunction formatExpression(node, parentPrec = -1) {\n  switch (node.type) {\n    case \"SpreadExpression\": {\n      const n = node;\n      return `*${formatExpression(n.argument)}`;\n    }\n    case \"Identifier\":\n      return node.value;\n    case \"IntegerLiteral\":\n      return `${node.value}`;\n    case \"FloatLiteral\":\n      return `${node.value}`;\n    case \"StringLiteral\":\n      return JSON.stringify(node.value);\n    case \"BinaryExpression\": {\n      const n = node;\n      const thisPrecedence = getBinaryOperatorPrecedence(n);\n      const left = formatExpression(n.left, thisPrecedence);\n      const right = formatExpression(n.right, thisPrecedence + 1);\n      const expr = `${left} ${n.operator.value} ${right}`;\n      return thisPrecedence < parentPrec ? `(${expr})` : expr;\n    }\n    case \"UnaryExpression\": {\n      const n = node;\n      const val = n.operator.value + (n.operator.value === \"not\" ? \" \" : \"\") + formatExpression(n.argument, Infinity);\n      return val;\n    }\n    case \"CallExpression\": {\n      const n = node;\n      const args = n.args.map(formatExpression).join(\", \");\n      return `${formatExpression(n.callee)}(${args})`;\n    }\n    case \"MemberExpression\": {\n      const n = node;\n      let obj = formatExpression(n.object);\n      if (![\n        \"Identifier\",\n        \"MemberExpression\",\n        \"CallExpression\",\n        \"StringLiteral\",\n        \"IntegerLiteral\",\n        \"FloatLiteral\",\n        \"ArrayLiteral\",\n        \"TupleLiteral\",\n        \"ObjectLiteral\"\n      ].includes(n.object.type)) {\n        obj = `(${obj})`;\n      }\n      let prop = formatExpression(n.property);\n      if (!n.computed && n.property.type !== \"Identifier\") {\n        prop = `(${prop})`;\n      }\n      return n.computed ? `${obj}[${prop}]` : `${obj}.${prop}`;\n    }\n    case \"FilterExpression\": {\n      const n = node;\n      const operand = formatExpression(n.operand, Infinity);\n      if (n.filter.type === \"CallExpression\") {\n        return `${operand} | ${formatExpression(n.filter)}`;\n      }\n      return `${operand} | ${n.filter.value}`;\n    }\n    case \"SelectExpression\": {\n      const n = node;\n      return `${formatExpression(n.lhs)} if ${formatExpression(n.test)}`;\n    }\n    case \"TestExpression\": {\n      const n = node;\n      return `${formatExpression(n.operand)} is${n.negate ? \" not\" : \"\"} ${n.test.value}`;\n    }\n    case \"ArrayLiteral\":\n    case \"TupleLiteral\": {\n      const elems = node.value.map(formatExpression);\n      const brackets = node.type === \"ArrayLiteral\" ? \"[]\" : \"()\";\n      return `${brackets[0]}${elems.join(\", \")}${brackets[1]}`;\n    }\n    case \"ObjectLiteral\": {\n      const entries = Array.from(node.value.entries()).map(\n        ([k, v]) => `${formatExpression(k)}: ${formatExpression(v)}`\n      );\n      return `{${entries.join(\", \")}}`;\n    }\n    case \"SliceExpression\": {\n      const n = node;\n      const s = n.start ? formatExpression(n.start) : \"\";\n      const t = n.stop ? formatExpression(n.stop) : \"\";\n      const st = n.step ? `:${formatExpression(n.step)}` : \"\";\n      return `${s}:${t}${st}`;\n    }\n    case \"KeywordArgumentExpression\": {\n      const n = node;\n      return `${n.key.value}=${formatExpression(n.value)}`;\n    }\n    case \"Ternary\": {\n      const n = node;\n      const expr = `${formatExpression(n.trueExpr)} if ${formatExpression(n.condition, 0)} else ${formatExpression(\n        n.falseExpr\n      )}`;\n      return parentPrec > -1 ? `(${expr})` : expr;\n    }\n    default:\n      throw new Error(`Unknown expression type: ${node.type}`);\n  }\n}\n\n// src/index.ts\nvar Template = class {\n  parsed;\n  /**\n   * @param {string} template The template string\n   */\n  constructor(template) {\n    const tokens = tokenize(template, {\n      lstrip_blocks: true,\n      trim_blocks: true\n    });\n    this.parsed = parse(tokens);\n  }\n  render(items) {\n    const env = new Environment();\n    setupGlobals(env);\n    if (items) {\n      for (const [key, value] of Object.entries(items)) {\n        env.set(key, value);\n      }\n    }\n    const interpreter = new Interpreter(env);\n    const result = interpreter.run(this.parsed);\n    return result.value;\n  }\n  format(options) {\n    return format(this.parsed, options?.indent || \"\t\");\n  }\n};\nexport {\n  Environment,\n  Interpreter,\n  Template,\n  parse,\n  tokenize\n};\n", "\n\nconst WHISPER_LANGUAGES = [\n    [\"en\", \"english\"],\n    [\"zh\", \"chinese\"],\n    [\"de\", \"german\"],\n    [\"es\", \"spanish\"],\n    [\"ru\", \"russian\"],\n    [\"ko\", \"korean\"],\n    [\"fr\", \"french\"],\n    [\"ja\", \"japanese\"],\n    [\"pt\", \"portuguese\"],\n    [\"tr\", \"turkish\"],\n    [\"pl\", \"polish\"],\n    [\"ca\", \"catalan\"],\n    [\"nl\", \"dutch\"],\n    [\"ar\", \"arabic\"],\n    [\"sv\", \"swedish\"],\n    [\"it\", \"italian\"],\n    [\"id\", \"indonesian\"],\n    [\"hi\", \"hindi\"],\n    [\"fi\", \"finnish\"],\n    [\"vi\", \"vietnamese\"],\n    [\"he\", \"hebrew\"],\n    [\"uk\", \"ukrainian\"],\n    [\"el\", \"greek\"],\n    [\"ms\", \"malay\"],\n    [\"cs\", \"czech\"],\n    [\"ro\", \"romanian\"],\n    [\"da\", \"danish\"],\n    [\"hu\", \"hungarian\"],\n    [\"ta\", \"tamil\"],\n    [\"no\", \"norwegian\"],\n    [\"th\", \"thai\"],\n    [\"ur\", \"urdu\"],\n    [\"hr\", \"croatian\"],\n    [\"bg\", \"bulgarian\"],\n    [\"lt\", \"lithuanian\"],\n    [\"la\", \"latin\"],\n    [\"mi\", \"maori\"],\n    [\"ml\", \"malayalam\"],\n    [\"cy\", \"welsh\"],\n    [\"sk\", \"slovak\"],\n    [\"te\", \"telugu\"],\n    [\"fa\", \"persian\"],\n    [\"lv\", \"latvian\"],\n    [\"bn\", \"bengali\"],\n    [\"sr\", \"serbian\"],\n    [\"az\", \"azerbaijani\"],\n    [\"sl\", \"slovenian\"],\n    [\"kn\", \"kannada\"],\n    [\"et\", \"estonian\"],\n    [\"mk\", \"macedonian\"],\n    [\"br\", \"breton\"],\n    [\"eu\", \"basque\"],\n    [\"is\", \"icelandic\"],\n    [\"hy\", \"armenian\"],\n    [\"ne\", \"nepali\"],\n    [\"mn\", \"mongolian\"],\n    [\"bs\", \"bosnian\"],\n    [\"kk\", \"kazakh\"],\n    [\"sq\", \"albanian\"],\n    [\"sw\", \"swahili\"],\n    [\"gl\", \"galician\"],\n    [\"mr\", \"marathi\"],\n    [\"pa\", \"punjabi\"],\n    [\"si\", \"sinhala\"],\n    [\"km\", \"khmer\"],\n    [\"sn\", \"shona\"],\n    [\"yo\", \"yoruba\"],\n    [\"so\", \"somali\"],\n    [\"af\", \"afrikaans\"],\n    [\"oc\", \"occitan\"],\n    [\"ka\", \"georgian\"],\n    [\"be\", \"belarusian\"],\n    [\"tg\", \"tajik\"],\n    [\"sd\", \"sindhi\"],\n    [\"gu\", \"gujarati\"],\n    [\"am\", \"amharic\"],\n    [\"yi\", \"yiddish\"],\n    [\"lo\", \"lao\"],\n    [\"uz\", \"uzbek\"],\n    [\"fo\", \"faroese\"],\n    [\"ht\", \"haitian creole\"],\n    [\"ps\", \"pashto\"],\n    [\"tk\", \"turkmen\"],\n    [\"nn\", \"nynorsk\"],\n    [\"mt\", \"maltese\"],\n    [\"sa\", \"sanskrit\"],\n    [\"lb\", \"luxembourgish\"],\n    [\"my\", \"myanmar\"],\n    [\"bo\", \"tibetan\"],\n    [\"tl\", \"tagalog\"],\n    [\"mg\", \"malagasy\"],\n    [\"as\", \"assamese\"],\n    [\"tt\", \"tatar\"],\n    [\"haw\", \"hawaiian\"],\n    [\"ln\", \"lingala\"],\n    [\"ha\", \"hausa\"],\n    [\"ba\", \"bashkir\"],\n    [\"jw\", \"javanese\"],\n    [\"su\", \"sundanese\"],\n]\n\n// @ts-ignore\nexport const WHISPER_LANGUAGE_MAPPING = new Map(WHISPER_LANGUAGES);\n// @ts-ignore\nexport const WHISPER_TO_LANGUAGE_CODE_MAPPING = new Map([\n    ...WHISPER_LANGUAGES.map(([k, v]) => [v, k]),\n    ...[\n        [\"burmese\", \"my\"],\n        [\"valencian\", \"ca\"],\n        [\"flemish\", \"nl\"],\n        [\"haitian\", \"ht\"],\n        [\"letzeburgesch\", \"lb\"],\n        [\"pushto\", \"ps\"],\n        [\"panjabi\", \"pa\"],\n        [\"moldavian\", \"ro\"],\n        [\"moldovan\", \"ro\"],\n        [\"sinhalese\", \"si\"],\n        [\"castilian\", \"es\"],\n    ]\n]);\n\n/**\n * @param {string} language The language name or code\n * @returns {string} The language code\n */\nexport function whisper_language_to_code(language) {\n    language = language.toLowerCase();\n\n    // Map to code from user-friendly name (e.g., \"english\" -> \"en\")\n    let language_code = WHISPER_TO_LANGUAGE_CODE_MAPPING.get(language);\n\n    if (language_code === undefined) {\n        // User provided something that is not a language name\n\n        // Perhaps the user passed the special token itself\n        const language_special_token = language.match(/^<\\|([a-z]{2})\\|>$/);\n        if (language_special_token) {\n            language = language_special_token[1];\n        }\n\n        if (WHISPER_LANGUAGE_MAPPING.has(language)) {\n            // User provided the language code directly (e.g., \"en\")\n            language_code = language;\n\n        } else {\n            // User provided something that is not a language code or name\n            const is_language_code = language.length === 2;\n            const langs = is_language_code ? WHISPER_LANGUAGE_MAPPING.keys() : WHISPER_LANGUAGE_MAPPING.values();\n\n            throw new Error(`Language \"${language}\" is not supported. Must be one of: ${JSON.stringify(Array.from(langs))}`);\n        }\n    }\n    return language_code;\n}\n", "\n/**\n * @file Tokenizers are used to prepare textual inputs for a model.\n * \n * **Example:** Create an `AutoTokenizer` and use it to tokenize a sentence.\n * This will automatically detect the tokenizer type based on the tokenizer class defined in `tokenizer.json`.\n * ```javascript\n * import { AutoTokenizer } from '@huggingface/transformers';\n * \n * const tokenizer = await AutoTokenizer.from_pretrained('Xenova/bert-base-uncased');\n * const { input_ids } = await tokenizer('I love transformers!');\n * // Tensor {\n * //   data: BigInt64Array(6) [101n, 1045n, 2293n, 19081n, 999n, 102n],\n * //   dims: [1, 6],\n * //   type: 'int64',\n * //   size: 6,\n * // }\n * ```\n * \n * @module tokenizers\n */\nimport {\n    Callable,\n} from './utils/generic.js';\n\nimport {\n    reverseDictionary,\n    escapeRegExp,\n    isIntegralNumber,\n    mergeArrays,\n    len,\n} from './utils/core.js';\n\nimport {\n    getModelJSON,\n} from './utils/hub.js';\n\nimport { max, min, round } from './utils/maths.js';\nimport { Tensor } from './utils/tensor.js';\n\nimport {\n    PriorityQueue,\n    TokenLattice,\n    CharTrie,\n    DictionarySplitter,\n    LRUCache,\n} from './utils/data-structures.js';\n\nimport { Template } from '@huggingface/jinja';\n\nimport {\n    WHISPER_LANGUAGE_MAPPING\n} from './models/whisper/common_whisper.js';\n\n/**\n * @typedef {Object} TokenizerProperties Additional tokenizer-specific properties.\n * @property {boolean} [legacy=false] Whether or not the `legacy` behavior of the tokenizer should be used.\n * @typedef {import('./utils/hub.js').PretrainedOptions & TokenizerProperties} PretrainedTokenizerOptions\n */\n\n/**\n * Loads a tokenizer from the specified path.\n * @param {string} pretrained_model_name_or_path The path to the tokenizer directory.\n * @param {PretrainedTokenizerOptions} options Additional options for loading the tokenizer.\n * @returns {Promise<any[]>} A promise that resolves with information about the loaded tokenizer.\n */\nasync function loadTokenizer(pretrained_model_name_or_path, options) {\n\n    const info = await Promise.all([\n        getModelJSON(pretrained_model_name_or_path, 'tokenizer.json', true, options),\n        getModelJSON(pretrained_model_name_or_path, 'tokenizer_config.json', true, options),\n    ])\n\n    // Override legacy option if `options.legacy` is not null\n    if (options.legacy !== null) {\n        info[1].legacy = options.legacy;\n    }\n    return info;\n}\n\n\n/**\n * Helper function to split a string on a regex, but keep the delimiters.\n * This is required, because the JavaScript `.split()` method does not keep the delimiters,\n * and wrapping in a capturing group causes issues with existing capturing groups (due to nesting).\n * @param {string} text The text to split.\n * @param {RegExp} regex The regex to split on.\n * @returns {string[]} The split string.\n */\nfunction regexSplit(text, regex) {\n    const result = [];\n    let prev = 0;\n    for (const match of text.matchAll(regex)) {\n        const fullMatch = match[0];\n        if (prev < match.index) {\n            result.push(text.slice(prev, match.index));\n        }\n        if (fullMatch.length > 0) {\n            result.push(fullMatch);\n        }\n        prev = match.index + fullMatch.length;\n    }\n    if (prev < text.length) {\n        result.push(text.slice(prev));\n    }\n    return result;\n}\n\n\n/**\n * Helper method to construct a pattern from a config object.\n * @param {Object} pattern The pattern object.\n * @param {boolean} invert Whether to invert the pattern.\n * @returns {RegExp|null} The compiled pattern.\n */\nfunction createPattern(pattern, invert = true) {\n\n    if (pattern.Regex !== undefined) {\n        // In certain cases, the pattern may contain unnecessary escape sequences (e.g., \\# or \\& or \\~).\n        // i.e., valid in Python (where the patterns are exported from) but invalid in JavaScript (where the patterns are parsed).\n        // This isn't an issue when creating the regex w/o the 'u' flag, but it is when the 'u' flag is used.\n        // For this reason, it is necessary to remove these backslashes before creating the regex.\n        // See https://stackoverflow.com/a/63007777/13989043 for more information\n        let regex = pattern.Regex.replace(/\\\\([#&~])/g, '$1'); // TODO: add more characters to this list if necessary\n\n        // We also handle special cases where the regex contains invalid (non-JS compatible) syntax.\n        for (const [key, value] of PROBLEMATIC_REGEX_MAP) {\n            regex = regex.replaceAll(key, value);\n        }\n\n        return new RegExp(regex, 'gu');\n\n    } else if (pattern.String !== undefined) {\n        const escaped = escapeRegExp(pattern.String);\n        // NOTE: if invert is true, we wrap the pattern in a group so that it is kept when performing .split()\n        return new RegExp(invert ? escaped : `(${escaped})`, 'gu');\n\n    } else {\n        console.warn('Unknown pattern type:', pattern)\n        return null;\n    }\n}\n\n/**\n * Helper function to convert an Object to a Map\n * @param {Object} obj The object to convert.\n * @returns {Map<string, any>} The map.\n */\nfunction objectToMap(obj) {\n    return new Map(Object.entries(obj));\n}\n\n/**\n * Helper function to convert a tensor to a list before decoding.\n * @param {Tensor} tensor The tensor to convert.\n * @returns {number[]} The tensor as a list.\n */\nfunction prepareTensorForDecode(tensor) {\n    const dims = tensor.dims;\n    switch (dims.length) {\n        case 1:\n            return tensor.tolist();\n        case 2:\n            if (dims[0] !== 1) {\n                throw new Error('Unable to decode tensor with `batch size !== 1`. Use `tokenizer.batch_decode(...)` for batched inputs.');\n            }\n            return tensor.tolist()[0];\n        default:\n            throw new Error(`Expected tensor to have 1-2 dimensions, got ${dims.length}.`)\n    }\n}\n\n/**\n * Clean up a list of simple English tokenization artifacts like spaces before punctuations and abbreviated forms\n * @param {string} text The text to clean up.\n * @returns {string} The cleaned up text.\n */\nfunction clean_up_tokenization(text) {\n    // Clean up a list of simple English tokenization artifacts\n    // like spaces before punctuations and abbreviated forms\n    return text.replace(/ \\./g, '.')\n        .replace(/ \\?/g, '?')\n        .replace(/ \\!/g, '!')\n        .replace(/ ,/g, ',')\n        .replace(/ \\' /g, \"'\")\n        .replace(/ n\\'t/g, \"n't\")\n        .replace(/ \\'m/g, \"'m\")\n        .replace(/ \\'s/g, \"'s\")\n        .replace(/ \\'ve/g, \"'ve\")\n        .replace(/ \\'re/g, \"'re\");\n}\n\n/**\n * Helper function to remove accents from a string.\n * @param {string} text The text to remove accents from.\n * @returns {string} The text with accents removed.\n */\nfunction remove_accents(text) {\n    return text.replace(/\\p{M}/gu, '');\n}\n\n/**\n * Helper function to lowercase a string and remove accents.\n * @param {string} text The text to lowercase and remove accents from.\n * @returns {string} The lowercased text with accents removed.\n */\nfunction lowercase_and_remove_accent(text) {\n    return remove_accents(text.toLowerCase());\n}\n\n\n/**\n * Checks whether the given Unicode codepoint represents a CJK (Chinese, Japanese, or Korean) character.\n *\n * A \"chinese character\" is defined as anything in the CJK Unicode block:\n * https://en.wikipedia.org/wiki/CJK_Unified_Ideographs_(Unicode_block)\n *\n * Note that the CJK Unicode block is NOT all Japanese and Korean characters, despite its name.\n * The modern Korean Hangul alphabet is a different block, as is Japanese Hiragana and Katakana.\n * Those alphabets are used to write space-separated words, so they are not treated specially\n * and are handled like all other languages.\n *\n * @param {number|bigint} cp The Unicode codepoint to check.\n * @returns {boolean} True if the codepoint represents a CJK character, false otherwise.\n */\nexport function is_chinese_char(cp) {\n    return (\n        (cp >= 0x4E00 && cp <= 0x9FFF)\n        || (cp >= 0x3400 && cp <= 0x4DBF)\n        || (cp >= 0x20000 && cp <= 0x2A6DF)\n        || (cp >= 0x2A700 && cp <= 0x2B73F)\n        || (cp >= 0x2B740 && cp <= 0x2B81F)\n        || (cp >= 0x2B820 && cp <= 0x2CEAF)\n        || (cp >= 0xF900 && cp <= 0xFAFF)\n        || (cp >= 0x2F800 && cp <= 0x2FA1F)\n    )\n}\n\n/**\n * Helper function to fuse consecutive unknown tokens.\n * @param {string[]} arr The list of input tokens\n * @param {Map<string, any>} tokens_to_ids The mapping from tokens to token ids.\n * @param {number} unk_token_id The value to fuse on.\n * @private\n */\nfunction fuse_unk(arr, tokens_to_ids, unk_token_id) {\n    const fused = [];\n    let i = 0;\n    while (i < arr.length) {\n        fused.push(arr[i])\n        if ((tokens_to_ids.get(arr[i]) ?? unk_token_id) !== unk_token_id) {\n            ++i;\n            continue;\n        }\n\n        while (++i < arr.length && (tokens_to_ids.get(arr[i]) ?? unk_token_id) === unk_token_id) {\n            if (tokens_to_ids.get(fused.at(-1)) !== unk_token_id) {\n                fused[fused.length - 1] += arr[i];\n            }\n        }\n    }\n\n    return fused;\n}\n\n/**\n * Split a string on whitespace.\n * @param {string} text The text to split.\n * @returns {string[]} The split string.\n */\nfunction whitespace_split(text) {\n    return text.match(/\\S+/g) || [];\n}\n\nconst PUNCTUATION_REGEX = '\\\\p{P}\\\\u0021-\\\\u002F\\\\u003A-\\\\u0040\\\\u005B-\\\\u0060\\\\u007B-\\\\u007E';\nconst PUNCTUATION_ONLY_REGEX = new RegExp(`^[${PUNCTUATION_REGEX}]+$`, 'gu');\nconst BLOOM_SPLIT_CHARS = '.,!?\\u2026\\u3002\\uff0c\\u3001\\u0964\\u06d4\\u060c';\n\n// A mapping of regex patterns to their equivalent (but possibly longer) JS-compatible versions.\nconst PROBLEMATIC_REGEX_MAP = new Map([\n    // These use the case insensitive group modifier, which is not supported in JavaScript.\n    // When parsing the regex, an \"Invalid group\" error is thrown.\n    [\"(?i:'s|'t|'re|'ve|'m|'ll|'d)\", \"(?:'([sS]|[tT]|[rR][eE]|[vV][eE]|[mM]|[lL][lL]|[dD]))\"],\n    [\"(?i:[sdmt]|ll|ve|re)\", \"(?:[sS]|[dD]|[mM]|[tT]|[lL][lL]|[vV][eE]|[rR][eE])\"],\n\n    // JS doesn't support possessive quantifiers (these are used in recent OpenAI tokenizers).\n    [\"[^\\\\r\\\\n\\\\p{L}\\\\p{N}]?+\", \"[^\\\\r\\\\n\\\\p{L}\\\\p{N}]?\"],\n    [\"[^\\\\s\\\\p{L}\\\\p{N}]++\", \"[^\\\\s\\\\p{L}\\\\p{N}]+\"],\n\n    // Used to override the default (invalid) regex of the bloom pretokenizer.\n    // For more information, see https://github.com/huggingface/transformers.js/issues/94\n    [` ?[^(\\\\s|[${BLOOM_SPLIT_CHARS}])]+`, ` ?[^\\\\s${BLOOM_SPLIT_CHARS}]+`],\n])\n\n\n/**\n * Represent a token added by the user on top of the existing Model vocabulary.\n * AddedToken can be configured to specify the behavior they should have in various situations like:\n *   - Whether they should only match single words\n *   - Whether to include any whitespace on its left or right\n */\nclass AddedToken {\n    /**\n     * Creates a new instance of AddedToken.\n     * @param {Object} config Added token configuration object.\n     * @param {string} config.content The content of the added token.\n     * @param {number} config.id The id of the added token.\n     * @param {boolean} [config.single_word=false] Whether this token must be a single word or can break words.\n     * @param {boolean} [config.lstrip=false] Whether this token should strip whitespaces on its left.\n     * @param {boolean} [config.rstrip=false] Whether this token should strip whitespaces on its right.\n     * @param {boolean} [config.normalized=false] Whether this token should be normalized.\n     * @param {boolean} [config.special=false] Whether this token is special.\n     */\n    constructor(config) {\n        this.content = config.content;\n        this.id = config.id;\n        this.single_word = config.single_word ?? false;\n        this.lstrip = config.lstrip ?? false;\n        this.rstrip = config.rstrip ?? false;\n        this.special = config.special ?? false;\n        this.normalized = config.normalized ?? null;\n    }\n}\n\n/**\n * Abstract base class for tokenizer models.\n *\n * @extends Callable\n */\nexport class TokenizerModel extends Callable {\n    /**\n     * Creates a new instance of TokenizerModel.\n     * @param {Object} config The configuration object for the TokenizerModel.\n     */\n    constructor(config) {\n        super();\n        this.config = config;\n\n        /** @type {string[]} */\n        this.vocab = [];\n\n        /**\n         * A mapping of tokens to ids.\n         * @type {Map<string, number>}\n         */\n        this.tokens_to_ids = new Map();\n\n        this.unk_token_id = undefined;\n        this.unk_token = undefined;\n        this.end_of_word_suffix = undefined;\n\n        /** @type {boolean} Whether to fuse unknown tokens when encoding. Defaults to false. */\n        this.fuse_unk = this.config.fuse_unk ?? false;\n    }\n\n    /**\n     * Instantiates a new TokenizerModel instance based on the configuration object provided.\n     * @param {Object} config The configuration object for the TokenizerModel.\n     * @param {...*} args Optional arguments to pass to the specific TokenizerModel constructor.\n     * @returns {TokenizerModel} A new instance of a TokenizerModel.\n     * @throws Will throw an error if the TokenizerModel type in the config is not recognized.\n     */\n    static fromConfig(config, ...args) {\n        switch (config.type) {\n            case 'WordPiece':\n                return new WordPieceTokenizer(config);\n            case 'Unigram':\n                // @ts-ignore\n                return new Unigram(config, ...args);\n            case 'BPE':\n                return new BPE(config);\n\n            default:\n                // Some older tokenizers, like `google-t5/t5-small`, `openai-community/gpt2`, and `distilbert/distilbert-base-uncased`, do not have a `type` field.\n                // In this case, we can infer the tokenizer type based on the structure of the `vocab` field and other properties.\n                if (config.vocab) {\n                    if (Array.isArray(config.vocab)) {\n                        // config.vocab is of type `[string, number][]`\n                        // @ts-ignore\n                        return new Unigram(config, ...args);\n                    } else if (Object.hasOwn(config, 'continuing_subword_prefix') && Object.hasOwn(config, 'unk_token')) {\n                        if (Object.hasOwn(config, 'merges')) {\n                            return new BPE(config);\n                        } else {\n                            return new WordPieceTokenizer(config);\n                        }\n                    } else {\n                        // @ts-ignore\n                        return new LegacyTokenizerModel(config, ...args);\n                    }\n                }\n                throw new Error(`Unknown TokenizerModel type: ${config.type}`);\n        }\n    }\n\n    /**\n     * Internal function to call the TokenizerModel instance.\n     * @param {string[]} tokens The tokens to encode.\n     * @returns {string[]} The encoded tokens.\n     */\n    _call(tokens) {\n        tokens = this.encode(tokens);\n        if (this.fuse_unk) {\n            // Fuse unknown tokens\n            tokens = fuse_unk(tokens, this.tokens_to_ids, this.unk_token_id);\n        }\n        return tokens;\n    }\n\n    /**\n     * Encodes a list of tokens into a list of token IDs.\n     * @param {string[]} tokens The tokens to encode.\n     * @returns {string[]} The encoded tokens.\n     * @throws Will throw an error if not implemented in a subclass.\n     */\n    encode(tokens) {\n        throw Error(\"encode should be implemented in subclass.\")\n    }\n\n    /**\n     * Converts a list of tokens into a list of token IDs.\n     * @param {string[]} tokens The tokens to convert.\n     * @returns {number[]} The converted token IDs.\n     */\n    convert_tokens_to_ids(tokens) {\n        return tokens.map(t => this.tokens_to_ids.get(t) ?? this.unk_token_id);\n    }\n\n    /**\n     * Converts a list of token IDs into a list of tokens.\n     * @param {number[]|bigint[]} ids The token IDs to convert.\n     * @returns {string[]} The converted tokens.\n     */\n    convert_ids_to_tokens(ids) {\n        return ids.map(i => this.vocab[i] ?? this.unk_token);\n    }\n}\n\n/**\n * A subclass of TokenizerModel that uses WordPiece encoding to encode tokens.\n * @extends TokenizerModel\n */\nclass WordPieceTokenizer extends TokenizerModel {\n    /**\n     * @param {Object} config The configuration object.\n     * @param {Object} config.vocab A mapping of tokens to ids.\n     * @param {string} config.unk_token The unknown token string.\n     * @param {string} config.continuing_subword_prefix The prefix to use for continuing subwords.\n     * @param {number} [config.max_input_chars_per_word=100] The maximum number of characters per word.\n     */\n    constructor(config) {\n        super(config);\n        /**\n         * A mapping of tokens to ids.\n         * @type {Map<string, number>}\n         */\n        this.tokens_to_ids = objectToMap(config.vocab);\n\n        /**\n         * The id of the unknown token.\n         * @type {number}\n         */\n        this.unk_token_id = this.tokens_to_ids.get(config.unk_token);\n\n        /**\n         * The unknown token string.\n         * @type {string}\n         */\n        this.unk_token = config.unk_token;\n\n        /**\n         * The maximum number of characters allowed per word.\n         * @type {number}\n         */\n        this.max_input_chars_per_word = config.max_input_chars_per_word ?? 100;\n\n        /**\n         * An array of tokens.\n         * @type {string[]}\n         */\n        this.vocab = new Array(this.tokens_to_ids.size);\n        for (const [key, value] of this.tokens_to_ids) {\n            this.vocab[value] = key;\n        }\n    }\n\n    /**\n     * Encodes an array of tokens using WordPiece encoding.\n     * @param {string[]} tokens The tokens to encode.\n     * @returns {string[]} An array of encoded tokens.\n     */\n    encode(tokens) {\n        const outputTokens = [];\n        for (const token of tokens) {\n            const chars = [...token];\n            if (chars.length > this.max_input_chars_per_word) {\n                outputTokens.push(this.unk_token);\n                continue;\n            }\n\n            let isUnknown = false;\n            let start = 0;\n            const subTokens = [];\n\n            while (start < chars.length) {\n                let end = chars.length;\n                let currentSubstring = null;\n                while (start < end) {\n                    let substr = chars.slice(start, end).join('');\n\n                    if (start > 0) {\n                        substr = this.config.continuing_subword_prefix + substr;\n                    }\n                    if (this.tokens_to_ids.has(substr)) {\n                        currentSubstring = substr;\n                        break;\n                    }\n\n                    --end;\n                }\n                if (currentSubstring === null) {\n                    isUnknown = true;\n                    break;\n                }\n                subTokens.push(currentSubstring);\n                start = end;\n            }\n            if (isUnknown) {\n                outputTokens.push(this.unk_token);\n            } else {\n                outputTokens.push(...subTokens);\n            }\n        }\n\n        return outputTokens;\n    }\n\n}\n\n/**\n * Class representing a Unigram tokenizer model.\n * @extends TokenizerModel\n */\nclass Unigram extends TokenizerModel {\n    /**\n     * Create a new Unigram tokenizer model.\n     * @param {Object} config The configuration object for the Unigram model.\n     * @param {number} config.unk_id The ID of the unknown token\n     * @param {[string, number][]} config.vocab A 2D array representing a mapping of tokens to scores.\n     * @param {Object} moreConfig Additional configuration object for the Unigram model.\n     */\n    constructor(config, moreConfig) {\n        super(config);\n\n        const vocabSize = config.vocab.length;\n        this.vocab = new Array(vocabSize);\n        /** @type {number[]} */\n        this.scores = new Array(vocabSize);\n        for (let i = 0; i < vocabSize; ++i) {\n            [this.vocab[i], this.scores[i]] = config.vocab[i];\n        }\n\n        this.unk_token_id = config.unk_id;\n        this.unk_token = this.vocab[config.unk_id];\n\n        this.tokens_to_ids = new Map(this.vocab.map((x, i) => [x, i]));\n        this.bos_token = ' '; // beginning of a sentence token\n\n        this.bos_token_id = this.tokens_to_ids.get(this.bos_token); // NOTE: may be undefined\n        this.eos_token = moreConfig.eos_token;\n\n        this.eos_token_id = this.tokens_to_ids.get(this.eos_token);\n        this.unk_token = this.vocab[this.unk_token_id];\n\n        this.minScore = min(this.scores)[0];\n\n        this.unk_score = this.minScore - 10.0;\n        this.scores[this.unk_token_id] = this.unk_score;\n\n        this.trie = new CharTrie();\n        this.trie.extend(this.vocab);\n\n        // NOTE: `fuse_unk` is hardcoded to true for Unigram models\n        // See: https://github.com/huggingface/tokenizers/blob/b58227c7f1ccf8b73ee2268354336da56d91e492/tokenizers/src/models/unigram/model.rs#L119\n        this.fuse_unk = true;\n    }\n\n    /**\n     * Populates lattice nodes.\n     * @param {TokenLattice} lattice The token lattice to populate with nodes.\n     */\n    populateNodes(lattice) {\n        const chars = lattice.chars;\n        const mblen = 1;\n        let beginPos = 0;\n        while (beginPos < chars.length) {\n            let hasSingleNode = false;\n\n            const tokens = [];\n            const sliced = chars.slice(beginPos).join('');\n            const prefixedTokens = this.trie.commonPrefixSearch(sliced);\n            for (const token of prefixedTokens) {\n                tokens.push(token);\n                const tokenId = this.tokens_to_ids.get(token);\n                const tokenScore = this.scores[tokenId];\n                const n = len(token);\n                lattice.insert(beginPos, n, tokenScore, tokenId);\n                if (!hasSingleNode && n === mblen) {\n                    hasSingleNode = true;\n                }\n            }\n            if (!hasSingleNode) {\n                lattice.insert(beginPos, mblen, this.unk_score, this.unk_token_id);\n            }\n            beginPos += mblen;\n        }\n    }\n\n    /**\n     * Encodes an array of tokens into an array of subtokens using the unigram model.\n     *\n     * @param {string} normalized The normalized string.\n     * @returns {string[]} An array of subtokens obtained by encoding the input tokens using the unigram model.\n     */\n    tokenize(normalized) {\n        const lattice = new TokenLattice(normalized, this.bos_token_id, this.eos_token_id);\n        this.populateNodes(lattice);\n        return lattice.tokens();\n    }\n\n    /**\n     * Encodes an array of tokens using Unigram encoding.\n     * @param {string[]} tokens The tokens to encode.\n     * @returns {string[]} An array of encoded tokens.\n     */\n    encode(tokens) {\n        const toReturn = [];\n        for (const token of tokens) {\n            const tokenized = this.tokenize(token);\n            toReturn.push(...tokenized);\n        }\n        return toReturn;\n    }\n\n}\n\n/**\n * Returns list of utf-8 byte and a mapping to unicode strings.\n * Specifically avoids mapping to whitespace/control characters the BPE code barfs on.\n * @returns {Object} Object with utf-8 byte keys and unicode string values.\n */\nconst BYTES_TO_UNICODE = (() => {\n    // Returns list of utf-8 byte and a mapping to unicode strings.\n    // We specifically avoids mapping to whitespace/control characters\n    // the bpe code barfs on.\n\n    const bs = [\n        ...Array.from({ length: \"~\".charCodeAt(0) - \"!\".charCodeAt(0) + 1 }, (_, i) => i + \"!\".charCodeAt(0)),\n        ...Array.from({ length: \"\u00AC\".charCodeAt(0) - \"\u00A1\".charCodeAt(0) + 1 }, (_, i) => i + \"\u00A1\".charCodeAt(0)),\n        ...Array.from({ length: \"\u00FF\".charCodeAt(0) - \"\u00AE\".charCodeAt(0) + 1 }, (_, i) => i + \"\u00AE\".charCodeAt(0)),\n    ];\n    const cs = bs.slice();\n    let n = 0;\n    for (let b = 0; b < 256; ++b) {\n        if (!bs.includes(b)) {\n            bs.push(b);\n            cs.push(256 + n);\n            n += 1;\n        }\n    }\n    const ccs = cs.map(n => String.fromCharCode(n));\n    return Object.fromEntries(bs.map((b, i) => [b, ccs[i]]));\n})();\n\nconst UNICODE_TO_BYTES = reverseDictionary(BYTES_TO_UNICODE);\n\n\n/**\n * @typedef {Object} BPENode\n * @property {string} token The token associated with the node\n * @property {number} bias A positional bias for the node.\n * @property {number} [score] The score of the node.\n * @property {BPENode} [prev] The previous node in the linked list.\n * @property {BPENode} [next] The next node in the linked list.\n */\n\n/**\n * BPE class for encoding text into Byte-Pair-Encoding (BPE) tokens.\n * @extends TokenizerModel\n */\nclass BPE extends TokenizerModel {\n    /**\n     * Create a BPE instance.\n     * @param {Object} config The configuration object for BPE.\n     * @param {Object} config.vocab A mapping of tokens to ids.\n     * @param {string[]|[string, string][]} config.merges An array of BPE merges as strings.\n     * @param {string} config.unk_token The unknown token used for out of vocabulary words.\n     * @param {string} config.end_of_word_suffix The suffix to place at the end of each word.\n     * @param {string} [config.continuing_subword_suffix] The suffix to insert between words.\n     * @param {boolean} [config.byte_fallback=false] Whether to use spm byte-fallback trick (defaults to False)\n     * @param {boolean} [config.ignore_merges=false] Whether or not to match tokens with the vocab before using merges.\n     */\n    constructor(config) {\n        super(config);\n\n        /** @type {Map<string, number>} */\n        this.tokens_to_ids = objectToMap(config.vocab);\n\n        this.unk_token_id = this.tokens_to_ids.get(config.unk_token);\n        this.unk_token = config.unk_token;\n\n        this.vocab = new Array(this.tokens_to_ids.size);\n        for (const [key, value] of this.tokens_to_ids) {\n            this.vocab[value] = key;\n        }\n\n        // Tokenizers >= 0.20.0 serializes BPE merges as a [string, string][] instead of a string[],\n        // which resolves the ambiguity for merges containing spaces.\n        const use_new_merge_format = Array.isArray(config.merges[0]);\n\n        /** @type {[string, string][]} */\n        this.merges = use_new_merge_format\n            ? /** @type {[string, string][]} */(config.merges)\n            : (/** @type {string[]} */(config.merges)).map(x => /** @type {[string, string]} */(x.split(' ', 2)));\n        this.bpe_ranks = new Map(this.merges.map((x, i) => [JSON.stringify(x), i]));\n\n        this.end_of_word_suffix = config.end_of_word_suffix;\n\n        // NOTE: `continuing_subword_suffix` is custom (to support `BlenderbotSmallTokenizer`)\n        this.continuing_subword_suffix = config.continuing_subword_suffix ?? null;\n\n        this.byte_fallback = this.config.byte_fallback ?? false;\n\n        if (this.byte_fallback) {\n            this.text_encoder = new TextEncoder();\n        }\n\n        this.ignore_merges = this.config.ignore_merges ?? false;\n\n        /**\n         * The maximum length we should cache in a model.\n         * Strings that are too long have minimal chances to cache hit anyway\n         */\n        this.max_length_to_cache = 256;\n\n        /**\n         * The default capacity for a `BPE`'s internal cache.\n         */\n        this.cache_capacity = 10000;\n        this.cache = new LRUCache(this.cache_capacity);\n    }\n\n    /**\n     * Clears the cache.\n     */\n    clear_cache() {\n        this.cache.clear();\n    }\n\n    /**\n     * Apply Byte-Pair-Encoding (BPE) to a given token. Efficient heap-based priority\n     * queue implementation adapted from https://github.com/belladoreai/llama-tokenizer-js.\n     * @param {string} token The token to encode.\n     * @returns {string[]} The BPE encoded tokens.\n     */\n    bpe(token) {\n        if (token.length === 0) {\n            return [];\n        }\n\n        const cached = this.cache.get(token);\n        if (cached !== undefined) {\n            return cached;\n        }\n\n        const word = Array.from(token);\n        if (this.end_of_word_suffix) {\n            word[word.length - 1] += this.end_of_word_suffix;\n        }\n\n        let result = [];\n        if (word.length > 1) {\n            // Create a priority queue to store the nodes that will be merged.\n            // The comparator function compares the scores of the nodes.\n            const queue = new PriorityQueue((a, b) => a.score < b.score);\n\n            // Construct a doubly-linked list of nodes that will be inserted into the priority queue,\n            // starting with the individual characters. We also populate each node with a positional\n            // bias to break ties in the priority queue.\n            let startingNode = {\n                token: word[0],\n                bias: 0,\n                prev: null,\n                next: null,\n            }\n\n            let previousNode = startingNode\n            for (let i = 1; i < word.length; ++i) {\n                const currentNode = {\n                    bias: i / word.length, // Add fractional component to break ties\n                    token: word[i],\n                    prev: previousNode,\n                    next: null,\n                }\n                previousNode.next = currentNode\n                this._add_node(queue, previousNode)\n                previousNode = currentNode\n            }\n\n            while (!queue.isEmpty()) {\n                // Get the next node with the highest priority\n                const node = queue.pop();\n\n                // Check that this merge is still possible\n                if (node.deleted || !node.next || node.next.deleted) continue;\n\n                // Here, we mark the current node (left side of the merge) and the next node (right side of the merge) as deleted.\n                // This is because they will both be replaced by a new node representing the merge result.\n                node.deleted = true;\n                node.next.deleted = true;\n\n                // Next, we fix the node that comes before the current node (i.e., left side of the merge).\n                if (node.prev) {\n\n                    // Make a shallow copy of the previous node\n                    const newPreviousNode = { ...node.prev };\n\n                    // Mark the old previous node as deleted. This avoids erroneous merges later,\n                    // because there may still be references to this node in the priority queue.\n                    node.prev.deleted = true;\n                    node.prev = newPreviousNode;\n\n                    // Update the reference of the previous node, by pointing its previous node to this new previous node.\n                    if (newPreviousNode.prev) {\n                        newPreviousNode.prev.next = newPreviousNode;\n                    } else {\n                        // If the previous of the previous node does not exist, it means that\n                        // `newPreviousNode` must be the new `startingNode`.\n                        startingNode = newPreviousNode;\n                    }\n                }\n\n                // Create a new node which represents the result of the merge.\n                const merged = {\n                    token: node.token + node.next.token,\n                    bias: node.bias,\n                    prev: node.prev,\n                    next: node.next.next,\n                }\n\n                // We now consider where we can add the new merged node to the priority queue:\n                // 1. prev <-> merged\n                if (merged.prev) {\n                    merged.prev.next = merged;\n                    this._add_node(queue, merged.prev);\n                } else {\n                    // If `merged.prev` does not exist, then `merged` must be the new `startingNode`.\n                    startingNode = merged;\n                }\n\n                // 2. merged <-> next\n                if (merged.next) {\n                    merged.next.prev = merged;\n                    this._add_node(queue, merged);\n                }\n            }\n\n            // Traverse the linked list, starting from the `startingNode`, and collect the tokens.\n            for (let currentNode = startingNode; currentNode !== null; currentNode = currentNode.next) {\n                result.push(currentNode.token);\n            }\n        } else {\n            result = word;\n        }\n\n        // Possibly append suffix\n        if (this.continuing_subword_suffix) {\n            // Do not append suffix to the last token\n            for (let i = 0; i < result.length - 1; ++i) {\n                result[i] += this.continuing_subword_suffix;\n            }\n        }\n\n        if (token.length < this.max_length_to_cache) {\n            // Save the result to the cache\n            this.cache.put(token, result);\n        }\n\n        return result;\n    }\n\n\n    /**\n     * Helper function to add a node to the priority queue.\n     * @param {PriorityQueue} queue \n     * @param {BPENode} node\n     * @private\n     */\n    _add_node(queue, node) {\n        // `score` is a measure of the merge priority: lower means higher priority\n        // We use the BPE rank as a measure of priority (i.e., the local of the merge in the merges list)\n        // We also add a fractional component to the score to break ties (with the earlier character having higher priority)\n        const rank = this.bpe_ranks.get(JSON.stringify([node.token, node.next.token]));\n        if (rank !== undefined) {\n            node.score = rank + node.bias;\n            queue.push(node);\n        }\n    }\n\n    /**\n     * Encodes the input sequence of tokens using the BPE algorithm and returns the resulting subword tokens.\n     * @param {string[]} tokens The input sequence of tokens to encode.\n     * @returns {string[]} The resulting subword tokens after applying the BPE algorithm to the input sequence of tokens.\n     */\n    encode(tokens) {\n        const outputTokens = [];\n\n        for (const token of tokens) {\n            if (this.ignore_merges && this.tokens_to_ids.has(token)) {\n                outputTokens.push(token);\n                continue;\n            }\n            const bpe_token_list = this.bpe(token);\n\n            for (const t of bpe_token_list) {\n                if (this.tokens_to_ids.has(t)) {\n                    outputTokens.push(t);\n                } else if (this.byte_fallback) {\n                    const byteTokens = Array.from(this.text_encoder.encode(t))\n                        .map(x => `<0x${x.toString(16).toUpperCase().padStart(2, '0')}>`);\n                    if (byteTokens.every(x => this.tokens_to_ids.has(x))) {\n                        // Ensure the byte tokens are actually in the vocabulary, otherwise\n                        // we fall back to the unknown token. For more information, see\n                        // https://github.com/huggingface/transformers/issues/28096.\n                        outputTokens.push(...byteTokens);\n                    } else {\n                        outputTokens.push(this.unk_token);\n                    }\n                } else {\n                    outputTokens.push(this.unk_token);\n                }\n            }\n        }\n\n        return outputTokens;\n    }\n\n}\n\n/**\n * Legacy tokenizer class for tokenizers with only a vocabulary.\n */\nclass LegacyTokenizerModel extends TokenizerModel {\n    /**\n     * Create a LegacyTokenizerModel instance.\n     * @param {Object} config The configuration object for LegacyTokenizerModel.\n     * @param {Object} config.vocab A (possibly nested) mapping of tokens to ids.\n     * @param {Object} moreConfig Additional configuration object for the LegacyTokenizerModel model.\n     */\n    constructor(config, moreConfig) {\n        super(config);\n\n        /**@type {Map<string, number>} */\n        this.tokens_to_ids = objectToMap(\n            moreConfig.target_lang\n                ? config.vocab[moreConfig.target_lang]\n                : config.vocab\n        );\n\n        this.bos_token = moreConfig.bos_token;\n        this.bos_token_id = this.tokens_to_ids.get(this.bos_token);\n\n        this.eos_token = moreConfig.eos_token;\n        this.eos_token_id = this.tokens_to_ids.get(this.eos_token);\n\n        this.pad_token = moreConfig.pad_token;\n        this.pad_token_id = this.tokens_to_ids.get(this.pad_token);\n\n        this.unk_token = moreConfig.unk_token;\n        this.unk_token_id = this.tokens_to_ids.get(this.unk_token);\n\n        this.vocab = new Array(this.tokens_to_ids.size);\n        for (const [key, value] of this.tokens_to_ids) {\n            this.vocab[value] = key;\n        }\n    }\n\n    encode(tokens) {\n        return tokens;\n    }\n}\n\n\n/**\n * A base class for text normalization.\n * @abstract\n */\nclass Normalizer extends Callable {\n    /**\n     * @param {Object} config The configuration object for the normalizer.\n     */\n    constructor(config) {\n        super();\n        this.config = config;\n    }\n\n    /**\n     * Factory method for creating normalizers from config objects.\n     * @static\n     * @param {Object} config The configuration object for the normalizer.\n     * @returns {Normalizer} A Normalizer object.\n     * @throws {Error} If an unknown Normalizer type is specified in the config.\n     */\n    static fromConfig(config) {\n        if (config === null) return null;\n        switch (config.type) {\n            case 'BertNormalizer':\n                return new BertNormalizer(config);\n            case 'Precompiled':\n                return new Precompiled(config);\n            case 'Sequence':\n                return new NormalizerSequence(config);\n            case 'Replace':\n                return new Replace(config);\n            case 'NFC':\n                return new NFC(config);\n            case 'NFD':\n                return new NFD(config);\n            case 'NFKC':\n                return new NFKC(config);\n            case 'NFKD':\n                return new NFKD(config);\n            case 'Strip':\n                return new StripNormalizer(config);\n            case 'StripAccents':\n                return new StripAccents(config);\n            case 'Lowercase':\n                return new Lowercase(config);\n            case 'Prepend':\n                return new Prepend(config);\n            default:\n                throw new Error(`Unknown Normalizer type: ${config.type}`);\n        }\n    }\n\n    /**\n     * Normalize the input text.\n     * @abstract\n     * @param {string} text The text to normalize.\n     * @returns {string} The normalized text.\n     * @throws {Error} If this method is not implemented in a subclass.\n     */\n    normalize(text) {\n        throw Error(\"normalize should be implemented in subclass.\")\n    }\n\n    /**\n     * Alias for {@link Normalizer#normalize}.\n     * @param {string} text The text to normalize.\n     * @returns {string} The normalized text.\n     */\n    _call(text) {\n        return this.normalize(text);\n    }\n\n}\n\n/**\n * Replace normalizer that replaces occurrences of a pattern with a given string or regular expression.\n * @extends Normalizer\n */\nclass Replace extends Normalizer {\n    /**\n     * Normalize the input text by replacing the pattern with the content.\n     * @param {string} text The input text to be normalized.\n     * @returns {string} The normalized text after replacing the pattern with the content.\n     */\n    normalize(text) {\n        const pattern = createPattern(this.config.pattern);\n        return pattern === null\n            ? text\n            : text.replaceAll(pattern, this.config.content);\n    }\n}\n\n/**\n * A normalizer that applies Unicode normalization to the input text.\n * @extends Normalizer\n * @abstract\n */\nclass UnicodeNormalizer extends Normalizer {\n    /**\n     * @type {string} The Unicode normalization form to apply.\n     * Should be one of: 'NFC', 'NFD', 'NFKC', or 'NFKD'.\n     */\n    form = undefined;\n\n    /**\n     * Normalize the input text by applying Unicode normalization.\n     * @param {string} text The input text to be normalized.\n     * @returns {string} The normalized text.\n     */\n    normalize(text) {\n        text = text.normalize(this.form)\n        return text;\n    }\n}\n\n/**\n * A normalizer that applies Unicode normalization form C (NFC) to the input text.\n * Canonical Decomposition, followed by Canonical Composition.\n * @extends UnicodeNormalizer\n */\nclass NFC extends UnicodeNormalizer {\n    form = 'NFC';\n}\n\n/**\n * A normalizer that applies Unicode normalization form D (NFD) to the input text.\n * Canonical Decomposition.\n * @extends UnicodeNormalizer\n */\nclass NFD extends UnicodeNormalizer {\n    form = 'NFD';\n}\n\n/**\n * A normalizer that applies Unicode normalization form KC (NFKC) to the input text.\n * Compatibility Decomposition, followed by Canonical Composition.\n * @extends UnicodeNormalizer\n */\nclass NFKC extends UnicodeNormalizer {\n    form = 'NFKC';\n}\n\n/**\n * A normalizer that applies Unicode normalization form KD (NFKD) to the input text.\n * Compatibility Decomposition.\n * @extends UnicodeNormalizer\n */\nclass NFKD extends UnicodeNormalizer {\n    form = 'NFKD';\n}\n\n/**\n * A normalizer that strips leading and/or trailing whitespace from the input text.\n */\nclass StripNormalizer extends Normalizer {\n    /**\n     * Strip leading and/or trailing whitespace from the input text.\n     * @param {string} text The input text.\n     * @returns {string} The normalized text.\n     */\n    normalize(text) {\n        if (this.config.strip_left && this.config.strip_right) {\n            // Fast path to avoid an extra trim call\n            text = text.trim();\n        } else {\n            if (this.config.strip_left) {\n                text = text.trimStart();\n            }\n            if (this.config.strip_right) {\n                text = text.trimEnd();\n            }\n        }\n        return text;\n    }\n}\n\n/**\n * StripAccents normalizer removes all accents from the text.\n * @extends Normalizer\n */\nclass StripAccents extends Normalizer {\n    /**\n     * Remove all accents from the text.\n     * @param {string} text The input text.\n     * @returns {string} The normalized text without accents.\n     */\n    normalize(text) {\n        text = remove_accents(text);\n        return text;\n    }\n}\n\n/**\n * A Normalizer that lowercases the input string.\n * @extends Normalizer\n */\nclass Lowercase extends Normalizer {\n    /**\n     * Lowercases the input string.\n     * @param {string} text The text to normalize.\n     * @returns {string} The normalized text.\n     */\n    normalize(text) {\n        text = text.toLowerCase();\n        return text;\n    }\n}\n\n/**\n * A Normalizer that prepends a string to the input string.\n * @extends Normalizer\n */\nclass Prepend extends Normalizer {\n    /**\n     * Prepends the input string.\n     * @param {string} text The text to normalize.\n     * @returns {string} The normalized text.\n     */\n    normalize(text) {\n        text = this.config.prepend + text;\n        return text;\n    }\n}\n\n/**\n * A Normalizer that applies a sequence of Normalizers.\n * @extends Normalizer\n */\nclass NormalizerSequence extends Normalizer {\n    /**\n   * Create a new instance of NormalizerSequence.\n   * @param {Object} config The configuration object.\n   * @param {Object[]} config.normalizers An array of Normalizer configuration objects.\n   */\n    constructor(config) {\n        super(config);\n        this.normalizers = config.normalizers.map(x => Normalizer.fromConfig(x));\n    }\n    /**\n    * Apply a sequence of Normalizers to the input text.\n    * @param {string} text The text to normalize.\n    * @returns {string} The normalized text.\n    */\n    normalize(text) {\n        return this.normalizers.reduce((t, normalizer) => {\n            return normalizer.normalize(t);\n        }, text);\n    }\n}\n\n/**\n * A class representing a normalizer used in BERT tokenization.\n * @extends Normalizer\n */\nclass BertNormalizer extends Normalizer {\n    /**\n     * Adds whitespace around any CJK (Chinese, Japanese, or Korean) character in the input text.\n     *\n     * @param {string} text The input text to tokenize.\n     * @returns {string} The tokenized text with whitespace added around CJK characters.\n     */\n    _tokenize_chinese_chars(text) {\n        /* Adds whitespace around any CJK character. */\n        const output = [];\n        for (let i = 0; i < text.length; ++i) {\n            const char = text[i];\n            const cp = char.charCodeAt(0);\n            if (is_chinese_char(cp)) {\n                output.push(\" \");\n                output.push(char);\n                output.push(\" \");\n            } else {\n                output.push(char);\n            }\n        }\n        return output.join(\"\");\n    }\n\n    /**\n     * Strips accents from the given text.\n     * @param {string} text The text to strip accents from.\n     * @returns {string} The text with accents removed.\n     */\n    stripAccents(text) {\n        // \"Mark, Nonspacing\" (Mn)\n        return text.normalize('NFD').replace(/\\p{Mn}/gu, '');\n    }\n\n\n    /**\n     * Checks whether `char` is a control character.\n     * @param {string} char The character to check.\n     * @returns {boolean} Whether `char` is a control character.\n     * @private\n     */\n    _is_control(char) {\n        switch (char) {\n            case '\\t':\n            case '\\n':\n            case '\\r':\n                // These are technically control characters but we count them as whitespace characters.\n                return false;\n\n            default:\n                // Check if unicode category starts with C:\n                // Cc - Control\n                // Cf - Format\n                // Co - Private Use\n                // Cs - Surrogate\n                return /^\\p{Cc}|\\p{Cf}|\\p{Co}|\\p{Cs}$/u.test(char);\n        }\n    }\n\n    /**\n     * Performs invalid character removal and whitespace cleanup on text.\n     * @param {string} text The text to clean.\n     * @returns {string} The cleaned text.\n     * @private\n     */\n    _clean_text(text) {\n        const output = [];\n        for (const char of text) {\n            const cp = char.charCodeAt(0);\n            if (cp === 0 || cp === 0xFFFD || this._is_control(char)) {\n                continue;\n            }\n            if (/^\\s$/.test(char)) { // is whitespace\n                output.push(\" \");\n            } else {\n                output.push(char);\n            }\n        }\n        return output.join(\"\");\n    }\n    /**\n     * Normalizes the given text based on the configuration.\n     * @param {string} text The text to normalize.\n     * @returns {string} The normalized text.\n     */\n    normalize(text) {\n        if (this.config.clean_text) {\n            text = this._clean_text(text);\n        }\n\n        if (this.config.handle_chinese_chars) {\n            text = this._tokenize_chinese_chars(text);\n        }\n\n        if (this.config.lowercase) {\n            text = text.toLowerCase();\n\n            if (this.config.strip_accents !== false) {\n                text = this.stripAccents(text);\n            }\n        } else if (this.config.strip_accents) {\n            text = this.stripAccents(text);\n        }\n\n        return text;\n    }\n}\n\n/**\n * A callable class representing a pre-tokenizer used in tokenization. Subclasses\n * should implement the `pre_tokenize_text` method to define the specific pre-tokenization logic.\n * @extends Callable\n */\nclass PreTokenizer extends Callable {\n    /**\n   * Factory method that returns an instance of a subclass of `PreTokenizer` based on the provided configuration.\n   *\n   * @static\n   * @param {Object} config A configuration object for the pre-tokenizer.\n   * @returns {PreTokenizer} An instance of a subclass of `PreTokenizer`.\n   * @throws {Error} If the provided configuration object does not correspond to any known pre-tokenizer.\n   */\n    static fromConfig(config) {\n        if (config === null) return null;\n\n        switch (config.type) {\n            case 'BertPreTokenizer':\n                return new BertPreTokenizer(config);\n            case 'Sequence':\n                return new PreTokenizerSequence(config);\n            case 'Whitespace':\n                return new WhitespacePreTokenizer(config);\n            case 'WhitespaceSplit':\n                return new WhitespaceSplit(config);\n            case 'Metaspace':\n                return new MetaspacePreTokenizer(config);\n\n            case 'ByteLevel':\n                return new ByteLevelPreTokenizer(config);\n            case 'Split':\n                return new SplitPreTokenizer(config);\n            case 'Punctuation':\n                return new PunctuationPreTokenizer(config);\n            case 'Digits':\n                return new DigitsPreTokenizer(config);\n            case 'Replace':\n                return new ReplacePreTokenizer(config);\n            case 'FixedLength':\n                return new FixedLengthPreTokenizer(config);\n            default:\n                throw new Error(`Unknown PreTokenizer type: ${config.type}`);\n        }\n    }\n\n    /**\n     * Method that should be implemented by subclasses to define the specific pre-tokenization logic.\n     *\n     * @abstract\n     * @param {string} text The text to pre-tokenize.\n     * @param {Object} [options] Additional options for the pre-tokenization logic.\n     * @returns {string[]} The pre-tokenized text.\n     * @throws {Error} If the method is not implemented in the subclass.\n     */\n    pre_tokenize_text(text, options) {\n        throw Error(\"pre_tokenize_text should be implemented in subclass.\")\n    }\n\n    /**\n     * Tokenizes the given text into pre-tokens.\n     * @param {string|string[]} text The text or array of texts to pre-tokenize.\n     * @param {Object} [options] Additional options for the pre-tokenization logic.\n     * @returns {string[]} An array of pre-tokens.\n     */\n    pre_tokenize(text, options) {\n        return (Array.isArray(text)\n            ? text.map(x => this.pre_tokenize_text(x, options))\n            : this.pre_tokenize_text(text, options)\n        ).flat();\n    }\n\n    /**\n     * Alias for {@link PreTokenizer#pre_tokenize}.\n     * @param {string|string[]} text The text or array of texts to pre-tokenize.\n     * @param {Object} [options] Additional options for the pre-tokenization logic.\n     * @returns {string[]} An array of pre-tokens.\n     */\n    _call(text, options) {\n        return this.pre_tokenize(text, options);\n    }\n}\n\n/**\n * @extends PreTokenizer\n */\nclass BertPreTokenizer extends PreTokenizer {\n    /**\n     * A PreTokenizer that splits text into wordpieces using a basic tokenization scheme\n     * similar to that used in the original implementation of BERT.\n     * \n     * @param {Object} config The configuration object.\n     */\n    constructor(config) {\n        super();\n        // Construct a pattern which matches the rust implementation:\n        // https://github.com/huggingface/tokenizers/blob/b4fcc9ce6e4ad5806e82826f816acfdfdc4fcc67/tokenizers/src/pre_tokenizers/bert.rs#L11\n        // Equivalent to removing whitespace and splitting on punctuation (both \\p{P} and other ascii characters)\n        this.pattern = new RegExp(`[^\\\\s${PUNCTUATION_REGEX}]+|[${PUNCTUATION_REGEX}]`, 'gu');\n    }\n    /**\n     * Tokenizes a single text using the BERT pre-tokenization scheme.\n     * \n     * @param {string} text The text to tokenize.\n     * @param {Object} [options] Additional options for the pre-tokenization logic.\n     * @returns {string[]} An array of tokens.\n     */\n    pre_tokenize_text(text, options) {\n        return text.trim().match(this.pattern) || [];\n    }\n}\n\n/**\n * A pre-tokenizer that splits text into Byte-Pair-Encoding (BPE) subwords.\n * @extends PreTokenizer\n */\nclass ByteLevelPreTokenizer extends PreTokenizer {\n    /**\n     * Creates a new instance of the `ByteLevelPreTokenizer` class.\n     * @param {Object} config The configuration object.\n     */\n    constructor(config) {\n        super();\n        this.config = config;\n\n        /**\n         * @type {boolean} Whether to add a leading space to the first word.\n         * This allows to treat the leading word just as any other word.\n         */\n        this.add_prefix_space = this.config.add_prefix_space;\n\n        /**\n         * @type {boolean} Whether the post processing step should trim offsets\n         * to avoid including whitespaces.\n         * @todo Use this in the pretokenization step.\n         */\n        this.trim_offsets = this.config.trim_offsets;\n\n        /**\n         * @type {boolean} Whether to use the standard GPT2 regex for whitespace splitting.\n         * Set it to False if you want to use your own splitting. Defaults to true.\n         */\n        this.use_regex = this.config.use_regex ?? true;\n        this.pattern = /'s|'t|'re|'ve|'m|'ll|'d| ?\\p{L}+| ?\\p{N}+| ?[^\\s\\p{L}\\p{N}]+|\\s+(?!\\S)|\\s+/gu;\n\n        this.byte_encoder = BYTES_TO_UNICODE;\n        this.text_encoder = new TextEncoder();\n    }\n\n    /**\n     * Tokenizes a single piece of text using byte-level tokenization.\n     * @param {string} text The text to tokenize.\n     * @param {Object} [options] Additional options for the pre-tokenization logic.\n     * @returns {string[]} An array of tokens.\n     */\n    pre_tokenize_text(text, options) {\n        // Add a leading space if the option is enabled\n        if (this.add_prefix_space && !text.startsWith(' ')) {\n            text = ' ' + text;\n        }\n\n        // Split on whitespace and punctuation\n        const tokens = this.use_regex ? (text.match(this.pattern) || []) : [text];\n\n        // Maps all our bytes to unicode strings, avoiding control tokens of the BPE (spaces in our case)\n        return tokens.map(\n            token => Array.from(this.text_encoder.encode(token), byte => this.byte_encoder[byte]).join('')\n        );\n    }\n}\n\n/**\n * @typedef {'removed'|'isolated'|'mergedWithPrevious'|'mergedWithNext'|'contiguous'} SplitDelimiterBehavior\n */\n\n/**\n * Splits text using a given pattern.\n * @extends PreTokenizer\n */\nclass SplitPreTokenizer extends PreTokenizer {\n    /**\n     * @param {Object} config The configuration options for the pre-tokenizer.\n     * @param {Object} config.pattern The pattern used to split the text. Can be a string or a regex object.\n     * @param {string|undefined} config.pattern.String The string to use for splitting. Only defined if the pattern is a string.\n     * @param {string|undefined} config.pattern.Regex The regex to use for splitting. Only defined if the pattern is a regex.\n     * @param {SplitDelimiterBehavior} config.behavior The behavior to use when splitting.\n     * @param {boolean} config.invert Whether to split (invert=false) or match (invert=true) the pattern.\n     */\n    constructor(config) {\n        super();\n        this.config = config;\n        // TODO support all behaviours (config.behavior)\n\n        this.pattern = createPattern(this.config.pattern, this.config.invert);\n    }\n\n    /**\n     * Tokenizes text by splitting it using the given pattern.\n     * @param {string} text The text to tokenize.\n     * @param {Object} [options] Additional options for the pre-tokenization logic.\n     * @returns {string[]} An array of tokens.\n     */\n    pre_tokenize_text(text, options) {\n        if (this.pattern === null) {\n            return [];\n        }\n\n        if (this.config.invert) {\n            return text.match(this.pattern) || [];\n        } else if (this.config.behavior?.toLowerCase() === 'removed') {\n            return text.split(this.pattern).filter(x => x);\n        } else {\n            return regexSplit(text, this.pattern);\n        }\n    }\n}\n\n/**\n * Splits text based on punctuation.\n * @extends PreTokenizer\n */\nclass PunctuationPreTokenizer extends PreTokenizer {\n    /**\n     * @param {Object} config The configuration options for the pre-tokenizer.\n     * @param {SplitDelimiterBehavior} config.behavior The behavior to use when splitting.\n     */\n    constructor(config) {\n        super();\n        this.config = config;\n        this.pattern = new RegExp(`[^${PUNCTUATION_REGEX}]+|[${PUNCTUATION_REGEX}]+`, 'gu');\n    }\n\n    /**\n     * Tokenizes text by splitting it using the given pattern.\n     * @param {string} text The text to tokenize.\n     * @param {Object} [options] Additional options for the pre-tokenization logic.\n     * @returns {string[]} An array of tokens.\n     */\n    pre_tokenize_text(text, options) {\n        return text.match(this.pattern) || [];\n    }\n}\n\n\n/**\n * Splits text based on digits.\n * @extends PreTokenizer\n */\nclass DigitsPreTokenizer extends PreTokenizer {\n    /**\n     * @param {Object} config The configuration options for the pre-tokenizer.\n     * @param {boolean} config.individual_digits Whether to split on individual digits.\n     */\n    constructor(config) {\n        super();\n        this.config = config;\n\n        // Construct a pattern which matches the rust implementation:\n        const digit_pattern = `[^\\\\d]+|\\\\d${this.config.individual_digits ? '' : '+'}`;\n        this.pattern = new RegExp(digit_pattern, 'gu');\n    }\n\n    /**\n     * Tokenizes text by splitting it using the given pattern.\n     * @param {string} text The text to tokenize.\n     * @param {Object} [options] Additional options for the pre-tokenization logic.\n     * @returns {string[]} An array of tokens.\n     */\n    pre_tokenize_text(text, options) {\n        return text.match(this.pattern) || [];\n    }\n}\n\n/**\n * @typedef {Object} PostProcessedOutput\n * @property {string[]} tokens List of token produced by the post-processor.\n * @property {number[]} [token_type_ids] List of token type ids produced by the post-processor.\n */\n\n\n/**\n * @typedef {Object} EncodingSingle\n * @property {number[]} input_ids List of token ids to be fed to a model.\n * @property {number[]} attention_mask List of token type ids to be fed to a model\n * @property {number[]} [token_type_ids] List of indices specifying which tokens should be attended to by the model\n */\n\n\n/**\n * @extends Callable\n */\nclass PostProcessor extends Callable {\n\n    /**\n     * @param {Object} config The configuration for the post-processor.\n     */\n    constructor(config) {\n        super();\n        this.config = config;\n    }\n\n    /**\n     * Factory method to create a PostProcessor object from a configuration object.\n     *\n     * @param {Object} config Configuration object representing a PostProcessor.\n     * @returns {PostProcessor} A PostProcessor object created from the given configuration.\n     * @throws {Error} If an unknown PostProcessor type is encountered.\n     */\n    static fromConfig(config) {\n        if (config === null) return null;\n        switch (config.type) {\n            case 'TemplateProcessing':\n                return new TemplateProcessing(config);\n\n            case 'ByteLevel':\n                return new ByteLevelPostProcessor(config);\n\n            case 'RobertaProcessing':\n                return new RobertaProcessing(config);\n            case 'BertProcessing':\n                return new BertProcessing(config);\n\n            case 'Sequence':\n                return new PostProcessorSequence(config);\n            default:\n                throw new Error(`Unknown PostProcessor type: ${config.type}`);\n        }\n    }\n\n    /**\n     * Method to be implemented in subclass to apply post-processing on the given tokens.\n     *\n     * @param {Array} tokens The input tokens to be post-processed.\n     * @param {...*} args Additional arguments required by the post-processing logic.\n     * @returns {PostProcessedOutput} The post-processed tokens.\n     * @throws {Error} If the method is not implemented in subclass.\n     */\n    post_process(tokens, ...args) {\n        throw Error(\"post_process should be implemented in subclass.\")\n    }\n\n    /**\n     * Alias for {@link PostProcessor#post_process}.\n     * @param {Array} tokens The text or array of texts to post-process.\n     * @param {...*} args Additional arguments required by the post-processing logic.\n     * @returns {PostProcessedOutput} The post-processed tokens.\n     */\n    _call(tokens, ...args) {\n        return this.post_process(tokens, ...args);\n    }\n}\n\n/**\n * A post-processor that adds special tokens to the beginning and end of the input.\n */\nclass BertProcessing extends PostProcessor {\n    /**\n     * @param {Object} config The configuration for the post-processor.\n     * @param {string[]} config.cls The special tokens to add to the beginning of the input.\n     * @param {string[]} config.sep The special tokens to add to the end of the input.\n     */\n    constructor(config) {\n        super(config);\n        // TODO use all of config: add_prefix_space, trim_offsets\n\n        this.cls = config.cls[0];\n        this.sep = config.sep[0];\n    }\n\n    /**\n     * Adds the special tokens to the beginning and end of the input.\n     * @param {string[]} tokens The input tokens.\n     * @param {string[]} [tokens_pair=null] An optional second set of input tokens.\n     * @returns {PostProcessedOutput} The post-processed tokens with the special tokens added to the beginning and end.\n     */\n    post_process(tokens, tokens_pair = null, {\n        add_special_tokens = true,\n    } = {}) {\n        if (add_special_tokens) {\n            tokens = mergeArrays([this.cls], tokens, [this.sep]);\n        }\n\n        let token_type_ids = new Array(tokens.length).fill(0);\n        if (tokens_pair !== null) {\n            // NOTE: It is intended to add 2 EOS tokens after the first set of tokens\n            // https://github.com/huggingface/tokenizers/issues/983\n            const middle = (add_special_tokens && this instanceof RobertaProcessing)\n                ? [this.sep]\n                : [];\n            const after = add_special_tokens ? [this.sep] : [];\n\n            tokens = mergeArrays(tokens, middle, tokens_pair, after);\n            token_type_ids = mergeArrays(token_type_ids, new Array(tokens_pair.length + middle.length + after.length).fill(1));\n        }\n        return { tokens, token_type_ids };\n    }\n}\nclass RobertaProcessing extends BertProcessing { } // NOTE: extends BertProcessing\n\n/**\n * Post processor that replaces special tokens in a template with actual tokens.\n * @extends PostProcessor\n */\nclass TemplateProcessing extends PostProcessor {\n    /**\n     * Creates a new instance of `TemplateProcessing`.\n     * @param {Object} config The configuration options for the post processor.\n     * @param {Array} config.single The template for a single sequence of tokens.\n     * @param {Array} config.pair The template for a pair of sequences of tokens.\n     */\n    constructor(config) {\n        super(config);\n\n        this.single = config.single;\n        this.pair = config.pair;\n    }\n\n    /**\n     * Replaces special tokens in the template with actual tokens.\n     * @param {string[]} tokens The list of tokens for the first sequence.\n     * @param {string[]} [tokens_pair=null] The list of tokens for the second sequence (optional).\n     * @returns {PostProcessedOutput} An object containing the list of tokens with the special tokens replaced with actual tokens.\n     */\n    post_process(tokens, tokens_pair = null, {\n        add_special_tokens = true,\n    } = {}) {\n        const type = tokens_pair === null ? this.single : this.pair\n\n        let processedTokens = [];\n        let types = [];\n        for (const item of type) {\n            if ('SpecialToken' in item) {\n                if (add_special_tokens) {\n                    processedTokens.push(item.SpecialToken.id);\n                    types.push(item.SpecialToken.type_id);\n                }\n            } else if ('Sequence' in item) {\n                if (item.Sequence.id === 'A') {\n                    processedTokens = mergeArrays(processedTokens, tokens);\n                    types = mergeArrays(types, new Array(tokens.length).fill(item.Sequence.type_id));\n\n                } else if (item.Sequence.id === 'B') {\n                    processedTokens = mergeArrays(processedTokens, tokens_pair);\n                    types = mergeArrays(types, new Array(tokens_pair.length).fill(item.Sequence.type_id));\n                }\n            }\n        }\n        return { tokens: processedTokens, token_type_ids: types };\n    }\n}\n\n/**\n * A PostProcessor that returns the given tokens as is.\n * @extends PostProcessor\n */\nclass ByteLevelPostProcessor extends PostProcessor {\n    /**\n     * Post process the given tokens.\n     * @param {string[]} tokens The list of tokens for the first sequence.\n     * @param {string[]} [tokens_pair=null] The list of tokens for the second sequence (optional).\n     * @returns {PostProcessedOutput} An object containing the post-processed tokens.\n     */\n    post_process(tokens, tokens_pair = null) {\n        if (tokens_pair) {\n            tokens = mergeArrays(tokens, tokens_pair);\n        }\n        return { tokens };\n    }\n}\n\n\n/**\n * A post-processor that applies multiple post-processors in sequence.\n */\nclass PostProcessorSequence extends PostProcessor {\n\n    /**\n     * Creates a new instance of PostProcessorSequence.\n     * @param {Object} config The configuration object.\n     * @param {Object[]} config.processors The list of post-processors to apply.\n     */\n    constructor(config) {\n        super(config);\n\n        this.processors = config.processors.map(x => PostProcessor.fromConfig(x));\n    }\n\n    /**\n     * Post process the given tokens.\n     * @param {string[]} tokens The list of tokens for the first sequence.\n     * @param {string[]} [tokens_pair=null] The list of tokens for the second sequence (optional).\n     * @returns {PostProcessedOutput} An object containing the post-processed tokens.\n     */\n    post_process(tokens, tokens_pair = null, options = {}) {\n        let token_type_ids;\n        for (const processor of this.processors) {\n            if (processor instanceof ByteLevelPostProcessor) {\n                // Special case where we need to pass the tokens_pair to the post-processor\n                const output = processor.post_process(tokens);\n                tokens = output.tokens;\n                if (tokens_pair) {\n                    const pair_output = processor.post_process(tokens_pair);\n                    tokens_pair = pair_output.tokens;\n                }\n            } else {\n                const output = processor.post_process(tokens, tokens_pair, options);\n                tokens = output.tokens;\n                token_type_ids = output.token_type_ids;\n            }\n        }\n        return { tokens, token_type_ids };\n    }\n}\n\n/**\n * The base class for token decoders.\n * @extends Callable\n */\nclass Decoder extends Callable {\n\n    /**\n    * Creates an instance of `Decoder`.\n    *\n    * @param {Object} config The configuration object.\n    */\n    constructor(config) {\n        super();\n        this.config = config;\n\n        /** @type {AddedToken[]} */\n        this.added_tokens = [];\n        this.end_of_word_suffix = null;\n        this.trim_offsets = config.trim_offsets;\n    }\n\n    /**\n   * Creates a decoder instance based on the provided configuration.\n   *\n   * @param {Object} config The configuration object.\n   * @returns {Decoder} A decoder instance.\n   * @throws {Error} If an unknown decoder type is provided.\n   */\n    static fromConfig(config) {\n        if (config === null) return null;\n        switch (config.type) {\n            case 'WordPiece':\n                return new WordPieceDecoder(config);\n            case 'Metaspace':\n                return new MetaspaceDecoder(config);\n            case 'ByteLevel':\n                return new ByteLevelDecoder(config);\n\n            case 'Replace':\n                return new ReplaceDecoder(config);\n            case 'ByteFallback':\n                return new ByteFallback(config);\n            case 'Fuse':\n                return new FuseDecoder(config);\n            case 'Strip':\n                return new StripDecoder(config);\n\n            case 'Sequence':\n                return new DecoderSequence(config);\n\n            case 'CTC':\n                return new CTCDecoder(config);\n            case 'BPEDecoder':\n                return new BPEDecoder(config);\n            default:\n                throw new Error(`Unknown Decoder type: ${config.type}`);\n        }\n    }\n\n    /**\n    * Calls the `decode` method.\n    *\n    * @param {string[]} tokens The list of tokens.\n    * @returns {string} The decoded string.\n    */\n    _call(tokens) {\n        return this.decode(tokens);\n    }\n\n    /**\n    * Decodes a list of tokens.\n    * @param {string[]} tokens The list of tokens.\n    * @returns {string} The decoded string.\n    */\n    decode(tokens) {\n        return this.decode_chain(tokens).join('');\n    }\n\n    /**\n     * Apply the decoder to a list of tokens.\n     * \n     * @param {string[]} tokens The list of tokens.\n     * @returns {string[]} The decoded list of tokens.\n     * @throws {Error} If the `decode_chain` method is not implemented in the subclass.\n     */\n    decode_chain(tokens) {\n        throw Error(\"`decode_chain` should be implemented in subclass.\")\n    }\n\n}\n\nclass ReplaceDecoder extends Decoder {\n\n    /** @type {Decoder['decode_chain']} */\n    decode_chain(tokens) {\n        const pattern = createPattern(this.config.pattern);\n        return pattern === null\n            ? tokens\n            : tokens.map(token => token.replaceAll(pattern, this.config.content))\n    }\n}\n\n\nclass ByteFallback extends Decoder {\n    constructor(config) {\n        super(config);\n\n        this.text_decoder = new TextDecoder();\n    }\n\n    /** @type {Decoder['decode_chain']} */\n    decode_chain(tokens) {\n\n        const new_tokens = [];\n        let previous_byte_tokens = [];\n\n        for (const token of tokens) {\n            let bytes = null;\n            if (token.length === 6 && token.startsWith('<0x') && token.endsWith('>')) {\n                const byte = parseInt(token.slice(3, 5), 16);\n                if (!isNaN(byte)) {\n                    bytes = byte;\n                }\n            }\n            if (bytes !== null) {\n                previous_byte_tokens.push(bytes);\n            } else {\n                if (previous_byte_tokens.length > 0) {\n                    const string = this.text_decoder.decode(Uint8Array.from(previous_byte_tokens));\n                    new_tokens.push(string);\n                    previous_byte_tokens = [];\n                }\n                new_tokens.push(token);\n            }\n        }\n        if (previous_byte_tokens.length > 0) {\n            const string = this.text_decoder.decode(Uint8Array.from(previous_byte_tokens));\n            new_tokens.push(string);\n            previous_byte_tokens = [];\n        }\n\n        return new_tokens;\n    }\n}\n\n/**\n * Fuse simply fuses all tokens into one big string.\n * It's usually the last decoding step anyway, but this decoder\n * exists incase some decoders need to happen after that step\n */\nclass FuseDecoder extends Decoder {\n\n    /** @type {Decoder['decode_chain']} */\n    decode_chain(tokens) {\n        return [tokens.join('')];\n    }\n}\n\n\nclass StripDecoder extends Decoder {\n    constructor(config) {\n        super(config);\n\n        this.content = this.config.content;\n        this.start = this.config.start;\n        this.stop = this.config.stop;\n    }\n\n    /** @type {Decoder['decode_chain']} */\n    decode_chain(tokens) {\n        return tokens.map(token => {\n            let start_cut = 0;\n            for (let i = 0; i < this.start; ++i) {\n                if (token[i] === this.content) {\n                    start_cut = i + 1;\n                    continue;\n                } else {\n                    break;\n                }\n            }\n\n            let stop_cut = token.length;\n            for (let i = 0; i < this.stop; ++i) {\n                const index = token.length - i - 1;\n                if (token[index] === this.content) {\n                    stop_cut = index;\n                    continue;\n                } else {\n                    break;\n                }\n            }\n\n            return token.slice(start_cut, stop_cut)\n        });\n    }\n}\n\n/**\n * A decoder that decodes a list of WordPiece tokens into a single string.\n * @extends Decoder\n */\nclass WordPieceDecoder extends Decoder {\n\n    /**\n     * Creates a new instance of WordPieceDecoder.\n     * @param {Object} config The configuration object.\n     * @param {string} config.prefix The prefix used for WordPiece encoding.\n     * @param {boolean} config.cleanup Whether to cleanup the decoded string.\n     */\n    constructor(config) {\n        super(config);\n        this.cleanup = config.cleanup;\n    }\n\n    /** @type {Decoder['decode_chain']} */\n    decode_chain(tokens) {\n        return tokens.map((token, i) => {\n            if (i !== 0) {\n                if (token.startsWith(this.config.prefix)) {\n                    // NOTE: .replace() is intended; only replace first occurrence\n                    token = token.replace(this.config.prefix, '');\n                } else {\n                    token = ' ' + token;\n                }\n            }\n            if (this.cleanup) {\n                token = clean_up_tokenization(token)\n            }\n\n            return token;\n        });\n    }\n}\n\n/**\n * Byte-level decoder for tokenization output. Inherits from the `Decoder` class.\n * @extends Decoder\n */\nclass ByteLevelDecoder extends Decoder {\n\n    /**\n     * Create a `ByteLevelDecoder` object.\n     * @param {Object} config Configuration object.\n     */\n    constructor(config) {\n        super(config);\n\n        this.byte_decoder = UNICODE_TO_BYTES;\n        this.text_decoder = new TextDecoder(\"utf-8\", {\n            fatal: false,\n            ignoreBOM: true,\n        });\n\n        this.end_of_word_suffix = null;\n    }\n\n    /**\n     * Convert an array of tokens to string by decoding each byte.\n     * @param {string[]} tokens Array of tokens to be decoded.\n     * @returns {string} The decoded string.\n     */\n    convert_tokens_to_string(tokens) {\n        const text = tokens.join('');\n        const byteArray = new Uint8Array([...text].map(c => this.byte_decoder[c]));\n        const decoded_text = this.text_decoder.decode(byteArray);\n        return decoded_text;\n    }\n\n    /** @type {Decoder['decode_chain']} */\n    decode_chain(tokens) {\n        // TODO move to base class (like HF)\n        // tokens === filtered_tokens\n\n        // To avoid mixing byte-level and unicode for byte-level BPT\n        // we need to build string separately for added tokens and byte-level tokens\n        // cf. https://github.com/huggingface/transformers/issues/1133\n        const sub_texts = [];\n        let current_sub_text = [];\n        for (const token of tokens) {\n            // tokens sent here are already filtered, so we don't need to do this\n            // if (skip_special_tokens && this.all_special_ids.includes(token)) {\n            //     continue;\n            // }\n\n            if (this.added_tokens.find(x => x.content === token) !== undefined) {\n                if (current_sub_text.length > 0) {\n                    sub_texts.push(this.convert_tokens_to_string(current_sub_text));\n                    current_sub_text = [];\n                }\n                sub_texts.push(token);\n            } else {\n                current_sub_text.push(token);\n            }\n        }\n        if (current_sub_text.length > 0) {\n            sub_texts.push(this.convert_tokens_to_string(current_sub_text));\n        }\n\n        // TODO add spaces_between_special_tokens and clean_up_tokenization_spaces options\n\n        return sub_texts;\n    }\n}\n\n/**\n * The CTC (Connectionist Temporal Classification) decoder.\n * See https://github.com/huggingface/tokenizers/blob/bb38f390a61883fc2f29d659af696f428d1cda6b/tokenizers/src/decoders/ctc.rs\n */\nclass CTCDecoder extends Decoder {\n\n    constructor(config) {\n        super(config);\n\n        this.pad_token = this.config.pad_token;\n        this.word_delimiter_token = this.config.word_delimiter_token;\n        this.cleanup = this.config.cleanup;\n    }\n    /**\n     * Converts a connectionist-temporal-classification (CTC) output tokens into a single string.\n     * @param {string[]} tokens Array of tokens to be decoded.\n     * @returns {string} The decoded string.\n     */\n    convert_tokens_to_string(tokens) {\n        if (tokens.length === 0) return '';\n\n        // group same tokens into non-repeating tokens in CTC style decoding\n        const grouped_tokens = [tokens[0]];\n        for (let i = 1; i < tokens.length; ++i) {\n            if (tokens[i] !== grouped_tokens.at(-1)) {\n                grouped_tokens.push(tokens[i]);\n            }\n        }\n\n        // filter self.pad_token which is used as CTC-blank token\n        const filtered_tokens = grouped_tokens.filter(token => token !== this.pad_token);\n\n        let text = filtered_tokens.join('');\n        if (this.cleanup) {\n            // cleanup and replace delimiter token\n            text = clean_up_tokenization(text)\n                .replaceAll(this.word_delimiter_token, ' ')\n                .trim();\n        }\n        return text;\n    }\n\n\n    /** @type {Decoder['decode_chain']} */\n    decode_chain(tokens) {\n        return [this.convert_tokens_to_string(tokens)];\n    }\n}\n\n/**\n * Apply a sequence of decoders.\n * @extends Decoder\n */\nclass DecoderSequence extends Decoder {\n\n    /**\n     * Creates a new instance of DecoderSequence.\n     * @param {Object} config The configuration object.\n     * @param {Object[]} config.decoders The list of decoders to apply.\n     */\n    constructor(config) {\n        super(config);\n        this.decoders = config.decoders.map(x => Decoder.fromConfig(x));\n    }\n\n    /** @type {Decoder['decode_chain']} */\n    decode_chain(tokens) {\n        // Use reduce to apply each decoder to the tokens\n        return this.decoders.reduce((toks, decoder) => {\n            return decoder.decode_chain(toks);\n        }, tokens);\n    }\n\n}\n\nclass BPEDecoder extends Decoder {\n    constructor(config) {\n        super(config);\n\n        this.suffix = this.config.suffix;\n    }\n    /** @type {Decoder['decode_chain']} */\n    decode_chain(tokens) {\n        return tokens.map((token, i) => {\n            return token.replaceAll(this.suffix, (i === tokens.length - 1) ? '' : ' ')\n        });\n    }\n}\n\n// Custom decoder for VITS\nclass VitsDecoder extends Decoder {\n    /** @type {Decoder['decode_chain']} */\n    decode_chain(tokens) {\n        let decoded = '';\n        for (let i = 1; i < tokens.length; i += 2) {\n            decoded += tokens[i];\n        }\n        return [decoded];\n    }\n}\n\n\n/**\n * This PreTokenizer replaces spaces with the given replacement character, adds a prefix space if requested,\n * and returns a list of tokens.\n * @extends PreTokenizer\n */\nclass MetaspacePreTokenizer extends PreTokenizer {\n    /**\n     * @param {Object} config The configuration object for the MetaspacePreTokenizer.\n     * @param {string} config.replacement The character to replace spaces with.\n     * @param {string} [config.str_rep=config.replacement] An optional string representation of the replacement character.\n     * @param {'first'|'never'|'always'} [config.prepend_scheme='always'] The metaspace prepending scheme.\n     */\n    constructor(config) {\n        super();\n\n        this.replacement = config.replacement;\n        this.strRep = config.str_rep || this.replacement;\n        this.prepend_scheme = config.prepend_scheme ?? 'always';\n    }\n\n    /**\n     * This method takes a string, replaces spaces with the replacement character,\n     * adds a prefix space if requested, and returns a new list of tokens.\n     * @param {string} text The text to pre-tokenize.\n     * @param {Object} [options] The options for the pre-tokenization.\n     * @param {number} [options.section_index] The index of the section to pre-tokenize.\n     * @returns {string[]} A new list of pre-tokenized tokens.\n     */\n    pre_tokenize_text(text, {\n        section_index = undefined,\n    } = {}) {\n\n        let normalized = text.replaceAll(' ', this.strRep);\n\n        if (\n            // We add a prefix space if:\n            //  (1) The normalized token does not already start with the replacement character.\n            !normalized.startsWith(this.replacement)\n\n            // and (2) either:\n            //  (a) prepend_scheme is 'always'\n            //  (b) prepend_scheme is 'first' and this is the first section\n            && (\n                this.prepend_scheme === 'always' ||\n                (this.prepend_scheme === 'first' && section_index === 0)\n            )\n        ) {\n            normalized = this.strRep + normalized;\n        }\n        return [normalized];\n    }\n}\n\n/**\n * MetaspaceDecoder class extends the Decoder class and decodes Metaspace tokenization.\n * @extends Decoder\n */\nclass MetaspaceDecoder extends Decoder {\n    /**\n     * Constructs a new MetaspaceDecoder object.\n     * @param {Object} config The configuration object for the MetaspaceDecoder.\n     * @param {string} config.replacement The string to replace spaces with.\n     */\n    constructor(config) {\n        super(config);\n\n        this.replacement = config.replacement;\n    }\n\n    /** @type {Decoder['decode_chain']} */\n    decode_chain(tokens) {\n        const result = [];\n        for (let i = 0; i < tokens.length; ++i) {\n            let normalized = tokens[i].replaceAll(this.replacement, ' ');\n            if (i == 0 && normalized.startsWith(' ')) {\n                normalized = normalized.substring(1);\n            }\n            result.push(normalized);\n        }\n        return result;\n    }\n}\n\n/**\n * A normalizer that applies a precompiled charsmap.\n * This is useful for applying complex normalizations in C++ and exposing them to JavaScript.\n * @extends Normalizer\n * @param {Object} config The configuration object for the Precompiled normalizer.\n * @param {Object} config.precompiled_charsmap The precompiled charsmap object.\n */\nclass Precompiled extends Normalizer {\n    /**\n     * Create a new instance of Precompiled normalizer.\n     * @param {Object} config The configuration object.\n     * @param {any} config.precompiled_charsmap Precompiled chars mapping.\n     */\n    constructor(config) {\n        super(config);\n        this.charsmap = config.precompiled_charsmap;\n    }\n\n    /**\n     * Normalizes the given text by applying the precompiled charsmap.\n     * @param {string} text The text to normalize.\n     * @returns {string} The normalized text.\n     */\n    normalize(text) {\n        // As stated in the sentencepiece normalization docs (https://github.com/google/sentencepiece/blob/master/doc/normalization.md#use-pre-defined-normalization-rule),\n        // there are 5 pre-defined normalization rules:\n        //  1. nmt_nfkc: NFKC normalization with some additional normalization around spaces. (default)\n        //  2. nfkc: original NFKC normalization.\n        //  3. nmt_nfkc_cf: nmt_nfkc + Unicode case folding (mostly lower casing)\n        //  4. nfkc_cf: nfkc + Unicode case folding.\n        //  5. identity: no normalization\n        // \n        // For now, we only implement the default (nmt_nfkc).\n        // See https://raw.githubusercontent.com/google/sentencepiece/master/data/nmt_nfkc.tsv for the full list of rules.\n        // TODO: detect when a different `this.charsmap` is used.\n\n        text = text.replace(/[\\u0001-\\u0008\\u000B\\u000E-\\u001F\\u007F\\u008F\\u009F]/gm, ''); // Remove control characters\n        text = text.replace(/[\\u0009\\u000A\\u000C\\u000D\\u00A0\\u1680\\u2000-\\u200F\\u2028\\u2029\\u202F\\u205F\\u2581\\u3000\\uFEFF\\uFFFD]/gm, '\\u0020'); // Replace certain characters with a space\n\n        if (text.includes('\\uFF5E')) {\n            // To match the sentencepiece implementation 100%, we must handle a very strange edge-case.\n            // For some reason, the \"Fullwidth Tilde\" character (\\uFF5E) should not be converted to the standard Tilde character (\\u007E).\n            // However, NFKC normalization does do this conversion. As a result, we split the string on the Fullwidth Tilde character,\n            // perform NFKC normalization on each substring, and then join them back together with the Fullwidth Tilde character.\n            const parts = text.split('\\uFF5E');\n            text = parts.map(part => part.normalize('NFKC')).join('\\uFF5E');\n        } else {\n            text = text.normalize('NFKC');\n        }\n\n        return text;\n    }\n}\n\n/**\n * A pre-tokenizer that applies a sequence of pre-tokenizers to the input text.\n * @extends PreTokenizer\n */\nclass PreTokenizerSequence extends PreTokenizer {\n    /**\n     * Creates an instance of PreTokenizerSequence.\n     * @param {Object} config The configuration object for the pre-tokenizer sequence.\n     * @param {Object[]} config.pretokenizers An array of pre-tokenizer configurations.\n     */\n    constructor(config) {\n        super();\n        this.tokenizers = config.pretokenizers.map(x => PreTokenizer.fromConfig(x));\n    }\n\n    /**\n     * Applies each pre-tokenizer in the sequence to the input text in turn.\n     * @param {string} text The text to pre-tokenize.\n     * @param {Object} [options] Additional options for the pre-tokenization logic.\n     * @returns {string[]} The pre-tokenized text.\n     */\n    pre_tokenize_text(text, options) {\n        // Use reduce to apply each tokenizer to the text\n        return this.tokenizers.reduce((preTokenizedText, tokenizer) => {\n            return tokenizer.pre_tokenize(preTokenizedText, options);\n        }, [text]);\n    }\n}\n\n/**\n * Splits on word boundaries (using the following regular expression: `\\w+|[^\\w\\s]+`).\n */\nclass WhitespacePreTokenizer extends PreTokenizer {\n    /**\n     * Creates an instance of WhitespacePreTokenizer.\n     * @param {Object} config The configuration object for the pre-tokenizer.\n     */\n    constructor(config) {\n        super();\n    }\n    /**\n     * Pre-tokenizes the input text by splitting it on word boundaries.\n     * @param {string} text The text to be pre-tokenized.\n     * @param {Object} [options] Additional options for the pre-tokenization logic.\n     * @returns {string[]} An array of tokens produced by splitting the input text on whitespace.\n     */\n    pre_tokenize_text(text, options) {\n        return text.match(/\\w+|[^\\w\\s]+/g) || [];\n    }\n}\n\n/**\n * Splits a string of text by whitespace characters into individual tokens.\n * @extends PreTokenizer\n */\nclass WhitespaceSplit extends PreTokenizer {\n    /**\n     * Creates an instance of WhitespaceSplit.\n     * @param {Object} config The configuration object for the pre-tokenizer.\n     */\n    constructor(config) {\n        super();\n    }\n    /**\n     * Pre-tokenizes the input text by splitting it on whitespace characters.\n     * @param {string} text The text to be pre-tokenized.\n     * @param {Object} [options] Additional options for the pre-tokenization logic.\n     * @returns {string[]} An array of tokens produced by splitting the input text on whitespace.\n     */\n    pre_tokenize_text(text, options) {\n        return whitespace_split(text);\n    }\n}\n\n// NOTE: `ReplacePreTokenizer` is custom (to support `BlenderbotSmallTokenizer`)\nclass ReplacePreTokenizer extends PreTokenizer {\n    /**\n     * @param {Object} config The configuration options for the pre-tokenizer.\n     * @param {Object} config.pattern The pattern used to split the text. Can be a string or a regex object.\n     * @param {string} config.content What to replace the pattern with.\n     */\n    constructor(config) {\n        super();\n        this.config = config;\n        this.pattern = createPattern(this.config.pattern);\n        this.content = this.config.content;\n    }\n\n    /**\n     * Pre-tokenizes the input text by replacing certain characters.\n     * @param {string} text The text to be pre-tokenized.\n     * @param {Object} [options] Additional options for the pre-tokenization logic.\n     * @returns {string[]} An array of tokens produced by replacing certain characters.\n     */\n    pre_tokenize_text(text, options) {\n        if (this.pattern === null) {\n            return [text];\n        }\n        return [text.replaceAll(this.pattern, this.config.content)];\n    }\n}\n\nclass FixedLengthPreTokenizer extends PreTokenizer {\n    /**\n     * @param {Object} config The configuration options for the pre-tokenizer.\n     * @param {number} config.length The fixed length to split the text into.\n     */\n    constructor(config) {\n        super();\n        this._length = config.length;\n    }\n\n    /**\n     * Pre-tokenizes the input text by splitting it into fixed-length tokens.\n     * @param {string} text The text to be pre-tokenized.\n     * @param {Object} [options] Additional options for the pre-tokenization logic.\n     * @returns {string[]} An array of tokens produced by splitting the input text into fixed-length tokens.\n     */\n    pre_tokenize_text(text, options) {\n        const tokens = [];\n        for (let i = 0; i < text.length; i += this._length) {\n            tokens.push(text.slice(i, i + this._length));\n        }\n        return tokens;\n    }\n}\n\nconst SPECIAL_TOKEN_ATTRIBUTES = [\n    'bos_token',\n    'eos_token',\n    'unk_token',\n    'sep_token',\n    'pad_token',\n    'cls_token',\n    'mask_token',\n    // additional_special_tokens (TODO)\n]\n\n/**\n * \n * Helper function for padding values of an object, which are each arrays.\n * NOTE: No additional checks are made here for validity of arguments.\n * @param {Record<string, any[]>} item The input object.\n * @param {number} length The length to pad to.\n * @param {(key: string) => any} value_fn Determine the value to fill the array, based on its key.\n * @param {string} side Which side to pad the array.\n * @private\n */\nfunction padHelper(item, length, value_fn, side) {\n    for (const key of Object.keys(item)) {\n        const diff = length - item[key].length;\n        const value = value_fn(key);\n\n        const padData = new Array(diff).fill(value);\n        item[key] = side === 'right'\n            ? mergeArrays(item[key], padData)\n            : mergeArrays(padData, item[key]);\n    }\n}\n\n/**\n * Helper function for truncating values of an object, which are each arrays.\n * NOTE: No additional checks are made here for validity of arguments.\n * @param {Record<string, any[]>} item The input object.\n * @param {number} length The length to truncate to.\n * @private\n */\nfunction truncateHelper(item, length) {\n    // Setting .length to a lower value truncates the array in-place:\n    // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/length\n    for (const key of Object.keys(item)) {\n        item[key].length = length;\n    }\n}\n\n\n/**\n * @typedef {Object} Message\n * @property {string} role The role of the message (e.g., \"user\" or \"assistant\" or \"system\").\n * @property {string} content The content of the message.\n */\n\nexport class PreTrainedTokenizer extends Callable {\n    return_token_type_ids = false;\n\n    padding_side = 'right';\n    /**\n     * Create a new PreTrainedTokenizer instance.\n     * @param {Object} tokenizerJSON The JSON of the tokenizer.\n     * @param {Object} tokenizerConfig The config of the tokenizer.\n     */\n    constructor(tokenizerJSON, tokenizerConfig) {\n        super();\n\n        this.config = tokenizerConfig;\n\n        // Construct parts of the tokenizer from the JSON\n        this.normalizer = Normalizer.fromConfig(tokenizerJSON.normalizer);\n        this.pre_tokenizer = PreTokenizer.fromConfig(tokenizerJSON.pre_tokenizer);\n        this.model = TokenizerModel.fromConfig(tokenizerJSON.model, tokenizerConfig);\n        this.post_processor = PostProcessor.fromConfig(tokenizerJSON.post_processor);\n        this.decoder = Decoder.fromConfig(tokenizerJSON.decoder);\n\n        // Add added_tokens to model\n        this.special_tokens = [];\n        this.all_special_ids = [];\n\n        /** @type {AddedToken[]} */\n        this.added_tokens = [];\n        for (const addedToken of tokenizerJSON.added_tokens) {\n            const token = new AddedToken(addedToken);\n            this.added_tokens.push(token);\n\n            this.model.tokens_to_ids.set(token.content, token.id);\n            this.model.vocab[token.id] = token.content;\n\n            if (token.special) {\n                this.special_tokens.push(token.content);\n                this.all_special_ids.push(token.id);\n            }\n        }\n\n        // Update additional_special_tokens\n        this.additional_special_tokens = tokenizerConfig.additional_special_tokens ?? [];\n        this.special_tokens.push(...this.additional_special_tokens);\n        this.special_tokens = [...new Set(this.special_tokens)]; // Remove duplicates\n\n        if (this.decoder) {\n            // Slight hack, but it prevents code duplication:\n            this.decoder.added_tokens = this.added_tokens;\n\n            // Another slight hack to add `end_of_word_suffix` (if present) to the decoder\n            // This is needed for cases where BPE model and ByteLevel decoder are used\n            // For more information, see https://github.com/huggingface/transformers.js/issues/74\n            // TODO: save this to the decoder when exporting?\n            this.decoder.end_of_word_suffix = this.model.end_of_word_suffix;\n        }\n\n        this.added_tokens_splitter = new DictionarySplitter(\n            this.added_tokens.map(x => x.content),\n        );\n\n        /** @type {Map<string, AddedToken>} */\n        this.added_tokens_map = new Map(this.added_tokens.map(x => [x.content, x]))\n\n        // Set mask token if present (otherwise will be undefined, which is fine)\n        this.mask_token = this.getToken('mask_token');\n        this.mask_token_id = this.model.tokens_to_ids.get(this.mask_token);\n\n        this.pad_token = this.getToken('pad_token', 'eos_token');\n        this.pad_token_id = this.model.tokens_to_ids.get(this.pad_token);\n\n        this.sep_token = this.getToken('sep_token');\n        this.sep_token_id = this.model.tokens_to_ids.get(this.sep_token);\n\n        this.unk_token = this.getToken('unk_token');\n        this.unk_token_id = this.model.tokens_to_ids.get(this.unk_token);\n\n        this.bos_token = this.getToken('bos_token');\n        this.bos_token_id = this.model.tokens_to_ids.get(this.bos_token);\n\n        this.eos_token = this.getToken('eos_token');\n        this.eos_token_id = this.model.tokens_to_ids.get(this.eos_token);\n\n        this.model_max_length = tokenizerConfig.model_max_length;\n\n        /** @type {boolean} Whether or not to strip the text when tokenizing (removing excess spaces before and after the string). */\n        this.remove_space = tokenizerConfig.remove_space;\n\n        this.clean_up_tokenization_spaces = tokenizerConfig.clean_up_tokenization_spaces ?? true;\n        this.do_lowercase_and_remove_accent = tokenizerConfig.do_lowercase_and_remove_accent ?? false;\n\n        if (tokenizerConfig.padding_side) {\n            this.padding_side = tokenizerConfig.padding_side;\n        }\n\n        this.add_bos_token = tokenizerConfig.add_bos_token;\n        this.add_eos_token = tokenizerConfig.add_eos_token;\n\n        this.legacy = false;\n\n        this.chat_template = tokenizerConfig.chat_template ?? null;\n        if (Array.isArray(this.chat_template)) {\n            // Chat templates are stored as lists of dicts with fixed key names,\n            // we reconstruct that into a single dict while loading them.\n            const chat_template = Object.create(null);\n            for (const { name, template } of this.chat_template) {\n                if (typeof name !== 'string' || typeof template !== 'string') {\n                    throw new Error('Chat template must be a list of objects with \"name\" and \"template\" properties');\n                }\n                chat_template[name] = template;\n            }\n            this.chat_template = chat_template;\n        }\n        this._compiled_template_cache = new Map();\n    }\n\n    /**\n     * Returns the value of the first matching key in the tokenizer config object.\n     * @param {...string} keys One or more keys to search for in the tokenizer config object.\n     * @returns {string|null} The value associated with the first matching key, or null if no match is found.\n     * @throws {Error} If an object is found for a matching key and its __type property is not \"AddedToken\".\n     * @private\n     */\n    getToken(...keys) {\n        for (const key of keys) {\n            const item = this.config[key];\n\n            if (!item) continue;\n\n            if (typeof item === 'object') {\n                if (item.__type === 'AddedToken') {\n                    return item.content;\n                } else {\n                    throw Error(`Unknown token: ${item}`);\n                }\n            } else {\n                return item;\n            }\n        }\n        return null;\n    }\n\n    /**\n     * Loads a pre-trained tokenizer from the given `pretrained_model_name_or_path`. \n     * \n     * @param {string} pretrained_model_name_or_path The path to the pre-trained tokenizer.\n     * @param {PretrainedTokenizerOptions} options Additional options for loading the tokenizer.\n     * \n     * @throws {Error} Throws an error if the tokenizer.json or tokenizer_config.json files are not found in the `pretrained_model_name_or_path`.\n     * @returns {Promise<PreTrainedTokenizer>} A new instance of the `PreTrainedTokenizer` class.\n     */\n    static async from_pretrained(pretrained_model_name_or_path, {\n        progress_callback = null,\n        config = null,\n        cache_dir = null,\n        local_files_only = false,\n        revision = 'main',\n        legacy = null,\n    } = {}) {\n\n        const info = await loadTokenizer(pretrained_model_name_or_path, {\n            progress_callback,\n            config,\n            cache_dir,\n            local_files_only,\n            revision,\n            legacy,\n        })\n\n        // @ts-ignore\n        return new this(...info);\n    }\n\n    /**\n     * @typedef {number[]|number[][]|Tensor} BatchEncodingItem\n     * \n     * @typedef {Object} BatchEncoding Holds the output of the tokenizer's call function.\n     * @property {BatchEncodingItem} input_ids List of token ids to be fed to a model.\n     * @property {BatchEncodingItem} attention_mask List of indices specifying which tokens should be attended to by the model.\n     * @property {BatchEncodingItem} [token_type_ids] List of token type ids to be fed to a model.\n     */\n\n    /**\n     * Encode/tokenize the given text(s).\n     * @param {string|string[]} text The text to tokenize.\n     * @param {Object} options An optional object containing the following properties:\n     * @param {string|string[]} [options.text_pair=null] Optional second sequence to be encoded. If set, must be the same type as text.\n     * @param {boolean|'max_length'} [options.padding=false] Whether to pad the input sequences.\n     * @param {boolean} [options.add_special_tokens=true] Whether or not to add the special tokens associated with the corresponding model.\n     * @param {boolean} [options.truncation=null] Whether to truncate the input sequences.\n     * @param {number} [options.max_length=null] Maximum length of the returned list and optionally padding length.\n     * @param {boolean} [options.return_tensor=true] Whether to return the results as Tensors or arrays.\n     * @param {boolean} [options.return_token_type_ids=null] Whether to return the token type ids.\n     * @returns {BatchEncoding} Object to be passed to the model.\n     */\n    _call(\n        // Required positional arguments\n        text,\n\n        // Optional keyword arguments\n        {\n            text_pair = null,\n            add_special_tokens = true,\n            padding = false,\n            truncation = null,\n            max_length = null,\n            return_tensor = true, // Different to HF\n            return_token_type_ids = null,\n        } = {},\n    ) {\n\n        const isBatched = Array.isArray(text);\n\n        /** @type {EncodingSingle[]} */\n        let encodedTokens;\n\n        if (isBatched) {\n            if (text.length === 0) {\n                throw Error('text array must be non-empty')\n            }\n\n            if (text_pair !== null) {\n                if (!Array.isArray(text_pair)) {\n                    throw Error('text_pair must also be an array')\n\n                } else if (text.length !== text_pair.length) {\n                    throw Error('text and text_pair must have the same length')\n                }\n\n                encodedTokens = text.map(\n                    (t, i) => this._encode_plus(t, { text_pair: text_pair[i], add_special_tokens, return_token_type_ids })\n                )\n\n            } else {\n                encodedTokens = text.map(x => this._encode_plus(x, { add_special_tokens, return_token_type_ids }));\n            }\n\n        } else {\n            if (text === null || text === undefined) {\n                throw Error('text may not be null or undefined')\n            }\n\n            if (Array.isArray(text_pair)) {\n                throw Error('When specifying `text_pair`, since `text` is a string, `text_pair` must also be a string (i.e., not an array).')\n            }\n\n            // For single input, we just wrap in an array, and then unwrap later.\n            encodedTokens = [this._encode_plus(text, { text_pair, add_special_tokens, return_token_type_ids })];\n        }\n        // At this point, `encodedTokens` is batched, of shape [batch_size, tokens].\n        // However, array may be jagged. So, we may need pad to max_length.\n        if (max_length === null) {\n            max_length = this.model_max_length;\n        } else if (truncation === null) {\n            if (padding === true) {\n                console.warn(\n                    \"`max_length` is ignored when `padding: true` and there is no truncation strategy. \" +\n                    \"To pad to max length, use `padding: 'max_length'`.\"\n                )\n                max_length = this.model_max_length;\n            } else if (padding === false) {\n                console.warn(\"Truncation was not explicitly activated but `max_length` is provided a specific value, please use `truncation: true` to explicitly truncate examples to max length.\");\n                truncation = true;\n            }\n        }\n\n        // padding: 'max_length' doesn't require any additional calculation\n        // but padding: true has to calculate max_length from the sequences\n        if (padding === true) {\n            max_length = Math.min(max(encodedTokens.map(x => x.input_ids.length))[0], max_length ?? Infinity);\n        }\n\n        // Ensure it is less than model max length\n        max_length = Math.min(max_length, this.model_max_length ?? Infinity);\n\n        if (padding || truncation) {\n\n            // Perform padding and/or truncation\n            for (let i = 0; i < encodedTokens.length; ++i) {\n                if (encodedTokens[i].input_ids.length === max_length) {\n                    continue;\n\n                } else if (encodedTokens[i].input_ids.length > max_length) {\n                    // possibly truncate\n                    if (truncation) {\n                        truncateHelper(encodedTokens[i], max_length);\n                    }\n\n                } else { // t.length < max_length\n                    // possibly pad\n                    if (padding) {\n                        padHelper(\n                            encodedTokens[i],\n                            max_length,\n                            key => key === 'input_ids' ? this.pad_token_id : 0,\n                            this.padding_side\n                        );\n                    }\n                }\n            }\n        }\n\n        const result = {};\n\n        if (return_tensor) {\n            if (!(padding && truncation)) {\n                // Not, guaranteed that all items have same length, so\n                // we perform additional check\n\n                if (\n                    encodedTokens.some(x => {\n                        for (const key of Object.keys(x)) {\n                            if (x[key].length !== encodedTokens[0][key]?.length) {\n                                return true;\n                            }\n                        }\n                        return false;\n                    })\n                ) {\n                    throw Error(\n                        \"Unable to create tensor, you should probably activate truncation and/or padding \" +\n                        \"with 'padding=true' and 'truncation=true' to have batched tensors with the same length.\"\n                    )\n                }\n            }\n\n            // Now we actually convert to tensor\n            // NOTE: In the same way as the python library, we return a batched tensor, regardless of\n            // whether we have a single input or multiple inputs.\n            const dims = [encodedTokens.length, encodedTokens[0].input_ids.length];\n\n            for (const key of Object.keys(encodedTokens[0])) {\n                result[key] = new Tensor('int64',\n                    BigInt64Array.from(encodedTokens.flatMap(x => x[key]).map(BigInt)),\n                    dims\n                );\n            }\n\n        } else {\n            for (const key of Object.keys(encodedTokens[0])) {\n                result[key] = encodedTokens.map(x => x[key]);\n            }\n\n            // If not returning a tensor, we match the input type\n            if (!isBatched) {\n                // Input was not batched, so we unwrap\n                for (const key of Object.keys(result)) {\n                    result[key] = result[key][0];\n                }\n            }\n        }\n\n        return /** @type {BatchEncoding} */(result);\n    }\n\n    /**\n     * Encodes a single text using the preprocessor pipeline of the tokenizer.\n     *\n     * @param {string|null} text The text to encode.\n     * @returns {string[]|null} The encoded tokens.\n     */\n    _encode_text(text) {\n        if (text === null) return null;\n\n        // Actual function which does encoding, for a single text\n        // First, we take care of special tokens. Needed to avoid issues arising from\n        // normalization and/or pretokenization (which may not preserve special tokens)\n        const sections = this.added_tokens_splitter.split(text);\n\n        // Process left/right stripping of added tokens\n        for (let i = 0; i < sections.length; ++i) {\n            const addedToken = this.added_tokens_map.get(sections[i]);\n            if (addedToken) {\n                if (addedToken.lstrip && i > 0) {\n                    sections[i - 1] = sections[i - 1].trimEnd();\n                }\n                if (addedToken.rstrip && i < sections.length - 1) {\n                    sections[i + 1] = sections[i + 1].trimStart();\n                }\n            }\n        }\n\n        const tokens = sections.flatMap((x, section_index) => {\n            if (x.length === 0) return [];\n            if (this.added_tokens_map.has(x)) return [x]; // Return added tokens unchanged\n\n            if (this.remove_space === true) {\n                x = x.trim().split(/\\s+/).join(' ');\n            }\n            if (this.do_lowercase_and_remove_accent) {\n                x = lowercase_and_remove_accent(x);\n            }\n\n            if (this.normalizer !== null) {\n                x = this.normalizer(x);\n            }\n\n            // If, after normalization, this section is empty (e.g., trimming whitespace),\n            // we return an empty array\n            if (x.length === 0) {\n                return [];\n            }\n\n            const sectionTokens = (this.pre_tokenizer !== null) ? this.pre_tokenizer(x, {\n                section_index,\n            }) : [x];\n\n            const tokens = this.model(sectionTokens);\n\n            return tokens;\n        });\n\n        return tokens;\n    }\n\n    /**\n     * Encodes a single text or a pair of texts using the model's tokenizer.\n     *\n     * @param {string} text The text to encode.\n     * @param {Object} options An optional object containing the following properties:\n     * @param {string} [options.text_pair=null] The optional second text to encode.\n     * @param {boolean} [options.add_special_tokens=true] Whether or not to add the special tokens associated with the corresponding model.\n     * @param {boolean} [options.return_token_type_ids=null] Whether to return token_type_ids.\n     * @returns {EncodingSingle} An object containing the encoded text.\n     * @private\n     */\n    _encode_plus(text, {\n        text_pair = null,\n        add_special_tokens = true,\n        return_token_type_ids = null,\n    } = {}) {\n\n        const { tokens, token_type_ids } = this._tokenize_helper(text, { pair: text_pair, add_special_tokens });\n\n        const input_ids = this.model.convert_tokens_to_ids(tokens);\n\n        const result = {\n            input_ids,\n            attention_mask: new Array(input_ids.length).fill(1),\n        }\n        if ((return_token_type_ids ?? this.return_token_type_ids) && token_type_ids) {\n            result.token_type_ids = token_type_ids;\n        }\n        return result;\n    }\n\n    /**\n     * Internal helper function to tokenize a text, and optionally a pair of texts.\n     * @param {string} text The text to tokenize.\n     * @param {Object} options An optional object containing the following properties:\n     * @param {string} [options.pair=null] The optional second text to tokenize.\n     * @param {boolean} [options.add_special_tokens=false] Whether or not to add the special tokens associated with the corresponding model.\n     * @returns {{tokens: string[], token_type_ids?: number[]}} An object containing the tokens and optionally the token type IDs.\n     */\n    _tokenize_helper(text, {\n        pair = null,\n        add_special_tokens = false,\n    } = {}) {\n        const tokens = this._encode_text(text);\n        const tokens2 = this._encode_text(pair);\n\n        return this.post_processor\n            ? this.post_processor(tokens, tokens2, { add_special_tokens })\n            : { tokens: mergeArrays(tokens ?? [], tokens2 ?? []) };\n    }\n\n    /**\n     * Converts a string into a sequence of tokens.\n     * @param {string} text The sequence to be encoded.\n     * @param {Object} options An optional object containing the following properties:\n     * @param {string} [options.pair] A second sequence to be encoded with the first.\n     * @param {boolean} [options.add_special_tokens=false] Whether or not to add the special tokens associated with the corresponding model.\n     * @returns {string[]} The list of tokens.\n     */\n    tokenize(text, {\n        pair = null,\n        add_special_tokens = false,\n    } = {}) {\n        return this._tokenize_helper(text, { pair, add_special_tokens }).tokens;\n    }\n\n    /**\n     * Encodes a single text or a pair of texts using the model's tokenizer.\n     *\n     * @param {string} text The text to encode.\n     * @param {Object} options An optional object containing the following properties:\n     * @param {string} [options.text_pair=null] The optional second text to encode.\n     * @param {boolean} [options.add_special_tokens=true] Whether or not to add the special tokens associated with the corresponding model.\n     * @param {boolean} [options.return_token_type_ids=null] Whether to return token_type_ids.\n     * @returns {number[]} An array of token IDs representing the encoded text(s).\n     */\n    encode(text, {\n        text_pair = null,\n        add_special_tokens = true,\n        return_token_type_ids = null,\n    } = {}) {\n        return this._encode_plus(text, {\n            text_pair,\n            add_special_tokens,\n            return_token_type_ids,\n        }).input_ids;\n    }\n\n    /**\n     * Decode a batch of tokenized sequences.\n     * @param {number[][]|Tensor} batch List/Tensor of tokenized input sequences.\n     * @param {Object} decode_args (Optional) Object with decoding arguments.\n     * @returns {string[]} List of decoded sequences.\n     */\n    batch_decode(batch, decode_args = {}) {\n        if (batch instanceof Tensor) {\n            batch = batch.tolist();\n        }\n        return batch.map(x => this.decode(x, decode_args));\n    }\n\n    /**\n     * Decodes a sequence of token IDs back to a string.\n     *\n     * @param {number[]|bigint[]|Tensor} token_ids List/Tensor of token IDs to decode.\n     * @param {Object} [decode_args={}]\n     * @param {boolean} [decode_args.skip_special_tokens=false] If true, special tokens are removed from the output string.\n     * @param {boolean} [decode_args.clean_up_tokenization_spaces=true] If true, spaces before punctuations and abbreviated forms are removed.\n     *\n     * @returns {string} The decoded string.\n     * @throws {Error} If `token_ids` is not a non-empty array of integers.\n     */\n    decode(\n        token_ids,\n        decode_args = {},\n    ) {\n        if (token_ids instanceof Tensor) {\n            token_ids = prepareTensorForDecode(token_ids);\n        }\n\n        if (!Array.isArray(token_ids) || token_ids.length === 0 || !isIntegralNumber(token_ids[0])) {\n            throw Error(\"token_ids must be a non-empty array of integers.\");\n        }\n\n        return this.decode_single(token_ids, decode_args)\n    }\n\n    /**\n     * Decode a single list of token ids to a string.\n     * @param {number[]|bigint[]} token_ids List of token ids to decode\n     * @param {Object} decode_args Optional arguments for decoding\n     * @param {boolean} [decode_args.skip_special_tokens=false] Whether to skip special tokens during decoding\n     * @param {boolean} [decode_args.clean_up_tokenization_spaces=null] Whether to clean up tokenization spaces during decoding.\n     * If null, the value is set to `this.decoder.cleanup` if it exists, falling back to `this.clean_up_tokenization_spaces` if it exists, falling back to `true`.\n     * @returns {string} The decoded string\n     */\n    decode_single(\n        token_ids,\n        {\n            skip_special_tokens = false,\n            clean_up_tokenization_spaces = null,\n        }\n    ) {\n        let tokens = this.model.convert_ids_to_tokens(token_ids);\n        if (skip_special_tokens) {\n            tokens = tokens.filter(x => !this.special_tokens.includes(x));\n        }\n\n        // If `this.decoder` is null, we just join tokens with a space:\n        // https://github.com/huggingface/tokenizers/blob/8edec536a737cb04494b454805be16c020abb14f/tokenizers/src/tokenizer/mod.rs#L835\n        /** @type {string} */\n        let decoded = this.decoder ? this.decoder(tokens) : tokens.join(' ');\n\n        // Slight hack, but prevents having to pass `skip_special_tokens` to\n        // each call to `decode`, which would lead to code duplication.\n        if (this.decoder && this.decoder.end_of_word_suffix) {\n            decoded = decoded.replaceAll(this.decoder.end_of_word_suffix, ' ');\n            if (skip_special_tokens) {\n                decoded = decoded.trim();\n            }\n        }\n\n        if (clean_up_tokenization_spaces ?? this.clean_up_tokenization_spaces) {\n            decoded = clean_up_tokenization(decoded);\n        }\n\n        return decoded;\n    }\n\n    /**\n     * Retrieve the chat template string used for tokenizing chat messages. This template is used\n     * internally by the `apply_chat_template` method and can also be used externally to retrieve the model's chat\n     * template for better generation tracking.\n     * \n     * @param {Object} options An optional object containing the following properties:\n     * @param {string} [options.chat_template=null]\n     * A Jinja template or the name of a template to use for this conversion.\n     * It is usually not necessary to pass anything to this argument,\n     * as the model's template will be used by default.\n     * @param {Object[]} [options.tools=null]\n     * A list of tools (callable functions) that will be accessible to the model. If the template does not\n     * support function calling, this argument will have no effect. Each tool should be passed as a JSON Schema,\n     * giving the name, description and argument types for the tool. See our\n     * [chat templating guide](https://huggingface.co/docs/transformers/main/en/chat_templating#automated-function-conversion-for-tool-use)\n     * for more information.\n     * @returns {string} The chat template string.\n     */\n    get_chat_template({\n        chat_template = null,\n        tools = null,\n    } = {}) {\n\n        // First, handle the cases when the model has a dict of multiple templates\n        if (this.chat_template && typeof this.chat_template === 'object') {\n            const template_dict = this.chat_template;\n\n            if (chat_template !== null && Object.hasOwn(template_dict, chat_template)) {\n                // The user can pass the name of a template to the chat template argument instead of an entire template\n                chat_template = template_dict[chat_template];\n            } else if (chat_template === null) {\n                if (tools !== null && 'tool_use' in template_dict) {\n                    chat_template = template_dict['tool_use'];\n                } else if ('default' in template_dict) {\n                    chat_template = template_dict['default'];\n                } else {\n                    throw Error(\n                        `This model has multiple chat templates with no default specified! Please either pass a chat ` +\n                        `template or the name of the template you wish to use to the 'chat_template' argument. Available ` +\n                        `template names are ${Object.keys(template_dict).sort()}.`\n                    )\n                }\n            }\n        } else if (chat_template === null) {\n            // These are the cases when the model has a single template\n            // priority: `chat_template` argument > `tokenizer.chat_template`\n            if (this.chat_template) {\n                chat_template = this.chat_template;\n            } else {\n                throw Error(\n                    \"Cannot use apply_chat_template() because tokenizer.chat_template is not set and no template \" +\n                    \"argument was passed! For information about writing templates and setting the \" +\n                    \"tokenizer.chat_template attribute, please see the documentation at \" +\n                    \"https://huggingface.co/docs/transformers/main/en/chat_templating\"\n                )\n            }\n        }\n        return chat_template;\n    }\n\n    /**\n     * Converts a list of message objects with `\"role\"` and `\"content\"` keys to a list of token\n     * ids. This method is intended for use with chat models, and will read the tokenizer's chat_template attribute to\n     * determine the format and control tokens to use when converting.\n     * \n     * See [here](https://huggingface.co/docs/transformers/chat_templating) for more information.\n     * \n     * **Example:** Applying a chat template to a conversation.\n     * \n     * ```javascript\n     * import { AutoTokenizer } from \"@huggingface/transformers\";\n     * \n     * const tokenizer = await AutoTokenizer.from_pretrained(\"Xenova/mistral-tokenizer-v1\");\n     * \n     * const chat = [\n     *   { \"role\": \"user\", \"content\": \"Hello, how are you?\" },\n     *   { \"role\": \"assistant\", \"content\": \"I'm doing great. How can I help you today?\" },\n     *   { \"role\": \"user\", \"content\": \"I'd like to show off how chat templating works!\" },\n     * ]\n     * \n     * const text = tokenizer.apply_chat_template(chat, { tokenize: false });\n     * // \"<s>[INST] Hello, how are you? [/INST]I'm doing great. How can I help you today?</s> [INST] I'd like to show off how chat templating works! [/INST]\"\n     * \n     * const input_ids = tokenizer.apply_chat_template(chat, { tokenize: true, return_tensor: false });\n     * // [1, 733, 16289, 28793, 22557, 28725, 910, 460, 368, 28804, 733, 28748, 16289, 28793, 28737, 28742, 28719, 2548, 1598, 28723, 1602, 541, 315, 1316, 368, 3154, 28804, 2, 28705, 733, 16289, 28793, 315, 28742, 28715, 737, 298, 1347, 805, 910, 10706, 5752, 1077, 3791, 28808, 733, 28748, 16289, 28793]\n     * ```\n     * \n     * @param {Message[]} conversation A list of message objects with `\"role\"` and `\"content\"` keys,\n     * representing the chat history so far.\n     * @param {Object} options An optional object containing the following properties:\n     * @param {string} [options.chat_template=null] A Jinja template to use for this conversion. If\n     * this is not passed, the model's chat template will be used instead.\n     * @param {Object[]} [options.tools=null]\n     * A list of tools (callable functions) that will be accessible to the model. If the template does not\n     * support function calling, this argument will have no effect. Each tool should be passed as a JSON Schema,\n     * giving the name, description and argument types for the tool. See our\n     * [chat templating guide](https://huggingface.co/docs/transformers/main/en/chat_templating#automated-function-conversion-for-tool-use)\n     * for more information.\n     * @param {Record<string, string>[]} [options.documents=null]\n     * A list of dicts representing documents that will be accessible to the model if it is performing RAG\n     * (retrieval-augmented generation). If the template does not support RAG, this argument will have no\n     * effect. We recommend that each document should be a dict containing \"title\" and \"text\" keys. Please\n     * see the RAG section of the [chat templating guide](https://huggingface.co/docs/transformers/main/en/chat_templating#arguments-for-RAG)\n     * for examples of passing documents with chat templates.\n     * @param {boolean} [options.add_generation_prompt=false] Whether to end the prompt with the token(s) that indicate\n     * the start of an assistant message. This is useful when you want to generate a response from the model.\n     * Note that this argument will be passed to the chat template, and so it must be supported in the\n     * template for this argument to have any effect.\n     * @param {boolean} [options.tokenize=true] Whether to tokenize the output. If false, the output will be a string.\n     * @param {boolean} [options.padding=false] Whether to pad sequences to the maximum length. Has no effect if tokenize is false.\n     * @param {boolean} [options.truncation=false] Whether to truncate sequences to the maximum length. Has no effect if tokenize is false.\n     * @param {number} [options.max_length=null] Maximum length (in tokens) to use for padding or truncation. Has no effect if tokenize is false.\n     * If not specified, the tokenizer's `max_length` attribute will be used as a default.\n     * @param {boolean} [options.return_tensor=true] Whether to return the output as a Tensor or an Array. Has no effect if tokenize is false.\n     * @param {boolean} [options.return_dict=true] Whether to return a dictionary with named outputs. Has no effect if tokenize is false.\n     * @param {Object} [options.tokenizer_kwargs={}] Additional options to pass to the tokenizer.\n     * @returns {string | Tensor | number[]| number[][]|BatchEncoding} The tokenized output.\n     */\n    apply_chat_template(conversation, {\n        tools = null,\n        documents = null,\n        chat_template = null,\n        add_generation_prompt = false,\n        tokenize = true,\n        padding = false,\n        truncation = false,\n        max_length = null,\n        return_tensor = true,\n        return_dict = false,\n        tokenizer_kwargs = {},\n        ...kwargs\n    } = {}) {\n\n        chat_template = this.get_chat_template({ chat_template, tools });\n\n        if (typeof chat_template !== 'string') {\n            throw Error(`chat_template must be a string, but got ${typeof chat_template}`);\n        }\n\n        // Compilation function uses a cache to avoid recompiling the same template\n        let compiledTemplate = this._compiled_template_cache.get(chat_template);\n        if (compiledTemplate === undefined) {\n            compiledTemplate = new Template(chat_template);\n            this._compiled_template_cache.set(chat_template, compiledTemplate);\n        }\n\n        const special_tokens_map = Object.create(null);\n        for (const key of SPECIAL_TOKEN_ATTRIBUTES) {\n            const value = this.getToken(key);\n            if (value) {\n                special_tokens_map[key] = value;\n            }\n        }\n\n        const rendered = compiledTemplate.render({\n            messages: conversation,\n            add_generation_prompt,\n            tools,\n            documents,\n            ...special_tokens_map,\n            ...kwargs,\n        });\n\n        if (tokenize) {\n            const out = this._call(rendered, {\n                add_special_tokens: false,\n                padding,\n                truncation,\n                max_length,\n                return_tensor,\n                ...tokenizer_kwargs,\n            });\n            return return_dict ? out : out.input_ids;\n        }\n\n        return rendered;\n    }\n}\n\n/**\n * BertTokenizer is a class used to tokenize text for BERT models.\n * @extends PreTrainedTokenizer\n */\nexport class BertTokenizer extends PreTrainedTokenizer {\n    return_token_type_ids = true;\n}\n/**\n * Albert tokenizer\n * @extends PreTrainedTokenizer\n */\nexport class AlbertTokenizer extends PreTrainedTokenizer {\n    return_token_type_ids = true;\n}\nexport class MobileBertTokenizer extends PreTrainedTokenizer {\n    return_token_type_ids = true;\n}\nexport class SqueezeBertTokenizer extends PreTrainedTokenizer {\n    return_token_type_ids = true;\n}\nexport class DebertaTokenizer extends PreTrainedTokenizer {\n    return_token_type_ids = true;\n}\nexport class DebertaV2Tokenizer extends PreTrainedTokenizer {\n    return_token_type_ids = true;\n}\nexport class HerbertTokenizer extends PreTrainedTokenizer {\n    return_token_type_ids = true;\n}\nexport class ConvBertTokenizer extends PreTrainedTokenizer {\n    return_token_type_ids = true;\n}\nexport class RoFormerTokenizer extends PreTrainedTokenizer {\n    return_token_type_ids = true;\n}\nexport class DistilBertTokenizer extends PreTrainedTokenizer { }\nexport class CamembertTokenizer extends PreTrainedTokenizer { }\nexport class XLMTokenizer extends PreTrainedTokenizer {\n    return_token_type_ids = true;\n\n    constructor(tokenizerJSON, tokenizerConfig) {\n        super(tokenizerJSON, tokenizerConfig);\n        console.warn('WARNING: `XLMTokenizer` is not yet supported by Hugging Face\\'s \"fast\" tokenizers library. Therefore, you may experience slightly inaccurate results.')\n    }\n}\nexport class ElectraTokenizer extends PreTrainedTokenizer {\n    return_token_type_ids = true;\n}\n\nexport class T5Tokenizer extends PreTrainedTokenizer { }\nexport class GPT2Tokenizer extends PreTrainedTokenizer { }\nexport class BartTokenizer extends PreTrainedTokenizer { }\nexport class MBartTokenizer extends PreTrainedTokenizer {\n    constructor(tokenizerJSON, tokenizerConfig) {\n        super(tokenizerJSON, tokenizerConfig);\n\n        this.languageRegex = /^[a-z]{2}_[A-Z]{2}$/;\n        this.language_codes = this.special_tokens.filter(x => this.languageRegex.test(x));\n        this.lang_to_token = x => x; // Identity function\n    }\n\n    /**\n     * Helper function to build translation inputs for an `MBartTokenizer`.\n     * @param {string|string[]} raw_inputs The text to tokenize.\n     * @param {Object} tokenizer_options Options to be sent to the tokenizer\n     * @param {Object} generate_kwargs Generation options.\n     * @returns {Object} Object to be passed to the model.\n     */\n    _build_translation_inputs(raw_inputs, tokenizer_options, generate_kwargs) {\n        return _build_translation_inputs(this, raw_inputs, tokenizer_options, generate_kwargs);\n    }\n}\nexport class MBart50Tokenizer extends MBartTokenizer { } // NOTE: extends MBartTokenizer\n\nexport class RobertaTokenizer extends PreTrainedTokenizer { }\n\nexport class BloomTokenizer extends PreTrainedTokenizer { }\n\nconst SPIECE_UNDERLINE = \"\u2581\";\n\nexport class LlamaTokenizer extends PreTrainedTokenizer {\n\n    padding_side = 'left';\n\n    constructor(tokenizerJSON, tokenizerConfig) {\n        super(tokenizerJSON, tokenizerConfig);\n\n        this.legacy = tokenizerConfig.legacy ?? true;\n        if (!this.legacy) {\n            // See https://github.com/huggingface/transformers/pull/24565 for more information\n            this.normalizer = null;\n            this.pre_tokenizer = new MetaspacePreTokenizer({\n                replacement: SPIECE_UNDERLINE,\n                prepend_scheme: \"first\",\n            });\n        }\n    }\n\n    /**\n     * Helper function to handle legacy encoding of SPM tokenizers.\n     * Adapted from https://github.com/huggingface/transformers/blob/e6dcf8abd6f65bb4b6dfc1831b20d9ba49ce00e2/src/transformers/models/t5/tokenization_t5.py#L374-L387\n     * @param {string} text The text to encode.\n     * @returns {string[]} The encoded tokens.\n     */\n    _encode_text(text) {\n        if (text === null) return null;\n\n        if (this.legacy || text.length === 0) {\n            return super._encode_text(text);\n        }\n\n        let tokens = super._encode_text(SPIECE_UNDERLINE + text.replaceAll(SPIECE_UNDERLINE, \" \"));\n        if (tokens.length > 1 && tokens[0] === SPIECE_UNDERLINE && this.special_tokens.includes(tokens[1])) {\n            tokens = tokens.slice(1);\n        }\n        return tokens;\n    }\n}\nexport class CodeLlamaTokenizer extends PreTrainedTokenizer { }\n\nexport class XLMRobertaTokenizer extends PreTrainedTokenizer { }\nexport class MPNetTokenizer extends PreTrainedTokenizer { }\n\nexport class FalconTokenizer extends PreTrainedTokenizer { }\n\nexport class GPTNeoXTokenizer extends PreTrainedTokenizer { }\n\nexport class EsmTokenizer extends PreTrainedTokenizer { }\n\nexport class Qwen2Tokenizer extends PreTrainedTokenizer { }\n\nexport class GemmaTokenizer extends PreTrainedTokenizer { }\n\nexport class Grok1Tokenizer extends PreTrainedTokenizer { }\n\n/**\n * Helper function to build translation inputs for an `NllbTokenizer` or `M2M100Tokenizer`.\n * @param {PreTrainedTokenizer} self The tokenizer instance.\n * @param {string|string[]} raw_inputs The text to tokenize.\n * @param {Object} tokenizer_options Options to be sent to the tokenizer\n * @param {Object} generate_kwargs Generation options.\n * @returns {Object} Object to be passed to the model.\n * @private\n */\nfunction _build_translation_inputs(self, raw_inputs, tokenizer_options, generate_kwargs) {\n    if (!('language_codes' in self) || !Array.isArray(self.language_codes)) {\n        throw new Error('Tokenizer must have `language_codes` attribute set and it should be an array of language ids.')\n    }\n    if (!('languageRegex' in self) || !(self.languageRegex instanceof RegExp)) {\n        throw new Error('Tokenizer must have `languageRegex` attribute set and it should be a regular expression.')\n    }\n    if (!('lang_to_token' in self) || typeof self.lang_to_token !== 'function') {\n        throw new Error('Tokenizer must have `lang_to_token` attribute set and it should be a function.')\n    }\n    const src_lang_token = generate_kwargs.src_lang;\n    const tgt_lang_token = generate_kwargs.tgt_lang;\n\n    // Check that the target language is valid:\n    if (!self.language_codes.includes(tgt_lang_token)) {\n        throw new Error(`Target language code \"${tgt_lang_token}\" is not valid. Must be one of: {${self.language_codes.join(', ')}}`);\n    }\n\n    // Allow `src_lang` to be optional. If not set, we'll use the tokenizer's default.\n    if (src_lang_token !== undefined) {\n        // Check that the source language is valid:\n        if (!self.language_codes.includes(src_lang_token)) {\n            throw new Error(`Source language code \"${src_lang_token}\" is not valid. Must be one of: {${self.language_codes.join(', ')}}`);\n        }\n\n        // In the same way as the Python library, we override the post-processor\n        // to force the source language to be first:\n        for (const item of self.post_processor.config.single) {\n            if ('SpecialToken' in item && self.languageRegex.test(item.SpecialToken.id)) {\n                item.SpecialToken.id = self.lang_to_token(src_lang_token);\n                break;\n            }\n        }\n        // TODO: Do the same for pair?\n    }\n\n    // Override the `forced_bos_token_id` to force the correct language\n    generate_kwargs.forced_bos_token_id = self.model.convert_tokens_to_ids([self.lang_to_token(tgt_lang_token)])[0];\n\n    return self._call(raw_inputs, tokenizer_options);\n}\n\n/**\n * The NllbTokenizer class is used to tokenize text for NLLB (\"No Language Left Behind\") models.\n * \n * No Language Left Behind (NLLB) is a first-of-its-kind, AI breakthrough project\n * that open-sources models capable of delivering high-quality translations directly\n * between any pair of 200+ languages \u2014 including low-resource languages like Asturian,\n * Luganda, Urdu and more. It aims to help people communicate with anyone, anywhere,\n * regardless of their language preferences. For more information, check out their\n * [paper](https://huggingface.co/papers/2207.04672).\n * \n * For a list of supported languages (along with their language codes),\n * @see {@link https://github.com/facebookresearch/flores/blob/main/flores200/README.md#languages-in-flores-200}\n */\nexport class NllbTokenizer extends PreTrainedTokenizer {\n\n    constructor(tokenizerJSON, tokenizerConfig) {\n        super(tokenizerJSON, tokenizerConfig);\n\n        this.languageRegex = /^[a-z]{3}_[A-Z][a-z]{3}$/;\n        this.language_codes = this.special_tokens.filter(x => this.languageRegex.test(x));\n        this.lang_to_token = x => x; // Identity function\n    }\n\n    /**\n     * Helper function to build translation inputs for an `NllbTokenizer`.\n     * @param {string|string[]} raw_inputs The text to tokenize.\n     * @param {Object} tokenizer_options Options to be sent to the tokenizer\n     * @param {Object} generate_kwargs Generation options.\n     * @returns {Object} Object to be passed to the model.\n     */\n    _build_translation_inputs(raw_inputs, tokenizer_options, generate_kwargs) {\n        return _build_translation_inputs(this, raw_inputs, tokenizer_options, generate_kwargs);\n    }\n}\n\n/**\n * The M2M100Tokenizer class is used to tokenize text for M2M100 (\"Many-to-Many\") models.\n * \n * M2M100 is a multilingual encoder-decoder (seq-to-seq) model trained for Many-to-Many\n * multilingual translation. It was introduced in this [paper](https://huggingface.co/papers/2010.11125)\n * and first released in [this](https://github.com/pytorch/fairseq/tree/master/examples/m2m_100) repository.\n * \n * For a list of supported languages (along with their language codes),\n * @see {@link https://huggingface.co/facebook/m2m100_418M#languages-covered}\n */\nexport class M2M100Tokenizer extends PreTrainedTokenizer {\n    constructor(tokenizerJSON, tokenizerConfig) {\n        super(tokenizerJSON, tokenizerConfig);\n\n        this.languageRegex = /^__[a-z]{2,3}__$/;\n        this.language_codes = this.special_tokens\n            .filter(x => this.languageRegex.test(x))\n            .map(x => x.slice(2, -2));\n        this.lang_to_token = x => `__${x}__`;\n    }\n\n    /**\n     * Helper function to build translation inputs for an `M2M100Tokenizer`.\n     * @param {string|string[]} raw_inputs The text to tokenize.\n     * @param {Object} tokenizer_options Options to be sent to the tokenizer\n     * @param {Object} generate_kwargs Generation options.\n     * @returns {Object} Object to be passed to the model.\n     */\n    _build_translation_inputs(raw_inputs, tokenizer_options, generate_kwargs) {\n        return _build_translation_inputs(this, raw_inputs, tokenizer_options, generate_kwargs);\n    }\n}\n\n/**\n * WhisperTokenizer tokenizer\n * @extends PreTrainedTokenizer\n */\nexport class WhisperTokenizer extends PreTrainedTokenizer {\n\n    get timestamp_begin() {\n        return this.model.convert_tokens_to_ids([\"<|notimestamps|>\"])[0] + 1;\n    }\n\n    /**\n     * Decodes automatic speech recognition (ASR) sequences.\n     * @param {Array<{tokens: bigint[], token_timestamps?: number[], stride: number[]}>} sequences The sequences to decode.\n     * @param {Object} options The options to use for decoding.\n     * @returns {Array<string|{chunks?: undefined|Array<{language: string|null, timestamp: Array<number|null>, text: string}>}>} The decoded sequences.\n     */\n    _decode_asr(sequences, {\n        return_timestamps = false,\n        return_language = false,\n        time_precision = null,\n        force_full_sequences = true\n    } = {}) {\n        // Set force_full_sequences=false if you want streaming\n        // TODO add support for `return_language`\n\n        // Internal method meant to only be used by asr pipeline.\n        // Handles all the little quirks specific to whisper to handle\n        // the various options not allowed in other seq2seq models\n\n        // =========== Overview ============\n        // - iterate over all outputs\n        // - all tokens within output\n        // - Each token can be\n        //   - language token\n        //   - special token\n        //   - timestamp token\n        //   - text token\n        // - We accumulate the text tokens.\n        // - We split on end timestamps\n        // - Lots of complexity comes from stride and timestamps\n\n        if (time_precision === null) {\n            throw Error(\"Must specify time_precision\")\n        }\n        let last_language = null;\n\n        const returnWordTimestamps = return_timestamps === \"word\";\n\n        function new_chunk() {\n            return { \"language\": last_language, \"timestamp\": [null, null], \"text\": \"\" };\n        }\n\n        // Welcome to the state machine!\n        const chunks = [];\n        let chunk = new_chunk();\n        let time_offset = 0.0;\n        const timestamp_begin = this.timestamp_begin;\n        // Whisper timestamp tokens start from 0.00 and go to timestamp 30.00 in 0.02 increments. \n        // We can calculate the last time stamp token as timestamp_begin plus the number of tokens \n        // tokens from 0.00 to 30.00 which is 1500. \n        const total_timestamp_tokens = 1500; // (30.00 - 0.00) / 0.02\n        const timestamp_end = timestamp_begin + total_timestamp_tokens;\n\n        let previous_tokens = [];\n        let previous_token_timestamps = [];\n\n        let skip = false;\n        let right_stride_start = null;\n\n\n        const all_special_ids = new Set(this.all_special_ids);\n\n        for (const output of sequences) {\n            // NOTE: python version has batches, so it uses [0]\n            const token_ids = output.tokens;\n            const token_timestamps = returnWordTimestamps ? output.token_timestamps : null;\n\n            // These keep track of timestamps within strides, which need\n            // to be skipped and resolve all tokens in a single chunk.\n            let last_timestamp = null;\n            let first_timestamp = timestamp_begin;\n\n            if (\"stride\" in output) {\n                const [chunk_len, stride_left, stride_right] = output.stride;\n\n                // Offset the timings to account for the other `model_outputs`.\n                time_offset -= stride_left;\n                right_stride_start = chunk_len - stride_right;\n\n                // Keeping track of timestamps within strides\n                // We're going to NOT split on those, and delay until we're\n                // out of BOTH stride. Otherwise lots of issues occur and\n                // corner cases\n                if (stride_left) {\n                    first_timestamp = stride_left / time_precision + timestamp_begin;\n                }\n\n                if (stride_right) {\n                    for (let i = token_ids.length - 1; i >= 0; --i) {\n                        const token = Number(token_ids[i]);\n                        if (token >= timestamp_begin) {\n                            // There can be several token in the right stride\n                            // But the last one is ALWAYS going to be skipped\n                            if (last_timestamp !== null && (token - timestamp_begin) * time_precision < right_stride_start) {\n                                break;\n                            }\n                            last_timestamp = token;\n                        }\n                    }\n                }\n            }\n\n            let current_tokens = [];\n            let current_token_timestamps = [];\n\n            // - all tokens within output\n            for (let i = 0; i < token_ids.length; ++i) {\n                const token = Number(token_ids[i]);\n                // 4 possible states for each token\n                // - 1/ Language code\n                // - 2/ all other special tokens (which we ignore)\n                // - 3/ Timestamp\n                // - 4/ Regular text\n\n                if (all_special_ids.has(token)) {\n                    const text = this.decode([token]);\n                    const language = WHISPER_LANGUAGE_MAPPING.get(text.slice(2, -2));\n\n                    if (language !== undefined) {\n                        // 1/ Indeed some language\n                        // TODO Handle when language is different from the previous\n                        // one, and we cannot use timestamped tokens to create chunks\n                        if (last_language !== null && language !== last_language && !return_timestamps) {\n                            previous_tokens.push(current_tokens);\n                            const resolved_tokens = this.findLongestCommonSequence(previous_tokens)[0];\n                            const resolved_text = this.decode(resolved_tokens);\n                            chunk.text = resolved_text;\n                            chunks.push(chunk);\n\n                            // Flush all our temporary context\n                            previous_tokens = [];\n                            current_tokens = [];\n                            chunk = new_chunk();\n                        }\n\n                        last_language = chunk.language = language;\n                    } else {\n                        // 2/ This is a regular special token, ignoring it\n                    }\n                } else if (token >= timestamp_begin && token <= timestamp_end) {\n                    // 3/ Timestamp token\n                    const time = (token - timestamp_begin) * time_precision + time_offset;\n                    const rounded_time = round(time, 2);\n\n                    if (last_timestamp !== null && token >= last_timestamp) {\n                        // Whisper outputted a timestamp token, but it falls within\n                        // our stride, so we're going to skip it for the time being\n                        // and resolve this later\n                        // Skip is necessary because timestamp tokens always come\n                        // by pair, so we need to skip the next one too (which would mark the start of another chunk).\n                        skip = true;\n                    } else if (skip || (previous_tokens.length > 0 && token < first_timestamp)) {\n                        skip = false;\n                    } else if (chunk.timestamp[0] === null) {\n                        chunk.timestamp[0] = rounded_time;\n                    } else {\n                        // This is the end of the timestamp chunk\n                        if (rounded_time === chunk.timestamp[0]) {\n                            // This is a bug in timestamp token output\n                            // where we're taking the duplicate token\n                            // as a stop where it should be a start.\n                            // This is an issue in the underlying model output\n                            // Let's just skip it so it becomes de-factor a start agin\n                        } else {\n                            chunk.timestamp[1] = rounded_time;\n\n                            // Handling merges\n                            previous_tokens.push(current_tokens)\n\n                            if (returnWordTimestamps) {\n                                previous_token_timestamps.push(current_token_timestamps);\n                            }\n                            const [resolved_tokens, resolved_token_timestamps] = this.findLongestCommonSequence(\n                                previous_tokens, previous_token_timestamps\n                            )\n\n                            const resolved_text = this.decode(resolved_tokens)\n                            chunk.text = resolved_text\n\n                            if (returnWordTimestamps) {\n                                chunk.words = this.collateWordTimestamps(\n                                    resolved_tokens, resolved_token_timestamps, last_language,\n                                )\n                            }\n\n                            chunks.push(chunk)\n\n                            // Flush all our temporary context\n                            previous_tokens = []\n                            current_tokens = []\n                            previous_token_timestamps = []\n                            current_token_timestamps = []\n                            chunk = new_chunk()\n                        }\n                    }\n\n                } else {\n                    // 4/ Regular token\n                    // We just append to the list of all tokens so we can handle\n                    // merges later and decode into text.\n                    current_tokens.push(token)\n\n                    if (returnWordTimestamps) {\n                        let start_time = round(token_timestamps[i] + time_offset, 2);\n\n                        let end_time;\n                        if (i + 1 < token_timestamps.length) {\n                            end_time = round(token_timestamps[i + 1] + time_offset, 2);\n\n                            // Do not allow punctuation-only tokens to have a duration.\n                            // This prevents long pauses from messing up the timestamps.\n                            const decoded_text = this.decode([token]);\n                            if (PUNCTUATION_ONLY_REGEX.test(decoded_text)) {\n                                // Add `time_precision` to avoid overlapping timestamps\n                                end_time = round(Math.min(start_time + time_precision, end_time), 2);\n                            }\n                        } else {\n                            // should never happen\n                            end_time = null;\n                        }\n                        current_token_timestamps.push([start_time, end_time]);\n                    }\n\n                }\n            }\n\n            if ('stride' in output) {\n                const [chunk_len, stride_left, stride_right] = output.stride;\n                time_offset += chunk_len - stride_right\n            }\n\n            // Leftover tokens\n            if (current_tokens.length > 0) {\n                previous_tokens.push(current_tokens)\n                if (returnWordTimestamps) {\n                    previous_token_timestamps.push(current_token_timestamps);\n                }\n            } else if (previous_tokens.every(p => p.length === 0)) {\n                // Flushing previous tokens (END)\"\n                chunk = new_chunk()\n                previous_tokens = []\n                current_tokens = []\n                previous_token_timestamps = [];\n                current_token_timestamps = [];\n            }\n\n        }\n\n        if (previous_tokens.length > 0) {\n            if (force_full_sequences && return_timestamps) {\n                // Last token should always be timestamps, so there shouldn't be\n                // leftover\n                throw new Error(\n                    \"Whisper did not predict an ending timestamp, which can happen if audio is cut off in the middle of a word. \" +\n                    \"Also make sure WhisperTimeStampLogitsProcessor was used during generation.\"\n                );\n            }\n\n            // Happens when we don't use timestamps\n            const [resolved_tokens, resolved_token_timestamps] = this.findLongestCommonSequence(previous_tokens, previous_token_timestamps);\n\n            // Flushing previous tokens (FINAL)\n            const resolved_text = this.decode(resolved_tokens);\n            chunk.text = resolved_text;\n            if (returnWordTimestamps) {\n                chunk.words = this.collateWordTimestamps(\n                    resolved_tokens, resolved_token_timestamps, last_language,\n                )\n            }\n            chunks.push(chunk);\n        }\n\n        let optional = Object.create(null);\n\n        // Preparing and cleaning up the pipeline output\n        const full_text = chunks.map(chunk => chunk.text).join('');\n        if (return_timestamps || return_language) {\n            for (let i = 0; i < chunks.length; ++i) {\n                const chunk = chunks[i];\n                if (!return_timestamps) {\n                    delete chunk[\"timestamp\"];\n                }\n\n                if (!return_language) {\n                    delete chunk[\"language\"];\n                }\n            }\n            if (returnWordTimestamps) {\n                const new_chunks = [];\n                for (const chunk of chunks) {\n                    for (const word of chunk.words) {\n                        new_chunks.push(word);\n                    }\n                }\n                optional = { \"chunks\": new_chunks };\n            } else {\n                optional = { \"chunks\": chunks };\n            }\n        }\n        return [full_text, optional];\n\n    }\n\n    /**\n     * Finds the longest common sequence among the provided sequences.\n     * @param {number[][]} sequences An array of sequences of token ids to compare.\n     * @returns {number[][]} The longest common sequence found.\n     * @throws {Error} If there is a bug within the function.\n     * @private\n     */\n    findLongestCommonSequence(sequences, token_timestamp_sequences = null) {\n        // It would be much harder to do O(n) because of fault tolerance.\n        // We actually have a really good property which is that the total sequence\n        // MUST be those subsequences in order.\n        // If token_timestamp_sequences is provided, will split those sequences in\n        // exactly the same way.\n        let leftSequence = sequences[0];\n        let leftLength = leftSequence.length;\n        let totalSequence = [];\n\n        const use_token_timestamp_sequences = Array.isArray(token_timestamp_sequences) && token_timestamp_sequences.length > 0;\n        let total_token_timestamp_sequence = use_token_timestamp_sequences ? [] : null;\n        let left_token_timestamp_sequence = use_token_timestamp_sequences ? token_timestamp_sequences[0] : null;\n        for (let i = 1; i < sequences.length; ++i) {\n            const rightSequence = sequences[i];\n            let max = 0.0;\n            let maxIndices = [leftLength, leftLength, 0, 0];\n            // Here we're sliding matches\n            // [a, b, c, d]\n            //          [c, d, f]\n            // =        [c] == [d]\n\n            // [a, b, c, d]\n            //       [c, d, f]\n            // =     [c, d] == [c, d]\n\n\n            // [a, b, c, d]\n            //    [c, d, f]\n\n            // =  [b, c, d] == [c, d, f]\n\n            // [a, b, c, d]\n            // [c, d, f]\n\n            // [a, b, c] == [c, d, f]\n\n            // [a, b, c, d]\n            // [d, f]\n\n            // [a, b] == [d, f]\n\n            // [a, b, c, d]\n            // [f]\n\n            // [a] == [f]\n\n            const rightLength = rightSequence.length;\n            for (let j = 1; j < leftLength + rightLength; ++j) {\n                // Slightly convoluted because we don't want out of bound indices\n                // This will be necessary for a small conflict resolution optimization\n                // later\n                const leftStart = Math.max(0, leftLength - j);\n                const leftStop = Math.min(leftLength, leftLength + rightLength - j);\n                const left = leftSequence.slice(leftStart, leftStop);\n                const rightStart = Math.max(0, j - leftLength);\n                const rightStop = Math.min(rightLength, j);\n                const right = rightSequence.slice(rightStart, rightStop);\n                if (left.length !== right.length) {\n                    throw new Error(\"There is a bug within whisper `decode_asr` function, please report it. Dropping to prevent bad inference.\");\n                }\n\n                let matches;\n                if (use_token_timestamp_sequences) {\n                    // Get length of longest subsequence of tokens that match\n                    // and have timestamps that are in order\n                    matches = left.filter((elem, idx) => (\n                        elem === right[idx]\n                        && left_token_timestamp_sequence[leftStart + idx] <= token_timestamp_sequences[i][rightStart + idx]\n                    )).length;\n                } else {\n                    matches = left.filter((elem, idx) => elem === right[idx]).length;\n                }\n\n                // epsilon to favor long perfect matches\n                const eps = j / 10000.0;\n                const matching = matches / j + eps;\n                if (matches > 1 && matching > max) {\n                    max = matching;\n                    maxIndices = [leftStart, leftStop, rightStart, rightStop];\n                }\n            }\n            const [leftStart, leftStop, rightStart, rightStop] = maxIndices;\n            const leftMid = Math.floor((leftStop + leftStart) / 2);\n            const rightMid = Math.floor((rightStop + rightStart) / 2);\n            totalSequence.push(...leftSequence.slice(0, leftMid));\n            leftSequence = rightSequence.slice(rightMid);\n            leftLength = leftSequence.length;\n\n            if (use_token_timestamp_sequences) {\n                total_token_timestamp_sequence.push(...left_token_timestamp_sequence.slice(0, leftMid));\n                left_token_timestamp_sequence = token_timestamp_sequences[i].slice(rightMid);\n            }\n        }\n        totalSequence.push(...leftSequence);\n\n        if (use_token_timestamp_sequences) {\n            total_token_timestamp_sequence.push(...left_token_timestamp_sequence);\n            return [totalSequence, total_token_timestamp_sequence];\n        } else {\n            return [totalSequence, []];\n        }\n    }\n\n    /** @private */\n    collateWordTimestamps(tokens, token_timestamps, language) {\n\n        const [words, _, token_indices] = this.combineTokensIntoWords(tokens, language);\n\n        const timings = [];\n        for (let i = 0; i < words.length; ++i) {\n            const indices = token_indices[i];\n            timings.push({\n                text: words[i],\n                timestamp: [\n                    token_timestamps[indices.at(0)][0],\n                    token_timestamps[indices.at(-1)][1],\n                ],\n            });\n        }\n        return timings;\n    }\n\n    /**\n     * Groups tokens by word. Returns a tuple containing a list of strings with the words,\n     * and a list of `token_id` sequences with the tokens making up each word.\n     * @param {number[]} tokens \n     * @param {string} [language] \n     * @param {string} prepend_punctionations \n     * @param {string} append_punctuations \n     * \n     * @private\n     */\n    combineTokensIntoWords(tokens, language, prepend_punctionations = \"\\\"'\u201C\u00A1\u00BF([{-\", append_punctuations = \"\\\"'.\u3002,\uFF0C!\uFF01?\uFF1F:\uFF1A\u201D)]}\u3001\") {\n        language = language ?? 'english';\n\n        let words, word_tokens, token_indices;\n\n        if ([\"chinese\", \"japanese\", \"thai\", \"lao\", \"myanmar\"].includes(language)) {\n            // These languages don't typically use spaces.\n            [words, word_tokens, token_indices] = this.splitTokensOnUnicode(tokens)\n        } else {\n            [words, word_tokens, token_indices] = this.splitTokensOnSpaces(tokens)\n        }\n\n        return this.mergePunctuations(words, word_tokens, token_indices, prepend_punctionations, append_punctuations);\n    }\n\n    /** @type {PreTrainedTokenizer['decode']} */\n    decode(\n        token_ids,\n        decode_args,\n    ) {\n        let text;\n        // @ts-ignore\n        if (decode_args?.decode_with_timestamps) {\n            if (token_ids instanceof Tensor) {\n                token_ids = prepareTensorForDecode(token_ids);\n            }\n            text = this.decodeWithTimestamps(token_ids, decode_args);\n        } else {\n            text = super.decode(token_ids, decode_args);\n        }\n        // TODO: implement offsets\n        // if (decode_args.output_offsets) {\n        //     let offsets = this.computeOffsets\n        // }\n        return text;\n    }\n\n    /**\n     * @param {number[]|bigint[]} token_ids List of token IDs to decode.\n     * @param {Object} decode_args Optional arguments for decoding\n     * @private\n     */\n    decodeWithTimestamps(token_ids, decode_args) {\n        const time_precision = decode_args?.time_precision ?? 0.02;\n\n        const timestamp_begin = Array.from(this.all_special_ids).at(-1) + 1;\n        /**@type {Array} */\n        let outputs = [[]];\n        for (let token of token_ids) {\n            token = Number(token);\n            if (token >= timestamp_begin) {\n                const timestamp = ((token - timestamp_begin) * time_precision).toFixed(2);\n                outputs.push(`<|${timestamp}|>`);\n                outputs.push([]);\n            } else {\n                outputs[outputs.length - 1].push(token);\n            }\n        }\n        outputs = outputs.map(\n            s => typeof s === 'string' ? s : super.decode(s, decode_args)\n        )\n\n        return outputs.join('');\n    }\n\n    /**\n     * Combine tokens into words by splitting at any position where the tokens are decoded as valid unicode points.\n     * @param {number[]} tokens \n     * @returns {*}\n     * @private\n     */\n    splitTokensOnUnicode(tokens) {\n        const decoded_full = this.decode(tokens, {\n            // @ts-ignore\n            decode_with_timestamps: true,\n        });\n        const replacement_char = '\\uFFFD';\n\n        const words = []\n        const word_tokens = []\n        const token_indices = []\n        let current_tokens = []\n        let current_indices = []\n        let unicode_offset = 0\n\n        for (let token_idx = 0; token_idx < tokens.length; ++token_idx) {\n            const token = tokens[token_idx];\n\n            current_tokens.push(token);\n            current_indices.push(token_idx);\n\n            const decoded = this.decode(current_tokens, {\n                // @ts-ignore\n                decode_with_timestamps: true,\n            });\n\n            if (!decoded.includes(replacement_char) || decoded_full[unicode_offset + decoded.indexOf(replacement_char)] === replacement_char) {\n                words.push(decoded)\n                word_tokens.push(current_tokens)\n                token_indices.push(current_indices)\n                current_tokens = []\n                current_indices = []\n                unicode_offset += decoded.length;\n            }\n\n        }\n\n        return [words, word_tokens, token_indices]\n    }\n\n    /**\n     * Combine tokens into words by splitting at whitespace and punctuation tokens.\n     * @param {number[]} tokens \n     * @private\n     */\n    splitTokensOnSpaces(tokens) {\n\n        const [subwords, subword_tokens_list, subword_indices_list] = this.splitTokensOnUnicode(tokens);\n\n        const words = []\n        const word_tokens = []\n        const token_indices = []\n\n        const punctuationRegex = new RegExp(`^[${PUNCTUATION_REGEX}]$`, 'gu');\n\n        for (let i = 0; i < subwords.length; ++i) {\n\n            const subword = subwords[i];\n            const subword_tokens = subword_tokens_list[i];\n            const subword_indices = subword_indices_list[i];\n\n            // @ts-ignore\n            const special = subword_tokens[0] >= this.model.tokens_to_ids.get('<|endoftext|>');\n            const with_space = subword.startsWith(' ');\n            const trimmed = subword.trim();\n            const punctuation = punctuationRegex.test(trimmed);\n\n            if (special || with_space || punctuation || words.length === 0) {\n                words.push(subword);\n                word_tokens.push(subword_tokens);\n                token_indices.push(subword_indices);\n            } else {\n                const ix = words.length - 1;\n                words[ix] += subword;\n                word_tokens[ix].push(...subword_tokens);\n                token_indices[ix].push(...subword_indices);\n            }\n        }\n\n        return [words, word_tokens, token_indices];\n\n    }\n\n    /**\n     * Merges punctuation tokens with neighboring words.\n     * @param {string[]} words \n     * @param {number[][]} tokens \n     * @param {number[][]} indices \n     * @param {string} prepended \n     * @param {string} appended \n     * @private\n     */\n    mergePunctuations(words, tokens, indices, prepended, appended) {\n\n        const newWords = structuredClone(words);\n        const newTokens = structuredClone(tokens);\n        const newIndices = structuredClone(indices);\n\n\n        // prepend punctuations\n        let i = newWords.length - 2;\n        let j = newWords.length - 1;\n\n        while (i >= 0) {\n            if (newWords[i].startsWith(' ') && prepended.includes(newWords[i].trim())) {\n                newWords[j] = newWords[i] + newWords[j];\n                newTokens[j] = mergeArrays(newTokens[i], newTokens[j]);\n                newIndices[j] = mergeArrays(newIndices[i], newIndices[j]);\n                newWords[i] = '';\n                newTokens[i] = [];\n                newIndices[i] = [];\n            } else {\n                j = i;\n            }\n            --i;\n        }\n\n        // append punctuations\n        i = 0;\n        j = 1;\n        while (j < newWords.length) {\n            if (!newWords[i].endsWith(' ') && appended.includes(newWords[j])) {\n                newWords[i] += newWords[j];\n                newTokens[i] = mergeArrays(newTokens[i], newTokens[j]);\n                newIndices[i] = mergeArrays(newIndices[i], newIndices[j]);\n                newWords[j] = '';\n                newTokens[j] = [];\n                newIndices[j] = [];\n            } else {\n                i = j;\n            }\n            ++j;\n        }\n\n        return [\n            newWords.filter(x => x),\n            newTokens.filter(x => x.length > 0),\n            newIndices.filter(x => x.length > 0),\n        ]\n    }\n}\nexport class CodeGenTokenizer extends PreTrainedTokenizer { }\nexport class CLIPTokenizer extends PreTrainedTokenizer { }\nexport class SiglipTokenizer extends PreTrainedTokenizer { }\n\n/**\n * @todo This model is not yet supported by Hugging Face's \"fast\" tokenizers library (https://github.com/huggingface/tokenizers).\n * Therefore, this implementation (which is based on fast tokenizers) may produce slightly inaccurate results.\n */\nexport class MarianTokenizer extends PreTrainedTokenizer {\n    /**\n     * Create a new MarianTokenizer instance.\n     * @param {Object} tokenizerJSON The JSON of the tokenizer.\n     * @param {Object} tokenizerConfig The config of the tokenizer.\n     */\n    constructor(tokenizerJSON, tokenizerConfig) {\n        super(tokenizerJSON, tokenizerConfig);\n\n        this.languageRegex = /^(>>\\w+<<)\\s*/g;\n\n        this.supported_language_codes = this.model.vocab.filter(\n            x => this.languageRegex.test(x)\n        );\n\n        console.warn('WARNING: `MarianTokenizer` is not yet supported by Hugging Face\\'s \"fast\" tokenizers library. Therefore, you may experience slightly inaccurate results.')\n    }\n\n    /**\n     * Encodes a single text. Overriding this method is necessary since the language codes\n     * must be removed before encoding with sentencepiece model.\n     * @see https://github.com/huggingface/transformers/blob/12d51db243a00726a548a43cc333390ebae731e3/src/transformers/models/marian/tokenization_marian.py#L204-L213\n     *\n     * @param {string|null} text The text to encode.\n     * @returns {Array} The encoded tokens.\n     */\n    _encode_text(text) {\n        if (text === null) return null;\n\n        // Check if text starts with language code:\n        const [matchInfo, ...remainder] = text.trim().split(this.languageRegex);\n\n        if (remainder.length === 0) {\n            // No language code, encode normally\n            return super._encode_text(matchInfo);\n\n        } else if (remainder.length === 2) {\n            // Text starts with language code, so we do not encode it with sentencepiece.\n            const [language, text] = remainder;\n\n            if (!this.supported_language_codes.includes(language)) {\n                console.warn(`Unsupported language code \"${language}\" detected, which may lead to unexpected behavior. Should be one of: ${JSON.stringify(this.supported_language_codes)}`)\n            }\n            return mergeArrays([language], super._encode_text(text));\n        }\n    }\n\n}\n\nexport class Wav2Vec2CTCTokenizer extends PreTrainedTokenizer { }\n\nexport class BlenderbotTokenizer extends PreTrainedTokenizer { }\nexport class BlenderbotSmallTokenizer extends PreTrainedTokenizer { }\n\nexport class SpeechT5Tokenizer extends PreTrainedTokenizer { }\n\nexport class NougatTokenizer extends PreTrainedTokenizer { }\n\nexport class VitsTokenizer extends PreTrainedTokenizer {\n\n    constructor(tokenizerJSON, tokenizerConfig) {\n        super(tokenizerJSON, tokenizerConfig);\n\n        // Custom decoder function\n        this.decoder = new VitsDecoder({});\n    }\n}\n\nexport class CohereTokenizer extends PreTrainedTokenizer { }\n\nexport class MgpstrTokenizer extends PreTrainedTokenizer { }\n\n/**\n * Helper class which is used to instantiate pretrained tokenizers with the `from_pretrained` function.\n * The chosen tokenizer class is determined by the type specified in the tokenizer config.\n * \n * @example\n * const tokenizer = await AutoTokenizer.from_pretrained('Xenova/bert-base-uncased');\n */\nexport class AutoTokenizer {\n    static TOKENIZER_CLASS_MAPPING = {\n        T5Tokenizer,\n        DistilBertTokenizer,\n        CamembertTokenizer,\n        DebertaTokenizer,\n        DebertaV2Tokenizer,\n        BertTokenizer,\n        HerbertTokenizer,\n        ConvBertTokenizer,\n        RoFormerTokenizer,\n        XLMTokenizer,\n        ElectraTokenizer,\n        MobileBertTokenizer,\n        SqueezeBertTokenizer,\n        AlbertTokenizer,\n        GPT2Tokenizer,\n        BartTokenizer,\n        MBartTokenizer,\n        MBart50Tokenizer,\n        RobertaTokenizer,\n        WhisperTokenizer,\n        CodeGenTokenizer,\n        CLIPTokenizer,\n        SiglipTokenizer,\n        MarianTokenizer,\n        BloomTokenizer,\n        NllbTokenizer,\n        M2M100Tokenizer,\n        LlamaTokenizer,\n        CodeLlamaTokenizer,\n        XLMRobertaTokenizer,\n        MPNetTokenizer,\n        FalconTokenizer,\n        GPTNeoXTokenizer,\n        EsmTokenizer,\n        Wav2Vec2CTCTokenizer,\n        BlenderbotTokenizer,\n        BlenderbotSmallTokenizer,\n        SpeechT5Tokenizer,\n        NougatTokenizer,\n        VitsTokenizer,\n        Qwen2Tokenizer,\n        GemmaTokenizer,\n        Grok1Tokenizer,\n        CohereTokenizer,\n        MgpstrTokenizer,\n\n        // Base case:\n        PreTrainedTokenizer,\n    }\n\n\n    /**\n     * Instantiate one of the tokenizer classes of the library from a pretrained model.\n     * \n     * The tokenizer class to instantiate is selected based on the `tokenizer_class` property of the config object\n     * (either passed as an argument or loaded from `pretrained_model_name_or_path` if possible)\n     * \n     * @param {string} pretrained_model_name_or_path The name or path of the pretrained model. Can be either:\n     * - A string, the *model id* of a pretrained tokenizer hosted inside a model repo on huggingface.co.\n     *   Valid model ids can be located at the root-level, like `bert-base-uncased`, or namespaced under a\n     *   user or organization name, like `dbmdz/bert-base-german-cased`.\n     * - A path to a *directory* containing tokenizer files, e.g., `./my_model_directory/`.\n     * @param {PretrainedTokenizerOptions} options Additional options for loading the tokenizer.\n     * \n     * @returns {Promise<PreTrainedTokenizer>} A new instance of the PreTrainedTokenizer class.\n     */\n    static async from_pretrained(pretrained_model_name_or_path, {\n        progress_callback = null,\n        config = null,\n        cache_dir = null,\n        local_files_only = false,\n        revision = 'main',\n        legacy = null,\n    } = {}) {\n\n        const [tokenizerJSON, tokenizerConfig] = await loadTokenizer(pretrained_model_name_or_path, {\n            progress_callback,\n            config,\n            cache_dir,\n            local_files_only,\n            revision,\n            legacy,\n        })\n\n        // Some tokenizers are saved with the \"Fast\" suffix, so we remove that if present.\n        const tokenizerName = tokenizerConfig.tokenizer_class?.replace(/Fast$/, '') ?? 'PreTrainedTokenizer';\n\n        let cls = this.TOKENIZER_CLASS_MAPPING[tokenizerName];\n        if (!cls) {\n            console.warn(`Unknown tokenizer class \"${tokenizerName}\", attempting to construct from base class.`);\n            cls = PreTrainedTokenizer;\n        }\n        return new cls(tokenizerJSON, tokenizerConfig);\n    }\n}\n", "import { registerKernel } from \"@tensorflow/tfjs-core\";\nimport { MathBackendCPU } from \"@tensorflow/tfjs-backend-cpu/dist/base.js\";\nimport { castConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/Cast.js\";\nimport { gatherV2Config } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/GatherV2.js\";\nimport { expandDimsConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/ExpandDims.js\";\nimport { stridedSliceConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/StridedSlice.js\";\nimport { reshapeConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/Reshape.js\";\nimport { packConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/Pack.js\";\nimport { subConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/Sub.js\";\nimport { multiplyConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/Multiply.js\";\nimport { addConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/Add.js\";\nimport { rangeConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/Range.js\";\nimport { meanConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/Mean.js\";\nimport { squaredDifferenceConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/SquaredDifference.js\";\nimport { rsqrtConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/Rsqrt.js\";\nimport { prodConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/Prod.js\";\nimport { concatConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/Concat.js\";\nimport { batchMatMulConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/BatchMatMul.js\";\nimport { transposeConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/Transpose.js\";\nimport { softmaxConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/Softmax.js\";\nimport { erfConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/Erf.js\";\nimport { tileConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/Tile.js\";\nimport { sumConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/Sum.js\";\nimport { minimumConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/Minimum.js\";\nimport { maximumConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/Maximum.js\";\nimport { realDivConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/RealDiv.js\";\nimport { squareConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/Square.js\";\nimport { identityConfig } from \"@tensorflow/tfjs-backend-cpu/dist/kernels/Identity.js\";\n\n// Force MathBackendCPU to be included in the bundle\nconst _unused = MathBackendCPU;\n\n[castConfig, gatherV2Config, expandDimsConfig, stridedSliceConfig, reshapeConfig, packConfig, subConfig, multiplyConfig, addConfig, rangeConfig, meanConfig, squaredDifferenceConfig, rsqrtConfig, prodConfig, concatConfig, batchMatMulConfig, transposeConfig, softmaxConfig, erfConfig, tileConfig, sumConfig, minimumConfig, maximumConfig, realDivConfig, squareConfig, identityConfig].forEach(c => registerKernel(c));\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\n/*\n * base.ts contains all the exports from tfjs-backend-cpu\n * without auto-kernel registration\n */\nimport {registerBackend} from '@tensorflow/tfjs-core';\nimport {MathBackendCPU} from './backend_cpu';\nimport * as shared from './shared';\n\nexport {MathBackendCPU} from './backend_cpu';\nexport {version as version_cpu} from './version';\nexport {shared};\n\n// Side effects for default initialization of MathBackendCPU\nregisterBackend('cpu', () => new MathBackendCPU(), 1 /* priority */);\n", "/**\n * @license\n * Copyright 2021 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {backend_util, BackendTimingInfo, buffer, DataStorage, DataType, engine, env, kernel_impls, KernelBackend, Rank, ShapeMap, Tensor, Tensor2D, TensorBuffer, TensorInfo, TypedArray, util} from '@tensorflow/tfjs-core';\n\nconst whereImpl = kernel_impls.whereImpl;\nimport {assertNotComplex} from './cpu_util';\n\ninterface DataId {}\n\nexport interface TensorData<D extends DataType> {\n  values?: backend_util.BackendValues;\n  dtype: D;\n  // For complex numbers, the real and imaginary parts are stored as their own\n  // individual tensors, with a parent joining the two with the\n  // complexTensorInfos field.\n  complexTensorInfos?: {real: TensorInfo, imag: TensorInfo};\n  // refCount keeps track of how many tensors reference it. Used for memory\n  // management.\n  refCount: number;\n}\n\nexport class MathBackendCPU extends KernelBackend {\n  public blockSize = 48;\n\n  data: DataStorage<TensorData<DataType>>;\n  private firstUse = true;\n  private static nextDataId = 0;\n  private nextDataId(): number {\n    return MathBackendCPU.nextDataId++;\n  }\n\n  constructor() {\n    super();\n    this.data = new DataStorage(this, engine());\n  }\n\n  override write(\n      values: backend_util.BackendValues, shape: number[],\n      dtype: DataType): DataId {\n    if (this.firstUse) {\n      this.firstUse = false;\n      if (env().get('IS_NODE')) {\n        backend_util.warn(\n            '\\n============================\\n' +\n            'Hi, looks like you are running TensorFlow.js in ' +\n            'Node.js. To speed things up dramatically, install our node ' +\n            'backend, visit https://github.com/tensorflow/tfjs-node for more details. ' +\n            '\\n============================');\n      }\n    }\n    const dataId = {id: this.nextDataId()};\n\n    this.data.set(dataId, {values, dtype, refCount: 1});\n\n    return dataId;\n  }\n\n  /**\n   * Create a data bucket in cpu backend.\n   * @param shape Shape of the `TensorInfo`.\n   * @param dtype DType of the `TensorInfo`.\n   * @param values The value of the `TensorInfo` stored as a flattened array.\n   */\n  makeTensorInfo(\n      shape: number[], dtype: DataType,\n      values?: backend_util.BackendValues|string[]): TensorInfo {\n    let outId;\n    if (dtype === 'string' && values != null && values.length > 0 &&\n        util.isString(values[0])) {\n      const encodedValues =\n          (values as unknown as string[]).map(d => util.encodeString(d));\n\n      outId = this.write(encodedValues, shape, dtype);\n    } else {\n      outId = this.write(values as TypedArray, shape, dtype);\n    }\n\n    return {dataId: outId, shape, dtype};\n  }\n\n  /** Return refCount of a `TensorData`. */\n  override refCount(dataId: DataId): number {\n    if (this.data.has(dataId)) {\n      const tensorData = this.data.get(dataId);\n      return tensorData.refCount;\n    }\n    return 0;\n  }\n\n  /** Increase refCount of a `TensorData`. */\n  override incRef(dataId: DataId): void {\n    const tensorData = this.data.get(dataId);\n    tensorData.refCount++;\n  }\n\n  /** Decrease refCount of a `TensorData`. */\n  decRef(dataId: DataId): void {\n    if (this.data.has(dataId)) {\n      const tensorData = this.data.get(dataId);\n      tensorData.refCount--;\n    }\n  }\n\n  override move(\n      dataId: DataId, values: backend_util.BackendValues, shape: number[],\n      dtype: DataType, refCount: number): void {\n    this.data.set(dataId, {values, dtype, refCount});\n  }\n\n  override numDataIds(): number {\n    return this.data.numDataIds();\n  }\n\n  override async read(dataId: DataId): Promise<backend_util.BackendValues> {\n    return this.readSync(dataId);\n  }\n  override readSync(dataId: DataId): backend_util.BackendValues {\n    const {dtype, complexTensorInfos} = this.data.get(dataId);\n\n    if (dtype === 'complex64') {\n      const realValues =\n          this.readSync(complexTensorInfos.real.dataId) as Float32Array;\n      const imagValues =\n          this.readSync(complexTensorInfos.imag.dataId) as Float32Array;\n      return backend_util.mergeRealAndImagArrays(realValues, imagValues);\n    }\n    return util.convertBackendValuesAndArrayBuffer(\n        this.data.get(dataId).values, dtype);\n  }\n\n  bufferSync<R extends Rank, D extends DataType>(t: TensorInfo):\n      TensorBuffer<R, D> {\n    const data = this.readSync(t.dataId);\n    if (t.dtype === 'string') {\n      try {\n        // Decode the bytes into string.\n        const strings = (data as Uint8Array[]).map(d => util.decodeString(d));\n        return buffer(t.shape as ShapeMap[R], t.dtype, strings) as\n            TensorBuffer<R, D>;\n      } catch {\n        throw new Error('Failed to decode encoded string bytes into utf-8');\n      }\n    }\n    return buffer(t.shape as ShapeMap[R], t.dtype, data as TypedArray) as\n        TensorBuffer<R, D>;\n  }\n\n  makeOutput<T extends Tensor>(\n      values: backend_util.BackendValues, shape: number[], dtype: DataType): T {\n    return engine().makeTensorFromTensorInfo(\n               this.makeTensorInfo(shape, dtype, values), this) as T;\n  }\n\n  /**\n   * Dispose the memory if the dataId has 0 refCount. Return true if the memory\n   * is released or memory is not managed in this backend, false if memory is\n   * not cleared.\n   * @param dataId\n   * @oaram force Optional, remove the data regardless of refCount\n   */\n  override disposeData(dataId: DataId, force = false): boolean {\n    if (this.data.has(dataId)) {\n      this.data.get(dataId).refCount--;\n      if (!force && this.data.get(dataId).refCount > 0) {\n        return false;\n      }\n\n      const {complexTensorInfos} = this.data.get(dataId);\n\n      if (complexTensorInfos != null) {\n        this.disposeData(complexTensorInfos.real.dataId, true);\n        this.disposeData(complexTensorInfos.imag.dataId, true);\n      }\n\n      this.data.delete(dataId);\n    }\n    return true;\n  }\n\n  disposeIntermediateTensorInfo(tensorInfo: TensorInfo): void {\n    this.disposeData(tensorInfo.dataId);\n  }\n\n  override async time(f: () => void): Promise<BackendTimingInfo> {\n    const start = util.now();\n    f();\n    const kernelMs = util.now() - start;\n    return {kernelMs};\n  }\n\n  override memory() {\n    return {\n      // Unreliable due to automatic gc. The numbers above are cumulative.\n      unreliable: true,\n      reasons:\n          ['The reported memory is an upper bound. Due to automatic garbage ' +\n           'collection, the true allocated memory may be less.']\n    };\n  }\n\n  where(condition: Tensor): Tensor2D {\n    assertNotComplex([condition], 'where');\n\n    const condVals = this.readSync(condition.dataId) as TypedArray;\n    return whereImpl(condition.shape, condVals);\n  }\n\n  override dispose() {}\n\n  override floatPrecision(): 16|32 {\n    return 32;\n  }\n\n  /** Returns the smallest representable number.  */\n  override epsilon(): number {\n    return super.epsilon();\n  }\n}\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {TensorInfo, util} from '@tensorflow/tfjs-core';\n\nexport function assertNotComplex(\n    tensor: TensorInfo|TensorInfo[], opName: string): void {\n  if (!Array.isArray(tensor)) {\n    tensor = [tensor];\n  }\n  tensor.forEach(t => {\n    if (t != null) {\n      util.assert(\n          t.dtype !== 'complex64',\n          () => `${\n              opName} does not support complex64 tensors in the CPU backend.`);\n    }\n  });\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Add, KernelConfig} from '@tensorflow/tfjs-core';\n\nimport {createSimpleBinaryKernelImpl} from '../utils/binary_impl';\nimport {binaryKernelFunc, createComplexBinaryKernelImpl} from '../utils/binary_utils';\n\nexport const addImpl =\n    createSimpleBinaryKernelImpl(((a: number, b: number) => a + b));\nexport const addComplexImpl =\n    createComplexBinaryKernelImpl(((aReal, aImag, bReal, bImag) => {\n      return {real: aReal + bReal, imag: aImag + bImag};\n    }));\n\nexport const add = binaryKernelFunc(Add, addImpl, addComplexImpl);\n\nexport const addConfig: KernelConfig = {\n  kernelName: Add,\n  backendName: 'cpu',\n  kernelFunc: add\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {backend_util, DataType, DataValues, NumericDataType, TypedArray, util} from '@tensorflow/tfjs-core';\n\nimport {SimpleBinaryKernelImpl, SimpleBinaryOperation} from './binary_types';\n\n/**\n * Template that creates implementation for binary ops. Supports broadcast.\n */\nexport function createSimpleBinaryKernelImpl(op: SimpleBinaryOperation):\n    SimpleBinaryKernelImpl {\n  return (aShape: number[], bShape: number[], aVals: DataValues,\n          bVals: DataValues, dtype: DataType): [TypedArray, number[]] => {\n    const newShape = backend_util.assertAndGetBroadcastShape(aShape, bShape);\n\n    const resultRank = newShape.length;\n    const resultStrides = util.computeStrides(newShape);\n    const resultSize = util.sizeFromShape(newShape);\n\n    const result =\n        util.getTypedArrayFromDType(dtype as NumericDataType, resultSize);\n\n    const aRank = aShape.length;\n    const bRank = bShape.length;\n\n    const aStrides = util.computeStrides(aShape);\n    const bStrides = util.computeStrides(bShape);\n\n    const aBroadcastDims = backend_util.getBroadcastDims(aShape, newShape);\n    const bBroadcastDims = backend_util.getBroadcastDims(bShape, newShape);\n\n    if (aBroadcastDims.length + bBroadcastDims.length === 0) {\n      for (let i = 0; i < result.length; ++i) {\n        result[i] = op(aVals[i % aVals.length], bVals[i % bVals.length]);\n      }\n    } else {\n      for (let i = 0; i < result.length; ++i) {\n        const loc = util.indexToLoc(i, resultRank, resultStrides);\n\n        const aLoc = loc.slice(-aRank);\n        aBroadcastDims.forEach(d => aLoc[d] = 0);\n        const aIndex = util.locToIndex(aLoc, aRank, aStrides);\n\n        const bLoc = loc.slice(-bRank);\n        bBroadcastDims.forEach(d => bLoc[d] = 0);\n        const bIndex = util.locToIndex(bLoc, bRank, bStrides);\n\n        result[i] = op(aVals[aIndex], bVals[bIndex]);\n      }\n    }\n\n    return [result, newShape];\n  };\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {backend_util, BinaryInputs, DataType, KernelFunc, TypedArray, util} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\nimport {assertNotComplex} from '../cpu_util';\nimport {cast} from '../kernels/Cast';\nimport {complex} from '../kernels/Complex';\n\nimport {ComplexBinaryKernelImpl, ComplexBinaryOperation, SimpleBinaryKernelImpl} from './binary_types';\n\n/**\n * Template that creates a `KernelFunc` for binary ops.\n * @param name Kernel name.\n * @param binaryKernelImpl A `SimpleBinaryKernelImpl` for the kernel.\n * @param binaryKernelComplexImpl Optional. If exists, represents a\n *     `ComplexBinaryKernelImpl` for the kernel, will be used when input dtype\n *     is `complex64`.\n * @param dtype Optional. If set, the result has this dtype. Otherwise, the\n *     result has the same dtype as the first input. This is mainly used in\n *     comparison kernels, such as Equal, Less, Greater, etc.\n */\nexport function binaryKernelFunc(\n    name: string, simpleImpl: SimpleBinaryKernelImpl,\n    complexImpl?: ComplexBinaryKernelImpl, dtype?: DataType): KernelFunc {\n  if (complexImpl == null) {\n    return ({inputs, backend}) => {\n      const {a, b} = inputs as BinaryInputs;\n      const cpuBackend = backend as MathBackendCPU;\n\n      assertNotComplex([a, b], name);\n\n      const aVals = cpuBackend.data.get(a.dataId).values as TypedArray;\n      const bVals = cpuBackend.data.get(b.dataId).values as TypedArray;\n\n      const decodedAVals = a.dtype === 'string' ?\n          // tslint:disable-next-line: no-any\n          backend_util.fromUint8ToStringArray(aVals as any as Uint8Array[]) :\n          aVals;\n      const decodedBVals = a.dtype === 'string' ?\n          // tslint:disable-next-line: no-any\n          backend_util.fromUint8ToStringArray(bVals as any as Uint8Array[]) :\n          bVals;\n      const $dtype = dtype || a.dtype;\n\n      const [resultData, resultShape] =\n          simpleImpl(a.shape, b.shape, decodedAVals, decodedBVals, $dtype);\n\n      return cpuBackend.makeTensorInfo(resultShape, $dtype, resultData);\n    };\n  }\n\n  return ({inputs, backend}) => {\n    const {a, b} = inputs as BinaryInputs;\n    const cpuBackend = backend as MathBackendCPU;\n\n    if (a.dtype === 'complex64' || b.dtype === 'complex64') {\n      const $aComplex = cast(\n          {inputs: {x: a}, backend: cpuBackend, attrs: {dtype: 'complex64'}});\n\n      const $aComplexVals = cpuBackend.data.get($aComplex.dataId);\n\n      const aReal = $aComplexVals.complexTensorInfos.real;\n      const aImag = $aComplexVals.complexTensorInfos.imag;\n\n      const aRealVals =\n          cpuBackend.data.get(aReal.dataId).values as Float32Array;\n      const aImagVals =\n          cpuBackend.data.get(aImag.dataId).values as Float32Array;\n\n      const $bComplex = cast(\n          {inputs: {x: b}, backend: cpuBackend, attrs: {dtype: 'complex64'}});\n\n      const $bComplexVals = cpuBackend.data.get($bComplex.dataId);\n\n      const bReal = $bComplexVals.complexTensorInfos.real;\n      const bImag = $bComplexVals.complexTensorInfos.imag;\n\n      const bRealVals =\n          cpuBackend.data.get(bReal.dataId).values as Float32Array;\n      const bImagVals =\n          cpuBackend.data.get(bImag.dataId).values as Float32Array;\n\n      const [resultRealData, resultImagData, resultShape] = complexImpl(\n          a.shape, b.shape, aRealVals, aImagVals, bRealVals, bImagVals);\n\n      const resultReal =\n          cpuBackend.makeTensorInfo(resultShape, 'float32', resultRealData);\n\n      const resultImag =\n          cpuBackend.makeTensorInfo(resultShape, 'float32', resultImagData);\n\n      const result = complex(\n          {inputs: {real: resultReal, imag: resultImag}, backend: cpuBackend});\n\n      cpuBackend.disposeIntermediateTensorInfo($aComplex);\n      cpuBackend.disposeIntermediateTensorInfo($bComplex);\n      cpuBackend.disposeIntermediateTensorInfo(resultReal);\n      cpuBackend.disposeIntermediateTensorInfo(resultImag);\n\n      return result;\n    } else {\n      const aVals = cpuBackend.data.get(a.dataId).values as TypedArray;\n      const bVals = cpuBackend.data.get(b.dataId).values as TypedArray;\n\n      const $dtype = dtype || a.dtype;\n\n      const [resultData, resultShape] =\n          simpleImpl(a.shape, b.shape, aVals, bVals, $dtype);\n\n      return cpuBackend.makeTensorInfo(resultShape, $dtype, resultData);\n    }\n  };\n}\n\n/**\n * Template that creates the complex type implementation for binary ops.\n * Supports broadcast.\n */\nexport function createComplexBinaryKernelImpl(op: ComplexBinaryOperation):\n    ComplexBinaryKernelImpl {\n  return (aShape: number[], bShape: number[], aRealVals: Float32Array,\n          aImagVals: Float32Array, bRealVals: Float32Array,\n          bImagVals: Float32Array): [TypedArray, TypedArray, number[]] => {\n    const resultShape = backend_util.assertAndGetBroadcastShape(aShape, bShape);\n    const resultSize = util.sizeFromShape(resultShape);\n    const resultRank = resultShape.length;\n    const resultStrides = util.computeStrides(resultShape);\n\n    const resultRealVals = util.getTypedArrayFromDType('float32', resultSize);\n    const resultImagVals = util.getTypedArrayFromDType('float32', resultSize);\n\n    const aBroadcastDims = backend_util.getBroadcastDims(aShape, resultShape);\n    const bBroadcastDims = backend_util.getBroadcastDims(bShape, resultShape);\n\n    const aVals = backend_util.mergeRealAndImagArrays(aRealVals, aImagVals);\n    const bVals = backend_util.mergeRealAndImagArrays(bRealVals, bImagVals);\n\n    const aRank = aShape.length;\n    const aStrides = util.computeStrides(aShape);\n\n    const bRank = bShape.length;\n    const bStrides = util.computeStrides(bShape);\n\n    if (aBroadcastDims.length + bBroadcastDims.length === 0) {\n      for (let i = 0; i < resultRealVals.length; i++) {\n        const aIdx = i % aVals.length;\n        const bIdx = i % bVals.length;\n\n        const result =\n            op(aVals[aIdx * 2], aVals[aIdx * 2 + 1], bVals[bIdx * 2],\n               bVals[bIdx * 2 + 1]);\n\n        resultRealVals[i] = result.real;\n        resultImagVals[i] = result.imag;\n      }\n    } else {\n      for (let i = 0; i < resultRealVals.length; i++) {\n        const loc = util.indexToLoc(i, resultRank, resultStrides);\n\n        const aLoc = loc.slice(-aRank);\n        aBroadcastDims.forEach(d => aLoc[d] = 0);\n        const aIndex = util.locToIndex(aLoc, aRank, aStrides);\n\n        const bLoc = loc.slice(-bRank);\n        bBroadcastDims.forEach(d => bLoc[d] = 0);\n        const bIndex = util.locToIndex(bLoc, bRank, bStrides);\n\n        const opResult =\n            op(aVals[aIndex * 2], aVals[aIndex * 2 + 1], bVals[bIndex * 2],\n               bVals[bIndex * 2 + 1]);\n\n        resultRealVals[i] = opResult.real;\n        resultImagVals[i] = opResult.imag;\n      }\n    }\n    return [resultRealVals, resultImagVals, resultShape];\n  };\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\nimport {Cast, CastAttrs, CastInputs, DataType, KernelConfig, KernelFunc, TensorInfo, TypedArray, util} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\nimport {createSimpleBinaryKernelImpl} from '../utils/binary_impl';\nimport {zeros} from '../utils/zeros_impl';\n\nimport {complex} from './Complex';\nimport {identity} from './Identity';\nimport {real} from './Real';\n\nexport function castImpl(\n    values: TypedArray, shape: number[], inputType: DataType,\n    dtype: DataType): [number[], DataType, TypedArray] {\n  if (dtype === 'int32') {\n    const resultValues = Int32Array.from(values);\n    return [shape, 'int32', resultValues];\n  }\n\n  if (dtype === 'bool') {\n    // This is essentially the result of notEqual(x, 0). We avoid using\n    // kernel notEqual to avoid circular dependency, i.e. binary_utils ->\n    // cast -> notEqual -> binary_utils.\n    const zero = util.toTypedArray([0], inputType);\n\n    const [resultData, resultShape] = createSimpleBinaryKernelImpl(\n        (a, b) => (a !== b) ? 1 : 0)(shape, [], values, zero, 'bool');\n\n    return [resultShape, 'bool', resultData];\n  }\n  throw new Error(`Error in Cast: failed to cast ${inputType} to ${dtype}`);\n}\n\nexport function cast(\n    args: {inputs: CastInputs, backend: MathBackendCPU, attrs: CastAttrs}):\n    TensorInfo {\n  const {inputs, backend, attrs} = args;\n  const {x} = inputs;\n  const {dtype} = attrs;\n\n  // Casting to complex64.\n  if (dtype === 'complex64') {\n    if (x.dtype === 'complex64') {\n      return identity({inputs: {x}, backend});\n    }\n\n    const zerosTensorInfo = zeros(backend, x.shape, x.dtype);\n    const floatX = cast({inputs: {x}, backend, attrs: {dtype: 'float32'}});\n\n    const result =\n        complex({inputs: {real: floatX, imag: zerosTensorInfo}, backend});\n\n    backend.disposeIntermediateTensorInfo(zerosTensorInfo);\n    backend.disposeIntermediateTensorInfo(floatX);\n\n    return result;\n  }\n\n  // Casting from complex64\n  if (x.dtype === 'complex64') {\n    const realPart = real({inputs: {input: x}, backend});\n    const result = cast({inputs: {x: realPart}, backend, attrs: {dtype}});\n\n    backend.disposeIntermediateTensorInfo(realPart);\n\n    return result;\n  }\n\n  if (!util.hasEncodingLoss(x.dtype, dtype)) {\n    // We don't change the underlying data, since we cast to higher\n    // precision.\n    const result = identity({inputs: {x}, backend});\n    return {dataId: result.dataId, shape: result.shape, dtype};\n  }\n\n  const values = backend.data.get(x.dataId).values as TypedArray;\n  const [resultShape, resultType, resultData] =\n      castImpl(values, x.shape, x.dtype, dtype);\n  return backend.makeTensorInfo(resultShape, resultType, resultData);\n}\n\nexport const castConfig: KernelConfig = {\n  kernelName: Cast,\n  backendName: 'cpu',\n  kernelFunc: cast as unknown as KernelFunc\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {DataType, TensorInfo, util} from '@tensorflow/tfjs-core';\nimport {MathBackendCPU} from '../backend_cpu';\nimport {complex} from '../kernels/Complex';\n\n/**\n * Generates a tensorInfo with all zeros value.\n * @param backend cpu backend.\n * @param shape Shape for the zeros tensor.\n * @param dtype Optional. If set, the result has this dtype.\n */\nexport function zeros(\n    backend: MathBackendCPU, shape: number[],\n    dtype: DataType = 'float32'): TensorInfo {\n  if (dtype === 'complex64') {\n    const real = zeros(backend, shape, 'float32');\n    const imag = zeros(backend, shape, 'float32');\n\n    return complex({inputs: {real, imag}, backend});\n  }\n\n  const values = util.makeZerosTypedArray(util.sizeFromShape(shape), dtype);\n\n  return backend.makeTensorInfo(shape, dtype, values);\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Complex, ComplexInputs, KernelConfig, KernelFunc, TensorInfo, TypedArray} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\n\nexport function complex(args: {inputs: ComplexInputs, backend: MathBackendCPU}):\n    TensorInfo {\n  const {inputs, backend} = args;\n  const {real, imag} = inputs;\n\n  const realVals = backend.data.get(real.dataId).values as TypedArray;\n  const imagVals = backend.data.get(imag.dataId).values as TypedArray;\n\n  const complexInfo = backend.makeTensorInfo(real.shape, 'complex64');\n\n  const complex = backend.data.get(complexInfo.dataId);\n\n  // The complex tensor owns the underlying real and imag tensorInfos, only the\n  // complex tensor tracks refCount, when complexData is disposed the\n  // underlying tensorData will be disposed.\n  complex.complexTensorInfos = {\n    real: backend.makeTensorInfo(real.shape, 'float32', realVals),\n    imag: backend.makeTensorInfo(imag.shape, 'float32', imagVals)\n  };\n\n  return complexInfo;\n}\n\nexport const complexConfig: KernelConfig = {\n  kernelName: Complex,\n  backendName: 'cpu',\n  kernelFunc: complex as unknown as KernelFunc\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Identity, IdentityInputs, KernelConfig, KernelFunc, TensorInfo} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\n\nexport function identity(\n    args: {inputs: IdentityInputs, backend: MathBackendCPU}): TensorInfo {\n  const {inputs, backend} = args;\n  const {x} = inputs;\n\n  backend.incRef(x.dataId);\n\n  return {dataId: x.dataId, shape: x.shape, dtype: x.dtype};\n}\n\nexport const identityConfig: KernelConfig = {\n  kernelName: Identity,\n  backendName: 'cpu',\n  kernelFunc: identity as unknown as KernelFunc\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {KernelConfig, KernelFunc, Real, RealInputs, TensorInfo} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\n\nexport function real(args: {inputs: RealInputs, backend: MathBackendCPU}):\n    TensorInfo {\n  const {inputs, backend} = args;\n  const {input} = inputs;\n\n  const real = backend.data.get(input.dataId).complexTensorInfos.real;\n  const realVal = backend.data.get(real.dataId).values;\n\n  // When complex tensor is disposed, its underlying parts will be disposed too.\n  // Make new tensor out of the real value of the complex. This makes sure the\n  // value is still accessible even if complex tensor is disposed.\n  return backend.makeTensorInfo(real.shape, real.dtype, realVal);\n}\n\nexport const realConfig: KernelConfig = {\n  kernelName: Real,\n  backendName: 'cpu',\n  kernelFunc: real as unknown as KernelFunc\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {util} from '@tensorflow/tfjs-core';\n\nimport {SimpleUnaryImpl, SimpleUnaryOperation} from './unary_types';\n\n/**\n * Template that creates implementation for unary op.\n */\nexport function createSimpleUnaryImpl<I extends number | string = number,\n  O extends number | string = number>(op: SimpleUnaryOperation<I, O>):\n    SimpleUnaryImpl<I, O> {\n  return (values, dtype, attrs) => {\n    const newValues =\n        util.getArrayFromDType(dtype, values.length);\n    for (let i = 0; i < values.length; ++i) {\n      newValues[i] = op(values[i], attrs);\n    }\n    return newValues;\n  };\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {backend_util, DataTypeFor, KernelFunc, UnaryInputs} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\nimport {assertNotComplex} from '../cpu_util';\nimport {createSimpleUnaryImpl} from './unary_impl';\n\nimport {SimpleUnaryImpl, SimpleUnaryOperation} from './unary_types';\n\n/**\n * Template that creates a `KernelFunc` for unary ops.\n * @param name Kernel name.\n * @param op A `SimpleUnaryOperation` for the kernel.\n * @param dtype Optional. If set, the result has this dtype. Otherwise, the\n *     result has the same dtype as the input. This is mainly used in certain\n *     kernels that return bool type, such as isFinite, isInf, etc.\n */\nexport function unaryKernelFunc<I extends number | string = number,\n  O extends number | string = number>(\n  name: string, op: SimpleUnaryOperation<I, O>,\n  dtype?: DataTypeFor<O>): KernelFunc {\n\n  const impl = createSimpleUnaryImpl<I, O>(op);\n\n  return unaryKernelFuncFromImpl<I, O>(name, impl, dtype);\n}\n\n/**\n * Template that creates a `KernelFunc` for unary ops from the given\n * `SimpleUnaryImpl`..\n * @param name Kernel name.\n * @param unaryImpl A `SimpleUnaryImpl` that implements the op.\n * @param dtype Optional. If set, the result has this dtype. Otherwise, the\n *     result has the same dtype as the input. This is mainly used in certain\n *     kernels that return bool type, such as isFinite, isInf, etc.\n */\nexport function unaryKernelFuncFromImpl<I extends number | string = number,\n  O extends number | string = number>(\n  name: string, unaryImpl: SimpleUnaryImpl<I, O>,\n  dtype?: DataTypeFor<O>): KernelFunc {\n\n  return ({inputs, attrs, backend}) => {\n    const {x} = inputs as UnaryInputs;\n    assertNotComplex(x, name);\n\n    const cpuBackend = backend as MathBackendCPU;\n    const values = cpuBackend.data.get(x.dataId).values;\n    let decoded: ArrayLike<I>;\n    if (x.dtype === 'string') {\n      if (!Array.isArray(values)) {\n        throw new Error('String tensor\\'s value was not an instance of Array');\n      }\n      decoded = backend_util.fromUint8ToStringArray(values) as unknown as\n        ArrayLike<I>;\n    } else {\n      decoded = values as unknown as ArrayLike<I>;\n    }\n\n    const $dtype = dtype || x.dtype as DataTypeFor<O>;\n    const newValues = unaryImpl(decoded, $dtype, attrs);\n    return cpuBackend.makeTensorInfo(x.shape, $dtype, newValues);\n  };\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {backend_util, BackendValues, DataType, TypedArray, util} from '@tensorflow/tfjs-core';\n\nexport function concatImpl(\n    inputs: Array<{vals: BackendValues, shape: number[]}>, outShape: number[],\n    dtype: DataType, simplyConcat: boolean): TypedArray|string[] {\n  const outVals = util.getArrayFromDType(dtype, util.sizeFromShape(outShape));\n\n  if (simplyConcat && dtype !== 'string') {\n    // Use built-in TypedArray.set() method for speed.\n    let offset = 0;\n    inputs.forEach(input => {\n      const size = util.sizeFromShape(input.shape);\n\n      (outVals as TypedArray).set(input.vals as TypedArray, offset);\n      offset += size;\n    });\n  } else {\n    let colOffset = 0;\n\n    inputs.forEach(input => {\n      const decodedData = dtype === 'string' ?\n          backend_util.fromUint8ToStringArray(input.vals as Uint8Array[]) :\n          input.vals as TypedArray;\n\n      let tIdx = 0;\n\n      for (let row = 0; row < input.shape[0]; ++row) {\n        const resIdx = row * outShape[1] + colOffset;\n        for (let col = 0; col < input.shape[1]; ++col) {\n          outVals[resIdx + col] = decodedData[tIdx++];\n        }\n      }\n\n      colOffset += input.shape[1];\n    });\n  }\n\n  return outVals;\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the License);\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an AS IS BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Exp, KernelConfig} from '@tensorflow/tfjs-core';\n\nimport {createSimpleUnaryImpl} from '../utils/unary_impl';\nimport {unaryKernelFuncFromImpl} from '../utils/unary_utils';\n\nexport const expImpl = createSimpleUnaryImpl((xi) => Math.exp(xi));\nexport const exp = unaryKernelFuncFromImpl(Exp, expImpl, 'float32');\n\nexport const expConfig: KernelConfig = {\n  kernelName: Exp,\n  backendName: 'cpu',\n  kernelFunc: exp,\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {buffer, DataType, Rank, TensorBuffer} from '@tensorflow/tfjs-core';\n\nexport function gatherV2Impl<R extends Rank, D extends DataType>(\n    xBuf: TensorBuffer<R, D>, indicesBuf: TensorBuffer<R, D>,\n    flattenOutputShape: number[]): TensorBuffer<R, D> {\n  const outBuf = buffer(flattenOutputShape, xBuf.dtype);\n  for (let i = 0; i < outBuf.size; ++i) {\n    const newLoc = outBuf.indexToLoc(i);\n\n    const originalLoc: number[] = newLoc.slice();\n    const batchIdx = originalLoc[0];\n    const indicesIdx = originalLoc[2];\n    const indicesIndex = indicesBuf.locToIndex([batchIdx, indicesIdx]);\n    originalLoc[2] = indicesBuf.values[indicesIndex] as number;\n\n    const originalIndex = xBuf.locToIndex(originalLoc);\n\n    if (0 <= originalIndex && originalIndex < xBuf.values.length) {\n      outBuf.values[i] = xBuf.values[originalIndex];\n    } // Else, index is out of bounds, so leave the default zero val in outBuf.\n  }\n\n  return outBuf as TensorBuffer<R, D>;\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {DataType, NumericDataType, TypedArray, util} from '@tensorflow/tfjs-core';\n\nexport function maxImpl(\n    aVals: TypedArray, reduceSize: number, outShape: number[],\n    dtype: DataType): TypedArray {\n  const vals = util.getTypedArrayFromDType(\n      dtype as NumericDataType, util.sizeFromShape(outShape));\n\n  for (let i = 0; i < vals.length; ++i) {\n    const offset = i * reduceSize;\n    let max = aVals[offset];\n    for (let j = 0; j < reduceSize; ++j) {\n      const value = aVals[offset + j];\n      if (Number.isNaN(value) ||\n          value > max) {  // comparison with NaN always return false\n        max = value;\n      }\n    }\n    vals[i] = max;\n  }\n  return vals;\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {KernelConfig, Maximum} from '@tensorflow/tfjs-core';\n\nimport {createSimpleBinaryKernelImpl} from '../utils/binary_impl';\nimport {binaryKernelFunc} from '../utils/binary_utils';\n\nexport const maximumImpl = createSimpleBinaryKernelImpl(\n    ((aValue, bValue) => Math.max(aValue as number, bValue as number)));\nexport const maximum = binaryKernelFunc(Maximum, maximumImpl);\n\nexport const maximumConfig: KernelConfig = {\n  kernelName: Maximum,\n  backendName: 'cpu',\n  kernelFunc: maximum\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {KernelConfig, Minimum} from '@tensorflow/tfjs-core';\n\nimport {createSimpleBinaryKernelImpl} from '../utils/binary_impl';\nimport {binaryKernelFunc} from '../utils/binary_utils';\n\nexport const minimumImpl = createSimpleBinaryKernelImpl(\n    ((aValue, bValue) => Math.min(aValue as number, bValue as number)));\nexport const minimum = binaryKernelFunc(Minimum, minimumImpl);\n\nexport const minimumConfig: KernelConfig = {\n  kernelName: Minimum,\n  backendName: 'cpu',\n  kernelFunc: minimum\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {KernelConfig, Multiply} from '@tensorflow/tfjs-core';\nimport {createSimpleBinaryKernelImpl} from '../utils/binary_impl';\nimport {binaryKernelFunc, createComplexBinaryKernelImpl} from '../utils/binary_utils';\n\nexport const multiplyImpl = createSimpleBinaryKernelImpl(\n    ((aValue: number, bValue: number) => aValue * bValue));\nexport const multiplyComplexImpl =\n    createComplexBinaryKernelImpl(((aReal, aImag, bReal, bImag) => {\n      return {\n        real: aReal * bReal - aImag * bImag,\n        imag: aReal * bImag + aImag * bReal\n      };\n    }));\n\nexport const multiply =\n    binaryKernelFunc(Multiply, multiplyImpl, multiplyComplexImpl);\n\nexport const multiplyConfig: KernelConfig = {\n  kernelName: Multiply,\n  backendName: 'cpu',\n  kernelFunc: multiply\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {backend_util, DataType, KernelConfig, KernelFunc, Prod, ProdAttrs, ProdInputs, TensorInfo, TypedArray, upcastType, util} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\nimport {assertNotComplex} from '../cpu_util';\nimport {transpose} from './Transpose';\n\nexport function prodImpl(\n    xShape: number[], xDtype: DataType, xVals: TypedArray,\n    reductionAxes: number[]):\n    {outVals: TypedArray, outShape: number[], outDtype: DataType} {\n  const [outShape, reduceShape] =\n      backend_util.computeOutAndReduceShapes(xShape, reductionAxes);\n  const outDtype = upcastType(xDtype, 'int32');\n  const outVals = util.makeZerosTypedArray(\n                      util.sizeFromShape(outShape), outDtype) as TypedArray;\n  const reduceSize = util.sizeFromShape(reduceShape);\n\n  for (let i = 0; i < outVals.length; ++i) {\n    const offset = i * reduceSize;\n    let prod = 1;\n    for (let j = 0; j < reduceSize; ++j) {\n      prod *= xVals[offset + j];\n    }\n    outVals[i] = prod;\n  }\n\n  return {outVals, outShape, outDtype};\n}\n\nexport function prod(\n    args: {inputs: ProdInputs, backend: MathBackendCPU, attrs: ProdAttrs}):\n    TensorInfo {\n  const {inputs, backend, attrs} = args;\n  const {x} = inputs;\n  const {axis, keepDims} = attrs;\n\n  assertNotComplex(x, 'prod');\n\n  const xRank = x.shape.length;\n  const axes = util.parseAxisParam(axis, x.shape);\n\n  const permutation = backend_util.getAxesPermutation(axes, xRank);\n  let reductionAxes = axes;\n  let permutedX = x;\n  const intermediateTensorInfos = [];\n  if (permutation != null) {\n    permutedX = transpose({inputs: {x}, backend, attrs: {perm: permutation}});\n    intermediateTensorInfos.push(permutedX);\n    reductionAxes = backend_util.getInnerMostAxes(reductionAxes.length, xRank);\n  }\n\n  const xVals = backend.data.get(permutedX.dataId).values as TypedArray;\n  const {outVals, outShape, outDtype} =\n      prodImpl(permutedX.shape, permutedX.dtype, xVals, reductionAxes);\n\n  let resultShape = outShape;\n  if (keepDims) {\n    resultShape = backend_util.expandShapeToKeepDim(outShape, axes);\n  }\n\n  intermediateTensorInfos.forEach(\n      t => backend.disposeIntermediateTensorInfo(t));\n\n  return backend.makeTensorInfo(resultShape, outDtype, outVals);\n}\n\nexport const prodConfig: KernelConfig = {\n  kernelName: Prod,\n  backendName: 'cpu',\n  kernelFunc: prod as unknown as KernelFunc\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {KernelConfig, KernelFunc, TensorInfo, Transpose, TransposeAttrs, TransposeInputs, TypedArray} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\nimport {assertNotComplex} from '../cpu_util';\n\nimport {transposeImpl} from './Transpose_impl';\n\nexport function transpose(args: {\n  inputs: TransposeInputs,\n  attrs: TransposeAttrs,\n  backend: MathBackendCPU\n}): TensorInfo {\n  const {inputs, attrs, backend} = args;\n  const {x} = inputs;\n  const {perm} = attrs;\n\n  assertNotComplex(x, 'transpose');\n\n  const xRank = x.shape.length;\n\n  const newShape: number[] = new Array(xRank);\n  for (let i = 0; i < newShape.length; i++) {\n    newShape[i] = x.shape[perm[i]];\n  }\n\n  const values = backend.data.get(x.dataId).values as TypedArray;\n  const result = transposeImpl(values, x.shape, x.dtype, perm, newShape);\n\n  const dataId = backend.write(result, newShape, x.dtype);\n  return {dataId, shape: newShape, dtype: x.dtype};\n}\n\nexport const transposeConfig: KernelConfig = {\n  kernelName: Transpose,\n  backendName: 'cpu',\n  kernelFunc: transpose as unknown as KernelFunc\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {DataType, NumericDataType, TypedArray} from '@tensorflow/tfjs-core';\nimport {util} from '@tensorflow/tfjs-core';\n\nexport function transposeImpl(\n    xVals: TypedArray, xShape: number[], dtype: DataType, perm: number[],\n    newShape: number[]): TypedArray {\n  const xRank = xShape.length;\n  const xSize = util.sizeFromShape(xShape);\n  const xStrides = util.computeStrides(xShape);\n  const newStrides = util.computeStrides(newShape);\n\n  const result = util.getTypedArrayFromDType(\n      dtype as NumericDataType, util.sizeFromShape(newShape));\n\n  for (let i = 0; i < xSize; ++i) {\n    const loc = util.indexToLoc(i, xRank, xStrides);\n\n    // Permute location.\n    const newLoc: number[] = new Array(loc.length);\n    for (let i = 0; i < newLoc.length; i++) {\n      newLoc[i] = loc[perm[i]];\n    }\n\n    const newIndex = util.locToIndex(newLoc, xRank, newStrides);\n    result[newIndex] = xVals[i];\n  }\n  return result;\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {DataTypeMap, util} from '@tensorflow/tfjs-core';\n\nexport function rangeImpl(\n    start: number, stop: number, step: number,\n    dtype: 'float32'|'int32'): DataTypeMap['float32' | 'int32'] {\n  const sameStartStop = start === stop;\n  const increasingRangeNegativeStep = start < stop && step < 0;\n  const decreasingRangePositiveStep = stop < start && step > 1;\n\n  if (sameStartStop || increasingRangeNegativeStep ||\n      decreasingRangePositiveStep) {\n    return util.makeZerosTypedArray(0, dtype);\n  }\n\n  const numElements = Math.abs(Math.ceil((stop - start) / step));\n  const values = util.makeZerosTypedArray(numElements, dtype);\n\n  if (stop < start && step === 1) {\n    // Auto adjust the step's sign if it hasn't been set\n    // (or was set to 1)\n    step = -1;\n  }\n\n  values[0] = start;\n  for (let i = 1; i < values.length; i++) {\n    values[i] = values[i - 1] + step;\n  }\n  return values;\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the License);\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an AS IS BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {KernelConfig, Rsqrt} from '@tensorflow/tfjs-core';\n\nimport {createSimpleUnaryImpl} from '../utils/unary_impl';\nimport {unaryKernelFuncFromImpl} from '../utils/unary_utils';\n\nexport const rsqrtImpl = createSimpleUnaryImpl((xi) => 1 / Math.sqrt(xi));\nexport const rsqrt = unaryKernelFuncFromImpl(Rsqrt, rsqrtImpl);\n\nexport const rsqrtConfig: KernelConfig = {\n  kernelName: Rsqrt,\n  backendName: 'cpu',\n  kernelFunc: rsqrt,\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {backend_util, BackendValues, buffer, DataType, KernelConfig, KernelFunc, Slice, slice_util, SliceAttrs, SliceInputs, TensorInfo, TypedArray, util} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\nimport {assertNotComplex} from '../cpu_util';\n\nexport function sliceImpl(\n    vals: BackendValues, begin: number[], size: number[], shape: number[],\n    dtype: DataType): BackendValues {\n  const isContinous = slice_util.isSliceContinous(shape, begin, size);\n  const length = util.sizeFromShape(size);\n  const xStrides = util.computeStrides(shape);\n\n  if (isContinous) {\n    const flatOffset = slice_util.computeFlatOffset(begin, xStrides);\n\n    if (dtype === 'string') {\n      return (vals as Uint8Array[]).slice(flatOffset, flatOffset + length);\n    }\n\n    return (vals as TypedArray).subarray(flatOffset, flatOffset + length);\n  }\n\n  const decodedData = dtype === 'string' ?\n      backend_util.fromUint8ToStringArray(vals as Uint8Array[]) :\n      vals as TypedArray;\n\n  const inBuf = buffer(shape, dtype, decodedData);\n  const outBuf = buffer(size, dtype);\n  for (let i = 0; i < outBuf.size; ++i) {\n    const outLoc = outBuf.indexToLoc(i);\n    const inLoc = outLoc.map((idx: number, j) => idx + begin[j]);\n    outBuf.set(inBuf.get(...inLoc), ...outLoc);\n  }\n\n  if (dtype === 'string') {\n    return backend_util.fromStringArrayToUint8(outBuf.values as string[]);\n  }\n  return outBuf.values as TypedArray;\n}\n\nexport function slice(\n    args: {inputs: SliceInputs, backend: MathBackendCPU, attrs: SliceAttrs}):\n    TensorInfo {\n  const {inputs, backend, attrs} = args;\n  const {x} = inputs;\n  const {begin, size} = attrs;\n\n  assertNotComplex(x, 'slice');\n\n  const [$begin, $size] = slice_util.parseSliceParams(x, begin, size);\n  slice_util.assertParamsValid(x, $begin, $size);\n\n  const vals = backend.data.get(x.dataId).values;\n  const outVals = sliceImpl(vals, $begin, $size, x.shape, x.dtype);\n  return backend.makeTensorInfo($size, x.dtype, outVals);\n}\n\nexport const sliceConfig: KernelConfig = {\n  kernelName: Slice,\n  backendName: 'cpu',\n  kernelFunc: slice as unknown as KernelFunc\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {KernelConfig, SquaredDifference} from '@tensorflow/tfjs-core';\n\nimport {createSimpleBinaryKernelImpl} from '../utils/binary_impl';\nimport {binaryKernelFunc} from '../utils/binary_utils';\n\nexport const squaredDifferenceImpl =\n    createSimpleBinaryKernelImpl(((a: number, b: number) => {\n      const diff = a - b;\n      return diff * diff;\n    }));\nexport const squaredDifference =\n    binaryKernelFunc(SquaredDifference, squaredDifferenceImpl);\n\nexport const squaredDifferenceConfig: KernelConfig = {\n  kernelName: SquaredDifference,\n  backendName: 'cpu',\n  kernelFunc: squaredDifference\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {buffer, Rank, TensorBuffer} from '@tensorflow/tfjs-core';\n\nexport function stridedSliceImpl<R extends Rank>(\n    outShape: number[], xBuf: TensorBuffer<R>, strides: number[],\n    begin: number[]): TensorBuffer<R> {\n  const outBuf = buffer(outShape, xBuf.dtype);\n\n  for (let i = 0; i < outBuf.size; i++) {\n    const loc = outBuf.indexToLoc(i);\n\n    const newLoc: number[] = new Array(loc.length);\n    for (let j = 0; j < newLoc.length; j++) {\n      newLoc[j] = loc[j] * strides[j] + begin[j];\n    }\n    outBuf.set(xBuf.get(...newLoc), ...loc);\n  }\n\n  return outBuf as TensorBuffer<R>;\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {KernelConfig, Sub} from '@tensorflow/tfjs-core';\n\nimport {createSimpleBinaryKernelImpl} from '../utils/binary_impl';\nimport {binaryKernelFunc, createComplexBinaryKernelImpl} from '../utils/binary_utils';\n\nexport const subImpl = createSimpleBinaryKernelImpl(\n    ((aValue: number, bValue: number) => aValue - bValue));\nexport const subComplexImpl =\n    createComplexBinaryKernelImpl(((aReal, aImag, bReal, bImag) => {\n      return {real: aReal - bReal, imag: aImag - bImag};\n    }));\nexport const sub = binaryKernelFunc(Sub, subImpl, subComplexImpl);\n\nexport const subConfig: KernelConfig = {\n  kernelName: Sub,\n  backendName: 'cpu',\n  kernelFunc: sub\n};\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {buffer, DataType, Rank, TensorBuffer} from '@tensorflow/tfjs-core';\n\n/**\n * An implementation of the tile kernel shared between webgl and cpu for string\n * tensors only.\n */\n\nexport function tileImpl<R extends Rank>(\n    xBuf: TensorBuffer<R, DataType>,\n    reps: number[]): TensorBuffer<R, DataType> {\n  const newShape: number[] = new Array(xBuf.rank);\n  for (let i = 0; i < newShape.length; i++) {\n    newShape[i] = xBuf.shape[i] * reps[i];\n  }\n  const result = buffer(newShape, xBuf.dtype);\n  for (let i = 0; i < result.values.length; ++i) {\n    const newLoc = result.indexToLoc(i);\n\n    const originalLoc: number[] = new Array(xBuf.rank);\n    for (let j = 0; j < originalLoc.length; j++) {\n      originalLoc[j] = newLoc[j] % xBuf.shape[j];\n    }\n\n    const originalIndex = xBuf.locToIndex(originalLoc);\n\n    result.values[i] = xBuf.values[originalIndex];\n  }\n  return result as TensorBuffer<R, DataType>;\n}\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {backend_util, GatherV2, GatherV2Attrs, GatherV2Inputs, KernelConfig, KernelFunc, TensorInfo, TypedArray, util} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\nimport {assertNotComplex} from '../cpu_util';\nimport {gatherV2Impl} from './GatherV2_impl';\nimport {reshape} from './Reshape';\n\nexport function gatherV2(args: {\n  inputs: GatherV2Inputs,\n  backend: MathBackendCPU,\n  attrs: GatherV2Attrs\n}): TensorInfo {\n  const {inputs, backend, attrs} = args;\n  const {x, indices} = inputs;\n  const {axis, batchDims} = attrs;\n\n  assertNotComplex([x, indices], 'gatherV2');\n\n  // Throw error when any index is out of bound.\n  const parsedAxis = util.parseAxisParam(axis, x.shape)[0];\n  const indicesVals = backend.data.get(indices.dataId).values as TypedArray;\n  const axisDim = x.shape[parsedAxis];\n  for (let i = 0; i < indicesVals.length; ++i) {\n    const index = indicesVals[i];\n    util.assert(\n        index <= axisDim - 1 && index >= 0,\n        () =>\n            `GatherV2: the index value ${index} is not in [0, ${axisDim - 1}]`);\n  }\n\n  let $batchDims = batchDims;\n\n  if (batchDims == null) {\n    $batchDims = 0;\n  }\n\n  const indicesSize = util.sizeFromShape(indices.shape);\n\n  const shapeInfo = backend_util.segment_util.collectGatherOpShapeInfo(\n      x, indices, parsedAxis, $batchDims);\n\n  const flattenX = reshape({\n    inputs: {x},\n    backend,\n    attrs: {\n      shape: [\n        shapeInfo.batchSize, shapeInfo.outerSize, shapeInfo.dimSize,\n        shapeInfo.sliceSize\n      ]\n    }\n  });\n\n  const flattenIndex = reshape({\n    inputs: {x: indices},\n    backend,\n    attrs: {shape: [shapeInfo.batchSize, indicesSize / shapeInfo.batchSize]}\n  });\n\n  const flattenOutputShape = [\n    shapeInfo.batchSize, shapeInfo.outerSize, indicesSize / shapeInfo.batchSize,\n    shapeInfo.sliceSize\n  ];\n\n  const indicesBuf = backend.bufferSync(flattenIndex);\n  const xBuf = backend.bufferSync(flattenX);\n  const outBuf = gatherV2Impl(xBuf, indicesBuf, flattenOutputShape);\n\n  backend.disposeIntermediateTensorInfo(flattenX);\n  backend.disposeIntermediateTensorInfo(flattenIndex);\n\n  return backend.makeTensorInfo(\n      shapeInfo.outputShape, outBuf.dtype, outBuf.values);\n}\n\nexport const gatherV2Config: KernelConfig = {\n  kernelName: GatherV2,\n  backendName: 'cpu',\n  kernelFunc: gatherV2 as unknown as KernelFunc\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {KernelConfig, KernelFunc, Reshape, ReshapeAttrs, ReshapeInputs, TensorInfo, util} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\n\nexport function reshape(\n    args:\n        {inputs: ReshapeInputs, backend: MathBackendCPU, attrs: ReshapeAttrs}):\n    TensorInfo {\n  const {inputs, backend, attrs} = args;\n  const {x} = inputs;\n  const {shape} = attrs;\n\n  const xSize = util.sizeFromShape(x.shape);\n  const $shape = util.inferFromImplicitShape(shape, xSize);\n  const $xSize = util.sizeFromShape($shape);\n\n  util.assert(\n      xSize === $xSize,\n      () => `The new shape (${$shape}) has ${$xSize} elements and the old ` +\n          `shape (${x.shape}) has ${xSize} elements. The new shape and old ` +\n          `shape must have the same number of elements.`);\n\n  backend.incRef(x.dataId);\n\n  const xData = backend.data.get(x.dataId);\n\n  if (xData.complexTensorInfos != null) {\n    const real = xData.complexTensorInfos.real;\n    const imag = xData.complexTensorInfos.imag;\n\n    real.shape = $shape;\n    imag.shape = $shape;\n  }\n\n  return {dataId: x.dataId, shape: $shape, dtype: x.dtype};\n}\n\nexport const reshapeConfig: KernelConfig = {\n  kernelName: Reshape,\n  backendName: 'cpu',\n  kernelFunc: reshape as unknown as KernelFunc\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {ExpandDims, ExpandDimsAttrs, ExpandDimsInputs, KernelConfig, KernelFunc, TensorInfo, util} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\nimport {reshape} from './Reshape';\n\nexport function expandDims(args: {\n  inputs: ExpandDimsInputs,\n  backend: MathBackendCPU,\n  attrs: ExpandDimsAttrs\n}): TensorInfo {\n  const {inputs, backend, attrs} = args;\n  const {input} = inputs;\n  const {dim} = attrs;\n\n  const inputRank = input.shape.length;\n  const newShape = input.shape.slice();\n  let $dim = dim;\n  if (dim < 0) {\n    // Negative value is counted from the tail of rank.\n    util.assert(\n        -(inputRank + 1) <= dim,\n        () => `Axis must be in the interval [${- (inputRank + 1)}, ${\n            inputRank}]`);\n    $dim = inputRank + dim + 1;\n  }\n  newShape.splice($dim, 0, 1);\n\n  return reshape({inputs: {x: input}, backend, attrs: {shape: newShape}});\n}\n\nexport const expandDimsConfig: KernelConfig = {\n  kernelName: ExpandDims,\n  backendName: 'cpu',\n  kernelFunc: expandDims as unknown as KernelFunc\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {KernelConfig, KernelFunc, Rank, slice_util, StridedSlice, StridedSliceAttrs, StridedSliceInputs, TensorInfo, util} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\nimport {assertNotComplex} from '../cpu_util';\nimport {reshape} from './Reshape';\nimport {slice} from './Slice';\nimport {stridedSliceImpl} from './StridedSlice_impl';\n\nexport function stridedSlice(args: {\n  inputs: StridedSliceInputs,\n  backend: MathBackendCPU,\n  attrs: StridedSliceAttrs\n}): TensorInfo {\n  const {inputs, backend, attrs} = args;\n  const {x} = inputs;\n  const {\n    begin,\n    end,\n    strides,\n    beginMask,\n    endMask,\n    ellipsisMask,\n    newAxisMask,\n    shrinkAxisMask\n  } = attrs;\n\n  assertNotComplex(x, 'stridedSlice');\n\n  const {\n    finalShapeSparse,\n    finalShape,\n    isIdentity,\n    sliceDim0,\n    isSimpleSlice,\n    begin: $begin,\n    end: $end,\n    strides: $strides\n  } =\n      slice_util.sliceInfo(\n          x.shape, begin, end, strides, beginMask, endMask, ellipsisMask,\n          newAxisMask, shrinkAxisMask);\n\n  let result;\n\n  // ref:\n  // https://github.com/tensorflow/tensorflow/blob/master/tensorflow/core/kernels/strided_slice_op.cc\n  if (isIdentity) {\n    // Optimization #1, slice is a no-op plus reshape\n    result = reshape({inputs: {x}, backend, attrs: {shape: finalShape}});\n  } else if (sliceDim0 || isSimpleSlice) {\n    // Optimization #2, slice is memory contiguous (only occurs in dim 0)\n    util.assert(\n        x.shape.length >= 1,\n        () => `Input must have rank at least 1, got: ${x.shape.length}`);\n\n    const size = slice_util.computeOutShape($begin, $end, $strides);\n    // To tolerate begin[0] > end[0] (a 0-output slice), we min(begin, end).\n    const sliced = slice({inputs: {x}, backend, attrs: {begin: $begin, size}});\n    result =\n        reshape({inputs: {x: sliced}, backend, attrs: {shape: finalShape}});\n    backend.disposeIntermediateTensorInfo(sliced);\n  } else {\n    const xBuf = backend.bufferSync<Rank, 'float32'>(x);\n    const outBuf = stridedSliceImpl(finalShapeSparse, xBuf, $strides, $begin);\n\n    result = backend.makeTensorInfo(finalShape, outBuf.dtype, outBuf.values);\n  }\n\n  return result;\n}\n\nexport const stridedSliceConfig: KernelConfig = {\n  kernelName: StridedSlice,\n  backendName: 'cpu',\n  kernelFunc: stridedSlice as unknown as KernelFunc\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {KernelConfig, KernelFunc, Pack, PackAttrs, PackInputs, TensorInfo, util} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\nimport {concat} from './Concat';\nimport {expandDims} from './ExpandDims';\n\nexport function pack(\n    args: {inputs: PackInputs, backend: MathBackendCPU, attrs: PackAttrs}):\n    TensorInfo {\n  const {inputs, backend, attrs} = args;\n  const {axis} = attrs;\n\n  if (inputs.length === 1) {\n    return expandDims(\n        {inputs: {input: inputs[0]}, backend, attrs: {dim: axis}});\n  }\n\n  const shape = inputs[0].shape;\n  const dtype = inputs[0].dtype;\n\n  inputs.forEach(t => {\n    util.assertShapesMatch(\n        shape, t.shape,\n        'All tensors passed to stack must have matching shapes');\n    util.assert(\n        dtype === t.dtype,\n        () => 'All tensors passed to stack must have matching dtypes');\n  });\n\n  const intermediateTensorInfos: TensorInfo[] = [];\n  const expandedTensors = inputs.map(t => {\n    const expandedT =\n        expandDims({inputs: {input: t}, backend, attrs: {dim: axis}});\n    intermediateTensorInfos.push(expandedT);\n    return expandedT;\n  });\n\n  const result = concat({inputs: expandedTensors, backend, attrs: {axis}});\n\n  intermediateTensorInfos.forEach(\n      t => backend.disposeIntermediateTensorInfo(t));\n\n  return result;\n}\n\nexport const packConfig: KernelConfig = {\n  kernelName: Pack,\n  backendName: 'cpu',\n  kernelFunc: pack as unknown as KernelFunc\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {backend_util, Concat, ConcatAttrs, ConcatInputs, KernelConfig, KernelFunc, TensorInfo, util} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\n\nimport {complex} from './Complex';\nimport {concatImpl} from './Concat_impl';\nimport {identity} from './Identity';\nimport {imag} from './Imag';\nimport {real} from './Real';\nimport {reshape} from './Reshape';\n\nexport function concat(\n    args: {inputs: ConcatInputs, backend: MathBackendCPU, attrs: ConcatAttrs}):\n    TensorInfo {\n  const {inputs, backend, attrs} = args;\n  const {axis} = attrs;\n\n  const $axis = util.parseAxisParam(axis, inputs[0].shape)[0];\n\n  const shapes = inputs.map(t => t.shape);\n  backend_util.assertParamsConsistent(shapes, $axis);\n\n  let outShape = backend_util.computeOutShape(inputs.map(t => t.shape), $axis);\n\n  if (util.sizeFromShape(outShape) === 0) {\n    return backend.makeTensorInfo(outShape, inputs[0].dtype, []);\n  }\n\n  // Keep only non-empty tensors (ignore tensors with 0 in their shape).\n  const $inputs = inputs.filter(t => util.sizeFromShape(t.shape) > 0);\n  if ($inputs.length === 1) {\n    return identity({inputs: {x: $inputs[0]}, backend});\n  }\n\n  if ($inputs[0].dtype === 'complex64') {\n    const reals = $inputs.map((t) => real({inputs: {input: t}, backend}));\n    const imags = $inputs.map((t) => imag({inputs: {input: t}, backend}));\n\n    const realConcated = concat({inputs: reals, backend, attrs: {axis: $axis}});\n    const imagConcated = concat({inputs: imags, backend, attrs: {axis: $axis}});\n\n    const result =\n        complex({inputs: {real: realConcated, imag: imagConcated}, backend});\n\n    reals.forEach(r => backend.disposeIntermediateTensorInfo(r));\n    imags.forEach(i => backend.disposeIntermediateTensorInfo(i));\n    backend.disposeIntermediateTensorInfo(realConcated);\n    backend.disposeIntermediateTensorInfo(imagConcated);\n\n    return result;\n  }\n\n  // Any concat of n-dimensional tensors across any axis can be reduced to\n  // a concatenation of two-dimensional tensors across the axis 1 by first\n  // partitioning the axes of the original tensors into those less than the\n  // axis to be concatenated and the rest. Then reshape the tensors\n  // into a two-dimensional tensor by collapsing these two sets of axes and\n  // concatenate the resulting matrices across the axis 1, finally reshaping\n  // the result to have the proper shape.\n  const inputs2D = $inputs.map(t => {\n    const innerSize = util.sizeFromShape(t.shape.slice($axis));\n    const shape = [-1, innerSize];\n    return reshape({inputs: {x: t}, backend, attrs: {shape}});\n  });\n\n  const inputsValShapes = inputs2D.map(t => {\n    return {vals: backend.data.get(t.dataId).values, shape: t.shape};\n  });\n\n  // Concats 2d tensors along axis=1.\n  outShape =\n      backend_util.computeOutShape(inputs2D.map(t => t.shape), 1 /* axis */);\n  const simplyConcat = inputs2D[0].shape[0] === 1;\n  const outVals =\n      concatImpl(inputsValShapes, outShape, inputs[0].dtype, simplyConcat);\n\n  const finalOutShape =\n      backend_util.computeOutShape($inputs.map(t => t.shape), $axis);\n\n  const outInfo =\n      backend.makeTensorInfo(finalOutShape, inputs[0].dtype, outVals);\n\n  inputs2D.forEach(t => backend.disposeIntermediateTensorInfo(t));\n\n  return outInfo;\n}\n\nexport const concatConfig: KernelConfig = {\n  kernelName: Concat,\n  backendName: 'cpu',\n  kernelFunc: concat as unknown as KernelFunc\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Imag, ImagInputs, KernelConfig, KernelFunc, TensorInfo} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\n\nexport function imag(args: {inputs: ImagInputs, backend: MathBackendCPU}):\n    TensorInfo {\n  const {inputs, backend} = args;\n  const {input} = inputs;\n\n  const imag = backend.data.get(input.dataId).complexTensorInfos.imag;\n  const imagVal = backend.data.get(imag.dataId).values;\n\n  // When complex tensor is disposed, its underlying parts will be disposed too.\n  // Make new tensor out of the imag value of the complex. This makes sure the\n  // value is still accessible even if complex tensor is disposed.\n  return backend.makeTensorInfo(imag.shape, imag.dtype, imagVal);\n}\n\nexport const imagConfig: KernelConfig = {\n  kernelName: Imag,\n  backendName: 'cpu',\n  kernelFunc: imag as unknown as KernelFunc\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {KernelConfig, KernelFunc, Range, RangeAttrs, TensorInfo} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\nimport {rangeImpl} from './Range_impl';\n\nexport function range(args: {backend: MathBackendCPU, attrs: RangeAttrs}):\n    TensorInfo {\n  const {backend, attrs} = args;\n  const {start, stop, dtype, step} = attrs;\n\n  const values = rangeImpl(start, stop, step, dtype);\n  return backend.makeTensorInfo([values.length], dtype, values);\n}\n\nexport const rangeConfig: KernelConfig = {\n  kernelName: Range,\n  backendName: 'cpu',\n  kernelFunc: range as unknown as KernelFunc\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {backend_util, KernelConfig, KernelFunc, Mean, MeanAttrs, MeanInputs, TensorInfo, util} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\nimport {cast} from './Cast';\nimport {div} from './RealDiv';\nimport {sum} from './Sum';\n\nexport function mean(\n    args: {inputs: MeanInputs, backend: MathBackendCPU, attrs: MeanAttrs}):\n    TensorInfo {\n  const {inputs, backend, attrs} = args;\n  const {x} = inputs;\n  const {axis, keepDims} = attrs;\n\n  const axes = util.parseAxisParam(axis, x.shape);\n  const shapes = backend_util.computeOutAndReduceShapes(x.shape, axes);\n  const reduceShape = shapes[1];\n  const reduceSize = util.sizeFromShape(reduceShape);\n  const toDispose = [];\n  const reduceSizeScalar =\n      backend.makeTensorInfo([], 'float32', new Float32Array([reduceSize]));\n  toDispose.push(reduceSizeScalar);\n\n  const $x = cast({inputs: {x}, backend, attrs: {dtype: 'float32'}});\n  toDispose.push($x);\n\n  const res =\n      div({inputs: {a: $x, b: reduceSizeScalar}, backend}) as TensorInfo;\n  toDispose.push(res);\n\n  const result = sum({inputs: {x: res}, backend, attrs: {axis, keepDims}});\n\n  toDispose.forEach(t => backend.disposeIntermediateTensorInfo(t));\n\n  return result;\n}\n\nexport const meanConfig: KernelConfig = {\n  kernelName: Mean,\n  backendName: 'cpu',\n  kernelFunc: mean as unknown as KernelFunc\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {KernelConfig, RealDiv} from '@tensorflow/tfjs-core';\n\nimport {createSimpleBinaryKernelImpl} from '../utils/binary_impl';\nimport {binaryKernelFunc} from '../utils/binary_utils';\n\nexport const realDivImpl =\n    createSimpleBinaryKernelImpl((a: number, b: number) => a / b);\nexport const div = binaryKernelFunc(RealDiv, realDivImpl);\n\nexport const realDivConfig: KernelConfig = {\n  kernelName: RealDiv,\n  backendName: 'cpu',\n  kernelFunc: div\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {backend_util, KernelConfig, KernelFunc, Sum, SumAttrs, SumInputs, TensorInfo, TypedArray, util} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\nimport {assertNotComplex} from '../cpu_util';\nimport {zeros} from '../utils/zeros_impl';\nimport {cast} from './Cast';\nimport {identity} from './Identity';\nimport {reshape} from './Reshape';\nimport {transpose} from './Transpose';\n\nexport function sum(\n    args: {inputs: SumInputs, backend: MathBackendCPU, attrs: SumAttrs}):\n    TensorInfo {\n  const {inputs, backend, attrs} = args;\n  const {x} = inputs;\n  const {axis, keepDims} = attrs;\n\n  assertNotComplex(x, 'sum');\n\n  let $x;\n  if (x.dtype === 'bool') {\n    $x = cast({inputs: {x}, backend, attrs: {dtype: 'int32'}});\n  } else {\n    $x = identity({inputs: {x}, backend});\n  }\n\n  const xRank = $x.shape.length;\n  const axes = util.parseAxisParam(axis, $x.shape);\n  const permutation = backend_util.getAxesPermutation(axes, xRank);\n\n  let reductionAxes = axes;\n  let permutedX = $x;\n  if (permutation != null) {\n    permutedX =\n        transpose({inputs: {x: $x}, backend, attrs: {perm: permutation}});\n    reductionAxes = backend_util.getInnerMostAxes(reductionAxes.length, xRank);\n  }\n\n  backend_util.assertAxesAreInnerMostDims(\n      'sum', reductionAxes, permutedX.shape.length);\n\n  const [outShape, reduceShape] =\n      backend_util.computeOutAndReduceShapes(permutedX.shape, reductionAxes);\n  const resultDtype = backend_util.upcastType(permutedX.dtype, 'int32');\n  let result = zeros(backend, outShape, resultDtype);\n  const reduceSize = util.sizeFromShape(reduceShape);\n  const vals = backend.data.get(result.dataId).values as TypedArray;\n\n  const aVals = backend.data.get(permutedX.dataId).values as TypedArray;\n  for (let i = 0; i < vals.length; ++i) {\n    const offset = i * reduceSize;\n    let sum = 0;\n    for (let j = 0; j < reduceSize; ++j) {\n      sum += aVals[offset + j];\n    }\n    vals[i] = sum;\n  }\n\n  if (keepDims) {\n    const newShape = backend_util.expandShapeToKeepDim(result.shape, axes);\n    const oldResult = result;\n    result = reshape({inputs: {x: result}, backend, attrs: {shape: newShape}});\n    backend.disposeIntermediateTensorInfo(oldResult);\n  }\n\n  backend.disposeIntermediateTensorInfo($x);\n\n  if (permutation != null) {\n    backend.disposeIntermediateTensorInfo(permutedX);\n  }\n\n  return result;\n}\n\nexport const sumConfig: KernelConfig = {\n  kernelName: Sum,\n  backendName: 'cpu',\n  kernelFunc: sum as unknown as KernelFunc\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the License);\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an AS IS BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {BatchMatMul, BatchMatMulAttrs, BatchMatMulInputs, broadcast_util, buffer, KernelConfig, KernelFunc, TypedArray, util} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\nimport {assertNotComplex} from '../cpu_util';\n\nimport {reshape} from './Reshape';\n\nexport function batchMatMul(args: {\n  inputs: BatchMatMulInputs,\n  attrs: BatchMatMulAttrs,\n  backend: MathBackendCPU\n}) {\n  const {inputs, backend, attrs} = args;\n  const {a, b} = inputs;\n  const {transposeA, transposeB} = attrs;\n\n  assertNotComplex([a, b], 'matMul');\n\n  const aRank = a.shape.length;\n  const bRank = b.shape.length;\n\n  const innerShapeA = transposeA ? a.shape[aRank - 2] : a.shape[aRank - 1];\n  const innerShapeB = transposeB ? b.shape[bRank - 1] : b.shape[bRank - 2];\n\n  const outerShapeA = transposeA ? a.shape[aRank - 1] : a.shape[aRank - 2];\n  const outerShapeB = transposeB ? b.shape[bRank - 2] : b.shape[bRank - 1];\n\n  const outerDimsA = a.shape.slice(0, -2);\n  const outerDimsB = b.shape.slice(0, -2);\n\n  const batchDimA = util.sizeFromShape(outerDimsA);\n  const batchDimB = util.sizeFromShape(outerDimsB);\n\n  const outShapeOuterDims = broadcast_util.assertAndGetBroadcastShape(\n      a.shape.slice(0, -2), b.shape.slice(0, -2));\n  const outShape = outShapeOuterDims.concat([outerShapeA, outerShapeB]);\n\n  util.assert(\n      innerShapeA === innerShapeB,\n      () => `Error in matMul: inner shapes (${innerShapeA}) and (` +\n          `${innerShapeB}) of Tensors with shapes ${a.shape} and ` +\n          `${b.shape} and transposeA=${transposeA}` +\n          ` and transposeB=${transposeB} must match.`);\n\n  const a3dShape = transposeA ? [batchDimA, innerShapeA, outerShapeA] :\n                                [batchDimA, outerShapeA, innerShapeA];\n  const b3dShape = transposeB ? [batchDimB, outerShapeB, innerShapeB] :\n                                [batchDimB, innerShapeB, outerShapeB];\n\n  // The rest of the implementation is designed to operate on rank-3 tensors\n  const a3d = reshape({inputs: {x: a}, backend, attrs: {shape: a3dShape}});\n  const b3d = reshape({inputs: {x: b}, backend, attrs: {shape: b3dShape}});\n\n  const sharedDim = transposeA ? a3d.shape[1] : a3d.shape[2];\n  const leftDim = transposeA ? a3d.shape[2] : a3d.shape[1];\n  const rightDim = transposeB ? b3d.shape[1] : b3d.shape[2];\n  const batchDim = Math.max(batchDimA, batchDimB);\n\n  const a3dValues = backend.data.get(a3d.dataId).values as TypedArray;\n  const b3dValues = backend.data.get(b3d.dataId).values as TypedArray;\n\n  const a3dStrides = util.computeStrides(a3d.shape);\n  const b3dStrides = util.computeStrides(b3d.shape);\n\n  const [aBatch, aOuterStep, aInnerStep] = transposeA ?\n      [a3dStrides[0], 1, a3dStrides[1]] :\n      [a3dStrides[0], a3dStrides[1], 1];\n  const [bInnerStep, bOuterStep, bBatch] = transposeB ?\n      [1, b3dStrides[1], b3dStrides[0]] :\n      [b3dStrides[1], 1, b3dStrides[0]];\n\n  const size = leftDim * rightDim;\n  const result = buffer([batchDim, leftDim, rightDim], a3d.dtype);\n\n  const resVals = result.values as TypedArray;\n  const blockSize = backend.blockSize;\n\n  for (let bi = 0; bi < batchDim; bi++) {\n    const batchIndexA = bi % batchDimA;\n    const batchIndexB = bi % batchDimB;\n    for (let i0 = 0; i0 < leftDim; i0 += blockSize) {\n      // for when blockSize doesn't evenly divide the input\n      const iBlock = Math.min(i0 + blockSize, leftDim);\n      for (let j0 = 0; j0 < rightDim; j0 += blockSize) {\n        const jBlock = Math.min(j0 + blockSize, rightDim);\n        for (let k0 = 0; k0 < sharedDim; k0 += blockSize) {\n          const kBlock = Math.min(k0 + blockSize, sharedDim);\n\n          for (let i = i0; i < iBlock; i++) {\n            for (let j = j0; j < jBlock; j++) {\n              let sum = 0.0;\n\n              for (let k = k0; k < kBlock; k++) {\n                const aVal =\n                    // tslint:disable-next-line: max-line-length\n                    a3dValues[batchIndexA * aBatch + i * aOuterStep + k * aInnerStep];\n                const bVal =\n                    // tslint:disable-next-line: max-line-length\n                    b3dValues[k * bInnerStep + j * bOuterStep + batchIndexB * bBatch];\n                sum += aVal * bVal;\n              }\n              resVals[bi * size + (i * rightDim + j)] += sum;\n            }\n          }\n        }\n      }\n    }\n  }\n\n  backend.disposeIntermediateTensorInfo(a3d);\n  backend.disposeIntermediateTensorInfo(b3d);\n\n  // set correct shape on output.\n  return backend.makeTensorInfo(\n      outShape, result.dtype, result.values as TypedArray);\n}\n\nexport const batchMatMulConfig: KernelConfig = {\n  kernelName: BatchMatMul,\n  backendName: 'cpu',\n  kernelFunc: batchMatMul as unknown as KernelFunc,\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {backend_util, KernelConfig, KernelFunc, Softmax, SoftmaxAttrs, SoftmaxInputs, TensorInfo, util} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\n\nimport {exp} from './Exp';\nimport {max} from './Max';\nimport {div} from './RealDiv';\nimport {reshape} from './Reshape';\nimport {sub} from './Sub';\nimport {sum} from './Sum';\n\nexport function softmax(\n    args:\n        {inputs: SoftmaxInputs, backend: MathBackendCPU, attrs: SoftmaxAttrs}):\n    TensorInfo {\n  const {inputs, backend, attrs} = args;\n  const {logits} = inputs;\n  const {dim} = attrs;\n\n  const logitsRank = logits.shape.length;\n\n  let $dim = dim;\n  if ($dim === -1) {\n    $dim = logitsRank - 1;\n  }\n  if ($dim !== logitsRank - 1) {\n    throw Error(\n        'Softmax along a non-last dimension is not yet supported. ' +\n        `Logits was rank ${logitsRank} and dim was ${$dim}`);\n  }\n\n  const axes = util.parseAxisParam([$dim], logits.shape);\n  const maxLogit = max({\n    inputs: {x: logits},\n    backend,\n    attrs: {reductionIndices: axes, keepDims: false}\n  });\n  const expandedShape = backend_util.expandShapeToKeepDim(maxLogit.shape, axes);\n\n  const maxLogitReshaped =\n      reshape({inputs: {x: maxLogit}, backend, attrs: {shape: expandedShape}});\n  const a =\n      sub({inputs: {a: logits, b: maxLogitReshaped}, backend}) as TensorInfo;\n  const b = exp({inputs: {x: a}, backend}) as TensorInfo;\n  const sumExp =\n      sum({inputs: {x: b}, backend, attrs: {axis: axes, keepDims: false}});\n  const sumReshaped =\n      reshape({inputs: {x: sumExp}, backend, attrs: {shape: expandedShape}});\n\n  const result = div({inputs: {a: b, b: sumReshaped}, backend}) as TensorInfo;\n\n  backend.disposeIntermediateTensorInfo(maxLogit);\n  backend.disposeIntermediateTensorInfo(maxLogitReshaped);\n  backend.disposeIntermediateTensorInfo(a);\n  backend.disposeIntermediateTensorInfo(b);\n  backend.disposeIntermediateTensorInfo(sumExp);\n  backend.disposeIntermediateTensorInfo(sumReshaped);\n\n  return result;\n}\n\nexport const softmaxConfig: KernelConfig = {\n  kernelName: Softmax,\n  backendName: 'cpu',\n  kernelFunc: softmax as unknown as KernelFunc\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {KernelFunc, Max, MaxAttrs, MaxInputs, TensorInfo} from '@tensorflow/tfjs-core';\nimport {backend_util, KernelConfig} from '@tensorflow/tfjs-core';\nimport {TypedArray, util} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\nimport {assertNotComplex} from '../cpu_util';\n\nimport {maxImpl} from './Max_impl';\nimport {transposeImpl} from './Transpose_impl';\n\nexport function max(\n    args: {inputs: MaxInputs, backend: MathBackendCPU, attrs: MaxAttrs}):\n    TensorInfo {\n  const {inputs, backend, attrs} = args;\n  const {x} = inputs;\n  const {reductionIndices, keepDims} = attrs;\n  const cpuBackend = backend;\n  let xShape = x.shape;\n  const xRank = xShape.length;\n\n  const origAxes = util.parseAxisParam(reductionIndices, xShape);\n  let axes = origAxes;\n  const permutedAxes = backend_util.getAxesPermutation(axes, xRank);\n  let xVals = cpuBackend.data.get(x.dataId).values as TypedArray;\n  if (permutedAxes != null) {\n    const newShape: number[] = new Array(xRank);\n    for (let i = 0; i < newShape.length; i++) {\n      newShape[i] = xShape[permutedAxes[i]];\n    }\n\n    xVals = transposeImpl(xVals, xShape, x.dtype, permutedAxes, newShape);\n    axes = backend_util.getInnerMostAxes(axes.length, xRank);\n\n    xShape = newShape;\n  }\n\n  assertNotComplex(x, 'max');\n  backend_util.assertAxesAreInnerMostDims('max', axes, xRank);\n  const [maxOutShape, reduceShape] =\n      backend_util.computeOutAndReduceShapes(xShape, axes);\n\n  const reduceSize = util.sizeFromShape(reduceShape);\n\n  const result = maxImpl(xVals, reduceSize, maxOutShape, x.dtype);\n  const dataId = cpuBackend.write(result, maxOutShape, x.dtype);\n\n  let outShape = maxOutShape;\n  if (keepDims) {\n    // reshape\n    const newShape = backend_util.expandShapeToKeepDim(maxOutShape, origAxes);\n    outShape = newShape;\n  }\n\n  return {dataId, shape: outShape, dtype: x.dtype};\n}\n\nexport const maxConfig: KernelConfig = {\n  kernelName: Max,\n  backendName: 'cpu',\n  kernelFunc: max as unknown as KernelFunc\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the License);\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an AS IS BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {backend_util, Erf, KernelConfig} from '@tensorflow/tfjs-core';\n\nimport {unaryKernelFunc} from '../utils/unary_utils';\n\nconst p = backend_util.ERF_P;\nconst a1 = backend_util.ERF_A1;\nconst a2 = backend_util.ERF_A2;\nconst a3 = backend_util.ERF_A3;\nconst a4 = backend_util.ERF_A4;\nconst a5 = backend_util.ERF_A5;\n\nexport const erf = unaryKernelFunc(\n    Erf,\n    (xi) => {\n      const sign = Math.sign(xi);\n      const v = Math.abs(xi);\n      const t = 1.0 / (1.0 + p * v);\n      return sign *\n          (1.0 -\n           (((((a5 * t + a4) * t) + a3) * t + a2) * t + a1) * t *\n               Math.exp(-v * v));\n    },\n);\n\nexport const erfConfig: KernelConfig = {\n  kernelName: Erf,\n  backendName: 'cpu',\n  kernelFunc: erf,\n};\n", "/**\n * @license\n * Copyright 2020 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {KernelConfig, KernelFunc, TensorInfo, Tile, TileAttrs, TileInputs} from '@tensorflow/tfjs-core';\n\nimport {MathBackendCPU} from '../backend_cpu';\nimport {assertNotComplex} from '../cpu_util';\nimport {tileImpl} from './Tile_impl';\n\nexport function tile(\n    args: {inputs: TileInputs, backend: MathBackendCPU, attrs: TileAttrs}):\n    TensorInfo {\n  const {inputs, backend, attrs} = args;\n  const {x} = inputs;\n  const {reps} = attrs;\n\n  assertNotComplex(x, 'tile');\n  const outBuf = tileImpl(backend.bufferSync(x), reps);\n\n  return backend.makeTensorInfo(outBuf.shape, outBuf.dtype, outBuf.values);\n}\n\nexport const tileConfig: KernelConfig = {\n  kernelName: Tile,\n  backendName: 'cpu',\n  kernelFunc: tile as unknown as KernelFunc\n};\n", "/**\n * @license\n * Copyright 2019 Google LLC. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * =============================================================================\n */\n\nimport {Square, SquareInputs} from '@tensorflow/tfjs-core';\nimport {KernelConfig} from '@tensorflow/tfjs-core';\nimport {MathBackendCPU} from '../backend_cpu';\nimport {assertNotComplex} from '../cpu_util';\n\nexport const squareConfig: KernelConfig = {\n  kernelName: Square,\n  backendName: 'cpu',\n  kernelFunc: ({inputs, backend}) => {\n    const {x} = inputs as SquareInputs;\n    const cpuBackend = backend as MathBackendCPU;\n    assertNotComplex(x, 'square');\n\n    const values = cpuBackend.data.get(x.dataId).values as Float32Array;\n    const newValues = new Float32Array(values.length);\n    for (let i = 0; i < values.length; ++i) {\n      const value = values[i];\n      newValues[i] = value * value;\n    }\n    const dataId = cpuBackend.write(newValues, x.shape, x.dtype);\n    return {dataId, shape: x.shape, dtype: x.dtype};\n  }\n};\n", "import { appendFileSync } from \"fs\";\nimport path from \"path\";\nimport { MODERN_WEB_LOG_FILE } from \"../../constants.ts\";\n\nexport function logToolResult(toolName: string, result: { id?: string; distance?: string | number; similarity?: string | number; count?: number }[]) {\n  if (process.env.ENABLE_FILE_LOGGING !== 'true') {\n    return;\n  }\n  try {\n    const logDir = process.env.MODERN_WEB_LOG_DIR || process.cwd();\n    const logPath = path.join(logDir, MODERN_WEB_LOG_FILE);\n    const logEntry = {\n      timestamp: new Date().toISOString(),\n      tool: toolName,\n      result\n    };\n    appendFileSync(logPath, JSON.stringify(logEntry) + \"\\n\", \"utf8\");\n  } catch (err) {\n    console.error(\"Failed to log tool result:\", err);\n  }\n}\n", "export const MODERN_WEB_LOG_FILE = 'modern-web.log';\n"],
  "mappings": ";;;62BAAA,IAAAA,GAAAC,GAAA,CAAAC,GAAAC,KAAA,cAEA,IAAIC,GAAY,GAAQ,YAAY,EAGpCD,GAAO,QAAQ,QAAUE,GAUzB,SAASA,GAAQC,EAAKC,EAAIC,EAAM,CAC5BA,EAAOC,GAAcD,GAAQ,OAAO,EACpCD,EAAKE,GAAcF,GAAM,OAAO,EAChCD,EAAMA,GAAO,GAEb,IAAII,EAMJ,GAJIF,IAAS,SAAW,OAAOF,GAAQ,WACnCA,EAAM,OAAO,KAAKA,EAAK,QAAQ,GAG/BE,IAASD,EACL,OAAOD,GAAQ,SACfI,EAAS,OAAO,KAAKJ,CAAG,EAExBI,EAASJ,MAGb,IAAI,CACAI,EAASC,GAAiBL,EAAKC,EAAIC,CAAI,CAC3C,OAASI,EAAG,CACR,QAAQ,MAAMA,CAAC,EACfF,EAASJ,CACb,CAGJ,OAAI,OAAOI,GAAW,WAClBA,EAAS,OAAO,KAAKA,EAAQ,OAAO,GAGjCA,CACX,CAUA,SAASC,GAAiBL,EAAKC,EAAIC,EAAM,CACrC,OAAID,IAAO,QACAH,GAAU,OAAOE,EAAKE,CAAI,EAC1BA,IAAS,QACTJ,GAAU,OAAOE,EAAKC,CAAE,EAExBH,GAAU,OAAOA,GAAU,OAAOE,EAAKE,CAAI,EAAGD,CAAE,CAE/D,CAQA,SAASE,GAAcI,EAAM,CACzB,OAAQA,GAAQ,IACX,SAAS,EACT,KAAK,EACL,QAAQ,sBAAuB,aAAa,EAC5C,QAAQ,6BAA8B,YAAY,EAClD,QAAQ,oBAAqB,QAAQ,EACrC,QAAQ,qBAAsB,OAAO,EACrC,QAAQ,mBAAoB,OAAO,EACnC,YAAY,CACrB,IClFA,IAAAC,GAAAC,GAAA,CAAAC,GAAAC,KAAA,cAEA,OAAO,eAAeD,GAAS,aAAc,CAAE,MAAO,EAAK,CAAC,EAE5D,SAASE,GAAiBC,EAAI,CAAE,OAAQA,GAAO,OAAOA,GAAO,UAAa,YAAaA,EAAMA,EAAG,QAAaA,CAAI,CAEjH,IAAIC,GAASF,GAAgB,GAAQ,QAAQ,CAAC,EAC1CG,GAAOH,GAAgB,GAAQ,MAAM,CAAC,EACtCI,GAAMJ,GAAgB,GAAQ,KAAK,CAAC,EACpCK,GAAYL,GAAgB,GAAQ,YAAY,CAAC,EACjDM,GAAQN,GAAgB,GAAQ,OAAO,CAAC,EACxCO,GAAOP,GAAgB,GAAQ,MAAM,CAAC,EAKpCQ,GAAWN,GAAO,SAElBO,GAAS,OAAO,QAAQ,EACxBC,GAAO,OAAO,MAAM,EAEpBC,GAAN,MAAMC,CAAK,CACV,aAAc,CACb,KAAKF,EAAI,EAAI,GAEb,IAAMG,EAAY,UAAU,CAAC,EACvBC,EAAU,UAAU,CAAC,EAErBC,EAAU,CAAC,EACbC,EAAO,EAEX,GAAIH,EAAW,CACd,IAAMI,EAAIJ,EACJK,EAAS,OAAOD,EAAE,MAAM,EAC9B,QAASE,EAAI,EAAGA,EAAID,EAAQC,IAAK,CAChC,IAAMC,EAAUH,EAAEE,CAAC,EACfE,EACAD,aAAmB,OACtBC,EAASD,EACC,YAAY,OAAOA,CAAO,EACpCC,EAAS,OAAO,KAAKD,EAAQ,OAAQA,EAAQ,WAAYA,EAAQ,UAAU,EACjEA,aAAmB,YAC7BC,EAAS,OAAO,KAAKD,CAAO,EAClBA,aAAmBR,EAC7BS,EAASD,EAAQX,EAAM,EAEvBY,EAAS,OAAO,KAAK,OAAOD,GAAY,SAAWA,EAAU,OAAOA,CAAO,CAAC,EAE7EJ,GAAQK,EAAO,OACfN,EAAQ,KAAKM,CAAM,CACpB,CACD,CAEA,KAAKZ,EAAM,EAAI,OAAO,OAAOM,CAAO,EAEpC,IAAIO,EAAOR,GAAWA,EAAQ,OAAS,QAAa,OAAOA,EAAQ,IAAI,EAAE,YAAY,EACjFQ,GAAQ,CAAC,mBAAmB,KAAKA,CAAI,IACxC,KAAKZ,EAAI,EAAIY,EAEf,CACA,IAAI,MAAO,CACV,OAAO,KAAKb,EAAM,EAAE,MACrB,CACA,IAAI,MAAO,CACV,OAAO,KAAKC,EAAI,CACjB,CACA,MAAO,CACN,OAAO,QAAQ,QAAQ,KAAKD,EAAM,EAAE,SAAS,CAAC,CAC/C,CACA,aAAc,CACb,IAAMc,EAAM,KAAKd,EAAM,EACjBe,EAAKD,EAAI,OAAO,MAAMA,EAAI,WAAYA,EAAI,WAAaA,EAAI,UAAU,EAC3E,OAAO,QAAQ,QAAQC,CAAE,CAC1B,CACA,QAAS,CACR,IAAMC,EAAW,IAAIjB,GACrB,OAAAiB,EAAS,MAAQ,UAAY,CAAC,EAC9BA,EAAS,KAAK,KAAKhB,EAAM,CAAC,EAC1BgB,EAAS,KAAK,IAAI,EACXA,CACR,CACA,UAAW,CACV,MAAO,eACR,CACA,OAAQ,CACP,IAAMT,EAAO,KAAK,KAEZU,EAAQ,UAAU,CAAC,EACnBC,EAAM,UAAU,CAAC,EACnBC,EAAeC,EACfH,IAAU,OACbE,EAAgB,EACNF,EAAQ,EAClBE,EAAgB,KAAK,IAAIZ,EAAOU,EAAO,CAAC,EAExCE,EAAgB,KAAK,IAAIF,EAAOV,CAAI,EAEjCW,IAAQ,OACXE,EAAcb,EACJW,EAAM,EAChBE,EAAc,KAAK,IAAIb,EAAOW,EAAK,CAAC,EAEpCE,EAAc,KAAK,IAAIF,EAAKX,CAAI,EAEjC,IAAMc,EAAO,KAAK,IAAID,EAAcD,EAAe,CAAC,EAG9CG,EADS,KAAKtB,EAAM,EACE,MAAMmB,EAAeA,EAAgBE,CAAI,EAC/DE,EAAO,IAAIpB,EAAK,CAAC,EAAG,CAAE,KAAM,UAAU,CAAC,CAAE,CAAC,EAChD,OAAAoB,EAAKvB,EAAM,EAAIsB,EACRC,CACR,CACD,EAEA,OAAO,iBAAiBrB,GAAK,UAAW,CACvC,KAAM,CAAE,WAAY,EAAK,EACzB,KAAM,CAAE,WAAY,EAAK,EACzB,MAAO,CAAE,WAAY,EAAK,CAC3B,CAAC,EAED,OAAO,eAAeA,GAAK,UAAW,OAAO,YAAa,CACzD,MAAO,OACP,SAAU,GACV,WAAY,GACZ,aAAc,EACf,CAAC,EAgBD,SAASsB,GAAWC,EAASZ,EAAMa,EAAa,CAC9C,MAAM,KAAK,KAAMD,CAAO,EAExB,KAAK,QAAUA,EACf,KAAK,KAAOZ,EAGRa,IACF,KAAK,KAAO,KAAK,MAAQA,EAAY,MAIvC,MAAM,kBAAkB,KAAM,KAAK,WAAW,CAChD,CAEAF,GAAW,UAAY,OAAO,OAAO,MAAM,SAAS,EACpDA,GAAW,UAAU,YAAcA,GACnCA,GAAW,UAAU,KAAO,aAE5B,IAAIG,GACJ,GAAI,CACHA,GAAU,KAAoB,OAC/B,MAAY,CAAC,CAEb,IAAMC,GAAY,OAAO,gBAAgB,EAGnCC,GAAcpC,GAAO,YAW3B,SAASqC,GAAKC,EAAM,CACnB,IAAIC,EAAQ,KAERC,EAAO,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,CAAC,EAC5EC,EAAYD,EAAK,KAErB,IAAI1B,EAAO2B,IAAc,OAAY,EAAIA,EACzC,IAAIC,EAAeF,EAAK,QACxB,IAAIG,EAAUD,IAAiB,OAAY,EAAIA,EAE3CJ,GAAQ,KAEXA,EAAO,KACGM,GAAkBN,CAAI,EAEhCA,EAAO,OAAO,KAAKA,EAAK,SAAS,CAAC,EACxBO,GAAOP,CAAI,GAAc,OAAO,SAASA,CAAI,IAAc,OAAO,UAAU,SAAS,KAAKA,CAAI,IAAM,uBAE9GA,EAAO,OAAO,KAAKA,CAAI,EACb,YAAY,OAAOA,CAAI,EAEjCA,EAAO,OAAO,KAAKA,EAAK,OAAQA,EAAK,WAAYA,EAAK,UAAU,EACtDA,aAAgBtC,KAG1BsC,EAAO,OAAO,KAAK,OAAOA,CAAI,CAAC,IAEhC,KAAKH,EAAS,EAAI,CACjB,KAAAG,EACA,UAAW,GACX,MAAO,IACR,EACA,KAAK,KAAOxB,EACZ,KAAK,QAAU6B,EAEXL,aAAgBtC,IACnBsC,EAAK,GAAG,QAAS,SAAUQ,EAAK,CAC/B,IAAMC,EAAQD,EAAI,OAAS,aAAeA,EAAM,IAAIf,GAAW,+CAA+CQ,EAAM,GAAG,KAAKO,EAAI,OAAO,GAAI,SAAUA,CAAG,EACxJP,EAAMJ,EAAS,EAAE,MAAQY,CAC1B,CAAC,CAEH,CAEAV,GAAK,UAAY,CAChB,IAAI,MAAO,CACV,OAAO,KAAKF,EAAS,EAAE,IACxB,EAEA,IAAI,UAAW,CACd,OAAO,KAAKA,EAAS,EAAE,SACxB,EAOA,aAAc,CACb,OAAOa,GAAY,KAAK,IAAI,EAAE,KAAK,SAAU3B,EAAK,CACjD,OAAOA,EAAI,OAAO,MAAMA,EAAI,WAAYA,EAAI,WAAaA,EAAI,UAAU,CACxE,CAAC,CACF,EAOA,MAAO,CACN,IAAI4B,EAAK,KAAK,SAAW,KAAK,QAAQ,IAAI,cAAc,GAAK,GAC7D,OAAOD,GAAY,KAAK,IAAI,EAAE,KAAK,SAAU3B,EAAK,CACjD,OAAO,OAAO,OAEd,IAAIZ,GAAK,CAAC,EAAG,CACZ,KAAMwC,EAAG,YAAY,CACtB,CAAC,EAAG,CACH,CAAC1C,EAAM,EAAGc,CACX,CAAC,CACF,CAAC,CACF,EAOA,MAAO,CACN,IAAI6B,EAAS,KAEb,OAAOF,GAAY,KAAK,IAAI,EAAE,KAAK,SAAU7B,EAAQ,CACpD,GAAI,CACH,OAAO,KAAK,MAAMA,EAAO,SAAS,CAAC,CACpC,OAAS2B,EAAK,CACb,OAAOT,GAAK,QAAQ,OAAO,IAAIN,GAAW,iCAAiCmB,EAAO,GAAG,YAAYJ,EAAI,OAAO,GAAI,cAAc,CAAC,CAChI,CACD,CAAC,CACF,EAOA,MAAO,CACN,OAAOE,GAAY,KAAK,IAAI,EAAE,KAAK,SAAU7B,EAAQ,CACpD,OAAOA,EAAO,SAAS,CACxB,CAAC,CACF,EAOA,QAAS,CACR,OAAO6B,GAAY,KAAK,IAAI,CAC7B,EAQA,eAAgB,CACf,IAAIG,EAAS,KAEb,OAAOH,GAAY,KAAK,IAAI,EAAE,KAAK,SAAU7B,EAAQ,CACpD,OAAOiC,GAAYjC,EAAQgC,EAAO,OAAO,CAC1C,CAAC,CACF,CACD,EAGA,OAAO,iBAAiBd,GAAK,UAAW,CACvC,KAAM,CAAE,WAAY,EAAK,EACzB,SAAU,CAAE,WAAY,EAAK,EAC7B,YAAa,CAAE,WAAY,EAAK,EAChC,KAAM,CAAE,WAAY,EAAK,EACzB,KAAM,CAAE,WAAY,EAAK,EACzB,KAAM,CAAE,WAAY,EAAK,CAC1B,CAAC,EAEDA,GAAK,MAAQ,SAAUgB,EAAO,CAC7B,QAAWC,KAAQ,OAAO,oBAAoBjB,GAAK,SAAS,EAE3D,GAAI,EAAEiB,KAAQD,GAAQ,CACrB,IAAME,EAAO,OAAO,yBAAyBlB,GAAK,UAAWiB,CAAI,EACjE,OAAO,eAAeD,EAAOC,EAAMC,CAAI,CACxC,CAEF,EASA,SAASP,IAAc,CACtB,IAAIQ,EAAS,KAEb,GAAI,KAAKrB,EAAS,EAAE,UACnB,OAAOE,GAAK,QAAQ,OAAO,IAAI,UAAU,0BAA0B,KAAK,GAAG,EAAE,CAAC,EAK/E,GAFA,KAAKF,EAAS,EAAE,UAAY,GAExB,KAAKA,EAAS,EAAE,MACnB,OAAOE,GAAK,QAAQ,OAAO,KAAKF,EAAS,EAAE,KAAK,EAGjD,IAAIG,EAAO,KAAK,KAGhB,GAAIA,IAAS,KACZ,OAAOD,GAAK,QAAQ,QAAQ,OAAO,MAAM,CAAC,CAAC,EAS5C,GALIQ,GAAOP,CAAI,IACdA,EAAOA,EAAK,OAAO,GAIhB,OAAO,SAASA,CAAI,EACvB,OAAOD,GAAK,QAAQ,QAAQC,CAAI,EAIjC,GAAI,EAAEA,aAAgBtC,IACrB,OAAOqC,GAAK,QAAQ,QAAQ,OAAO,MAAM,CAAC,CAAC,EAK5C,IAAIoB,EAAQ,CAAC,EACTC,EAAa,EACbC,EAAQ,GAEZ,OAAO,IAAItB,GAAK,QAAQ,SAAUuB,EAASC,EAAQ,CAClD,IAAIC,EAGAN,EAAO,UACVM,EAAa,WAAW,UAAY,CACnCH,EAAQ,GACRE,EAAO,IAAI9B,GAAW,0CAA0CyB,EAAO,GAAG,UAAUA,EAAO,OAAO,MAAO,cAAc,CAAC,CACzH,EAAGA,EAAO,OAAO,GAIlBlB,EAAK,GAAG,QAAS,SAAUQ,EAAK,CAC3BA,EAAI,OAAS,cAEhBa,EAAQ,GACRE,EAAOf,CAAG,GAGVe,EAAO,IAAI9B,GAAW,+CAA+CyB,EAAO,GAAG,KAAKV,EAAI,OAAO,GAAI,SAAUA,CAAG,CAAC,CAEnH,CAAC,EAEDR,EAAK,GAAG,OAAQ,SAAUyB,EAAO,CAChC,GAAI,EAAAJ,GAASI,IAAU,MAIvB,IAAIP,EAAO,MAAQE,EAAaK,EAAM,OAASP,EAAO,KAAM,CAC3DG,EAAQ,GACRE,EAAO,IAAI9B,GAAW,mBAAmByB,EAAO,GAAG,gBAAgBA,EAAO,IAAI,GAAI,UAAU,CAAC,EAC7F,MACD,CAEAE,GAAcK,EAAM,OACpBN,EAAM,KAAKM,CAAK,EACjB,CAAC,EAEDzB,EAAK,GAAG,MAAO,UAAY,CAC1B,GAAI,CAAAqB,EAIJ,cAAaG,CAAU,EAEvB,GAAI,CACHF,EAAQ,OAAO,OAAOH,EAAOC,CAAU,CAAC,CACzC,OAASZ,EAAK,CAEbe,EAAO,IAAI9B,GAAW,kDAAkDyB,EAAO,GAAG,KAAKV,EAAI,OAAO,GAAI,SAAUA,CAAG,CAAC,CACrH,EACD,CAAC,CACF,CAAC,CACF,CAUA,SAASM,GAAYjC,EAAQ6C,EAAS,CACrC,GAAI,OAAO9B,IAAY,WACtB,MAAM,IAAI,MAAM,8EAA8E,EAG/F,IAAMe,EAAKe,EAAQ,IAAI,cAAc,EACjCC,EAAU,QACVC,EAAKC,EAGT,OAAIlB,IACHiB,EAAM,mBAAmB,KAAKjB,CAAE,GAIjCkB,EAAMhD,EAAO,MAAM,EAAG,IAAI,EAAE,SAAS,EAGjC,CAAC+C,GAAOC,IACXD,EAAM,iCAAiC,KAAKC,CAAG,GAI5C,CAACD,GAAOC,IACXD,EAAM,yEAAyE,KAAKC,CAAG,EAClFD,IACJA,EAAM,yEAAyE,KAAKC,CAAG,EACnFD,GACHA,EAAI,IAAI,GAINA,IACHA,EAAM,gBAAgB,KAAKA,EAAI,IAAI,CAAC,IAKlC,CAACA,GAAOC,IACXD,EAAM,mCAAmC,KAAKC,CAAG,GAI9CD,IACHD,EAAUC,EAAI,IAAI,GAIdD,IAAY,UAAYA,IAAY,SACvCA,EAAU,YAKL/B,GAAQf,EAAQ,QAAS8C,CAAO,EAAE,SAAS,CACnD,CASA,SAASrB,GAAkBwB,EAAK,CAE/B,OAAI,OAAOA,GAAQ,UAAY,OAAOA,EAAI,QAAW,YAAc,OAAOA,EAAI,QAAW,YAAc,OAAOA,EAAI,KAAQ,YAAc,OAAOA,EAAI,QAAW,YAAc,OAAOA,EAAI,KAAQ,YAAc,OAAOA,EAAI,KAAQ,WACxN,GAIDA,EAAI,YAAY,OAAS,mBAAqB,OAAO,UAAU,SAAS,KAAKA,CAAG,IAAM,4BAA8B,OAAOA,EAAI,MAAS,UAChJ,CAOA,SAASvB,GAAOuB,EAAK,CACpB,OAAO,OAAOA,GAAQ,UAAY,OAAOA,EAAI,aAAgB,YAAc,OAAOA,EAAI,MAAS,UAAY,OAAOA,EAAI,QAAW,YAAc,OAAOA,EAAI,aAAgB,YAAc,OAAOA,EAAI,YAAY,MAAS,UAAY,gBAAgB,KAAKA,EAAI,YAAY,IAAI,GAAK,gBAAgB,KAAKA,EAAI,OAAO,WAAW,CAAC,CAC/T,CAQA,SAASC,GAAMC,EAAU,CACxB,IAAIC,EAAIC,EACJlC,EAAOgC,EAAS,KAGpB,GAAIA,EAAS,SACZ,MAAM,IAAI,MAAM,oCAAoC,EAKrD,OAAIhC,aAAgBtC,IAAU,OAAOsC,EAAK,aAAgB,aAEzDiC,EAAK,IAAInC,GACToC,EAAK,IAAIpC,GACTE,EAAK,KAAKiC,CAAE,EACZjC,EAAK,KAAKkC,CAAE,EAEZF,EAASnC,EAAS,EAAE,KAAOoC,EAC3BjC,EAAOkC,GAGDlC,CACR,CAWA,SAASmC,GAAmBnC,EAAM,CACjC,OAAIA,IAAS,KAEL,KACG,OAAOA,GAAS,SAEnB,2BACGM,GAAkBN,CAAI,EAEzB,kDACGO,GAAOP,CAAI,EAEdA,EAAK,MAAQ,KACV,OAAO,SAASA,CAAI,GAGpB,OAAO,UAAU,SAAS,KAAKA,CAAI,IAAM,wBAGzC,YAAY,OAAOA,CAAI,EAJ1B,KAOG,OAAOA,EAAK,aAAgB,WAE/B,gCAAgCA,EAAK,YAAY,CAAC,GAC/CA,aAAgBtC,GAGnB,KAGA,0BAET,CAWA,SAAS0E,GAAcJ,EAAU,CAChC,IAAMhC,EAAOgC,EAAS,KAGtB,OAAIhC,IAAS,KAEL,EACGO,GAAOP,CAAI,EACdA,EAAK,KACF,OAAO,SAASA,CAAI,EAEvBA,EAAK,OACFA,GAAQ,OAAOA,EAAK,eAAkB,aAE5CA,EAAK,mBAAqBA,EAAK,kBAAkB,QAAU,GAC/DA,EAAK,gBAAkBA,EAAK,eAAe,GAEnCA,EAAK,cAAc,EAKpB,IAET,CAQA,SAASqC,GAAcC,EAAMN,EAAU,CACtC,IAAMhC,EAAOgC,EAAS,KAGlBhC,IAAS,KAEZsC,EAAK,IAAI,EACC/B,GAAOP,CAAI,EACrBA,EAAK,OAAO,EAAE,KAAKsC,CAAI,EACb,OAAO,SAAStC,CAAI,GAE9BsC,EAAK,MAAMtC,CAAI,EACfsC,EAAK,IAAI,GAGTtC,EAAK,KAAKsC,CAAI,CAEhB,CAGAvC,GAAK,QAAU,OAAO,QAQtB,IAAMwC,GAAoB,gCACpBC,GAAyB,0BAE/B,SAASC,GAAazB,EAAM,CAE3B,GADAA,EAAO,GAAGA,CAAI,GACVuB,GAAkB,KAAKvB,CAAI,GAAKA,IAAS,GAC5C,MAAM,IAAI,UAAU,GAAGA,CAAI,kCAAkC,CAE/D,CAEA,SAAS0B,GAAcC,EAAO,CAE7B,GADAA,EAAQ,GAAGA,CAAK,GACZH,GAAuB,KAAKG,CAAK,EACpC,MAAM,IAAI,UAAU,GAAGA,CAAK,mCAAmC,CAEjE,CAUA,SAASC,GAAKC,EAAK7B,EAAM,CACxBA,EAAOA,EAAK,YAAY,EACxB,QAAW8B,KAAOD,EACjB,GAAIC,EAAI,YAAY,IAAM9B,EACzB,OAAO8B,CAIV,CAEA,IAAMC,GAAM,OAAO,KAAK,EAClBC,GAAN,MAAMC,CAAQ,CAOb,aAAc,CACb,IAAIC,EAAO,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,OAI/E,GAFA,KAAKH,EAAG,EAAI,OAAO,OAAO,IAAI,EAE1BG,aAAgBD,EAAS,CAC5B,IAAME,EAAaD,EAAK,IAAI,EACtBE,EAAc,OAAO,KAAKD,CAAU,EAE1C,QAAWE,KAAcD,EACxB,QAAWT,KAASQ,EAAWE,CAAU,EACxC,KAAK,OAAOA,EAAYV,CAAK,EAI/B,MACD,CAIA,GAAIO,GAAQ,KAAa,GAAI,OAAOA,GAAS,SAAU,CACtD,IAAMI,EAASJ,EAAK,OAAO,QAAQ,EACnC,GAAII,GAAU,KAAM,CACnB,GAAI,OAAOA,GAAW,WACrB,MAAM,IAAI,UAAU,+BAA+B,EAKpD,IAAMC,EAAQ,CAAC,EACf,QAAWC,KAAQN,EAAM,CACxB,GAAI,OAAOM,GAAS,UAAY,OAAOA,EAAK,OAAO,QAAQ,GAAM,WAChE,MAAM,IAAI,UAAU,mCAAmC,EAExDD,EAAM,KAAK,MAAM,KAAKC,CAAI,CAAC,CAC5B,CAEA,QAAWA,KAAQD,EAAO,CACzB,GAAIC,EAAK,SAAW,EACnB,MAAM,IAAI,UAAU,6CAA6C,EAElE,KAAK,OAAOA,EAAK,CAAC,EAAGA,EAAK,CAAC,CAAC,CAC7B,CACD,KAEC,SAAWV,KAAO,OAAO,KAAKI,CAAI,EAAG,CACpC,IAAMP,EAAQO,EAAKJ,CAAG,EACtB,KAAK,OAAOA,EAAKH,CAAK,CACvB,CAEF,KACC,OAAM,IAAI,UAAU,wCAAwC,CAE9D,CAQA,IAAI3B,EAAM,CACTA,EAAO,GAAGA,CAAI,GACdyB,GAAazB,CAAI,EACjB,IAAM8B,EAAMF,GAAK,KAAKG,EAAG,EAAG/B,CAAI,EAChC,OAAI8B,IAAQ,OACJ,KAGD,KAAKC,EAAG,EAAED,CAAG,EAAE,KAAK,IAAI,CAChC,CASA,QAAQW,EAAU,CACjB,IAAIC,EAAU,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,OAE9EH,EAAQI,GAAW,IAAI,EACvBhF,EAAI,EACR,KAAOA,EAAI4E,EAAM,QAAQ,CACxB,IAAIK,EAAWL,EAAM5E,CAAC,EACtB,IAAMqC,EAAO4C,EAAS,CAAC,EACjBjB,EAAQiB,EAAS,CAAC,EAExBH,EAAS,KAAKC,EAASf,EAAO3B,EAAM,IAAI,EACxCuC,EAAQI,GAAW,IAAI,EACvBhF,GACD,CACD,CASA,IAAIqC,EAAM2B,EAAO,CAChB3B,EAAO,GAAGA,CAAI,GACd2B,EAAQ,GAAGA,CAAK,GAChBF,GAAazB,CAAI,EACjB0B,GAAcC,CAAK,EACnB,IAAMG,EAAMF,GAAK,KAAKG,EAAG,EAAG/B,CAAI,EAChC,KAAK+B,EAAG,EAAED,IAAQ,OAAYA,EAAM9B,CAAI,EAAI,CAAC2B,CAAK,CACnD,CASA,OAAO3B,EAAM2B,EAAO,CACnB3B,EAAO,GAAGA,CAAI,GACd2B,EAAQ,GAAGA,CAAK,GAChBF,GAAazB,CAAI,EACjB0B,GAAcC,CAAK,EACnB,IAAMG,EAAMF,GAAK,KAAKG,EAAG,EAAG/B,CAAI,EAC5B8B,IAAQ,OACX,KAAKC,EAAG,EAAED,CAAG,EAAE,KAAKH,CAAK,EAEzB,KAAKI,EAAG,EAAE/B,CAAI,EAAI,CAAC2B,CAAK,CAE1B,CAQA,IAAI3B,EAAM,CACT,OAAAA,EAAO,GAAGA,CAAI,GACdyB,GAAazB,CAAI,EACV4B,GAAK,KAAKG,EAAG,EAAG/B,CAAI,IAAM,MAClC,CAQA,OAAOA,EAAM,CACZA,EAAO,GAAGA,CAAI,GACdyB,GAAazB,CAAI,EACjB,IAAM8B,EAAMF,GAAK,KAAKG,EAAG,EAAG/B,CAAI,EAC5B8B,IAAQ,QACX,OAAO,KAAKC,EAAG,EAAED,CAAG,CAEtB,CAOA,KAAM,CACL,OAAO,KAAKC,EAAG,CAChB,CAOA,MAAO,CACN,OAAOc,GAAsB,KAAM,KAAK,CACzC,CAOA,QAAS,CACR,OAAOA,GAAsB,KAAM,OAAO,CAC3C,CASA,CAAC,OAAO,QAAQ,GAAI,CACnB,OAAOA,GAAsB,KAAM,WAAW,CAC/C,CACD,EACAb,GAAQ,UAAU,QAAUA,GAAQ,UAAU,OAAO,QAAQ,EAE7D,OAAO,eAAeA,GAAQ,UAAW,OAAO,YAAa,CAC5D,MAAO,UACP,SAAU,GACV,WAAY,GACZ,aAAc,EACf,CAAC,EAED,OAAO,iBAAiBA,GAAQ,UAAW,CAC1C,IAAK,CAAE,WAAY,EAAK,EACxB,QAAS,CAAE,WAAY,EAAK,EAC5B,IAAK,CAAE,WAAY,EAAK,EACxB,OAAQ,CAAE,WAAY,EAAK,EAC3B,IAAK,CAAE,WAAY,EAAK,EACxB,OAAQ,CAAE,WAAY,EAAK,EAC3B,KAAM,CAAE,WAAY,EAAK,EACzB,OAAQ,CAAE,WAAY,EAAK,EAC3B,QAAS,CAAE,WAAY,EAAK,CAC7B,CAAC,EAED,SAASW,GAAWjC,EAAS,CAC5B,IAAIoC,EAAO,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,YAG/E,OADa,OAAO,KAAKpC,EAAQqB,EAAG,CAAC,EAAE,KAAK,EAChC,IAAIe,IAAS,MAAQ,SAAUC,EAAG,CAC7C,OAAOA,EAAE,YAAY,CACtB,EAAID,IAAS,QAAU,SAAUC,EAAG,CACnC,OAAOrC,EAAQqB,EAAG,EAAEgB,CAAC,EAAE,KAAK,IAAI,CACjC,EAAI,SAAUA,EAAG,CAChB,MAAO,CAACA,EAAE,YAAY,EAAGrC,EAAQqB,EAAG,EAAEgB,CAAC,EAAE,KAAK,IAAI,CAAC,CACpD,CAAC,CACF,CAEA,IAAMC,GAAW,OAAO,UAAU,EAElC,SAASH,GAAsBI,EAAQH,EAAM,CAC5C,IAAMI,EAAW,OAAO,OAAOC,EAAwB,EACvD,OAAAD,EAASF,EAAQ,EAAI,CACpB,OAAAC,EACA,KAAAH,EACA,MAAO,CACR,EACOI,CACR,CAEA,IAAMC,GAA2B,OAAO,eAAe,CACtD,MAAO,CAEN,GAAI,CAAC,MAAQ,OAAO,eAAe,IAAI,IAAMA,GAC5C,MAAM,IAAI,UAAU,0CAA0C,EAG/D,IAAIC,EAAY,KAAKJ,EAAQ,EAC7B,IAAMC,EAASG,EAAU,OACnBN,EAAOM,EAAU,KACjBC,EAAQD,EAAU,MAElBE,EAASX,GAAWM,EAAQH,CAAI,EAChCS,EAAMD,EAAO,OACnB,OAAID,GAASE,EACL,CACN,MAAO,OACP,KAAM,EACP,GAGD,KAAKP,EAAQ,EAAE,MAAQK,EAAQ,EAExB,CACN,MAAOC,EAAOD,CAAK,EACnB,KAAM,EACP,EACD,CACD,EAAG,OAAO,eAAe,OAAO,eAAe,CAAC,EAAE,OAAO,QAAQ,EAAE,CAAC,CAAC,CAAC,EAEtE,OAAO,eAAeF,GAA0B,OAAO,YAAa,CACnE,MAAO,kBACP,SAAU,GACV,WAAY,GACZ,aAAc,EACf,CAAC,EAQD,SAASK,GAA4B9C,EAAS,CAC7C,IAAMI,EAAM,OAAO,OAAO,CAAE,UAAW,IAAK,EAAGJ,EAAQqB,EAAG,CAAC,EAIrD0B,EAAgB7B,GAAKlB,EAAQqB,EAAG,EAAG,MAAM,EAC/C,OAAI0B,IAAkB,SACrB3C,EAAI2C,CAAa,EAAI3C,EAAI2C,CAAa,EAAE,CAAC,GAGnC3C,CACR,CASA,SAAS4C,GAAqB5C,EAAK,CAClC,IAAMJ,EAAU,IAAIsB,GACpB,QAAWhC,KAAQ,OAAO,KAAKc,CAAG,EACjC,GAAI,CAAAS,GAAkB,KAAKvB,CAAI,EAG/B,GAAI,MAAM,QAAQc,EAAId,CAAI,CAAC,EAC1B,QAAW2D,KAAO7C,EAAId,CAAI,EACrBwB,GAAuB,KAAKmC,CAAG,IAG/BjD,EAAQqB,EAAG,EAAE/B,CAAI,IAAM,OAC1BU,EAAQqB,EAAG,EAAE/B,CAAI,EAAI,CAAC2D,CAAG,EAEzBjD,EAAQqB,EAAG,EAAE/B,CAAI,EAAE,KAAK2D,CAAG,QAGlBnC,GAAuB,KAAKV,EAAId,CAAI,CAAC,IAChDU,EAAQqB,EAAG,EAAE/B,CAAI,EAAI,CAACc,EAAId,CAAI,CAAC,GAGjC,OAAOU,CACR,CAEA,IAAMkD,GAAc,OAAO,oBAAoB,EAGzCC,GAAelH,GAAK,aASpBmH,GAAN,MAAMC,CAAS,CACd,aAAc,CACb,IAAI/E,EAAO,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,KAC3EgF,EAAO,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,CAAC,EAEhFjF,GAAK,KAAK,KAAMC,EAAMgF,CAAI,EAE1B,IAAMC,EAASD,EAAK,QAAU,IACxBtD,EAAU,IAAIsB,GAAQgC,EAAK,OAAO,EAExC,GAAIhF,GAAQ,MAAQ,CAAC0B,EAAQ,IAAI,cAAc,EAAG,CACjD,IAAMwD,EAAc/C,GAAmBnC,CAAI,EACvCkF,GACHxD,EAAQ,OAAO,eAAgBwD,CAAW,CAE5C,CAEA,KAAKN,EAAW,EAAI,CACnB,IAAKI,EAAK,IACV,OAAAC,EACA,WAAYD,EAAK,YAAcH,GAAaI,CAAM,EAClD,QAAAvD,EACA,QAASsD,EAAK,OACf,CACD,CAEA,IAAI,KAAM,CACT,OAAO,KAAKJ,EAAW,EAAE,KAAO,EACjC,CAEA,IAAI,QAAS,CACZ,OAAO,KAAKA,EAAW,EAAE,MAC1B,CAKA,IAAI,IAAK,CACR,OAAO,KAAKA,EAAW,EAAE,QAAU,KAAO,KAAKA,EAAW,EAAE,OAAS,GACtE,CAEA,IAAI,YAAa,CAChB,OAAO,KAAKA,EAAW,EAAE,QAAU,CACpC,CAEA,IAAI,YAAa,CAChB,OAAO,KAAKA,EAAW,EAAE,UAC1B,CAEA,IAAI,SAAU,CACb,OAAO,KAAKA,EAAW,EAAE,OAC1B,CAOA,OAAQ,CACP,OAAO,IAAIG,EAAShD,GAAM,IAAI,EAAG,CAChC,IAAK,KAAK,IACV,OAAQ,KAAK,OACb,WAAY,KAAK,WACjB,QAAS,KAAK,QACd,GAAI,KAAK,GACT,WAAY,KAAK,UAClB,CAAC,CACF,CACD,EAEAhC,GAAK,MAAM+E,GAAS,SAAS,EAE7B,OAAO,iBAAiBA,GAAS,UAAW,CAC3C,IAAK,CAAE,WAAY,EAAK,EACxB,OAAQ,CAAE,WAAY,EAAK,EAC3B,GAAI,CAAE,WAAY,EAAK,EACvB,WAAY,CAAE,WAAY,EAAK,EAC/B,WAAY,CAAE,WAAY,EAAK,EAC/B,QAAS,CAAE,WAAY,EAAK,EAC5B,MAAO,CAAE,WAAY,EAAK,CAC3B,CAAC,EAED,OAAO,eAAeA,GAAS,UAAW,OAAO,YAAa,CAC7D,MAAO,WACP,SAAU,GACV,WAAY,GACZ,aAAc,EACf,CAAC,EAED,IAAMK,GAAc,OAAO,mBAAmB,EACxCC,GAAMxH,GAAI,KAAOC,GAAU,IAG3BwH,GAAYzH,GAAI,MAChB0H,GAAa1H,GAAI,OAQvB,SAAS2H,GAASC,EAAQ,CAMzB,MAAI,4BAA4B,KAAKA,CAAM,IAC1CA,EAAS,IAAIJ,GAAII,CAAM,EAAE,SAAS,GAI5BH,GAAUG,CAAM,CACxB,CAEA,IAAMC,GAA6B,YAAa/H,GAAO,SAAS,UAQhE,SAASgI,GAAUC,EAAO,CACzB,OAAO,OAAOA,GAAU,UAAY,OAAOA,EAAMR,EAAW,GAAM,QACnE,CAEA,SAASS,GAAcC,EAAQ,CAC9B,IAAM9E,EAAQ8E,GAAU,OAAOA,GAAW,UAAY,OAAO,eAAeA,CAAM,EAClF,MAAO,CAAC,EAAE9E,GAASA,EAAM,YAAY,OAAS,cAC/C,CASA,IAAM+E,GAAN,MAAMC,CAAQ,CACb,YAAYJ,EAAO,CAClB,IAAIzC,EAAO,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,CAAC,EAE5E8C,EAGCN,GAAUC,CAAK,EAYnBK,EAAYT,GAASI,EAAM,GAAG,GAX1BA,GAASA,EAAM,KAIlBK,EAAYT,GAASI,EAAM,IAAI,EAG/BK,EAAYT,GAAS,GAAGI,CAAK,EAAE,EAEhCA,EAAQ,CAAC,GAKV,IAAIrC,EAASJ,EAAK,QAAUyC,EAAM,QAAU,MAG5C,GAFArC,EAASA,EAAO,YAAY,GAEvBJ,EAAK,MAAQ,MAAQwC,GAAUC,CAAK,GAAKA,EAAM,OAAS,QAAUrC,IAAW,OAASA,IAAW,QACrG,MAAM,IAAI,UAAU,+CAA+C,EAGpE,IAAI2C,EAAY/C,EAAK,MAAQ,KAAOA,EAAK,KAAOwC,GAAUC,CAAK,GAAKA,EAAM,OAAS,KAAO5D,GAAM4D,CAAK,EAAI,KAEzG5F,GAAK,KAAK,KAAMkG,EAAW,CAC1B,QAAS/C,EAAK,SAAWyC,EAAM,SAAW,EAC1C,KAAMzC,EAAK,MAAQyC,EAAM,MAAQ,CAClC,CAAC,EAED,IAAMjE,EAAU,IAAIsB,GAAQE,EAAK,SAAWyC,EAAM,SAAW,CAAC,CAAC,EAE/D,GAAIM,GAAa,MAAQ,CAACvE,EAAQ,IAAI,cAAc,EAAG,CACtD,IAAMwD,EAAc/C,GAAmB8D,CAAS,EAC5Cf,GACHxD,EAAQ,OAAO,eAAgBwD,CAAW,CAE5C,CAEA,IAAIW,EAASH,GAAUC,CAAK,EAAIA,EAAM,OAAS,KAG/C,GAFI,WAAYzC,IAAM2C,EAAS3C,EAAK,QAEhC2C,GAAU,MAAQ,CAACD,GAAcC,CAAM,EAC1C,MAAM,IAAI,UAAU,iDAAiD,EAGtE,KAAKV,EAAW,EAAI,CACnB,OAAA7B,EACA,SAAUJ,EAAK,UAAYyC,EAAM,UAAY,SAC7C,QAAAjE,EACA,UAAAsE,EACA,OAAAH,CACD,EAGA,KAAK,OAAS3C,EAAK,SAAW,OAAYA,EAAK,OAASyC,EAAM,SAAW,OAAYA,EAAM,OAAS,GACpG,KAAK,SAAWzC,EAAK,WAAa,OAAYA,EAAK,SAAWyC,EAAM,WAAa,OAAYA,EAAM,SAAW,GAC9G,KAAK,QAAUzC,EAAK,SAAWyC,EAAM,SAAW,EAChD,KAAK,MAAQzC,EAAK,OAASyC,EAAM,KAClC,CAEA,IAAI,QAAS,CACZ,OAAO,KAAKR,EAAW,EAAE,MAC1B,CAEA,IAAI,KAAM,CACT,OAAOG,GAAW,KAAKH,EAAW,EAAE,SAAS,CAC9C,CAEA,IAAI,SAAU,CACb,OAAO,KAAKA,EAAW,EAAE,OAC1B,CAEA,IAAI,UAAW,CACd,OAAO,KAAKA,EAAW,EAAE,QAC1B,CAEA,IAAI,QAAS,CACZ,OAAO,KAAKA,EAAW,EAAE,MAC1B,CAOA,OAAQ,CACP,OAAO,IAAIY,EAAQ,IAAI,CACxB,CACD,EAEAhG,GAAK,MAAM+F,GAAQ,SAAS,EAE5B,OAAO,eAAeA,GAAQ,UAAW,OAAO,YAAa,CAC5D,MAAO,UACP,SAAU,GACV,WAAY,GACZ,aAAc,EACf,CAAC,EAED,OAAO,iBAAiBA,GAAQ,UAAW,CAC1C,OAAQ,CAAE,WAAY,EAAK,EAC3B,IAAK,CAAE,WAAY,EAAK,EACxB,QAAS,CAAE,WAAY,EAAK,EAC5B,SAAU,CAAE,WAAY,EAAK,EAC7B,MAAO,CAAE,WAAY,EAAK,EAC1B,OAAQ,CAAE,WAAY,EAAK,CAC5B,CAAC,EAQD,SAASI,GAAsBC,EAAS,CACvC,IAAMH,EAAYG,EAAQhB,EAAW,EAAE,UACjCzD,EAAU,IAAIsB,GAAQmD,EAAQhB,EAAW,EAAE,OAAO,EAQxD,GALKzD,EAAQ,IAAI,QAAQ,GACxBA,EAAQ,IAAI,SAAU,KAAK,EAIxB,CAACsE,EAAU,UAAY,CAACA,EAAU,SACrC,MAAM,IAAI,UAAU,kCAAkC,EAGvD,GAAI,CAAC,YAAY,KAAKA,EAAU,QAAQ,EACvC,MAAM,IAAI,UAAU,sCAAsC,EAG3D,GAAIG,EAAQ,QAAUA,EAAQ,gBAAgBzI,GAAO,UAAY,CAAC+H,GACjE,MAAM,IAAI,MAAM,iFAAiF,EAIlG,IAAIW,EAAqB,KAIzB,GAHID,EAAQ,MAAQ,MAAQ,gBAAgB,KAAKA,EAAQ,MAAM,IAC9DC,EAAqB,KAElBD,EAAQ,MAAQ,KAAM,CACzB,IAAME,EAAajE,GAAc+D,CAAO,EACpC,OAAOE,GAAe,WACzBD,EAAqB,OAAOC,CAAU,EAExC,CACID,GACH1E,EAAQ,IAAI,iBAAkB0E,CAAkB,EAI5C1E,EAAQ,IAAI,YAAY,GAC5BA,EAAQ,IAAI,aAAc,wDAAwD,EAI/EyE,EAAQ,UAAY,CAACzE,EAAQ,IAAI,iBAAiB,GACrDA,EAAQ,IAAI,kBAAmB,cAAc,EAG9C,IAAI4E,EAAQH,EAAQ,MACpB,OAAI,OAAOG,GAAU,aACpBA,EAAQA,EAAMN,CAAS,GAMjB,OAAO,OAAO,CAAC,EAAGA,EAAW,CACnC,OAAQG,EAAQ,OAChB,QAAS3B,GAA4B9C,CAAO,EAC5C,MAAA4E,CACD,CAAC,CACF,CAcA,SAASC,GAAW7G,EAAS,CAC3B,MAAM,KAAK,KAAMA,CAAO,EAExB,KAAK,KAAO,UACZ,KAAK,QAAUA,EAGf,MAAM,kBAAkB,KAAM,KAAK,WAAW,CAChD,CAEA6G,GAAW,UAAY,OAAO,OAAO,MAAM,SAAS,EACpDA,GAAW,UAAU,YAAcA,GACnCA,GAAW,UAAU,KAAO,aAE5B,IAAMC,GAAQ5I,GAAI,KAAOC,GAAU,IAG7B4I,GAAgB/I,GAAO,YAEvBgJ,GAAsB,SAA6BC,EAAaC,EAAU,CAC/E,IAAMC,EAAO,IAAIL,GAAMI,CAAQ,EAAE,SAC3BtE,EAAO,IAAIkE,GAAMG,CAAW,EAAE,SAEpC,OAAOE,IAASvE,GAAQuE,EAAKA,EAAK,OAASvE,EAAK,OAAS,CAAC,IAAM,KAAOuE,EAAK,SAASvE,CAAI,CAC1F,EASMwE,GAAiB,SAAwBH,EAAaC,EAAU,CACrE,IAAMC,EAAO,IAAIL,GAAMI,CAAQ,EAAE,SAC3BtE,EAAO,IAAIkE,GAAMG,CAAW,EAAE,SAEpC,OAAOE,IAASvE,CACjB,EASA,SAASyE,GAAMC,EAAKhC,EAAM,CAGzB,GAAI,CAAC+B,GAAM,QACV,MAAM,IAAI,MAAM,wEAAwE,EAGzF,OAAAhH,GAAK,QAAUgH,GAAM,QAGd,IAAIA,GAAM,QAAQ,SAAUzF,EAASC,EAAQ,CAEnD,IAAM4E,EAAU,IAAIL,GAAQkB,EAAKhC,CAAI,EAC/B1G,EAAU4H,GAAsBC,CAAO,EAEvCc,GAAQ3I,EAAQ,WAAa,SAAWR,GAAQH,IAAM,QACtDkI,EAASM,EAAQ,OAEnBe,EAAW,KAET7F,EAAQ,UAAiB,CAC9B,IAAIZ,EAAQ,IAAI8F,GAAW,6BAA6B,EACxDhF,EAAOd,CAAK,EACR0F,EAAQ,MAAQA,EAAQ,gBAAgBzI,GAAO,UAClDyJ,GAAchB,EAAQ,KAAM1F,CAAK,EAE9B,GAACyG,GAAY,CAACA,EAAS,OAC3BA,EAAS,KAAK,KAAK,QAASzG,CAAK,CAClC,EAEA,GAAIoF,GAAUA,EAAO,QAAS,CAC7BxE,EAAM,EACN,MACD,CAEA,IAAM+F,EAAmB,UAA4B,CACpD/F,EAAM,EACNgG,EAAS,CACV,EAGMC,EAAML,EAAK3I,CAAO,EACpBiJ,EAEA1B,GACHA,EAAO,iBAAiB,QAASuB,CAAgB,EAGlD,SAASC,GAAW,CACnBC,EAAI,MAAM,EACNzB,GAAQA,EAAO,oBAAoB,QAASuB,CAAgB,EAChE,aAAaG,CAAU,CACxB,CAEIpB,EAAQ,SACXmB,EAAI,KAAK,SAAU,SAAUE,EAAQ,CACpCD,EAAa,WAAW,UAAY,CACnChG,EAAO,IAAI9B,GAAW,uBAAuB0G,EAAQ,GAAG,GAAI,iBAAiB,CAAC,EAC9EkB,EAAS,CACV,EAAGlB,EAAQ,OAAO,CACnB,CAAC,EAGFmB,EAAI,GAAG,QAAS,SAAU9G,EAAK,CAC9Be,EAAO,IAAI9B,GAAW,cAAc0G,EAAQ,GAAG,oBAAoB3F,EAAI,OAAO,GAAI,SAAUA,CAAG,CAAC,EAE5F0G,GAAYA,EAAS,MACxBC,GAAcD,EAAS,KAAM1G,CAAG,EAGjC6G,EAAS,CACV,CAAC,EAEDI,GAAoCH,EAAK,SAAU9G,EAAK,CACnDqF,GAAUA,EAAO,SAIjBqB,GAAYA,EAAS,MACxBC,GAAcD,EAAS,KAAM1G,CAAG,CAElC,CAAC,EAGG,SAAS,QAAQ,QAAQ,UAAU,CAAC,CAAC,EAAI,IAG5C8G,EAAI,GAAG,SAAU,SAAUI,EAAG,CAC7BA,EAAE,YAAY,QAAS,SAAUC,EAAU,CAE1C,IAAMC,EAAkBF,EAAE,cAAc,MAAM,EAAI,EAGlD,GAAIR,GAAYU,GAAmB,CAACD,GAAY,EAAE9B,GAAUA,EAAO,SAAU,CAC5E,IAAMrF,EAAM,IAAI,MAAM,iBAAiB,EACvCA,EAAI,KAAO,6BACX0G,EAAS,KAAK,KAAK,QAAS1G,CAAG,CAChC,CACD,CAAC,CACF,CAAC,EAGF8G,EAAI,GAAG,WAAY,SAAU1F,EAAK,CACjC,aAAa2F,CAAU,EAEvB,IAAM7F,EAAUgD,GAAqB9C,EAAI,OAAO,EAGhD,GAAImF,GAAM,WAAWnF,EAAI,UAAU,EAAG,CAErC,IAAMiG,EAAWnG,EAAQ,IAAI,UAAU,EAGnCoG,EAAc,KAClB,GAAI,CACHA,EAAcD,IAAa,KAAO,KAAO,IAAIrB,GAAMqB,EAAU1B,EAAQ,GAAG,EAAE,SAAS,CACpF,MAAc,CAIb,GAAIA,EAAQ,WAAa,SAAU,CAClC5E,EAAO,IAAI9B,GAAW,wDAAwDoI,CAAQ,GAAI,kBAAkB,CAAC,EAC7GR,EAAS,EACT,MACD,CACD,CAGA,OAAQlB,EAAQ,SAAU,CACzB,IAAK,QACJ5E,EAAO,IAAI9B,GAAW,0EAA0E0G,EAAQ,GAAG,GAAI,aAAa,CAAC,EAC7HkB,EAAS,EACT,OACD,IAAK,SAEJ,GAAIS,IAAgB,KAEnB,GAAI,CACHpG,EAAQ,IAAI,WAAYoG,CAAW,CACpC,OAAStH,EAAK,CAEbe,EAAOf,CAAG,CACX,CAED,MACD,IAAK,SAEJ,GAAIsH,IAAgB,KACnB,MAID,GAAI3B,EAAQ,SAAWA,EAAQ,OAAQ,CACtC5E,EAAO,IAAI9B,GAAW,gCAAgC0G,EAAQ,GAAG,GAAI,cAAc,CAAC,EACpFkB,EAAS,EACT,MACD,CAIA,IAAMU,EAAc,CACnB,QAAS,IAAI/E,GAAQmD,EAAQ,OAAO,EACpC,OAAQA,EAAQ,OAChB,QAASA,EAAQ,QAAU,EAC3B,MAAOA,EAAQ,MACf,SAAUA,EAAQ,SAClB,OAAQA,EAAQ,OAChB,KAAMA,EAAQ,KACd,OAAQA,EAAQ,OAChB,QAASA,EAAQ,QACjB,KAAMA,EAAQ,IACf,EAEA,GAAI,CAACO,GAAoBP,EAAQ,IAAK2B,CAAW,GAAK,CAAChB,GAAeX,EAAQ,IAAK2B,CAAW,EAC7F,QAAW9G,IAAQ,CAAC,gBAAiB,mBAAoB,SAAU,SAAS,EAC3E+G,EAAY,QAAQ,OAAO/G,CAAI,EAKjC,GAAIY,EAAI,aAAe,KAAOuE,EAAQ,MAAQ/D,GAAc+D,CAAO,IAAM,KAAM,CAC9E5E,EAAO,IAAI9B,GAAW,2DAA4D,sBAAsB,CAAC,EACzG4H,EAAS,EACT,MACD,EAGIzF,EAAI,aAAe,MAAQA,EAAI,aAAe,KAAOA,EAAI,aAAe,MAAQuE,EAAQ,SAAW,UACtG4B,EAAY,OAAS,MACrBA,EAAY,KAAO,OACnBA,EAAY,QAAQ,OAAO,gBAAgB,GAI5CzG,EAAQyF,GAAM,IAAIjB,GAAQgC,EAAaC,CAAW,CAAC,CAAC,EACpDV,EAAS,EACT,MACF,CACD,CAGAzF,EAAI,KAAK,MAAO,UAAY,CACvBiE,GAAQA,EAAO,oBAAoB,QAASuB,CAAgB,CACjE,CAAC,EACD,IAAIpH,EAAO4B,EAAI,KAAK,IAAI6E,EAAe,EAEjCuB,EAAmB,CACxB,IAAK7B,EAAQ,IACb,OAAQvE,EAAI,WACZ,WAAYA,EAAI,cAChB,QAASF,EACT,KAAMyE,EAAQ,KACd,QAASA,EAAQ,QACjB,QAASA,EAAQ,OAClB,EAGM8B,EAAUvG,EAAQ,IAAI,kBAAkB,EAU9C,GAAI,CAACyE,EAAQ,UAAYA,EAAQ,SAAW,QAAU8B,IAAY,MAAQrG,EAAI,aAAe,KAAOA,EAAI,aAAe,IAAK,CAC3HsF,EAAW,IAAIpC,GAAS9E,EAAMgI,CAAgB,EAC9C1G,EAAQ4F,CAAQ,EAChB,MACD,CAOA,IAAMgB,EAAc,CACnB,MAAOnK,GAAK,aACZ,YAAaA,GAAK,YACnB,EAGA,GAAIkK,GAAW,QAAUA,GAAW,SAAU,CAC7CjI,EAAOA,EAAK,KAAKjC,GAAK,aAAamK,CAAW,CAAC,EAC/ChB,EAAW,IAAIpC,GAAS9E,EAAMgI,CAAgB,EAC9C1G,EAAQ4F,CAAQ,EAChB,MACD,CAGA,GAAIe,GAAW,WAAaA,GAAW,YAAa,CAGnD,IAAME,EAAMvG,EAAI,KAAK,IAAI6E,EAAe,EACxC0B,EAAI,KAAK,OAAQ,SAAU1G,EAAO,EAE5BA,EAAM,CAAC,EAAI,MAAU,EACzBzB,EAAOA,EAAK,KAAKjC,GAAK,cAAc,CAAC,EAErCiC,EAAOA,EAAK,KAAKjC,GAAK,iBAAiB,CAAC,EAEzCmJ,EAAW,IAAIpC,GAAS9E,EAAMgI,CAAgB,EAC9C1G,EAAQ4F,CAAQ,CACjB,CAAC,EACDiB,EAAI,GAAG,MAAO,UAAY,CAEpBjB,IACJA,EAAW,IAAIpC,GAAS9E,EAAMgI,CAAgB,EAC9C1G,EAAQ4F,CAAQ,EAElB,CAAC,EACD,MACD,CAGA,GAAIe,GAAW,MAAQ,OAAOlK,GAAK,wBAA2B,WAAY,CACzEiC,EAAOA,EAAK,KAAKjC,GAAK,uBAAuB,CAAC,EAC9CmJ,EAAW,IAAIpC,GAAS9E,EAAMgI,CAAgB,EAC9C1G,EAAQ4F,CAAQ,EAChB,MACD,CAGAA,EAAW,IAAIpC,GAAS9E,EAAMgI,CAAgB,EAC9C1G,EAAQ4F,CAAQ,CACjB,CAAC,EAED7E,GAAciF,EAAKnB,CAAO,CAC3B,CAAC,CACF,CACA,SAASsB,GAAoCtB,EAASiC,EAAe,CACpE,IAAIZ,EAEJrB,EAAQ,GAAG,SAAU,SAAUuB,EAAG,CACjCF,EAASE,CACV,CAAC,EAEDvB,EAAQ,GAAG,WAAY,SAAUe,EAAU,CAC1C,IAAMxF,EAAUwF,EAAS,QAErBxF,EAAQ,mBAAmB,IAAM,WAAa,CAACA,EAAQ,gBAAgB,GAC1EwF,EAAS,KAAK,QAAS,SAAUS,EAAU,CAO1C,GAFwBH,GAAUA,EAAO,cAAc,MAAM,EAAI,GAE1C,CAACG,EAAU,CACjC,IAAMnH,EAAM,IAAI,MAAM,iBAAiB,EACvCA,EAAI,KAAO,6BACX4H,EAAc5H,CAAG,CAClB,CACD,CAAC,CAEH,CAAC,CACF,CAEA,SAAS2G,GAAckB,EAAQ7H,EAAK,CAC/B6H,EAAO,QACVA,EAAO,QAAQ7H,CAAG,GAGlB6H,EAAO,KAAK,QAAS7H,CAAG,EACxB6H,EAAO,IAAI,EAEb,CAQAtB,GAAM,WAAa,SAAUuB,EAAM,CAClC,OAAOA,IAAS,KAAOA,IAAS,KAAOA,IAAS,KAAOA,IAAS,KAAOA,IAAS,GACjF,EAGAvB,GAAM,QAAU,OAAO,QAEvBxJ,GAAO,QAAUD,GAAUyJ,GAC3B,OAAO,eAAezJ,GAAS,aAAc,CAAE,MAAO,EAAK,CAAC,EAC5DA,GAAQ,QAAUA,GAClBA,GAAQ,QAAU0F,GAClB1F,GAAQ,QAAUwI,GAClBxI,GAAQ,SAAWwH,GACnBxH,GAAQ,WAAamC,yTCzuDrB,IAAI8I,GAAgB,SAASC,EAAGC,EAAC,CAC7B,OAAAF,GAAgB,OAAO,gBAClB,CAAE,UAAW,CAAA,CAAE,YAAc,OAAS,SAAUC,EAAGC,EAAC,CAAID,EAAE,UAAYC,CAAE,GACzE,SAAUD,EAAGC,EAAC,CAAI,QAASC,KAAKD,EAAO,OAAO,UAAU,eAAe,KAAKA,EAAGC,CAAC,IAAGF,EAAEE,CAAC,EAAID,EAAEC,CAAC,EAAE,EAC5FH,GAAcC,EAAGC,CAAC,CAC7B,EAEgB,SAAAE,GAAUH,EAAGC,EAAC,CAC1B,GAAI,OAAOA,GAAM,YAAcA,IAAM,KACjC,MAAM,IAAI,UAAU,uBAAyB,OAAOA,CAAC,EAAI,+BAA+B,EAC5FF,GAAcC,EAAGC,CAAC,EAClB,SAASG,GAAE,CAAK,KAAK,YAAcJ,CAAE,CACrCA,EAAE,UAAYC,IAAM,KAAO,OAAO,OAAOA,CAAC,GAAKG,EAAG,UAAYH,EAAE,UAAW,IAAIG,EACnF,CAwCM,SAAUC,GAAUC,EAASC,EAAYC,EAAGC,EAAS,CACvD,SAASC,EAAMC,EAAK,CAAI,OAAOA,aAAiBH,EAAIG,EAAQ,IAAIH,EAAE,SAAUI,EAAO,CAAIA,EAAQD,CAAK,CAAE,CAAE,CAAE,CAC1G,OAAO,IAAKH,IAAMA,EAAI,UAAU,SAAUI,EAASC,EAAM,CACrD,SAASC,EAAUH,EAAK,CAAI,GAAI,CAAEI,EAAKN,EAAU,KAAKE,CAAK,CAAC,CAAI,OAAQK,EAAG,CAAEH,EAAOG,CAAC,CAAI,CAAA,CACzF,SAASC,EAASN,EAAK,CAAI,GAAI,CAAEI,EAAKN,EAAU,MAASE,CAAK,CAAC,CAAI,OAAQK,EAAG,CAAEH,EAAOG,CAAC,CAAI,CAAA,CAC5F,SAASD,EAAKG,EAAM,CAAIA,EAAO,KAAON,EAAQM,EAAO,KAAK,EAAIR,EAAMQ,EAAO,KAAK,EAAE,KAAKJ,EAAWG,CAAQ,CAAE,CAC5GF,GAAMN,EAAYA,EAAU,MAAMH,EAASC,GAAc,CAAA,CAAE,GAAG,KAAI,CAAE,CACxE,CAAC,CACL,CAEgB,SAAAY,GAAYb,EAASc,EAAI,CACrC,IAAIC,EAAI,CAAE,MAAO,EAAG,KAAM,UAAA,CAAa,GAAIC,EAAE,CAAC,EAAI,EAAG,MAAMA,EAAE,CAAC,EAAG,OAAOA,EAAE,CAAC,CAAE,EAAI,KAAM,CAAA,EAAI,IAAK,CAAA,CAAE,EAAIC,EAAGC,EAAGF,EAAGG,EAC/G,OAAOA,EAAI,CAAE,KAAMC,EAAK,CAAC,EAAG,MAASA,EAAK,CAAC,EAAG,OAAUA,EAAK,CAAC,CAAC,EAAI,OAAO,QAAW,aAAeD,EAAE,OAAO,QAAQ,EAAI,UAAA,CAAa,OAAO,IAAK,GAAKA,EACvJ,SAASC,EAAKC,EAAC,CAAI,OAAO,SAAUC,EAAK,CAAA,OAAOb,EAAK,CAACY,EAAGC,CAAC,CAAC,CAAE,CAAG,CAChE,SAASb,EAAKc,EAAE,CACZ,GAAIN,EAAG,MAAM,IAAI,UAAU,iCAAiC,EAC5D,KAAOF,GAAG,GAAI,CACV,GAAIE,EAAI,EAAGC,IAAMF,EAAIO,EAAG,CAAC,EAAI,EAAIL,EAAE,OAAYK,EAAG,CAAC,EAAIL,EAAE,SAAcF,EAAIE,EAAE,SAAcF,EAAE,KAAKE,CAAC,EAAG,GAAKA,EAAE,OAAS,EAAEF,EAAIA,EAAE,KAAKE,EAAGK,EAAG,CAAC,CAAC,GAAG,KAAM,OAAOP,EAE3J,OADIE,EAAI,EAAGF,IAAGO,EAAK,CAACA,EAAG,CAAC,EAAI,EAAGP,EAAE,KAAK,GAC9BO,EAAG,CAAC,EAAC,CACT,IAAK,GAAG,IAAK,GAAGP,EAAIO,EAAI,MACxB,IAAK,GAAG,OAAAR,EAAE,QAAgB,CAAE,MAAOQ,EAAG,CAAC,EAAG,KAAM,EAAK,EACrD,IAAK,GAAGR,EAAE,QAASG,EAAIK,EAAG,CAAC,EAAGA,EAAK,CAAC,CAAC,EAAG,SACxC,IAAK,GAAGA,EAAKR,EAAE,IAAI,IAAG,EAAIA,EAAE,KAAK,IAAG,EAAI,SACxC,QACI,GAAMC,EAAID,EAAE,KAAM,EAAAC,EAAIA,EAAE,OAAS,GAAKA,EAAEA,EAAE,OAAS,CAAC,KAAOO,EAAG,CAAC,IAAM,GAAKA,EAAG,CAAC,IAAM,GAAI,CAAER,EAAI,EAAG,QAAW,CAC5G,GAAIQ,EAAG,CAAC,IAAM,IAAM,CAACP,GAAMO,EAAG,CAAC,EAAIP,EAAE,CAAC,GAAKO,EAAG,CAAC,EAAIP,EAAE,CAAC,GAAK,CAAED,EAAE,MAAQQ,EAAG,CAAC,EAAG,KAAQ,CACtF,GAAIA,EAAG,CAAC,IAAM,GAAKR,EAAE,MAAQC,EAAE,CAAC,EAAG,CAAED,EAAE,MAAQC,EAAE,CAAC,EAAGA,EAAIO,EAAI,KAAQ,CACrE,GAAIP,GAAKD,EAAE,MAAQC,EAAE,CAAC,EAAG,CAAED,EAAE,MAAQC,EAAE,CAAC,EAAGD,EAAE,IAAI,KAAKQ,CAAE,EAAG,KAAQ,CAC/DP,EAAE,CAAC,GAAGD,EAAE,IAAI,IAAG,EACnBA,EAAE,KAAK,IAAG,EAAI,QACrB,CACDQ,EAAKT,EAAK,KAAKd,EAASe,CAAC,CAC5B,OAAQL,EAAG,CAAEa,EAAK,CAAC,EAAGb,CAAC,EAAGQ,EAAI,CAAI,QAAS,CAAED,EAAID,EAAI,CAAI,CAC1D,GAAIO,EAAG,CAAC,EAAI,EAAG,MAAMA,EAAG,CAAC,EAAG,MAAO,CAAE,MAAOA,EAAG,CAAC,EAAIA,EAAG,CAAC,EAAI,OAAQ,KAAM,EAAI,EAEtF,CAkBM,SAAUC,GAASC,EAAC,CACtB,IAAIC,EAAI,OAAO,QAAW,YAAc,OAAO,SAAUC,EAAID,GAAKD,EAAEC,CAAC,EAAGE,EAAI,EAC5E,GAAID,EAAG,OAAOA,EAAE,KAAKF,CAAC,EACtB,GAAIA,GAAK,OAAOA,EAAE,QAAW,SAAU,MAAO,CAC1C,KAAM,UAAA,CACF,OAAIA,GAAKG,GAAKH,EAAE,SAAQA,EAAI,QACrB,CAAE,MAAOA,GAAKA,EAAEG,GAAG,EAAG,KAAM,CAACH,CAAC,IAG7C,MAAM,IAAI,UAAUC,EAAI,0BAA4B,iCAAiC,CACzF,CAEgB,SAAAG,EAAOJ,EAAGJ,EAAC,CACvB,IAAIM,EAAI,OAAO,QAAW,YAAcF,EAAE,OAAO,QAAQ,EACzD,GAAI,CAACE,EAAG,OAAOF,EACf,IAAIG,EAAID,EAAE,KAAKF,CAAC,EAAGK,EAAGC,EAAK,CAAA,EAAIrB,EAC/B,GAAI,CACA,MAAQW,IAAM,QAAUA,KAAM,IAAM,EAAES,EAAIF,EAAE,KAAI,GAAI,MAAMG,EAAG,KAAKD,EAAE,KAAK,CAC5E,OACME,EAAO,CAAEtB,EAAI,CAAE,MAAOsB,CAAK,CAAK,QAC/B,CACJ,GAAI,CACIF,GAAK,CAACA,EAAE,OAASH,EAAIC,EAAE,SAAYD,EAAE,KAAKC,CAAC,CAClD,QACO,CAAE,GAAIlB,EAAG,MAAMA,EAAE,KAAQ,CACpC,CACD,OAAOqB,CACX,UAkBgBE,GAAcC,EAAIC,EAAMC,EAAI,CACxC,GAAIA,GAAQ,UAAU,SAAW,EAAG,QAASR,EAAI,EAAGS,EAAIF,EAAK,OAAQJ,EAAIH,EAAIS,EAAGT,KACxEG,GAAM,EAAEH,KAAKO,MACRJ,IAAIA,EAAK,MAAM,UAAU,MAAM,KAAKI,EAAM,EAAGP,CAAC,GACnDG,EAAGH,CAAC,EAAIO,EAAKP,CAAC,GAGtB,OAAOM,EAAG,OAAOH,GAAM,MAAM,UAAU,MAAM,KAAKI,CAAI,CAAC,CAC3D,CC3JO,IAAMG,GAAkB,KAClBC,GAAkB,KAwB/BC,IAAA,UAAA,CAIE,SAAoBA,EAAAC,EAAgCC,EAAoB,CAApD,KAAO,QAAPD,EAAgC,KAAS,UAATC,EAH5C,KAAA,KAAO,IAAI,QACX,KAAY,aAAG,EAIvB,OAAAF,EAAG,UAAA,IAAH,SAAIG,EAAc,CAChB,OAAK,KAAK,KAAK,IAAIA,CAAM,GACvB,KAAK,UAAU,SAAS,KAAK,QAASA,CAAM,EAEvC,KAAK,KAAK,IAAIA,CAAM,GAG7BH,EAAA,UAAA,IAAA,SAAIG,EAAgBtC,EAAQ,CAC1B,KAAK,eACL,KAAK,KAAK,IAAIsC,EAAQtC,CAAK,GAG7BmC,EAAG,UAAA,IAAH,SAAIG,EAAc,CAChB,OAAO,KAAK,KAAK,IAAIA,CAAM,GAG7BH,EAAM,UAAA,OAAN,SAAOG,EAAc,CACnB,YAAK,eACE,KAAK,KAAK,OAAOA,CAAM,GAGhCH,EAAA,UAAA,WAAA,UAAA,CACE,OAAO,KAAK,cAEfA,CAAA,GAAA,EAuBDI,IAAA,UAAA,CAAA,SAAAA,GAAA,EACE,OAAAA,EAAQ,UAAA,SAAR,SAASD,EAAc,CACrB,OAAOE,GAAkB,UAAU,GAErCD,EAAM,UAAA,OAAN,SAAOD,EAAc,CACnB,OAAOE,GAAkB,QAAQ,GAEnCD,EAAA,UAAA,eAAA,UAAA,CACE,MAAO,IAETA,EAAI,UAAA,KAAJ,SAAK3B,EAAa,CAChB,OAAO4B,GAAkB,MAAM,GAEjCD,EAAI,UAAA,KAAJ,SAAKD,EAAc,CACjB,OAAOE,GAAkB,MAAM,GAEjCD,EAAQ,UAAA,SAAR,SAASD,EAAc,CACrB,OAAOE,GAAkB,UAAU,GAErCD,EAAA,UAAA,UAAA,SAAUD,EAAgBG,EAA0B,CAClD,OAAOD,GAAkB,WAAW,GAEtCD,EAAA,UAAA,WAAA,UAAA,CACE,OAAOC,GAAkB,YAAY,GAEvCD,EAAA,UAAA,YAAA,SAAYD,EAAgBI,EAAe,CACzC,OAAOF,GAAkB,aAAa,GAExCD,EAAA,UAAA,MAAA,SAAMI,EAAuBC,EAAiBC,EAAe,CAC3D,OAAOL,GAAkB,OAAO,GAElCD,EAAI,UAAA,KAAJ,SACID,EAAgBK,EAAuBC,EAAiBC,EACxDC,EAAgB,CAClB,OAAON,GAAkB,MAAM,GAGjCD,EAAA,UAAA,wBAAA,SACII,EAA8BC,EAAiBC,EAAe,CAChE,OAAOL,GAAkB,yBAAyB,GAGpDD,EAAA,UAAA,OAAA,UAAA,CACE,OAAOC,GAAkB,QAAQ,GAGnCD,EAAA,UAAA,eAAA,UAAA,CACE,OAAOC,GAAkB,gBAAgB,GAG3CD,EAAA,UAAA,QAAA,UAAA,CACE,OAAO,KAAK,eAAc,IAAO,GAAKN,GAAkBC,IAE1DK,EAAA,UAAA,QAAA,UAAA,CACE,OAAOC,GAAkB,SAAS,GAErCD,CAAA,GAAA,EAED,SAASC,GAAkBO,EAAkB,CAC3C,MAAM,IAAI,MACN,IAAA,OAAIA,EAAgE,sDAAA,EACpE,sEAAsE,CAC5E,CChIM,SAAUC,GAAQC,EACY,CAIlC,QAHIC,EAAUD,EAAM,OAChBE,EAAQ,EAELD,EAAU,GAEfC,EAAS,KAAK,OAAM,EAAKD,EAAW,EAEpCA,IAEAE,GAAKH,EAAOC,EAASC,CAAK,CAE9B,UAkBgBE,GAEZJ,EAEAK,EAAiD,CACnD,GAAIL,EAAM,SAAWK,EAAO,OAC1B,MAAM,IAAI,MACN,kDACA,0BAA0B,OAAAL,EAAM,MAAM,EACtC,2BAAA,OAA2BK,EAAO,MAAM,CAAE,EAKhD,QAHIJ,EAAUD,EAAM,OAChBE,EAAQ,EAELD,EAAU,GAEfC,EAAS,KAAK,OAAM,EAAKD,EAAW,EAEpCA,IAEAE,GAAKH,EAAOC,EAASC,CAAK,EAC1BC,GAAKE,EAAQJ,EAASC,CAAK,CAE/B,UAGgBI,GAAMC,EAAaC,EAAWC,EAAW,CACvD,OAAO,KAAK,IAAIF,EAAK,KAAK,IAAIC,EAAGC,CAAG,CAAC,CACvC,CAEM,SAAUC,GAAkBC,EAAW,CAC3C,OAAOA,EAAM,IAAM,EAAIA,EAAMA,EAAM,CACrC,UAEgBR,GACZS,EAA8BC,EAAcC,EAAa,CAC3D,IAAMC,EAAOH,EAAOC,CAAI,EACxBD,EAAOC,CAAI,EAAID,EAAOE,CAAK,EAC3BF,EAAOE,CAAK,EAAIC,CAClB,CAEM,SAAUC,GAAIC,EAAa,CAE/B,QADID,EAAM,EACD1C,EAAI,EAAGA,EAAI2C,EAAI,OAAQ3C,IAC9B0C,GAAOC,EAAI3C,CAAC,EAEd,OAAO0C,CACT,CASgB,SAAAE,GAAYC,EAAW9E,EAAS,CAC9C,IAAM,EAAI,KAAK,OAAM,EACrB,OAAQA,EAAI,GAAM,EAAI,GAAK8E,CAC7B,CAGgB,SAAAC,GAAYD,EAAe9E,EAAa,CAEtD,QADIiB,EAAS,EACJgB,EAAI,EAAGA,EAAI6C,EAAE,OAAQ7C,IAAK,CACjC,IAAM+C,EAAO,OAAOF,EAAE7C,CAAC,CAAC,EAAI,OAAOjC,EAAEiC,CAAC,CAAC,EACvChB,GAAU+D,EAAOA,CAClB,CACD,OAAO/D,CACT,CAiBgB,SAAAgE,EAAOC,EAAeC,EAAiB,CACrD,GAAI,CAACD,EACH,MAAM,IAAI,MAAM,OAAOC,GAAQ,SAAWA,EAAMA,EAAG,CAAE,CAEzD,UAEgBC,GACZC,EAAkBC,EAAkBC,EAAuB,CAAvBA,IAAA,SAAAA,EAAuB,IAC7DN,EACIO,GAAYH,EAAQC,CAAM,EAC1B,UAAM,CAAA,OAAAC,EAAqB,WAAA,OAAWF,EAAc,OAAA,EAAA,OAAAC,EAAM,aAAA,CAApD,CAAiE,CAC7E,CAEM,SAAUG,GAAcX,EAAa,CACzCG,EACIH,GAAK,KACL,UAAM,CAAA,MAAA,+DAA+D,CAAA,CAC3E,CAaM,SAAUY,GAAcpC,EAAe,CAC3C,GAAIA,EAAM,SAAW,EAEnB,MAAO,GAGT,QADIqC,EAAOrC,EAAM,CAAC,EACTrB,EAAI,EAAGA,EAAIqB,EAAM,OAAQrB,IAChC0D,GAAQrC,EAAMrB,CAAC,EAEjB,OAAO0D,CACT,CAEM,SAAUC,GAActC,EAAe,CAC3C,OAAOA,EAAM,SAAW,CAC1B,CAEgB,SAAAuC,GAAoBC,EAAcC,EAAY,CAC5D,GAAID,IAAOC,EACT,MAAO,GAOT,GAJID,GAAM,MAAQC,GAAM,MAIpBD,EAAG,SAAWC,EAAG,OACnB,MAAO,GAGT,QAAS9D,EAAI,EAAGA,EAAI6D,EAAG,OAAQ7D,IAC7B,GAAI6D,EAAG7D,CAAC,IAAM,MAAQ8D,EAAG9D,CAAC,IAAM,MAAQ6D,EAAG7D,CAAC,IAAM8D,EAAG9D,CAAC,EACpD,MAAO,GAGX,MAAO,EACT,CAEgB,SAAAuD,GAAYM,EAAgBC,EAAc,CACxD,GAAID,IAAOC,EACT,MAAO,GAMT,GAJID,GAAM,MAAQC,GAAM,MAIpBD,EAAG,SAAWC,EAAG,OACnB,MAAO,GAET,QAAS9D,EAAI,EAAGA,EAAI6D,EAAG,OAAQ7D,IAC7B,GAAI6D,EAAG7D,CAAC,IAAM8D,EAAG9D,CAAC,EAChB,MAAO,GAGX,MAAO,EACT,CAEM,SAAU+D,GAAMlB,EAAS,CAC7B,OAAOA,EAAI,IAAM,CACnB,CAEM,SAAUmB,GAAK9B,EAAS,CAE5B,GAAK,KAAa,MAAQ,KAExB,OAAQ,KAAa,KAAKA,CAAC,EAE7B,GAAIA,IAAM,IACR,MAAO,GACF,GAAIA,IAAM,KACf,MAAO,GAEP,IAAM+B,EAAM,KAAK,IAAI,EAAI/B,CAAC,EAC1B,OAAQ+B,EAAM,IAAMA,EAAM,EAE9B,CAEM,SAAUC,GAAoBR,EAAY,CAC9C,IAAMS,EAAQ,KAAK,KAAK,KAAK,KAAKT,CAAI,CAAC,EACvC,MAAO,CAACS,EAAO,KAAK,KAAKT,EAAOS,CAAK,CAAC,CACxC,CAcM,SAAUC,GAAsB3E,EAAS,CAE7C,QADM4E,EAAkB,IAAI,YAAY5E,CAAC,EAChCO,EAAI,EAAGA,EAAIP,EAAG,EAAEO,EACvBqE,EAAgBrE,CAAC,EAAIA,EAEvB,OAAAyB,GAAQ4C,CAAe,EAChBA,CACT,CAEgB,SAAAC,GAASzB,EAAWa,EAAY,CAC9C,OAAIA,GAAQb,EAAE,OACLA,EAEFA,EAAI,IAAI,OAAOa,EAAOb,EAAE,MAAM,CACvC,CAEM,SAAU0B,GACZC,EAAwBC,EACxBC,EACAC,EACQ,CAHgB,OAAAF,IAAA,SAAAA,EAAW,SAAA9C,EAAe,CAAK,MAAA,EAAC,GAInD,IAAI,QAAc,SAACjD,EAASC,EAAM,CACvC,IAAIiG,EAAW,EAETC,EAAQ,UAAA,CACZ,GAAIL,EAAO,EAAI,CACb9F,EAAO,EACP,MACD,CAEDkG,IAEA,IAAME,EAAcL,EAAQG,CAAQ,EAEpC,GAAIF,GAAc,MAAQE,GAAYF,EAAY,CAChD/F,EAAM,EACN,MACD,CAEGgG,GAAc,KAChBA,EAAWE,EAAOC,CAAW,EAI7B,WAAWD,EAAOC,CAAW,CAEjC,EAEAD,EAAK,CACP,CAAC,CACH,CAWgB,SAAAE,GACZ1D,EAAiBqC,EAAY,CAI/B,QAHIsB,EAAY,EACZC,EAAc,GAETjF,EAAI,EAAGA,EAAIqB,EAAM,OAAQ,EAAErB,EAClC,GAAIqB,EAAMrB,CAAC,GAAK,EACdgF,GAAa3D,EAAMrB,CAAC,UACXqB,EAAMrB,CAAC,IAAM,GAAI,CAC1B,GAAIiF,IAAgB,GAClB,MAAM,MACF,yCACA,mBAAA,OAAmBA,EAAW,WAAA,EAAA,OAAYjF,CAAC,CAAE,EAEnDiF,EAAcjF,CACf,SAAUqB,EAAMrB,CAAC,EAAI,EACpB,MAAM,MAAM,gCAAA,OAAgCqB,EAAMrB,CAAC,EAAY,UAAA,EAAA,OAAAA,CAAC,CAAE,EAItE,GAAIiF,IAAgB,GAAI,CACtB,GAAIvB,EAAO,GAAKA,IAASsB,EACvB,MAAM,MAAM,QAAQ,OAAAtB,EAAI,oCAAA,EAAA,OAAqCrC,CAAK,CAAE,EAEtE,OAAOA,CACR,CAED,GAAI2D,IAAc,EAChB,MAAM,MACF,qCAAqC,OAAA3D,EAAc,SAAA,EACnD,sBAAsB,EAE5B,GAAIqC,EAAOsB,IAAc,EACvB,MAAM,MACF,oDACA,OAAA,OAAOtB,EAAI,KAAA,EAAA,OAAMsB,CAAS,CAAE,EAGlC,IAAME,EAAW7D,EAAM,MAAK,EAC5B,OAAA6D,EAASD,CAAW,EAAIvB,EAAOsB,EACxBE,CACT,CAEgB,SAAAC,GACZC,EAAuB/D,EAAe,CACxC,IAAMgE,EAAOhE,EAAM,OAGnB,OAAA+D,EAAOA,GAAQ,KAAO/D,EAAM,IAAI,SAACvB,EAAGE,EAAM,CAAA,OAAAA,CAAC,CAAA,EAAI,CAAA,EAAG,OAAOoF,CAAI,EAG7DpC,EACIoC,EAAK,MAAM,SAAAE,EAAM,CAAA,OAAAA,GAAM,CAACD,GAAQC,EAAKD,CAApB,CAAwB,EACzC,UACI,CAAA,MAAA,+CAA+C,OAAAA,EAAS,IAAA,EAAA,OAAAA,EAAY,QAAA,EACpE,YAAA,OAAYD,CAAI,CADhB,CACkB,EAG1BpC,EACIoC,EAAK,MAAM,SAAAE,EAAM,CAAA,OAAAvB,GAAMuB,CAAE,CAAR,CAAS,EAC1B,UAAA,CAAM,MAAA,iDACF,YAAA,OAAYF,CAAI,CADd,CACgB,EAGnBA,EAAK,IAAI,SAAAvC,EAAK,CAAA,OAAAA,EAAI,EAAIwC,EAAOxC,EAAIA,CAAC,CAAA,CAC3C,CAGgB,SAAA0C,GAAalE,EAAiB+D,EAAe,CAS3D,QAPMF,EAAqB,CAAA,EACrBM,EAAqB,CAAA,EACrBC,EAAeL,GAAQ,MAAQ,MAAM,QAAQA,CAAI,GAAKA,EAAK,SAAW,EACtEM,EAAQN,GAAQ,MAAQK,EAC1B,KACAN,GAAeC,EAAM/D,CAAK,EAAE,KAAI,EAChCsE,EAAI,EACC,EAAI,EAAG,EAAItE,EAAM,OAAQ,EAAE,EAAG,CACrC,GAAIqE,GAAQ,KAAM,CAChB,GAAIA,EAAKC,CAAC,IAAM,GAAKtE,EAAM,CAAC,IAAM,EAChC,MAAM,IAAI,MACN,sBAAA,OAAsB,EAAC,kBAAA,EAAA,OAAmBA,EAAM,CAAC,EAAa,YAAA,CAAA,GAE/DqE,EAAKC,CAAC,GAAK,MAAQD,EAAKC,CAAC,EAAI,IAAMtE,EAAM,CAAC,IAAM,IACnD6D,EAAS,KAAK7D,EAAM,CAAC,CAAC,EACtBmE,EAAS,KAAK,CAAC,GAEbE,EAAKC,CAAC,GAAK,GACbA,GAEH,CACGtE,EAAM,CAAC,IAAM,IACf6D,EAAS,KAAK7D,EAAM,CAAC,CAAC,EACtBmE,EAAS,KAAK,CAAC,EAElB,CACD,MAAO,CAAC,SAAQN,EAAE,SAAQM,CAAA,CAC5B,CAEgB,SAAAI,GACZtE,EAAUoC,EAAY,CACxB,OAAOmC,GAAqBvE,EAAOoC,CAAI,CACzC,CAEgB,SAAAmC,GACZvE,EAAUoC,EAAY,CACxB,IAAItC,EAAS,KACb,GAAIE,GAAS,MAAQA,IAAU,UAC7BF,EAAS,IAAI,aAAasC,CAAI,UACrBpC,IAAU,QACnBF,EAAS,IAAI,WAAWsC,CAAI,UACnBpC,IAAU,OACnBF,EAAS,IAAI,WAAWsC,CAAI,UACnBpC,IAAU,SACnBF,EAAS,IAAI,MAAcsC,CAAI,MAE/B,OAAM,IAAI,MAAM,qBAAA,OAAqBpC,CAAK,CAAE,EAE9C,OAAOF,CACT,CAEgB,SAAA0E,GACZC,EAA+BzE,EAAQ,CACzC,QAAStB,EAAI,EAAGA,EAAI+F,EAAK,OAAQ/F,IAAK,CACpC,IAAMgG,EAAMD,EAAK/F,CAAC,EAClB,GAAI,MAAMgG,CAAG,GAAK,CAAC,SAASA,CAAG,EAC7B,MAAM,MAAM,oBAAoB,OAAA1E,EAAK,2BAAA,EAAA,OAA4B0E,EAAG,GAAA,CAAG,CAE1E,CACH,CAGM,SAAUC,GAAa3E,EAAe,CAC1C,OAAOA,IAAU,QAAUA,IAAU,aAAeA,IAAU,WAC1DA,IAAU,SAAWA,IAAU,QACrC,CAMgB,SAAA4E,GAAgBC,EAAmBC,EAAiB,CAUlE,MATI,EAAAA,IAAY,aAGZA,IAAY,WAAaD,IAAY,aAGrCC,IAAY,SAAWD,IAAY,WAAaA,IAAY,aAG5DC,IAAY,QAAUD,IAAY,OAIxC,CAEM,SAAUE,GAAgB/E,EAAe,CAC7C,GAAIA,IAAU,WAAaA,IAAU,QACnC,MAAO,GACF,GAAIA,IAAU,YACnB,MAAO,GACF,GAAIA,IAAU,OACnB,MAAO,GAEP,MAAM,IAAI,MAAM,iBAAA,OAAiBA,CAAK,CAAE,CAE5C,CAQM,SAAUgF,GAAqB3D,EAAiB,CACpD,GAAIA,GAAO,KACT,MAAO,GAET,IAAI4D,EAAQ,EACZ,OAAA5D,EAAI,QAAQ,SAAAT,EAAK,CAAA,OAAAqE,GAASrE,EAAE,MAAX,CAAiB,EAC3BqE,CACT,CAGM,SAAUC,GAAS/H,EAAS,CAChC,OAAO,OAAOA,GAAU,UAAYA,aAAiB,MACvD,CAEM,SAAUgI,GAAUhI,EAAS,CACjC,OAAO,OAAOA,GAAU,SAC1B,CAEM,SAAUiI,GAASjI,EAAS,CAChC,OAAO,OAAOA,GAAU,QAC1B,CAEM,SAAUkI,GAAWvF,EAAuC,CAChE,OAAI,MAAM,QAAQA,CAAM,EACfuF,GAAWvF,EAAO,CAAC,CAAC,EAEzBA,aAAkB,aACb,UAELA,aAAkB,YAAcA,aAAkB,YAClDA,aAAkB,kBACb,QACEsF,GAAStF,CAAM,EACjB,UACEoF,GAASpF,CAAM,EACjB,SACEqF,GAAUrF,CAAM,EAClB,OAEF,SACT,CAEM,SAAUwF,GAAWvH,EAAW,CACpC,MAAO,CAAC,EAAEA,GAAKA,EAAE,aAAeA,EAAE,MAAQA,EAAE,MAC9C,CAEgB,SAAAwH,GAAenD,EAAcoD,EAAa,CACxD,QAAS9G,EAAI8G,EAAO9G,EAAI0D,EAAM,EAAE1D,EAC9B,GAAI0D,EAAO1D,IAAM,EACf,OAAOA,EAGX,OAAO0D,CACT,CAEM,SAAUqD,GAAe1F,EAAe,CAC5C,IAAMgE,EAAOhE,EAAM,OACnB,GAAIgE,EAAO,EACT,MAAO,CAAA,EAKT,IAAM2B,EAAU,IAAI,MAAM3B,EAAO,CAAC,EAClC2B,EAAQ3B,EAAO,CAAC,EAAIhE,EAAMgE,EAAO,CAAC,EAClC,QAASrF,EAAIqF,EAAO,EAAGrF,GAAK,EAAG,EAAEA,EAC/BgH,EAAQhH,CAAC,EAAIgH,EAAQhH,EAAI,CAAC,EAAIqB,EAAMrB,EAAI,CAAC,EAE3C,OAAOgH,CACT,CAEA,SAASC,GACLC,EAAgB7F,EAAiBwB,EAAesE,EAAiB,CAAjBA,IAAA,SAAAA,EAAiB,IACnE,IAAMC,EAAM,IAAI,MAChB,GAAI/F,EAAM,SAAW,EAEnB,QADMvD,EAAIuD,EAAM,CAAC,GAAK8F,EAAY,EAAI,GAC7BnH,EAAI,EAAGA,EAAIlC,EAAGkC,IACrBoH,EAAIpH,CAAC,EAAI6C,EAAEqE,EAASlH,CAAC,MAMvB,SAHMlC,EAAIuD,EAAM,CAAC,EACXgG,EAAOhG,EAAM,MAAM,CAAC,EACpBiG,EAAMD,EAAK,OAAO,SAACE,EAAKC,EAAM,CAAA,OAAAD,EAAMC,CAAN,CAAO,GAAKL,EAAY,EAAI,GACvDnH,EAAI,EAAGA,EAAIlC,EAAGkC,IACrBoH,EAAIpH,CAAC,EAAIiH,GAAkBC,EAASlH,EAAIsH,EAAKD,EAAMxE,EAAGsE,CAAS,EAGnE,OAAOC,CACT,UAGgBK,GACZpG,EAAiBwB,EAAesE,EAAiB,CACnD,GADkCA,IAAA,SAAAA,EAAiB,IAC/C9F,EAAM,SAAW,EAEnB,OAAOwB,EAAE,CAAC,EAEZ,IAAMa,EAAOrC,EAAM,OAAO,SAACkG,EAAKC,EAAM,CAAA,OAAAD,EAAMC,CAAN,CAAO,GAAKL,EAAY,EAAI,GAClE,GAAIzD,IAAS,EAEX,MAAO,CAAA,EAET,GAAIA,IAASb,EAAE,OACb,MAAM,IAAI,MAAM,IAAA,OAAIxB,EAAwC,kCAAA,EAAA,OAAAwB,EAAE,MAAM,EAAA,OAChEsE,EAAY,wBAA0B,GAAK,GAAA,CAAA,EAGjD,OAAOF,GAAkB,EAAG5F,EAAOwB,EAAGsE,CAAS,CACjD,CAEgB,SAAAO,GACZC,EAAiCrG,EAAe,CAElD,GAAI,MAAM,QAAQqG,CAAI,EACpB,OAAOA,EAET,GAAIrG,IAAU,UACZ,OAAOqG,aAAgB,aAAeA,EAAO,IAAI,aAAaA,CAAI,EAC7D,GAAIrG,IAAU,QACnB,OAAOqG,aAAgB,WAAaA,EAAO,IAAI,WAAWA,CAAI,EACzD,GAAIrG,IAAU,QAAUA,IAAU,SACvC,OAAO,WAAW,KAAK,IAAI,WAAWqG,CAAI,CAAC,EAE3C,MAAM,IAAI,MAAM,iBAAA,OAAiBrG,CAAK,CAAE,CAE5C,CAEgB,SAAAsG,GACZlE,EAAcpC,EAAQ,CAExB,QADMI,EAAQmG,GAAoBnE,EAAMpC,CAAK,EACpCtB,EAAI,EAAGA,EAAI0B,EAAM,OAAQ1B,IAChC0B,EAAM1B,CAAC,EAAI,EAEb,OAAO0B,CACT,CAEgB,SAAAmG,GACZnE,EAAcpC,EAAQ,CACxB,GAAIA,GAAS,MAAQA,IAAU,WAAaA,IAAU,YACpD,OAAO,IAAI,aAAaoC,CAAI,EACvB,GAAIpC,IAAU,QACnB,OAAO,IAAI,WAAWoC,CAAI,EACrB,GAAIpC,IAAU,OACnB,OAAO,IAAI,WAAWoC,CAAI,EAE1B,MAAM,IAAI,MAAM,qBAAA,OAAqBpC,CAAK,CAAE,CAEhD,CAOgB,SAAAwG,GACZzG,EAAiBC,EAAQ,CAC3B,IAAMoC,EAAOrC,EAAM,OAAO,SAAC0G,EAAMC,EAAI,CAAK,OAAAD,EAAOC,CAAI,EAAE,CAAC,EACxD,GAAI1G,GAAS,MAAQA,IAAU,UAC7B,OAAOmG,GAAcpG,EAAO,IAAI,aAAaqC,CAAI,CAAC,EAC7C,GAAIpC,IAAU,QACnB,OAAOmG,GAAcpG,EAAO,IAAI,WAAWqC,CAAI,CAAC,EAC3C,GAAIpC,IAAU,OACnB,OAAOmG,GAAcpG,EAAO,IAAI,WAAWqC,CAAI,CAAC,EAEhD,MAAM,IAAI,MAAM,qBAAA,OAAqBpC,CAAK,CAAE,CAEhD,CAEM,SAAU2G,GAAmC5G,EAAe,CAChEA,EAAM,QAAQ,SAAA6G,EAAO,CACnBlF,EACI,OAAO,UAAUkF,CAAO,GAAKA,GAAW,EACxC,UAAA,CACI,MAAA,mEACA,UAAA,OAAU7G,EAAK,IAAA,CADf,CACmB,CAC7B,CAAC,CACH,UAUgB8G,GACZC,EAAgB/C,EAAc2B,EAAiB,CACjD,GAAI3B,IAAS,EACX,MAAO,GACF,GAAIA,IAAS,EAClB,OAAO+C,EAAK,CAAC,EAGf,QADIxG,EAAQwG,EAAKA,EAAK,OAAS,CAAC,EACvBpI,EAAI,EAAGA,EAAIoI,EAAK,OAAS,EAAG,EAAEpI,EACrC4B,GAASoF,EAAQhH,CAAC,EAAIoI,EAAKpI,CAAC,EAE9B,OAAO4B,CACT,UAUgByG,GACZzG,EAAeyD,EAAc2B,EAAiB,CAChD,GAAI3B,IAAS,EACX,MAAO,CAAA,EACF,GAAIA,IAAS,EAClB,MAAO,CAACzD,CAAK,EAGf,QADMwG,EAAiB,IAAI,MAAM/C,CAAI,EAC5BrF,EAAI,EAAGA,EAAIoI,EAAK,OAAS,EAAG,EAAEpI,EACrCoI,EAAKpI,CAAC,EAAI,KAAK,MAAM4B,EAAQoF,EAAQhH,CAAC,CAAC,EACvC4B,GAASwG,EAAKpI,CAAC,EAAIgH,EAAQhH,CAAC,EAE9B,OAAAoI,EAAKA,EAAK,OAAS,CAAC,EAAIxG,EACjBwG,CACT,CAOM,SAAUE,GAAUhG,EAAW,CAOnC,OAAOA,GAAUA,EAAO,MAAQ,OAAOA,EAAO,MAAS,UACzD,CCrtBA,IAAMiG,GAA4B,YAmBlCC,IAAA,UAAA,CAaE,SAAAA,EAAmBC,EAAW,CAAX,KAAM,OAANA,EAZX,KAAK,MAAU,CAAA,EACf,KAAY,aAA4C,CAAA,EAExD,KAAQ,SAAU,CAAA,EAM1B,KAAc,eAAGC,GAIf,KAAK,iBAAgB,EAGvB,OAAAF,EAAA,UAAA,YAAA,SAAYG,EAAsBC,EAAkB,CAC9C,KAAK,UAAY,OACbC,GAAG,EAAG,QAAQ,SAAS,GAAKA,GAAG,EAAG,QAAQ,MAAM,GACpD,QAAQ,KACJ,YAAA,OAAY,KAAK,aAAqC,yBAAA,EACtD,iCAAiC,OAAAF,EAAe,GAAA,CAAA,GAGxD,KAAK,aAAeA,EACpB,KAAK,SAAWC,GAGlBJ,EAAA,UAAA,aAAA,SACIM,EAAkBC,EAClBC,EAAoC,CAKtC,GAJA,KAAK,aAAaF,CAAQ,EAAI,CAAC,aAAYC,EAAE,QAAOC,CAAA,EAIhD,KAAK,SAASF,CAAQ,GAAK,KAAM,CACnC,IAAMG,EAAY,KAAK,SAASH,CAAQ,EAClCD,GAAG,EAAG,QAAQ,SAAS,GAAKA,GAAG,EAAG,QAAQ,MAAM,GACpD,QAAQ,KACJ,qCAAA,OAAqCC,EAAa,IAAA,EAAA,OAAAG,EAAY,GAAA,CAAA,EAEpE,KAAK,IAAIH,EAAUG,CAAS,CAC7B,GAGGT,EAAQ,UAAA,SAAd,SAAeM,EAAgB,mGAC7B,OAAIA,KAAY,KAAK,MACnB,CAAA,EAAO,KAAK,MAAMA,CAAQ,CAAC,GAG7BI,EAAA,KAAK,MAAMC,EAAAL,EAAY,CAAA,EAAM,KAAK,aAAaA,CAAQ,CAAC,UAAxD,OAAAI,EAAoBC,CAAA,EAAGC,EAAA,KAAA,EACvB,CAAA,EAAO,KAAK,MAAMN,CAAQ,CAAC,MAC5B,EAEDN,EAAG,UAAA,IAAH,SAAIM,EAAgB,CAClB,GAAIA,KAAY,KAAK,MACnB,OAAO,KAAK,MAAMA,CAAQ,EAG5B,IAAMG,EAAY,KAAK,aAAaH,CAAQ,EAC5C,GAAIR,GAAUW,CAAS,EACrB,MAAM,IAAI,MACN,QAAA,OAAQH,EAA8C,sCAAA,EACtD,gCAAgC,EAGtC,YAAK,MAAMA,CAAQ,EAAIG,EAChB,KAAK,MAAMH,CAAQ,GAG5BN,EAAS,UAAA,UAAT,SAAUM,EAAgB,CACxB,OAAO,KAAK,IAAIA,CAAQ,GAG1BN,EAAO,UAAA,QAAP,SAAQM,EAAgB,CACtB,OAAO,KAAK,IAAIA,CAAQ,GAG1BN,EAAS,UAAA,UAAT,SAAUM,EAAgB,CACxB,OAAO,KAAK,IAAIA,CAAQ,GAG1BN,EAAA,UAAA,SAAA,UAAA,CACE,OAAO,KAAK,OAGd,OAAA,eAAIA,EAAQ,UAAA,WAAA,CAAZ,IAAA,UAAA,CACE,OAAO,KAAK,oCACb,CAAA,EAEDA,EAAA,UAAA,IAAA,SAAIM,EAAkBrK,EAAgB,CACpC,GAAI,KAAK,aAAaqK,CAAQ,GAAK,KACjC,MAAM,IAAI,MACN,mBAAA,OAAmBA,EAAQ,iCAAA,CAAiC,EAElE,KAAK,MAAMA,CAAQ,EAAIrK,EACnB,KAAK,aAAaqK,CAAQ,EAAE,SAAW,MACzC,KAAK,aAAaA,CAAQ,EAAE,QAAQrK,CAAK,GAIrC+J,EAAY,UAAA,aAAZ,SAAaM,EAAgB,CACnC,GAAI,KAAK,aAAaA,CAAQ,GAAK,KACjC,MAAM,IAAI,MACN,yBAAA,OAAyBA,EAAQ,kCAAA,CAAkC,EAEzE,OAAO,KAAK,aAAaA,CAAQ,EAAE,aAAY,GAGjDN,EAAQ,UAAA,SAAR,SAASa,EAAY,CACnB,KAAK,MAAQ,OAAO,OAAO,CAAA,EAAIA,CAAK,GAGtCb,EAAA,UAAA,MAAA,UAAA,CACE,KAAK,MAAQ,CAAA,EACb,KAAK,SAAW,CAAA,EAChB,KAAK,iBAAgB,GAGfA,EAAA,UAAA,iBAAA,UAAA,CAAA,IAePc,EAAA,KAdC,GAAI,SAAO,KAAK,OAAW,KACvB,OAAO,KAAK,OAAO,SAAa,KAChC,OAAO,KAAK,OAAO,SAAS,OAAW,KAI3C,KAAMC,EAAY,KAAK,eAAe,KAAK,OAAO,SAAS,MAAM,EACjE,GAAIhB,MAA6BgB,EAAW,CAC1C,IAAMC,EAAYD,EAAUhB,EAAyB,EAAE,MAAM,GAAG,EAChEiB,EAAU,QAAQ,SAAAC,EAAQ,CAClB,IAAAP,EAAAjJ,EAAewJ,EAAS,MAAM,GAAG,EAAqB,CAAA,EAArDC,EAAGR,EAAA,CAAA,EAAEzK,EAAKyK,EAAA,CAAA,EACjBI,EAAK,SAASI,CAAG,EAAIC,GAAWD,EAAKjL,CAAK,CAC5C,CAAC,CACF,IAEJ+J,CAAA,GAAA,EAEK,SAAUE,GAAekB,EAAmB,CAChD,IAAMC,EAAS,CAAA,EACf,OAAAD,EAAY,QAAQ,8BAA+B,SAAC9J,EAAC,SAAMV,EAAA,CAAA,EAAA0K,EAAA,EAAJA,EAAI,UAAA,OAAJA,IAAA1K,EAAI0K,EAAA,CAAA,EAAA,UAAAA,CAAA,EACzD,OAAAC,GAAYF,EAAQzK,EAAE,CAAC,EAAGA,EAAE,CAAC,CAAC,EACvBA,EAAE,KAAK,GAAG,CACnB,CAAC,EACMyK,CACT,CAEA,SAASE,GACLF,EAAiCG,EAAcvL,EAAc,CAC/DoL,EAAO,mBAAmBG,CAAI,CAAC,EAAI,mBAAmBvL,GAAS,EAAE,CACnE,CAEA,SAASkL,GAAWb,EAAkBrK,EAAa,CACjD,IAAMwL,EAAiBxL,EAAM,YAAW,EACxC,OAAIwL,IAAmB,QAAUA,IAAmB,QAC3CA,IAAmB,OACjB,GAAA,OAAG,CAAEA,CAAc,IAAOA,EAC5B,CAACA,EAEDxL,CAEX,UAUgBoK,IAAG,CACjB,OAAOqB,EAAAA,GACT,CAEWA,EAAAA,IAAmB,KACxB,SAAUC,GAAqBC,EAAwB,CAC3DF,EAAAA,IAAME,CACR,CCrMA,IAAIC,YAEYC,IAAkB,CAChC,GAAID,IAAmB,KAAM,CAE3B,IAAIE,EAAO,OACX,GAAI,OAAQ,OAAY,IACtBA,EAAK,eACI,OAAQ,OAAY,IAC7BA,EAAK,eACI,OAAQ,QAAa,IAC9BA,EAAK,gBACI,OAAQ,KAAU,IAC3BA,EAAK,SAEL,OAAM,IAAI,MAAM,gCAAgC,EAElDF,GAAkBE,CACnB,CACD,OAAOF,EACT,CAGA,SAASG,IAAY,CACnB,IAAMD,EAAKD,GAAkB,EAC7B,OAAIC,EAAG,YAAc,OACnBA,EAAG,WAAa,IAAI,KAEfA,EAAG,UACZ,CASgB,SAAAE,GAAaf,EAAagB,EAAa,CACrD,IAAMC,EAAYH,GAAY,EAC9B,GAAIG,EAAU,IAAIjB,CAAG,EACnB,OAAOiB,EAAU,IAAIjB,CAAG,EAExB,IAAMkB,EAAYF,EAAI,EACtB,OAAAC,EAAU,IAAIjB,EAAKkB,CAAS,EACrBD,EAAU,IAAIjB,CAAG,CAE5B,CC1CO,IAAMmB,GAAM,MAGNC,GAAO,OAGPC,GAAQ,QAGRC,GAAM,MAGNC,GAAO,OAGPC,GAAM,MAONC,GAAM,MAONC,GAAS,SAMTC,GAAS,SAMTC,GAAO,OAGPC,GAAQ,QAGRC,GAAO,OAGPC,GAAQ,QAGRC,GAAQ,QAGRC,GAAU,UASVC,GAAc,cAQdC,GAAY,YAUZC,GAAgB,gBAShBC,GAAc,cAOdC,GAAiB,iBASjBC,GAAW,WAMXC,GAAa,aAGbC,GAAc,cAOdC,GAAgB,gBAGhBC,GAAO,OAMPC,GAAO,OAGPC,GAAc,cAOdC,GAAU,UAGVC,GAAa,aAGbC,GAAS,SAMTC,GAAS,SAUTC,GAAuB,uBAUvBC,GAAsB,sBAUtBC,GAAS,SASTC,GAAyB,yBASzBC,GAAwB,wBASxBC,GAAM,MAGNC,GAAO,OAGPC,GAAU,UAQVC,GAAS,SAQTC,GAAgB,gBAShBC,GAAgB,gBAOhBC,GAAe,eAOfC,GAAwB,wBAWxBC,GACT,sCAWSC,GACT,qCAWSC,GAAO,OAGPC,GAAa,aAQbC,GAA0B,0BAI1BC,GAA2B,2BAI3BC,GAAO,OAOPC,GAAU,UAGVC,GAAS,SAMTC,GAAM,MAGNC,GAAU,UAGVC,GAAM,MAGNC,GAAQ,QAGRC,GAAM,MAGNC,GAAa,aAMbC,GAAQ,QAGRC,GAAM,MAGNC,GAAO,OAOPC,GAAgB,gBAGhBC,GAAQ,QAGRC,GAAW,WAGXC,GAAiB,iBAOjBC,GAAW,WAOXC,GAAW,WAGXC,GAAU,UAGVC,GAAe,eAGfC,GAAW,WAGXC,GAAO,OAGPC,GAAO,OAGPC,GAAW,WAGXC,GAAQ,QAGRC,GAAQ,QAGRC,GAAY,YAMZC,GAAO,OAGPC,GAAY,YAGZC,GAAW,WAMXC,GAAM,MAGNC,GAAQ,QAGRC,GAAa,aAGbC,GAAa,aAGbC,GAAY,YAGZC,GAAa,aAGbC,GAAa,aAMbC,GAAa,aAIbC,GAAM,MASNC,GAAU,UASVC,GAAiB,iBAKjBC,GAAM,MAONC,GAAU,UAGVC,GAAU,UASVC,GAAc,cASdC,GAAY,YAUZC,GAAgB,gBAUhBC,GAAoB,oBASpBC,GAAO,OAOPC,GAAM,MAONC,GAAU,UAGVC,GAAY,YAOZC,GAAM,MAGNC,GAAc,cAQdC,GAAW,WAGXC,GAAM,MAGNC,GAAW,WAGXC,GAAsB,sBAStBC,GAAsB,sBAUtBC,GAAsB,sBAUtBC,GAAW,WAGXC,GAAS,SASTC,GAAO,OAMPC,GAAQ,QAORC,GAAO,OAGPC,GAAM,MAGNC,GAAQ,QAGRC,GAAO,OAOPC,GAAe,eAQfC,GAAc,cAIdC,GAAuB,uBAQvBC,GAAQ,QAQRC,GAAO,OAGPC,GAAa,aAGbC,GAAO,OAGPC,GAAU,UAMVC,GAAwB,wBAQxBC,GAA4B,4BAK5BC,GAAiB,iBAQjBC,GAAqB,qBAIrBC,GAAQ,QAGRC,GAAU,UAMVC,GAAQ,QAGRC,GAAQ,QAGRC,GAAY,YAMZC,GAAsB,sBAKtBC,GAAe,eAOfC,GAAS,SAGTC,GAAO,OAGPC,GAAQ,QAMRC,GAAM,MAGNC,GAAO,OAGPC,GAAO,OAGPC,GAAU,UAGVC,GAAW,WAGXC,GAAO,OAGPC,GAAM,MAONC,GAAiB,iBAOjBC,GAAS,SAOTC,GAAU,UAMVC,GAAsB,sBAItBC,GAAgB,gBAIhBC,GAAoB,oBAIpBC,GAAmB,mBAInBC,GAAgB,gBAOhBC,GAAoB,oBAGpBC,GAAS,SAGTC,GAAqB,qBAQrBC,GAAe,eAafC,GAAe,eAWfC,GAAc,cAMdC,GAAyB,yBAMzBC,GAAM,MAGNC,GAAM,MAGNC,GAAO,OAGPC,GAAO,OAMPC,GAAO,OAOPC,GAAY,YASZC,GAAY,YAMZC,GAAS,SAQTC,GAAS,SAMTC,GAAqB,qBAOrBC,GAAa,aAIbC,GAAY,YAMZC,GAAO,OAMPC,GAAa,aASbC,GAAmB,mBAQnBC,GAAe,eAgBfC,GAAc,cAiBdC,GAAuB,gCCr/BpBC,IAAI,SAAkB/S,EAAA,CAAA,EAAA4G,EAAA,EAAjBA,EAAiB,UAAA,OAAjBA,IAAA5G,EAAiB4G,CAAA,EAAA,UAAAA,CAAA,EAC9BjB,GAAG,EAAG,QAAQ,SAAS,GAAKA,GAAG,EAAG,QAAQ,MAAM,GACpD,QAAQ,KAAI,MAAZ,QAAOxI,GAAA,CAAA,EAAAJ,EAASiD,CAAG,EAAE,EAAA,CAAA,CAEzB,UAEgBgT,IAAG,SAAkBhT,EAAA,CAAA,EAAA4G,EAAA,EAAjBA,EAAiB,UAAA,OAAjBA,IAAA5G,EAAiB4G,CAAA,EAAA,UAAAA,CAAA,EAC7BjB,GAAG,EAAG,QAAQ,SAAS,GAAKA,GAAG,EAAG,QAAQ,MAAM,GACpD,QAAQ,IAAG,MAAX,QAAOxI,GAAA,CAAA,EAAAJ,EAAQiD,CAAG,EAAE,EAAA,CAAA,CAExB,CCLA,IAAMiT,GACJ1L,GAAU,iBAAkB,UAAA,CAAM,OAAA,IAAI,GAAJ,CACjB,EACb2L,GACJ3L,GAAU,eAAgB,UAAA,CAAM,OAAA,IAAI,GAAJ,CAA6B,EA2D/C,SAAA4L,GACZ7U,EAAoB8U,EAAmB,CACzC,IAAM5M,EAAM6M,GAAQ/U,EAAY8U,CAAW,EAC3C,OAAOH,GAAe,IAAIzM,CAAG,CAC/B,CAMM,SAAU8M,GAAYhV,EAAkB,CAC5C,OAAO4U,GAAa,IAAI5U,CAAU,CACpC,CAEM,SAAUiV,GAAqBH,EAAmB,CAItD,QAHMI,EAAKP,GAAe,QAAO,EAC3BnX,EAAyB,CAAA,IAElB,CACL,IAAAkK,EAAgBwN,EAAG,KAAI,EAAtBC,EAAIzN,EAAA,KAAEzK,EAAKyK,EAAA,MAClB,GAAIyN,EACF,MAEI,IAAAxN,EAAAlJ,EAAgBxB,EAAK,CAAA,EAApBiL,EAAGP,EAAA,CAAA,EAAEyN,EAAMzN,EAAA,CAAA,EACZC,EAAAnJ,EAAcyJ,EAAI,MAAM,GAAG,EAAC,CAAA,EAA3B7I,EAAOuI,EAAA,CAAA,EACVvI,IAAYyV,GACdtX,EAAO,KAAK4X,CAAM,CAErB,CACD,OAAO5X,CACT,CAaM,SAAU6X,GAAeD,EAAoB,CAC1C,IAAApV,EAA2BoV,EAAM,WAArBN,EAAeM,EAAM,YAClClN,EAAM6M,GAAQ/U,EAAY8U,CAAW,EACvCH,GAAe,IAAIzM,CAAG,GACxBoN,GACI,eAAA,OAAetV,EAA0B,gBAAA,EACzC,IAAI,OAAA8U,EAAoC,yBAAA,CAAA,EAE9CH,GAAe,IAAIzM,EAAKkN,CAAM,CAChC,CAUM,SAAUG,GAAiBH,EAAkB,CAC1C,IAAApV,EAAcoV,EAAM,WAEvBR,GAAa,IAAI5U,CAAU,GAGzBqH,GAAG,EAAG,QAAQ,OAAO,GACvBiO,GAAS,gCAAA,OAAgCtV,EAAU,GAAA,CAAG,EAG1D4U,GAAa,IAAI5U,EAAYoV,CAAM,CACrC,CASgB,SAAAI,GACZxV,EAAoB8U,EAAmB,CACzC,IAAM5M,EAAM6M,GAAQ/U,EAAY8U,CAAW,EAC3C,GAAI,CAACH,GAAe,IAAIzM,CAAG,EACzB,MAAM,IAAI,MACN,eAAA,OAAelI,EAA0B,gBAAA,EACzC,IAAI,OAAA8U,EAAgC,qBAAA,CAAA,EAE1CH,GAAe,OAAOzM,CAAG,CAC3B,CAGM,SAAUuN,GAAmBzV,EAAkB,CACnD,GAAI,CAAC4U,GAAa,IAAI5U,CAAU,EAC9B,MAAM,IAAI,MACN,iBAAA,OAAiBA,EAAU,iCAAA,CAAiC,EAElE4U,GAAa,OAAO5U,CAAU,CAChC,CAQgB,SAAA0V,GACZC,EAA+BC,EAAsB,CACvD,IAAMC,EAAUZ,GAAqBU,CAAqB,EAC1DE,EAAQ,QAAQ,SAAAC,EAAY,CAC1B,IAAMC,EACF,OAAO,OAAO,CAAA,EAAID,EAAc,CAAC,YAAaF,CAAc,CAAC,EACjEP,GAAeU,CAAe,CAChC,CAAC,CACH,CAEA,SAAShB,GAAQ/U,EACA8U,EAAmB,CAClC,MAAO,GAAG,OAAAA,EAAe,GAAA,EAAA,OAAA9U,CAAU,CACrC,CC/LM,SAAUgW,GAAoB3U,EAAU,CAE5C,OAAOA,aAAa,cAAgBA,aAAa,YAC/CA,aAAa,YAAcA,aAAa,iBAC5C,4NCrBA4U,GAAiBC,GAKbC,GAAO,KAEX,GAAI,CACFA,GAAO,IAAI,YAAY,SAAS,IAAI,YAAY,OAAO,IAAI,WAAW,CACpE,EAAG,GAAI,IAAK,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,IAAK,IAAK,IAAK,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,IAAK,IAAK,EAAG,EAAG,EAAG,IAAK,IAAK,IAAK,GAAI,IAAK,EAAG,EAAG,EAAG,IAAK,IAAK,IAAK,GAAI,IAAK,EAAG,EAAG,EAAG,IAAK,IAAK,IAAK,GAAI,IAAK,EAAG,EAAG,EAAG,IAAK,IAAK,IAAK,GAAI,IAAK,EAAG,EAAG,EAAG,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,IAAK,EAAG,EAAG,GAAI,IAAK,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,EAAG,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,GAAI,EAAG,IAAK,GAAI,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,EAAG,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,GAAI,EAAG,IAAK,GAAI,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,EAAG,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,GAAI,EAAG,IAAK,GAAI,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,EAAG,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,GAAI,EAAG,IAAK,GAAI,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,EAAG,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,GAAI,EAAG,IAAK,EAC3nC,CAAA,CAAC,EAAG,CAAA,CAAE,EAAE,OACV,MAAW,CAEX,CAYD,SAASD,GAAKE,EAAKC,EAAMC,EAAQ,CAM7B,KAAK,IAAMF,EAAM,EAMjB,KAAK,KAAOC,EAAO,EAMnB,KAAK,SAAW,CAAC,CAACC,CACtB,CAyBAJ,GAAK,UAAU,WAEf,OAAO,eAAeA,GAAK,UAAW,aAAc,CAAE,MAAO,EAAI,CAAE,EAQnE,SAASK,GAAOC,EAAG,CACf,OAAQA,GAAOA,EAAI,cAAmB,EAC1C,CAQAN,GAAK,OAASK,GAOd,IAAIE,GAAY,CAAA,EAOZC,GAAa,CAAA,EAQjB,SAASC,GAAQ1Z,EAAOqZ,EAAQ,CAC5B,IAAIE,EAAKI,EAAWC,EACpB,OAAIP,GACArZ,KAAW,GACP4Z,EAAS,GAAK5Z,GAASA,EAAQ,OAC/B2Z,EAAYF,GAAWzZ,CAAK,EACxB2Z,GACOA,GAEfJ,EAAMM,GAAS7Z,GAAQA,EAAQ,GAAK,EAAI,GAAK,EAAG,EAAI,EAChD4Z,IACAH,GAAWzZ,CAAK,EAAIuZ,GACjBA,KAEPvZ,GAAS,GACL4Z,EAAS,MAAQ5Z,GAASA,EAAQ,OAClC2Z,EAAYH,GAAUxZ,CAAK,EACvB2Z,GACOA,GAEfJ,EAAMM,GAAS7Z,EAAOA,EAAQ,EAAI,GAAK,EAAG,EAAK,EAC3C4Z,IACAJ,GAAUxZ,CAAK,EAAIuZ,GAChBA,GAEf,CASAN,GAAK,QAAUS,GAQf,SAASI,GAAW9Z,EAAOqZ,EAAQ,CAC/B,GAAI,MAAMrZ,CAAK,EACX,OAAOqZ,EAAWU,GAAQC,GAC9B,GAAIX,EAAU,CACV,GAAIrZ,EAAQ,EACR,OAAO+Z,GACX,GAAI/Z,GAASia,GACT,OAAOC,EACd,KAAM,CACH,GAAIla,GAAS,CAACma,GACV,OAAOC,GACX,GAAIpa,EAAQ,GAAKma,GACb,OAAOE,EACd,CACD,OAAIra,EAAQ,EACD8Z,GAAW,CAAC9Z,EAAOqZ,CAAQ,EAAE,IAAG,EACpCQ,GAAU7Z,EAAQsa,GAAkB,EAAIta,EAAQsa,GAAkB,EAAGjB,CAAQ,CACxF,CASAJ,GAAK,WAAaa,GASlB,SAASD,GAASU,EAASC,EAAUnB,EAAQ,CACzC,OAAO,IAAIJ,GAAKsB,EAASC,EAAUnB,CAAQ,CAC/C,CAWAJ,GAAK,SAAWY,GAShB,IAAIY,GAAU,KAAK,IASnB,SAASC,GAAWC,EAAKtB,EAAUuB,EAAK,CACpC,GAAID,EAAI,SAAW,EACf,MAAM,MAAM,cAAc,EAC9B,GAAIA,IAAQ,OAASA,IAAQ,YAAcA,IAAQ,aAAeA,IAAQ,YACtE,OAAOX,GASX,GARI,OAAOX,GAAa,UAEpBuB,EAAQvB,EACRA,EAAW,IAEXA,EAAW,CAAC,CAAEA,EAElBuB,EAAQA,GAAS,GACbA,EAAQ,GAAK,GAAKA,EAClB,MAAM,WAAW,OAAO,EAE5B,IAAIrb,EACJ,IAAKA,EAAIob,EAAI,QAAQ,GAAG,GAAK,EACzB,MAAM,MAAM,iBAAiB,EAC5B,GAAIpb,IAAM,EACX,OAAOmb,GAAWC,EAAI,UAAU,CAAC,EAAGtB,EAAUuB,CAAK,EAAE,IAAG,EAQ5D,QAHIC,EAAef,GAAWW,GAAQG,EAAO,CAAC,CAAC,EAE3Cra,EAASyZ,GACJzY,EAAI,EAAGA,EAAIoZ,EAAI,OAAQpZ,GAAK,EAAG,CACpC,IAAI0D,EAAO,KAAK,IAAI,EAAG0V,EAAI,OAASpZ,CAAC,EACjCvB,EAAQ,SAAS2a,EAAI,UAAUpZ,EAAGA,EAAI0D,CAAI,EAAG2V,CAAK,EACtD,GAAI3V,EAAO,EAAG,CACV,IAAI6V,EAAQhB,GAAWW,GAAQG,EAAO3V,CAAI,CAAC,EAC3C1E,EAASA,EAAO,IAAIua,CAAK,EAAE,IAAIhB,GAAW9Z,CAAK,CAAC,CACnD,MACGO,EAASA,EAAO,IAAIsa,CAAY,EAChCta,EAASA,EAAO,IAAIuZ,GAAW9Z,CAAK,CAAC,CAE5C,CACD,OAAAO,EAAO,SAAW8Y,EACX9Y,CACX,CAUA0Y,GAAK,WAAayB,GASlB,SAASK,GAAUnX,EAAKyV,EAAQ,CAC5B,OAAI,OAAOzV,GAAQ,SACRkW,GAAWlW,EAAKyV,CAAQ,EAC/B,OAAOzV,GAAQ,SACR8W,GAAW9W,EAAKyV,CAAQ,EAE5BQ,GAASjW,EAAI,IAAKA,EAAI,KAAM,OAAOyV,GAAa,UAAYA,EAAWzV,EAAI,QAAQ,CAC9F,CASAqV,GAAK,UAAY8B,GAUjB,IAAIC,GAAiB,MAOjBC,GAAiB,GAAK,GAOtBX,GAAiBU,GAAiBA,GAOlCf,GAAiBK,GAAiBA,GAOlCH,GAAiBF,GAAiB,EAOlCiB,GAAaxB,GAAQuB,EAAc,EAMnCjB,GAAON,GAAQ,CAAC,EAMpBT,GAAK,KAAOe,GAMZ,IAAID,GAAQL,GAAQ,EAAG,EAAI,EAM3BT,GAAK,MAAQc,GAMb,IAAIoB,GAAMzB,GAAQ,CAAC,EAMnBT,GAAK,IAAMkC,GAMX,IAAIC,GAAO1B,GAAQ,EAAG,EAAI,EAM1BT,GAAK,KAAOmC,GAMZ,IAAIC,GAAU3B,GAAQ,EAAE,EAMxBT,GAAK,QAAUoC,GAMf,IAAIhB,GAAYR,GAAS,GAAc,WAAc,EAAK,EAM1DZ,GAAK,UAAYoB,GAMjB,IAAIH,GAAqBL,GAAS,GAAc,GAAc,EAAI,EAMlEZ,GAAK,mBAAqBiB,GAM1B,IAAIE,GAAYP,GAAS,EAAG,YAAc,EAAK,EAM/CZ,GAAK,UAAYmB,GAMjB,IAAIkB,EAAgBrC,GAAK,UAMzBqC,EAAc,MAAQ,UAAc,CAChC,OAAO,KAAK,SAAW,KAAK,MAAQ,EAAI,KAAK,GACjD,EAMAA,EAAc,SAAW,UAAiB,CACtC,OAAI,KAAK,UACI,KAAK,OAAS,GAAKhB,IAAmB,KAAK,MAAQ,GACzD,KAAK,KAAOA,IAAkB,KAAK,MAAQ,EACtD,EASAgB,EAAc,SAAW,SAAkBV,EAAK,CAE5C,GADAA,EAAQA,GAAS,GACbA,EAAQ,GAAK,GAAKA,EAClB,MAAM,WAAW,OAAO,EAC5B,GAAI,KAAK,OAAM,EACX,MAAO,IACX,GAAI,KAAK,WAAU,EACf,GAAI,KAAK,GAAGR,EAAS,EAAG,CAGpB,IAAImB,EAAYzB,GAAWc,CAAK,EAC5BY,EAAM,KAAK,IAAID,CAAS,EACxBE,EAAOD,EAAI,IAAID,CAAS,EAAE,IAAI,IAAI,EACtC,OAAOC,EAAI,SAASZ,CAAK,EAAIa,EAAK,MAAK,EAAG,SAASb,CAAK,CAC3D,KACG,OAAO,IAAM,KAAK,IAAG,EAAG,SAASA,CAAK,EAQ9C,QAHIC,EAAef,GAAWW,GAAQG,EAAO,CAAC,EAAG,KAAK,QAAQ,EAC1Dc,EAAM,KACNnb,EAAS,KACA,CACT,IAAIob,EAASD,EAAI,IAAIb,CAAY,EAC7Be,EAASF,EAAI,IAAIC,EAAO,IAAId,CAAY,CAAC,EAAE,MAAK,IAAO,EACvDgB,EAASD,EAAO,SAAShB,CAAK,EAElC,GADAc,EAAMC,EACFD,EAAI,OAAM,EACV,OAAOG,EAAStb,EAEhB,KAAOsb,EAAO,OAAS,GACnBA,EAAS,IAAMA,EACnBtb,EAAS,GAAKsb,EAAStb,CAE9B,CACL,EAMA+a,EAAc,YAAc,UAAoB,CAC5C,OAAO,KAAK,IAChB,EAMAA,EAAc,oBAAsB,UAA4B,CAC5D,OAAO,KAAK,OAAS,CACzB,EAMAA,EAAc,WAAa,UAAmB,CAC1C,OAAO,KAAK,GAChB,EAMAA,EAAc,mBAAqB,UAA2B,CAC1D,OAAO,KAAK,MAAQ,CACxB,EAMAA,EAAc,cAAgB,UAAsB,CAChD,GAAI,KAAK,WAAU,EACf,OAAO,KAAK,GAAGlB,EAAS,EAAI,GAAK,KAAK,IAAG,EAAG,cAAa,EAE7D,QADIxW,EAAM,KAAK,MAAQ,EAAI,KAAK,KAAO,KAAK,IACnCkY,EAAM,GAAIA,EAAM,IAChBlY,EAAO,GAAKkY,IAAS,EADFA,IACxB,CAEJ,OAAO,KAAK,MAAQ,EAAIA,EAAM,GAAKA,EAAM,CAC7C,EAMAR,EAAc,OAAS,UAAe,CAClC,OAAO,KAAK,OAAS,GAAK,KAAK,MAAQ,CAC3C,EAMAA,EAAc,IAAMA,EAAc,OAMlCA,EAAc,WAAa,UAAmB,CAC1C,MAAO,CAAC,KAAK,UAAY,KAAK,KAAO,CACzC,EAMAA,EAAc,WAAa,UAAmB,CAC1C,OAAO,KAAK,UAAY,KAAK,MAAQ,CACzC,EAMAA,EAAc,MAAQ,UAAc,CAChC,OAAQ,KAAK,IAAM,KAAO,CAC9B,EAMAA,EAAc,OAAS,UAAe,CAClC,OAAQ,KAAK,IAAM,KAAO,CAC9B,EAOAA,EAAc,OAAS,SAAgBS,EAAK,CAGxC,OAFKzC,GAAOyC,CAAK,IACbA,EAAQhB,GAAUgB,CAAK,GACvB,KAAK,WAAaA,EAAM,UAAa,KAAK,OAAS,KAAQ,GAAMA,EAAM,OAAS,KAAQ,EACjF,GACJ,KAAK,OAASA,EAAM,MAAQ,KAAK,MAAQA,EAAM,GAC1D,EAQAT,EAAc,GAAKA,EAAc,OAOjCA,EAAc,UAAY,SAAmBS,EAAK,CAC9C,MAAO,CAAC,KAAK,GAAmBA,CAAK,CACzC,EAQAT,EAAc,IAAMA,EAAc,UAQlCA,EAAc,GAAKA,EAAc,UAOjCA,EAAc,SAAW,SAAkBS,EAAK,CAC5C,OAAO,KAAK,KAAqBA,CAAK,EAAI,CAC9C,EAQAT,EAAc,GAAKA,EAAc,SAOjCA,EAAc,gBAAkB,SAAyBS,EAAK,CAC1D,OAAO,KAAK,KAAqBA,CAAK,GAAK,CAC/C,EAQAT,EAAc,IAAMA,EAAc,gBAQlCA,EAAc,GAAKA,EAAc,gBAOjCA,EAAc,YAAc,SAAqBS,EAAK,CAClD,OAAO,KAAK,KAAqBA,CAAK,EAAI,CAC9C,EAQAT,EAAc,GAAKA,EAAc,YAOjCA,EAAc,mBAAqB,SAA4BS,EAAK,CAChE,OAAO,KAAK,KAAqBA,CAAK,GAAK,CAC/C,EAQAT,EAAc,IAAMA,EAAc,mBAQlCA,EAAc,GAAKA,EAAc,mBAQjCA,EAAc,QAAU,SAAiBS,EAAK,CAG1C,GAFKzC,GAAOyC,CAAK,IACbA,EAAQhB,GAAUgB,CAAK,GACvB,KAAK,GAAGA,CAAK,EACb,MAAO,GACX,IAAIC,EAAU,KAAK,WAAU,EACzBC,EAAWF,EAAM,WAAU,EAC/B,OAAIC,GAAW,CAACC,EACL,GACP,CAACD,GAAWC,EACL,EAEN,KAAK,SAGFF,EAAM,OAAS,EAAM,KAAK,OAAS,GAAOA,EAAM,OAAS,KAAK,MAASA,EAAM,MAAQ,EAAM,KAAK,MAAQ,EAAM,GAAK,EAFhH,KAAK,IAAIA,CAAK,EAAE,WAAU,EAAK,GAAK,CAGnD,EASAT,EAAc,KAAOA,EAAc,QAMnCA,EAAc,OAAS,UAAe,CAClC,MAAI,CAAC,KAAK,UAAY,KAAK,GAAGlB,EAAS,EAC5BA,GACJ,KAAK,IAAG,EAAG,IAAIe,EAAG,CAC7B,EAOAG,EAAc,IAAMA,EAAc,OAOlCA,EAAc,IAAM,SAAaY,EAAM,CAC9B5C,GAAO4C,CAAM,IACdA,EAASnB,GAAUmB,CAAM,GAI7B,IAAIC,EAAM,KAAK,OAAS,GACpBC,EAAM,KAAK,KAAO,MAClBC,EAAM,KAAK,MAAQ,GACnBC,EAAM,KAAK,IAAM,MAEjBC,EAAML,EAAO,OAAS,GACtBM,EAAMN,EAAO,KAAO,MACpBO,EAAMP,EAAO,MAAQ,GACrBQ,EAAMR,EAAO,IAAM,MAEnBS,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EACrC,OAAAA,GAAOR,EAAMI,EACbG,GAAOC,IAAQ,GACfA,GAAO,MACPD,GAAOR,EAAMI,EACbG,GAAOC,IAAQ,GACfA,GAAO,MACPD,GAAOR,EAAMI,EACbG,GAAOC,IAAQ,GACfA,GAAO,MACPD,GAAOR,EAAMI,EACbI,GAAO,MACA9C,GAAUgD,GAAO,GAAMC,EAAMH,GAAO,GAAMC,EAAK,KAAK,QAAQ,CACvE,EAOAtB,EAAc,SAAW,SAAkByB,EAAU,CACjD,OAAKzD,GAAOyD,CAAU,IAClBA,EAAahC,GAAUgC,CAAU,GAC9B,KAAK,IAAIA,EAAW,IAAG,CAAE,CACpC,EAQAzB,EAAc,IAAMA,EAAc,SAOlCA,EAAc,SAAW,SAAkB0B,EAAU,CACjD,GAAI,KAAK,OAAM,EACX,OAAOhD,GAKX,GAJKV,GAAO0D,CAAU,IAClBA,EAAajC,GAAUiC,CAAU,GAGjC9D,GAAM,CACN,IAAIC,EAAMD,GAAK,IAAI,KAAK,IACL,KAAK,KACL8D,EAAW,IACXA,EAAW,IAAI,EAClC,OAAOnD,GAASV,EAAKD,GAAK,SAAQ,EAAI,KAAK,QAAQ,CACtD,CAED,GAAI8D,EAAW,OAAM,EACjB,OAAOhD,GACX,GAAI,KAAK,GAAGI,EAAS,EACjB,OAAO4C,EAAW,MAAK,EAAK5C,GAAYJ,GAC5C,GAAIgD,EAAW,GAAG5C,EAAS,EACvB,OAAO,KAAK,MAAK,EAAKA,GAAYJ,GAEtC,GAAI,KAAK,WAAU,EACf,OAAIgD,EAAW,WAAU,EACd,KAAK,IAAG,EAAG,IAAIA,EAAW,IAAG,CAAE,EAE/B,KAAK,IAAG,EAAG,IAAIA,CAAU,EAAE,IAAG,EACtC,GAAIA,EAAW,WAAU,EAC5B,OAAO,KAAK,IAAIA,EAAW,IAAG,CAAE,EAAE,IAAG,EAGzC,GAAI,KAAK,GAAG9B,EAAU,GAAK8B,EAAW,GAAG9B,EAAU,EAC/C,OAAOpB,GAAW,KAAK,SAAQ,EAAKkD,EAAW,SAAQ,EAAI,KAAK,QAAQ,EAK5E,IAAIb,EAAM,KAAK,OAAS,GACpBC,EAAM,KAAK,KAAO,MAClBC,EAAM,KAAK,MAAQ,GACnBC,EAAM,KAAK,IAAM,MAEjBC,EAAMS,EAAW,OAAS,GAC1BR,EAAMQ,EAAW,KAAO,MACxBP,EAAMO,EAAW,MAAQ,GACzBN,EAAMM,EAAW,IAAM,MAEvBL,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EACrC,OAAAA,GAAOR,EAAMI,EACbG,GAAOC,IAAQ,GACfA,GAAO,MACPD,GAAOR,EAAMK,EACbE,GAAOC,IAAQ,GACfA,GAAO,MACPA,GAAOP,EAAMG,EACbG,GAAOC,IAAQ,GACfA,GAAO,MACPD,GAAOR,EAAMM,EACbC,GAAOC,IAAQ,GACfA,GAAO,MACPA,GAAOP,EAAMI,EACbE,GAAOC,IAAQ,GACfA,GAAO,MACPA,GAAON,EAAME,EACbG,GAAOC,IAAQ,GACfA,GAAO,MACPD,GAAOR,EAAMO,EAAMN,EAAMK,EAAMJ,EAAMG,EAAMF,EAAMC,EACjDI,GAAO,MACA9C,GAAUgD,GAAO,GAAMC,EAAMH,GAAO,GAAMC,EAAK,KAAK,QAAQ,CACvE,EAQAtB,EAAc,IAAMA,EAAc,SAQlCA,EAAc,OAAS,SAAgB2B,EAAO,CAG1C,GAFK3D,GAAO2D,CAAO,IACfA,EAAUlC,GAAUkC,CAAO,GAC3BA,EAAQ,OAAM,EACd,MAAM,MAAM,kBAAkB,EAGlC,GAAI/D,GAAM,CAIN,GAAI,CAAC,KAAK,UACN,KAAK,OAAS,aACd+D,EAAQ,MAAQ,IAAMA,EAAQ,OAAS,GAEvC,OAAO,KAEX,IAAI9D,GAAO,KAAK,SAAWD,GAAK,MAAQA,GAAK,OACzC,KAAK,IACL,KAAK,KACL+D,EAAQ,IACRA,EAAQ,IAAI,EAEhB,OAAOpD,GAASV,EAAKD,GAAK,SAAQ,EAAI,KAAK,QAAQ,CACtD,CAED,GAAI,KAAK,OAAM,EACX,OAAO,KAAK,SAAWa,GAAQC,GACnC,IAAIkD,EAAQxB,EAAKyB,EACjB,GAAK,KAAK,SA6BH,CAKH,GAFKF,EAAQ,WACTA,EAAUA,EAAQ,WAAU,GAC5BA,EAAQ,GAAG,IAAI,EACf,OAAOlD,GACX,GAAIkD,EAAQ,GAAG,KAAK,KAAK,CAAC,CAAC,EACvB,OAAO7B,GACX+B,EAAMpD,EACT,KAvCmB,CAGhB,GAAI,KAAK,GAAGK,EAAS,EAAG,CACpB,GAAI6C,EAAQ,GAAG9B,EAAG,GAAK8B,EAAQ,GAAG5B,EAAO,EACrC,OAAOjB,GACN,GAAI6C,EAAQ,GAAG7C,EAAS,EACzB,OAAOe,GAGP,IAAIiC,EAAW,KAAK,IAAI,CAAC,EAEzB,OADAF,EAASE,EAAS,IAAIH,CAAO,EAAE,IAAI,CAAC,EAChCC,EAAO,GAAGlD,EAAI,EACPiD,EAAQ,WAAU,EAAK9B,GAAME,IAEpCK,EAAM,KAAK,IAAIuB,EAAQ,IAAIC,CAAM,CAAC,EAClCC,EAAMD,EAAO,IAAIxB,EAAI,IAAIuB,CAAO,CAAC,EAC1BE,EAGlB,SAAUF,EAAQ,GAAG7C,EAAS,EAC3B,OAAO,KAAK,SAAWL,GAAQC,GACnC,GAAI,KAAK,WAAU,EACf,OAAIiD,EAAQ,WAAU,EACX,KAAK,IAAG,EAAG,IAAIA,EAAQ,IAAG,CAAE,EAChC,KAAK,IAAG,EAAG,IAAIA,CAAO,EAAE,IAAG,EAC/B,GAAIA,EAAQ,WAAU,EACzB,OAAO,KAAK,IAAIA,EAAQ,IAAG,CAAE,EAAE,IAAG,EACtCE,EAAMnD,EACT,CAkBD,IADA0B,EAAM,KACCA,EAAI,IAAIuB,CAAO,GAAG,CAGrBC,EAAS,KAAK,IAAI,EAAG,KAAK,MAAMxB,EAAI,SAAQ,EAAKuB,EAAQ,SAAQ,CAAE,CAAC,EAWpE,QAPII,EAAO,KAAK,KAAK,KAAK,IAAIH,CAAM,EAAI,KAAK,GAAG,EAC5CI,EAASD,GAAQ,GAAM,EAAI5C,GAAQ,EAAG4C,EAAO,EAAE,EAI/CE,EAAYzD,GAAWoD,CAAM,EAC7BM,EAAYD,EAAU,IAAIN,CAAO,EAC9BO,EAAU,WAAU,GAAMA,EAAU,GAAG9B,CAAG,GAC7CwB,GAAUI,EACVC,EAAYzD,GAAWoD,EAAQ,KAAK,QAAQ,EAC5CM,EAAYD,EAAU,IAAIN,CAAO,EAKjCM,EAAU,OAAM,IAChBA,EAAYpC,IAEhBgC,EAAMA,EAAI,IAAII,CAAS,EACvB7B,EAAMA,EAAI,IAAI8B,CAAS,CAC1B,CACD,OAAOL,CACX,EAQA7B,EAAc,IAAMA,EAAc,OAOlCA,EAAc,OAAS,SAAgB2B,EAAO,CAK1C,GAJK3D,GAAO2D,CAAO,IACfA,EAAUlC,GAAUkC,CAAO,GAG3B/D,GAAM,CACN,IAAIC,GAAO,KAAK,SAAWD,GAAK,MAAQA,GAAK,OACzC,KAAK,IACL,KAAK,KACL+D,EAAQ,IACRA,EAAQ,IAAI,EAEhB,OAAOpD,GAASV,EAAKD,GAAK,SAAQ,EAAI,KAAK,QAAQ,CACtD,CAED,OAAO,KAAK,IAAI,KAAK,IAAI+D,CAAO,EAAE,IAAIA,CAAO,CAAC,CAClD,EAQA3B,EAAc,IAAMA,EAAc,OAQlCA,EAAc,IAAMA,EAAc,OAMlCA,EAAc,IAAM,UAAY,CAC5B,OAAOzB,GAAS,CAAC,KAAK,IAAK,CAAC,KAAK,KAAM,KAAK,QAAQ,CACxD,EAOAyB,EAAc,IAAM,SAAaS,EAAK,CAClC,OAAKzC,GAAOyC,CAAK,IACbA,EAAQhB,GAAUgB,CAAK,GACpBlC,GAAS,KAAK,IAAMkC,EAAM,IAAK,KAAK,KAAOA,EAAM,KAAM,KAAK,QAAQ,CAC/E,EAOAT,EAAc,GAAK,SAAYS,EAAK,CAChC,OAAKzC,GAAOyC,CAAK,IACbA,EAAQhB,GAAUgB,CAAK,GACpBlC,GAAS,KAAK,IAAMkC,EAAM,IAAK,KAAK,KAAOA,EAAM,KAAM,KAAK,QAAQ,CAC/E,EAOAT,EAAc,IAAM,SAAaS,EAAK,CAClC,OAAKzC,GAAOyC,CAAK,IACbA,EAAQhB,GAAUgB,CAAK,GACpBlC,GAAS,KAAK,IAAMkC,EAAM,IAAK,KAAK,KAAOA,EAAM,KAAM,KAAK,QAAQ,CAC/E,EAOAT,EAAc,UAAY,SAAmBmC,EAAO,CAGhD,OAFInE,GAAOmE,CAAO,IACdA,EAAUA,EAAQ,MAAK,IACtBA,GAAW,MAAQ,EACb,KACFA,EAAU,GACR5D,GAAS,KAAK,KAAO4D,EAAU,KAAK,MAAQA,EAAY,KAAK,MAAS,GAAKA,EAAW,KAAK,QAAQ,EAEnG5D,GAAS,EAAG,KAAK,KAAQ4D,EAAU,GAAK,KAAK,QAAQ,CACpE,EAQAnC,EAAc,IAAMA,EAAc,UAOlCA,EAAc,WAAa,SAAoBmC,EAAO,CAGlD,OAFInE,GAAOmE,CAAO,IACdA,EAAUA,EAAQ,MAAK,IACtBA,GAAW,MAAQ,EACb,KACFA,EAAU,GACR5D,GAAU,KAAK,MAAQ4D,EAAY,KAAK,MAAS,GAAKA,EAAW,KAAK,MAAQA,EAAS,KAAK,QAAQ,EAEpG5D,GAAS,KAAK,MAAS4D,EAAU,GAAK,KAAK,MAAQ,EAAI,EAAI,GAAI,KAAK,QAAQ,CAC3F,EAQAnC,EAAc,IAAMA,EAAc,WAOlCA,EAAc,mBAAqB,SAA4BmC,EAAO,CAIlE,GAHInE,GAAOmE,CAAO,IACdA,EAAUA,EAAQ,MAAK,GAC3BA,GAAW,GACPA,IAAY,EACZ,OAAO,KAEP,IAAIrE,EAAO,KAAK,KAChB,GAAIqE,EAAU,GAAI,CACd,IAAItE,EAAM,KAAK,IACf,OAAOU,GAAUV,IAAQsE,EAAYrE,GAAS,GAAKqE,EAAWrE,IAASqE,EAAS,KAAK,QAAQ,CAChG,KAAM,QAAIA,IAAY,GACZ5D,GAAST,EAAM,EAAG,KAAK,QAAQ,EAE/BS,GAAST,IAAUqE,EAAU,GAAK,EAAG,KAAK,QAAQ,CAErE,EAQAnC,EAAc,KAAOA,EAAc,mBAQnCA,EAAc,MAAQA,EAAc,mBAMpCA,EAAc,SAAW,UAAiB,CACtC,OAAK,KAAK,SAEHzB,GAAS,KAAK,IAAK,KAAK,KAAM,EAAK,EAD/B,IAEf,EAMAyB,EAAc,WAAa,UAAmB,CAC1C,OAAI,KAAK,SACE,KACJzB,GAAS,KAAK,IAAK,KAAK,KAAM,EAAI,CAC7C,EAOAyB,EAAc,QAAU,SAAiBoC,EAAE,CACvC,OAAOA,EAAK,KAAK,UAAS,EAAK,KAAK,UAAS,CACjD,EAMApC,EAAc,UAAY,UAAkB,CACxC,IAAIqC,EAAK,KAAK,KACVC,EAAK,KAAK,IACd,MAAO,CACHA,EAAY,IACZA,IAAQ,EAAI,IACZA,IAAO,GAAK,IACZA,IAAO,GACPD,EAAY,IACZA,IAAQ,EAAI,IACZA,IAAO,GAAK,IACZA,IAAO,GAEf,EAMArC,EAAc,UAAY,UAAkB,CACxC,IAAIqC,EAAK,KAAK,KACVC,EAAK,KAAK,IACd,MAAO,CACHD,IAAO,GACPA,IAAO,GAAK,IACZA,IAAQ,EAAI,IACZA,EAAY,IACZC,IAAO,GACPA,IAAO,GAAK,IACZA,IAAQ,EAAI,IACZA,EAAY,IAEpB,EASA3E,GAAK,UAAY,SAAmBnR,EAAOuR,EAAUqE,EAAE,CACnD,OAAOA,EAAKzE,GAAK,YAAYnR,EAAOuR,CAAQ,EAAIJ,GAAK,YAAYnR,EAAOuR,CAAQ,CACpF,EAQAJ,GAAK,YAAc,SAAqBnR,EAAOuR,EAAQ,CACnD,OAAO,IAAIJ,GACPnR,EAAM,CAAC,EACPA,EAAM,CAAC,GAAM,EACbA,EAAM,CAAC,GAAK,GACZA,EAAM,CAAC,GAAK,GACZA,EAAM,CAAC,EACPA,EAAM,CAAC,GAAM,EACbA,EAAM,CAAC,GAAK,GACZA,EAAM,CAAC,GAAK,GACZuR,CAAQ,CAEhB,EAQAJ,GAAK,YAAc,SAAqBnR,EAAOuR,EAAQ,CACnD,OAAO,IAAIJ,GACPnR,EAAM,CAAC,GAAK,GACZA,EAAM,CAAC,GAAK,GACZA,EAAM,CAAC,GAAM,EACbA,EAAM,CAAC,EACPA,EAAM,CAAC,GAAK,GACZA,EAAM,CAAC,GAAK,GACZA,EAAM,CAAC,GAAM,EACbA,EAAM,CAAC,EACPuR,CAAQ,CAEhB,wDCtxCMJ,GAED4E,IAA+BC,GAE9B,SAAUC,GAAUC,EAAW,CACnC,OAAO/E,GAAK,WAAW+E,EAAK,GAAM,EAAE,CACtC,CAIA,IAAMC,GAAWF,GAAU,kBAAkB,EAEvCG,GAAWH,GAAU,kBAAkB,EAEvCI,GAAWJ,GAAU,kBAAkB,EAE7C,SAASK,GAASxa,EAAS,CACzB,OAAOA,EAAI,IAAIA,EAAI,KAAK,EAAE,CAAC,CAC7B,CAEA,SAASya,GAAMhd,EAAeoH,EAAgB6V,EAAgB,CAC5D,IAAMxW,EAAQzG,EAAE,MAAMoH,EAAQA,EAAS6V,CAAQ,EAC/C,OAAOrF,GAAK,UAAU,MAAM,KAAKnR,CAAK,EAAG,GAAM,EAAI,CACrD,CAEA,SAASyW,GAAQld,EAAeoH,EAAc,CAC5C,OAAO4V,GAAMhd,EAAGoH,EAAQ,CAAC,CAC3B,CAEA,SAAS+V,GAAQnd,EAAeoH,EAAc,CAC5C,OAAO4V,GAAMhd,EAAGoH,EAAQ,CAAC,CAC3B,CAEA,SAASgW,GAAS7a,EAAW8a,EAAa,CAExC,OAAOA,IAAU,EAAI9a,EAAMA,EAAI,KAAK8a,CAAK,EAAE,GAAG9a,EAAI,IAAI,GAAK8a,CAAK,CAAC,CACnE,CAEA,SAASC,GAAUC,EAAS3d,EAAS4d,EAAmC,CAAnCA,IAAA,SAAAA,EAAMd,GAAU,kBAAkB,GAErE,IAAI3Z,EAAIwa,EAAE,IAAI3d,CAAC,EAAE,IAAI4d,CAAG,EACxBza,EAAIA,EAAE,IAAIA,EAAE,KAAK,EAAE,CAAC,EACpB,IAAI9E,EAAI2B,EAAE,IAAImD,CAAC,EAAE,IAAIya,CAAG,EACxB,OAAAvf,EAAIA,EAAE,IAAIA,EAAE,KAAK,EAAE,CAAC,EACpBA,EAAIA,EAAE,IAAIuf,CAAG,EACNvf,CACT,CAIA,SAASwf,GACLC,EAAStb,EAAS5C,EAASme,EAAS,EAAS1f,EAAO,CACtD,EAAI,EAAE,IAAIyf,CAAC,EACXzf,EAAImf,GAASnf,EAAE,IAAI,CAAC,EAAE,IAAI0f,CAAC,EAAG,EAAE,EAChC,IAAMjW,EAAI,EACV,SAAI,EAAE,IAAItF,CAAC,EACX,EAAI,EAAE,IAAI5C,CAAC,EACXvB,EAAIA,EAAE,IAAImf,GAAS,EAAG,EAAE,CAAC,EAClB,CAAC,EAAE,IAAIO,CAAC,EAAG1f,EAAE,IAAIyJ,CAAC,CAAC,CAC5B,CAEA,SAASkW,GACL5d,EAAeoH,EAAgBrE,EAAS9E,EAAO,CACjD,OAAOwf,GACHP,GAAQld,EAAGoH,CAAM,EAAG8V,GAAQld,EAAGoH,EAAS,CAAC,EAAG8V,GAAQld,EAAGoH,EAAS,EAAE,EAClE8V,GAAQld,EAAGoH,EAAS,EAAE,EAAGrE,EAAG9E,CAAC,CACnC,CAEA,SAAS4f,GAAa7d,EAAewH,EAAc,CACjD,GADmCA,IAAA,SAAAA,EAAMxH,EAAE,QACvCwH,GAAO,EAAG,CACZ,IAAMgW,EAAMV,GAAG,IAAItV,EAAM,CAAC,EACpBzE,EAAIma,GAAQld,EAAG,CAAC,EAAE,IAAI8c,EAAE,EACxB7e,EAAIif,GAAQld,EAAGwH,EAAM,CAAC,EACtBE,EAAI0V,GAASnf,EAAG,EAAE,EAAE,IAAIuf,CAAG,EAAE,IAAIza,CAAC,EAClC/E,EAAIof,GAASra,EAAG,EAAE,EAAE,IAAI9E,CAAC,EAAE,IAAIuf,CAAG,EACxC,OAAOF,GAAU5V,EAAG1J,EAAGwf,CAAG,CAC3B,CACD,GAAIhW,GAAO,EAAG,CACZ,IAAMgW,EAAMV,GAAG,IAAItV,EAAM,CAAC,EACpBzE,EAAIoa,GAAQnd,EAAG,CAAC,EACtB,OAAOsd,GAAUva,EAAE,IAAI,CAAC,EAAE,IAAIyE,CAAG,EAAG2V,GAAQnd,EAAGwH,EAAM,CAAC,EAAGgW,CAAG,CAC7D,CACD,GAAIhW,EAAM,EAAG,CACX,IAAMzE,EAAI/C,EAAE,CAAC,EACP/B,EAAI+B,EAAEwH,GAAO,CAAC,EACdE,EAAI1H,EAAEwH,EAAM,CAAC,EACbhI,EAAIuD,GAAK9E,GAAK,GACd0f,EAAInW,GAAOE,GAAK,GACtB,OAAOqV,GAASD,GAAG,IAAItd,CAAC,EAAE,IAAIod,GAAG,IAAIe,CAAC,CAAC,CAAC,EAAE,IAAIb,EAAE,CACjD,CACD,OAAOA,EACT,CAEA,SAASgB,GAAc9d,EAAewH,EAAc,CAAdA,IAAA,SAAAA,EAAMxH,EAAE,QAC5C,IAAMwd,EAAMV,GAAG,IAAItV,EAAM,CAAC,EACpBzE,EAAIma,GAAQld,EAAG,CAAC,EAAE,IAAI6c,EAAE,EACxB5e,EAAIif,GAAQld,EAAG,CAAC,EAChB0H,EAAIwV,GAAQld,EAAGwH,EAAM,CAAC,EAAE,IAAIgW,CAAG,EAC/Bxf,EAAIkf,GAAQld,EAAGwH,EAAM,EAAE,EAAE,IAAIsV,EAAE,EACrC,OAAOQ,GACHF,GAASra,EAAE,IAAI9E,CAAC,EAAG,EAAE,EAAE,IAAImf,GAAS1V,EAAG,EAAE,CAAC,EAAE,IAAI1J,CAAC,EACjD+E,EAAE,IAAIqa,GAASnf,EAAE,IAAI6e,EAAE,EAAG,EAAE,CAAC,EAAE,IAAIpV,CAAC,EAAG8V,CAAG,CAChD,CAEA,SAASO,GAAc/d,EAAewH,EAAc,CAAdA,IAAA,SAAAA,EAAMxH,EAAE,QAC5C,IAAMwd,EAAMV,GAAG,IAAItV,EAAM,CAAC,EACpBzE,EAAIma,GAAQld,EAAG,CAAC,EAAE,IAAI8c,EAAE,EACxB7e,EAAIif,GAAQld,EAAG,CAAC,EAChB0H,EAAIwV,GAAQld,EAAGwH,EAAM,CAAC,EAAE,IAAIgW,CAAG,EAC/Bxf,EAAIkf,GAAQld,EAAGwH,EAAM,EAAE,EAAE,IAAIsV,EAAE,EAC/Btd,EAAI4d,GAASra,EAAE,IAAI9E,CAAC,EAAG,EAAE,EAAE,IAAImf,GAAS1V,EAAG,EAAE,CAAC,EAAE,IAAI1J,CAAC,EACrD2f,EAAIL,GAAU9d,EAAGuD,EAAE,IAAIqa,GAASnf,EAAE,IAAI6e,EAAE,EAAG,EAAE,CAAC,EAAE,IAAIpV,CAAC,EAAG8V,CAAG,EAC3Dxe,EAAIke,GAAQld,EAAG,EAAE,EAAE,IAAIwd,CAAG,EAC1Bje,EAAI2d,GAAQld,EAAG,EAAE,EACjBP,EAAID,EAAE,IAAI0d,GAAQld,EAAGwH,EAAM,EAAE,CAAC,EAAE,IAAIgW,CAAG,EACvCQ,EAAIL,EAAE,IAAIT,GAAQld,EAAGwH,EAAM,EAAE,CAAC,EAAE,IAAIgW,CAAG,EAC7C,OAAOF,GACHF,GAASpe,EAAE,IAAIO,CAAC,EAAG,EAAE,EAAE,IAAI6d,GAAS3d,EAAG,EAAE,CAAC,EAAE,IAAIue,CAAC,EACjDhf,EAAE,IAAIoe,GAAS7d,EAAE,IAAIwD,CAAC,EAAG,EAAE,CAAC,EAAE,IAAItD,CAAC,EAAG+d,CAAG,CAC/C,CAEgB,SAAAS,GAAcje,EAAewH,EAAc,SAAdA,IAAA,SAAAA,EAAMxH,EAAE,QACnD,IAAMke,EAAatG,GAAK,WAAW,GAAI,EAAI,EAC3C,GAAIpQ,GAAO,GACT,OAAIA,GAAO,GACFqW,GAAa7d,EAAGwH,CAAG,EAEnBsW,GAAc9d,EAAGwH,CAAG,EAExB,GAAIA,GAAO,GAChB,OAAOuW,GAAc/d,EAAGwH,CAAG,EAK7B,IAAIpF,EAAI8b,EACJ1e,EAAI0e,EAAK,IAAIrB,EAAE,EAAE,IAAI,GAAG,EAExBc,EAAIZ,GAASvd,EAAE,IAAIsd,EAAE,EAAE,IAAI,GAAG,CAAC,EAAE,IAAIA,EAAE,EACvCld,EAAI,CAACgY,GAAK,MAAOA,GAAK,KAAK,EAC3B8F,EAAI,CAAC9F,GAAK,MAAOA,GAAK,KAAK,EAC/BxV,EAAIA,EAAE,IAAI0a,EAAE,EAAE,IAAII,GAAQld,EAAG,CAAC,CAAC,EAE/B,IAAIoH,EAAS,EAEP+W,GAAQ3W,EAAM,GAAM,GAAK,GACzB4W,EAASD,GAAQ3W,EAAM,EAAK,IAAM,GAExC,GACEpF,EAAIgb,GAAShb,EAAE,IAAI5C,CAAC,EAAE,IAAII,EAAE,CAAC,CAAC,EAAE,IAAIsd,GAAQld,EAAGoH,EAAS,CAAC,CAAC,EAAG,EAAE,EAAE,IAAIyV,EAAE,EACvErd,EAAI4d,GAAS5d,EAAE,IAAII,EAAE,CAAC,CAAC,EAAE,IAAIsd,GAAQld,EAAGoH,EAAS,EAAE,CAAC,EAAG,EAAE,EAAE,IAAIyV,EAAE,EACjEza,EAAIA,EAAE,IAAIsb,EAAE,CAAC,CAAC,EACdle,EAAIA,EAAE,IAAII,EAAE,CAAC,CAAC,EAAE,IAAIsd,GAAQld,EAAGoH,EAAS,EAAE,CAAC,EAC3CuW,EAAIP,GAASO,EAAE,IAAID,EAAE,CAAC,CAAC,EAAG,EAAE,EAAE,IAAIb,EAAE,EACpCjd,EAAIge,GAA0B5d,EAAGoH,EAAQxH,EAAE,CAAC,EAAE,IAAIid,EAAE,EAAGza,EAAE,IAAIsb,EAAE,CAAC,CAAC,CAAC,EAClEA,EAAIE,GACA5d,EAAGoH,EAAS,GAAIuW,EAAE,IAAID,EAAE,CAAC,CAAC,EAAGle,EAAE,IAAI0d,GAAQld,EAAGoH,EAAS,EAAE,CAAC,CAAC,EAE/DgC,EAAAjJ,EAAS,CAACiC,EAAGub,CAAC,EAAC,CAAA,EAAdA,EAACvU,EAAA,CAAA,EAAEhH,EAACgH,EAAA,CAAA,EACLhC,GAAU,SACHA,IAAW+W,GACpB,IAAMX,EAAMX,GAAG,IAAIc,EAAE,IAAI,GAAI,EAAE,IAAI,CAAC,CAAC,EAErC,OAAAvW,EAASgX,EAETV,EAAE,CAAC,EAAIA,EAAE,CAAC,EAAE,IAAKlW,EAAM,EAAK,EAAE,EAC9B5H,EAAE,CAAC,EAAIA,EAAE,CAAC,EAAE,IAAI8d,EAAE,CAAC,CAAC,EACpBA,EAAE,CAAC,EAAIA,EAAE,CAAC,EAAE,IAAI9d,EAAE,CAAC,CAAC,EAEpBwC,EAAIgb,GAAShb,EAAE,IAAI5C,CAAC,EAAE,IAAII,EAAE,CAAC,CAAC,EAAE,IAAIsd,GAAQld,EAAGoH,EAAS,CAAC,CAAC,EAAG,EAAE,EAAE,IAAIoW,CAAG,EACxEhe,EAAI4d,GAAS5d,EAAE,IAAII,EAAE,CAAC,CAAC,EAAE,IAAIsd,GAAQld,EAAGoH,EAAS,EAAE,CAAC,EAAG,EAAE,EAAE,IAAIoW,CAAG,EAClEpb,EAAIA,EAAE,IAAIsb,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EACrBle,EAAIA,EAAE,IAAII,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,IAAIsd,GAAQld,EAAGoH,EAAS,EAAE,CAAC,CAAC,EAClDuW,EAAIP,GAASO,EAAE,IAAID,EAAE,CAAC,CAAC,EAAG,EAAE,EAAE,IAAIF,CAAG,EACrC5d,EAAIge,GAA0B5d,EAAGoH,EAAQxH,EAAE,CAAC,EAAE,IAAI4d,CAAG,EAAGpb,EAAE,IAAIsb,EAAE,CAAC,CAAC,CAAC,EACnEA,EAAIE,GACA5d,EAAGoH,EAAS,GAAIuW,EAAE,IAAID,EAAE,CAAC,CAAC,EAAGle,EAAE,IAAI0d,GAAQld,EAAGoH,EAAS,EAAE,CAAC,CAAC,EAE/DiC,EAAAlJ,EAAS,CAACiC,EAAGub,CAAC,EAAC,CAAA,EAAdA,EAACtU,EAAA,CAAA,EAAEjH,EAACiH,EAAA,CAAA,EAEEiU,GACHA,GAAU1d,EAAE,CAAC,EAAG8d,EAAE,CAAC,EAAGF,CAAG,EAAE,IAAIT,GAASvd,CAAC,EAAE,IAAIod,EAAE,CAAC,EAAE,IAAIe,CAAC,EACzDL,GAAU1d,EAAE,CAAC,EAAG8d,EAAE,CAAC,EAAGF,CAAG,EAAE,IAAIpb,CAAC,EAAGob,CAAG,CAC5C,CChLgB,SAAAa,GACZ1f,EAAiB6C,EAAe,CAClC,OAAIA,IAAU,SACL8c,GAAa3f,CAAK,EAGpB4f,GAAa,CAAC5f,CAAK,EAAG6C,CAAK,CACpC,CAEA,SAASgd,GAAmBzb,EAAevB,EAAe,CACxD,OAAQuB,aAAa,cAAgBvB,IAAU,WAC1CuB,aAAa,YAAcvB,IAAU,SACrCuB,aAAa,YAAcvB,IAAU,MAC5C,CAEgB,SAAA+c,GAAaxb,EAAevB,EAAe,CACzD,GAAIA,IAAU,SACZ,MAAM,IAAI,MAAM,2CAA2C,EAS7D,GAPI,MAAM,QAAQuB,CAAC,IACjBA,EAAI0b,GAAQ1b,CAAC,GAGXgG,GAAG,EAAG,QAAQ,OAAO,GACvB2V,GAA8B3b,EAAevB,CAAK,EAEhDgd,GAAmBzb,EAAGvB,CAAK,EAC7B,OAAOuB,EAET,GAAIvB,GAAS,MAAQA,IAAU,WAAaA,IAAU,YACpD,OAAO,IAAI,aAAauB,CAAa,EAChC,GAAIvB,IAAU,QACnB,OAAO,IAAI,WAAWuB,CAAa,EAC9B,GAAIvB,IAAU,OAAQ,CAE3B,QADMmd,EAAO,IAAI,WAAY5b,EAAe,MAAM,EACzC7C,EAAI,EAAGA,EAAIye,EAAK,OAAQ,EAAEze,EAC7B,KAAK,MAAO6C,EAAe7C,CAAC,CAAC,IAAM,IACrCye,EAAKze,CAAC,EAAI,GAGd,OAAOye,CACR,KACC,OAAM,IAAI,MAAM,qBAAA,OAAqBnd,CAAK,CAAE,CAEhD,UAagBod,IAAG,CACjB,OAAO7V,GAAG,EAAG,SAAS,IAAG,CAC3B,CAkBgB,SAAAiU,GACZ6B,EAAcC,EAA0B,CAC1C,OAAO/V,GAAG,EAAG,SAAS,MAAM8V,EAAMC,CAAY,CAChD,CAUgB,SAAAR,GAAate,EAAW+e,EAAkB,CAAlB,OAAAA,IAAA,SAAAA,EAAkB,SACxDA,EAAWA,GAAY,QAChBhW,GAAG,EAAG,SAAS,OAAO/I,EAAG+e,CAAQ,CAC1C,CAUgB,SAAAC,GAAavY,EAAmBsY,EAAkB,CAAlB,OAAAA,IAAA,SAAAA,EAAkB,SAChEA,EAAWA,GAAY,QAChBhW,GAAG,EAAG,SAAS,OAAOtC,EAAOsY,CAAQ,CAC9C,CAEM,SAAUE,GAAalc,EAAK,CAGhC,OAAIgG,GAAG,EAAG,SAAS,cAAgB,KAC1BA,GAAG,EAAG,SAAS,aAAahG,CAAC,EAE7B2U,GAAoB3U,CAAC,CAEhC,UAsBA0b,GACI5b,EAA0B3D,EAAkBggB,EAAsB,SAIpE,GAJ4BhgB,IAAA,SAAAA,EAAgB,CAAA,GAAEggB,IAAA,SAAAA,EAAsB,IAChEhgB,GAAU,OACZA,EAAS,CAAA,GAEP,OAAO2D,GAAQ,WAAa,OAAOA,GAAQ,UAC7C,OAAOA,GAAQ,UAAYsc,GAAetc,CAAG,GAAKA,GAAO,MACvDoc,GAAapc,CAAG,GAAKqc,EACvBhgB,EAAO,KAAK2D,CAAQ,UACX,MAAM,QAAQA,CAAG,GAAKoc,GAAapc,CAAG,EAC/C,QAAS3C,EAAI,EAAGA,EAAI2C,EAAI,OAAQ,EAAE3C,EAChCue,GAAQ5b,EAAI3C,CAAC,EAAGhB,EAAQggB,CAAc,MAEnC,CACL,IAAIE,EAAW,OACf,QAAkB/V,EAAAvJ,GAAA,OAAO,KAAK+C,CAAG,CAAC,EAAAyG,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAA/B,IAAMO,EAAGN,EAAA,MAER,qBAAqB,KAAKM,CAAG,IAC/BwV,EAAW,KAAK,IAAIA,EAAU,OAAOxV,CAAG,CAAC,EAE5C,mGACD,QAAS1J,EAAI,EAAGA,GAAKkf,EAAUlf,IAE7Bue,GAAS5b,EAA0B3C,CAAC,EAAGhB,EAAQggB,CAAc,CAEhE,CACD,OAAOhgB,CACT,0+BChKAmgB,IAAA,UAAA,CACE,SAAoBA,EAAAC,EAAoCC,EAAe,CAAnD,KAAY,aAAZD,EAAoC,KAAM,OAANC,EAClDA,GAAU,OACZ,KAAK,OAAS,IAAIC,IAItB,OAAAH,EAAA,UAAA,cAAA,SAAc3d,EAAoB+d,EAAwBlgB,EAAiB,SAErEmgB,EACEC,EAAsB,UAAA,CAC1BD,EAAUngB,EAAC,CACb,EACIqgB,EACE5Y,EAAQ6Y,GAAQ,EACtB,GAAI,KAAK,aAAa,eAAc,EAClCD,EAAQ,KAAK,aAAa,KAAKD,CAAmB,MAC7C,CACLA,EAAmB,MACnB,QAAqBG,EAAAhgB,GAAA4f,CAAO,EAAAK,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAAzB,IAAME,EAAMD,EAAA,MACfC,EAAO,SAAQ,CAChB,mGACDJ,EAAQ,QAAQ,QAAQ,CAAC,SAAUC,GAAQ,EAAK7Y,CAAK,CAAC,CACvD,CACD,GAAI+B,GAAG,EAAG,QAAQ,8BAA8B,EAC9C,mBAAS7I,EAAC,CACR,IAAM8f,EAASN,EAAQxf,CAAC,EAGxB8f,EAAO,KAAI,EAAG,KAAK,SAAAC,EAAU,CAC3BC,GAA0BD,EAAYD,EAAO,MAAOte,CAAU,CAChE,CAAC,GANMxB,EAAI,EAAGA,EAAIwf,EAAQ,OAAQxf,MAA3BA,CAAC,EAUZ,IAAMigB,EAAgB,CACpB,WAAUze,EACV,QAAOge,EACP,OAAMD,EACN,OAAQG,EAAM,KAAK,SAAAQ,EAAU,CAAA,OAAAA,EAAO,QAAQ,CAAA,EAC5C,UAAWR,EAAM,KACb,SAAAQ,EAAU,CAAA,OAAAA,EAAO,qBAAuB,KACpCA,EAAO,oBAAmB,EAC1B,EAAE,CAAA,GAEZ,OAAOD,GAGTd,EAAgB,UAAA,iBAAhB,SAAiBc,EAA4B,CAA7C,IAUC3W,EAAA,KATQ9H,EAAkDye,EAAxC,WAAET,EAAsCS,EAA/B,QAAEE,EAA6BF,EAAvB,OAAEV,EAAqBU,EAAa,OAA1BG,EAAaH,EAAa,UAEtET,EAAQ,QAAQ,SAAAxgB,EAAM,CACpB,QAAQ,IAAI,CAACA,EAAO,KAAI,EAAImhB,EAAQC,CAAS,CAAC,EAAE,KAAK,SAAAC,EAAc,CACjE/W,EAAK,OAAO,iBACR9H,EAAYxC,EAAQqhB,EAAe,CAAC,EAAGA,EAAe,CAAC,EAAGd,EAC1Dc,EAAe,CAAC,CAAC,CACvB,CAAC,CACH,CAAC,GAEJlB,CAAA,GAAA,WAEea,GACZja,EAAsBzE,EAAUE,EAAkB,CACpD,GAAIF,IAAU,UAEZ,MAAO,GAET,QAAStB,EAAI,EAAGA,EAAI+F,EAAK,OAAQ/F,IAAK,CACpC,IAAMgG,EAAMD,EAAK/F,CAAC,EAClB,GAAI,MAAMgG,CAAG,GAAK,CAAC,SAASA,CAAG,EAE7B,eAAQ,KAAK,SAAA,OAASA,EAAyB,qBAAA,EAAA,OAAAxE,EAAa,GAAA,CAAA,EACrD,EAEV,CACD,MAAO,EACT,CAEA,IAAA8d,IAAA,UAAA,CAAA,SAAAA,GAAA,EACE,OAAAA,EAAA,UAAA,iBAAA,SACItV,EAAchL,EAAgB+G,EAC9Boa,EAAgCZ,EAChCa,EAAkB,CACpB,IAAME,EAAO,OAAOH,GAAW,SAAWI,GAAc,GAAA,OAAGJ,EAAM,IAAA,EAAM,CAAC,EAC9BA,EAAO,MAC3CK,EAAaD,GAAcvW,EAAM,EAAE,EACnC3E,EAAOrG,EAAO,KACd0E,EAAO1E,EAAO,KACdqC,EAAQkf,GAAcvhB,EAAO,MAAM,SAAQ,EAAI,EAAE,EACnDyhB,EAAyB,GAE7B,QAAWC,KAAQnB,EAAQ,CACzB,IAAMoB,EAAQpB,EAAOmB,CAAI,EACzB,GAAIC,GAAS,KAAM,CAGjB,IAAMC,EAAaD,EAAM,OAAS3hB,EAAO,MACnC6hB,EAAYD,EAAW,OAC7BH,GACI,GAAA,OAAGC,EAAS,IAAA,EAAA,OAAAG,EAAc,IAAA,EAAA,OAAAA,EAAY,EAAID,EAAa,GAAE,GAAA,CAC9D,CACF,CAED,QAAQ,IACJ,KAAA,OAAKJ,EAAU,KAAA,EAAA,OAAOF,EAAI,KAAA,EAAA,OAAOjb,EAAI,IAAA,EAAA,OAAKhE,EAAK,KAAA,EAAA,OAAOqC,EAClD,KAAA,EAAA,OAAA+c,EAA6B,KAAA,EAAA,OAAAL,CAAS,EAC1C,mBAAoB,YAAa,aAAc,gBAC/C,eAAgB,kBAAkB,GAEzCd,CAAA,GAAA,WClGewB,GACZC,EAAkBC,EAAc1hB,EAAS,CAK3C,QAFM2hB,EAA8C,CAAA,EAC9CC,EAA0C,CAAA,EACvClhB,EAAI,EAAGA,EAAIghB,EAAG,OAAQhhB,IAC7BihB,EAAaD,EAAGhhB,CAAC,EAAE,EAAE,EAAI,GAG3B,QAASA,EAAI,EAAGA,EAAI+gB,EAAK,OAAQ/gB,IAAK,CACpC,IAAMmhB,EAAOJ,EAAK/gB,CAAC,EACbohB,EAAaD,EAAK,OACxB,QAAWE,KAAaD,EAAY,CAIlC,QAHMT,EAAQS,EAAWC,CAAS,EAE9BC,EAAgB,GACX3b,EAAI,EAAGA,EAAIqb,EAAG,OAAQrb,IAC7B,GAAIsb,EAAaN,EAAM,EAAE,EAAG,CAC1BQ,EAAK,QAAQ,QAAQ,SAAArB,EAAM,CAAI,OAAAmB,EAAanB,EAAO,EAAE,EAAI,EAA1B,CAA8B,EAC7DwB,EAAgB,GAChBJ,EAAWC,EAAK,EAAE,EAAI,GACtB,KACD,CAGH,GAAIG,EACF,KAEH,CACF,CAGD,IAAMC,EAAgD,CAAA,EACtDA,EAAejiB,EAAE,EAAE,EAAI,GAGvB,QAFMkiB,EAAwC,CAAA,EAErCxhB,EAAI+gB,EAAK,OAAS,EAAG/gB,GAAK,EAAGA,IAKpC,QAJMmhB,EAAOJ,EAAK/gB,CAAC,EACbohB,EAAaD,EAAK,OAGfxb,EAAI,EAAGA,EAAIwb,EAAK,QAAQ,OAAQxb,IACvC,GAAI4b,EAAeJ,EAAK,QAAQxb,CAAC,EAAE,EAAE,EAAG,CACtC,QAAW0b,KAAaD,EACtBG,EAAeH,EAAWC,CAAS,EAAE,EAAE,EAAI,GAC3CG,EAASL,EAAK,EAAE,EAAI,GAEtB,KACD,CAML,QADMM,EAA2B,CAAA,EACxBzhB,EAAI,EAAGA,EAAI+gB,EAAK,OAAQ/gB,IAAK,CACpC,IAAMmhB,EAAOJ,EAAK/gB,CAAC,EAEnB,GAAIkhB,EAAWC,EAAK,EAAE,GAAKK,EAASL,EAAK,EAAE,EAAG,CAE5C,IAAMO,EAA8C,CAAA,EACpD,QAAWL,KAAaF,EAAK,OAAQ,CACnC,IAAMQ,EAAYR,EAAK,OAAOE,CAAS,EACnCJ,EAAaU,EAAU,EAAE,IAC3BD,EAAaL,CAAS,EAAIM,EAE7B,CAGD,IAAMC,EAAa,OAAO,OAAO,CAAA,EAAIT,CAAI,EACzCS,EAAW,OAASF,EACpBE,EAAW,QAAUT,EAAK,QAE1BM,EAAa,KAAKG,CAAU,CAC7B,CACF,CAED,OAAOH,CACT,CASM,SAAUI,GACZC,EACAL,EAA0BM,EAC1BC,EAAqC,CAEvC,mBAAShiB,EAAC,CACR,IAAMmhB,EAAOM,EAAazhB,CAAC,EAErBiiB,EAAgB,CAAA,EAYtB,GAXAd,EAAK,QAAQ,QAAQ,SAAAthB,EAAC,CACpB,IAAMqiB,EAAaJ,EAA6BjiB,EAAE,EAAE,EAChDqiB,GAAc,KAChBD,EAAI,KAAKC,CAAU,EAInBD,EAAI,KAAK,IAAI,CAEjB,CAAC,EAEGd,EAAK,UAAY,KACnB,MAAM,IAAI,MACN,wDACA,OAAA,OAAOA,EAAK,WAAU,GAAA,CAAG,EAI/B,IAAMgB,EAAiBhB,EAAK,SAASc,CAAG,aAE7BZ,EAAS,CAClB,GAAI,EAAEA,KAAac,GACjB,MAAM,IAAI,MACN,iCAAA,OAAiCd,EAAa,IAAA,EAC9C,8BAA8B,OAAA,OAAO,KAAKc,CAAc,EAAC,GAAA,CAAG,EAIlE,IAAMC,EAAKL,EAAK,UAAA,CAAM,OAAAI,EAAed,CAAS,EAAC,CAAzB,CAA2B,EACjD,GAAIe,EAAG,QAAU,UACf,MAAM,IAAI,MACN,4BAAA,OACIjB,EAAK,WAAoC,0BAAA,EAC7C,GAAA,OAAGE,EAAiD,uCAAA,EAAA,OAAAe,EAAG,MAAK,GAAA,CAAG,EAErE,IAAMlgB,EAAIif,EAAK,OAAOE,CAAS,EAC/B,GAAI,CAACgB,GAAiBD,EAAG,MAAOlgB,EAAE,KAAK,EACrC,MAAM,IAAI,MACN,4BAAA,OACIif,EAAK,WAAoC,0BAAA,EAC7C,IAAA,OAAIE,EAAS,eAAA,EAAA,OAAgBe,EAAG,MAA+B,0BAAA,EAC/D,2BAAA,OAA2BlgB,EAAE,MAAK,GAAA,CAAG,EAG3C,GAAI4f,EAA6B5f,EAAE,EAAE,GAAK,KACxC4f,EAA6B5f,EAAE,EAAE,EAAIkgB,MAChC,CACL,IAAME,EAAcR,EAA6B5f,EAAE,EAAE,EACrD4f,EAA6B5f,EAAE,EAAE,EAAI8f,EAAIM,EAAaF,CAAE,EACxDE,EAAY,QAAO,CACpB,GA9BH,QAAWjB,KAAaF,EAAK,SAAlBE,CAAS,GAxBbrhB,EAAIyhB,EAAa,OAAS,EAAGzhB,GAAK,EAAGA,MAArCA,CAAC,CAyDZ,CC3KA,IAAMuiB,GAAwB,GAExBC,GAA6B,EAE7BC,GAAwB,EAExB,SAAUC,GACZ3c,EAA2B1E,EAAiBC,EAC5CqhB,EAAgB,CAClB,IAAM3b,EAAUD,GAAe1F,CAAK,EAC9BuhB,EAAYC,GAAwB9c,EAAM1E,EAAOC,EAAO0F,CAAO,EAC/D3B,EAAOhE,EAAM,OACbyhB,EAAYC,GAAkBhd,EAAM1E,EAAOC,EAAO0F,EAAS4b,CAAS,EACpEI,EAAQ,CAAC,QAAQ,EACvB,OAAIL,IACFK,EAAM,KAAK,YAAA,OAAY1hB,CAAK,CAAE,EAC9B0hB,EAAM,KAAK,WAAA,OAAW3d,CAAI,CAAE,EAC5B2d,EAAM,KAAK,aAAA,OAAa3hB,EAAK,GAAA,CAAG,EAChC2hB,EAAM,KAAK,WAAW,GAExBA,EAAM,KAAKF,EAAU,IAAI,SAAAriB,EAAK,CAAA,MAAA,OAASA,CAAT,CAAU,EAAE,KAAK;CAAI,CAAC,EAC7CuiB,EAAM,KAAK;CAAI,CACxB,CAEA,SAASH,GACL9c,EAA2B1E,EAAiBC,EAC5C0F,EAAiB,CACnB,IAAMvH,EAAIgE,GAAcpC,CAAK,EACvB4hB,EAAUjc,EAAQA,EAAQ,OAAS,CAAC,EACpC4b,EAAY,IAAI,MAAMK,CAAO,EAAE,KAAK,CAAC,EACrC5d,EAAOhE,EAAM,OACb6hB,EACF5hB,IAAU,YAAc6hB,GAAoBpd,CAAI,EAAIA,EAExD,GAAIV,EAAO,EACT,QAAS+d,EAAM,EAAGA,EAAM3jB,EAAIwjB,EAASG,IAEnC,QADMlc,EAASkc,EAAMH,EACZtd,EAAI,EAAGA,EAAIsd,EAAStd,IAC3Bid,EAAUjd,CAAC,EAAI,KAAK,IAChBid,EAAUjd,CAAC,EACX0d,GAAYH,EAAehc,EAASvB,CAAC,EAAG,EAAGrE,CAAK,EAAE,MAAM,EAIlE,OAAOshB,CACT,CAEA,SAASS,GACLhhB,EAAqCihB,EAAahiB,EAAe,CACnE,IAAIiiB,EACJ,OAAI,MAAM,QAAQlhB,CAAG,EACnBkhB,EAAS,GAAA,OAAG,WAAWlhB,EAAI,CAAC,EAAE,QAAQogB,EAAqB,CAAC,EAAM,KAAA,EAC9D,GAAA,OAAG,WAAWpgB,EAAI,CAAC,EAAE,QAAQogB,EAAqB,CAAC,EAAC,GAAA,EAC/Cjc,GAASnE,CAAG,EACrBkhB,EAAS,IAAA,OAAIlhB,EAAG,GAAA,EACPf,IAAU,OACnBiiB,EAASC,GAAgBnhB,CAAG,EAE5BkhB,EAAS,WAAWlhB,EAAI,QAAQogB,EAAqB,CAAC,EAAE,SAAQ,EAG3Dne,GAASif,EAAQD,CAAG,CAC7B,CAEA,SAASE,GAAgB9jB,EAAS,CAChC,OAAOA,IAAM,EAAI,QAAU,MAC7B,CAEA,SAASqjB,GACLhd,EAA2B1E,EAAiBC,EAC5C0F,EAAmB4b,EAAqBa,EAAa,CAAbA,IAAA,SAAAA,EAAa,IACvD,IAAMC,EAAoBpiB,IAAU,YAAc,EAAI,EAEhDoC,EAAOrC,EAAM,CAAC,EACdgE,EAAOhE,EAAM,OACnB,GAAIgE,IAAS,EAAG,CACd,GAAI/D,IAAU,YAAa,CACzB,IAAMqiB,EAAeR,GAAoBpd,CAAI,EAC7C,MAAO,CAACsd,GAAYM,EAAa,CAAC,EAAG,EAAGriB,CAAK,CAAC,CAC/C,CACD,OAAIA,IAAU,OACL,CAACkiB,GAAgBzd,EAAK,CAAC,CAAW,CAAC,EAErC,CAACA,EAAK,CAAC,EAAE,SAAQ,CAAE,CAC3B,CAED,GAAIV,IAAS,EAAG,CACd,GAAI3B,EAAO6e,GAAuB,CAChC,IAAMqB,EAAgBpB,GAA6BkB,EAE/CG,EAAY,MAAM,KAClB9d,EAAK,MAAM,EAAG6d,CAAa,CAAC,EAC5BE,EAAW,MAAM,KAAqC/d,EAAK,OAC1DrC,EAAO8e,IAA8BkB,EACtChgB,EAAOggB,CAAiB,CAAC,EAC7B,OAAIpiB,IAAU,cACZuiB,EAAYV,GAAoBU,CAAS,EACzCC,EAAWX,GAAoBW,CAAQ,GAElC,CACL,IACAD,EAAU,IAAI,SAAC3hB,EAAGlC,EAAM,CAAA,OAAAqjB,GAAYnhB,EAAG0gB,EAAU5iB,CAAC,EAAGsB,CAAK,CAAlC,CAAmC,EACtD,KAAK,IAAI,EACd,UACAwiB,EACK,IACG,SAAC5hB,EAAGlC,EAAC,CAAK,OAAAqjB,GACNnhB,EAAG0gB,EAAUlf,EAAO8e,GAA6BxiB,CAAC,EAAGsB,CAAK,CADpD,CACqD,EAClE,KAAK,IAAI,EACd,IAEH,CACD,IAAMyiB,EACFziB,IAAU,YAAc6hB,GAAoBpd,CAAI,EACxB,MAAM,KAAoBA,CAAI,EAE1D,MAAO,CACL,IACAge,EAAY,IAAI,SAAC7hB,EAAGlC,EAAM,CAAA,OAAAqjB,GAAYnhB,EAAG0gB,EAAU5iB,CAAC,EAAGsB,CAAK,CAAlC,CAAmC,EACxD,KAAK,IAAI,EACd,IAEH,CAGD,IAAM0iB,EAAW3iB,EAAM,MAAM,CAAC,EACxB4iB,EAAajd,EAAQ,MAAM,CAAC,EAC5Bkd,EAASld,EAAQ,CAAC,EAAI0c,EACtBV,EAAkB,CAAA,EACxB,GAAItf,EAAO6e,GAAuB,CAChC,QAASviB,EAAI,EAAGA,EAAIwiB,GAA4BxiB,IAAK,CACnD,IAAM8G,EAAQ9G,EAAIkkB,EACZjG,EAAMnX,EAAQod,EACpBlB,EAAM,KAAN,MAAAA,EAAc3iB,GAAA,CAAA,EAAAJ,EAAA8iB,GACVhd,EAAK,MAAMe,EAAOmX,CAAG,EAAG+F,EAAU1iB,EAAO2iB,EAAYrB,EACrD,EAAK,CAAc,EAAE,EAAA,CAAA,CAC1B,CACDI,EAAM,KAAK,KAAK,EAChB,QAAShjB,EAAI0D,EAAO8e,GAA4BxiB,EAAI0D,EAAM1D,IAAK,CAC7D,IAAM8G,EAAQ9G,EAAIkkB,EACZjG,EAAMnX,EAAQod,EACpBlB,EAAM,KAAN,MAAAA,EAAK3iB,GAAA,CAAA,EAAAJ,EAAS8iB,GACVhd,EAAK,MAAMe,EAAOmX,CAAG,EAAG+F,EAAU1iB,EAAO2iB,EAAYrB,EACrD5iB,IAAM0D,EAAO,CAAC,CAAc,EAAE,EAAA,CAAA,CACnC,CACF,KACC,SAAS1D,EAAI,EAAGA,EAAI0D,EAAM1D,IAAK,CAC7B,IAAM8G,EAAQ9G,EAAIkkB,EACZjG,EAAMnX,EAAQod,EACpBlB,EAAM,KAAN,MAAAA,EAAK3iB,GAAA,CAAA,EAAAJ,EAAS8iB,GACVhd,EAAK,MAAMe,EAAOmX,CAAG,EAAG+F,EAAU1iB,EAAO2iB,EAAYrB,EACrD5iB,IAAM0D,EAAO,CAAC,CAAc,EAAE,EAAA,CAAA,CACnC,CAEH,IAAMygB,EAAM9e,IAAS,EAAI,IAAM,GAC/B2d,EAAM,CAAC,EAAI,KAAOtf,EAAO,EAAIsf,EAAM,CAAC,EAAImB,EAAM,IAC9C,QAASnkB,EAAI,EAAGA,EAAIgjB,EAAM,OAAS,EAAGhjB,IACpCgjB,EAAMhjB,CAAC,EAAI,IAAMgjB,EAAMhjB,CAAC,EAAImkB,EAG9B,QADIC,EAAa;EACRpkB,EAAI,EAAGA,EAAIqF,EAAMrF,IACxBokB,GAAc;EAEhB,OAAApB,EAAMA,EAAM,OAAS,CAAC,EAClB,IAAMA,EAAMA,EAAM,OAAS,CAAC,EAAI,KAAOS,EAAS,GAAKW,GAClDpB,CACT,CAEA,SAASG,GAAoBpd,EACU,CAErC,QADMse,EAAyC,CAAA,EACtCrkB,EAAI,EAAGA,EAAI+F,EAAK,OAAQ/F,GAAK,EACpCqkB,EAAc,KAAK,CAACte,EAAK/F,CAAC,EAAG+F,EAAK/F,EAAI,CAAC,CAAC,CAAqB,EAE/D,OAAOqkB,CACT,CCxJA,IAAAC,IAAA,UAAA,CAME,SAAAA,EAAYjjB,EAA2BC,EAAUF,EAAuB,CAAxE,IAmBCkI,EAAA,KAfC,GAJqC,KAAK,MAALhI,EACrC,KAAK,MAAQD,EAAM,MAAK,EACxB,KAAK,KAAOkjB,GAAmBljB,CAAK,EAEhCD,GAAU,KAAM,CAClB,IAAMojB,EAAIpjB,EAAO,OACjBqjB,EACID,IAAM,KAAK,KACX,UAAA,CAAM,MAAA,qBAAA,OAAqBA,EAA6B,4BAAA,EACpD,0BAAA,OAA0Blb,EAAK,KAAI,IAAA,CADjC,CACqC,CAChD,CACD,GAAIhI,IAAU,YACZ,MAAM,IAAI,MACN,4JAE8B,EAEpC,KAAK,OAASF,GAAUsjB,GAAuBpjB,EAAO,KAAK,IAAI,EAC/D,KAAK,QAAUyF,GAAe1F,CAAK,EAWrC,OAAAijB,EAAG,UAAA,IAAH,SAAI7lB,EAAwB,SAW3B6K,EAAA,KAX8ClB,EAAA,CAAA,EAAA0B,EAAA,EAAjBA,EAAiB,UAAA,OAAjBA,IAAA1B,EAAiB0B,EAAA,CAAA,EAAA,UAAAA,CAAA,EACzC1B,EAAK,SAAW,IAClBA,EAAO,CAAC,CAAC,GAEXqc,EACIrc,EAAK,SAAW,KAAK,KACrB,UAAM,CAAA,MAAA,uCAAA,OAAuCA,EAAK,OAAe,SAAA,EAC7D,mBAAA,OAAmBkB,EAAK,KAAI,GAAA,CAD1B,CAC6B,EAEvC,IAAM1H,EAAQ,KAAK,WAAWwG,CAAI,EAClC,KAAK,OAAOxG,CAAK,EAAInD,GAUvB6lB,EAAA,UAAA,IAAA,UAAA,aAAqBlc,EAAA,CAAA,EAAA0B,EAAA,EAAjBA,EAAiB,UAAA,OAAjBA,IAAA1B,EAAiB0B,CAAA,EAAA,UAAAA,CAAA,EACf1B,EAAK,SAAW,IAClBA,EAAO,CAAC,CAAC,GAEX,IAAIpI,EAAI,MACR,QAAkB2kB,EAAA/kB,GAAAwI,CAAI,EAAAwc,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAAnB,IAAME,EAAGD,EAAA,MACZ,GAAIC,EAAM,GAAKA,GAAO,KAAK,MAAM7kB,CAAC,EAAG,CACnC,IAAMkD,EAAM,qCAAqC,OAAAkF,EAAQ,IAAA,EACrD,kBAAA,OAAkB,KAAK,KAAK,EAChC,MAAM,IAAI,MAAMlF,CAAG,CACpB,CACDlD,GACD,mGAED,QADI4B,EAAQwG,EAAKA,EAAK,OAAS,CAAC,EACvB0c,EAAI,EAAGA,EAAI1c,EAAK,OAAS,EAAG,EAAE0c,EACrCljB,GAAS,KAAK,QAAQkjB,CAAC,EAAI1c,EAAK0c,CAAC,EAEnC,OAAO,KAAK,OAAOljB,CAAK,GAG1B0iB,EAAU,UAAA,WAAV,SAAWlc,EAAc,CACvB,GAAI,KAAK,OAAS,EAChB,MAAO,GACF,GAAI,KAAK,OAAS,EACvB,OAAOA,EAAK,CAAC,EAGf,QADIxG,EAAQwG,EAAKA,EAAK,OAAS,CAAC,EACvBpI,EAAI,EAAGA,EAAIoI,EAAK,OAAS,EAAG,EAAEpI,EACrC4B,GAAS,KAAK,QAAQ5B,CAAC,EAAIoI,EAAKpI,CAAC,EAEnC,OAAO4B,GAGT0iB,EAAU,UAAA,WAAV,SAAW1iB,EAAa,CACtB,GAAI,KAAK,OAAS,EAChB,MAAO,CAAA,EACF,GAAI,KAAK,OAAS,EACvB,MAAO,CAACA,CAAK,EAGf,QADMwG,EAAiB,IAAI,MAAM,KAAK,MAAM,MAAM,EACzCpI,EAAI,EAAGA,EAAIoI,EAAK,OAAS,EAAG,EAAEpI,EACrCoI,EAAKpI,CAAC,EAAI,KAAK,MAAM4B,EAAQ,KAAK,QAAQ5B,CAAC,CAAC,EAC5C4B,GAASwG,EAAKpI,CAAC,EAAI,KAAK,QAAQA,CAAC,EAEnC,OAAAoI,EAAKA,EAAK,OAAS,CAAC,EAAIxG,EACjBwG,GAGT,OAAA,eAAIkc,EAAI,UAAA,OAAA,CAAR,IAAA,UAAA,CACE,OAAO,KAAK,MAAM,qCACnB,CAAA,EAODA,EAAA,UAAA,SAAA,UAAA,CACE,OAAOS,GAAS,EAAG,WAAW,KAAK,OAAQ,KAAK,MAAO,KAAK,KAAK,GAGpET,CAAA,GAAA,EA4CGS,GAAiC,KAEjCC,GAAuB,KAarB,SAAUC,GAAiBC,EAAuB,CACtDH,GAAYG,CACd,CAOM,SAAUC,GAAaC,EAAkB,CAC7CJ,GAAYI,CACd,CA0BA,IAAAC,IAAA,UAAA,CA+BE,SAAAA,EAAYhkB,EAAoBC,EAAiBP,EAAgBukB,EAAU,CAb3E,KAAI,KAAG,GAmLG,KAAkB,mBAAG,GArK7B,KAAK,MAAQjkB,EAAM,MAAK,EACxB,KAAK,MAAQC,GAAS,UACtB,KAAK,KAAOijB,GAAmBljB,CAAK,EACpC,KAAK,QAAU0F,GAAe1F,CAAK,EACnC,KAAK,OAASN,EACd,KAAK,GAAKukB,EACV,KAAK,SAAY,KAAK,KAAO,EAAI,KAAK,KAAK,SAAQ,EAAK,SAG1D,cAAA,eAAID,EAAI,UAAA,OAAA,CAAR,IAAA,UAAA,CACE,OAAO,KAAK,MAAM,qCACnB,CAAA,EAOKA,EAAA,UAAA,OAAN,UAAA,0FACe,IAAA,GAAA,MAAA,CAAA,EAAM,KAAK,KAAI,CAAK,SAA3B,OAAAtf,EAAOoD,EAAoB,KAAA,EACjC,CAAA,EAAO6b,GAAU,OAAO,KAAK,MAAO,KAAK,MAAYjf,CAAI,CAAC,MAC3D,EAMDsf,EAAA,UAAA,WAAA,UAAA,CACE,OAAOL,GAAU,OAAO,KAAK,MAAO,KAAK,MAAY,KAAK,SAAQ,CAAE,GAShEK,EAAA,UAAA,MAAN,UAAA,0FACe,IAAA,GAAA,MAAA,CAAA,EAAM,KAAK,KAAI,CAAE,SAAxB,OAAAtf,EAAOoD,EAAiB,KAAA,EAC9B,CAAA,EAAO1B,GAAc,KAAK,MAAO1B,EAAM,KAAK,QAAU,WAAW,CAClD,MAChB,EAQDsf,EAAA,UAAA,UAAA,UAAA,CACE,OAAO5d,GACI,KAAK,MAAO,KAAK,SAAQ,EAAI,KAAK,QAAU,WAAW,GAU9D4d,EAAA,UAAA,KAAN,UAAA,mGAGM,OAFJ,KAAK,gBAAe,EACd1d,EAAOod,GAAS,EAAG,KAAK,KAAK,MAAM,EACrC,KAAK,QAAU,SAAQ,CAAA,EAAA,CAAA,EACX,CAAA,EAAMpd,CAAoB,SAAlCpB,EAAQ4C,EAA0B,KAAA,EACxC,GAAI,CACF,MAAA,CAAA,EAAO5C,EAAM,IAAI,SAAAxI,EAAK,CAAA,OAAAwnB,GAAkBxnB,CAAC,CAAnB,CAAoB,CAAmB,CAC9D,MAAO,CACN,MAAM,IAAI,MACN,+FACiD,CACtD,WAEH,IAAA,GAAA,MAAA,CAAA,EAAO4J,CAA+B,MACvC,EAoCD0d,EAAS,UAAA,UAAT,SAAUnkB,EAA0B,CAClC,YAAK,gBAAe,EACb6jB,GAAS,EAAG,UAAU,KAAK,OAAQ7jB,CAAO,GASnDmkB,EAAA,UAAA,SAAA,UAAA,CACE,KAAK,gBAAe,EACpB,IAAM1d,EAAOod,GAAS,EAAG,SAAS,KAAK,MAAM,EAC7C,GAAI,KAAK,QAAU,SACjB,GAAI,CACF,OAAQpd,EAAsB,IAAI,SAAA5J,EAAK,CAAA,OAAAwnB,GAAkBxnB,CAAC,CAAnB,CAAoB,CAE5D,MAAO,CACN,MAAM,IAAI,MACN,+FACiD,CACtD,CAEH,OAAO4J,GAIH0d,EAAA,UAAA,MAAN,UAAA,iGACE,YAAK,gBAAe,EACD,CAAA,EAAAN,GAAS,EAAG,KAAK,KAAK,MAAM,CAAC,SAChD,OADMpd,EAAOwB,EAAmC,KAAA,EAC5C,KAAK,QAAU,SACjB,CAAA,EAAOxB,CAAoB,EAE3B,CAAA,EAAO,IAAI,WAAYA,EAAoB,MAAM,CAAC,MAErD,EAOD0d,EAAA,UAAA,QAAA,UAAA,CACM,KAAK,aAGL,KAAK,WACP,KAAK,UAAU,QAAO,EAExBN,GAAS,EAAG,cAAc,IAAI,EAC9B,KAAK,mBAAqB,KAI5B,OAAA,eAAIM,EAAU,UAAA,aAAA,CAAd,IAAA,UAAA,CACE,OAAO,KAAK,iDACb,CAAA,EAEDA,EAAA,UAAA,gBAAA,UAAA,CACE,GAAI,KAAK,WACP,MAAM,IAAI,MAAM,qBAAqB,GAYzCA,EAAK,UAAA,MAAL,SAAM1C,EAAe,CAAf,OAAAA,IAAA,SAAAA,EAAe,IACZqC,GAAU,MAAM,KAAMrC,CAAO,GAOtC0C,EAAA,UAAA,MAAA,UAAA,CACE,YAAK,gBAAe,EACbL,GAAU,MAAM,IAAI,GAQ7BK,EAAQ,UAAA,SAAR,SAAS1C,EAAe,CAAfA,IAAA,SAAAA,EAAe,IACtB,IAAM5c,EAAO,KAAK,SAAQ,EAC1B,OAAO2c,GAAe3c,EAAM,KAAK,MAAO,KAAK,MAAO4c,CAAO,GAG7D0C,EAAI,UAAA,KAAJ,SAAqB/jB,EAAe,CAClC,YAAK,gBAAe,EACb0jB,GAAU,KAAK,KAAW1jB,CAAK,GAExC+jB,EAAA,UAAA,SAAA,SAASG,EAAkBxb,EAAe1I,EAAgB,CAAjD,OAAAkkB,IAAA,SAAAA,EAAgB,IACvB,KAAK,gBAAe,EACbT,GAAS,EAAG,aAAa,KAAMS,EAAWxb,EAAM1I,CAAK,GAG/D+jB,CAAA,GAAA,EAED,OAAO,eAAeA,GAAQ,OAAO,YAAa,CAChD,MAAO,SAACI,EAAgB,CAMtB,MAAO,CAAC,CAACA,GAAYA,EAAS,MAAQ,MAAQA,EAAS,UAAY,MAC/DA,EAAS,iBAAmB,KAEnC,CAAA,WAEeC,IAAoB,CAIlC,OAAOjb,GAAU,SAAU,UAAA,CACzB,OAAO4a,EACT,CAAC,CACH,CAGAK,GAAoB,EAmCpB,IAAAC,IAAA,SAAAC,EAAA,CAAqD3nB,GAAS0nB,EAAAC,CAAA,EAG5D,SAAAD,EACIE,EAAgCL,EAAoBxb,EACpD8b,EAAgB,CAFpB,IAAAxc,EAGEsc,EACI,KAAA,KAAAC,EAAa,MAAOA,EAAa,MAAOA,EAAa,OAAQC,CAAQ,GAE1E,KALmC,OAAAxc,EAAS,UAATkc,EAIlClc,EAAK,KAAOU,IAWd,OAAA2b,EAAM,UAAA,OAAN,SAAOI,EAAmB,CACxB,GAAIA,EAAS,QAAU,KAAK,MAC1B,MAAM,IAAI,MACN,2BAAA,OAA2BA,EAAS,MAAa,QAAA,EACjD,mBAAA,OAAmB,KAAK,MAAK,cAAA,CAAc,EAEjD,GAAI,CAAC1D,GAAiB0D,EAAS,MAAO,KAAK,KAAK,EAC9C,MAAM,IAAI,MACN,2BAAA,OAA2BA,EAAS,MAAa,QAAA,EACjD,mBAAA,OAAmB,KAAK,MAAK,cAAA,CAAc,EAEjDhB,GAAS,EAAG,cAAc,IAAI,EAC9B,KAAK,OAASgB,EAAS,OACvBhB,GAAS,EAAG,OAAO,KAAM,IAAI,GAGtBY,EAAA,UAAA,QAAA,UAAA,CACPZ,GAAS,EAAG,gBAAgB,IAAI,EAChC,KAAK,mBAAqB,IAE7BY,CAAA,GAvCoDN,EAAS,EAyC9D,OAAO,eAAeM,GAAU,OAAO,YAAa,CAClD,MAAO,SAACF,EAAkB,CACxB,OAAOA,aAAoBJ,IAAUI,EAAS,QAAU,MACpDA,EAAS,kBAAkB,SAElC,CAAA,EC5hBWO,EAAAA,KAAAA,QAAZ,SAAYA,EAAI,CACdA,EAAA,GAAA,KACAA,EAAA,GAAA,KACAA,EAAA,GAAA,KACAA,EAAA,GAAA,KACAA,EAAA,GAAA,KACAA,EAAA,GAAA,KACAA,EAAA,GAAA,IACF,GARYA,EAAAA,OAAAA,EAAAA,KAQX,CAAA,EAAA,EAaD,IAAKC,IAAL,SAAKA,EAAiB,CACpBA,EAAA,QAAA,UACAA,EAAA,MAAA,QACAA,EAAA,KAAA,QACAA,EAAA,UAAA,WACF,GALKA,KAAAA,GAKJ,CAAA,EAAA,EAED,IAAKC,IAAL,SAAKA,EAAgB,CACnBA,EAAA,QAAA,UACAA,EAAA,MAAA,QACAA,EAAA,KAAA,OACAA,EAAA,UAAA,WACF,GALKA,KAAAA,GAKJ,CAAA,EAAA,EAED,IAAKC,IAAL,SAAKA,EAAmB,CACtBA,EAAA,QAAA,UACAA,EAAA,MAAA,UACAA,EAAA,KAAA,UACAA,EAAA,UAAA,WACF,GALKA,KAAAA,GAKJ,CAAA,EAAA,EAED,IAAKC,IAAL,SAAKA,EAAqB,CACxBA,EAAA,QAAA,YACAA,EAAA,MAAA,YACAA,EAAA,KAAA,YACAA,EAAA,UAAA,WACF,GALKA,KAAAA,GAKJ,CAAA,EAAA,EAED,IAAMC,GAAgB,CACpB,QAAWF,GACX,MAASF,GACT,KAAQC,GACR,UAAaE,IAGC,SAAAE,GAAWC,EAAiBC,EAAe,CACzD,GAAID,IAAU,UAAYC,IAAU,SAAU,CAC5C,GAAID,IAAU,UAAYC,IAAU,SAClC,MAAO,SAET,MAAM,IAAI,MAAM,kBAAA,OAAkBD,EAAc,QAAA,EAAA,OAAAC,CAAK,CAAE,CACxD,CACD,OAAOH,GAAcE,CAAK,EAAEC,CAAK,CACnC,CAGM,SAAUC,GAAWC,EAAc,CACvC,OAAOJ,GAAWI,EAAM,OAAO,CACjC,CAkEM,SAAUC,GAAYvlB,EAAe,CACzC,OAAOA,GAAU,MAAQ,OAAOA,GAAW,UAAY,YAAaA,GAChEA,EAAO,mBAAmB,YAChC,CACM,SAAUwlB,GAAaxlB,EAAe,CAC1C,OAAO,OAAO,UAAc,KAAeA,GAAU,MACjD,OAAOA,GAAW,UAAY,WAAYA,GAC1CA,EAAO,kBAAkB,SAC/B,CC9LgB,SAAAylB,GAAiChkB,EAAM9E,EAAI,CACzD,GAAI8E,EAAE,QAAU9E,EAAE,MAChB,MAAO,CAAC8E,EAAG9E,CAAC,EAEd,IAAMuD,EAAQglB,GAAWzjB,EAAE,MAAO9E,EAAE,KAAK,EACzC,MAAO,CAAC8E,EAAE,KAAKvB,CAAK,EAAGvD,EAAE,KAAKuD,CAAK,CAAC,CACtC,CAEgB,SAAAwlB,GAAiBjkB,EAAW9E,EAAS,CACnDiF,EACIH,EAAE,QAAU9E,EAAE,MACd,UAAA,CAAM,MAAA,2BAAA,OAA2B8E,EAAE,MAAY,OAAA,EAC3C,WAAA,OAAW9E,EAAE,MAAK,oBAAA,CADhB,CACoC,CAChD,CAEgB,SAAAgpB,GAAeC,EAAgBC,EAAoB,CACjE,OAAOA,EAAW,KAAK,SAAA/kB,EAAC,CAAI,OAAAA,EAAE,KAAO8kB,EAAO,EAAhB,CAAkB,CAChD,CAcM,SAAUE,GAAsBloB,EAAuB,CAC3D,IAAMmoB,EAAiB,CAAA,EACjBC,EAAO,IAAI,IACjB,OAAAC,GAAoBroB,EAAQmoB,EAAMC,CAAI,EAC/BD,CACT,CAEA,SAASE,GACLC,EAA4BH,EAAgBC,EAAkB,CAChE,GAAIE,GAAa,KAGjB,IAAIA,aAAqBjC,GAAQ,CAC/B8B,EAAK,KAAKG,CAAS,EACnB,MACD,CACD,GAAKC,GAAWD,CAAS,EAIzB,KAAME,EAAWF,EACjB,QAAWG,KAAKD,EAAU,CACxB,IAAMnlB,EAAMmlB,EAASC,CAAC,EACjBL,EAAK,IAAI/kB,CAAG,IACf+kB,EAAK,IAAI/kB,CAAG,EACZglB,GAAoBhlB,EAAK8kB,EAAMC,CAAI,EAEtC,GACH,CAGA,SAASG,GAAWvP,EAAQ,CAC1B,OAAO,MAAM,QAAQA,CAAG,GAAK,OAAOA,GAAQ,QAC9C,0GCiBA,SAAS0P,GAELC,EACgC,CAElC,OAAQA,EAAmD,YAAc,IAC3E,CAEA,IAAAC,IAAA,UAAA,CAAA,SAAAA,GAAA,CAEE,KAAmB,oBAAqB,CAAA,EAExC,KAAc,eAAG,EACjB,KAAQ,SAAG,EACX,KAAU,WAAG,EACb,KAAgB,iBAAG,EACnB,KAAc,eAAG,EAMjB,KAAa,cAAG,EAGhB,KAAW,YAAG,EAId,KAAU,WAAiB,CAAA,EAK3B,KAAiB,kBAAa,CAAA,EAC9B,KAAW,YAAG,EAEd,KAAA,WAAa,IAAI,QAOjB,KAAS,UAAG,GACZ,KAAA,cAA6B,CAC3B,SAAU,EACV,WAAY,EACZ,UAAW,EACX,QAAS,CAAA,EACT,OAAQ,KACR,IAAI,aAAW,CAET,OAAO,MAAM,KAAK,IAAI,IAAI,KAAK,QAAQ,IAAI,SAAAH,EAAK,CAAA,OAAAA,EAAE,IAAI,CAAA,CAAC,CAAC,IAIhE,OAAAG,EAAA,UAAA,QAAA,UAAA,CACE,QAAWC,KAAgB,KAAK,oBAC9B,KAAK,oBAAoBA,CAAY,EAAE,QAAO,GAGnDD,CAAA,GAAA,EAEDE,IAAA,UAAA,CAgBE,SAAAA,EAAmB5d,EAAgB,CAAhB,KAAG,IAAHA,EAbnB,KAAQ,SAAkC,CAAA,EAC1C,KAAe,gBAKX,CAAA,EAKI,KAAoB,qBAAG,EAG7B,KAAK,MAAQ,IAAI0d,GAGb,OAAAE,EAAA,UAAA,MAAN,UAAA,uGACE,GAAI,KAAK,oBAAsB,KAC7B,MAAO,CAAA,EAAA,KAAK,mBAAmB,KAAK,UAAA,CAAA,CAAQ,CAAC,EAE/C,GAAI,KAAK,iBAAmB,KAC1B,MAAO,CAAA,CAAA,EAEHC,EAAiB,KAAK,kBAAiB,EAEpC/nB,EAAI,mBAAG,OAAAA,EAAI+nB,EAAe,QAC3BzR,EAAcyR,EAAe/nB,CAAC,EACd,CAAA,EAAA,KAAK,kBAAkBsW,CAAW,EAAE,OAAO,GAF1B,CAAA,EAAA,CAAA,SAGnC,OADE0R,EAAU9e,EAAiD,KAAA,EAC7D8e,EACF,CAAA,EAAM,KAAK,WAAW1R,CAAW,CAAC,EADzB,CAAA,EAAA,CAAA,SACT,OAAApN,EAAA,KAAA,EACO,CAAA,CAAA,SALgC,OAAAlJ,iBAS3C,MAAM,IAAI,MACN,wEACS,MACd,EAED,OAAA,eAAI8nB,EAAO,UAAA,UAAA,CAAX,IAAA,UAAA,CACE,GAAI,KAAK,oBAAsB,KAC7B,MAAM,IAAI,MACN,YAAA,OAAY,KAAK,YAAkD,uCAAA,EACnE,gFACe,EAErB,GAAI,KAAK,iBAAmB,KAAM,CAC1B,IAAA5e,EAAoB,KAAK,gCAA+B,EAAvDc,EAAId,EAAA,KAAE+e,EAAS/e,EAAA,UACtB,GAAI+e,EACF,MAAM,IAAI,MACN,iCAAA,OAAiCje,EAAyB,qBAAA,EAC1D,kGACoD,EAE1D,KAAK,WAAWA,CAAI,CACrB,CACD,OAAO,KAAK,8CACb,CAAA,EAED8d,EAAA,UAAA,aAAA,UAAA,CACE,OAAO,OAAO,KAAK,KAAK,eAAe,GAGzCA,EAAW,UAAA,YAAX,SAAYxR,EAAmB,CAC7B,GAAI,EAAEA,KAAe,KAAK,UAGxB,GAAIA,KAAe,KAAK,gBAAiB,CAChC,IAAA2R,EAAa,KAAK,kBAAkB3R,CAAW,EAAC,UACvD,GAAI2R,EAEF,OAAO,IAEV,KACC,QAAO,KAGX,OAAO,KAAK,SAAS3R,CAAW,GAGlCwR,EAAkB,UAAA,mBAAlB,SAAmBxR,EAAmB,CAEpC,OAAMA,KAAe,KAAK,gBAGnB,KAAK,gBAAgBA,CAAW,EAAE,QAFhC,MAKXwR,EAAA,UAAA,gBAAA,SACIxR,EACA4R,EACAC,EAAY,CACd,OADEA,IAAA,SAAAA,EAAY,GACV7R,KAAe,KAAK,iBACtBQ,GACI,GAAA,OAAGR,EAA8C,mCAAA,EACjD,mCAAmC,EAChC,KAET,KAAK,gBAAgBA,CAAW,EAAI,CAAC,QAAO4R,EAAE,SAAQC,CAAA,EAC/C,KAGHL,EAAU,UAAA,WAAhB,SAAiBxR,EAAmB,yGAClC,GAAI,KAAK,gBAAgBA,CAAW,GAAK,KACvC,MAAM,IAAI,MAAM,iBAAA,OAAiBA,EAAW,yBAAA,CAAyB,SAEvE,KAAK,YAAcA,EACf,KAAK,SAASA,CAAW,GAAK,KAAI,CAAA,EAAA,CAAA,GACpC,KAAK,gBAAkB,KACjBpN,EAAuB,KAAK,kBAAkBoN,CAAW,EAAxD0R,EAAO9e,EAAA,QAAE+e,EAAS/e,EAAA,UACV+e,EAAY,CAAA,EAAMD,CAAO,EAAhB,CAAA,EAAA,CAAA,UAAG,OAAA7e,EAAAC,EAAA,KAAA,eAAgBD,EAAA6e,mBAC3C,GADMhpB,EAA4CmK,EAC9C,CAACnK,EACH,MAAA,CAAA,EAAO,EAAK,mBAGhB,YAAK,gBAAkB,KAAK,SAASsX,CAAW,EAChD,KAAK,uBAAsB,EAE3B,KAAK,SAAW,IAAI6I,GAAS,KAAK,eAAe,EAEjD,CAAA,EAAO,EAAI,MACZ,EAEO2I,EAAA,UAAA,uBAAA,UAAA,CAAA,IAOPxe,EAAA,KANO+N,EAAUZ,GAAqB,KAAK,WAAW,EACrDY,EAAQ,QAAQ,SAAA+Q,EAAM,CAChBA,EAAO,WAAa,MACtBA,EAAO,UAAU9e,EAAK,eAAe,CAEzC,CAAC,GAGKwe,EAAwB,UAAA,yBAAxB,SAAyBxR,EAAmB,CAA5C,IAOPhN,EAAA,KANO+N,EAAUZ,GAAqBH,CAAW,EAChDe,EAAQ,QAAQ,SAAA+Q,EAAM,CAChBA,EAAO,aAAe,MACxBA,EAAO,YAAY9e,EAAK,SAASgN,CAAW,CAAC,CAEjD,CAAC,GASKwR,EAAiB,UAAA,kBAAjB,SAAkBxR,EAAmB,CAArC,IAkDPhN,EAAA,KAhDO+e,EAAuB,KAAK,gBAAgB/R,CAAW,EAC7D,GAAI+R,GAAwB,KAC1B,MAAM,IAAI,MACN,6BAAA,OAA6B/R,EAAW,0BAAA,CAA0B,EAGxE,GAAI,CACF,IAAMzV,EAAUwnB,EAAqB,QAAO,EAM5C,GAAIxnB,GAAW,EAAEA,aAAmBG,KAChC,OAAOH,EAAQ,MAAS,WAAY,CACtC,IAAMynB,EAAY,EAAE,KAAK,qBACnBN,EACFnnB,EACK,KAAK,SAAA0nB,EAAe,CAEnB,OAAID,EAAYhf,EAAK,qBACZ,IAETA,EAAK,SAASgN,CAAW,EAAIiS,EAC7Bjf,EAAK,mBAAqB,KACnB,GACT,CAAC,EACA,MAAM,SAAAkf,EAAG,CAER,OAAIF,EAAYhf,EAAK,uBAGrBA,EAAK,mBAAqB,KAC1BwN,GAAS,6BAAA,OAA6BR,EAAW,SAAA,CAAS,EAC1DQ,GAAS0R,EAAI,OAASA,EAAI,OAAO,GAC1B,EACT,CAAC,EACT,YAAK,mBAAqBR,EACnB,CAAC,QAAOA,EAAE,UAAW,EAAI,CACjC,KACC,aAAK,SAAS1R,CAAW,EAAIzV,EACtB,CAAC,QAAS,GAAM,UAAW,EAAK,CAE1C,OAAQ2nB,EAAK,CACZ1R,OAAAA,GAAS,6BAAA,OAA6BR,EAAW,SAAA,CAAS,EAC1DQ,GAAS0R,EAAI,OAASA,EAAI,OAAO,EAC1B,CAAC,QAAS,GAAO,UAAW,EAAK,CACzC,GAGHV,EAAa,UAAA,cAAb,SAAcxR,EAAmB,CAC/B,GAAI,EAAEA,KAAe,KAAK,iBACxB,MAAM,IAAI,MAAM,GAAA,OAAGA,EAAW,gCAAA,CAAgC,EAE5D,KAAK,cAAgBA,GAAe,KAAK,oBAAsB,MAGjE,KAAK,uBAGHA,KAAe,KAAK,WACtB,KAAK,yBAAyBA,CAAW,EACzC,KAAK,SAASA,CAAW,EAAE,QAAO,EAClC,OAAO,KAAK,SAASA,CAAW,GAGlC,OAAO,KAAK,gBAAgBA,CAAW,EAGnC,KAAK,cAAgBA,IACvB,KAAK,mBAAqB,KAC1B,KAAK,YAAc,KACnB,KAAK,gBAAkB,OAInBwR,EAAA,UAAA,kBAAA,UAAA,CAAA,IASPxe,EAAA,KARC,GAAI,OAAO,KAAK,KAAK,eAAe,EAAE,SAAW,EAC/C,MAAM,IAAI,MAAM,+BAA+B,EAEjD,OAAO,OAAO,KAAK,KAAK,eAAe,EAAE,KAAK,SAACzG,EAAW9E,EAAS,CAEjE,OAAOuL,EAAK,gBAAgBvL,CAAC,EAAE,SAC3BuL,EAAK,gBAAgBzG,CAAC,EAAE,QAC9B,CAAC,GAGKilB,EAAA,UAAA,gCAAA,UAAA,CAIN,QAFMC,EAAiB,KAAK,kBAAiB,EAEpC/nB,EAAI,EAAGA,EAAI+nB,EAAe,OAAQ/nB,IAAK,CAC9C,IAAMsW,EAAcyR,EAAe/nB,CAAC,EAC9BkJ,EAAuB,KAAK,kBAAkBoN,CAAW,EAAxD0R,EAAO9e,EAAA,QAAE+e,EAAS/e,EAAA,UACzB,GAAI+e,GAAaD,EACf,MAAO,CAAC,KAAM1R,EAAa,UAAS2R,CAAA,CAEvC,CACD,MAAM,IAAI,MACN,wEACS,GAGfH,EAAA,UAAA,SAAA,SAASjnB,EAAwBE,EAAc,CAC7C,IAAM0nB,EAAO,KAAK,MAAM,WAAW,IAAI1nB,CAAM,EACvC2nB,EAAaD,EAAK,QAClBrnB,EAAS,KAAK,SAASL,CAAM,EAC7BQ,EAAWmnB,EAAW,SAAS3nB,CAAM,EAG3C2nB,EAAW,YAAY3nB,EAAQ,EAAI,EACnC0nB,EAAK,QAAU5nB,EACfA,EAAQ,KAAKE,EAAQK,EAAQqnB,EAAK,MAAOA,EAAK,MAAOlnB,CAAQ,EACzD,KAAK,uBAAsB,GAG7B,KAAK,MAAM,kBAAkB,KAAK,MAAM,kBAAkB,OAAS,CAAC,KAIxEumB,EAAA,UAAA,KAAA,SAAgCa,EAA6BzD,EAAe,CAA5E,IAkCC5b,EAAA,KAhCKU,EAAe,KACnB,GAAIkb,GAAM,KAAM,CAEd,GAAI,OAAOyD,GAAa,WACtB,MAAM,IAAI,MAAM,qCAAqC,EAEvDzD,EAAKyD,CACN,KAAM,CAEL,GAAI,OAAOA,GAAa,UAAY,EAAEA,aAAoB,QACxD,MAAM,IAAI,MACN,gFAC4B,EAElC,GAAI,OAAOzD,GAAO,WAChB,MAAM,IAAI,MACN,gFAC8B,EAEpClb,EAAO2e,CAGR,CACD,IAAI3pB,EACJ,OAAO,KAAK,UACR,UAAA,CAAM,OAAAsK,EAAK,WAAWU,CAAI,CAAC,EAAE,UAAM,CAAA,OAAAV,EAAK,SAAStK,CAAM,CAApB,EAAuB,UAAA,CACxD,OAAAA,EAASkmB,EAAE,EACPlmB,aAAkB,SACpB,QAAQ,MAAM,yCAAyC,EAElDA,CACT,CAAC,GAGC8oB,EAAA,UAAA,UAAA,SAAahhB,EAAmBmX,EAAiB5e,EAAU,CACjEyH,EAAK,EACL,GAAI,CACF,IAAM8U,EAAMvc,EAAC,EACb,OAAA4e,EAAG,EACIrC,CACR,OAAQgN,EAAI,CACX,MAAA3K,EAAG,EACG2K,CACP,GAIKd,EAAA,UAAA,aAAA,UAAA,CACN,OAAOA,EAAO,gBAIRA,EAAA,UAAA,eAAA,UAAA,CACN,OAAOA,EAAO,kBASRA,EAAK,UAAA,MAAL,SAAM5lB,EAAS,CACrB,IAAM5C,EAAYupB,EAAO,UAAU1Z,GACA,CAAC,EAACjN,CAAA,CAA8B,EAC7Dqd,EAAS,CAAC,EAACrd,CAAA,EACX4mB,EAAO,SAACC,EAAU,CAAK,MAAC,CAC5B,EAAG,UAAA,CACD,IAAMznB,EAAQ,UACR0nB,EAAa,CAAC,EAAGD,CAAE,EACnBE,EAAQ,CAAC,MAAK3nB,CAAA,EAEpB,OAAOunB,EAAO,UACHxc,GAAM2c,EAENC,CAAgC,GAE7C,EACIC,EAAkB,CAAA,EACxB,YAAK,YAAY,KAAK,MAAM,YAAY,KAAM3J,EAAQ,CAACjgB,CAAC,EAAGwpB,EAAMI,EAAO,CAAA,CAAE,EACnE5pB,GAgBTwoB,EAAA,UAAA,UAAA,SACItmB,EAAoB+d,EAAwB0J,EAAoB,CAC9D,KAAK,aAAe,MAMtB,KAAK,QAEP,IAAME,EAAY9S,GAAU7U,EAAY,KAAK,WAAW,GAAK,KAC7D,GAAI,CAAC2nB,EACH,MAAM,IAAI,MAAM,WAAW,OAAA3nB,EACvB,gCAAA,EAAA,OAAA,KAAK,YAAc,GAAA,CAAA,EAEzB,OAAO,KAAK,cAAc,CAAC,WAAUA,EAAE,OAAM+d,EAAE,MAAK0J,CAAA,CAAC,GAG/CnB,EAAA,UAAA,uBAAA,UAAA,CACN,OAAO,KAAK,IAAI,QAAQ,SAAS,GAG3BA,EAAA,UAAA,sBAAA,SACJtmB,EAAoB4nB,EACpBC,EAAsB,CACxB,IAAMC,EAAkB,KAAK,QAAQ,WAAU,EAG3CC,EAAmB,EACvBF,EAAS,QAAQ,SAAAZ,EAAI,CAGnBc,GAAqBd,EAAK,QAAU,YAAc,EAAI,CACxD,CAAC,EAOD,IAAMe,EACF,KAAK,MAAM,kBAAkB,KAAK,MAAM,kBAAkB,OAAS,CAAC,EAClEC,EACFH,EAAkBF,EAAmBG,EAAmBC,EAC5D,GAAIC,EAAgB,EAClB,MAAM,IAAI,MACN,YAAA,OAAY,KAAK,YAA2C,gCAAA,EAC5D,IAAA,OAAIA,EAAa,4BAAA,EAAA,OAA6BjoB,EAAU,GAAA,CAAG,GAS3DsmB,EAAa,UAAA,cAAb,SACJ4B,EACgC,CAF5B,IAqJPpgB,EAAA,KAlJKkW,EACA0J,EAAkB,CAAA,EAChBS,EAAW,KAAK,SAAQ,EAExBC,EAAoB,KAAK,MAAM,SAC/BC,EAAqB,KAAK,MAAM,WAElC,KAAK,uBAAsB,GAC7B,KAAK,MAAM,kBAAkB,KAAK,CAAC,EAGrC,IAAIC,EACA,KAAK,aAAe,MAMtB,KAAK,QAGP,IAAIC,EAEEC,EAAoBtC,GAA6BgC,CAAY,EAC/DA,EAAa,WACb,KAAK,MAAM,aAAe,KAAO,KAAK,MAAM,YAAY,KAAO,GAMnE,GAAIhC,GAA6BgC,CAAY,EAAG,CACvC,IAAAO,EAA6BP,EAAY,WAA7BQ,EAAiBR,EAAY,OAArBS,EAAST,EAAY,MAC5C,KAAK,aAAe,MAMtB,KAAK,QAEP,IAAMU,EAAS/T,GAAU4T,EAAY,KAAK,WAAW,EACrDxF,EACI2F,GAAU,KACV,UAAM,CAAA,MAAA,kCAAA,OAAkCH,EAAU,iBAAA,EAAA,OAC9C3gB,EAAK,YAAW,GAAA,CADd,CACiB,EAE3BwgB,EAAa,UAAA,CACX,IAAMV,EAAmB9f,EAAK,QAAQ,WAAU,EAChDygB,EAAMK,EAAO,WAAW,CAAC,OAAMF,EAAE,MAAKC,EAAE,QAAS7gB,EAAK,OAAO,CAAC,EAC9D,IAAM+f,EAAW,MAAM,QAAQU,CAAG,EAAIA,EAAM,CAACA,CAAG,EAC5CzgB,EAAK,uBAAsB,GAC7BA,EAAK,sBAAsB2gB,EAAYb,EAAkBC,CAAQ,EAGnE,IAAMgB,EAAahB,EAAS,IAAI,SAACiB,EAA0B,CAIzD,OAAKA,EAAmB,MAAQ,KACvBA,EAEFhhB,EAAK,yBAAyBghB,CAAO,CAC9C,CAAC,EAOD,GAAIX,EAAU,CACZ,IAAMY,EACFjhB,EAAK,sBAAsB2gB,EAAYC,EAAQG,CAAU,EAC7DnB,EAAQ5f,EAAK,2BAA2BihB,CAAa,CACtD,CACD,OAAOF,CACT,CACD,KAAM,CACE,IAAAG,EAAed,EAAY,YAE5Be,EAAyB,SAACC,EAAO,CAIhCf,IAGLT,EAAQwB,EAAQ,IAAI,SAAA1D,EAAU,CAAA,OAAA1d,EAAK,KAAKA,EAAK,MAAM0d,CAAM,CAAC,CAAC,CAAA,EAC7D,EAEA8C,EAAa,UAAA,CACX,IAAMV,EAAmB9f,EAAK,QAAQ,WAAU,EAChDygB,EAAMzgB,EAAK,KAAK,UAAA,CAAM,OAAAkhB,EAAYlhB,EAAK,QAASmhB,CAAQ,CAAlC,CAAmC,EACzD,IAAME,EAAQ,MAAM,QAAQZ,CAAG,EAAIA,EAAM,CAACA,CAAG,EAC7C,OAAIzgB,EAAK,uBAAsB,GAE7BA,EAAK,sBAAsB0gB,EAAmBZ,EAAkBuB,CAAI,EAE/DA,CACT,CACD,CAKM,IAAApL,EAAiBmK,EAAY,OAArBT,EAASS,EAAY,MAC9BkB,EAAgBlD,GAA6BgC,CAAY,EAC3D,KACAA,EAAa,cAEbzJ,EACJ,YAAK,UAED,UAAM,CAAA,OAAA3W,EAAK,MAAM,aAAa,EAAE,UAAA,CAAM,OAAAA,EAAK,MAAM,aAAa,EAAE,UAAA,CAC1D,CAACA,EAAK,IAAI,QAAQ,OAAO,GAAK,CAACA,EAAK,MAAM,UAC5CkW,EAAUsK,EAAU,GAEpB7J,EAAgB3W,EAAK,SAAS,cAC1B0gB,EAAmBzK,EAAQ,UAAA,CAAM,OAAAuK,EAAU,CAAV,CAAY,EAC7CxgB,EAAK,IAAI,QAAQ,OAAO,GAC1BA,EAAK,SAAS,iBAAiB2W,CAAa,EAE9CT,EAAUS,EAAc,QAE5B,CAAC,EAED0J,GACF,KAAK,YACDK,EAAmBzK,EAAQC,EAASoL,EAAe1B,EAAOD,CAAK,EAGjE,KAAK,MAAM,WACb,KAAK,MAAM,cAAc,QAAQ,KAAK,CACpC,KAAMe,EACN,WAAY,KAAK,MAAM,SAAWJ,EAClC,mBAAoB,KAAK,MAAM,SAC/B,aAAc,KAAK,MAAM,WAAaC,EACtC,qBAAsB,KAAK,MAAM,WACjC,YAAa,OAAO,KAAKtK,CAAM,EAAE,IAC7B,SAAA7V,EAAO,CAAA,OAAA6V,EAAO7V,CAAG,GAAK,KAAO6V,EAAO7V,CAAG,EAAE,MAAQ,IAAI,CAAA,EACzD,aAAc8V,EAAQ,IAAI,SAAAqL,EAAQ,CAAA,OAAAA,EAAK,KAAK,CAAA,EAC5C,aAAc5K,EAAc,OAC5B,UAAWA,EAAc,SAC1B,CAAA,EAEK,MAAM,QAAQ8J,CAAG,EAAIvK,EAAUA,EAAQ,CAAC,GAQ1CsI,EAA0B,UAAA,2BAA1B,SAA2B4C,EAAiB,CAA5C,IAGPphB,EAAA,KAFO4f,EAAQwB,EAAQ,IAAI,SAAA1D,EAAU,CAAA,OAAA1d,EAAK,KAAKA,EAAK,MAAM0d,CAAM,CAAC,CAAC,CAAA,EACjE,OAAOkC,GAUDpB,EAAA,UAAA,sBAAA,SACJtmB,EAAoB+d,EACpBC,EAAiB,CACnB,IAAMsL,EAAatU,GAAYhV,CAAU,EACzC,GAAIspB,GAAc,KAAM,CACtB,IAAMC,EAAyBD,EAAW,cAAgB,CAAA,EACpDE,EAA2BF,EAAW,eAAiB,CAAA,EAIzDG,EAA4B,OAC5BH,EAAW,eACbrG,EACI,MAAM,QAAQlF,CAAM,EACpB,UAAA,CAAM,MAAA,wDAAA,CAAwD,EAElE0L,EAAqB,OAAO,KAAK1L,CAAM,EAAE,IAAI,SAAC7V,EAAG,CAAK,OAAA6V,EAAO7V,CAAG,CAAC,CAAA,GAEjEuhB,EAAqBF,EAAa,IAAI,SAAC1J,EAAS,CAAK,OAAA9B,EAAO8B,CAAS,CAAhB,CAAiB,EAGxE,IAAM6J,EACF1L,EAAQ,OAAO,SAACrgB,EAAGa,EAAM,CAAA,OAAAgrB,EAAchrB,CAAC,CAAf,CAAgB,EAE7C,OAAOirB,EAAmB,OAAOC,CAAmB,CACrD,CAOD,MAAO,CAAA,GAQTpD,EAAU,UAAA,WAAV,SACI1mB,EAAoBC,EAAiBC,EACrCT,EAAuB,CACzB,GAAIO,GAAU,KACZ,MAAM,IAAI,MAAM,+CAA+C,EAEjEE,EAAQA,GAAS,UACjBT,EAAUA,GAAW,KAAK,QAC1B,IAAIsqB,EAAc/pB,EACdE,IAAU,UAAY8pB,GAAchqB,EAAO,CAAC,CAAC,IAC/C+pB,EAAe/pB,EAAoB,IAAI,SAAAtD,EAAK,CAAA,OAAAutB,GAAkBvtB,CAAC,CAAnB,CAAoB,GAElE,IAAMiD,EAASF,EAAQ,MAAMsqB,EAAa9pB,EAAOC,CAAK,EAChDlC,EAAI,IAAIimB,GAAOhkB,EAAOC,EAAOP,EAAQ,KAAK,aAAY,CAAE,EAI9D,GAHA,KAAK,YAAY3B,EAAGyB,CAAO,EAGvBS,IAAU,SAAU,CACtB,IAAMmnB,EAAO,KAAK,MAAM,WAAW,IAAI1nB,CAAM,EACvCuqB,EAAWhlB,GAAqB6kB,CAA2B,EACjE,KAAK,MAAM,UAAYG,EAAW7C,EAAK,MACvCA,EAAK,MAAQ6C,CACd,CACD,OAAOlsB,GAST0oB,EAAoB,UAAA,qBAApB,SACE/mB,EAAgBM,EAAiBC,EACjCT,EAAuB,CACvBS,EAAQA,GAAS,UACjB,IAAMiqB,EAAyB,CAAC,OAAMxqB,EAAE,MAAKM,EAAE,MAAKC,CAAA,EACpD,OAAO,KAAK,yBAAyBiqB,EAAY1qB,CAAO,GAQ1DinB,EAAA,UAAA,yBAAA,SAAyByD,EAAwB1qB,EAAuB,CAE/D,IAAAE,EAAwBwqB,EAAU,OAA1BlqB,EAAgBkqB,EAAU,MAAnBjqB,EAASiqB,EAAU,MACnCnsB,EAAI,IAAIimB,GAAOhkB,EAAOC,EAAOP,EAAQ,KAAK,aAAY,CAAE,EAC9D,YAAK,YAAY3B,EAAGyB,CAAO,EACpBzB,GAGT0oB,EAAY,UAAA,aAAZ,SACIjC,EAAsBL,EAAkBxb,EACxC1I,EAAgB,CADMkkB,IAAA,SAAAA,EAAgB,IAExCxb,EAAOA,GAAQ,KAAK,eAAc,EAAG,SAAQ,EACzC1I,GAAS,MAAQA,IAAUukB,EAAa,QAC1CA,EAAeA,EAAa,KAAKvkB,CAAK,GAExC,IAAM5B,EAAI,IAAIimB,GAASE,EAAcL,EAAWxb,EAAM,KAAK,aAAY,CAAE,EACzE,GAAI,KAAK,MAAM,oBAAoBtK,EAAE,IAAI,GAAK,KAC5C,MAAM,IAAI,MAAM,sBAAA,OAAsBA,EAAE,KAA6B,yBAAA,CAAA,EAEvE,YAAK,MAAM,oBAAoBA,EAAE,IAAI,EAAIA,EACzC,KAAK,OAAOA,EAAG,KAAK,OAAO,EACpBA,GAGTooB,EAAA,UAAA,YAAA,SAAYjlB,EAAWhC,EAAsB,CAC3C,KAAK,MAAM,aACPgC,EAAE,QAAU,UACd,KAAK,MAAM,mBAIb,IAAI0D,EAAQ,EACR1D,EAAE,QAAU,aAAeA,EAAE,QAAU,WACzC0D,EAAQ1D,EAAE,KAAO2oB,GAAqB3oB,EAAE,KAAK,GAE/C,KAAK,MAAM,UAAY0D,EAElB,KAAK,MAAM,WAAW,IAAI1D,EAAE,MAAM,IACrC,KAAK,MAAM,iBACX,KAAK,MAAM,WAAW,IAAIA,EAAE,OAAQ,CAClC,QAAShC,GAAW,KAAK,QACzB,MAAOgC,EAAE,MACT,MAAOA,EAAE,MACT,MAAK0D,CACN,CAAA,GAGG1D,aAAa8iB,IACjB,KAAK,MAAM9iB,CAAC,GAShBilB,EAAA,UAAA,OAAA,SAAOjlB,EAAWhC,EAAsB,CACtC,KAAK,YAAYgC,EAAGhC,CAAO,EAC3B,KAAK,QAAQ,OAAOgC,EAAE,MAAM,GAG9BilB,EAAA,UAAA,aAAA,SAAa/mB,EAAgBF,EAAsB,CAC7C,KAAK,MAAM,WAAW,IAAIE,CAAM,GAChC,KAAK,MAAM,WAAW,IAAIA,CAAM,EAAE,UAAYF,IAChD,KAAK,MAAM,WAAW,OAAOE,CAAM,EACnC,KAAK,MAAM,mBAGf+mB,EAAa,UAAA,cAAb,SAAcjlB,EAAS,CACrB,GAAK,KAAK,MAAM,WAAW,IAAIA,EAAE,MAAM,EAGvC,KAAM4lB,EAAO,KAAK,MAAM,WAAW,IAAI5lB,EAAE,MAAM,EAS/C,GAPA,KAAK,MAAM,aACPA,EAAE,QAAU,WACd,KAAK,MAAM,mBACX,KAAK,MAAM,UAAY4lB,EAAK,OAI1B5lB,EAAE,QAAU,aAAeA,EAAE,QAAU,SAAU,CACnD,IAAM0D,EAAQ1D,EAAE,KAAO2oB,GAAqB3oB,EAAE,KAAK,EACnD,KAAK,MAAM,UAAY0D,CACxB,CAGGkiB,EAAK,QAAQ,YAAY5lB,EAAE,MAAM,GACnC,KAAK,aAAaA,EAAE,OAAQ4lB,EAAK,OAAO,IAQ5CX,EAAA,UAAA,iBAAA,UAAA,CACE,QAAW2D,KAAW,KAAK,MAAM,oBAAqB,CACpD,IAAM/rB,EAAI,KAAK,MAAM,oBAAoB+rB,CAAO,EAChD,KAAK,gBAAgB/rB,CAAC,CACvB,GAGHooB,EAAe,UAAA,gBAAf,SAAgBpoB,EAAW,CACzB,KAAK,cAAcA,CAAC,EAChB,KAAK,MAAM,oBAAoBA,EAAE,IAAI,GAAK,MAC5C,OAAO,KAAK,MAAM,oBAAoBA,EAAE,IAAI,GAIhDooB,EAAA,UAAA,OAAA,UAAA,CACE,IAAMW,EAAO,KAAK,QAAQ,OAAM,EAChC,OAAAA,EAAK,WAAa,KAAK,MAAM,WAC7BA,EAAK,eAAiB,KAAK,MAAM,eACjCA,EAAK,SAAW,KAAK,MAAM,SACvB,KAAK,MAAM,iBAAmB,IAChCA,EAAK,WAAa,GACdA,EAAK,SAAW,OAClBA,EAAK,QAAU,CAAA,GAEjBA,EAAK,QAAQ,KACT,uEACyB,GAExBA,GAGHX,EAAO,UAAA,QAAb,SAAc4D,EAAyD,qHAErE,YAAK,MAAM,UAAY,GAEjBC,EAAa,KAAK,MAAM,SACxBC,EAAkB,KAAK,MAAM,WAEnC,KAAK,MAAM,cAAc,QAAU,CAAA,EACnC1iB,EAAA,KAAK,MAAM,cAA6B,CAAA,EAAAwiB,EAAK,CAAE,SAA/CxiB,EAAyB,OAAS2iB,EAAA,KAAA,EAElC,KAAK,MAAM,UAAY,GAEvB,KAAK,MAAM,cAAc,UAAY,KAAK,IAAL,MAAA,KAC9BxrB,GAAA,CAAA,EAAAJ,EAAA,KAAK,MAAM,cAAc,QAAQ,IAAI,SAAA,EAAC,CAAI,OAAA,EAAE,kBAAkB,CAAA,CAAC,EAAA,EAAA,CAAA,EACtE,KAAK,MAAM,cAAc,SAAW,KAAK,MAAM,SAAW0rB,EAC1D,KAAK,MAAM,cAAc,WACrB,KAAK,MAAM,WAAaC,2CACPziB,EAAAvJ,GAAA,KAAK,MAAM,cAAc,OAAO,EAAAwJ,EAAAD,EAAA,KAAA,wCAA1Cif,EAAMhf,EAAA,MACf0iB,EAAA1D,EAA4B,CAAA,EAAAA,EAAO,YAAY,UAA/C,OAAA0D,EAAO,aAAeD,EAAA,KAAA,EACtBE,EAAA3D,EAAyB,CAAA,EAAAA,EAAO,SAAS,SAAzC2D,EAAO,UAAYF,EAAA,KAAA,+LAErB,IAAA,IAAA,MAAA,CAAA,EAAO,KAAK,MAAM,aAAa,MAChC,EAED/D,EAAA,UAAA,SAAA,UAAA,CACE,OAAO,KAAK,MAAM,cAAgB,GAAK,KAAK,MAAM,cAAgB,GAG5DA,EAAA,UAAA,YAAA,SACJtmB,EAAoB+d,EAAwBC,EAC5CwM,EAAyB9C,EAAiBD,EAAmB,CAFzD,IA4BP3f,EAAA,KAzBO2iB,EACF,CAAC,GAAI,KAAK,MAAM,iBAAkB,WAAUzqB,EAAE,OAAM+d,EAAE,QAAOC,EAAE,MAAK0J,CAAA,EAElE4B,EAAatU,GAAYhV,CAAU,EACrCspB,GAAc,OAChBkB,EAAgBlB,EAAW,UAEzBkB,GAAiB,OACnBC,EAAS,SAAW,SAAChK,EAAa,CAGhC,OAAAA,EAAMA,EAAI,IAAI,SAAC8G,EAAI/oB,EAAC,CAClB,GAAI+oB,GAAM,KAAM,CACd,IAAMjJ,EAASN,EAAQxf,CAAC,EAClB+F,EAAOmmB,GAAyBpM,EAAO,KAAMA,EAAO,KAAK,EAC/D,OAAOxW,EAAK,WAAWvD,EAAM+Z,EAAO,MAAOA,EAAO,KAAK,CACxD,CACD,OAAOiJ,CACT,CAAC,EAGMiD,EAAc/J,EAAI,OAAS,EAAIA,EAAMA,EAAI,CAAC,EAAGiH,EAAOD,CAAK,CAClE,GAEF,KAAK,MAAM,WAAW,KAAKgD,CAAQ,GAGrCnE,EAAI,UAAA,KAAJ,SAAuB9oB,EAAS,CAC9B,OAAAA,EAAO,KAAO,GACPA,GAGD8oB,EAAA,UAAA,UAAA,UAAA,CACF,KAAK,MAAM,gBAAkB,IAC/B,KAAK,MAAM,WAAa,CAAA,GAE1B,KAAK,MAAM,iBAGLA,EAAA,UAAA,QAAA,UAAA,CACN,KAAK,MAAM,iBAObA,EAAU,UAAA,WAAV,SAAW9d,EAAa,CACtB,IAAMmiB,EAAwB,CAC5B,MAAO,CAAA,EACP,KAAM,gBACN,GAAI,KAAK,MAAM,eAEbniB,IACFmiB,EAAU,KAAOniB,GAEnB,KAAK,MAAM,WAAW,KAAKmiB,CAAS,EACpC,KAAK,MAAM,YAAcA,GAO3BrE,EAAQ,UAAA,SAAR,SAAS9oB,EAAwB,CAM/B,QAoBDsK,EAAA,KAzBO8iB,EAAyBlF,GAAsBloB,CAAM,EACrDqtB,EACF,IAAI,IAAID,EAAuB,IAAI,SAAAhtB,EAAK,CAAA,OAAAA,EAAE,EAAE,CAAA,CAAC,EAGxCY,EAAI,EAAGA,EAAI,KAAK,MAAM,YAAY,MAAM,OAAQA,IAAK,CAC5D,IAAMgnB,EAAS,KAAK,MAAM,YAAY,MAAMhnB,CAAC,EACzC,CAACgnB,EAAO,MAAQ,CAACqF,EAA0B,IAAIrF,EAAO,EAAE,GAC1DA,EAAO,QAAO,CAEjB,CAED,IAAMsF,EAAW,KAAK,MAAM,WAAW,IAAG,EAC1C,KAAK,MAAM,YAAc,KAAK,MAAM,WAAW,SAAW,EACtD,KACA,KAAK,MAAM,WAAW,KAAK,MAAM,WAAW,OAAS,CAAC,EAG1DF,EAAuB,QAAQ,SAAApF,EAAM,CAG/B,CAACA,EAAO,MAAQA,EAAO,UAAYsF,EAAS,IAC9ChjB,EAAK,MAAM0d,CAAM,CAErB,CAAC,GASHc,EAAS,UAAA,UAAT,SACIzoB,EAAY2hB,EAAc+H,EAC1BwD,EAAwB,CAF5B,IAkDCjjB,EAAA,KA7CC,GAHEijB,IAAA,SAAAA,EAAwB,IAC1B9H,EACIzD,EAAG,OAAS,EAAG,UAAA,CAAM,MAAA,2CAAA,CAA2C,EAChE+H,GAAM,MAAQA,EAAG,QAAU,UAC7B,MAAM,IAAI,MAAM,0CAAA,OAA0CA,EAAG,MAAQ,GAAA,CAAA,EAGvE,IAAMzpB,EAAI,KAAK,UACX,UAAM,CAAA,OAAAgK,EAAK,UAAS,CAAE,EAAE,UAAA,CAAM,OAAAA,EAAK,QAAO,CAAZ,EAC9B,UAAA,CAAM,OAAAA,EAAK,KAAK,UAAWjK,CAAC,CAAtB,CAAuB,EAEjColB,EACInlB,aAAa+lB,GACb,UAAA,CAAM,MAAA,gDAAA,CAAgD,EAE1D,IAAM5D,EAAeX,GAAqB,KAAK,MAAM,WAAYE,EAAI1hB,CAAC,EACtE,GAAI,CAACitB,GAAoB9K,EAAa,SAAW,GAAKT,EAAG,OAAS,EAChE,MAAM,IAAI,MACN,qIAEO,EAGb,OAAO,KAAK,KAAK,WAAY,UAAA,CAC3B,IAAMwL,EAAuD,CAAA,EAC7DA,EAAuBltB,EAAE,EAAE,EAAKypB,GAAc0D,GAAKntB,EAAE,KAAK,EAG1DuiB,GACI2K,EAAwB/K,EAExB,SAAApiB,EAAK,CAAA,OAAAiK,EAAK,KAAKjK,CAAoB,CAAC,EAEpC2iB,EAAG,EACP,IAAM0K,EAAQ1L,EAAG,IAAI,SAAA9e,EAAC,CAAI,OAAAsqB,EAAuBtqB,EAAE,EAAE,CAA3B,CAA4B,EAEtD,OAAIoH,EAAK,MAAM,gBAAkB,IAG/BA,EAAK,MAAM,WAAW,QAAQ,SAAA6X,EAAI,aAChC,QAAqBhY,EAAAvJ,GAAAuhB,EAAK,KAAK,EAAA/X,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAA5B,IAAM6d,EAAM5d,EAAA,MACf4d,EAAO,QAAO,CACf,mGACH,CAAC,EACD1d,EAAK,MAAM,WAAa,MAEnB,CAAC,MAAOhK,EAAG,MAAKotB,CAAA,CACzB,CAAC,GAGH5E,EAAU,UAAA,WAAV,SAA6BzoB,EAAwB,CAArD,IA2DCiK,EAAA,KAzDCmb,OAAAA,EACIkI,GAAgBttB,CAAC,EACjB,UAAA,CAAM,MAAA,mDAAA,CAAmD,EACtD,UAAA,SAAoBkgB,EAAA,CAAA,EAAAzV,EAAA,EAAnBA,EAAmB,UAAA,OAAnBA,IAAAyV,EAAmBzV,CAAA,EAAA,UAAAA,CAAA,EACzB2a,EACIlF,EAAO,MAAM,SAAAngB,EAAC,CAAI,OAAAA,aAAaimB,EAAb,CAAmB,EACrC,UAAA,CAAM,MAAA,kEACO,CAAA,EAEjB,IAAIzJ,EAIEgR,EAA2B,CAAA,EACjCrN,EAAO,QAAQ,SAACoB,EAAO3gB,EAAC,CACtB4sB,EAAS5sB,CAAC,EAAI2gB,CAChB,CAAC,EAED,IAAMkM,EAA8B,SAAC1tB,EAAG2tB,EAAI,CAC1C,OAAAlR,EAAMvc,EAAC,MAAA,OAAAgB,GAAA,CAAA,EAAAJ,EAAAI,GAAAA,GAAA,CAAA,EAAAJ,EAAQsf,CAAM,EAAE,EAAA,EAAA,CAAAuN,CAAI,EAAA,EAAA,CAAA,EAAA,EAAA,CAAA,EAC3BrI,EACI7I,EAAI,iBAAiByJ,GACrB,UAAM,CAAA,MAAA,4FACoC,CAAA,EAC9CZ,EACIkI,GAAgB/Q,EAAI,QAAQ,EAC5B,UAAA,CAAM,MAAA,kGAC0C,CAAA,EAC7CA,EAAI,KACb,EAEMgP,EAAgB,SAAC7B,EAAOG,EAAe,CAC3C,IAAM6D,EAAUnR,EAAI,SAASmN,EAAIG,CAAK,EAChCwD,EAAkB,MAAM,QAAQK,CAAO,EAAIA,EAAU,CAACA,CAAO,EACnEtI,EACIiI,EAAM,SAAWnN,EAAO,OACxB,UAAA,CAAM,MAAA,qKAEsD,CAAA,EAChEkF,EACIiI,EAAM,MAAM,SAAAttB,EAAC,CAAI,OAAAA,aAAaimB,EAAb,CAAmB,EACpC,UAAA,CAAM,MAAA,sIAEuB,CAAA,EACjC,IAAM2H,EAAyC,CAAA,EAC/C,OAAAN,EAAM,QAAQ,SAAC5D,EAAM9oB,EAAC,CACpBgtB,EAAQhtB,CAAC,EAAI,UAAA,CAAM,OAAA8oB,CAAA,CACrB,CAAC,EACMkE,CACT,EAEA,OAAO1jB,EAAK,cAAc,CACxB,YAAWujB,EACX,cAAajC,EACb,OAAQgC,CACT,CAAA,CACH,GAGF9E,EAAQ,UAAA,SAAR,SAAS/mB,EAAc,CAErB,IAAM0nB,EAAO,KAAK,MAAM,WAAW,IAAI1nB,CAAM,EAC7C,OAAO0nB,EAAK,QAAQ,SAAS1nB,CAAM,GAErC+mB,EAAI,UAAA,KAAJ,SAAK/mB,EAAc,CAEjB,IAAM0nB,EAAO,KAAK,MAAM,WAAW,IAAI1nB,CAAM,EAC7C,OAAO0nB,EAAK,QAAQ,KAAK1nB,CAAM,GAGjC+mB,EAAA,UAAA,UAAA,SAAU/mB,EAAgBG,EAA0B,CAElD,IAAMunB,EAAO,KAAK,MAAM,WAAW,IAAI1nB,CAAM,EAC7C,OAAO0nB,EAAK,QAAQ,UAAU1nB,EAAQG,CAAO,GAGzC4mB,EAAI,UAAA,KAAV,SAAW4D,EAAiB,mGACpB,OAAA5kB,EAAQ4X,GAAG,EACQ,CAAA,EAAA,KAAK,QAAQ,KAAKgN,CAAK,CAAe,SAAzD,OAAAuB,EAAa/jB,EAA4C,KAAA,EAC/D+jB,EAAW,OAASvO,GAAG,EAAK5X,EAC5B,CAAA,EAAOmmB,CAAU,MAClB,EAQOnF,EAAK,UAAA,MAAL,SAAwB9oB,EAAS,CACvC,OAAI,KAAK,MAAM,aAAe,OAC5BA,EAAO,QAAU,KAAK,MAAM,YAAY,GACxC,KAAK,MAAM,YAAY,MAAM,KAAKA,CAAM,GAGnCA,GAGT,OAAA,eAAI8oB,EAAmB,UAAA,sBAAA,CAAvB,IAAA,UAAA,CACE,OAAO,KAAK,MAAM,kDACnB,CAAA,EAMDA,EAAA,UAAA,MAAA,UAAA,CAEE,KAAK,uBAEL,KAAK,MAAM,QAAO,EAClB,KAAK,IAAI,MAAK,EACd,KAAK,MAAQ,IAAIF,GAEjB,QAAWtR,KAAe,KAAK,SAC7B,KAAK,yBAAyBA,CAAW,EACzC,KAAK,SAASA,CAAW,EAAE,QAAO,EAClC,OAAO,KAAK,SAASA,CAAW,EAElC,KAAK,YAAc,KACnB,KAAK,gBAAkB,KACvB,KAAK,mBAAqB,YAvxBbwR,GAAY,aAAG,EAKfA,GAAc,eAAG,EAsxBlC,SAAS2E,GAAKprB,EAAe,CAC3B,IAAMD,EAASwG,GAAmBnE,GAAcpC,CAAK,EAAG,SAAS,EACjE,OAAOwnB,EAAO,WAAWznB,EAAQC,EAAO,SAAS,CACnD,UAEgB6rB,IAAe,CAC7B,IAAM3iB,EAAKD,GAAkB,EAC7B,GAAIC,EAAG,WAAa,KAAM,CACxB,IAAMH,EAAc,IAAI5B,GAAY+B,CAAE,EACtCA,EAAG,UAAY,IAAIud,GAAO1d,CAAW,CACtC,CACD,OAAAD,GAAqBI,EAAG,UAAU,GAAG,EAIrC0a,GAAiB,UAAA,CAAM,OAAA1a,EAAG,SAAS,CAAA,EAC5BA,EAAG,SACZ,CAEO,IAAMse,EAASqE,GAAe,EAQrB,SAAAlL,GAAInf,EAAW9E,EAAS,CAEtC,IAAMwhB,EAAS,CAAC,EAAC1c,EAAE,EAAC9E,CAAA,EACpB,OAAO8qB,EAAO,UAAU7d,GAAKuU,CAAmC,CAClE,CChxCA,SAAS4N,IAAmB,CAC1B,OAAO,OAAO,UAAc,KAAe,WAAa,IAC1D,CAEA,IAAIC,GAEE,SAAUC,GAAa5uB,EAAwB,CACnD2uB,GAAoB3uB,CACtB,CAEM,SAAU6uB,GAASC,EAAe,CACtC,GAAIH,KAAsB,OACxB,OAAOA,GAET,GAAIG,GAAOJ,GAAmB,EAAI,CAIhC,GAHKI,IACHA,EAAM,WAEJA,EAAI,UAAY,cAClB,MAAO,GAGT,IAAM1qB,EAAI0qB,EAAI,WAAaA,EAAI,SAE1B,OAAO,OAAW,IAAe,OAAe,MAAQ,IAE7D,GAAI,CAAC1qB,EAAG,CAEN,IAAM2qB,EAASD,EACf,OAAOC,EAAO,eAAiBA,EAAO,cAAc,MACrD,CAED,MAAO,2TACK,KAAK3qB,CAAC,GAEd,0kDACK,KAAKA,EAAE,OAAO,EAAG,CAAC,CAAC,CAC7B,CACD,MAAO,EACT,UAEgB4qB,IAAS,CACvB,OAAQ,OAAO,OAAW,KAAe,OAAO,UAAY,MAEvD,OAAO,kBAAsB,GACpC,kEC1CA,IAAMvjB,GAAMrB,GAAG,EAOfqB,GAAI,aAAa,QAAS,UAAA,CAAM,MAAA,EAAA,EAAO,SAAAwjB,EAAU,CAC3CA,GACF,QAAQ,KACJ,6IAEyC,CAEjD,CAAC,EAGDxjB,GAAI,aAAa,aAAc,UAAM,CAAA,OAAAyjB,GAAqB,CAArB,CAAuB,EAG5DzjB,GAAI,aACA,UACA,UAAA,CAAM,OAAC,OAAO,QAAY,KACrB,OAAO,QAAQ,SAAa,KAC5B,OAAO,QAAQ,SAAS,KAAS,GAAY,CAAA,EAGtDA,GAAI,aACA,YACA,UAAM,CAAA,OAAA,OAAO,UAAc,KAAe,WAAa,MACnD,UAAU,WAAa,MAAQ,SAAS,KAAK,UAAU,SAAS,GAChE,aAAa,KAAK,UAAU,MAAM,CAAC,CAAA,EAG3CA,GAAI,aACA,YACA,UAAM,CAAA,OAAA,OAAO,UAAc,KAAe,WAAa,MACnD,UAAU,WAAa,MAAQ,SAAS,KAAK,UAAU,SAAS,GAChE,QAAQ,KAAK,UAAU,MAAM,CAAC,CAAA,EAKtCA,GAAI,aAAa,OAAQ,UAAM,CAAA,MAAA,EAAK,CAAA,EAMpCA,GAAI,aACA,qCAAsC,UAAA,CAAM,OAAAA,GAAI,QAAQ,OAAO,CAAnB,CAAoB,EAGpEA,GAAI,aAAa,+BAAgC,UAAM,CAAA,MAAA,EAAI,CAAA,EAG3DA,GAAI,aAAa,UAAW,UAAM,CAAA,MAAA,EAAK,CAAA,EAGvCA,GAAI,aAAa,+BAAgC,UAAA,CAAM,OAAAA,GAAI,QAAQ,OAAO,CAAnB,CAAoB,EAG3EA,GAAI,aAAa,sBAAuB,UAAM,CAAA,MAAA,EAAK,CAAA,EAGnDA,GAAI,aAAa,wCAAyC,UAAM,CAAA,MAAA,EAAK,CAAA,EAGrEA,GAAI,aAAa,uBAAwB,UAAM,CAAA,MAAA,EAAK,CAAA,ECjEpC,SAAA0jB,GACZvrB,EAAsCf,EAAgB,CACxD,IAAIusB,EAAwBxrB,EAE5B,GAAI0c,GAAa1c,CAAG,EAClB,OAAOf,IAAU,SAAW,CAAA,EAAK,CAACe,EAAI,MAAM,EAG9C,GAAIskB,GAAYtkB,CAAG,EAAG,CACpB,IAAMyrB,EAAezrB,EAAI,UAAY,OACrC,MAAO,CAACA,EAAI,OAAQA,EAAI,MAAQyrB,EAAa,MAAM,CACpD,SAAUlH,GAAavkB,CAAG,EACzB,MAAO,CAACA,EAAI,OAAO,MAAQf,GAAS,KAAO,EAAI+E,GAAgB/E,CAAK,EAAE,EAExE,GAAI,CAAC,MAAM,QAAQe,CAAG,EACpB,MAAO,CAAA,EAIT,QAFMhB,EAAkB,CAAA,EAEjB,MAAM,QAAQwsB,CAAS,GACvB9O,GAAa8O,CAAS,GAAKvsB,IAAU,UAC1CD,EAAM,KAAKwsB,EAAU,MAAM,EAC3BA,EAAYA,EAAU,CAAC,EAEzB,OAAI,MAAM,QAAQxrB,CAAG,GACjBwG,GAAG,EAAG,QAAQ,oCAAoC,GACpDklB,GAA2B1rB,EAAKhB,EAAO,CAAA,CAAE,EAGpCA,CACT,CAEA,SAAS0sB,GACL1rB,EAAiBhB,EAAiB2sB,EAAiB,CAErD,GADAA,EAAUA,GAAW,CAAA,EACjB,CAAE,MAAM,QAAQ3rB,CAAG,GAAM,CAAC0c,GAAa1c,CAAG,EAAG,CAC/CW,EACI3B,EAAM,SAAW,EACjB,UAAA,CAAM,MAAA,eAAA,OAAe2sB,EAAQ,KAAK,IAAI,EAAqB,oBAAA,EACvD,wCAAwC,OAAA3sB,EAAM,CAAC,EAAC,WAAA,CAD9C,CACyD,EACnE,MACD,CACD2B,EACI3B,EAAM,OAAS,EACf,UAAA,CAAM,MAAA,eAAA,OAAe2sB,EAAQ,KAAK,IAAI,EAA4B,2BAAA,EAC9D,sBAAA,OAAsB3rB,EAAI,OAAM,WAAA,CAD9B,CACyC,EACnDW,EACIX,EAAI,SAAWhB,EAAM,CAAC,EACtB,UAAM,CAAA,MAAA,eAAA,OAAe2sB,EAAQ,KAAK,IAAI,EAAC,gBAAA,EAAA,OAAiB3sB,EAAM,CAAC,EAAI,GAAA,EAC/D,qBAAA,OAAqBgB,EAAI,OAAM,WAAA,CAD7B,CACwC,EAElD,QADM4rB,EAAW5sB,EAAM,MAAM,CAAC,EACrBrB,EAAI,EAAGA,EAAIqC,EAAI,OAAQ,EAAErC,EAChC+tB,GAA2B1rB,EAAIrC,CAAC,EAAGiuB,EAAUD,EAAQ,OAAOhuB,CAAC,CAAC,CAElE,CAEA,SAASkuB,GACLC,EACAC,EAAuBC,EAAiBC,EAAoB,CAC9D,GAAIH,IAAkB,oBAGtB,IAAIA,GAAiB,KACnB,MAAM,IAAI,MAAM,gCAAgC,EAElD,GAAIA,IAAkB,WAAaA,IAAkBC,GACjDD,IAAkB,WAAaC,IAAgB,SACjD,MAAM,IAAI,MACN,aAAA,OAAaC,EAAO,eAAA,EAAA,OAAgBC,EAAqB,SAAA,EACzD,MAAA,OAAMH,EAAa,mBAAA,EAAA,OAAoBC,EAAW,SAAA,CAAS,EAEnE,CAEM,SAAUG,EACZrsB,EAAiBmsB,EAAiBC,EAClCE,EAAgE,CAClE,GADEA,IAAA,SAAAA,EAAgE,WAC9DtsB,aAAawjB,GAAoB,EACnC,OAAAwI,GAAYM,EAActsB,EAAE,MAAOmsB,EAASC,CAAY,EACjDpsB,EAET,IAAIusB,EAAgB9nB,GAAWzE,CAAC,EAShC,GANIusB,IAAkB,UAClB,CAAC,OAAQ,QAAS,SAAS,EAAE,QAAQD,CAAY,GAAK,IACxDC,EAAgBD,GAElBN,GAAYM,EAAcC,EAAeJ,EAASC,CAAY,EAEzDpsB,GAAK,MACL,CAAC6c,GAAa7c,CAAC,GAAK,CAAC,MAAM,QAAQA,CAAC,GAAK,OAAOA,GAAM,UACtD,OAAOA,GAAM,WAAa,OAAOA,GAAM,SAAW,CACrD,IAAMwkB,EAAOxkB,GAAK,KAAO,OAAUA,EAAS,YAAY,KACxD,MAAM,IAAI,MACN,aAAA,OAAamsB,EAAO,eAAA,EAAA,OAAgBC,EAA0B,cAAA,EAC9D,kCAAkC,OAAA5H,EAAO,GAAA,CAAA,CAC9C,CACD,IAAMgI,EAAgBd,GAAW1rB,EAAGusB,CAAa,EAC7C,CAAC1P,GAAa7c,CAAC,GAAK,CAAC,MAAM,QAAQA,CAAC,IACtCA,EAAI,CAACA,CAAC,GAER,IAAM8c,EAAiB,GACjB5d,EAASqtB,IAAkB,SAC7BpQ,GAAanc,EAAGusB,CAAyB,EACzClQ,GAAQrc,EAAe,CAAA,EAAI8c,CAAc,EAC7C,OAAO6J,EAAO,WAAWznB,EAAQstB,EAAeD,CAAa,CAC/D,CAEM,SAAUE,GACZC,EAA0BP,EAAiBC,EAC3CE,EAAgE,CAClE,GADEA,IAAA,SAAAA,EAAgE,WAC9D,CAAC,MAAM,QAAQI,CAAG,EACpB,MAAM,IAAI,MACN,YAAA,OAAYP,EAAO,aAAA,EAAA,OAAcC,EAAyB,aAAA,EAC1D,8BAA8B,EAEpC,IAAM5D,EAAUkE,EAChB,OAAOlE,EAAQ,IACX,SAACtrB,EAAGY,EAAC,CACD,OAAAuuB,EAAgBnvB,EAAG,GAAA,OAAGivB,EAAO,GAAA,EAAA,OAAIruB,EAAC,GAAA,EAAKsuB,EAAcE,CAAY,CAAC,CAAA,CAC5E,CC7HO,IAAMK,GAAkB,OAOzB,SAAUlvB,EAAuBN,EAAsB,CAC3D,IAAMyvB,EAAO,OAAO,KAAKzvB,CAAC,EAC1B,GAAIyvB,EAAK,SAAW,EAClB,MAAM,IAAI,MACN,yGAEA,GAAA,OAAGA,EAAK,OAAM,QAAA,CAAQ,EAG5B,IAAIC,EAASD,EAAK,CAAC,EACb5J,EAAK7lB,EAAE0vB,CAAM,EAGfA,EAAO,SAAS,GAAG,IACrBA,EAASA,EAAO,UAAU,EAAGA,EAAO,OAAS,CAAC,GAIhDA,EAASA,EAASF,GAGlB,IAAMG,EAAK,UAAA,SAAeC,EAAA,CAAA,EAAAnlB,EAAA,EAAdA,EAAc,UAAA,OAAdA,IAAAmlB,EAAcnlB,CAAA,EAAA,UAAAA,CAAA,EACxB+e,EAAO,WAAWkG,CAAM,EACxB,GAAI,CACF,IAAM/vB,EAASkmB,EAAM,MAAA,OAAA7kB,GAAA,CAAA,EAAAJ,EAAAgvB,CAAI,EAAA,EAAA,CAAA,EACzB,OAAI3mB,GAAUtJ,CAAM,GAClB,QAAQ,MAAM,yCAAyC,EAEzD6pB,EAAO,SAAS7pB,CAAM,EACfA,CACR,OAAQ4pB,EAAI,CACX,MAAAC,EAAO,SAAS,IAAI,EACdD,CACP,CACH,EACA,cAAO,eAAeoG,EAAI,OAAQ,CAAC,MAAOD,EAAQ,aAAc,EAAI,CAAC,EAG9DC,CACT,CCnBA,SAASE,GAA2BC,EAAoBC,EAAkB,CACxE,IAAMC,EAAQd,EAAgBY,EAAM,OAAQ,SAAS,EAC/CG,EAAQf,EAAgBa,EAAM,OAAQ,SAAS,EACrDG,GACIF,EAAM,MAAOC,EAAM,MACnB,yBAAA,OAAyBD,EAAM,MAAK,OAAA,EAAA,OAAQC,EAAM,MAAS,IAAA,EACvD,qCAAqC,EAE7C,IAAM/P,EAAwB,CAAC,KAAM8P,EAAO,KAAMC,CAAK,EACvD,OAAOzG,EAAO,UAAUrc,GAAS+S,CAAmC,CACtE,CAEO,IAAMiQ,GAA0B7vB,EAAG,CAAC,SAAQuvB,EAAA,CAAC,EClC9C,SAAUO,GACZruB,EAAyCC,EACzCqtB,EAAyBptB,EAAgB,CAC3C,GAAIA,GAAS,KACXA,EAAQqF,GAAWvF,CAAM,UAChBE,IAAU,YACnB,MAAM,IAAI,MACN,kFACoC,EAG1C,GAAIslB,GAAaxlB,CAAM,GAAKulB,GAAYvlB,CAAM,EAAG,CAC/C,GAAIE,IAAU,WAAaA,IAAU,QACnC,MAAM,IAAI,MACN,+CACA,+CAA+C,OAAAA,EAAQ,GAAA,CAAA,EAE7D,OAAOunB,EAAO,QAAQ,wBAClBznB,EAAQC,GAASqtB,EAAeptB,CAAK,CAC1C,CAED,GAAI,CAACyd,GAAa3d,CAAM,GAAK,CAAC,MAAM,QAAQA,CAAM,GAC9C,OAAOA,GAAW,UAAY,OAAOA,GAAW,WAChD,OAAOA,GAAW,SACpB,MAAM,IAAI,MACN,0HACuD,EAG7D,GAAIC,GAAS,KAAM,CACjB4G,GAAmC5G,CAAK,EAExC,IAAMquB,EAAejsB,GAAcpC,CAAK,EAClCsuB,EAAelsB,GAAcirB,CAAa,EAChD1rB,EACI0sB,IAAiBC,EACjB,UACI,CAAA,MAAA,iCAAiC,OAAAtuB,EAAiC,4BAAA,EAClE,GAAA,OAAGquB,EAA+B,kBAAA,EAAA,OAAAC,CAAY,CAD9C,CACgD,EAExD,QAAS3vB,EAAI,EAAGA,EAAI0uB,EAAc,OAAQ,EAAE1uB,EAAG,CAC7C,IAAM4vB,EAAWlB,EAAc1uB,CAAC,EAC1B6vB,EAAoB7vB,IAAM0uB,EAAc,OAAS,EACnDkB,IAAansB,GAAcpC,EAAM,MAAMrB,CAAC,CAAC,EACzC,GACJgD,EACI0rB,EAAc1uB,CAAC,IAAMqB,EAAMrB,CAAC,GAAK,CAAC6vB,EAClC,UAAA,CAAM,MAAA,+CACF,IAAA,OAAInB,EAA6C,gCAAA,EACjD,UAAA,OAAUrtB,EAAK,KAAA,CAFb,CAEkB,CAC7B,CACF,CAED,MAAI,CAAC0d,GAAa3d,CAAM,GAAK,CAAC,MAAM,QAAQA,CAAM,IAChDA,EAAS,CAACA,CAAM,GAGlBC,EAAQA,GAASqtB,EACjBttB,EAASE,IAAU,SACf+c,GAAajd,EAAQE,CAAK,EAC1Bid,GAAQnd,EAAoB,CAAA,EAAI,EAAI,EACjCynB,EAAO,WAAWznB,EAAsBC,EAAOC,CAAK,CAC7D,UCqHgB0lB,GACZ5lB,EAAyCC,EACzCC,EAAgB,CAClB,IAAMotB,EAAgBd,GAAWxsB,EAAQE,CAAK,EAC9C,OAAOmuB,GAAWruB,EAAQC,EAAOqtB,EAAeptB,CAAK,CACvD,CC1LO,IAAMwuB,GAAkD,CAC7D,QAAW,EACX,QAAW,EACX,MAAS,EACT,OAAU,EACV,MAAS,EACT,KAAQ,EACR,UAAa,GCOfC,IAAA,UAAA,CAiBE,SAAAA,EAAYC,EACE,CACZ,GAlBM,KAAM,OAAkB,CAAA,EACxB,KAAkB,mBAAG,EAiBvBA,GAAW,OAITA,aAAmB,QACvBA,EAAU,CAACA,CAAO,GAEpBA,EAAUA,EAAQ,IAAI,SAACC,EAAkB,CACvC,OAAIC,GAAkBD,CAAkB,EAC/BA,EAAmB,OAErBA,CACT,CAAC,EAGGD,EAAQ,SAAW,GAIvB,MAAK,kBAAoBA,EAAQ,CAAC,EAAE,WAGpC,QAFIlpB,EAAQ,EAEH9G,EAAI,EAAGA,EAAIgwB,EAAQ,OAAQhwB,IAAK,CACvC,IAAMmwB,EAASH,EAAQhwB,CAAC,EAEpBA,IAAMgwB,EAAQ,OAAS,GACzBG,EAAO,aAAe,KAAK,oBAG3B,KAAK,kBAAoB,QAI3B,IAAMlS,EAAMnX,EAAQqpB,EAAO,WAC3B,KAAK,OAAO,KAAK,CAAE,OAAMA,EAAE,MAAKrpB,EAAE,IAAGmX,CAAA,CAAE,EACvCnX,EAAQmX,CACT,CAGG,KAAK,OAAO,SAAW,IACzB,KAAK,WAAa,GAEpB,KAAK,WAAa,KAAK,OAAO,KAAK,OAAO,OAAS,CAAC,EAAE,KAhDjD,OAAA8R,EAAI,KAAX,SAAYC,EAAqC,CAC/C,OAAO,IAAID,EAAqBC,CAAO,EAAE,MAAK,GAkDhDD,EAAA,UAAA,MAAA,SAAMjpB,EAAWmX,EAAqB,CAGpC,GAHInX,IAAA,SAAAA,EAAS,GAAEmX,IAAA,SAAAA,EAAM,KAAK,YAGtB,KAAK,OAAO,SAAW,EACzB,OAAO,IAAI,YAAY,CAAC,EAU1B,GANAnX,EAAQ,MAAM,OAAOA,CAAK,CAAC,EAAI,EAAIA,EACnCmX,EAAM,MAAM,OAAOA,CAAG,CAAC,EAAI,EAAIA,EAG/BnX,EAAQ,KAAK,IAAI,EAAGA,CAAK,EACzBmX,EAAM,KAAK,IAAI,KAAK,WAAYA,CAAG,EAC/BA,GAAOnX,EACT,OAAO,IAAI,YAAY,CAAC,EAG1B,IAAMspB,EAAkB,KAAK,iBAAiBtpB,CAAK,EACnD,GAAIspB,IAAoB,GAGtB,MAAM,IAAI,MAAM,uCAAA,OAAuCtpB,CAAK,CAAE,EAOhE,QAJMpD,EAAOua,EAAMnX,EACbupB,EAAe,IAAI,YAAY3sB,CAAI,EACnC4sB,EAAc,IAAI,WAAWD,CAAY,EAC3CE,EAAS,EACJvwB,EAAIowB,EAAiBpwB,EAAI,KAAK,OAAO,OAAQA,IAAK,CACzD,IAAMwwB,EAAQ,KAAK,OAAOxwB,CAAC,EAErBywB,EAAc3pB,EAAQypB,EACtBG,EAAaD,EAAcD,EAAM,MACjCG,EAAcJ,EAEdK,EAAY,KAAK,IAAI3S,EAAKuS,EAAM,GAAG,EACnCK,EAAWD,EAAYJ,EAAM,MAE7BM,EAAc,IAAI,WAAWN,EAAM,OAAQE,EACdG,EAAWH,CAAU,EAIxD,GAHAJ,EAAY,IAAIQ,EAAaH,CAAW,EACxCJ,GAAUO,EAAY,OAElB7S,EAAMuS,EAAM,IACd,KAEH,CACD,OAAOH,GAMDN,EAAgB,UAAA,iBAAhB,SAAiBgB,EAAiB,CACxC,GAAI,KAAK,OAAO,SAAW,GAAKA,EAAY,GAC1CA,GAAa,KAAK,WAClB,MAAO,GAIT,GAAI,KAAK,mBAAqB,KAC5B,YAAK,mBAAqB,KAAK,MAAMA,EAAY,KAAK,iBAAiB,EAChE,KAAK,mBAMd,SAASC,EAAMR,EAAkB,CAC/B,OAAIO,EAAYP,EAAM,MACb,GAELO,GAAaP,EAAM,IACd,EAEF,EAIT,GAAIQ,EAAM,KAAK,OAAO,KAAK,kBAAkB,CAAC,IAAM,EAClD,OAAO,KAAK,mBAMd,IAAMpvB,EAAQqvB,GAAO,KAAK,OAAQD,CAAK,EACvC,OAAIpvB,IAAU,GACL,IAGT,KAAK,mBAAqBA,EACnB,KAAK,qBAEfmuB,CAAA,GAAA,EAYe,SAAAkB,GAAUC,EAAkBC,EAAyB,CAKnE,QAHIlvB,EAAM,EACNE,EAAM+uB,EAAY,OAEfjvB,GAAOE,GAAK,CACjB,IAAMivB,EAAS,KAAK,OAAOjvB,EAAMF,GAAO,CAAC,EAAIA,EACvCovB,EAAOF,EAAQD,EAAYE,CAAM,CAAC,EAExC,GAAIC,IAAS,EACX,OAAOD,EACEC,EAAO,EAChBlvB,EAAMivB,EAENnvB,EAAMmvB,EAAS,CAElB,CACD,MAAO,EACT,UCjMgBE,IAAc,CAC5BzoB,GAAG,EAAG,IAAI,OAAQ,EAAI,CACxB,UAgBgB0oB,IAAe,CAC7B1oB,GAAG,EAAG,IAAI,QAAS,EAAI,CACzB,UAGgB2oB,IAA0B,CACxC3oB,GAAG,EAAG,IAAI,+BAAgC,EAAK,EAC/C,QAAQ,KAAK,wDAAwD,CACvE,CAGM,SAAU4oB,GAAgBvuB,EAAW,CACrC2F,GAAG,EAAG,QAAQ,8BAA8B,GAC9C,QAAQ,KACJ3F,EAAM,6EAC4B,CAE1C,UAQgBwuB,IAAgB,CAC9B7I,EAAO,iBAAgB,CACzB,UAOgB8I,IAAM,CACpB,OAAO9I,CACT,UAuBgB+I,IAAM,CACpB,OAAO/I,EAAO,OAAM,CACtB,CAiCM,SAAUgJ,GAAQxyB,EAAqD,CAE3E,OAAOwpB,EAAO,QAAQxpB,CAAC,CACzB,CA0CgB,SAAA0iB,GACZ4G,EAA6BzD,EAAe,CAC9C,OAAO2D,EAAO,KAAKF,EAAUzD,CAAE,CACjC,CAaM,SAAU4M,GAAQxK,EAA0B,CAChD,IAAMoD,EAAUxD,GAAsBI,CAAS,EAC/CoD,EAAQ,QAAQ,SAAA1D,EAAU,CAAA,OAAAA,EAAO,QAAO,CAAd,CAAgB,CAC5C,CAkCM,SAAU+K,GAAuB/yB,EAAS,CAC9C,OAAO6pB,EAAO,KAAK7pB,CAAM,CAC3B,CA2BM,SAAUshB,GAAKjhB,EAAa,CAChC,OAAOwpB,EAAO,KAAKxpB,CAAC,CACtB,CAiBM,SAAU2yB,GAAW1b,EAAmB,CAC5C,OAAOuS,EAAO,WAAWvS,CAAW,CACtC,UASgB2b,IAAK,CACnB,OAAOpJ,EAAO,MAAK,CACrB,UAQgBqJ,IAAU,CACxB,OAAOrJ,EAAO,WAChB,CAOM,SAAUsJ,GAAcnoB,EAAY,CACxC6e,EAAO,cAAc7e,CAAI,CAC3B,CAMM,SAAUooB,GAAYpoB,EAAY,CACtC,OAAO6e,EAAO,YAAY7e,CAAI,CAChC,CAOM,SAAUqoB,GAAmBroB,EAAY,CAE7C,OAAO6e,EAAO,mBAAmB7e,CAAI,CACvC,UAiBgBsoB,GACZtoB,EAAcke,EACdC,EAAY,CAAZ,OAAAA,IAAA,SAAAA,EAAY,GACPU,EAAO,gBAAgB7e,EAAMke,EAASC,CAAQ,CACvD,UAUgBtnB,IAAO,CACrB,OAAOgoB,EAAO,OAChB,CAQgB,SAAA0J,GAAY5pB,EAAsBC,EAAkB,CAClEC,GAAG,EAAG,YAAYF,EAAcC,CAAQ,CAC1C,CC/VA,IAAM4pB,GAA0B,EAmBV,SAAAC,GAClB/H,EAAuCgI,EAAmB,kHAU5D,IAPMC,EAAgC,CAAA,EAChCC,EAA2C,CAAA,EAE3CC,EAAkB,MAAM,QAAQnI,CAAO,EACzCA,EAAQ,IAAI,SAAA1D,EAAU,CAAA,OAAAA,EAAO,IAAI,CAAA,EACjC,OAAO,KAAK0D,CAAO,aAEd1qB,EAAC,CACR,IAAMgK,EAAO6oB,EAAM7yB,CAAC,EACdZ,EAAI,MAAM,QAAQsrB,CAAO,EAAIA,EAAQ1qB,CAAC,EAAE,OAAS0qB,EAAQ1gB,CAAI,EACnE,GAAI5K,EAAE,QAAU,WAAaA,EAAE,QAAU,SAAWA,EAAE,QAAU,QAC5DA,EAAE,QAAU,UAAYA,EAAE,QAAU,YACtC,MAAM,IAAI,MAAM,gCAAgC,OAAA4K,EAAU,KAAA,EAAA,OAAA5K,EAAE,KAAK,CAAE,EAErE,IAAM0zB,EAA6B,CAAC,KAAI9oB,EAAE,MAAO5K,EAAE,MAAO,MAAOA,EAAE,KAAK,EACxE,GAAIA,EAAE,QAAU,SAAU,CACxB,IAAM2zB,EAAY,IAAI,QAAoB,SAAMr0B,EAAO,CAAA,OAAAP,GAAAmL,EAAA,OAAA,OAAA,UAAA,8DACxC,IAAA,GAAA,MAAA,CAAA,EAAMlK,EAAE,MAAK,CAAkB,SAK5C,IALM2G,EAAOmD,EAA+B,KAAA,EACtC8pB,EAAgBjtB,EAAK,OAAO,SAAC/H,EAAGwJ,EAAC,CAAK,OAAAxJ,EAAIwJ,EAAE,MAAM,EAAE,CAAC,EACvDgrB,GAA0BzsB,EAAK,OAC7BQ,EAAQ,IAAI,WAAWysB,CAAa,EACtC9rB,EAAS,EACJ4d,EAAI,EAAGA,EAAI/e,EAAK,OAAQ+e,IACzBziB,EAAM0D,EAAK+e,CAAC,EACZmO,EACF,IAAI,WAAW,IAAI,YAAY,CAAC5wB,EAAI,MAAM,CAAC,EAAE,MAAM,EACvDkE,EAAM,IAAI0sB,EAAe/rB,CAAM,EAC/BA,GAAUsrB,GACVjsB,EAAM,IAAIlE,EAAK6E,CAAM,EACrBA,GAAU7E,EAAI,OAEhB,OAAA3D,EAAQ6H,CAAK,QACd,CAAA,CAAA,CAAA,EACDqsB,EAAa,KAAKG,CAAS,CAC5B,MACCH,EAAa,KAAKxzB,EAAE,KAAI,CAAE,EAExBszB,GAAS,OACXI,EAAK,MAAQJ,GAEfC,EAAM,KAAKG,CAAI,GAjCR9yB,EAAI,EAAGA,EAAI6yB,EAAM,OAAQ,EAAE7yB,IAA3BA,CAAC,EAoCW,MAAA,CAAA,EAAM,QAAQ,IAAI4yB,CAAY,CAAC,SAA9C,OAAAM,EAAehqB,EAA+B,KAAA,EAC7C,CAAA,EAAA,CAAC,KAAMiqB,GAAuBD,CAAY,EAAG,MAAKP,CAAA,CAAC,MAC3D,CAkBe,SAAAS,GACZC,EACAV,EAA6B,SAEzBW,EAAkB,IAAIvD,GAAqBsD,CAAU,EACrDtJ,EAAsB,CAAA,EACxB7iB,EAAS,MACb,QAAmBqsB,EAAA3zB,GAAA+yB,CAAK,EAAAa,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAArB,IAAMT,EAAIU,EAAA,MACPC,EAAaC,GAAoBZ,EAAM,SAAChsB,EAAOmX,EAAG,CACtD,OAAOqV,EAAgB,MAAMpsB,EAASJ,EAAOI,EAAS+W,CAAG,CAC3D,CAAC,EACD8L,EAAI+I,EAAK,IAAI,EAAIa,GAAab,EAAMQ,EACjC,MAAMpsB,EAAQA,EAASusB,CAAU,CAAC,EACrCvsB,GAAUusB,CACX,mGACD,OAAO1J,CACT,CAEA,SAAS2J,GAAoBZ,EAC3Bc,EAAkD,CAElD,IAAMlwB,EAAOD,GAAcqvB,EAAK,KAAK,EACjCe,EACJ,GAAI,iBAAkBf,EAAM,CAC1B,IAAMgB,EAAehB,EAAK,aAC1Be,EAAgB/D,GAAqBgE,EAAa,KAAK,CACxD,SAAUhB,EAAK,QAAU,SAAU,CAGlC,QADIW,EAAa,EACRzzB,EAAI,EAAGA,EAAI0D,EAAM1D,IACxByzB,GAAcjB,GAA0B,IAAI,YAC1CoB,EAAMH,EAAYA,EAAajB,EAAuB,CAAC,EAAE,CAAC,EAE9D,OAAOiB,CACR,MACCI,EAAgB/D,GAAqBgD,EAAK,KAAK,EAGjD,OAAOpvB,EAAOmwB,CAChB,CAEA,SAAeE,GACbjB,EACAc,EAA2D,+GAKvD,OAFElwB,EAAOD,GAAcqvB,EAAK,KAAK,EAEjC,iBAAkBA,GACdgB,EAAehB,EAAK,aAC1Be,EAAgB/D,GAAqBgE,EAAa,KAAK,SAF/B,CAAA,EAAA,CAAA,SAGf,GAAAhB,EAAK,QAAU,SAAf,MAAuB,CAAA,EAAA,CAAA,EAE5BW,EAAa,EACRzzB,EAAI,0BAAGA,EAAI0D,GAClBwF,EAAAuqB,EAActqB,EAAAqpB,KAA8B,YAAW,KAC/C,CAAA,EAAAoB,EAAMH,EAAYA,EAAajB,EAAuB,CAAC,GAFzC,CAAA,EAAA,CAAA,SACtBiB,EAAAvqB,GAAcC,EAA0B,IAAAC,EAAA,MAAI,YAAW,CAAA,OACrD0iB,EAA6D,KAAA,CAAA,CAAA,GAAA,EAAE,CAAC,oBAF1C,OAAA9rB,UAI1B,IAAA,GAAA,MAAA,CAAA,EAAOyzB,CAAU,SAEjBI,EAAgB/D,GAAqBgD,EAAK,KAAK,mBAGjD,MAAO,CAAA,EAAApvB,EAAOmwB,CAAa,MAC5B,CAED,SAASF,GACPb,EACAkB,EAAuB,CAEvB,IAAMhqB,EAAO8oB,EAAK,KACZxxB,EAAQwxB,EAAK,MACbzxB,EAAQyxB,EAAK,MACbpvB,EAAOD,GAAcpC,CAAK,EAC5BD,EACA8F,EAAS,EAEb,GAAI,iBAAkB4rB,EAAM,CAC1B,IAAMgB,EAAehB,EAAK,aAC1B,GAAIgB,EAAa,QAAU,SAAWA,EAAa,QAAU,UAC3D,GAAI,EAAE,QAASA,GAAgB,UAAWA,GACxC,MAAM,IAAI,MACN,UAAU,OAAAhB,EAAK,KAA0B,qBAAA,EAAA,OAAAgB,EAAa,MAAQ,GAAA,EAC9D,oDAAoD,UAEjDA,EAAa,QAAU,WAChC,GAAIxyB,IAAU,UACZ,MAAM,IAAI,MACN,UAAU,OAAAwxB,EAAK,KAA0B,qBAAA,EAAA,OAAAgB,EAAa,MAAQ,GAAA,EAC9D,mDAAmD,OAAAxyB,EAAQ,GAAA,CAAA,MAGjE,OAAM,IAAI,MACN,UAAA,OAAUwxB,EAAK,KAAmB,eAAA,EAClC,sBAAsB,OAAAgB,EAAa,MAAS,IAAA,EAC5C,sEACmC,EAEzC,IAAMG,EAAyBnE,GAAqBgE,EAAa,KAAK,EAChEI,EAAkBJ,EAAa,QAAU,QAC7C,IAAI,WAAWE,CAAU,EACzB,IAAI,YAAYA,CAAU,EAC5B,GAAI1yB,IAAU,UACZ,GAAIwyB,EAAa,QAAU,SAAWA,EAAa,QAAU,SAAU,CACrE1yB,EAAS,IAAI,aAAa8yB,EAAe,MAAM,EAC/C,QAASl0B,EAAI,EAAGA,EAAIk0B,EAAe,OAAQl0B,IAAK,CAC9C,IAAMN,EAAIw0B,EAAel0B,CAAC,EAC1BoB,EAAOpB,CAAC,EAAIN,EAAIo0B,EAAa,MAAQA,EAAa,GACnD,CACF,SAAUA,EAAa,QAAU,UAAW,CAE3C,IAAMK,EAAgBC,GAAiB,EACvChzB,EAAS+yB,EAAcD,CAA6B,CACrD,KACC,OAAM,IAAI,MACR,iCAAA,OAAiCJ,EAAa,MAAQ,GAAA,EACtD,0BAA0B,UAErBxyB,IAAU,QAAS,CAC5B,GAAIwyB,EAAa,QAAU,SAAWA,EAAa,QAAU,SAC3D,MAAM,IAAI,MACR,iCAAA,OAAiCA,EAAa,MAAQ,GAAA,EACtD,wBAAwB,EAE5B1yB,EAAS,IAAI,WAAW8yB,EAAe,MAAM,EAC7C,QAASl0B,EAAI,EAAGA,EAAIk0B,EAAe,OAAQl0B,IAAK,CAC9C,IAAMN,EAAIw0B,EAAel0B,CAAC,EAC1BoB,EAAOpB,CAAC,EAAI,KAAK,MAAMN,EAAIo0B,EAAa,MAAQA,EAAa,GAAG,CACjE,CACF,KACC,OAAM,IAAI,MAAM,gCAAA,OAAgC9pB,EAAU,KAAA,EAAA,OAAA1I,CAAK,CAAE,EAEnE4F,GAAUxD,EAAOuwB,CAClB,SAAU3yB,IAAU,SAAU,CAC7B,IAAM+yB,EAAO5wB,GAAcqvB,EAAK,KAAK,EACrC1xB,EAAS,CAAA,EACT,QAASpB,EAAI,EAAGA,EAAIq0B,EAAMr0B,IAAK,CAC7B,IAAMyzB,EAAa,IAAI,YACrBO,EAAW,MAAM9sB,EAAQA,EAASsrB,EAAuB,CAAC,EAAE,CAAC,EAC/DtrB,GAAUsrB,GACV,IAAMjsB,EAAQ,IAAI,WAChBytB,EAAW,MAAM9sB,EAAQA,EAASusB,CAAU,CAAC,EAC9CryB,EAAwB,KAAKmF,CAAK,EACnCW,GAAUusB,CACX,CACF,KAAM,CACL,IAAMa,EAAcxE,GAAqBxuB,CAAK,EAC9C,GAAIA,IAAU,UACZF,EAAS,IAAI,aAAa4yB,CAAU,UAC3B1yB,IAAU,QACnBF,EAAS,IAAI,WAAW4yB,CAAU,UACzB1yB,IAAU,OACnBF,EAAS,IAAI,WAAW4yB,CAAU,UACzB1yB,IAAU,YAAa,CAChCF,EAAS,IAAI,aAAa4yB,CAAU,EAGpC,QAFM7E,EAAO,IAAI,aAAa/tB,EAAO,OAAS,CAAC,EACzCmzB,EAAQ,IAAI,aAAanzB,EAAO,OAAS,CAAC,EACvCpB,EAAI,EAAGA,EAAImvB,EAAK,OAAQnvB,IAC/BmvB,EAAKnvB,CAAC,EAAIoB,EAAOpB,EAAI,CAAC,EACtBu0B,EAAMv0B,CAAC,EAAIoB,EAAOpB,EAAI,EAAI,CAAC,EAE7B,IAAMw0B,EAAaxN,GAAOmI,EAAM9tB,EAAO,SAAS,EAC1CozB,EAAczN,GAAOuN,EAAOlzB,EAAO,SAAS,EAC5CqzB,EAAgBlF,GAAQgF,EAAYC,CAAW,EACrD,OAAAD,EAAW,QAAO,EAClBC,EAAY,QAAO,EACZC,CACR,KACC,OAAM,IAAI,MAAM,gCAAA,OAAgC1qB,EAAU,KAAA,EAAA,OAAA1I,CAAK,CAAE,EAEnE4F,GAAUxD,EAAO4wB,CAClB,CACD,OAAOtN,GAAO5lB,EAAQC,EAAOC,CAAK,CACpC,CAEA,SAAeqzB,GAAaC,EACAC,EACAC,EAAc,2GACpCntB,EAAO,IAAI,WAAWktB,CAAW,mBAE9B,OAAAltB,EAAK,WAAamtB,EACD,CAAA,EAAMF,EAAO,KAAI,CAAE,EADZ,CAAA,EAAA,CAAA,SAE7B,GADM1rB,EAAgBC,EAAA,KAAA,EAAfwN,EAAIzN,EAAA,KAAEzK,EAAKyK,EAAA,MACdyN,GAAQlY,GAAS,KACb,MAAAs2B,EAAWD,EAASntB,EAAK,WACzB,IAAI,MAAM,sBAAA,OAAsBotB,EAAO,2BAAA,CAA2B,EAIpE,OAAAC,EAAU,IAAI,WAAWrtB,EAAK,OAASlJ,EAAM,UAAU,EAC7Du2B,EAAQ,IAAIrtB,EAAM,CAAC,EACnBqtB,EAAQ,IAAI,IAAI,WAAWv2B,CAAK,EAAGkJ,EAAK,MAAM,EAC9CA,EAAOqtB,eAGT,MAAO,CAAA,EAAArtB,EAAK,MAAM,MACnB,CAEqB,SAAAstB,GACpBC,EACAvC,EAA6B,gIAEvBjI,EAA0B,CAAA,EAC1BkK,EAASM,EAAa,UAAS,EACjCvtB,EAAO,IAAI,YAAY,CAAC,0CAETwtB,EAAAv1B,GAAA+yB,CAAK,EAAAyC,EAAAD,EAAA,KAAA,wCAAbrC,EAAIsC,EAAA,MACM,CAAA,EAAMrB,GAAyBjB,EACA,SAAOhsB,EAAOmX,EAAG,CAAA,OAAA9f,GAAAmL,EAAA,OAAA,OAAA,UAAA,mDAC1D,MAAM,CAAA,EAAAqrB,GAAaC,EAAQjtB,EAAMsW,CAAG,CAAC,SAA5C,OAAAtW,EAAOuB,EAAA,KAAA,EACA,CAAA,EAAAvB,EAAK,MAAMb,EAAOmX,CAAG,CAAC,IAC9B,CAAA,CAAA,CAAA,CAAC,UAJI,OAAAwV,EAAatqB,EAIjB,KAAA,EACW,CAAA,EAAAwrB,GAAaC,EAAQjtB,EAAM8rB,CAAU,CAAC,SAAnD9rB,EAAOwB,EAAA,KAAA,EAGDksB,EAAa1tB,EAAK,MAAM,EAAG8rB,CAAU,EAC3C9rB,EAAOA,EAAK,MAAM8rB,CAAU,EAEtB6B,EAAe3B,GAAab,EAAMuC,CAAU,EAClD3K,EAAQoI,EAAK,IAAI,EAAIwC,EAIjBpD,GAAU,IAAO,WACbn0B,EAAI8C,GAAO,EAEb,gBAAiB9C,GACnB0F,GAAc6xB,EAAa,KAAK,GAAMzsB,GAAG,EACtC,IAAI,mCAAmC,GACzC9K,EAAE,YAAyCu3B,EAAa,MAAM,8LAKrE,IAAA,GAAA,MAAA,CAAA,EAAO5K,CAAO,MACf,CAKK,SAAUyI,GAAuBnS,EAAgB,CAErD,GAAIA,IAAO,KACT,MAAM,IAAI,MAAM,wBAAA,OAAwB,KAAK,UAAUA,CAAE,CAAC,CAAE,EAG9D,IAAIuU,EAAkB,EAShBC,EAA6B,CAAA,EACnCxU,EAAG,QAAQ,SAAC9e,EAAa,CAMvB,GALAqzB,GAAmBrzB,EAAE,WAErBszB,EAAa,KACTtzB,EAAE,aAAeA,EAAE,OAAO,WAAaA,EACA,IAAKA,EAAE,YAAoBA,CAAC,CAAC,EACpE,EAAEA,aAAoB,cAAgBA,aAAoB,YACxDA,aAAoB,YACxB,MAAM,IAAI,MAAM,mCAAmC,OAAAA,EAAE,YAAY,IAAI,CAAE,CAG3E,CAAC,EAED,IAAM5C,EAAI,IAAI,WAAWi2B,CAAe,EACpCruB,EAAS,EACb,OAAAsuB,EAAa,QAAQ,SAACtzB,EAAa,CACjC5C,EAAE,IAAI,IAAI,WAAW4C,EAAE,MAAM,EAAGgF,CAAM,EACtCA,GAAUhF,EAAE,UACd,CAAC,EAEM5C,EAAE,MACX,CAGA,IAAMm2B,GAAgB,OAAO,OAAW,MACnC,OAAO,KAAS,KAAe,OAAO,KAAS,KAC/C,OAAO,KAAS,KAWf,SAAUC,GAAiBtc,EAAW,CAC1C,OAAIqc,GACK,OAAO,WAAWrc,EAAK,MAAM,EAE/B,IAAI,KAAK,CAACA,CAAG,CAAC,EAAE,IACzB,CAQM,SAAUuc,GAA0BxF,EAAmB,CAC3D,GAAIsF,GACF,OAAO,OAAO,KAAKtF,CAAM,EAAE,SAAS,QAAQ,EAI9C,QAFMyF,EAAM,IAAI,WAAWzF,CAAM,EAC7BrwB,EAAI,GACCE,EAAI,EAAGS,EAAIm1B,EAAI,OAAQ51B,EAAIS,EAAGT,IACrCF,GAAK,OAAO,aAAa81B,EAAI51B,CAAC,CAAC,EAEjC,OAAO,KAAKF,CAAC,CACf,CAQM,SAAU+1B,GAA0Bzc,EAAW,CACnD,GAAIqc,GAAe,CACjB,IAAMG,EAAM,OAAO,KAAKxc,EAAK,QAAQ,EACrC,OAAOwc,EAAI,OAAO,MAAMA,EAAI,WAAYA,EAAI,WAAaA,EAAI,UAAU,CACxE,CAGD,QAFM91B,EAAI,KAAKsZ,CAAG,EACZ+W,EAAS,IAAI,WAAWrwB,EAAE,MAAM,EAC7BE,EAAI,EAAGA,EAAIF,EAAE,OAAQ,EAAEE,EAC9BmwB,EAAO,IAAI,CAACrwB,EAAE,WAAWE,CAAC,CAAC,EAAGA,CAAC,EAEjC,OAAOmwB,EAAO,MAChB,CAWM,SAAU2F,GAAwB9F,EACrB,CACjB,OAAOD,GAAqB,KAAKC,CAAO,CAC1C,CASM,SAAU+F,GAASpX,EAAY,CACnC,IAAMqX,EAAY,IAElB,IADArX,EAAOA,EAAK,KAAI,EACTA,EAAK,SAASqX,CAAS,GAC5BrX,EAAOA,EAAK,MAAM,EAAGA,EAAK,OAAS,CAAC,EAEtC,IAAMsX,EAAQtX,EAAK,MAAMqX,CAAS,EAClC,OAAOC,EAAMA,EAAM,OAAS,CAAC,CAC/B,CAWgB,SAAAC,GACZC,EAA2BC,EAA+B,CAC5D,IAAMp3B,EAAoB,CACxB,cAAem3B,EAAU,cACzB,OAAQA,EAAU,OAClB,YAAaA,EAAU,YACvB,YAAaA,EAAU,YACvB,gBAAiBC,GAEnB,OAAID,EAAU,WAAa,OACzBn3B,EAAO,UAAYm3B,EAAU,WAE3BA,EAAU,qBAAuB,OACnCn3B,EAAO,oBAAsBm3B,EAAU,qBAErCA,EAAU,kBAAoB,OAChCn3B,EAAO,iBAAmBm3B,EAAU,kBAElCA,EAAU,sBAAwB,OACpCn3B,EAAO,qBAAuBm3B,EAAU,sBAEtCA,EAAU,gBAAkB,OAC9Bn3B,EAAO,eAAiBm3B,EAAU,gBAE7Bn3B,CACT,UAagBq3B,GACZC,EAAsBC,EACtBlD,EAAuB,CAEzB,IAAMmD,EAAiC,CACrC,cAAeF,EAAU,cACzB,OAAQA,EAAU,OAClB,YAAaA,EAAU,YACvB,YAAaA,EAAU,aAMzB,GAHIA,EAAU,gBAAkB,OAC9BE,EAAe,eAAiBF,EAAU,gBAExCA,EAAU,iBAAmB,KAAM,CACrC,GAAI,CAACC,EACH,MAAM,IAAI,MAAM,uDAAuD,EAEzE,GAAI,CAAClD,EACH,MAAM,IAAI,MAAM,sDAAsD,EAExEmD,EAAe,YAAcD,EAC7BC,EAAe,WAAanD,CAC7B,CACD,OAAIiD,EAAU,WAAa,OACzBE,EAAe,UAAYF,EAAU,WAEnCA,EAAU,qBAAuB,OACnCE,EAAe,oBAAsBF,EAAU,qBAE7CA,EAAU,kBAAoB,OAChCE,EAAe,iBAAmBF,EAAU,kBAE1CA,EAAU,sBAAwB,OACpCE,EAAe,qBAAuBF,EAAU,sBAG3CE,CACT,CAWsB,SAAAC,GAClBH,EACAI,EAEE,qGAIA,OAAAJ,EAAU,iBAAmB,KAAI,CAAA,EAAA,CAAA,EACP,CAAA,EAAMI,EAAYJ,EAAU,eAAe,CAAC,SAAxEptB,EAAAjJ,EAAA,MAAA,OAAA,CAA4BkJ,EAAA,KAAA,EAA4C,CAAA,CAAA,EAAvEotB,EAAWrtB,EAAA,CAAA,EAAEmqB,EAAUnqB,EAAA,CAAA,mBAG1B,MAAO,CAAA,EAAAmtB,GAA6BC,EAAWC,EAAalD,CAAU,CAAC,MACxE,CAOK,SAAUsD,GAA6BH,EAA8B,CAEzE,GAAIA,EAAe,yBAAyB,YAC1C,MAAM,IAAI,MAAM,qDAAqD,EAGvE,MAAO,CACL,UAAW,IAAI,KACf,kBAAmB,OACnB,mBAAoBA,EAAe,eAAiB,KAChD,EACAd,GAAiB,KAAK,UAAUc,EAAe,aAAa,CAAC,EACjE,iBAAkBA,EAAe,aAAe,KAC5C,EACAd,GAAiB,KAAK,UAAUc,EAAe,WAAW,CAAC,EAC/D,gBAAiBA,EAAe,YAAc,KAC1C,EACA,IAAIzG,GAAqByG,EAAe,UAAU,EAAE,WAE5D,CASM,SAAUI,GAAeC,EAAsC,SAE7DN,EAAsC,CAAA,MAC5C,QAAoBO,EAAAl3B,GAAAi3B,CAAe,EAAAE,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAAhC,IAAME,EAAKD,EAAA,MACdR,EAAY,KAAZ,MAAAA,EAAWl2B,GAAA,CAAA,EAAAJ,EAAS+2B,EAAM,OAAO,EAAE,EAAA,CAAA,CACpC,mGACD,OAAOT,CACT,CAQA,SAASU,IAA0B,CACjC,IAAMC,EAAkB,SAACl3B,EAAS,CAIhC,QAHID,EAAIC,GAAK,GACTlB,EAAI,GAEAiB,EAAI,WAAgB,GAC1BjB,GAAK,QACLiB,IAAM,EAER,OAAAA,GAAK,SACLjB,GAAK,UAEEiB,EAAIjB,CACb,EAEMq4B,EAAe,IAAI,YAAY,IAAI,EAEzCA,EAAa,CAAC,EAAI,EAClB,QAASn3B,EAAI,EAAGA,EAAI,KAAMA,IACxBm3B,EAAan3B,CAAC,EAAIk3B,EAAgBl3B,CAAC,EAErC,QAASA,EAAI,KAAMA,EAAI,KAAMA,IAC3Bm3B,EAAan3B,CAAC,EAAI,WAAeA,EAAI,MAAS,IAGhD,OAAOm3B,CACT,CAQA,SAASC,IAA2B,CAClC,IAAMC,EAAgB,IAAI,YAAY,EAAE,EAExCA,EAAc,CAAC,EAAI,EACnBA,EAAc,EAAE,EAAI,WACpBA,EAAc,EAAE,EAAI,WACpBA,EAAc,EAAE,EAAI,WACpB,QAASr3B,EAAI,EAAGA,EAAI,GAAIA,IACtBq3B,EAAcr3B,CAAC,EAAIA,GAAK,GAE1B,QAASA,EAAI,GAAIA,EAAI,GAAIA,IACvBq3B,EAAcr3B,CAAC,EAAI,YAAeA,EAAI,IAAO,IAG/C,OAAOq3B,CACT,CAQA,SAASC,IAAyB,CAGhC,QAFMC,EAAc,IAAI,YAAY,EAAE,EAE7Bv3B,EAAI,EAAGA,EAAI,GAAIA,IACtBu3B,EAAYv3B,CAAC,EAAI,KAEnB,OAAAu3B,EAAY,CAAC,EAAIA,EAAY,EAAE,EAAI,EAE5BA,CACT,UASgBnD,IAAiB,CAK/B,IAAM+C,EAAeF,GAA0B,EACzCI,EAAgBD,GAA2B,EAC3CG,EAAcD,GAAyB,EAE7C,OAAO,SAACpD,EAA2B,CAGjC,QAFM/D,EAAS,IAAI,YAAY,EAAI+D,EAAe,MAAM,EAClDsD,EAAmB,IAAI,YAAYrH,CAAM,EACtCvuB,EAAQ,EAAGA,EAAQsyB,EAAe,OAAQtyB,IAAS,CAC1D,IAAM61B,EAAcvD,EAAetyB,CAAK,EAClC81B,EACFP,EAAaI,EAAYE,GAAe,EAAE,GAAKA,EAAc,KAAM,EACnEJ,EAAcI,GAAe,EAAE,EACnCD,EAAiB51B,CAAK,EAAI81B,CAC3B,CACD,OAAO,IAAI,aAAavH,CAAM,CAChC,CACF,CC9sBA,IAAAwH,IAAA,UAAA,CAOE,SAAAA,GAAA,CACE,KAAK,YAAc,CAAA,EACnB,KAAK,YAAc,CAAA,EAGN,OAAAA,EAAA,YAAP,UAAA,CACN,OAAIA,EAAiB,UAAY,OAC/BA,EAAiB,SAAW,IAAIA,GAE3BA,EAAiB,UASnBA,EAAkB,mBAAzB,SAA0BC,EAAoB,CAC5CD,EAAiB,YAAW,EAAG,YAAY,KAAKC,CAAU,GASrDD,EAAkB,mBAAzB,SAA0BE,EAAoB,CAC5CF,EAAiB,YAAW,EAAG,YAAY,KAAKE,CAAU,GAWrDF,EAAe,gBAAtB,SAAuBG,EAAoB,CACzC,OAAOH,EAAiB,YAAYG,EAAK,MAAM,GAW1CH,EAAA,gBAAP,SAAuBG,EAAsBC,EAAyB,CAEpE,OAAOJ,EAAiB,YAAYG,EAAK,OAAQC,CAAW,GAG/CJ,EAAA,YAAP,SACJG,EAAsBE,EACtBD,EAAyB,CAC3B,IAAME,EAA6B,CAAA,EAC7BC,EAAUF,IAAgB,OAC5BL,EAAiB,YAAW,EAAG,YAC/BA,EAAiB,YAAW,EAAG,YACnC,OAAAO,EAAQ,QAAQ,SAAAC,EAAM,CACpB,IAAM/S,EAAU+S,EAAOL,EAAKC,CAAW,EACnC3S,IAAY,MACd6S,EAAc,KAAK7S,CAAO,CAE9B,CAAC,EACM6S,GAEVN,CAAA,GAAA,EAEYS,GAAqB,SAACC,EAC/B,CAAA,OAAAV,GAAiB,mBAAmBU,CAAU,CAAC,EACtCC,GAAqB,SAACD,EAC/B,CAAA,OAAAV,GAAiB,mBAAmBU,CAAU,CAAC,EACtCE,GAAkB,SAACT,EAC5B,CAAA,OAAAH,GAAiB,gBAAgBG,CAAG,CAAC,EAC5BU,GACT,SAACV,EAAsBC,EACnB,CAAA,OAAAJ,GAAiB,gBAAgBG,EAAKC,CAAW,CAAC,ECrFpDU,GAAgB,eAChBC,GAAmB,EAKnBC,GAAmB,eAInBC,GAAkB,mBAexB,SAASC,IAAmB,CAC1B,GAAI,CAAChwB,GAAG,EAAG,QAAQ,YAAY,EAI7B,MAAM,IAAI,MACN,yFACuB,EAG7B,IAAMiwB,EAAiB,OAAO,OAAW,IAAc,KAAO,OACxD5Q,EAAU4Q,EAAU,WAAaA,EAAU,cAC7CA,EAAU,iBAAmBA,EAAU,aACvCA,EAAU,cACd,GAAI5Q,GAAW,KACb,MAAM,IAAI,MACN,2DAA2D,EAEjE,OAAOA,CACT,CAEA,SAAS6Q,GAAcC,EAAuB,CAC5C,IAAMC,EAAKD,EAAY,OACvBC,EAAG,kBAAkBN,GAAkB,CAAC,QAAS,WAAW,CAAC,EAC7DM,EAAG,kBAAkBL,GAAiB,CAAC,QAAS,WAAW,CAAC,CAC9D,CAOA,IAAAM,IAAA,UAAA,CAME,SAAAA,EAAYC,EAAiB,CAG3B,GAFA,KAAK,UAAYN,GAAmB,EAEhCM,GAAa,MAAQ,CAACA,EACxB,MAAM,IAAI,MACN,gEAAgE,EAEtE,KAAK,UAAYA,EAGb,OAAAD,EAAI,UAAA,KAAV,SAAW1C,EAA8B,oEAEvC,GAAIA,EAAe,yBAAyB,YAC1C,MAAM,IAAI,MACN,0FACwB,EAG9B,MAAO,CAAA,EAAA,KAAK,eAAe,KAAK,UAAWA,CAAc,CAClC,KACxB,EAEK0C,EAAA,UAAA,KAAN,UAAA,oEACE,MAAO,CAAA,EAAA,KAAK,eAAe,KAAK,SAAS,CAA4B,KACtE,EAgBOA,EAAA,UAAA,eAAA,SAAeC,EAAmB3C,EAA+B,CAAjE,IAiGPltB,EAAA,KA/FC,OAAO,IAAI,QAAmC,SAAC5K,EAASC,EAAM,CAC5D,IAAMq6B,EAAc1vB,EAAK,UAAU,KAAKmvB,GAAeC,EAAgB,EACvEM,EAAY,gBAAkB,UAAM,CAAA,OAAAD,GAAcC,CAAW,CAAzB,EAEpCA,EAAY,UAAY,UAAA,CACtB,IAAMC,EAAKD,EAAY,OAEvB,GAAIxC,GAAkB,KAAM,CAE1B,IAAM4C,EAAUH,EAAG,YAAYN,GAAkB,UAAU,EACrDU,EAAaD,EAAQ,YAAYT,EAAgB,EACjDW,EAAaD,EAAW,IAAI/vB,EAAK,SAAS,EAChDgwB,EAAW,UAAY,UAAA,CACrB,GAAIA,EAAW,QAAU,KACvB,OAAAL,EAAG,MAAK,EACDt6B,EAAO,IAAI,MACd,gCAAgC,OAAA2K,EAAK,UAAa,IAAA,EAClD,eAAe,CAAC,EAEpB5K,EAAQ46B,EAAW,OAAO,cAAc,CAE5C,EACAA,EAAW,QAAU,SAAAl5B,EAAK,CACxB,OAAA64B,EAAG,MAAK,EACDt6B,EAAO26B,EAAW,KAAK,CAChC,EACAF,EAAQ,WAAa,UAAM,CAAA,OAAAH,EAAG,MAAK,CAAR,CAC5B,KAAM,CAOLzC,EAAe,WAAazG,GAAqB,KAC7CyG,EAAe,UAAU,EAC7B,IAAM+C,EACF5C,GAA6BH,CAAc,EAEzCgD,EAASP,EAAG,YAAYL,GAAiB,WAAW,EACtDa,EAAYD,EAAO,YAAYZ,EAAe,EAC9Cc,EACJ,GAAI,CACFA,EACED,EAAU,IAAI,CAAC,UAAWnwB,EAAK,UAAW,mBAAkBiwB,CAAA,CAAC,CAChE,OAAQn5B,EAAO,CACd,OAAOzB,EAAOyB,CAAK,CACpB,CACD,IAAIu5B,EACJD,EAAe,UAAY,UAAA,CAEzBC,EAAUV,EAAG,YAAYN,GAAkB,WAAW,EACtD,IAAMU,EAAaM,EAAQ,YAAYhB,EAAgB,EACnDiB,EACJ,GAAI,CACFA,EAAkBP,EAAW,IAAI,CAC/B,UAAW/vB,EAAK,UAChB,eAAcktB,EACd,mBAAkB+C,CACnB,CAAA,CACF,OAAQn5B,EAAO,CAEd,OAAOzB,EAAOyB,CAAK,CACpB,CACDw5B,EAAgB,UAAY,UAAA,CAAM,OAAAl7B,EAAQ,CAAC,mBAAkB66B,CAAA,CAAC,CAAC,EAC/DK,EAAgB,QAAU,SAAAx5B,EAAK,CAG7Bq5B,EAAYD,EAAO,YAAYZ,EAAe,EAC9C,IAAMiB,EAAoBJ,EAAU,OAAOnwB,EAAK,SAAS,EACzDuwB,EAAkB,UAAY,UAAA,CAC5B,OAAAZ,EAAG,MAAK,EACDt6B,EAAOi7B,EAAgB,KAAK,CACrC,EACAC,EAAkB,QAAU,SAAAz5B,EAAK,CAC/B,OAAA64B,EAAG,MAAK,EACDt6B,EAAOi7B,EAAgB,KAAK,CACrC,CACF,CACF,EACAF,EAAe,QAAU,SAAAt5B,EAAK,CAC5B,OAAA64B,EAAG,MAAK,EACDt6B,EAAO+6B,EAAe,KAAK,CACpC,EACAF,EAAO,WAAa,UAAA,CACdG,GAAW,KACbV,EAAG,MAAK,EAERU,EAAQ,WAAa,UAAM,CAAA,OAAAV,EAAG,MAAK,CAAR,CAE/B,CACD,CACH,EACAD,EAAY,QAAU,SAAA54B,EAAS,CAAA,OAAAzB,EAAOq6B,EAAY,KAAK,CAAC,CAC1D,CAAC,SA1IaE,GAAU,WAAG,eA8IxB,IAAMY,GAA4B,SAAChC,EAAoB,CAC5D,OAAKjvB,GAAG,EAAG,QAAQ,YAAY,GAGzB,CAAC,MAAM,QAAQivB,CAAG,GAAKA,EAAI,WAAWoB,GAAiB,UAAU,EAC5Da,GAAiBjC,EAAI,MAAMoB,GAAiB,WAAW,MAAM,CAAC,EAHhE,IAQX,EACAvB,GAAiB,mBAAmBmC,EAAe,EACnDnC,GAAiB,mBAAmBmC,EAAe,EAmB7C,SAAUC,GAAiBZ,EAAiB,CAChD,OAAO,IAAID,GAAiBC,CAAS,CACvC,CAEA,SAASa,GAAiBtwB,EAAW,CACnC,OAAOA,EAAI,WAAWwvB,GAAiB,UAAU,EAC7CxvB,EAAI,MAAMwvB,GAAiB,WAAW,MAAM,EAC5CxvB,CACN,CAEA,IAAAuwB,IAAA,UAAA,CAGE,SAAAA,GAAA,CACE,KAAK,UAAYpB,GAAmB,EAGhC,OAAAoB,EAAA,UAAA,WAAN,UAAA,+EACE,MAAA,CAAA,EAAO,IAAI,QACP,SAACv7B,EAASC,EAAM,CACd,IAAMq6B,EACF1vB,EAAK,UAAU,KAAKmvB,GAAeC,EAAgB,EACvDM,EAAY,gBAAkB,UAAM,CAAA,OAAAD,GAAcC,CAAW,CAAzB,EAEpCA,EAAY,UAAY,UAAA,CACtB,IAAMC,EAAKD,EAAY,OACjBkB,EAAKjB,EAAG,YAAYL,GAAiB,UAAU,EAC/CuB,EAAQD,EAAG,YAAYtB,EAAe,EAStCwB,EAAqBD,EAAc,OAAM,EAC/CC,EAAkB,UAAY,UAAA,SACtBrQ,EAA4C,CAAA,MAClD,QAAmB5gB,EAAAvJ,GAAAw6B,EAAkB,MAAM,EAAAhxB,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAAxC,IAAM0hB,EAAIzhB,EAAA,MACb2gB,EAAIc,EAAK,SAAS,EAAIA,EAAK,kBAC5B,mGACDnsB,EAAQqrB,CAAG,CACb,EACAqQ,EAAkB,QAAU,SAAAh6B,EAAK,CAC/B,OAAA64B,EAAG,MAAK,EACDt6B,EAAOy7B,EAAkB,KAAK,CACvC,EACAF,EAAG,WAAa,UAAM,CAAA,OAAAjB,EAAG,MAAK,CAAR,CACxB,EACAD,EAAY,QAAU,SAAA54B,EAAS,CAAA,OAAAzB,EAAOq6B,EAAY,KAAK,CAAC,CAC1D,CAAC,CAAC,KACP,EAEKiB,EAAW,UAAA,YAAjB,SAAkBtb,EAAY,+EAC5B,OAAAA,EAAOqb,GAAiBrb,CAAI,EAC5B,CAAA,EAAO,IAAI,QAA4B,SAACjgB,EAASC,EAAM,CACrD,IAAMq6B,EAAc1vB,EAAK,UAAU,KAAKmvB,GAAeC,EAAgB,EACvEM,EAAY,gBAAkB,UAAM,CAAA,OAAAD,GAAcC,CAAW,CAAzB,EAEpCA,EAAY,UAAY,UAAA,CACtB,IAAMC,EAAKD,EAAY,OACjBqB,EAASpB,EAAG,YAAYL,GAAiB,WAAW,EACpD0B,EAAYD,EAAO,YAAYzB,EAAe,EAE9C2B,EAAiBD,EAAU,IAAI3b,CAAI,EACrCya,EACJmB,EAAe,UAAY,UAAA,CACzB,GAAIA,EAAe,QAAU,KAC3B,OAAAtB,EAAG,MAAK,EACDt6B,EAAO,IAAI,MACd,gCAAA,OAAgCggB,EAAQ,IAAA,EACxC,eAAe,CAAC,EAGpB,IAAMkb,EAAoBS,EAAU,OAAO3b,CAAI,EACzC6b,EAAkB,UAAA,CAEtBpB,EAAUH,EAAG,YAAYN,GAAkB,WAAW,EACtD,IAAMU,EAAaD,EAAQ,YAAYT,EAAgB,EACjD8B,EAAqBpB,EAAW,OAAO1a,CAAI,EACjD8b,EAAmB,UAAY,UAAA,CAC3B,OAAA/7B,EAAQ67B,EAAe,OAAO,kBAAkB,CAAC,EACrDE,EAAmB,QAAU,SAAAr6B,EACzB,CAAA,OAAAzB,EAAO47B,EAAe,KAAK,CAAC,CAClC,EAGAV,EAAkB,UAAYW,EAC9BX,EAAkB,QAAU,SAAAz5B,EAAK,CAC/B,OAAAo6B,EAAe,EACfvB,EAAG,MAAK,EACDt6B,EAAO47B,EAAe,KAAK,CACpC,CAEJ,EACAA,EAAe,QAAU,SAAAn6B,EAAK,CAC5B,OAAA64B,EAAG,MAAK,EACDt6B,EAAO47B,EAAe,KAAK,CACpC,EAEAF,EAAO,WAAa,UAAA,CACdjB,GAAW,KACbH,EAAG,MAAK,EAERG,EAAQ,WAAa,UAAM,CAAA,OAAAH,EAAG,MAAK,CAAR,CAE/B,CACF,EACAD,EAAY,QAAU,SAAA54B,EAAS,CAAA,OAAAzB,EAAOq6B,EAAY,KAAK,CAAC,CAC1D,CAAC,CAAC,KACH,EACFiB,CAAA,GAAA,EC1VKS,GAAiB,IACjBC,GAAc,sBACdC,GAAc,OACdC,GAAwB,iBACxBC,GAAsB,eACtBC,GAAqB,cACrBC,GAAwB,iBAsD9B,SAASC,GAAatc,EAAY,CAChC,MAAO,CACL,KAAM,CAACgc,GAAahc,EAAMic,EAAW,EAAE,KAAKF,EAAc,EAC1D,SAAU,CAACC,GAAahc,EAAMkc,EAAqB,EAAE,KAAKH,EAAc,EACxE,YAAa,CAACC,GAAahc,EAAMmc,EAAmB,EAAE,KAAKJ,EAAc,EACzE,WAAY,CAACC,GAAahc,EAAMoc,EAAkB,EAAE,KAAKL,EAAc,EACvE,cACI,CAACC,GAAahc,EAAMqc,EAAqB,EAAE,KAAKN,EAAc,EAEtE,CAEA,SAASQ,GAAYpM,EAAsB,aACzC,QAAkB3lB,EAAAvJ,GAAA,OAAO,OAAOkvB,CAAI,CAAC,EAAA1lB,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAAlC,IAAMO,EAAGN,EAAA,MACZ,OAAO,aAAa,WAAWM,CAAG,CACnC,mGACH,CASA,SAASyxB,GAAoBzxB,EAAW,CACtC,IAAMusB,EAAQvsB,EAAI,MAAMgxB,EAAc,EACtC,GAAIzE,EAAM,OAAS,EACjB,MAAM,IAAI,MAAM,uBAAA,OAAuBvsB,CAAG,CAAE,EAE9C,OAAOusB,EAAM,MAAM,EAAGA,EAAM,OAAS,CAAC,EAAE,KAAKyE,EAAc,CAC7D,CAEA,SAASV,GAAiBtwB,EAAW,CACnC,OAAOA,EAAI,WAAW0xB,GAAoB,UAAU,EAChD1xB,EAAI,MAAM0xB,GAAoB,WAAW,MAAM,EAC/C1xB,CACN,CAOA,IAAA0xB,IAAA,UAAA,CAOE,SAAAA,EAAYjC,EAAiB,CAC3B,GAAI,CAACtwB,GAAG,EAAG,QAAQ,YAAY,GAAK,OAAO,OAAW,KAClD,OAAO,OAAO,aAAiB,IAKjC,MAAM,IAAI,MACN,yDAAyD,EAI/D,GAFA,KAAK,GAAK,OAAO,aAEbswB,GAAa,MAAQ,CAACA,EACxB,MAAM,IAAI,MACN,oEAAoE,EAE1E,KAAK,UAAYA,EACjB,KAAK,KAAO8B,GAAa,KAAK,SAAS,EAYnC,OAAAG,EAAI,UAAA,KAAV,SAAW5E,EAA8B,kFACvC,GAAIA,EAAe,yBAAyB,YAC1C,MAAM,IAAI,MACN,0FACwB,EAEtB6E,EAAW,KAAK,UAAU7E,EAAe,aAAa,EACtDD,EAAc,KAAK,UAAUC,EAAe,WAAW,EAEvD8E,EACF3E,GAA6BH,CAAc,EAIzC+E,EAAexL,GAAqB,KAAKyG,EAAe,UAAU,EAExE,GAAI,CACF,YAAK,GAAG,QAAQ,KAAK,KAAK,KAAM,KAAK,UAAU8E,CAAkB,CAAC,EAClE,KAAK,GAAG,QAAQ,KAAK,KAAK,SAAUD,CAAQ,EAC5C,KAAK,GAAG,QAAQ,KAAK,KAAK,YAAa9E,CAAW,EAClD,KAAK,GAAG,QACJ,KAAK,KAAK,WACVZ,GAA0B4F,CAAY,CAAC,EAKrCC,EAAoC,CACxC,OAAQhF,EAAe,OACvB,YAAaA,EAAe,YAC5B,YAAaA,EAAe,YAC5B,UAAWA,EAAe,WAAa,KACnCA,EAAe,UACf,OACJ,oBAAqBA,EAAe,qBAAuB,KACvDA,EAAe,oBACf,OACJ,iBAAkBA,EAAe,kBAAoB,KACjDA,EAAe,iBACf,OACJ,qBAAsBA,EAAe,sBAAwB,KACzDA,EAAe,qBACf,OACJ,eAAgBA,EAAe,gBAAkB,KAC7CA,EAAe,eACf,QAEN,KAAK,GAAG,QAAQ,KAAK,KAAK,cAAe,KAAK,UAAUgF,CAAQ,CAAC,EAEjE,CAAA,EAAO,CAAC,mBAAkBF,CAAA,CAAC,CAC5B,MAAa,CAEZ,MAAAJ,GAAY,KAAK,IAAI,EAEf,IAAI,MACN,yBAAA,OAAyB,KAAK,UAA+B,sBAAA,EAC7D,kEACA,sBAAsB,OAAAI,EAAmB,mBAAsB,IAAA,EAC/D,oBAAoB,OAAAA,EAAmB,iBAAoB,IAAA,EAC3D,mBAAA,OAAmBA,EAAmB,gBAAe,GAAA,CAAG,CAC7D,cAEJ,EAUKF,EAAA,UAAA,KAAN,UAAA,sFAGE,GAFM3S,EACF,KAAK,MAAM,KAAK,GAAG,QAAQ,KAAK,KAAK,IAAI,CAAC,EAC1CA,GAAQ,KACV,MAAM,IAAI,MACN,kDAAA,OAAkD,KAAK,UAAY,GAAA,CAAA,EAGzE,GAAIA,EAAK,oBAAsB,OAC7B,MAAM,IAAI,MACN,2EACe,EAOrB,GAJMsB,EAAsB,CAAA,EAGtBsR,EAAW,KAAK,MAAM,KAAK,GAAG,QAAQ,KAAK,KAAK,QAAQ,CAAC,EAC3DA,GAAY,KACd,MAAM,IAAI,MACN,4CAAA,OAA4C,KAAK,UAAa,IAAA,EAC9D,aAAa,EAMnB,GAJAtR,EAAI,cAAgBsR,EAGd9E,EAAc,KAAK,MAAM,KAAK,GAAG,QAAQ,KAAK,KAAK,WAAW,CAAC,EACjEA,GAAe,KACjB,MAAM,IAAI,MACN,gDAAA,OAAgD,KAAK,UAAa,IAAA,EAClE,cAAc,EA8BpB,GA5BAxM,EAAI,YAAcwM,EAGZkF,EAAiB,KAAK,GAAG,QAAQ,KAAK,KAAK,aAAa,EAC1DA,GAAkB,OACdD,EAAW,KAAK,MAAMC,CAAc,EAC1C1R,EAAI,OAASyR,EAAS,OACtBzR,EAAI,YAAcyR,EAAS,YAC3BzR,EAAI,YAAcyR,EAAS,YACvBA,EAAS,WAAa,OACxBzR,EAAI,UAAYyR,EAAS,WAEvBA,EAAS,qBAAuB,OAClCzR,EAAI,oBAAsByR,EAAS,qBAEjCA,EAAS,kBAAoB,OAC/BzR,EAAI,iBAAmByR,EAAS,kBAE9BA,EAAS,sBAAwB,OACnCzR,EAAI,qBAAuByR,EAAS,sBAElCA,EAAS,gBAAkB,OAC7BzR,EAAI,eAAiByR,EAAS,iBAK5BE,EAAmB,KAAK,GAAG,QAAQ,KAAK,KAAK,UAAU,EACzDA,GAAoB,KACtB,MAAM,IAAI,MACN,uDACA,IAAA,OAAI,KAAK,UAAS,gBAAA,CAAgB,EAExC,OAAA3R,EAAI,WAAa8L,GAA0B6F,CAAgB,EAE3D,CAAA,EAAO3R,CAAG,KACX,QA3KeqR,GAAU,WAAG,kBA8KxB,IAAMO,GAA+B,SAAC7D,EAAoB,CAC/D,OAAKjvB,GAAG,EAAG,QAAQ,YAAY,GAGzB,CAAC,MAAM,QAAQivB,CAAG,GAAKA,EAAI,WAAWsD,GAAoB,UAAU,EAC/DQ,GACH9D,EAAI,MAAMsD,GAAoB,WAAW,MAAM,CAAC,EAJ/C,IASX,EACAzD,GAAiB,mBAAmBgE,EAAkB,EACtDhE,GAAiB,mBAAmBgE,EAAkB,EA0BhD,SAAUC,GAAoBzC,EAAiB,CACnD,OAAO,IAAIiC,GAAoBjC,CAAS,CAC1C,CAEA,IAAA0C,IAAA,UAAA,CAGE,SAAAA,GAAA,CACE74B,EACI6F,GAAG,EAAG,QAAQ,YAAY,EAC1B,UAAA,CAAM,MAAA,0CAAA,CAA0C,EACpD7F,EACI,OAAO,OAAW,KACd,OAAO,OAAO,aAAiB,IACnC,UAAM,CAAA,MAAA,yDAAyD,CAAA,EACnE,KAAK,GAAK,OAAO,aAGb,OAAA64B,EAAA,UAAA,WAAN,UAAA,oFAIE,IAHM9R,EAA4C,CAAA,EAC5C+R,EAASnB,GAAcD,GACvBqB,EAASrB,GAAiBE,GACvB56B,EAAI,EAAGA,EAAI,KAAK,GAAG,OAAQ,EAAEA,EAC9B0J,EAAM,KAAK,GAAG,IAAI1J,CAAC,EACrB0J,EAAI,WAAWoyB,CAAM,GAAKpyB,EAAI,SAASqyB,CAAM,IACzC5C,EAAYgC,GAAoBzxB,CAAG,EACzCqgB,EAAIoP,CAAS,EAAI,KAAK,MAAM,KAAK,GAAG,QAAQzvB,CAAG,CAAC,GAGpD,MAAA,CAAA,EAAOqgB,CAAG,KACX,EAEK8R,EAAW,UAAA,YAAjB,SAAkBld,EAAY,4EAG5B,GAFAA,EAAOqb,GAAiBrb,CAAI,EACtBmQ,EAAOmM,GAAatc,CAAI,EAC1B,KAAK,GAAG,QAAQmQ,EAAK,IAAI,GAAK,KAChC,MAAM,IAAI,MAAM,8BAAA,OAA8BnQ,EAAI,GAAA,CAAG,EAEjD,OAAA8J,EAAO,KAAK,MAAM,KAAK,GAAG,QAAQqG,EAAK,IAAI,CAAC,EAClDoM,GAAYpM,CAAI,EAChB,CAAA,EAAOrG,CAAI,KACZ,EACFoT,CAAA,GAAA,ECpWKG,GAAoB,MAE1BC,IAAA,UAAA,CAME,SAAAA,GAAA,CACE,KAAK,SAAW,CAAA,EAGH,OAAAA,EAAA,YAAP,UAAA,CACN,OAAIA,EAA0B,UAAY,OACxCA,EAA0B,SAAW,IAAIA,GAEpCA,EAA0B,UAS5BA,EAAA,gBAAP,SAAuBC,EAAgBC,EAA0B,CAC/Dn5B,EAAOk5B,GAAU,KAAM,UAAM,CAAA,MAAA,uCAAuC,CAAA,EAChEA,EAAO,SAASF,EAAiB,IACnCE,EAASA,EAAO,MAAM,EAAGA,EAAO,QAAQF,EAAiB,CAAC,GAE5Dh5B,EAAOk5B,EAAO,OAAS,EAAG,UAAA,CAAM,MAAA,qCAAA,CAAqC,EACrE,IAAME,EAAWH,EAA0B,YAAW,EACtDj5B,EACIo5B,EAAS,SAASF,CAAM,GAAK,KAC7B,UAAA,CAAM,MAAA,2DACF,OAAAA,EAAM,IAAA,CADJ,CACQ,EAClBE,EAAS,SAASF,CAAM,EAAIC,GAGvBF,EAAU,WAAjB,SAAkBC,EAAc,CAC9B,IAAMC,EAAUF,EAA0B,YAAW,EAAG,SAASC,CAAM,EACvE,GAAIC,GAAW,KACb,MAAM,IAAI,MAAM,yCAAA,OAAyCD,EAAM,GAAA,CAAG,EAEpE,OAAOC,GAGFF,EAAA,WAAP,UAAA,CACE,OAAO,OAAO,KAAKA,EAA0B,YAAW,EAAG,QAAQ,GAEtEA,CAAA,GAAA,EAUD,SAASI,GAASvE,EAAW,CAC3B,GAAIA,EAAI,QAAQkE,EAAiB,IAAM,GACrC,MAAM,IAAI,MACN,6EAEA,GAAG,OAAAC,GAA0B,WAAU,EAAG,KAAK,GAAG,CAAC,CAAE,EAE3D,MAAO,CACL,OAAQnE,EAAI,MAAMkE,EAAiB,EAAE,CAAC,EACtC,KAAMlE,EAAI,MAAMkE,EAAiB,EAAE,CAAC,EAExC,CAEA,SAAeM,GACXC,EAAmBC,EACnBC,EAAoB,CAApB,OAAAA,IAAA,SAAAA,EAAoB,6GACtB,OAAAz5B,EACIu5B,IAAcC,EACd,UAAA,CAAM,MAAA,wCAAA,OAAwCD,EAAS,GAAA,CAAjD,CAAoD,EAExDG,EAAe/E,GAAiB,gBAAgB4E,CAAS,EAC/Dv5B,EACI05B,EAAa,OAAS,EACtB,UAAM,CAAA,MAAA,kEAAA,OACFH,EAAS,GAAA,CADP,CACU,EACpBv5B,EACI05B,EAAa,OAAS,EACtB,UAAA,CAAM,MAAA,yCAAA,OAAyCA,EAAa,OAAU,IAAA,EAClE,gCAAA,OAAgCH,EAAS,GAAA,CADvC,CAC0C,EAC9CI,EAAcD,EAAa,CAAC,EAE5BE,EAAejF,GAAiB,gBAAgB6E,CAAO,EAC7Dx5B,EACI45B,EAAa,OAAS,EACtB,UAAM,CAAA,MAAA,mEACF,OAAA,OAAOJ,EAAO,GAAA,CADZ,CACe,EACzBx5B,EACI45B,EAAa,OAAS,EACtB,UAAA,CAAM,MAAA,yCAAA,OAAyCF,EAAa,OAAU,IAAA,EAClE,qCAAA,OAAqCF,EAAO,GAAA,CAD1C,CAC6C,EACjDK,EAAcD,EAAa,CAAC,EAE5BE,EAAeT,GAASE,CAAS,EAAE,OACnCQ,EAAaV,GAASE,CAAS,EAAE,KACjCS,EAAaF,IAAiBT,GAASE,CAAS,EAAE,OAEjC,CAAA,EAAMI,EAAY,KAAI,CAAE,SAK3C,OALEnG,EAAiBttB,EAAwB,KAAA,EAK3CuzB,GAAgBO,EAClB,CAAA,EAAMf,GAA0B,WAAWa,CAAY,EAClD,YAAYC,CAAU,CAAC,EAFA,CAAA,EAAA,CAAA,SAC5B7zB,EAAA,KAAA,YAIiB,IAAA,GAAA,MAAA,CAAA,EAAM2zB,EAAY,KAAKrG,CAAc,CAAC,SAKrD,OALEyG,EAAa/zB,EAAsC,KAAA,EAKrDuzB,GAAgB,CAACO,EACnB,CAAA,EAAMf,GAA0B,WAAWa,CAAY,EAClD,YAAYC,CAAU,CAAC,EAFC,CAAA,EAAA,CAAA,SAC7B7zB,EAAA,KAAA,mBAIF,MAAO,CAAA,EAAA+zB,EAAW,kBAAkB,MACrC,CAqCD,SAAeC,IAAU,qHACjBC,EAAUlB,GAA0B,WAAU,EAC9ClS,EAA2C,CAAA,0CAC5BqT,EAAAx9B,GAAAu9B,CAAO,EAAAE,EAAAD,EAAA,KAAA,wCAAjBlB,EAAMmB,EAAA,MAEL,CAAA,EAAApB,GAA0B,WAAWC,CAAM,EAAE,WAAU,CAAE,UAD7DoB,EACFn0B,EAA+D,KAAA,EACnE,IAAWwV,KAAQ2e,EACXxF,EAAMoE,EAASF,GAAoBrd,EACzCoL,EAAI+N,CAAG,EAAIwF,EAAU3e,CAAI,6LAG7B,IAAA,GAAA,MAAA,CAAA,EAAOoL,CAAG,MACX,CAmCD,SAAewT,GAAYzF,EAAW,4EAC9B,OAAA0F,EAAgBnB,GAASvE,CAAG,EAC5BqE,EAAUF,GAA0B,WAAWuB,EAAc,MAAM,EAClE,CAAA,EAAArB,EAAQ,YAAYqB,EAAc,IAAI,CAAC,KAC/C,CAiDD,SAAeC,GACXlB,EAAmBC,EAAe,0EAC9B,OAAAC,EAAe,GACd,CAAA,EAAAH,GAAmBC,EAAWC,EAASC,CAAY,CAAC,KAC5D,CAgDD,SAAeiB,GACXnB,EAAmBC,EAAe,0EAC9B,OAAAC,EAAe,GACd,CAAA,EAAAH,GAAmBC,EAAWC,EAASC,CAAY,CAAC,KAC5D,CCtUD,IAAAkB,IAAA,UAAA,CAAA,SAAAA,GAAA,CAMmB,KAAW,YAAG,mBACvB,KAAY,aAAe,CAAA,EAC3B,KAAmB,oBAAG,EACtB,KAAgB,iBAAG,GAE3B,OAAAA,EAAA,UAAA,MAAA,SAAMhf,EAAcjU,EAAkB,CACpC,OAAO,MAAMiU,EAAMjU,CAAI,GAGzBizB,EAAA,UAAA,IAAA,UAAA,CACE,OAAO,YAAY,IAAG,GAGxBA,EAAA,UAAA,OAAA,SAAOC,EAAc/e,EAAgB,CACnC,GAAIA,IAAa,SAAWA,IAAa,OACvC,MAAM,IAAI,MACN,kDAAA,OAAkDA,CAAQ,CAAE,EAElE,OAAI,KAAK,aAAe,OACtB,KAAK,YAAc,IAAI,aAElB,KAAK,YAAY,OAAO+e,CAAI,GAErCD,EAAA,UAAA,OAAA,SAAOp3B,EAAmBsY,EAAgB,CACxC,OAAO,IAAI,YAAYA,CAAQ,EAAE,OAAOtY,CAAK,GAO/Co3B,EAAA,UAAA,iBAAA,SAAiBE,EAAuBC,EAAa,CAArD,IA4BCx0B,EAAA,KA3BC,GAAI,OAAO,OAAW,KAClB,CAACT,GAAG,EAAG,QAAQ,sBAAsB,EAAG,CAC1C,WAAWg1B,EAAaC,CAAK,EAC7B,MACD,CAED,KAAK,aAAa,KAAKD,CAAW,EAClC,WAAW,UAAA,CACT,OAAO,YACH,CAAC,KAAMv0B,EAAK,YAAa,MAAOA,EAAK,aAAa,OAAS,CAAC,EAAG,GAAG,GACrEw0B,CAAK,EAEH,KAAK,mBACR,KAAK,iBAAmB,GACxB,OAAO,iBAAiB,UAAW,SAACC,EAAmB,CACrD,GAAIA,EAAM,SAAW,QAAUA,EAAM,KAAK,OAASz0B,EAAK,YAAa,CACnEy0B,EAAM,gBAAe,EACrB,IAAMC,EAAc10B,EAAK,aAAay0B,EAAM,KAAK,KAAK,EACtDC,EAAW,EACX10B,EAAK,sBACDA,EAAK,sBAAwBA,EAAK,aAAa,SACjDA,EAAK,aAAe,CAAA,EACpBA,EAAK,oBAAsB,EAE9B,GACA,EAAI,IAIXq0B,EAAY,UAAA,aAAZ,SAAa96B,EAAU,CAErB,OAAO2U,GAAoB3U,CAAC,GAE/B86B,CAAA,GAAA,EAED,GAAI90B,GAAG,EAAG,IAAI,YAAY,EAAG,CAC3BA,GAAG,EAAG,YAAY,UAAW,IAAI80B,EAAiB,EAGlD,GAAI,CACF1B,GAA0B,gBACtBb,GAAoB,WAAY,IAAIS,EAA4B,CACrE,MAAa,CACb,CAGD,GAAI,CACFI,GAA0B,gBACtB/C,GAAiB,WAAY,IAAIe,EAAyB,CAC/D,MAAa,CACb,CACF,CChGM,IAAMgE,GAAe,CAE1B,YAAa,UAAA,CAAM,MAAA,KAAqB,GAItCC,GAaJC,IAAA,UAAA,CAKE,SAAAA,GAAA,CAEE,KAAK,KAAO,GAAQ,MAAM,EAG1B,KAAK,YAAc,IAAI,KAAK,KAAK,YAGnC,OAAAA,EAAA,UAAA,MAAA,SAAMxf,EAAcC,EAA0B,CAC5C,OAAI/V,GAAG,EAAG,OAAO,OAAS,KACjBA,GAAG,EAAG,OAAO,MAAM8V,EAAMC,CAAY,GAG1Csf,IAAe,OACjBA,GAAcD,GAAa,YAAW,GAEjCC,GAAYvf,EAAMC,CAAY,IAGvCuf,EAAA,UAAA,IAAA,UAAA,CACE,IAAM7d,EAAO,QAAQ,OAAM,EAC3B,OAAOA,EAAK,CAAC,EAAI,IAAOA,EAAK,CAAC,EAAI,KAGpC6d,EAAA,UAAA,OAAA,SAAOP,EAAc/e,EAAgB,CACnC,GAAIA,IAAa,SAAWA,IAAa,OACvC,MAAM,IAAI,MACN,sDAAA,OAAsDA,CAAQ,CAAE,EAEtE,OAAO,KAAK,YAAY,OAAO+e,CAAI,GAErCO,EAAA,UAAA,OAAA,SAAO53B,EAAmBsY,EAAgB,CACxC,OAAItY,EAAM,SAAW,EACZ,GAEF,IAAI,KAAK,KAAK,YAAYsY,CAAQ,EAAE,OAAOtY,CAAK,GAEzD43B,EAAY,UAAA,aAAZ,SAAat7B,EAAU,CAErB,OAAO,KAAK,KAAK,MAAM,eAAeA,CAAC,GAClC,KAAK,KAAK,MAAM,aAAaA,CAAC,GAC9B,KAAK,KAAK,MAAM,aAAaA,CAAC,GAC9B,KAAK,KAAK,MAAM,oBAAoBA,CAAC,GAE7Cs7B,CAAA,GAAA,EAEGt1B,GAAG,EAAG,IAAI,SAAS,GAAK,CAACA,GAAG,EAAG,IAAI,YAAY,GACjDA,GAAG,EAAG,YAAY,OAAQ,IAAIs1B,EAAc,WC5C9BhO,GACZ9uB,EAAoBC,EACpBF,EAAuB,CADH,OAAAE,IAAA,SAAAA,EAAyB,WAE/CA,EAAQA,GAAS,UACjB88B,GAAwC/8B,CAAK,EACtC,IAAIijB,GAAmBjjB,EAAOC,EAAOF,CAAM,CACpD,CCdA,SAASi9B,GAAwBn8B,EAAiBZ,EAAe,CAC/D,IAAMg9B,EAAK/P,EAAgBrsB,EAAG,IAAK,MAAM,EAGzC,GAAI,CAACq8B,GAAkBj9B,CAAK,EAC1B,MAAM,IAAI,MAAM,mCAAA,OAAmCA,CAAK,CAAE,EAE5D,GAAIA,IAAU,UAAYg9B,EAAG,QAAU,UACnCh9B,IAAU,UAAYg9B,EAAG,QAAU,SACrC,MAAM,IAAI,MAAM,uCAAuC,EAGzD,IAAM/e,EAAqB,CAAC,EAAG+e,CAAE,EAC3BrV,EAAmB,CAAC,MAAK3nB,CAAA,EAE/B,OAAOunB,EAAO,UACVxc,GAAMkT,EACN0J,CAAgC,CACtC,CAEO,IAAMuV,GAAuB7+B,EAAG,CAAC,MAAK0+B,EAAA,CAAC,ECnB9C,SAASI,GAAyBv8B,EAAe,CAC/C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,QAAS,mBAAmB,EACzDqd,EAAyB,CAAC,EAAG+e,CAAE,EAIrC,OAAOzV,EAAO,UAAU1Z,GAAUoQ,CAAmC,CACvE,CAEO,IAAMmf,GAAwB/+B,EAAG,CAAC,OAAM8+B,EAAA,CAAC,ECjBhC,SAAAE,GAAwBz8B,EAAMygB,EAAe,CAAfA,IAAA,SAAAA,EAAe,IAC3D,QAAQ,IAAIzgB,EAAE,SAASygB,CAAO,CAAC,CACjC,CCbAuK,GAAe,EAcf,IAAMlI,GAAuB,CAC3B,OAAMmL,GACN,KAAIqO,GACJ,MAAKE,GACL,MAAKC,IAEPxZ,GAAaH,EAAS,ECQtB,SAAS4Z,GAAuB/7B,EAAsB9E,EAAoB,OACpE8gC,EAAKtQ,EAAgB1rB,EAAG,IAAK,KAAK,EAClCi8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,KAAK,EACtCmL,EAAAjJ,EAAW4mB,GAAegY,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAE31B,EAAA,CAAA,EAAE41B,EAAE51B,EAAA,CAAA,EAEP,IAAMqW,EAAoB,CAAC,EAAGsf,EAAI,EAAGC,CAAE,EAEvC,OAAOjW,EAAO,UAAU7d,GAAKuU,CAAmC,CAClE,CAEO,IAAMyC,GAAsBriB,EAAG,CAAC,KAAIi/B,EAAA,CAAC,ECN5C,SAASG,GACLl8B,EAAsB9E,EAAoB,OACxC8gC,EAAKtQ,EAAgB1rB,EAAG,IAAK,UAAU,EACvCi8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,UAAU,EAC3CmL,EAAAjJ,EAAW4mB,GAAegY,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAE31B,EAAA,CAAA,EAAE41B,EAAE51B,EAAA,CAAA,EAEP,IAAMqW,EAAyB,CAAC,EAAGsf,EAAI,EAAGC,CAAE,EAE5C,OAAOjW,EAAO,UAAUha,GAAU0Q,CAAmC,CACvE,CAEO,IAAMyf,GAA2Br/B,EAAG,CAAC,UAASo/B,EAAA,CAAC,ECZtD,SAASE,GAAuBp8B,EAAsB9E,EAAoB,OACpE8gC,EAAKtQ,EAAgB1rB,EAAG,IAAK,KAAK,EAClCi8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,KAAK,EAGtC,GAFAmL,EAAAjJ,EAAW4mB,GAAegY,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAE31B,EAAA,CAAA,EAAE41B,EAAE51B,EAAA,CAAA,EAEH21B,EAAG,QAAU,SAAWC,EAAG,QAAU,QACvC,OAAOE,GAASH,EAAIC,CAAE,EAGxB,IAAMvf,EAAwB,CAAC,EAAGsf,EAAI,EAAGC,CAAE,EACrC7V,EAAQ,CAAA,EAGd,OAAOJ,EAAO,UAAU7a,GACAuR,EAAqC0J,CAAK,CACpE,CAEO,IAAMhP,GAAsBta,EAAG,CAAC,KAAIs/B,EAAA,CAAC,ECjB5C,SAASC,GAAuBr8B,EAAsB9E,EAAoB,OACpE8gC,EAAKtQ,EAAgB1rB,EAAG,IAAK,KAAK,EAClCi8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,KAAK,EACtCmL,EAAAjJ,EAAW4mB,GAAegY,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAE31B,EAAA,CAAA,EAAE41B,EAAE51B,EAAA,CAAA,EAEP,IAAMqW,EAAyB,CAAC,EAAGsf,EAAI,EAAGC,CAAE,EAE5C,OAAOjW,EAAO,UAAUxX,GAAUkO,CAAmC,CACvE,CACO,IAAMjC,EAAsB3d,EAAG,CAAC,KAAIu/B,EAAA,CAAC,ECvB5C,SAASC,GAAuBj9B,EAAe,CAC7C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,KAAK,EAExC,GAAIo8B,EAAG,QAAU,YAAa,CAC5B,IAAM/e,EAA2B,CAAC,EAAG+e,CAAE,EACvC,OAAOzV,EAAO,UAAUpc,GAAY8S,CAAmC,CACxE,KAAM,CACL,IAAMA,EAAoB,CAAC,EAAG+e,CAAE,EAChC,OAAOzV,EAAO,UAAUhe,GAAK0U,CAAmC,CACjE,CACH,CAEO,IAAM6f,GAAsBz/B,EAAG,CAAC,KAAIw/B,EAAA,CAAC,ECd5C,SAASE,GAAwBn9B,EAAe,CAC9C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,MAAM,EACnCqd,EAAqB,CAAC,EAAG+e,CAAE,EAEjC,OAAOzV,EAAO,UAAU/d,GAAMyU,CAAmC,CACnE,CACO,IAAM+f,GAAuB3/B,EAAG,CAAC,MAAK0/B,EAAA,CAAC,ECH9C,SAASE,GAAyBr9B,EAAe,CAC/C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,OAAO,EACpCqd,EAAsB,CAAC,EAAG+e,CAAE,EAElC,OAAOzV,EAAO,UAAU9d,GAAOwU,CAAmC,CACpE,CACO,IAAMigB,GAAwB7/B,EAAG,CAAC,OAAM4/B,EAAA,CAAC,ECNhD,SAASE,GAAwB/U,EAA4B,CAC3DjG,EACI,MAAM,QAAQiG,CAAO,EACrB,UAAA,CAAM,MAAA,4DAAA,CAA4D,EACtEjG,EACIiG,EAAQ,QAAU,EAClB,UAAM,CAAA,MAAA,uDACF,GAAA,OAAGA,EAAQ,MAAM,CADf,CACiB,EAE3B,IAAMgV,EACFhV,EAAQ,IAAI,SAACtrB,EAAGY,EAAM,CAAA,OAAAuuB,EAAgBnvB,EAAG,UAAA,OAAUY,CAAC,EAAI,MAAM,CAAC,CAAA,EAE7D2/B,EAAcD,EAAS,CAAC,EAC9BA,EAAS,QAAQ,SAAAtgC,EAAC,CAChB,GAAIA,EAAE,QAAUugC,EAAY,MAC1B,MAAM,IAAI,MACN,0DAA0D,CAElE,CAAC,EAEDD,EAAS,QAAQ,SAAAtgC,EAAC,CAChB,GAAI,CAACijB,GAAiBjjB,EAAE,MAAOugC,EAAY,KAAK,EAC9C,MAAM,IAAI,MACN,0DAA0D,CAElE,CAAC,EAED,IAAMpgB,EAAqBmgB,EAE3B,OAAO7W,EAAO,UAAU5d,GAAMsU,CAAmC,CACnE,CAEO,IAAMqgB,GAAuBjgC,EAAG,CAAC,MAAK8/B,EAAA,CAAC,ECf9C,SAASI,GACL39B,EAAsBkD,EAA8B06B,EAAgB,CAA9C16B,IAAA,SAAAA,EAA4B,MAAE06B,IAAA,SAAAA,EAAgB,IACtE,IAAMxB,EAAK/P,EAAgBrsB,EAAG,IAAK,MAAO,MAAM,EAE1Cqd,EAAoB,CAAC,EAAG+e,CAAE,EAC1BrV,EAAkB,CAAC,KAAI7jB,EAAE,SAAQ06B,CAAA,EAEvC,OAAOjX,EAAO,UACV3d,GAAKqU,EACL0J,CAAgC,CACtC,CAEO,IAAM8W,GAAsBpgC,EAAG,CAAC,KAAIkgC,EAAA,CAAC,ECZ5C,SAASG,GACL99B,EAAsBkD,EAA8B06B,EAAgB,CAA9C16B,IAAA,SAAAA,EAA4B,MAAE06B,IAAA,SAAAA,EAAgB,IACtE,IAAMxB,EAAK/P,EAAgBrsB,EAAG,IAAK,MAAO,MAAM,EAE1Cqd,EAAoB,CAAC,EAAG+e,CAAE,EAC1BrV,EAAkB,CAAC,KAAI7jB,EAAE,SAAQ06B,CAAA,EAEvC,OAAOjX,EAAO,UACV1d,GAAKoU,EACL0J,CAAgC,CACtC,CAGO,IAAMgX,GAAsBtgC,EAAG,CAAC,KAAIqgC,EAAA,CAAC,EClB5C,SAASE,GAA0Bh+B,EAAsBkD,EAAQ,CAARA,IAAA,SAAAA,EAAQ,GAC/D,IAAMk5B,EAAK/P,EAAgBrsB,EAAG,IAAK,QAAQ,EAErCqd,EAAuB,CAAC,EAAG+e,CAAE,EAC7BrV,EAAqB,CAAC,KAAI7jB,CAAA,EAEhC,OAAOyjB,EAAO,UACVzd,GAAQmU,EACR0J,CAAgC,CACtC,CAEO,IAAMkX,GAAyBxgC,EAAG,CAAC,QAAOugC,EAAA,CAAC,ECXlD,SAASE,GAA0Bl+B,EAAsBkD,EAAQ,CAARA,IAAA,SAAAA,EAAQ,GAC/D,IAAMk5B,EAAK/P,EAAgBrsB,EAAG,IAAK,QAAQ,EAErCqd,EAAuB,CAAC,EAAG+e,CAAE,EAC7BrV,EAAqB,CAAC,KAAI7jB,CAAA,EAEhC,OAAOyjB,EAAO,UACVxd,GAAQkU,EACR0J,CAAgC,CACtC,CAEO,IAAMoX,GAAyB1gC,EAAG,CAAC,QAAOygC,EAAA,CAAC,ECzBlD,SAASE,GAAwBp+B,EAAe,CAC9C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,MAAM,EACnCqd,EAAqB,CAAC,EAAG+e,CAAE,EAEjC,OAAOzV,EAAO,UAAUvd,GAAMiU,CAAmC,CACnE,CACO,IAAMghB,GAAuB5gC,EAAG,CAAC,MAAK2gC,EAAA,CAAC,ECJ9C,SAASE,GAAyBt+B,EAAe,CAC/C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,OAAO,EAEpCqd,EAAsB,CAAC,EAAG+e,CAAE,EAElC,OAAOzV,EAAO,UAAUtd,GAAOgU,CAAmC,CACpE,CACO,IAAMkhB,GAAwB9gC,EAAG,CAAC,OAAM6gC,EAAA,CAAC,ECRhD,SAASE,GAAwBx+B,EAAe,CAC9C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,MAAM,EAEnCqd,EAAqB,CAAC,EAAG+e,CAAE,EAEjC,OAAOzV,EAAO,UAAUrd,GAAM+T,CAAmC,CACnE,CACO,IAAMohB,GAAuBhhC,EAAG,CAAC,MAAK+gC,EAAA,CAAC,ECF9C,SAASE,GACL/9B,EAAsB9E,EAAoB,OACxC8gC,EAAKtQ,EAAgB1rB,EAAG,IAAK,OAAO,EACpCi8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,OAAO,EACxCmL,EAAAjJ,EAAW4mB,GAAegY,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAE31B,EAAA,CAAA,EAAE41B,EAAE51B,EAAA,CAAA,EAEP,IAAMqW,EAAsB,CAAC,EAAGsf,EAAI,EAAGC,CAAE,EAEzC,OAAOjW,EAAO,UAAUnd,GAAO6T,CAAmC,CACpE,CAEO,IAAMshB,GAAwBlhC,EAAG,CAAC,OAAMihC,EAAA,CAAC,ECfhD,SAASE,GAAyB5+B,EAAe,CAC/C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,OAAO,EAEpCqd,EAAsB,CAAC,EAAG+e,CAAE,EAElC,OAAOzV,EAAO,UAAUpd,GAAO8T,CAAmC,CACpE,CACO,IAAMwhB,GAAwBphC,EAAG,CAAC,OAAMmhC,EAAA,CAAC,ECqDhC,SAAAE,GACZpgB,EACAqgB,EAAuCj6B,EACvCsc,EAA4B4d,EAC5BC,EAAkC,CADND,IAAA,SAAAA,EAA2B,QAMzD,IAAME,EAAgBxgB,EAAW,CAAC,EAC5BygB,EACEhhC,GAAAA,GAAA,CAAA,EAAAJ,EAAAghC,CAAW,EAAE,EAAA,EAAA,CAAAG,CAAa,EAAA,EAAA,EAC5BE,EAAcC,GAAwBL,CAAU,EAEtD,OAAOM,GACH5gB,EAAYygB,EAAcr6B,EAASm6B,EAAW7d,EAC9C,KAAyB,KAAsBge,CAAW,CAChE,CAEgB,SAAAG,GACZC,EACAC,EAAqC36B,EACrCm6B,EACA7d,EACAse,EACAV,EAA2D,CAA3DA,IAAA,SAAAA,EAA2D,gBACvD,IAAAh4B,EAAAjJ,EAA8B4hC,GAAgBF,CAAU,EAAC,CAAA,EAAxDG,EAAY54B,EAAA,CAAA,EAAE64B,EAAW74B,EAAA,CAAA,EAE5B+3B,EACJ,GAAIC,IAAe,eACjBD,EAAc,CAACa,EAAcC,EAAaL,EAAQ,CAAC,EAAGA,EAAQ,CAAC,CAAC,UACvDR,IAAe,gBACxBD,EAAc,CAACa,EAAcC,EAAaL,EAAQ,CAAC,EAAGA,EAAQ,CAAC,CAAC,MAEhE,OAAM,IAAI,MAAM,sBAAA,OAAsBR,CAAU,CAAE,EAGpD,OAAOM,GACHE,EAAST,EAAaj6B,EAASm6B,EAAW7d,EAAKse,EAAc,GAC7DV,CAAU,CAChB,CAKgB,SAAAc,GACZN,EACAC,EACA36B,EACAm6B,EAA4C7d,EAC5Cse,EACAV,EAAqC,CAArCA,IAAA,SAAAA,EAAqC,SACjC,IAAAh4B,EAAAjJ,EAA2CgiC,GAAiBN,CAAU,EAAC,CAAA,EAAtEO,EAAWh5B,EAAA,CAAA,EAAE44B,EAAY54B,EAAA,CAAA,EAAE64B,EAAW74B,EAAA,CAAA,EAEzC+3B,EACAK,EACJ,GAAIJ,IAAe,QACjBI,EAAc,eACdL,EACI,CAACiB,EAAaJ,EAAcC,EAAaL,EAAQ,CAAC,EAAGA,EAAQ,CAAC,CAAC,UAC1DR,IAAe,QACxBI,EAAc,gBACdL,EACI,CAACiB,EAAaJ,EAAcC,EAAaL,EAAQ,CAAC,EAAGA,EAAQ,CAAC,CAAC,MAEnE,OAAM,IAAI,MAAM,sBAAA,OAAsBR,CAAU,CAAE,EAGpD,OAAOiB,GACHT,EAAST,EAAaj6B,EAASm6B,EAAW7d,EAAK,GAAOge,EACtDM,CAAY,CAClB,UAMgBJ,GACZE,EACAT,EACAj6B,EAAkCm6B,EAClC7d,EACAse,EAAuCQ,EACvClB,EAA2D,SADpBkB,IAAA,SAAAA,EAAiB,IACxDlB,IAAA,SAAAA,EAA2D,gBACzD,IAAA93B,EAAAnJ,EAA6C,CAAC,GAAI,GAAI,GAAI,EAAE,EAAC,CAAA,EAA5DoiC,EAASj5B,EAAA,CAAA,EAAEk5B,EAAQl5B,EAAA,CAAA,EAAEm5B,EAAOn5B,EAAA,CAAA,EAAEo5B,EAAUp5B,EAAA,CAAA,EAC7C,GAAI83B,IAAe,eACjBh4B,EAAAjJ,EAA6CyhC,EAAO,CAAA,EAAnDW,EAASn5B,EAAA,CAAA,EAAEo5B,EAAQp5B,EAAA,CAAA,EAAEq5B,EAAOr5B,EAAA,CAAA,EAAEs5B,EAAUt5B,EAAA,CAAA,UAChCg4B,IAAe,gBACxB/3B,EAAAlJ,EAA6CyhC,EAAO,CAAA,EAAnDW,EAASl5B,EAAA,CAAA,EAAEq5B,EAAUr5B,EAAA,CAAA,EAAEm5B,EAAQn5B,EAAA,CAAA,EAAEo5B,EAAOp5B,EAAA,CAAA,MAEzC,OAAM,IAAI,MAAM,sBAAA,OAAsB+3B,CAAU,CAAE,EAG9C,IAAApV,EAAA7rB,EAAgDghC,EAAW,CAAA,EAA1Da,EAAYhW,EAAA,CAAA,EAAEiW,EAAWjW,EAAA,CAAA,EAAI2W,EAAc3W,EAAA,CAAA,EAC5CC,EAAA9rB,EAA8B4hC,GAAgB76B,CAAO,EAAC,CAAA,EAArD07B,EAAY3W,EAAA,CAAA,EAAE4W,EAAW5W,EAAA,CAAA,EAC1B6W,EAAA3iC,EAAkC4hC,GAAgBV,CAAS,EAAC,CAAA,EAA3D0B,EAAcD,EAAA,CAAA,EAAEE,EAAaF,EAAA,CAAA,EAE9BG,EACFC,GAAuBlB,EAAce,CAAc,EACjDI,EACFD,GAAuBjB,EAAae,CAAa,EAC/CjX,EAAiCqX,GACnC5f,EAAKgf,EAAUC,EAASG,EAAcC,EAAaI,EACnDE,EAAsBrB,EAAcV,CAAU,EAF3CiC,EAAOtX,EAAA,QAAEuX,EAASvX,EAAA,UAAEwX,EAAQxX,EAAA,SAI7ByX,EAAclB,EAAYK,EAAiBD,EAAaC,EAE1Dc,EACJ,OAAIrC,IAAe,gBACjBqC,EAAW,CAAClB,EAAWiB,EAAaF,EAAWC,CAAQ,EAC9CnC,IAAe,iBACxBqC,EAAW,CAAClB,EAAWe,EAAWC,EAAUC,CAAW,GAGlD,CACL,UAASjB,EACT,WAAUnB,EACV,SAAQoB,EACR,QAAOC,EACP,WAAUC,EACV,UAASY,EACT,SAAQC,EACR,YAAWC,EACX,QAAOH,EACP,aAAYT,EACZ,YAAWC,EACX,aAAYb,EACZ,YAAWC,EACX,sBAAqBgB,EACrB,qBAAoBE,EACpB,eAAcJ,EACd,cAAaC,EACb,QAAOpB,EACP,SAAQ6B,EACR,YAAWtC,EAEf,UAwCgBkB,GACZT,EACAT,EACAj6B,EACAm6B,EAA4C7d,EAC5C8e,EACAlB,EACAU,EAAqC,SAFrCQ,IAAA,SAAAA,EAAiB,IACjBlB,IAAA,SAAAA,EAA2D,gBAEzD,IAAA93B,EAAAnJ,EACA,CAAC,GAAI,GAAI,GAAI,GAAI,EAAE,EAAC,CAAA,EADnBoiC,EAASj5B,EAAA,CAAA,EAAEo6B,EAAOp6B,EAAA,CAAA,EAAEk5B,EAAQl5B,EAAA,CAAA,EAAEm5B,EAAOn5B,EAAA,CAAA,EAAEo5B,EAAUp5B,EAAA,CAAA,EAEtD,GAAI83B,IAAe,eACjBh4B,EAAAjJ,EAAsDyhC,EAAO,CAAA,EAA5DW,EAASn5B,EAAA,CAAA,EAAEs6B,EAAOt6B,EAAA,CAAA,EAAEo5B,EAAQp5B,EAAA,CAAA,EAAEq5B,EAAOr5B,EAAA,CAAA,EAAEs5B,EAAUt5B,EAAA,CAAA,UACzCg4B,IAAe,gBACxB/3B,EAAAlJ,EAAsDyhC,EAAO,CAAA,EAA5DW,EAASl5B,EAAA,CAAA,EAAEq5B,EAAUr5B,EAAA,CAAA,EAAEq6B,EAAOr6B,EAAA,CAAA,EAAEm5B,EAAQn5B,EAAA,CAAA,EAAEo5B,EAAOp5B,EAAA,CAAA,MAElD,OAAM,IAAI,MAAM,sBAAA,OAAsB+3B,CAAU,CAAE,EAG9C,IAAApV,EAAA7rB,EACFghC,EAAW,CAAA,EADRiB,EAAWpW,EAAA,CAAA,EAAEgW,EAAYhW,EAAA,CAAA,EAAEiW,EAAWjW,EAAA,CAAA,EAAI2W,EAAc3W,EAAA,CAAA,EAEzDC,EAAA9rB,EAA2CgiC,GAAiBj7B,CAAO,EAAC,CAAA,EAAnEy8B,EAAW1X,EAAA,CAAA,EAAE2W,EAAY3W,EAAA,CAAA,EAAE4W,EAAW5W,EAAA,CAAA,EACvC6W,EAAA3iC,EACFgiC,GAAiBd,CAAS,EAAC,CAAA,EADxBuC,EAAad,EAAA,CAAA,EAAEC,EAAcD,EAAA,CAAA,EAAEE,EAAaF,EAAA,CAAA,EAG7Ce,EACFX,GAAuBd,EAAawB,CAAa,EAC/CX,EACFC,GAAuBlB,EAAce,CAAc,EACjDI,EACFD,GAAuBjB,EAAae,CAAa,EAC/CjX,EAA2C+X,GAC7CtgB,EAAKkgB,EAASlB,EAAUC,EAASkB,EAAaf,EAAcC,EAC5DgB,EAAsBZ,EAAuBE,EAC7CrB,CAAY,EAHTuB,GAAOtX,EAAA,QAAEgY,EAAQhY,EAAA,SAAEuX,EAASvX,EAAA,UAAEwX,EAAQxX,EAAA,SAKvCyX,GAAclB,EAAYK,EAAiBD,EAAaC,EAE1Dc,GACJ,OAAIrC,IAAe,gBACjBqC,GAAW,CAAClB,EAAWiB,GAAaO,EAAUT,EAAWC,CAAQ,EACxDnC,IAAe,iBACxBqC,GAAW,CAAClB,EAAWwB,EAAUT,EAAWC,EAAUC,EAAW,GAG5D,CACL,UAASjB,EACT,WAAUnB,EACV,QAAOsC,EACP,SAAQlB,EACR,QAAOC,EACP,WAAUC,EACV,SAAQqB,EACR,UAAST,EACT,SAAQC,EACR,YAAWC,GACX,QAAOH,GACP,YAAWM,EACX,aAAYf,EACZ,YAAWC,EACX,YAAWT,EACX,aAAYJ,EACZ,YAAWC,EACX,qBAAoB4B,EACpB,sBAAqBZ,EACrB,qBAAoBE,EACpB,cAAaS,EACb,eAAcb,EACd,cAAaC,EACb,QAAOpB,EACP,SAAQ6B,GACR,YAAWtC,EAEf,CAEA,SAAS6C,GACLpC,EAA2BqC,EAAmB7f,EAC9C8f,EAAkBpC,EAAqC,CACrDoC,GAAW,OACbA,EAAUC,GAAkBvC,EAASqC,EAAW7f,CAAM,GAExD,IAAMggB,EAAYxC,EAAQ,CAAC,EACrByC,EAAYzC,EAAQ,CAAC,EAErB0C,EACFC,IAAOH,EAAYH,EAAY,EAAIC,GAAW9f,EAAS,EAAG0d,CAAY,EACpE0C,EACFD,IAAOF,EAAYJ,EAAY,EAAIC,GAAW9f,EAAS,EAAG0d,CAAY,EAE1E,MAAO,CAACwC,EAAYE,CAAU,CAChC,CAEA,SAASC,GACL7C,EACAT,EAAuCqC,EACvCt8B,EAAmCg9B,EACnCpC,EAAqC,CACnCoC,GAAW,OACbA,EAAUC,GAAkBvC,EAAST,EAAY,CAAC,EAAGj6B,EAAQ,CAAC,CAAC,GAGjE,QADMu8B,EAA6C,CAAC,EAAG,EAAG,EAAGD,CAAW,EAC/D1hC,EAAQ,EAAGA,EAAQ,EAAGA,IACzB8/B,EAAQ9/B,CAAK,EAAI,EAAIoiC,GAAW/C,EAAYr/B,CAAK,IACnD2hC,EAAS3hC,CAAK,EAAIyiC,IACb3C,EAAQ9/B,CAAK,EAAIq/B,EAAYr/B,CAAK,EAAI,EAAIoiC,GAAWh9B,EAAQpF,CAAK,EAC/D,EACJggC,CAAY,GAGpB,OAAO2B,CACT,CAEM,SAAUU,GACZrjB,EACAmjB,EAAmB7f,EAAgBsgB,EAAY,CAAZA,IAAA,SAAAA,EAAY,GACjD,IAAMC,EAAqBzB,GAAuBe,EAAWS,CAAQ,EACrE,OAAO,KAAK,OACP5jB,EAAW,CAAC,GAAKsD,EAAS,GAAKA,EAASugB,GAAsB,CAAC,CACtE,CAEA,SAAS5C,GAAgB6C,EAAsB,CAC7C,OAAI,OAAOA,GAAU,SACZ,CAACA,EAAOA,EAAOA,CAAK,EAEzBA,EAAM,SAAW,EACZ,CAACA,EAAM,CAAC,EAAGA,EAAM,CAAC,EAAG,CAAC,EAExBA,CACT,CAEA,SAASzC,GAAiByC,EAAsC,CAE9D,OAAO,OAAOA,GAAU,SAAW,CAACA,EAAOA,EAAOA,CAAK,EAAIA,CAC7D,CAaA,SAAS1B,GAAuBrB,EAAoB6C,EAAgB,CAClE,OAAIA,GAAY,EACP7C,EAGFA,GAAcA,EAAa,IAAM6C,EAAW,EACrD,CAEA,SAAStB,GACL5f,EAA4Cgf,EAC5CC,EAAiBG,EAAsBC,EACvCb,EAAsBC,EACtBH,EACAV,EACc,CAChB,IAAIiC,EACAC,EACAC,EAEJ,GAAI,OAAO/f,GAAQ,SAAU,CAC3B,IAAMqhB,EAAWrhB,IAAQ,EAAK,QAAU,SACxC6f,EAAU,CAAC,IAAK7f,EAAK,OAAQA,EAAK,KAAMA,EAAK,MAAOA,EAAK,KAAMqhB,CAAO,EACtE,IAAMpB,EAAWO,GACb,CAACxB,EAAUC,CAAO,EAAGT,EAAcY,EAAcpf,EAAKse,CAAY,EACtEwB,EAAYG,EAAS,CAAC,EACtBF,EAAWE,EAAS,CAAC,CACtB,SAAUjgB,IAAQ,OAAQ,CACzB8f,EAAY,KAAK,KAAKd,EAAWI,CAAY,EAC7CW,EAAW,KAAK,KAAKd,EAAUI,CAAW,EAC1C,IAAMiC,EACF,KAAK,IAAI,GAAIxB,EAAY,GAAKV,EAAeZ,EAAeQ,CAAQ,EAClEuC,EACF,KAAK,IAAI,GAAIxB,EAAW,GAAKV,EAAcZ,EAAcQ,CAAO,EAC9DuC,EAAM,KAAK,MAAMF,EAAiB,CAAC,EACnCG,EAASH,EAAiBE,EAC1BviC,EAAO,KAAK,MAAMsiC,EAAgB,CAAC,EACnCriC,EAAQqiC,EAAgBtiC,EAC9B4gC,EAAU,CAAC,IAAG2B,EAAE,OAAMC,EAAE,KAAIxiC,EAAE,MAAKC,EAAE,KAAM,MAAM,CAClD,SAAU8gB,IAAQ,QACjB6f,EAAU,CAAC,IAAK,EAAG,OAAQ,EAAG,KAAM,EAAG,MAAO,EAAG,KAAM,OAAO,EAC9DC,EAAY,KAAK,MAAMd,EAAWR,EAAe,GAAKY,CAAY,EAClEW,EAAW,KAAK,MAAMd,EAAUR,EAAc,GAAKY,CAAW,UACrD,OAAOrf,GAAQ,SAAU,CAClC,IAAMwhB,EAAM5D,IAAe,eAAiB5d,EAAI,CAAC,EAAE,CAAC,EAAIA,EAAI,CAAC,EAAE,CAAC,EAC1DyhB,EAAS7D,IAAe,eAAiB5d,EAAI,CAAC,EAAE,CAAC,EAAIA,EAAI,CAAC,EAAE,CAAC,EAC7D/gB,EAAO2+B,IAAe,eAAiB5d,EAAI,CAAC,EAAE,CAAC,EAAIA,EAAI,CAAC,EAAE,CAAC,EAC3D9gB,EAAQ0+B,IAAe,eAAiB5d,EAAI,CAAC,EAAE,CAAC,EAAIA,EAAI,CAAC,EAAE,CAAC,EAC5DqhB,EAAWG,IAAQ,GAAKC,IAAW,GAAKxiC,IAAS,GAAKC,IAAU,EAClE,QACA,WACJ2gC,EAAU,CAAC,IAAG2B,EAAE,OAAMC,EAAE,KAAIxiC,EAAE,MAAKC,EAAE,KAAMmiC,CAAO,EAClDvB,EAAYiB,IACP/B,EAAWR,EAAegD,EAAMC,GAAUrC,EAAe,EAC1Dd,CAAY,EAChByB,EAAWgB,IACN9B,EAAUR,EAAcx/B,EAAOC,GAASmgC,EAAc,EAAGf,CAAY,CAC3E,KACC,OAAM,MAAM,8BAAA,OAA8Bte,CAAG,CAAE,EAEjD,MAAO,CAAC,QAAO6f,EAAE,UAASC,EAAE,SAAQC,CAAA,CACtC,CAEA,SAASO,GACLtgB,EAA4BkgB,EAAiBlB,EAC7CC,EAAiBkB,EAAqBf,EACtCC,EAAqBT,EAAqBJ,EAC1CC,EAAqBH,EAAqC,CAM5D,IAAIuB,EACAU,EACAT,EACAC,EAMJ,GAJI/f,IAAQ,UACVA,EAAM,GAGJ,OAAOA,GAAQ,SAAU,CAC3B,IAAMqhB,EAAWrhB,IAAQ,EAAK,QAAU,SACxC6f,EAAU,CACR,IAAK7f,EACL,OAAQA,EACR,KAAMA,EACN,MAAOA,EACP,MAAOA,EACP,KAAMA,EACN,KAAMqhB,GAER,IAAMpB,EAAWgB,GACb,CAACf,EAASlB,EAAUC,EAAS,CAAC,EAC9B,CAACL,EAAaJ,EAAcC,CAAW,EAAG,EAC1C,CAAC0B,EAAaf,EAAcC,CAAW,EAAGrf,EAAKse,CAAY,EAC/DiC,EAAWN,EAAS,CAAC,EACrBH,EAAYG,EAAS,CAAC,EACtBF,EAAWE,EAAS,CAAC,CACtB,SAAUjgB,IAAQ,OAAQ,CACzBugB,EAAW,KAAK,KAAKL,EAAUC,CAAW,EAC1CL,EAAY,KAAK,KAAKd,EAAWI,CAAY,EAC7CW,EAAW,KAAK,KAAKd,EAAUI,CAAW,EAC1C,IAAMqC,GAAiBnB,EAAW,GAAKJ,EAAcvB,EAAcsB,EAC7DoB,GACDxB,EAAY,GAAKV,EAAeZ,EAAeQ,EAC9CuC,GAAiBxB,EAAW,GAAKV,EAAcZ,EAAcQ,EAC7D0C,EAAQ,KAAK,MAAMD,EAAgB,CAAC,EACpCE,EAAOF,EAAgBC,EACvBH,EAAM,KAAK,MAAMF,EAAiB,CAAC,EACnCG,EAASH,EAAiBE,EAC1BviC,EAAO,KAAK,MAAMsiC,EAAgB,CAAC,EACnCriC,EAAQqiC,EAAgBtiC,EAE9B4gC,EAAU,CAAC,IAAG2B,EAAE,OAAMC,EAAE,KAAIxiC,EAAE,MAAKC,EAAE,MAAKyiC,EAAE,KAAIC,EAAE,KAAM,MAAM,CAC/D,KACC,OAAM,MAAM,8BAAA,OAA8B5hB,CAAG,CAAE,EAEjD,MAAO,CAAC,QAAO6f,EAAE,SAAQU,EAAE,UAAST,EAAE,SAAQC,CAAA,CAChD,CAQA,SAASgB,GAAM5lC,EAAemjC,EAAqC,CACjE,GAAI,CAACA,EACH,OAAO,KAAK,MAAMnjC,CAAK,EAEzB,OAAQmjC,EAAY,CAClB,IAAK,QAEH,OAAO,KAAK,MAAMnjC,CAAK,EACzB,IAAK,OAEH,OAAO,KAAK,KAAKA,CAAK,EACxB,IAAK,QACH,OAAO,KAAK,MAAMA,CAAK,EACzB,QACE,MAAM,IAAI,MAAM,wBAAA,OAAwBmjC,CAAY,CAAE,CACzD,CACH,CAEM,SAAUuD,GAAkBT,EAAsB,CAChD,IAAAx7B,EAAAjJ,EAAqB4hC,GAAgB6C,CAAK,EAAC,CAAA,EAA1CU,EAAIl8B,EAAA,CAAA,EAAEm8B,EAAIn8B,EAAA,CAAA,EAAEo8B,EAAIp8B,EAAA,CAAA,EACvB,OAAOk8B,IAAS,GAAKC,IAAS,GAAKC,IAAS,CAC9C,CAEgB,SAAAC,GACZv+B,EAA0Bm6B,EAA0B,CACtD,OAAOgE,GAAkBn+B,CAAO,GAAKm+B,GAAkBhE,CAAS,CAClE,CAEM,SAAUqE,GAA8BpkC,EACQ,CACpD,OAAOygC,GAAgBzgC,CAAM,EAAE,MAAM,SAAA3C,EAAK,CAAI,OAAAA,EAAQ,CAAR,CAAS,CACzD,CASM,SAAU8iC,GAAwBL,EAAyB,CAE/D,GAAIA,IAAe,OACjB,MAAO,eACF,GAAIA,IAAe,OACxB,MAAO,gBAEP,MAAM,IAAI,MAAM,sBAAA,OAAsBA,CAAU,CAAE,CAEtD,UAiBgBuE,GACZC,EAAgBpiB,EAChBqiB,EAAwC,CAC1C,GAAIA,GAAmB,KAAM,CAC3B,GAAI,OAAOriB,GAAQ,SACjB,MAAM,MACF,YAAY,OAAAoiB,EAA4C,sCAAA,EACxD,mBAAA,OAAmBC,EAAe,eAAA,EAAA,OAAgBriB,EAAG,GAAA,CAAG,EACvD,GAAI,OAAOA,GAAQ,SACxBmB,EACImhB,GAAWtiB,CAAG,EACd,UAAA,CAAM,MAAA,YAAA,OAAYoiB,EAA4C,sCAAA,EAC1D,mBAAA,OAAmBC,EAA+B,eAAA,EAAA,OAAAriB,EAAG,GAAA,CADnD,CACsD,UACvD,OAAOA,GAAQ,SACvBA,EAAwB,QAAQ,SAAAtlB,EAAC,CAChCA,EAAE,QAAQ,SAAA0B,EAAC,CACT+kB,EACImhB,GAAWlmC,CAAC,EACZ,UAAA,CAAM,MAAA,YAAA,OAAYgmC,EAA4C,sCAAA,EAC1D,mBAAA,OAAmBC,EAA+B,eAAA,EAAA,OAAAjmC,EAAC,GAAA,CADjD,CACoD,CAChE,CAAC,CACH,CAAC,MAED,OAAM,MAAM,YAAY,OAAAgmC,EAAM,+BAAA,EAAA,OAAgCpiB,CAAG,CAAE,CAEtE,CACH,CC1kBA,SAASuiB,GACL3jC,EAAsBb,EAAkB,CAC1C,IAAMi9B,EAAK/P,EAAgBrsB,EAAG,IAAK,UAAW,mBAAmB,EAE3Dqd,EAAwB,CAAC,EAAG+e,CAAE,EAC9BrV,EAAsB,CAAC,MAAK5nB,CAAA,EAClC,OAAOwnB,EAAO,UACVnW,GAAS6M,EACT0J,CAAgC,CACtC,CACO,IAAM6c,EAA0BnmC,EAAG,CAAC,SAAQkmC,EAAA,CAAC,ECVpD,SAASE,GACL7jC,EAAiBy/B,EACjB36B,EACAsc,EACAqiB,EAAwC,CAC1C,IAAMrH,EAAK/P,EAAgBrsB,EAAG,IAAK,UAAW,SAAS,EACjDi/B,EAAY,EAElB1c,EACIuhB,GAAyCh/B,EAASm6B,CAAS,EAC3D,UAAA,CAAM,MAAA,4DACF,eAAA,OAAen6B,EAA0B,kBAAA,EAAA,OAAAm6B,EAAS,GAAA,CADhD,CACmD,EAE7D,IAAI8E,EAAM3H,EACN4H,EAAe,GACf5H,EAAG,OAAS,IACd4H,EAAe,GACfD,EAAMH,EAAQxH,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAG9D7Z,EACIwhB,EAAI,OAAS,EACb,UAAA,CAAM,MAAA,mDAAA,OAAmDA,EAAI,KAAI,GAAA,CAA3D,CAA8D,EACxEE,GAAoC,UAAW7iB,EAAKqiB,CAAe,EACnE,IAAMpmB,EAAwB,CAAC,EAAG0mB,CAAG,EAC/Bhd,EAAsB,CAAC,WAAU0Y,EAAE,QAAO36B,EAAE,IAAGsc,EAAE,gBAAeqiB,CAAA,EAGlE/pB,EAAMiN,EAAO,UACHld,GAAS4T,EACT0J,CAAgC,EAI9C,OAFArN,EAAM4iB,GAAK5iB,EAAK0iB,EAAG,KAAK,EAEpB4H,EACKJ,EAAQlqB,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAGzDA,CACT,CAEO,IAAMwqB,GAA0BzmC,EAAG,CAAC,SAAQomC,EAAA,CAAC,EC3BpD,SAASM,GACLnkC,EAAiBy/B,EACjB36B,EAA0Csc,EAC1CqiB,EACAzE,EAAqC,CAArCA,IAAA,SAAAA,EAAqC,SACvC,IAAM5C,EAAK/P,EAAgBrsB,EAAG,IAAK,YAAa,SAAS,EAErDokC,EAAMhI,EACNiI,EAAe,GACfjI,EAAG,OAAS,IACdiI,EAAe,GACfD,EAAMR,EAAQxH,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAG3E7Z,EACI6hB,EAAI,OAAS,EACb,UAAA,CAAM,MAAA,qDAAA,OAAqDA,EAAI,KAAI,GAAA,CAA7D,CAAgE,EAC1E7hB,EACIyc,IAAe,QACf,UAAM,CAAA,MAAA,0DACF,yBAAA,OAAyBA,CAAU,CADjC,CACmC,EAC7Czc,EACK,OAAOzd,GAAY,UAAYA,EAAU,GACrC,MAAM,QAAQA,CAAO,GAAKA,EAAQ,CAAC,EAAI,GAAKA,EAAQ,CAAC,EAAI,GACzDA,EAAQ,CAAC,EAAI,EAClB,UAAM,CAAA,MAAA,oDAAA,OAAoDA,EAAO,GAAA,CAA3D,CAA8D,EACxEy+B,GAA0B,YAAaniB,EAAKqiB,CAAe,EAC3D,IAAMpmB,EAA0B,CAAC,EAAG+mB,CAAG,EACjCrd,EACe,CAAC,WAAU0Y,EAAE,QAAO36B,EAAE,IAAGsc,EAAE,gBAAeqiB,EAAE,WAAUzE,CAAA,EAGvEtlB,EAAMiN,EAAO,UACHhd,GAAW0T,EACX0J,CAAgC,EAI9C,OAFArN,EAAM4iB,GAAK5iB,EAAK0qB,EAAI,KAAK,EAErBC,EACKT,EACIlqB,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAInEA,CACT,CAEO,IAAM4qB,GAA4B7mC,EAAG,CAAC,WAAU0mC,EAAA,CAAC,EC9CxD,SAASI,GAA0B/b,EAA8BtlB,EAAQ,CAARA,IAAA,SAAAA,EAAQ,GACvEpC,EAAO0nB,EAAQ,QAAU,EAAG,UAAA,CAAM,MAAA,oCAAA,CAAoC,EAEtE,IAAMgV,EACF/Q,GAAqBjE,EAAS,UAAW,SAAU,mBAAmB,EAW1E,GATIgV,EAAS,CAAC,EAAE,QAAU,aACxBA,EAAS,QAAQ,SAAA1Y,EAAM,CACrB,GAAIA,EAAO,QAAU,YACnB,MAAM,IAAI,MAAM;uBAAA,OACDA,EAAO,MAAS,IAAA,CAAA,CAEnC,CAAC,EAGC0Y,EAAS,SAAW,EACtB,OAAOhB,GAAMgB,EAAS,CAAC,CAAC,EAG1B,IAAMngB,EAAuBmgB,EACvBgH,EAAoB,CAAC,KAAIthC,CAAA,EAE/B,OAAOyjB,EAAO,UACVnc,GAAQ6S,EACRmnB,CAA+B,CACrC,CAEO,IAAMC,GAAyBhnC,EAAG,CAAC,QAAO8mC,EAAA,CAAC,ECpDlD,SAASG,GACL/jC,EAAsB9E,EAAsB8oC,EAC5CC,EAAkB,OAD0BD,IAAA,SAAAA,EAAkB,IAC9DC,IAAA,SAAAA,EAAkB,IACpB,IAAIjI,EAAKtQ,EAAgB1rB,EAAG,IAAK,QAAQ,EACrCi8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,QAAQ,EACzCmL,EAAAjJ,EAAW4mB,GAAegY,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAE31B,EAAA,CAAA,EAAE41B,EAAE51B,EAAA,CAAA,EAEP,IAAMqW,EAA4B,CAAC,EAAGsf,EAAI,EAAGC,CAAE,EACzC7V,EAA0B,CAAC,WAAU4d,EAAE,WAAUC,CAAA,EAEvD,OAAOje,EAAO,UACV9c,GAAawT,EACb0J,CAAgC,CACtC,CAEO,IAAM8d,GAAyBpnC,EAAG,CAAC,QAAOinC,EAAA,CAAC,ECpBlD,SAASI,GAA2B9kC,EAAe,CACjD,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,UAAW,SAAS,EAEjDqd,EAAwB,CAAC,EAAG+e,CAAE,EAEpC,OAAOzV,EAAO,UAAUjV,GAAS2L,CAAmC,CACtE,CACO,IAAM0nB,GAA0BtnC,EAAG,CAAC,SAAQqnC,EAAA,CAAC,ECgBpD,SAASE,GACLhlC,EAAiBilC,EAAwBzjC,EAAsB,CACjE,IAAM46B,EAAK/P,EAAgBrsB,EAAG,IAAK,QAAS,mBAAmB,EAE/D,GAAIo8B,EAAG,OAAS,EACd,MAAM,IAAI,MAAM,gCAAgC,EAGlD,IAAM/e,EAAsB,CAAC,EAAG+e,CAAE,EAC5BrV,EAAoB,CAAC,MAAKke,EAAE,KAAIzjC,CAAA,EAEtC,OAAOmlB,EAAO,UACVrV,GAAO+L,EACP0J,CAAgC,CACtC,CAEO,IAAM2K,GAAwBj0B,EAAG,CAAC,OAAMunC,EAAA,CAAC,ECvChD,SAASE,GAAwBllC,EAAe,CAC9C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,OAAQ,SAAS,EAE9Cqd,EAAqB,CAAC,EAAG+e,CAAE,EAEjC,OAAOzV,EAAO,UAAU5T,GAAMsK,CAAmC,CACnE,CACO,IAAMvb,GAAuBrE,EAAG,CAAC,MAAKynC,EAAA,CAAC,ECC9C,SAASC,GACLC,EAA+BC,EAC/BC,EAA+B7/B,EAC/BH,EAAwBsW,EAAsB,CAChD,IAAM2pB,EACFlZ,EAAgB+Y,EAAY,aAAc,eAAe,EACvDI,EACFnZ,EAAgBgZ,EAAY,aAAc,eAAe,EACvDI,EAAYpZ,EAAgBiZ,EAAU,WAAY,eAAe,EACjEI,EAAQrZ,EAAgB5mB,EAAM,OAAQ,eAAe,EACrDkgC,EAAKtZ,EAAgB/mB,EAAG,IAAK,eAAe,EAC5CsgC,EAAKvZ,EAAgBzQ,EAAG,IAAK,eAAe,EAE5CiqB,EAAWpB,GAAO,CAACiB,EAAOE,CAAE,EAAG,CAAC,EAChCE,EAAWjB,GAAOgB,EAAUL,CAAW,EACvC9rB,EAAgBoG,GAAIgmB,EAAUL,CAAS,EAGvCtF,EAAYzmB,EAAI,MAAM,CAAC,EACvBqsB,EAAYrsB,EAAI,MAAM,CAAC,EAAI,EAC3BssB,EAA8B,CAAC7F,EAAW4F,CAAS,EACnDjoC,EAAI4zB,GAAMhY,EAAK,CAAC,EAAG,CAAC,EAAGssB,CAAS,EAChCviC,EAAIiuB,GAAMhY,EAAK,CAAC,EAAGqsB,CAAS,EAAGC,CAAS,EACxC7oC,EAAIu0B,GAAMhY,EAAK,CAAC,EAAGqsB,EAAY,CAAC,EAAGC,CAAS,EAC5CroC,EAAI+zB,GAAMhY,EAAK,CAAC,EAAGqsB,EAAY,CAAC,EAAGC,CAAS,EAE5CC,EACFnmB,GAAI1E,EAAI2pB,GAAQjnC,CAAC,EAAGgE,GAAK2B,CAAC,CAAC,EACvB2X,EAAIuqB,EAAIZ,GAAQjlB,GAAIylB,EAAapoC,CAAC,CAAC,CAAa,CAAC,EACnD+oC,EAAiB9qB,EAAItZ,GAAKmkC,CAAI,EAAGlB,GAAQpnC,CAAC,CAAC,EACjD,MAAO,CAACsoC,EAAMC,CAAI,CACpB,CAEO,IAAMC,GAAgC1oC,EAAG,CAAC,eAAc0nC,EAAA,CAAC,ECHhE,SAASiB,GACLpmC,EAAiBqmC,EAAsBC,EAAiB,CAC1D,IAAMlK,EAAK/P,EAAgBrsB,EAAG,IAAK,gBAAgB,EAC7CumC,EAAOF,EAAW,OAAO,SAAC1lC,EAAG9E,EAAC,CAAK,OAAA8E,EAAI9E,CAAJ,CAAK,EAE9C0mB,EACI6Z,EAAG,MAAQ,EAAIiK,EAAW,OAC1B,UAAM,CAAA,MAAA,iBAAiB,OAAAjK,EAAG,KACtB,0CAAA,EAAA,OAAAiK,EAAW,MAAM,CAAE,CAAA,EAE3B9jB,EACI+jB,EAAM,SAAWD,EAAW,OAC5B,UAAA,CAAM,MAAA,mBACF,OAAAC,EAAM,OACN,6CAAA,EAAA,OAAAD,EAAW,MAAM,CAAE,CAAA,EAE3B9jB,EACI6Z,EAAG,MAAM,CAAC,EAAImK,IAAS,EACvB,UAAM,CAAA,MAAA,yBACI,OAAAnK,EAAG,MAAM,CAAC,EAA2C,0CAAA,EAC3D,8BAAA,OAA8BiK,EAAW,KAAK,KAAK,EAAS,OAAA,EAAA,OAAAE,CAAI,CAAE,CAAA,EAE1E,IAAMlpB,EAA+B,CAAC,EAAG+e,CAAE,EACrCrV,EAA6B,CAAC,WAAUsf,EAAE,MAAKC,CAAA,EAErD,OAAO3f,EAAO,UACV7c,GAAgBuT,EAChB0J,CAAgC,CACtC,CAEO,IAAMyf,GAAiC/oC,EAAG,CAAC,gBAAe2oC,EAAA,CAAC,ECtF5D,SAAUK,GAAsBzmC,EAAY,CAChD,IAAI+jC,EACJ,OAAI/jC,EAAE,OAAS,GAAKA,EAAE,OAAS,EAC7B+jC,EAAMH,EAAQ5jC,EAAG,CAAC,EAAG,EAAG,EAAGA,EAAE,IAAI,CAAC,EACzBA,EAAE,OAAS,EACpB+jC,EAAMH,EAAQ5jC,EAAG,CAAC,EAAG,EAAGA,EAAE,MAAM,CAAC,EAAGA,EAAE,MAAM,CAAC,CAAC,CAAC,EACtCA,EAAE,OAAS,EACpB+jC,EAAMH,EAAQ5jC,EAAG,CAAC,EAAGA,EAAE,MAAM,CAAC,EAAGA,EAAE,MAAM,CAAC,EAAGA,EAAE,MAAM,CAAC,CAAC,CAAC,EAExD+jC,EAAM/jC,EAGD+jC,CACT,CCuBA,SAAS2C,GACL1mC,EAAyB2mC,EACzBC,EACA5hC,EACA6hC,EACAC,EAAwB,CACtBA,GAAmB,OACrBA,EAAkB,MAEpB,IAAM1K,EAAK/P,EAAgBrsB,EAAG,IAAK,WAAW,EACxC+mC,EAAQ1a,EAAgBsa,EAAM,OAAQ,WAAW,EACjDK,EAAY3a,EAAgBua,EAAU,WAAY,WAAW,EAC/DK,EACAJ,GAAS,OACXI,EAAS5a,EAAgBwa,EAAO,QAAS,WAAW,GAEtD,IAAIK,EACAliC,GAAU,OACZkiC,EAAU7a,EAAgBrnB,EAAQ,SAAU,WAAW,GAGzDud,EACIwkB,EAAM,OAASC,EAAU,KACzB,UAAA,CAAM,MAAA,8EACY,CAAA,EACtBzkB,EACI2kB,GAAW,MAAQH,EAAM,OAASG,EAAQ,KAC1C,UAAA,CAAM,MAAA,4EACY,CAAA,EACtB3kB,EACI0kB,GAAU,MAAQF,EAAM,OAASE,EAAO,KACxC,UAAA,CAAM,MAAA,2EACY,CAAA,EAEtB,IAAMlD,EAAgB0C,GAAMrK,CAAE,EAExB/e,EAA+B,CACnC,EAAG0mB,EACH,MAAOkD,EACP,OAAQC,EACR,KAAMH,EACN,SAAUC,GAGNjgB,EAA6B,CAAC,gBAAe+f,CAAA,EAG7CptB,EAAMiN,EAAO,UACH/Z,GAAgByQ,EAChB0J,CAAgC,EAEhD,OAAO6c,EAAQlqB,EAAK0iB,EAAG,KAAK,CAC9B,CAEO,IAAM+K,GAA4B1pC,EAAG,CAAC,WAAUipC,EAAA,CAAC,EC3ExD,SAASU,GACLpnC,EAAwB2mC,EACxBC,EACA5hC,EAAuC6hC,EACvCC,EAAwB,CAC1B,IAAM1K,EAAK/P,EAAgBrsB,EAAG,IAAK,WAAW,EACxC+mC,EAAQ1a,EAAgBsa,EAAM,OAAQ,WAAW,EACjDK,EAAY3a,EAAgBua,EAAU,WAAY,WAAW,EAC/DK,EACAJ,GAAS,OACXI,EAAS5a,EAAgBwa,EAAO,QAAS,WAAW,GAEtD,IAAIK,EACJ,OAAIliC,GAAU,OACZkiC,EAAU7a,EAAgBrnB,EAAQ,SAAU,WAAW,GAEzDud,EACI6Z,EAAG,OAAS,EACZ,UAAM,CAAA,MAAA,uDACF,GAAA,OAAGA,EAAG,KAAI,GAAA,CADR,CACW,EACrB7Z,EACIwkB,EAAM,OAAS,GAAKA,EAAM,OAAS,EACnC,UAAA,CAAM,MAAA,2DACF,YAAA,OAAYA,EAAM,KAAI,GAAA,CADpB,CACuB,EACjCxkB,EACIykB,EAAU,OAAS,GAAKA,EAAU,OAAS,EAC3C,UAAA,CAAM,MAAA,2DACF,gBAAA,OAAgBA,EAAU,KAAI,GAAA,CAD5B,CAC+B,EACrCC,GAAU,MACZ1kB,EACI0kB,EAAO,OAAS,GAAKA,EAAO,OAAS,EACrC,UAAA,CAAM,MAAA,wDACF,gBAAA,OAAgBA,EAAO,KAAI,GAAA,CADzB,CAC4B,EAEpCC,GAAW,MACb3kB,EACI2kB,EAAQ,OAAS,GAAKA,EAAQ,OAAS,EACvC,UAAA,CAAM,MAAA,yDACF,gBAAA,OAAgBA,EAAQ,KAAI,GAAA,CAD1B,CAC6B,EAGlCC,GAAU/K,EAAI2K,EAAOC,EAAWE,EAASD,EAAQH,CAAe,CACzE,CAEO,IAAMO,GAA8B5pC,EAAG,CAAC,aAAY2pC,EAAA,CAAC,EC5C5D,SAASE,GACLtnC,EAAwB2mC,EACxBC,EACA5hC,EAAuC6hC,EACvCC,EAAwB,CAC1B,IAAM1K,EAAK/P,EAAgBrsB,EAAG,IAAK,WAAW,EACxC+mC,EAAQ1a,EAAgBsa,EAAM,OAAQ,WAAW,EACjDK,EAAY3a,EAAgBua,EAAU,WAAY,WAAW,EAC/DK,EACAJ,GAAS,OACXI,EAAS5a,EAAgBwa,EAAO,QAAS,WAAW,GAEtD,IAAIK,EACJ,OAAIliC,GAAU,OACZkiC,EAAU7a,EAAgBrnB,EAAQ,SAAU,WAAW,GAEzDud,EACI6Z,EAAG,OAAS,EACZ,UAAM,CAAA,MAAA,uDACF,GAAA,OAAGA,EAAG,KAAI,GAAA,CADR,CACW,EACrB7Z,EACIwkB,EAAM,OAAS,GAAKA,EAAM,OAAS,EACnC,UAAA,CAAM,MAAA,2DACF,YAAA,OAAYA,EAAM,KAAI,GAAA,CADpB,CACuB,EACjCxkB,EACIykB,EAAU,OAAS,GAAKA,EAAU,OAAS,EAC3C,UAAA,CAAM,MAAA,2DACF,gBAAA,OAAgBA,EAAU,KAAI,GAAA,CAD5B,CAC+B,EACrCC,GAAU,MACZ1kB,EACI0kB,EAAO,OAAS,GAAKA,EAAO,OAAS,EACrC,UAAA,CAAM,MAAA,wDACF,gBAAA,OAAgBA,EAAO,KAAI,GAAA,CADzB,CAC4B,EAEpCC,GAAW,MACb3kB,EACI2kB,EAAQ,OAAS,GAAKA,EAAQ,OAAS,EACvC,UAAA,CAAM,MAAA,yDACF,gBAAA,OAAgBA,EAAQ,KAAI,GAAA,CAD1B,CAC6B,EAGlCC,GAAU/K,EAAI2K,EAAOC,EAAWE,EAASD,EAAQH,CAAe,CACzE,CAEO,IAAMS,GAA8B9pC,EAAG,CAAC,aAAY6pC,EAAA,CAAC,EC5C5D,SAASE,GACLxnC,EAAwB2mC,EACxBC,EACA5hC,EAAuC6hC,EACvCC,EAAwB,CAC1B,IAAM1K,EAAK/P,EAAgBrsB,EAAG,IAAK,WAAW,EACxC+mC,EAAQ1a,EAAgBsa,EAAM,OAAQ,WAAW,EACjDK,EAAY3a,EAAgBua,EAAU,WAAY,WAAW,EAC/DK,EACAJ,GAAS,OACXI,EAAS5a,EAAgBwa,EAAO,QAAS,WAAW,GAEtD,IAAIK,EACJ,OAAIliC,GAAU,OACZkiC,EAAU7a,EAAgBrnB,EAAQ,SAAU,WAAW,GAEzDud,EACI6Z,EAAG,OAAS,EACZ,UAAM,CAAA,MAAA,uDACF,GAAA,OAAGA,EAAG,KAAI,GAAA,CADR,CACW,EACrB7Z,EACIwkB,EAAM,OAAS,GAAKA,EAAM,OAAS,EACnC,UAAA,CAAM,MAAA,2DACF,YAAA,OAAYA,EAAM,KAAI,GAAA,CADpB,CACuB,EACjCxkB,EACIykB,EAAU,OAAS,GAAKA,EAAU,OAAS,EAC3C,UAAA,CAAM,MAAA,2DACF,gBAAA,OAAgBA,EAAU,KAAI,GAAA,CAD5B,CAC+B,EACrCC,GAAU,MACZ1kB,EACI0kB,EAAO,OAAS,GAAKA,EAAO,OAAS,EACrC,UAAA,CAAM,MAAA,wDACF,gBAAA,OAAgBA,EAAO,KAAI,GAAA,CADzB,CAC4B,EAEpCC,GAAW,MACb3kB,EACI2kB,EAAQ,OAAS,GAAKA,EAAQ,OAAS,EACvC,UAAA,CAAM,MAAA,yDACF,gBAAA,OAAgBA,EAAQ,KAAI,GAAA,CAD1B,CAC6B,EAElCC,GAAU/K,EAAI2K,EAAOC,EAAWE,EAASD,EAAQH,CAAe,CACzE,CAEO,IAAMW,GAA8BhqC,EAAG,CAAC,aAAY+pC,EAAA,CAAC,ECjC5D,SAASE,GACL1nC,EAAiB2nC,EAAuBnmC,EAAY,CACtD,IAAM46B,EAAK/P,EAAgBrsB,EAAG,IAAK,UAAU,EACvC4nC,EAAWvb,EAAgBsb,EAAS,UAAW,UAAU,EAE/DplB,EACI6Z,EAAG,QAAU,QACb,UAAM,CAAA,MAAA,4BACF,gCAAA,OAAgCA,EAAG,KAAK,CADtC,CACwC,EAClD7Z,EAAY/gB,GAAQ,EAAG,UAAM,CAAA,MAAA,sCAAA,OAAsCA,EAAI,GAAA,CAA1C,CAA6C,EAC1E+gB,EACIqlB,EAAS,OAASxL,EAAG,MAAQwL,EAAS,OAAS,EAC/C,UAAA,CAAM,MAAA,iEACF,kCAAkC,OAAAxL,EAAG,MAAwB,mBAAA,EAC7D,GAAA,OAAGwL,EAAS,MAAK,GAAA,CAFf,CAEkB,EAE5B,IAAMvqB,EAAyB,CAAC,EAAG+e,EAAI,QAASwL,CAAQ,EAClD7gB,EAAuB,CAAC,KAAIvlB,CAAA,EAElC,OAAOmlB,EAAO,UACV5c,GAAUsT,EACV0J,CAAgC,CACtC,CAEO,IAAM8gB,GAA2BpqC,EAAG,CAAC,UAASiqC,EAAA,CAAC,ECtBtD,SAASI,GAA4B9nC,EAAW5C,EAAS,CACvD,IAAMg/B,EAAK/P,EAAgBrsB,EAAG,IAAK,YAAY,EACzC+nC,EAAK1b,EAAgBjvB,EAAG,IAAK,YAAY,EAE/C,GAAI,CAACiE,GAAY+6B,EAAG,MAAO2L,EAAG,KAAK,EACjC,MAAM,IAAI,MAAM,oDAAA,OACZ3L,EAAG,MAAK,OAAA,EAAA,OAAQ2L,EAAG,KAAK,CAAE,EAEhC,GAAI3L,EAAG,QAAU,SAAW2L,EAAG,QAAU,QACvC,MAAM,IAAI,MACN,wEAAA,OACI3L,EAAG,MAAK,kBAAA,EAAA,OAAmB2L,EAAG,KAAK,CAAE,EAG/C,IAAM1qB,EAA2B,CAAC,EAAG+e,EAAI,EAAG2L,CAAE,EAC9C,OAAOphB,EAAO,UAAU3c,GAAYqT,CAAmC,CACzE,CACO,IAAM2qB,GAA6BvqC,EAAG,CAAC,YAAWqqC,EAAA,CAAC,ECxB1D,SAASG,GACPC,EAAyBC,EAAuB,CAChD,IAAMC,EAAc/b,EAAgB6b,EAAI,KAAM,gBAAiB,OAAO,EAChEG,EAAchc,EAAgB8b,EAAI,KAAM,gBAAiB,OAAO,EAEtE,GAAIC,EAAY,OAAS,EACvB,MAAM,IAAI,MACR,2DACA,YAAA,OAAYA,EAAY,IAAI,CAAE,EAGlC,GAAIC,EAAY,OAAS,EACvB,MAAM,IAAI,MACR,4DACA,YAAA,OAAYA,EAAY,IAAI,CAAE,EAGlC,IAAMhrB,EAA8B,CAAE,GAAI+qB,EAAa,GAAIC,CAAW,EACtE,OAAO1hB,EAAO,UAAUzc,GAAemT,CAAmC,CAC5E,CAEO,IAAMirB,GAAgC7qC,EAAG,CAAE,eAAcwqC,EAAA,CAAE,ECjBlE,SAASM,GACLvoC,EAAsBb,EAAkB,CAC1C,IAAIsf,EAAQ4N,EAAgBrsB,EAAG,cAAe,GAAG,EAC3CwoC,EAAS/pB,EAAM,MAIrB,GAFA1Y,GAAmC5G,CAAK,EAEpCA,EAAM,OAASsf,EAAM,KACvB,MAAM,IAAI,MAAM,+BAAA,OAA+Btf,EAAM,OAAM,gBAAA,EAAA,OACvDsf,EAAM,KAAI,GAAA,CAAG,EAGnB,GAAItf,EAAM,OAASsf,EAAM,KAAM,CAE7B,QADMzb,EAAWyb,EAAM,MAAM,MAAK,EAC3Bzb,EAAS,OAAS7D,EAAM,QAC7B6D,EAAS,QAAQ,CAAC,EAEpByb,EAAQmlB,EAAQnlB,EAAOzb,CAAQ,CAChC,CAID,QAFM0b,EAAaD,EAAM,MACnBgqB,EAAiB,MAAM,KAAKtpC,CAAK,EAC9B,EAAIA,EAAM,OAAS,EAAG,GAAK,EAAG,IACrC,GAAIuf,EAAW,CAAC,IAAMvf,EAAM,CAAC,EAC3BspC,EAAK,CAAC,EAAI,UACDhqB,EAAM,MAAM,CAAC,IAAM,EAC5B,MAAM,IAAI,MACN,mBAAA,OAAmB+pB,EAAmC,4BAAA,EAAA,OAAArpC,EAAS,IAAA,CAAA,EAGvE,IAAMqE,EAAOilC,EAAK,IAAI,SAAClrC,EAAGO,EAAC,CAAK,OAAAP,EAAI,EAAIO,EAAI,EAAE,CAAA,EAAE,OAAO,SAAAA,EAAC,CAAI,OAAAA,GAAK,CAAL,CAAM,EAElE,GAAI0F,EAAK,SAAW,EAClB,OAAOg5B,GAAM/d,CAAK,EAIpB,IAAMpB,EAAqB,CAAC,EAAGoB,CAAK,EAC9BsI,EAAmB,CAAC,KAAI0hB,CAAA,EAC9B,OAAO9hB,EAAO,UACV3T,GAAMqK,EACN0J,CAAgC,CACtC,CAEO,IAAM2hB,GAA8BjrC,EAAG,CAAC,aAAY8qC,EAAA,CAAC,EClD5D,SAASI,GAAwB3oC,EAAe,CAC9C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,OAAQ,SAAS,EAE9Cqd,EAAqB,CAAC,EAAG+e,CAAE,EACjC,OAAOzV,EAAO,UAAUvc,GAAMiT,CAAmC,CACnE,CACO,IAAMurB,GAAuBnrC,EAAG,CAAC,MAAKkrC,EAAA,CAAC,ECL9C,SAASE,GACL1pC,EAAoB5C,EAAsB6C,EAAgB,CAC5D2G,GAAmC5G,CAAK,EAExCC,EAAQA,GAASqF,GAAWlI,CAAK,EACjC,IAAMwqB,EAAmB,CAAC,MAAK5nB,EAAE,MAAK5C,EAAE,MAAK6C,CAAA,EAE7C,OAAOunB,EAAO,UAAUna,GAAM,CAAA,EAAIua,CAAgC,CACpE,CCLA,SAAS+hB,GACL9oC,EAAiB+oC,EAAsBC,EAAoB,CAC7D,IAAM5M,EAAK/P,EAAgBrsB,EAAG,IAAK,aAAa,EAMhD,GALAuiB,EACKwmB,GAAgBC,EACjB,UAAA,CAAM,MAAA,uBAAA,OAAuBD,EAAwB,YAAA,EACjD,8BAAA,OAA8BC,EAAY,IAAA,CADxC,CAC4C,EAElDD,IAAiBC,EACnB,OAAOH,GAAKzM,EAAG,MAAO2M,EAAc3M,EAAG,KAAK,EAG9C,IAAM/e,EAA4B,CAAC,EAAG+e,CAAE,EAClCrV,EAA0B,CAAC,aAAYgiB,EAAE,aAAYC,CAAA,EAE3D,OAAOriB,EAAO,UACVtc,GAAagT,EACb0J,CAAgC,CACtC,CAEO,IAAMkiB,GAA8BxrC,EAAG,CAAC,aAAYqrC,EAAA,CAAC,EC7B5D,SAASI,GAAU1gB,EAAmC,CACpD,OAAOic,GAAOjc,EAAS,CAAC,CAC1B,CAEO,IAAM2gB,GAA2B1rC,EAAG,CAAC,UAASyrC,EAAA,CAAC,ECYtD,SAASE,GACL5gB,EAAqCtlB,EAAY,CACnD,OAAOuhC,GAAOjc,EAAStlB,CAAI,CAC7B,CAEO,IAAMmmC,GAA2B5rC,EAAG,CAAC,UAAS2rC,EAAA,CAAC,ECDtD,SAASE,GACL9gB,EAAqCtlB,EAAY,CACnD,OAAOuhC,GAAOjc,EAAStlB,CAAI,CAC7B,CAEO,IAAMqmC,GAA2B9rC,EAAG,CAAC,UAAS6rC,EAAA,CAAC,EC5BtD,SAASE,GACLhhB,EAAqCtlB,EAAY,CACnD,OAAOuhC,GAAOjc,EAAStlB,CAAI,CAC7B,CAEO,IAAMumC,GAA2BhsC,EAAG,CAAC,UAAS+rC,EAAA,CAAC,EC0BtD,SAASE,GACL1pC,EAAiB2pC,EACjB7kC,EACAsc,EACA4d,EACAC,EACAwE,EAAwC,CAFxCzE,IAAA,SAAAA,EAAkC,QAClCC,IAAA,SAAAA,EAAA,CAAsC,EAAG,CAAC,GAE5C,IAAM7C,EAAK/P,EAAgBrsB,EAAG,IAAK,SAAU,SAAS,EAChD4pC,EAAUvd,EAAgBsd,EAAQ,SAAU,SAAU,SAAS,EAEjE5F,EAAM3H,EACN4H,EAAe,GAEf5H,EAAG,OAAS,IACd4H,EAAe,GACfD,EAAMH,EAAQxH,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAG9D7Z,EACIwhB,EAAI,OAAS,EACb,UAAA,CAAM,MAAA,uDAAA,OAAuDA,EAAI,KAAI,GAAA,CAA/D,CAAkE,EAC5ExhB,EACIqnB,EAAQ,OAAS,EACjB,UAAM,CAAA,MAAA,wDACF,GAAA,OAAGA,EAAQ,KAAI,GAAA,CADb,CACgB,EAC1B3F,GAAoC,SAAU7iB,EAAKqiB,CAAe,EAClE,IAAMnC,EAAUtC,IAAe,OAAS+E,EAAI,MAAM,CAAC,EAAIA,EAAI,MAAM,CAAC,EAClExhB,EACI+e,IAAYsI,EAAQ,MAAM,CAAC,EAC3B,UAAA,CAAM,MAAA,oCAAA,OAAoCtI,EAAsB,eAAA,EAC5D,0BAA0B,OAAAsI,EAAQ,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EACrDrnB,EACIuhB,GAAyCh/B,EAASm6B,CAAS,EAC3D,UAAA,CAAM,MAAA,2DACF,eAAA,OAAen6B,EAA0B,kBAAA,EAAA,OAAAm6B,EAAS,GAAA,CADhD,CACmD,EAC7D1c,EACIsnB,GAAwC5K,CAAS,EACjD,UAAA,CAAM,MAAA,yDAAA,CAAyD,EACnE1c,EACIsnB,GAAwC/kC,CAAO,EAC/C,UAAA,CAAM,MAAA,mDAAA,CAAmD,EAE7D,IAAMuY,EAAuB,CAAC,EAAG0mB,EAAK,OAAQ6F,CAAO,EAC/C7iB,EACY,CAAC,QAAOjiB,EAAE,IAAGsc,EAAE,WAAU4d,EAAE,UAASC,EAAE,gBAAewE,CAAA,EAGjE/pB,EAAMiN,EAAO,UACHlc,GAAQ4S,EACR0J,CAAgC,EAEhD,OAAIid,EACKJ,EAAQlqB,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAEzDA,CACT,CAEO,IAAMowB,GAAyBrsC,EAAG,CAAC,QAAOisC,EAAA,CAAC,EChElD,SAASK,GACL/pC,EAAiB2pC,EAA6B3nB,EAC9CZ,EACA4d,EAAiCsD,EACjCmB,EAAwC,CADxCzE,IAAA,SAAAA,EAA+B,OAAEsD,IAAA,SAAAA,EAAY,GAE/C,IAAMlG,EAAK/P,EAAgBrsB,EAAG,IAAK,QAAQ,EACrC4pC,EAAUvd,EAAgBsd,EAAQ,SAAU,QAAQ,EAEtDK,EAAM5N,EACN6N,EAAe,GACf7N,EAAG,OAAS,IACd6N,EAAe,GACfD,EAAMpG,EAAQxH,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAGjD7Z,EACIynB,EAAI,OAAS,EACb,UAAA,CAAM,MAAA,uDAAA,OAAuDA,EAAI,KAAI,GAAA,CAA/D,CAAkE,EAC5EznB,EACIqnB,EAAQ,OAAS,EACjB,UAAM,CAAA,MAAA,wDACF,GAAA,OAAGA,EAAQ,KAAI,GAAA,CADb,CACgB,EAC1B3F,GAAoC,SAAU7iB,EAAKqiB,CAAe,EAClElhB,EACIynB,EAAI,MAAM,CAAC,IAAMJ,EAAQ,MAAM,CAAC,EAChC,UAAA,CAAM,MAAA,oCAAA,OAAoCI,EAAI,MAAM,CAAC,EAAgB,eAAA,EACjE,0BAA0B,OAAAJ,EAAQ,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EACrDrnB,EACIuhB,GAAyC9hB,EAAQsgB,CAAQ,EACzD,UAAA,CAAM,MAAA,yDACF,cAAA,OAActgB,EAAwB,iBAAA,EAAA,OAAAsgB,EAAQ,GAAA,CAD5C,CAC+C,EACzD/f,EACIsnB,GAAwCvH,CAAQ,EAChD,UAAA,CAAM,MAAA,yDAAA,CAAyD,EACnE/f,EACIsnB,GAAwC7nB,CAAM,EAC9C,UAAA,CAAM,MAAA,kDAAA,CAAkD,EAC5DO,EACIyc,IAAe,MACf,UAAM,CAAA,MAAA,sCAAA,OACFA,EAAU,uCAAA,CADR,CAC+C,EAEzD,IAAMkL,EAAWtG,EACbgG,EAAS,CAAC,EAAGA,EAAQ,MAAM,CAAC,EAAGA,EAAQ,MAAM,CAAC,EAAGA,EAAQ,MAAM,CAAC,CAAC,CAAC,EAChEO,EAAUvG,EAAQoG,EAAK,CAACA,EAAI,MAAM,CAAC,EAAG,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EACpEllC,EAA4B,CAAC,EAAGkd,CAAM,EACtCid,EAA8B,CAAC,EAAGqD,CAAQ,EAE1C8H,EAAmB,OAEnB1wB,EAAMowB,GACPK,EAAuBD,EAAuBplC,EAASsc,EACxDgpB,EAAkBnL,EAAWwE,CAAe,EAEhD,OAAIwG,EACKrG,EAAQlqB,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAG3CkqB,EAAQlqB,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,CAChE,CAEO,IAAM2wB,GAAyB5sC,EAAG,CAAC,QAAOssC,EAAA,CAAC,EChElD,SAASO,GACL9B,EAAmE3hB,EACnE8iB,EAAkB7kC,EAClBsc,EACA4d,EACAyE,EAAwC,CADxCzE,IAAA,SAAAA,EAAkC,QAEpCzc,EACIimB,EAAO,SAAW3hB,EAAG,KACrB,UAAA,CAAM,MAAA,qBACF,IAAI,OAAA2hB,EAAO,OAA2B,oBAAA,EAAA,OAAA3hB,EAAG,KAAkB,cAAA,CAAA,CAAA,EAEnE,IAAI0jB,EAAW/B,EACXgC,EAAO3jB,EACPmd,EAAe,GACfnd,EAAG,OAAS,IACdmd,EAAe,GACfwG,EAAO5G,EAAQ/c,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,EAC7D0jB,EAAW,CAAC,EAAG/B,EAAO,CAAC,EAAGA,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,GAGhDjmB,EACIgoB,EAAS,SAAW,EACpB,UACI,CAAA,MAAA,qEACA,GAAA,OAAGA,EAAS,OAAM,GAAA,CADlB,CACqB,EAC7BhoB,EACIioB,EAAK,OAAS,EACd,UAAM,CAAA,MAAA,uDACF,QAAA,OAAQA,EAAK,IAAI,CADf,CACiB,EAC3BjoB,EACIonB,EAAO,OAAS,EAChB,UAAM,CAAA,MAAA,2DACF,QAAA,OAAQA,EAAO,IAAI,CADjB,CACmB,EAC7B,IAAMrI,EAAUtC,IAAe,OAASuL,EAAS,CAAC,EAAIA,EAAS,CAAC,EAC1D5I,EAAW3C,IAAe,OAASwL,EAAK,MAAM,CAAC,EAAIA,EAAK,MAAM,CAAC,EACrEjoB,EACI+e,IAAYqI,EAAO,MAAM,CAAC,EAC1B,UAAA,CAAM,MAAA,4CAAA,OAA4CrI,EAAgB,SAAA,EAC9D,gCAAgC,OAAAqI,EAAO,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EAC1DpnB,EACIof,IAAagI,EAAO,MAAM,CAAC,EAC3B,UAAA,CAAM,MAAA,6CAAA,OAA6ChI,EAAiB,SAAA,EAChE,iCAAiC,OAAAgI,EAAO,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EAC3D1F,GAAoC,iBAAkB7iB,EAAKqiB,CAAe,EAC1E,IAAMpmB,EAAoC,CAAC,GAAImtB,EAAM,OAAMb,CAAA,EACrD5iB,EACF,CAAC,QAAOjiB,EAAE,IAAGsc,EAAE,WAAU4d,EAAE,gBAAeyE,EAAE,WAAY8G,CAAQ,EAG9D7wB,EAAMiN,EAAO,UACHhc,GAAqB0S,EACrB0J,CAAgC,EAEhD,OAAIid,EACKJ,EAAQlqB,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAEzDA,CACT,CAEO,IAAM+wB,GAAsChtC,EAAG,CAAC,qBAAoB6sC,EAAA,CAAC,EClE5E,SAASI,GACL1qC,EAAiB2pC,EACjBgB,EACA7lC,EACAsc,EACAqiB,EAAwC,CAC1C,IAAMrH,EAAK/P,EAAgBrsB,EAAG,IAAK,iBAAiB,EAC9C4pC,EAAUvd,EAAgBsd,EAAQ,SAAU,iBAAiB,EAEnE,OAAOc,GACHE,EAAavO,EAAIwN,EAAS9kC,EAASsc,EAAK,OAAQqiB,CAAe,CACrE,CAEO,IAAMmH,GAAkCntC,EAAG,CAAC,iBAAgBitC,EAAA,CAAC,ECIpE,SAASG,GACL7qC,EAAiB2pC,EACjB7kC,EAA0Csc,EAC1C4d,EACAC,EAAsD,CADtDD,IAAA,SAAAA,EAAqC,SACrCC,IAAA,SAAAA,EAA8C,CAAA,EAAG,EAAG,CAAC,GACvD,IAAM7C,EAAK/P,EAAgBrsB,EAAG,IAAK,QAAQ,EACrC4pC,EAAUvd,EAAgBsd,EAAQ,SAAU,QAAQ,EAEtDvF,EAAMhI,EACNiI,EAAe,GAEfjI,EAAG,OAAS,IACdiI,EAAe,GACfD,EAAMR,EAAQxH,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAE3E7Z,EACI6hB,EAAI,OAAS,EACb,UAAA,CAAM,MAAA,uDAAA,OAAuDA,EAAI,KAAI,GAAA,CAA/D,CAAkE,EAC5E7hB,EACIqnB,EAAQ,OAAS,EACjB,UAAM,CAAA,MAAA,wDACF,GAAA,OAAGA,EAAQ,KAAI,GAAA,CADb,CACgB,EAC1BrnB,EACI6hB,EAAI,MAAM,CAAC,IAAMwF,EAAQ,MAAM,CAAC,EAChC,UAAA,CAAM,MAAA,oCAAA,OAAoCxF,EAAI,MAAM,CAAC,EAAgB,eAAA,EACjE,0BAA0B,OAAAwF,EAAQ,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EACrDrnB,EACI8gB,GAA+Bv+B,EAASm6B,CAAS,EACjD,UAAM,CAAA,MAAA,2DACF,eAAA,OAAen6B,EAA0B,kBAAA,EAAA,OAAAm6B,EAAS,GAAA,CADhD,CACmD,EAC7D1c,EACIyc,IAAe,QACf,UAAM,CAAA,MAAA,sCAAA,OACFA,EAAU,yCAAA,CADR,CACiD,EAC3Dzc,EACI+gB,GAA8BrE,CAAS,EACvC,UAAA,CAAM,MAAA,yDAAA,CAAyD,EACnE1c,EACI+gB,GAA8Bx+B,CAAO,EACrC,UAAA,CAAM,MAAA,mDAAA,CAAmD,EAE7D,IAAMuY,EAAuB,CAAC,EAAG+mB,EAAK,OAAQwF,CAAO,EAE/C7iB,EAAqB,CAAC,QAAOjiB,EAAE,IAAGsc,EAAE,WAAU4d,EAAE,UAASC,CAAA,EAGzDvlB,EAAMiN,EAAO,UACH/b,GAAQyS,EACR0J,CAAgC,EAEhD,OAAIsd,EACKT,EACIlqB,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAGnEA,CACT,CAEO,IAAMoxB,GAAyBrtC,EAAG,CAAC,QAAOotC,EAAA,CAAC,EC3ElD,SAASE,GACLvC,EAGA3hB,EAAO8iB,EAAkB7kC,EACzBsc,EAAmB,CACrBmB,EACIimB,EAAO,SAAW3hB,EAAG,KACrB,UAAA,CAAM,MAAA,qBACF,IAAI,OAAA2hB,EAAO,OAA2B,oBAAA,EAAA,OAAA3hB,EAAG,KAAkB,cAAA,CAAA,CAAA,EAEnE,IAAImkB,EAAWxC,EACXyC,EAAOpkB,EACPwd,EAAe,GACfxd,EAAG,OAAS,IACdwd,EAAe,GACf4G,EAAOrH,EAAQ/c,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,EAC1EmkB,EAAW,CAAC,EAAGxC,EAAO,CAAC,EAAGA,EAAO,CAAC,EAAGA,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,GAG3D,IAAMlH,EAAU0J,EAAS,CAAC,EACpBrJ,EAAWsJ,EAAK,MAAM,CAAC,EAC7B1oB,EACIyoB,EAAS,SAAW,EACpB,UACI,CAAA,MAAA,qEACA,GAAA,OAAGA,EAAS,OAAM,GAAA,CADlB,CACqB,EAC7BzoB,EACI0oB,EAAK,OAAS,EACd,UAAM,CAAA,MAAA,uDACF,QAAA,OAAQA,EAAK,IAAI,CADf,CACiB,EAC3B1oB,EACIonB,EAAO,OAAS,EAChB,UAAM,CAAA,MAAA,2DACF,QAAA,OAAQA,EAAO,IAAI,CADjB,CACmB,EAC7BpnB,EACI+e,IAAYqI,EAAO,MAAM,CAAC,EAC1B,UAAA,CAAM,MAAA,4CAAA,OAA4CrI,EAAgB,SAAA,EAC9D,gCAAgC,OAAAqI,EAAO,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EAC1DpnB,EACIof,IAAagI,EAAO,MAAM,CAAC,EAC3B,UAAA,CAAM,MAAA,6CAAA,OAA6ChI,EAAiB,SAAA,EAChE,iCAAiC,OAAAgI,EAAO,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EAE3D,IAAMtsB,EAAsC,CAAC,GAAI4tB,EAAM,OAAMtB,CAAA,EAEvD5iB,EAC2B,CAAC,IAAG3F,EAAE,QAAOtc,EAAE,WAAYkmC,CAAQ,EAG9DtxB,EAAMiN,EAAO,UACH7b,GAAuBuS,EACvB0J,CAAgC,EAEhD,OAAIsd,EACKT,EACIlqB,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAGnEA,CACT,CAEO,IAAMwxB,GAAsCztC,EAAG,CAAC,qBAAoBstC,EAAA,CAAC,EChE5E,SAASI,GACLnrC,EAAiB2pC,EACjBgB,EAGA7lC,EAA0Csc,EAAmB,CAC/D,IAAMgb,EAAK/P,EAAgBrsB,EAAG,IAAK,iBAAiB,EAC9C4pC,EAAUvd,EAAgBsd,EAAQ,SAAU,iBAAiB,EAEnE,OAAOuB,GAAoBP,EAAavO,EAAIwN,EAAS9kC,EAASsc,CAAG,CACnE,CAEO,IAAMgqB,GAAkC3tC,EAAG,CAAC,iBAAgB0tC,EAAA,CAAC,EChBpE,SAASE,GAAuBrrC,EAAe,CAC7C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,MAAO,SAAS,EAE7Cqd,EAAoB,CAAC,EAAG+e,CAAE,EAEhC,OAAOzV,EAAO,UAAU5b,GAAKsS,CAAmC,CAClE,CACO,IAAMiuB,GAAsB7tC,EAAG,CAAC,KAAI4tC,EAAA,CAAC,ECP5C,SAASE,GAAwBvrC,EAAe,CAC9C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,OAAQ,SAAS,EAC9Cqd,EAAqB,CAAC,EAAG+e,CAAE,EAEjC,OAAOzV,EAAO,UAAU3b,GAAMqS,CAAmC,CACnE,CACO,IAAMmuB,GAAuB/tC,EAAG,CAAC,MAAK8tC,EAAA,CAAC,ECM9C,SAASE,GACPzrC,EACAkD,EACAwoC,EACAC,EAAe,CAFfzoC,IAAA,SAAAA,EAAQ,GACRwoC,IAAA,SAAAA,EAAiB,IACjBC,IAAA,SAAAA,EAAe,IAEf,IAAMvP,EAAK/P,EAAgBrsB,EAAG,IAAK,SAAS,EAEtCqd,EAAwB,CAAE,EAAG+e,CAAE,EAC/BrV,EAAsB,CAAE,KAAI7jB,EAAE,UAASwoC,EAAE,QAAOC,CAAA,EAEtD,OAAOhlB,EAAO,UACZ1b,GACAoS,EACA0J,CAAgC,CAEpC,CAEO,IAAM6kB,GAA0BnuC,EAAG,CAAE,SAAQguC,EAAA,CAAE,EClBtD,SAASI,GACL7rC,EAAsBkD,EAAUwoC,EAAmBC,EAAe,CAA5CzoC,IAAA,SAAAA,EAAQ,GAAEwoC,IAAA,SAAAA,EAAiB,IAAEC,IAAA,SAAAA,EAAe,IACpE,IAAMvP,EAAK/P,EAAgBrsB,EAAG,IAAK,QAAQ,EAErCqd,EAAuB,CAAC,EAAG+e,CAAE,EAC7BrV,EAAqB,CAAC,KAAI7jB,EAAE,UAASwoC,EAAE,QAAOC,CAAA,EAEpD,OAAOhlB,EAAO,UACVzb,GAAQmS,EACR0J,CAAgC,CACtC,CAEO,IAAM+kB,GAAyBruC,EAAG,CAAC,QAAOouC,EAAA,CAAC,ECflD,SAASE,GACL/rC,EAAiB2nC,EAAuBnmC,EACxCwqC,EAAoB,CAApBA,IAAA,SAAAA,EAAoB,IACtB,IAAM5P,EAAK/P,EAAgBrsB,EAAG,IAAK,eAAe,EAC5C4nC,EAAWvb,EAAgBsb,EAAS,UAAW,eAAe,EAEpEplB,EACI6Z,EAAG,QAAU,QACb,UAAM,CAAA,MAAA,iCACF,gCAAA,OAAgCA,EAAG,KAAK,CADtC,CACwC,EAClD7Z,EACI6Z,EAAG,MAAQ,EACX,UAAM,CAAA,MAAA,iEACF,QAAA,OAAQA,EAAG,KAAI,GAAA,CADb,CACgB,EAC1B7Z,EAAY/gB,GAAQ,EAAG,UAAM,CAAA,MAAA,sCAAA,OAAsCA,EAAI,GAAA,CAA1C,CAA6C,EAC1E+gB,EACIqlB,EAAS,OAASxL,EAAG,MAAQwL,EAAS,OAAS,EAC/C,UAAA,CACI,MAAA,oEACA,8BAA8B,OAAAxL,EAAG,MAAwB,mBAAA,EACzD,GAAA,OAAGwL,EAAS,MAAK,GAAA,CAFjB,CAEoB,EAE5B,IAAMvqB,EAA8B,CAAC,EAAG+e,EAAI,QAASwL,CAAQ,EACvD7gB,EAA4B,CAAC,KAAIvlB,EAAE,aAAYwqC,CAAA,EAErD,OAAOrlB,EAAO,UACVvb,GAAeiS,EACf0J,CAAgC,CACtC,CAEO,IAAMklB,GAAgCxuC,EAAG,CAAC,eAAcsuC,EAAA,CAAC,ECZhE,SAASG,GACLlsC,EAA0BmsC,EAC1BnN,EAAkC,CAAlCA,IAAA,SAAAA,EAAkC,QACpC,IAAM5C,EAAK/P,EAAgBrsB,EAAG,IAAK,eAAgB,SAAS,EAEtDosC,EAAepN,IAAe,OAAU5C,EAAG,MAAM,CAAC,EAAIA,EAAG,MAAM,CAAC,EAChEiQ,EAAcrN,IAAe,OAAU5C,EAAG,MAAM,CAAC,EAAIA,EAAG,MAAM,CAAC,EAC/DkQ,EAActN,IAAe,OAAU5C,EAAG,MAAM,CAAC,EAAIA,EAAG,MAAM,CAAC,EAErE7Z,EACI4pB,EAAY,EACZ,UAAM,CAAA,MAAA,sDAAA,OAAsDA,CAAS,CAA/D,CAAiE,EAE3E5pB,EACI6pB,EAAcD,GAAa,EAC3B,UAAM,CAAA,MAAA;MAAA,OACNC,EAAW,OAAA,EAAA,OAAQD,EAAS;KAAA,EAAA,OAC5B/P,EAAG,KAAK,CAAE,CAAA,EAEd7Z,EACI8pB,EAAaF,GAAa,EAC1B,UAAM,CAAA,MAAA;MAAA,OACNE,EAAU,OAAA,EAAA,OAAQF,EAAS;SAAA,EAAA,OACvB/P,EAAG,KAAK,CAAE,CAAA,EAElB7Z,EACK+pB,GAAcH,EAAYA,KAAe,EAC1C,UAAM,CAAA,MAAA,8CACF,OAAAA,EAAYA,EAAS,UAAA,EAAA,OACrBG,EAAU,qCAAA,EAAA,OAAsClQ,EAAG,KAAK,CAFtD,CAEwD,EAElE,IAAM/e,EAA6B,CAAC,EAAG+e,CAAE,EACnCrV,EAA2B,CAAC,UAASolB,EAAE,WAAUnN,CAAA,EAEvD,OAAOrY,EAAO,UACVtb,GAAcgS,EACd0J,CAAgC,CACtC,CAEO,IAAMwlB,GAA+B9uC,EAAG,CAAC,cAAayuC,EAAA,CAAC,EC9B9D,SAASM,GACLxsC,EAAiB2pC,EACjB7kC,EACAsc,EACA4d,EACAC,EACAwE,EAAwC,CAFxCzE,IAAA,SAAAA,EAAkC,QAClCC,IAAA,SAAAA,EAAA,CAAsC,EAAG,CAAC,GAE5C,IAAM7C,EAAK/P,EAAgBrsB,EAAG,IAAK,kBAAmB,SAAS,EACzD4pC,EACFvd,EAAgBsd,EAAQ,SAAU,kBAAmB,SAAS,EAE9D5F,EAAM3H,EACN4H,EAAe,GACf5H,EAAG,OAAS,IACd4H,EAAe,GACfD,EAAMH,EAAQxH,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAE9D7Z,EACIwhB,EAAI,OAAS,EACb,UAAM,CAAA,MAAA,2DACF,QAAA,OAAQA,EAAI,KAAI,GAAA,CADd,CACiB,EAC3BxhB,EACIqnB,EAAQ,OAAS,EACjB,UAAM,CAAA,MAAA,iEACF,GAAA,OAAGA,EAAQ,KAAI,GAAA,CADb,CACgB,EAC1B,IAAMtJ,EAAatB,IAAe,OAAS+E,EAAI,MAAM,CAAC,EAAIA,EAAI,MAAM,CAAC,EACrExhB,EACI+d,IAAesJ,EAAQ,MAAM,CAAC,EAC9B,UAAA,CAAM,MAAA,sDACF,IAAA,OAAItJ,EAAqD,2CAAA,EACzD,UAAU,OAAAsJ,EAAQ,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EACrC3F,GAAoC,kBAAmB7iB,EAAKqiB,CAAe,EAC3E,IAAMpmB,EAAsC,CAAC,EAAG0mB,EAAK,OAAQ6F,CAAO,EAC9D7iB,EACF,CAAC,QAAOjiB,EAAE,IAAGsc,EAAE,WAAU4d,EAAE,UAASC,EAAE,gBAAewE,CAAA,EAGnD/pB,EAAMiN,EAAO,UACHrb,GAAuB+R,EACvB0J,CAAgC,EAEhD,OAAIid,EACKJ,EAAQlqB,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAEzDA,CACT,CAEO,IAAM+yB,GAAkChvC,EAAG,CAAC,iBAAgB+uC,EAAA,CAAC,ECzEpE,SAASE,GAAM1sC,EAAS,CACtB,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,MAAM,EAEnCqd,EAAqB,CAAC,EAAG+e,CAAE,EAEjC,OAAOzV,EAAO,UAAUlb,GAAM4R,CAAmC,CACnE,CAEO,IAAMsvB,GAAuBlvC,EAAG,CAAC,MAAKivC,EAAA,CAAC,ECI9C,SAASE,GACL5sC,EAAiB2pC,EACjB7kC,EAAkCsc,EAClC6d,EACAD,EAA2B,CAD3BC,IAAA,SAAAA,EAAA,CAAsC,EAAG,CAAC,GAC1CD,IAAA,SAAAA,EAA2B,QAC7B,IAAM5C,EAAK/P,EAAgBrsB,EAAG,IAAK,YAAY,EACzC4pC,EAAUvd,EAAgBsd,EAAQ,SAAU,YAAY,EAE9DpnB,EACI6Z,EAAG,OAAS,GAAKA,EAAG,OAAS,EAC7B,UAAA,CAAM,MAAA,gEACF,GAAA,OAAGA,EAAG,KAAI,GAAA,CADR,CACW,EACrB7Z,EACIqnB,EAAQ,OAAS,EACjB,UAAM,CAAA,MAAA,4DACF,GAAA,OAAGA,EAAQ,KAAI,GAAA,CADb,CACgB,EAC1BrnB,EACIyc,IAAe,OACf,UAAM,CAAA,MAAA,0DACF,yBAAA,OAAyBA,CAAU,CADjC,CACmC,EAE7C,IAAI+E,EAAM3H,EACN4H,EAAe,GAEf5H,EAAG,OAAS,IACd2H,EAAMH,EAAQxH,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,EAC5D4H,EAAe,IAGjBzhB,EACIwhB,EAAI,MAAM,CAAC,IAAM6F,EAAQ,MAAM,CAAC,EAChC,UAAA,CAAM,MAAA,oEAAA,OACF7F,EAAI,MAAM,CAAC,EAAQ,MAAA,EAAA,OAAA6F,EAAQ,MAAM,CAAC,CAAC,CADjC,CACmC,EAE7C,IAAMvsB,EAA2B,CAAC,EAAG0mB,EAAK,OAAQ6F,CAAO,EACnD7iB,EAAyB,CAAC,QAAOjiB,EAAE,IAAGsc,EAAE,UAAS6d,CAAA,EAGjDvlB,EAAMiN,EAAO,UACHjb,GAAY2R,EACZ0J,CAAgC,EAEhD,OAAIid,EACKJ,EAAQlqB,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAGzDA,CACT,CAEO,IAAMmzB,GAA6BpvC,EAAG,CAAC,YAAWmvC,EAAA,CAAC,ECnF1C,SAAAE,GACZtN,EAAmB6B,EAAkB,CAGvC,QAFM0L,EAASvN,EAAQ,OACjBwN,EAAiB,CAAA,EACdlvC,EAAI,EAAGA,EAAIivC,EAAQjvC,IAAK,CAC/B,IAAMmvC,EAAMF,EAAS,EAAIjvC,EACnB6C,EAAI6+B,EAAQyN,CAAG,GAAK,EACpBpxC,EAAIwlC,EAASA,EAAS,OAAS,EAAIvjC,CAAC,GAAK,EAC3CjC,EAAI,GAAK8E,IAAM,GACjBqsC,EAAK,QAAQC,CAAG,CAEnB,CACD,OAAOD,CACT,CAMgB,SAAAE,GACZ1N,EAAmB6B,EAAkB,CAEvC,QADMvkC,EAAmB,CAAA,EAChBgB,EAAI,EAAGA,EAAIujC,EAAS,OAAQvjC,IAAK,CACxC,IAAMqvC,EAAQ3N,EAAQA,EAAQ,OAAS1hC,EAAI,CAAC,EACtCsvC,EAAU/L,EAAS,OAASvjC,EAAI,EAChCuvC,EAAShM,EAAS+L,CAAO,GAC3BD,GAAS,MAASA,IAAU,GAAKE,EAAS,IAC5CvwC,EAAO,QAAQswC,CAAO,CAEzB,CACD,OAAOtwC,CACT,CAEgB,SAAAwwC,GACZpsC,EAAkBC,EAAgB,CAIpC,QAHM5C,EAAI,KAAK,IAAI2C,EAAO,OAAQC,EAAO,MAAM,EACzCrE,EAAS,IAAI,MAAMyB,CAAC,EAEjBT,EAAI,EAAGA,EAAIS,EAAGT,IAAK,CAC1B,IAAI6C,EAAIO,EAAOA,EAAO,OAASpD,EAAI,CAAC,EAChC6C,GAAK,OACPA,EAAI,GAEN,IAAI9E,EAAIsF,EAAOA,EAAO,OAASrD,EAAI,CAAC,EAIpC,GAHIjC,GAAK,OACPA,EAAI,GAEF8E,IAAM,EACR7D,EAAOyB,EAAIT,EAAI,CAAC,EAAIjC,UACXA,IAAM,EACfiB,EAAOyB,EAAIT,EAAI,CAAC,EAAI6C,UACXA,IAAM9E,EAAG,CAClB,IAAM0xC,EAAS,wDACX,GAAA,OAAGrsC,EAAM,OAAA,EAAA,OAAQC,EAAM,GAAA,EAC3B,MAAM,MAAMosC,CAAM,CACnB,MACCzwC,EAAOyB,EAAIT,EAAI,CAAC,EAAI6C,CAEvB,CACD,OAAO7D,CACT,+FC5CA,SAAS0wC,GACL7sC,EAAsB9E,EAAoB,OACxC8gC,EAAKtQ,EAAgB1rB,EAAG,IAAK,QAAS,mBAAmB,EACzDi8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,QAAS,mBAAmB,EAC7DmL,EAAAjJ,EAAW4mB,GAAegY,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAE31B,EAAA,CAAA,EAAE41B,EAAE51B,EAAA,CAAA,EAEPsmC,GAA2B3Q,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMvf,EAAsB,CAAC,EAAGsf,EAAI,EAAGC,CAAE,EAEzC,OAAOjW,EAAO,UAAUxa,GAAOkR,CAAmC,CACpE,CAEO,IAAMowB,GAAwBhwC,EAAG,CAAC,OAAM+vC,EAAA,CAAC,ECJhD,SAASE,GACLC,EAA8BhtC,EAAiB9E,EAAe,CAChE,IAAM8gC,EAAKtQ,EAAgB1rB,EAAG,IAAK,OAAO,EACpCi8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,OAAO,EACpC+xC,EAAavhB,EAAgBshB,EAAW,YAAa,QAAS,MAAM,EAIpEE,EAAiBP,GACnBA,GAA2BM,EAAW,MAAOjR,EAAG,KAAK,EAAGC,EAAG,KAAK,EAC9DkR,EAAwBpF,GAAYkF,EAAYC,CAAc,EAC9DE,EAAgBrF,GAAY/L,EAAIkR,CAAc,EAC9CG,EAAgBtF,GAAY9L,EAAIiR,CAAc,EAE9CxwB,EAAuB,CAC3B,UAAWywB,EACX,EAAGC,EACH,EAAGC,GAEL,OAAOrnB,EAAO,UAAUvV,GAAQiM,CAAmC,CACrE,CAEO,IAAM4wB,GAAwBxwC,EAAG,CAAC,OAAMiwC,EAAA,CAAC,EClChD,SAASQ,GAA6BluC,EAAe,CACnD,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,WAAW,EACxCqd,EAA0B,CAAC,EAAG+e,CAAE,EACtC,OAAOzV,EAAO,UAAUnT,GAAW6J,CAAmC,CACxE,CACO,IAAM8wB,GAA4B1wC,EAAG,CAAC,WAAUywC,EAAA,CAAC,ECcxD,SAASE,GACLztC,EAAsB9E,EAAoB,OAExC8gC,EAAKtQ,EAAgB1rB,EAAG,IAAK,KAAK,EAClCi8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,KAAK,EACtCmL,EAAAjJ,EAAW4mB,GAAegY,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAE31B,EAAA,CAAA,EAAE41B,EAAE51B,EAAA,CAAA,EAEP,IAAMqnC,EAAYt2B,GAAI4kB,EAAIC,CAAE,EACtB0R,EAAQH,GAAUE,CAAS,EAC3BE,EAAcd,GAAM7Q,EAAI0R,CAAK,EACnC,OAAOL,GAAMM,EAAaD,EAAOD,CAAS,CAC5C,CAEO,IAAMG,GAA2B/wC,EAAG,CAAC,UAAS2wC,EAAA,CAAC,EC5BtD,SAASK,GAAKC,EAAuBC,EAAqB,CACxD,IAAMC,EAAMviB,EAAgBqiB,EAAI,KAAM,KAAK,EACrCG,EAAMxiB,EAAgBsiB,EAAI,KAAM,KAAK,EAE3CpsB,GACKqsB,EAAI,OAAS,GAAKA,EAAI,OAAS,KAAOC,EAAI,OAAS,GAAKA,EAAI,OAAS,GACtE,UAAA,CAAM,MAAA,+DACF,GAAG,OAAAD,EAAI,KAAY,OAAA,EAAA,OAAAC,EAAI,KAAO,GAAA,CAAA,CAAA,EAEtC,IAAMC,EAAWF,EAAI,OAAS,EAAIA,EAAI,KAAOA,EAAI,MAAM,CAAC,EAClDG,EAAWF,EAAI,OAAS,EAAIA,EAAI,KAAOA,EAAI,MAAM,CAAC,EAOxD,GALAtsB,EACIusB,IAAYC,EACZ,UAAM,CAAA,MAAA,gEACF,GAAA,OAAGD,EAAe,OAAA,EAAA,OAAAC,EAAO,GAAA,CADvB,CAC0B,EAEhCH,EAAI,OAAS,GAAKC,EAAI,OAAS,EAAG,CACpC,IAAMG,EAAOpL,EAAQgL,EAAK,CAAC,EAAG,EAAE,CAAC,EAC3BK,EAAOrL,EAAQiL,EAAK,CAAC,GAAI,CAAC,CAAC,EAC3BK,EAAOrK,GAAOmK,EAAMC,CAAI,EAC9B,OAAOrL,EAAQsL,EAAM,CAAA,CAAE,CACxB,SAAUN,EAAI,OAAS,GAAKC,EAAI,OAAS,EAAG,CAC3C,IAAMG,EAAOpL,EAAQgL,EAAK,CAAC,EAAG,EAAE,CAAC,EAC3BK,EAAOrL,EAAQiL,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAChDK,EAAOrK,GAAOmK,EAAMC,CAAI,EAC9B,OAAOrL,EAAQsL,EAAM,CAACA,EAAK,IAAI,CAAC,CACjC,SAAUN,EAAI,OAAS,GAAKC,EAAI,OAAS,EAAG,CAC3C,IAAMI,EAAOrL,EAAQiL,EAAK,CAAC,GAAI,CAAC,CAAC,EAC3BK,EAAOrK,GAAO+J,EAAKK,CAAI,EAC7B,OAAOrL,EAAQsL,EAAM,CAACA,EAAK,IAAI,CAAC,CACjC,KAAM,CACL,IAAMD,EAAOrL,EAAQiL,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAChDK,EAAOrK,GAAO+J,EAAKK,CAAI,EAC7B,OAAOC,CACR,CACH,CAEO,IAAMC,GAAsB1xC,EAAG,CAAC,KAAIgxC,EAAA,CAAC,ECqBtC,SAAUW,GAAQC,EAAgB,SAAsB7mB,EAAA,CAAA,EAAA5gB,EAAA,EAApBA,EAAoB,UAAA,OAApBA,IAAA4gB,EAAoB5gB,EAAA,CAAA,EAAA,UAAAA,CAAA,EAC5D,IAAM41B,EACFhV,EAAQ,IAAI,SAACtrB,EAAGY,EAAM,CAAA,OAAAuuB,EAAgBnvB,EAAG,UAAA,OAAUY,CAAC,EAAI,QAAQ,CAAC,CAAA,EAC/DipB,EAAqB,CAAC,SAAQsoB,CAAA,EACpC,OAAO1oB,EAAO,UACV5a,GAAQyxB,EACRzW,CAAgC,CACtC,CAEO,IAAMuoB,GAAyB7xC,EAAG,CAAC,QAAO2xC,EAAA,CAAC,ECzElD,SAASG,GAAuBvvC,EAAe,CAC7C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,MAAO,SAAS,EAE7Cqd,EAAoB,CAAC,EAAG+e,CAAE,EAEhC,OAAOzV,EAAO,UAAU3a,GAAKqR,CAAmC,CAClE,CAEO,IAAMmyB,GAAsB/xC,EAAG,CAAC,KAAI8xC,EAAA,CAAC,ECG5C,SAASE,GAA6BzvC,EAAWb,EAAkB,CACjE,IAAMi9B,EAAK/P,EAAgBrsB,EAAG,IAAK,cAAe,mBAAmB,EACrE,GAAI,CAAC0B,GAAoB06B,EAAG,MAAOj9B,CAAK,EACtC,MAAM,IAAI,MAAM,gCACZ,OAAAi9B,EAAG,MAA+C,yCAAA,EAAA,OAAAj9B,CAAK,CAAE,EAG/D,OAAOa,CACT,CACO,IAAM0vC,GAA8BjyC,EAAG,CAAC,aAAYgyC,EAAA,CAAC,ECjB5D,SAASE,GAAuB3vC,EAAe,CAC7C,IAAIo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,KAAK,EACtCuiB,EACI6Z,EAAG,QAAU,SAAWA,EAAG,QAAU,UACrC,UAAA,CAAM,MAAA,2CAA2C,CAAA,EAEjDA,EAAG,QAAU,UACfA,EAAKE,GAAKF,EAAI,SAAS,GAGzB,IAAM/e,EAAoB,CAAC,EAAG+e,CAAE,EAChC,OAAOzV,EAAO,UAAUza,GAAKmR,CAAmC,CAClE,CACO,IAAMuyB,GAAsBnyC,EAAG,CAAC,KAAIkyC,EAAA,CAAC,EC/B5B,SAAAE,GAAqBrsC,EAAgBL,EAAY,CAC/D,QAASrF,EAAI,EAAGA,EAAI0F,EAAK,OAAQ,EAAE1F,EACjC,GAAI0F,EAAKA,EAAK,OAAS1F,EAAI,CAAC,IAAMqF,EAAO,EAAIrF,EAC3C,MAAO,GAGX,MAAO,EACT,UAEgBgyC,GACZC,EAAqBC,EAAqBxsC,EAAc,CAKxD,QAJIL,EAAO4sC,EAAU,OAASC,EAAU,OACpCrtB,EAAM,CAAA,EACRstB,EAAS,EACTC,EAAY,EACLjD,EAAM,EAAGA,EAAM9pC,EAAM8pC,IAC1BzpC,EAAK,QAAQypC,CAAG,IAAM,GACxBtqB,EAAI,KAAKotB,EAAUE,GAAQ,CAAC,EAE5BttB,EAAI,KAAKqtB,EAAUE,GAAW,CAAC,EAGnC,OAAOvtB,CACT,CAEgB,SAAAwtB,GACZC,EAAkB5sC,EAAc,CAGlC,QAFM69B,EAAW,CAAA,EACXl+B,EAAOitC,EAAO,OACXnD,EAAM,EAAGA,EAAM9pC,EAAM8pC,IACxBzpC,EAAK,QAAQypC,CAAG,IAAM,IACxB5L,EAAS,KAAK+O,EAAOnD,CAAG,CAAC,EAG7B,IAAMoD,EAAc7sC,EAAK,IAAI,SAAAypC,EAAO,CAAA,OAAAmD,EAAOnD,CAAG,CAAV,CAAW,EAC/C,MAAO,CAAC5L,EAAUgP,CAAW,CAC/B,CAEgB,SAAAC,GACZnxC,EAAiBqE,EAAc,CACjC,IAAM+sC,EAAiB/sC,EAAK,IAAI,SAAAxD,EAAC,CAAI,MAAA,EAAA,CAAC,EACtC,OAAO8vC,GAAiB3wC,EAAOoxC,EAAgB/sC,CAAI,CACrD,UAEgBgtC,GACZxvC,EAAawC,EAAgBL,EAAY,CAC3Cof,EACIstB,GAAqBrsC,EAAML,CAAI,EAC/B,UAAA,CAAM,MAAA,GAAA,OAAGnC,EAA6C,0CAAA,EAClD,YAAA,OAAYwC,EAAiB,YAAA,EAAA,OAAAL,EAAI,SAAA,CAD/B,CACwC,CACpD,CAOgB,SAAAstC,GAAmBjtC,EAAgBL,EAAY,CAE7D,GAAI0sC,GAAqBrsC,EAAML,CAAI,EACjC,OAAO,KAGT,QADMrG,EAAmB,CAAA,EAChBgB,EAAI,EAAGA,EAAIqF,EAAM,EAAErF,EACtB0F,EAAK,QAAQ1F,CAAC,IAAM,IACtBhB,EAAO,KAAKgB,CAAC,EAGjB,OAAA0F,EAAK,QAAQ,SAAAN,EAAI,CAAI,OAAApG,EAAO,KAAKoG,CAAI,CAAhB,CAAiB,EAC/BpG,CACT,CAGM,SAAU4zC,GAAuBltC,EAAc,CACnD,OAAOA,EAAK,IAAI,SAACN,EAAMpF,EAAM,CAAA,MAAA,CAACA,EAAGoF,CAAI,CAAC,CAAA,EACjC,KAAK,SAACvC,EAAG9E,EAAC,CAAK,OAAA8E,EAAE,CAAC,EAAI9E,EAAE,CAAC,CAAC,CAAA,EAC1B,IAAI,SAAAmE,EAAC,CAAI,OAAAA,EAAE,CAAC,CAAC,CAAA,CACpB,CAEgB,SAAA2wC,GAAiBC,EAAiBztC,EAAY,CAE5D,QADMuW,EAAgB,CAAA,EACb5b,EAAIqF,EAAOytC,EAAS9yC,EAAIqF,EAAM,EAAErF,EACvC4b,EAAI,KAAK5b,CAAC,EAEZ,OAAO4b,CACT,CCpDA,SAASm3B,GACL7wC,EAAsBkD,EAA8B06B,EAAgB,CAA9C16B,IAAA,SAAAA,EAA4B,MAAE06B,IAAA,SAAAA,EAAgB,IACtE,IAAMxB,EAAK/P,EAAgBrsB,EAAG,IAAK,KAAK,EAElCqd,EAAoB,CAAC,EAAG+e,CAAE,EAC1BrV,EAAkB,CAAC,iBAAkB7jB,EAAM,SAAQ06B,CAAA,EAEzD,OAAOjX,EAAO,UACVrY,GAAK+O,EACL0J,CAAgC,CACtC,CAEO,IAAM9mB,GAAsBxC,EAAG,CAAC,KAAIozC,EAAA,CAAC,ECb5C,SAASC,GACL9wC,EAAsBkD,EAA8B06B,EAAgB,CAA9C16B,IAAA,SAAAA,EAA4B,MAAE06B,IAAA,SAAAA,EAAgB,IACtE,IAAMxB,EAAK/P,EAAgBrsB,EAAG,IAAK,KAAK,EAElCqd,EAAoB,CAAC,EAAG+e,CAAE,EAC1BrV,EAAkB,CAAC,KAAI7jB,EAAE,SAAQ06B,CAAA,EAGvC,OAAOjX,EAAO,UACH7X,GAAKuO,EACL0J,CAAgC,CAC7C,CAEO,IAAMhnB,GAAsBtC,EAAG,CAAC,KAAIqzC,EAAA,CAAC,ECd5C,SAASC,GACLC,EAAyBC,EAAsB,OAC7CC,EAAQ7kB,EAAgB2kB,EAAM,OAAQ,KAAK,EAC3CG,EAAO9kB,EAAgB4kB,EAAK,MAAO,KAAK,EAC5CjqC,EAAAjJ,EAAgB4mB,GAAeusB,EAAOC,CAAI,EAAC,CAAA,EAA1CD,EAAKlqC,EAAA,CAAA,EAAEmqC,EAAInqC,EAAA,CAAA,EAEZ,IAAMqW,EAAoB,CAAC,EAAG6zB,EAAO,EAAGC,CAAI,EAE5C,OAAOxqB,EAAO,UAAU7W,GAAKuN,CAAmC,CAClE,CAEO,IAAM+zB,GAAsB3zC,EAAG,CAAC,KAAIszC,EAAA,CAAC,EC5B5B,SAAAM,GACZ90C,EAAyC6C,EAAgB,CAC3D,IAAMyd,GAAatgB,CAAK,GAAK6C,IAAU,UAAa,MAAM,QAAQ7C,CAAK,IACnE6C,IAAU,YACZ,MAAM,IAAI,MACN,gFACyB,EAE/B,GAAIA,IAAU,UAAYyd,GAAatgB,CAAK,GACxC,EAAEA,aAAiB,YACrB,MAAM,IAAI,MACN,2EACiC,EAEvC,IAAM4C,EAAkB,CAAA,EAClBqtB,EAA0B,CAAA,EAChC,OAAOe,GAAWhxB,EAAO4C,EAAOqtB,EAAeptB,CAAK,CACtD,CChBA,SAASkyC,GAAwBtxC,EAAe,CAC9C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,OAAQ,SAAS,EAE9Cqd,EAAqB,CAAC,EAAG+e,CAAE,EAEjC,OAAOzV,EAAO,UAAU/U,GAAMyL,CAAmC,CACnE,CACO,IAAMk0B,GAAuB9zC,EAAG,CAAC,MAAK6zC,EAAA,CAAC,ECV9C,SAASE,GAA0BxxC,EAAe,CAChD,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,QAAQ,EACrC+mB,EAAQ,CAAA,EACd,OAAOJ,EAAO,UAAU,SAAU,CAAC,EAAGyV,CAAE,EAAGrV,CAAK,CAClD,CAEO,IAAM0qB,GAAyBh0C,EAAG,CAAC,QAAO+zC,EAAA,CAAC,ECgBlD,SAASE,GACL1xC,EAAsBkD,EAA8B06B,EAAgB,CAA9C16B,IAAA,SAAAA,EAA4B,MAAE06B,IAAA,SAAAA,EAAgB,IACtE,IAAIxB,EAAK/P,EAAgBrsB,EAAG,IAAK,KAAK,EAClCo8B,EAAG,QAAU,SACfA,EAAKE,GAAKF,EAAI,OAAO,GAGvB,IAAM/e,EAAoB,CAAC,EAAG+e,CAAE,EAC1BrV,EAAkB,CAAC,KAAI7jB,EAAE,SAAQ06B,CAAA,EAEvC,OAAOjX,EAAO,UACV9U,GAAKwL,EACL0J,CAAgC,CACtC,CAEO,IAAMvmB,GAAsB/C,EAAG,CAAC,KAAIi0C,EAAA,CAAC,ECA5C,SAASC,GACL3xC,EAAsB4xC,EACtB1uC,EAA8B06B,EAAgB,CADxBgU,IAAA,SAAAA,EAA2C,aACjE1uC,IAAA,SAAAA,EAA4B,MAAE06B,IAAA,SAAAA,EAAgB,IAChD59B,EAAIqsB,EAAgBrsB,EAAG,IAAK,MAAM,EAElC,IAAM6xC,EAAOC,GAAS9xC,EAAG4xC,EAAK1uC,CAAI,EAC9B6uC,EAAgBF,EAAK,MACzB,GAAIjU,EAAU,CACZ,IAAMp6B,EAAOP,GAAeC,EAAMlD,EAAE,KAAK,EACzC+xC,EAAgBC,GAA+BH,EAAK,MAAOruC,CAAI,CAChE,CACD,OAAOogC,EAAQiO,EAAME,CAAa,CACpC,CAEA,SAASD,GACL9xC,EAAWlE,EAAkBoH,EAA4B,CAC3D,GAD+BA,IAAA,SAAAA,EAA4B,MACvDlD,EAAE,OAAS,EACb,OAAOk9B,GAAIl9B,CAAC,EAId,GAAIA,EAAE,OAAS,GAAKkD,IAAS,KAC3B,OAAO4uC,GAASlO,EAAQ5jC,EAAG,CAAC,EAAE,CAAC,EAAGlE,EAAGoH,CAAI,EAI3C,GAAIlD,EAAE,OAAS,GAAK,OAAOkD,GAAS,UAChC,MAAM,QAAQA,CAAI,GAAKA,EAAK,SAAW,EAAG,CAC5C,GAAIpH,IAAM,EACR,OAAO0E,GAAI08B,GAAIl9B,CAAC,EAAGkD,CAAI,EAEzB,GAAIpH,IAAM,IACR,OAAOmE,GAAIi9B,GAAIl9B,CAAC,EAAGkD,CAAI,EAEzB,GAAIpH,IAAM,KACR,OAAOiE,GAAIm9B,GAAIl9B,CAAC,EAAGkD,CAAI,EAEzB,GAAIpH,IAAM,aAAeA,IAAM,EAE7B,OAAOy1C,GAAK/wC,GAAI4wC,GAAIlU,GAAIl9B,CAAC,EAAGqxC,GAAO,EAAG,OAAO,CAAC,EAAGnuC,CAAI,CAAC,EAGxD,MAAM,IAAI,MAAM,qCAAA,OAAqCpH,CAAC,CAAE,CACzD,CAGD,GAAI,MAAM,QAAQoH,CAAI,GAAKA,EAAK,SAAW,EAAG,CAC5C,GAAIpH,IAAM,EACR,OAAOmE,GAAIO,GAAI08B,GAAIl9B,CAAC,EAAGkD,EAAK,CAAC,CAAC,EAAGA,EAAK,CAAC,EAAI,CAAC,EAE9C,GAAIpH,IAAM,IACR,OAAOmE,GAAIO,GAAI08B,GAAIl9B,CAAC,EAAGkD,EAAK,CAAC,CAAC,EAAGA,EAAK,CAAC,CAAC,EAE1C,GAAIpH,IAAM,KACR,OAAOiE,GAAIS,GAAI08B,GAAIl9B,CAAC,EAAGkD,EAAK,CAAC,CAAC,EAAGA,EAAK,CAAC,CAAC,EAE1C,GAAIpH,IAAM,OAASA,IAAM,YAEvB,OAAOy1C,GAAK/wC,GAAIixC,GAAOzxC,CAAC,EAAGkD,CAAI,CAAC,EAGlC,MAAM,IAAI,MAAM,qCAAA,OAAqCpH,CAAC,CAAE,CACzD,CAED,MAAM,IAAI,MAAM,gCAAA,OAAgCoH,CAAI,CAAE,CACxD,CAEO,IAAM2uC,GAAuBp0C,EAAG,CAAC,MAAKk0C,EAAA,CAAC,EC7F9C,SAASM,GACLjyC,EAAsBkD,EACtB06B,EAAgB,CADM,OAAA16B,IAAA,SAAAA,EAA4B,MAClD06B,IAAA,SAAAA,EAAgB,IACXiU,GAAK7xC,EAAG,YAAakD,EAAM06B,CAAQ,CAC5C,CAEO,IAAMsU,GAAgCz0C,EAAG,CAAC,eAAcw0C,EAAA,CAAC,ECdhE,SAASE,GAAuBnyC,EAAe,CAC7C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,KAAK,EAElCqd,EAAoB,CAAC,EAAG+e,CAAE,EAChC,OAAOzV,EAAO,UAAUva,GAAKiR,CAAmC,CAClE,CACO,IAAM4zB,GAAsBxzC,EAAG,CAAC,KAAI00C,EAAA,CAAC,ECA5C,SAASC,GAA8BpyC,EAAsBkD,EAAQ,CAARA,IAAA,SAAAA,EAAQ,GACnE,IAAMk5B,EAAK/P,EAAgBrsB,EAAG,IAAK,aAAc,mBAAmB,EAEpEuiB,EAAYrf,GAAQk5B,EAAG,KAAM,UAAA,CAAM,MAAA,oCAAA,CAAoC,EAEvE,IAAM/e,EAA2B,CAAC,MAAO+e,CAAE,EACrCrV,EAAyB,CAAC,IAAK7jB,CAAI,EAEzC,OAAOyjB,EAAO,UACVta,GAAYgR,EACZ0J,CAAgC,CACtC,CAEO,IAAMsrB,GAA6B50C,EAAG,CAAC,YAAW20C,EAAA,CAAC,EClB1D,SAASE,GAAyBtyC,EAAe,CAC/C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,OAAO,EAEpCqd,EAAsB,CAAC,EAAG+e,CAAE,EAClC,OAAOzV,EAAO,UAAUra,GAAO+Q,CAAmC,CACpE,CACO,IAAMk1B,GAAwB90C,EAAG,CAAC,OAAM60C,EAAA,CAAC,ECQhD,SAASE,GAAwBxyC,EAAiByoC,EAAc,CAC9D,IAAMrM,EAAK/P,EAAgBrsB,EAAG,IAAK,OAAQ,mBAAmB,EAC9DuiB,EACI6Z,EAAG,OAASqM,EAAK,OACjB,UAAM,CAAA,MAAA,qCAAA,OAAqCrM,EAAG,KAAO,GAAA,EACjD,6BAAA,OAA6BqM,EAAI,GAAA,CAD/B,CACkC,EAE5C,IAAMprB,EAAqB,CAAC,EAAG+e,CAAE,EAC3BrV,EAAmB,CAAC,KAAI0hB,CAAA,EAE9B,OAAO9hB,EAAO,UACV3T,GAAMqK,EACN0J,CAAgC,CACtC,CAEO,IAAM0rB,GAAuBh1C,EAAG,CAAC,MAAK+0C,EAAA,CAAC,EC5B9C,SAASE,GACLC,EAAiBC,EACjBC,EAKAzzC,EAA2B,CAA3BA,IAAA,SAAAA,EAA2B,WACzBwzC,GAAc,OAChBA,EAAaD,GAIf,QAFMG,EAAO7kB,GAAO,CAAC0kB,EAASC,CAAU,EAAGxzC,CAAK,EAC1C7B,EAAIo1C,GAAWC,EAAaD,EAAUC,EACnC90C,EAAI,EAAGA,EAAIP,EAAG,EAAEO,EACvBg1C,EAAK,IAAI,EAAGh1C,EAAGA,CAAC,EAElB,IAAM+pB,EAAgB+b,EAAQkP,EAAK,SAAQ,EAAI,CAACH,EAASC,CAAU,CAAC,EACpE,GAAIC,GAAc,KAChB,OAAOhrB,EAEP,GAAIgrB,EAAW,SAAW,EACxB,OAAOJ,GAAKJ,GAAWxqB,EAAK,CAAC,EAAG,CAACgrB,EAAW,CAAC,EAAG,EAAG,CAAC,CAAC,EAChD,GAAIA,EAAW,SAAW,EAE/B,OAAOJ,GACIJ,GAAWA,GAAWxqB,EAAK,CAAC,EAAG,CAAC,EAChC,CAACgrB,EAAW,CAAC,EAAGA,EAAW,CAAC,EAAG,EAAG,CAAC,CAAC,EAC1C,GAAIA,EAAW,SAAW,EAE/B,OAAOJ,GAAKJ,GAAWA,GAAWA,GAAWxqB,EAAK,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CACrDgrB,EAAW,CAAC,EAAGA,EAAW,CAAC,EAAGA,EAAW,CAAC,EAAG,EAAG,CACjD,CAAA,EAER,MAAM,IAAI,MACN,2CAEA,6BAAA,OAA8BA,EAAmB,OAAM,IAAA,CAAI,CAGrE,CAEO,IAAME,GAAsBt1C,EAAG,CAAC,KAAIi1C,EAAA,CAAC,EC5C5C,SAASM,GAAyBhzC,EAAe,CAC/C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,QAAS,SAAS,EAE/Cqd,EAAsB,CAAC,EAAG+e,CAAE,EAClC,OAAOzV,EAAO,UAAUja,GAAO2Q,CAAmC,CACpE,CACO,IAAM41B,GAAwBx1C,EAAG,CAAC,OAAMu1C,EAAA,CAAC,ECUhD,SAASE,GACLlzC,EAAiB8rB,EAA4B5oB,EAAUiwC,EAAa,CAAvBjwC,IAAA,SAAAA,EAAQ,GAAEiwC,IAAA,SAAAA,EAAa,GACtE,IAAM/W,EAAK/P,EAAgBrsB,EAAG,IAAK,QAAQ,EACrCozC,EAAW/mB,EAAgBP,EAAS,UAAW,SAAU,OAAO,EAEhEzO,EAAyB,CAAC,EAAG+e,EAAI,QAASgX,CAAQ,EAClDrsB,EAAuB,CAAC,KAAI7jB,EAAE,UAASiwC,CAAA,EAE7C,OAAOxsB,EAAO,UACV9Z,GAAUwQ,EACV0J,CAAgC,CACtC,CAEO,IAAMssB,GAAyB51C,EAAG,CAAC,QAAOy1C,EAAA,CAAC,ECxBlD,SAASI,GACL3yC,EAAsB9E,EAAoB,OACxC8gC,EAAKtQ,EAAgB1rB,EAAG,IAAK,UAAW,mBAAmB,EAC3Di8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,UAAW,mBAAmB,EAC/DmL,EAAAjJ,EAAW4mB,GAAegY,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAE31B,EAAA,CAAA,EAAE41B,EAAE51B,EAAA,CAAA,EAEPsmC,GAA2B3Q,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMvf,EAAwB,CAAC,EAAGsf,EAAI,EAAGC,CAAE,EAE3C,OAAOjW,EAAO,UAAU5Z,GAASsQ,CAAmC,CACtE,CAEO,IAAMk2B,GAA0B91C,EAAG,CAAC,SAAQ61C,EAAA,CAAC,ECbpD,SAASE,GACL7yC,EAAsB9E,EAAoB,OACxC8gC,EAAKtQ,EAAgB1rB,EAAG,IAAK,eAAgB,mBAAmB,EAChEi8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,eAAgB,mBAAmB,EACpEmL,EAAAjJ,EAAW4mB,GAAegY,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAE31B,EAAA,CAAA,EAAE41B,EAAE51B,EAAA,CAAA,EAEPsmC,GAA2B3Q,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMvf,EAA6B,CAAC,EAAGsf,EAAI,EAAGC,CAAE,EAEhD,OAAOjW,EAAO,UAAU3Z,GAAcqQ,CAAmC,CAC3E,CAEO,IAAMo2B,GAA+Bh2C,EAAG,CAAC,cAAa+1C,EAAA,CAAC,ECjB9D,SAASE,GAAwBj1B,EAAmB,CAClD,IAAMk1B,EAAStnB,EAAgB5N,EAAO,QAAS,MAAM,EAE/CpB,EAAqB,CAAC,MAAOs2B,CAAM,EACzC,OAAOhtB,EAAO,UAAUxZ,GAAMkQ,CAAmC,CACnE,CAEO,IAAM6P,GAAuBzvB,EAAG,CAAC,MAAKi2C,EAAA,CAAC,ECP9C,SAASE,GAA4B5zC,EAAe,CAClD,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,UAAU,EAEvCqd,EAAyB,CAAC,EAAG+e,CAAE,EAErC,OAAOzV,EAAO,UAAUvZ,GAAUiQ,CAAmC,CACvE,CACO,IAAMw2B,GAA2Bp2C,EAAG,CAAC,UAASm2C,EAAA,CAAC,ECPtD,SAASE,GAAyB9zC,EAAe,CAC/C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,OAAO,EAEpCqd,EAAsB,CAAC,EAAG+e,CAAE,EAElC,OAAOzV,EAAO,UAAUtZ,GAAOgQ,CAAmC,CACpE,CACO,IAAM02B,GAAwBt2C,EAAG,CAAC,OAAMq2C,EAAA,CAAC,ECPhD,SAASE,GAAyBh0C,EAAe,CAC/C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,OAAO,EACpCqd,EAAsB,CAAC,EAAG+e,CAAE,EAElC,OAAOzV,EAAO,UAAUrZ,GAAO+P,CAAmC,CACpE,CACO,IAAM42B,GAAwBx2C,EAAG,CAAC,OAAMu2C,EAAA,CAAC,ECAhD,SAASE,GAA6Bl0C,EAAiBm0C,EAAW,CAAXA,IAAA,SAAAA,EAAW,IAChE,IAAM/X,EAAK/P,EAAgBrsB,EAAG,IAAK,WAAW,EAExCqd,EAA0B,CAAC,EAAG+e,CAAE,EAChCrV,EAAwB,CAAC,MAAKotB,CAAA,EAEpC,OAAOxtB,EAAO,UACVpZ,GAAW8P,EACX0J,CAAgC,CACtC,CAEO,IAAMqtB,GAA4B32C,EAAG,CAAC,WAAUy2C,EAAA,CAAC,ECdxD,SAASG,GACL1zC,EAAsB9E,EAAoB,OACxC8gC,EAAKtQ,EAAgB1rB,EAAG,IAAK,OAAQ,mBAAmB,EACxDi8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,OAAQ,mBAAmB,EAC5DmL,EAAAjJ,EAAW4mB,GAAegY,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAE31B,EAAA,CAAA,EAAE41B,EAAE51B,EAAA,CAAA,EAEPsmC,GAA2B3Q,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMvf,EAAqB,CAAC,EAAGsf,EAAI,EAAGC,CAAE,EAExC,OAAOjW,EAAO,UAAUnZ,GAAM6P,CAAmC,CACnE,CAEO,IAAMi3B,GAAuB72C,EAAG,CAAC,MAAK42C,EAAA,CAAC,ECZ9C,SAASE,GACL5zC,EAAsB9E,EAAoB,OACxC8gC,EAAKtQ,EAAgB1rB,EAAG,IAAK,YAAa,mBAAmB,EAC7Di8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,YAAa,mBAAmB,EACjEmL,EAAAjJ,EAAW4mB,GAAegY,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAE31B,EAAA,CAAA,EAAE41B,EAAE51B,EAAA,CAAA,EAEPsmC,GAA2B3Q,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMvf,EAA0B,CAAC,EAAGsf,EAAI,EAAGC,CAAE,EAE7C,OAAOjW,EAAO,UAAUlZ,GAAW4P,CAAmC,CACxE,CAEO,IAAMm3B,GAA4B/2C,EAAG,CAAC,WAAU82C,EAAA,CAAC,WCrBxCE,GAAS7vC,EAAe8vC,EAAc5wC,EAAW,CAC/D,GAAIA,GAAO,EACT,MAAM,IAAI,MAAM,0CAA0C,EAG5D,IAAMijB,EAAuB,CAAC,MAAKniB,EAAE,KAAI8vC,EAAE,IAAG5wC,CAAA,EAC9C,OAAO6iB,EAAO,UAAUjZ,GAAU,CAAA,EAAIqZ,CAAgC,CACxE,CCGA,SAAS4tB,GACL30C,EAAiB40C,EAAiBC,EAAUV,EAAWW,EAAU,CAAhDF,IAAA,SAAAA,EAAe,GAAEC,IAAA,SAAAA,EAAQ,GAAEV,IAAA,SAAAA,EAAS,GAAEW,IAAA,SAAAA,EAAU,IACnE,IAAM1Y,EAAK/P,EAAgBrsB,EAAG,IAAK,4BAA4B,EAC/DuiB,EACI6Z,EAAG,OAAS,GAAKA,EAAG,OAAS,EAC7B,UAAM,CAAA,MAAA;sBACU,OAAAA,EAAG,KAAO,GAAA,CAAA,CAAA,EAC9B7Z,EACImhB,GAAWkR,CAAW,EACtB,UAAM,CAAA,MAAA,+DACF,+BAAA,OAA+BA,EAAW,GAAA,CADxC,CAC2C,EAErD,IAAI7Q,EAAM3H,EACN4H,EAAe,GACf5H,EAAG,OAAS,IACd4H,EAAe,GACfD,EAAMH,EAAQxH,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAG9D,IAAM/e,EAAoB,CAAC,EAAG0mB,CAAG,EAE3Bhd,EAAkB,CAAC,YAAW6tB,EAAE,KAAIC,EAAE,MAAKV,EAAE,KAAIW,CAAA,EAGjDp7B,EAAMiN,EAAO,UACHxY,GAAKkP,EACL0J,CAAgC,EAEhD,OAAIid,EACKJ,EAAQlqB,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAEvDA,CAEX,CAEO,IAAMq7B,GAA6Ct3C,EAAG,CAAC,4BAA2Bk3C,EAAA,CAAC,ECzC1F,SAASK,GAAuBh1C,EAAe,CAC7C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,MAAO,SAAS,EAE7Cqd,EAAoB,CAAC,EAAG+e,CAAE,EAChC,OAAOzV,EAAO,UAAUhZ,GAAK0P,CAAmC,CAClE,CACO,IAAMrJ,GAAsBvW,EAAG,CAAC,KAAIu3C,EAAA,CAAC,ECL5C,SAASC,GAAyBj1C,EAAe,CAC/C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,OAAO,EAEpCqd,EAAsB,CAAC,EAAG+e,CAAE,EAClC,OAAOzV,EAAO,UAAU/Y,GAAOyP,CAAmC,CACpE,CACO,IAAM63B,GAAwBz3C,EAAG,CAAC,OAAMw3C,EAAA,CAAC,ECahD,SAASruB,GAAKzpB,EAAwB,CAEpColB,OAAAA,EACIkI,GAAgBttB,CAAC,EAAG,UAAA,CAAM,MAAA,4CAAA,CAA4C,EACnE,SAAC6C,EAAsB6mB,EAAsB,CAElD,IAAMuV,EAAK/P,EAAgBrsB,EAAG,IAAK,UAAW,mBAAmB,EAC3Dm1C,EACDtuB,GAAM,KAAQwF,EAAgBxF,EAAI,KAAM,SAAS,EAAI,KAC1D,OAAOF,EAAO,KAAK,UAAA,CACX,IAAA3f,EAAiB2f,EAAO,UAAU,UAAM,CAAA,OAAAxpB,EAAEi/B,CAAE,CAAJ,EAAO,CAACA,CAAE,EAAG+Y,CAAG,EAAvD54C,EAAKyK,EAAA,MAAEwjB,EAAKxjB,EAAA,MACnB,OAAImuC,GAAO,MACT9nB,GACI9wB,EAAM,MAAO44C,EAAI,MACjB,gFACsB,EAE5BC,GAAW5qB,CAAK,EACTA,EAAM,CAAC,CAChB,CAAC,CACH,CACF,CA+BA,SAASA,GAAMrtB,EAAgC,CAE7ColB,OAAAA,EACIkI,GAAgBttB,CAAC,EAAG,UAAA,CAAM,MAAA,6CAAA,CAA6C,EACpE,SAAC4vB,EAAgClG,EAAsB,CAC5DtE,EACI,MAAM,QAAQwK,CAAI,EAClB,UAAM,CAAA,MAAA,kFAC6B,CAAA,EAEvC,IAAMsoB,EACF5oB,GAAqBM,EAAM,OAAQ,WAAY,mBAAmB,EAChEooB,EACDtuB,GAAM,KAAQwF,EAAgBxF,EAAI,KAAM,UAAU,EAAI,KAC3D,OAAOF,EAAO,KAAK,UAAA,CACX,IAAA3f,EAAiB2f,EAAO,UAAU,UAAM,CAAA,OAAAxpB,EAAC,MAAA,OAAAgB,GAAA,CAAA,EAAAJ,EAAIs3C,CAAK,EAAA,EAAA,CAAA,CAAA,EAAGA,EAAOF,CAAG,EAA9D54C,EAAKyK,EAAA,MAAEwjB,EAAKxjB,EAAA,MACnB,OAAImuC,GAAO,MACT9nB,GACI9wB,EAAM,MAAO44C,EAAI,MACjB,+FAC6C,EAEnDC,GAAW5qB,CAAK,EACTA,CACT,CAAC,CACH,CACF,CA2BA,SAAS8qB,GAAiDn4C,EAAc,CAKtEolB,OAAAA,EACIkI,GAAgBttB,CAAC,EACjB,UAAA,CAAM,MAAA,oDAAA,CAAoD,EACvD,SAAC6C,EAAM6mB,EAAM,CAClBtE,EACIviB,aAAamjB,GACb,UAAA,CAAM,MAAA,qDAAA,CAAqD,EAC/DZ,EACIsE,GAAM,MAAQA,aAAc1D,GAC5B,UAAM,CAAA,MAAA,0DAAA,CAA0D,EAC9D,IAAAnc,EAAiB2f,EAAO,UAAU,UAAM,CAAA,OAAAxpB,EAAE6C,CAAC,CAAH,EAAM,CAACA,CAAC,EAAG6mB,CAAE,EAApD2D,EAAKxjB,EAAA,MAAEzK,EAAKyK,EAAA,MACnB,OAAAouC,GAAW5qB,CAAK,EACT,CAAC,KAAMA,EAAM,CAAC,EAAQ,MAAKjuB,CAAA,CACpC,CACF,CAiCA,SAASg5C,GAAgCp4C,EAA2B,CAKlEolB,OAAAA,EACIkI,GAAgBttB,CAAC,EACjB,UAAA,CAAM,MAAA,qDAAA,CAAqD,EACxD,SAAC4vB,EAAgBlG,EAAM,CAC5BtE,EACI,MAAM,QAAQwK,CAAI,GAAKA,EAAK,MAAM,SAAAL,EAAG,CAAI,OAAAA,aAAevJ,EAAf,CAAqB,EAC9D,UAAM,CAAA,MAAA,oEACO,CAAA,EACjBZ,EACIsE,GAAM,MAAQA,aAAc1D,GAC5B,UAAM,CAAA,MAAA,8DAAA,CAA8D,EACxE,IAAMzJ,EAAMiN,EAAO,UAAU,UAAA,CAAM,OAAAxpB,EAAK,MAAA,OAAAgB,GAAA,CAAA,EAAAJ,EAAAgvB,CAAI,EAAA,EAAA,CAAA,CAAA,EAAGA,EAAMlG,CAAE,EACvD,OAAIA,GAAM,MACRwG,GACI3T,EAAI,MAAM,MAAOmN,EAAG,MACpB,uGAC6C,EAEnDuuB,GAAW17B,EAAI,KAAK,EACbA,CACT,CACF,CAgCA,SAAS87B,GAAcr4C,EAAiBs4C,EAAoB,CAE1DlzB,EACIkI,GAAgBttB,CAAC,EACjB,UAAA,CAAM,MAAA,qDAAA,CAAqD,EAC/DolB,EACIkzB,GAAW,MACP,MAAM,QAAQA,CAAO,GAAKA,EAAQ,MAAM,SAAAj4C,EAAK,CAAA,OAAAA,aAAaimB,EAAQ,CAAA,EACtE,UACI,CAAA,MAAA,+EACc,CAAA,EAEtB,IAAMiyB,EAAmBD,GAAW,KACpC,GAAI,CAACC,EAAkB,CAErBD,EAAU,CAAA,EACV,QAAWlsB,KAAW5C,EAAO,oBAC3B8uB,EAAQ,KAAK9uB,EAAO,oBAAoB4C,CAAO,CAAC,CAEnD,CAED,IAAMosB,EACFD,EAAmBD,EAAQ,OAAO,SAAAG,EAAQ,CAAI,MAAA,CAACA,EAAS,SAAS,CAAA,EAAI,KAGnEC,EAAmBJ,EAAQ,OACjCA,EAAUA,EAAQ,OAAO,SAAAG,EAAY,CAAA,OAAAA,EAAS,SAAT,CAAkB,EACvDrzB,EACIkzB,EAAQ,OAAS,EACjB,UAAM,CAAA,MAAA,kEACF,iCAAA,OAAiCI,EAAgC,gBAAA,EACjE,YAAY,CAAA,EAEpB,IAAMxrB,EAAmB,GACnBrjB,EAAiB2f,EAAO,UAAUxpB,EAAGs4C,EAAS,KAAMprB,CAAgB,EAAnE9tB,EAAKyK,EAAA,MAAEwjB,EAAKxjB,EAAA,MAEnBub,EACIiI,EAAM,KAAK,SAAAntB,EAAC,CAAI,OAAAA,GAAK,IAAL,CAAS,EACzB,UAAA,CAAM,MAAA,8LAE6D,CAAA,EACvEklB,EACIhmB,EAAM,OAAS,EACf,UAAM,CAAA,MAAA,iEACF,mBAAA,OAAmBA,EAAM,KAAI,SAAA,CAD3B,CACoC,EAE9C,IAAMu5C,EAA6B,CAAA,EACnC,OAAAL,EAAQ,QAAQ,SAACj4C,EAAGM,EAAC,CACf0sB,EAAM1sB,CAAC,GAAK,OACdg4C,EAAWt4C,EAAE,IAAI,EAAIgtB,EAAM1sB,CAAC,EAEhC,CAAC,EAIC63C,GAAsB,QAAQ,SAAAn4C,EAAC,CAAI,OAAAs4C,EAAWt4C,EAAE,IAAI,EAAI,IAArB,CAAyB,EAEvD,CAAC,MAAKjB,EAAE,MAAOu5C,CAAU,CAClC,CA0CA,SAASC,GAA6B54C,EAAwB,CAE5D,OAAOwpB,EAAO,WAAWxpB,CAAC,CAC5B,CAEA,SAASi4C,GAAW5qB,EAAe,CACjC,IAAMwrB,EAAmBxrB,EAAM,OAAO,SAAAntB,EAAC,CAAI,OAAAA,GAAK,IAAI,CAAA,EAAE,OACtD,GAAI24C,EAAmB,EACrB,MAAM,IAAI,MACN;oEAC4D,CAEpE,CC1VA,SAASC,GAAuBj2C,EAAe,CAC7C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,KAAK,EAElCqd,EAAoB,CAAC,EAAG+e,CAAE,EAChC,OAAOzV,EAAO,UAAUvX,GAAKiO,CAAmC,CAClE,CACO,IAAM64B,GAAsBz4C,EAAG,CAAC,KAAIw4C,EAAA,CAAC,ECP5C,SAASE,GAA4Bn2C,EAAe,CAClD,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,UAAU,EAEvCqd,EAAyB,CAAC,EAAG+e,CAAE,EACrC,OAAOzV,EAAO,UAAUhV,GAAU0L,CAAmC,CACvE,CACO,IAAM+4B,GAA2B34C,EAAG,CAAC,UAAS04C,EAAA,CAAC,ECHtD,SAASE,GAA8Br2C,EAAe,CACpD,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,YAAY,EAKzCs2C,EAAWP,GAAW,SAAC/1C,EAAS,CAIpC,IAAMzD,EAAQ25C,GAAIE,GAASF,GAAIl2C,CAAC,CAAC,CAAC,EAE5Bu2C,EAAW,SAAC1vB,EAAK,CACrB,IAAM2vB,EAAOp7B,EAAIyL,EAAIke,GAAQmR,GAAIl2C,CAAC,CAAC,CAAC,EACpC,OAAOw2C,CACT,EACA,MAAO,CAAC,MAAKj6C,EAAE,SAAQg6C,CAAA,CACzB,CAAC,EAED,OAAOD,EAASla,CAAE,CACpB,CACO,IAAMqa,GAA6Bh5C,EAAG,CAAC,YAAW44C,EAAA,CAAC,ECb1D,SAASK,GAAuB/1C,EAAsB9E,EAAoB,OACpE8gC,EAAKtQ,EAAgB1rB,EAAG,IAAK,KAAK,EAClCi8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,KAAK,EACtCmL,EAAAjJ,EAAW4mB,GAAegY,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAE31B,EAAA,CAAA,EAAE41B,EAAE51B,EAAA,CAAA,EAEP,IAAMqW,EAAoB,CAAC,EAAGsf,EAAI,EAAGC,CAAE,EAEvC,OAAOjW,EAAO,UAAU9T,GAAKwK,CAAmC,CAClE,CAEO,IAAMs5B,GAAsBl5C,EAAG,CAAC,KAAIi5C,EAAA,CAAC,ECL5C,SAASE,GAA8BC,EAAsB3zC,EAAS,CAATA,IAAA,SAAAA,EAAA,IAC3D,IAAM4zC,EAAUzqB,EAAgBwqB,EAAQ,SAAU,YAAY,EAK9D,GAHI3zC,IAAS,KACXA,EAAO4zC,EAAQ,KAAO,GAEpB5zC,IAAS4zC,EAAQ,KAAO,EAC1B,MAAM,MACF,gEACA,mBAAA,OAAmBA,EAAQ,KAAI,gBAAA,EAAA,OAAiB5zC,CAAI,CAAE,EAe5D,IAAMozC,EAAWP,GAAW,SAACc,EAAgBjsB,EAAkB,CAC7D,IAAMgT,EAAW,GACXmZ,EAAO92C,GAAI42C,EAAQ3zC,EAAM,EAAI,EAC7B8zC,EAAUL,GAAIE,EAAQE,CAAI,EAC1Bx6C,EACFo6C,GAAIra,GAAK0a,EAAS,SAAS,EAAGhjC,GAAIxT,GAAIywC,GAAI+F,CAAO,EAAG9zC,EAAM06B,CAAQ,CAAC,CAAC,EACxEhT,EAAK,CAACruB,CAAK,CAAC,EAEZ,IAAMg6C,EAAW,SAAC1vB,EAAYG,EAAe,CACrC,IAAAhgB,EAAAjJ,EAAUipB,EAAK,CAAA,EAAdzqB,EAAKyK,EAAA,CAAA,EACN42B,EAAW,GACXqZ,EAAUhG,GAAI10C,CAAK,EACzB,OAAOo6C,GAAI9vB,EAAIzL,EAAI5a,GAAIqmB,EAAI3jB,EAAM06B,CAAQ,EAAGqZ,CAAO,CAAC,CACtD,EACA,MAAO,CAAC,MAAK16C,EAAE,SAAQg6C,CAAA,CACzB,CAAC,EAED,OAAOD,EAASQ,CAAO,CAQzB,CAEO,IAAMI,GAA6Bz5C,EAAG,CAAC,YAAWm5C,EAAA,CAAC,EC5C1D,SAASO,GACLn3C,EAAsBkD,EAA8B06B,EAAgB,CAA9C16B,IAAA,SAAAA,EAA4B,MAAE06B,IAAA,SAAAA,EAAgB,IACtE,IAAMxB,EAAK/P,EAAgBrsB,EAAG,IAAK,WAAW,EAExCwD,EAAOP,GAAeC,EAAMk5B,EAAG,KAAK,EACpC2a,EAAO92C,GAAIm8B,EAAI54B,EAAM,EAAI,EACzB7C,EAAIg2C,GAAIva,EAAI2a,CAAI,EAChBl7C,EAAIo1C,GAAItwC,CAAC,EACT2E,EAAI9E,GAAI3E,EAAG2H,CAAI,EACf5H,EAAIoY,GAAI1O,CAAC,EACToU,EAAMoG,GAAI8jB,EAAQmT,EAAMn7C,EAAE,KAAK,EAAGA,CAAC,EAEzC,GAAIgiC,EAAU,CACZ,IAAM56B,EAAWstC,GAAqB52B,EAAI,MAAOlW,CAAI,EACrD,OAAOogC,EAAQlqB,EAAK1W,CAAQ,CAC7B,CACD,OAAO0W,CACT,CAEO,IAAM09B,GAA4B35C,EAAG,CAAC,WAAU05C,EAAA,CAAC,ECvCxD,SAASE,GACL12C,EAAsB9E,EAAoB,CAC5C,IAAM8gC,EAAKtQ,EAAgB1rB,EAAG,IAAK,aAAc,MAAM,EACjDi8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,aAAc,MAAM,EACvDyxC,GAA2B3Q,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMvf,EAA2B,CAAC,EAAGsf,EAAI,EAAGC,CAAE,EAE9C,OAAOjW,EAAO,UAAU9Y,GAAYwP,CAAmC,CACzE,CAEO,IAAMi6B,GAA6B75C,EAAG,CAAC,YAAW45C,EAAA,CAAC,ECd1D,SAASE,GAA8Bv3C,EAAe,CACpD,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,aAAc,MAAM,EACjDqd,EAA2B,CAAC,EAAG+e,CAAE,EACvC,OAAOzV,EAAO,UAAU7Y,GAAYuP,CAAmC,CACzE,CAEO,IAAMm6B,GAA6B/5C,EAAG,CAAC,YAAW85C,EAAA,CAAC,ECJ1D,SAASE,GACL92C,EAAsB9E,EAAoB,CAC5C,IAAM8gC,EAAKtQ,EAAgB1rB,EAAG,IAAK,YAAa,MAAM,EAChDi8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,YAAa,MAAM,EACtDyxC,GAA2B3Q,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMvf,EAA0B,CAAC,EAAGsf,EAAI,EAAGC,CAAE,EAC7C,OAAOjW,EAAO,UAAU5Y,GAAWsP,CAAmC,CACxE,CACO,IAAMq6B,GAA4Bj6C,EAAG,CAAC,WAAUg6C,EAAA,CAAC,ECPxD,SAASE,GACLh3C,EAAsB9E,EAAoB,CAC5C,IAAM8gC,EAAKtQ,EAAgB1rB,EAAG,IAAK,aAAc,MAAM,EACjDi8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,aAAc,MAAM,EACvD,OAAAyxC,GAA2B3Q,EAAG,MAAOC,EAAG,KAAK,EAGtC0a,GAAWI,GAAU/2C,EAAG9E,CAAC,EAAG27C,GAAWF,GAAW32C,EAAG9E,CAAC,CAAC,CAAC,CACjE,CAEO,IAAM+7C,GAA6Bn6C,EAAG,CAAC,YAAWk6C,EAAA,CAAC,EC1B1D,IAAME,GAAY,WAqDlB,SAASC,GACLC,EAAmC74C,EACnCiwB,EAA6B,CAA7BA,IAAA,SAAAA,EAA6B,QAC/B,IAAM6oB,EACF3rB,EAAgB0rB,EAAgB,iBAAkB,cAAc,EAC9DE,EAAU5rB,EAAgBntB,EAAQ,SAAU,cAAc,EAE1Dg5C,EAAeF,EAAgB,MAAMA,EAAgB,MAAM,OAAS,CAAC,EACrEG,EAAaF,EAAQ,MAAMA,EAAQ,MAAM,OAAS,CAAC,EACnDG,EAAoBxU,EAAQoU,EAAiB,CAAC,GAAIE,CAAY,CAAC,EAC/DG,EAAYzU,EAAQqU,EAAS,CAAC,GAAIE,CAAU,CAAC,EAEnD,GAAIC,EAAkB,KAAO,EAC3B,MAAM,IAAI,MAAM,sDAAsD,EAExE,GAAIA,EAAkB,MAAM,CAAC,IAAMC,EAAU,MAAM,CAAC,EAClD,MAAM,IAAI,MACN,gEAAgE,EAEtE,GAAI92C,GAAc82C,EAAU,KAAK,GAAKR,GACpC,MAAM,IAAI,MAAM,qCAAA,OAAqCA,EAAS,CAAE,EAElE,GAAIO,EAAkB,MAAM,CAAC,GAAKP,GAChC,MAAM,IAAI,MAAM,oCAAA,OACZA,GAAwC,8BAAA,EAAA,OAAAO,EAAkB,MAAM,CAAC,CAAC,CAAE,EAG1E,IAAM/6B,EAA6B,CACjC,eAAgB+6B,EAChB,OAAQC,GAEJtxB,EAA2B,CAAC,KAAIoI,CAAA,EAEtC,OAAOxI,EAAO,UAAUxV,GAAckM,EAAc0J,CAAW,CACjE,CAEO,IAAMuxB,GAA+B76C,EAAG,CAAC,cAAaq6C,EAAA,CAAC,EC/C9C,SAAAS,GACZR,EAAmC74C,EAAyB,CAC9D,OAAOo5C,GAAaP,EAAgB74C,EAAQ,MAAM,CACpD,CChBA,SAASs5C,GACLx4C,EAAiBy/B,EACjB36B,EACAsc,EACAqiB,EAAwC,CAC1C,IAAMrH,EAAK/P,EAAgBrsB,EAAG,IAAK,SAAS,EACtCi/B,EAAY,EAEd8E,EAAM3H,EACN4H,EAAe,GACf5H,EAAG,OAAS,IACd4H,EAAe,GACfD,EAAMH,EAAQxH,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAG9D7Z,EACIwhB,EAAI,OAAS,EACb,UAAA,CAAM,MAAA,uDAAA,OAAuDA,EAAI,KAAI,GAAA,CAA/D,CAAkE,EAC5ExhB,EACIuhB,GAAyCh/B,EAASm6B,CAAS,EAC3D,UAAA,CAAM,MAAA,4DACF,eAAA,OAAen6B,EAA0B,kBAAA,EAAA,OAAAm6B,EAAS,GAAA,CADhD,CACmD,EAC7DgF,GAAoC,UAAW7iB,EAAKqiB,CAAe,EACnE,IAAMpmB,EAAwB,CAAC,EAAG0mB,CAAG,EAC/Bhd,EAAsB,CAAC,WAAU0Y,EAAE,QAAO36B,EAAE,IAAGsc,EAAE,gBAAeqiB,CAAA,EAGhE/pB,EAAMiN,EAAO,UACHnY,GAAS6O,EACT0J,CAAgC,EAEhD,OAAIid,EACKJ,EAAQlqB,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAEzDA,CACT,CAEO,IAAM++B,GAA0Bh7C,EAAG,CAAC,SAAQ+6C,EAAA,CAAC,EC3BpD,SAASE,GACL14C,EAAiBy/B,EACjB36B,EAA0Csc,EAC1CqiB,EACAzE,EAAqC,CAHpBS,IAAA,SAAAA,EAA+C,CAAA,EAAG,EAAG,CAAC,GAGvET,IAAA,SAAAA,EAAqC,SACvC,IAAM5C,EAAK/P,EAAgBrsB,EAAG,IAAK,WAAW,EAE1CokC,EAAMhI,EACNiI,EAAe,GACfjI,EAAG,OAAS,IACdiI,EAAe,GACfD,EAAMR,EAAQxH,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAG3E7Z,EACI6hB,EAAI,OAAS,EACb,UAAA,CAAM,MAAA,qDAAA,OAAqDA,EAAI,KAAI,GAAA,CAA7D,CAAgE,EAC1E7hB,EACIyc,IAAe,QACf,UAAM,CAAA,MAAA,0DACF,yBAAA,OAAyBA,CAAU,CADjC,CACmC,EAC7CuE,GAA0B,YAAaniB,EAAKqiB,CAAe,EAC3D,IAAMpmB,EAA0B,CAAC,EAAG+mB,CAAG,EACjCrd,EACe,CAAC,WAAU0Y,EAAE,QAAO36B,EAAE,IAAGsc,EAAE,gBAAeqiB,EAAE,WAAUzE,CAAA,EAGrEtlB,EAAMiN,EAAO,UACHjY,GAAW2O,EACX0J,CAAgC,EAEhD,OAAIsd,EACKT,EACIlqB,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAInEA,CACT,CAEO,IAAMi/B,GAA4Bl7C,EAAG,CAAC,WAAUi7C,EAAA,CAAC,EC7CxD,SAASE,GACL54C,EAAiBy/B,EACjB36B,EAAkCsc,EAClCy3B,EAA2B,CAA3BA,IAAA,SAAAA,EAA2B,IAC7B,IAAMzc,EAAK/P,EAAgBrsB,EAAG,IAAK,mBAAmB,EAEhDqd,EAAkC,CAAC,EAAG+e,CAAE,EACxCrV,EACuB,CAAC,WAAU0Y,EAAE,QAAO36B,EAAE,IAAGsc,EAAE,oBAAmBy3B,CAAA,EAGrE/7C,EAAS6pB,EAAO,UACH/X,GAAmByO,EACnB0J,CAAgC,EAEnD,MAAO,CAAC,OAAQjqB,EAAO,CAAC,EAAG,QAASA,EAAO,CAAC,CAAC,CAC/C,CAEO,IAAMg8C,GAAoCr7C,EAAG,CAAC,mBAAkBm7C,EAAA,CAAC,ECtBxE,SAASG,GACLp4C,EAAsB9E,EAAoB,OACxC8gC,EAAKtQ,EAAgB1rB,EAAG,IAAK,SAAS,EACtCi8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,SAAS,EAC1CmL,EAAAjJ,EAAW4mB,GAAegY,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAE31B,EAAA,CAAA,EAAE41B,EAAE51B,EAAA,CAAA,EAEH21B,EAAG,QAAU,SACfA,EAAKL,GAAKK,EAAI,OAAO,EACrBC,EAAKN,GAAKM,EAAI,OAAO,GAEvB0Q,GAA2B3Q,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMvf,EAAwB,CAAC,EAAGsf,EAAI,EAAGC,CAAE,EAE3C,OAAOjW,EAAO,UAAUpY,GAAS8O,CAAmC,CACtE,CAEO,IAAM27B,GAA0Bv7C,EAAG,CAAC,SAAQs7C,EAAA,CAAC,ECjBpD,SAASE,GACLj5C,EAAsBkD,EAA8B06B,EAAgB,CAA9C16B,IAAA,SAAAA,EAA4B,MAAE06B,IAAA,SAAAA,EAAgB,IACtE,IAAMxB,EAAK/P,EAAgBrsB,EAAG,IAAK,MAAM,EAEnCqd,EAAqB,CAAC,EAAG+e,CAAE,EAC3BrV,EAAmB,CAAC,KAAI7jB,EAAE,SAAQ06B,CAAA,EAExC,OAAOjX,EAAO,UACV9X,GAAMwO,EACN0J,CAAgC,CACtC,CAEO,IAAM4f,GAAuBlpC,EAAG,CAAC,MAAKw7C,EAAA,CAAC,EC/B9B,SAAA3K,GACZnvC,EAAoBC,EAA2B,CAEjD,GAFsBA,IAAA,SAAAA,EAA2B,WACjD2G,GAAmC5G,CAAK,EACpCC,IAAU,YAAa,CACzB,IAAM6tB,EAAOqhB,GAAMnvC,EAAO,SAAS,EAC7B+tB,EAAOohB,GAAMnvC,EAAO,SAAS,EACnC,OAAOmuB,GAAQL,EAAMC,CAAI,CAC1B,CACD,IAAMhuB,EAASyG,GAAoBpE,GAAcpC,CAAK,EAAGC,CAAK,EAC9D,OAAOunB,EAAO,WAAWznB,EAAQC,EAAOC,CAAK,CAC/C,CCTgB,SAAAmrB,GACZprB,EAAoBC,EAA2B,CAEjD,GAFsBA,IAAA,SAAAA,EAA2B,WACjD2G,GAAmC5G,CAAK,EACpCC,IAAU,YAAa,CACzB,IAAM6tB,EAAO1C,GAAKprB,EAAO,SAAS,EAC5B+tB,EAAOohB,GAAMnvC,EAAO,SAAS,EACnC,OAAOmuB,GAAQL,EAAMC,CAAI,CAC1B,CACD,IAAMhuB,EAASwG,GAAmBnE,GAAcpC,CAAK,EAAGC,CAAK,EAC7D,OAAOunB,EAAO,WAAWznB,EAAQC,EAAOC,CAAK,CAC/C,UCQgB85C,GACZl5C,EAAkB5C,EAAkB4J,EAAsB,KAAtBC,EAAoBD,IAAA,OAAA,CAAA,EAAEA,EAArBE,EAAAD,EAAA,SAAAkyC,EAAQjyC,IAAA,OAAG,KAAIA,EACtD,GAAIiyC,IAAa,MAAQA,IAAa,KACpC,MAAM,IAAI,UACN,GAAA,OAAGA,EAAQ,4CAAA,CAA4C,EAE7D,GAAIn5C,IAAM,OACR,MAAO,CAAA,EAET,IAAIo8B,EAAK/P,EACLrsB,EAAG,IAAK,WAAYA,aAAamjB,GAASnjB,EAAE,MAAQ,SAAS,EAEjE,GAAI5C,IAAM,OACR,MAAO,CAACg/B,CAAE,EAEZ,IAAI2L,EAAK1b,EACLjvB,EAAG,IAAK,WAAYA,aAAa+lB,GAAS/lB,EAAE,MAAQ,SAAS,EAE3Dke,EAAI/Z,GAAc66B,EAAG,KAAK,EAC1BxgB,EAAIra,GAAcwmC,EAAG,KAAK,EAEhC,OAAIoR,IAAa,MACf/c,EAAKwH,EAAQxH,EAAI,CAAC,EAAG,EAAE,CAAC,EACxB2L,EAAKnE,EAAQmE,EAAI,CAAC,GAAI,CAAC,CAAC,EACjB,CACLlD,GAAOta,GAAK,CAAC3O,EAAG,CAAC,EAAGwgB,EAAG,KAAK,EAAGA,CAAE,EACjCyI,GAAOkD,EAAIxd,GAAK,CAAC,EAAGjP,CAAC,EAAGysB,EAAG,KAAK,CAAC,KAIrC3L,EAAKwH,EAAQxH,EAAI,CAAC,GAAI,CAAC,CAAC,EACxB2L,EAAKnE,EAAQmE,EAAI,CAAC,EAAG,EAAE,CAAC,EACjB,CACLlD,GAAOzI,EAAI7R,GAAK,CAAC,EAAG3O,CAAC,EAAGwgB,EAAG,KAAK,CAAC,EACjCyI,GAAOta,GAAK,CAACjP,EAAG,CAAC,EAAGysB,EAAG,KAAK,EAAGA,CAAE,GAErC,CCpCA,SAASqR,GACLz4C,EAAsB9E,EAAoB,OACxC8gC,EAAKtQ,EAAgB1rB,EAAG,IAAK,SAAS,EACtCi8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,SAAS,EAC1CmL,EAAAjJ,EAAW4mB,GAAegY,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAE31B,EAAA,CAAA,EAAE41B,EAAE51B,EAAA,CAAA,EAEH21B,EAAG,QAAU,SACfA,EAAKL,GAAKK,EAAI,OAAO,EACrBC,EAAKN,GAAKM,EAAI,OAAO,GAGvB0Q,GAA2B3Q,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMvf,EAAwB,CAAC,EAAGsf,EAAI,EAAGC,CAAE,EAE3C,OAAOjW,EAAO,UAAU5X,GAASsO,CAAmC,CACtE,CAEO,IAAMg8B,GAA0B57C,EAAG,CAAC,SAAQ27C,EAAA,CAAC,ECrBpD,SAASE,GACLt5C,EAAiBu5C,EACjBC,EAA2B,CAC7Bj3B,EACIi3B,IAAS,WAAaA,IAAS,YAC/B,UAAA,CAAM,MAAA,2DACF,OAAA,OAAOA,EAAI,GAAA,CADT,CACY,EAEtB,IAAMpd,EAAK/P,EAAgBrsB,EAAG,IAAK,WAAW,EAC9C,GAAIo8B,EAAG,OAAS,EACd,MAAM,IAAI,MACN,gEAC8B,EAEpC7Z,EACIg3B,EAAS,SAAWnd,EAAG,KACvB,UAAM,CAAA,MAAA,wCAAA,OAAwCA,EAAG,KAAQ,IAAA,EACrD,OAAA,OAAOmd,EAAS,OAAM,GAAA,CADpB,CACuB,EAEjC,QADME,EAAcD,IAAS,UAAY,EAAI,aACpC17C,EAAC,CACRykB,EACIg3B,EAASz7C,CAAC,EAAE,SAAW,EACvB,UAAM,CAAA,MAAA,uDAAA,CAAuD,EACjEykB,EACIg3B,EAASz7C,CAAC,EAAE,CAAC,GAAK,GAAKy7C,EAASz7C,CAAC,EAAE,CAAC,GAAKs+B,EAAG,MAAMt+B,CAAC,EAAI27C,GACnDF,EAASz7C,CAAC,EAAE,CAAC,GAAK,GAAKy7C,EAASz7C,CAAC,EAAE,CAAC,GAAKs+B,EAAG,MAAMt+B,CAAC,EAAI27C,EAC3D,UAAA,CAAM,MAAA,wBAAA,OAAwB37C,EAAoC,mCAAA,EAC9D,MAAM,OAAAs+B,EAAG,MAAMt+B,CAAC,EAAI27C,EAA0C,+BAAA,EAC9D,SAAA,OAASrd,EAAG,KAAK,CAFf,CAEiB,GATpBt+B,EAAI,EAAGA,EAAIs+B,EAAG,KAAMt+B,MAApBA,CAAC,EAYV,IAAMipB,EAAwB,CAAC,SAAQwyB,EAAE,KAAIC,CAAA,EACvCn8B,EAA0B,CAAC,EAAG+e,CAAE,EACtC,OAAOzV,EAAO,UACV3X,GAAWqO,EACX0J,CAAgC,CACtC,CAEO,IAAM2yB,GAA4Bj8C,EAAG,CAAC,WAAU67C,EAAA,CAAC,ECpCxD,SAASK,GAAuBh5C,EAAsB9E,EAAoB,OACpE8gC,EAAKtQ,EAAgB1rB,EAAG,IAAK,KAAK,EAClCi8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,KAAK,EACtCmL,EAAAjJ,EAAW4mB,GAAegY,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAE31B,EAAA,CAAA,EAAE41B,EAAE51B,EAAA,CAAA,EAEP,IAAMqW,EAAoB,CAAC,EAAGsf,EAAI,EAAGC,CAAE,EAEvC,OAAOjW,EAAO,UAAU1X,GAAKoO,CAAmC,CAClE,CAEO,IAAMu8B,GAAsBn8C,EAAG,CAAC,KAAIk8C,EAAA,CAAC,ECrB5C,SAASE,GACL75C,EAAsBkD,EACtB06B,EAAgB,CADM16B,IAAA,SAAAA,EAA4B,MAClD06B,IAAA,SAAAA,EAAgB,IAClB59B,EAAIqsB,EAAgBrsB,EAAG,IAAK,SAAS,EACrC,IAAMwD,EAAOP,GAAeC,EAAMlD,EAAE,KAAK,EACnC85C,EAAQnT,GAAK3mC,EAAGwD,EAAMo6B,CAAQ,EAChCmU,EAAgB+H,EAAM,MACrBlc,IACHmU,EAAgBzB,GAAqBwJ,EAAM,MAAOt2C,CAAI,GAExD,IAAMu2C,EACFtI,GAAOkF,GAAIra,GAAKt8B,EAAG,SAAS,EAAG4jC,EAAQkW,EAAO/H,CAAa,CAAC,CAAC,EAC3DnL,EAAWD,GAAKoT,EAAYv2C,EAAMo6B,CAAQ,EAChD,MAAO,CAAC,KAAMkc,EAAO,SAAQlT,CAAA,CAC/B,CAEO,IAAMoT,GAA0Bv8C,EAAG,CAAC,SAAQo8C,EAAA,CAAC,EChBpD,SAASI,GACLC,EAA2Bz0C,EAC3BH,EACAsW,EAA6B,CAO/B,QANM8pB,EAAQrZ,EAAgB5mB,EAAM,OAAQ,cAAc,EACpDkgC,EAAKlZ,GAAqBnnB,EAAG,IAAK,cAAc,EAChDsgC,EAAKnZ,GAAqB7Q,EAAG,IAAK,cAAc,EAElD6C,EAAQinB,EACNyU,EAAY,CAAA,EACTr8C,EAAI,EAAGA,EAAIo8C,EAAU,OAAQp8C,IAAK,CACzC,IAAM8f,EAASs8B,EAAUp8C,CAAC,EAAE2gB,EAAOknB,EAAG7nC,CAAC,EAAG8nC,EAAG9nC,CAAC,CAAC,EAC/Cq8C,EAAU,KAAKv8B,EAAO,CAAC,CAAC,EACxBu8B,EAAU,KAAKv8B,EAAO,CAAC,CAAC,EACxBa,EAAQb,EAAO,CAAC,CACjB,CAGD,QAFMqoB,EAAmB,CAAA,EACnBC,EAAmB,CAAA,EAChBpoC,EAAI,EAAGA,EAAIq8C,EAAU,OAAQr8C,GAAK,EACzCmoC,EAAK,KAAKkU,EAAUr8C,CAAC,CAAC,EACtBooC,EAAK,KAAKiU,EAAUr8C,EAAI,CAAC,CAAC,EAE5B,MAAO,CAACmoC,EAAMC,CAAI,CACpB,CACO,IAAMkU,GAA+B38C,EAAG,CAAC,cAAaw8C,EAAA,CAAC,ECpB9D,SAASI,GACLxD,EAAsCyD,EAAoBx+B,EAC1Dy+B,EAAkB,CAAlBA,IAAA,SAAAA,EAAkB,IACpB,IAAMzD,EAAUzqB,EAAgBwqB,EAAQ,SAAU,aAAa,EACzD2D,EAAc1D,EAAQ,KACtB2D,EAAW3D,EAAQ,KACzB,GAAI0D,EAAc,EAChB,MAAM,IAAI,MACN,+DACA,GAAG,OAAAA,EAAc,GAAA,CAAA,EAEvB,GAAIC,EAAW,EACb,MAAM,IAAI,MAAM,gDAAA,OAAgDA,CAAQ,CAAE,EAI5E3+B,EAAOA,GAAQ,KAAK,OAAM,EAG1B,IAAM4+B,EACFD,IAAa,EAAI7W,EAAQkT,EAAS,CAAC,EAAG,EAAE,CAAC,EAAIA,EAE3Cz5B,EAA4B,CAAC,OAAQq9B,CAAQ,EAC7C3zB,EAA0B,CAAC,WAAUuzB,EAAE,KAAIx+B,EAAE,WAAUy+B,CAAA,EAGvD7gC,EAAMiN,EAAO,UACHzX,GAAamO,EACb0J,CAAgC,EAGhD,OAAO0zB,IAAa,EAAI7W,EAAQlqB,EAAK,CAACA,EAAI,IAAI,CAAC,EAAgBA,CACjE,CAEO,IAAMihC,GAA8Bl9C,EAAG,CAAC,aAAY48C,EAAA,CAAC,ECzC5D,SAASO,GACLj6C,EAAsB9E,EAAoB,OACxC8gC,EAAKtQ,EAAgB1rB,EAAG,IAAK,WAAY,mBAAmB,EAC5Di8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,WAAY,mBAAmB,EAChEmL,EAAAjJ,EAAW4mB,GAAegY,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAE31B,EAAA,CAAA,EAAE41B,EAAE51B,EAAA,CAAA,EAEPsmC,GAA2B3Q,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMvf,EAAyB,CAAC,EAAGsf,EAAI,EAAGC,CAAE,EAE5C,OAAOjW,EAAO,UAAUtX,GAAUgO,CAAmC,CACvE,CAEO,IAAMw9B,GAA2Bp9C,EAAG,CAAC,UAASm9C,EAAA,CAAC,ECHtD,SAASE,GACLhvB,EAA4BivB,EAAeC,EAAaC,EACxD77C,EAAyB,CAC3B,GAF6C47C,IAAA,SAAAA,EAAW,GAAEC,IAAA,SAAAA,EAAY,GACpE77C,IAAA,SAAAA,EAAyB,SACvB27C,EAAQ,EACV,MAAM,IAAI,MAAM,iDAAA,OAAiDA,CAAK,CAAE,EAE1E,IAAM3H,EAAW/mB,EAAgBP,EAAS,UAAW,SAAU,OAAO,EAEhEzO,EAAuB,CAAC,QAAS+1B,CAAQ,EACzCrsB,EAAqB,CAAC,MAAK3nB,EAAE,MAAK27C,EAAE,QAAOC,EAAE,SAAQC,CAAA,EAE3D,OAAOt0B,EAAO,UACVjX,GAAQ2N,EACR0J,CAAgC,CACtC,CAEO,IAAMm0B,GAAyBz9C,EAAG,CAAC,QAAOq9C,EAAA,CAAC,EC7BlD,SAASK,GAA4Bn7C,EAAe,CAClD,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,UAAU,EAEvCqd,EAAyB,CAAC,EAAG+e,CAAE,EACrC,OAAOzV,EAAO,UAAUlX,GAAU4N,CAAmC,CACvE,CAEO,IAAM+9B,GAA2B39C,EAAG,CAAC,UAAS09C,EAAA,CAAC,ECNtD,SAASE,GACLC,EAAyBC,EAAuB,CAClD,IAAMC,EAAMnvB,EAAgBivB,EAAI,KAAM,cAAc,EAC9CG,EAAMpvB,EAAgBkvB,EAAI,KAAM,cAAc,EAEpDh5B,EACIi5B,EAAI,OAAS,GAAKC,EAAI,OAAS,EAC/B,UAAA,CAAM,MAAA,+DACF,GAAG,OAAAD,EAAI,KAAY,OAAA,EAAA,OAAAC,EAAI,KAAO,GAAA,CAAA,CAAA,EAEtC,IAAMC,EAAO9X,EAAQ4X,EAAK,CAAC,GAAI,CAAC,CAAC,EAC3BG,EAAO/X,EAAQ6X,EAAK,CAAC,EAAG,EAAE,CAAC,EACjC,OAAO5W,GAAO6W,EAAMC,CAAI,CAC1B,CAEO,IAAMC,GAA+Bn+C,EAAG,CAAC,cAAa49C,EAAA,CAAC,ECF9D,SAASQ,GACL77C,EAAiBu5C,EAAmCuC,EAAiB,CAAjBA,IAAA,SAAAA,EAAiB,GACvE,IAAM1f,EAAK/P,EAAgBrsB,EAAG,IAAK,KAAK,EACxC,GAAIo8B,EAAG,OAAS,EACd,MAAM,IAAI,MAAM,oDAAoD,EAGtE,IAAMrV,EAAoB,CAAC,SAAQwyB,EAAE,cAAauC,CAAA,EAC5Cz+B,EAAsB,CAAC,EAAG+e,CAAE,EAClC,OAAOzV,EAAO,UACV/W,GAAOyN,EACP0J,CAAgC,CACtC,CAEO,IAAM3F,GAAsB3jB,EAAG,CAAC,KAAIo+C,EAAA,CAAC,ECzC5C,SAASE,GACL/7C,EAAwBu5C,EACxBuC,EAAiB,CAAjB,OAAAA,IAAA,SAAAA,EAAiB,GACnBh7C,EACIy4C,EAAS,SAAW,EACpB,UAAA,CAAM,MAAA,kDAAA,CAAkD,EACrDn4B,GAAIphB,EAAG,CAACu5C,CAAQ,EAAGuC,CAAa,CACzC,CAEO,IAAME,GAAwBv+C,EAAG,CAAC,OAAMs+C,EAAA,CAAC,ECThD,SAASE,GACLj8C,EAAwBu5C,EACxBuC,EAAiB,CAAjB,OAAAA,IAAA,SAAAA,EAAiB,GACnBh7C,EACIy4C,EAAS,SAAW,GAAKA,EAAS,CAAC,EAAE,SAAW,GAC5CA,EAAS,CAAC,EAAE,SAAW,EAC3B,UAAA,CAAM,MAAA,uDAAA,CAAuD,EAC1Dn4B,GAAIphB,EAAGu5C,EAAUuC,CAAa,CACvC,CAEO,IAAMI,GAAwBz+C,EAAG,CAAC,OAAMw+C,EAAA,CAAC,ECVhD,SAASE,GACLn8C,EACAu5C,EACAuC,EAAiB,CAAjB,OAAAA,IAAA,SAAAA,EAAiB,GACnBh7C,EACIy4C,EAAS,SAAW,GAAKA,EAAS,CAAC,EAAE,SAAW,GAC5CA,EAAS,CAAC,EAAE,SAAW,GAAKA,EAAS,CAAC,EAAE,SAAW,EACvD,UAAA,CAAM,MAAA,uDAAuD,CAAA,EAC1Dn4B,GAAIphB,EAAGu5C,EAAUuC,CAAa,CACvC,CAEO,IAAMM,GAAwB3+C,EAAG,CAAC,OAAM0+C,EAAA,CAAC,ECXhD,SAASE,GACLr8C,EACAu5C,EAIAuC,EAAiB,CAAjB,OAAAA,IAAA,SAAAA,EAAiB,GACnBh7C,EACIy4C,EAAS,SAAW,GAAKA,EAAS,CAAC,EAAE,SAAW,GAC5CA,EAAS,CAAC,EAAE,SAAW,GAAKA,EAAS,CAAC,EAAE,SAAW,GACnDA,EAAS,CAAC,EAAE,SAAW,EAC3B,UAAA,CAAM,MAAA,uDAAA,CAAuD,EAC1Dn4B,GAAIphB,EAAGu5C,EAAUuC,CAAa,CACvC,CAEO,IAAMQ,GAAwB7+C,EAAG,CAAC,OAAM4+C,EAAA,CAAC,ECoChD,SAASE,GACLv8C,EAAiBqmC,EAAsBkT,EAAoB,CAC7D,IAAMnd,EAAK/P,EAAgBrsB,EAAG,IAAK,gBAAgB,EAEnDuiB,EACI6Z,EAAG,MAAQ,EAAIiK,EAAW,OAC1B,UAAM,CAAA,MAAA,cAAc,OAAAjK,EAAG,KACnB,iCAAA,EAAA,OAAAiK,EAAW,MAAM,CAAE,CAAA,EAE3B9jB,EACIg3B,EAAS,SAAWlT,EAAW,OAC/B,UAAA,CAAM,MAAA,qBACF,OAAAkT,EAAS,OAAwC,iCAAA,EAAA,OAAAlT,EAAW,MAAM,CAAE,CAAA,EAE5E9jB,EACI6Z,EAAG,MAAM,OACL,SAACz7B,EAAG9E,EAAGiC,EAAC,CACN,OAAIA,EAAI,GAAKA,GAAKuoC,EAAW,OACpB1lC,IACD9E,EAAI09C,EAASz7C,EAAI,CAAC,EAAE,CAAC,EAAIy7C,EAASz7C,EAAI,CAAC,EAAE,CAAC,GACvCuoC,EAAWvoC,EAAI,CAAC,IACpB,EAEA6C,CACT,EACA,EAAI,EACR,UAAM,CAAA,MAAA,4BAA4B,OAAAy7B,EAAG,MAAM,MAAM,CAAC,EAAC,iBAAA,EAAA,OAC/Cmd,EAAS,SAAQ,EACjB,oCAAA,EAAA,OAAAlT,EAAW,SAAQ,CAAE,CAFnB,CAEqB,EAE/B,IAAMhpB,EAA+B,CAAC,EAAG+e,CAAE,EACrCrV,EAA6B,CAAC,WAAUsf,EAAE,SAAQkT,CAAA,EAExD,OAAO5yB,EAAO,UACV7U,GAAgBuL,EAChB0J,CAAgC,CACtC,CAEO,IAAMy1B,GAAiC/+C,EAAG,CAAC,gBAAe8+C,EAAA,CAAC,ECxDlE,SAASE,GACLh+B,EAAqBi+B,EACrBC,EACAv7B,EACA6d,EAAqCn6B,EACrC2+B,EAAwC,CACtCxE,GAAa,OACfA,EAAY,CAAC,EAAG,CAAC,GAEfn6B,GAAW,OACbA,EAAU,GAERsc,IAAQ,IACVA,EAAM,SAGR,IAAMgb,EAAK/P,EAAgB5N,EAAO,IAAK,SAAS,EAC5CslB,EAAM3H,EACN4H,EAAe,GAEf5H,EAAG,OAAS,IACd4H,EAAe,GACfD,EAAMH,EAAQxH,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAG9D7Z,EACIuhB,GAAyCh/B,EAASm6B,CAAS,EAC3D,UAAA,CAAM,MAAA,yDACF,eAAA,OAAen6B,EAA0B,kBAAA,EAAA,OAAAm6B,EAAS,GAAA,CADhD,CACmD,EAE7D,IAAM2d,EAAWC,GACb9Y,EAAI,MAAO2Y,EAAa53C,EAASm6B,EAAW7d,CAAG,EAC7CkhB,EACF,CAACsa,EAAS,eAAgBA,EAAS,aAAa,EAOhDE,EACA17B,IAAQ,OACV07B,EAAcC,GACV,CAACH,EAAS,aAAcA,EAAS,WAAW,EAAGta,CAAQ,EAE3Dwa,EAAc,CAAC,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,CAAC,EAG/B,IAAME,EAAgB1a,EAAS,CAAC,IAAM,GAAKA,EAAS,CAAC,IAAM,EACrDt7B,EAAAjJ,EAAmCk/C,GACrC,CAACL,EAAS,SAAUA,EAAS,OAAO,EAAGta,EAAUwa,CAAW,EAAC,CAAA,EAD1DI,EAAel2C,EAAA,CAAA,EAAEm2C,EAAan2C,EAAA,CAAA,EAE/Bo2C,EAAeJ,EAAgB57B,EAAM,QACrCi8B,EACFL,EAAgBjZ,EAAMyY,GAAezY,EAAKzB,EAAU4a,CAAe,EAEjEI,EAAYX,IAAgB,MAC9B,UAAA,CAAM,OAAAzY,GAAQmZ,EAAYX,EAAa53C,EAASs4C,EAClC3Z,CAAe,CADvB,EAEN,UAAA,CAAM,OAAAgV,GAAQ4E,EAAYX,EAAa53C,EAASs4C,EAClC3Z,CAAe,CAAC,EAC5BrmC,EAAIkgD,EAAS,EAEb5jC,EAAMsjC,EAAgB5/C,EAAIopC,GAAeppC,EAAGklC,EAAU6a,CAAa,EAEzE,OAAInZ,EACKJ,EAAQlqB,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAGzDA,CACT,CAKA,SAASujC,GACLv+B,EAA8B2nB,EAC9ByW,EAAuB,CACzB,IAAMS,EAAWT,EAAY,IAAI,SAAAjhD,EAAK,CAAA,OAAAA,EAAE,CAAC,CAAH,CAAI,EACpC2hD,EAAaV,EAAY,IAAI,SAAAjhD,EAAK,CAAA,OAAAA,EAAE,CAAC,CAAH,CAAI,EACtC4hD,EAAiB/+B,EAAW,OAAO6+B,EAAUC,CAAU,EACvDE,EAAcrX,EAAW,IAAI,SAACxqC,EAAGiC,EAAC,CAAK,OAACjC,EAAI4hD,EAAe3/C,CAAC,EAAIjC,GAAKA,CAAC,CAAA,EACtE8hD,EAASH,EAAW,IAAI,SAAC5/C,EAAGE,EAAC,CAAK,OAAAF,EAAI8/C,EAAY5/C,CAAC,CAAC,CAAA,EACpDy7C,EAAWlT,EAAW,IAAI,SAACppC,EAAGa,EAAC,CAAK,MAAA,CAACy/C,EAASz/C,CAAC,EAAG6/C,EAAO7/C,CAAC,CAAC,CAAC,CAAA,EAC5DwoC,EAAQD,EAAW,IAAI,SAACppC,EAAGa,EAAC,CAAK,MAAA,CAAC,EAAG4/C,EAAY5/C,CAAC,CAAC,CAAC,CAAA,EAC1D,MAAO,CAACy7C,EAAUjT,CAAK,CACzB,CAKA,SAASyW,GACLhe,EAA+BuD,EAA0B,CAG3D,IAAMsb,EAAqB7e,EAAY,IAAI,SAACnhC,EAAG,EAAC,CAC9C,OAAOA,GAAKA,EAAI,IAAM0kC,EAAS,CAAC,EAAI,EACtC,CAAC,EACKub,EAAgBD,EAAmB,IAAI,SAAAhgD,EAAK,CAAA,OAAAA,EAAI,CAAJ,CAAK,EAIjDkgD,EAAgBD,EAAc,IAAI,SAAAjgD,EAAK,CAAA,OAAA,KAAK,MAAMA,EAAI,CAAC,CAAC,CAAA,EACxDmgD,EAAcF,EAAc,IAAI,SAACjgD,EAAG,EAAC,CAAK,OAAAA,EAAIkgD,EAAc,CAAC,CAAC,CAAA,EACpE,OAAOD,EAAc,IAAI,SAAC5gD,EAAG,EAAC,CAC5B,MAAO,CAAC6gD,EAAc,CAAC,EAAGC,EAAY,CAAC,CAAC,CAC1C,CAAC,CACH,CAEO,IAAMC,GAAuBvgD,EAAG,CAAC,MAAKg/C,EAAA,CAAC,EC5H9C,SAASwB,GAAyBj+C,EAAiBm0C,EAAmB,CACpE,IAAM/X,EAAK/P,EAAgBrsB,EAAG,IAAK,OAAO,EACpCk+C,EAAS7xB,EAAgB8nB,EAAO,QAAS,OAAO,EAEhD92B,EAAsB,CAAC,EAAG+e,EAAI,MAAO8hB,CAAM,EACjD,OAAOv3B,EAAO,UAAU5W,GAAOsN,CAAmC,CACpE,CAEO,IAAM8gC,GAAwB1gD,EAAG,CAAC,OAAMwgD,EAAA,CAAC,ECQhD,SAASG,GACLp+C,EAAsBkD,EAA8B06B,EAAgB,CAA9C16B,IAAA,SAAAA,EAA4B,MAAE06B,IAAA,SAAAA,EAAgB,IACtE,IAAIxB,EAAK/P,EAAgBrsB,EAAG,IAAK,MAAM,EAEnCo8B,EAAG,QAAU,SAEfA,EAAKE,GAAKF,EAAI,OAAO,GAGvB,IAAM/e,EAAqB,CAAC,EAAG+e,CAAE,EAC3BrV,EAAmB,CAAC,KAAI7jB,EAAE,SAAQ06B,CAAA,EAExC,OAAOjX,EAAO,UACV3W,GAAMqN,EACN0J,CAAgC,CACtC,CAEO,IAAMwf,GAAuB9oC,EAAG,CAAC,MAAK2gD,EAAA,CAAC,ECzB9C,SAASC,GACLC,EAA8BC,EAC9BzyB,EAA4B0yB,EAAwB,CACtD,IAAMC,EAAsBH,EAAmB,IAC3C,SAACphD,EAAGY,EAAC,CAAK,OAAAuuB,EAAgBnvB,EAAG,UAAA,OAAUY,CAAC,EAAI,eAAgB,OAAO,CAAC,CAAA,EAClE4gD,EACFryB,EAAgBkyB,EAAmB,oBAAqB,cAAc,EACpEnL,EAAW/mB,EAAgBP,EAAS,UAAW,eAAgB,OAAO,EAEtEzO,EAA6B,CACjC,mBAAoBohC,EACpB,kBAAmBC,EACnB,QAAStL,GAELrsB,EAA2B,CAAC,iBAAgBy3B,CAAA,EAE5C1hD,EACF6pB,EAAO,UAAU1W,GAAcoN,EAAc0J,CAAW,EAC5D,MAAO,CACL,mBAAoBjqB,EAAO,MAAM,EAAGA,EAAO,OAAS,CAAC,EACrD,kBAAmBA,EAAOA,EAAO,OAAS,CAAC,EAE/C,CAEO,IAAM6hD,GAA+BlhD,EAAG,CAAC,cAAa4gD,EAAA,CAAC,EClC9D,SAASO,GACLC,EAA2BC,EAC3BC,EAAyB,CAC3B,IAAMC,EAAU3yB,EAAgBwyB,EAAQ,SAAU,aAAa,EACzDI,EACF5yB,EAAgByyB,EAAQ,SAAU,cAAeE,EAAQ,KAAK,EAC5DE,EACF7yB,EAAgB0yB,EAAQ,SAAU,cAAeC,EAAQ,KAAK,EAE5D3hC,EAA4B,CAChC,OAAQ2hC,EACR,OAAQC,EACR,OAAQC,GAGJpiD,EAAmB6pB,EAAO,UAAUzW,GAAamN,CAAY,EACnE,MAAO,CACL,eAAgBvgB,EAAO,CAAC,EACxB,cAAeA,EAAO,CAAC,EAE3B,CAEO,IAAMqiD,GAA8B1hD,EAAG,CAAC,aAAYmhD,EAAA,CAAC,ECe5D,SAASQ,GACLjgD,EAA0BD,EAC1BmgD,EAAiCC,EACjCC,EAA2B,CAC7B,IAAMC,EACFnzB,EAAgBltB,EAAO,QAAS,uBAAwB,OAAO,EAC7D84C,EAAU5rB,EAAgBntB,EAAQ,SAAU,sBAAsB,EAClEugD,EAAgBpzB,EAClBgzB,EAAc,eAAgB,uBAAwBpH,EAAQ,KAAK,EACjEyH,EAAuBJ,EAAoB,IAC7C,SAACpiD,EAAGY,EAAC,CACD,OAAAuuB,EAAgBnvB,EAAG,UAAA,OAAUY,CAAC,EAAI,uBAAwB,OAAO,CAAC,CAAA,EAEpEuf,EAAqC,CACzC,MAAOmiC,EACP,OAAQvH,EACR,aAAcwH,EACd,oBAAqBC,GAEjB34B,EAAmC,CAAC,kBAAiBw4B,CAAA,EAE3D,OAAO54B,EAAO,UAAUxW,GAAsBkN,EAAc0J,CAAW,CACzE,CAEO,IAAM44B,GAAuCliD,EAAG,CAAC,sBAAqB2hD,EAAA,CAAC,ECjE9E,SAASQ,GACLzgD,EAAoB0gD,EACpBzgD,EAAgB,CAClB2G,GAAmC5G,CAAK,EACxC,IAAMqC,EAAOD,GAAcpC,CAAK,EAC5BD,EAAS,KACb,GAAIE,GAAS,MAAQA,IAAU,UAC7BF,EAAS,IAAI,aAAasC,CAAI,UACrBpC,IAAU,QACnBF,EAAS,IAAI,WAAWsC,CAAI,UACnBpC,IAAU,OACnBF,EAAS,IAAI,WAAWsC,CAAI,MAE5B,OAAM,IAAI,MAAM,qBAAA,OAAqBpC,CAAK,CAAE,EAE9C,QAAStB,EAAI,EAAGA,EAAI0D,EAAM1D,IACxBoB,EAAOpB,CAAC,EAAI+hD,EAAY,EAE1B,OAAOl5B,EAAO,WAAWznB,EAAQC,EAAOC,CAAK,CAC/C,CAEO,IAAM0gD,GAAuBriD,EAAG,CAAC,MAAKmiD,EAAA,CAAC,gCC9B7C,SAASr5C,EAAQw5C,EAAQC,EAAM,CAEhC,SAASC,EAAKnkC,EAAI,CAChB,IAAIokC,EAAK,KAAMC,EAAOC,EAAI,EAE1BF,EAAG,KAAO,UAAA,CACR,IAAIhjD,EAAI,QAAUgjD,EAAG,GAAKA,EAAG,EAAI,sBACjC,OAAAA,EAAG,GAAKA,EAAG,GACXA,EAAG,GAAKA,EAAG,GACJA,EAAG,GAAKhjD,GAAKgjD,EAAG,EAAIhjD,EAAI,EACnC,EAGEgjD,EAAG,EAAI,EACPA,EAAG,GAAKC,EAAK,GAAG,EAChBD,EAAG,GAAKC,EAAK,GAAG,EAChBD,EAAG,GAAKC,EAAK,GAAG,EAChBD,EAAG,IAAMC,EAAKrkC,CAAI,EACdokC,EAAG,GAAK,IAAKA,EAAG,IAAM,GAC1BA,EAAG,IAAMC,EAAKrkC,CAAI,EACdokC,EAAG,GAAK,IAAKA,EAAG,IAAM,GAC1BA,EAAG,IAAMC,EAAKrkC,CAAI,EACdokC,EAAG,GAAK,IAAKA,EAAG,IAAM,GAC1BC,EAAO,KAGT,SAASE,EAAKljD,EAAGD,EAAC,CAChB,OAAAA,EAAE,EAAIC,EAAE,EACRD,EAAE,GAAKC,EAAE,GACTD,EAAE,GAAKC,EAAE,GACTD,EAAE,GAAKC,EAAE,GACFD,EAGT,SAASojD,EAAKxkC,EAAMykC,EAAI,CACtB,IAAIC,EAAK,IAAIP,EAAKnkC,CAAI,EAClB2kC,EAAQF,GAAQA,EAAK,MACrBG,EAAOF,EAAG,KACd,OAAAE,EAAK,MAAQ,UAAA,CAAa,OAAQF,EAAG,KAAI,EAAK,WAAe,CAAE,EAC/DE,EAAK,OAAS,UAAA,CACZ,OAAOA,EAAI,GAAMA,EAAI,EAAK,QAAW,GAAK,qBAC9C,EACEA,EAAK,MAAQA,EACTD,IACE,OAAOA,GAAU,UAAUJ,EAAKI,EAAOD,CAAE,EAC7CE,EAAK,MAAQ,UAAA,CAAa,OAAOL,EAAKG,EAAI,CAAA,CAAE,CAAE,GAEzCE,EAGT,SAASN,GAAI,CACX,IAAI7iD,EAAI,WAEJ4iD,EAAO,SAAS16C,EAAI,CACtBA,EAAO,OAAOA,CAAI,EAClB,QAAS3H,EAAI,EAAGA,EAAI2H,EAAK,OAAQ3H,IAAK,CACpCP,GAAKkI,EAAK,WAAW3H,CAAC,EACtB,IAAI8d,EAAI,mBAAsBre,EAC9BA,EAAIqe,IAAM,EACVA,GAAKre,EACLqe,GAAKre,EACLA,EAAIqe,IAAM,EACVA,GAAKre,EACLA,GAAKqe,EAAI,UACV,CACD,OAAQre,IAAM,GAAK,qBACvB,EAEE,OAAO4iD,EAILJ,GAAUA,EAAO,QACnBA,EAAO,QAAUO,EACRN,GAAUA,EAAO,IAC1BA,EAAO,UAAA,CAAa,OAAOM,CAAK,CAAE,EAElC,KAAK,KAAOA,CAGd,GACEK,GAC+BZ,EAC9B,0DC3GF,SAASx5C,EAAQw5C,EAAQC,EAAM,CAEhC,SAASY,EAAO9kC,EAAI,CAClB,IAAIokC,EAAK,KAAMW,EAAU,GAEzBX,EAAG,EAAI,EACPA,EAAG,EAAI,EACPA,EAAG,EAAI,EACPA,EAAG,EAAI,EAGPA,EAAG,KAAO,UAAA,CACR,IAAIhjD,EAAIgjD,EAAG,EAAKA,EAAG,GAAK,GACxB,OAAAA,EAAG,EAAIA,EAAG,EACVA,EAAG,EAAIA,EAAG,EACVA,EAAG,EAAIA,EAAG,EACHA,EAAG,GAAMA,EAAG,IAAM,GAAMhjD,EAAKA,IAAM,CAC9C,EAEM4e,KAAUA,EAAO,GAEnBokC,EAAG,EAAIpkC,EAGP+kC,GAAW/kC,EAIb,QAASyJ,EAAI,EAAGA,EAAIs7B,EAAQ,OAAS,GAAIt7B,IACvC26B,EAAG,GAAKW,EAAQ,WAAWt7B,CAAC,EAAI,EAChC26B,EAAG,KAAI,EAIX,SAASG,EAAKljD,EAAGD,EAAC,CAChB,OAAAA,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACDD,EAGT,SAASojD,EAAKxkC,EAAMykC,EAAI,CACtB,IAAIC,EAAK,IAAII,EAAO9kC,CAAI,EACpB2kC,EAAQF,GAAQA,EAAK,MACrBG,EAAO,UAAa,CAAA,OAAQF,EAAG,KAAI,IAAO,GAAK,UAAY,EAC/D,OAAAE,EAAK,OAAS,UAAA,CACZ,EACE,KAAI9d,EAAM4d,EAAG,KAAI,IAAO,GACpBM,GAAON,EAAG,KAAI,IAAO,GAAK,WAC1B1jD,GAAU8lC,EAAMke,IAAQ,GAAK,UAC1BhkD,IAAW,GACpB,OAAOA,CACX,EACE4jD,EAAK,MAAQF,EAAG,KAChBE,EAAK,MAAQA,EACTD,IACE,OAAOA,GAAU,UAAUJ,EAAKI,EAAOD,CAAE,EAC7CE,EAAK,MAAQ,UAAA,CAAa,OAAOL,EAAKG,EAAI,CAAA,CAAE,CAAE,GAEzCE,EAGLX,GAAUA,EAAO,QACnBA,EAAO,QAAUO,EACRN,GAAUA,EAAO,IAC1BA,EAAO,UAAA,CAAa,OAAOM,CAAK,CAAE,EAElC,KAAK,OAASA,CAGhB,GACEK,GAC+BZ,EAC9B,0DC1EF,SAASx5C,EAAQw5C,EAAQC,EAAM,CAEhC,SAASY,EAAO9kC,EAAI,CAClB,IAAIokC,EAAK,KAAMW,EAAU,GAGzBX,EAAG,KAAO,UAAA,CACR,IAAIhjD,EAAKgjD,EAAG,EAAKA,EAAG,IAAM,EAC1B,OAAAA,EAAG,EAAIA,EAAG,EAAGA,EAAG,EAAIA,EAAG,EAAGA,EAAG,EAAIA,EAAG,EAAGA,EAAG,EAAIA,EAAG,GACzCA,EAAG,EAAKA,EAAG,EAAI,OAAS,IAC5BA,EAAG,EAAKA,EAAG,EAAKA,EAAG,GAAK,GAAOhjD,EAAKA,GAAK,IAAO,CACxD,EAEEgjD,EAAG,EAAI,EACPA,EAAG,EAAI,EACPA,EAAG,EAAI,EACPA,EAAG,EAAI,EACPA,EAAG,EAAI,EAEHpkC,KAAUA,EAAO,GAEnBokC,EAAG,EAAIpkC,EAGP+kC,GAAW/kC,EAIb,QAASyJ,EAAI,EAAGA,EAAIs7B,EAAQ,OAAS,GAAIt7B,IACvC26B,EAAG,GAAKW,EAAQ,WAAWt7B,CAAC,EAAI,EAC5BA,GAAKs7B,EAAQ,SACfX,EAAG,EAAIA,EAAG,GAAK,GAAKA,EAAG,IAAM,GAE/BA,EAAG,KAAI,EAIX,SAASG,EAAKljD,EAAGD,EAAC,CAChB,OAAAA,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACDD,EAGT,SAASojD,EAAKxkC,EAAMykC,EAAI,CACtB,IAAIC,EAAK,IAAII,EAAO9kC,CAAI,EACpB2kC,EAAQF,GAAQA,EAAK,MACrBG,EAAO,UAAa,CAAA,OAAQF,EAAG,KAAI,IAAO,GAAK,UAAY,EAC/D,OAAAE,EAAK,OAAS,UAAA,CACZ,EACE,KAAI9d,EAAM4d,EAAG,KAAI,IAAO,GACpBM,GAAON,EAAG,KAAI,IAAO,GAAK,WAC1B1jD,GAAU8lC,EAAMke,IAAQ,GAAK,UAC1BhkD,IAAW,GACpB,OAAOA,CACX,EACE4jD,EAAK,MAAQF,EAAG,KAChBE,EAAK,MAAQA,EACTD,IACE,OAAOA,GAAU,UAAUJ,EAAKI,EAAOD,CAAE,EAC7CE,EAAK,MAAQ,UAAA,CAAa,OAAOL,EAAKG,EAAI,CAAA,CAAE,CAAE,GAEzCE,EAGLX,GAAUA,EAAO,QACnBA,EAAO,QAAUO,EACRN,GAAUA,EAAO,IAC1BA,EAAO,UAAA,CAAa,OAAOM,CAAK,CAAE,EAElC,KAAK,OAASA,CAGhB,GACEK,GAC+BZ,EAC9B,0DC7EF,SAASx5C,EAAQw5C,EAAQC,EAAM,CAEhC,SAASY,EAAO9kC,EAAI,CAClB,IAAIokC,EAAK,KAGTA,EAAG,KAAO,UAAA,CAER,IAAIa,EAAIb,EAAG,EAAGpiD,EAAIoiD,EAAG,EAAGhjD,EAAGM,EAC3B,OAAAN,EAAI6jD,EAAEjjD,CAAC,EAAGZ,GAAMA,IAAM,EAAIM,EAAIN,EAAKA,GAAK,GACxCA,EAAI6jD,EAAGjjD,EAAI,EAAK,CAAC,EAAGN,GAAKN,EAAKA,IAAM,GACpCA,EAAI6jD,EAAGjjD,EAAI,EAAK,CAAC,EAAGN,GAAKN,EAAKA,IAAM,EACpCA,EAAI6jD,EAAGjjD,EAAI,EAAK,CAAC,EAAGN,GAAKN,EAAKA,GAAK,EACnCA,EAAI6jD,EAAGjjD,EAAI,EAAK,CAAC,EAAGZ,EAAIA,EAAKA,GAAK,GAAKM,GAAKN,EAAKA,GAAK,EACtD6jD,EAAEjjD,CAAC,EAAIN,EACP0iD,EAAG,EAAKpiD,EAAI,EAAK,EACVN,CACX,EAEE,SAASgL,EAAK03C,EAAIpkC,EAAI,CACpB,IAAIrY,EAAMs9C,EAAI,CAAA,EAEd,GAAIjlC,KAAUA,EAAO,GAEfilC,EAAE,CAAC,EAAIjlC,MAIX,KADAA,EAAO,GAAKA,EACPrY,EAAI,EAAGA,EAAIqY,EAAK,OAAQ,EAAErY,EAC7Bs9C,EAAEt9C,EAAI,CAAC,EAAKs9C,EAAEt9C,EAAI,CAAC,GAAK,GACnBqY,EAAK,WAAWrY,CAAC,EAAIs9C,EAAGt9C,EAAI,EAAK,CAAC,GAAK,GAIhD,KAAOs9C,EAAE,OAAS,GAAGA,EAAE,KAAK,CAAC,EAC7B,IAAKt9C,EAAI,EAAGA,EAAI,GAAKs9C,EAAEt9C,CAAC,IAAM,EAAG,EAAEA,EAAE,CAOrC,IANIA,GAAK,EAAOs9C,EAAE,CAAC,EAAI,GAAaA,EAAEt9C,CAAC,EAEvCy8C,EAAG,EAAIa,EACPb,EAAG,EAAI,EAGFz8C,EAAI,IAAKA,EAAI,EAAG,EAAEA,EACrBy8C,EAAG,KAAI,EAIX13C,EAAK03C,EAAIpkC,CAAI,EAGf,SAASukC,EAAKljD,EAAGD,EAAC,CAChB,OAAAA,EAAE,EAAIC,EAAE,EAAE,MAAK,EACfD,EAAE,EAAIC,EAAE,EACDD,EAGT,SAASojD,EAAKxkC,EAAMykC,EAAI,CAClBzkC,GAAQ,OAAMA,EAAO,CAAE,IAAI,MAC/B,IAAI0kC,EAAK,IAAII,EAAO9kC,CAAI,EACpB2kC,EAAQF,GAAQA,EAAK,MACrBG,EAAO,UAAa,CAAA,OAAQF,EAAG,KAAI,IAAO,GAAK,UAAY,EAC/D,OAAAE,EAAK,OAAS,UAAA,CACZ,EACE,KAAI9d,EAAM4d,EAAG,KAAI,IAAO,GACpBM,GAAON,EAAG,KAAI,IAAO,GAAK,WAC1B1jD,GAAU8lC,EAAMke,IAAQ,GAAK,UAC1BhkD,IAAW,GACpB,OAAOA,CACX,EACE4jD,EAAK,MAAQF,EAAG,KAChBE,EAAK,MAAQA,EACTD,IACEA,EAAM,GAAGJ,EAAKI,EAAOD,CAAE,EAC3BE,EAAK,MAAQ,UAAA,CAAa,OAAOL,EAAKG,EAAI,CAAA,CAAE,CAAE,GAEzCE,EAGLX,GAAUA,EAAO,QACnBA,EAAO,QAAUO,EACRN,GAAUA,EAAO,IAC1BA,EAAO,UAAA,CAAa,OAAOM,CAAK,CAAE,EAElC,KAAK,UAAYA,CAGnB,GACEK,GAC+BZ,EAC9B,0DCrEF,SAASx5C,EAAQw5C,EAAQC,EAAM,CAEhC,SAASY,EAAO9kC,EAAI,CAClB,IAAIokC,EAAK,KAGTA,EAAG,KAAO,UAAA,CACR,IAAI5kC,EAAI4kC,EAAG,EACPa,EAAIb,EAAG,EAAGpiD,EAAIoiD,EAAG,EAAGhjD,EAAGM,EAE3B,OAAA0iD,EAAG,EAAI5kC,EAAKA,EAAI,WAAc,EAE9B9d,EAAIujD,EAAGjjD,EAAI,GAAM,GAAG,EACpBZ,EAAI6jD,EAAEjjD,EAAMA,EAAI,EAAK,GAAI,EACzBN,GAAKA,GAAK,GACVN,GAAKA,GAAK,GACVM,GAAKA,IAAM,GACXN,GAAKA,IAAM,GAEXM,EAAIujD,EAAEjjD,CAAC,EAAIN,EAAIN,EACfgjD,EAAG,EAAIpiD,EAECN,GAAK8d,EAAKA,IAAM,IAAQ,CACpC,EAEE,SAAS9S,EAAK03C,EAAIpkC,EAAI,CACpB,IAAI5e,EAAGM,EAAGM,EAAG2F,EAAG6X,EAAGylC,EAAI,CAAA,EAAIC,EAAQ,IAYnC,IAXIllC,KAAUA,EAAO,IAEnBte,EAAIse,EACJA,EAAO,OAGPA,EAAOA,EAAO,KACdte,EAAI,EACJwjD,EAAQ,KAAK,IAAIA,EAAOllC,EAAK,MAAM,GAGhChe,EAAI,EAAG2F,EAAI,IAAKA,EAAIu9C,EAAO,EAAEv9C,EAE5BqY,IAAMte,GAAKse,EAAK,YAAYrY,EAAI,IAAMqY,EAAK,MAAM,GAEjDrY,IAAM,IAAG6X,EAAI9d,GACjBA,GAAKA,GAAK,GACVA,GAAKA,IAAM,GACXA,GAAKA,GAAK,EACVA,GAAKA,IAAM,GACPiG,GAAK,IACP6X,EAAKA,EAAI,WAAc,EACvBpe,EAAK6jD,EAAEt9C,EAAI,GAAG,GAAMjG,EAAI8d,EACxBxd,EAAUZ,GAAL,EAAUY,EAAI,EAAI,GAW3B,IAPIA,GAAK,MACPijD,GAAGjlC,GAAQA,EAAK,QAAU,GAAK,GAAG,EAAI,IAKxChe,EAAI,IACC2F,EAAI,IAASA,EAAI,EAAG,EAAEA,EACzBjG,EAAIujD,EAAGjjD,EAAI,GAAM,GAAG,EACpBZ,EAAI6jD,EAAEjjD,EAAMA,EAAI,EAAK,GAAI,EACzBN,GAAKA,GAAK,GACVN,GAAKA,GAAK,GACVM,GAAKA,IAAM,GACXN,GAAKA,IAAM,GACX6jD,EAAEjjD,CAAC,EAAIN,EAAIN,EAGbgjD,EAAG,EAAI5kC,EACP4kC,EAAG,EAAIa,EACPb,EAAG,EAAIpiD,EAGT0K,EAAK03C,EAAIpkC,CAAI,EAGf,SAASukC,EAAKljD,EAAGD,EAAC,CAChB,OAAAA,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EAAE,MAAK,EACRD,EAGT,SAASojD,EAAKxkC,EAAMykC,EAAI,CAClBzkC,GAAQ,OAAMA,EAAO,CAAE,IAAI,MAC/B,IAAI0kC,EAAK,IAAII,EAAO9kC,CAAI,EACpB2kC,EAAQF,GAAQA,EAAK,MACrBG,EAAO,UAAa,CAAA,OAAQF,EAAG,KAAI,IAAO,GAAK,UAAY,EAC/D,OAAAE,EAAK,OAAS,UAAA,CACZ,EACE,KAAI9d,EAAM4d,EAAG,KAAI,IAAO,GACpBM,GAAON,EAAG,KAAI,IAAO,GAAK,WAC1B1jD,GAAU8lC,EAAMke,IAAQ,GAAK,UAC1BhkD,IAAW,GACpB,OAAOA,CACX,EACE4jD,EAAK,MAAQF,EAAG,KAChBE,EAAK,MAAQA,EACTD,IACEA,EAAM,GAAGJ,EAAKI,EAAOD,CAAE,EAC3BE,EAAK,MAAQ,UAAA,CAAa,OAAOL,EAAKG,EAAI,CAAA,CAAE,CAAE,GAEzCE,EAGLX,GAAUA,EAAO,QACnBA,EAAO,QAAUO,EACRN,GAAUA,EAAO,IAC1BA,EAAO,UAAA,CAAa,OAAOM,CAAK,CAAE,EAElC,KAAK,QAAUA,CAGjB,GACEK,GAC+BZ,EAC9B,0DC5IF,SAASx5C,EAAQw5C,EAAQC,EAAM,CAEhC,SAASY,EAAO9kC,EAAI,CAClB,IAAIokC,EAAK,KAAMW,EAAU,GAGzBX,EAAG,KAAO,UAAA,CACR,IAAIrkD,EAAIqkD,EAAG,EAAG56C,EAAI46C,EAAG,EAAGtkD,EAAIskD,EAAG,EAAGv/C,EAAIu/C,EAAG,EACzC,OAAArkD,EAAKA,GAAK,GAAOA,IAAM,EAAKyJ,EAC5BA,EAAKA,EAAI1J,EAAK,EACdA,EAAKA,GAAK,GAAOA,IAAM,EAAK+E,EAC5BA,EAAKA,EAAI9E,EAAK,EACdqkD,EAAG,EAAIrkD,EAAKA,GAAK,GAAOA,IAAM,GAAMyJ,EACpC46C,EAAG,EAAI56C,EAAKA,EAAI1J,EAAK,EACrBskD,EAAG,EAAKtkD,GAAK,GAAO0J,IAAM,GAAM3E,EACzBu/C,EAAG,EAAKv/C,EAAI9E,EAAK,CAC5B,EAkBEqkD,EAAG,EAAI,EACPA,EAAG,EAAI,EACPA,EAAG,EAAI,YACPA,EAAG,EAAI,WAEHpkC,IAAS,KAAK,MAAMA,CAAI,GAE1BokC,EAAG,EAAKpkC,EAAO,WAAe,EAC9BokC,EAAG,EAAIpkC,EAAO,GAGd+kC,GAAW/kC,EAIb,QAASyJ,EAAI,EAAGA,EAAIs7B,EAAQ,OAAS,GAAIt7B,IACvC26B,EAAG,GAAKW,EAAQ,WAAWt7B,CAAC,EAAI,EAChC26B,EAAG,KAAI,EAIX,SAASG,EAAKljD,EAAGD,EAAC,CAChB,OAAAA,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACDD,EAGT,SAASojD,EAAKxkC,EAAMykC,EAAI,CACtB,IAAIC,EAAK,IAAII,EAAO9kC,CAAI,EACpB2kC,EAAQF,GAAQA,EAAK,MACrBG,EAAO,UAAa,CAAA,OAAQF,EAAG,KAAI,IAAO,GAAK,UAAY,EAC/D,OAAAE,EAAK,OAAS,UAAA,CACZ,EACE,KAAI9d,EAAM4d,EAAG,KAAI,IAAO,GACpBM,GAAON,EAAG,KAAI,IAAO,GAAK,WAC1B1jD,GAAU8lC,EAAMke,IAAQ,GAAK,UAC1BhkD,IAAW,GACpB,OAAOA,CACX,EACE4jD,EAAK,MAAQF,EAAG,KAChBE,EAAK,MAAQA,EACTD,IACE,OAAOA,GAAU,UAAUJ,EAAKI,EAAOD,CAAE,EAC7CE,EAAK,MAAQ,UAAA,CAAa,OAAOL,EAAKG,EAAI,CAAA,CAAE,CAAE,GAEzCE,EAGLX,GAAUA,EAAO,QACnBA,EAAO,QAAUO,EACRN,GAAUA,EAAO,IAC1BA,EAAO,UAAA,CAAa,OAAOM,CAAK,CAAE,EAElC,KAAK,OAASA,CAGhB,GACEK,GAC+BZ,EAC9B,0DC3EF,SAAUx5C,EAAQy3C,EAAMiD,EAAI,CAK7B,IAAIh/C,EAAQ,IACRi/C,EAAS,EACT9oC,EAAS,GACT+oC,EAAU,SACVC,EAAaH,EAAK,IAAIh/C,EAAOi/C,CAAM,EACnCG,EAAeJ,EAAK,IAAI,EAAG7oC,CAAM,EACjCkpC,EAAWD,EAAe,EAC1BE,EAAOt/C,EAAQ,EACfu/C,EAMJ,SAASC,EAAW3lC,EAAM9c,EAAS0iD,EAAQ,CACzC,IAAIl6C,EAAM,CAAA,EACVxI,EAAWA,GAAW,GAAQ,CAAE,QAAS,EAAI,EAAMA,GAAW,CAAA,EAG9D,IAAI2iD,EAAYC,EAAOvlC,EACrBrd,EAAQ,QAAU,CAAC8c,EAAM+lC,EAAS7D,CAAI,CAAC,EACtCliC,GAAgBgmC,EAAQ,EAAW,CAAC,EAAGt6C,CAAG,EAGzCu6C,EAAO,IAAIC,EAAKx6C,CAAG,EAInBk5C,EAAO,UAAA,CAIT,QAHInjD,EAAIwkD,EAAK,EAAEb,CAAM,EACjBtlD,EAAIwlD,EACJphD,EAAI,EACDzC,EAAI8jD,GACT9jD,GAAKA,EAAIyC,GAAKiC,EACdrG,GAAKqG,EACLjC,EAAI+hD,EAAK,EAAE,CAAC,EAEd,KAAOxkD,GAAK+jD,GACV/jD,GAAK,EACL3B,GAAK,EACLoE,KAAO,EAET,OAAQzC,EAAIyC,GAAKpE,CACrB,EAEE,OAAA8kD,EAAK,MAAQ,UAAa,CAAA,OAAOqB,EAAK,EAAE,CAAC,EAAI,CAAE,EAC/CrB,EAAK,MAAQ,UAAa,CAAA,OAAOqB,EAAK,EAAE,CAAC,EAAI,UAAY,EACzDrB,EAAK,OAASA,EAGdkB,EAAOC,EAASE,EAAK,CAAC,EAAG/D,CAAI,GAGrBh/C,EAAQ,MAAQ0iD,GACpB,SAAShB,EAAM5kC,EAAMmmC,EAAcxB,EAAK,CAUtC,OATIA,IAEEA,EAAM,GAAKJ,EAAKI,EAAOsB,CAAI,EAE/BrB,EAAK,MAAQ,UAAA,CAAa,OAAOL,EAAK0B,EAAM,CAAA,CAAE,CAAE,GAK9CE,GAAgBhB,EAAKE,CAAO,EAAIT,EAAa5kC,GAIrC4kC,CACb,GACLA,EACAiB,EACA,WAAY3iD,EAAUA,EAAQ,OAAU,MAAQiiD,EAChDjiD,EAAQ,KAAK,EAaf,SAASgjD,EAAKx6C,EAAG,CACf,IAAItK,EAAGglD,EAAS16C,EAAI,OAChB04C,EAAK,KAAMpiD,EAAI,EAAG2F,EAAIy8C,EAAG,EAAIA,EAAG,EAAI,EAAGtiD,EAAIsiD,EAAG,EAAI,CAAA,EAMtD,IAHKgC,IAAU16C,EAAM,CAAC06C,GAAQ,GAGvBpkD,EAAImE,GACTrE,EAAEE,CAAC,EAAIA,IAET,IAAKA,EAAI,EAAGA,EAAImE,EAAOnE,IACrBF,EAAEE,CAAC,EAAIF,EAAE6F,EAAI89C,EAAQ99C,EAAI+D,EAAI1J,EAAIokD,CAAM,GAAKhlD,EAAIU,EAAEE,CAAC,EAAG,EACtDF,EAAE6F,CAAC,EAAIvG,GAIRgjD,EAAG,EAAI,SAASiC,EAAK,CAIpB,QAFIjlD,EAAGc,EAAI,EACPF,EAAIoiD,EAAG,EAAGz8C,EAAIy8C,EAAG,EAAGtiD,EAAIsiD,EAAG,EACxBiC,KACLjlD,EAAIU,EAAEE,EAAIyjD,EAAQzjD,EAAI,CAAE,EACxBE,EAAIA,EAAIiE,EAAQrE,EAAE2jD,GAAS3jD,EAAEE,CAAC,EAAIF,EAAE6F,EAAI89C,EAAQ99C,EAAIvG,CAAE,IAAMU,EAAE6F,CAAC,EAAIvG,EAAG,EAExE,OAAAgjD,EAAG,EAAIpiD,EAAGoiD,EAAG,EAAIz8C,EACVzF,CAIR,GAAEiE,CAAK,EAOV,SAASo+C,EAAKljD,EAAGD,EAAC,CAChB,OAAAA,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EAAE,MAAK,EACRD,EAOT,SAASmf,EAAQvG,EAAKilC,EAAK,CACzB,IAAIj+C,EAAS,CAAA,EAAIslD,EAAO,OAAOtsC,EAAMusC,EACrC,GAAItH,GAASqH,GAAO,SAClB,IAAKC,KAAQvsC,EACX,GAAI,CAAEhZ,EAAO,KAAKuf,EAAQvG,EAAIusC,CAAI,EAAGtH,EAAQ,CAAC,CAAC,CAAI,MAAW,CAAA,CAGlE,OAAQj+C,EAAO,OAASA,EAASslD,GAAO,SAAWtsC,EAAMA,EAAM,KAQjE,SAAS8rC,EAAO9lC,EAAMtU,EAAG,CAEvB,QADI86C,EAAaxmC,EAAO,GAAIymC,EAAO9+C,EAAI,EAChCA,EAAI6+C,EAAW,QACpB96C,EAAI+5C,EAAO99C,CAAC,EACV89C,GAASgB,GAAS/6C,EAAI+5C,EAAO99C,CAAC,EAAI,IAAM6+C,EAAW,WAAW7+C,GAAG,EAErE,OAAOo+C,EAASr6C,CAAG,EAQrB,SAASs6C,GAAQ,CACf,GAAI,CACF,IAAIj6B,EACJ,OAAI25B,IAAe35B,EAAM25B,EAAW,aAElC35B,EAAMA,EAAI5lB,CAAK,GAEf4lB,EAAM,IAAI,WAAW5lB,CAAK,GACzBsE,EAAO,QAAUA,EAAO,UAAU,gBAAgBshB,CAAG,GAEjDg6B,EAASh6B,CAAG,CACpB,MAAW,CACV,IAAI26B,EAAUj8C,EAAO,UACjBk8C,EAAUD,GAAWA,EAAQ,QACjC,MAAO,CAAC,CAAC,IAAI,KAAMj8C,EAAQk8C,EAASl8C,EAAO,OAAQs7C,EAAS7D,CAAI,CAAC,CAClE,EAOH,SAAS6D,EAASlhD,EAAC,CACjB,OAAO,OAAO,aAAa,MAAM,EAAGA,CAAC,EAgBvC,GANAihD,EAAOX,EAAK,OAAM,EAAIjD,CAAI,EAMS+B,EAAO,QAAS,CACjDA,EAAA,QAAiB0B,EAEjB,GAAI,CACFD,EAAa,GAAQ,QAAQ,CAC9B,MAAY,CAAA,CACd,MAICP,EAAK,OAASE,CAAO,EAAIM,CAK3B,GAGG,OAAO,KAAS,IAAe,KAAOd,GACvC,CAAA,EACA,8BC/OE+B,GAAOC,GAKPC,GAASC,GAKTC,GAASC,GAQTC,GAAYC,GASZC,GAAUC,GAOVC,GAASC,GAITC,GAAKC,GAETD,GAAG,KAAOZ,GACVY,GAAG,OAASV,GACZU,GAAG,OAASR,GACZQ,GAAG,UAAYN,GACfM,GAAG,QAAUJ,GACbI,GAAG,OAASF,GAEZ,IAAA3B,GAAiB6B,GCrCXE,GAAuB,KAChBC,GAAuB,YAEpBC,GACZC,EACAC,EAAoDC,EAAgB,CACtE,OAAIA,GAAW,OACbA,EAAUC,GAAW,GAEhBC,GACHJ,EAAQC,EAAU,SAACjjD,EAAG9E,EAAC,CAAK,OAAAmoD,GAASrjD,EAAa9E,EAAagoD,CAAO,CAAC,CAAA,CAC7E,UAEgBC,IAAW,CACzB,OAAOn9B,EAAO,QAAQ,eAAc,IAAO,GAAK68B,GACAC,EAClD,CAEA,SAASM,GACLJ,EAAoBC,EACpBK,EAAoC,CACtC,IAAIC,EAAiB,GAOrB,IANIrnC,GAAa8mC,CAAM,GAAK9mC,GAAa+mC,CAAQ,KAC/CM,EAAiB,IAEfrnC,GAAa8mC,CAAM,GAAK9mC,GAAa+mC,CAAQ,IAC/CM,EAAiB,IAEfA,EAAgB,CAClB,IAAMC,EAAQR,EAAO,YAAY,KAC3BS,EAAQR,EAAS,YAAY,KAEnC,GAAIO,IAAUC,EACZ,MAAM,IAAI,MACN,yCAAA,OAAyCD,EAAS,IAAA,EAClD,aAAa,OAAAC,CAAK,CAAE,CAE3B,CAED,GAAI,MAAM,QAAQT,CAAM,GAAK,MAAM,QAAQC,CAAQ,EAAG,CACpD,IAAMS,EAAc34B,GAAWi4B,CAAM,EAC/BW,EAAgB54B,GAAWk4B,CAAQ,EACzC,GAAI,CAACviD,GAAYgjD,EAAaC,CAAa,EACzC,MAAM,IAAI,MACN,iCACA,YAAA,OAAYD,EAAW,gBAAA,EAAA,OAAiBC,EAAa,GAAA,CAAG,CAE/D,CAED,IAAMC,EACF1nC,GAAa8mC,CAAM,EAAIA,EAAStnC,GAAQsnC,CAAgC,EACtEa,EAAe3nC,GAAa+mC,CAAQ,EACtCA,EACAvnC,GAAQunC,CAAkC,EAE9C,GAAIW,EAAW,SAAWC,EAAa,OACrC,MAAM,IAAI,MACN,yCAAA,OAAyCD,EAAW,OAAY,MAAA,EAChE,aAAa,OAAAC,EAAa,OAAW;CAAA,EACrC,aAAA,OAAaD,EAAe;CAAA,EAC5B,aAAa,OAAAC,EAAe,GAAA,CAAA,EAElC,QAAS1mD,EAAI,EAAGA,EAAI0mD,EAAa,OAAQ,EAAE1mD,EAAG,CAC5C,IAAM6C,EAAI4jD,EAAWzmD,CAAC,EAChBlB,EAAI4nD,EAAa1mD,CAAC,EAExB,GAAI,CAACmmD,EAAUtjD,EAAG/D,CAAC,EACjB,MAAM,IAAI,MACN,yBAAyB,OAAAkB,EAAQ,MAAA,EAAA,OAAA6C,EAAe,aAAA,EAAA,OAAA7C,EAAQ,MAAA,EAAA,OAAAlB,EAAM;CAAA,EAC9D,aAAA,OAAa2nD,EAAe;CAAA,EAC5B,aAAa,OAAAC,EAAe,GAAA,CAAA,CAEnC,CACG,OAAO,OAAW,KACpB,OAAM,EAAG,QAAO,CAEpB,CAOgB,SAAAC,GAAoBzhC,EAAuBvO,EAAY,CACrEuO,EAAE,EAAG,KAAK,UAAA,CAAM,OAAAvO,EAAK,KAAI,CAAE,EAAE,UAAA,CAAM,OAAAA,EAAI,CAAJ,CAAM,EACrC,OAAO,OAAW,KACpB,OAAM,EAAG,QAAO,CAEpB,CAEgB,SAAAiwC,GAAkBf,EAAoBC,EAAoB,CACxE,IAAM3S,EAAM,OAAO2S,GAAa,UAAY,OAAOA,GAAa,UACxD,OAAOA,GAAa,UACxB,CAACA,CAAQ,EACTA,EACJ,OAAIt/C,GAASq/C,CAAM,GAAKr/C,GAAUq/C,EAAoB,CAAC,CAAC,GACpDr/C,GAASs/C,CAAQ,GAAKt/C,GAAUs/C,EAAsB,CAAC,CAAC,EAEnDG,GAAsBJ,EAAQ1S,EAAK,SAACtwC,EAAG9E,EAAC,CAAK,OAAA8E,GAAK9E,CAAL,CAAM,EAErDkoD,GACHJ,EAAQC,EAAU,SAACjjD,EAAG9E,EAAC,CAAK,OAAAmoD,GAASrjD,EAAa9E,EAAa,CAAC,CAAC,CAAA,CACvE,UAEgB8oD,GAAmBhkD,EAAW,EAAWkjD,EAAgB,CAIvE,GAHIA,GAAW,OACbA,EAAUC,GAAW,GAEnB,CAACE,GAASrjD,EAAG,EAAGkjD,CAAO,EACzB,MAAM,IAAI,MAAM,8BAAA,OAA8BljD,EAAmB,iBAAA,EAAA,OAAA,CAAC,CAAE,EAElE,OAAO,OAAW,KACpB,OAAM,EAAG,QAAO,CAEpB,CAEA,SAASqjD,GAASrjD,EAAW,EAAWkjD,EAAe,CACrD,MAAI,CAAC,SAASljD,CAAC,GAAK,CAAC,SAAS,CAAC,EACtB,GAEL,QAAMA,CAAC,GAAK,MAAM,CAAC,GAAK,KAAK,IAAIA,EAAI,CAAC,EAAIkjD,EAIhD,UAEgBe,GACZjB,EAA6BjuC,EAAaC,EAAY,CACxD,QAAS7X,EAAI,EAAGA,EAAI6lD,EAAO,OAAQ7lD,IACjC,GAAI6lD,EAAO7lD,CAAC,EAAI4X,GAAOiuC,EAAO7lD,CAAC,EAAI6X,EACjC,MAAM,IAAI,MACN,sBAAA,OAAsBguC,EAAO7lD,CAAC,EAAC,QAAA,EAAA,OAAS4X,EAAG,UAAA,EAAA,OAAWC,CAAI,CAAE,CAGtE,CAEgB,SAAAkvC,GACZlB,EAAqBC,EAAqB,CAG5C,IAAMkB,EAAc,IAAI,aAAanB,CAAM,EACrCoB,EAAgB,IAAI,aAAanB,CAAQ,EAC/C,GAAIkB,EAAY,SAAWC,EAAc,OACvC,MAAM,IAAI,MACN,wCACA,GAAG,OAAAA,EAAc,OAAM,eAAA,EAAA,OAAgBD,EAAY,MAAM,CAAE,EAGjE,QAAShnD,EAAI,EAAGA,EAAIinD,EAAc,OAAQjnD,IACxC,GAAIgnD,EAAYhnD,CAAC,IAAMinD,EAAcjnD,CAAC,EACpC,MAAM,IAAI,MACN,iCAAA,OAAiCA,EAAU,SAAA,EAC3C,GAAG,OAAAinD,EAAcjnD,CAAC,EAAC,WAAA,EAAA,OAAYgnD,EAAYhnD,CAAC,EAAW,UAAA,CAAA,CAGjE,CAGM,SAAUknD,GAAcrkD,EAAqB,CAEjD,QAAS7C,EAAI,EAAGA,EAAK6C,EAAgB,OAAQ7C,IAAK,CAChD,IAAMqC,EAAMQ,EAAE7C,CAAC,EACX,MAAM,QAAQqC,CAAG,EACnB6kD,GAAc7kD,CAAG,EAEjBQ,EAAE7C,CAAC,EAAIoe,GAAa/b,CAAa,CAEpC,CACD,OAAOQ,CACT,CAGM,SAAUskD,GAAmBC,EAAyB,CAE1D,IAAMC,EAAQ,SAAS,cAAc,OAAO,EAC5C,MAAI,gBAAiBA,IAElBA,EAAc,YAAc,IAE/BA,EAAM,MAAQ,GACdA,EAAM,KAAO,GACbA,EAAM,MAAM,SAAW,QACvBA,EAAM,MAAM,KAAO,MACnBA,EAAM,MAAM,IAAM,MAElBA,EAAM,QAAU,OAChBA,EAAM,YAAYD,CAAM,EACjB,IAAI,QAAQ,SAAA1oD,EAAO,CACxB2oD,EAAM,iBAAiB,aAAc,SAAAloD,EAAC,CAAI,OAAAT,EAAQ2oD,CAAK,CAAb,CAAc,EACxDA,EAAM,KAAI,CACZ,CAAC,CACH,CAEM,SAAgBC,GAAKD,EAAuB,oFAChD,IAAA,GAAA,MAAA,CAAA,EAAMA,EAAM,KAAI,CAAE,SACd,OADJn+C,EAAA,KAAA,EACI,8BAA+Bm+C,EACjC,CAAA,EAAM,IAAI,QAAQ,SAAA3oD,EAAO,CAEtB2oD,EAAc,0BAA0B3oD,CAAO,CAClD,CAAC,CAAC,EAJoC,CAAA,EAAA,CAAA,SACtCwK,EAAA,KAAA,iCAKH,wPCtLD,IAAAq+C,IAAA,UAAA,CAUE,SACIA,EAAA1e,EAAc2e,EAAsBlmD,EACpCmmD,EAAqBzpC,EAAa,CACpC,KAAK,KAAO6qB,EACZ,KAAK,OAAS2e,EACd,KAAK,MAAQlmD,EACb,KAAK,QAAU,IACf,KAAK,UAAYmmD,EACb,KAAK,YACP,KAAK,MAAQ,KAAK,KAAO,KAAK,OAAS,EACvC,KAAK,MAAQ,KAAK,KAAO,KAAK,OAAS,GAEzC,IAAMC,EAAY1pC,GAAc,KAAK,OAAM,EAC3C,KAAK,OAAS2pC,GAAAA,KAAgBD,EAAU,SAAQ,CAAE,EAI7C,OAAAH,EAAA,UAAA,UAAA,UAAA,CACL,GAAI,CAAC,MAAM,KAAK,OAAO,EAAG,CACxB,IAAM9oD,EAAQ,KAAK,QACnB,YAAK,QAAU,IACRA,CACR,CAID,QAFImpD,EAAiBC,EACjBC,EAAU,GACP,CAACA,GAAS,CACf,IAAItK,EAAU,OAAEC,EAAU,OAAE39C,EAAS,OACrC,GACE09C,EAAK,EAAI,KAAK,OAAM,EAAK,EACzBC,EAAK,EAAI,KAAK,OAAM,EAAK,EACzB39C,EAAI09C,EAAKA,EAAKC,EAAKA,QACZ39C,GAAK,GAAKA,IAAM,GAEzB,IAAMwd,EAAM,KAAK,KAAK,GAAO,KAAK,IAAIxd,CAAC,EAAIA,CAAC,EAC5C8nD,EAAU,KAAK,KAAO,KAAK,OAASpK,EAAKlgC,EACzCuqC,EAAU,KAAK,KAAO,KAAK,OAASpK,EAAKngC,GAErC,CAAC,KAAK,WAAa,KAAK,iBAAiBsqC,CAAO,KAClDE,EAAU,GAEb,CAED,OAAI,CAAC,KAAK,WAAa,KAAK,iBAAiBD,CAAO,KAClD,KAAK,QAAU,KAAK,aAAaA,CAAO,GAEnC,KAAK,aAAaD,CAAO,GAI1BL,EAAY,UAAA,aAAZ,SAAa9oD,EAAa,CAChC,OAAI,KAAK,OAAS,MAAQ,KAAK,QAAU,UAChCA,EAEF,KAAK,MAAMA,CAAK,GAIjB8oD,EAAgB,UAAA,iBAAhB,SAAiB9oD,EAAa,CACpC,OAAOA,GAAS,KAAK,OAASA,GAAS,KAAK,OAE/C8oD,CAAA,GAAA,EAIDQ,IAAA,UAAA,CASE,SAAAA,EACI1R,EAAeW,EAAc11C,EAC7B0c,EAAa,CACf,KAAK,MAAQq4B,EACb,KAAK,KAAO,EAAIW,EAChB,KAAK,MAAQ11C,EAEb,IAAMomD,EAAY1pC,GAAc,KAAK,OAAM,EAC3C,KAAK,MAAQ2pC,GAAAA,KAAgBD,EAAU,SAAQ,CAAE,EACjD,KAAK,MAAQ,IAAIH,GAAY,EAAG,EAAGjmD,EAAO,GAAO,KAAK,MAAK,CAAE,EAEzD+0C,EAAQ,EACV,KAAK,EAAIA,EAAS,EAAI,EAEtB,KAAK,EAAIA,EAAS,EAAI,EAExB,KAAK,EAAI,EAAI,KAAK,KAAK,EAAI,KAAK,CAAC,EAI5B,OAAA0R,EAAA,UAAA,UAAA,UAAA,CAEL,QADIC,EAAYC,EAAYzK,EAAYt7C,EAAWmb,EAAW3d,IACjD,CACX,GACEwC,EAAI,KAAK,MAAM,UAAS,EACxBxC,EAAI,EAAK,KAAK,EAAIwC,QACXxC,GAAK,GAMd,GALAA,GAAKA,EAAIA,EACTsoD,EAAK9lD,EAAIA,EACT+lD,EAAK,EAAK,KAAQD,EAAKA,EACvBxK,EAAM,GAAMwK,EAAO,KAAK,GAAK,EAAItoD,EAAI,KAAK,IAAIA,CAAC,GAC/C2d,EAAI,KAAK,MAAK,EACVA,EAAI4qC,GAAM,KAAK,IAAI5qC,CAAC,EAAImgC,EAC1B,KAEH,CACD,OAAA99C,EAAK,EAAI,KAAK,KAAQ,KAAK,EAAIA,EAC3B,KAAK,MAAQ,IACfA,GAAK,KAAK,IAAI,KAAK,MAAK,EAAI,EAAI,KAAK,KAAK,GAErC,KAAK,aAAaA,CAAC,GAGpBqoD,EAAY,UAAA,aAAZ,SAAatpD,EAAa,CAChC,OAAI,KAAK,QAAU,UACVA,EAEF,KAAK,MAAMA,CAAK,GAE1BspD,CAAA,GAAA,EAEDG,IAAA,UAAA,CAME,SAAAA,EACIjmD,EAASE,EAASb,EAClB0c,EAAoB,CADpB/b,IAAA,SAAAA,EAAO,GAAEE,IAAA,SAAAA,EAAO,GADpB,IAkBCmH,EAAA,KALC,GAQM,KAAA,eAAiB,UAAA,CACrB,OAACA,EAAK,OAAS,MAAQA,EAAK,QAAU,SAAU,EAnBlD,KAAK,IAAMrH,EACX,KAAK,MAAQE,EAAMF,EACnB,KAAK,MAAQX,EACT0c,GAAQ,OACVA,EAAO,KAAK,OAAM,GAEhB,OAAOA,GAAS,WAClBA,EAAOA,EAAK,SAAQ,GAGlB,CAAC,KAAK,eAAc,GAAM,KAAK,OAAS,EAC1C,MAAM,IAAI,MACN,0BAAA,OAA0B/b,EAAS,KAAA,EAAA,OAAAE,EAAiC,8BAAA,CAAA,EAE1E,KAAK,OAASwlD,GAAAA,KAAgB3pC,CAAI,EAO5B,OAAAkqC,EAAY,UAAA,aAAZ,SAAazpD,EAAa,CAChC,OAAI,KAAK,eAAc,EACdA,EAEF,KAAK,MAAMA,CAAK,GAGzBypD,EAAA,UAAA,UAAA,UAAA,CACE,OAAO,KAAK,aAAa,KAAK,IAAM,KAAK,MAAQ,KAAK,OAAM,CAAE,GAEjEA,CAAA,GAAA,EC/KD,SAASC,GACL9mD,EAAoBg1C,EAAeW,EACnC11C,EAAsC0c,EAAa,CAQrD,GATqCg5B,IAAA,SAAAA,EAAQ,GAC3C11C,IAAA,SAAAA,EAAoC,WACtC2G,GAAmC5G,CAAK,EACpC21C,GAAQ,OACVA,EAAO,GAEL11C,GAAS,OACXA,EAAQ,WAENA,IAAU,WAAaA,IAAU,QACnC,MAAM,IAAI,MAAM,yBAAA,OAAyBA,CAAK,CAAE,EAIlD,QAFM8mD,EAAS,IAAIL,GAAU1R,EAAOW,EAAM11C,EAAO0c,CAAI,EAC/CpC,EAAMuU,GAAO9uB,EAAOC,CAAK,EACtB,EAAI,EAAG,EAAIsa,EAAI,OAAO,OAAQ,IACrCA,EAAI,OAAO,CAAC,EAAIwsC,EAAO,UAAS,EAElC,OAAOxsC,EAAI,SAAQ,CACrB,CAEO,IAAMysC,GAA8B1oD,EAAG,CAAC,aAAYwoD,EAAA,CAAC,ECtB5D,SAASG,GACLjnD,EAAoBwnC,EAAU0f,EAAYjnD,EAC1C0c,EAAa,CAEf,GAHsB6qB,IAAA,SAAAA,EAAQ,GAAE0f,IAAA,SAAAA,EAAU,GAE1CtgD,GAAmC5G,CAAK,EACpCC,GAAS,MAASA,IAAuB,OAC3C,MAAM,IAAI,MAAM,yBAAA,OAAyBA,CAAK,CAAE,EAKlD,QAHMknD,EACF,IAAIjB,GAAY1e,EAAM0f,EAAQjnD,EAAO,GAAuB0c,CAAI,EAC9DpC,EAAMuU,GAAO9uB,EAAOC,CAAK,EACtB,EAAI,EAAG,EAAIsa,EAAI,OAAO,OAAQ,IACrCA,EAAI,OAAO,CAAC,EAAI4sC,EAAU,UAAS,EAErC,OAAO5sC,EAAI,SAAQ,CACrB,CAEO,IAAM6sC,GAA+B9oD,EAAG,CAAC,cAAa2oD,EAAA,CAAC,EClB9D,SAASI,GACLrnD,EAAoBC,EAA2B0c,EAAa,CAC9D,GAAI1c,GAAS,MAASA,IAAuB,OAC3C,MAAM,IAAI,MAAM,yBAAA,OAAyBA,CAAK,CAAE,EAElD,OAAOmnD,GAAapnD,EAAO,EAAG,EAAGC,EAAO0c,CAAI,CAC9C,CAEO,IAAM2qC,GAAuChpD,EAAG,CAAC,sBAAqB+oD,EAAA,CAAC,ECE9E,SAASE,GACLvnD,EAAoBwnD,EAAYC,EAAYxnD,EAC5C0c,EAAoB,CADA6qC,IAAA,SAAAA,EAAU,GAAEC,IAAA,SAAAA,EAAU,GAAExnD,IAAA,SAAAA,EAA2B,WAEzE2G,GAAmC5G,CAAK,EAGxC,QAFMua,EAAMuU,GAAO9uB,EAAOC,CAAK,EACzBynD,EAAS,IAAIb,GAAcW,EAAQC,EAAQ,KAAM9qC,CAAI,EAClD,EAAI,EAAG,EAAIpC,EAAI,OAAO,OAAQ,IACrCA,EAAI,OAAO,CAAC,EAAImtC,EAAO,UAAS,EAElC,OAAOntC,EAAI,SAAQ,CACrB,CAEO,IAAMotC,GAAgCrpD,EAAG,CAAC,eAAcipD,EAAA,CAAC,EClBhE,SAASK,GACP5nD,EAAoBwnD,EAAgBC,EAClC9qC,EAAoB,CAEtB,OAAOgrC,GAAc3nD,EAAOwnD,EAAQC,EAAQ,QAAS9qC,CAAI,CAC3D,CAEO,IAAMkrC,GAAmCvpD,EAAG,CAAC,kBAAiBspD,EAAA,CAAC,ECRhE,SAAUE,GACZriD,EAAe8vC,EAAc/3C,EAC7ByC,EAAoC,CACtC,GAF+BzC,IAAA,SAAAA,EAAQ,GACrCyC,IAAA,SAAAA,EAAoC,WAClCzC,IAAS,EACX,MAAM,IAAI,MAAM,4BAA4B,EAG9C,IAAMoqB,EAAoB,CAAC,MAAKniB,EAAE,KAAI8vC,EAAE,KAAI/3C,EAAE,MAAKyC,CAAA,EAEnD,OAAOunB,EAAO,UAAUvW,GAAO,CAAA,EAC3B2W,CAAgC,CACtC,CCZA,SAASmgC,GAAwBzoC,EAAmB,CAClD,IAAMk1B,EAAStnB,EAAgB5N,EAAO,QAAS,MAAM,EAE/CpB,EAAqB,CAAC,MAAOs2B,CAAM,EACzC,OAAOhtB,EAAO,UAAUtW,GAAMgN,CAAmC,CACnE,CAEO,IAAM4P,GAAuBxvB,EAAG,CAAC,MAAKypD,EAAA,CAAC,ECT9C,SAASC,GAA8BnnD,EAAe,CACpD,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,YAAY,EAEzCqd,EAA2B,CAAC,EAAG+e,CAAE,EACvC,OAAOzV,EAAO,UAAUrW,GAAY+M,CAAmC,CACzE,CACO,IAAM+pC,GAA6B3pD,EAAG,CAAC,YAAW0pD,EAAA,CAAC,ECL1D,SAASE,GAAwBrnD,EAAe,CAC9C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,MAAM,EAEnCqd,EAAqB,CAAC,EAAG+e,CAAE,EAEjC,OAAOzV,EAAO,UAAUpW,GAAM8M,CAAmC,CACnE,CAEO,IAAMiqC,GAAuB7pD,EAAG,CAAC,MAAK4pD,EAAA,CAAC,ECR9C,SAASE,GAAyBvnD,EAAe,CAC/C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,OAAO,EAEpCqd,EAAsB,CAAC,EAAG+e,CAAE,EAElC,OAAOzV,EAAO,UAAU9V,GAAOwM,CAAmC,CACpE,CAEO,IAAMmqC,GAAwB/pD,EAAG,CAAC,OAAM8pD,EAAA,CAAC,ECWhD,SAASE,GACLznD,EAAiBkD,EAAsB,CACzC,IAAMk5B,EAAK/P,EAAgBrsB,EAAG,IAAK,SAAS,EAEtCqd,EAAwB,CAAC,EAAG+e,CAAE,EAC9BrV,EAAsB,CAAC,KAAM7jB,CAAI,EAEvC,OAAOyjB,EAAO,UACV7V,GAASuM,EACT0J,CAAgC,CACtC,CAEO,IAAM4kB,GAA0BluC,EAAG,CAAC,SAAQgqD,EAAA,CAAC,ECzCpD,SAASC,GAAW1nD,EAAsB,CACxC,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,SAAS,EAC5CuiB,OAAAA,EACI6Z,EAAG,OAAS,EACZ,UAAA,CAAM,MAAA,qDAAA,OAAqDA,EAAG,KAAI,GAAA,CAA5D,CAA+D,EAClEuP,GAAQvP,EAAI,CAAC,CACtB,CAEO,IAAMurB,GAA4BlqD,EAAG,CAAC,WAAUiqD,EAAA,CAAC,ECNxD,SAASE,GAAW5nD,EAAwBkD,EAAsB,CAChE,IAAMk5B,EAAK/P,EAAgBrsB,EAAG,IAAK,SAAS,EAC5CuiB,OAAAA,EACI6Z,EAAG,OAAS,EACZ,UAAA,CAAM,MAAA,qDAAA,OAAqDA,EAAG,KAAI,GAAA,CAA5D,CAA+D,EAClEuP,GAAQvP,EAAIl5B,CAAI,CACzB,CAEO,IAAM2kD,GAA4BpqD,EAAG,CAAC,WAAUmqD,EAAA,CAAC,ECRxD,SAASE,GAAW9nD,EAAwBkD,EAAsB,CAChE,IAAMk5B,EAAK/P,EAAgBrsB,EAAG,IAAK,SAAS,EAC5CuiB,OAAAA,EACI6Z,EAAG,OAAS,EACZ,UAAA,CAAM,MAAA,qDAAA,OAAqDA,EAAG,KAAI,GAAA,CAA5D,CAA+D,EAClEuP,GAAQvP,EAAIl5B,CAAI,CACzB,CAEO,IAAM6kD,GAA4BtqD,EAAG,CAAC,WAAUqqD,EAAA,CAAC,ECRxD,SAASE,GAAWhoD,EAAwBkD,EAAsB,CAChE,IAAMk5B,EAAK/P,EAAgBrsB,EAAG,IAAK,SAAS,EAC5CuiB,OAAAA,EACI6Z,EAAG,OAAS,EACZ,UAAA,CAAM,MAAA,qDAAA,OAAqDA,EAAG,KAAI,GAAA,CAA5D,CAA+D,EAClEuP,GAAQvP,EAAIl5B,CAAI,CACzB,CAEO,IAAM+kD,GAA4BxqD,EAAG,CAAC,WAAUuqD,EAAA,CAAC,ECAxD,SAASE,GAAyBloD,EAAe,CAC/C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,OAAO,EACpCqd,EAAsB,CAAC,EAAG+e,CAAE,EAElC,OAAOzV,EAAO,UAAU5V,GAAOsM,CAAmC,CACpE,CAEO,IAAM8kB,GAAwB1kC,EAAG,CAAC,OAAMyqD,EAAA,CAAC,ECPhD,SAASC,GAAyBnoD,EAAe,CAC/C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,QAAS,SAAS,EAE/Cqd,EAAsB,CAAC,EAAG+e,CAAE,EAElC,OAAOzV,EAAO,UAAU3V,GAAOqM,CAAmC,CACpE,CACO,IAAM+qC,GAAwB3qD,EAAG,CAAC,OAAM0qD,EAAA,CAAC,ECNhD,SAASE,GAAwBroD,EAAe,CAC9C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,MAAM,EAEnCqd,EAAqB,CAAC,EAAG+e,CAAE,EAEjC,OAAOzV,EAAO,UAAUtV,GAAMgM,CAAmC,CACnE,CAEO,IAAMirC,GAAuB7qD,EAAG,CAAC,MAAK4qD,EAAA,CAAC,ECuB9C,SAASE,GACLvoD,EAAiBwoD,EACjBC,EAAsC3jD,EACtCsc,EAAqBkhB,EACrBtD,EAAkC,CADbsD,IAAA,SAAAA,EAAA,CAAqC,EAAG,CAAC,GAC9DtD,IAAA,SAAAA,EAAkC,QACpC,IAAM5C,EAAK/P,EAAgBrsB,EAAG,IAAK,iBAAiB,EAC9C0oD,EACFr8B,EAAgBm8B,EAAiB,kBAAmB,iBAAiB,EACnEG,EACFt8B,EAAgBo8B,EAAiB,kBAAmB,iBAAiB,EAErE1kB,EAAM3H,EACN4H,EAAe,GAMnB,GALI5H,EAAG,OAAS,IACd4H,EAAe,GACfD,EAAMH,EAAQxH,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAG1D4C,IAAe,OACjB,MAAM,IAAI,MACN,oFACmB,EAGzBzc,EACIwhB,EAAI,OAAS,EACb,UAAM,CAAA,MAAA,2DACF,QAAA,OAAQA,EAAI,KAAI,GAAA,CADd,CACiB,EAC3BxhB,EACImmC,EAAiB,OAAS,EAC1B,UAAM,CAAA,MAAA,kEACF,YAAA,OAAYA,EAAiB,KAAI,GAAA,CAD/B,CACkC,EAC5CnmC,EACIomC,EAAiB,OAAS,EAC1B,UAAM,CAAA,MAAA,kEACF,YAAA,OAAYD,EAAiB,KAAI,GAAA,CAD/B,CACkC,EAC5CnmC,EACIomC,EAAiB,MAAM,CAAC,IAAM,EAC9B,UAAA,CACI,MAAA,qEACA,uBAAuB,OAAAA,EAAiB,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EAC3DpmC,EACIomC,EAAiB,MAAM,CAAC,IAAM,EAC9B,UAAA,CAAM,MAAA,+DACF,6BAA6B,OAAAA,EAAiB,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EAEjE,IAAMroB,EAAaooB,EAAiB,MAAM,CAAC,EACrCE,EAAoBF,EAAiB,MAAM,CAAC,EAClDnmC,EACIomC,EAAiB,MAAM,CAAC,IAAMroB,EAAasoB,EAC3C,UAAA,CACI,MAAA,qEACA,WAAW,OAAAtoB,EAAasoB,EAAqB,IAAA,EAC7C,WAAW,OAAAD,EAAiB,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EAE/C,IAAMzoB,EAAYuM,GACd1I,EAAK2kB,EAAkB5jD,EAASsc,EAAK4d,EAAYsD,CAAQ,EACvDumB,EAAkB,EAClBnvC,EACFowB,GAAO5J,EAAWyoB,EAAkBE,EAAiB,QAAS7pB,CAAU,EAE5E,OAAIgF,EACKJ,EAAQlqB,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAEzDA,CACT,CAEO,IAAMovC,GAAkCrrD,EAAG,CAAC,iBAAgB8qD,EAAA,CAAC,ECxFpE,SAAeQ,GACX/oD,EAAsB5C,EAAoB,qHACtC,OAAAg/B,EAAK/P,EAAgBrsB,EAAG,IAAK,WAAW,EACxC+nC,EAAK1b,EAAgBjvB,EAAG,IAAK,WAAW,EAE9CmlB,EACI6Z,EAAG,QAAU2L,EAAG,MAChB,UAAA,CAAM,MAAA,kDACF,OAAA3L,EAAG,MAAiB,WAAA,EAAA,OAAA2L,EAAG,MAAS,IAAA,CAAA,CAAA,EAExCxlB,EACI6Z,EAAG,OAAS,EAAG,UAAA,CAAM,MAAA,qCAAA,OAAqCA,EAAG,MAAK,IAAA,CAA7C,CAAiD,EAE1E7Z,EACIwlB,EAAG,OAAS,EAAG,UAAA,CAAM,MAAA,qCAAA,OAAqCA,EAAG,MAAK,IAAA,CAA7C,CAAiD,EAE5D,CAAA,EAAM3L,EAAG,KAAI,CAAE,SAAvB,OAAA4sB,EAAQhiD,EAAe,KAAA,EACf,CAAA,EAAM+gC,EAAG,KAAI,CAAE,SAI7B,IAJMkhB,EAAQjiD,EAAe,KAAA,EACvBkiD,EAAO,IAAI,IAAID,CAAK,EAEtBE,EAAa,EACRrrD,EAAI,EAAGA,EAAIkrD,EAAM,OAAQlrD,IAC3BorD,EAAK,IAAIF,EAAMlrD,CAAC,CAAC,GACpBqrD,IAMJ,IAFMl7B,EAAS,IAAI7L,GAAa,CAAC+mC,CAAU,EAAG/sB,EAAG,KAAK,EAChDtQ,EAAU,IAAI1J,GAAa,CAAC+mC,CAAU,EAAG,OAAO,EAC7CrrD,EAAI,EAAGhC,EAAI,EAAGgC,EAAIkrD,EAAM,OAAQlrD,IAClCorD,EAAK,IAAIF,EAAMlrD,CAAC,CAAC,IACpBmwB,EAAO,OAAOnyB,CAAC,EAAIktD,EAAMlrD,CAAC,EAC1BguB,EAAQ,OAAOhwB,CAAC,EAAIgC,EACpBhC,KAGJ,MAAO,CAAA,EAAA,CAACmyB,EAAO,SAAQ,EAAInC,EAAQ,SAAQ,CAAE,CAAC,MAC/C,CACM,IAAMs9B,GAAiBL,GClD9B,SAASM,GAAwBrpD,EAAe,CAC9C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,MAAM,EACnCqd,EAAqB,CAAC,EAAG+e,CAAE,EACjC,OAAOzV,EAAO,UAAUlV,GAAM4L,CAAmC,CACnE,CACO,IAAMisC,GAAuB7rD,EAAG,CAAC,MAAK4rD,EAAA,CAAC,ECL9C,SAASE,GAAuBvpD,EAAe,CAC7C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,MAAO,SAAS,EAE7Cqd,EAAoB,CAAC,EAAG+e,CAAE,EAEhC,OAAOzV,EAAO,UAAUpV,GAAK8L,CAAmC,CAClE,CACO,IAAMmsC,GAAsB/rD,EAAG,CAAC,KAAI8rD,EAAA,CAAC,ECP5C,SAASE,GAAwBzpD,EAAe,CAC9C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,MAAM,EACnCqd,EAAqB,CAAC,EAAG+e,CAAE,EAEjC,OAAOzV,EAAO,UAAUnV,GAAM6L,CAAmC,CACnE,CACO,IAAMqsC,GAAuBjsD,EAAG,CAAC,MAAKgsD,EAAA,CAAC,ECf9C,SAASE,GACL3pD,EAAwBilC,EAAezjC,EAAY,CACrD,IAAM46B,EAAK/P,EAAgBrsB,EAAG,IAAK,SAAS,EAC5CuiB,OAAAA,EACI6Z,EAAG,OAAS,EACZ,UAAA,CACI,MAAA,mDAAA,OAAmDA,EAAG,KAAI,SAAA,CAA1D,CAAmE,EACpE1K,GAAM0K,EAAI,CAAC6I,CAAK,EAAG,CAACzjC,CAAI,CAAC,CAClC,CACO,IAAMooD,GAA0BnsD,EAAG,CAAC,SAAQksD,EAAA,CAAC,ECTpD,SAASE,GACL7pD,EAAwBilC,EACxBzjC,EAAsB,CACxB,IAAM46B,EAAK/P,EAAgBrsB,EAAG,IAAK,SAAS,EAC5CuiB,OAAAA,EACI6Z,EAAG,OAAS,EACZ,UAAA,CACI,MAAA,mDAAA,OAAmDA,EAAG,KAAI,SAAA,CAA1D,CAAmE,EACpE1K,GAAM0K,EAAI6I,EAAOzjC,CAAI,CAC9B,CACO,IAAMsoD,GAA0BrsD,EAAG,CAAC,SAAQosD,EAAA,CAAC,ECVpD,SAASE,GACL/pD,EAAwBilC,EACxBzjC,EAA8B,CAChC,IAAM46B,EAAK/P,EAAgBrsB,EAAG,IAAK,SAAS,EAC5CuiB,OAAAA,EACI6Z,EAAG,OAAS,EACZ,UAAA,CACI,MAAA,mDAAA,OAAmDA,EAAG,KAAI,SAAA,CAA1D,CAAmE,EACpE1K,GAAM0K,EAAI6I,EAAOzjC,CAAI,CAC9B,CACO,IAAMwoD,GAA0BvsD,EAAG,CAAC,SAAQssD,EAAA,CAAC,ECVpD,SAASE,GACLjqD,EAAwBilC,EACxBzjC,EAAsC,CACxC,IAAM46B,EAAK/P,EAAgBrsB,EAAG,IAAK,SAAS,EAC5CuiB,OAAAA,EACI6Z,EAAG,OAAS,EACZ,UAAA,CACI,MAAA,mDAAA,OAAmDA,EAAG,KAAI,SAAA,CAA1D,CAAmE,EACpE1K,GAAM0K,EAAI6I,EAAOzjC,CAAI,CAC9B,CACO,IAAM0oD,GAA0BzsD,EAAG,CAAC,SAAQwsD,EAAA,CAAC,ECSpD,SAASE,GAA2BtT,EAAsB5J,EAAQ,CAARA,IAAA,SAAAA,EAAA,IACxD,IAAM6J,EAAUzqB,EAAgBwqB,EAAQ,SAAU,UAAW,SAAS,EAKtE,GAHI5J,IAAQ,KACVA,EAAM6J,EAAQ,KAAO,GAEnB7J,IAAQ6J,EAAQ,KAAO,EACzB,MAAM,MACF,4DACA,mBAAA,OAAmBA,EAAQ,KAAI,eAAA,EAAA,OAAgB7J,CAAG,CAAE,EAG1D,IAAM5vB,EAAwB,CAAC,OAAQy5B,CAAO,EACxC/vB,EAAsB,CAAC,IAAGkmB,CAAA,EAEhC,OAAOtmB,EAAO,UACV3U,GAASqL,EACT0J,CAAgC,CACtC,CAEO,IAAMkwB,GAA0Bx5C,EAAG,CAAC,SAAQ0sD,EAAA,CAAC,EC3BpD,SAASC,GAAK3rC,EAAa,CACzB3d,EACI2d,EAAM,QAAU,YAChB,UAAM,CAAA,MAAA,qDACF,WAAA,OAAWA,EAAM,MAAK,GAAA,CADpB,CACuB,EAEjC,IAAMpB,EAAoB,CAAC,MAAKoB,CAAA,EAEhC,OAAOkI,EAAO,UAAUpa,GAAK8Q,CAAmC,CAClE,CAEO,IAAMgtC,GAAsB5sD,EAAG,CAAC,KAAI2sD,EAAA,CAAC,ECX5C,SAASE,GAAM7rC,EAAa,CAC1B3d,EACI2d,EAAM,QAAU,YAChB,UAAM,CAAA,MAAA,sDACF,WAAA,OAAWA,EAAM,MAAK,GAAA,CADpB,CACuB,EAEjC,IAAMpB,EAAqB,CAAC,MAAKoB,CAAA,EAEjC,OAAOkI,EAAO,UAAUzZ,GAAMmQ,CAAmC,CACnE,CAEO,IAAMktC,GAAuB9sD,EAAG,CAAC,MAAK6sD,EAAA,CAAC,ECJ9C,SAASE,GAAO/rC,EAAa,CAC3B,IAAMgsC,EAAqBhsC,EAAM,MAAMA,EAAM,MAAM,OAAS,CAAC,EACvDisC,EAAQjsC,EAAM,KAAOgsC,EACvBvlD,EACJ,GAAIulD,GAAsB,EAAG,CAC3B,IAAME,EAAe/mB,EAAQnlB,EAAO,CAACisC,EAAOD,CAAkB,CAAC,EAC/DvlD,EAAMqlD,GAAKI,CAAY,CACxB,KAAM,CAGL,IAAMhgB,EAAc,CAAC+f,EAAO,GAAKD,EAAqB,EAAE,EAClDG,EAAYhnB,EAAQ3W,GAAKxO,CAAK,EAAG,CAACisC,EAAOD,CAAkB,CAAC,EAC5DI,EAAYjnB,EAAQ1W,GAAKzO,CAAK,EAAG,CAACisC,EAAOD,CAAkB,CAAC,EAE5DK,EACFnf,GAAQja,GAAMk5B,EAAW,CAAC,EAAG,CAAC,EAAG,CAACF,EAAOD,EAAqB,CAAC,CAAC,EAAG,CAAC,EAClEM,EAA0B3vC,EAC5BuwB,GAAQja,GAAMm5B,EAAW,CAAC,EAAG,CAAC,EAAG,CAACH,EAAOD,EAAqB,CAAC,CAAC,EAAG,CAAC,EACpEpZ,GAAO,EAAE,CAAC,EAERrzC,EAAIymC,GAAO,CAACmmB,EAAWE,CAAa,EAAG,CAAC,EACxChtD,EAAI2mC,GAAO,CAAComB,EAAWE,CAAa,EAAG,CAAC,EACxCJ,EACF/mB,EAAQtW,GAAQtvB,EAAGF,CAAC,EAAG,CAAC6sC,EAAY,CAAC,EAAGA,EAAY,CAAC,CAAC,CAAC,EAC3DzlC,EAAMqlD,GAAKI,CAAY,CACxB,CAGD,GAFAzlD,EAAM+nB,GAAK/nB,CAAG,EAEVuZ,EAAM,OAAS,GAAKA,EAAM,MAAM,CAAC,IAAM,EAAG,CAC5C,IAAMle,EAAO2E,EACP8lD,EAAQvsC,EAAM,MAAM,CAAC,EAC3BvZ,EAAM0+B,EAAQ1+B,EAAK,CAAC8lD,EAAO9lD,EAAI,MAAM,CAAC,EAAI8lD,EAAO9lD,EAAI,MAAM,CAAC,CAAC,CAAC,EAC9D3E,EAAK,QAAO,CACb,CACD,OAAO2E,CACT,CAEO,IAAM+lD,GAAwBxtD,EAAG,CAAC,OAAM+sD,EAAA,CAAC,ECxBhD,SAASU,GACLlrD,EAAsBmrD,EAAkCjoD,EAAQ,CAARA,IAAA,SAAAA,EAAQ,GAClE,IAAMk5B,EAAK/P,EAAgBrsB,EAAG,IAAK,OAAO,EAEpCqd,EAAuB,CAAC,EAAG+e,CAAE,EAC7BoI,EAAoB,CAAC,gBAAe2mB,EAAE,KAAIjoD,CAAA,EAEhD,OAAOyjB,EAAO,UACH5U,GAAQsL,EACRmnB,CAA+B,CAC5C,CAEO,IAAM4mB,GAAwB3tD,EAAG,CAAC,OAAMytD,EAAA,CAAC,EC1BhD,SAASG,GAAM5sC,EAAe6sC,EAAkB,CAC9CxqD,EACI2d,EAAM,QAAU,UAChB,UAAA,CAAM,MAAA,mDAAA,OAAmDA,EAAM,KAAK,CAA9D,CAAgE,EAE1E,IAAIgsC,EAAqBhsC,EAAM,MAAMA,EAAM,MAAM,OAAS,CAAC,EACrDisC,EAAQjsC,EAAM,KAAOgsC,EAEvBc,EACJ,GAAID,GAAa,MAAQA,EAAYb,EAAoB,CAEvD,IAAMxlB,EAAQxmB,EAAM,MAAM,IAAI,SAAAjhB,EAAC,CAAI,MAAA,EAAA,CAAC,EAC9BgE,EAAOid,EAAM,MAAM,IAAI,SAAAjhB,EAAC,CAAI,OAAAA,CAAA,CAAC,EACnCgE,EAAKid,EAAM,MAAM,OAAS,CAAC,EAAI6sC,EAC/BC,EAAgB75B,GAAMjT,EAAOwmB,EAAOzjC,CAAI,EACxCipD,EAAqBa,CACtB,SAAUA,GAAa,MAAQA,EAAYb,EAAoB,CAE9D,IAAMe,EAAa/sC,EAAM,MAAM,IAAI,SAAAjhB,EAAC,CAAI,OAAAA,CAAA,CAAC,EACzCguD,EAAW/sC,EAAM,MAAM,OAAS,CAAC,EAAI6sC,EAAYb,EACjDc,EAAgB9mB,GAAO,CAAChmB,EAAO6vB,GAAMkd,CAAU,CAAC,EAAG/sC,EAAM,MAAM,OAAS,CAAC,EACzEgsC,EAAqBa,CACtB,MACCC,EAAgB9sC,EAIlB,IAAMgtC,EAAatd,GAAUod,CAAa,EACpCZ,EACF/mB,EAAQtW,GAAQi+B,EAAeE,CAAU,EAAG,CAACf,EAAOD,CAAkB,CAAC,EAErEvlD,EAAMmlD,GAAIM,CAAY,EAGtBe,EAAO,KAAK,MAAMjB,EAAqB,CAAC,EAAI,EAC5CkB,EAAa1+B,GAAK/nB,CAAG,EACrB0mD,EAAa1+B,GAAKhoB,CAAG,EACrB2mD,EAAuBT,GACzBO,EAAY,CAACD,EAAMjB,EAAqBiB,CAAI,EAC5CC,EAAW,MAAM,OAAS,CAAC,EACzBG,EAAuBV,GACzBQ,EAAY,CAACF,EAAMjB,EAAqBiB,CAAI,EAC5CE,EAAW,MAAM,OAAS,CAAC,EAEzBjhB,EAAc4gB,EAAc,MAAM,MAAK,EAC7C,OAAA5gB,EAAY4gB,EAAc,MAAM,OAAS,CAAC,EAAIG,EAEvC9nB,EACHtW,GAAQu+B,EAAqB,CAAC,EAAGC,EAAqB,CAAC,CAAC,EAAGnhB,CAAW,CAC5E,CAEO,IAAMohB,GAAuBtuD,EAAG,CAAC,MAAK4tD,EAAA,CAAC,EC9C9C,SAASW,GACLrrD,EAAsB9E,EAAoB,OACxC8gC,EAAKtQ,EAAgB1rB,EAAG,IAAK,mBAAmB,EAChDi8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,mBAAmB,EACpDmL,EAAAjJ,EAAW4mB,GAAegY,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAE31B,EAAA,CAAA,EAAE41B,EAAE51B,EAAA,CAAA,EAEPsmC,GAA2B3Q,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMvf,EAAkC,CAAC,EAAGsf,EAAI,EAAGC,CAAE,EAC/C7V,EAAQ,CAAA,EAEd,OAAOJ,EAAO,UACVrU,GAAmB+K,EAAqC0J,CAAK,CACnE,CAEO,IAAMklC,GAAoCxuD,EAAG,CAAC,mBAAkBuuD,EAAA,CAAC,EC3BxE,SAASE,GAA2BlsD,EAAsBkD,EAAe,CACvE,IAAMk5B,EAAK/P,EAAgBrsB,EAAG,IAAK,UAAW,mBAAmB,EACjE,OAAO4jC,EAAQxH,EAAI/4B,GAAa+4B,EAAG,MAAOl5B,CAAI,EAAE,QAAQ,CAC1D,CAEO,IAAMipD,GAA0B1uD,EAAG,CAAC,SAAQyuD,EAAA,CAAC,ECFpD,SAASE,GACL5jC,EAA8BtlB,EAAQ,CAARA,IAAA,SAAAA,EAAQ,GACxC,IAAMs6B,EACF/Q,GAAqBjE,EAAS,UAAW,QAAS,mBAAmB,EAEzEjG,EACIib,EAAS,QAAU,EAAG,UAAA,CAAM,MAAA,sCAAA,CAAsC,EAElEA,EAAS,OAAS,GACpBjb,EACIrf,GAAQs6B,EAAS,CAAC,EAAE,KAAM,UAAM,CAAA,MAAA,oCAAA,CAAoC,EAG1E,IAAMngB,EAAqBmgB,EACrBzW,EAAmB,CAAC,KAAI7jB,CAAA,EAE9B,OAAOyjB,EAAO,UACVhX,GAAM0N,EACN0J,CAAgC,CACtC,CAEO,IAAMslC,GAAwB5uD,EAAG,CAAC,OAAM2uD,EAAA,CAAC,ECxBhD,SAASE,GAAwBtsD,EAAiBm0C,EAAW,CAAXA,IAAA,SAAAA,EAAW,GAC3D,IAAM/X,EAAK/P,EAAgBrsB,EAAG,IAAK,MAAM,EAEnCqd,EAAqB,CAAC,EAAG+e,CAAE,EAC3BrV,EAAmB,CAAC,MAAKotB,CAAA,EAE/B,OAAOxtB,EAAO,UACVlT,GAAM4J,EACN0J,CAAgC,CACtC,CACO,IAAMpqB,GAAuBc,EAAG,CAAC,MAAK6uD,EAAA,CAAC,ECU9C,SAASC,GACLvsD,EAAsBilC,EAAiBlpB,EAAejX,EACtD0nD,EAAeC,EAAaC,EAAkBC,EAC9CC,EAAkB,CADlBJ,IAAA,SAAAA,EAAa,GAAEC,IAAA,SAAAA,EAAW,GAAEC,IAAA,SAAAA,EAAgB,GAAEC,IAAA,SAAAA,EAAe,GAC7DC,IAAA,SAAAA,EAAkB,GACpB,IAAMxwB,EAAK/P,EAAgBrsB,EAAG,IAAK,eAAgB,mBAAmB,EAEhEqd,EAA6B,CAAC,EAAG+e,CAAE,EACnCrV,EAA2B,CAC/B,MAAKke,EACL,IAAGlpB,EACH,QAAOjX,EACP,UAAS0nD,EACT,QAAOC,EACP,aAAYC,EACZ,YAAWC,EACX,eAAcC,GAGhB,OAAOjmC,EAAO,UACVlU,GAAc4K,EACd0J,CAAgC,CACtC,CAEO,IAAM8lC,GAA+BpvD,EAAG,CAAC,cAAa8uD,EAAA,CAAC,EC7C9D,SAASO,GAAuB9sD,EAAe,CAC7C,IAAMo8B,EAAK/P,EAAgBrsB,EAAG,IAAK,MAAO,SAAS,EAE7Cqd,EAAoB,CAAC,EAAG+e,CAAE,EAEhC,OAAOzV,EAAO,UAAU7T,GAAKuK,CAAmC,CAClE,CACO,IAAM0vC,GAAsBtvD,EAAG,CAAC,KAAIqvD,EAAA,CAAC,ECL5B,SAAAE,GAAS9tD,EAAsBE,EAAgB,CAC7DkC,GAAcpC,CAAM,EACpB,IAAMstB,EAAgBd,GAAWxsB,EAAQE,CAAK,EAC9C,GAAIotB,EAAc,SAAW,EAC3B,MAAM,IAAI,MAAM,oDAAoD,EAEtE,IAAMrtB,EAAkB,KACxB,OAAOouB,GAAWruB,EAAQC,EAAOqtB,EAAeptB,CAAK,CACvD,UCDgB6tD,GACZ/tD,EAAsBC,EACtBC,EAAgB,CAElB,GADAkC,GAAcpC,CAAM,EAChBC,GAAS,MAAQA,EAAM,SAAW,EACpC,MAAM,IAAI,MAAM,+CAA+C,EAEjE,IAAMqtB,EAAgBd,GAAWxsB,EAAQE,CAAK,EAC9C,GAAIotB,EAAc,SAAW,GAAKA,EAAc,SAAW,EACzD,MAAM,IAAI,MACN,gEAAgE,EAEtE,GAAIA,EAAc,SAAW,GAAKrtB,GAAS,KACzC,MAAM,IAAI,MACN,8EACuB,EAE7B,OAAOouB,GAAWruB,EAAQC,EAAOqtB,EAAeptB,CAAK,CACvD,UClBgB8tD,GACZhuD,EAAsBC,EACtBC,EAAgB,CAElB,GADAkC,GAAcpC,CAAM,EAChBC,GAAS,MAAQA,EAAM,SAAW,EACpC,MAAM,IAAI,MAAM,iDAAiD,EAEnE,IAAMqtB,EAAgBd,GAAWxsB,EAAQE,CAAK,EAC9C,GAAIotB,EAAc,SAAW,GAAKA,EAAc,SAAW,EACzD,MAAM,IAAI,MACN,kEAAkE,EAExE,GAAIA,EAAc,SAAW,GAAKrtB,GAAS,KACzC,MAAM,IAAI,MACN,yEACkB,EAExB,OAAOouB,GAAWruB,EAAQC,EAAOqtB,EAAeptB,CAAK,CACvD,UClBgB+tD,GACZjuD,EAAsBC,EACtBC,EAAgB,CAElB,GADAkC,GAAcpC,CAAM,EAChBC,GAAS,MAAQA,EAAM,SAAW,EACpC,MAAM,IAAI,MAAM,gDAAgD,EAElE,IAAMqtB,EAAgBd,GAAWxsB,EAAQE,CAAK,EAC9C,GAAIotB,EAAc,SAAW,GAAKA,EAAc,SAAW,EACzD,MAAM,IAAI,MACN,oEAAoE,EAE1E,GAAIA,EAAc,SAAW,GAAKrtB,GAAS,KACzC,MAAM,IAAI,MACN,yEACkB,EAExB,OAAOouB,GAAWruB,EAAQC,EAAOqtB,EAAeptB,CAAK,CACvD,UClBgBguD,GACZluD,EAAsBC,EACtBC,EAAgB,CAElB,GADAkC,GAAcpC,CAAM,EAChBC,GAAS,MAAQA,EAAM,SAAW,EACpC,MAAM,IAAI,MAAM,gDAAgD,EAElE,IAAMqtB,EAAgBd,GAAWxsB,EAAQE,CAAK,EAC9C,GAAIotB,EAAc,SAAW,GAAKA,EAAc,SAAW,EACzD,MAAM,IAAI,MACN,sEACqC,EAE3C,GAAIA,EAAc,SAAW,GAAKrtB,GAAS,KACzC,MAAM,IAAI,MACN,yEACkB,EAExB,OAAOouB,GAAWruB,EAAQC,EAAOqtB,EAAeptB,CAAK,CACvD,UCnBgBiuD,GACZnuD,EACAC,EACAC,EAAgB,CAElB,GADAkC,GAAcpC,CAAM,EAChBC,GAAS,MAAQA,EAAM,SAAW,EACpC,MAAM,IAAI,MAAM,+CAA+C,EAEjE,IAAMqtB,EAAgBd,GAAWxsB,EAAQE,CAAK,EAC9C,GAAIotB,EAAc,SAAW,GAAKA,EAAc,SAAW,EACzD,MAAM,IAAI,MACN,wEACiB,EAEvB,GAAIA,EAAc,SAAW,GAAKrtB,GAAS,KACzC,MAAM,IAAI,MACN,yEACkB,EAExB,OAAAA,EAAQA,GACJqtB,EACGe,GAAWruB,EAAQC,EAAOqtB,EAAeptB,CAAK,CACvD,UC3CgBkuD,GACZnuD,EAAiB2sB,EAAiByhC,EAAe,CACnD,IAAMC,EAAY1hC,EAAQ,KAAO,EAAKA,EAAQ,MAAMA,EAAQ,KAAO,CAAC,EAAI,EAClE2hC,EAAY3hC,EAAQ,KAAO,EAAKA,EAAQ,KAAO,EAAI,EAEnD4hC,EAAa,wDACf,wCAAwC,OAAAH,EAAQ,KAAK,EACrD,oBAAA,OAAoBzhC,EAAQ,MAAK,WAAA,EAAA,OAAY3sB,CAAK,EAClD,eAAA,OAAequD,EAAQ,kBAAA,EAAA,OAAmBC,EAAQ,GAAA,EAEtD,GAAIF,EAAQ,KAAOE,EACjB,MAAM,IAAI,MAAMC,EAAa,kBAAkB,OAAAD,EAAY,IAAA,CAAA,EAE7D,GAAItuD,EAAM,OAASquD,GAAYD,EAAQ,KAAOE,GAC5C,MAAM,IAAI,MACNC,EACA,0BAA0B,OAAAF,GAAYD,EAAQ,KAAOE,EAAS,CAAE,EAEtE,GAAIF,EAAQ,OAASE,EAAWtuD,EAAM,OAASquD,EAC7C,MAAM,IAAI,MACNE,EAAa,mBAAmB,OAAAD,EAAWtuD,EAAM,OAASquD,CAAQ,CAAE,EAE1E,QAAS5xD,EAAI,EAAGA,EAAI6xD,EAAU,EAAE7xD,EAC9B,GAAI2xD,EAAQ,MAAM3xD,CAAC,IAAMkwB,EAAQ,MAAMlwB,CAAC,EACtC,MAAM,IAAI,MACN8xD,EACA,kBAAA,OAAkB9xD,EAAO,KAAA,EAAA,OAAA2xD,EAAQ,MAAM3xD,CAAC,EAAC,qBAAA,EAAA,OAAsBA,EAC3D,KAAA,EAAA,OAAAkwB,EAAQ,MAAMlwB,CAAC,EAAC,IAAA,CAAI,EAGhC,QAASA,EAAI,EAAGA,EAAI2xD,EAAQ,KAAOE,EAAU,EAAE7xD,EAC7C,GAAI2xD,EAAQ,MAAM3xD,EAAI6xD,CAAQ,IAAMtuD,EAAMvD,EAAI4xD,CAAQ,EACpD,MAAM,IAAI,MACNE,EACA,kBAAkB,OAAA9xD,EAAI6xD,EAClB,KAAA,EAAA,OAAAF,EAAQ,MAAM3xD,EAAI6xD,CAAQ,EAAC,aAAA,EAAA,OAAc7xD,EAAI6xD,EAAQ,KAAA,EAAA,OACrDtuD,EAAMvD,EAAI6xD,CAAQ,EAAI,GAAA,CAAA,CAGpC,UAgBgBE,GACZJ,EAAiBzhC,EAAiB3sB,EAAe,CACnD,GAAI2sB,EAAQ,KAAO,EACjB,MAAM,IAAI,MACN,6DACA,qBAAA,OAAqBA,EAAQ,KAAI,GAAA,CAAG,EAE1C,GAAIyhC,EAAQ,KAAO,EACjB,MAAM,IAAI,MACN,6DACA,qBAAA,OAAqBA,EAAQ,KAAI,GAAA,CAAG,EAE1C,GAAIzhC,EAAQ,QAAU,QACpB,MAAM,IAAI,MAAM,0DAAA,OACZA,EAAQ,KAAK,CAAE,EAErB,GAAI3sB,EAAM,OAAS,EACjB,MAAM,IAAI,MACN,6DAAA,OAA6DA,CAAK,CAAE,EAG1E,GAAIA,EAAM,SAAW,EAAG,CACtB,GAAI2sB,EAAQ,OAAS,EACnB,MAAM,IAAI,MAAM,sDAAA,OACZA,EAAQ,KAAK,CAAE,EAErB,GAAIyhC,EAAQ,OAAS,EACnB,MAAM,IAAI,MAAM,sDAAA,OACZA,EAAQ,KAAK,CAAE,CAEtB,CAEDD,GAAoBnuD,EAAO2sB,EAASyhC,CAAO,CAC7C,UAWgBK,GACZL,EAAqBzhC,EACrB3sB,EAAe,CAWjB,QATM0uD,EAAc/hC,EAAQ,MAAM,OAC5BgiC,EAAaD,EAAc,EAAK/hC,EAAQ,MAAM+hC,EAAc,CAAC,EAAI,EAKjEE,EAAU5uD,EAAM,OAElB6mC,EAAY,EACP,EAAI8nB,EAAW,EAAIC,EAAS,EAAE,EACrC/nB,GAAa7mC,EAAM,CAAC,EAGtB,IAAM6uD,EAAgBF,EAAY,EAAK,EAAIA,EACrCG,EAAa1sD,GAAcuqB,EAAQ,KAAK,EAAIkiC,EAE5ClpD,EAAc3G,GAAAA,GAAA,CAAA,EAAAJ,EAAA8G,GAAe1F,EAAM,MAAM,EAAG2uD,CAAS,CAAC,CAAC,EAAE,EAAA,EAAA,CAAA,CAAC,EAAA,EAAA,EAC1D3E,EAAa5nD,GAAcpC,CAAK,EACtC,MAAO,CAAC,UAAS2uD,EAAE,WAAUG,EAAE,UAASjoB,EAAE,QAAOlhC,EAAE,WAAUqkD,CAAA,CAC/D,oFCzFA,SAAS+E,GACLppC,EAA8BgH,EAC9ByhC,EAA0B,CAC5B,IAAMY,EAAU9hC,EAAgBvH,EAAQ,SAAU,qBAAqB,EACjEsuB,EACF/mB,EAAgBP,EAAS,UAAW,sBAAuB,OAAO,EAChEsiC,EAAW/hC,EAAgBkhC,EAAS,UAAW,qBAAqB,EAE1E,GADAc,GAA8BD,EAAUhb,EAAU+a,EAAQ,KAAK,EAC3DA,EAAQ,QAAUC,EAAS,MAC7B,MAAM,IAAI,MACN,iEAAA,OACID,EAAQ,MAAK,OAAA,EAAA,OAAQC,EAAS,MAAK,GAAA,CAAG,EAGhD,IAAM/wC,EAAoC,CACxC,OAAQ8wC,EACR,QAAS/a,EACT,QAASgb,GAELrnC,EAAkC,CAAA,EAGxC,OAAOJ,EAAO,UACHzV,GAAqBmM,EACrB0J,CAAgC,CAC7C,CAEa,IAAAunC,GAAsB7wD,EAAG,CAAC,qBAAoBywD,EAAA,CAAC,ECnC5D,SAASK,GACLvuD,EAAiBulB,EAAOipC,EAAa,CAApBjpC,IAAA,SAAAA,EAAK,GAAEipC,IAAA,SAAAA,EAAa,IACvC,IAAMpyB,EAAK/P,EAAgBrsB,EAAG,IAAK,MAAM,EACzC,GAAIo8B,EAAG,OAAS,EACd,MAAM,IAAI,MAAM,oDAAoD,EAEtE,IAAMqyB,EAAUryB,EAAG,MAAMA,EAAG,MAAM,OAAS,CAAC,EAE5C,GAAI7W,EAAI,EACN,MAAM,IAAI,MAAM,6CAAA,OAA6CA,CAAC,CAAE,EAGlE,GAAIA,EAAIkpC,EACN,MAAM,IAAI,MACN,uDAAA,OAAuDA,EAAW,IAAA,EAClE,WAAW,OAAAlpC,CAAC,CAAE,EAGpB,IAAMlI,EAAqB,CAAC,EAAG+e,CAAE,EAC3BrV,EAAmB,CAAC,EAACxB,EAAE,OAAMipC,CAAA,EAE7BxnD,EAAAjJ,EAAoB4oB,EAAO,UAC7B1T,GAAMoK,EACN0J,CAAgC,EAAW,CAAA,EAFxC7nB,EAAM8H,EAAA,CAAA,EAAE8kB,EAAO9kB,EAAA,CAAA,EAItB,MAAO,CAAC,OAAM9H,EAAE,QAAO4sB,CAAA,CACzB,CAEO,IAAM4iC,GAAuBjxD,EAAG,CAAC,MAAK8wD,EAAA,CAAC,EClC9C,SAASI,GACLxvD,EAAoBwnC,EAAU0f,EAAYjnD,EAC1C0c,EAAa,CAEf,GAHsB6qB,IAAA,SAAAA,EAAQ,GAAE0f,IAAA,SAAAA,EAAU,GAE1CtgD,GAAmC5G,CAAK,EACpCC,GAAS,MAASA,IAAuB,OAC3C,MAAM,IAAI,MAAM,mCAAmC,EAKrD,QAHMknD,EACF,IAAIjB,GAAY1e,EAAM0f,EAAQjnD,EAAO,GAAsB0c,CAAI,EAC7DpC,EAAMuU,GAAO9uB,EAAOC,CAAK,EACtB,EAAI,EAAG,EAAIsa,EAAI,OAAO,OAAQ,IACrCA,EAAI,OAAO,CAAC,EAAI4sC,EAAU,UAAS,EAErC,OAAO5sC,EAAI,SAAQ,CACrB,CAEO,IAAMk1C,GAAkCnxD,EAAG,CAAC,iBAAgBkxD,EAAA,CAAC,ECgBpE,SAASE,GACL7uD,EAAiBkD,EAAQ,CAARA,IAAA,SAAAA,EAAQ,GAC3B,IAAMk5B,EAAK/P,EAAgBrsB,EAAG,IAAK,SAAU,mBAAmB,EAChEc,EAAOs7B,EAAG,KAAO,EAAG,UAAA,CAAM,MAAA,sCAAA,CAAsC,EAEhE,IAAM/e,EAAuB,CAAC,EAAG+e,CAAE,EAC7BrV,EAAqB,CAAC,KAAI7jB,CAAA,EAC1B8D,EAAAjJ,EAAoB4oB,EAAO,UAC7BvT,GAAQiK,EACR0J,CAAgC,EAAkB,CAAA,EAF/C7nB,EAAM8H,EAAA,CAAA,EAAE8kB,EAAO9kB,EAAA,CAAA,EAGtB,MAAO,CAAC,OAAM9H,EAAE,QAAO4sB,CAAA,CACzB,CAEO,IAAMgjC,GAAyBrxD,EAAG,CAAC,QAAOoxD,EAAA,CAAC,EC5ClD,SAASE,GACL/uD,EAAiBgvD,EAAiCC,EAAmB,CACvE,IAAM7yB,EAAK/P,EAAgBrsB,EAAG,IAAK,oBAAoB,EACjDkvD,EACF7iC,EAAgB2iC,EAAY,aAAc,qBAAsB,OAAO,EAC3EluD,EAAOe,GAAMotD,CAAW,EAAG,UAAM,CAAA,MAAA,kCAAkC,CAAA,EAEnE,IAAM5xC,EAAmC,CAAC,EAAG+e,EAAI,WAAY8yB,CAAW,EAClEnoC,EAAiC,CAAC,YAAWkoC,CAAA,EAEnD,OAAOtoC,EAAO,UACVrT,GAAoB+J,EACpB0J,CAAgC,CACtC,CAEO,IAAMooC,GAAqC1xD,EAAG,CAAC,oBAAmBsxD,EAAA,CAAC,ECnB1E,SAASK,GAASpvD,EAAsBkD,EAAQ,CAARA,IAAA,SAAAA,EAAQ,GAC9C,IAAMk5B,EAAK/P,EAAgBrsB,EAAG,IAAK,UAAW,mBAAmB,EACjEuiB,EACIrf,GAAQ,CAACk5B,EAAG,MAAM,QAAUl5B,EAAOk5B,EAAG,MAAM,OAC5C,UACI,CAAA,MAAA,UAAA,OAAUl5B,EAAI,eAAA,EAAA,OAAgBk5B,EAAG,MAAM,OAAM,IAAA,EAAA,OAAKA,EAAG,MAAM,OAAM,GAAA,CAAjE,CAAoE,EAE5E,IAAM/e,EAAuB,CAAC,MAAO+e,CAAE,EACjCrV,EAAqB,CAAC,KAAI7jB,CAAA,EAEhC,OAAOyjB,EAAO,UACVtT,GAAQgK,EACR0J,CAAgC,CACtC,CAEO,IAAMsoC,GAA0B5xD,EAAG,CAAC,SAAQ2xD,EAAA,CAAC,ECFpC,SAAAE,GACZvX,EAAmC74C,EAAyB,CAC9D,OAAOo5C,GAAaP,EAAgB74C,EAAQ,OAAO,CACrD,CCrBM,SAAU02C,GACZjyB,EAAyBL,EAAkBxb,EAC3C1I,EAAgB,CADS,OAAAkkB,IAAA,SAAAA,EAAgB,IAEpCqD,EAAO,aAAahD,EAAcL,EAAWxb,EAAM1I,CAAK,CAEjE,CCnBgB,SAAAmwD,GAAUC,EAAqBC,EAAoB,CAEjE,QADM3jC,EAAU,CAAA,EACPhuB,EAAI,EAAGA,EAAI2xD,EAAS,OAAQ3xD,IAC/B2xD,EAAS3xD,CAAC,GACZguB,EAAQ,KAAKhuB,CAAC,EAOlB,QAHM4xD,EAAWzhC,GAAOuhC,EAAW,OAAO,EAEpC3nC,EAAMoG,GAAO,CAACnC,EAAQ,OAAQ0jC,EAAU,MAAM,EAAG,OAAO,EACrD1xD,EAAI,EAAGA,EAAIguB,EAAQ,OAAQhuB,IAAK,CACvC,IAAM6kB,EAAM+sC,EAAS,WAAW5jC,EAAQhuB,CAAC,CAAC,EACpCkH,EAASlH,EAAI0xD,EAAU,OAC7B3nC,EAAI,OAAO,IAAIlF,EAAK3d,CAAM,CAC3B,CACD,OAAO6iB,EAAI,SAAQ,CACrB,CCCA,SAAe8nC,GAAYhiB,EAA4B,qGAC/C,OAAAC,EACFvhB,EAAgBshB,EAAW,YAAa,aAAc,MAAM,EACnD,CAAA,EAAMC,EAAW,KAAI,CAAE,SAA9B,OAAA/pC,EAAOmD,EAAuB,KAAA,EAC9B0S,EAAM61C,GAAU3hB,EAAW,MAAO/pC,CAAI,EACxC8pC,IAAcC,GAChBA,EAAW,QAAO,EAEpB,CAAA,EAAOl0B,CAAG,MACX,CAEM,IAAMk2C,GAAaD,GCP1B,SAAeE,GACX/qC,EAA2By8B,EAC3Br+C,EAAa,yHAcf,IAbMirD,EAAU9hC,EAAgBvH,EAAQ,SAAU,UAAU,EACtDgrC,EAAQzjC,EAAgBk1B,EAAM,OAAQ,WAAY,MAAM,EAExDwO,EAAW7sD,GAAe,EAC1B8sD,EAAUF,EAAM,KAChBG,EAAc9B,EAAQ,MAE5B5rC,EAAYytC,EAAU,EAAG,UAAA,CAAM,MAAA,uBAAA,CAAuB,EACtD3iC,GACI4iC,EAAY,MAAMF,EAAUA,EAAWC,CAAO,EAAGF,EAAM,MACvD,mEAAmE,EAEnEI,EAAc,EACTpyD,EAAIiyD,EAAUjyD,EAAIiyD,EAAWC,EAASlyD,IAC7CoyD,GAAeD,EAAYnyD,CAAC,EAExB,OAAAqyD,EACFF,EAAY,MAAM,EAAGF,CAAQ,EACxB,OAAO,CAACG,CAAW,EAAGD,EAAY,MAAMF,EAAWC,CAAO,CAAC,EAC9DI,EAAiBxsB,EAAQuqB,EAASgC,CAAiB,EACnDE,EAAezsB,EAAQksB,EAAO,CAAC,EAAE,CAAC,EACd,CAAA,EAAMF,GAAWS,CAAY,CAAC,SAAlD,OAAAC,EAAoBtpD,EAA8B,KAAA,EAClD8kB,EAAUqgC,GAAQmE,EAAmB,CAAC,CAAC,CAAC,EAExC52C,EAAM25B,GAAO+c,EAAgBtkC,EAASikC,CAAQ,EAGhDjrC,IAAWqpC,GACbA,EAAQ,QAAO,EAEb5M,IAASuO,GACXA,EAAM,QAAO,EAEfhkC,EAAQ,QAAO,EACfskC,EAAe,QAAO,EACtBC,EAAa,QAAO,EACpBC,EAAkB,QAAO,EAEzB,CAAA,EAAO52C,CAAG,MACX,CAEM,IAAM62C,GAAmBV,GCrChC,SAASW,GACLxwD,EAAiBywD,EAAiBC,EAAmB,CACvD,IAAMt0B,EAAK/P,EAAgBrsB,EAAG,IAAK,WAAW,EAgB9C,GAdIywD,GAAQ,OACVA,EAAOr0B,EAAG,MAAM,IAAI,SAACx+B,EAAG,EAAM,CAAA,OAAA,CAAA,CAAC,EAAE,QAAO,GAE1C2kB,EACI6Z,EAAG,OAASq0B,EAAK,OACjB,UAAM,CAAA,MAAA,qCAAA,OAAqCr0B,EAAG,KAAO,GAAA,EACjD,6BAAA,OAA6Bq0B,EAAI,GAAA,CAD/B,CACkC,EAC5CA,EAAK,QAAQ,SAAAvtD,EAAI,CACfqf,EACIrf,GAAQ,GAAKA,EAAOk5B,EAAG,KACvB,UAAA,CAAM,MAAA,+CAAA,OAA+CA,EAAG,KAAO,CAAC,EAC5D,YAAA,OAAYq0B,CAAI,CADd,CACgB,CAC5B,CAAC,EAEGr0B,EAAG,MAAQ,EACb,OAAOA,EAAG,MAAK,EAGjB,IAAM/e,EAA0B,CAAC,EAAG+e,CAAE,EAChCrV,EAAwB,CAAC,KAAI0pC,CAAA,EAEnC,OAAIr0B,EAAG,QAAU,YACRvc,GAAK,UAAA,CACV,IAAIsN,EAAQF,GAAKmP,CAAE,EACfhP,EAAQF,GAAKkP,CAAE,EACnB,OAAAjP,EAAQxG,EAAO,UACXxT,GAAW,CAAC,EAAGga,CAAK,EACpBpG,CAAgC,EACpCqG,EAAQzG,EAAO,UACXxT,GAAW,CAAC,EAAGia,CAAK,EACpBrG,CAAgC,EAChC2pC,IACFtjC,EAAQ8oB,GAAI9oB,CAAK,GAEZE,GAAQH,EAAOC,CAAK,CAC7B,CAAC,EAGIzG,EAAO,UACVxT,GAAWkK,EACX0J,CAAgC,CACtC,CAEO,IAAM4pC,GAA4BlzD,EAAG,CAAC,WAAU+yD,EAAA,CAAC,ECxCxD,SAASI,GACLpzD,EAAiBwC,EAAiB6wD,EAClCl0D,EAAsBm0D,EAAiB,CAAjBA,IAAA,SAAAA,EAAiB,IACzC,IAAMC,EAAK1kC,EAAgB7uB,EAAG,IAAK,eAAe,EAC5C4+B,EAAK/P,EAAgBrsB,EAAG,IAAK,eAAe,EAC5CgxD,EAAS3kC,EAAgBwkC,EAAO,QAAS,eAAe,EAE9DjsC,GAAiBmsC,EAAI30B,CAAE,EACvB7Z,EACIpC,GAAiB4wC,EAAG,MAAO30B,EAAG,KAAK,EAAG,UAAA,CAAM,MAAA,2BAA2B,CAAA,EAE3E,IAAM60B,EAAM5f,GAAO,CAAC,EACd6f,EAAgBva,GAAIsa,EAAKD,CAAM,EAEjCG,EAAS/1C,EAAIu7B,GAAIva,EAAI20B,CAAE,EAAGG,CAAa,EAC3C,GAAIJ,EAAY,CACdvuC,EACI5lB,GAAQ,KAAM,UAAA,CAAM,MAAA,gDAAA,CAAgD,EACxE,IAAMy0D,EAAQ/kC,EAAgB1vB,EAAM,OAAQ,eAAe,EAC3Dw0D,EAASp5C,GAAIo5C,EAAQxa,GAAIsa,EAAK7f,GAAI4f,EAAQI,CAAK,CAAC,CAAC,CAClD,CACD,OAAOtxC,GAAIixC,EAAII,CAAM,CACvB,CAEO,IAAME,GAAgC5zD,EAAG,CAAC,eAAcmzD,EAAA,CAAC,ECnChE,SAASU,GACLxlC,EAA4ByhC,EAC5BpuD,EAAkB,CACpB4G,GAAmC5G,CAAK,EACxC,IAAMi0C,EAAW/mB,EAAgBP,EAAS,UAAW,YAAa,OAAO,EACnEsiC,EAAW/hC,EAAgBkhC,EAAS,UAAW,WAAW,EAChEc,GAA8BD,EAAUhb,EAAUj0C,CAAK,EAEvD,IAAMke,EAA0B,CAAC,QAAS+1B,EAAU,QAASgb,CAAQ,EAC/DrnC,EAAwB,CAAC,MAAK5nB,CAAA,EAGpC,OAAOwnB,EAAO,UACH1V,GAAWoM,EACX0J,CAAgC,CAC7C,CAEO,IAAMwqC,GAA4B9zD,EAAG,CAAC,WAAU6zD,EAAA,CAAC,EClClD,SAAU3D,GACZ6D,EAAuBC,EAAsB9mB,EAC7C+mB,EAAqB,CACvB,GAAIF,EAAc,QAAU,QAC1B,MAAM,IAAI,MACN,2DACA,sBAAA,OAAsBA,EAAc,MAAK,GAAA,CAAG,EAElD,GAAIA,EAAc,KAAO,EACvB,MAAM,IAAI,MACN,uDACA,kBAAA,OAAkBA,EAAc,MAAK,GAAA,CAAG,EAG9C,IAAMG,EAAWH,EAAc,KAAO,EAAIA,EAAc,MAAM,CAAC,EAAI,EAC7DI,EAAUJ,EAAc,KAAO,EAAIA,EAAc,MAAM,CAAC,EAAI,EAElE,GAAI7mB,EAAY,SAAWinB,EACzB,MAAM,IAAI,MACN,iDACA,IAAA,OAAIjnB,EAAY,OAAM,eAAA,EAAA,OAAgBinB,EAAO,GAAA,CAAG,EAGtD,IAAMC,EAAYJ,EAAa,KAC/B,GAAI,EAAEA,EAAa,OAAS,GACtBA,EAAa,OAAS,GAAKI,IAAcF,GAC7C,MAAM,IAAI,MACN,oCACA,GAAA,OAAGF,EAAa,MAAK,qBAAA,EAAA,OAAsBE,EAAQ,GAAA,CAAG,EAG5D,GAAIF,EAAa,QAAUC,EAAc,MACvC,MAAM,IAAI,MAAM,mDAAmD,CAEvE,CCEA,SAASI,GACLN,EAAkCC,EAClC9mB,EAA0B0U,EAAmC,CAAnCA,IAAA,SAAAA,EAAmC,GAC/Dt5C,GAAmC4kC,CAAW,EAE9C,IAAMonB,EACF1lC,EAAgBmlC,EAAe,gBAAiB,gBAAiB,OAAO,EACtEQ,EAAgB3lC,EAClBolC,EAAc,eAAgB,gBAAiB,mBAAmB,EAChEhS,EAAgBpzB,EAClBgzB,EAAc,eAAgB,gBAAiB2S,EAAc,KAAK,EAEtEC,GACIF,EAAgBC,EAAernB,EAAa8U,CAAa,EAE7D,IAAMpiC,EAA8B,CAClC,cAAe00C,EACf,aAAcC,EACd,aAAcvS,GAGV14B,EAA4B,CAAC,YAAW4jB,CAAA,EAE9C,OAAOhkB,EAAO,UACVtU,GAAegL,EACf0J,CAAgC,CACtC,CAEO,IAAMmrC,GAAgCz0D,EAAG,CAAC,eAAcq0D,EAAA,CAAC,ECjChE,SAASK,GAAUnyD,EAAsB8rB,EAA0B,CACjE,IAAMsnB,EAAW/mB,EAAgBP,EAAS,UAAW,WAAY,OAAO,EAClEsQ,EAAK/P,EAAgBrsB,EAAG,IAAK,WAAY,mBAAmB,EAE5Dqd,EAAyB,CAAC,OAAQ+e,EAAI,QAASgX,CAAQ,EAE7D,OAAOzsB,EAAO,UAAU7Z,GAAUuQ,CAAmC,CACvE,CAEO,IAAM+0C,GAA2B30D,EAAG,CAAC,UAAS00D,EAAA,CAAC,EC3CtC,SAAAE,GAAcryD,EAAWsyD,EAAqB,CAC5D,GAAIA,GAAc,KAChB,OAAOtyD,EAAE,MAAM,MAAK,EAEtB,GAAImgB,GAAiBngB,EAAE,MAAOsyD,CAAU,EACtC,OAAOA,EAET,GAAItyD,EAAE,MAAM,SAAWsyD,EAAW,OAAQ,CAExC,QADMC,EAAyB,CAAA,EACtBz0D,EAAI,EAAGA,EAAIkC,EAAE,MAAM,OAAQlC,IAC9Bw0D,EAAWx0D,CAAC,GAAK,MAAQkC,EAAE,MAAMlC,CAAC,GAAK,KACzCy0D,EAAa,KAAKvyD,EAAE,MAAMlC,CAAC,CAAC,EAE5By0D,EAAa,KAAKD,EAAWx0D,CAAC,CAAC,EAGnC,OAAOy0D,CACR,CAED,OAAOD,CACT,CCIA,SAASE,GACLxyD,EAAsByyD,EAAcH,EACpCx2C,EAAoB,CACtB,IAAMsgB,EAAK/P,EAAgBrsB,EAAG,IAAK,SAAS,EAU5C,GARAuiB,EACI6Z,EAAG,QAAU,UACb,UAAM,CAAA,MAAA,8DACF,qBAAA,OAAqBA,EAAG,MAAK,kBAAA,CAD3B,CAC6C,EACvD7Z,EACIkwC,GAAQ,GAAKA,EAAO,EACpB,UAAA,CAAM,MAAA,qDAAqD,OAAAA,EAAI,GAAA,CAAzD,CAA4D,EAElEA,IAAS,EACX,OAAOzyD,aAAamjB,GAASiZ,EAAG,MAAK,EAAKA,EAG5C,IAAMs2B,EAAcL,GAAcj2B,EAAIk2B,CAAU,EAC1CK,EAAW,EAAIF,EACfl5C,EAAaxB,GACfk7B,GAAMnzB,GAAIgnC,GAAc4L,EAAa,EAAG,EAAG,UAAW52C,CAAI,EAAG62C,CAAQ,CAAC,EACtEA,CAAQ,EAEZ,OAAOv3C,EAAIghB,EAAI7iB,CAAU,CAC3B,CAEO,IAAMq5C,GAA0Bn1D,EAAG,CAAC,SAAQ+0D,EAAA,CAAC,EC1D9C,SAAUK,GAAoBt2D,EAAa,CAE/C,OAAO,KAAK,MAAM,KAAK,IAAI,EAAG,KAAK,KAAK,KAAK,IAAIA,CAAK,EAAI,KAAK,IAAI,CAAG,CAAC,CAAC,CAAC,CAC3E,UAEgBu2D,GACZC,EAAsBpyD,EAAW9E,EAAS,CAG5C,QAFMm3D,EAAO,EAAID,EAAe,EAC1BE,EAAY,IAAI,aAAaF,CAAY,EACtCj1D,EAAI,EAAGA,EAAIi1D,EAAc,EAAEj1D,EAAG,CACrC,IAAMo1D,EAAU,EAAM,KAAK,GAAKp1D,GAAMi1D,EAAeC,EAAO,GAC5DC,EAAUn1D,CAAC,EAAI6C,EAAI9E,EAAI,KAAK,IAAIq3D,CAAM,CACvC,CACD,OAAOlG,GAASiG,EAAW,SAAS,CACtC,CCMA,SAAeE,GACXC,EAA2BC,EAAuB9tC,EAAK,CAAL,OAAAA,IAAA,SAAAA,EAAK,wHACnD,OAAA+tC,EAAejnC,EAAgB+mC,EAAa,cAAe,QAAQ,EACnEG,EAAWlnC,EAAgBgnC,EAAS,UAAW,QAAQ,EAE7DvyD,EACIwyD,EAAa,KAAO,EACpB,UAAM,CAAA,MAAA,+DACF,WAAA,OAAWA,EAAa,IAAI,CAD1B,CAC4B,EACtCxyD,EACIwyD,EAAa,KAAO,IAAMC,EAAS,KACnC,UAAA,CAAM,MAAA,mFAEF,GAAG,OAAAD,EAAa,KAAyB,oBAAA,EAAA,OAAAC,EAAS,IAAI,CAAE,CAAA,EAChEtyD,GACIqyD,EAAa,MAAM,MAAM,EAAGA,EAAa,MAAM,OAAS,CAAC,EACzDC,EAAS,MACT,yFACgC,EAC9B9E,EAAU6E,EAAa,MAAMA,EAAa,MAAM,OAAS,CAAC,EAChExyD,EACIykB,EAAI,GAAKA,GAAKkpC,EACd,UAAM,CAAA,MAAA,iEACF,cAAA,OAAcA,EAAqB,aAAA,EAAA,OAAAlpC,CAAC,CADlC,CACoC,EAEtB,CAAA,EAAM+tC,EAAa,KAAI,CAAE,SAA3C,OAAAE,EAAkBvsD,EAAyB,KAAA,EAC7B,CAAA,EAAMssD,EAAS,KAAI,CAAE,SAOzC,IAPME,EAAcxsD,EAAqB,KAAA,EAInCD,EAAAjJ,EAAgB,CAACy1D,EAAgB,OAAS/E,EAASA,CAAO,EAAC,CAAA,EAA1D/D,EAAK1jD,EAAA,CAAA,EAAExF,EAAIwF,EAAA,CAAA,EACZ0sD,EAAYhwD,GAAuB,OAAQgnD,CAAK,EAE7C7uD,EAAI,EAAGA,EAAI6uD,EAAO7uD,IAAK,CAI9B,IAHMmJ,EAASnJ,EAAI2F,EACbqC,EAAO2vD,EAAgB,SAASxuD,EAAQA,EAASxD,CAAI,EACrDmyD,EAAmD,CAAA,EAChD71D,EAAI,EAAGA,EAAI+F,EAAK,OAAQ/F,IAC/B61D,EAAU,KAAK,CAAC,MAAO9vD,EAAK/F,CAAC,EAAG,MAAOA,CAAC,CAAC,EAK3C,IAHA61D,EAAU,KAAK,SAAChzD,EAAG9E,EAAM,CAAA,OAAAA,EAAE,MAAQ8E,EAAE,KAAZ,CAAiB,EAE1C+yD,EAAU73D,CAAC,EAAI,EACNiC,EAAI,EAAGA,EAAIynB,EAAGznB,IACrB,GAAI61D,EAAU71D,CAAC,EAAE,QAAU21D,EAAY53D,CAAC,EAAG,CACzC63D,EAAU73D,CAAC,EAAI,EACf,KACD,CAEJ,CAED,OAAIu3D,IAAgBE,GAClBA,EAAa,QAAO,EAElBD,IAAYE,GACdA,EAAS,QAAO,EAIX,CAAA,EAAAzuC,GAAO4uC,EAAWH,EAAS,MAAO,MAAM,CAAM,MACtD,CAEM,IAAMK,GAAcT,GCvD3B,SAASU,GACL7zD,EAAM6mB,EAAOkY,EACbj6B,EACAsc,EACA4d,EACAyE,EAAwC,CADxCzE,IAAA,SAAAA,EAAkC,QAEpC,IAAI+E,EAAM/jC,EACNA,EAAE,OAAS,IACb+jC,EAAMH,EAAQ5jC,EAAG,CAAC,EAAGA,EAAE,MAAM,CAAC,EAAGA,EAAE,MAAM,CAAC,EAAGA,EAAE,MAAM,CAAC,CAAC,CAAC,GAE1D,IAAIwqC,EAAO3jB,EACP2jB,EAAK,OAAS,IAChBA,EAAO5G,EAAQ/c,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAE/DtE,EACIwhB,EAAI,OAAS,EACb,UAAM,CAAA,MAAA,iEACF,GAAA,OAAGA,EAAI,MAAK,GAAA,CADV,CACa,EACvBxhB,EACIioB,EAAK,OAAS,EACd,UAAM,CAAA,MAAA,8DACF,GAAA,OAAGA,EAAK,MAAK,GAAA,CADX,CACc,EACxBjoB,EACIwc,EAAY,SAAW,EACvB,UAAM,CAAA,MAAA,mEACF,GAAA,OAAGA,EAAW,GAAA,CADZ,CACe,EACzB,IAAMuC,EAAUtC,IAAe,OAAS+E,EAAI,MAAM,CAAC,EAAIA,EAAI,MAAM,CAAC,EAC5DpC,EAAW3C,IAAe,OAASwL,EAAK,MAAM,CAAC,EAAIA,EAAK,MAAM,CAAC,EACrEjoB,EACI+e,IAAYvC,EAAY,CAAC,EACzB,UAAA,CAAM,MAAA,4CAAA,OAA4CuC,EAAgB,SAAA,EAC9D,gCAAgC,OAAAvC,EAAY,CAAC,EAAC,GAAA,CAD5C,CAC+C,EACzDxc,EACIof,IAAa5C,EAAY,CAAC,EAC1B,UAAA,CAAM,MAAA,0CAAA,OAA0C4C,EAAiB,SAAA,EAC7D,kCAAkC,OAAA5C,EAAY,CAAC,EAAC,IAAA,CAD9C,CACkD,EAC5DkF,GAAoC,kBAAmB7iB,EAAKqiB,CAAe,EAC3E,IAAMpmB,EAAqC,CAAC,EAAG0mB,EAAK,GAAIyG,CAAI,EACtDzjB,EACF,CAAC,QAAOjiB,EAAE,IAAGsc,EAAE,WAAU4d,EAAE,gBAAeyE,EAAE,YAAW1E,CAAA,EAG3D,OAAOpY,EAAO,UACHjc,GAAsB2S,EACtB0J,CAAgC,CAC7C,CAEO,IAAM+sC,GAAuCr2D,EAAG,CAAC,sBAAqBo2D,EAAA,CAAC,WC7D9DE,GACZltC,EAAYzpB,EAAW42D,EAAsB,CAC/C,GAAIA,GAAc,MAAQA,IAAe,SACvC,OAAOntC,EAET,GAAImtC,IAAe,OACjB,OAAO54C,EAAIyL,EAAIlqB,GAAKS,CAAC,CAAC,EAExB,MAAM,IAAI,MACN,gDAAA,OAAgD42D,EAAU,GAAA,CAAG,CACnE,CAGgB,SAAAC,GACZpf,EAAcqf,EAAoB,CACpC,IAAIx6C,EAAMw6C,EACJC,EACFC,GAAgCvf,EAAK,MAAOqf,EAAa,KAAK,EAClE,OAAIC,EAAW,OAAS,IACtBz6C,EAAMlZ,GAAIkZ,EAAKy6C,CAAU,GAEpBvwB,EAAQlqB,EAAKm7B,EAAK,KAAK,CAChC,CAEM,SAAUwf,GACZr0D,EAAWg0D,EAAwBM,EACnCC,EAAuB,CACzB,GAAIP,IAAe,SACjB,OAAOh0D,EACF,GAAIg0D,IAAe,OACxB,OAAO1M,GAAKtnD,CAAC,EACR,GAAIg0D,IAAe,MACxB,OAAOxkB,GAAIxvC,CAAC,EACP,GAAIg0D,IAAe,QACxB,OAAOxM,GAAMxnD,CAAC,EACT,GAAIg0D,IAAe,QACxB,OAAO7V,GAAMn+C,EAAGs0D,CAAsB,EACjC,GAAIN,IAAe,YACxB,OAAO5f,GAAUp0C,EAAGu0D,CAAc,EAC7B,GAAIP,IAAe,UACxB,OAAOjvB,GAAQ/kC,CAAC,EAElB,MAAM,IAAI,MAAM,4BAAA,OAA4Bg0D,EAAU,GAAA,CAAG,CAC3D,CAGO,IAAMQ,GAAa,SAACC,EAAuBT,EAAsB,CACtE,IAAMU,EAAeD,EAAgB,EACrC,MAAO,CAACC,GAAgBV,IAAe,QACzC,ECaA,SAASW,GAA0C3tD,EAwBlD,OAvBChH,EAACgH,EAAA,EACD2iC,EAAM3iC,EAAA,OACNlC,EAAOkC,EAAA,QACPoa,EAAGpa,EAAA,IACHE,EAAmBF,EAAA,WAAnBg4B,EAAa93B,IAAA,OAAA,OAAMA,EACnB0iB,EAAA5iB,EAAA,UAAAi4B,EAAYrV,IAAA,OAAA,CAAC,EAAG,CAAC,EAACA,EAClB6Z,EAAez8B,EAAA,gBACf6tC,EAAI7tC,EAAA,KACJ6iB,EAAA7iB,EAAA,WAAAgtD,EAAUnqC,IAAA,OAAG,SAAQA,EACrByqC,EAAsBttD,EAAA,uBACtButD,EAAcvtD,EAAA,eAgBd,GAFAgtD,EAAaA,GAAc,SAEvBQ,GAAW7tC,EAAO,MAAM,cAAeqtC,CAAU,IAAM,GAAO,CAGhEzxC,EACIyc,IAAe,OACf,UAAM,CAAA,MAAA,4CAA4C,OAAAA,EAAiB,OAAA,EAC/D,wGACwC,CAAA,EAEhD,IAAIliC,EAAS83D,GACT50D,EAAG2pC,EAAQ7kC,EAASsc,EAAK4d,EAAYC,EAAWwE,CAAe,EACnE,OAAIoR,GAAQ,OACV/3C,EAASgjB,GAAIhjB,EAAQ+3C,CAAI,GAGpBwf,GACIv3D,EAAQk3D,EAAYM,EAAwBC,CAAc,CACtE,CAED,IAAMn4B,EAAK/P,EAAgBrsB,EAAG,IAAK,SAAU,SAAS,EAChD4pC,EAAUvd,EAAgBsd,EAAQ,SAAU,SAAU,SAAS,EAEjE5F,EAAM3H,EACN4H,EAAe,GAEf5H,EAAG,OAAS,IACd4H,EAAe,GACfD,EAAMH,EAAQxH,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAE9D7Z,EACIwhB,EAAI,OAAS,EACb,UAAM,CAAA,MAAA,6DACF,GAAA,OAAGA,EAAI,KAAI,GAAA,CADT,CACY,EACtBxhB,EACIqnB,EAAQ,OAAS,EACjB,UAAM,CAAA,MAAA,8DACF,GAAA,OAAGA,EAAQ,KAAI,GAAA,CADb,CACgB,EAC1B3F,GAAoC,eAAgB7iB,EAAKqiB,CAAe,EACxE,IAAMvE,EAAgBF,IAAe,OAAS+E,EAAI,MAAM,CAAC,EAAIA,EAAI,MAAM,CAAC,EACxExhB,EACIqnB,EAAQ,MAAM,CAAC,IAAM1K,EACrB,UAAA,CAAM,MAAA,oCAAA,OAAoCA,EAA4B,eAAA,EAClE,0BAA0B,OAAA0K,EAAQ,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EACrDrnB,EACIuhB,GAAyCh/B,EAASm6B,CAAS,EAC3D,UAAA,CAAM,MAAA,2DACF,eAAA,OAAen6B,EAA0B,kBAAA,EAAA,OAAAm6B,EAAS,GAAA,CADhD,CACmD,EAE7D,IAAM2d,EAAWiY,GACb9wB,EAAI,MAAO6F,EAAQ,MAAO9kC,EAASm6B,EAAW7d,EAAKqiB,CAAe,EAElEqxB,EACAjgB,GAAQ,OACVigB,EAAQzoC,EAAgBwoB,EAAM,OAAQ,cAAc,EACpD5tC,EAAAlJ,EAAU4mB,GAAemwC,EAAO14B,CAAE,EAAC,CAAA,EAAlC04B,EAAK7tD,EAAA,CAAA,EAQF+3B,IAAe,OACjB+1B,GAA0CnY,EAAS,SAAUkY,EAAM,KAAK,GAExEvyC,EACIuyC,EAAM,MAAM,QAAU,EACtB,UAAA,CAAM,MAAA,sGAEF,QAAQ,OAAAA,EAAM,MAAM,OAAS,GAAA,CAAA,CAAA,EAErCvyC,EACIuyC,EAAM,MAAM,SAAW,GAAKA,EAAM,MAAM,CAAC,IAAMlY,EAAS,aACpDkY,EAAM,MAAM,CAAC,IAAM,EACvB,UAAA,CAAM,MAAA,sCAAA,OAAsCA,EAAM,MAAgB,WAAA,EAC9D,iDACA,IAAA,OAAIlY,EAAS,YAAW,GAAA,CAFtB,CAEyB,IAIvC,IAAIoY,EACJ,GAAIV,GAA0B,KAAM,CAGlC,IAAMW,EAAaX,EAAuB,MAO1C,GANA/xC,EACI0yC,EAAW,QAAU,GAAKA,EAAW,SAAW,EAChD,UAAA,CAAM,MAAA,sHAEF,QAAA,OAAQA,EAAW,OAAM,GAAA,CAFvB,CAE0B,EAEhCA,EAAW,SAAW,EAIxB1yC,EACI0yC,EAAW,CAAC,IAAM,GAAKA,EAAW,CAAC,IAAMrY,EAAS,YAClD,UAAM,CAAA,MAAA,mDACF,IAAA,OAAIqY,EAA0D,gDAAA,EAC9D,aAAA,OAAarY,EAAS,YAAW,IAAA,CAF/B,CAEmC,UACpCqY,EAAW,SAAW,EAG/B,GAAI,CACFF,GACIE,EAAYrY,EAAS,QAAQ,CAClC,MAAW,CACV,IAAMrP,EACF,oDAAoD,OAAA0nB,EAAc,IAAA,EAClE,yDACA,IAAA,OAAIrY,EAAS,SAAQ,IAAA,EACzB,MAAM,MAAMrP,CAAM,CACnB,CAGHynB,EAA0B3oC,EACtBioC,EAAwB,gBAAiB,cAAc,CAC5D,CAED,IAAM1tC,EAAO,SAACC,EAAcG,GAAe,CACzCzE,EACIyc,IAAe,OACf,UAAM,CAAA,MAAA,wDAAA,OACFA,EAAU,wCAAA,CADR,CACgD,EAEpD,IAAAh4B,EAAAjJ,EACFipB,GAA+C,CAAA,EAD5C4iB,EAAO5iC,EAAA,CAAA,EAAE+8B,EAAG/8B,EAAA,CAAA,EAAE5J,GAAC4J,EAAA,CAAA,EAAE8tD,GAAK9tD,EAAA,CAAA,EAGvBktD,GAAeH,GAAqBltC,EAAIzpB,GAAG42D,CAAU,EAE3DzxC,EACI2yC,GAA4Bj2B,CAAS,EACrC,UAAM,CAAA,MAAA,oEAEF,sDAAA,OAAsDA,EAAS,GAAA,CAF7D,CAEgE,EAE1E,IAAMk2B,GACF1qB,GAAoB1G,EAAI,MAAOmwB,GAActqB,EAAS9kC,EAASsc,CAAG,EAChEg0C,GACFtB,GAAqB/vB,EAAKmwB,GAActqB,EAAQ,MAAO9kC,EAASsc,CAAG,EACjEi0C,GAAgB,CAACF,GAAMC,EAAS,EAEtC,GAAIN,IAAS,KAAM,CACjB,IAAMQ,GAAUrB,GAAqBa,GAAOZ,EAAY,EACxDmB,GAAI,KAAKC,EAAO,CACjB,CACD,OAAOD,EACT,EAEMh4C,EAA4B,CAChC0mB,EACA,OAAQ6F,EACR,KAAMkrB,EACN,uBAAwBE,GAGpBjuC,EAA0B,CAC9B,QAAOjiB,EACP,IAAGsc,EACH,WAAU4d,EACV,UAASC,EACT,gBAAewE,EACf,WAAUuwB,EACV,eAAcO,GAKhB,GAAI1f,GAAQ,KAAM,CAChB,IAAMyB,EACFP,GAAW,SAAChS,EAAe4F,GAAkB/e,EAAkB,CAC7D,IAAIlR,EAEAiN,EAAO,UACH9S,GAAawJ,EACb0J,CAAgC,EAExC,OAAA6D,EAAK,CAAC+e,GAAQ5F,EAAKrqB,CAAG,CAAC,EAEnBsqB,IAEFtqB,EAAMkqB,EAAQlqB,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,GAIxD,CAAC,MAAOA,EAAK,SAAUkN,CAAI,CACpC,CAAC,EACL,OAAO0vB,EAASvS,EAAK6F,CAAO,CAC7B,KAAM,CACL,IAAM2rB,EAAmBxf,GACrB,SAAChS,EAAe4F,GAAkBkL,EAAcjqB,EAAkB,CAChE,IAAIlR,EAAyBiN,EAAO,UAChC9S,GAAawJ,EACb0J,CAAgC,EAEpC,OAAA6D,EAAK,CAAC+e,GAAQ5F,EAAKrqB,EAAKm7B,CAAI,CAAC,EAEzB7Q,IAEFtqB,EAAMkqB,EAAQlqB,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,GAIxD,CAAC,MAAOA,EAAK,SAAUkN,CAAI,CACpC,CAAC,EAEL,OAAO2uC,EAAiBxxB,EAAK6F,EAASkrB,CAAK,CAC5C,CACH,CACO,IAAMhrB,GAAyBrsC,EAAG,CAAC,aAAYk3D,EAAA,CAAC,ECjTvD,SAASa,GACLx1D,EAAM6mB,EAAOkY,EACbj6B,EACAsc,EACA6d,EACAwE,EAAwC,CADxCxE,IAAA,SAAAA,EAAA,CAAsC,EAAG,CAAC,GAE5C,IAAI8E,EAAM/jC,EACNA,EAAE,OAAS,IACb+jC,EAAMH,EAAQ5jC,EAAG,CAAC,EAAGA,EAAE,MAAM,CAAC,EAAGA,EAAE,MAAM,CAAC,EAAGA,EAAE,MAAM,CAAC,CAAC,CAAC,GAE1D,IAAIwqC,EAAO3jB,EACP2jB,EAAK,OAAS,IAChBA,EAAO5G,EAAQ/c,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAG/D,IAAMxJ,EAAoD,CAAC,EAAG0mB,EAAK,GAAIyG,CAAI,EACrEzjB,EACF,CAAC,QAAOjiB,EAAE,IAAGsc,EAAE,gBAAeqiB,EAAE,UAASxE,EAAE,YAAWF,CAAA,EAG1D,OAAOpY,EAAO,UACHpb,GACA8R,EACA0J,CAAgC,CAC7C,CAEO,IAAM0uC,GACTh4D,EAAG,CAAC,qCAAoC+3D,EAAA,CAAC,EC3B7C,SAASE,GACLltB,EAA0C3hB,EAAO8iB,EACjD7kC,EACAsc,EACA6d,EACAwE,EAAwC,CADxCxE,IAAA,SAAAA,EAAA,CAAsC,EAAG,CAAC,GAE5C,IAAIuL,EAAO3jB,EACPmd,EAAe,GACfnd,EAAG,OAAS,IACdmd,EAAe,GACfwG,EAAO5G,EAAQ/c,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAG/D,IAAMxJ,EAAmD,CAAC,GAAImtB,EAAM,OAAMb,CAAA,EACpE5iB,EACF,CAAC,QAAOjiB,EAAE,IAAGsc,EAAE,gBAAeqiB,EAAE,UAASxE,EAAE,WAAYuJ,CAAM,EAE3D9uB,EAEFiN,EAAO,UACHnb,GACA6R,EACA0J,CAAgC,EAExC,OAAIid,EACKJ,EAAQlqB,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAEzDA,CACT,CAEO,IAAMi8C,GACTl4D,EAAG,CAAC,oCAAmCi4D,EAAA,CAAC,ECgC5C,SAASE,GAAmD5uD,EAwB3D,OAvBChH,EAACgH,EAAA,EACD2iC,EAAM3iC,EAAA,OACNlC,EAAOkC,EAAA,QACPoa,EAAGpa,EAAA,IACHE,EAAmBF,EAAA,WAAnBg4B,EAAa93B,IAAA,OAAA,OAAMA,EACnB0iB,EAAA5iB,EAAA,UAAAi4B,EAAYrV,IAAA,OAAA,CAAC,EAAG,CAAC,EAACA,EAClB6Z,EAAez8B,EAAA,gBACf6tC,EAAI7tC,EAAA,KACJ6iB,EAAA7iB,EAAA,WAAAgtD,EAAUnqC,IAAA,OAAG,SAAQA,EACrByqC,EAAsBttD,EAAA,uBACtButD,EAAcvtD,EAAA,eAcd,GAAIwtD,GAAW7tC,EAAO,MAAM,cAAeqtC,CAAU,IAAM,GAAO,CAChE,IAAIl3D,EAAS+4D,GACT71D,EAAG2pC,EAAQ7kC,EAASsc,EAAK4d,EAAYC,EAAWwE,CAAe,EACnE,OAAIoR,GAAQ,OACV/3C,EAASgjB,GAAIhjB,EAAQ+3C,CAAI,GAGpBwf,GACIv3D,EAAQk3D,EAAYM,EAAwBC,CAAc,CACtE,CAED,IAAMn4B,EAAK/P,EAAgBrsB,EAAG,IAAK,kBAAmB,SAAS,EACzD4pC,EACFvd,EAAgBsd,EAAQ,SAAU,kBAAmB,SAAS,EAE9D5F,EAAM3H,EACN4H,EAAe,GACf5H,EAAG,OAAS,IACd4H,EAAe,GACfD,EAAMH,EAAQxH,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAE9D7Z,EACIwhB,EAAI,OAAS,EACb,UAAM,CAAA,MAAA,iEACF,QAAA,OAAQA,EAAI,KAAI,GAAA,CADd,CACiB,EAC3BxhB,EACIqnB,EAAQ,OAAS,EACjB,UAAM,CAAA,MAAA,0DACF,gBAAA,OAAgBA,EAAQ,KAAI,GAAA,CAD1B,CAC6B,EACvCrnB,EACIwhB,EAAI,MAAM,CAAC,IAAM6F,EAAQ,MAAM,CAAC,EAChC,UAAA,CAAM,MAAA,4DACF,IAAA,OAAI7F,EAAI,MAAM,CAAC,EAA4C,2CAAA,EAC3D,UAAU,OAAA6F,EAAQ,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EACjC3K,GAAa,OACfA,EAAY,CAAC,EAAG,CAAC,GAEnB1c,EACIuhB,GAAyCh/B,EAASm6B,CAAS,EAC3D,UAAA,CACI,MAAA,oEACA,qBAAA,OAAqBn6B,EAA0B,kBAAA,EAAA,OAAAm6B,EAAS,GAAA,CADxD,CAC2D,EACnEgF,GACI,wBAAyB7iB,EAAKqiB,CAAe,EACjD,IAAMmZ,EAAWiY,GACb9wB,EAAI,MAAO6F,EAAQ,MAAO9kC,EAASm6B,EAAW7d,EAAKqiB,EACnD,EAAI,EAEJqxB,EACAjgB,GAAQ,OACVigB,EAAQzoC,EAAgBwoB,EAAM,OAAQ,cAAc,EACpD5tC,EAAAlJ,EAAU4mB,GAAemwC,EAAO14B,CAAE,EAAC,CAAA,EAAlC04B,EAAK7tD,EAAA,CAAA,EAEN8tD,GAA0CnY,EAAS,SAAUkY,EAAM,KAAK,GAG1E,IAAIE,EACAV,GAA0B,OAC5BU,EAA0B3oC,EACtBioC,EAAwB,gBAAiB,uBAAuB,GAGtE,IAAM1tC,EAAO,SAACC,EAAcG,EAAe,CACzCzE,EACI2yC,GAA4Bj2B,CAAS,EACrC,UAAM,CAAA,MAAA,kHAEF,IAAA,OAAIA,EAAS,GAAA,CAFX,CAEc,EAClB,IAAAj4B,EAAAjJ,EAA0BipB,EAAK,CAAA,EAA9B4iB,EAAO5iC,EAAA,CAAA,EAAE+8B,GAAG/8B,EAAA,CAAA,EAAE5J,EAAC4J,EAAA,CAAA,EAAE6tC,EAAI7tC,EAAA,CAAA,EAEtBktD,EAAeH,GAAqBltC,EAAIzpB,EAAG42D,CAAU,EAErDmB,GAAOQ,GACR5xB,GAAiB,MAAOmwB,EAActqB,EAAqB9kC,EAC5Dsc,EAAK6d,EAAWwE,CAAe,EAC7B2xB,GAAYK,GACd1xB,GAAiBmwB,EAAetqB,EAAqB,MAAO9kC,EAC5Dsc,EAAK6d,EAAWwE,CAAe,EAEnC,GAAIoR,GAAQ,KAAM,CAChB,IAAMygB,GAAUrB,GAAqBa,EAAOZ,CAAY,EACxD,MAAO,CAACiB,GAAMC,GAAWE,EAAO,CACjC,CACD,MAAO,CAACH,GAAMC,EAAS,CACzB,EAEM/3C,EAAqC,CACzC0mB,EACA,OAAQ6F,EACR,KAAMkrB,EACN,uBAAwBE,GAEpBjuC,EAAmC,CACvC,QAAOjiB,EACP,IAAGsc,EACH,WAAU4d,EACV,UAASC,EACT,gBAAewE,EACf,WAAUuwB,EACV,eAAcO,GAKhB,GAAI1f,GAAQ,KAAM,CAChB,IAAMyB,EACFP,GAAW,SAAChS,EAAe4F,EAAkB/e,EAAkB,CAE7D,IAAIlR,EAAyBiN,EAAO,UAChC7S,GAAsBuJ,EACtB0J,CAAgC,EAEpC,OAAA6D,EAAK,CAAC+e,EAAQ5F,EAAKrqB,CAAG,CAAC,EAEnBsqB,IAEFtqB,EAAMkqB,EAAQlqB,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,GAIxD,CAAC,MAAOA,EAAK,SAAUkN,CAAI,CACpC,CAAC,EACL,OAAO0vB,EAASvS,EAAK6F,CAAO,CAC7B,KAAM,CACL,IAAM2rB,EAAmBxf,GACrB,SAAChS,EAAe4F,EAAkBkL,EAAcjqB,EAAkB,CAEhE,IAAIlR,GAAyBiN,EAAO,UAChC7S,GAAsBuJ,EACtB0J,CAAgC,EAEpC,OAAA6D,EAAK,CAAC+e,EAAQ5F,EAAKrqB,GAAKm7B,CAAI,CAAC,EAEzB7Q,IAEFtqB,GAAMkqB,EAAQlqB,GAAK,CAACA,GAAI,MAAM,CAAC,EAAGA,GAAI,MAAM,CAAC,EAAGA,GAAI,MAAM,CAAC,CAAC,CAAC,GAIxD,CAAC,MAAOA,GAAK,SAAUkN,CAAI,CACpC,CAAC,EAEL,OAAO2uC,EAAiBxxB,EAAK6F,EAASkrB,CAAK,CAC5C,CACH,CACO,IAAMroB,GAAkChvC,EAAG,CAAC,sBAAqBm4D,EAAA,CAAC,EC1MzE,SAASE,GAAa9uD,EAkBrB,SAjBCrG,EAACqG,EAAA,EACDnL,EAACmL,EAAA,EACD4iB,EAAA5iB,EAAA,WAAA29B,EAAa/a,IAAA,OAAA,GAAKA,EAClBC,EAAA7iB,EAAA,WAAA49B,EAAU/a,IAAA,OAAG,GAAKA,EAClBgrB,EAAI7tC,EAAA,KACJ05B,EAAA15B,EAAA,WAAAgtD,EAAUtzB,IAAA,OAAG,SAAQA,EACrB4zB,EAAsBttD,EAAA,uBACtB2iB,EAAA3iB,EAAA,eAAAutD,EAAc5qC,IAAA,OAAG,GAAGA,EAWlB,GAAI6qC,GAAW7tC,EAAO,MAAM,cAAeqtC,CAAU,IAAM,GAAO,CAChE,IAAIl3D,EAASi5D,GAAcp1D,EAAG9E,EAAG8oC,EAAYC,CAAU,EACvD,OAAIiQ,GAAQ,OACV/3C,EAASgjB,GAAIhjB,EAAQ+3C,CAAI,GAGpBwf,GACIv3D,EAAQk3D,EAAYM,EAAwBC,CAAc,CACtE,CAED,IAAI53B,EAAKtQ,EAAgB1rB,EAAG,IAAK,cAAc,EAC3Ci8B,EAAKvQ,EAAgBxwB,EAAG,IAAK,cAAc,EAC/CoL,EAAAlJ,EAAW4mB,GAAegY,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAE11B,EAAA,CAAA,EAAE21B,EAAE31B,EAAA,CAAA,EAEP,IAAM+uD,EACFrxB,EAAahI,EAAG,MAAMA,EAAG,KAAO,CAAC,EAAIA,EAAG,MAAMA,EAAG,KAAO,CAAC,EACvDs5B,EACFrxB,EAAahI,EAAG,MAAMA,EAAG,KAAO,CAAC,EAAIA,EAAG,MAAMA,EAAG,KAAO,CAAC,EAEvDs5B,EACFvxB,EAAahI,EAAG,MAAMA,EAAG,KAAO,CAAC,EAAIA,EAAG,MAAMA,EAAG,KAAO,CAAC,EACvDw5B,EACFvxB,EAAahI,EAAG,MAAMA,EAAG,KAAO,CAAC,EAAIA,EAAG,MAAMA,EAAG,KAAO,CAAC,EAEvDw5B,EAAaz5B,EAAG,MAAM,MAAM,EAAG,EAAE,EACjC05B,EAAaz5B,EAAG,MAAM,MAAM,EAAG,EAAE,EACjC05B,EAAYj0C,GAAmB+zC,CAAU,EACzCG,EAAYl0C,GAAmBg0C,CAAU,EAE/C9zC,EACIyzC,IAAgBC,EAChB,UAAM,CAAA,MAAA,wCAAwC,OAAAD,EAAoB,SAAA,EAC9D,GAAA,OAAGC,EAAW,2BAAA,EAAA,OAA4Bt5B,EAAG,MAAY,OAAA,EACzD,GAAA,OAAGC,EAAG,MAAK,kBAAA,EAAA,OAAmB+H,CAAU,EACxC,mBAAA,OAAmBC,EAAU,cAAA,CAH3B,CAGyC,EAEnD,IAAM4xB,EAAoBzB,GACtBp4B,EAAG,MAAM,MAAM,EAAG,EAAE,EAAGC,EAAG,MAAM,MAAM,EAAG,EAAE,CAAC,EAC1CyE,EAAWm1B,EAAkB,OAAO,CAACN,EAAaC,CAAW,CAAC,EAE9DM,EAAgB9xB,EAClBf,EAAQjH,EAAI,CAAC25B,EAAWN,EAAaE,CAAW,CAAC,EACjDtyB,EAAQjH,EAAI,CAAC25B,EAAWJ,EAAaF,CAAW,CAAC,EAC/CU,EAAgB9xB,EAClBhB,EAAQhH,EAAI,CAAC25B,EAAWJ,EAAaF,CAAW,CAAC,EACjDryB,EAAQhH,EAAI,CAAC25B,EAAWN,EAAaE,CAAW,CAAC,EAEjDrB,EACAjgB,GAAQ,OACVigB,EAAQzoC,EAAgBwoB,EAAM,OAAQ,cAAc,EACpD3tC,EAAAnJ,EAAU4mB,GAAemwC,EAAOn4B,CAAE,EAAC,CAAA,EAAlCm4B,EAAK5tD,EAAA,CAAA,EAEN6tD,GAA0C1zB,EAAUyzB,EAAM,KAAK,GAGjE,IAAIE,EACAV,GAA0B,OAC5BU,EAA0B3oC,EACtBioC,EAAwB,gBAAiB,cAAc,GAG7D,IAAM1tC,EAAO,SAACC,GAAcG,GAAe,CACnC,IAAAhgB,GAAAjJ,EAAuBipB,GAAK,CAAA,EAA3ByvC,GAAGzvD,GAAA,CAAA,EAAE0vD,GAAG1vD,GAAA,CAAA,EAAE5J,GAAC4J,GAAA,CAAA,EAAE8tD,GAAK9tD,GAAA,CAAA,EAInBktD,GACFH,GAAqBnwB,EAAQ/c,GAAIzpB,GAAE,KAAK,EAAGA,GAAG42D,CAAU,EACxD2C,GACAC,GAgBJ,GAdI,CAACjyB,GAAc,CAACC,GAClB+xB,GAAOZ,GAAc7B,GAAcwC,GAAK,GAAO,EAAI,EACnDE,GAAOb,GAAcU,GAAKvC,GAAc,GAAM,EAAK,GAC1C,CAACvvB,GAAcC,GACxB+xB,GAAOZ,GAAc7B,GAAcwC,GAAK,GAAO,EAAK,EACpDE,GAAOb,GAAc7B,GAAcuC,GAAK,GAAM,EAAK,GAC1C9xB,GAAc,CAACC,GACxB+xB,GAAOZ,GAAcW,GAAKxC,GAAc,GAAO,EAAI,EACnD0C,GAAOb,GAAcU,GAAKvC,GAAc,GAAO,EAAK,IAEpDyC,GAAOZ,GAAcW,GAAKxC,GAAc,GAAM,EAAI,EAClD0C,GAAOb,GAAc7B,GAAcuC,GAAK,GAAM,EAAI,GAGhD5hB,GAAQ,KAAM,CAChB,IAAMygB,GAAUrB,GAAqBa,GAAOZ,EAAY,EACxD,MAAO,CAACyC,GAAMC,GAAMtB,EAAO,CAC5B,KACC,OAAO,CAACqB,GAAMC,EAAI,CAEtB,EAEMv5C,GAA6B,CACjC,EAAGo5C,EACH,EAAGC,EACH,KAAM5B,EACN,uBAAwBE,GAEpBjuC,EACF,CAAC,WAAU4d,EAAE,WAAUC,EAAE,WAAUovB,EAAE,eAAcO,CAAA,EAIvD,GAAI1f,GAAQ,KAAM,CAChB,IAAMyB,EACFP,GAAW,SAAC0gB,GAAeC,GAAe9rC,GAAkB,CAC1D,IAAMlR,GAEFiN,EAAO,UACH/S,GAAcyJ,GACd0J,CAAgC,EAExC,OAAA6D,GAAK,CAAC6rC,GAAKC,GAAKh9C,EAAG,CAAC,EAEb,CAAC,MAAOkqB,EAAQlqB,GAAK2nB,CAAQ,EAAG,SAAUza,CAAI,CACvD,CAAC,EACL,OAAO0vB,EAASmgB,EAAKC,CAAG,CACzB,KAAM,CACL,IAAMnB,EAAmBxf,GACrB,SAAC0gB,GAAeC,GAAe5B,GAAelqC,GAAkB,CAC9D,IAAMlR,GAEFiN,EAAO,UACH/S,GAAcyJ,GACd0J,CAAgC,EAExC,OAAA6D,GAAK,CAAC6rC,GAAKC,GAAKh9C,GAAKo7C,EAAK,CAAC,EAEpB,CAAC,MAAOlxB,EAAQlqB,GAAK2nB,CAAQ,EAAG,SAAUza,CAAI,CACvD,CAAC,EAEL,OAAO2uC,EAAiBkB,EAAKC,EAAK5B,CAAK,CACxC,CACH,CAEO,IAAMjwB,GAAyBpnC,EAAG,CAAC,aAAYq4D,EAAA,CAAC,iEEnLzD,SAASe,GAAe9D,EAAoB,CAC1C,OAAOD,GAAaC,EAAc,IAAM,GAAI,CAC9C,CACO,IAAM+D,GAAgCr5D,EAAG,CAAC,eAAco5D,EAAA,CAAC,ECHhE,SAASE,GAAYhE,EAAoB,CACvC,OAAOD,GAAaC,EAAc,GAAK,EAAG,CAC5C,CAEO,IAAMiE,GAA6Bv5D,EAAG,CAAC,YAAWs5D,EAAA,CAAC,ECI1D,SAASE,GACLC,EAAkBC,EAAqBC,EAAmBzZ,EAC1D0Z,EAAY,CAD8C1Z,IAAA,SAAAA,EAAc,IACxE0Z,IAAA,SAAAA,EAAY,GAGd,QAFIzyD,EAAQ,EACNgZ,EAAmB,CAAA,EAClBhZ,EAAQuyD,GAAeD,EAAO,MACnCt5C,EAAO,KAAK8T,GAAMwlC,EAAQtyD,EAAOuyD,CAAW,CAAC,EAC7CvyD,GAASwyD,EAGX,GAAIzZ,EACF,KAAO/4C,EAAQsyD,EAAO,MAAM,CAC1B,IAAMI,EAAU1yD,EAAQuyD,EAAeD,EAAO,KACxC91C,EAAMqjB,GAAO,CACjB/S,GAAMwlC,EAAQtyD,EAAOuyD,EAAcG,CAAM,EAAGzuB,GAAK,CAACyuB,CAAM,EAAGD,CAAQ,CACpE,CAAA,EACDz5C,EAAO,KAAKwD,CAAG,EACfxc,GAASwyD,CACV,CAGH,OAAIx5C,EAAO,SAAW,EACbqvC,GAAS,CAAA,EAAI,CAAC,EAAGkK,CAAW,CAAC,EAG/BvzB,EAAQa,GAAO7mB,CAAM,EAAG,CAACA,EAAO,OAAQu5C,CAAW,CAAC,CAC7D,CACO,IAAMI,GAAwB95D,EAAG,CAAC,OAAMw5D,EAAA,CAAC,EC1BhD,SAASO,GACLN,EAAkBC,EAAqBC,EACvC9L,EACAmM,EAAmD,CAAnDA,IAAA,SAAAA,EAAmDT,IACjD1L,GAAa,OACfA,EAAYuH,GAAoBsE,CAAW,GAE7C,IAAMO,EAAeH,GAAML,EAAQC,EAAaC,CAAS,EACnDO,EAAiBv8C,EAAIs8C,EAAcD,EAASN,CAAW,CAAC,EAC9D,OAAOpL,GAAK4L,EAAgBrM,CAAS,CACvC,CACO,IAAMsM,GAAuBn6D,EAAG,CAAC,MAAK+5D,EAAA,CAAC,ECF9C,SAASK,GACLxlC,EACAylC,EACAC,EACAC,EACAC,EACAC,EAAsB,CADtBD,IAAA,SAAAA,EAAyC,YACzCC,IAAA,SAAAA,EAAsB,GAExB,IAAMC,EAAS9rC,EAAgBgG,EAAO,QAAS,eAAe,EACxD+lC,EAAS/rC,EAAgByrC,EAAO,QAAS,gBAAiB,SAAS,EACnEO,EAAUhsC,EAAgB0rC,EAAQ,SAAU,gBAAiB,OAAO,EAEpEO,EAAWF,EAAO,MAAM,CAAC,EAE/B71C,EACI41C,EAAO,OAAS,EAChB,UAAM,CAAA,MAAA,gDACF,gBAAA,OAAgBA,EAAO,KAAI,GAAA,CADzB,CAC4B,EACtC51C,EACI61C,EAAO,OAAS,GAAKA,EAAO,MAAM,CAAC,IAAM,EACzC,UAAM,CAAA,MAAA,oDAAoD,OAAAE,EAAc,MAAA,EACpE,iBAAA,OAAiBF,EAAO,MAAK,GAAA,CAD3B,CAC8B,EACxC71C,EACI81C,EAAQ,OAAS,GAAKA,EAAQ,MAAM,CAAC,IAAMC,EAC3C,UAAM,CAAA,MAAA,qDAAqD,OAAAA,EAAY,IAAA,EACnE,iBAAA,OAAiBF,EAAO,MAAK,GAAA,CAD3B,CAC8B,EACxC71C,EACIy1C,EAAS,SAAW,EACpB,UAAM,CAAA,MAAA,iEACF,UAAA,OAAUA,EAAS,OAAM,GAAA,CADvB,CAC0B,EACpCz1C,EACIy1C,EAAS,CAAC,GAAK,GAAKA,EAAS,CAAC,GAAK,EACnC,UAAM,CAAA,MAAA,2CAA2C,OAAAA,CAAQ,CAAE,CAAA,EAC/Dz1C,EACI01C,IAAW,YAAcA,IAAW,UACpC,UAAA,CAAM,MAAA,+CAA+C,OAAAA,CAAM,CAArD,CAAuD,EAEjE,IAAM56C,EACoB,CAAC,MAAO86C,EAAQ,MAAOC,EAAQ,OAAQC,CAAO,EAClEtxC,EAA4B,CAAC,OAAMkxC,EAAE,mBAAkBC,EAAE,SAAQF,CAAA,EACjEt+C,EAAMiN,EAAO,UACfxb,GAAekS,EACf0J,CAAgC,EACpC,OAAOrN,CACT,CAEO,IAAM6+C,GAAgC96D,EAAG,CAAC,eAAco6D,EAAA,CAAC,EChEhE,SAASW,GAAenmC,EAA0B,CAChD,IAAM8lC,EAAS9rC,EAAgBgG,EAAO,QAAS,gBAAiB,SAAS,EAEzE9P,EACI41C,EAAO,OAAS,EAChB,UAAM,CAAA,MAAA,gDACF,gBAAA,OAAgBA,EAAO,KAAI,GAAA,CADzB,CAC4B,EAEtC,IAAM96C,EAA8B,CAAC,MAAO86C,CAAM,EAC5Cz+C,EACFiN,EAAO,UAAUla,GAAe4Q,EAAqC,CAAA,CAAE,EAC3E,OAAO3D,CACT,CAEO,IAAM++C,GAAgCh7D,EAAG,CAAC,eAAc+6D,EAAA,CAAC,ECdhE,SAASE,GAC0BrmC,EAAmB,CACpD,IAAM8lC,EAAS9rC,EAAgBgG,EAAO,QAAS,gBAAgB,EAEzDsmC,EAAcR,EAAO,KAAO,EAC5BS,EAAWT,EAAO,MAAMQ,CAAW,EAEzCp2C,EACI41C,EAAO,MAAQ,EACf,UAAM,CAAA,MAAA,4DACF,gBAAA,OAAgBA,EAAO,KAAI,GAAA,CADzB,CAC4B,EAEtC51C,EACIq2C,IAAa,EACb,UAAM,CAAA,MAAA,gEACF,kCAAA,OAAkCA,EAAQ,GAAA,CADxC,CAC2C,EAErD,IAAMnwB,EAAO,IAAI,MAAM0vB,EAAO,IAAI,EAElC,OAAA1vB,EAAK,KAAK,EAAG,EAAGkwB,CAAW,EAC3BlwB,EAAKkwB,CAAW,EAAI,EAEblmB,GAAK0lB,EAAQ1vB,CAAI,CAC1B,CAEO,IAAMowB,GAAiCp7D,EAAG,CAAC,gBAAei7D,EAAA,CAAC,ECvBlE,SAASI,GAC0BzmC,EAAmB,CACpD,IAAM8lC,EAAS9rC,EAAgBgG,EAAO,QAAS,gBAAgB,EAEzDsmC,EAAcR,EAAO,KAAO,EAC5BS,EAAWT,EAAO,MAAMQ,CAAW,EAEzCp2C,EACI41C,EAAO,MAAQ,EACf,UAAM,CAAA,MAAA,4DACF,gBAAA,OAAgBA,EAAO,KAAI,GAAA,CADzB,CAC4B,EAEtC51C,EACIq2C,IAAa,EACb,UAAM,CAAA,MAAA,2DACF,kCAAA,OAAkCA,EAAQ,GAAA,CADxC,CAC2C,EAGrD,IAAMG,EAAYZ,EAAO,MACnBa,EAAW18B,GAAK67B,EAAQ,SAAS,EAEjCc,EAAajM,GAAS,CAAC,MAAQ,KAAQ,IAAM,CAAC,EAEhDkM,EACJ,OAAQf,EAAO,KAAI,CACjB,IAAK,GACHe,EAAY5pB,GAAO,UAAW0pB,EAAUC,CAAU,EAClD,MACF,IAAK,GACHC,EAAY5pB,GAAO,YAAa0pB,EAAUC,CAAU,EACpD,MACF,IAAK,GACHC,EAAY5pB,GAAO,cAAe0pB,EAAUC,CAAU,EACtD,MACF,IAAK,GACHC,EAAY5pB,GAAO,gBAAiB0pB,EAAUC,CAAU,EACxD,MACF,IAAK,GACHC,EAAY5pB,GAAO,kBAAmB0pB,EAAUC,CAAU,EAC1D,MACF,QACE,MAAM,IAAI,MAAM,0BAA0B,CAC7C,CACD,OAAAC,EAAY7mB,GAAW6mB,EAAW,EAAE,EAE7B58B,GAAK48B,EAAWH,CAAS,CAClC,CAEO,IAAMI,GAAiC17D,EAAG,CAAC,gBAAeq7D,EAAA,CAAC,ECvClE,SAASM,GACL/mC,EAA4BgnC,EAC5BC,EACAC,EAAqC,CADrCD,IAAA,SAAAA,EAA8C,GAC9CC,IAAA,SAAAA,EAAqC,IACvC,IAAMpB,EAAS9rC,EAAgBgG,EAAO,QAAS,mBAAoB,SAAS,EAE5E9P,EACI41C,EAAO,OAAS,EAChB,UAAM,CAAA,MAAA,mDACF,gBAAA,OAAgBA,EAAO,KAAI,GAAA,CADzB,CAC4B,EAEtC,IAAM96C,EAAiC,CAAC,MAAO86C,CAAM,EAC/CpxC,EAA+B,CAAC,QAAOsyC,EAAE,UAASC,EAAE,OAAMC,CAAA,EAC1D7/C,EAAMiN,EAAO,UACfhT,GAAkB0J,EAClB0J,CAAgC,EACpC,OAAOrN,CACT,CAEO,IAAM8/C,GAAmC/7D,EAAG,CAAC,kBAAiB27D,EAAA,CAAC,EC3CtE,SAASK,GACL3B,EAAiB4B,EAAkBC,EACnCC,EAAsBC,EAAwBC,EAAqB,CAMjEF,GAAgB,OAClBA,EAAe,IAEbC,GAAkB,OACpBA,EAAiB,OAAO,mBAEtBC,GAAgB,OAClBA,EAAe,GAGjB,IAAMxB,EAAWR,EAAM,MAAM,CAAC,EAC9B,OAAA6B,EAAgB,KAAK,IAAIA,EAAerB,CAAQ,EAEhD/1C,EACI,GAAKq3C,GAAgBA,GAAgB,EACrC,UAAA,CAAM,MAAA,4CAA4C,OAAAA,EAAY,GAAA,CAAxD,CAA2D,EACrEr3C,EACIu1C,EAAM,OAAS,EACf,UAAA,CAAM,MAAA,+CAAA,OAA+CA,EAAM,KAAI,GAAA,CAAzD,CAA4D,EACtEv1C,EACIu1C,EAAM,MAAM,CAAC,IAAM,EACnB,UAAA,CACI,MAAA,oDAAA,OAAoDA,EAAM,MAAM,CAAC,CAAC,CAAE,CAAA,EAC5Ev1C,EAAYm3C,EAAO,OAAS,EAAG,UAAA,CAAM,MAAA,4BAAA,CAA4B,EACjEn3C,EACIm3C,EAAO,MAAM,CAAC,IAAMpB,EACpB,UAAA,CAAM,MAAA,sDAAA,OAAsDA,EAAY,IAAA,EACpE,WAAW,OAAAoB,EAAO,MAAM,CAAC,CAAC,CAAE,CAAA,EACpCn3C,EACI,GAAKu3C,GAAgBA,GAAgB,EACrC,UAAA,CAAM,MAAA,4CAA4C,OAAAA,EAAY,GAAA,CAAxD,CAA2D,EAC9D,CAAC,cAAaH,EAAE,aAAYC,EAAE,eAAcC,EAAE,aAAYC,CAAA,CACnE,CCjBA,SAASC,GACLjC,EAA4B4B,EAC5BC,EAAuBC,EACvBC,EAAyC,CADlBD,IAAA,SAAAA,EAAkB,IACzCC,IAAA,SAAAA,EAAiB,OAAO,mBAC1B,IAAMzB,EACF/rC,EAAgByrC,EAAO,QAAS,oBAAqB,SAAS,EAC5DkC,EACF3tC,EAAgBqtC,EAAQ,SAAU,oBAAqB,SAAS,EAE9Dr8C,EAASo8C,GACXrB,EAAQ4B,EAASL,EAAeC,EAAcC,CAAc,EAChEF,EAAgBt8C,EAAO,cACvBu8C,EAAev8C,EAAO,aACtBw8C,EAAiBx8C,EAAO,eAExB,IAAM0J,EAAQ,CAAC,cAAa4yC,EAAE,aAAYC,EAAE,eAAcC,CAAA,EAC1D,OAAOlzC,EAAO,UACVrX,GAAqB,CAAC,MAAO8oD,EAAQ,OAAQ4B,CAAO,EAAGjzC,CAAK,CAClE,CAEO,IAAMkzC,GAAoCx8D,EAAG,CAAC,mBAAkBs8D,EAAA,CAAC,WCjCxDG,GACZz5D,EAAU05D,EAAYC,EAAmC,CAC3D,IAAM16D,EAAQ26D,GAAa55D,EAAK05D,EAASC,CAAU,EAC7CE,EAAiB56D,EAAQ,EAAI,EAAEA,EAAQ,GAAKA,EAClDe,EAAI,OAAO65D,EAAgB,EAAGH,CAAO,CACvC,UAiBgBE,GACZ55D,EAAU85D,EAAWH,EAAmC,CAC1D,OAAOI,GAAc/5D,EAAK85D,EAAQH,GAAcK,EAAiB,CACnE,CASA,SAASA,GAAqB95D,EAAM9E,EAAI,CACtC,OAAO8E,EAAI9E,EAAI,EAAI8E,EAAI9E,EAAI,GAAK,CAClC,CAEA,SAAS2+D,GACL/5D,EAAU85D,EAAWH,EAAkC,CAKzD,QAJI/5D,EAAO,EACPC,EAAQG,EAAI,OACZyuB,EAAS,EACTwrC,EAAQ,GACLr6D,EAAOC,GAAO,CACnB4uB,EAAS7uB,GAASC,EAAQD,IAAU,GACpC,IAAMs6D,EAAgBP,EAAWG,EAAQ95D,EAAIyuB,CAAM,CAAC,EAChDyrC,EAAgB,EAClBt6D,EAAO6uB,EAAS,GAEhB5uB,EAAQ4uB,EAGRwrC,EAAQ,CAACC,EAEZ,CAED,OAAOD,EAAQr6D,EAAO,CAACA,EAAO,CAChC,CCrDM,SAAUu6D,GACZ9C,EAAmB4B,EAAoBC,EACvCC,EAAsBC,EAAsB,CAC9C,OAAOgB,GACH/C,EAAO4B,EAAQC,EAAeC,EAAcC,EAC5C,CAAC,CACP,CAEgB,SAAAiB,GACZhD,EAAmB4B,EAAoBC,EACvCC,EAAsBC,EACtBkB,EAA2B,CAC7B,OAAOF,GACH/C,EAAO4B,EAAQC,EAAeC,EAAcC,EAC5C,EAAsB,GACtBkB,EAA6C,EAC7C,CACN,CAEgB,SAAAC,GACZlD,EAAmB4B,EAAoBC,EACvCC,EAAsBC,EACtBC,EAAoB,CACtB,OAAOe,GACH/C,EAAO4B,EAAQC,EAAeC,EAAcC,EAAgBC,EAC5D,EAAI,CACV,CAEA,SAASe,GACL/C,EAAmB4B,EAAoBC,EACvCC,EAAsBC,EAAwBC,EAC9CmB,EAA4BF,EAC5BG,EAA0B,CAD1BD,IAAA,SAAAA,EAA0B,IAAEF,IAAA,SAAAA,EAA0B,IACtDG,IAAA,SAAAA,EAA0B,IAK5B,QAFMC,EAAa,CAAA,EAEVr9D,EAAI,EAAGA,EAAI47D,EAAO,OAAQ57D,IAC7B47D,EAAO57D,CAAC,EAAI+7D,GACdsB,EAAW,KAAK,CAAC,MAAOzB,EAAO57D,CAAC,EAAG,SAAUA,EAAG,mBAAoB,CAAC,CAAC,EAI1Eq9D,EAAW,KAAKC,EAAmB,EASnC,QALMv0B,EAAQizB,EAAe,EAAK,IAAOA,EAAgB,EAEnDuB,EAA4B,CAAA,EAC5BC,EAA2B,CAAA,EAE1BD,EAAgB,OAAS1B,GAAiBwB,EAAW,OAAS,GAAG,CACtE,IAAMI,EAAYJ,EAAW,IAAG,EAClBK,EAA+CD,EAAS,MAAzCE,EAAgCF,EAAS,SAA/BG,EAAsBH,EAAS,mBAEtE,GAAIC,EAAgB3B,EAClB,MAUF,QADI8B,EAAkB,GACbl4D,EAAI43D,EAAgB,OAAS,EAAG53D,GAAKi4D,EAAoB,EAAEj4D,EAAG,CACrE,IAAMm4D,EAAMC,GAAsB/D,EAAO2D,EAAUJ,EAAgB53D,CAAC,CAAC,EAErE,GAAIm4D,GAAOhC,EAAc,CACvB+B,EAAkB,GAClB,KACD,CAKD,GAHAJ,EAAU,MACNA,EAAU,MAAQO,GAAelC,EAAc/yB,EAAO+0B,CAAG,EAEzDL,EAAU,OAAS1B,EACrB,KAEH,CASD0B,EAAU,mBAAqBF,EAAgB,OAE1CM,IAGCJ,EAAU,QAAUC,GACtBH,EAAgB,KAAKI,CAAQ,EAC7BH,EAAe,KAAKC,EAAU,KAAK,GAC1BA,EAAU,MAAQ1B,GAG3BK,GAAaiB,EAAYI,EAAWH,EAAmB,EAG5D,CAGD,IAAMW,EAAeV,EAAgB,OAC/BW,EAAarC,EAAgBoC,EAE/BhB,GAAsBiB,EAAa,IACrCX,EAAgB,KAAhB,MAAAA,EAAel9D,GAAA,CAAA,EAAAJ,EAAS,IAAI,MAAMi+D,CAAU,EAAE,KAAK,CAAC,CAAC,EAAE,EAAA,CAAA,EACvDV,EAAe,KAAf,MAAAA,EAAcn9D,GAAA,CAAA,EAAAJ,EAAS,IAAI,MAAMi+D,CAAU,EAAE,KAAK,CAAG,CAAC,EAAE,EAAA,CAAA,GAG1D,IAAMl/D,EAAkC,CAAC,gBAAeu+D,CAAA,EAExD,OAAIJ,IACFn+D,EAAO,eAAoBw+D,GAGzBJ,IACFp+D,EAAO,aAAkBi/D,GAGpBj/D,CACT,CAEA,SAAS++D,GAAsB/D,EAAmBh6D,EAAW2F,EAAS,CACpE,IAAMw4D,EAASnE,EAAM,SAASh6D,EAAI,EAAGA,EAAI,EAAI,CAAC,EACxCo+D,EAASpE,EAAM,SAASr0D,EAAI,EAAGA,EAAI,EAAI,CAAC,EACxC04D,EAAQ,KAAK,IAAIF,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EACrCG,EAAQ,KAAK,IAAIH,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EACrCI,EAAQ,KAAK,IAAIJ,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EACrCK,EAAQ,KAAK,IAAIL,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EACrCM,EAAQ,KAAK,IAAIL,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EACrCM,EAAQ,KAAK,IAAIN,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EACrCO,EAAQ,KAAK,IAAIP,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EACrCQ,EAAQ,KAAK,IAAIR,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EACrCS,GAASN,EAAQF,IAAUG,EAAQF,GACnCQ,GAASH,EAAQF,IAAUG,EAAQF,GACzC,GAAIG,GAAS,GAAKC,GAAS,EACzB,MAAO,GAET,IAAMC,EAAmB,KAAK,IAAIV,EAAOI,CAAK,EACxCO,EAAmB,KAAK,IAAIV,EAAOI,CAAK,EACxCO,EAAmB,KAAK,IAAIV,EAAOI,CAAK,EACxCO,EAAmB,KAAK,IAAIV,EAAOI,CAAK,EACxCO,EAAmB,KAAK,IAAIF,EAAmBF,EAAkB,CAAG,EACtE,KAAK,IAAIG,EAAmBF,EAAkB,CAAG,EACrD,OAAOG,GAAoBN,EAAQC,EAAQK,EAC7C,CAMA,SAASnB,GAAelC,EAAsB/yB,EAAe+0B,EAAW,CACtE,IAAMsB,EAAS,KAAK,IAAIr2B,EAAQ+0B,EAAMA,CAAG,EACzC,OAAOA,GAAOhC,EAAesD,EAAS,CACxC,CAEA,SAAS9B,GAAoB+B,EAAeC,EAAa,CAKvD,OAAQD,EAAG,MAAQC,EAAG,OAChBD,EAAG,QAAUC,EAAG,OAAWA,EAAG,SAAWD,EAAG,QACpD,CChKA,SAAeE,GACXvF,EAA4B4B,EAC5BC,EAAuBC,EACvBC,EAAyC,CADlB,OAAAD,IAAA,SAAAA,EAAkB,IACzCC,IAAA,SAAAA,EAAiB,OAAO,wHACpB,OAAAzB,EAAS/rC,EAAgByrC,EAAO,QAAS,wBAAwB,EACjEkC,EAAU3tC,EAAgBqtC,EAAQ,SAAU,wBAAwB,EAEpEr8C,EAASo8C,GACXrB,EAAQ4B,EAASL,EAAeC,EAAcC,CAAc,EAChEF,EAAgBt8C,EAAO,cACvBu8C,EAAev8C,EAAO,aACtBw8C,EAAiBx8C,EAAO,eAED,CAAA,EAAM,QAAQ,IAAI,CAAC+6C,EAAO,KAAI,EAAI4B,EAAQ,KAAI,CAAE,CAAC,CAAC,SAAnE,OAAAsD,EAAiBt2D,EAAkD,KAAA,EACnEu2D,EAAYD,EAAe,CAAC,EAC5BE,EAAaF,EAAe,CAAC,EAK5BjC,EAAmBT,GACtB2C,EAAWC,EAAY7D,EAAeC,EAAcC,CAAc,EAAC,gBACnEzB,IAAWN,GACbM,EAAO,QAAO,EAEZ4B,IAAYN,GACdM,EAAQ,QAAO,EAGjB,CAAA,EAAOhN,GAASqO,EAAiB,OAAO,CAAC,MAC1C,CAEM,IAAMoC,GAAyBJ,GCnBtC,SAASK,GACL5F,EAA4B4B,EAC5BC,EAAuBC,EACvBC,EACAC,EAAkB,CAFKF,IAAA,SAAAA,EAAkB,IACzCC,IAAA,SAAAA,EAAiB,OAAO,mBACxBC,IAAA,SAAAA,EAAkB,GACpB,IAAM1B,EAAS/rC,EAAgByrC,EAAO,QAAS,mBAAmB,EAC5DkC,EAAU3tC,EAAgBqtC,EAAQ,SAAU,mBAAmB,EAE/D/xD,EAAS8xD,GACXrB,EAAQ4B,EAASL,EAAeC,EAAcC,EAC9CC,CAAY,EAChBH,EAAgBhyD,EAAO,cACvBiyD,EAAejyD,EAAO,aACtBkyD,EAAiBlyD,EAAO,eACxBmyD,EAAenyD,EAAO,aAEtB,IAAM0V,EAAoC,CAAC,MAAO+6C,EAAQ,OAAQ4B,CAAO,EACnEjzC,EACF,CAAC,cAAa4yC,EAAE,aAAYC,EAAE,eAAcC,EAAE,aAAYC,CAAA,EAGxDh9D,EAAS6pB,EAAO,UACHnX,GAAqB6N,EACrB0J,CAAgC,EAEnD,MAAO,CAAC,gBAAiBjqB,EAAO,CAAC,EAAG,eAAgBA,EAAO,CAAC,CAAC,CAC/D,CAEO,IAAM6gE,GAA6ClgE,EAAG,CAAC,4BAA2BigE,EAAA,CAAC,EChC1F,SAAeE,GACX9F,EAA4B4B,EAC5BC,EAAuBC,EACvBC,EACAC,EAAkB,CAFK,OAAAF,IAAA,SAAAA,EAAkB,IACzCC,IAAA,SAAAA,EAAiB,OAAO,mBACxBC,IAAA,SAAAA,EAAkB,4GACd,OAAA1B,EAAS/rC,EAAgByrC,EAAO,QAAS,wBAAwB,EACjEkC,EAAU3tC,EAAgBqtC,EAAQ,SAAU,wBAAwB,EAEpE/xD,EAAS8xD,GACXrB,EAAQ4B,EAASL,EAAeC,EAAcC,EAC9CC,CAAY,EAChBH,EAAgBhyD,EAAO,cACvBiyD,EAAejyD,EAAO,aACtBkyD,EAAiBlyD,EAAO,eACxBmyD,EAAenyD,EAAO,aAEC,CAAA,EAAM,QAAQ,IAAI,CAACywD,EAAO,KAAI,EAAI4B,EAAQ,KAAI,CAAE,CAAC,CAAC,SAAnE,OAAAsD,EAAiBr2D,EAAkD,KAAA,EACnEs2D,EAAYD,EAAe,CAAC,EAC5BE,EAAaF,EAAe,CAAC,EAK7Bt2D,EAAoCg0D,GACtCuC,EAAWC,EAAY7D,EAAeC,EAAcC,EACpDC,CAAY,EAFTuB,EAAer0D,EAAA,gBAAEs0D,EAAct0D,EAAA,eAIlCoxD,IAAWN,GACbM,EAAO,QAAO,EAEZ4B,IAAYN,GACdM,EAAQ,QAAO,EAGV,CAAA,EAAA,CACL,gBAAiBhN,GAASqO,EAAiB,OAAO,EAClD,eAAgBrO,GAASsO,CAAc,EACxC,MACF,CAEM,IAAMuC,GAAkCD,GC1C/C,SAASE,GACLhG,EAA4B4B,EAC5BC,EAAuBC,EACvBC,EACAkB,EAA0B,CAFHnB,IAAA,SAAAA,EAAkB,IACzCC,IAAA,SAAAA,EAAiB,OAAO,mBACxBkB,IAAA,SAAAA,EAA0B,IAC5B,IAAM3C,EAAS/rC,EAAgByrC,EAAO,QAAS,mBAAmB,EAC5DkC,EAAU3tC,EAAgBqtC,EAAQ,SAAU,mBAAmB,EAE/D/xD,EAAS8xD,GACXrB,EAAQ4B,EAASL,EAAeC,EAAcC,EAC9C,IAAI,EACFkE,EAAiBp2D,EAAO,cACxBq2D,EAAgBr2D,EAAO,aACvBs2D,EAAkBt2D,EAAO,eAEzB0V,EAAoC,CAAC,MAAO+6C,EAAQ,OAAQ4B,CAAO,EACnEjzC,EAAkC,CACtC,cAAeg3C,EACf,aAAcC,EACd,eAAgBC,EAChB,mBAAkBlD,GAIdj+D,EAAS6pB,EAAO,UACHpX,GAAqB8N,EACrB0J,CAAgC,EAEnD,MAAO,CAAC,gBAAiBjqB,EAAO,CAAC,EAAG,aAAcA,EAAO,CAAC,CAAC,CAC7D,CAEO,IAAMohE,GAA0CzgE,EAAG,CAAC,yBAAwBqgE,EAAA,CAAC,EClCpF,SAAeK,GACXrG,EAA4B4B,EAC5BC,EAAuBC,EACvBC,EACAkB,EAA0B,CAFH,OAAAnB,IAAA,SAAAA,EAAkB,IACzCC,IAAA,SAAAA,EAAiB,OAAO,mBACxBkB,IAAA,SAAAA,EAA0B,mHACtB,OAAA3C,EAAS/rC,EAAgByrC,EAAO,QAAS,wBAAwB,EACjEkC,EAAU3tC,EAAgBqtC,EAAQ,SAAU,wBAAwB,EAEpE/xD,EAAS8xD,GACXrB,EAAQ4B,EAASL,EAAeC,EAAcC,EAC9C,IAAI,EACFkE,EAAiBp2D,EAAO,cACxBq2D,EAAgBr2D,EAAO,aACvBs2D,EAAkBt2D,EAAO,eAG3B,CAAA,EAAM,QAAQ,IAAI,CAACywD,EAAO,KAAI,EAAI4B,EAAQ,KAAI,CAAE,CAAC,CAAC,SADhD,OAAAhzD,EAAAjJ,EAAA,MAAA,OAAA,CACFmJ,EAAA,KAAA,EAAkD,CAAA,CAAA,EAD/Cq2D,EAASv2D,EAAA,CAAA,EAAEw2D,EAAUx2D,EAAA,CAAA,EAMtBC,EAAkC6zD,GACpCyC,EAAWC,EAAYO,EAAgBC,EAAeC,EACtDlD,CAAkB,EAFfM,EAAep0D,EAAA,gBAAE80D,EAAY90D,EAAA,aAIhCmxD,IAAWN,GACbM,EAAO,QAAO,EAEZ4B,IAAYN,GACdM,EAAQ,QAAO,EAGV,CAAA,EAAA,CACL,gBAAiBhN,GAASqO,EAAiB,OAAO,EAClD,aAAchqB,GAAO0qB,EAAc,OAAO,EAC3C,MACF,CAEM,IAAMqC,GAA+BD,GCxC5C,SAASE,GACLC,EAAsB98D,EAAwB+8D,EAC9CC,EAAwB,CADsBD,IAAA,SAAAA,EAAoB,IAClEC,IAAA,SAAAA,EAAwB,IAC1B,IAAMC,EAAUpyC,EAAgBiyC,EAAQ,SAAU,gBAAgB,EAElE/7C,EACIk8C,EAAQ,OAAS,GAAKA,EAAQ,OAAS,EACvC,UAAA,CAAM,MAAA,2DACF,QAAA,OAAQA,EAAQ,KAAI,GAAA,CADlB,CACqB,EAC/Bl8C,EACI/gB,EAAK,SAAW,EAChB,UAAM,CAAA,MAAA,6DACF,GAAA,OAAGA,EAAI,GAAA,CADL,CACQ,EAClB+gB,EACIi8C,IAAqB,IAASD,IAAiB,GAC/C,UAAA,CAAM,MAAA,mFAC2B,CAAA,EAErC,IAAIG,EAAcD,EACdz6B,EAAe,GACfy6B,EAAQ,OAAS,IACnBz6B,EAAe,GACf06B,EAAc96B,EACV66B,EAAS,CAAC,EAAGA,EAAQ,MAAM,CAAC,EAAGA,EAAQ,MAAM,CAAC,EAAGA,EAAQ,MAAM,CAAC,CAAC,CAAC,GAGlE1gE,EAAKyD,EAAI,CAAA,EAEf,IAAM6b,EAA+B,CAAC,OAAQqhD,CAAW,EACnD33C,EAA6B,CAAC,aAAYw3C,EAAE,iBAAgBC,EAAE,KAAIh9D,CAAA,EAGlEkY,EAAMiN,EAAO,UACHhW,GAAgB0M,EAChB0J,CAAgC,EAEhD,OAAIid,EACKJ,EAAQlqB,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAEzDA,CACT,CAEO,IAAMilD,GAAiClhE,EAAG,CAAC,gBAAe4gE,EAAA,CAAC,ECzClE,SAASO,GACLN,EAAsB98D,EAAwB+8D,EAC9CC,EAAwB,CADsBD,IAAA,SAAAA,EAAoB,IAClEC,IAAA,SAAAA,EAAwB,IAC1B,IAAMC,EAAUpyC,EAAgBiyC,EAAQ,SAAU,uBAAuB,EAEzE/7C,EACIk8C,EAAQ,OAAS,GAAKA,EAAQ,OAAS,EACvC,UAAA,CAAM,MAAA,kEACF,QAAA,OAAQA,EAAQ,KAAI,GAAA,CADlB,CACqB,EAC/Bl8C,EACI/gB,EAAK,SAAW,EAChB,UACI,CAAA,MAAA,oEACA,GAAA,OAAGA,EAAI,GAAA,CADP,CACU,EAClB+gB,EACIk8C,EAAQ,QAAU,WAAaA,EAAQ,QAAU,QACjD,UAAA,CAAM,MAAA,kDAAkD,CAAA,EAC5Dl8C,EACIi8C,IAAqB,IAASD,IAAiB,GAC/C,UAAA,CAAM,MAAA,0FAC2B,CAAA,EACrC,IAAIG,EAAcD,EACdz6B,EAAe,GACfy6B,EAAQ,OAAS,IACnBz6B,EAAe,GACf06B,EAAc96B,EACV66B,EAAS,CAAC,EAAGA,EAAQ,MAAM,CAAC,EAAGA,EAAQ,MAAM,CAAC,EAAGA,EAAQ,MAAM,CAAC,CAAC,CAAC,GAElE1gE,EAAKyD,EAAI,CAAA,EAEf,IAAM6b,EAAsC,CAAC,OAAQqhD,CAAW,EAC1D33C,EAC2B,CAAC,aAAYw3C,EAAE,iBAAgBC,EAAE,KAAIh9D,CAAA,EAGhEkY,EAAMiN,EAAO,UACHlW,GAAuB4M,EACvB0J,CAAgC,EAEhD,OAAIid,EACKJ,EAAQlqB,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAEzDA,CACT,CAEO,IAAMmlD,GAAwCphE,EAAG,CAAC,uBAAsBmhE,EAAA,CAAC,ECpChF,SAASE,GACLzsC,EACA4lC,EACA8G,EACAC,EAAiB,OAFjB/G,IAAA,SAAAA,EAAiB,UACjB8G,IAAA,SAAAA,EAAgB,IAChBC,IAAA,SAAAA,EAAiB,IAEjB,IAAM7G,EAAS9rC,EAAgBgG,EAAO,QAAS,WAAW,EAKpD4sC,EAAqB,MACrBC,EAAuB,KACvBC,EAAsB,KACtBC,EAAqBjH,EAAO,MAAM,CAAC,EAAIA,EAAO,MAAM,CAAC,EAEvDkH,EAAajkD,EAAI4xC,GAAS,CAACgS,CAAW,CAAC,EAAG,GAAG,EAC7ChhE,EAAGX,EAAGxB,EAAGyjE,EAsBb,GApBA/8C,EACI41C,EAAO,OAAS,EAChB,UAAM,CAAA,MAAA,4CACF,gBAAA,OAAgBA,EAAO,KAAI,GAAA,CADzB,CAC4B,EAEtC51C,EACI41C,EAAO,MAAM,CAAC,IAAM,GAAKA,EAAO,MAAM,CAAC,IAAK,EAC5C,UAAM,CAAA,MAAA,kEAEF,WAAW,OAAAA,EAAO,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EAErC51C,EACE41C,EAAO,QAAU,SAAWA,EAAO,QAAU,UAC7C,UAAA,CAAM,MAAA,wDACF,iBAAA,OAAiBA,EAAO,MAAK,GAAA,CAD3B,CAC8B,EAEtC51C,EACE01C,IAAW,QAAUA,IAAW,SAChC,UAAA,CAAM,MAAA,0CAA0C,OAAAA,CAAM,CAAhD,CAAkD,EAEtDE,EAAO,MAAM,CAAC,IAAM,EAAG,CACvBnxD,EAAAjJ,EAAYqtD,GAAM+M,EAAQ,CAAC,EAAG,EAAG,CAAC,EAAG,EAAE,EAAC,CAAA,EAAvCn6D,EAACgJ,EAAA,CAAA,EAAE3J,EAAC2J,EAAA,CAAA,EAAEnL,EAACmL,EAAA,CAAA,EACR,IAAMu4D,EAAKnkD,EAAIpd,EAAEihE,CAAkB,EAC7BO,EAAKpkD,EAAI/d,EAAE6hE,CAAoB,EAC/BtiC,EAAKxhB,EAAIvf,EAAEsjE,CAAmB,EACpCG,EAAYx/C,GAAIA,GAAIy/C,EAAIC,CAAE,EAAG5iC,CAAE,CAClC,MACG0iC,EAAYjtC,EAGhB,GAAI4lC,IAAW,OAAQ,CACnB,IAAMwH,EAAa53B,GAASvL,GAAK6F,GAAMm9B,CAAS,EAAG,OAAO,EACtDx6C,GAAO,CAAA,CAAE,EACT,GAAG,EACPu6C,EAAaK,GAAKD,EAAYL,CAAkB,CACnD,CAED,IAAMO,EAAeZ,EACjBvqB,GAAU8qB,EAAWD,CAAU,EAAI9rB,GAAQ+rB,EAAWD,CAAU,EAE9DviE,EAASw/B,GAAKlhB,EAAIukD,EAAa,GAAG,EAAG,OAAO,EAElD,OAAO7iE,CACX,CAEA,SAAS4iE,GAAKE,EAAqBC,EAAa,CAQ5C,QANIC,EAAa9S,GAAS,CAAC,EAAE,CAAC,EAC1B+S,EAAe/S,GAAS,CAAC,CAAC,CAAC,EAC3BgT,EAAYhT,GAAS,CAAC,CAAC,CAAC,EACxBiT,EAAYC,EAAaC,EACzBC,EAASC,EAAkBC,EAEtB5gE,EAAQ,EAAGA,EAAQkgE,EAAU,KAAK,EAAGlgE,IAAS,CAEnDugE,EAAavuC,GAAMkuC,EAAW,EAAGlgE,EAAQ,CAAC,EAE1CwgE,EAAcxuC,GAAMkuC,EAAUlgE,EAAQ,CAAC,EAEvC2gE,EAAmBtoD,GAAIvX,GAAIy/D,CAAU,EAAEJ,CAAK,EAE5CS,EAAavoD,GAAIvX,GAAI0/D,CAAW,EAAEL,CAAK,EAEvC,IAAMU,EAAgB//D,GAAI4a,EAAI6kD,EAAYhZ,GAAM,EAAGgZ,EAAW,IAAI,CAAC,CAAC,EAEpEE,EAAYpoD,GAAIwoD,EAAe//D,GAAIy/D,CAAU,CAAC,EAE9C,IAAMO,EAAc33B,GAAKq3B,EAAY,MAAOD,EAAW,IAAI,EACrDQ,EAAa3gD,GAAImnC,GAAM,EAAEiZ,EAAY,IAAI,EAAEM,CAAW,EACtDE,EAAatlD,EAAI8kD,EAAcO,CAAU,EAC/CL,EAAUroD,GAAIvX,GAAIkgE,CAAU,EAAGlgE,GAAI0/D,CAAW,CAAC,EAE/C,IAAMS,EAAgBhqB,GAAIwpB,EAAWC,CAAO,EACtCQ,EAAgBjqB,GAAIwpB,EAAWC,CAAO,EACtCS,EAAezlD,EAAIilD,EAAkBC,CAAU,EACrDN,EAAY5kD,EAAIA,EAAIylD,EAAaF,CAAa,EAAGC,CAAa,EAE9D,IAAMjzB,EAAY4F,GAAQysB,EAAWD,CAAY,EAEjDA,EAAe9xB,GAAMN,EAAWqyB,EAAWD,CAAY,EAEvDD,EAAa7xB,GAAMN,EAAWqf,GAAS,CAACttD,CAAK,CAAC,EAAGogE,CAAU,CAE9D,CACD,OAAOA,CACX,CAEO,IAAMgB,GAA4BrjE,EAAG,CAAE,WAAUqhE,EAAA,CAAE,ECzG1D,SAASiC,GACL1uC,EAA4B2uC,EAC5BC,EACAC,EAA8D5H,EAC9D3uB,EAA8B,CAF9Bs2B,IAAA,SAAAA,EAA+C,WAC/CC,IAAA,SAAAA,EAA4D,YAAE5H,IAAA,SAAAA,EAAa,GAE7E,IAAMnB,EAAS9rC,EAAgBgG,EAAO,QAAS,YAAa,SAAS,EAC/D8uC,EACF90C,EAAgB20C,EAAY,aAAc,YAAa,SAAS,EAEpEz+C,EACI41C,EAAO,OAAS,EAChB,UAAM,CAAA,MAAA,4CACF,gBAAA,OAAgBA,EAAO,KAAI,GAAA,CADzB,CAC4B,EAEtC51C,EACI4+C,EAAY,OAAS,IAChBA,EAAY,MAAM,CAAC,IAAMhJ,EAAO,MAAM,CAAC,GACvCgJ,EAAY,MAAM,CAAC,IAAM,IAC1BA,EAAY,MAAM,CAAC,IAAM,EAC7B,UAAA,CAAM,MAAA,kEAAA,CAAkE,EAE5E5+C,EACIooB,GAAe,MAAQA,EAAY,SAAW,EAC9C,UAAA,CACI,MAAA,oEACA,WAAA,OAAWA,EAAW,GAAA,CADtB,CACyB,EAEjC,IAAMttB,EAA0B,CAAC,MAAO86C,EAAQ,WAAYgJ,CAAW,EACjEp6C,EACe,CAAC,cAAak6C,EAAE,SAAQC,EAAE,UAAS5H,EAAE,YAAW3uB,CAAA,EAErE,OAAOhkB,EAAO,UACVzT,GAAWmK,EACX0J,CAAgC,CACtC,CAEO,IAAMq6C,GAA4B3jE,EAAG,CAAC,WAAUsjE,EAAA,CAAC,EClBxD,SAASM,GACL1gE,EAAiB2gE,EAAyBC,EAAuB,CACnE,IAAM5kC,EAAKtQ,EAAgB1rB,EAAG,IAAK,UAAU,EAC7CG,EACI67B,EAAG,MAAQ,EACX,UAAA,CAAM,MAAA,4CAAA,OAA4CA,EAAG,KAAI,GAAA,CAAnD,CAAsD,EAEhE,IAAMx9B,EAAQw9B,EAAG,MACX31B,EAAAjJ,EAAS4+B,EAAG,MAAM,MAAM,EAAE,EAAC,CAAA,EAA1B6kC,EAACx6D,EAAA,CAAA,EAAEy6D,EAACz6D,EAAA,CAAA,EAEP06D,EACAC,EACA,OAAOL,GAAa,UACtBxgE,EACIwgE,EAAW,IAAM,EACjB,UAAM,CAAA,MAAA,gDAAA,OAAgDA,EAAQ,GAAA,CAAxD,CAA2D,EACrExgE,EACIwgE,GAAYE,EACZ,UAAM,CAAA,MAAA,yBAAyB,OAAAF,EAAW,GAAA,EACtC,iDAAA,OAAiDE,EAAC,IAAA,CADhD,CACoD,EAC9DE,EACIr1C,EAAgBi1C,EAAW,EAAIE,EAAIF,EAAU,WAAY,UAAU,IAGvExgE,EACIwgE,EAAS,QAAU,QACnB,UAAA,CAAM,MAAA,gDAAA,CAAgD,EAG1DI,EAAYzzB,GAAMqG,GAAKgtB,EAAU,CAAC,EAAGE,EAAGnoB,GAAQioB,EAAUE,CAAC,CAAC,GAG1D,OAAOD,GAAa,UACtBzgE,EACIygE,EAAW,IAAM,EACjB,UAAM,CAAA,MAAA,gDAAA,OAAgDA,EAAQ,GAAA,CAAxD,CAA2D,EACrEzgE,EACIygE,GAAYE,EACZ,UAAM,CAAA,MAAA,yBAAyB,OAAAF,EAAW,GAAA,EACtC,oDAAA,OAAoDE,EAAC,IAAA,CADnD,CACuD,EACjEE,EACIt1C,EAAgBk1C,EAAW,EAAIE,EAAIF,EAAU,WAAY,UAAU,IAGvEzgE,EACIygE,EAAS,QAAU,QACnB,UAAA,CAAM,MAAA,gDAAA,CAAgD,EAC1DI,EAAY1zB,GAAMqG,GAAKitB,EAAU,CAAC,EAAGE,EAAGpoB,GAAQkoB,EAAUE,CAAC,CAAC,GAG9D,IAAM3jE,EAAI8lC,EAAQqjB,GAAM,EAAGua,EAAG,EAAG,OAAO,EAAG,CAAC,GAAI,CAAC,CAAC,EAC5C/9D,EAAIwjD,GAAM,EAAGwa,EAAG,EAAG,OAAO,EAC1BG,EAAKjrB,GAAI74C,EAAG2F,CAAC,EAEbo+D,EACFvqB,GAAW9C,GAAUotB,EAAIF,CAAS,EAAGjuB,GAAamuB,EAAI1rB,GAAIyrB,CAAS,CAAC,CAAC,EAEnEG,EAAOxzB,GAAM,CAACkzB,EAAGC,CAAC,EAAG9kC,EAAG,KAAK,EAEnC,OAAOiH,EACIyoB,GAAMgD,GAAQzrB,EAAQjH,EAAI,CAAC,GAAI6kC,EAAGC,CAAC,CAAC,CAAC,EAC1B,IAAI,SAAAM,EAAG,CAAI,OAAA9zB,GAAM4zB,EAAQE,EAAKD,CAAI,CAAC,CAAA,CAAC,EAC/C3iE,CAAK,CAClB,CAEO,IAAM6iE,GAA2BvkE,EAAG,CAAC,UAAS4jE,EAAA,CAAC,ECjFtD,SAASY,GAAanjD,EAAuB,CAC3C,IAAIojD,EACJ,GAAI,MAAM,QAAQpjD,CAAE,EAAG,CACrBojD,EAAkB,GAClBphE,EACIge,GAAM,MAAQA,EAAG,OAAS,EAC1B,UAAA,CAAM,MAAA,mEACK,CAAA,EAEf,QADMqjD,EAAMrjD,EAAG,CAAC,EAAE,MAAM,CAAC,aAChBhhB,EAAC,CACRgD,EACIge,EAAGhhB,CAAC,EAAE,MAAM,CAAC,IAAMqkE,EACnB,UAAA,CACI,MAAA,gEACA,IAAA,OAAKrjD,EAAkBhhB,CAAC,EAAE,MAAM,CAAC,EAAC,OAAA,EAAA,OAAQqkE,EAAG,GAAA,CAD7C,CACgD,GALjDrkE,EAAI,EAAGA,EAAIghB,EAAG,OAAQ,EAAEhhB,IAAxBA,CAAC,CAOX,MACCokE,EAAkB,GAClBpjD,EAAKssC,GAAMtsC,EAAIA,EAAG,MAAM,CAAC,EAAG,CAAC,EAAE,IAAI,SAAA9e,EAAC,CAAI,OAAAmsD,GAAQnsD,EAAG,CAAC,CAAC,CAAC,CAAd,CAAe,EAGzDc,EACIge,EAAG,QAAUA,EAAG,CAAC,EAAE,MAAM,CAAC,EAC1B,UAAA,CAAM,MAAA,oCACK,OAAAA,EAAkB,OAAkB,YAAA,EAC3C,yBAAA,OAA0BA,EAAkB,CAAC,EAAE,MAAM,CAAC,EAAC,IAAA,CAFrD,CAEyD,EAInE,QAFMsjD,EAAiB,CAAA,EACjBC,EAAOvjD,aACJhhB,EAAC,CACRskE,EAAG,KAAKz7C,EAAO,KAAK,UAAA,CAClB,IAAI3mB,EAAIqiE,EAAKvkE,CAAC,EACd,GAAIA,EAAI,EACN,QAAS2F,EAAI,EAAGA,EAAI3F,EAAG,EAAE2F,EAAG,CAC1B,IAAM6+D,EAAOlnD,EAAI5a,GAAI4a,EAAIgnD,EAAG3+D,CAAC,EAAGzD,CAAC,CAAC,EAAGoiE,EAAG3+D,CAAC,CAAC,EAC1CzD,EAAI22C,GAAI32C,EAAGsiE,CAAI,CAChB,CAEH,OAAOvqD,GAAI/X,EAAG6xC,GAAK7xC,EAAG,WAAW,CAAC,EACnC,CAAC,GAVKlC,EAAI,EAAGA,EAAIghB,EAAG,OAAQ,EAAEhhB,IAAxBA,CAAC,EAaV,OAAIokE,EACK7V,GAAM+V,EAAI,CAAC,EAEXA,CAEX,CAEO,IAAMG,GAA8B9kE,EAAG,CAAC,aAAYwkE,EAAA,CAAC,ECzB5D,SAASO,GAAIxiE,EAAWyiE,EAAoB,CAM1C,GANsBA,IAAA,SAAAA,EAAoB,IAC1C3hE,EACId,EAAE,MAAQ,EACV,UAAA,CAAM,MAAA,gEAAA,OACFA,EAAE,IAAI,CADJ,CACM,EAEZA,EAAE,OAAS,EACb,OAAO0iE,GAAK1iE,EAAeyiE,CAAY,EAMvC,IAAME,EAAgB3iE,EAAE,MAAM,MAAM,EAAGA,EAAE,MAAM,OAAS,CAAC,EAC9B,OAAO,SAACzD,EAAOsJ,EAAI,CAAK,OAAAtJ,EAAQsJ,CAAR,CAAY,EACzD+8D,EAAOvT,GACTzrB,EACI5jC,EACA,CACE2iE,EAAe3iE,EAAE,MAAMA,EAAE,MAAM,OAAS,CAAC,EACzCA,EAAE,MAAMA,EAAE,MAAM,OAAS,CAAC,EAC3B,EACL,CAAC,EACC6iE,EAAmB,CAAA,EACnBC,EAAmB,CAAA,EACzBF,EAAK,QAAQ,SAAAG,EAAG,CACR,IAAA/7D,EAAAjJ,EAAa2kE,GAAKK,EAAiBN,CAAY,EAAC,CAAA,EAA/CO,EAAGh8D,EAAA,CAAA,EAAEi8D,EAAGj8D,EAAA,CAAA,EACf67D,EAAK,KAAKG,CAAG,EACbF,EAAK,KAAKG,CAAG,CACf,CAAC,EACD,IAAMC,EAAIt/B,EAAQyoB,GAAMwW,EAAM,CAAC,EAAG7iE,EAAE,KAAK,EACnChC,EAAI4lC,EAAQyoB,GAAMyW,EAAM,CAAC,EAAG9iE,EAAE,KAAK,EACzC,MAAO,CAACkjE,EAAGllE,CAAC,CAEhB,CAEA,SAAS0kE,GAAK1iE,EAAayiE,EAAoB,CAApB,OAAAA,IAAA,SAAAA,EAAoB,IACtC97C,EAAO,KAAK,UAAA,CACjB7lB,EACId,EAAE,MAAM,SAAW,EACnB,UAAA,CAAM,MAAA,0CACF,OAAAA,EAAE,MAAM,OAAiB,WAAA,CAAA,CAAA,EAYjC,QAVMnC,EAAImC,EAAE,MAAM,CAAC,EACb,EAAIA,EAAE,MAAM,CAAC,EAEfkjE,EAAInwB,GAAIl1C,CAAC,EACTG,EAAIw+B,GAAMx8B,CAAC,EAETmjE,EAAQlW,GAAS,CAAC,CAAC,CAAC,CAAC,EAAG,CAAC,EAAG,CAAC,CAAC,EAChC3xC,EAAckhB,GAAM2mC,CAAK,EAEvBC,EAAQvlE,GAAK,EAAI,EAAIA,aAClB4F,EAAC,OAGF4/D,EAAQrlE,EACRslE,EAAQhoD,EACRioD,EAAQL,EACdl8D,EAAAjJ,EAAY4oB,EAAO,KAAK,UAAA,CAEtB,IAAM68C,EAAS9xC,GAAM1zB,EAAG,CAACyF,EAAGA,CAAC,EAAG,CAAC5F,EAAI4F,EAAG,CAAC,CAAC,EACpCggE,EAAQ5xB,GAAK2xB,CAAM,EACnBE,EAAMhyC,GAAM1zB,EAAG,CAACyF,EAAGA,CAAC,EAAG,CAAC,EAAG,CAAC,CAAC,EAG7B7F,EAAIqwC,GAAMsF,GAAQmwB,EAAK,CAAC,EAAGzW,GAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAGA,GAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAE5D0W,EAAKhtB,GAAI+sB,EAAKtoD,EAAIxd,EAAG6lE,CAAK,CAAC,EAC3BG,EAAO7rD,GAAIyrD,EAAQG,CAAE,EACvBC,EAAK,MAAM,CAAC,IAAM,EACpBtoD,EAAIkhB,GAAM2mC,CAAK,EAEf7nD,EAAImpB,GACA,CACE0+B,EACAzxC,GAAMkyC,EAAM,CAAC,EAAG,CAAC,EAAG,CAACA,EAAK,MAAM,CAAC,EAAI,EAAGA,EAAK,MAAM,CAAC,CAAC,CAAC,GAGxD,CAAC,EAEP,IAAMC,EAAM3tB,GAAIn+B,GAAI8sB,GAAOjnC,EAAG+lE,CAAE,EAAGF,CAAK,CAAC,EAGnCK,EAAWpyC,GAAM1zB,EAAG,CAACyF,EAAG,CAAC,EAAG,CAAC5F,EAAI4F,EAAG,CAAC,CAAC,EACtCsgE,EAAsB3oD,EAAIyoD,EAAKvoD,CAAC,EAChC0oD,EAAerT,GAAUr1C,CAAC,EAChC,GAAI7X,IAAM,EACRzF,EAAI24C,GAAImtB,EAAUj/B,GAAOk/B,EAAWl/B,GAAOm/B,EAAIF,CAAQ,CAAC,CAAC,MACpD,CACL,IAAMG,EACFttB,GAAImtB,EAAUj/B,GAAOk/B,EAAWl/B,GAAOm/B,EAAIF,CAAQ,CAAC,CAAC,EACzD9lE,EAAIymC,GAAO,CAAC/S,GAAM1zB,EAAG,CAAC,EAAG,CAAC,EAAG,CAACyF,EAAG,CAAC,CAAC,EAAGwgE,CAAS,EAAG,CAAC,CACpD,CACD,IAAMC,EAAuBvT,GAAUoT,CAAS,EAC1CI,EAAWzyC,GAAMwxC,EAAG,CAAC,EAAGz/D,CAAC,EAAG,CAAC5F,EAAGqlE,EAAE,MAAM,CAAC,EAAIz/D,CAAC,CAAC,EACrD,GAAIA,IAAM,EACRy/D,EAAIvsB,GAAIwtB,EAAUt/B,GAAOA,GAAOs/B,EAAU7oD,CAAC,EAAG4oD,CAAU,CAAC,MACpD,CACL,IAAME,EACFztB,GAAIwtB,EAAUt/B,GAAOA,GAAOs/B,EAAU7oD,CAAC,EAAG4oD,CAAU,CAAC,EACzDhB,EAAIz+B,GAAO,CAAC/S,GAAMwxC,EAAG,CAAC,EAAG,CAAC,EAAG,CAACrlE,EAAG4F,CAAC,CAAC,EAAG2gE,CAAS,EAAG,CAAC,CACpD,CACD,MAAO,CAAC9oD,EAAGtd,EAAGklE,CAAC,EAChB,EAAC,CAAA,EA7CD5nD,EAACtU,EAAA,CAAA,EAAEhJ,EAACgJ,EAAA,CAAA,EAAEk8D,EAACl8D,EAAA,CAAA,EA8CR4oB,GAAQ,CAACyzC,EAAOC,EAAOC,CAAK,CAAC,GApDtB9/D,EAAI,EAAGA,EAAI2/D,EAAO,EAAE3/D,IAApBA,CAAC,EAuDV,MAAI,CAACg/D,GAAgB5kE,EAAI,IACvBqlE,EAAIxxC,GAAMwxC,EAAG,CAAC,EAAG,CAAC,EAAG,CAACrlE,EAAG,CAAC,CAAC,EAC3BG,EAAI0zB,GAAM1zB,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,CAAC,GAGtB,CAACklE,EAAGllE,CAAC,CACd,CAAC,CACH,CAEO,IAAMqmE,GAAqB5mE,EAAG,CAAC,IAAG+kE,EAAA,CAAC,ECvL9B8B,EAAAA,UAAAA,QAAZ,SAAYA,EAAS,CACnBA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,IAAA,CAAA,EAAA,MACAA,EAAAA,EAAA,uBAAA,CAAA,EAAA,wBACF,GALYA,EAAAA,YAAAA,EAAAA,UAKX,CAAA,EAAA,ECoBD,SAASC,GACLC,EAAsB78B,EACtB88B,EAA4C,CAA5CA,IAAA,SAAAA,EAAYH,EAAAA,UAAU,wBACxB,IAAMI,EAAUr4C,EAAgBm4C,EAAQ,SAAU,qBAAqB,EACnE58B,EAAmB,KACnBD,GAAW,OACbC,EAAWvb,EAAgBsb,EAAS,UAAW,qBAAqB,GAGtE,IAAMg9B,EAAgB/8B,GAAY,KAAQ88B,EAAUtpD,EAAIspD,EAAS98B,CAAQ,EAEzE,GAAI68B,IAAcH,EAAAA,UAAU,KAC1B,OAAOK,EAET,GAAIF,IAAcH,EAAAA,UAAU,IAC1B,OAAO9jE,GAAImkE,CAAY,EAEzB,GAAIF,IAAcH,EAAAA,UAAU,KAAM,CAChC,GAAI18B,GAAY,KACd,OAAOjB,GAAKg+B,CAAY,EAExB,IAAMC,EAAkBF,EAAQ,KAAO98B,EAAS,KAC1C9qC,EAASib,GAAIvX,GAAImkE,CAAY,EAAGnkE,GAAIonC,CAAQ,CAAC,EACnD,OAAOg9B,EAAkB,EAAI7sD,GAAIjb,EAAQu0C,GAAOuzB,CAAe,CAAC,EACnC9nE,CAEhC,CACD,GAAI2nE,IAAcH,EAAAA,UAAU,uBAAwB,CAClD,GAAI18B,GAAY,KACd,OAAO7vB,GAAIvX,GAAImkE,CAAY,EAAGtzB,GAAOqzB,EAAQ,IAAI,CAAC,EAElD,IAAMG,EAAqBzpD,EAAIwsB,EAAUrd,GAAKm6C,EAAQ,KAAK,CAAC,EAEtDI,EACFxoC,GAAK97B,GAAIq6C,GAASgqB,EAAoBxzB,GAAO,CAAC,CAAC,CAAC,EAAG,SAAS,EAChE,OAAOt5B,GAAIvX,GAAImkE,CAAY,EAAGG,CAAW,CAE5C,CAED,MAAM,MAAM,sBAAA,OAAsBL,CAAS,CAAE,CAC/C,CACO,IAAMM,GAAsCtnE,EAAG,CAAC,qBAAoB8mE,EAAA,CAAC,ECxC5E,SAASS,GACLC,EAAsB7R,EACtBzrB,EACA88B,EAA4C,CAA5CA,IAAA,SAAAA,EAAYH,EAAAA,UAAU,wBACxB,IAAMY,EAAU74C,EAAgB44C,EAAQ,SAAU,oBAAoB,EAChE3R,EACFjnC,EAAgB+mC,EAAa,cAAe,oBAAoB,EAChExrB,EAAmB,KACnBD,GAAW,OACbC,EAAWvb,EAAgBsb,EAAS,UAAW,oBAAoB,GAErE1mC,GACIikE,EAAQ,MAAO5R,EAAa,MAAO,+BAA+B,EAEtE,IAAMkR,EAAStnC,GAAIyZ,GAAIuuB,EAAS5R,CAAY,CAAC,EAC7C,OAAOyR,GAAoBP,EAAQ58B,EAAU68B,CAAS,CACxD,CAEO,IAAMU,GAAqC1nE,EAAG,CAAC,oBAAmBunE,EAAA,CAAC,EChB1E,SAASI,GACLH,EAAsB7R,EAA2BlwD,EACjDykC,EACA88B,EAA4C,CAA5CA,IAAA,SAAAA,EAAYH,EAAAA,UAAU,wBACxB,IAAMY,EAAU74C,EAAgB44C,EAAQ,SAAU,gBAAgB,EAC5D3R,EACFjnC,EAAgB+mC,EAAa,cAAe,gBAAgB,EAC5DxrB,EAAmB,KACnBD,GAAW,OACbC,EAAWvb,EAAgBsb,EAAS,UAAW,gBAAgB,GAEjE1mC,GACIikE,EAAQ,MAAO5R,EAAa,MAAO,2BAA2B,EAElE,IAAMrC,EAAM5f,GAAO,CAAC,EACdmzB,EAAS7tB,GAAIsa,EAAKzwD,GAAI4a,EAAI8pD,EAAS5R,CAAY,EAAGpwD,EAAM,EAAI,CAAC,EACnE,OAAO6hE,GAAoBP,EAAQ58B,EAAU68B,CAAS,CACxD,CACO,IAAMY,GAAiC5nE,EAAG,CAAC,gBAAe2nE,EAAA,CAAC,ECnBlE,SAASE,GACLL,EAAsB7R,EACtBzrB,EACA88B,EAA4C,CAA5CA,IAAA,SAAAA,EAAYH,EAAAA,UAAU,wBACxB,IAAIY,EAAU74C,EAAgB44C,EAAQ,SAAU,WAAW,EACrD3R,EAAejnC,EAAgB+mC,EAAa,cAAe,WAAW,EACxExrB,EAAmB,KACnBD,GAAW,OACbC,EAAWvb,EAAgBsb,EAAS,UAAW,WAAW,GAE5D1mC,GAAkBikE,EAAQ,MAAO5R,EAAa,MAAO,sBAAsB,EAE3E,IAAMrC,EAAM5f,GAAO,CAAC,EAEpB6zB,EAAUvuB,GAAIv7B,EAAIi2B,GAAO,CAAC,EAAG6zB,CAAO,EAAGjU,CAAG,EAC1C,IAAMuT,EAASld,GAAK3Q,GAAIsa,EAAK71C,EAAI8pD,EAAS5R,CAAY,CAAC,CAAC,EACxD,OAAOyR,GAAoBP,EAAQ58B,EAAU68B,CAAS,CACxD,CACO,IAAMc,GAA4B9nE,EAAG,CAAC,WAAU6nE,EAAA,CAAC,ECbxD,SAASE,GACLP,EAAsB7R,EACtBzrB,EAA6B9tB,EAC7B4qD,EAA4C,CADf5qD,IAAA,SAAAA,EAAW,GACxC4qD,IAAA,SAAAA,EAAYH,EAAAA,UAAU,wBACxB,IAAMY,EAAU74C,EAAgB44C,EAAQ,SAAU,WAAW,EACvD3R,EAAejnC,EAAgB+mC,EAAa,cAAe,WAAW,EACxExrB,EAAmB,KACnBD,GAAW,OACbC,EAAWvb,EAAgBsb,EAAS,UAAW,WAAW,GAE5D1mC,GAAkBikE,EAAQ,MAAO5R,EAAa,MAAO,sBAAsB,EAE3E,IAAMmS,EAAcp0B,GAAOx3B,CAAK,EAC1B3b,EAAQg/B,GAAIyZ,GAAI2c,EAAc4R,CAAO,CAAC,EACtCQ,EAAYrsB,GAAQn7C,EAAOunE,CAAW,EACtCE,EAAShvB,GAAIz4C,EAAOwnE,CAAS,EAE7BlB,EACF1kD,GAAI1E,EAAIi2B,GAAO,EAAG,EAAGI,GAAOi0B,CAAS,CAAC,EAAGtqD,EAAIqqD,EAAaE,CAAM,CAAC,EACrE,OAAOZ,GAAoBP,EAAQ58B,EAAU68B,CAAS,CACxD,CACO,IAAMmB,GAA4BnoE,EAAG,CAAC,WAAU+nE,EAAA,CAAC,ECtBxD,SAASK,GACLZ,EAAsB7R,EACtBzrB,EAA6Bkc,EAC7B4gB,EAA4C,CADf5gB,IAAA,SAAAA,EAAc,MAC3C4gB,IAAA,SAAAA,EAAYH,EAAAA,UAAU,wBACxB,IAAMY,EAAU74C,EAAgB44C,EAAQ,SAAU,SAAS,EACrD3R,EAAejnC,EAAgB+mC,EAAa,cAAe,SAAS,EACtExrB,EAAmB,KACnBD,GAAW,OACbC,EAAWvb,EAAgBsb,EAAS,UAAW,SAAS,GAE1D1mC,GAAkBikE,EAAQ,MAAO5R,EAAa,MAAO,oBAAoB,EAEzE,IAAMrC,EAAM5f,GAAO,CAAC,EACdy0B,EAAgBz0B,GAAOwS,CAAO,EAE9BkiB,EAAK7vB,GAAI96B,EAAI8pD,EAASlxD,GAAI8L,GAAIwzC,EAAcwS,CAAa,CAAC,CAAC,CAAC,EAC5DE,EACF5qD,EAAIu7B,GAAIsa,EAAKiU,CAAO,EAAGlxD,GAAI8L,GAAI62B,GAAIsa,EAAKqC,CAAY,EAAGwS,CAAa,CAAC,CAAC,EACpEtB,EAAS7tB,GAAIovB,EAAIC,CAAE,EACzB,OAAOjB,GAAoBP,EAAQ58B,EAAU68B,CAAS,CACxD,CACO,IAAMwB,GAA0BxoE,EAAG,CAAC,SAAQooE,EAAA,CAAC,EC3BpD,SAASK,GACLjB,EAAsB7R,EACtBzrB,EACA88B,EAA4C,CAA5CA,IAAA,SAAAA,EAAYH,EAAAA,UAAU,wBACxB,IAAMY,EAAU74C,EAAgB44C,EAAQ,SAAU,kBAAkB,EAC9D3R,EACFjnC,EAAgB+mC,EAAa,cAAe,kBAAkB,EAC9DxrB,EAAmB,KACnBD,GAAW,OACbC,EAAWvb,EAAgBsb,EAAS,UAAW,kBAAkB,GAEnE1mC,GACIikE,EAAQ,MAAO5R,EAAa,MAAO,6BAA6B,EAEpE,IAAMkR,EAASvY,GAAkBiZ,EAAS5R,CAAY,EACtD,OAAOyR,GAAoBP,EAAQ58B,EAAU68B,CAAS,CACxD,CACO,IAAM0B,GAAmC1oE,EAAG,CAAC,kBAAiByoE,EAAA,CAAC,ECxBtE,SAASE,GACLnB,EAAsBpuB,EAAoB,CAC5C,IAAMquB,EACF74C,EAAgB44C,EAAQ,SAAU,+BAA+B,EAC/DnuB,EACFzqB,EAAgBwqB,EAAQ,SAAU,+BAA+B,EACrE51C,GACIikE,EAAQ,MAAOpuB,EAAQ,MAAO,0CAA0C,EAsB5E,IAAMuvB,EAAY/e,GAAKxQ,CAAO,EACxBwvB,EAAgBlrD,EAAI07B,EAASouB,CAAO,EACpCqB,EAAgBrxB,GAAMjE,GAAIiF,GAAIhZ,GAAI4Z,CAAO,CAAC,CAAC,CAAC,EAElD,OAAOh3B,GAAI62B,GAAI0vB,EAAWC,CAAa,EAAGC,CAAa,CACzD,CAuBA,SAASC,GACLC,EAAgC5vB,EAChClP,EAA6B++B,EAC7BjC,EAA4C,CADfiC,IAAA,SAAAA,EAAkB,GAC/CjC,IAAA,SAAAA,EAAYH,EAAAA,UAAU,wBACxB,IAAIqC,EAAoBt6C,EACpBo6C,EAAkB,mBAAoB,qBAAqB,EACzD3vB,EAAUzqB,EAAgBwqB,EAAQ,SAAU,qBAAqB,EACnEjP,EAAmB,KAOvB,GANID,GAAW,OACbC,EAAWvb,EAAgBsb,EAAS,UAAW,qBAAqB,GAEtE1mC,GACI0lE,EAAkB,MAAO7vB,EAAQ,MAAO,gCAAgC,EAExE4vB,EAAiB,EAAG,CACtB,IAAME,EAAuBv1B,GAAOq1B,CAAc,EAC5CzV,EAAM5f,GAAO,CAAC,EACdqa,EAAOra,GAAO,EAAG,EAEvBs1B,EACI7mD,GAAI1E,EAAIurD,EAAmBhwB,GAAIsa,EAAK2V,CAAoB,CAAC,EACrDxrD,EAAIswC,EAAMkb,CAAoB,CAAC,CACxC,CACD,IAAMpC,EAAS4B,GAA+BO,EAAmB7vB,CAAO,EAExE,OAAOiuB,GAAoBP,EAAQ58B,EAAU68B,CAAS,CACxD,CAEO,IAAMoC,GAAsCppE,EAAG,CAAC,qBAAoB+oE,EAAA,CAAC,ECzD5E,SAASM,GACL7B,EAAWpuB,EAAW5J,EAAQ,CAKhC,GALwBA,IAAA,SAAAA,EAAA,IACpBA,IAAQ,KACVA,EAAM4J,EAAO,KAAO,GAGlB5J,IAAQ4J,EAAO,KAAO,EACxB,MAAM,MACF,+DACA,uCAAuC,OAAAA,EAAO,KAAO,GAAA,EACrD,eAAe,OAAA5J,CAAG,CAAE,EAG1B,IAAMqJ,EACFP,GAAW,SAACkvB,EAAgBpuB,EAAgBjsB,EAAkB,CAI5D,IAAMgT,EAAW,GACXmpC,EAAM3vB,GAAUP,EAAQ,CAAC5J,CAAG,EAAGrP,CAAQ,EACvCopC,EAAYrwB,GAAIra,GAAKua,EAAQ,SAAS,EAAGkwB,CAAG,EAClDn8C,EAAK,CAACq6C,EAAQ+B,CAAS,CAAC,EAExB,IAAMC,EAAa/wB,GAAI96B,EAAI4rD,EAAW/B,CAAM,CAAC,EACvC1oE,EAAWiE,GAAIymE,EAAY,CAACh6B,CAAG,CAAC,EAEhCsJ,EAAW,SAAC1vB,EAAOG,EAAe,CAChC,IAAAhgB,EAAAjJ,EAAsBipB,EAAK,CAAA,EAA1Bi+C,EAAMj+D,EAAA,CAAA,EAAEggE,EAAShgE,EAAA,CAAA,EAClBkgE,EAAU52B,GAAqBzpB,EAAG,MAAO,CAAComB,CAAG,CAAC,EACpD,MAAO,CACL7xB,EAAIwoB,EAAQ/c,EAAIqgD,CAAO,EACnBvwB,GAAIra,GAAK2oC,EAAQ,SAAS,EAAGh0B,GAAI+1B,CAAS,CAAC,CAAC,EAChD5rD,EAAIwoB,EAAQ/c,EAAIqgD,CAAO,EACnBvwB,GAAI1F,GAAI+1B,CAAS,EAAG1qC,GAAK2oC,EAAQ,SAAS,CAAC,CAAC,EAEpD,EACA,MAAO,CAAC,MAAK1oE,EAAE,SAAQg6C,CAAA,CACzB,CAAC,EAEL,OAAOD,EAAS2uB,EAAQpuB,CAAM,CAChC,CAqBA,SAASswB,GACLC,EAA4BvwB,EAC5BlP,EAA6B++B,EAC7BjC,EAA4C,CADfiC,IAAA,SAAAA,EAAkB,GAC/CjC,IAAA,SAAAA,EAAYH,EAAAA,UAAU,wBACxB,IAAI+C,EACAh7C,EAAgB+6C,EAAc,eAAgB,qBAAqB,EACjEtwB,EAAUzqB,EAAgBwqB,EAAQ,SAAU,qBAAqB,EACnEjP,EAAmB,KASvB,GAPID,GAAW,OACbC,EAAWvb,EAAgBsb,EAAS,UAAW,qBAAqB,GAGtE1mC,GACIomE,EAAc,MAAOvwB,EAAQ,MAAO,gCAAgC,EAEpE4vB,EAAiB,EAAG,CACtB,IAAME,EAAuBv1B,GAAOq1B,CAAc,EAC5CzV,EAAM5f,GAAO,CAAC,EACdi2B,EAAaj2B,GAAOg2B,EAAc,MAAM,CAAC,CAAC,EAEhDA,EACIvnD,GAAI1E,EAAIisD,EAAe1wB,GAAIsa,EAAK2V,CAAoB,CAAC,EACjD7uD,GAAI6uD,EAAsBU,CAAU,CAAC,CAC9C,CAED,IAAM9C,EAASsC,GAA+BO,EAAevwB,CAAO,EAEpE,OAAOiuB,GAAoBP,EAAQ58B,EAAU68B,CAAS,CACxD,CAEO,IAAM8C,GAAsC9pE,EAAG,CAAC,qBAAoB0pE,EAAA,CAAC,EC1E5E,SAASK,GACL17C,EAA8B5sB,EAC9BuoE,EACApoB,EAA+B,CACjC,IAAMjM,EACF/mB,EAAgBP,EAAS,UAAW,sBAAuB,OAAO,EAChEmsB,EAAU5rB,EAAgBntB,EAAQ,SAAU,qBAAqB,EACjEwoE,EACFr7C,EAAgBo7C,EAAY,aAAc,sBAAuB,OAAO,EACtEhoB,EAAgBpzB,EAClBgzB,EAAc,eAAgB,sBAAuBpH,EAAQ,KAAK,EAEtE,GAAI7E,EAAS,OAAS,EACpB,MAAM,IAAI,MAAM;UAAA,OACVA,EAAS,KAAK,CAAE,EAExB,GAAI6E,EAAQ,OAAS,EACnB,MAAM,IAAI,MACN,gDAAA,OAAgDA,EAAQ,KAAK,CAAE,EAErE,GAAIyvB,EAAY,OAAS,EACvB,MAAM,IAAI,MAAM,qDAAA,OACZA,EAAY,KAAK,CAAE,EAEzB,GAAIjoB,EAAc,OAAS,EACzB,MAAM,IAAI,MAAM,uDAAA,OACZA,EAAc,KAAK,CAAE,EAG3B,IAAMpiC,EAAoC,CACxC,QAAS+1B,EACT,OAAQ6E,EACR,WAAYyvB,EACZ,aAAcjoB,GAGV3iD,EAAmB6pB,EAAO,UAAU1U,GAAqBoL,CAAY,EAC3E,MAAO,CACL,cAAevgB,EAAO,CAAC,EACvB,aAAcA,EAAO,CAAC,EACtB,kBAAmBA,EAAO,CAAC,EAC3B,gBAAiBA,EAAO,CAAC,EAE7B,CAEO,IAAM6qE,GAAsClqE,EAAG,CAAC,qBAAoB+pE,EAAA,CAAC,ECnE5E,SAASI,GACLC,EAAmCnpD,EACnC1b,EAA6B,CAC/B,IAAM8kE,EACFz7C,EAAgBw7C,EAAc,eAAgB,gBAAiB,OAAO,EACpEE,EACF17C,EAAgB3N,EAAY,aAAc,gBAAiB,OAAO,EAChEspD,EACF37C,EAAgBrpB,EAAU,WAAY,gBAAiB,OAAO,EAElE,GAAI8kE,EAAc,OAAS,EACzB,MAAM,IAAI,MAAM;UAAA,OACVA,EAAc,KAAK,CAAE,EAE7B,GAAIC,EAAY,OAAS,EACvB,MAAM,IAAI,MAAM,qDAAA,OACZA,EAAY,KAAK,CAAE,EAEzB,GAAIC,EAAU,OAAS,EACrB,MAAM,IAAI,MACN,mDAAA,OAAmDA,EAAU,KAAK,CAAE,EAG1E,IAAM3qD,EAA8B,CAClC,aAAcyqD,EACd,WAAYC,EACZ,SAAUC,GAENlrE,EAAmB6pB,EAAO,UAAUzU,GAAemL,CAAY,EACrE,MAAO,CAAC,cAAevgB,EAAO,CAAC,EAAG,YAAaA,EAAO,CAAC,CAAC,CAC1D,CAEO,IAAMmrE,GAAgCxqE,EAAG,CAAC,eAAcmqE,EAAA,CAAC,ECjChE,SAASM,GACLziE,EAAyBqmB,EACzBkjC,EAA+B,CACjC,IAAMtpB,EAAQrZ,EAAgB5mB,EAAM,OAAQ,mBAAmB,EACzD2tC,EACF/mB,EAAgBP,EAAS,UAAW,oBAAqB,OAAO,EAC9DojC,EACF7iC,EAAgB2iC,EAAY,aAAc,oBAAqB,OAAO,EAE1E,GAAItpB,EAAM,KAAO,EACf,MAAM,IAAI,MACN,2DAA2D,EAEjE,GAAI0N,EAAS,OAAS,EACpB,MAAM,IAAI,MAAM;YAAA,OACRA,EAAS,KAAK,CAAE,EAE1B,GAAI8b,EAAY,OAAS,EACvB,MAAM,IAAI,MAAM;YAAA,OACRA,EAAY,KAAK,CAAE,EAG7B,IAAM7xC,EAAkC,CACtC,KAAMqoB,EACN,QAAS0N,EACT,WAAY8b,GAGd,OAAOvoC,EAAO,UAAUxU,GAAmBkL,CAAY,CACzD,CAEO,IAAM8qD,GAAoC1qE,EAAG,CAAC,mBAAkByqE,EAAA,CAAC,EC/BxE,SAASE,GACL3iE,EAAyBqmB,EACzBkjC,EAA+B,CACjC,IAAMtpB,EAAQrZ,EAAgB5mB,EAAM,OAAQ,kBAAkB,EACxD2tC,EACF/mB,EAAgBP,EAAS,UAAW,mBAAoB,OAAO,EAC7DojC,EACF7iC,EAAgB2iC,EAAY,aAAc,mBAAoB,OAAO,EAEzE,GAAItpB,EAAM,KAAO,EACf,MAAM,IAAI,MACN,2DAA2D,EAEjE,GAAI0N,EAAS,OAAS,EACpB,MAAM,IAAI,MAAM;WAAA,OACTA,EAAS,KAAK,CAAE,EAEzB,GAAI8b,EAAY,OAAS,EACvB,MAAM,IAAI,MAAM;WAAA,OACTA,EAAY,KAAK,CAAE,EAG5B,IAAM7xC,EAAiC,CACrC,KAAMqoB,EACN,QAAS0N,EACT,WAAY8b,GAGd,OAAOvoC,EAAO,UAAUvU,GAAkBiL,CAAY,CACxD,CAEO,IAAMgrD,GAAmC5qE,EAAG,CAAC,kBAAiB2qE,EAAA,CAAC,ECvBtE,SAASE,GACL7iE,EAA2B8iE,EAA+BC,EAC1DC,EAAuBC,EAAiBtmE,EAAkBumE,EAC1DC,EAA+B,CACjC,IAAMljC,EAAQrZ,EAAgB5mB,EAAM,OAAQ,eAAgB,QAAQ,EACpE,GAAIigC,EAAM,QAAU,SAClB,MAAM,IAAI,MAAM,iCAAiC,EAEnD,GAAIA,EAAM,MAAM,SAAW,EACzB,MAAM,IAAI,MAAM,+BAAA,OAA+BA,EAAM,KAAK,CAAE,EAG9D,IAAMmjC,EAAcx8C,EAAgBk8C,EAAY,aAAc,cAAc,EAC5E,GAAIM,EAAY,QAAU,QACxB,MAAM,IAAI,MAAM,uCAAuC,EAGzD,IAAM9hD,EAA2B,CAC/B,UAASyhD,EACT,YAAWC,EACX,QAAOC,EACP,SAAQtmE,EACR,SAAQumE,EACR,uBAAsBC,GAGlBvrD,EAA6B,CAAC,KAAMqoB,EAAO,WAAYmjC,CAAW,EAClE/rE,EACF6pB,EAAO,UAAUjU,GAAc2K,EAAc0J,CAAW,EAC5D,MAAO,CAAC,OAAQjqB,EAAO,CAAC,EAAG,aAAcA,EAAO,CAAC,CAAC,CACpD,CAEO,IAAMgsE,GAA+BrrE,EAAG,CAAC,cAAa6qE,EAAA,CAAC,ECzC9D,SAASS,GACLtqD,EAA4BuqD,EAC5BC,EAAgB,CAAhBA,IAAA,SAAAA,EAAgB,IAClB,IAAMt1B,EAAStnB,EAAgB5N,EAAO,QAAS,cAAe,QAAQ,EAChEyqD,EACF78C,EAAgB28C,EAAW,YAAa,cAAe,QAAQ,EAEnE,GAAIr1B,EAAO,OAAS,EAClB,MAAM,IAAI,MACN,+CAAA,OAA+CA,EAAO,KAAK,CAAE,EAEnE,GAAIu1B,EAAW,OAAS,EACtB,MAAM,IAAI,MACN,mDAAA,OAAmDA,EAAW,KAAK,CAAE,EAG3E,IAAMniD,EAA0B,CAAC,UAASkiD,CAAA,EACpC5rD,EAA4B,CAAC,MAAOs2B,EAAQ,UAAWu1B,CAAU,EACjEpsE,EACF6pB,EAAO,UAAUhU,GAAa0K,EAAc0J,CAAW,EAC3D,MAAO,CAAC,QAASjqB,EAAO,CAAC,EAAG,OAAQA,EAAO,CAAC,EAAG,MAAOA,EAAO,CAAC,CAAC,CACjE,CAEO,IAAMqsE,GAA8B1rE,EAAG,CAAC,aAAYsrE,EAAA,CAAC,ECnC5D,SAASK,GACL3qD,EAA0B4qD,EAAkB,CAC9C,IAAM11B,EACFtnB,EAAgB5N,EAAO,QAAS,yBAA0B,QAAQ,EAChEsI,EAAqC,CAAC,WAAUsiD,CAAA,EAEtD,GAAIA,GAAc,EAChB,MAAM,IAAI,MAAM,sCAAsC,EAGxD,IAAMhsD,EAAuC,CAAC,MAAOs2B,CAAM,EAC3D,OAAOhtB,EAAO,UAAU/T,GAAwByK,EAAc0J,CAAW,CAC3E,CAEO,IAAMuiD,GAAyC7rE,EAAG,CAAC,wBAAuB2rE,EAAA,CAAC,ECflF,SAASG,GACP9qD,EAA4B+qD,EAAiBC,EAC7CC,EAAkB,CAAlBA,IAAA,SAAAA,EAAkB,IAElB,IAAM/1B,EAAStnB,EAAgB5N,EAAO,QAAS,qBAChB,QAAQ,EACjCsI,EAAiC,CAAC,QAAOyiD,EAAE,QAAOC,EAAE,cAAaC,CAAA,EACvE,OAAO/iD,EAAO,UAAUnU,GAAoB,CAAC,EAAGmhC,CAAM,EAC9B5sB,CAAgC,CAC1D,CAEO,IAAM4iD,GAAqClsE,EAAG,CAAC,oBAAmB8rE,EAAA,CAAC,ECiL1E,IAAMK,GAAW,CACf,IAAGvf,GACH,KAAIE,GACJ,KAAIwB,GACJ,MAAKd,IASDiM,GAAS,CACb,cAAaJ,GACb,WAAUE,GACV,MAAKO,GACL,KAAIK,IAmBAvlC,GAAQ,CACZ,cAAaomC,GACb,eAAcI,GACd,sBAAqBgG,GACrB,eAAcF,GACd,eAAcxF,GACd,iBAAgBK,GAChB,cAAajB,GACb,kBAAiB0B,GACjB,uBAAsBwD,GACtB,2BAA0BE,GAC1B,gCAA+BE,GAC/B,wBAAuBK,GACvB,6BAA4BE,GAC5B,UAAS0C,GACT,UAASM,IAOLyI,GAAS,CACb,SAAQ7H,GACR,YAAWO,GACX,GAAE8B,IAaEG,GAAS,CACb,mBAAkBW,GAClB,oBAAmBJ,GACnB,eAAcM,GACd,UAASE,GACT,UAASK,GACT,QAAOK,GACP,iBAAgBE,GAChB,oBAAmBU,GACnB,oBAAmBU,IAOfuC,GAAS,CACb,oBAAmBnC,GACnB,cAAaM,GACb,kBAAiBE,GACjB,iBAAgBE,IAQZ0B,GAAS,CACb,aAAYjB,GACZ,YAAWK,GACX,uBAAsBG,GACtB,mBAAkBK,ICzQpB,IAAMK,GACF,IAAI,IAEFC,GACF,IAAI,IAQRC,IAAA,UAAA,CAAA,SAAAA,GAAA,EAYE,OAAAA,EAAA,UAAA,aAAA,UAAA,CACE,OAAQ,KAAK,YACR,WAiBAA,EAAA,WAAP,SACIC,EAAiCz1D,EAAkB,CACrD,OAAO,IAAIy1D,EAAIz1D,CAAM,GAExBw1D,CAAA,GAAA,EASDE,IAAA,UAAA,CAOE,SAAAA,GAAA,CACE,KAAK,aAAe,CAAA,EAMf,OAAAA,EAAA,OAAP,UAAA,CACE,OAAIA,EAAiB,UAAY,OAC/BA,EAAiB,SAAW,IAAIA,GAE3BA,EAAiB,UAMnBA,EAAQ,SAAf,SAAwCD,EAA+B,CACrEC,EAAiB,OAAM,EAAG,aAAaD,EAAI,SAAS,EAChD,CAACA,EAAKA,EAAI,UAAU,GAE3BC,CAAA,GAAA,WA4EeC,GACZF,EAAiCG,EAAcxiE,EAAa,CAC9DhH,EACIqpE,EAAI,WAAa,KACjB,UAAM,CAAA,MAAA,6EACiB,CAAA,EAC3BrpE,EACI,OAAOqpE,EAAI,WAAc,SACzB,UAAM,CAAA,MAAA,sDACF,OAAOA,EAAI,SADT,CACkB,EAC5BrpE,EACIqpE,EAAI,UAAU,OAAS,EACvB,UAAM,CAAA,MAAA,mFACoB,CAAA,EAE1B,OAAOG,EAAQ,MACjBA,EAAM,UAGJ,OAAOxiE,EAAS,MAClBA,EAAOqiE,EAAI,WAGb,IAAMI,EAAYziE,EACZ0iE,EAAeF,EAAM,IAAMC,EAEjC,OAAAH,GAAiB,SAASD,CAAG,EAC7BH,GAAqB,IAAIQ,EAAcL,CAAG,EAC1CF,GAAoB,IAAIE,EAAKK,CAAY,EAElCL,CACT,CAUM,SAAUM,GACZN,EAA+B,CACjC,OAAIF,GAAoB,IAAIE,CAAG,EACtBF,GAAoB,IAAIE,CAAG,EAE3BA,EAAI,SAEf,mGChPAO,IAAA,SAAAhnD,EAAA,CAAwC3nB,GAAY2uE,EAAAhnD,CAAA,EAApD,SAAAgnD,GAAA,gDAiBE,OAAAA,EAAA,UAAA,SAAA,SAASvtE,EAAiBwtE,EAAoBl1B,EAAoB,CAAxCk1B,IAAA,SAAAA,EAAkB,IAEpC,IAAA3jE,EAAiB,KAAK,iBAAiB7J,EAAGs4C,CAAO,EAAhDl5C,EAAKyK,EAAA,MAAEwjB,EAAKxjB,EAAA,MAEnB,GAAIyuC,GAAW,KAAM,CACnB,IAAMm1B,EACFn1B,EAAQ,IAAI,SAAAj4C,EAAK,CAAA,MAAC,CAAC,KAAMA,EAAE,KAAM,OAAQgtB,EAAMhtB,EAAE,IAAI,CAAC,CAArC,CAAuC,EAC5D,KAAK,eAAeotE,CAAS,CAC9B,MACC,KAAK,eAAepgD,CAAK,EAM3B,OAFAoF,GAAQpF,CAAK,EAETmgD,EACKpuE,GAEPA,EAAM,QAAO,EACN,OAOX,OAAA,eAAImuE,EAAU,UAAA,aAAA,CAAd,IAAA,UAAA,CACE,OAAI,KAAK,aAAe,OACtB,KAAK,YAAc,GAEd,KAAK,0CACb,CAAA,EAESA,EAAA,UAAA,oBAAA,UAAA,CACR,KAAK,YAAc,KAAK,WAAa,GAgBvCA,EAAA,UAAA,iBAAA,SAAiBvtE,EAAiBs4C,EAAoB,CAEpD,OAAOD,GAAcr4C,EAAGs4C,CAAO,GAgBjCi1B,EAAA,UAAA,QAAA,UAAA,CACM,KAAK,aAAe,MACtB96C,GAAQ,KAAK,WAAW,GAItB86C,EAAA,UAAA,eAAN,UAAA,oEACE,OAAI,KAAK,aAAe,OACtB,KAAK,YAAc,GAEd,CAAA,EAAA,CACL,KAAM,OAEN,OAAQr5B,GAAO,KAAK,YAAa,OAAO,EACzC,KACF,EAEKq5B,EAAA,UAAA,WAAN,UAAA,oEACE,MAAM,IAAI,MAAM,yDAAyD,KAC1E,EAEKA,EAAU,UAAA,WAAhB,SAAiBG,EAA2B,oEAC1C,MAAM,IAAI,MACN,4DACA,GAAA,OAAG,KAAK,aAAY,CAAE,CAAE,KAC7B,EASeH,EAAiB,UAAA,kBAAvB,SAAwBG,EAA2B,iGAE3D,OAAA7jE,EAAA,KAA0B,CAAA,EAAA6jE,EAAa,CAAC,EAAE,OAAO,KAAI,CAAE,SAAvD,OAAA7jE,EAAK,YAAeC,EAAA,KAAA,EAAqC,CAAC,EAC1D,CAAA,EAAO4jE,EAAa,MAAM,CAAC,CAAC,MAC7B,EACFH,CAAA,GA5HuCR,EAAY,EA8HpD,OAAO,eAAeQ,GAAW,OAAO,YAAa,CACnD,MAAO,SAACnnD,EAAmB,CACzB,OAAOA,EAAS,UAAY,MAAQA,EAAS,kBAAoB,MAC7DA,EAAS,gBAAkB,KAElC,CAAA,EC7ID,IAAAunD,IAAA,SAAApnD,EAAA,CAAuC3nB,GAAS+uE,EAAApnD,CAAA,EAW9C,SAAAonD,EACcC,EAAgCC,EAChCnnB,EAAsB,CAAtBA,IAAA,SAAAA,EAAsB,MAFpC,IAAAz8C,EAGEsc,EAAA,KAAA,IAAA,GAKD,KAPa,OAAAtc,EAAY,aAAZ2jE,EAAgC3jE,EAAG,IAAH4jE,EAChC5jE,EAAO,QAAPy8C,EALNz8C,EAAgB,iBAAwB,CAAA,EACxCA,EAAkB,mBAAwB,CAAA,EAO5Cy8C,GAAW,OACbz8C,EAAK,QAAUuf,EAAO,QAAQ,QAAO,KAfzC,cAAA,eAAWmkD,EAAS,YAAA,CAApB,IAAA,UAAA,CAIE,MAAO,yCACR,CAAA,EAcDA,EAAc,UAAA,eAAd,SAAeG,EAAiD,CAAhE,IAqDC7jE,EAAA,KApDO8jE,EAAgB,MAAM,QAAQD,CAAiB,EACjDA,EAAkB,IAAI,SAAAtiD,EAAQ,CAAA,OAAAA,EAAK,IAAI,CAAA,EACvC,OAAO,KAAKsiD,CAAiB,EAEjCC,EAAc,QAAQ,SAACpjE,EAAMhK,EAAC,CAC5B,IAAMvB,EAAQoqB,EAAO,oBAAoB7e,CAAI,EACvCwb,EAAY,GACdlc,EAAK,iBAAiBtJ,CAAC,GAAK,OAC9BsJ,EAAK,iBAAiBtJ,CAAC,EAAI,CACzB,aAAc,GAAG,OAAAgK,EAAiB,aAAA,EAClC,SAAU+X,GAAK,UAAM,CAAA,OAAAsuB,GAAU5xC,CAAK,EAAE,SAAS+mB,CAAS,CAAC,CAAA,IAGzDlc,EAAK,mBAAmBtJ,CAAC,GAAK,OAChCsJ,EAAK,mBAAmBtJ,CAAC,EAAI,CAC3B,aAAc,GAAG,OAAAgK,EAAgB,YAAA,EACjC,SAAU+X,GAAK,UAAM,CAAA,OAAAsuB,GAAU5xC,CAAK,EAAE,SAAS+mB,CAAS,CAAC,CAAA,IAI7D,IAAM6nD,EAAW,MAAM,QAAQF,CAAiB,EAC5CA,EAAkBntE,CAAC,EAAE,OACrBmtE,EAAkBnjE,CAAI,EAC1B,GAAIqjE,GAAY,KAIhB,KAAMC,EAAkBhkE,EAAK,iBAAiBtJ,CAAC,EAAE,SAC3CutE,EAAoBjkE,EAAK,mBAAmBtJ,CAAC,EAAE,SAErD+hB,GAAK,UAAA,CACH,IAAMyrD,EACFxrD,GAAI1E,EAAIgwD,EAAiBhkE,EAAK,GAAG,EAC7BgU,EAAIq2B,GAAO05B,CAAQ,EAAG,EAAI/jE,EAAK,GAAG,CAAC,EAErCmmD,EACFnyC,EAAIrD,GAAIw5B,GAAKzxB,GAAIurD,EAAmBjkE,EAAK,OAAO,CAAC,EACzCmqC,GAAKzxB,GAAIsrD,EAAiBhkE,EAAK,OAAO,CAAC,CAAC,EAC5C+jE,CAAQ,EAEVI,EACFzrD,GAAI1E,EAAIiwD,EAAmBjkE,EAAK,GAAG,EAC/BgU,EAAIq2B,GAAO8b,CAAO,EAAG,EAAInmD,EAAK,GAAG,CAAC,EAE1CgkE,EAAgB,OAAOE,CAAkB,EACzCD,EAAkB,OAAOE,CAAoB,EAE7C,IAAM1nD,EAAW/D,GAAI1E,EAAImyC,EAAS,CAACnmD,EAAK,YAAY,EAAG7K,CAAK,EAC5DA,EAAM,OAAOsnB,CAAQ,CACvB,CAAC,EACH,CAAC,EACD,KAAK,oBAAmB,GAGjBinD,EAAA,UAAA,QAAA,UAAA,CACH,KAAK,oBAAsB,OAC7Bl7C,GAAQ,KAAK,iBAAiB,IAAI,SAAApyB,EAAK,CAAA,OAAAA,EAAE,QAAQ,CAAA,CAAC,EAClDoyB,GAAQ,KAAK,mBAAmB,IAAI,SAAApyB,EAAK,CAAA,OAAAA,EAAE,QAAQ,CAAA,CAAC,IAIzCstE,EAAA,UAAA,WAAN,UAAA,iGAED,OAAAU,EAASrtE,GAAAA,GAAA,CAAA,EAAAJ,EACP,KAAK,gBAAgB,EAAA,EAAA,EAAAA,EAAK,KAAK,kBAAkB,EAAA,EAAA,EACjD,CAAA,EAAM,KAAK,eAAc,CAAE,EAAnC,IAAA,GAAA,MAAA,CAAA,EAAO,CAACiJ,EAAA,KAAA,CAA2B,EAAE,OACjCwkE,EAAU,IAAI,SAAAhuE,EAAK,CAAA,MAAC,CAAC,KAAMA,EAAE,aAAc,OAAQA,EAAE,QAAQ,CAAE,CAAA,CAAC,CAAC,MACtE,EAEcstE,EAAU,UAAA,WAAhB,SAAiBD,EAA2B,4FACpC,IAAA,GAAA,MAAA,CAAA,EAAM,KAAK,kBAAkBA,CAAY,CAAC,SAAzD,OAAAA,EAAe7jE,EAAA,KAAA,EACTykE,EAAgBZ,EAAa,OAAS,EACtCvnD,EAAY,GAClB,KAAK,iBACDunD,EAAa,MAAM,EAAGY,CAAa,EAAE,IAAI,SAAAjuE,EAAC,CAAI,MAAC,CACJ,aAAcA,EAAE,KAChB,SAAUA,EAAE,OAAO,SACf8lB,CAAS,EACb,CAAA,EAC/C,KAAK,mBACDunD,EAAa,MAAMY,EAAeA,EAAgB,CAAC,EAC9C,IAAI,SAAAjuE,EAAC,CAAI,MAAC,CACJ,aAAcA,EAAE,KAChB,SAAUA,EAAE,OAAO,SAAS8lB,CAAS,EACrC,CAAA,UAChB,EAEDwnD,EAAA,UAAA,UAAA,UAAA,CACE,MAAO,CACL,aAAgB,KAAK,aACrB,IAAO,KAAK,IACZ,QAAW,KAAK,UAKJA,EAAA,WAAhB,SACIX,EAAiCz1D,EAAkB,CACrD,OAAO,IAAIy1D,EAAIz1D,EAAO,aAAiBA,EAAO,IAAQA,EAAO,OAAU,GAE1Eo2D,CAAA,GA1HsCJ,EAAS,ECAhDgB,IAAA,SAAAhoD,EAAA,CAAsC3nB,GAAS2vE,EAAAhoD,CAAA,EAW7C,SACcgoD,EAAAX,EAA8BY,EAA6B,CAA7BA,IAAA,SAAAA,EAA6B,IADzE,IAAAvkE,EAEEsc,EAAA,KAAA,IAAA,GACD,KAFa,OAAAtc,EAAY,aAAZ2jE,EAA8B3jE,EAAuB,wBAAvBukE,EAHpCvkE,EAAgB,iBAAwB,CAAA,IAPhD,cAAA,eAAWskE,EAAS,YAAA,CAApB,IAAA,UAAA,CAIE,MAAO,wCACR,CAAA,EASDA,EAAc,UAAA,eAAd,SAAeT,EAAiD,CAAhE,IAuCC7jE,EAAA,KAtCO8jE,EAAgB,MAAM,QAAQD,CAAiB,EACjDA,EAAkB,IAAI,SAAAtiD,EAAQ,CAAA,OAAAA,EAAK,IAAI,CAAA,EACvC,OAAO,KAAKsiD,CAAiB,EAEjCC,EAAc,QAAQ,SAACpjE,EAAMhK,EAAC,CAC5B,IAAMvB,EAAQoqB,EAAO,oBAAoB7e,CAAI,EAC7C,GAAIV,EAAK,iBAAiBtJ,CAAC,GAAK,KAAM,CACpC,IAAM8tE,EAAY,GAClBxkE,EAAK,iBAAiBtJ,CAAC,EAAI,CACzB,aAAc,GAAG,OAAAgK,EAAkB,cAAA,EACnC,SAAU+X,GACN,UAAA,CAAM,OAAAgpB,GAAKtsC,EAAM,MAAO6K,EAAK,uBAAuB,EACzC,SAASwkE,CAAS,CAAC,CAAA,EAErC,CAED,IAAMT,EAAW,MAAM,QAAQF,CAAiB,EAC5CA,EAAkBntE,CAAC,EAAE,OACrBmtE,EAAkBnjE,CAAI,EAC1B,GAAIqjE,GAAY,KAIhB,KAAMC,EAAkBhkE,EAAK,iBAAiBtJ,CAAC,EAAE,SAEjD+hB,GAAK,UAAA,CACH,IAAMyrD,EAAqBxrD,GAAIsrD,EAAiB35B,GAAO05B,CAAQ,CAAC,EAChEC,EAAgB,OAAOE,CAAkB,EAEzC,IAAMznD,EAAW/D,GACb1E,EAAIrD,GAAIozD,EACA55B,GAAKzxB,GAAIwrD,EAAoB3kD,EAAO,QAAQ,QAAO,CAAE,CAAC,CAAC,EAC3D,CAACvf,EAAK,YAAY,EACtB7K,CAAK,EACTA,EAAM,OAAOsnB,CAAQ,CACvB,CAAC,EACH,CAAC,EACD,KAAK,oBAAmB,GAGjB6nD,EAAA,UAAA,QAAA,UAAA,CACH,KAAK,kBAAoB,MAC3B97C,GAAQ,KAAK,iBAAiB,IAAI,SAAApyB,EAAK,CAAA,OAAAA,EAAE,QAAQ,CAAA,CAAC,GAIvCkuE,EAAA,UAAA,WAAN,UAAA,oFAEC,IAAA,GAAA,MAAA,CAAA,EAAM,KAAK,eAAc,CAAE,SAAnC,MAAA,CAAA,EAAO,CAAC1kE,EAAA,KAAA,CAA2B,EAAE,OAAO,KAAK,iBAAiB,IAC9D,SAAAxJ,EAAC,CAAI,MAAC,CAAC,KAAMA,EAAE,aAAc,OAAQA,EAAE,QAAQ,CAAE,CAAA,CAAC,CAAC,MACxD,EAEckuE,EAAU,UAAA,WAAhB,SAAiBb,EAA2B,0FACpC,IAAA,GAAA,MAAA,CAAA,EAAM,KAAK,kBAAkBA,CAAY,CAAC,SAAzD,OAAAA,EAAe7jE,EAAA,KAAA,EACTsc,EAAY,GAClB,KAAK,iBAAmBunD,EAAa,IACjC,SAAArtE,EAAC,CAAI,MAAC,CAAC,aAAcA,EAAE,KAAM,SAAUA,EAAE,OAAO,SAAS8lB,CAAS,CAAC,CAA9D,CAAgE,UAC1E,EAEDooD,EAAA,UAAA,UAAA,UAAA,CACE,MAAO,CACL,aAAgB,KAAK,aACrB,wBAA2B,KAAK,0BAKpBA,EAAA,WAAhB,SACIvB,EAAiCz1D,EAAkB,CACrD,OAAO,IAAIy1D,EAAIz1D,EAAO,aAAiBA,EAAO,uBAA0B,GAE3Eg3D,CAAA,GAxFqChB,EAAS,ECG/CmB,IAAA,SAAAnoD,EAAA,CAAmC3nB,GAAS8vE,EAAAnoD,CAAA,EAc1C,SAAAmoD,EACcd,EAAgCe,EAChCC,EAAyBloB,EAAsB,CAAtBA,IAAA,SAAAA,EAAsB,MAF7D,IAAAz8C,EAGEsc,EAAA,KAAA,IAAA,GAUD,KAZa,OAAAtc,EAAY,aAAZ2jE,EAAgC3jE,EAAK,MAAL0kE,EAChC1kE,EAAK,MAAL2kE,EAAyB3kE,EAAO,QAAPy8C,EAL/Bz8C,EAAsB,uBAAwB,CAAA,EAC9CA,EAAuB,wBAAwB,CAAA,EAMrDyY,GAAK,UAAA,CAEHzY,EAAK,SAAWiqC,GAAOy6B,CAAK,EAAE,SAAQ,EACtC1kE,EAAK,SAAWiqC,GAAO06B,CAAK,EAAE,SAAQ,CACxC,CAAC,EAEGloB,GAAW,OACbz8C,EAAK,QAAUuf,EAAO,QAAQ,QAAO,KAvBzC,cAAA,eAAWklD,EAAS,YAAA,CAApB,IAAA,UAAA,CAIE,MAAO,qCACR,CAAA,EAsBDA,EAAc,UAAA,eAAd,SAAeZ,EAAiD,CAAhE,IA2DC7jE,EAAA,KA1DO4kE,EAAW,MAAM,QAAQf,CAAiB,EAC5CA,EAAkB,IAAI,SAAAztE,EAAK,CAAA,OAAAA,EAAE,IAAI,CAAA,EACjC,OAAO,KAAKytE,CAAiB,EACjCprD,GAAK,UAAA,CACH,IAAMosD,EAAmBt1B,GAAI,EAAGvvC,EAAK,QAAQ,EACvC8kE,EAAmBv1B,GAAI,EAAGvvC,EAAK,QAAQ,EAE7C4kE,EAAS,QAAQ,SAAClkE,EAAMhK,EAAC,CACvB,IAAMvB,EAAQoqB,EAAO,oBAAoB7e,CAAI,EACvCwb,EAAY,GACdlc,EAAK,uBAAuBtJ,CAAC,GAAK,OACpCsJ,EAAK,uBAAuBtJ,CAAC,EAAI,CAC/B,aAAc,GAAG,OAAAgK,EAAQ,IAAA,EACzB,SAAU+X,GAAK,UAAM,CAAA,OAAAsuB,GAAU5xC,CAAK,EAAE,SAAS+mB,CAAS,CAAC,CAAA,IAGzDlc,EAAK,wBAAwBtJ,CAAC,GAAK,OACrCsJ,EAAK,wBAAwBtJ,CAAC,EAAI,CAChC,aAAc,GAAG,OAAAgK,EAAQ,IAAA,EACzB,SAAU+X,GAAK,UAAM,CAAA,OAAAsuB,GAAU5xC,CAAK,EAAE,SAAS+mB,CAAS,CAAC,CAAA,IAI7D,IAAM6nD,EAAW,MAAM,QAAQF,CAAiB,EAC5CA,EAAkBntE,CAAC,EAAE,OACrBmtE,EAAkBnjE,CAAI,EAC1B,GAAIqjE,GAAY,KAIhB,KAAMgB,EAAc/kE,EAAK,uBAAuBtJ,CAAC,EAAE,SAC7CsuE,EAAehlE,EAAK,wBAAwBtJ,CAAC,EAAE,SAE/CuuE,EACFvsD,GAAI1E,EAAI+wD,EAAa/kE,EAAK,KAAK,EAAGgU,EAAI+vD,EAAU,EAAI/jE,EAAK,KAAK,CAAC,EAC7DklE,EACFxsD,GAAI1E,EAAIgxD,EAAchlE,EAAK,KAAK,EAC5BgU,EAAIq2B,GAAO05B,CAAQ,EAAG,EAAI/jE,EAAK,KAAK,CAAC,EAEvCmlE,EAA2Bx0D,GAAIs0D,EAAgBJ,CAAgB,EAC/DO,EACFz0D,GAAIu0D,EAAiBJ,CAAgB,EAEzCC,EAAY,OAAOE,CAAc,EACjCD,EAAa,OAAOE,CAAe,EAEnC,IAAMzoD,EACF/D,GAAI1E,EAAIrD,GAAIw0D,EACAzsD,GAAIyxB,GAAKi7B,CAAyB,EAAGplE,EAAK,OAAO,CAAC,EACtD,CAACA,EAAK,YAAY,EACtB7K,CAAK,EACbA,EAAM,OAAOsnB,CAAQ,EACvB,CAAC,EAEDzc,EAAK,SAAS,OAAOgU,EAAIhU,EAAK,SAAUA,EAAK,KAAK,CAAC,EACnDA,EAAK,SAAS,OAAOgU,EAAIhU,EAAK,SAAUA,EAAK,KAAK,CAAC,CACrD,CAAC,EACD,KAAK,oBAAmB,GAGjBykE,EAAA,UAAA,QAAA,UAAA,CACP,KAAK,SAAS,QAAO,EACrB,KAAK,SAAS,QAAO,EAEjB,KAAK,wBAA0B,MACjCj8C,GAAQ,KAAK,uBAAuB,IAAI,SAAApyB,EAAK,CAAA,OAAAA,EAAE,QAAQ,CAAA,CAAC,EAEtD,KAAK,yBAA2B,MAClCoyB,GAAQ,KAAK,wBAAwB,IAAI,SAAApyB,EAAK,CAAA,OAAAA,EAAE,QAAQ,CAAA,CAAC,GAI9CquE,EAAA,UAAA,WAAN,UAAA,iGAED,OAAAL,EAASrtE,GAAAA,GAAA,CAAA,EAAAJ,EACP,KAAK,sBAAsB,EAAA,EAAA,EAAAA,EAAK,KAAK,uBAAuB,EAAA,EAAA,EAC5D,CAAA,EAAM,KAAK,eAAc,CAAE,EAAnC,IAAA,GAAA,MAAA,CAAA,EAAO,CAACiJ,EAAA,KAAA,CAA2B,EAAE,OACjCwkE,EAAU,IAAI,SAAAhuE,EAAK,CAAA,MAAC,CAAC,KAAMA,EAAE,aAAc,OAAQA,EAAE,QAAQ,CAAE,CAAA,CAAC,CAAC,MACtE,EAEcquE,EAAU,UAAA,WAAhB,SAAiBhB,EAA2B,mGACpC,IAAA,GAAA,MAAA,CAAA,EAAM,KAAK,kBAAkBA,CAAY,CAAC,SAAzD,OAAAA,EAAe7jE,EAAA,KAAA,EACf6Y,GAAK,UAAA,CACHzY,EAAK,SAAS,OAAOgqC,GAAIhqC,EAAK,MAAOA,EAAK,YAAc,CAAC,CAAC,EAC1DA,EAAK,SAAS,OAAOgqC,GAAIhqC,EAAK,MAAOA,EAAK,YAAc,CAAC,CAAC,CAC5D,CAAC,EAEKqkE,EAAgBZ,EAAa,OAAS,EACtCvnD,EAAY,GAClB,KAAK,uBACDunD,EAAa,MAAM,EAAGY,CAAa,EAAE,IAAI,SAAAjuE,EAAC,CAAI,MAAC,CACJ,aAAcA,EAAE,KAChB,SAAUA,EAAE,OAAO,SACf8lB,CAAS,EACb,CAAA,EAC/C,KAAK,wBACDunD,EAAa,MAAMY,EAAeA,EAAgB,CAAC,EAC9C,IAAI,SAAAjuE,EAAC,CAAI,MAAC,CACJ,aAAcA,EAAE,KAChB,SAAUA,EAAE,OAAO,SAAS8lB,CAAS,EACrC,CAAA,UAChB,EAEDuoD,EAAA,UAAA,UAAA,UAAA,CACE,MAAO,CACL,aAAgB,KAAK,aACrB,MAAS,KAAK,MACd,MAAS,KAAK,MACd,QAAW,KAAK,UAKJA,EAAA,WAAhB,SACI1B,EAAiCz1D,EAAkB,CACrD,OAAO,IAAIy1D,EACPz1D,EAAO,aAAiBA,EAAO,MAAUA,EAAO,MAChDA,EAAO,OAAU,GAExBm3D,CAAA,GArJkCnB,EAAS,ECD5C+B,IAAA,SAAA/oD,EAAA,CAAqC3nB,GAAS0wE,EAAA/oD,CAAA,EAc5C,SACc+oD,EAAA1B,EAAgCe,EAChCC,EAAyBloB,EACzBgN,EAAW,CADchN,IAAA,SAAAA,EAAsB,MAC/CgN,IAAA,SAAAA,EAAW,GAHzB,IAAAzpD,EAIEsc,EAAA,KAAA,IAAA,GAUD,KAba,OAAAtc,EAAY,aAAZ2jE,EAAgC3jE,EAAK,MAAL0kE,EAChC1kE,EAAK,MAAL2kE,EAAyB3kE,EAAO,QAAPy8C,EACzBz8C,EAAK,MAALypD,EANNzpD,EAAsB,uBAAwB,CAAA,EAC9CA,EAA0B,2BAAwB,CAAA,EAQxDyY,GAAK,UAAA,CACHzY,EAAK,UAAYiqC,GAAO,CAAC,EAAE,SAAQ,EACnCjqC,EAAK,SAAWiqC,GAAOy6B,CAAK,EAAE,SAAQ,CACxC,CAAC,EAEGjoB,GAAW,OACbz8C,EAAK,QAAUuf,EAAO,QAAQ,QAAO,KAxBzC,cAAA,eAAW8lD,EAAS,YAAA,CAApB,IAAA,UAAA,CAIE,MAAO,uCACR,CAAA,EAuBDA,EAAc,UAAA,eAAd,SAAexB,EAAiD,CAAhE,IA2DC7jE,EAAA,KA1DO8jE,EAAgB,MAAM,QAAQD,CAAiB,EACjDA,EAAkB,IAAI,SAAAtiD,EAAQ,CAAA,OAAAA,EAAK,IAAI,CAAA,EACvC,OAAO,KAAKsiD,CAAiB,EAEjCprD,GAAK,UAAA,CACH,IAAMosD,EAAmBt1B,GAAI,EAAGvvC,EAAK,QAAQ,EACvCslE,EACF30D,GAAI,CAAC3Q,EAAK,aAAc0Y,GAAI1E,EAAIhU,EAAK,UAAWA,EAAK,KAAK,EAAG,CAAC,CAAC,EAEnE8jE,EAAc,QAAQ,SAACpjE,EAAMhK,EAAC,CAC5B,IAAMvB,EAAQoqB,EAAO,oBAAoB7e,CAAI,EACvCwb,EAAY,GACdlc,EAAK,uBAAuBtJ,CAAC,GAAK,OACpCsJ,EAAK,uBAAuBtJ,CAAC,EAAI,CAC/B,aAAc,GAAG,OAAAgK,EAAQ,IAAA,EACzB,SAAUqmC,GAAU5xC,CAAK,EAAE,SAAS+mB,CAAS,IAG7Clc,EAAK,2BAA2BtJ,CAAC,GAAK,OACxCsJ,EAAK,2BAA2BtJ,CAAC,EAAI,CACnC,aAAc,GAAG,OAAAgK,EAAQ,IAAA,EACzB,SAAUqmC,GAAU5xC,CAAK,EAAE,SAAS+mB,CAAS,IAIjD,IAAM6nD,EAAW,MAAM,QAAQF,CAAiB,EAC5CA,EAAkBntE,CAAC,EAAE,OACrBmtE,EAAkBnjE,CAAI,EAC1B,GAAIqjE,GAAY,KAIhB,KAAMgB,EAAc/kE,EAAK,uBAAuBtJ,CAAC,EAAE,SAC7C6uE,EAAkBvlE,EAAK,2BAA2BtJ,CAAC,EAAE,SAErDuuE,EACFvsD,GAAI1E,EAAI+wD,EAAa/kE,EAAK,KAAK,EAAGgU,EAAI+vD,EAAU,EAAI/jE,EAAK,KAAK,CAAC,EAE7DwlE,EAAMxxD,EAAIuxD,EAAiBvlE,EAAK,KAAK,EACrCylE,EAAM3vC,GAAIiuC,CAAQ,EAElB2B,EAAqB9zB,GAAQ4zB,EAAKC,CAAG,EAE3CV,EAAY,OAAOE,CAAc,EACjCM,EAAgB,OAAOG,CAAkB,EAEzC,IAAMjpD,EACF/D,GAAI1E,EAAIrD,GAAI20D,EAAIT,CAAgB,EACxBl0D,GAAIs0D,EAAgBvsD,GAAIgtD,EAAoB1lE,EAAK,OAAO,CAAC,CAAC,EAC9D7K,CAAK,EAEbA,EAAM,OAAOsnB,CAAQ,EACvB,CAAC,EAEDzc,EAAK,UAAU,OAAO0Y,GAAI1Y,EAAK,UAAW,CAAC,CAAC,EAC5CA,EAAK,SAAS,OAAOgU,EAAIhU,EAAK,SAAUA,EAAK,KAAK,CAAC,CACrD,CAAC,EACD,KAAK,oBAAmB,GAGjBqlE,EAAA,UAAA,QAAA,UAAA,CACP,KAAK,SAAS,QAAO,EACrB,KAAK,UAAU,QAAO,EAElB,KAAK,wBAA0B,MACjC78C,GAAQ,KAAK,uBAAuB,IAAI,SAAApyB,EAAK,CAAA,OAAAA,EAAE,QAAQ,CAAA,CAAC,EAEtD,KAAK,4BAA8B,MACrCoyB,GAAQ,KAAK,2BAA2B,IAAI,SAAApyB,EAAK,CAAA,OAAAA,EAAE,QAAQ,CAAA,CAAC,GAIjDivE,EAAA,UAAA,WAAN,UAAA,oEACP,MAAM,IAAI,MAAM,iDAAiD,KAClE,EAEcA,EAAU,UAAA,WAAhB,SAAiB5B,EAA2B,oEACnD,MAAM,IAAI,MAAM,iDAAiD,KAClE,EAED4B,EAAA,UAAA,UAAA,UAAA,CACE,MAAO,CACL,aAAgB,KAAK,aACrB,MAAS,KAAK,MACd,MAAS,KAAK,MACd,QAAW,KAAK,QAChB,MAAS,KAAK,QAKFA,EAAA,WAAhB,SACItC,EAAiCz1D,EAAkB,CACrD,OAAO,IAAIy1D,EACPz1D,EAAO,aAAiBA,EAAO,MAAUA,EAAO,MAChDA,EAAO,QAAYA,EAAO,KAAQ,GAEzC+3D,CAAA,GAhIoC/B,EAAS,ECJ9CqC,IAAA,SAAArpD,EAAA,CAAkC3nB,GAASgxE,EAAArpD,CAAA,EAUzC,SAAAqpD,EAAsBhC,EAAoB,CAA1C,IAAA3jE,EACEsc,EAAA,KAAA,IAAA,GAED,KAHqB,OAAAtc,EAAY,aAAZ2jE,EAEpB3jE,EAAK,gBAAgB2jE,CAAY,IAVnC,cAAA,eAAWgC,EAAS,YAAA,CAApB,IAAA,UAAA,CAIE,MAAO,oCACR,CAAA,EAQDA,EAAc,UAAA,eAAd,SAAe9B,EAA+C,CAA9D,IAkBC7jE,EAAA,KAjBO4kE,EAAW,MAAM,QAAQf,CAAiB,EAC5CA,EAAkB,IAAI,SAAAztE,EAAK,CAAA,OAAAA,EAAE,IAAI,CAAA,EACjC,OAAO,KAAKytE,CAAiB,EACjCe,EAAS,QAAQ,SAAClkE,EAAMhK,EAAC,CACvB,IAAMqtE,EAAW,MAAM,QAAQF,CAAiB,EAC5CA,EAAkBntE,CAAC,EAAE,OACrBmtE,EAAkBnjE,CAAI,EAC1B,GAAIqjE,GAAY,KAGhB,KAAM5uE,EAAQoqB,EAAO,oBAAoB7e,CAAI,EAC7C+X,GAAK,UAAA,CACH,IAAMgE,EAAW/D,GAAI1E,EAAIhU,EAAK,EAAG+jE,CAAQ,EAAG5uE,CAAK,EACjDA,EAAM,OAAOsnB,CAAQ,CACvB,CAAC,EACH,CAAC,EACD,KAAK,oBAAmB,GAM1BkpD,EAAe,UAAA,gBAAf,SAAgBhC,EAAoB,CAClC,KAAK,aAAeA,EAChB,KAAK,GAAK,MACZ,KAAK,EAAE,QAAO,EAEhB,KAAK,EAAIl7C,GAAKwhB,GAAO,CAAC05B,CAAY,CAAC,GAG5BgC,EAAA,UAAA,QAAA,UAAA,CACP,KAAK,EAAE,QAAO,GAGDA,EAAA,UAAA,WAAN,UAAA,oFACC,IAAA,GAAA,MAAA,CAAA,EAAM,KAAK,eAAc,CAAE,EAAnC,IAAA,GAAA,MAAA,CAAA,EAAA,CAAQ/lE,EAAA,KAAA,CAA2B,CAAE,MACtC,EAEc+lE,EAAU,UAAA,WAAhB,SAAiBlC,EAA2B,oFACpC,IAAA,GAAA,MAAA,CAAA,EAAM,KAAK,kBAAkBA,CAAY,CAAC,SACzD,GADAA,EAAe7jE,EAAA,KAAA,EACX6jE,EAAa,SAAW,EAC1B,MAAM,IAAI,MAAM,+CAA+C,gBAElE,EAEDkC,EAAA,UAAA,UAAA,UAAA,CACE,MAAO,CAAC,aAAgB,KAAK,YAAY,GAI3BA,EAAA,WAAhB,SACI5C,EAAiCz1D,EAAkB,CACrD,OAAO,IAAIy1D,EAAIz1D,EAAO,YAAe,GAExCq4D,CAAA,GAtEiCrC,EAAS,ECE3CsC,IAAA,SAAAtpD,EAAA,CAAuC3nB,GAAYixE,EAAAtpD,CAAA,EAYjD,SAAAspD,EACuBjC,EAA8BkC,EACzCC,EAAmB,CAAnBA,IAAA,SAAAA,EAAmB,IAF/B,IAGE9lE,EAAAsc,EAAA,KAAA,KAAMqnD,CAAY,GAEnB,KAJsB,OAAA3jE,EAAY,aAAZ2jE,EAA8B3jE,EAAQ,SAAR6lE,EACzC7lE,EAAW,YAAX8lE,EAJJ9lE,EAAa,cAAwB,CAAA,EAM3CA,EAAK,EAAIiqC,GAAOjqC,EAAK,QAAQ,IAb/B,cAAA,eAAoB4lE,EAAS,YAAA,CAA7B,IAAA,UAAA,CAIE,MAAO,yCACR,CAAA,EAWQA,EAAc,UAAA,eAAd,SAAe/B,EAAiD,CAAhE,IAqCR7jE,EAAA,KApCO8jE,EAAgB,MAAM,QAAQD,CAAiB,EACjDA,EAAkB,IAAI,SAAAtiD,EAAQ,CAAA,OAAAA,EAAK,IAAI,CAAA,EACvC,OAAO,KAAKsiD,CAAiB,EAEjCC,EAAc,QAAQ,SAACpjE,EAAMhK,EAAC,CAC5B,IAAMvB,EAAQoqB,EAAO,oBAAoB7e,CAAI,EAC7C,GAAIV,EAAK,cAActJ,CAAC,GAAK,KAAM,CACjC,IAAM8tE,EAAY,GAClBxkE,EAAK,cAActJ,CAAC,EAAI,CACtB,aAAc,GAAG,OAAAgK,EAAe,WAAA,EAChC,SAAU+X,GAAK,UAAM,CAAA,OAAAsuB,GAAU5xC,CAAK,EAAE,SAASqvE,CAAS,CAAC,CAAA,EAE5D,CAED,IAAMuB,EAAe/lE,EAAK,cAActJ,CAAC,EAAE,SACrCqtE,EAAW,MAAM,QAAQF,CAAiB,EAC5CA,EAAkBntE,CAAC,EAAE,OACrBmtE,EAAkBnjE,CAAI,EACtBqjE,GAAY,MAIhBtrD,GAAK,UAAA,CACH,IAAIgE,EACEupD,EAAkBttD,GAAI1E,EAAIhU,EAAK,EAAG+lE,CAAY,EAAGhC,CAAQ,EAC3D/jE,EAAK,YACPyc,EAAW/D,GACP1E,EAAIhU,EAAK,EAAG0Y,GAAIqrD,EAAU/vD,EAAIgyD,EAAiBhmE,EAAK,CAAC,CAAC,CAAC,EAAG7K,CAAK,EAEnEsnB,EAAW/D,GAAI1E,EAAIhU,EAAK,EAAGgmE,CAAe,EAAG7wE,CAAK,EAEpD4wE,EAAa,OAAOC,CAAe,EACnC7wE,EAAM,OAAOsnB,CAAQ,CACvB,CAAC,CACH,CAAC,EACD,KAAK,oBAAmB,GAGjBmpD,EAAA,UAAA,QAAA,UAAA,CACP,KAAK,EAAE,QAAO,EACV,KAAK,eAAiB,MACxBp9C,GAAQ,KAAK,cAAc,IAAI,SAAApyB,EAAK,CAAA,OAAAA,EAAE,QAAQ,CAAA,CAAC,GASnDwvE,EAAW,UAAA,YAAX,SAAYC,EAAgB,CAC1B,KAAK,SAAWA,GAGHD,EAAA,UAAA,WAAN,UAAA,oFAEC,IAAA,GAAA,MAAA,CAAA,EAAM,KAAK,eAAc,CAAE,SAAnC,MAAA,CAAA,EAAO,CAAChmE,EAAA,KAAA,CAA2B,EAAE,OAAO,KAAK,cAAc,IAC3D,SAAAxJ,EAAC,CAAI,MAAC,CAAC,KAAMA,EAAE,aAAc,OAAQA,EAAE,QAAQ,CAAE,CAAA,CAAC,CAAC,MACxD,EAEcwvE,EAAU,UAAA,WAAhB,SAAiBnC,EAA2B,0FACpC,IAAA,GAAA,MAAA,CAAA,EAAM,KAAK,kBAAkBA,CAAY,CAAC,SAAzD,OAAAA,EAAe7jE,EAAA,KAAA,EACTsc,EAAY,GAClB,KAAK,cAAgBunD,EAAa,IAC9B,SAAArtE,EAAC,CAAI,MAAC,CAAC,aAAcA,EAAE,KAAM,SAAUA,EAAE,OAAO,SAAS8lB,CAAS,CAAC,CAA9D,CAAgE,UAC1E,EAEQ0pD,EAAA,UAAA,UAAA,UAAA,CACP,MAAO,CACL,aAAgB,KAAK,aACrB,SAAY,KAAK,SACjB,YAAe,KAAK,cAKRA,EAAA,WAAhB,SACI7C,EAAiCz1D,EAAkB,CACrD,OAAO,IAAIy1D,EACPz1D,EAAO,aAAiBA,EAAO,SAAaA,EAAO,WAAc,GAExEs4D,CAAA,GArGsCD,EAAY,ECCnDM,IAAA,SAAA3pD,EAAA,CAAsC3nB,GAASsxE,EAAA3pD,CAAA,EAc7C,SACc2pD,EAAAtC,EAAgCla,EAChCoc,EAA0BppB,EACpCypB,EAAgB,CAF0Bzc,IAAA,SAAAA,EAAW,IAC3Coc,IAAA,SAAAA,EAAc,GAAYppB,IAAA,SAAAA,EAAsB,MAC1DypB,IAAA,SAAAA,EAAgB,IAHpB,IAAAlmE,EAIEsc,EAAA,KAAA,IAAA,GAUD,KAHC,GAVYtc,EAAY,aAAZ2jE,EAAgC3jE,EAAK,MAALypD,EAChCzpD,EAAQ,SAAR6lE,EAA0B7lE,EAAO,QAAPy8C,EANhCz8C,EAAsB,uBAAwB,CAAA,EAC9CA,EAAkB,mBAAwB,CAAA,EAC1CA,EAAoB,qBAAwB,CAAA,EAQlDA,EAAK,SAAWkmE,EAEZzpB,GAAW,OACbz8C,EAAK,QAAUuf,EAAO,QAAQ,QAAO,GAEnCokD,GAAgB,KAClB,MAAM,IAAI,MAAM,oDAAoD,WAxBxE,cAAA,eAAWsC,EAAS,YAAA,CAApB,IAAA,UAAA,CAIE,MAAO,wCACR,CAAA,EAuBDA,EAAc,UAAA,eAAd,SAAepC,EAA+C,CAA9D,IAkFC7jE,EAAA,KAjFO8jE,EAAgB,MAAM,QAAQD,CAAiB,EACjDA,EAAkB,IAAI,SAAAtiD,EAAQ,CAAA,OAAAA,EAAK,IAAI,CAAA,EACvC,OAAO,KAAKsiD,CAAiB,EAEjCC,EAAc,QAAQ,SAACpjE,EAAMhK,EAAC,CAC5B,IAAMvB,EAAQoqB,EAAO,oBAAoB7e,CAAI,EACvCwb,EAAY,GACdlc,EAAK,uBAAuBtJ,CAAC,GAAK,OACpCsJ,EAAK,uBAAuBtJ,CAAC,EAAI,CAC/B,aAAc,GAAG,OAAAgK,EAAU,MAAA,EAC3B,SAAU+X,GAAK,UAAM,CAAA,OAAAsuB,GAAU5xC,CAAK,EAAE,SAAS+mB,CAAS,CAAC,CAAA,IAGzDlc,EAAK,mBAAmBtJ,CAAC,GAAK,OAChCsJ,EAAK,mBAAmBtJ,CAAC,EAAI,CAC3B,aAAc,GAAG,OAAAgK,EAAe,WAAA,EAChC,SAAU+X,GAAK,UAAM,CAAA,OAAAsuB,GAAU5xC,CAAK,EAAE,SAAS+mB,CAAS,CAAC,CAAA,IAGzDlc,EAAK,qBAAqBtJ,CAAC,GAAK,MAAQsJ,EAAK,WAC/CA,EAAK,qBAAqBtJ,CAAC,EAAI,CAC7B,aAAc,GAAG,OAAAgK,EAAS,KAAA,EAC1B,SAAU+X,GAAK,UAAM,CAAA,OAAAsuB,GAAU5xC,CAAK,EAAE,SAAS+mB,CAAS,CAAC,CAAA,IAI7D,IAAM6nD,EAAW,MAAM,QAAQF,CAAiB,EAC5CA,EAAkBntE,CAAC,EAAE,OACrBmtE,EAAkBnjE,CAAI,EAC1B,GAAIqjE,GAAY,KAIhB,KAAMoC,EAAwBnmE,EAAK,uBAAuBtJ,CAAC,EAAE,SACvD0vE,EAAqBpmE,EAAK,mBAAmBtJ,CAAC,EAAE,SACtD+hB,GAAK,UAAA,CACH,IAAM4tD,EACF3tD,GAAI1E,EAAImyD,EAAuBnmE,EAAK,KAAK,EACrCgU,EAAIq2B,GAAO05B,CAAQ,EAAG,EAAI/jE,EAAK,KAAK,CAAC,EAE7C,GAAIA,EAAK,SAAU,CACjB,IAAMsmE,EAAsBtmE,EAAK,qBAAqBtJ,CAAC,EAAE,SAEnD6vE,EACF7tD,GAAI1E,EAAIsyD,EAAqBtmE,EAAK,KAAK,EACnCgU,EAAI+vD,EAAU,EAAI/jE,EAAK,KAAK,CAAC,EAE/BwmE,EACF71D,GAAIqD,EAAI+vD,EAAU/jE,EAAK,YAAY,EAC/BmqC,GACIoF,GAAI82B,EACA3tD,GAAI2xB,GAAOk8B,CAAsB,EAAGvmE,EAAK,OAAO,CAAC,CAAC,CAAC,EAC7DymE,EACF/tD,GAAI1E,EAAIoyD,EAAoBpmE,EAAK,QAAQ,EAAGwmE,CAAgB,EAEhEL,EAAsB,OAAOE,CAAwB,EACrDC,EAAoB,OAAOC,CAAsB,EACjDH,EAAmB,OAAOK,CAAqB,EAE/C,IAAMhqD,EAAW8yB,GAAIp6C,EAAOsxE,CAAqB,EACjDtxE,EAAM,OAAOsnB,CAAQ,CACtB,KAAM,CAEL,IAAMiqD,EACFhuD,GAAI1E,EAAImyD,EAAuBnmE,EAAK,KAAK,EACrCgU,EAAIq2B,GAAO05B,CAAQ,EAAG,EAAI/jE,EAAK,KAAK,CAAC,EAEvCymE,EACF/tD,GAAI1E,EAAIoyD,EAAoBpmE,EAAK,QAAQ,EACrC2Q,GAAIqD,EAAI+vD,EAAU/jE,EAAK,YAAY,EAC/BmqC,GAAKzxB,GAAIguD,EAA0B1mE,EAAK,OAAO,CAAC,CAAC,CAAC,EAE9DmmE,EAAsB,OAAOO,CAAwB,EACrDN,EAAmB,OAAOK,CAAqB,EAE/C,IAAMhqD,EAAW8yB,GAAIp6C,EAAOsxE,CAAqB,EACjDtxE,EAAM,OAAOsnB,CAAQ,CACtB,CACH,CAAC,EACH,CAAC,EACD,KAAK,oBAAmB,GAGjBwpD,EAAA,UAAA,QAAA,UAAA,CACH,KAAK,wBAA0B,MACjCz9C,GAAQ,KAAK,uBAAuB,IAAI,SAAApyB,EAAK,CAAA,OAAAA,EAAE,QAAQ,CAAA,CAAC,EAEtD,KAAK,sBAAwB,MAAQ,KAAK,UAC5CoyB,GAAQ,KAAK,qBAAqB,IAAI,SAAApyB,EAAK,CAAA,OAAAA,EAAE,QAAQ,CAAA,CAAC,EAEpD,KAAK,oBAAsB,MAC7BoyB,GAAQ,KAAK,mBAAmB,IAAI,SAAApyB,EAAK,CAAA,OAAAA,EAAE,QAAQ,CAAA,CAAC,GAIzC6vE,EAAA,UAAA,WAAN,UAAA,iGAED,OAAA7B,EAASrtE,GAAAA,GAAA,CAAA,EAAAJ,EACP,KAAK,sBAAsB,EAAA,EAAA,EAAAA,EAAK,KAAK,kBAAkB,EAAA,EAAA,EAC3D,KAAK,UACPytE,EAAU,KAAV,MAAAA,EAASrtE,GAAA,CAAA,EAAAJ,EAAS,KAAK,oBAAoB,EAAE,EAAA,CAAA,EAEvC,CAAA,EAAM,KAAK,eAAc,CAAE,EAAnC,IAAA,GAAA,MAAA,CAAA,EAAO,CAACiJ,EAAA,KAAA,CAA2B,EAAE,OACjCwkE,EAAU,IAAI,SAAAhuE,EAAK,CAAA,MAAC,CAAC,KAAMA,EAAE,aAAc,OAAQA,EAAE,QAAQ,CAAE,CAAA,CAAC,CAAC,MACtE,EAEc6vE,EAAU,UAAA,WAAhB,SAAiBxC,EAA2B,4FACpC,IAAA,GAAA,MAAA,CAAA,EAAM,KAAK,kBAAkBA,CAAY,CAAC,SAAzD,OAAAA,EAAe7jE,EAAA,KAAA,EACTykE,EACF,KAAK,SAAWZ,EAAa,OAAS,EAAIA,EAAa,OAAS,EAC9DvnD,EAAY,GAClB,KAAK,uBACDunD,EAAa,MAAM,EAAGY,CAAa,EAAE,IAAI,SAAAjuE,EAAC,CAAI,MAAC,CACJ,aAAcA,EAAE,KAChB,SAAUA,EAAE,OAAO,SACf8lB,CAAS,EACb,CAAA,EAC/C,KAAK,mBACDunD,EAAa,MAAMY,EAAeA,EAAgB,CAAC,EAC9C,IAAI,SAAAjuE,EAAC,CAAI,MAAC,CACJ,aAAcA,EAAE,KAChB,SAAUA,EAAE,OAAO,SAAS8lB,CAAS,EACrC,CAAA,EACX,KAAK,WACP,KAAK,qBACDunD,EAAa,MAAMY,EAAgB,EAAGA,EAAgB,CAAC,EAClD,IAAI,SAAAjuE,EAAC,CAAI,MAAC,CACJ,aAAcA,EAAE,KAChB,SAAUA,EAAE,OAAO,SAAS8lB,CAAS,EACrC,CAAA,WAElB,EAED+pD,EAAA,UAAA,UAAA,UAAA,CACE,MAAO,CACL,aAAgB,KAAK,aACrB,MAAS,KAAK,MACd,SAAY,KAAK,SACjB,QAAW,KAAK,QAChB,SAAY,KAAK,WAKLA,EAAA,WAAhB,SACIlD,EAAiCz1D,EAAkB,CACrD,OAAO,IAAIy1D,EACPz1D,EAAO,aAAiBA,EAAO,MAAUA,EAAO,SAChDA,EAAO,QAAYA,EAAO,QAAW,GAE5C24D,CAAA,GArLqC3C,EAAS,ECNzCqD,GAAa,CACjBjD,GACAY,GACAG,GACAY,GACAO,GACAK,GACAN,aAGciB,IAAkB,aAChC,QAAwBC,EAAAvwE,GAAAqwE,EAAU,EAAAG,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAA/B,IAAME,EAASD,EAAA,MAClB7D,GAAc8D,CAAS,CACxB,mGACH,CCVA,IAAMC,GAA2B,QAC3BC,GAA8B,QAC9BC,GAAqC,eAE3C,SAASC,GAASpxE,EAAU,CAC1B,OAAO,IAAI,QAAQ,SAAAX,EAAO,CAAI,OAAA,WAAWA,CAAO,CAAC,CAAA,EAAE,KAAKW,CAAC,CAC3D,CAEA,IAAAqxE,IAAA,UAAA,CAQE,SAAAA,EAAYC,EAAuB,CACjC,GAAI,CAAC9nE,GAAG,EAAG,QAAQ,YAAY,EAG7B,MAAM,IAAI,MACN,qFACmB,EAGrB8nE,EAAe,WAAWD,EAAiB,UAAU,IACvDC,EAAiBA,EAAe,MAAMD,EAAiB,WAAW,MAAM,IAEtEC,GAAkB,MAAQA,EAAe,SAAW,KACtDA,EAAiBL,IAGnB,KAAK,kBAAoBK,EAAiBJ,GAC1C,KAAK,mBACDI,EAAiBH,GAGjB,OAAAE,EAAI,UAAA,KAAV,SAAWl6C,EAA8B,6GACvC,GAAI,OAAQ,SAAc,IACxB,MAAM,IAAI,MACN,yFACkD,EAUpD,GALE+E,EAAexL,GAAqB,KAAKyG,EAAe,UAAU,EAElEo6C,EAAa,OAAO,IAAI,gBAAgB,IAAI,KAC9C,CAACr1C,CAAY,EAAG,CAAC,KAAM,0BAA0B,CAAC,CAAC,EAEnD,EAAA/E,EAAe,yBAAyB,aAAxC,MAAmD,CAAA,EAAA,CAAA,EACrD,MAAM,IAAI,MACN,uFACwB,SAEtB,OAAAK,EAAyC,CAAC,CAC9C,MAAO,CAAC,KAAO,KAAK,kBAAkB,EACtC,QAASL,EAAe,WACzB,CAAA,EACKF,EACFJ,GAA8BM,EAAgBK,CAAe,EAE3Dg6C,EAAe,OAAO,IAAI,gBAC5B,IAAI,KAAK,CAAC,KAAK,UAAUv6C,CAAS,CAAC,EAAG,CAAC,KAAM,kBAAkB,CAAC,CAAC,EAI/Dw6C,EAAa,KAAK,iBAAmB,KACvC,SAAS,cAAc,GAAG,EAC1B,KAAK,gBACTA,EAAW,SAAW,KAAK,kBAC3BA,EAAW,KAAOD,EAIlB,CAAA,EAAMJ,GAAM,UAAA,CAAM,OAAAK,EAAW,cAAc,IAAI,WAAW,OAAO,CAAC,CAAhD,CAAiD,CAAC,SAEhE,OAFJ5nE,EAAA,KAAA,EAEIstB,EAAe,YAAc,KAAI,CAAA,EAAA,CAAA,GAC7Bu6C,EAAmB,KAAK,kBAAoB,KAC9C,SAAS,cAAc,GAAG,EAC1B,KAAK,iBACTA,EAAiB,SAAW,KAAK,mBACjCA,EAAiB,KAAOH,EACxB,CAAA,EAAMH,GACF,UAAA,CAAM,OAAAM,EAAiB,cAAc,IAAI,WAAW,OAAO,CAAC,CAAtD,CAAuD,CAAC,UADlE7nE,EAAA,KAAA,mBAIF,MAAO,CAAA,EAAA,CAAC,mBAAoBytB,GAA6BH,CAAc,CAAC,CAAC,MAE5E,QA5Eek6C,GAAU,WAAG,eA+E/B,IAAAM,IAAA,UAAA,CAIE,SAAAA,EAAYC,EAAa,CACvB,GAAIA,GAAS,MAAQA,EAAM,OAAS,EAClC,MAAM,IAAI,MACN,2DACA,gBAAgB,OAAAA,CAAK,CAAE,EAE7B,KAAK,SAAWA,EAAM,CAAC,EACvB,KAAK,aAAeA,EAAM,MAAM,CAAC,EAG7B,OAAAD,EAAA,UAAA,KAAN,UAAA,+EACE,MAAA,CAAA,EAAO,IAAI,QAAQ,SAACtyE,EAASC,EAAM,CACjC,IAAMuyE,EAAa,IAAI,WACvBA,EAAW,OAAS,SAACnzC,EAAY,CAE/B,IAAMzH,EAAY,KAAK,MAAOyH,EAAM,OAAe,MAAM,EAEnDozC,EAAgB76C,EAAU,cAChC,GAAI66C,GAAiB,KAAM,CACzBxyE,EAAO,IAAI,MAAM,4CACb,OAAA2K,EAAK,SAAS,IAAI,CAAE,CAAC,EACzB,MACD,CAED,IAAMutB,EAAkBP,EAAU,gBAClC,GAAIO,GAAmB,KAAM,CAC3Bl4B,EAAO,IAAI,MAAM,6CACb,OAAA2K,EAAK,SAAS,IAAI,CAAE,CAAC,EACzB,MACD,CAED,GAAIA,EAAK,aAAa,SAAW,EAAG,CAClC5K,EAAQ,CAAC,cAAayyE,CAAA,CAAC,EACvB,MACD,CAED,IAAMC,EAAwB36C,GAC1BH,EAAW,SAACO,EAAe,CAAK,OAAAvtB,EAAK,YAAYutB,CAAe,CAAhC,CAAiC,EACrEn4B,EAAQ0yE,CAAqB,CAC/B,EAEAF,EAAW,QAAU,SAAA9wE,EAAS,CAAA,OAAAzB,EAC1B,2DACA,cAAA,OAAc2K,EAAK,SAAS,KAAuC,mCAAA,EACnE,sCAAsC,CAHZ,EAI9B4nE,EAAW,WAAW5nE,EAAK,QAAQ,CACrC,CAAC,CAAC,KACH,EAEO0nE,EAAW,UAAA,YAAX,SAAYn6C,EAAsC,SAkBzDvtB,EAAA,KAfOitB,EAAsC,CAAA,EACtC86C,EAAkB,CAAA,MACxB,QAAoBv6C,EAAAl3B,GAAAi3B,CAAe,EAAAE,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAAhC,IAAME,EAAKD,EAAA,MACdR,EAAY,KAAZ,MAAAA,EAAWl2B,GAAA,CAAA,EAAAJ,EAAS+2B,EAAM,OAAO,EAAE,EAAA,CAAA,EACnCq6C,EAAM,KAAN,MAAAA,EAAKhxE,GAAA,CAAA,EAAAJ,EAAS+2B,EAAM,KAAK,EAAE,EAAA,CAAA,CAC5B,mGAED,IAAMs6C,EACF,KAAK,4BAA4Bz6C,CAAe,EAE9C06C,EACFF,EAAM,IAAI,SAAA1yD,EAAQ,CAAA,OAAArV,EAAK,gBAAgBqV,EAAM2yD,EAAW3yD,CAAI,CAAC,CAAC,CAAA,EAElE,OAAO,QAAQ,IAAI4yD,CAAQ,EAAE,KACzB,SAAAvhD,EAAW,CAAA,MAAA,CAACuG,EAAavG,CAAO,CAAC,CAAA,GAG/BghD,EAAA,UAAA,gBAAA,SAAgBryD,EAAc6yD,EAAU,CAC9C,OAAO,IAAI,QAAQ,SAAC9yE,EAASC,EAAM,CACjC,IAAM8yE,EAAmB,IAAI,WAC7BA,EAAiB,OAAS,SAAC1zC,EAAY,CAErC,IAAM1K,EAAc0K,EAAM,OAAe,OACzCr/B,EAAQ20B,CAAU,CACpB,EACAo+C,EAAiB,QAAU,SAAArxE,EACvB,CAAA,OAAAzB,EAAO,6CAAA,OAA6CggB,EAAI,IAAA,CAAI,CAAC,EACjE8yD,EAAiB,kBAAkBD,CAAI,CACzC,CAAC,GAMKR,EAA2B,UAAA,4BAA3B,SAA4B56C,EAA+B,SA8BlE9sB,EAAA,KA5BOooE,EAAsB,CAAA,EACtBC,EAAY,KAAK,aAAa,IAAI,SAAAH,EAAI,CAAI,OAAAz7C,GAASy7C,EAAK,IAAI,CAAC,CAAA,EAC7DF,EAAqC,CAAA,MAC3C,QAAoBM,EAAAhyE,GAAAw2B,CAAQ,EAAAy7C,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAAzB,IAAMl/C,EAAKm/C,EAAA,MACdn/C,EAAM,MAAM,QAAQ,SAAA/T,EAAI,CACtB,IAAMmzD,EAAe/7C,GAASpX,CAAI,EAClC,GAAI+yD,EAAU,QAAQI,CAAY,IAAM,GACtC,MAAM,IAAI,MACN,sDACA,IAAI,OAAAA,EAAe,GAAA,CAAA,EAGzB,GADAJ,EAAU,KAAKI,CAAY,EACvBH,EAAU,QAAQG,CAAY,IAAM,GACtC,MAAM,IAAI,MACN,8BAAA,OAA8BA,EAAY,oBAAA,CAAoB,EAElER,EAAW3yD,CAAI,EAAIrV,EAAK,aAAaqoE,EAAU,QAAQG,CAAY,CAAC,CAExE,CAAC,CACF,mGAED,GAAIJ,EAAU,SAAW,KAAK,aAAa,OACzC,MAAM,IAAI,MACN,uDACA,IAAI,OAAAA,EAAU,OAAkD,4CAAA,EAChE,IAAA,OAAI,KAAK,aAAa,OAAM,IAAA,CAAI,EAEtC,OAAOJ,GAEVN,CAAA,GAAA,EAEYe,GAAmC,SAACj6C,EAAoB,CACnE,OAAKjvB,GAAG,EAAG,QAAQ,YAAY,GAGzB,CAAC,MAAM,QAAQivB,CAAG,GAAKA,EAAI,WAAW44C,GAAiB,UAAU,EAC5DsB,GAAiBl6C,EAAI,MAAM44C,GAAiB,WAAW,MAAM,CAAC,EAHhE,IAQX,EACA/4C,GAAiB,mBAAmBo6C,EAAsB,EAyCpD,SAAUC,GAAiBrB,EAAwB,CAAxB,OAAAA,IAAA,SAAAA,EAAwB,SAChD,IAAID,GAAiBC,CAAc,CAC5C,CA0CM,SAAUsB,GAAahB,EAAa,CACxC,OAAO,IAAID,GAAaC,CAAK,CAC/B,CC3TM,SAAUiB,GACZX,EAA6BY,EAC7BC,EAAwBC,EAAoB,CAC9CC,EAAcf,CAAQ,EACtBa,EAAgBA,GAAwB,EACxCC,EAAcA,GAAsB,EACpCE,EAAcH,EAAeC,CAAW,EACxC,IAAIG,EAAkB,EAEhBC,EAAkB,SAACC,EAAmB,CAC1C,OAAAA,EAAQ,KAAK,SAAAj0E,EAAK,CAChB,IAAMk0E,EAAWP,GACb,EAAEI,EAAkBjB,EAAS,QAAUc,EAAcD,GAEzD,OAAAD,EAAWQ,CAAQ,EACZl0E,CACT,CAAC,EACMi0E,CACT,EAEA,SAASJ,EAAcf,EAA2B,CAChDvuE,EACIuuE,GAAY,MAAQ,MAAM,QAAQA,CAAQ,GAAKA,EAAS,OAAS,EACjE,UAAA,CAAM,MAAA,qCAAqC,CAAA,EAGjD,SAASgB,EAAcH,EAAuBC,EAAmB,CAC/DrvE,EACIovE,GAAiB,GAAKA,GAAiB,EACvC,UAAM,CAAA,MAAA,kDACF,qBAAA,OAAqBA,CAAa,CADhC,CACkC,EAC5CpvE,EACIqvE,GAAe,GAAKA,GAAe,EACnC,UAAM,CAAA,MAAA,kDACF,mBAAA,OAAmBA,CAAW,CAD5B,CAC8B,EACxCrvE,EACIqvE,GAAeD,EACf,UAAA,CAAM,MAAA,uDACF,qBAAA,OAAqBA,EAAgC,mBAAA,EACrD,GAAA,OAAGC,CAAW,CAFZ,CAEc,EAG1B,OAAO,QAAQ,IAAId,EAAS,IAAIkB,CAAe,CAAC,CAClD,CCnCsB,SAAAG,GACpBC,EAAqB96C,EAAyB,qHAgB5B,OAfdA,GAAe,OACjBA,EAAc,CAAA,GAGV+6C,EAAY/6C,EAAY,WAAa,KAAOlvB,GAAG,EAAG,SAAS,MAC/DkvB,EAAY,UAGRg7C,EAAWF,EAAU,IACzB,SAAAG,EACE,CAAA,OAAAF,EAAUE,EAAUj7C,EAAY,YAAa,CAAE,SAAU,EAAI,CAAE,CAAC,CAAA,EAE9Dk7C,EAAqB,EACrBC,EAAmB,GAEPn7C,EAAY,YAAc,KAAI,CAAA,EAAA,CAAA,EAC9C,CAAA,EAAM,QAAQ,IAAIg7C,CAAQ,CAAC,SAA3B,OAAA5pE,EAAA2iB,EAAA,KAAA,QACA,IAAA,GAAA,MAAA,CAAA,EAAMomD,GACJa,EAAUh7C,EAAY,WAAYk7C,EAClCC,CAAgB,CAAC,SAFnB/pE,EAAA2iB,EAAA,KAAA,mBASc,OAXVqnD,EAIehqE,EAEfiqE,EAAiBD,EAAU,IAAI,SAAAE,EAAQ,CAAI,OAAAA,EAAS,YAAW,CAApB,CAAsB,EAEjEC,EAAsB,GACtBC,EAAoB,EAEVx7C,EAAY,YAAc,KAAI,CAAA,EAAA,CAAA,EAC5C,CAAA,EAAM,QAAQ,IAAIq7C,CAAc,CAAC,SAAjC,OAAAhqE,EAAA0iB,EAAA,KAAA,QACA,IAAA,GAAA,MAAA,CAAA,EAAMomD,GACJkB,EAAgBr7C,EAAY,WAAYu7C,EACxCC,CAAiB,CAAC,SAFpBnqE,EAAA0iB,EAAA,KAAA,mBAFI,OAAAkE,EAIgB5mB,EACtB,CAAA,EAAO4mB,CAAO,MACf,CAEe,SAAAwjD,GAAcX,EAAqB96C,EAAwB,CAA3E,IAgCCzuB,EAAA,OA/BOwpE,EAAY/6C,EAAY,WAAa,KAAOlvB,GAAG,EAAG,SAAS,MAC/DkvB,EAAY,UAEV07C,EAAa,EACbC,EACJ,OAAAxqE,EAAA6uB,EAAY,cAAa,MAAA7uB,IAAA,QAAAA,EAAA,KAAA6uB,EAAA,CAAC,EACnB,IAAI,eAA2B,CACpC,KAAM,SAAO47C,EAAU,CAAA,OAAAx1E,GAAAmL,EAAA,OAAA,OAAA,UAAA,iEACd,OAAAmqE,EAAaZ,EAAU,OACvBa,EAAW,CAAA,EAAA,CAAA,EACA,CAAA,EAAMZ,EAAUD,EAAUY,CAAU,EACnB17C,EAAY,YACZ,CAAC,SAAU,EAAI,CAAC,CAAC,EAJhB,CAAA,EAAA,CAAA,SAE1B74B,EAAQkK,EAEkC,KAAA,EAAE,KAElDsqE,EAAcx0E,EAAK,UAAS,YAGR,IAAA,GAAA,MAAA,CAAA,EAAMw0E,EAAY,KAAI,CAAE,SAE9C,OAFMvqE,EAAgBC,EAAA,KAAA,EAAfuN,EAAIxN,EAAA,KAAE1K,EAAK0K,EAAA,MAEdwN,GACF88D,IACAC,EAAc,QACdxqE,EAAA6uB,EAAY,cAAa,MAAA7uB,IAAA,QAAAA,EAAA,KAAA6uB,EAAA07C,EAAaZ,EAAU,MAAM,EAC7C,CAAA,EAAA,CAAA,IAEXc,EAAW,QAAQl1E,CAAK,EACjB,CAAA,CAAA,UAET,OAAAk1E,EAAW,MAAK,QACjB,CAAA,CAAA,CACF,CAAA,CACH,CAWM,SAAgBj9C,GACpBN,EAAiCw9C,EACjCC,EACAC,EAAyB,CAFQ,OAAAF,IAAA,SAAAA,EAAmB,wEAS9C,OAAAG,EAAe,SAACC,EACpB,CAAA,OAAApB,GAAyBoB,EAAW,CAAE,YAAWF,CAAA,CAAE,CAAC,EAChDp9C,EAAcu9C,GAAqBF,CAAY,EAE9C,CAAA,EAAAr9C,EAAYN,EAAUw9C,EAAgBC,CAAW,CAAC,KAC1D,CA0BK,SAAUI,GACdC,EAAqE,CADvE,IAiHC5qE,EAAA,KA7GC,OAAO,SACL8sB,EAAiCw9C,EACjCC,EAAsB,CADW,OAAAD,IAAA,SAAAA,EAAmB,4GAqDpD,GAjDMO,EAAyB/9C,EAAS,IAAI,UAAM,CAAA,MAAA,EAAK,CAAA,EACjDg+C,EAKF,CAAA,EACEC,EACJR,GAAe,KAAOA,EAAY,IAAI,UAAM,CAAA,MAAA,EAAA,CAAK,EAAI,CAAA,EACjDS,EAAmC,CAAA,EACzCl+C,EAAS,QAAQ,SAACm+C,EAAqBC,EAAU,CAC/C,IAAIC,EAAc,EAClBF,EAAoB,QAAQ,QAAQ,SAAAG,EAAY,CAC9C,IAAMC,EAAY,iBAAkBD,EAClCA,EAAa,aAAa,MAC1BA,EAAa,MAETE,EAAe9kD,GAAqB6kD,CAAQ,EAChDpwD,GAAmBmwD,EAAa,KAAK,EAEjCG,EAA8B,UAAA,CAClCV,EAAuBK,CAAU,EAAI,GACjCJ,EAAoBI,CAAU,GAAK,OACrCJ,EAAoBI,CAAU,EAAI,CAAA,GAGpCJ,EAAoBI,CAAU,EAAE,KAAK,CACnC,cAAeE,EACf,YAAWD,EACX,UAAWG,CACZ,CAAA,CACH,EAEIf,GAAe,KACjBA,EAAY,QAAQ,SAACiB,EAAYC,EAAW,CACtCD,IAAeJ,EAAa,OAC9BG,EAA2B,EAC3BR,EAAaU,CAAW,EAAI,GAEhC,CAAC,EAEDF,EAA2B,EAG7BP,EAAuB,KAAKI,EAAa,IAAI,EAC7CD,GAAeG,CACjB,CAAC,CACH,CAAC,EAEG,CAACP,EAAa,MAAM,SAAAzX,EAAK,CAAI,OAAAA,CAAA,CAAK,EAC9B,MAAAoY,EAAkBnB,EAAY,OAAO,SAAC10E,EAAGa,EAAC,CAAK,MAAA,CAACq0E,EAAar0E,CAAC,CAAf,CAAgB,EAC/D,IAAI,MACR,kDACA,GAAA,OAAGg1E,EAAgB,KAAK,IAAI,EAAO;CAAA,EACnC,yCACA,GAAG,OAAAV,EAAuB,KAAK,IAAI,EAAC,GAAA,CAAG,EAKrC,OAAAW,EACJd,EAAuB,OAAO,SAACe,EAAaC,EAAan1E,EAAC,CACxD,OAAIm1E,GACFD,EAAY,KAAKl1E,CAAC,EAEbk1E,GACN,CAAA,CAAE,EAEDlB,EAAsB,CAAA,EAC5BiB,EAAoB,QAAQ,SAAAj1E,EAAC,CAC3Bo2B,EAASp2B,CAAC,EAAE,MAAM,QAAQ,SAAAo1E,EAAQ,CAChC,IAAMC,EAAWzB,GACbA,EAAe,SAAS,GAAG,EAAU,GAAN,KAAYwB,EAC/CpB,EAAU,KAAKqB,CAAQ,CACzB,CAAC,CACH,CAAC,EACe,CAAA,EAAMnB,EAAqBF,CAAS,CAAC,SAA/C,OAAAhkD,EAAU7mB,EAAqC,KAAA,EAE/CmsE,EAAmC,CAAA,EACrCC,EAAoB,EACxBN,EAAoB,QAAQ,SAAAj1E,EAAC,CAC3B,IAAMw1E,EAAap/C,EAASp2B,CAAC,EAAE,MAAM,OAE/By1E,EAAgB,IAAI1lD,GACxBC,EAAQ,MAAMulD,EAAmBA,EAAoBC,CAAU,CAAC,EAE5DE,EAAiBtB,EAAoBp0E,CAAC,EAE5C01E,EAAe,QAAQ,SAAAhB,EAAY,CACjC,IAAM1gD,EAAayhD,EAAc,MAC/Bf,EAAa,YACbA,EAAa,YAAcA,EAAa,SAAS,EAC7CiB,EACJviD,GAAcY,EAAY,CAAC0gD,EAAa,aAAa,CAAC,EACxD,QAAW1qE,KAAQ2rE,EACjBL,EAAiBtrE,CAAI,EAAI2rE,EAAgB3rE,CAAI,CAEjD,CAAC,EAEDurE,GAAqBC,CACvB,CAAC,EAED,CAAA,EAAOF,CAAgB,OAE3B,CC9OA,IAAMM,GAAyB,2BACzBC,GAAY,mBAClBC,IAAA,UAAA,CAcE,SAAYA,EAAAn3D,EAAcoZ,EAAyB,CA+BjD,GAtCO,KAAc,eAAG,OAQpBA,GAAe,OACjBA,EAAc,CAAA,GAEhB,KAAK,iBAAmBA,EAAY,iBACpC,KAAK,mBAAqBA,EAAY,mBAElCA,EAAY,WAAa,MAC3B/0B,EACI,OAAO+0B,EAAY,WAAc,WACjC,UAAM,CAAA,MAAA,6HAE2D,CAAA,EACrE,KAAK,MAAQA,EAAY,WAEzB,KAAK,MAAQlvB,GAAG,EAAG,SAAS,MAG9B7F,EACI2b,GAAQ,MAAQA,EAAK,OAAS,EAC9B,UAAA,CAAM,MAAA,yDACM,CAAA,EAEZ,MAAM,QAAQA,CAAI,GACpB3b,EACI2b,EAAK,SAAW,EAChB,UAAM,CAAA,MAAA,+CACF,qBAAA,OAAqBA,EAAK,OAAM,IAAA,CAD9B,CACkC,EAE9C,KAAK,KAAOA,EAERoZ,EAAY,aAAe,MAC3BA,EAAY,YAAY,MAAQ,KAClC,MAAM,IAAI,MACN,oEAAoE,EAE1E,KAAK,YAAcA,EAAY,aAAe,CAAA,EAC9C,KAAK,YAAcA,EAGf,OAAA+9C,EAAI,UAAA,KAAV,SAAWt/C,EAA8B,yGACvC,GAAIA,EAAe,yBAAyB,YAC1C,MAAM,IAAI,MACN,yFACwB,EAGxB,OAAA9rB,EAAO,OAAO,OAAO,CAAC,OAAQ,KAAK,cAAc,EAAG,KAAK,WAAW,EAC1EA,EAAK,KAAO,IAAI,SAEVmsB,EAAyC,CAAC,CAC9C,MAAO,CAAC,qBAAqB,EAC7B,QAASL,EAAe,WACzB,CAAA,EACKu/C,EACF7/C,GAA8BM,EAAgBK,CAAe,EAEjEnsB,EAAK,KAAK,OACN,aACA,IAAI,KACA,CAAC,KAAK,UAAUqrE,CAA8B,CAAC,EAC/C,CAAC,KAAMF,EAAS,CAAC,EACrB,YAAY,EAEZr/C,EAAe,YAAc,OAGzB+E,EAAexL,GAAqB,KAAKyG,EAAe,UAAU,EAExE9rB,EAAK,KAAK,OACN,oBACA,IAAI,KAAK,CAAC6wB,CAAY,EAAG,CAAC,KAAMq6C,EAAsB,CAAC,EACvD,mBAAmB,GAGF,CAAA,EAAA,KAAK,MAAM,KAAK,KAAMlrE,CAAI,CAAC,SAElD,GAFM2oE,EAAWnqE,EAAiC,KAAA,EAE9CmqE,EAAS,GACX,MAAO,CAAA,EAAA,CACL,mBAAoB18C,GAA6BH,CAAc,EAC/D,UAAW,CAAC68C,CAAQ,EACrB,EAED,MAAM,IAAI,MACN,gEACA,GAAA,OAAGA,EAAS,OAAM,GAAA,CAAG,MAE5B,EAEayC,EAAA,UAAA,cAAN,UAAA,kGACqB,IAAA,GAAA,MAAA,CAAA,EAAM,KAAK,MAAM,KAAK,KAAM,KAAK,WAAW,CAAC,SAExE,GAFME,EAAqB9sE,EAA6C,KAAA,EAEpE,CAAC8sE,EAAmB,GACtB,MAAM,IAAI,MACN,cAAA,OAAc,KAAK,KAA+B,2BAAA,EAClD,GAAG,OAAAA,EAAmB,OAA2C,qCAAA,EACjE,sCAAsC,gDAI9B,CAAA,EAAMA,EAAmB,KAAI,CAAE,SAA3C,OAAA1/C,EAAYptB,EAAA,KAAA,8BAER+sE,EAAU,+CAA+C,OAAA,KAAK,KAAI,GAAA,EAGlE,KAAK,KAAK,SAAS,KAAK,EAC1BA,GAAW,+UAOXA,GAAW,uEAGP,IAAI,MAAMA,CAAO,SAMzB,GAFM9E,EAAgB76C,EAAU,cAC1BO,EAAkBP,EAAU,gBAC9B66C,GAAiB,MAAQt6C,GAAmB,KAC9C,MAAM,IAAI,MACN,2BAAA,OAA2B,KAAK,KAA8B,0BAAA,EAC9D,mCAAmC,EAGzC,MAAA,CAAA,EAAOP,CAAS,MACjB,EAUKw/C,EAAA,UAAA,KAAN,UAAA,wGACE,OAAI,KAAK,YAAY,cACnB,CAAA,EAAO,KAAK,WAAU,CAAE,EAER,CAAA,EAAM,KAAK,cAAa,CAAE,SAAtC,OAAAx/C,EAAYptB,EAA0B,KAAA,EAC5C,CAAA,EAAOutB,GACHH,EAAW,SAACO,EAAoB,CAAA,OAAAvtB,EAAK,YAAYutB,CAAe,CAAhC,CAAiC,CAAC,MACvE,EAEai/C,EAAA,UAAA,WAAN,UAAA,uGACY,IAAA,GAAA,MAAA,CAAA,EAAM,KAAK,cAAa,CAAE,SAAtC,OAAAx/C,EAAYptB,EAA0B,KAAA,EACpB,CAAA,EAAA,KAAK,cAAcotB,EAAU,eAAe,CAAC,SAA/D,OAAAu8C,EAAY3pE,EAAmD,KAAA,EAC/DqtB,EAAcK,GAAeN,EAAU,eAAe,EACtD4/C,EAAS,UAAA,CAAM,OAAA1C,GAAcX,EAAWvpE,EAAK,WAAW,CAAC,EAE/D,CAAA,EAAA,OAAA,OAAA,OAAA,OAAA,CAAA,EACKgtB,CAAS,EACZ,CAAA,YAAWC,EACX,gBAAiB2/C,CAAM,CACvB,CAAA,MACH,EAEaJ,EAAa,UAAA,cAAnB,SAAoBj/C,EAAsC,yIAE1Ds/C,EAAa,MAAM,QAAQ,KAAK,IAAI,EAAI,KAAK,KAAK,CAAC,EAAI,KAAK,KAC5DjtE,EAAAjJ,EAAmBm2E,GAASD,CAAU,EAAC,CAAA,EAAtCr6C,EAAM5yB,EAAA,CAAA,EAAE6yB,EAAM7yB,EAAA,CAAA,EACfmtE,EAAa,KAAK,kBAAoBv6C,EAEtC+2C,EAAsB,CAAA,EACtByD,EAAsC,CAAA,MAC5C,IAA2Bx/C,EAAAl3B,GAAAi3B,CAAe,EAAEE,EAAAD,EAAA,KAAA,EAAA,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAAjCy/C,EAAYx/C,EAAA,UACrB,IAAmB5tB,GAAAqtE,EAAA,OAAA52E,GAAA22E,EAAa,KAAK,GAAEntE,EAAAD,EAAA,KAAA,EAAA,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAA5BwV,EAAIvV,EAAA,MACT,KAAK,oBAAsB,KAC7BktE,EAAY,KAAK,KAAK,mBAAmB33D,CAAI,CAAC,EAE9Ck0D,EAAU,KAAKwD,EAAa13D,EAAOod,CAAM,mGAG9C,0GAEG,KAAK,oBACPhQ,GAAAD,EAAA+mD,EAAU,MAAI,SAAdA,CAAS,SAAS,CAAA,EAAM,QAAQ,IAAIyD,CAAW,CAAC,GADvB,CAAA,EAAA,CAAA,SACzBvqD,EAAA,MAAAD,EAAA8W,EAAA,OAAA,CAAAviC,GAAA,MAAA,OAAAwrB,EAAA,OAAA,CAAA5rB,EAAA,MAAA,OAAA,CAAkBw2E,EAAA,KAAA,CAA8B,CAAE,EAAA,EAAA,CAAA,CAAA,CAAA,CAAA,CAAA,YAEpD,IAAA,GAAA,MAAA,CAAA,EAAO5D,CAAS,MACjB,EAEaiD,EAAW,UAAA,YAAjB,SAAkBj/C,EAAsC,8FAE5C,IAAA,GAAA,MAAA,CAAA,EAAM,KAAK,cAAcA,CAAe,CAAC,SAArD,OAAAg8C,EAAY3pE,EAAyC,KAAA,EACrDqtB,EAAcK,GAAeC,CAAe,EAE5B,CAAA,EAAA+7C,GAAyBC,EAAW,KAAK,WAAW,CAAC,SAArE,OAAA7iD,EAAU9mB,EAA2D,KAAA,EAC3E,CAAA,EAAO,CAACqtB,EAAavG,CAAO,CAAC,MAC9B,QArMe8lD,GAAgB,iBAAG,eAmN/B,SAAUM,GAASt+C,EAAW,CAClC,IAAM4+C,EAAY5+C,EAAI,YAAY,GAAG,EAC/B6+C,EAAkB7+C,EAAI,YAAY,GAAG,EACrCgE,EAAShE,EAAI,UAAU,EAAG4+C,CAAS,EACnC36C,EACF46C,EAAkBD,EAAY5+C,EAAI,UAAU6+C,CAAe,EAAI,GACnE,MAAO,CAAC76C,EAAS,IAAKC,CAAM,CAC9B,CAEM,SAAU66C,GAAa9+C,EAAW,CACtC,OAAOA,EAAI,MAAMg+C,GAAY,gBAAgB,GAAK,IACpD,CAEO,IAAMe,GACT,SAAC/+C,EAAaC,EAAyB,CACrC,GAAI,OAAO,MAAU,MAChBA,GAAe,MAAQA,EAAY,WAAa,MAInD,OAAO,KAEP,IAAI++C,EAAS,GAMb,OALI,MAAM,QAAQh/C,CAAG,EACnBg/C,EAASh/C,EAAI,MAAM,SAAAi/C,EAAO,CAAI,OAAAH,GAAaG,CAAO,CAApB,CAAqB,EAEnDD,EAASF,GAAa9+C,CAAG,EAEvBg/C,EACKE,GAAKl/C,EAAKC,CAAW,EAGzB,IACT,EACJJ,GAAiB,mBAAmBk/C,EAAU,EAC9Cl/C,GAAiB,mBAAmBk/C,EAAU,EAwE9B,SAAAG,GAAKr4D,EAAcoZ,EAAyB,CAC1D,OAAO,IAAI+9C,GAAYn3D,EAAMoZ,CAAW,CAC1C,CAOgB,SAAAk/C,GACZt4D,EAAcoZ,EAAyB,CACzC,OAAOi/C,GAAKr4D,EAAMoZ,CAAW,CAC/B,CC9VA,IAAAm/C,IAAA,UAAA,CACE,SAAAA,EAA6B1gD,EAA+B,CAA/B,KAAc,eAAdA,EAE7B,OAAA0gD,EAAA,UAAA,KAAA,UAAA,CACE,OAAO,KAAK,gBAEfA,CAAA,GAAA,EAEDC,IAAA,UAAA,CACE,SAAAA,EACmBt6C,EAA6C,CAA7C,KAAW,YAAXA,EAEnB,OAAAs6C,EAAI,UAAA,KAAJ,SAAK3gD,EAA8B,CACjC,OAAO,KAAK,YAAYA,CAAc,GAEzC2gD,CAAA,GAAA,EAEDC,IAAA,UAAA,CAIE,SAAAA,EAAYhyD,EAAsB,CAC5BA,EAAQ,OACV,KAAK,KAAO,UAAM,CAAA,OAAA,QAAQ,QAAQA,EAAQ,KAAI,CAAE,CAAC,GAE/CA,EAAQ,OACV,KAAK,KAAO,SAACoR,EACX,CAAA,OAAA,QAAQ,QAAQpR,EAAQ,KAAKoR,CAAc,CAAC,CAAC,GAGpD,OAAA4gD,CAAA,GAAA,EAuBK,SAAUC,GACZ7gD,EAAmCD,EACnClD,EAAyBikD,EAA+B,CAE1D,IAAMroD,EAAO,UACb,OAAO,IAAImoD,GAAiBG,GAAkB,MAAA,OAAAl3E,GAAA,CAAA,EAAAJ,EAAAgvB,CAAI,EAAA,EAAA,CAAA,CAAA,CACpD,CAuBM,SAAUsoD,GACZ/gD,EAAmCD,EACnClD,EAAyBikD,EAA+B,CAC1D,GAAI,UAAU,SAAW,EAAG,CAC1B,IAAME,EACDhhD,EAAkC,eAAiB,MACnDA,EAAkC,aAAe,KACtD,OAAIghD,EACK,IAAIN,GAAkB1gD,CAAgC,GAI7D,QAAQ,KACJ,uNAGqD,EAClD,IAAI0gD,GAAkB,CAAC,cAAe1gD,CAAoB,CAAC,EAErE,KAGC,gBAAQ,KACJ,uNAGqD,EAClD,IAAI0gD,GAAkB,CAC3B,cAAe1gD,EACf,YAAWD,EACX,WAAUlD,EACV,eAAcikD,CACf,CAAA,CAEL,CAiBM,SAAUG,GACZ56C,EACuB,CACzB,OAAO,IAAIs6C,GAAiBt6C,CAAW,CACzC,CAiBM,SAAU66C,GACZ76C,EAAsD,CACxD,OAAO,IAAIs6C,GAA6Bt6C,CAAW,CACrD,ojBE3HgB86C,GACZxQ,EAA6B7R,EAC7BkU,EAAkB,CACpB,IAAMpC,EAAU74C,EAAgB44C,EAAQ,SAAU,iBAAiB,EAC7D3R,EACFjnC,EAAgB+mC,EAAa,cAAe,iBAAiB,EAEjE7wC,EACI+kD,GAAc,MAAQA,EAAa,GAAK,OAAO,UAAUA,CAAU,EACnE,UAAA,CAAM,MAAA,uDACF,WAAA,OAAWA,CAAU,CADnB,CACqB,EAC/B/kD,EACI2iD,EAAQ,OAAS,EACjB,UAAA,CAAM,MAAA,gDAAA,OAAgDA,EAAQ,IAAI,CAA5D,CAA8D,EACxE3iD,EACI+wC,EAAa,OAAS,EACtB,UAAM,CAAA,MAAA,6CACF,WAAA,OAAWA,EAAa,IAAI,CAD1B,CAC4B,EACtC/wC,EACI2iD,EAAQ,MAAM,CAAC,IAAM5R,EAAa,MAAM,CAAC,EACzC,UAAA,CAAM,MAAA,uCACF,GAAA,OAAG4R,EAAQ,MAAM,CAAC,EAAS,OAAA,EAAA,OAAA5R,EAAa,MAAM,CAAC,EAAK,IAAA,EACpD,iEAAiE,CAAA,EACzE/wC,EACI+kD,EAAa,GAAK,OAAO,UAAUA,CAAU,EAC7C,UAAA,CAAM,MAAA,4DACF,GAAA,OAAGA,CAAU,CADX,CACa,EAIvB,IAAMoO,EAAex6B,GAAO5e,GAAK4oC,EAAS,OAAO,EAAGoC,CAAU,EACxDqO,EACFz6B,GAAO5e,GAAKg3B,EAAc,OAAO,EAAGgU,CAAU,EAC5CsO,EAA0BjlB,GAAU+kB,CAAY,EAChDG,EAAoBhxC,GAAO+wC,EAAeD,CAAiB,EACjE,OAAOr5C,GAAKu5C,EAAS,OAAO,CAC9B,CAEO,IAAMC,GAAkCr4E,EAAG,CAAC,iBAAgBg4E,EAAA,CAAC,6CEjEhEM,GACAC,GAAoB,GAkCxB,SAASC,GACLC,EAEAC,EAAe,CAEjB,GAFEA,IAAA,SAAAA,EAAe,GAEbA,EAAc,EAChB,MAAM,IAAI,MACN,gEAAgE,EAEtE,GAAID,GAAU,KACZ,MAAM,IAAI,MAAM,0DAA0D,EAE5E,IAAIE,EAAc,GACdC,EAAc,GACdC,EAAU,GACVC,EAAU,GACVC,EAAe,GACfC,EAAgB,GACpB,GAAKP,EAAqB,gBAAgB,WACxCE,EAAc,WAEZ,OAAQ,UAAe,KAAeF,aAAkB,UAC1DG,EAAc,WAEZ,OAAQ,iBAAsB,KAC9BH,aAAkB,iBACpBI,EAAU,WAER,OAAQ,iBAAsB,KAC9BJ,aAAkB,iBACpBK,EAAU,WAEAL,EAAe,YAAc,KACvCM,EAAe,WAEb,OAAQ,YAAiB,KAAeN,aAAkB,YAC5DO,EAAgB,OAEhB,OAAM,IAAI,MACN,6OAIA,WAAA,OAAYP,EAAc,YAAY,IAAI,CAAE,EAIlD,IAAMhwD,EAAS/R,GAAUT,GAAYiT,EAAO,WAAW,EACvD,GAAIT,GAAU,KAAM,CAClB,IAAM7I,EAA2B,CAAC,OAAM64D,CAAA,EAClCnvD,EAAyB,CAAC,YAAWovD,CAAA,EAC3C,OAAOxvD,EAAO,UACVjT,GAAY2J,EACZ0J,CAAgC,CACrC,CAEK,IAAA/f,EAAAjJ,EAAkBu4E,EACpB,CACGJ,EAA4B,WAC5BA,EAA4B,WAC9B,EACD,CAACA,EAAO,MAAOA,EAAO,MAAM,EAAC,CAAA,EAL1Bj0E,EAAK+E,EAAA,CAAA,EAAE0vE,EAAM1vE,EAAA,CAAA,EAMhBnD,EAEJ,GAAI2yE,EACF3yE,EAEKqyE,EAAe,WAAW,IAAI,EAAE,aAAa,EAAG,EAAGj0E,EAAOy0E,CAAM,EAAE,aAC9DL,GAAeD,EACxBvyE,EAAQqyE,EAAiC,aAChCK,GAAWD,GAAWG,EAAe,CAC9C,GAAIV,IAAuB,KACzB,GAAI,OAAO,SAAa,IACtB,GAAI,OAAO,gBAAoB,KAC3B,OAAO,kCAAsC,IAE/CA,GAAsB,IAAI,gBAAgB,EAAG,CAAC,EAAE,WAAW,IAAI,MAE/D,OAAM,IAAI,MACN,sGAC+D,OAGrEA,GAAsB,SAAS,cAAc,QAAQ,EAAE,WACnD,KAAM,CAAC,mBAAoB,EAAI,CAAC,EAGxCA,GAAoB,OAAO,MAAQ9zE,EACnC8zE,GAAoB,OAAO,OAASW,EACpCX,GAAoB,UAChBG,EAA4B,EAAG,EAAGj0E,EAAOy0E,CAAM,EACnD7yE,EAAOkyE,GAAoB,aAAa,EAAG,EAAG9zE,EAAOy0E,CAAM,EAAE,IAC9D,CACD,IAAIx3E,EACJ,GAAIi3E,IAAgB,EAClBj3E,EAAS,IAAI,WAAW2E,CAAI,MACvB,CACL,IAAM8yE,EAAY10E,EAAQy0E,EAC1Bx3E,EAAS,IAAI,WAAWy3E,EAAYR,CAAW,EAC/C,QAASr4E,EAAI,EAAGA,EAAI64E,EAAW74E,IAC7B,QAAS84E,EAAU,EAAGA,EAAUT,EAAa,EAAES,EAC7C13E,EAAOpB,EAAIq4E,EAAcS,CAAO,EAAI/yE,EAAK/F,EAAI,EAAI84E,CAAO,CAG7D,CACD,IAAMv1C,EAAqC,CAACq1C,EAAQz0E,EAAOk0E,CAAW,EACtE,OAAOjpB,GAAShuD,EAAQmiC,EAAU,OAAO,CAC3C,CAIA,SAAS+0C,GAAYF,EAEW,CAC9B,OAAQA,GAAU,MAAWA,EAAqB,gBAAgB,UACpE,CAEA,SAASW,IAA2B,CAClC,OAAO,OAAO,OAAW,KACrB,OAAQ,YAAiB,KACzB,OAAO,eAAe,mBAAmB,CAC/C,CAEA,SAASC,GAAiBZ,EAC8C,CACtE,OAAOA,GAAU,MAAQA,EAAO,QAAU,GAAKA,EAAO,SAAW,CACnE,CAEA,SAASa,GAA2Bb,EAE4B,CAC9D,OAAOW,GAA2B,GAAM,EAAEX,aAAkB,cACxDY,GAAiBZ,CAAM,GAAK,CAACE,GAAYF,CAAM,CACrD,CA4BsB,SAAAc,GAClBd,EAEAC,EAAe,CAAf,OAAAA,IAAA,SAAAA,EAAe,8FAMb,GALA94D,EAC+B,KAI/B,EAAA1W,GAAG,EAAG,QAAQ,qBAAqB,GACnCowE,GAA2Bb,CAAM,GADjC,MACkC,CAAA,EAAA,CAAA,EAGhCe,EAAW,qDAOQ,CAAA,EAAA,kBACjBf,EAA6B,CAAC,iBAAkB,MAAM,CAAC,CAAC,SAD5D,OAAAe,EAAcjwE,EAAA,KAAA,+BAGdiwE,EAAc,kBAShB,OAAIA,GAAe,MAAQA,EAAY,QAAUf,EAAO,OACpDe,EAAY,SAAWf,EAAO,OAChC74D,EAAS45D,EAET55D,EAAS64D,eAGX74D,EAAS64D,YAGX,IAAA,GAAA,MAAA,CAAA,EAAOD,GAAY54D,EAAQ84D,CAAW,CAAC,MACxC,CAED,SAASe,GAAkBC,EAAsB,CAC/C,GAAIA,EAAI,OAAS,GAAKA,EAAI,OAAS,EACjC,MAAM,IAAI,MACN,wDAAA,OAAwDA,EAAI,KAAO,GAAA,CAAA,EAEzE,IAAMp8B,EAAQo8B,EAAI,OAAS,EAAI,EAAIA,EAAI,MAAM,CAAC,EAE9C,GAAIp8B,EAAQ,GAAKA,IAAU,EACzB,MAAM,IAAI,MACN,wCACA,qBAAqB,OAAAA,CAAK,CAAE,EAGlC,GAAIo8B,EAAI,QAAU,WAAaA,EAAI,QAAU,QAC3C,MAAM,IAAI,MACN,kCAAA,OAAkCA,EAAI,MAAQ,GAAA,EAC9C,uCAAuC,CAE/C,CAEA,SAASC,GAAqBC,EAA0B,CACtD,IAAMljC,EAAQkjC,GAAe,OAAS,EACtC,GAAIljC,EAAQ,GAAKA,EAAQ,EACvB,MAAM,IAAI,MAAM,eAAA,OAAeA,EAAK,qCAAA,CAAqC,CAE7E,CAsBsB,SAAAmjC,GAClBH,EACAI,EAA0B,iIACxB,OAAAC,EAAOnrD,EAAgB8qD,EAAK,MAAO,UAAU,EAC3CA,aAAeh0D,KAEbs0D,EAAoBD,EAC1BA,EAAOl7C,GAAKm7C,EAAmB,OAAO,EACtCA,EAAkB,QAAO,GAE3BP,GAAkBM,CAAI,EAEhBxwE,EAAAjJ,EAAkBy5E,EAAK,MAAM,MAAM,EAAG,CAAC,EAAC,CAAA,EAAvCd,EAAM1vE,EAAA,CAAA,EAAE/E,EAAK+E,EAAA,CAAA,EACd+zC,EAAQy8B,EAAK,OAAS,EAAI,EAAIA,EAAK,MAAM,CAAC,EACnC,CAAA,EAAMA,EAAK,KAAI,CAAE,SAI9B,IAJM/xE,EAAOwB,EAAiB,KAAA,EACxBsS,EAAai+D,EAAK,QAAU,UAAY,IAAM,EAC9CnzE,EAAQ,IAAI,kBAAkBpC,EAAQy0E,EAAS,CAAC,EAE7C54E,EAAI,EAAGA,EAAI44E,EAASz0E,EAAO,EAAEnE,EAAG,CAGvC,IAFM45E,EAAO,CAAC,EAAG,EAAG,EAAG,GAAG,EAEjB97E,EAAI,EAAGA,EAAIm/C,EAAOn/C,IAAK,CAG9B,GAFMW,EAAQkJ,EAAK3H,EAAIi9C,EAAQn/C,CAAC,EAE5B47E,EAAK,QAAU,WACjB,GAAIj7E,EAAQ,GAAKA,EAAQ,EACvB,MAAM,IAAI,MACN,qDACA,iCAAiC,OAAAA,EAAQ,GAAA,CAAA,UAEtCi7E,EAAK,QAAU,UACpBj7E,EAAQ,GAAKA,EAAQ,KACvB,MAAM,IAAI,MACN,mDACA,mCAAmC,OAAAA,EAAQ,GAAA,CAAA,EAI/Cw+C,IAAU,GACZ28B,EAAK,CAAC,EAAIn7E,EAAQgd,EAClBm+D,EAAK,CAAC,EAAIn7E,EAAQgd,EAClBm+D,EAAK,CAAC,EAAIn7E,EAAQgd,GAElBm+D,EAAK97E,CAAC,EAAIW,EAAQgd,CAErB,CAEK9V,EAAI3F,EAAI,EACduG,EAAMZ,EAAI,CAAC,EAAI,KAAK,MAAMi0E,EAAK,CAAC,CAAC,EACjCrzE,EAAMZ,EAAI,CAAC,EAAI,KAAK,MAAMi0E,EAAK,CAAC,CAAC,EACjCrzE,EAAMZ,EAAI,CAAC,EAAI,KAAK,MAAMi0E,EAAK,CAAC,CAAC,EACjCrzE,EAAMZ,EAAI,CAAC,EAAI,KAAK,MAAMi0E,EAAK,CAAC,CAAC,CAClC,CAED,OAAIH,GAAU,OACPvB,KACG9vD,EAAS/R,GAAUtI,GAAM8a,EAAO,WAAW,EAC7CT,GAAU,OACZ,QAAQ,KACJ,oGACqC,EACzC8vD,GAAoB,KAIxBuB,EAAO,MAAQt1E,EACfs1E,EAAO,OAASb,EACViB,EAAMJ,EAAO,WAAW,IAAI,EAC5BK,EAAY,IAAI,UAAUvzE,EAAOpC,EAAOy0E,CAAM,EACpDiB,EAAI,aAAaC,EAAW,EAAG,CAAC,GAE9BJ,IAASL,GACXK,EAAK,QAAO,EAEd,CAAA,EAAOnzE,CAAK,MACb,UAsBewzE,GACZxlD,EAAqCklD,EACrCv4E,EAAqB,CACvB,IAAIw4E,EAAOnrD,EAAgBgG,EAAO,MAAO,MAAM,EAC/C,GAAI,EAAEA,aAAiBlP,IAAS,CAE9B,IAAMs0D,EAAoBD,EAC1BA,EAAOl7C,GAAKm7C,EAAmB,OAAO,EACtCA,EAAkB,QAAO,CAC1B,CACDP,GAAkBM,CAAI,EACtBJ,GAAqBp4E,GAAS,YAAY,EAE1C,IAAMqe,EAAqB,CAAC,MAAOm6D,CAAI,EACjCzwD,EAAmB,CAAC,OAAMwwD,EAAE,QAAOv4E,CAAA,EACzC2nB,EAAO,UACH9a,GAAMwR,EACN0J,CAAgC,CACtC,CAEO,IAAM+wD,GAA6Br6E,EAAG,CAAC,YAAWw4E,EAAA,CAAC,2ECxZ1C,SAAA8B,GAAmBjzD,EAAoBgH,EAAmB,CAExE,IAAMksD,EAAalzD,EAAO,MAAM,OAC1B+oC,EAAc/hC,EAAQ,MAAM,OAClC,GAAIksD,EAAa,EACf,MAAM,IAAI,MACN,0DACA,qBAAqB,OAAAA,EAAa,GAAA,CAAA,EAExC,GAAInqB,EAAc,EAChB,MAAM,IAAI,MACN,4DACA,qBAAqB,OAAAA,EAAc,GAAA,CAAA,EAEzC,GAAI/hC,EAAQ,QAAU,QACpB,MAAM,IAAI,MACN,sDACA,sBAAA,OAAsBA,EAAQ,MAAK,GAAA,CAAG,EAE5C,GAAIA,EAAQ,MAAM+hC,EAAc,CAAC,EAAImqB,EACnC,MAAM,IAAI,MACN,iEACA,GAAA,OAAGlsD,EAAQ,MAAM+hC,EAAc,CAAC,EAAS,OAAA,EAAA,OAAAmqB,CAAU,CAAE,EAG3D,GAAIz2E,GAAcujB,EAAO,KAAK,IAAM,EAClC,MAAM,IAAI,MACN,qDACA,iBAAA,OAAiBA,EAAO,MAAK,GAAA,CAAG,EAStC,QANMmzD,EAAensD,EAAQ,MACvBgiC,EAAYmqB,EAAaA,EAAa,OAAS,CAAC,EAIlDC,EAAU,EACL,EAAI,EAAG,EAAID,EAAa,OAAS,EAAG,EAAE,EAC7CC,GAAWD,EAAa,CAAC,EAG3B,IAAMv5D,EAAaoG,EAAO,MAEpBqzD,EAAcF,EAAa,MAAK,EACtCE,EAAY,IAAG,EAGf,QADInyC,EAAY,EACP,EAAI8nB,EAAW,EAAIkqB,EAAY,EAAE,EACxChyC,GAAatnB,EAAW,CAAC,EACzBy5D,EAAY,KAAKz5D,EAAW,CAAC,CAAC,EAGhC,IAAM5Z,EACF3G,GAAIA,GAAA,CAAA,EAAAJ,EAAA8G,GAAeigB,EAAO,KAAK,EAAE,IAAI,SAAA9C,EAAM,CAAI,OAAAA,EAASgkB,CAAT,CAAkB,CAAC,EACjE,EAAA,EAAA,CAAA,CAAC,EAAE,EAAA,EAAA,MAAM,EAAG8nB,CAAS,EAE1B,MAAO,CAACqqB,EAAaD,EAASlyC,EAAWlhC,CAAO,CAClD,+CChEMszE,GAAW,GACXC,GAAc,YA6DJC,GACZ75D,EAAmBwmB,EAAiBzjC,EAAc,CACpD,IAAMmd,EAAYF,EAAM,MAAM,OAC9B8D,EACI5D,IAAcsmB,EAAM,OACpB,UAAA,CAAM,MAAA,iBAAA,OAAiBtmB,EAAS,qBAAA,EAAA,OAAsBsmB,EAAa,QAAA,EAC/D,gCAAA,OAAgCtmB,EAAS,IAAA,CADvC,CAC2C,EACrD4D,EACI5D,IAAcnd,EAAK,OACnB,UAAA,CAAM,MAAA,iBAAA,OAAiBmd,EAAS,oBAAA,EAAA,OAAqBnd,EAAY,QAAA,EAC7D,gCAAA,OAAgCmd,EAAS,IAAA,CADvC,CAC2C,EAErD,mBAAS7gB,EAAC,CACRykB,EACI0iB,EAAMnnC,CAAC,EAAI0D,EAAK1D,CAAC,GAAK2gB,EAAM,MAAM3gB,CAAC,EACnC,UAAM,CAAA,MAAA,iBAAiB,OAAA6gB,EAAqB,WAAA,EAAA,OAAA7gB,EAAa,WAAA,EAAA,OAAAA,EAAK,IAAA,EAC1D,IAAI,OAAAmnC,EAAMnnC,CAAC,EAAI0D,EAAK1D,CAAC,EAAiC,+BAAA,EAAA,OAAAA,EAAC,KAAA,EAAA,OACjD2gB,EAAM,MAAM3gB,CAAC,EAAI,GAAA,CAAA,CAAA,GALxBA,EAAI,EAAGA,EAAI6gB,EAAW,EAAE7gB,IAAxBA,CAAC,CAOZ,CAGM,SAAUy6E,GAAWh3B,EAAY,CAGrC,QAFM/9C,EAAO,CAAA,EACTN,EAAO,EACJq+C,EAAO,GACRA,EAAO,GACT/9C,EAAK,KAAKN,CAAI,EAEhBq+C,GAAQ,EACRr+C,IAEF,OAAOM,CACT,UAGgBg1E,GACZvzC,EAAiBlpB,EAAejX,EAAiB,CAEnD,QADMtD,EAAO,CAAA,EACJ0B,EAAO,EAAGA,EAAO+hC,EAAM,OAAQ/hC,IACtC1B,EAAK0B,CAAI,EAAI,KAAK,MAAM6Y,EAAI7Y,CAAI,EAAI+hC,EAAM/hC,CAAI,GAAK4B,EAAQ5B,CAAI,CAAC,EAElE,OAAO1B,CACT,CAIM,SAAUi3E,GACZ3zE,EAAmB4zE,EAAgCC,EACnDj6D,EAAoB,CAEtB,QADMk6D,EAAUz6E,GAAA,CAAA,EAAAJ,EAAO+G,CAAO,EAAA,EAAA,EACrBhH,EAAI86E,EAAW,OAAQ96E,EAAI4gB,EAAW,OAAQ5gB,IACrD86E,EAAW,KAAK,CAAC,EAEnB,QAAS96E,EAAI,EAAGA,EAAI66E,EAAe76E,IAC7BA,IAAM,EACR86E,EAAWF,CAAsB,EAAI,GAErCE,EAAW,OACPF,EAAwB,EACxB,CAAC,EACLE,EAAW,IAAG,GAGlB,OAAOA,CACT,CAEA,SAASC,GACLH,EAAgCC,EAChCG,EAAsB,CACxB,OAAIA,GAAkBJ,EACbI,EAGFA,GAAkBH,EAAgB,EAC3C,CAEA,SAASI,GAAcJ,EAAuBD,EAA8B,CAE1E,QADMM,EAAa,CAAA,EACVl7E,EAAI,EAAGA,EAAI66E,EAAe76E,IACjCk7E,EAAW,KAAKN,EAAyB56E,CAAC,EAE5C,OAAOk7E,CACT,UAGgBC,GACZv6D,EAAsBw6D,EAAwBC,EAC9Cl0C,EAAiBlpB,EAAejX,EAAmB0nD,EACnDC,EACAC,EAAoB,CACtB,IAAM/tC,EAAYD,EAAW,OACzB06D,EAAkB,IAAI,MAAMz6D,CAAS,EACrC06D,EAAgB,IAAI,MAAM16D,CAAS,EACnC26D,EAAoB,IAAI,MAAM36D,CAAS,EAC3C,GAAIu6D,EAAa,QAAUC,EAAsB,EAAG,CAClD,IAAMI,EAAYL,EAAa,CAAC,EAI1BP,EAAgBQ,EAAsB,EAC5CC,EAAkBI,GACdhtB,EAAW+sB,EAAWZ,EAAe1zC,EAAOvmB,CAAU,EAC1D26D,EAAgBI,GACZhtB,EAAS8sB,EAAWZ,EAAe58D,EAAK2C,CAAU,EACtD46D,EACIb,GAAsB3zE,EAASy0E,EAAWZ,EAAej6D,CAAU,CACxE,KACC,SAASxb,EAAO,EAAGA,EAAOyb,EAAWzb,IACnCk2E,EAAgBl2E,CAAI,EAAIw2E,GACpBltB,EAAWvnB,EAAOngC,EAAS4Z,EAAYxb,EAAMwpD,CAAY,EAC7D2sB,EAAcn2E,CAAI,EACdy2E,GAAYltB,EAAS1wC,EAAKjX,EAAS4Z,EAAYxb,EAAMwpD,CAAY,EACrE4sB,EAAkBp2E,CAAI,EAAI02E,GAAe90E,EAAS5B,EAAMwpD,CAAY,EAIxE,MAAO,CACL,MAAO0sB,EACP,IAAKC,EACL,QAASC,EAEb,CAIM,SAAUE,GACZhtB,EAAmBksB,EAAgCC,EACnDkB,EAAyBn7D,EAAoB,CAI/C,QAHMo7D,EAAU37E,GAAA,CAAA,EAAAJ,EAAO2gB,CAAU,EAAA,EAAA,EAC3Bs6D,EAAaD,GAAcJ,EAAeD,CAAsB,EAE7Dx1E,EAAO,EAAGA,EAAO42E,EAAW,OAAQ52E,IAC3C,GAAI81E,EAAW,QAAQ91E,CAAI,EAAI,GAC7B42E,EAAW52E,CAAI,EAAI,MACd,CACL,IAAM62E,EACFlB,GAAgBH,EAAwBC,EAAez1E,CAAI,EAC3D82E,EAAgBH,EAAcE,CAAY,EAC1CvtB,EAAY,GAAKutB,IACnBC,EAAgB,GAGlBF,EAAW52E,CAAI,EAAI82E,CACpB,CAEH,OAAOF,CACT,CAIM,SAAUL,GACZhtB,EAAiBisB,EAAgCC,EACjDsB,EAAuBv7D,EAAoB,CAI7C,QAHMo7D,EAAU37E,GAAA,CAAA,EAAAJ,EAAO2gB,CAAU,EAAA,EAAA,EAC3Bs6D,EAAaD,GAAcJ,EAAeD,CAAsB,EAE7Dx1E,EAAO,EAAGA,EAAO42E,EAAW,OAAQ52E,IAC3C,GAAI81E,EAAW,QAAQ91E,CAAI,EAAI,GAC7B42E,EAAW52E,CAAI,EAAI,OAAO,qBACrB,CACL,IAAM62E,EACFlB,GAAgBH,EAAwBC,EAAez1E,CAAI,EAC3D82E,EAAgBC,EAAYF,CAAY,EACxCttB,EAAU,GAAKstB,IACjBC,EAAgB,OAAO,kBAEzBF,EAAW52E,CAAI,EAAI82E,CACpB,CAGH,QAASl8E,EAAI,EAAGA,EAAIg8E,EAAW,OAAQh8E,IAAK,CAE1C,IAAMo8E,EAAWx7D,EAAW5gB,CAAC,EACzBg8E,EAAWh8E,CAAC,EAAI,IAClBg8E,EAAWh8E,CAAC,GAAKo8E,GAEnBJ,EAAWh8E,CAAC,EAAIq8E,GAAW,EAAGL,EAAWh8E,CAAC,EAAG4gB,EAAW5gB,CAAC,CAAC,CAC3D,CACD,OAAOg8E,CACT,UAEgBF,GACZ90E,EAAmB5B,EAAcwpD,EAAoB,CACvD,IAAI1qC,EAASld,EAAQ5B,CAAI,EACzB,OAAIwpD,EAAgB,GAAKxpD,GAAS8e,GAAU,QAC1CA,EAAS,GAGJA,CACT,CAEgB,SAAA03D,GACZltB,EAAmB4tB,EAAwBt1E,EAC3C4Z,EAAsBxb,EAAcwpD,EAAoB,CAE1D,IAAI9nD,EAAQw1E,EAAal3E,CAAI,EACvB8e,EAASld,EAAQ5B,CAAI,GAAK,GAI5BspD,EAAY,GAAKtpD,GAAQwpD,EAAe,GAAKxpD,GAAQ0B,GAAS,QAC5Dod,EAAS,EAIXpd,EAAQ,OAAO,iBAGfA,EAAQ,OAAO,kBAKnB,IAAMs1E,EAAWx7D,EAAWxb,CAAI,EAChC,OAAI0B,EAAQ,IACVA,GAASs1E,GAIXt1E,EAAQu1E,GAAW,EAAGv1E,EAAOs1E,EAAW,CAAC,EAElCt1E,CACT,CAEgB,SAAA+0E,GACZltB,EAAiB4tB,EAAuBv1E,EACxC4Z,EAAsBxb,EAAcwpD,EAAoB,CAE1D,IAAIhY,EAAO2lC,EAAYn3E,CAAI,EACrB8e,EAASld,EAAQ5B,CAAI,GAAK,GAI5BupD,EAAW,GAAKvpD,GAASwpD,EAAgB,GAAKxpD,GAASwxC,GAAQ,QAC7D1yB,EAAS,EAGX0yB,EAAO,OAAO,iBAGdA,EAAO,OAAO,kBAKlB,IAAMwlC,EAAWx7D,EAAWxb,CAAI,EAChC,OAAIwxC,EAAO,IACTA,GAAQwlC,GAMNl4D,EAAS,EAEX0yB,EAAOylC,GAAW,EAAGzlC,EAAMwlC,CAAQ,EAGnCxlC,EAAOylC,GAAW,GAAIzlC,EAAMwlC,EAAW,CAAC,EAGnCxlC,CACT,UAMgB4lC,GACZn7E,EAAiB8lC,EAAiBzjC,EAAc,CAGlD,QADI+4E,EAAkB/4E,EAAK,OAClB1D,EAAI,EAAGA,EAAI0D,EAAK,OAAQ1D,IAC/B,GAAI0D,EAAK1D,CAAC,EAAI,EAAG,CACfy8E,EAAkBz8E,EAClB,KACD,CAGH,QAASA,EAAIy8E,EAAkB,EAAGz8E,EAAI0D,EAAK,OAAQ1D,IACjD,GAAImnC,EAAMnnC,CAAC,EAAI,GAAK0D,EAAK1D,CAAC,IAAMqB,EAAMrB,CAAC,EACrC,MAAO,GAGX,MAAO,EACT,CAEgB,SAAA08E,GAAkBv1C,EAAiBngC,EAAiB,CAElE,QADI21E,EAAax1C,EAAM,OAAS,EAAIA,EAAMA,EAAM,OAAS,CAAC,EAAI,EACrDnnC,EAAI,EAAGA,EAAImnC,EAAM,OAAS,EAAGnnC,IACpC28E,GAAcx1C,EAAMnnC,CAAC,EAAIgH,EAAQhH,CAAC,EAEpC,OAAO28E,CACT,UAEgBC,GACZ16E,EAAeilC,EAAwBzjC,EAAsB,CAE/D,IAAIm5E,EACEC,EAAQ56E,EAAE,MAAM,OAClB,OAAOilC,GAAU,SACnB01C,EAAMx8E,GAAA,CAAI8mC,CAAK,EAAAlnC,EAAK,IAAI,MAAM68E,EAAQ,CAAC,EAAE,KAAK,CAAC,CAAC,EAAA,EAAA,EACvC31C,EAAM,OAAS21C,EACxBD,EAAS11C,EAAM,OAAO,IAAI,MAAM21C,EAAQ31C,EAAM,MAAM,EAAE,KAAK,CAAC,CAAC,EAE7D01C,EAAS11C,EAAM,MAAK,EAEtB01C,EAAO,QAAQ,SAAA/+E,EAAC,CACd2mB,EACI3mB,IAAM,GAAI,UAAA,CAAM,MAAA,mDAAA,CAAmD,CACzE,CAAC,EACD,IAAIi/E,EACJ,OAAIr5E,GAAQ,KACVq5E,EAAQ,IAAI,MAAMD,CAAK,EAAE,KAAK,EAAE,EACvB,OAAOp5E,GAAS,SACzBq5E,EAAK18E,GAAA,CAAIqD,CAAI,EAAAzD,EAAK,IAAI,MAAM68E,EAAQ,CAAC,EAAE,KAAK,EAAE,CAAC,EAAA,EAAA,EACtCp5E,EAAK,OAASo5E,EACvBC,EAAQr5E,EAAK,OAAO,IAAI,MAAMo5E,EAAQp5E,EAAK,MAAM,EAAE,KAAK,EAAE,CAAC,EAE3Dq5E,EAAQr5E,EAEVq5E,EAAQA,EAAM,IAAI,SAACj/E,EAAG,EAAC,CACrB,OAAIA,GAAK,EACAA,GAEP2mB,EACI3mB,IAAM,GACN,UAAM,CAAA,MAAA,qDACF,GAAA,OAAGA,EAAmC,iCAAA,EAAA,OAAA,EAAC,GAAA,CADrC,CACwC,EAC3CoE,EAAE,MAAM,CAAC,EAAI26E,EAAO,CAAC,EAEhC,CAAC,EACM,CAACA,EAAQE,CAAK,CACvB,UAIgBC,GACZtyC,EAAkBvD,EAAiBlpB,EAAejX,EAClD0nD,EAAmBC,EAAiBC,EACpCC,EAAqBC,EAAsB,CAC7C,IAAImuB,EAaJ,GAZIj2E,GAAW,MACbi2E,EAAiB,IAAI,MAAM91C,EAAM,MAAM,EACvC81C,EAAe,KAAK,CAAC,GAErBA,EAAiBj2E,EAQf4nD,GAAgB,OAASA,EAAgBA,EAAe,KAAQ,EAClE,MAAM,IAAI,MAAM,4CAA4C,EAoB9D,QAfIsuB,EAAe,GAEbC,EAAqC,CACzC,KAAMF,EAAe,OACrB,wBAAyB,EACzB,MAAO91C,EAAM,MAAK,EAClB,IAAKlpB,EAAI,MAAK,EACd,QAASg/D,EAAe,MAAK,EAC7B,UAASvuB,EACT,QAAOC,EACP,aAAYC,EACZ,YAAWC,EACX,eAAcC,GAGP9uD,EAAI,EAAGA,EAAIm9E,EAAW,KAAMn9E,IAC/Bk9E,IAAkB,GAAKl9E,EAAK6uD,KAAiB,GAC/CsuB,EAAW,0BAER,GAAKn9E,EAAK4uD,IACbsuB,EAAe,IAIdA,IACHC,EAAW,cAAiB,GAAKA,EAAW,KAC5CA,EAAW,QAYb,IAAMC,EAAmC,CACvC,KAAM1yC,EAAO,OACb,UAAW,EACX,QAAS,EACT,WAAY,GACZ,SAAU,IAGZ2yC,GAAeF,EAAYC,CAAS,EAUpC,QANIE,EAAa,GACbC,EAAY,GACZC,EAAgB,GACdC,EAAkB,CAAA,EAClBC,EAAa,CAAA,EAEV19E,EAAI,EAAGA,EAAI0qC,EAAO,OAAQ,EAAE1qC,EAAG,CACtC,GAAIo9E,EAAU,QAAQp9E,CAAC,IAAM,EAC3B,MAAM,MAAM,WAAA,OAAWA,EAAC,oBAAA,CAAoB,EAE9C,IAAM29E,EAAU,CAAC,EAAEP,EAAU,eAAkB,GAAKp9E,GAC9C49E,EAAOlzC,EAAO1qC,CAAC,EACrB,GAAI49E,IAAS,GAAI,CACfH,EAAgB,KAAKE,EAAU,EAAI,EAAE,EACrC,QACD,CAED,IAAME,EACF,CAACT,EAAU,UAAa,GAAKp9E,EAAIo9E,EAAU,QAAW,GAAKp9E,CAAE,EAC3D89E,EAAa,CACjBV,EAAU,QAAQp9E,CAAC,EAAI,EAAI,EAAI,GAC/Bo9E,EAAU,QAAQp9E,CAAC,EAAI,EAAI49E,EAAOA,EAAO,GAG3C,GAAID,GAAWP,EAAU,QAAQp9E,CAAC,GAAK,EACrC,MAAM,MAAM,8CAA8C,EAG5Dw9E,EAAgBA,GAAkBJ,EAAU,QAAQp9E,CAAC,IAAM,EAE3D,IAAM+9E,EACF,CAAC,EAAGX,EAAU,UAAa,GAAKp9E,GAAQo9E,EAAU,QAAW,GAAKp9E,GAEtE,GAAIo9E,EAAU,YAAcA,EAAU,SAAU,CAC9C,GAAIO,EAAS,CAKX,IAAMK,EAAOZ,EAAU,MAAMp9E,CAAC,EAAI,EAAI49E,EAAOR,EAAU,MAAMp9E,CAAC,EACxBo9E,EAAU,MAAMp9E,CAAC,EAGvD,GAFAo9E,EAAU,MAAMp9E,CAAC,EAAIg+E,EACrBZ,EAAU,IAAIp9E,CAAC,EAAIo9E,EAAU,MAAMp9E,CAAC,EAAI,EACpCg+E,EAAO,GAAKA,GAAQJ,EACtB,MAAM,MAAM,eAAe,OAAAR,EAAU,MAAMp9E,CAAC,EAAC,gBAAA,EAAA,OACzCA,EAAC,iBAAA,CAAiB,CAEzB,MACCo9E,EAAU,MAAMp9E,CAAC,EAAIi+E,GACjBb,EAAU,MAAMp9E,CAAC,EAAG,EAAGo9E,EAAU,QAAQp9E,CAAC,EAAG49E,EAAMC,EACnDC,CAAU,EACdV,EAAU,IAAIp9E,CAAC,EAAIi+E,GACfb,EAAU,IAAIp9E,CAAC,EAAG,EAAGo9E,EAAU,QAAQp9E,CAAC,EAAG49E,EAAMC,EAAOC,CAAU,EAGxE,IAAMI,EAAqBd,EAAU,QAAQp9E,CAAC,IAAM,GAChDo9E,EAAU,MAAMp9E,CAAC,IAAM,GAAKo9E,EAAU,IAAIp9E,CAAC,IAAM49E,EACrDN,EAAaA,GAAcY,EAC3BX,EAAYA,IACNv9E,IAAM,GAAKo9E,EAAU,QAAQp9E,CAAC,IAAM,GAAMk+E,EACjD,MACCZ,EACIA,GAAgBF,EAAU,QAAQp9E,CAAC,IAAM,GAAM+9E,EACnDR,EAAYA,IACNv9E,IAAM,GAAKo9E,EAAU,QAAQp9E,CAAC,IAAM,GAAM+9E,GAGlD,IAAII,EAAc,OACdC,EAAgB,GAsBpB,GArBIhB,EAAU,YAAcA,EAAU,UACpCe,EAAiBf,EAAU,IAAIp9E,CAAC,EAAIo9E,EAAU,MAAMp9E,CAAC,EACrDo+E,EAAgB,IACPT,GAGTQ,EAAiB,EACjBC,EAAgB,IACPL,GAILH,GAAQ,IACNR,EAAU,QAAQp9E,CAAC,EAAI,EACzBm+E,EAAiB,CAACP,EAElBO,EAAiBP,EAEnBQ,EAAgB,IAGhBA,EAAe,CACjB,IAAIC,EAAK,OAGLF,IAAmB,GACjBA,EAAiB,GAAQf,EAAU,QAAQp9E,CAAC,EAAI,EACpDq+E,EAAQ,EAERA,EAAQ,KAAK,MAAMF,EAAiBf,EAAU,QAAQp9E,CAAC,CAAC,GACnDm+E,EAAiBf,EAAU,QAAQp9E,CAAC,IAAM,EAAI,EAAI,GAEzDy9E,EAAgB,KAAKY,CAAK,CAC3B,MACCZ,EAAgB,KAAK,EAAE,CAE1B,CAOD,QAASa,EAAW,EAAGA,EAAWlB,EAAU,wBAAwB,OAC/D,EAAEkB,EAAU,CACf,IAAMC,EAAcnB,EAAU,wBAAwBkB,CAAQ,EAC1DC,GAAe,EACjBb,EAAW,KAAKD,EAAgBc,CAAW,CAAC,EACnCA,IAAgBjE,IACzBoD,EAAW,KAAK,CAAC,CAEpB,CAED,IAAMc,EAAmBd,EAAW,OAChC,SAACvuC,EAAKnvC,GAAC,CAAK,OAAAo9E,EAAU,wBAAwBp9E,EAAC,IAAMs6E,EAAQ,CAAA,EAEjE,MAAO,CACL,iBAAgBkE,EAChB,WAAUd,EACV,WAAUJ,EACV,UAASC,EACT,cAAaC,EACb,MAAOJ,EAAU,MACjB,IAAKA,EAAU,IACf,QAASA,EAAU,QAEvB,CAEA,SAASC,GACLrR,EAAgCyS,EAA4B,CAC9DA,EAAM,UAAY,EAClBA,EAAM,QAAU,EAChBA,EAAM,eAAiB,EAEvB,IAAIhD,EAAY,EAChBgD,EAAM,WAAazS,EAAO,OAAS,KACnCyS,EAAM,SAAWzS,EAAO,KAAO,KAE/ByS,EAAM,MAAQ,IAAI,MAAMA,EAAM,IAAI,EAClCA,EAAM,IAAM,IAAI,MAAMA,EAAM,IAAI,EAChCA,EAAM,QAAU,IAAI,MAAMA,EAAM,IAAI,EACpCA,EAAM,wBAA0B,CAAA,EAChCA,EAAM,8BAAgC,CAAA,EACtCA,EAAM,8BAAgC,IAAI,MAAMA,EAAM,IAAI,EAE1D,QAASz+E,EAAI,EAAGA,EAAIgsE,EAAO,KAAMhsE,IAC/B,GAAK,GAAKA,EAAKgsE,EAAO,aAOpB,QAHM0S,EAAY,KAAK,IACnBD,EAAM,MAAQzS,EAAO,KAAOhsE,GAAK,EAAIgsE,EAAO,wBAC5CyS,EAAM,IAAI,EACPhD,EAAYiD,EAAWjD,IAE5BgD,EAAM,MAAMhD,CAAS,EAAI,EACzBgD,EAAM,IAAIhD,CAAS,EAAI,EACvBgD,EAAM,QAAQhD,CAAS,EAAI,EAC3BgD,EAAM,WAAc,GAAKhD,EACzBgD,EAAM,SAAY,GAAKhD,EACvBgD,EAAM,wBAAwB,KAAKhD,CAAS,EAC5CgD,EAAM,8BAA8B,KAAK,EAAE,EAC3CA,EAAM,8BAA8BhD,CAAS,EAAIz7E,UAEzC,GAAKA,EAAKgsE,EAAO,YAE3ByS,EAAM,wBAAwB,KAAKnE,EAAQ,EAC3CmE,EAAM,8BAA8B,KAAK,EAAE,MACtC,CACL,GAAIhD,IAAcgD,EAAM,MAAM,OAC5B,MAAM,MACF,sCAAsC,OAAAhD,EAAmB,UAAA,EACzD,YAAY,OAAAgD,EAAM,KAAc,SAAA,EAAA,OAAAA,EAAM,MAAM,OAAS,GAAA,CAAA,EAIvDzS,EAAO,OAAS,OAClByS,EAAM,MAAMhD,CAAS,EAAIzP,EAAO,MAAMhsE,CAAC,GAErCgsE,EAAO,KAAO,OAChByS,EAAM,IAAIhD,CAAS,EAAIzP,EAAO,IAAIhsE,CAAC,GAErCy+E,EAAM,QAAQhD,CAAS,EAAIzP,EAAO,QAAQhsE,CAAC,EACvCgsE,EAAO,UAAa,GAAKhsE,IAC3By+E,EAAM,WAAc,GAAKhD,GAEvBzP,EAAO,QAAW,GAAKhsE,IACzBy+E,EAAM,SAAY,GAAKhD,GAKrBzP,EAAO,eAAkB,GAAKhsE,GAChCy+E,EAAM,wBAAwB,KAAKlE,EAAW,EAC9CkE,EAAM,8BAA8B,KAAK,EAAE,EAC3CA,EAAM,gBAAmB,GAAKhD,IAE9BgD,EAAM,wBAAwB,KAAKhD,CAAS,EAE5CgD,EAAM,8BAA8B,KAAKz+E,CAAC,GAE5Cy+E,EAAM,8BAA8BhD,CAAS,EAAIz7E,EACjDy7E,GACD,CAEL,CAEA,SAASwC,GACL/7E,EAAWsF,EAAWm3E,EAAiBf,EAAcC,EACrDC,EAAoB,CACtB,GAAID,EAAMr2E,CAAC,EACT,OAAOm3E,EAAU,EAAIb,EAAWt2E,CAAC,EAAIs2E,EAAYt2E,EAAI,EAAK,CAAC,EAE3D,IAAMw2E,EAAO97E,EAAI,EAAI07E,EAAO17E,EAAIA,EAChC,OAAO87E,EAAOF,EAAW,CAAC,EAAIA,EAAW,CAAC,EACZE,EAAOF,EAAW,CAAC,EAAIA,EAAW,CAAC,EAAIE,CAEzE,mTC5sBM,IAAAY,GAAU,SCsBhB,IAAAC,IAAA,UAAA,CAAA,SAAAA,GAAA,EAsCS,OAAAA,EAAG,IAAV,SAAW5R,EAAoB,CAC7B,OAAO,IAAIgC,GAAahC,CAAY,GAkB/B4R,EAAA,SAAP,SAAgB5R,EAAsBkC,EAAkBC,EAAmB,CAAnB,OAAAA,IAAA,SAAAA,EAAmB,IAElE,IAAIF,GAAkBjC,EAAckC,EAAUC,CAAW,GAuB3DyP,EAAO,QAAd,SACI5R,EAAsBla,EAAYoc,EAAgBppB,EAClDypB,EAAgB,CADM,OAAAzc,IAAA,SAAAA,EAAU,IAAEoc,IAAA,SAAAA,EAAc,GAAEppB,IAAA,SAAAA,EAAsB,MACxEypB,IAAA,SAAAA,EAAgB,IACX,IAAID,GACPtC,EAAcla,EAAOoc,EAAUppB,EAASypB,CAAQ,GAe/CqP,EAAI,KAAX,SACI5R,EAAsBe,EAAaC,EACnCloB,EAAsB,CADtB,OAAAknB,IAAA,SAAAA,EAAoB,MAAEe,IAAA,SAAAA,EAAW,IAAEC,IAAA,SAAAA,EAAa,MAChDloB,IAAA,SAAAA,EAAsB,MACjB,IAAIgoB,GAAcd,EAAce,EAAOC,EAAOloB,CAAO,GAevD84B,EAAA,SAAP,SAAgB5R,EAAqBC,EAAWnnB,EAAsB,CAAtD,OAAAknB,IAAA,SAAAA,EAAmB,MAAEC,IAAA,SAAAA,EAAS,KAAEnnB,IAAA,SAAAA,EAAsB,MAE7D,IAAIinB,GAAkBC,EAAcC,EAAKnnB,CAAO,GAgBlD84B,EAAM,OAAb,SACI5R,EAAsBe,EAAaC,EAAeloB,EAClDgN,EAAW,CADX,OAAAka,IAAA,SAAAA,EAAoB,MAAEe,IAAA,SAAAA,EAAW,IAAEC,IAAA,SAAAA,EAAa,MAAEloB,IAAA,SAAAA,EAAsB,MACxEgN,IAAA,SAAAA,EAAW,GACN,IAAI4b,GAAgB1B,EAAce,EAAOC,EAAOloB,EAASgN,CAAK,GAmBhE8rB,EAAA,QAAP,SAAe5R,EAAsBY,EAA6B,CAA7B,OAAAA,IAAA,SAAAA,EAA6B,IAEzD,IAAID,GAAiBX,EAAcY,CAAuB,GAEpEgR,CAAA,GAAA,ECzKM,IAAMC,GAAQD,GCFrB,IAAME,IAA2B,UAAA,CAC/B,OAAI,OAAO,sBAA0B,IAC5B,sBACE,OAAO,aAAiB,IAC1B,aAEF,SAAC1/E,EAAW,CAAK,OAAAA,EAAC,CAAD,CAC1B,GAAC,EAYD,SAAS2/E,IAAS,CAChB,OAAO,IAAI,QAAc,SAAAtgF,EAAO,CAAI,OAAAqgF,GAAc,UAAA,CAAM,OAAArgF,EAAO,CAAP,CAAS,CAA7B,CAA8B,CACpE,CCnBgB,SAAAugF,GAAuBC,EAAoB95E,EAAY,CACrE,IAAMC,EAAO65E,EAAO,CAAC,EAAE,OACvBA,EAAO,QAAQ,SAAC79E,EAAOrB,EAAC,CACtBykB,EACIpjB,EAAM,SAAWgE,EACjB,UAAA,CACI,MAAA,kBAAA,OAAkBA,EAAI,qBAAA,EAAA,OAAsBrF,EAAsB,qBAAA,EAClE,4BAAA,OAA4BqF,EAAI,GAAA,CADhC,CACmC,CAC7C,CAAC,EAEDof,EACIrf,GAAQ,GAAKA,EAAOC,EACpB,UAAA,CAAM,MAAA,kBAAA,OAAkBA,EAAI,gCAAA,EAAA,OAAiCA,EAAO,EAAI,GAAA,CAAA,CAAA,EAE5E,IAAM85E,EAAaD,EAAO,CAAC,EAC3BA,EAAO,QAAQ,SAAC79E,EAAOrB,EAAC,CACtB,QAASE,EAAI,EAAGA,EAAImF,EAAMnF,IACxBukB,EACKvkB,IAAMkF,GAAU/D,EAAMnB,CAAC,IAAMi/E,EAAWj/E,CAAC,EAC1C,UAAA,CAAM,MAAA,kBAAA,OAAkBmF,EAAI,sBAAA,EAAA,OAAuBrF,EAAC,KAAA,EAAA,OAAMqB,EAAS,IAAA,EAC/D,yCAAA,OAAyC89E,EAAc,IAAA,EACvD,mCAAA,OAAmCn/E,EAAC,GAAA,CAFlC,CAEqC,CAEnD,CAAC,CACH,CAEgB,SAAA06E,GAAgBwE,EAAoB95E,EAAY,CAE9D,QADMynC,EAAcqyC,EAAO,CAAC,EAAE,MAAK,EAC1Bl/E,EAAI,EAAGA,EAAIk/E,EAAO,OAAQl/E,IACjC6sC,EAAYznC,CAAI,GAAK85E,EAAOl/E,CAAC,EAAEoF,CAAI,EAErC,OAAOynC,CACT,CClCA,IAAYuyC,IAAZ,SAAYA,EAAgB,CAC1BA,EAAAA,EAAA,eAAA,CAAA,EAAA,iBACAA,EAAAA,EAAA,aAAA,CAAA,EAAA,eACAA,EAAAA,EAAA,YAAA,CAAA,EAAA,cACAA,EAAAA,EAAA,WAAA,CAAA,EAAA,aACAA,EAAAA,EAAA,WAAA,CAAA,EAAA,aACAA,EAAAA,EAAA,WAAA,CAAA,EAAA,YACF,GAPYA,KAAAA,GAOX,CAAA,EAAA,WAEeC,GACZC,EAAoBj+E,EAAiBk+E,EAAoB,CAK3D,IAAI1yC,EAAwB,IAAI,MAChC,GAAI0yC,GAAc,MAAQl+E,GAAS,KACjC,OAAOwrC,EAGT,GAAIxrC,GAAS,KAEX,KAAOwrC,EAAY,OAASyyC,EAAaC,EAAW,QAClD1yC,EAAY,KAAK,EAAE,OAGrBA,EAAcxrC,EAAM,MAAK,EAE3B,GAAIk+E,GAAc,KAChB,OAAO1yC,EAGT,GAAIyyC,EAAaC,EAAW,SAAW1yC,EAAY,OACjD,MAAM,IAAI,MACN,4BAA4B,OAAAxrC,EAAK,qCAAA,EAAA,OAC7Bi+E,EACAC,EAAW,OAA4B,qBAAA,EAAA,OAAA1yC,EAAY,MAAM,CAAE,EAGrE,QAAS7sC,EAAI,EAAGA,EAAIu/E,EAAW,OAAQ,EAAEv/E,EAAG,CAC1C,IAAMw/E,EAAWD,EAAWv/E,CAAC,EACvBy/E,EACF5yC,EAAYA,EAAY,OAAS0yC,EAAW,OAASv/E,CAAC,EACpD0/E,EAAiB7yC,EAAY4yC,CAAmB,EAEtD,GAAID,GAAY,EACd,GAAIE,GAAkB,GACpB,GAAIA,IAAmBF,EACrB,MAAM,IAAI,MAAM,4BAAA,OACZn+E,EAAK,oCAAA,EAAA,OAAqCrB,EAAIs/E,EAAU,MAAA,EAAA,OACxDE,EAAQ,aAAA,EAAA,OAAcx/E,EAAIs/E,EAAU,MAAA,EAAA,OAAOI,CAAc,CAAE,OAGjE7yC,EAAY4yC,CAAmB,EAAID,CAGxC,CACD,OAAO3yC,CACT,CAEM,SAAU8yC,GAA2BC,EAAiC,SACpEC,EAAe,CACnB,eAAkBT,GAAiB,eACnC,aAAgBA,GAAiB,aACjC,YAAeA,GAAiB,YAChC,WAAcA,GAAiB,WAC/B,WAAcA,GAAiB,WAC/B,WAAcA,GAAiB,YAG3BpgF,EAA6B,CAAA,MACnC,QAAsB8gF,EAAAlgF,GAAAggF,CAAuB,EAAAG,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAA1C,IAAME,EAAOD,EAAA,MAChB,GAAIC,KAAWH,EACb7gF,EAAO,KAAK6gF,EAAaG,CAAoC,CAAC,MAE9D,MAEH,mGAED,OAAOhhF,CACT,CAEM,SAAUihF,GAAcx+B,EAAqC,CACjE,OAAIA,EAAkB,SAAW,EACxB,EAELA,EAAkB,CAAC,IAAM29B,GAAiB,eACrC39B,EAAkB,OAAS,EAE7BA,EAAkB,MAC3B,CAEgB,SAAAy+B,GACZC,EAA6BZ,EAAoB,CACnD,GAAI,EAAAY,GAAqB,MAAQZ,GAAc,MAI/C,KAAMa,EAAeD,EAAkB,OACjCE,EAAcd,EAAW,OAC/B,GAAIa,GAAgBC,EAClB,MAAM,IAAI,MAAM,sBAAA,OACZF,EAAiB,sCAAA,EAAA,OACjBZ,EAAU,0CAAA,EAAA,OACVa,EAAY,2DAAA,EAAA,OACZC,EAAW,GAAA,CAAG,EAEpB,QAASrgF,EAAI,EAAGA,EAAI,KAAK,IAAIogF,EAAcC,EAAc,CAAC,EAAG,EAAErgF,EAAG,CAChE,IAAMsgF,EAAaH,EAAkBngF,CAAC,EAChCw/E,EAAWD,EAAWv/E,EAAI,CAAC,EACjC,GAAIsgF,GAAc,GAAKd,GAAY,GAAKc,IAAe,GACnDA,IAAed,EACjB,MAAM,IAAI,MAAM,sBACZ,OAAAW,EAAiB,6CAAA,EAAA,OACjBZ,EAAU,wCAAA,EAAA,OACVv/E,EAAImgF,EAAkB,OACtB,MAAA,EAAA,OAAAG,EACA,4CAAA,EAAA,OAAAtgF,EAAImgF,EAAkB,OAAa,MAAA,EAAA,OAAAX,CAAQ,CAAE,CAEpD,EACH,CClHO,IAAMe,GAAwB,GAS/B,SAAUC,GAAyBC,EAAc,CACrD,OAAIA,GAAUF,GACLE,EAEF55E,GAAe45E,EAAQ,KAAK,MAAM,KAAK,KAAKA,CAAM,CAAC,CAAC,CAC7D,UCnBgBC,GACZjlB,EAAiCklB,EACjCC,EAAkB,CACpB,IAAMC,EACFD,GAAc,OAAOnlB,GAAW,SAAWA,EAASA,EAAO,CAAC,GAC1DqlB,EACFH,GAAe,OAAOllB,GAAW,SAAWA,EAASA,EAAO,CAAC,GACjE,MAAO,CAAColB,EAASC,CAAO,CAC1B,CCDM,SAAUC,GACZngE,EAAsB2nB,EAAsBE,EAC5Cu4C,EAAmB,CAAnBA,IAAA,SAAAA,EAAmB,IACrB,IAAIC,EAAqB,CAAA,EACzB,GAAID,EACFC,EAAWA,EAAS,OAAO14C,EAAW,MAAM,CAAC,CAAC,EAC9C04C,EAAS,KAAKrgE,EAAW,CAAC,EAAI6nB,CAAI,EAClCw4C,EAAWA,EAAS,OAAOrgE,EAAW,MAAM,CAAC,CAAC,MACzC,CACLqgE,EAAWA,EAAS,OAAOrgE,EAAW,CAAC,CAAC,EAExC,QADMsgE,EAAgB34C,EAAW,OACxBvoC,EAAI,EAAGA,EAAIkhF,EAAe,EAAElhF,EACnCihF,EACIA,EAAS,OAAO,CAACrgE,EAAW5gB,EAAI,CAAC,EAAIuoC,EAAWvoC,CAAC,EAAGuoC,EAAWvoC,CAAC,CAAC,CAAC,EAExEihF,EAAWA,EAAS,OAAOrgE,EAAW,MAAMsgE,EAAgB,CAAC,CAAC,CAC/D,CACD,OAAOD,CACT,UAWgBE,GACZC,EAAsBC,EACtBL,EAAmB,CAAnBA,IAAA,SAAAA,EAAmB,IACrB,IAAMM,EAAW,CAAA,EACjB,GAAIN,EAAc,CAChBM,EAAS,KAAKD,CAAc,EAC5B,QAASrhF,EAAIqhF,EAAiB,EAAGrhF,EAAIohF,EAAc,EAAEphF,EAC/CA,GAAK,EAAIqhF,GACXC,EAAS,KAAKthF,CAAC,EACfshF,EAAS,KAAKthF,GAAKqhF,EAAiB,EAAE,GAEtCC,EAAS,KAAKthF,CAAC,CAGpB,KAAM,CAGL,QAFMuhF,EAAsB,CAAA,EACtBC,EAAqB,CAAA,EAClBxhF,EAAI,EAAGA,EAAIohF,EAAc,EAAEphF,EAC9BA,GAAKqhF,EAAiB,EAAI,GAAKrhF,EAAI,IAAM,EAC3CwhF,EAAmB,KAAKxhF,CAAC,EAEzBuhF,EAAoB,KAAKvhF,CAAC,EAG9BshF,EAAS,KAAI,MAAbA,EAAQjhF,GAAA,CAAA,EAAAJ,EAASshF,CAAmB,EAAE,EAAA,CAAA,EACtCD,EAAS,KAAK,CAAC,EACfA,EAAS,KAAI,MAAbA,EAAQjhF,GAAA,CAAA,EAAAJ,EAASuhF,CAAkB,EAAE,EAAA,CAAA,CACtC,CACD,OAAOF,CACT,CAWM,SAAUG,GACZ7gE,EAAsB2nB,EAAsBE,EAC5Cu4C,EAAmB,CAAnBA,IAAA,SAAAA,EAAmB,IACrB,IAAMU,EAAmB,CAAA,EAErBV,EACFU,EAAiB,KAAK9gE,EAAW,CAAC,EAAI6nB,CAAI,EAE1Ci5C,EAAiB,KAAK9gE,EAAW,CAAC,EAAI6nB,CAAI,EAG5C,QAASzoC,EAAI,EAAGA,EAAI4gB,EAAW,OAAQ,EAAE5gB,EACnCA,GAAKuoC,EAAW,OACdy4C,EACFU,EAAiB,KAAKn5C,EAAWvoC,EAAI,CAAC,EAAI4gB,EAAW5gB,CAAC,CAAC,EAEvD0hF,EAAiB,KAAK9gE,EAAW5gB,CAAC,EAAIuoC,EAAWvoC,EAAI,CAAC,CAAC,EAGzD0hF,EAAiB,KAAK9gE,EAAW5gB,CAAC,CAAC,EAIvC,OAAO0hF,CACT,CAMgB,SAAAC,GACZn5C,EAAmBD,EAAkB,CAEvC,QADMq5C,EAAmB,CAAC,CAAC,EAClB5hF,EAAI,EAAGA,EAAIuoC,EAAY,EAAEvoC,EAChC4hF,EAAiB,KAAKp5C,EAAMxoC,CAAC,EAAE,CAAC,CAAC,EAEnC,OAAO4hF,CACT,UAagBC,GACZC,EAA0Bt5C,EAAmBD,EAAkB,CAEjE,QADML,EAAY45C,EAAe,MAAM,EAAG,CAAC,EAClC9hF,EAAI,EAAGA,EAAIuoC,EAAY,EAAEvoC,EAChCkoC,EAAU,KAAK45C,EAAe9hF,EAAI,CAAC,EAAIwoC,EAAMxoC,CAAC,EAAE,CAAC,EAAIwoC,EAAMxoC,CAAC,EAAE,CAAC,CAAC,EAGlE,OAAOkoC,CACT,CCvIO,IAAM65C,GAAkB,mBAClBC,GAAa,mBCDnB,IAAMC,GAAQ,SACRC,GAAS,WACTC,GAAS,YACTC,GAAS,YACTC,GAAS,aACTC,GAAS,YCUN,SAAAC,GACZpzD,EAAoBC,EAAkB,CACxC,GAAID,EAAK,SAAWC,EAAK,OACvB,MAAM,IAAI,MACN,gEACA,GAAG,OAAAD,EAAK,OAAM,UAAA,EAAA,OAAWC,EAAK,OAAS,GAAA,CAAA,EAG7C,QADMpwB,EAAS,IAAI,aAAamwB,EAAK,OAAS,CAAC,EACtCnvB,EAAI,EAAGA,EAAIhB,EAAO,OAAQgB,GAAK,EACtChB,EAAOgB,CAAC,EAAImvB,EAAKnvB,EAAI,CAAC,EACtBhB,EAAOgB,EAAI,CAAC,EAAIovB,EAAKpvB,EAAI,CAAC,EAE5B,OAAOhB,CACT,CAgBM,SAAUwjF,GAAuBhzD,EAAqB,CAI1D,QAFML,EAAO,IAAI,aAAaK,EAAQ,OAAS,CAAC,EAC1CJ,EAAO,IAAI,aAAaI,EAAQ,OAAS,CAAC,EACvCxvB,EAAI,EAAGA,EAAIwvB,EAAQ,OAAQxvB,GAAK,EACvCmvB,EAAKnvB,EAAI,CAAC,EAAIwvB,EAAQxvB,CAAC,EACvBovB,EAAKpvB,EAAI,CAAC,EAAIwvB,EAAQxvB,EAAI,CAAC,EAE7B,MAAO,CAAC,KAAImvB,EAAE,KAAIC,CAAA,CACpB,CAMM,SAAUqzD,GAAqBjzD,EAAqB,CAKxD,QAHMloB,EAAM,KAAK,KAAKkoB,EAAQ,OAAS,CAAC,EAClCL,EAAO,IAAI,aAAa7nB,CAAG,EAC3B8nB,EAAO,IAAI,aAAa9nB,CAAG,EACxBtH,EAAI,EAAGA,EAAIwvB,EAAQ,OAAQxvB,GAAK,EACvCmvB,EAAK,KAAK,MAAMnvB,EAAI,CAAC,CAAC,EAAIwvB,EAAQxvB,CAAC,EACnCovB,EAAK,KAAK,MAAMpvB,EAAI,CAAC,CAAC,EAAIwvB,EAAQxvB,EAAI,CAAC,EAEzC,MAAO,CAAC,KAAImvB,EAAE,KAAIC,CAAA,CACpB,CAMM,SAAUszD,GAAoBlzD,EAAqB,CAKvD,QAHMloB,EAAM,KAAK,MAAMkoB,EAAQ,OAAS,CAAC,EACnCL,EAAO,IAAI,aAAa7nB,CAAG,EAC3B8nB,EAAO,IAAI,aAAa9nB,CAAG,EACxBtH,EAAI,EAAGA,EAAIwvB,EAAQ,OAAQxvB,GAAK,EACvCmvB,EAAK,KAAK,MAAMnvB,EAAI,CAAC,CAAC,EAAIwvB,EAAQxvB,CAAC,EACnCovB,EAAK,KAAK,MAAMpvB,EAAI,CAAC,CAAC,EAAIwvB,EAAQxvB,EAAI,CAAC,EAEzC,MAAO,CAAC,KAAImvB,EAAE,KAAIC,CAAA,CACpB,CAOgB,SAAAuzD,GACZnzD,EAAuB5tB,EAAa,CACtC,IAAMutB,EAAOK,EAAQ5tB,EAAQ,CAAC,EACxBwtB,EAAOI,EAAQ5tB,EAAQ,EAAI,CAAC,EAClC,MAAO,CAAC,KAAIutB,EAAE,KAAIC,CAAA,CACpB,CAQM,SAAUwzD,GACZj7E,EAAkBwnB,EAAcC,EAAcxtB,EAAa,CAC7D+F,EAAK/F,EAAQ,CAAC,EAAIutB,EAClBxnB,EAAK/F,EAAQ,EAAI,CAAC,EAAIwtB,CACxB,CAKgB,SAAAyzD,GACZpjF,EAAWqjF,EAAgB,CAG7B,QAFM3zD,EAAO,IAAI,aAAa1vB,EAAI,CAAC,EAC7B2vB,EAAO,IAAI,aAAa3vB,EAAI,CAAC,EAC1BO,EAAI,EAAGA,EAAI,KAAK,KAAKP,EAAI,CAAC,EAAGO,IAAK,CACzC,IAAMkC,GAAK4gF,EAAU,EAAI,IAAM,KAAK,IAAM9iF,EAAIP,GAC9C0vB,EAAKnvB,CAAC,EAAI,KAAK,IAAIkC,CAAC,EACpBktB,EAAKpvB,CAAC,EAAI,KAAK,IAAIkC,CAAC,CACrB,CACD,MAAO,CAAC,KAAIitB,EAAE,KAAIC,CAAA,CACpB,UAKgB2zD,GACZt7D,EAAWhoB,EAAWqjF,EAAgB,CACxC,IAAM5gF,GAAK4gF,EAAU,EAAI,IAAM,KAAK,IAAMr7D,EAAIhoB,GACxC0vB,EAAO,KAAK,IAAIjtB,CAAC,EACjBktB,EAAO,KAAK,IAAIltB,CAAC,EACvB,MAAO,CAAC,KAAIitB,EAAE,KAAIC,CAAA,CACpB,CC/HA,IAAM4zD,GAAQ,KACRC,GAAc,MACdC,GAAQ,IACRC,GAAW,MAeD,SAAAC,GAAqB7xC,EAAkB8xC,EAAkB,CAKvE9xC,EAAWA,EAAS,QAAQ,MAAO,EAAE,EACrC,IAAM+xC,GACD/xC,EAAS,OAASA,EAAS,QAAQ0xC,GAAa,EAAE,EAAE,QACrDD,GAAM,OACV,GAAIM,EAAY,EACd,MAAM,IAAI,MAAM,+CAA+C,EAC1D,GAAIA,EAAY,EACrB,MAAM,IAAI,MAAM,6CAAA,OAA6CN,GAAK,KAAA,CAAK,EAEnE,IAAA95E,EAAAjJ,EAA8BsxC,EAAS,MAAMyxC,EAAK,EAAC,CAAA,EAAlDO,EAAWr6E,EAAA,CAAA,EAAEs6E,EAAYt6E,EAAA,CAAA,EAChClG,EACIugF,EAAY,QAAQJ,EAAQ,IAAM,GAClC,UAAA,CAAM,MAAA,2BAA2B,OAAAA,GAAQ,0BAAA,CAAnC,CAA6D,EACvE,IAAMM,EAAaF,EAAY,MAAML,EAAK,EACpCQ,EAAYD,EAAW,OAC7B,GAAIJ,IAAeK,EACjB,MAAM,IAAI,MACN,YAAA,OAAYA,EAAqC,2BAAA,EAAA,OAAAL,CAAU,CAAE,EAEnE,GAAIK,EAAY,EACd,MAAM,IAAI,MACN,+DAA+D,EAIrE,QADMC,EAAoB,CAAA,aACjB3jF,EAAC,CACR,IAAM4jF,EAAUJ,EAAaxjF,CAAC,EAC9B,GAAI,CAACyjF,EAAW,KAAK,SAAAI,EAAS,CAAI,OAAAA,EAAU,QAAQD,CAAO,IAAM,EAAE,CAAA,EACjE,MAAM,IAAI,MACN,uCAAA,OAAuCA,EAAU,GAAA,EACjD,sCAAsC,EAExCD,EAAQ,QAAQC,CAAO,IAAM,IAC/BD,EAAQ,KAAKC,CAAO,GARf5jF,EAAI,EAAGA,EAAIwjF,EAAa,OAAQ,EAAExjF,IAAlCA,CAAC,EAWV,QAASA,EAAI,EAAGA,EAAIujF,EAAY,OAAQ,EAAEvjF,EAAG,CAC3C,IAAM4jF,EAAUL,EAAYvjF,CAAC,EACzB2jF,EAAQ,QAAQC,CAAO,IAAM,IAAMA,IAAYV,IACjDS,EAAQ,KAAKC,CAAO,CAEvB,CAGD,QADME,EAAqB,IAAI,MAAgBL,EAAW,MAAM,EACvDzjF,EAAI,EAAGA,EAAI0jF,EAAW,EAAE1jF,EAAG,CAClC,GAAI,IAAI,IAAIyjF,EAAWzjF,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,OAASyjF,EAAWzjF,CAAC,EAAE,OAC1D,MAAM,IAAI,MACN,2CAAA,OAA2CyjF,EAAWzjF,CAAC,EAAK,IAAA,EAC5D,6DAA6D,EAEnE8jF,EAAO9jF,CAAC,EAAI,CAAA,EACZ,QAAS2F,EAAI,EAAGA,EAAI89E,EAAWzjF,CAAC,EAAE,OAAQ,EAAE2F,EAC1Cm+E,EAAO9jF,CAAC,EAAE,KAAK2jF,EAAQ,QAAQF,EAAWzjF,CAAC,EAAE2F,CAAC,CAAC,CAAC,CAEnD,CAKD,QAHMmuD,EAAU6vB,EAAQ,OAClBI,EAAaP,EAAa,OAC1BQ,EAAuB,CAAA,EACpBhkF,EAAI+jF,EAAY/jF,EAAI8zD,EAAS,EAAE9zD,EACtCgkF,EAAW,KAAKhkF,CAAC,EAEnB,MAAO,CAAC,QAAO2jF,EAAE,WAAUK,EAAE,OAAMF,CAAA,CACrC,CAagB,SAAAG,GAAqBC,EAAeJ,EAAgB,CAElE,IAAIK,EAA+B,IAAI,MAAcD,CAAK,EAC1DC,EAAmB,KAAK,EAAE,EAC1B,QAASnkF,EAAI,EAAGA,EAAI8jF,EAAO,OAAQ,EAAE9jF,EACnCmkF,EAAmBL,EAAO9jF,CAAC,CAAC,EAAIA,EAGlC,QADMu0C,EAAuB,CAAA,EACpBv0C,EAAI,EAAGA,EAAIkkF,EAAO,EAAElkF,EACvBmkF,EAAmBnkF,CAAC,IAAM,IAC5Bu0C,EAAW,KAAKv0C,CAAC,EAGrB,OAAAmkF,EAAqBA,EAAmB,OAAO,SAAArmF,EAAC,CAAI,OAAAA,IAAM,EAAN,CAAQ,EACrD,CAAC,mBAAkBqmF,EAAE,WAAU5vC,CAAA,CACxC,UAMgB6vC,GACZF,EAAeJ,EAAoBp5D,EAAiB,CAEtD,QADM25D,EAAqB,IAAI,MAAcH,CAAK,aACzClkF,EAAC,CAER,QADMqB,EAAkBqpB,EAAQ1qB,CAAC,EAAE,iBAC1B2F,EAAC,CACJ0+E,EAASP,EAAO9jF,CAAC,EAAE2F,CAAC,CAAC,IAAM,OAC7B0+E,EAASP,EAAO9jF,CAAC,EAAE2F,CAAC,CAAC,EAAItE,EAAMsE,CAAC,EAEhC3C,EACIqhF,EAASP,EAAO9jF,CAAC,EAAE2F,CAAC,CAAC,IAAMtE,EAAMsE,CAAC,EAClC,UAAA,CAAM,MAAA,sBAAA,OAAsB0+E,EAASP,EAAO9jF,CAAC,EAAE2F,CAAC,CAAC,EAAC,WAAA,EAAA,OAAYA,EAAI,GAAA,EAC9D,mBAAA,OAAmB,KAAK,UAAUtE,CAAK,EAAK,IAAA,EAC5C,qBAAqB,OAAAA,EAAMsE,CAAC,CAAC,CAF3B,CAE6B,GARlCA,EAAI,EAAGA,EAAIm+E,EAAO9jF,CAAC,EAAE,OAAQ,EAAE2F,IAA/BA,CAAC,GAFH3F,EAAI,EAAGA,EAAI0qB,EAAQ,OAAQ,EAAE1qB,IAA7BA,CAAC,CAcZ,CAiBgB,SAAAskF,GAAqBN,EAAsBF,EAAkB,SAErEnlE,EAAiBqlE,EACjBO,EAAoB,CAAA,EACtBC,EAAS,EACTR,EAAW,SAAW,GAExBrlE,EAAK,KAAK,EAAE,EAEd6lE,EAASR,EAAW,OAAS,EAC7B,QAAS,EAAI,EAAG,EAAIQ,EAAQ,EAAE,EAC5BD,EAAM,KAAK,CAAA,CAAE,EAGf,QADME,EAAgC,CAAA,EAC7B,EAAI,EAAG,EAAI9lE,EAAK,OAAQ,EAAE,EAAG,CACpC,IAAM+lE,EAAY/lE,EAAK,CAAC,EAClBgmE,EAAcC,GAAiBd,EAAQY,CAAS,MACtD,QAAwBG,GAAAC,EAAA,OAAAllF,GAAA+kF,CAAW,GAAAI,EAAAF,EAAA,KAAA,EAAE,CAAAE,EAAA,KAAAA,EAAAF,EAAA,KAAA,EAAA,CAAhC,IAAMG,EAASD,EAAA,MACdN,EAAoB,QAAQO,CAAS,IAAM,KAC7CT,EAAM,CAAC,EAAE,KAAKS,CAAS,EACvBP,EAAoB,KAAKO,CAAS,EAErC,mGACF,CACD,MAAO,CAAC,KAAIrmE,EAAE,MAAK4lE,CAAA,CACrB,CAGM,SAAUU,GAAsBtyB,EAAc,CAClD,OAAOA,EAAK,MAAM,SAACxjB,EAAavtC,EAAkB,CAAA,OAAAutC,IAAQvtC,CAAR,CAAa,CACjE,CAEA,SAASgjF,GAAiBd,EAAoB30C,EAAW,CAEvD,QADMw1C,EAAwB,CAAA,EACrB3kF,EAAI,EAAGA,EAAI8jF,EAAO,OAAQ,EAAE9jF,GAC/B8jF,EAAO9jF,CAAC,EAAE,SAAW,GAAK8jF,EAAO9jF,CAAC,EAAE,QAAQmvC,CAAG,IAAM,IAAMA,IAAQ,KACrEw1C,EAAY,KAAK3kF,CAAC,EAGtB,OAAO2kF,CACT,UClMgBO,GACZhjF,EAAsBmrD,EACtBjoD,EAAQ,CAARA,IAAA,SAAAA,EAAQ,GACV,IAAI+/E,EAAa,CAAA,EACjB,GAAI,OAAQ93B,GAAqB,SAC/BrqD,EACId,EAAE,MAAMkD,CAAI,EAAIioD,IAAoB,EACpC,UAAM,CAAA,MAAA,+CAAA,CAA+C,EACzD83B,EACI,IAAI,MAAM93B,CAAe,EAAE,KAAKnrD,EAAE,MAAMkD,CAAI,EAAIioD,CAAe,MAC9D,CACL,IAAM+3B,EAAY/3B,EAAgB,OAAO,SAAChJ,EAAO5lD,EAAK,CACpD,OAAIA,IAAU,KACZ4lD,GAAS,GAEJA,GACN,CAAC,EACJrhD,EACIoiF,GAAa,EACb,UAAM,CAAA,MAAA,yDAAyD,CAAA,EACnE,IAAMC,EAAWh4B,EAAgB,QAAQ,EAAE,EAG3C,GAAIg4B,IAAa,GAAI,CACnB,IAAMtjB,EAAQ1U,EAAgB,OAAO,SAACxqD,EAAG9E,EAAM,CAAA,OAAAA,EAAI,EAAI8E,EAAI9E,EAAI8E,CAAC,CAAA,EAChEwqD,EAAgBg4B,CAAQ,EAAInjF,EAAE,MAAMkD,CAAI,EAAI28D,CAC7C,CACD/+D,EACId,EAAE,MAAMkD,CAAI,IAAMioD,EAAgB,OAAO,SAACxqD,EAAG9E,EAAC,CAAK,OAAA8E,EAAI9E,CAAC,CAAA,EACxD,UAAA,CAAM,MAAA,6DAAA,CAA6D,EACvEonF,EAAa93B,CACd,CAED,OAAO83B,CACT,CCrCM,SAAUG,GACZC,EAAqB,CACvB,MAAO;uBAAA,OACcA,CAAa,CACpC,CAQgB,SAAAC,GACZ5jF,EAAenD,EAAa,CAC9B,MAAO,WAAW,OAAAmD,EAAyB,mBAAA,EAAA,OAAAnD,EAAK,MAAA,CAClD,UASgBgnF,GACZ7jF,EAAenD,EAAeykD,EAAa,CAC7C,MAAO,WAAA,OAAWthD,EAAK,mBAAA,EAAA,OAAoBnD,EAAY,MAAA,EAAA,OAAAykD,CAAK,CAC9D,CCzBgB,SAAAwiC,GACZC,EAAcC,EAAY,CAC5B,MAAO,iDAAiD,OAAAD,EAAY,OAAA,EAAA,OAAAC,CAAI,CAC1E,CAQgB,SAAAC,GACZ12C,EAAa1wC,EAAa,CAC5B,MAAO,QAAQ,OAAA0wC,EAAiC,6BAAA,EAAA,OAAA1wC,CAAK,CACvD,UAMgBqnF,IAAoD,CAClE,MAAO,+GAET,CAQgB,SAAAC,GACZnlE,EAAsBisB,EAAqB,CAC7C,IAAMm5C,EAAYviF,GAAcmd,CAAU,EACpCyqC,EAAa5nD,GAAcopC,CAAW,EAC5C,MAAO,2CAAA,OAA2Cm5C,EAE9C;gEAAA,EAAA,OAAA36B,EAAU,eAAA,EAAA,OAAgBzqC,EAAU,gBAAA,EAAA,OAAiBisB,CAAW,CACtE,CAQgB,SAAAo5C,GACZrlE,EAAsBisB,EAAqB,CAC7C,IAAMm5C,EAAYviF,GAAcmd,CAAU,EACpCyqC,EAAa5nD,GAAcopC,CAAW,EAC5C,MAAO,qCAAA,OACHm5C,EACA,6CAAA,EAAA,OAAA36B,EAAU,eAAA,EAAA,OAAgBzqC,EAAU,eAAA,EAAA,OAAgBisB,CAAW,CACrE,UCxDgBq5C,IAAuD,CACrE,MAAO,0BACT,UAMgBC,IAA4D,CAC1E,MAAO,gCACT,CAQgB,SAAAC,GACZC,EAAmBjiD,EAAkB,CACvC,MAAO,cAAc,OAAAiiD,EACjB,oBAAA,EAAA,OAAAjiD,EAAU,qDAAA,CAChB,UASgBkiD,GACZ1kF,EAAe2kF,EAAoBriD,EAAiB,CACtD,MAAO,gBAAA,OAAgBtiC,EAAK,OAAA,EAAA,OAAQ2kF,EAChC,oBAAA,EAAA,OAAAriD,EAAS,GAAA,CACf,CC3BgB,SAAAsiD,GACZ/F,EAAgBtvB,EAAmB,CACrC,IAAIx6C,EAAO,GACPiF,EASJ,IAPI6kE,GAAUF,IACZ3kE,EAAM6kE,EACN9pE,EAAO,IAEPiF,EAAM/U,GAAe45E,EAAQ,KAAK,MAAM,KAAK,KAAKA,CAAM,CAAC,CAAC,EAGrD,CAAC9pE,GACFiF,EAAMu1C,GAAev1C,IAAQ6kE,EAC/B9pE,EAAO,GAEPiF,EAAM/U,GAAe45E,EAAQ7kE,EAAM,CAAC,EAGxC,OAAOA,CACT,UAEgB8+D,GACZpoC,EAAkBltC,EAAc+rD,EAAmB,CAGrD,QAFM5tB,EAAW,CAAA,EACXl+B,EAAOitC,EAAO,OACXnD,EAAM,EAAGA,EAAM9pC,EAAM8pC,IACxBA,IAAQ/pC,EACVm+B,EAAS,KAAK+O,EAAOnD,CAAG,CAAC,EAEzB5L,EAAS,KAAK4tB,CAAW,EAG7B,OAAO5tB,CACT,CAUM,SAAUkjD,GACZvkF,EAAe8rB,EAAqB5oB,EACpCiwC,EAAiB,CACnB,IAAM0a,EAAc/hC,EAAQ,MAAM,OAC5B8uD,EAAQ56E,EAAE,MAAM,OAEtB,GAAImzC,IAAc,IACZA,EAAY,CAAC0a,GAAe1a,EAAY0a,GAC1C,MAAM,IAAI,MAAM,sCAAsC,OAAAA,EAClD,IAAA,EAAA,OAAAA,EAAyB,aAAA,EAAA,OAAA1a,CAAS,CAAE,EAQ5C,GAJIA,EAAY,IACdA,GAAa0a,GAGX1a,EAAYynC,EACd,MAAM,IAAI,MAAM,cAAA,OAAcznC,EAC5B;KAAA,EAAA,OAAAynC,EAAS,IAAA,CAAA,EAGb,GAAI13E,EAAOiwC,EACT,MAAM,IAAI,MAAM,cAAA,OACZA,EAAkD,wCAAA,EAAA,OAAAjwC,EAAQ,IAAA,CAAA,EAGhE,QAASpF,EAAI,EAAGA,EAAIq1C,EAAW,EAAEr1C,EAC/B,GAAIkC,EAAE,MAAMlC,CAAC,IAAMguB,EAAQ,MAAMhuB,CAAC,EAChC,MAAM,IAAI,MACN,WAAA,OAAWA,EAAO,KAAA,EAAA,OAAAkC,EAAE,MAAMlC,CAAC,EACvB,oCAAA,EAAA,OAAAA,EAAO,KAAA,EAAA,OAAAguB,EAAQ,MAAMhuB,CAAC,EAAI,GAAA,CAAA,EAUtC,QAPMkI,EAAUhG,EAAE,MAAMkD,CAAI,EAEtBynC,EAAwB,CAAA,EAC1BxK,EAAY,EACZqkD,EAAY,EACZx+C,EAAY,EAEPloC,EAAI,EAAGA,EAAIq1C,EAAW,EAAEr1C,EAC/B6sC,EAAY,KAAK3qC,EAAE,MAAMlC,CAAC,CAAC,EAC3BqiC,GAAangC,EAAE,MAAMlC,CAAC,EAGxB,QAASA,EAAIq1C,EAAWr1C,EAAIoF,EAAMpF,IAChC6sC,EAAY,KAAK3qC,EAAE,MAAMlC,CAAC,CAAC,EAC3B0mF,GAAaxkF,EAAE,MAAMlC,CAAC,EAGxB,QAASA,EAAIq1C,EAAWr1C,EAAI+vD,EAAa/vD,IACvC6sC,EAAY,KAAK7e,EAAQ,MAAMhuB,CAAC,CAAC,EAGnC,QAASA,EAAIoF,EAAO,EAAGpF,EAAI88E,EAAO98E,IAChC6sC,EAAY,KAAK3qC,EAAE,MAAMlC,CAAC,CAAC,EAC3BkoC,GAAahmC,EAAE,MAAMlC,CAAC,EAGxB,MAAO,CAAC,UAASqiC,EAAE,UAAS6F,EAAE,UAASw+C,EAAE,QAAOx+E,EAAE,YAAW2kC,CAAA,CAC/D,yGClFM,SAAU85C,GAAuB5gF,EAAkB,CACvD,GAAI,CAEF,OAAOA,EAAK,IAAI,SAAA1D,EAAG,CAAI,OAAAyc,GAAazc,CAAG,CAAhB,CAAiB,CACzC,OAAQmmB,EAAK,CACZ,MAAM,IAAI,MACN,4DAAA,OAA4DA,CAAG,CAAE,CACtE,CACH,CAEM,SAAUo+D,GAAuBC,EAAiB,CACtD,OAAOA,EAAQ,IAAI,SAAA/mF,EAAC,CAAI,OAAAse,GAAate,CAAC,CAAd,CAAe,CACzC,s0EExCAowE,GAAkB,syOCLlB,IAAM4W,GAAMC,GAAAA,IAAG,EAGfD,GAAI,aAAa,4BAA6B,UAAA,CAAM,MAAA,EAAA,EAAO,SAAAE,EAAU,CAC/DA,GACF,QAAQ,KACJ,+OAG0D,CAElE,CAAC,ECdD,IAAIC,GAAgB,SAASC,EAAGC,EAAC,CAC7B,OAAAF,GAAgB,OAAO,gBAClB,CAAE,UAAW,CAAA,CAAE,YAAc,OAAS,SAAUC,EAAGC,EAAC,CAAID,EAAE,UAAYC,CAAE,GACzE,SAAUD,EAAGC,EAAC,CAAI,QAASC,KAAKD,EAAO,OAAO,UAAU,eAAe,KAAKA,EAAGC,CAAC,IAAGF,EAAEE,CAAC,EAAID,EAAEC,CAAC,EAAE,EAC5FH,GAAcC,EAAGC,CAAC,CAC7B,EAEgB,SAAAE,GAAUH,EAAGC,EAAC,CAC1B,GAAI,OAAOA,GAAM,YAAcA,IAAM,KACjC,MAAM,IAAI,UAAU,uBAAyB,OAAOA,CAAC,EAAI,+BAA+B,EAC5FF,GAAcC,EAAGC,CAAC,EAClB,SAASG,GAAE,CAAK,KAAK,YAAcJ,CAAE,CACrCA,EAAE,UAAYC,IAAM,KAAO,OAAO,OAAOA,CAAC,GAAKG,EAAG,UAAYH,EAAE,UAAW,IAAIG,EACnF,CAwCM,SAAUC,GAAUC,EAASC,EAAYC,EAAGC,EAAS,CACvD,SAASC,EAAMC,EAAK,CAAI,OAAOA,aAAiBH,EAAIG,EAAQ,IAAIH,EAAE,SAAUI,EAAO,CAAIA,EAAQD,CAAK,CAAE,CAAE,CAAE,CAC1G,OAAO,IAAKH,IAAMA,EAAI,UAAU,SAAUI,EAASC,EAAM,CACrD,SAASC,EAAUH,EAAK,CAAI,GAAI,CAAEI,EAAKN,EAAU,KAAKE,CAAK,CAAC,CAAI,OAAQK,EAAG,CAAEH,EAAOG,CAAC,CAAI,CAAA,CACzF,SAASC,EAASN,EAAK,CAAI,GAAI,CAAEI,EAAKN,EAAU,MAASE,CAAK,CAAC,CAAI,OAAQK,EAAG,CAAEH,EAAOG,CAAC,CAAI,CAAA,CAC5F,SAASD,EAAKG,EAAM,CAAIA,EAAO,KAAON,EAAQM,EAAO,KAAK,EAAIR,EAAMQ,EAAO,KAAK,EAAE,KAAKJ,EAAWG,CAAQ,CAAE,CAC5GF,GAAMN,EAAYA,EAAU,MAAMH,EAASC,GAAc,CAAA,CAAE,GAAG,KAAI,CAAE,CACxE,CAAC,CACL,CAEgB,SAAAY,GAAYb,EAASc,EAAI,CACrC,IAAIC,EAAI,CAAE,MAAO,EAAG,KAAM,UAAA,CAAa,GAAIC,EAAE,CAAC,EAAI,EAAG,MAAMA,EAAE,CAAC,EAAG,OAAOA,EAAE,CAAC,CAAE,EAAI,KAAM,CAAA,EAAI,IAAK,CAAA,CAAE,EAAIC,EAAGC,EAAGF,EAAGG,EAC/G,OAAOA,EAAI,CAAE,KAAMC,EAAK,CAAC,EAAG,MAASA,EAAK,CAAC,EAAG,OAAUA,EAAK,CAAC,CAAC,EAAI,OAAO,QAAW,aAAeD,EAAE,OAAO,QAAQ,EAAI,UAAA,CAAa,OAAO,IAAK,GAAKA,EACvJ,SAASC,EAAKC,EAAC,CAAI,OAAO,SAAUC,EAAK,CAAA,OAAOb,EAAK,CAACY,EAAGC,CAAC,CAAC,CAAE,CAAG,CAChE,SAASb,EAAKc,EAAE,CACZ,GAAIN,EAAG,MAAM,IAAI,UAAU,iCAAiC,EAC5D,KAAOF,GAAG,GAAI,CACV,GAAIE,EAAI,EAAGC,IAAMF,EAAIO,EAAG,CAAC,EAAI,EAAIL,EAAE,OAAYK,EAAG,CAAC,EAAIL,EAAE,SAAcF,EAAIE,EAAE,SAAcF,EAAE,KAAKE,CAAC,EAAG,GAAKA,EAAE,OAAS,EAAEF,EAAIA,EAAE,KAAKE,EAAGK,EAAG,CAAC,CAAC,GAAG,KAAM,OAAOP,EAE3J,OADIE,EAAI,EAAGF,IAAGO,EAAK,CAACA,EAAG,CAAC,EAAI,EAAGP,EAAE,KAAK,GAC9BO,EAAG,CAAC,EAAC,CACT,IAAK,GAAG,IAAK,GAAGP,EAAIO,EAAI,MACxB,IAAK,GAAG,OAAAR,EAAE,QAAgB,CAAE,MAAOQ,EAAG,CAAC,EAAG,KAAM,EAAK,EACrD,IAAK,GAAGR,EAAE,QAASG,EAAIK,EAAG,CAAC,EAAGA,EAAK,CAAC,CAAC,EAAG,SACxC,IAAK,GAAGA,EAAKR,EAAE,IAAI,IAAG,EAAIA,EAAE,KAAK,IAAG,EAAI,SACxC,QACI,GAAMC,EAAID,EAAE,KAAM,EAAAC,EAAIA,EAAE,OAAS,GAAKA,EAAEA,EAAE,OAAS,CAAC,KAAOO,EAAG,CAAC,IAAM,GAAKA,EAAG,CAAC,IAAM,GAAI,CAAER,EAAI,EAAG,QAAW,CAC5G,GAAIQ,EAAG,CAAC,IAAM,IAAM,CAACP,GAAMO,EAAG,CAAC,EAAIP,EAAE,CAAC,GAAKO,EAAG,CAAC,EAAIP,EAAE,CAAC,GAAK,CAAED,EAAE,MAAQQ,EAAG,CAAC,EAAG,KAAQ,CACtF,GAAIA,EAAG,CAAC,IAAM,GAAKR,EAAE,MAAQC,EAAE,CAAC,EAAG,CAAED,EAAE,MAAQC,EAAE,CAAC,EAAGA,EAAIO,EAAI,KAAQ,CACrE,GAAIP,GAAKD,EAAE,MAAQC,EAAE,CAAC,EAAG,CAAED,EAAE,MAAQC,EAAE,CAAC,EAAGD,EAAE,IAAI,KAAKQ,CAAE,EAAG,KAAQ,CAC/DP,EAAE,CAAC,GAAGD,EAAE,IAAI,IAAG,EACnBA,EAAE,KAAK,IAAG,EAAI,QACrB,CACDQ,EAAKT,EAAK,KAAKd,EAASe,CAAC,CAC5B,OAAQL,EAAG,CAAEa,EAAK,CAAC,EAAGb,CAAC,EAAGQ,EAAI,CAAI,QAAS,CAAED,EAAID,EAAI,CAAI,CAC1D,GAAIO,EAAG,CAAC,EAAI,EAAG,MAAMA,EAAG,CAAC,EAAG,MAAO,CAAE,MAAOA,EAAG,CAAC,EAAIA,EAAG,CAAC,EAAI,OAAQ,KAAM,EAAI,EAEtF,CAkBM,SAAUC,GAASC,EAAC,CACtB,IAAIC,EAAI,OAAO,QAAW,YAAc,OAAO,SAAUC,EAAID,GAAKD,EAAEC,CAAC,EAAGE,EAAI,EAC5E,GAAID,EAAG,OAAOA,EAAE,KAAKF,CAAC,EACtB,GAAIA,GAAK,OAAOA,EAAE,QAAW,SAAU,MAAO,CAC1C,KAAM,UAAA,CACF,OAAIA,GAAKG,GAAKH,EAAE,SAAQA,EAAI,QACrB,CAAE,MAAOA,GAAKA,EAAEG,GAAG,EAAG,KAAM,CAACH,CAAC,IAG7C,MAAM,IAAI,UAAUC,EAAI,0BAA4B,iCAAiC,CACzF,CAEgB,SAAAG,EAAOJ,EAAGJ,EAAC,CACvB,IAAIM,EAAI,OAAO,QAAW,YAAcF,EAAE,OAAO,QAAQ,EACzD,GAAI,CAACE,EAAG,OAAOF,EACf,IAAIG,EAAID,EAAE,KAAKF,CAAC,EAAGK,EAAGC,EAAK,CAAA,EAAIrB,EAC/B,GAAI,CACA,MAAQW,IAAM,QAAUA,KAAM,IAAM,EAAES,EAAIF,EAAE,KAAI,GAAI,MAAMG,EAAG,KAAKD,EAAE,KAAK,CAC5E,OACME,EAAO,CAAEtB,EAAI,CAAE,MAAOsB,CAAK,CAAK,QAC/B,CACJ,GAAI,CACIF,GAAK,CAACA,EAAE,OAASH,EAAIC,EAAE,SAAYD,EAAE,KAAKC,CAAC,CAClD,QACO,CAAE,GAAIlB,EAAG,MAAMA,EAAE,KAAQ,CACpC,CACD,OAAOqB,CACX,UAkBgBE,GAAcC,EAAIC,EAAMC,EAAI,CACxC,GAAIA,GAAQ,UAAU,SAAW,EAAG,QAASR,EAAI,EAAGS,EAAIF,EAAK,OAAQJ,EAAIH,EAAIS,EAAGT,KACxEG,GAAM,EAAEH,KAAKO,MACRJ,IAAIA,EAAK,MAAM,UAAU,MAAM,KAAKI,EAAM,EAAGP,CAAC,GACnDG,EAAGH,CAAC,EAAIO,EAAKP,CAAC,GAGtB,OAAOM,EAAG,OAAOH,GAAM,MAAM,UAAU,MAAM,KAAKI,CAAI,CAAC,CAC3D,CClJA,IAAYG,IAAZ,SAAYA,EAAQ,CAOlBA,EAAAA,EAAA,WAAA,CAAA,EAAA,aAIAA,EAAAA,EAAA,SAAA,CAAA,EAAA,WACAA,EAAAA,EAAA,UAAA,CAAA,EAAA,YACAA,EAAAA,EAAA,SAAA,CAAA,EAAA,WACAA,EAAAA,EAAA,SAAA,CAAA,EAAA,WACAA,EAAAA,EAAA,SAAA,CAAA,EAAA,WACAA,EAAAA,EAAA,QAAA,CAAA,EAAA,UACAA,EAAAA,EAAA,UAAA,CAAA,EAAA,YACAA,EAAAA,EAAA,aAAA,CAAA,EAAA,eACAA,EAAAA,EAAA,SAAA,CAAA,EAAA,WACAA,EAAAA,EAAA,QAAA,EAAA,EAAA,UACAA,EAAAA,EAAA,SAAA,EAAA,EAAA,WACAA,EAAAA,EAAA,UAAA,EAAA,EAAA,YACAA,EAAAA,EAAA,UAAA,EAAA,EAAA,YACAA,EAAAA,EAAA,YAAA,EAAA,EAAA,cACAA,EAAAA,EAAA,UAAA,EAAA,EAAA,YACAA,EAAAA,EAAA,WAAA,EAAA,EAAA,aACAA,EAAAA,EAAA,UAAA,EAAA,EAAA,YACAA,EAAAA,EAAA,cAAA,EAAA,EAAA,gBACAA,EAAAA,EAAA,QAAA,EAAA,EAAA,UACAA,EAAAA,EAAA,YAAA,EAAA,EAAA,cACAA,EAAAA,EAAA,WAAA,EAAA,EAAA,aACAA,EAAAA,EAAA,UAAA,EAAA,EAAA,YACAA,EAAAA,EAAA,UAAA,EAAA,EAAA,YAIAA,EAAAA,EAAA,aAAA,GAAA,EAAA,eACAA,EAAAA,EAAA,cAAA,GAAA,EAAA,gBACAA,EAAAA,EAAA,aAAA,GAAA,EAAA,eACAA,EAAAA,EAAA,aAAA,GAAA,EAAA,eACAA,EAAAA,EAAA,aAAA,GAAA,EAAA,eACAA,EAAAA,EAAA,YAAA,GAAA,EAAA,cACAA,EAAAA,EAAA,cAAA,GAAA,EAAA,gBACAA,EAAAA,EAAA,iBAAA,GAAA,EAAA,mBACAA,EAAAA,EAAA,aAAA,GAAA,EAAA,eACAA,EAAAA,EAAA,YAAA,GAAA,EAAA,cACAA,EAAAA,EAAA,aAAA,GAAA,EAAA,eACAA,EAAAA,EAAA,cAAA,GAAA,EAAA,gBACAA,EAAAA,EAAA,cAAA,GAAA,EAAA,gBACAA,EAAAA,EAAA,gBAAA,GAAA,EAAA,kBACAA,EAAAA,EAAA,cAAA,GAAA,EAAA,gBACAA,EAAAA,EAAA,eAAA,GAAA,EAAA,iBACAA,EAAAA,EAAA,cAAA,GAAA,EAAA,gBACAA,EAAAA,EAAA,kBAAA,GAAA,EAAA,oBACAA,EAAAA,EAAA,YAAA,GAAA,EAAA,cACAA,EAAAA,EAAA,gBAAA,GAAA,EAAA,kBACAA,EAAAA,EAAA,eAAA,GAAA,EAAA,iBACAA,EAAAA,EAAA,cAAA,GAAA,EAAA,gBACAA,EAAAA,EAAA,cAAA,GAAA,EAAA,eACF,GA5DYA,KAAAA,GA4DX,CAAA,EAAA,EA2PK,IAAWC,IAAjB,SAAiBA,EAAQ,EAEvB,SAAYC,EAAuB,CAAEA,EAAAA,EAAA,OAAA,CAAA,EAAA,SAAcA,EAAAA,EAAA,GAAA,CAAA,EAAA,KAAUA,EAAAA,EAAA,GAAA,CAAA,EAAA,IAAQ,GAAzDD,EAAuB,0BAAvBA,EAAA,wBAA0D,CAAA,EAAA,CACxE,GAHiBA,KAAAA,GAGhB,CAAA,EAAA,ECpUD,IAAME,GAAwC,CAAA,EA2B9B,SAAAC,GAAWC,EAAcC,EAAkB,CACzD,IAAMC,EAAqB,CACzB,SAAUF,EACV,SAAU,SACV,OAAQ,CAAA,EACR,MAAO,CAAA,EACP,eAAgBC,GAGlBH,GAAWE,CAAI,EAAIE,CACrB,CASM,SAAUC,GAAgBH,EAAY,CAC1C,OAAOF,GAAWE,CAAI,CACxB,CASM,SAAUI,GAAaJ,EAAY,CACvC,OAAOF,GAAWE,CAAI,CACxB,CCvDM,SAAUK,EACZC,EAAmBC,EAAYC,EAC/BC,EAA2BC,EAAiC,CAC9D,IAAMC,EAAaJ,EAAK,YAAYD,CAAS,EAC7C,GAAIK,GAAcA,EAAW,kBAAoB,OAAW,CAC1D,IAAMC,EAAQD,EAAW,gBACnBE,EAAMF,EAAW,gBAAkB,EACrC,OACCA,EAAW,gBAAkB,OAAYC,EAAQ,EACRD,EAAW,cACnDG,EAAeF,EAAQ,EAAIL,EAAK,WAAW,OAASK,EAAQA,EAClE,GAAID,EAAW,OAAS,SACtB,OAAOI,GACHR,EAAK,WAAWO,CAAY,EAAGN,EAAWC,EAASC,CAAe,EAExE,GAAIC,EAAW,OAAS,UAAW,CAMjC,IAAMK,EAAST,EAAK,OAAO,MAAMK,EAAOC,CAAG,EACrCI,EAAaV,EAAK,WAAW,MAAMK,EAAOC,CAAG,EAChD,OAAO,SAACK,EAAOC,EAAU,CAAA,IAAAC,EAAA,QAAAA,EAAAJ,EAAOG,CAAK,KAAG,MAAAC,IAAA,OAAA,OAAAA,EAAA,MAAO,MAAM,CAAA,EAExD,OAAOH,EAAW,IACd,SAAAjB,EAAI,CAAI,OAAAe,GAAUf,EAAMQ,EAAWC,EAASC,CAAe,CAAC,CAAA,CACjE,CACD,IAAMW,EAASN,GACXR,EAAK,WAAWO,CAAY,EAAGN,EAAWC,EAASC,CAAe,EAChEY,EAAOD,EAAO,SAAQ,EAC5B,OAAOV,EAAW,OAAS,SACvBW,EAAK,CAAC,EACNC,GAAAA,KAAK,cAAcF,EAAO,MAAOC,CAAI,CAC1C,CACD,IAAME,EAAYjB,EAAK,WAAWD,CAAS,EAC3C,OAAOkB,GAAaA,EAAU,KAChC,CASM,SAAUT,GACZf,EAAcyB,EAA6BhB,EAC3CC,EAAiC,CAC7B,IAAAgB,EAAAxC,EAAoByC,GAAc3B,EAAMS,CAAO,EAAC,CAAA,EAA/CmB,EAAQF,EAAA,CAAA,EAAEP,EAAKO,EAAA,CAAA,EAEtB,GAAIhB,GAAmB,KAAM,CAC3B,IAAMW,EAASX,EAAgB,yBAAyBkB,CAAQ,EAChE,GAAIP,GAAU,KACZ,OAAOA,CAEV,CAED,IAAMQ,EAAYpB,EAAQ,kBAAkB,KAAK,SAAAoB,EAAS,CACxD,MAAO,CAAC,CAACJ,EAAWK,GAAyBF,EAAUC,CAAS,CAAC,CACnE,CAAC,EAED,OAAOA,IAAc,OACjBJ,EAAWK,GAAyBF,EAAUC,CAAS,CAAC,EAAEV,CAAK,EAC/D,MACN,UAOgBY,GACZ/B,EAAcyB,EACdhB,EAAyB,CAC3B,OAAOgB,EAAWK,GAAyB9B,EAAMS,EAAQ,gBAAgB,CAAC,CAC5E,CAUgB,SAAAuB,GACZC,EAAmBxB,EAA0B,CACzC,IAAAiB,EAAAxC,EAAgCyC,GAAcM,EAAWxB,CAAO,EAAC,CAAA,EAAhEmB,EAAQF,EAAA,CAAA,EAAEP,EAAKO,EAAA,CAAA,EAAEQ,EAAUR,EAAA,CAAA,EAElC,MAAO,CACLI,GAAyBF,EAAUnB,GAAWA,EAAQ,gBAAgB,EACtEU,EAAOe,EAEX,CAEA,SAASJ,GAAyB9B,EAAc6B,EAAkB,CAChE,OAASA,EAAY,GAAA,OAAG7B,EAAI,GAAA,EAAA,OAAI6B,CAAS,EAAK7B,CAChD,CAEgB,SAAA2B,GACZ3B,EAAcS,EAA0B,CAC1C,GAAIT,IAAS,GACX,MAAO,CAAC,GAAI,EAAG,MAAS,EAG1B,IAAMmC,EAAiB1B,GAAW,MAAQA,EAAQ,oBAAsB,KACxE,GAAI0B,EAAgB,CAClB,IAAMC,EAAe3B,EAAQ,mBAAmB,IAAIT,CAAI,EACxD,GAAIoC,GAAgB,KAClB,OAAOA,CAEV,CACD,IAAMC,EAAQrC,EAAK,MAAM,GAAG,EACxB/B,EACJ,GAAIoE,EAAM,SAAW,EACnBpE,EAAS,CAAC+B,EAAM,EAAG,MAAS,MACvB,CACL,IAAM4B,EAAWS,EAAM,CAAC,EAClBH,EAAaG,EAAM,SAAW,EAAIA,EAAM,CAAC,EAAI,OAC7ClB,EAAQ,OAAOkB,EAAMA,EAAM,OAAS,CAAC,CAAC,EAC5CpE,EAAS,CAAC2D,EAAUT,EAAOe,CAAU,CACtC,CACD,OAAIC,GACF1B,EAAQ,mBAAmB,IAAIT,EAAM/B,CAAM,EAEtCA,CACT,UASgBqE,GACZ/B,EAAYC,EACZC,EAAyB,CAC3B,IAAI8B,EAAMlC,EAAc,MAAOE,EAAMC,EAAWC,CAAO,EACvD,GAAI8B,IAAQ,WAAY,CAEtBA,EAAMlC,EAAc,mBAAoBE,EAAMC,EAAWC,CAAO,EAIhE,QAHM+B,EAEF,CAAC,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,CAAC,EAC1BvD,EAAI,EAAGA,EAAI,EAAGA,IACrBuD,EAAgBvD,CAAC,EAAE,CAAC,EAAKsD,EAAiBtD,EAAI,CAAC,EAC/CuD,EAAgBvD,CAAC,EAAE,CAAC,EAAKsD,EAAiBtD,EAAI,EAAI,CAAC,EAErD,OAAOuD,CACR,CACD,OAAOD,CACT,CAWM,SAAUE,GAAYpB,EAAc,CACxC,OAAOA,EAAO,KAAOA,EAASqB,GAAAA,MAAMrB,CAAM,CAC5C,CC1KO,IAAMsB,GAAmB,CAC9B,CACE,SAAY,MACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,IAAO,EACP,KAAQ,UACR,KAAQ,SACT,CACF,CACF,EACD,CACE,SAAY,UACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,SACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,MACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,UACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,MACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,WACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,WACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,MACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,UACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,UACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,MACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,oBACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,MACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,WACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,+BC1XI,IAAMA,GAAmB,CAC9B,CACE,SAAY,MACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,cACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,UACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,aACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,MACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,MACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,MACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,MACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,EACD,CACE,OAAU,OACV,KAAQ,aACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,MACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,EACD,CACE,OAAU,OACV,KAAQ,aACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,UACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,MACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,SACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,MACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,aACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,WACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,MACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,YACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,QACV,KAAQ,QACR,KAAQ,SACR,aAAgB,EACjB,EACD,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,WACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,+BC/2BI,IAAMA,GAAmB,CAC9B,CACE,SAAY,kBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,OACT,EACD,CACE,MAAS,EACT,KAAQ,iBACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,WACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,SACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,IAAO,EACP,KAAQ,UACR,KAAQ,SACT,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,EACD,CACE,OAAU,aACV,KAAQ,YACR,KAAQ,QACT,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,MACT,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,gBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,gBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,QACV,KAAQ,QACR,KAAQ,OACT,EACD,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,OACT,EACD,CACE,OAAU,eACV,KAAQ,cACR,KAAQ,MACT,EACD,CACE,OAAU,mBACV,KAAQ,iBACR,KAAQ,MACT,EACD,CACE,OAAU,2BACV,KAAQ,yBACR,KAAQ,MACT,EACD,CACE,OAAU,oBACV,KAAQ,OACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,qBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,gBACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,oBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,gBACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,QACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,sBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,gBACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,UACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,QACV,KAAQ,QACR,KAAQ,OACT,EACD,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,uBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,gBACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,UACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,sBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,gBACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,QACV,KAAQ,QACR,KAAQ,OACT,EACD,CACE,OAAU,wBACV,KAAQ,sBACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,qBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,gBACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,UACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,oBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,gBACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,qBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,gBACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,cACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,IAAO,EACP,KAAQ,OACR,KAAQ,SACT,CACF,EACD,MAAS,CACP,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,MACT,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,MACT,CACF,CACF,EACD,CACE,SAAY,KACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,IAAO,EACP,KAAQ,OACR,KAAQ,SACT,CACF,EACD,MAAS,CACP,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,MACT,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,MACT,CACF,CACF,EACD,CACE,SAAY,iBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,IAAO,EACP,KAAQ,OACR,KAAQ,SACT,CACF,EACD,MAAS,CACP,CACE,OAAU,OACV,KAAQ,OACR,KAAQ,MACT,EACD,CACE,OAAU,OACV,KAAQ,OACR,KAAQ,MACT,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,IAAO,EACP,KAAQ,OACR,KAAQ,SACT,CACF,EACD,MAAS,CACP,CACE,OAAU,OACV,KAAQ,OACR,KAAQ,MACT,EACD,CACE,OAAU,OACV,KAAQ,OACR,KAAQ,MACT,CACF,CACF,EACD,CACE,SAAY,oBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,UACT,EACD,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,OACT,CACF,EACD,MAAS,CACP,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,sBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,UACT,EACD,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,OACT,EACD,CACE,MAAS,EACT,KAAQ,cACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,mBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,UACT,EACD,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,OACT,CACF,EACD,MAAS,CACP,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,oBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,OACT,CACF,EACD,MAAS,CACP,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,oBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,oBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,OACT,EACD,CACE,MAAS,EACT,KAAQ,cACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,uBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,OACT,CACF,EACD,MAAS,CACP,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,kBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,OACT,CACF,EACD,MAAS,CACP,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,OACT,EACD,CACE,OAAU,eACV,KAAQ,cACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,kBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,OACT,EACD,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,mBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,OACT,EACD,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,qBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,OACT,EACD,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,oBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,OACT,CACF,EACD,MAAS,CACP,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,qBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,mBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,mBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,CACF,CACF,+BC91BI,IAAMA,GAAmB,CAC9B,CACE,SAAY,UACZ,SAAY,cACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,UACT,EACD,CACE,OAAU,UACV,KAAQ,MACR,KAAQ,QACT,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,SACR,aAAgB,EACjB,EACD,CACE,OAAU,QACV,KAAQ,aACR,KAAQ,UACT,EACD,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,UACZ,SAAY,cACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,UACT,EACD,CACE,OAAU,UACV,KAAQ,MACR,KAAQ,QACT,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,SACR,aAAgB,EACjB,EACD,CACE,OAAU,QACV,KAAQ,aACR,KAAQ,UACT,EACD,CACE,OAAU,oBACV,KAAQ,mBACR,KAAQ,WACR,aAAgB,CAAA,EAChB,aAAgB,EACjB,EACD,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,oBACZ,SAAY,cACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,UACT,EACD,CACE,OAAU,UACV,KAAQ,MACR,KAAQ,QACT,EACD,CACE,OAAU,QACV,KAAQ,aACR,KAAQ,UACT,EACD,CACE,OAAU,yBACV,KAAQ,sBACR,KAAQ,MACT,EACD,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,YACZ,SAAY,cACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,UACT,EACD,CACE,OAAU,UACV,KAAQ,MACR,KAAQ,QACT,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,SACR,aAAgB,EACjB,EACD,CACE,OAAU,QACV,KAAQ,aACR,KAAQ,UACT,EACD,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,YACZ,SAAY,cACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,UACT,EACD,CACE,OAAU,UACV,KAAQ,MACR,KAAQ,QACT,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,SACR,aAAgB,EACjB,EACD,CACE,OAAU,QACV,KAAQ,aACR,KAAQ,UACT,EACD,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,SACZ,SAAY,cACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,SACV,KAAQ,SACR,KAAQ,QACT,EACD,CACE,OAAU,UACV,KAAQ,MACR,KAAQ,QACT,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,SACR,aAAgB,KACjB,EACD,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,EACD,CACE,OAAU,WACV,KAAQ,WACR,KAAQ,SACR,aAAgB,CACjB,CACF,CACF,EACD,CACE,SAAY,SACZ,SAAY,cACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,EACD,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,UACT,EACD,CACE,OAAU,UACV,KAAQ,MACR,KAAQ,QACT,EACD,CACE,OAAU,gBACV,KAAQ,gBACR,KAAQ,MACT,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,SACR,aAAgB,MACjB,EACD,CACE,OAAU,oBACV,KAAQ,mBACR,KAAQ,WACR,aAAgB,CAAA,CACjB,EACD,CACE,OAAU,YACV,KAAQ,YACR,KAAQ,UACT,CACF,CACF,EACD,CACE,SAAY,eACZ,SAAY,cACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,IAAO,EACP,KAAQ,OACR,KAAQ,SACT,CACF,EACD,MAAS,CACP,CACE,OAAU,WACV,KAAQ,UACR,KAAQ,QACT,EACD,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,EACD,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,UACT,EACD,CACE,OAAU,UACV,KAAQ,MACR,KAAQ,QACT,EACD,CACE,OAAU,oBACV,KAAQ,mBACR,KAAQ,WACR,aAAgB,CAAA,CACjB,EACD,CACE,OAAU,mBACV,KAAQ,gBACR,KAAQ,OACR,aAAgB,EACjB,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,SACR,aAAgB,MACjB,EACD,CACE,OAAU,YACV,KAAQ,YACR,KAAQ,WACR,aAAgB,CACd,EACA,EACA,EACA,CACD,CACF,EACD,CACE,OAAU,YACV,KAAQ,WACR,KAAQ,WACR,aAAgB,CAAA,CACjB,EACD,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,SACR,aAAgB,IACjB,EACD,CACE,OAAU,kBACV,KAAQ,iBACR,KAAQ,SACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,sBACZ,SAAY,cACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,cACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,UACT,EACD,CACE,OAAU,UACV,KAAQ,MACR,KAAQ,QACT,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,SACR,aAAgB,EACjB,EACD,CACE,OAAU,oBACV,KAAQ,mBACR,KAAQ,WACR,aAAgB,CAAA,CACjB,EACD,CACE,OAAU,YACV,KAAQ,YACR,KAAQ,WACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,kBACZ,SAAY,cACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,UACT,EACD,CACE,OAAU,UACV,KAAQ,MACR,KAAQ,QACT,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,SACR,aAAgB,MACjB,EACD,CACE,OAAU,oBACV,KAAQ,mBACR,KAAQ,WACR,aAAgB,CAAA,CACjB,EACD,CACE,OAAU,YACV,KAAQ,YACR,KAAQ,UACT,CACF,CACF,EACD,CACE,SAAY,wBACZ,SAAY,cACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,UACT,EACD,CACE,OAAU,UACV,KAAQ,MACR,KAAQ,QACT,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,SACR,aAAgB,MACjB,EACD,CACE,OAAU,oBACV,KAAQ,mBACR,KAAQ,WACR,aAAgB,CAAA,CACjB,EACD,CACE,OAAU,YACV,KAAQ,YACR,KAAQ,UACT,CACF,CACF,EACD,CACE,SAAY,6BACZ,SAAY,cACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,IAAO,EACP,KAAQ,OACR,KAAQ,SACT,CACF,EACD,MAAS,CACP,CACE,OAAU,WACV,KAAQ,UACR,KAAQ,QACT,EACD,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,EACD,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,UACT,EACD,CACE,OAAU,UACV,KAAQ,MACR,KAAQ,QACT,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,SACR,aAAgB,MACjB,EACD,CACE,OAAU,YACV,KAAQ,YACR,KAAQ,WACR,aAAgB,CACd,EACA,EACA,EACA,CACD,CACF,EACD,CACE,OAAU,YACV,KAAQ,WACR,KAAQ,WACR,aAAgB,CAAA,CACjB,EACD,CACE,OAAU,oBACV,KAAQ,mBACR,KAAQ,WACR,aAAgB,CAAA,CACjB,CACF,CACF,EACD,CACE,SAAY,SACZ,SAAY,cACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,UACT,EACD,CACE,OAAU,UACV,KAAQ,MACR,KAAQ,QACT,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,SACR,aAAgB,MACjB,EACD,CACE,OAAU,YACV,KAAQ,YACR,KAAQ,UACT,CACF,CACF,EACD,CACE,SAAY,aACZ,SAAY,cACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,UACT,EACD,CACE,OAAU,QACV,KAAQ,YACR,KAAQ,UACT,EACD,CACE,OAAU,UACV,KAAQ,MACR,KAAQ,QACT,CACF,CACF,+BC/qBI,IAAMA,GAAmB,CAC9B,CACE,SAAY,OACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,UACT,EACD,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,WACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,MACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,SACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,SACR,aAAgB,CACjB,EACD,CACE,MAAS,EACT,KAAQ,WACR,KAAQ,SACR,aAAgB,CACjB,CACF,EACD,MAAS,CACP,CACE,OAAU,OACV,KAAQ,OACR,KAAQ,SACR,aAAgB,EACjB,EACD,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,WACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,QACV,KAAQ,QACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,uBACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,OACV,KAAQ,OACR,KAAQ,SACR,aAAgB,CACjB,EACD,CACE,OAAU,QACV,KAAQ,QACR,KAAQ,SACR,aAAgB,EAChB,aAAgB,EACjB,EACD,CACE,OAAU,QACV,KAAQ,QACR,KAAQ,OACT,EACD,CACE,OAAU,IACV,KAAQ,IACR,KAAQ,SACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,gBACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,SACV,KAAQ,SACR,KAAQ,SACR,aAAgB,CACjB,EACD,CACE,OAAU,SACV,KAAQ,SACR,KAAQ,SACR,aAAgB,CACjB,EACD,CACE,OAAU,QACV,KAAQ,QACR,KAAQ,OACT,EACD,CACE,OAAU,OACV,KAAQ,OACR,KAAQ,SACR,aAAgB,CACjB,EACD,CACE,OAAU,QACV,KAAQ,QACR,KAAQ,SACR,aAAgB,EAChB,aAAgB,EACjB,EACD,CACE,OAAU,IACV,KAAQ,IACR,KAAQ,SACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,mBACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,SACV,KAAQ,SACR,KAAQ,QACT,EACD,CACE,OAAU,SACV,KAAQ,SACR,KAAQ,QACT,EACD,CACE,OAAU,OACV,KAAQ,OACR,KAAQ,SACR,aAAgB,CACjB,EACD,CACE,OAAU,QACV,KAAQ,QACR,KAAQ,SACR,aAAgB,EAChB,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,SACR,aAAgB,CACjB,CACF,EACD,MAAS,CACP,CACE,OAAU,OACV,KAAQ,QACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,kBACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,QACV,KAAQ,OACR,KAAQ,SACR,aAAgB,CACjB,EACD,CACE,OAAU,SACV,KAAQ,SACR,KAAQ,SACR,aAAgB,CACjB,EACD,CACE,OAAU,OACV,KAAQ,OACR,KAAQ,QACT,EACD,CACE,OAAU,QACV,KAAQ,QACR,KAAQ,SACR,aAAgB,EAChB,aAAgB,EACjB,EACD,CACE,OAAU,QACV,KAAQ,QACR,KAAQ,OACT,EACD,CACE,OAAU,IACV,KAAQ,IACR,KAAQ,SACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,YACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,cACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,aACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,OACV,KAAQ,OACR,KAAQ,QACT,EACD,CACE,OAAU,QACV,KAAQ,QACR,KAAQ,QACT,EACD,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,OACT,EACD,CACE,OAAU,eACV,KAAQ,eACR,KAAQ,OACT,CACF,CACF,+BClZI,IAAMA,GAAmB,CAC9B,CACE,SAAY,sBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,gBACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,sBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,gBACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,iBACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,sBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,gBACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,iBACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,EACD,CACE,OAAU,cACV,KAAQ,YACR,KAAQ,QACR,aAAgB,EACjB,EACD,CACE,OAAU,yBACV,KAAQ,qBACR,KAAQ,MACT,CACF,CACF,EACD,CACE,SAAY,sBACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,gBACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,iBACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,YACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,WACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,+BC1LI,IAAMA,GAAmB,CAC9B,CACE,SAAY,aACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,iBACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,SACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,SACV,KAAQ,SACR,KAAQ,MACT,CACF,CACF,EACD,CACE,SAAY,aACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,iBACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,SACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,WACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,CACF,CACF,+BClFI,IAAMA,GAAmB,CAC9B,CACE,SAAY,yBACZ,SAAY,QACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,QACV,KAAQ,QACR,KAAQ,OACT,EACD,CACE,OAAU,QACV,KAAQ,QACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,cACZ,SAAY,QACZ,MAAS,CACP,CACE,OAAU,QACV,KAAQ,QACR,KAAQ,OACT,EACD,CACE,OAAU,QACV,KAAQ,QACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,OACb,EACD,CACE,SAAY,WACZ,SAAY,QACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,YACZ,SAAY,QACZ,OAAU,CACR,CACE,MAAS,EACT,IAAO,EACP,KAAQ,IACR,KAAQ,SACT,CACF,CACF,EACD,CACE,SAAY,WACZ,SAAY,QACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,QACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,QACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,QACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,SACZ,SAAY,QACZ,OAAU,CACR,CACE,MAAS,EACT,IAAO,EACP,KAAQ,IACR,KAAQ,SACT,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,QACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,SACT,CACF,EACD,MAAS,CACP,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,QACT,EACD,CACE,OAAU,UACV,KAAQ,SACR,KAAQ,SACR,aAAgB,EACjB,EACD,CACE,OAAU,YACV,KAAQ,YACR,KAAQ,SACR,aAAgB,CACjB,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,QACZ,OAAU,CAAA,CACX,EACD,CACE,SAAY,eACZ,SAAY,QACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,0BACZ,SAAY,QACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,MACV,KAAQ,MACR,KAAQ,QACT,EACD,CACE,OAAU,MACV,KAAQ,MACR,KAAQ,QACT,CACF,CACF,+BCpMI,IAAMA,GAAmB,CAC9B,CACE,SAAY,YACZ,SAAY,aACZ,OAAU,CAAA,EACV,MAAS,CACP,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,QACT,EACD,CACE,OAAU,wBACV,KAAQ,qBACR,KAAQ,MACT,EACD,CACE,OAAU,YACV,KAAQ,WACR,KAAQ,OACT,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,cACZ,SAAY,aACZ,OAAU,CAAA,EACV,MAAS,CACP,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,QACT,EACD,CACE,OAAU,wBACV,KAAQ,qBACR,KAAQ,MACT,EACD,CACE,OAAU,YACV,KAAQ,WACR,KAAQ,OACT,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,oBACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,cACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,MACV,KAAQ,MACR,KAAQ,QACR,aAAgB,EACjB,EACD,CACE,OAAU,OACV,KAAQ,OACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,sBACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,cACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,MACV,KAAQ,MACR,KAAQ,QACR,aAAgB,EACjB,EACD,CACE,OAAU,OACV,KAAQ,OACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,kBACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,cACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,MACV,KAAQ,MACR,KAAQ,QACR,aAAgB,EACjB,EACD,CACE,OAAU,OACV,KAAQ,OACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,oBACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,cACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,MACV,KAAQ,MACR,KAAQ,QACR,aAAgB,EACjB,EACD,CACE,OAAU,OACV,KAAQ,OACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,kBACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,cACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,oBACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,cACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,kBACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,cACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,oBACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,cACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,CACF,+BClQI,IAAMA,GAAmB,CAC9B,CACE,SAAY,iBACZ,SAAY,QACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,MACT,EACD,CACE,OAAU,qBACV,KAAQ,mBACR,KAAQ,MACT,EACD,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,wBACZ,SAAY,QACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,MACT,EACD,CACE,OAAU,qBACV,KAAQ,mBACR,KAAQ,MACT,EACD,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,gBACZ,SAAY,QACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,WACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,SACV,KAAQ,SACR,KAAQ,QACT,EACD,CACE,OAAU,sBACV,KAAQ,qBACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,6BACZ,SAAY,QACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,aACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,cACR,KAAQ,UACT,EACD,CACE,MAAS,EACT,KAAQ,YACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,gBACV,KAAQ,gBACR,KAAQ,QACT,EACD,CACE,OAAU,YACV,KAAQ,WACR,KAAQ,QACT,CACF,CACF,+BChJI,IAAMA,GAAmB,CAC9B,CACE,SAAY,QACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,WACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,UACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,eACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,YACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,aACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,aACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,YACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,SACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,YACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,WACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,YACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,aACZ,SAAY,UACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,CACF,+BC7RI,IAAMA,GAAmB,CAC9B,CACE,SAAY,eACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,IAAO,EACP,KAAQ,OACR,KAAQ,SACT,CACF,EACD,MAAS,CACP,CACE,OAAU,WACV,KAAQ,UACR,KAAQ,QACT,EACD,CACE,OAAU,YACV,KAAQ,WACR,KAAQ,WACR,aAAgB,CAAA,CACjB,EACD,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,SACR,aAAgB,IACjB,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,OACR,aAAgB,EACjB,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,OACR,aAAgB,EACjB,EACD,CACE,OAAU,kBACV,KAAQ,iBACR,KAAQ,SACR,aAAgB,EACjB,EACD,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,SACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,OACR,aAAgB,EACjB,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,OACR,aAAgB,EACjB,EACD,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,cACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,QACV,KAAQ,aACR,KAAQ,OACR,aAAgB,EACjB,EACD,CACE,OAAU,QACV,KAAQ,aACR,KAAQ,OACR,aAAgB,EACjB,EACD,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,gBACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,QACV,KAAQ,aACR,KAAQ,OACR,aAAgB,EACjB,EACD,CACE,OAAU,QACV,KAAQ,aACR,KAAQ,OACR,aAAgB,EACjB,EACD,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,YACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,SACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,IAAO,EACP,KAAQ,UACR,KAAQ,SACT,CACF,EACD,MAAS,CACP,CACE,OAAU,WACV,KAAQ,WACR,KAAQ,QACT,EACD,CACE,OAAU,IACV,KAAQ,IACR,KAAQ,SACR,aAAgB,CACjB,EACD,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,iBACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,WACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,WACR,KAAQ,QACT,CACF,CACF,+BCxPI,IAAMA,GAAmB,CAC9B,CACE,SAAY,gBACZ,SAAY,gBACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,YACV,KAAQ,WACR,KAAQ,OACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,iBACZ,SAAY,gBACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,WACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,SACR,aAAgB,IACjB,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,SACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,mBACZ,SAAY,gBACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,WACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,SACR,aAAgB,IACjB,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,SACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,mBACZ,SAAY,gBACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,WACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,SACR,aAAgB,IACjB,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,SACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,MACZ,SAAY,gBACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,eACV,KAAQ,SACR,KAAQ,SACR,aAAgB,CACjB,EACD,CACE,OAAU,OACV,KAAQ,OACR,KAAQ,SACR,aAAgB,CACjB,EACD,CACE,OAAU,QACV,KAAQ,QACR,KAAQ,SACR,aAAgB,CACjB,EACD,CACE,OAAU,OACV,KAAQ,OACR,KAAQ,SACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,UACZ,SAAY,gBACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,aACZ,SAAY,gBACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,CACF,+BC1NI,IAAMA,GAAmB,CAC9B,CACE,SAAY,WACZ,SAAY,YACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,gBACZ,SAAY,YACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,MACT,CACF,CACF,EACD,CACE,SAAY,MACZ,SAAY,YACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,YACV,KAAQ,WACR,KAAQ,MACT,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,YACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,YACV,KAAQ,WACR,KAAQ,MACT,CACF,CACF,EACD,CACE,SAAY,MACZ,SAAY,YACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,YACV,KAAQ,WACR,KAAQ,MACT,CACF,CACF,EACD,CACE,SAAY,MACZ,SAAY,YACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,YACV,KAAQ,WACR,KAAQ,MACT,CACF,CACF,EACD,CACE,SAAY,MACZ,SAAY,YACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,YACV,KAAQ,WACR,KAAQ,MACT,CACF,CACF,EACD,CACE,SAAY,MACZ,SAAY,YACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,YACV,KAAQ,WACR,KAAQ,MACT,CACF,CACF,EACD,CACE,SAAY,SACZ,SAAY,YACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,SACZ,SAAY,YACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,YACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,YACV,KAAQ,WACR,KAAQ,MACT,EACD,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,UACZ,SAAY,YACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,YACV,KAAQ,YACR,KAAQ,MACT,EACD,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,MACT,CACF,CACF,EACD,CACE,SAAY,SACZ,SAAY,YACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,YACV,KAAQ,YACR,KAAQ,MACT,EACD,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,MACT,CACF,CACF,+BChTI,IAAMA,GAAmB,CAC9B,CACE,SAAY,WACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,IAAO,GACP,KAAQ,UACR,KAAQ,SACT,EACD,CACE,MAAS,GACT,KAAQ,OACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,IACR,KAAQ,SACR,aAAgB,CACjB,CACF,CACF,EACD,CACE,SAAY,SACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,IAAO,EACP,KAAQ,UACR,KAAQ,SACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,IACR,KAAQ,SACR,aAAgB,CACjB,CACF,CACF,EACD,CACE,SAAY,WACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,SACR,aAAgB,CACjB,CACF,EACD,MAAS,CACP,CACE,OAAU,aACV,KAAQ,YACR,KAAQ,SACR,aAAgB,CACjB,CACF,CACF,EACD,CACE,SAAY,SACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,mBACV,KAAQ,kBACR,KAAQ,OACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,UACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,YACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,UACT,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,UACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,UACT,CACF,CACF,EACD,CACE,SAAY,eACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,UACT,EACD,CACE,MAAS,EACT,KAAQ,MACR,KAAQ,UACT,EACD,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,aACV,KAAQ,YACR,KAAQ,SACR,aAAgB,CACjB,EACD,CACE,OAAU,WACV,KAAQ,UACR,KAAQ,SACR,aAAgB,CACjB,EACD,CACE,OAAU,gBACV,KAAQ,cACR,KAAQ,SACR,aAAgB,CACjB,EACD,CACE,OAAU,gBACV,KAAQ,eACR,KAAQ,SACR,aAAgB,CACjB,EACD,CACE,OAAU,mBACV,KAAQ,iBACR,KAAQ,SACR,aAAgB,CACjB,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,IAAO,EACP,KAAQ,UACR,KAAQ,SACT,CACF,EACD,MAAS,CACP,CACE,OAAU,OACV,KAAQ,OACR,KAAQ,SACR,aAAgB,CACjB,CACF,CACF,EACD,CACE,SAAY,SACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,OACV,KAAQ,OACR,KAAQ,SACR,aAAgB,CACjB,EACD,CACE,OAAU,MACV,KAAQ,MACR,KAAQ,SACR,aAAgB,EAChB,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,UACT,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,SACR,aAAgB,CACjB,EACD,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,YACV,KAAQ,kBACR,KAAQ,SACR,aAAgB,CACjB,CACF,CACF,EACD,CACE,SAAY,SACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,kBACR,KAAQ,UACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,SACR,aAAgB,CACjB,CACF,CACF,EACD,CACE,SAAY,YACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,UACT,CACF,CACF,EACD,CACE,SAAY,WACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,gBACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,gBACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,cACR,KAAQ,UACT,EACD,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,mBACV,KAAQ,kBACR,KAAQ,OACR,aAAgB,GAChB,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,sBACZ,SAAY,aACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,CACF,CACF,+BCjaI,IAAMA,GAAmB,CAC9B,CACE,SAAY,sBACZ,SAAY,SACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,SACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,aACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,gBACZ,SAAY,SACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,eACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,aACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,WACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,IACV,KAAQ,QACR,KAAQ,QACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,oBACZ,SAAY,SACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,aACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,mBACZ,SAAY,SACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,aACR,KAAQ,QACT,CACF,CACF,+BCjGI,IAAMA,GAAmB,CAC9B,CACE,SAAY,MACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,OACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,aACR,KAAQ,SACR,aAAgB,EACjB,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,WACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,aACR,KAAQ,SACR,aAAgB,EACjB,CACF,CACF,+BCxDI,IAAMA,GAAmB,CAC9B,CACE,SAAY,qBACZ,SAAY,SACZ,OAAU,CACR,CACA,MAAS,EACP,KAAQ,QACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,QACT,EACD,CACE,OAAU,UACV,KAAQ,UACR,KAAQ,QACT,EACD,CACE,OAAU,iBACV,KAAQ,gBACR,KAAQ,MACT,CACF,CACF,EACD,CACE,SAAY,eACZ,SAAY,SACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,aACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,YACV,KAAQ,YACR,KAAQ,QACT,EACD,CACE,OAAU,eACV,KAAQ,cACR,KAAQ,UACT,EACD,CACE,OAAU,WACV,KAAQ,UACR,KAAQ,QACT,EACD,CACE,OAAU,YACV,KAAQ,WACR,KAAQ,QACT,EACD,CACE,OAAU,YACV,KAAQ,WACR,KAAQ,QACT,EACD,CACE,OAAU,2BACV,KAAQ,yBACR,KAAQ,MACT,CACF,EACD,QAAW,CACT,SACA,eACD,CACF,EACD,CACE,SAAY,cACZ,SAAY,SACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,YACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,aACV,KAAQ,YACR,KAAQ,MACT,CACF,EACD,QAAW,CACT,UACA,SACA,OACD,CACF,EACD,CACE,SAAY,yBACZ,SAAY,SACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,QACT,CACF,CACF,+BC9HI,IAAMA,GAAmB,CAC9B,CACE,SAAY,OACZ,SAAY,iBACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,OACV,KAAQ,SACR,KAAQ,QACR,aAAgB,EACjB,EACD,CACE,OAAU,OACV,KAAQ,QACR,KAAQ,OACT,CACF,CACF,EACD,CACE,SAAY,aACZ,SAAY,iBACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,OACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,YACZ,SAAY,iBACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,OACV,KAAQ,OACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,MACZ,SAAY,iBACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,UACT,CACF,EACD,MAAS,CACP,CACE,OAAU,iBACV,KAAQ,gBACR,KAAQ,SACR,aAAgB,CACjB,CACF,CACF,EACD,CACE,SAAY,QACZ,SAAY,iBACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,UACR,KAAQ,UACT,EACD,CACE,MAAS,EACT,KAAQ,gBACR,KAAQ,SACR,aAAgB,CACjB,CACF,CACF,EACD,CACE,SAAY,UACZ,SAAY,iBACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,UACT,CACF,CACF,EACD,CACE,SAAY,cACZ,SAAY,iBACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,UACT,CACF,CACF,EACD,CACE,SAAY,UACZ,SAAY,iBACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,OACV,iBAAoB,eACpB,KAAQ,OACR,KAAQ,UACT,CACF,CACF,EACD,CACE,SAAY,iBACZ,SAAY,iBACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,aACR,KAAQ,UACT,EACD,CACE,MAAS,EACT,KAAQ,WACR,KAAQ,UACT,CACF,CACF,EACD,CACE,SAAY,iBACZ,SAAY,iBACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,aACR,KAAQ,UACT,EACD,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,UACT,CACF,CACF,EACD,CACE,SAAY,eACZ,SAAY,iBACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,CACF,EACD,MAAS,CACP,CACE,OAAU,aACV,KAAQ,YACR,KAAQ,QACT,EACD,CACE,OAAU,cACV,KAAQ,aACR,KAAQ,QACT,CACF,CACF,EACD,CACE,SAAY,cACZ,SAAY,iBACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,IACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,QACR,KAAQ,UACT,CACF,EACD,MAAS,CAAA,CACV,EACD,CACE,SAAY,gBACZ,SAAY,iBACZ,OAAU,CACR,CACE,MAAS,EACT,KAAQ,KACR,KAAQ,QACT,EACD,CACE,MAAS,EACT,KAAQ,KACR,KAAQ,QACT,CACF,EACD,MAAS,CAAA,CACV,+BC3OHC,IAAA,UAAA,CAWE,SAAAA,GAAA,CACE,IAAMC,EAAM,CACVC,GAAYC,GAAWC,GAASC,GAAaC,GAAUC,GACvDC,GAAYC,GAAOC,GAAWC,GAAOC,GAASC,GAAUC,GACxDC,GAAWC,GAAWC,GAAQC,GAAUC,GAAQC,IAE5CC,EAA0B,CAAA,EAAG,OAAH,MAAA,CAAA,EAAa3E,GAAA,CAAA,EAAAJ,EAAA2D,EAAI,IAAI,SAAAjE,EAAM,CAAA,OAAAA,EAAG,IAAH,CAAO,CAAC,EAAA,EAAA,CAAA,EAEnE,KAAK,UAAYqF,EAAY,OACzB,SAACC,EAAKC,EAAgB,CACpB,OAAAD,EAAIC,EAAO,QAAQ,EAAIA,EAChBD,GAET,CAAA,CAAE,EAlBD,cAAA,eAAWtB,EAAQ,WAAA,CAAnB,IAAA,UAAA,CACL,OAAO,KAAK,YAAc,KAAK,UAAY,IAAI,oCAChD,CAAA,EAqBDA,EAAA,UAAA,eAAA,SACIS,EACAe,EAAwC,CAF5C,IA+FCC,EAAA,KA7FGD,IAAA,SAAAA,EAAwC,CAAA,GAC1C,IAAME,EAAUjB,EAAM,KAChBkB,EAAuB,CAAA,EACvBC,EAAkB,CAAA,EAClBC,EAAoB,CAAA,EACpBC,EAAQJ,EAAQ,OAA8B,SAACJ,EAAK3D,EAAI,CAC5D,OAAA2D,EAAI3D,EAAK,IAAI,EAAI8D,EAAK,QAAQ9D,CAAI,EAC9BA,EAAK,GAAG,WAAW,aAAa,EAClCgE,EAAa,KAAKL,EAAI3D,EAAK,IAAI,CAAC,EACvBA,EAAK,KAAO,QACrBiE,EAAQ,KAAKN,EAAI3D,EAAK,IAAI,CAAC,GAClBA,EAAK,OAAS,MAAQA,EAAK,MAAM,SAAW,IACrDkE,EAAU,KAAKP,EAAI3D,EAAK,IAAI,CAAC,EAExB2D,GACN,CAAA,CAAE,EAEDS,EAAiB,CAAA,EACfC,EAAkB,CAAA,EACpBC,EAA8C,CAAA,EAC9CC,EAA+C,CAAA,EAC/CV,GAAa,OACfS,EAAqB,KAAK,oBAAoBT,EAAU,MAAM,EAC9DU,EAAsB,KAAK,oBAAoBV,EAAU,OAAO,GAElE,IAAMW,EAAW,OAAO,KAAKL,CAAK,EAClCK,EAAS,QAAQ,SAAAC,EAAG,CAClB,IAAMzE,EAAOmE,EAAMM,CAAG,EACtBzE,EAAK,WAAW,QAAQ,SAACP,EAAMmB,EAAK,CAC5B,IAAAC,EAAAlC,EAA2B8C,GAAoBhC,CAAI,EAAC,CAAA,EAAnD4B,EAAQR,EAAA,CAAA,EAAIc,EAAUd,EAAA,CAAA,EACvB6D,EAAYP,EAAM9C,CAAQ,EAChC,GAAIqD,EAAU,SAAW,KAAM,CAC7B,IAAMC,EAAcD,EAAU,QAAQ,QAAQ/C,CAAU,EACxD,GAAIgD,IAAgB,GAAI,CACtB,IAAMjD,EAAY,GAAA,OAAGL,EAAY,GAAA,EAAA,OAAAsD,CAAW,EAE5C3E,EAAK,WAAWY,CAAK,EAAIc,CAC1B,CACF,CACD1B,EAAK,OAAO,KAAK0E,CAAS,EAC1BA,EAAU,SAAS,KAAK1E,CAAI,CAC9B,CAAC,CACH,CAAC,EAIG,OAAO,KAAKuE,CAAmB,EAAE,SAAW,EAC9CC,EAAS,QAAQ,SAAAC,EAAG,CAClB,IAAMzE,EAAOmE,EAAMM,CAAG,EAClBzE,EAAK,SAAS,SAAW,GAC3BqE,EAAQ,KAAKrE,CAAI,CAErB,CAAC,EAED,OAAO,KAAKuE,CAAmB,EAAE,QAAQ,SAAA9E,EAAI,CACrC,IAAAoB,EAAAlC,EAAe8C,GAAoBhC,CAAI,EAAC,CAAA,EAAvC4B,EAAQR,EAAA,CAAA,EACTb,EAAOmE,EAAM9C,CAAQ,EACvBrB,GAAQ,OACVA,EAAK,aAAeuE,EAAoB9E,CAAI,EAC5C4E,EAAQ,KAAKrE,CAAI,EAErB,CAAC,EAGC,OAAO,KAAKsE,CAAkB,EAAE,OAAS,EAC3C,OAAO,KAAKA,CAAkB,EAAE,QAAQ,SAAA7E,EAAI,CACpC,IAAAoB,EAAAlC,EAAe8C,GAAoBhC,CAAI,EAAC,CAAA,EAAvC4B,EAAQR,EAAA,CAAA,EACTb,EAAOmE,EAAM9C,CAAQ,EACvBrB,IACFA,EAAK,aAAesE,EAAmB7E,CAAI,EAC3C2E,EAAO,KAAKpE,CAAI,EAEpB,CAAC,EAEDoE,EAASJ,EAGX,IAAIY,EAAY,CAAA,EACZ9B,EAAM,SAAW,MAAQA,EAAM,QAAQ,UAAY,OACrD8B,EAAY9B,EAAM,QAAQ,SAAS,OAAO,SAAC8B,EAAWC,EAAI,CACxD,OAAAD,EAAUC,EAAK,UAAU,IAAI,EAAIf,EAAK,YAAYe,CAAI,EAC/CD,GACN,CAAA,CAA4B,GAGjC,IAAMlH,EACF,CAAC,MAAKyG,EAAE,OAAMC,EAAE,QAAOC,EAAE,QAAOJ,EAAE,aAAYD,EAAE,UAASH,EAAE,UAASe,CAAA,EAExE,OAAIV,EAAU,OAAS,IACrBxG,EAAO,UAAYwG,GAGdxG,GAGD2E,EAAmB,UAAA,oBAAnB,SAAoByC,EAA8C,CACxE,OAAO,OAAO,KAAKA,GAAW,CAAA,CAAE,EAC3B,OAAgC,SAACC,EAAMC,EAAI,CAC1C,OAAAD,EAAKD,EAAQE,CAAI,EAAE,IAAI,EAAIA,EACpBD,GACN,CAAA,CAAE,GAGH1C,EAAO,UAAA,QAAP,SAAQrC,EAAyB,CAGvC,IAAM4D,EACFhE,GAAgBI,EAAK,EAAE,GAAK,KAAK,UAAUA,EAAK,EAAE,GAAK,CAAA,EACvDA,EAAK,MAAQ,OACfA,EAAK,KAAO,CAAA,GAGd,IAAMiF,EAAgB,CACpB,KAAMjF,EAAK,KACX,GAAIA,EAAK,GACT,SAAU4D,EAAO,SACjB,YACK5D,EAAK,OACL,CAAA,GAAI,IAAI,SAAAkF,EAAS,CAAA,OAAAA,EAAM,WAAW,GAAG,EAAIA,EAAM,MAAM,CAAC,EAAIA,CAAK,CAAA,EACpE,OAAQ,CAAA,EACR,SAAU,CAAA,EACV,YAAa,CAAA,EACb,WAAY,CAAA,EACZ,SAAUlF,EAAK,KACf,QAAS4D,EAAO,SAGlB,OAAIA,EAAO,QAAU,OACnBqB,EAAQ,YACJrB,EAAO,OAAO,OACV,SAACD,EAAKwB,EAAK,CACT,OAAAxB,EAAIwB,EAAM,IAAI,EAAI,CAChB,KAAMA,EAAM,KACZ,gBAAiBA,EAAM,MACvB,cAAeA,EAAM,KAEhBxB,GAET,CAAA,CAAE,GAERC,EAAO,OAAS,OAClBqB,EAAQ,WACJrB,EAAO,MAAM,OAAoC,SAACD,EAAKwB,EAAK,CAC1D,IAAMC,EAAOD,EAAM,KACfhI,EAAQ,OACZ,OAAQgI,EAAM,KAAI,CAChB,IAAK,SACHhI,EAAQkI,GACJrF,EAAK,KAAMmF,EAAM,OAAQA,EAAM,YAAsB,EAErDhI,IAAU,QAAegI,EAAM,mBACjChI,EAAQkI,GACJrF,EAAK,KAAMmF,EAAM,iBACjBA,EAAM,YAAsB,GAElC,MACF,IAAK,WACHhI,EAAQmI,GACJtF,EAAK,KAAMmF,EAAM,OAAQA,EAAM,YAAwB,EAEvDhI,IAAU,QAAegI,EAAM,mBACjChI,EAAQmI,GACJtF,EAAK,KAAMmF,EAAM,iBACjBA,EAAM,YAAwB,GAEpC,MACF,IAAK,SACHhI,EAAQoI,GACJvF,EAAK,KAAMmF,EAAM,OAChBA,EAAM,cAAgB,CAAC,EACxBhI,IAAU,QAAegI,EAAM,mBACjChI,EAAQoI,GACJvF,EAAK,KAAMmF,EAAM,iBACjBA,EAAM,YAAsB,GAElC,MACF,IAAK,WACHhI,EAAQqI,GACJxF,EAAK,KAAMmF,EAAM,OAAQA,EAAM,YAAwB,EACvDhI,IAAU,QAAegI,EAAM,mBACjChI,EAAQqI,GACJxF,EAAK,KAAMmF,EAAM,iBACjBA,EAAM,YAAwB,GAEpC,MACF,IAAK,OACHhI,EAAQsI,GACJzF,EAAK,KAAMmF,EAAM,OAAQA,EAAM,YAAuB,EACtDhI,IAAU,QAAegI,EAAM,mBACjChI,EAAQsI,GACJzF,EAAK,KAAMmF,EAAM,iBACjBA,EAAM,YAAuB,GAEnC,MACF,IAAK,SACHhI,EAAQuI,GACJ1F,EAAK,KAAMmF,EAAM,OAAQA,EAAM,YAAyB,EACxDhI,IAAU,QAAegI,EAAM,mBACjChI,EAAQuI,GACJ1F,EAAK,KAAMmF,EAAM,iBACjBA,EAAM,YAAyB,GAErC,MACF,IAAK,QACHhI,EAAQwI,GACJ3F,EAAK,KAAMmF,EAAM,OAAQA,EAAM,YAAwB,EACvDhI,IAAU,QAAegI,EAAM,mBACjChI,EAAQwI,GACJ3F,EAAK,KAAMmF,EAAM,iBACjBA,EAAM,YAAwB,GAEpC,MACF,IAAK,UACHhI,EAAQyI,GACJ5F,EAAK,KAAMmF,EAAM,OAAQA,EAAM,YAA0B,EACzDhI,IAAU,QAAegI,EAAM,mBACjChI,EAAQyI,GACJ5F,EAAK,KAAMmF,EAAM,iBACjBA,EAAM,YAA0B,GAEtC,MACF,IAAK,QACHhI,EAAQ0I,GACJ7F,EAAK,KAAMmF,EAAM,OAAQA,EAAM,YAAwB,EACvDhI,IAAU,QAAegI,EAAM,mBACjChI,EAAQ0I,GACJ7F,EAAK,KAAMmF,EAAM,iBACjBA,EAAM,YAAwB,GAEpC,MACF,IAAK,UACHhI,EAAQ2I,GACJ9F,EAAK,KAAMmF,EAAM,OAAQA,EAAM,YAA0B,EACzDhI,IAAU,QAAegI,EAAM,mBACjChI,EAAQ2I,GACJ9F,EAAK,KAAMmF,EAAM,iBACjBA,EAAM,YAA0B,GAEtC,MACF,IAAK,OACHhI,EAAQ4I,GACJ/F,EAAK,KAAMmF,EAAM,OAAQA,EAAM,YAAsB,EACrDhI,IAAU,QAAegI,EAAM,mBACjChI,EAAQ4I,GACJ/F,EAAK,KAAMmF,EAAM,iBACjBA,EAAM,YAAsB,GAElC,MACF,IAAK,SACL,IAAK,UACH,MACF,QACE,MAAM,IAAI,MACN,2BAAA,OAA2BA,EAAM,KAAI,WAAA,EAAA,OAAYnF,EAAK,EAAE,CAAE,CACjE,CACD,OAAA2D,EAAIwB,EAAM,IAAI,EAAI,CAAC,MAAKhI,EAAE,KAAIiI,CAAA,EACvBzB,GACN,CAAA,CAAE,GAEJsB,GAID5C,EAAW,UAAA,YAAX,SAAY2D,EAAoC,CAAhD,IAkEPlC,EAAA,KAjEOC,EAAUiC,EAAY,QACtBhC,EAAuB,CAAA,EACvBC,EAAkB,CAAA,EACpBE,EAA+B,CAAA,EAC/BJ,GAAW,OACbI,EAAQJ,EAAQ,OAA8B,SAACJ,EAAK3D,EAAI,CACtD,OAAA2D,EAAI3D,EAAK,IAAI,EAAI8D,EAAK,QAAQ9D,CAAI,EAC9BA,EAAK,KAAO,SACdiE,EAAQ,KAAKN,EAAI3D,EAAK,IAAI,CAAC,EAEtB2D,GACN,CAAA,CAAE,GAEP,IAAMS,EAAiB,CAAA,EACjBC,EAAkB,CAAA,EAExB2B,EAAY,UAAU,SAAS,QAAQ,SAAAC,EAAG,CAClC,IAAApF,EAAAlC,EAAe8C,GAAoBwE,EAAI,IAAI,EAAC,CAAA,EAA3C5E,EAAQR,EAAA,CAAA,EACTb,EAAa,CACjB,KAAMqB,EACN,GAAI,cACJ,OAAQ,CAAA,EACR,WAAY,CAAA,EACZ,SAAU,QACV,YAAa,CAAA,EACb,WAAY,CAAC,MAAO,CAAC,MAAO6E,GAAgBD,EAAI,IAAI,EAAG,KAAM,OAAO,CAAC,EACrE,SAAU,CAAA,GAEZjG,EAAK,aAAeiG,EAAI,KACxB7B,EAAO,KAAKpE,CAAI,EAChBmE,EAAM9C,CAAQ,EAAIrB,CACpB,CAAC,EAED,IAAMwE,EAAW,OAAO,KAAKL,CAAK,EAClCK,EAAS,QAAQ,SAAAC,EAAG,CAClB,IAAMzE,EAAOmE,EAAMM,CAAG,EACtBzE,EAAK,WAAW,QAAQ,SAACP,EAAMmB,EAAK,CAC5B,IAAAC,EAAAlC,EAA2B8C,GAAoBhC,CAAI,EAAC,CAAA,EAAnD4B,EAAQR,EAAA,CAAA,EAAIc,EAAUd,EAAA,CAAA,EACvB6D,EAAYP,EAAM9C,CAAQ,EAChC,GAAIqD,EAAU,SAAW,KAAM,CAC7B,IAAMC,EAAcD,EAAU,QAAQ,QAAQ/C,CAAU,EACxD,GAAIgD,IAAgB,GAAI,CACtB,IAAMjD,EAAY,GAAA,OAAGL,EAAY,GAAA,EAAA,OAAAsD,CAAW,EAE5C3E,EAAK,WAAWY,CAAK,EAAIc,CAC1B,CACF,CACD1B,EAAK,OAAO,KAAK0E,CAAS,EAC1BA,EAAU,SAAS,KAAK1E,CAAI,CAC9B,CAAC,CACH,CAAC,EAED,IAAMmG,EAAgBH,EAAY,IAElCA,EAAY,UAAU,UAAU,QAAQ,SAAAI,EAAM,CACtC,IAAAvF,EAAAlC,EAAoB8C,GAAoB0E,EAAcC,EAAO,IAAI,CAAC,EAAC,CAAA,EAAlE/E,EAAQR,EAAA,CAAA,EAAED,EAAKC,EAAA,CAAA,EAChBb,EAAOmE,EAAM9C,CAAQ,EACvBrB,GAAQ,OACVA,EAAK,cAAgBY,EACrByD,EAAQ,KAAKrE,CAAI,EAErB,CAAC,EAED,IAAM6D,EAAY,KAAK,mBAAmBmC,CAAW,EACrD,MAAO,CAAC,MAAK7B,EAAE,OAAMC,EAAE,QAAOC,EAAE,QAAOJ,EAAE,aAAYD,EAAE,UAASH,CAAA,GAG1DxB,EAAkB,UAAA,mBAAlB,SAAmB2D,EAAoC,CAAvD,IAiBPlC,EAAA,KAfC,MAAO,CACL,WAAYkC,EAAY,UAAU,KAClC,OAAQA,EAAY,UAAU,SAAS,OACnC,SAACrC,EAAKsC,EAAG,CACP,OAAAtC,EAAIsC,EAAI,IAAI,EAAInC,EAAK,mBAAmBmC,CAAG,EACpCtC,GAET,CAAA,CAA6C,EACjD,QAASqC,EAAY,UAAU,UAAU,OACrC,SAACrC,EAAKsC,EAAG,CACP,OAAAtC,EAAIsC,EAAI,IAAI,EAAInC,EAAK,mBAAmBmC,EAAKD,EAAY,GAAG,EACrDrC,GAET,CAAA,CAA6C,IAI7CtB,EAAA,UAAA,mBAAA,SACJ4D,EACAI,EAAiC,CACnC,IAAI5G,EAAOwG,EAAI,KACf,OAAII,GAAW,OACb5G,EAAO4G,EAAQ5G,CAAI,GAEd,CAAC,KAAIA,EAAE,MAAOwG,EAAI,IAAI,GAEhC5D,CAAA,GAAA,EAEK,SAAUiE,GAAaC,EAAY,CACvC,IAAMC,EAASnK,GAAAA,IAAG,EAAG,OACrB,GAAI,OAAOmK,EAAO,KAAS,IACzB,OAAOA,EAAO,KAAKD,CAAI,EAClB,GAAI,OAAO,OAAW,IAC3B,OAAO,IAAI,OAAOA,EAAM,QAAQ,EAAE,SAAQ,EAE1C,MAAM,IAAI,MACN,kFACqC,CAE7C,CAEgB,SAAAE,GAAiBjI,EAAckI,EAAiB,CAC9D,IAAMvJ,EACF,MAAM,QAAQqB,CAAC,EAAI,OAAO,aAAa,MAAM,KAAMA,CAAC,EAAI8H,GAAa9H,CAAC,EAC1E,OAAOkI,EAAWvJ,EAAQA,EAAM,YAAW,CAC7C,CAEM,SAAUkI,GACZsB,EAA+ClH,EAAcmH,EAC7DF,EAAgB,CAAhBA,IAAA,SAAAA,EAAgB,IAClB,IAAMvB,EAAQwB,EAAMlH,CAAI,EACxB,OAAI0F,GAAS,KACJsB,GAAiBtB,EAAM,EAAGuB,CAAQ,EAEpCE,CACT,UAEgBnB,GACZkB,EAA+ClH,EAC/CmH,EAAY,CACd,IAAMzB,EAAQwB,EAAMlH,CAAI,EACxB,OAAO0F,EAAQA,EAAM,EAAIyB,CAC3B,UAEgBrB,GACZoB,EAA+ClH,EAC/CmH,EAAW,CACb,IAAMzB,EAAQwB,EAAMlH,CAAI,GAAK,CAAA,EACvBtC,EACFgI,EAAM,GAAQ,KAAOA,EAAM,EAAQA,EAAM,GAAQ,KAAOA,EAAM,EAAOyB,EACzE,OAAQ,OAAOzJ,GAAU,SAAYA,EAAQ,SAASA,EAAO,EAAE,CACjE,CAEM,SAAU+I,GAAgB/I,EAAiC,CAK/D,OAJI,OAAQA,GAAW,WAErBA,EAAQ0J,GAAoB1J,CAAY,GAElCA,EAAK,CACX,KAAK0J,GAAoB,SACzB,KAAKA,GAAoB,QACvB,MAAO,UACT,KAAKA,GAAoB,SACzB,KAAKA,GAAoB,SACzB,KAAKA,GAAoB,QACzB,KAAKA,GAAoB,SACvB,MAAO,QACT,KAAKA,GAAoB,QACvB,MAAO,OACT,KAAKA,GAAoB,UACvB,MAAO,UACT,KAAKA,GAAoB,UACvB,MAAO,SACT,KAAKA,GAAoB,aACzB,KAAKA,GAAoB,cACvB,MAAO,YACT,QAGE,OAAO,IACV,CACH,UAEgBd,GACZY,EAA+ClH,EAC/CmH,EAAW,CACb,IAAMzB,EAAQwB,EAAMlH,CAAI,EACxB,OAAI0F,GAASA,EAAM,KACVA,EAAM,KAAK,KAEbyB,CACT,UAEgBf,GACZc,EAA+ClH,EAC/CmH,EAAa,CACf,IAAMzB,EAAQwB,EAAMlH,CAAI,EACxB,OAAI0F,GAASA,EAAM,KACVe,GAAgBf,EAAM,IAAI,EAE5ByB,CACT,UAEgBd,GACZa,EAA+ClH,EAC/CmH,EAAe,CACjB,IAAMzB,EAAQwB,EAAMlH,CAAI,EACxB,OAAI0F,GAASA,EAAM,MAAQA,EAAM,KAAK,KAC7BA,EAAM,KAAK,KAAK,IAAI,SAAA/G,EAAK,CAAA,OAAA8H,GAAgB9H,CAAC,CAAjB,CAAkB,EAE7CwI,CACT,CAEM,SAAUE,GAAsBC,EAA8B,CAElE,GAAI,CAAAA,EAAM,YAGV,OAAIA,EAAM,KAAO,KACRA,EAAM,IAAI,IACb,SAAAC,EACI,CAAA,OAAC,OAAOA,EAAI,MAAS,SAAYA,EAAI,KAAO,SAASA,EAAI,KAAM,EAAE,CAAjE,CAAkE,EAErE,CAAA,CACT,UAEgBrB,GACZgB,EAA+ClH,EAC/CmH,EAAc,CAChB,IAAMzB,EAAQwB,EAAMlH,CAAI,EACxB,OAAI0F,GAASA,EAAM,MACV2B,GAAsB3B,EAAM,KAAK,EAEnCyB,CACT,UAEgBpB,GACZmB,EAA+ClH,EAC/CmH,EAAa,CACf,IAAMzB,EAAQwB,EAAMlH,CAAI,EACxB,OAAI0F,IACOA,EAAM,KAAK,GAAKA,EAAM,KAAK,EAAE,OAASA,EAAM,KAAK,EACXA,EAAM,KAAK,IAClD,CAAA,GACH,IAAI,SAAA/G,EAAK,CAAA,OAAC,OAAOA,GAAM,SAAYA,EAAI,SAASA,EAAG,EAAE,CAAC,CAAA,EAEtDwI,CACT,CAEM,SAAUtB,GACZqB,EAA+ClH,EAAcmH,EAC7DF,EAAgB,CAAhBA,IAAA,SAAAA,EAAgB,IAClB,IAAMvB,EAAQwB,EAAMlH,CAAI,EACxB,OAAI0F,GAASA,EAAM,MAAQA,EAAM,KAAK,EAC7BA,EAAM,KAAK,EAAE,IAAI,SAAC/G,EAAC,CACxB,OAAOqI,GAAiBrI,EAAGsI,CAAQ,CACrC,CAAC,EAEIE,CACT,UAEgBhB,GACZe,EAA+ClH,EAC/CmH,EAAe,CACjB,IAAMzB,EAAQwB,EAAMlH,CAAI,EACxB,OAAI0F,GAASA,EAAM,MAAQA,EAAM,KAAK,MAC7BA,EAAM,KAAK,MAAM,IAAI,SAAC/G,EAAC,CAC5B,OAAO0I,GAAsB1I,CAAC,CAChC,CAAC,EAEIwI,CACT,UAEgBlB,GACZiB,EAA+ClH,EAC/CmH,EAAc,CAChB,IAAMzB,EAAQwB,EAAMlH,CAAI,EACxB,OAAI0F,GAASA,EAAM,MAAQA,EAAM,KAAK,EAC7BA,EAAM,KAAK,EAEbyB,CACT,CCrkBA,IAAAK,IAAA,UAAA,CAGE,SAAAA,EACYjH,EAAoBC,EACpBC,EAAyB,CAFrC,IAWC4D,EAAA,KAVW,KAAI,KAAJ9D,EAAoB,KAAS,UAATC,EACpB,KAAO,QAAPC,EAJI,KAAM,OAAa,CAAA,EACnB,KAAK,MAA+B,CAAA,EAIlD,KAAK,OAASF,EAAK,WAAW,IAAI,SAAAP,EAAI,CAAI,OAAAqE,EAAK,SAASrE,CAAI,CAAC,CAAA,EACzDO,EAAK,UAAY,OACnB,KAAK,MAAQ,OAAO,KAAKA,EAAK,QAAQ,EACpB,OAAO,SAAC2G,EAAmClC,EAAG,CAC7C,OAAAkC,EAAMlC,CAAG,EAAIX,EAAK,QAAQW,CAAG,EACtBkC,GACN,CAAA,CAAE,GAQlB,OAAAM,EAAQ,UAAA,SAAR,SAASxH,EAAY,CAC3B,OAAOe,GAAUf,EAAM,KAAK,UAAW,KAAK,OAAO,GAO7CwH,EAAA,UAAA,QAAA,SAAQxH,EAAcyH,EAAwB,CACpD,IAAM/J,EAAQ,KAAK,KAAK,SAASsC,CAAI,EACrC,GAAItC,EAAM,QAAU,KAClB,OAAOqD,GAAUf,EAAM,KAAK,UAAW,KAAK,OAAO,EAErD,GAAItC,EAAM,GAAK,MAAQA,EAAM,GAAK,KAChC,OAAOoI,GAAe,KAAK,KAAK,SAAU9F,EAAMyH,CAAsB,EAExE,GAAI/J,EAAM,GAAK,KACb,OAAOkI,GAAe,KAAK,KAAK,SAAU5F,EAAMyH,CAAsB,EAExE,GAAI/J,EAAM,GAAK,KACb,OAAOsI,GAAa,KAAK,KAAK,SAAUhG,EAAMyH,CAAuB,EAEvE,GAAI/J,EAAM,OAAS,KACjB,OAAOwI,GACH,KAAK,KAAK,SAAUlG,EAAMyH,CAAwB,EAExD,GAAI/J,EAAM,MAAQ,KAChB,OAAO0I,GAAc,KAAK,KAAK,SAAUpG,EAAMyH,CAAwB,EAEzE,GAAI/J,EAAM,MAAQ,KAAM,CACtB,GAAIA,EAAM,KAAK,GAAK,MAAQA,EAAM,KAAK,GAAK,KAC1C,OAAOqI,GACH,KAAK,KAAK,SAAU/F,EAAMyH,CAAwB,EAExD,GAAI/J,EAAM,KAAK,GAAK,KAClB,OAAOmI,GACH,KAAK,KAAK,SAAU7F,EAAMyH,CAAwB,EAExD,GAAI/J,EAAM,KAAK,OAAS,KACtB,OAAOyI,GACH,KAAK,KAAK,SAAUnG,EAAMyH,CAA0B,EAE1D,GAAI/J,EAAM,KAAK,GAAK,KAClB,OAAOuI,GACH,KAAK,KAAK,SAAUjG,EAAMyH,CAAyB,EAEzD,GAAI/J,EAAM,KAAK,MAAQ,KACrB,OAAO2I,GACH,KAAK,KAAK,SAAUrG,EAAMyH,CAA0B,CAE3D,CAED,OAAOA,GAEVD,CAAA,GAAA,ECjFM,IAAME,GAAkB,KAClBC,GAAkB,KA6E/BC,IAAA,UAAA,CAAA,SAAAA,GAAA,EACE,OAAAA,EAAQ,UAAA,SAAR,SAASC,EAAc,CACrB,OAAOC,GAAkB,UAAU,GAErCF,EAAM,UAAA,OAAN,SAAOC,EAAc,CACnB,OAAOC,GAAkB,QAAQ,GAEnCF,EAAA,UAAA,eAAA,UAAA,CACE,MAAO,IAETA,EAAI,UAAA,KAAJ,SAAKtJ,EAAa,CAChB,OAAOwJ,GAAkB,MAAM,GAEjCF,EAAI,UAAA,KAAJ,SAAKC,EAAc,CACjB,OAAOC,GAAkB,MAAM,GAEjCF,EAAQ,UAAA,SAAR,SAASC,EAAc,CACrB,OAAOC,GAAkB,UAAU,GAErCF,EAAA,UAAA,UAAA,SAAUC,EAAgBE,EAA0B,CAClD,OAAOD,GAAkB,WAAW,GAEtCF,EAAA,UAAA,WAAA,UAAA,CACE,OAAOE,GAAkB,YAAY,GAEvCF,EAAA,UAAA,YAAA,SAAYC,EAAgBG,EAAe,CACzC,OAAOF,GAAkB,aAAa,GAExCF,EAAA,UAAA,MAAA,SAAMK,EAAuBX,EAAiBY,EAAe,CAC3D,OAAOJ,GAAkB,OAAO,GAElCF,EAAI,UAAA,KAAJ,SACIC,EAAgBI,EAAuBX,EAAiBY,EACxDC,EAAgB,CAClB,OAAOL,GAAkB,MAAM,GAGjCF,EAAA,UAAA,wBAAA,SACIK,EAA8BX,EAAiBY,EAAe,CAChE,OAAOJ,GAAkB,yBAAyB,GAGpDF,EAAA,UAAA,OAAA,UAAA,CACE,OAAOE,GAAkB,QAAQ,GAGnCF,EAAA,UAAA,eAAA,UAAA,CACE,OAAOE,GAAkB,gBAAgB,GAG3CF,EAAA,UAAA,QAAA,UAAA,CACE,OAAO,KAAK,eAAc,IAAO,GAAKF,GAAkBC,IAE1DC,EAAA,UAAA,QAAA,UAAA,CACE,OAAOE,GAAkB,SAAS,GAErCF,CAAA,GAAA,EAED,SAASE,GAAkBM,EAAkB,CAC3C,MAAM,IAAI,MACN,IAAA,OAAIA,EAAgE,sDAAA,EACpE,sEAAsE,CAC5E,CCXgB,SAAAC,EAAOC,EAAeC,EAAiB,CACrD,GAAI,CAACD,EACH,MAAM,IAAI,MAAM,OAAOC,GAAQ,SAAWA,EAAMA,EAAG,CAAE,CAEzD,UAEgBC,GACZC,EAAkBC,EAAkBC,EAAuB,CAAvBA,IAAA,SAAAA,EAAuB,IAC7DN,EACIO,GAAYH,EAAQC,CAAM,EAC1B,UAAM,CAAA,OAAAC,EAAqB,WAAA,OAAWF,EAAc,OAAA,EAAA,OAAAC,EAAM,aAAA,CAApD,CAAiE,CAC7E,CAEM,SAAUG,GAAcC,EAAa,CACzCT,EACIS,GAAK,KACL,UAAM,CAAA,MAAA,+DAA+D,CAAA,CAC3E,CAaM,SAAUC,GAAczB,EAAe,CAC3C,GAAIA,EAAM,SAAW,EAEnB,MAAO,GAGT,QADI0B,EAAO1B,EAAM,CAAC,EACTrI,EAAI,EAAGA,EAAIqI,EAAM,OAAQrI,IAChC+J,GAAQ1B,EAAMrI,CAAC,EAEjB,OAAO+J,CACT,CAMgB,SAAAC,GAAoBC,EAAcC,EAAY,CAC5D,GAAID,IAAOC,EACT,MAAO,GAOT,GAJID,GAAM,MAAQC,GAAM,MAIpBD,EAAG,SAAWC,EAAG,OACnB,MAAO,GAGT,QAASlK,EAAI,EAAGA,EAAIiK,EAAG,OAAQjK,IAC7B,GAAIiK,EAAGjK,CAAC,IAAM,MAAQkK,EAAGlK,CAAC,IAAM,MAAQiK,EAAGjK,CAAC,IAAMkK,EAAGlK,CAAC,EACpD,MAAO,GAGX,MAAO,EACT,CAEgB,SAAA2J,GAAYM,EAAgBC,EAAc,CACxD,GAAID,IAAOC,EACT,MAAO,GAMT,GAJID,GAAM,MAAQC,GAAM,MAIpBD,EAAG,SAAWC,EAAG,OACnB,MAAO,GAET,QAASlK,EAAI,EAAGA,EAAIiK,EAAG,OAAQjK,IAC7B,GAAIiK,EAAGjK,CAAC,IAAMkK,EAAGlK,CAAC,EAChB,MAAO,GAGX,MAAO,EACT,CAEM,SAAUmK,GAAMN,EAAS,CAC7B,OAAOA,EAAI,IAAM,CACnB,CA4CgB,SAAAO,GAASP,EAAWE,EAAY,CAC9C,OAAIA,GAAQF,EAAE,OACLA,EAEFA,EAAI,IAAI,OAAOE,EAAOF,EAAE,MAAM,CACvC,CA0FgB,SAAAQ,GACZC,EAAuBjC,EAAe,CACxC,IAAMkC,EAAOlC,EAAM,OAGnB,OAAAiC,EAAOA,GAAQ,KAAOjC,EAAM,IAAI,SAACvI,EAAGE,EAAM,CAAA,OAAAA,CAAC,CAAA,EAAI,CAAA,EAAG,OAAOsK,CAAI,EAG7DlB,EACIkB,EAAK,MAAM,SAAAE,EAAM,CAAA,OAAAA,GAAM,CAACD,GAAQC,EAAKD,CAApB,CAAwB,EACzC,UACI,CAAA,MAAA,+CAA+C,OAAAA,EAAS,IAAA,EAAA,OAAAA,EAAY,QAAA,EACpE,YAAA,OAAYD,CAAI,CADhB,CACkB,EAG1BlB,EACIkB,EAAK,MAAM,SAAAE,EAAM,CAAA,OAAAL,GAAMK,CAAE,CAAR,CAAS,EAC1B,UAAA,CAAM,MAAA,iDACF,YAAA,OAAYF,CAAI,CADd,CACgB,EAGnBA,EAAK,IAAI,SAAAT,EAAK,CAAA,OAAAA,EAAI,EAAIU,EAAOV,EAAIA,CAAC,CAAA,CAC3C,CAGgB,SAAAY,GAAapC,EAAiBiC,EAAe,CAS3D,QAPMI,EAAqB,CAAA,EACrBC,EAAqB,CAAA,EACrBC,EAAeN,GAAQ,MAAQ,MAAM,QAAQA,CAAI,GAAKA,EAAK,SAAW,EACtEO,EAAQP,GAAQ,MAAQM,EAC1B,KACAP,GAAeC,EAAMjC,CAAK,EAAE,KAAI,EAChCyC,EAAI,EACC,EAAI,EAAG,EAAIzC,EAAM,OAAQ,EAAE,EAAG,CACrC,GAAIwC,GAAQ,KAAM,CAChB,GAAIA,EAAKC,CAAC,IAAM,GAAKzC,EAAM,CAAC,IAAM,EAChC,MAAM,IAAI,MACN,sBAAA,OAAsB,EAAC,kBAAA,EAAA,OAAmBA,EAAM,CAAC,EAAa,YAAA,CAAA,GAE/DwC,EAAKC,CAAC,GAAK,MAAQD,EAAKC,CAAC,EAAI,IAAMzC,EAAM,CAAC,IAAM,IACnDqC,EAAS,KAAKrC,EAAM,CAAC,CAAC,EACtBsC,EAAS,KAAK,CAAC,GAEbE,EAAKC,CAAC,GAAK,GACbA,GAEH,CACGzC,EAAM,CAAC,IAAM,IACfqC,EAAS,KAAKrC,EAAM,CAAC,CAAC,EACtBsC,EAAS,KAAK,CAAC,EAElB,CACD,MAAO,CAAC,SAAQD,EAAE,SAAQC,CAAA,CAC5B,CAEgB,SAAAI,GACZ9B,EAAUc,EAAY,CACxB,OAAOiB,GAAqB/B,EAAOc,CAAI,CACzC,CAEgB,SAAAiB,GACZ/B,EAAUc,EAAY,CACxB,IAAIf,EAAS,KACb,GAAIC,GAAS,MAAQA,IAAU,UAC7BD,EAAS,IAAI,aAAae,CAAI,UACrBd,IAAU,QACnBD,EAAS,IAAI,WAAWe,CAAI,UACnBd,IAAU,OACnBD,EAAS,IAAI,WAAWe,CAAI,UACnBd,IAAU,SACnBD,EAAS,IAAI,MAAce,CAAI,MAE/B,OAAM,IAAI,MAAM,qBAAA,OAAqBd,CAAK,CAAE,EAE9C,OAAOD,CACT,CAEgB,SAAAiC,GACZC,EAA+BjC,EAAQ,CACzC,QAASjJ,EAAI,EAAGA,EAAIkL,EAAK,OAAQlL,IAAK,CACpC,IAAMmL,EAAMD,EAAKlL,CAAC,EAClB,GAAI,MAAMmL,CAAG,GAAK,CAAC,SAASA,CAAG,EAC7B,MAAM,MAAM,oBAAoB,OAAAlC,EAAK,2BAAA,EAAA,OAA4BkC,EAAG,GAAA,CAAG,CAE1E,CACH,CAGM,SAAUC,GAAanC,EAAe,CAC1C,OAAOA,IAAU,QAAUA,IAAU,aAAeA,IAAU,WAC1DA,IAAU,SAAWA,IAAU,QACrC,CAsBM,SAAUoC,GAAgBpC,EAAe,CAC7C,GAAIA,IAAU,WAAaA,IAAU,QACnC,MAAO,GACF,GAAIA,IAAU,YACnB,MAAO,GACF,GAAIA,IAAU,OACnB,MAAO,GAEP,MAAM,IAAI,MAAM,iBAAA,OAAiBA,CAAK,CAAE,CAE5C,CAQM,SAAUqC,GAAqBC,EAAiB,CACpD,GAAIA,GAAO,KACT,MAAO,GAET,IAAIC,EAAQ,EACZ,OAAAD,EAAI,QAAQ,SAAAE,EAAK,CAAA,OAAAD,GAASC,EAAE,MAAX,CAAiB,EAC3BD,CACT,CAGM,SAAUE,GAASjN,EAAS,CAChC,OAAO,OAAOA,GAAU,UAAYA,aAAiB,MACvD,CAEM,SAAUkN,GAAUlN,EAAS,CACjC,OAAO,OAAOA,GAAU,SAC1B,CAEM,SAAUmN,GAASnN,EAAS,CAChC,OAAO,OAAOA,GAAU,QAC1B,CAEM,SAAUoN,GAAW7C,EAAuC,CAChE,OAAI,MAAM,QAAQA,CAAM,EACf6C,GAAW7C,EAAO,CAAC,CAAC,EAEzBA,aAAkB,aACb,UAELA,aAAkB,YAAcA,aAAkB,YAClDA,aAAkB,kBACb,QACE4C,GAAS5C,CAAM,EACjB,UACE0C,GAAS1C,CAAM,EACjB,SACE2C,GAAU3C,CAAM,EAClB,OAEF,SACT,CAEM,SAAU8C,GAAWzM,EAAW,CACpC,MAAO,CAAC,EAAEA,GAAKA,EAAE,aAAeA,EAAE,MAAQA,EAAE,MAC9C,CAWM,SAAU0M,GAAe1D,EAAe,CAC5C,IAAMkC,EAAOlC,EAAM,OACnB,GAAIkC,EAAO,EACT,MAAO,CAAA,EAKT,IAAMyB,EAAU,IAAI,MAAMzB,EAAO,CAAC,EAClCyB,EAAQzB,EAAO,CAAC,EAAIlC,EAAMkC,EAAO,CAAC,EAClC,QAASvK,EAAIuK,EAAO,EAAGvK,GAAK,EAAG,EAAEA,EAC/BgM,EAAQhM,CAAC,EAAIgM,EAAQhM,EAAI,CAAC,EAAIqI,EAAMrI,EAAI,CAAC,EAE3C,OAAOgM,CACT,CAEA,SAASC,GACLC,EAAgB7D,EAAiBwB,EAAesC,EAAiB,CAAjBA,IAAA,SAAAA,EAAiB,IACnE,IAAMC,EAAM,IAAI,MAChB,GAAI/D,EAAM,SAAW,EAEnB,QADMvK,EAAIuK,EAAM,CAAC,GAAK8D,EAAY,EAAI,GAC7BnM,EAAI,EAAGA,EAAIlC,EAAGkC,IACrBoM,EAAIpM,CAAC,EAAI6J,EAAEqC,EAASlM,CAAC,MAMvB,SAHMlC,EAAIuK,EAAM,CAAC,EACXgE,EAAOhE,EAAM,MAAM,CAAC,EACpBiE,EAAMD,EAAK,OAAO,SAACE,EAAKC,EAAM,CAAA,OAAAD,EAAMC,CAAN,CAAO,GAAKL,EAAY,EAAI,GACvDnM,EAAI,EAAGA,EAAIlC,EAAGkC,IACrBoM,EAAIpM,CAAC,EAAIiM,GAAkBC,EAASlM,EAAIsM,EAAKD,EAAMxC,EAAGsC,CAAS,EAGnE,OAAOC,CACT,UAGgBK,GACZpE,EAAiBwB,EAAesC,EAAiB,CACnD,GADkCA,IAAA,SAAAA,EAAiB,IAC/C9D,EAAM,SAAW,EAEnB,OAAOwB,EAAE,CAAC,EAEZ,IAAME,EAAO1B,EAAM,OAAO,SAACkE,EAAKC,EAAM,CAAA,OAAAD,EAAMC,CAAN,CAAO,GAAKL,EAAY,EAAI,GAClE,GAAIpC,IAAS,EAEX,MAAO,CAAA,EAET,GAAIA,IAASF,EAAE,OACb,MAAM,IAAI,MAAM,IAAA,OAAIxB,EAAwC,kCAAA,EAAA,OAAAwB,EAAE,MAAM,EAAA,OAChEsC,EAAY,wBAA0B,GAAK,GAAA,CAAA,EAGjD,OAAOF,GAAkB,EAAG5D,EAAOwB,EAAGsC,CAAS,CACjD,CAmBgB,SAAAO,GACZ3C,EAAcd,EAAQ,CAExB,QADM0D,EAAQC,GAAoB7C,EAAMd,CAAK,EACpCjJ,EAAI,EAAGA,EAAI2M,EAAM,OAAQ3M,IAChC2M,EAAM3M,CAAC,EAAI,EAEb,OAAO2M,CACT,CAEgB,SAAAC,GACZ7C,EAAcd,EAAQ,CACxB,GAAIA,GAAS,MAAQA,IAAU,WAAaA,IAAU,YACpD,OAAO,IAAI,aAAac,CAAI,EACvB,GAAId,IAAU,QACnB,OAAO,IAAI,WAAWc,CAAI,EACrB,GAAId,IAAU,OACnB,OAAO,IAAI,WAAWc,CAAI,EAE1B,MAAM,IAAI,MAAM,qBAAA,OAAqBd,CAAK,CAAE,CAEhD,CAqBM,SAAU4D,GAAmCxE,EAAe,CAChEA,EAAM,QAAQ,SAAAyE,EAAO,CACnB1D,EACI,OAAO,UAAU0D,CAAO,GAAKA,GAAW,EACxC,UAAA,CACI,MAAA,mEACA,UAAA,OAAUzE,EAAK,IAAA,CADf,CACmB,CAC7B,CAAC,CACH,CAqDM,SAAU0E,GAAUC,EAAW,CAOnC,OAAOA,GAAUA,EAAO,MAAQ,OAAOA,EAAO,MAAS,UACzD,CCrtBA,IAAMC,GAA4B,YAmBlCC,IAAA,UAAA,CAaE,SAAAA,EAAmBpF,EAAW,CAAX,KAAM,OAANA,EAZX,KAAK,MAAU,CAAA,EACf,KAAY,aAA4C,CAAA,EAExD,KAAQ,SAAU,CAAA,EAM1B,KAAc,eAAGqF,GAIf,KAAK,iBAAgB,EAGvB,OAAAD,EAAA,UAAA,YAAA,SAAYE,EAAsBC,EAAkB,CAC9C,KAAK,UAAY,OACb1P,GAAG,EAAG,QAAQ,SAAS,GAAKA,GAAG,EAAG,QAAQ,MAAM,GACpD,QAAQ,KACJ,YAAA,OAAY,KAAK,aAAqC,yBAAA,EACtD,iCAAiC,OAAAyP,EAAe,GAAA,CAAA,GAGxD,KAAK,aAAeA,EACpB,KAAK,SAAWC,GAGlBH,EAAA,UAAA,aAAA,SACII,EAAkBC,EAClBC,EAAoC,CAKtC,GAJA,KAAK,aAAaF,CAAQ,EAAI,CAAC,aAAYC,EAAE,QAAOC,CAAA,EAIhD,KAAK,SAASF,CAAQ,GAAK,KAAM,CACnC,IAAMG,EAAY,KAAK,SAASH,CAAQ,EAClC3P,GAAG,EAAG,QAAQ,SAAS,GAAKA,GAAG,EAAG,QAAQ,MAAM,GACpD,QAAQ,KACJ,qCAAA,OAAqC2P,EAAa,IAAA,EAAA,OAAAG,EAAY,GAAA,CAAA,EAEpE,KAAK,IAAIH,EAAUG,CAAS,CAC7B,GAGGP,EAAQ,UAAA,SAAd,SAAeI,EAAgB,mGAC7B,OAAIA,KAAY,KAAK,MACnB,CAAA,EAAO,KAAK,MAAMA,CAAQ,CAAC,GAG7BnL,EAAA,KAAK,MAAMM,EAAA6K,EAAY,CAAA,EAAM,KAAK,aAAaA,CAAQ,CAAC,UAAxD,OAAAnL,EAAoBM,CAAA,EAAGiL,EAAA,KAAA,EACvB,CAAA,EAAO,KAAK,MAAMJ,CAAQ,CAAC,MAC5B,EAEDJ,EAAG,UAAA,IAAH,SAAII,EAAgB,CAClB,GAAIA,KAAY,KAAK,MACnB,OAAO,KAAK,MAAMA,CAAQ,EAG5B,IAAMG,EAAY,KAAK,aAAaH,CAAQ,EAC5C,GAAIP,GAAUU,CAAS,EACrB,MAAM,IAAI,MACN,QAAA,OAAQH,EAA8C,sCAAA,EACtD,gCAAgC,EAGtC,YAAK,MAAMA,CAAQ,EAAIG,EAChB,KAAK,MAAMH,CAAQ,GAG5BJ,EAAS,UAAA,UAAT,SAAUI,EAAgB,CACxB,OAAO,KAAK,IAAIA,CAAQ,GAG1BJ,EAAO,UAAA,QAAP,SAAQI,EAAgB,CACtB,OAAO,KAAK,IAAIA,CAAQ,GAG1BJ,EAAS,UAAA,UAAT,SAAUI,EAAgB,CACxB,OAAO,KAAK,IAAIA,CAAQ,GAG1BJ,EAAA,UAAA,SAAA,UAAA,CACE,OAAO,KAAK,OAGd,OAAA,eAAIA,EAAQ,UAAA,WAAA,CAAZ,IAAA,UAAA,CACE,OAAO,KAAK,oCACb,CAAA,EAEDA,EAAA,UAAA,IAAA,SAAII,EAAkB7O,EAAgB,CACpC,GAAI,KAAK,aAAa6O,CAAQ,GAAK,KACjC,MAAM,IAAI,MACN,mBAAA,OAAmBA,EAAQ,iCAAA,CAAiC,EAElE,KAAK,MAAMA,CAAQ,EAAI7O,EACnB,KAAK,aAAa6O,CAAQ,EAAE,SAAW,MACzC,KAAK,aAAaA,CAAQ,EAAE,QAAQ7O,CAAK,GAIrCyO,EAAY,UAAA,aAAZ,SAAaI,EAAgB,CACnC,GAAI,KAAK,aAAaA,CAAQ,GAAK,KACjC,MAAM,IAAI,MACN,yBAAA,OAAyBA,EAAQ,kCAAA,CAAkC,EAEzE,OAAO,KAAK,aAAaA,CAAQ,EAAE,aAAY,GAGjDJ,EAAQ,UAAA,SAAR,SAASS,EAAY,CACnB,KAAK,MAAQ,OAAO,OAAO,CAAA,EAAIA,CAAK,GAGtCT,EAAA,UAAA,MAAA,UAAA,CACE,KAAK,MAAQ,CAAA,EACb,KAAK,SAAW,CAAA,EAChB,KAAK,iBAAgB,GAGfA,EAAA,UAAA,iBAAA,UAAA,CAAA,IAeP9H,EAAA,KAdC,GAAI,SAAO,KAAK,OAAW,KACvB,OAAO,KAAK,OAAO,SAAa,KAChC,OAAO,KAAK,OAAO,SAAS,OAAW,KAI3C,KAAMwI,EAAY,KAAK,eAAe,KAAK,OAAO,SAAS,MAAM,EACjE,GAAIX,MAA6BW,EAAW,CAC1C,IAAMC,EAAYD,EAAUX,EAAyB,EAAE,MAAM,GAAG,EAChEY,EAAU,QAAQ,SAAAC,EAAQ,CAClB,IAAA3L,EAAAlC,EAAe6N,EAAS,MAAM,GAAG,EAAqB,CAAA,EAArD/H,EAAG5D,EAAA,CAAA,EAAE1D,EAAK0D,EAAA,CAAA,EACjBiD,EAAK,SAASW,CAAG,EAAIgI,GAAWhI,EAAKtH,CAAK,CAC5C,CAAC,CACF,IAEJyO,CAAA,GAAA,EAEK,SAAUC,GAAea,EAAmB,CAChD,IAAMC,EAAS,CAAA,EACf,OAAAD,EAAY,QAAQ,8BAA+B,SAAClO,EAAC,SAAMV,EAAA,CAAA,EAAA8O,EAAA,EAAJA,EAAI,UAAA,OAAJA,IAAA9O,EAAI8O,EAAA,CAAA,EAAA,UAAAA,CAAA,EACzD,OAAAC,GAAYF,EAAQ7O,EAAE,CAAC,EAAGA,EAAE,CAAC,CAAC,EACvBA,EAAE,KAAK,GAAG,CACnB,CAAC,EACM6O,CACT,CAEA,SAASE,GACLF,EAAiClN,EAActC,EAAc,CAC/DwP,EAAO,mBAAmBlN,CAAI,CAAC,EAAI,mBAAmBtC,GAAS,EAAE,CACnE,CAEA,SAASsP,GAAWT,EAAkB7O,EAAa,CACjD,IAAM2P,EAAiB3P,EAAM,YAAW,EACxC,OAAI2P,IAAmB,QAAUA,IAAmB,QAC3CA,IAAmB,OACjB,GAAA,OAAG,CAAEA,CAAc,IAAOA,EAC5B,CAACA,EAED3P,CAEX,UAUgBd,IAAG,CACjB,OAAOD,EACT,CAEO,IAAIA,GAAmB,KACxB,SAAU2Q,GAAqBC,EAAwB,CAC3D5Q,GAAM4Q,CACR,CCrMA,IAAIC,YAEYC,IAAkB,CAChC,GAAID,IAAmB,KAAM,CAE3B,IAAIE,EAAO,OACX,GAAI,OAAQ,OAAY,IACtBA,EAAK,eACI,OAAQ,OAAY,IAC7BA,EAAK,eACI,OAAQ,QAAa,IAC9BA,EAAK,gBACI,OAAQ,KAAU,IAC3BA,EAAK,SAEL,OAAM,IAAI,MAAM,gCAAgC,EAElDF,GAAkBE,CACnB,CACD,OAAOF,EACT,CAGA,SAASG,IAAY,CACnB,IAAMD,EAAKD,GAAkB,EAC7B,OAAIC,EAAG,YAAc,OACnBA,EAAG,WAAa,IAAI,KAEfA,EAAG,UACZ,CASgB,SAAAE,GAAa5I,EAAa6I,EAAa,CACrD,IAAMC,EAAYH,GAAY,EAC9B,GAAIG,EAAU,IAAI9I,CAAG,EACnB,OAAO8I,EAAU,IAAI9I,CAAG,EAExB,IAAM+I,EAAYF,EAAI,EACtB,OAAAC,EAAU,IAAI9I,EAAK+I,CAAS,EACrBD,EAAU,IAAI9I,CAAG,CAE5B,CC1CO,IAAMgJ,GAAM,MAGNC,GAAO,OAGPC,GAAQ,QAGRC,GAAM,MAGNC,GAAO,OAGPC,GAAM,MAONC,GAAM,MAONC,GAAS,SAMTC,GAAS,SAMTC,GAAO,OAGPC,GAAQ,QAGRC,GAAO,OAGPC,GAAQ,QAGRC,GAAQ,QAGRC,GAAU,UAiBVC,GAAY,YAmBZC,GAAc,cAOdC,GAAiB,iBASjBC,GAAW,WAMXC,GAAa,aAUbC,GAAgB,gBAGhBC,GAAO,OAMPC,GAAO,OAGPC,GAAc,cAOdC,GAAU,UAGVC,GAAa,aAGbC,GAAS,SAMTC,GAAS,SAUTC,GAAuB,uBAUvBC,GAAsB,sBAUtBC,GAAS,SAkBTC,GAAwB,wBASxBC,GAAM,MAGNC,GAAO,OAGPC,GAAU,UAQVC,GAAS,SAQTC,GAAgB,gBAShBC,GAAgB,gBAOhBC,GAAe,eAOfC,GAAwB,wBAWxBC,GACT,sCAWSC,GACT,qCAWSC,GAAO,OAGPC,GAAa,aAuBbC,GAAU,UAGVC,GAAS,SAMTC,GAAM,MAMNC,GAAM,MAGNC,GAAQ,QAGRC,GAAM,MAGNC,GAAa,aAMbC,GAAQ,QAGRC,GAAM,MAGNC,GAAO,OAOPC,GAAgB,gBAGhBC,GAAQ,QAGRC,GAAW,WAGXC,GAAiB,iBAOjBC,GAAW,WAOXC,GAAW,WAGXC,GAAU,UAGVC,GAAe,eAGfC,GAAW,WAGXC,GAAO,OAGPC,GAAO,OAGPC,GAAW,WAGXC,GAAQ,QAGRC,GAAQ,QAGRC,GAAY,YAMZC,GAAO,OAGPC,GAAY,YAGZC,GAAW,WAMXC,GAAM,MAGNC,GAAQ,QAGRC,GAAa,aAGbC,GAAa,aAGbC,GAAY,YAgBZC,GAAM,MAuBNC,GAAM,MAONC,GAAU,UAGVC,GAAU,UAkBVC,GAAY,YAoBZC,GAAoB,oBASpBC,GAAO,OAOPC,GAAM,MAONC,GAAU,UAGVC,GAAY,YAOZC,GAAM,MAGNC,GAAc,cAQdC,GAAW,WAGXC,GAAM,MAGNC,GAAW,WAGXC,GAAsB,sBAStBC,GAAsB,sBAUtBC,GAAsB,sBAUtBC,GAAW,WAGXC,GAAS,SASTC,GAAO,OAMPC,GAAQ,QAURC,GAAM,MAGNC,GAAQ,QAGRC,GAAO,OAOPC,GAAe,eAQfC,GAAc,cAIdC,GAAuB,uBAQvBC,GAAQ,QAQRC,GAAO,OAGPC,GAAa,aAGbC,GAAO,OAGPC,GAAU,UAMVC,GAAwB,wBAaxBC,GAAiB,iBAYjBC,GAAQ,QAGRC,GAAU,UAMVC,GAAQ,QAGRC,GAAQ,QAGRC,GAAY,YAMZC,GAAsB,sBAKtBC,GAAe,eAOfC,GAAS,SAGTC,GAAO,OAGPC,GAAQ,QAMRC,GAAM,MAGNC,GAAO,OAGPC,GAAO,OAGPC,GAAU,UAGVC,GAAW,WAGXC,GAAO,OAGPC,GAAM,MAONC,GAAiB,iBAOjBC,GAAS,SAOTC,GAAU,UAMVC,GAAsB,sBAItBC,GAAgB,gBAIhBC,GAAoB,oBAIpBC,GAAmB,mBAInBC,GAAgB,gBAOhBC,GAAoB,oBAMpBC,GAAqB,qBAQrBC,GAAe,eAafC,GAAe,eAWfC,GAAc,cAMdC,GAAyB,yBAMzBC,GAAM,MAGNC,GAAM,MAGNC,GAAO,OAGPC,GAAO,OAMPC,GAAO,OAOPC,GAAY,YASZC,GAAY,YAMZC,GAAS,SAQTC,GAAS,SAMTC,GAAqB,qBAWrBC,GAAY,YAMZC,GAAO,OAePC,GAAmB,mBAQnBC,GAAe,eAgBfC,GAAc,cAiBdC,GAAuB,gCCr/BpBC,IAAI,SAAkBxP,EAAA,CAAA,EAAA4E,EAAA,EAAjBA,EAAiB,UAAA,OAAjBA,IAAA5E,EAAiB4E,CAAA,EAAA,UAAAA,CAAA,EAC9BvQ,GAAG,EAAG,QAAQ,SAAS,GAAKA,GAAG,EAAG,QAAQ,MAAM,GACpD,QAAQ,KAAI,MAAZ,QAAO0C,GAAA,CAAA,EAAAJ,EAASqJ,CAAG,EAAE,EAAA,CAAA,CAEzB,CCCA,IAAMyP,GACJpK,GAAU,iBAAkB,UAAA,CAAM,OAAA,IAAI,GAAJ,CACjB,EACbqK,GACJrK,GAAU,eAAgB,UAAA,CAAM,OAAA,IAAI,GAAJ,CAA6B,EA2D/C,SAAAsK,GACZ9P,EAAoB+P,EAAmB,CACzC,IAAMnT,EAAMoT,GAAQhQ,EAAY+P,CAAW,EAC3C,OAAOH,GAAe,IAAIhT,CAAG,CAC/B,CAMM,SAAUqT,GAAYjQ,EAAkB,CAC5C,OAAO6P,GAAa,IAAI7P,CAAU,CACpC,CAEM,SAAUkQ,GAAqBH,EAAmB,CAItD,QAHMI,EAAKP,GAAe,QAAO,EAC3B/Z,EAAyB,CAAA,IAElB,CACL,IAAAmD,EAAgBmX,EAAG,KAAI,EAAtBC,EAAIpX,EAAA,KAAE1D,EAAK0D,EAAA,MAClB,GAAIoX,EACF,MAEI,IAAA9W,EAAAxC,EAAgBxB,EAAK,CAAA,EAApBsH,EAAGtD,EAAA,CAAA,EAAE+W,EAAM/W,EAAA,CAAA,EACZiL,EAAAzN,EAAc8F,EAAI,MAAM,GAAG,EAAC,CAAA,EAA3B0T,EAAO/L,EAAA,CAAA,EACV+L,IAAYP,GACdla,EAAO,KAAKwa,CAAM,CAErB,CACD,OAAOxa,CACT,CAwFA,SAASma,GAAQhQ,EACA+P,EAAmB,CAClC,MAAO,GAAG,OAAAA,EAAe,GAAA,EAAA,OAAA/P,CAAU,CACrC,CC/LM,SAAUuQ,GAAoB7P,EAAU,CAE5C,OAAOA,aAAa,cAAgBA,aAAa,YAC/CA,aAAa,YAAcA,aAAa,iBAC5C,osBCrBA8P,GAAiBC,GAKbC,GAAO,KAEX,GAAI,CACFA,GAAO,IAAI,YAAY,SAAS,IAAI,YAAY,OAAO,IAAI,WAAW,CACpE,EAAG,GAAI,IAAK,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,IAAK,IAAK,IAAK,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,IAAK,IAAK,EAAG,EAAG,EAAG,IAAK,IAAK,IAAK,GAAI,IAAK,EAAG,EAAG,EAAG,IAAK,IAAK,IAAK,GAAI,IAAK,EAAG,EAAG,EAAG,IAAK,IAAK,IAAK,GAAI,IAAK,EAAG,EAAG,EAAG,IAAK,IAAK,IAAK,GAAI,IAAK,EAAG,EAAG,EAAG,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,IAAK,EAAG,EAAG,GAAI,IAAK,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,EAAG,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,GAAI,EAAG,IAAK,GAAI,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,EAAG,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,GAAI,EAAG,IAAK,GAAI,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,EAAG,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,GAAI,EAAG,IAAK,GAAI,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,EAAG,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,GAAI,EAAG,IAAK,GAAI,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,EAAG,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,GAAI,EAAG,IAAK,EAC3nC,CAAA,CAAC,EAAG,CAAA,CAAE,EAAE,OACV,MAAW,CAEX,CAYD,SAASD,GAAKE,EAAKC,EAAMC,EAAQ,CAM7B,KAAK,IAAMF,EAAM,EAMjB,KAAK,KAAOC,EAAO,EAMnB,KAAK,SAAW,CAAC,CAACC,CACtB,CAyBAJ,GAAK,UAAU,WAEf,OAAO,eAAeA,GAAK,UAAW,aAAc,CAAE,MAAO,EAAI,CAAE,EAQnE,SAASK,GAAOC,EAAG,CACf,OAAQA,GAAOA,EAAI,cAAmB,EAC1C,CAQAN,GAAK,OAASK,GAOd,IAAIE,GAAY,CAAA,EAOZC,GAAa,CAAA,EAQjB,SAASC,GAAQ5b,EAAOub,EAAQ,CAC5B,IAAIE,EAAKI,EAAWC,EACpB,OAAIP,GACAvb,KAAW,GACP8b,EAAS,GAAK9b,GAASA,EAAQ,OAC/B6b,EAAYF,GAAW3b,CAAK,EACxB6b,GACOA,GAEfJ,EAAMM,GAAS/b,GAAQA,EAAQ,GAAK,EAAI,GAAK,EAAG,EAAI,EAChD8b,IACAH,GAAW3b,CAAK,EAAIyb,GACjBA,KAEPzb,GAAS,GACL8b,EAAS,MAAQ9b,GAASA,EAAQ,OAClC6b,EAAYH,GAAU1b,CAAK,EACvB6b,GACOA,GAEfJ,EAAMM,GAAS/b,EAAOA,EAAQ,EAAI,GAAK,EAAG,EAAK,EAC3C8b,IACAJ,GAAU1b,CAAK,EAAIyb,GAChBA,GAEf,CASAN,GAAK,QAAUS,GAQf,SAASI,GAAWhc,EAAOub,EAAQ,CAC/B,GAAI,MAAMvb,CAAK,EACX,OAAOub,EAAWU,GAAQC,GAC9B,GAAIX,EAAU,CACV,GAAIvb,EAAQ,EACR,OAAOic,GACX,GAAIjc,GAASmc,GACT,OAAOC,EACd,KAAM,CACH,GAAIpc,GAAS,CAACqc,GACV,OAAOC,GACX,GAAItc,EAAQ,GAAKqc,GACb,OAAOE,EACd,CACD,OAAIvc,EAAQ,EACDgc,GAAW,CAAChc,EAAOub,CAAQ,EAAE,IAAG,EACpCQ,GAAU/b,EAAQwc,GAAkB,EAAIxc,EAAQwc,GAAkB,EAAGjB,CAAQ,CACxF,CASAJ,GAAK,WAAaa,GASlB,SAASD,GAASU,EAASC,EAAUnB,EAAQ,CACzC,OAAO,IAAIJ,GAAKsB,EAASC,EAAUnB,CAAQ,CAC/C,CAWAJ,GAAK,SAAWY,GAShB,IAAIY,GAAU,KAAK,IASnB,SAASC,GAAWC,EAAKtB,EAAUuB,EAAK,CACpC,GAAID,EAAI,SAAW,EACf,MAAM,MAAM,cAAc,EAC9B,GAAIA,IAAQ,OAASA,IAAQ,YAAcA,IAAQ,aAAeA,IAAQ,YACtE,OAAOX,GASX,GARI,OAAOX,GAAa,UAEpBuB,EAAQvB,EACRA,EAAW,IAEXA,EAAW,CAAC,CAAEA,EAElBuB,EAAQA,GAAS,GACbA,EAAQ,GAAK,GAAKA,EAClB,MAAM,WAAW,OAAO,EAE5B,IAAIvd,EACJ,IAAKA,EAAIsd,EAAI,QAAQ,GAAG,GAAK,EACzB,MAAM,MAAM,iBAAiB,EAC5B,GAAItd,IAAM,EACX,OAAOqd,GAAWC,EAAI,UAAU,CAAC,EAAGtB,EAAUuB,CAAK,EAAE,IAAG,EAQ5D,QAHIC,EAAef,GAAWW,GAAQG,EAAO,CAAC,CAAC,EAE3Cvc,EAAS2b,GACJ3a,EAAI,EAAGA,EAAIsb,EAAI,OAAQtb,GAAK,EAAG,CACpC,IAAI+J,EAAO,KAAK,IAAI,EAAGuR,EAAI,OAAStb,CAAC,EACjCvB,EAAQ,SAAS6c,EAAI,UAAUtb,EAAGA,EAAI+J,CAAI,EAAGwR,CAAK,EACtD,GAAIxR,EAAO,EAAG,CACV,IAAI0R,EAAQhB,GAAWW,GAAQG,EAAOxR,CAAI,CAAC,EAC3C/K,EAASA,EAAO,IAAIyc,CAAK,EAAE,IAAIhB,GAAWhc,CAAK,CAAC,CACnD,MACGO,EAASA,EAAO,IAAIwc,CAAY,EAChCxc,EAASA,EAAO,IAAIyb,GAAWhc,CAAK,CAAC,CAE5C,CACD,OAAAO,EAAO,SAAWgb,EACXhb,CACX,CAUA4a,GAAK,WAAayB,GASlB,SAASK,GAAUC,EAAK3B,EAAQ,CAC5B,OAAI,OAAO2B,GAAQ,SACRlB,GAAWkB,EAAK3B,CAAQ,EAC/B,OAAO2B,GAAQ,SACRN,GAAWM,EAAK3B,CAAQ,EAE5BQ,GAASmB,EAAI,IAAKA,EAAI,KAAM,OAAO3B,GAAa,UAAYA,EAAW2B,EAAI,QAAQ,CAC9F,CASA/B,GAAK,UAAY8B,GAUjB,IAAIE,GAAiB,MAOjBC,GAAiB,GAAK,GAOtBZ,GAAiBW,GAAiBA,GAOlChB,GAAiBK,GAAiBA,GAOlCH,GAAiBF,GAAiB,EAOlCkB,GAAazB,GAAQwB,EAAc,EAMnClB,GAAON,GAAQ,CAAC,EAMpBT,GAAK,KAAOe,GAMZ,IAAID,GAAQL,GAAQ,EAAG,EAAI,EAM3BT,GAAK,MAAQc,GAMb,IAAIqB,GAAM1B,GAAQ,CAAC,EAMnBT,GAAK,IAAMmC,GAMX,IAAIC,GAAO3B,GAAQ,EAAG,EAAI,EAM1BT,GAAK,KAAOoC,GAMZ,IAAIC,GAAU5B,GAAQ,EAAE,EAMxBT,GAAK,QAAUqC,GAMf,IAAIjB,GAAYR,GAAS,GAAc,WAAc,EAAK,EAM1DZ,GAAK,UAAYoB,GAMjB,IAAIH,GAAqBL,GAAS,GAAc,GAAc,EAAI,EAMlEZ,GAAK,mBAAqBiB,GAM1B,IAAIE,GAAYP,GAAS,EAAG,YAAc,EAAK,EAM/CZ,GAAK,UAAYmB,GAMjB,IAAImB,EAAgBtC,GAAK,UAMzBsC,EAAc,MAAQ,UAAc,CAChC,OAAO,KAAK,SAAW,KAAK,MAAQ,EAAI,KAAK,GACjD,EAMAA,EAAc,SAAW,UAAiB,CACtC,OAAI,KAAK,UACI,KAAK,OAAS,GAAKjB,IAAmB,KAAK,MAAQ,GACzD,KAAK,KAAOA,IAAkB,KAAK,MAAQ,EACtD,EASAiB,EAAc,SAAW,SAAkBX,EAAK,CAE5C,GADAA,EAAQA,GAAS,GACbA,EAAQ,GAAK,GAAKA,EAClB,MAAM,WAAW,OAAO,EAC5B,GAAI,KAAK,OAAM,EACX,MAAO,IACX,GAAI,KAAK,WAAU,EACf,GAAI,KAAK,GAAGR,EAAS,EAAG,CAGpB,IAAIoB,EAAY1B,GAAWc,CAAK,EAC5Ba,EAAM,KAAK,IAAID,CAAS,EACxBE,EAAOD,EAAI,IAAID,CAAS,EAAE,IAAI,IAAI,EACtC,OAAOC,EAAI,SAASb,CAAK,EAAIc,EAAK,MAAK,EAAG,SAASd,CAAK,CAC3D,KACG,OAAO,IAAM,KAAK,IAAG,EAAG,SAASA,CAAK,EAQ9C,QAHIC,EAAef,GAAWW,GAAQG,EAAO,CAAC,EAAG,KAAK,QAAQ,EAC1De,EAAM,KACNtd,EAAS,KACA,CACT,IAAIud,EAASD,EAAI,IAAId,CAAY,EAC7BgB,EAASF,EAAI,IAAIC,EAAO,IAAIf,CAAY,CAAC,EAAE,MAAK,IAAO,EACvDiB,EAASD,EAAO,SAASjB,CAAK,EAElC,GADAe,EAAMC,EACFD,EAAI,OAAM,EACV,OAAOG,EAASzd,EAEhB,KAAOyd,EAAO,OAAS,GACnBA,EAAS,IAAMA,EACnBzd,EAAS,GAAKyd,EAASzd,CAE9B,CACL,EAMAkd,EAAc,YAAc,UAAoB,CAC5C,OAAO,KAAK,IAChB,EAMAA,EAAc,oBAAsB,UAA4B,CAC5D,OAAO,KAAK,OAAS,CACzB,EAMAA,EAAc,WAAa,UAAmB,CAC1C,OAAO,KAAK,GAChB,EAMAA,EAAc,mBAAqB,UAA2B,CAC1D,OAAO,KAAK,MAAQ,CACxB,EAMAA,EAAc,cAAgB,UAAsB,CAChD,GAAI,KAAK,WAAU,EACf,OAAO,KAAK,GAAGnB,EAAS,EAAI,GAAK,KAAK,IAAG,EAAG,cAAa,EAE7D,QADIY,EAAM,KAAK,MAAQ,EAAI,KAAK,KAAO,KAAK,IACnCe,EAAM,GAAIA,EAAM,IAChBf,EAAO,GAAKe,IAAS,EADFA,IACxB,CAEJ,OAAO,KAAK,MAAQ,EAAIA,EAAM,GAAKA,EAAM,CAC7C,EAMAR,EAAc,OAAS,UAAe,CAClC,OAAO,KAAK,OAAS,GAAK,KAAK,MAAQ,CAC3C,EAMAA,EAAc,IAAMA,EAAc,OAMlCA,EAAc,WAAa,UAAmB,CAC1C,MAAO,CAAC,KAAK,UAAY,KAAK,KAAO,CACzC,EAMAA,EAAc,WAAa,UAAmB,CAC1C,OAAO,KAAK,UAAY,KAAK,MAAQ,CACzC,EAMAA,EAAc,MAAQ,UAAc,CAChC,OAAQ,KAAK,IAAM,KAAO,CAC9B,EAMAA,EAAc,OAAS,UAAe,CAClC,OAAQ,KAAK,IAAM,KAAO,CAC9B,EAOAA,EAAc,OAAS,SAAgBS,EAAK,CAGxC,OAFK1C,GAAO0C,CAAK,IACbA,EAAQjB,GAAUiB,CAAK,GACvB,KAAK,WAAaA,EAAM,UAAa,KAAK,OAAS,KAAQ,GAAMA,EAAM,OAAS,KAAQ,EACjF,GACJ,KAAK,OAASA,EAAM,MAAQ,KAAK,MAAQA,EAAM,GAC1D,EAQAT,EAAc,GAAKA,EAAc,OAOjCA,EAAc,UAAY,SAAmBS,EAAK,CAC9C,MAAO,CAAC,KAAK,GAAmBA,CAAK,CACzC,EAQAT,EAAc,IAAMA,EAAc,UAQlCA,EAAc,GAAKA,EAAc,UAOjCA,EAAc,SAAW,SAAkBS,EAAK,CAC5C,OAAO,KAAK,KAAqBA,CAAK,EAAI,CAC9C,EAQAT,EAAc,GAAKA,EAAc,SAOjCA,EAAc,gBAAkB,SAAyBS,EAAK,CAC1D,OAAO,KAAK,KAAqBA,CAAK,GAAK,CAC/C,EAQAT,EAAc,IAAMA,EAAc,gBAQlCA,EAAc,GAAKA,EAAc,gBAOjCA,EAAc,YAAc,SAAqBS,EAAK,CAClD,OAAO,KAAK,KAAqBA,CAAK,EAAI,CAC9C,EAQAT,EAAc,GAAKA,EAAc,YAOjCA,EAAc,mBAAqB,SAA4BS,EAAK,CAChE,OAAO,KAAK,KAAqBA,CAAK,GAAK,CAC/C,EAQAT,EAAc,IAAMA,EAAc,mBAQlCA,EAAc,GAAKA,EAAc,mBAQjCA,EAAc,QAAU,SAAiBS,EAAK,CAG1C,GAFK1C,GAAO0C,CAAK,IACbA,EAAQjB,GAAUiB,CAAK,GACvB,KAAK,GAAGA,CAAK,EACb,MAAO,GACX,IAAIC,EAAU,KAAK,WAAU,EACzBC,EAAWF,EAAM,WAAU,EAC/B,OAAIC,GAAW,CAACC,EACL,GACP,CAACD,GAAWC,EACL,EAEN,KAAK,SAGFF,EAAM,OAAS,EAAM,KAAK,OAAS,GAAOA,EAAM,OAAS,KAAK,MAASA,EAAM,MAAQ,EAAM,KAAK,MAAQ,EAAM,GAAK,EAFhH,KAAK,IAAIA,CAAK,EAAE,WAAU,EAAK,GAAK,CAGnD,EASAT,EAAc,KAAOA,EAAc,QAMnCA,EAAc,OAAS,UAAe,CAClC,MAAI,CAAC,KAAK,UAAY,KAAK,GAAGnB,EAAS,EAC5BA,GACJ,KAAK,IAAG,EAAG,IAAIgB,EAAG,CAC7B,EAOAG,EAAc,IAAMA,EAAc,OAOlCA,EAAc,IAAM,SAAaY,EAAM,CAC9B7C,GAAO6C,CAAM,IACdA,EAASpB,GAAUoB,CAAM,GAI7B,IAAIC,EAAM,KAAK,OAAS,GACpBC,EAAM,KAAK,KAAO,MAClBC,EAAM,KAAK,MAAQ,GACnBC,EAAM,KAAK,IAAM,MAEjBC,EAAML,EAAO,OAAS,GACtBM,EAAMN,EAAO,KAAO,MACpBO,EAAMP,EAAO,MAAQ,GACrBQ,EAAMR,EAAO,IAAM,MAEnBS,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EACrC,OAAAA,GAAOR,EAAMI,EACbG,GAAOC,IAAQ,GACfA,GAAO,MACPD,GAAOR,EAAMI,EACbG,GAAOC,IAAQ,GACfA,GAAO,MACPD,GAAOR,EAAMI,EACbG,GAAOC,IAAQ,GACfA,GAAO,MACPD,GAAOR,EAAMI,EACbI,GAAO,MACA/C,GAAUiD,GAAO,GAAMC,EAAMH,GAAO,GAAMC,EAAK,KAAK,QAAQ,CACvE,EAOAtB,EAAc,SAAW,SAAkByB,EAAU,CACjD,OAAK1D,GAAO0D,CAAU,IAClBA,EAAajC,GAAUiC,CAAU,GAC9B,KAAK,IAAIA,EAAW,IAAG,CAAE,CACpC,EAQAzB,EAAc,IAAMA,EAAc,SAOlCA,EAAc,SAAW,SAAkB0B,EAAU,CACjD,GAAI,KAAK,OAAM,EACX,OAAOjD,GAKX,GAJKV,GAAO2D,CAAU,IAClBA,EAAalC,GAAUkC,CAAU,GAGjC/D,GAAM,CACN,IAAIC,EAAMD,GAAK,IAAI,KAAK,IACL,KAAK,KACL+D,EAAW,IACXA,EAAW,IAAI,EAClC,OAAOpD,GAASV,EAAKD,GAAK,SAAQ,EAAI,KAAK,QAAQ,CACtD,CAED,GAAI+D,EAAW,OAAM,EACjB,OAAOjD,GACX,GAAI,KAAK,GAAGI,EAAS,EACjB,OAAO6C,EAAW,MAAK,EAAK7C,GAAYJ,GAC5C,GAAIiD,EAAW,GAAG7C,EAAS,EACvB,OAAO,KAAK,MAAK,EAAKA,GAAYJ,GAEtC,GAAI,KAAK,WAAU,EACf,OAAIiD,EAAW,WAAU,EACd,KAAK,IAAG,EAAG,IAAIA,EAAW,IAAG,CAAE,EAE/B,KAAK,IAAG,EAAG,IAAIA,CAAU,EAAE,IAAG,EACtC,GAAIA,EAAW,WAAU,EAC5B,OAAO,KAAK,IAAIA,EAAW,IAAG,CAAE,EAAE,IAAG,EAGzC,GAAI,KAAK,GAAG9B,EAAU,GAAK8B,EAAW,GAAG9B,EAAU,EAC/C,OAAOrB,GAAW,KAAK,SAAQ,EAAKmD,EAAW,SAAQ,EAAI,KAAK,QAAQ,EAK5E,IAAIb,EAAM,KAAK,OAAS,GACpBC,EAAM,KAAK,KAAO,MAClBC,EAAM,KAAK,MAAQ,GACnBC,EAAM,KAAK,IAAM,MAEjBC,EAAMS,EAAW,OAAS,GAC1BR,EAAMQ,EAAW,KAAO,MACxBP,EAAMO,EAAW,MAAQ,GACzBN,EAAMM,EAAW,IAAM,MAEvBL,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EACrC,OAAAA,GAAOR,EAAMI,EACbG,GAAOC,IAAQ,GACfA,GAAO,MACPD,GAAOR,EAAMK,EACbE,GAAOC,IAAQ,GACfA,GAAO,MACPA,GAAOP,EAAMG,EACbG,GAAOC,IAAQ,GACfA,GAAO,MACPD,GAAOR,EAAMM,EACbC,GAAOC,IAAQ,GACfA,GAAO,MACPA,GAAOP,EAAMI,EACbE,GAAOC,IAAQ,GACfA,GAAO,MACPA,GAAON,EAAME,EACbG,GAAOC,IAAQ,GACfA,GAAO,MACPD,GAAOR,EAAMO,EAAMN,EAAMK,EAAMJ,EAAMG,EAAMF,EAAMC,EACjDI,GAAO,MACA/C,GAAUiD,GAAO,GAAMC,EAAMH,GAAO,GAAMC,EAAK,KAAK,QAAQ,CACvE,EAQAtB,EAAc,IAAMA,EAAc,SAQlCA,EAAc,OAAS,SAAgB2B,EAAO,CAG1C,GAFK5D,GAAO4D,CAAO,IACfA,EAAUnC,GAAUmC,CAAO,GAC3BA,EAAQ,OAAM,EACd,MAAM,MAAM,kBAAkB,EAGlC,GAAIhE,GAAM,CAIN,GAAI,CAAC,KAAK,UACN,KAAK,OAAS,aACdgE,EAAQ,MAAQ,IAAMA,EAAQ,OAAS,GAEvC,OAAO,KAEX,IAAI/D,GAAO,KAAK,SAAWD,GAAK,MAAQA,GAAK,OACzC,KAAK,IACL,KAAK,KACLgE,EAAQ,IACRA,EAAQ,IAAI,EAEhB,OAAOrD,GAASV,EAAKD,GAAK,SAAQ,EAAI,KAAK,QAAQ,CACtD,CAED,GAAI,KAAK,OAAM,EACX,OAAO,KAAK,SAAWa,GAAQC,GACnC,IAAImD,EAAQxB,EAAKyB,EACjB,GAAK,KAAK,SA6BH,CAKH,GAFKF,EAAQ,WACTA,EAAUA,EAAQ,WAAU,GAC5BA,EAAQ,GAAG,IAAI,EACf,OAAOnD,GACX,GAAImD,EAAQ,GAAG,KAAK,KAAK,CAAC,CAAC,EACvB,OAAO7B,GACX+B,EAAMrD,EACT,KAvCmB,CAGhB,GAAI,KAAK,GAAGK,EAAS,EAAG,CACpB,GAAI8C,EAAQ,GAAG9B,EAAG,GAAK8B,EAAQ,GAAG5B,EAAO,EACrC,OAAOlB,GACN,GAAI8C,EAAQ,GAAG9C,EAAS,EACzB,OAAOgB,GAGP,IAAIiC,EAAW,KAAK,IAAI,CAAC,EAEzB,OADAF,EAASE,EAAS,IAAIH,CAAO,EAAE,IAAI,CAAC,EAChCC,EAAO,GAAGnD,EAAI,EACPkD,EAAQ,WAAU,EAAK9B,GAAME,IAEpCK,EAAM,KAAK,IAAIuB,EAAQ,IAAIC,CAAM,CAAC,EAClCC,EAAMD,EAAO,IAAIxB,EAAI,IAAIuB,CAAO,CAAC,EAC1BE,EAGlB,SAAUF,EAAQ,GAAG9C,EAAS,EAC3B,OAAO,KAAK,SAAWL,GAAQC,GACnC,GAAI,KAAK,WAAU,EACf,OAAIkD,EAAQ,WAAU,EACX,KAAK,IAAG,EAAG,IAAIA,EAAQ,IAAG,CAAE,EAChC,KAAK,IAAG,EAAG,IAAIA,CAAO,EAAE,IAAG,EAC/B,GAAIA,EAAQ,WAAU,EACzB,OAAO,KAAK,IAAIA,EAAQ,IAAG,CAAE,EAAE,IAAG,EACtCE,EAAMpD,EACT,CAkBD,IADA2B,EAAM,KACCA,EAAI,IAAIuB,CAAO,GAAG,CAGrBC,EAAS,KAAK,IAAI,EAAG,KAAK,MAAMxB,EAAI,SAAQ,EAAKuB,EAAQ,SAAQ,CAAE,CAAC,EAWpE,QAPII,EAAO,KAAK,KAAK,KAAK,IAAIH,CAAM,EAAI,KAAK,GAAG,EAC5CI,EAASD,GAAQ,GAAM,EAAI7C,GAAQ,EAAG6C,EAAO,EAAE,EAI/CE,EAAY1D,GAAWqD,CAAM,EAC7BM,EAAYD,EAAU,IAAIN,CAAO,EAC9BO,EAAU,WAAU,GAAMA,EAAU,GAAG9B,CAAG,GAC7CwB,GAAUI,EACVC,EAAY1D,GAAWqD,EAAQ,KAAK,QAAQ,EAC5CM,EAAYD,EAAU,IAAIN,CAAO,EAKjCM,EAAU,OAAM,IAChBA,EAAYpC,IAEhBgC,EAAMA,EAAI,IAAII,CAAS,EACvB7B,EAAMA,EAAI,IAAI8B,CAAS,CAC1B,CACD,OAAOL,CACX,EAQA7B,EAAc,IAAMA,EAAc,OAOlCA,EAAc,OAAS,SAAgB2B,EAAO,CAK1C,GAJK5D,GAAO4D,CAAO,IACfA,EAAUnC,GAAUmC,CAAO,GAG3BhE,GAAM,CACN,IAAIC,GAAO,KAAK,SAAWD,GAAK,MAAQA,GAAK,OACzC,KAAK,IACL,KAAK,KACLgE,EAAQ,IACRA,EAAQ,IAAI,EAEhB,OAAOrD,GAASV,EAAKD,GAAK,SAAQ,EAAI,KAAK,QAAQ,CACtD,CAED,OAAO,KAAK,IAAI,KAAK,IAAIgE,CAAO,EAAE,IAAIA,CAAO,CAAC,CAClD,EAQA3B,EAAc,IAAMA,EAAc,OAQlCA,EAAc,IAAMA,EAAc,OAMlCA,EAAc,IAAM,UAAY,CAC5B,OAAO1B,GAAS,CAAC,KAAK,IAAK,CAAC,KAAK,KAAM,KAAK,QAAQ,CACxD,EAOA0B,EAAc,IAAM,SAAaS,EAAK,CAClC,OAAK1C,GAAO0C,CAAK,IACbA,EAAQjB,GAAUiB,CAAK,GACpBnC,GAAS,KAAK,IAAMmC,EAAM,IAAK,KAAK,KAAOA,EAAM,KAAM,KAAK,QAAQ,CAC/E,EAOAT,EAAc,GAAK,SAAYS,EAAK,CAChC,OAAK1C,GAAO0C,CAAK,IACbA,EAAQjB,GAAUiB,CAAK,GACpBnC,GAAS,KAAK,IAAMmC,EAAM,IAAK,KAAK,KAAOA,EAAM,KAAM,KAAK,QAAQ,CAC/E,EAOAT,EAAc,IAAM,SAAaS,EAAK,CAClC,OAAK1C,GAAO0C,CAAK,IACbA,EAAQjB,GAAUiB,CAAK,GACpBnC,GAAS,KAAK,IAAMmC,EAAM,IAAK,KAAK,KAAOA,EAAM,KAAM,KAAK,QAAQ,CAC/E,EAOAT,EAAc,UAAY,SAAmBmC,EAAO,CAGhD,OAFIpE,GAAOoE,CAAO,IACdA,EAAUA,EAAQ,MAAK,IACtBA,GAAW,MAAQ,EACb,KACFA,EAAU,GACR7D,GAAS,KAAK,KAAO6D,EAAU,KAAK,MAAQA,EAAY,KAAK,MAAS,GAAKA,EAAW,KAAK,QAAQ,EAEnG7D,GAAS,EAAG,KAAK,KAAQ6D,EAAU,GAAK,KAAK,QAAQ,CACpE,EAQAnC,EAAc,IAAMA,EAAc,UAOlCA,EAAc,WAAa,SAAoBmC,EAAO,CAGlD,OAFIpE,GAAOoE,CAAO,IACdA,EAAUA,EAAQ,MAAK,IACtBA,GAAW,MAAQ,EACb,KACFA,EAAU,GACR7D,GAAU,KAAK,MAAQ6D,EAAY,KAAK,MAAS,GAAKA,EAAW,KAAK,MAAQA,EAAS,KAAK,QAAQ,EAEpG7D,GAAS,KAAK,MAAS6D,EAAU,GAAK,KAAK,MAAQ,EAAI,EAAI,GAAI,KAAK,QAAQ,CAC3F,EAQAnC,EAAc,IAAMA,EAAc,WAOlCA,EAAc,mBAAqB,SAA4BmC,EAAO,CAIlE,GAHIpE,GAAOoE,CAAO,IACdA,EAAUA,EAAQ,MAAK,GAC3BA,GAAW,GACPA,IAAY,EACZ,OAAO,KAEP,IAAItE,EAAO,KAAK,KAChB,GAAIsE,EAAU,GAAI,CACd,IAAIvE,EAAM,KAAK,IACf,OAAOU,GAAUV,IAAQuE,EAAYtE,GAAS,GAAKsE,EAAWtE,IAASsE,EAAS,KAAK,QAAQ,CAChG,KAAM,QAAIA,IAAY,GACZ7D,GAAST,EAAM,EAAG,KAAK,QAAQ,EAE/BS,GAAST,IAAUsE,EAAU,GAAK,EAAG,KAAK,QAAQ,CAErE,EAQAnC,EAAc,KAAOA,EAAc,mBAQnCA,EAAc,MAAQA,EAAc,mBAMpCA,EAAc,SAAW,UAAiB,CACtC,OAAK,KAAK,SAEH1B,GAAS,KAAK,IAAK,KAAK,KAAM,EAAK,EAD/B,IAEf,EAMA0B,EAAc,WAAa,UAAmB,CAC1C,OAAI,KAAK,SACE,KACJ1B,GAAS,KAAK,IAAK,KAAK,KAAM,EAAI,CAC7C,EAOA0B,EAAc,QAAU,SAAiBoC,EAAE,CACvC,OAAOA,EAAK,KAAK,UAAS,EAAK,KAAK,UAAS,CACjD,EAMApC,EAAc,UAAY,UAAkB,CACxC,IAAIqC,EAAK,KAAK,KACVC,EAAK,KAAK,IACd,MAAO,CACHA,EAAY,IACZA,IAAQ,EAAI,IACZA,IAAO,GAAK,IACZA,IAAO,GACPD,EAAY,IACZA,IAAQ,EAAI,IACZA,IAAO,GAAK,IACZA,IAAO,GAEf,EAMArC,EAAc,UAAY,UAAkB,CACxC,IAAIqC,EAAK,KAAK,KACVC,EAAK,KAAK,IACd,MAAO,CACHD,IAAO,GACPA,IAAO,GAAK,IACZA,IAAQ,EAAI,IACZA,EAAY,IACZC,IAAO,GACPA,IAAO,GAAK,IACZA,IAAQ,EAAI,IACZA,EAAY,IAEpB,EASA5E,GAAK,UAAY,SAAmBpO,EAAOwO,EAAUsE,EAAE,CACnD,OAAOA,EAAK1E,GAAK,YAAYpO,EAAOwO,CAAQ,EAAIJ,GAAK,YAAYpO,EAAOwO,CAAQ,CACpF,EAQAJ,GAAK,YAAc,SAAqBpO,EAAOwO,EAAQ,CACnD,OAAO,IAAIJ,GACPpO,EAAM,CAAC,EACPA,EAAM,CAAC,GAAM,EACbA,EAAM,CAAC,GAAK,GACZA,EAAM,CAAC,GAAK,GACZA,EAAM,CAAC,EACPA,EAAM,CAAC,GAAM,EACbA,EAAM,CAAC,GAAK,GACZA,EAAM,CAAC,GAAK,GACZwO,CAAQ,CAEhB,EAQAJ,GAAK,YAAc,SAAqBpO,EAAOwO,EAAQ,CACnD,OAAO,IAAIJ,GACPpO,EAAM,CAAC,GAAK,GACZA,EAAM,CAAC,GAAK,GACZA,EAAM,CAAC,GAAM,EACbA,EAAM,CAAC,EACPA,EAAM,CAAC,GAAK,GACZA,EAAM,CAAC,GAAK,GACZA,EAAM,CAAC,GAAM,EACbA,EAAM,CAAC,EACPwO,CAAQ,CAEhB,wDCtxCMJ,GAED6E,IAA+BC,GAE9B,SAAUC,GAAUC,EAAW,CACnC,OAAOhF,GAAK,WAAWgF,EAAK,GAAM,EAAE,CACtC,CAIiBD,GAAU,kBAAkB,EAE5BA,GAAU,kBAAkB,EAE5BA,GAAU,kBAAkB,ECE7C,SAASE,GAAmBhV,EAAeZ,EAAe,CACxD,OAAQY,aAAa,cAAgBZ,IAAU,WAC1CY,aAAa,YAAcZ,IAAU,SACrCY,aAAa,YAAcZ,IAAU,MAC5C,CAEgB,SAAA6V,GAAajV,EAAeZ,EAAe,CACzD,GAAIA,IAAU,SACZ,MAAM,IAAI,MAAM,2CAA2C,EAS7D,GAPI,MAAM,QAAQY,CAAC,IACjBA,EAAIkV,GAAQlV,CAAC,GAGXlM,GAAG,EAAG,QAAQ,OAAO,GACvBqhB,GAA8BnV,EAAeZ,CAAK,EAEhD4V,GAAmBhV,EAAGZ,CAAK,EAC7B,OAAOY,EAET,GAAIZ,GAAS,MAAQA,IAAU,WAAaA,IAAU,YACpD,OAAO,IAAI,aAAaY,CAAa,EAChC,GAAIZ,IAAU,QACnB,OAAO,IAAI,WAAWY,CAAa,EAC9B,GAAIZ,IAAU,OAAQ,CAE3B,QADMgW,EAAO,IAAI,WAAYpV,EAAe,MAAM,EACzC7J,EAAI,EAAGA,EAAIif,EAAK,OAAQ,EAAEjf,EAC7B,KAAK,MAAO6J,EAAe7J,CAAC,CAAC,IAAM,IACrCif,EAAKjf,CAAC,EAAI,GAGd,OAAOif,CACR,KACC,OAAM,IAAI,MAAM,qBAAA,OAAqBhW,CAAK,CAAE,CAEhD,UAagBiW,IAAG,CACjB,OAAOvhB,GAAG,EAAG,SAAS,IAAG,CAC3B,CA+BgB,SAAAwhB,GAAarf,EAAWsf,EAAkB,CAAlB,OAAAA,IAAA,SAAAA,EAAkB,SACxDA,EAAWA,GAAY,QAChBzhB,GAAG,EAAG,SAAS,OAAOmC,EAAGsf,CAAQ,CAC1C,CAUgB,SAAAC,GAAa7T,EAAmB4T,EAAkB,CAAlB,OAAAA,IAAA,SAAAA,EAAkB,SAChEA,EAAWA,GAAY,QAChBzhB,GAAG,EAAG,SAAS,OAAO6N,EAAO4T,CAAQ,CAC9C,CAEM,SAAUE,GAAazV,EAAK,CAGhC,OAAIlM,GAAG,EAAG,SAAS,cAAgB,KAC1BA,GAAG,EAAG,SAAS,aAAakM,CAAC,EAE7B6P,GAAoB7P,CAAC,CAEhC,UAsBAkV,GACIxT,EAA0BvM,EAAkBugB,EAAsB,SAIpE,GAJ4BvgB,IAAA,SAAAA,EAAgB,CAAA,GAAEugB,IAAA,SAAAA,EAAsB,IAChEvgB,GAAU,OACZA,EAAS,CAAA,GAEP,OAAOuM,GAAQ,WAAa,OAAOA,GAAQ,UAC7C,OAAOA,GAAQ,UAAYiU,GAAejU,CAAG,GAAKA,GAAO,MACvD+T,GAAa/T,CAAG,GAAKgU,EACvBvgB,EAAO,KAAKuM,CAAQ,UACX,MAAM,QAAQA,CAAG,GAAK+T,GAAa/T,CAAG,EAC/C,QAASvL,EAAI,EAAGA,EAAIuL,EAAI,OAAQ,EAAEvL,EAChC+e,GAAQxT,EAAIvL,CAAC,EAAGhB,EAAQugB,CAAc,MAEnC,CACL,IAAIE,EAAW,OACf,QAAkBhd,EAAA7C,GAAA,OAAO,KAAK2L,CAAG,CAAC,EAAAmC,EAAAjL,EAAA,KAAA,EAAE,CAAAiL,EAAA,KAAAA,EAAAjL,EAAA,KAAA,EAAA,CAA/B,IAAMsD,EAAG2H,EAAA,MAER,qBAAqB,KAAK3H,CAAG,IAC/B0Z,EAAW,KAAK,IAAIA,EAAU,OAAO1Z,CAAG,CAAC,EAE5C,mGACD,QAAS/F,EAAI,EAAGA,GAAKyf,EAAUzf,IAE7B+e,GAASxT,EAA0BvL,CAAC,EAAGhB,EAAQugB,CAAc,CAEhE,CACD,OAAOvgB,CACT,CChKA,IAAA0gB,IAAA,UAAA,CACE,SAAoBA,EAAAC,EAAoCC,EAAe,CAAnD,KAAY,aAAZD,EAAoC,KAAM,OAANC,EAClDA,GAAU,OACZ,KAAK,OAAS,IAAIC,IAItB,OAAAH,EAAA,UAAA,cAAA,SAAcvW,EAAoBzD,EAAwBrG,EAAiB,SAErEsG,EACEma,EAAsB,UAAA,CAC1Bna,EAAUtG,EAAC,CACb,EACI0gB,EACEpe,EAAQqe,GAAQ,EACtB,GAAI,KAAK,aAAa,eAAc,EAClCD,EAAQ,KAAK,aAAa,KAAKD,CAAmB,MAC7C,CACLA,EAAmB,MACnB,QAAqBG,EAAArgB,GAAA+F,CAAO,EAAAua,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAAzB,IAAMvY,EAAMwY,EAAA,MACfxY,EAAO,SAAQ,CAChB,mGACDqY,EAAQ,QAAQ,QAAQ,CAAC,SAAUC,GAAQ,EAAKre,CAAK,CAAC,CACvD,CACD,GAAIhE,GAAG,EAAG,QAAQ,8BAA8B,EAC9C,mBAASqC,EAAC,CACR,IAAM0H,EAAS/B,EAAQ3F,CAAC,EAGxB0H,EAAO,KAAI,EAAG,KAAK,SAAAyY,EAAU,CAC3BC,GAA0BD,EAAYzY,EAAO,MAAOyB,CAAU,CAChE,CAAC,GANMnJ,EAAI,EAAGA,EAAI2F,EAAQ,OAAQ3F,MAA3BA,CAAC,EAUZ,IAAMqgB,EAAgB,CACpB,WAAUlX,EACV,QAAOxD,EACP,OAAMD,EACN,OAAQqa,EAAM,KAAK,SAAAO,EAAU,CAAA,OAAAA,EAAO,QAAQ,CAAA,EAC5C,UAAWP,EAAM,KACb,SAAAO,EAAU,CAAA,OAAAA,EAAO,qBAAuB,KACpCA,EAAO,oBAAmB,EAC1B,EAAE,CAAA,GAEZ,OAAOD,GAGTX,EAAgB,UAAA,iBAAhB,SAAiBW,EAA4B,CAA7C,IAUCjb,EAAA,KATQ+D,EAAkDkX,EAAxC,WAAE1a,EAAsC0a,EAA/B,QAAEE,EAA6BF,EAAvB,OAAE3a,EAAqB2a,EAAa,OAA1BG,EAAaH,EAAa,UAEtE1a,EAAQ,QAAQ,SAAA3G,EAAM,CACpB,QAAQ,IAAI,CAACA,EAAO,KAAI,EAAIuhB,EAAQC,CAAS,CAAC,EAAE,KAAK,SAAAC,EAAc,CACjErb,EAAK,OAAO,iBACR+D,EAAYnK,EAAQyhB,EAAe,CAAC,EAAGA,EAAe,CAAC,EAAG/a,EAC1D+a,EAAe,CAAC,CAAC,CACvB,CAAC,CACH,CAAC,GAEJf,CAAA,GAAA,WAEeU,GACZlV,EAAsBjC,EAAUE,EAAkB,CACpD,GAAIF,IAAU,UAEZ,MAAO,GAET,QAASjJ,EAAI,EAAGA,EAAIkL,EAAK,OAAQlL,IAAK,CACpC,IAAMmL,EAAMD,EAAKlL,CAAC,EAClB,GAAI,MAAMmL,CAAG,GAAK,CAAC,SAASA,CAAG,EAE7B,eAAQ,KAAK,SAAA,OAASA,EAAyB,qBAAA,EAAA,OAAAhC,EAAa,GAAA,CAAA,EACrD,EAEV,CACD,MAAO,EACT,CAEA,IAAA0W,IAAA,UAAA,CAAA,SAAAA,GAAA,EACE,OAAAA,EAAA,UAAA,iBAAA,SACI9e,EAAc/B,EAAgBkM,EAC9BqV,EAAgC7a,EAChC8a,EAAkB,CACpB,IAAME,EAAO,OAAOH,GAAW,SAAWI,GAAc,GAAA,OAAGJ,EAAM,IAAA,EAAM,CAAC,EAC9BA,EAAO,MAC3CK,EAAaD,GAAc5f,EAAM,EAAE,EACnCwJ,EAAOvL,EAAO,KACd+K,EAAO/K,EAAO,KACdqJ,EAAQsY,GAAc3hB,EAAO,MAAM,SAAQ,EAAI,EAAE,EACnD6hB,EAAyB,GAE7B,QAAWC,KAAQpb,EAAQ,CACzB,IAAMc,EAAQd,EAAOob,CAAI,EACzB,GAAIta,GAAS,KAAM,CAGjB,IAAMua,EAAava,EAAM,OAASxH,EAAO,MACnCgiB,EAAYD,EAAW,OAC7BF,GACI,GAAA,OAAGC,EAAS,IAAA,EAAA,OAAAE,EAAc,IAAA,EAAA,OAAAA,EAAY,EAAID,EAAa,GAAE,GAAA,CAC9D,CACF,CAED,QAAQ,IACJ,KAAA,OAAKH,EAAU,KAAA,EAAA,OAAOF,EAAI,KAAA,EAAA,OAAOnW,EAAI,IAAA,EAAA,OAAKlC,EAAK,KAAA,EAAA,OAAO0B,EAClD,KAAA,EAAA,OAAA8W,EAA6B,KAAA,EAAA,OAAAL,CAAS,EAC1C,mBAAoB,YAAa,aAAc,gBAC/C,eAAgB,kBAAkB,GAEzCX,CAAA,GAAA,WClGeoB,GACZC,EAAkBC,EAAc7hB,EAAS,CAK3C,QAFM8hB,EAA8C,CAAA,EAC9CC,EAA0C,CAAA,EACvCrhB,EAAI,EAAGA,EAAImhB,EAAG,OAAQnhB,IAC7BohB,EAAaD,EAAGnhB,CAAC,EAAE,EAAE,EAAI,GAG3B,QAASA,EAAI,EAAGA,EAAIkhB,EAAK,OAAQlhB,IAAK,CACpC,IAAMsB,EAAO4f,EAAKlhB,CAAC,EACbshB,EAAahgB,EAAK,OACxB,QAAW0B,KAAase,EAAY,CAIlC,QAHM9a,EAAQ8a,EAAWte,CAAS,EAE9Bue,EAAgB,GACXzW,EAAI,EAAGA,EAAIqW,EAAG,OAAQrW,IAC7B,GAAIsW,EAAa5a,EAAM,EAAE,EAAG,CAC1BlF,EAAK,QAAQ,QAAQ,SAAAoG,EAAM,CAAI,OAAA0Z,EAAa1Z,EAAO,EAAE,EAAI,EAA1B,CAA8B,EAC7D6Z,EAAgB,GAChBF,EAAW/f,EAAK,EAAE,EAAI,GACtB,KACD,CAGH,GAAIigB,EACF,KAEH,CACF,CAGD,IAAMC,EAAgD,CAAA,EACtDA,EAAeliB,EAAE,EAAE,EAAI,GAGvB,QAFMmiB,EAAwC,CAAA,EAErCzhB,EAAIkhB,EAAK,OAAS,EAAGlhB,GAAK,EAAGA,IAKpC,QAJMsB,EAAO4f,EAAKlhB,CAAC,EACbshB,EAAahgB,EAAK,OAGfwJ,EAAI,EAAGA,EAAIxJ,EAAK,QAAQ,OAAQwJ,IACvC,GAAI0W,EAAelgB,EAAK,QAAQwJ,CAAC,EAAE,EAAE,EAAG,CACtC,QAAW9H,KAAase,EACtBE,EAAeF,EAAWte,CAAS,EAAE,EAAE,EAAI,GAC3Cye,EAASngB,EAAK,EAAE,EAAI,GAEtB,KACD,CAML,QADMogB,EAA2B,CAAA,EACxB1hB,EAAI,EAAGA,EAAIkhB,EAAK,OAAQlhB,IAAK,CACpC,IAAMsB,EAAO4f,EAAKlhB,CAAC,EAEnB,GAAIqhB,EAAW/f,EAAK,EAAE,GAAKmgB,EAASngB,EAAK,EAAE,EAAG,CAE5C,IAAMqgB,EAA8C,CAAA,EACpD,QAAW3e,KAAa1B,EAAK,OAAQ,CACnC,IAAMsgB,EAAYtgB,EAAK,OAAO0B,CAAS,EACnCoe,EAAaQ,EAAU,EAAE,IAC3BD,EAAa3e,CAAS,EAAI4e,EAE7B,CAGD,IAAMC,EAAa,OAAO,OAAO,CAAA,EAAIvgB,CAAI,EACzCugB,EAAW,OAASF,EACpBE,EAAW,QAAUvgB,EAAK,QAE1BogB,EAAa,KAAKG,CAAU,CAC7B,CACF,CAED,OAAOH,CACT,CASM,SAAUI,GACZC,EACAL,EAA0BM,EAC1BC,EAAqC,CAEvC,mBAASjiB,EAAC,CACR,IAAMsB,EAAOogB,EAAa1hB,CAAC,EAErBkiB,EAAgB,CAAA,EAYtB,GAXA5gB,EAAK,QAAQ,QAAQ,SAAAzB,EAAC,CACpB,IAAMsiB,EAAaJ,EAA6BliB,EAAE,EAAE,EAChDsiB,GAAc,KAChBD,EAAI,KAAKC,CAAU,EAInBD,EAAI,KAAK,IAAI,CAEjB,CAAC,EAEG5gB,EAAK,UAAY,KACnB,MAAM,IAAI,MACN,wDACA,OAAA,OAAOA,EAAK,WAAU,GAAA,CAAG,EAI/B,IAAM8gB,EAAiB9gB,EAAK,SAAS4gB,CAAG,aAE7Blf,EAAS,CAClB,GAAI,EAAEA,KAAaof,GACjB,MAAM,IAAI,MACN,iCAAA,OAAiCpf,EAAa,IAAA,EAC9C,8BAA8B,OAAA,OAAO,KAAKof,CAAc,EAAC,GAAA,CAAG,EAIlE,IAAMC,EAAKL,EAAK,UAAA,CAAM,OAAAI,EAAepf,CAAS,EAAC,CAAzB,CAA2B,EACjD,GAAIqf,EAAG,QAAU,UACf,MAAM,IAAI,MACN,4BAAA,OACI/gB,EAAK,WAAoC,0BAAA,EAC7C,GAAA,OAAG0B,EAAiD,uCAAA,EAAA,OAAAqf,EAAG,MAAK,GAAA,CAAG,EAErE,IAAM5W,EAAInK,EAAK,OAAO0B,CAAS,EAC/B,GAAI,CAACsf,GAAiBD,EAAG,MAAO5W,EAAE,KAAK,EACrC,MAAM,IAAI,MACN,4BAAA,OACInK,EAAK,WAAoC,0BAAA,EAC7C,IAAA,OAAI0B,EAAS,eAAA,EAAA,OAAgBqf,EAAG,MAA+B,0BAAA,EAC/D,2BAAA,OAA2B5W,EAAE,MAAK,GAAA,CAAG,EAG3C,GAAIsW,EAA6BtW,EAAE,EAAE,GAAK,KACxCsW,EAA6BtW,EAAE,EAAE,EAAI4W,MAChC,CACL,IAAME,EAAcR,EAA6BtW,EAAE,EAAE,EACrDsW,EAA6BtW,EAAE,EAAE,EAAIwW,EAAIM,EAAaF,CAAE,EACxDE,EAAY,QAAO,CACpB,GA9BH,QAAWvf,KAAa1B,EAAK,SAAlB0B,CAAS,GAxBbhD,EAAI0hB,EAAa,OAAS,EAAG1hB,GAAK,EAAGA,MAArCA,CAAC,CAyDZ,CC3KA,IAAMwiB,GAAwB,GAExBC,GAA6B,EAE7BC,GAAwB,EAExB,SAAUC,GACZzX,EAA2B7C,EAAiBY,EAC5C2Z,EAAgB,CAClB,IAAM5W,EAAUD,GAAe1D,CAAK,EAC9Bwa,EAAYC,GAAwB5X,EAAM7C,EAAOY,EAAO+C,CAAO,EAC/DzB,EAAOlC,EAAM,OACb0a,EAAYC,GAAkB9X,EAAM7C,EAAOY,EAAO+C,EAAS6W,CAAS,EACpEI,EAAQ,CAAC,QAAQ,EACvB,OAAIL,IACFK,EAAM,KAAK,YAAA,OAAYha,CAAK,CAAE,EAC9Bga,EAAM,KAAK,WAAA,OAAW1Y,CAAI,CAAE,EAC5B0Y,EAAM,KAAK,aAAA,OAAa5a,EAAK,GAAA,CAAG,EAChC4a,EAAM,KAAK,WAAW,GAExBA,EAAM,KAAKF,EAAU,IAAI,SAAAtiB,EAAK,CAAA,MAAA,OAASA,CAAT,CAAU,EAAE,KAAK;CAAI,CAAC,EAC7CwiB,EAAM,KAAK;CAAI,CACxB,CAEA,SAASH,GACL5X,EAA2B7C,EAAiBY,EAC5C+C,EAAiB,CACnB,IAAMvM,EAAIqK,GAAczB,CAAK,EACvB6a,EAAUlX,EAAQA,EAAQ,OAAS,CAAC,EACpC6W,EAAY,IAAI,MAAMK,CAAO,EAAE,KAAK,CAAC,EACrC3Y,EAAOlC,EAAM,OACb8a,EACFla,IAAU,YAAcma,GAAoBlY,CAAI,EAAIA,EAExD,GAAIX,EAAO,EACT,QAAS8Y,EAAM,EAAGA,EAAM5jB,EAAIyjB,EAASG,IAEnC,QADMnX,EAASmX,EAAMH,EACZpY,EAAI,EAAGA,EAAIoY,EAASpY,IAC3B+X,EAAU/X,CAAC,EAAI,KAAK,IAChB+X,EAAU/X,CAAC,EACXwY,GAAYH,EAAejX,EAASpB,CAAC,EAAG,EAAG7B,CAAK,EAAE,MAAM,EAIlE,OAAO4Z,CACT,CAEA,SAASS,GACL3H,EAAqCrY,EAAa2F,EAAe,CACnE,IAAIsa,EACJ,OAAI,MAAM,QAAQ5H,CAAG,EACnB4H,EAAS,GAAA,OAAG,WAAW5H,EAAI,CAAC,EAAE,QAAQ+G,EAAqB,CAAC,EAAM,KAAA,EAC9D,GAAA,OAAG,WAAW/G,EAAI,CAAC,EAAE,QAAQ+G,EAAqB,CAAC,EAAC,GAAA,EAC/ChX,GAASiQ,CAAG,EACrB4H,EAAS,IAAA,OAAI5H,EAAG,GAAA,EACP1S,IAAU,OACnBsa,EAASC,GAAgB7H,CAAG,EAE5B4H,EAAS,WAAW5H,EAAI,QAAQ+G,EAAqB,CAAC,EAAE,SAAQ,EAG3DtY,GAASmZ,EAAQjgB,CAAG,CAC7B,CAEA,SAASkgB,GAAgB9jB,EAAS,CAChC,OAAOA,IAAM,EAAI,QAAU,MAC7B,CAEA,SAASsjB,GACL9X,EAA2B7C,EAAiBY,EAC5C+C,EAAmB6W,EAAqBY,EAAa,CAAbA,IAAA,SAAAA,EAAa,IACvD,IAAMC,EAAoBza,IAAU,YAAc,EAAI,EAEhDc,EAAO1B,EAAM,CAAC,EACdkC,EAAOlC,EAAM,OACnB,GAAIkC,IAAS,EAAG,CACd,GAAItB,IAAU,YAAa,CACzB,IAAM0a,EAAeP,GAAoBlY,CAAI,EAC7C,MAAO,CAACoY,GAAYK,EAAa,CAAC,EAAG,EAAG1a,CAAK,CAAC,CAC/C,CACD,OAAIA,IAAU,OACL,CAACua,GAAgBtY,EAAK,CAAC,CAAW,CAAC,EAErC,CAACA,EAAK,CAAC,EAAE,SAAQ,CAAE,CAC3B,CAED,GAAIX,IAAS,EAAG,CACd,GAAIR,EAAOyY,GAAuB,CAChC,IAAMoB,EAAgBnB,GAA6BiB,EAE/CG,EAAY,MAAM,KAClB3Y,EAAK,MAAM,EAAG0Y,CAAa,CAAC,EAC5BE,EAAW,MAAM,KAAqC5Y,EAAK,OAC1DnB,EAAO0Y,IAA8BiB,EACtC3Z,EAAO2Z,CAAiB,CAAC,EAC7B,OAAIza,IAAU,cACZ4a,EAAYT,GAAoBS,CAAS,EACzCC,EAAWV,GAAoBU,CAAQ,GAElC,CACL,IACAD,EAAU,IAAI,SAACpY,EAAGzL,EAAM,CAAA,OAAAsjB,GAAY7X,EAAGoX,EAAU7iB,CAAC,EAAGiJ,CAAK,CAAlC,CAAmC,EACtD,KAAK,IAAI,EACd,UACA6a,EACK,IACG,SAACrY,EAAGzL,EAAC,CAAK,OAAAsjB,GACN7X,EAAGoX,EAAU9Y,EAAO0Y,GAA6BziB,CAAC,EAAGiJ,CAAK,CADpD,CACqD,EAClE,KAAK,IAAI,EACd,IAEH,CACD,IAAM8a,EACF9a,IAAU,YAAcma,GAAoBlY,CAAI,EACxB,MAAM,KAAoBA,CAAI,EAE1D,MAAO,CACL,IACA6Y,EAAY,IAAI,SAACtY,EAAGzL,EAAM,CAAA,OAAAsjB,GAAY7X,EAAGoX,EAAU7iB,CAAC,EAAGiJ,CAAK,CAAlC,CAAmC,EACxD,KAAK,IAAI,EACd,IAEH,CAGD,IAAM+a,EAAW3b,EAAM,MAAM,CAAC,EACxB4b,EAAajY,EAAQ,MAAM,CAAC,EAC5BkY,EAASlY,EAAQ,CAAC,EAAI0X,EACtBT,EAAkB,CAAA,EACxB,GAAIlZ,EAAOyY,GAAuB,CAChC,QAASxiB,EAAI,EAAGA,EAAIyiB,GAA4BziB,IAAK,CACnD,IAAM2B,EAAQ3B,EAAIkkB,EACZtiB,EAAMD,EAAQuiB,EACpBjB,EAAM,KAAN,MAAAA,EAAc5iB,GAAA,CAAA,EAAAJ,EAAA+iB,GACV9X,EAAK,MAAMvJ,EAAOC,CAAG,EAAGoiB,EAAU/a,EAAOgb,EAAYpB,EACrD,EAAK,CAAc,EAAE,EAAA,CAAA,CAC1B,CACDI,EAAM,KAAK,KAAK,EAChB,QAASjjB,EAAI+J,EAAO0Y,GAA4BziB,EAAI+J,EAAM/J,IAAK,CAC7D,IAAM2B,EAAQ3B,EAAIkkB,EACZtiB,EAAMD,EAAQuiB,EACpBjB,EAAM,KAAN,MAAAA,EAAK5iB,GAAA,CAAA,EAAAJ,EAAS+iB,GACV9X,EAAK,MAAMvJ,EAAOC,CAAG,EAAGoiB,EAAU/a,EAAOgb,EAAYpB,EACrD7iB,IAAM+J,EAAO,CAAC,CAAc,EAAE,EAAA,CAAA,CACnC,CACF,KACC,SAAS/J,EAAI,EAAGA,EAAI+J,EAAM/J,IAAK,CAC7B,IAAM2B,EAAQ3B,EAAIkkB,EACZtiB,EAAMD,EAAQuiB,EACpBjB,EAAM,KAAN,MAAAA,EAAK5iB,GAAA,CAAA,EAAAJ,EAAS+iB,GACV9X,EAAK,MAAMvJ,EAAOC,CAAG,EAAGoiB,EAAU/a,EAAOgb,EAAYpB,EACrD7iB,IAAM+J,EAAO,CAAC,CAAc,EAAE,EAAA,CAAA,CACnC,CAEH,IAAMoa,EAAM5Z,IAAS,EAAI,IAAM,GAC/B0Y,EAAM,CAAC,EAAI,KAAOlZ,EAAO,EAAIkZ,EAAM,CAAC,EAAIkB,EAAM,IAC9C,QAASnkB,EAAI,EAAGA,EAAIijB,EAAM,OAAS,EAAGjjB,IACpCijB,EAAMjjB,CAAC,EAAI,IAAMijB,EAAMjjB,CAAC,EAAImkB,EAG9B,QADIC,EAAa;EACRpkB,EAAI,EAAGA,EAAIuK,EAAMvK,IACxBokB,GAAc;EAEhB,OAAAnB,EAAMA,EAAM,OAAS,CAAC,EAClB,IAAMA,EAAMA,EAAM,OAAS,CAAC,EAAI,KAAOQ,EAAS,GAAKW,GAClDnB,CACT,CAEA,SAASG,GAAoBlY,EACU,CAErC,QADMmZ,EAAyC,CAAA,EACtCrkB,EAAI,EAAGA,EAAIkL,EAAK,OAAQlL,GAAK,EACpCqkB,EAAc,KAAK,CAACnZ,EAAKlL,CAAC,EAAGkL,EAAKlL,EAAI,CAAC,CAAC,CAAqB,EAE/D,OAAOqkB,CACT,CCxJA,IAAAC,IAAA,UAAA,CAME,SAAAA,EAAYjc,EAA2BY,EAAUD,EAAuB,CAAxE,IAmBC5D,EAAA,KAfC,GAJqC,KAAK,MAAL6D,EACrC,KAAK,MAAQZ,EAAM,MAAK,EACxB,KAAK,KAAOkc,GAAmBlc,CAAK,EAEhCW,GAAU,KAAM,CAClB,IAAMwb,EAAIxb,EAAO,OACjByb,EACID,IAAM,KAAK,KACX,UAAA,CAAM,MAAA,qBAAA,OAAqBA,EAA6B,4BAAA,EACpD,0BAAA,OAA0Bpf,EAAK,KAAI,IAAA,CADjC,CACqC,CAChD,CACD,GAAI6D,IAAU,YACZ,MAAM,IAAI,MACN,4JAE8B,EAEpC,KAAK,OAASD,GAAU0b,GAAuBzb,EAAO,KAAK,IAAI,EAC/D,KAAK,QAAU8C,GAAe1D,CAAK,EAWrC,OAAAic,EAAG,UAAA,IAAH,SAAI7lB,EAAwB,SAW3B2G,EAAA,KAX8Cuf,EAAA,CAAA,EAAAzW,EAAA,EAAjBA,EAAiB,UAAA,OAAjBA,IAAAyW,EAAiBzW,EAAA,CAAA,EAAA,UAAAA,CAAA,EACzCyW,EAAK,SAAW,IAClBA,EAAO,CAAC,CAAC,GAEXF,EACIE,EAAK,SAAW,KAAK,KACrB,UAAM,CAAA,MAAA,uCAAA,OAAuCA,EAAK,OAAe,SAAA,EAC7D,mBAAA,OAAmBvf,EAAK,KAAI,GAAA,CAD1B,CAC6B,EAEvC,IAAMlD,EAAQ,KAAK,WAAWyiB,CAAI,EAClC,KAAK,OAAOziB,CAAK,EAAIzD,GAUvB6lB,EAAA,UAAA,IAAA,UAAA,aAAqBK,EAAA,CAAA,EAAAzW,EAAA,EAAjBA,EAAiB,UAAA,OAAjBA,IAAAyW,EAAiBzW,CAAA,EAAA,UAAAA,CAAA,EACfyW,EAAK,SAAW,IAClBA,EAAO,CAAC,CAAC,GAEX,IAAI3kB,EAAI,MACR,QAAkB4kB,EAAAhlB,GAAA+kB,CAAI,EAAAE,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAAnB,IAAME,EAAGD,EAAA,MACZ,GAAIC,EAAM,GAAKA,GAAO,KAAK,MAAM9kB,CAAC,EAAG,CACnC,IAAMsJ,EAAM,qCAAqC,OAAAqb,EAAQ,IAAA,EACrD,kBAAA,OAAkB,KAAK,KAAK,EAChC,MAAM,IAAI,MAAMrb,CAAG,CACpB,CACDtJ,GACD,mGAED,QADIkC,EAAQyiB,EAAKA,EAAK,OAAS,CAAC,EACvBI,EAAI,EAAGA,EAAIJ,EAAK,OAAS,EAAG,EAAEI,EACrC7iB,GAAS,KAAK,QAAQ6iB,CAAC,EAAIJ,EAAKI,CAAC,EAEnC,OAAO,KAAK,OAAO7iB,CAAK,GAG1BoiB,EAAU,UAAA,WAAV,SAAWK,EAAc,CACvB,GAAI,KAAK,OAAS,EAChB,MAAO,GACF,GAAI,KAAK,OAAS,EACvB,OAAOA,EAAK,CAAC,EAGf,QADIziB,EAAQyiB,EAAKA,EAAK,OAAS,CAAC,EACvB3kB,EAAI,EAAGA,EAAI2kB,EAAK,OAAS,EAAG,EAAE3kB,EACrCkC,GAAS,KAAK,QAAQlC,CAAC,EAAI2kB,EAAK3kB,CAAC,EAEnC,OAAOkC,GAGToiB,EAAU,UAAA,WAAV,SAAWpiB,EAAa,CACtB,GAAI,KAAK,OAAS,EAChB,MAAO,CAAA,EACF,GAAI,KAAK,OAAS,EACvB,MAAO,CAACA,CAAK,EAGf,QADMyiB,EAAiB,IAAI,MAAM,KAAK,MAAM,MAAM,EACzC3kB,EAAI,EAAGA,EAAI2kB,EAAK,OAAS,EAAG,EAAE3kB,EACrC2kB,EAAK3kB,CAAC,EAAI,KAAK,MAAMkC,EAAQ,KAAK,QAAQlC,CAAC,CAAC,EAC5CkC,GAASyiB,EAAK3kB,CAAC,EAAI,KAAK,QAAQA,CAAC,EAEnC,OAAA2kB,EAAKA,EAAK,OAAS,CAAC,EAAIziB,EACjByiB,GAGT,OAAA,eAAIL,EAAI,UAAA,OAAA,CAAR,IAAA,UAAA,CACE,OAAO,KAAK,MAAM,qCACnB,CAAA,EAODA,EAAA,UAAA,SAAA,UAAA,CACE,OAAOU,GAAS,EAAG,WAAW,KAAK,OAAQ,KAAK,MAAO,KAAK,KAAK,GAGpEV,CAAA,GAAA,EA4CGU,GAAiC,KAEjCC,GAAuB,KAarB,SAAUC,GAAiBC,EAAuB,CACtDH,GAAYG,CACd,CAmCA,IAAAC,IAAA,UAAA,CA+BE,SAAAA,EAAY/c,EAAoBY,EAAiBL,EAAgByc,EAAU,CAb3E,KAAI,KAAG,GAmLG,KAAkB,mBAAG,GArK7B,KAAK,MAAQhd,EAAM,MAAK,EACxB,KAAK,MAAQY,GAAS,UACtB,KAAK,KAAOsb,GAAmBlc,CAAK,EACpC,KAAK,QAAU0D,GAAe1D,CAAK,EACnC,KAAK,OAASO,EACd,KAAK,GAAKyc,EACV,KAAK,SAAY,KAAK,KAAO,EAAI,KAAK,KAAK,SAAQ,EAAK,SAG1D,cAAA,eAAID,EAAI,UAAA,OAAA,CAAR,IAAA,UAAA,CACE,OAAO,KAAK,MAAM,qCACnB,CAAA,EAOKA,EAAA,UAAA,OAAN,UAAA,0FACe,IAAA,GAAA,MAAA,CAAA,EAAM,KAAK,KAAI,CAAK,SAA3B,OAAAla,EAAOzI,EAAoB,KAAA,EACjC,CAAA,EAAOwiB,GAAU,OAAO,KAAK,MAAO,KAAK,MAAY/Z,CAAI,CAAC,MAC3D,EAMDka,EAAA,UAAA,WAAA,UAAA,CACE,OAAOH,GAAU,OAAO,KAAK,MAAO,KAAK,MAAY,KAAK,SAAQ,CAAE,GAShEG,EAAA,UAAA,MAAN,UAAA,0FACe,IAAA,GAAA,MAAA,CAAA,EAAM,KAAK,KAAI,CAAE,SAAxB,OAAAla,EAAOzI,EAAiB,KAAA,EAC9B,CAAA,EAAOgK,GAAc,KAAK,MAAOvB,EAAM,KAAK,QAAU,WAAW,CAClD,MAChB,EAQDka,EAAA,UAAA,UAAA,UAAA,CACE,OAAO3Y,GACI,KAAK,MAAO,KAAK,SAAQ,EAAI,KAAK,QAAU,WAAW,GAU9D2Y,EAAA,UAAA,KAAN,UAAA,mGAGM,OAFJ,KAAK,gBAAe,EACd/iB,EAAO2iB,GAAS,EAAG,KAAK,KAAK,MAAM,EACrC,KAAK,QAAU,SAAQ,CAAA,EAAA,CAAA,EACX,CAAA,EAAM3iB,CAAoB,SAAlCmJ,EAAQ/I,EAA0B,KAAA,EACxC,GAAI,CACF,MAAA,CAAA,EAAO+I,EAAM,IAAI,SAAAzN,EAAK,CAAA,OAAAunB,GAAkBvnB,CAAC,CAAnB,CAAoB,CAAmB,CAC9D,MAAO,CACN,MAAM,IAAI,MACN,+FACiD,CACtD,WAEH,IAAA,GAAA,MAAA,CAAA,EAAOsE,CAA+B,MACvC,EAoCD+iB,EAAS,UAAA,UAAT,SAAUtc,EAA0B,CAClC,YAAK,gBAAe,EACbkc,GAAS,EAAG,UAAU,KAAK,OAAQlc,CAAO,GASnDsc,EAAA,UAAA,SAAA,UAAA,CACE,KAAK,gBAAe,EACpB,IAAM/iB,EAAO2iB,GAAS,EAAG,SAAS,KAAK,MAAM,EAC7C,GAAI,KAAK,QAAU,SACjB,GAAI,CACF,OAAQ3iB,EAAsB,IAAI,SAAAtE,EAAK,CAAA,OAAAunB,GAAkBvnB,CAAC,CAAnB,CAAoB,CAE5D,MAAO,CACN,MAAM,IAAI,MACN,+FACiD,CACtD,CAEH,OAAOsE,GAIH+iB,EAAA,UAAA,MAAN,UAAA,iGACE,YAAK,gBAAe,EACD,CAAA,EAAAJ,GAAS,EAAG,KAAK,KAAK,MAAM,CAAC,SAChD,OADM3iB,EAAOI,EAAmC,KAAA,EAC5C,KAAK,QAAU,SACjB,CAAA,EAAOJ,CAAoB,EAE3B,CAAA,EAAO,IAAI,WAAYA,EAAoB,MAAM,CAAC,MAErD,EAOD+iB,EAAA,UAAA,QAAA,UAAA,CACM,KAAK,aAGL,KAAK,WACP,KAAK,UAAU,QAAO,EAExBJ,GAAS,EAAG,cAAc,IAAI,EAC9B,KAAK,mBAAqB,KAI5B,OAAA,eAAII,EAAU,UAAA,aAAA,CAAd,IAAA,UAAA,CACE,OAAO,KAAK,iDACb,CAAA,EAEDA,EAAA,UAAA,gBAAA,UAAA,CACE,GAAI,KAAK,WACP,MAAM,IAAI,MAAM,qBAAqB,GAYzCA,EAAK,UAAA,MAAL,SAAMxC,EAAe,CAAf,OAAAA,IAAA,SAAAA,EAAe,IACZqC,GAAU,MAAM,KAAMrC,CAAO,GAOtCwC,EAAA,UAAA,MAAA,UAAA,CACE,YAAK,gBAAe,EACbH,GAAU,MAAM,IAAI,GAQ7BG,EAAQ,UAAA,SAAR,SAASxC,EAAe,CAAfA,IAAA,SAAAA,EAAe,IACtB,IAAM1X,EAAO,KAAK,SAAQ,EAC1B,OAAOyX,GAAezX,EAAM,KAAK,MAAO,KAAK,MAAO0X,CAAO,GAG7DwC,EAAI,UAAA,KAAJ,SAAqBnc,EAAe,CAClC,YAAK,gBAAe,EACbgc,GAAU,KAAK,KAAWhc,CAAK,GAExCmc,EAAA,UAAA,SAAA,SAASG,EAAkBxkB,EAAekI,EAAgB,CAAjD,OAAAsc,IAAA,SAAAA,EAAgB,IACvB,KAAK,gBAAe,EACbP,GAAS,EAAG,aAAa,KAAMO,EAAWxkB,EAAMkI,CAAK,GAG/Dmc,CAAA,GAAA,EAED,OAAO,eAAeA,GAAQ,OAAO,YAAa,CAChD,MAAO,SAACI,EAAgB,CAMtB,MAAO,CAAC,CAACA,GAAYA,EAAS,MAAQ,MAAQA,EAAS,UAAY,MAC/DA,EAAS,iBAAmB,KAEnC,CAAA,WAEeC,IAAoB,CAIlC,OAAO9W,GAAU,SAAU,UAAA,CACzB,OAAOyW,EACT,CAAC,CACH,CAGAK,GAAoB,EAmCpB,IAAAC,IAAA,SAAAC,EAAA,CAAqD1nB,GAASynB,EAAAC,CAAA,EAG5D,SAAAD,EACIE,EAAgCL,EAAoBxkB,EACpD8kB,EAAgB,CAFpB,IAAAzgB,EAGEugB,EACI,KAAA,KAAAC,EAAa,MAAOA,EAAa,MAAOA,EAAa,OAAQC,CAAQ,GAE1E,KALmC,OAAAzgB,EAAS,UAATmgB,EAIlCngB,EAAK,KAAOrE,IAWd,OAAA2kB,EAAM,UAAA,OAAN,SAAOI,EAAmB,CACxB,GAAIA,EAAS,QAAU,KAAK,MAC1B,MAAM,IAAI,MACN,2BAAA,OAA2BA,EAAS,MAAa,QAAA,EACjD,mBAAA,OAAmB,KAAK,MAAK,cAAA,CAAc,EAEjD,GAAI,CAACxD,GAAiBwD,EAAS,MAAO,KAAK,KAAK,EAC9C,MAAM,IAAI,MACN,2BAAA,OAA2BA,EAAS,MAAa,QAAA,EACjD,mBAAA,OAAmB,KAAK,MAAK,cAAA,CAAc,EAEjDd,GAAS,EAAG,cAAc,IAAI,EAC9B,KAAK,OAASc,EAAS,OACvBd,GAAS,EAAG,OAAO,KAAM,IAAI,GAGtBU,EAAA,UAAA,QAAA,UAAA,CACPV,GAAS,EAAG,gBAAgB,IAAI,EAChC,KAAK,mBAAqB,IAE7BU,CAAA,GAvCoDN,EAAS,EAyC9D,OAAO,eAAeM,GAAU,OAAO,YAAa,CAClD,MAAO,SAACF,EAAkB,CACxB,OAAOA,aAAoBJ,IAAUI,EAAS,QAAU,MACpDA,EAAS,kBAAkB,SAElC,CAAA,EC5hBD,IAAYO,IAAZ,SAAYA,EAAI,CACdA,EAAA,GAAA,KACAA,EAAA,GAAA,KACAA,EAAA,GAAA,KACAA,EAAA,GAAA,KACAA,EAAA,GAAA,KACAA,EAAA,GAAA,KACAA,EAAA,GAAA,IACF,GARYA,KAAAA,GAQX,CAAA,EAAA,EAaD,IAAKC,IAAL,SAAKA,EAAiB,CACpBA,EAAA,QAAA,UACAA,EAAA,MAAA,QACAA,EAAA,KAAA,QACAA,EAAA,UAAA,WACF,GALKA,KAAAA,GAKJ,CAAA,EAAA,EAED,IAAKC,IAAL,SAAKA,EAAgB,CACnBA,EAAA,QAAA,UACAA,EAAA,MAAA,QACAA,EAAA,KAAA,OACAA,EAAA,UAAA,WACF,GALKA,KAAAA,GAKJ,CAAA,EAAA,EAED,IAAKC,IAAL,SAAKA,EAAmB,CACtBA,EAAA,QAAA,UACAA,EAAA,MAAA,UACAA,EAAA,KAAA,UACAA,EAAA,UAAA,WACF,GALKA,KAAAA,GAKJ,CAAA,EAAA,EAED,IAAKC,IAAL,SAAKA,EAAqB,CACxBA,EAAA,QAAA,YACAA,EAAA,MAAA,YACAA,EAAA,KAAA,YACAA,EAAA,UAAA,WACF,GALKA,KAAAA,GAKJ,CAAA,EAAA,EAED,IAAMC,GAAgB,CACpB,QAAWF,GACX,MAASF,GACT,KAAQC,GACR,UAAaE,IAGC,SAAAE,GAAWC,EAAiBC,EAAe,CACzD,GAAID,IAAU,UAAYC,IAAU,SAAU,CAC5C,GAAID,IAAU,UAAYC,IAAU,SAClC,MAAO,SAET,MAAM,IAAI,MAAM,kBAAA,OAAkBD,EAAc,QAAA,EAAA,OAAAC,CAAK,CAAE,CACxD,CACD,OAAOH,GAAcE,CAAK,EAAEC,CAAK,CACnC,CAuEM,SAAUC,GAAYxd,EAAe,CACzC,OAAOA,GAAU,MAAQ,OAAOA,GAAW,UAAY,YAAaA,GAChEA,EAAO,mBAAmB,YAChC,CACM,SAAUyd,GAAazd,EAAe,CAC1C,OAAO,OAAO,UAAc,KAAeA,GAAU,MACjD,OAAOA,GAAW,UAAY,WAAYA,GAC1CA,EAAO,kBAAkB,SAC/B,CC9LgB,SAAA0d,GAAiC7c,EAAM9L,EAAI,CACzD,GAAI8L,EAAE,QAAU9L,EAAE,MAChB,MAAO,CAAC8L,EAAG9L,CAAC,EAEd,IAAMkL,EAAQod,GAAWxc,EAAE,MAAO9L,EAAE,KAAK,EACzC,MAAO,CAAC8L,EAAE,KAAKZ,CAAK,EAAGlL,EAAE,KAAKkL,CAAK,CAAC,CACtC,CAEgB,SAAA0d,GAAiB9c,EAAW9L,EAAS,CACnDqL,EACIS,EAAE,QAAU9L,EAAE,MACd,UAAA,CAAM,MAAA,2BAAA,OAA2B8L,EAAE,MAAY,OAAA,EAC3C,WAAA,OAAW9L,EAAE,MAAK,oBAAA,CADhB,CACoC,CAChD,CAkBM,SAAU6oB,GAAsB5nB,EAAuB,CAC3D,IAAM6nB,EAAiB,CAAA,EACjBC,EAAO,IAAI,IACjB,OAAAC,GAAoB/nB,EAAQ6nB,EAAMC,CAAI,EAC/BD,CACT,CAEA,SAASE,GACLC,EAA4BH,EAAgBC,EAAkB,CAChE,GAAIE,GAAa,KAGjB,IAAIA,aAAqB5B,GAAQ,CAC/ByB,EAAK,KAAKG,CAAS,EACnB,MACD,CACD,GAAKC,GAAWD,CAAS,EAIzB,KAAME,EAAWF,EACjB,QAAWG,KAAKD,EAAU,CACxB,IAAMvL,EAAMuL,EAASC,CAAC,EACjBL,EAAK,IAAInL,CAAG,IACfmL,EAAK,IAAInL,CAAG,EACZoL,GAAoBpL,EAAKkL,EAAMC,CAAI,EAEtC,GACH,CAGA,SAASG,GAAW/M,EAAQ,CAC1B,OAAO,MAAM,QAAQA,CAAG,GAAK,OAAOA,GAAQ,QAC9C,CCiBA,SAASkN,GAELC,EACgC,CAElC,OAAQA,EAAmD,YAAc,IAC3E,CAEA,IAAAC,IAAA,UAAA,CAAA,SAAAA,GAAA,CAEE,KAAmB,oBAAqB,CAAA,EAExC,KAAc,eAAG,EACjB,KAAQ,SAAG,EACX,KAAU,WAAG,EACb,KAAgB,iBAAG,EACnB,KAAc,eAAG,EAMjB,KAAa,cAAG,EAGhB,KAAW,YAAG,EAId,KAAU,WAAiB,CAAA,EAK3B,KAAiB,kBAAa,CAAA,EAC9B,KAAW,YAAG,EAEd,KAAA,WAAa,IAAI,QAOjB,KAAS,UAAG,GACZ,KAAA,cAA6B,CAC3B,SAAU,EACV,WAAY,EACZ,UAAW,EACX,QAAS,CAAA,EACT,OAAQ,KACR,IAAI,aAAW,CAET,OAAO,MAAM,KAAK,IAAI,IAAI,KAAK,QAAQ,IAAI,SAAAH,EAAK,CAAA,OAAAA,EAAE,IAAI,CAAA,CAAC,CAAC,IAIhE,OAAAG,EAAA,UAAA,QAAA,UAAA,CACE,QAAWC,KAAgB,KAAK,oBAC9B,KAAK,oBAAoBA,CAAY,EAAE,QAAO,GAGnDD,CAAA,GAAA,EAEDE,IAAA,UAAA,CAgBE,SAAAA,EAAmB9pB,EAAgB,CAAhB,KAAG,IAAHA,EAbnB,KAAQ,SAAkC,CAAA,EAC1C,KAAe,gBAKX,CAAA,EAKI,KAAoB,qBAAG,EAG7B,KAAK,MAAQ,IAAI4pB,GAGb,OAAAE,EAAA,UAAA,MAAN,UAAA,uGACE,GAAI,KAAK,oBAAsB,KAC7B,MAAO,CAAA,EAAA,KAAK,mBAAmB,KAAK,UAAA,CAAA,CAAQ,CAAC,EAE/C,GAAI,KAAK,iBAAmB,KAC1B,MAAO,CAAA,CAAA,EAEHC,EAAiB,KAAK,kBAAiB,EAEpCznB,EAAI,mBAAG,OAAAA,EAAIynB,EAAe,QAC3BvO,EAAcuO,EAAeznB,CAAC,EACd,CAAA,EAAA,KAAK,kBAAkBkZ,CAAW,EAAE,OAAO,GAF1B,CAAA,EAAA,CAAA,SAGnC,OADEwO,EAAUvlB,EAAiD,KAAA,EAC7DulB,EACF,CAAA,EAAM,KAAK,WAAWxO,CAAW,CAAC,EADzB,CAAA,EAAA,CAAA,SACT,OAAA/W,EAAA,KAAA,EACO,CAAA,CAAA,SALgC,OAAAnC,iBAS3C,MAAM,IAAI,MACN,wEACS,MACd,EAED,OAAA,eAAIwnB,EAAO,UAAA,UAAA,CAAX,IAAA,UAAA,CACE,GAAI,KAAK,oBAAsB,KAC7B,MAAM,IAAI,MACN,YAAA,OAAY,KAAK,YAAkD,uCAAA,EACnE,gFACe,EAErB,GAAI,KAAK,iBAAmB,KAAM,CAC1B,IAAArlB,EAAoB,KAAK,gCAA+B,EAAvDpB,EAAIoB,EAAA,KAAEwlB,EAASxlB,EAAA,UACtB,GAAIwlB,EACF,MAAM,IAAI,MACN,iCAAA,OAAiC5mB,EAAyB,qBAAA,EAC1D,kGACoD,EAE1D,KAAK,WAAWA,CAAI,CACrB,CACD,OAAO,KAAK,8CACb,CAAA,EAEDymB,EAAA,UAAA,aAAA,UAAA,CACE,OAAO,OAAO,KAAK,KAAK,eAAe,GAGzCA,EAAW,UAAA,YAAX,SAAYtO,EAAmB,CAC7B,GAAI,EAAEA,KAAe,KAAK,UAGxB,GAAIA,KAAe,KAAK,gBAAiB,CAChC,IAAAyO,EAAa,KAAK,kBAAkBzO,CAAW,EAAC,UACvD,GAAIyO,EAEF,OAAO,IAEV,KACC,QAAO,KAGX,OAAO,KAAK,SAASzO,CAAW,GAGlCsO,EAAkB,UAAA,mBAAlB,SAAmBtO,EAAmB,CAEpC,OAAMA,KAAe,KAAK,gBAGnB,KAAK,gBAAgBA,CAAW,EAAE,QAFhC,MAKXsO,EAAA,UAAA,gBAAA,SACItO,EACA0O,EACAC,EAAY,CACd,OADEA,IAAA,SAAAA,EAAY,GACV3O,KAAe,KAAK,iBACtB4O,GACI,GAAA,OAAG5O,EAA8C,mCAAA,EACjD,mCAAmC,EAChC,KAET,KAAK,gBAAgBA,CAAW,EAAI,CAAC,QAAO0O,EAAE,SAAQC,CAAA,EAC/C,KAGHL,EAAU,UAAA,WAAhB,SAAiBtO,EAAmB,yGAClC,GAAI,KAAK,gBAAgBA,CAAW,GAAK,KACvC,MAAM,IAAI,MAAM,iBAAA,OAAiBA,EAAW,yBAAA,CAAyB,SAEvE,KAAK,YAAcA,EACf,KAAK,SAASA,CAAW,GAAK,KAAI,CAAA,EAAA,CAAA,GACpC,KAAK,gBAAkB,KACjB/W,EAAuB,KAAK,kBAAkB+W,CAAW,EAAxDwO,EAAOvlB,EAAA,QAAEwlB,EAASxlB,EAAA,UACVwlB,EAAY,CAAA,EAAMD,CAAO,EAAhB,CAAA,EAAA,CAAA,UAAG,OAAAjlB,EAAAiL,EAAA,KAAA,eAAgBjL,EAAAilB,mBAC3C,GADM1oB,EAA4CyD,EAC9C,CAACzD,EACH,MAAA,CAAA,EAAO,EAAK,mBAGhB,YAAK,gBAAkB,KAAK,SAASka,CAAW,EAChD,KAAK,uBAAsB,EAE3B,KAAK,SAAW,IAAIwG,GAAS,KAAK,eAAe,EAEjD,CAAA,EAAO,EAAI,MACZ,EAEO8H,EAAA,UAAA,uBAAA,UAAA,CAAA,IAOPpiB,EAAA,KANO2iB,EAAU1O,GAAqB,KAAK,WAAW,EACrD0O,EAAQ,QAAQ,SAAAC,EAAM,CAChBA,EAAO,WAAa,MACtBA,EAAO,UAAU5iB,EAAK,eAAe,CAEzC,CAAC,GAGKoiB,EAAwB,UAAA,yBAAxB,SAAyBtO,EAAmB,CAA5C,IAOP9T,EAAA,KANO2iB,EAAU1O,GAAqBH,CAAW,EAChD6O,EAAQ,QAAQ,SAAAC,EAAM,CAChBA,EAAO,aAAe,MACxBA,EAAO,YAAY5iB,EAAK,SAAS8T,CAAW,CAAC,CAEjD,CAAC,GASKsO,EAAiB,UAAA,kBAAjB,SAAkBtO,EAAmB,CAArC,IAkDP9T,EAAA,KAhDO6iB,EAAuB,KAAK,gBAAgB/O,CAAW,EAC7D,GAAI+O,GAAwB,KAC1B,MAAM,IAAI,MACN,6BAAA,OAA6B/O,EAAW,0BAAA,CAA0B,EAGxE,GAAI,CACF,IAAMO,EAAUwO,EAAqB,QAAO,EAM5C,GAAIxO,GAAW,EAAEA,aAAmB9Q,KAChC,OAAO8Q,EAAQ,MAAS,WAAY,CACtC,IAAMyO,EAAY,EAAE,KAAK,qBACnBR,EACFjO,EACK,KAAK,SAAA0O,EAAe,CAEnB,OAAID,EAAY9iB,EAAK,qBACZ,IAETA,EAAK,SAAS8T,CAAW,EAAIiP,EAC7B/iB,EAAK,mBAAqB,KACnB,GACT,CAAC,EACA,MAAM,SAAAgjB,EAAG,CAER,OAAIF,EAAY9iB,EAAK,uBAGrBA,EAAK,mBAAqB,KAC1B0iB,GAAS,6BAAA,OAA6B5O,EAAW,SAAA,CAAS,EAC1D4O,GAASM,EAAI,OAASA,EAAI,OAAO,GAC1B,EACT,CAAC,EACT,YAAK,mBAAqBV,EACnB,CAAC,QAAOA,EAAE,UAAW,EAAI,CACjC,KACC,aAAK,SAASxO,CAAW,EAAIO,EACtB,CAAC,QAAS,GAAM,UAAW,EAAK,CAE1C,OAAQ2O,EAAK,CACZN,OAAAA,GAAS,6BAAA,OAA6B5O,EAAW,SAAA,CAAS,EAC1D4O,GAASM,EAAI,OAASA,EAAI,OAAO,EAC1B,CAAC,QAAS,GAAO,UAAW,EAAK,CACzC,GAGHZ,EAAa,UAAA,cAAb,SAActO,EAAmB,CAC/B,GAAI,EAAEA,KAAe,KAAK,iBACxB,MAAM,IAAI,MAAM,GAAA,OAAGA,EAAW,gCAAA,CAAgC,EAE5D,KAAK,cAAgBA,GAAe,KAAK,oBAAsB,MAGjE,KAAK,uBAGHA,KAAe,KAAK,WACtB,KAAK,yBAAyBA,CAAW,EACzC,KAAK,SAASA,CAAW,EAAE,QAAO,EAClC,OAAO,KAAK,SAASA,CAAW,GAGlC,OAAO,KAAK,gBAAgBA,CAAW,EAGnC,KAAK,cAAgBA,IACvB,KAAK,mBAAqB,KAC1B,KAAK,YAAc,KACnB,KAAK,gBAAkB,OAInBsO,EAAA,UAAA,kBAAA,UAAA,CAAA,IASPpiB,EAAA,KARC,GAAI,OAAO,KAAK,KAAK,eAAe,EAAE,SAAW,EAC/C,MAAM,IAAI,MAAM,+BAA+B,EAEjD,OAAO,OAAO,KAAK,KAAK,eAAe,EAAE,KAAK,SAACyE,EAAW9L,EAAS,CAEjE,OAAOqH,EAAK,gBAAgBrH,CAAC,EAAE,SAC3BqH,EAAK,gBAAgByE,CAAC,EAAE,QAC9B,CAAC,GAGK2d,EAAA,UAAA,gCAAA,UAAA,CAIN,QAFMC,EAAiB,KAAK,kBAAiB,EAEpCznB,EAAI,EAAGA,EAAIynB,EAAe,OAAQznB,IAAK,CAC9C,IAAMkZ,EAAcuO,EAAeznB,CAAC,EAC9BmC,EAAuB,KAAK,kBAAkB+W,CAAW,EAAxDwO,EAAOvlB,EAAA,QAAEwlB,EAASxlB,EAAA,UACzB,GAAIwlB,GAAaD,EACf,MAAO,CAAC,KAAMxO,EAAa,UAASyO,CAAA,CAEvC,CACD,MAAM,IAAI,MACN,wEACS,GAGfH,EAAA,UAAA,SAAA,SAAS/N,EAAwB7Q,EAAc,CAC7C,IAAMyf,EAAO,KAAK,MAAM,WAAW,IAAIzf,CAAM,EACvC0f,EAAaD,EAAK,QAClBrf,EAAS,KAAK,SAASJ,CAAM,EAC7BM,EAAWof,EAAW,SAAS1f,CAAM,EAG3C0f,EAAW,YAAY1f,EAAQ,EAAI,EACnCyf,EAAK,QAAU5O,EACfA,EAAQ,KAAK7Q,EAAQI,EAAQqf,EAAK,MAAOA,EAAK,MAAOnf,CAAQ,EACzD,KAAK,uBAAsB,GAG7B,KAAK,MAAM,kBAAkB,KAAK,MAAM,kBAAkB,OAAS,CAAC,KAIxEse,EAAA,UAAA,KAAA,SAAgCe,EAA6BpD,EAAe,CAA5E,IAkCC/f,EAAA,KAhCKrE,EAAe,KACnB,GAAIokB,GAAM,KAAM,CAEd,GAAI,OAAOoD,GAAa,WACtB,MAAM,IAAI,MAAM,qCAAqC,EAEvDpD,EAAKoD,CACN,KAAM,CAEL,GAAI,OAAOA,GAAa,UAAY,EAAEA,aAAoB,QACxD,MAAM,IAAI,MACN,gFAC4B,EAElC,GAAI,OAAOpD,GAAO,WAChB,MAAM,IAAI,MACN,gFAC8B,EAEpCpkB,EAAOwnB,CAGR,CACD,IAAIvpB,EACJ,OAAO,KAAK,UACR,UAAA,CAAM,OAAAoG,EAAK,WAAWrE,CAAI,CAAC,EAAE,UAAM,CAAA,OAAAqE,EAAK,SAASpG,CAAM,CAApB,EAAuB,UAAA,CACxD,OAAAA,EAASmmB,EAAE,EACPnmB,aAAkB,SACpB,QAAQ,MAAM,yCAAyC,EAElDA,CACT,CAAC,GAGCwoB,EAAA,UAAA,UAAA,SAAa7lB,EAAmBC,EAAiBvC,EAAU,CACjEsC,EAAK,EACL,GAAI,CACF,IAAMoc,EAAM1e,EAAC,EACb,OAAAuC,EAAG,EACImc,CACR,OAAQyK,EAAI,CACX,MAAA5mB,EAAG,EACG4mB,CACP,GAIKhB,EAAA,UAAA,aAAA,UAAA,CACN,OAAOA,EAAO,gBAIRA,EAAA,UAAA,eAAA,UAAA,CACN,OAAOA,EAAO,kBASRA,EAAK,UAAA,MAAL,SAAM/b,EAAS,CACrB,IAAMnM,EAAYmpB,EAAO,UAAU5V,GACA,CAAC,EAACpH,CAAA,CAA8B,EAC7D/F,EAAS,CAAC,EAAC+F,CAAA,EACXid,EAAO,SAACC,EAAU,CAAK,MAAC,CAC5B,EAAG,UAAA,CACD,IAAM1f,EAAQ,UACR2f,EAAa,CAAC,EAAGD,CAAE,EACnB1gB,EAAQ,CAAC,MAAKgB,CAAA,EAEpB,OAAOwf,EAAO,UACHrY,GAAMwY,EAEN3gB,CAAgC,GAE7C,EACI4gB,EAAkB,CAAA,EACxB,YAAK,YAAY,KAAK,MAAM,YAAY,KAAMnjB,EAAQ,CAACpG,CAAC,EAAGopB,EAAMG,EAAO,CAAA,CAAE,EACnEvpB,GAgBTkoB,EAAA,UAAA,UAAA,SACIre,EAAoBzD,EAAwBuC,EAAoB,CAC9D,KAAK,aAAe,MAMtB,KAAK,QAEP,IAAM6gB,EAAY7P,GAAU9P,EAAY,KAAK,WAAW,GAAK,KAC7D,GAAI,CAAC2f,EACH,MAAM,IAAI,MAAM,WAAW,OAAA3f,EACvB,gCAAA,EAAA,OAAA,KAAK,YAAc,GAAA,CAAA,EAEzB,OAAO,KAAK,cAAc,CAAC,WAAUA,EAAE,OAAMzD,EAAE,MAAKuC,CAAA,CAAC,GAG/Cuf,EAAA,UAAA,uBAAA,UAAA,CACN,OAAO,KAAK,IAAI,QAAQ,SAAS,GAG3BA,EAAA,UAAA,sBAAA,SACJre,EAAoB4f,EACpBC,EAAsB,CACxB,IAAMC,EAAkB,KAAK,QAAQ,WAAU,EAG3CC,EAAmB,EACvBF,EAAS,QAAQ,SAAAX,EAAI,CAGnBa,GAAqBb,EAAK,QAAU,YAAc,EAAI,CACxD,CAAC,EAOD,IAAMc,EACF,KAAK,MAAM,kBAAkB,KAAK,MAAM,kBAAkB,OAAS,CAAC,EAClEC,EACFH,EAAkBF,EAAmBG,EAAmBC,EAC5D,GAAIC,EAAgB,EAClB,MAAM,IAAI,MACN,YAAA,OAAY,KAAK,YAA2C,gCAAA,EAC5D,IAAA,OAAIA,EAAa,4BAAA,EAAA,OAA6BjgB,EAAU,GAAA,CAAG,GAS3Dqe,EAAa,UAAA,cAAb,SACJ6B,EACgC,CAF5B,IAqJPjkB,EAAA,KAlJKO,EACAkjB,EAAkB,CAAA,EAChBS,EAAW,KAAK,SAAQ,EAExBC,EAAoB,KAAK,MAAM,SAC/BC,EAAqB,KAAK,MAAM,WAElC,KAAK,uBAAsB,GAC7B,KAAK,MAAM,kBAAkB,KAAK,CAAC,EAGrC,IAAIC,EACA,KAAK,aAAe,MAMtB,KAAK,QAGP,IAAIC,EAEEC,EAAoBvC,GAA6BiC,CAAY,EAC/DA,EAAa,WACb,KAAK,MAAM,aAAe,KAAO,KAAK,MAAM,YAAY,KAAO,GAMnE,GAAIjC,GAA6BiC,CAAY,EAAG,CACvC,IAAAO,EAA6BP,EAAY,WAA7BtnB,EAAiBsnB,EAAY,OAArBQ,EAASR,EAAY,MAC5C,KAAK,aAAe,MAMtB,KAAK,QAEP,IAAMS,EAAS7Q,GAAU2Q,EAAY,KAAK,WAAW,EACrDnF,EACIqF,GAAU,KACV,UAAM,CAAA,MAAA,kCAAA,OAAkCF,EAAU,iBAAA,EAAA,OAC9CxkB,EAAK,YAAW,GAAA,CADd,CACiB,EAE3BqkB,EAAa,UAAA,CACX,IAAMV,EAAmB3jB,EAAK,QAAQ,WAAU,EAChDskB,EAAMI,EAAO,WAAW,CAAC,OAAM/nB,EAAE,MAAK8nB,EAAE,QAASzkB,EAAK,OAAO,CAAC,EAC9D,IAAM4jB,EAAW,MAAM,QAAQU,CAAG,EAAIA,EAAM,CAACA,CAAG,EAC5CtkB,EAAK,uBAAsB,GAC7BA,EAAK,sBAAsBwkB,EAAYb,EAAkBC,CAAQ,EAGnE,IAAMe,EAAaf,EAAS,IAAI,SAACgB,EAA0B,CAIzD,OAAKA,EAAmB,MAAQ,KACvBA,EAEF5kB,EAAK,yBAAyB4kB,CAAO,CAC9C,CAAC,EAOD,GAAIV,EAAU,CACZ,IAAMW,EACF7kB,EAAK,sBAAsBwkB,EAAY7nB,EAAQgoB,CAAU,EAC7DlB,EAAQzjB,EAAK,2BAA2B6kB,CAAa,CACtD,CACD,OAAOF,CACT,CACD,KAAM,CACE,IAAAG,EAAeb,EAAY,YAE5Bc,EAAyB,SAACC,EAAO,CAIhCd,IAGLT,EAAQuB,EAAQ,IAAI,SAAAhoB,EAAU,CAAA,OAAAgD,EAAK,KAAKA,EAAK,MAAMhD,CAAM,CAAC,CAAC,CAAA,EAC7D,EAEAqnB,EAAa,UAAA,CACX,IAAMV,EAAmB3jB,EAAK,QAAQ,WAAU,EAChDskB,EAAMtkB,EAAK,KAAK,UAAA,CAAM,OAAA8kB,EAAY9kB,EAAK,QAAS+kB,CAAQ,CAAlC,CAAmC,EACzD,IAAME,EAAQ,MAAM,QAAQX,CAAG,EAAIA,EAAM,CAACA,CAAG,EAC7C,OAAItkB,EAAK,uBAAsB,GAE7BA,EAAK,sBAAsBukB,EAAmBZ,EAAkBsB,CAAI,EAE/DA,CACT,CACD,CAKM,IAAA3kB,EAAiB2jB,EAAY,OAArBphB,EAASohB,EAAY,MAC9BiB,EAAgBlD,GAA6BiC,CAAY,EAC3D,KACAA,EAAa,cAEbhJ,EACJ,YAAK,UAED,UAAM,CAAA,OAAAjb,EAAK,MAAM,aAAa,EAAE,UAAA,CAAM,OAAAA,EAAK,MAAM,aAAa,EAAE,UAAA,CAC1D,CAACA,EAAK,IAAI,QAAQ,OAAO,GAAK,CAACA,EAAK,MAAM,UAC5CO,EAAU8jB,EAAU,GAEpBpJ,EAAgBjb,EAAK,SAAS,cAC1BukB,EAAmBjkB,EAAQ,UAAA,CAAM,OAAA+jB,EAAU,CAAV,CAAY,EAC7CrkB,EAAK,IAAI,QAAQ,OAAO,GAC1BA,EAAK,SAAS,iBAAiBib,CAAa,EAE9C1a,EAAU0a,EAAc,QAE5B,CAAC,EAEDiJ,GACF,KAAK,YACDK,EAAmBjkB,EAAQC,EAAS2kB,EAAezB,EAAO5gB,CAAK,EAGjE,KAAK,MAAM,WACb,KAAK,MAAM,cAAc,QAAQ,KAAK,CACpC,KAAM0hB,EACN,WAAY,KAAK,MAAM,SAAWJ,EAClC,mBAAoB,KAAK,MAAM,SAC/B,aAAc,KAAK,MAAM,WAAaC,EACtC,qBAAsB,KAAK,MAAM,WACjC,YAAa,OAAO,KAAK9jB,CAAM,EAAE,IAC7B,SAAAK,EAAO,CAAA,OAAAL,EAAOK,CAAG,GAAK,KAAOL,EAAOK,CAAG,EAAE,MAAQ,IAAI,CAAA,EACzD,aAAcJ,EAAQ,IAAI,SAAA4kB,EAAQ,CAAA,OAAAA,EAAK,KAAK,CAAA,EAC5C,aAAclK,EAAc,OAC5B,UAAWA,EAAc,SAC1B,CAAA,EAEK,MAAM,QAAQqJ,CAAG,EAAI/jB,EAAUA,EAAQ,CAAC,GAQ1C6hB,EAA0B,UAAA,2BAA1B,SAA2B4C,EAAiB,CAA5C,IAGPhlB,EAAA,KAFOyjB,EAAQuB,EAAQ,IAAI,SAAAhoB,EAAU,CAAA,OAAAgD,EAAK,KAAKA,EAAK,MAAMhD,CAAM,CAAC,CAAC,CAAA,EACjE,OAAOymB,GAUDrB,EAAA,UAAA,sBAAA,SACJre,EAAoBzD,EACpBC,EAAiB,CACnB,IAAM6kB,EAAapR,GAAYjQ,CAAU,EACzC,GAAIqhB,GAAc,KAAM,CACtB,IAAMC,EAAyBD,EAAW,cAAgB,CAAA,EACpDE,EAA2BF,EAAW,eAAiB,CAAA,EAIzDG,EAA4B,OAC5BH,EAAW,eACb/F,EACI,MAAM,QAAQ/e,CAAM,EACpB,UAAA,CAAM,MAAA,wDAAA,CAAwD,EAElEilB,EAAqB,OAAO,KAAKjlB,CAAM,EAAE,IAAI,SAACK,EAAG,CAAK,OAAAL,EAAOK,CAAG,CAAC,CAAA,GAEjE4kB,EAAqBF,EAAa,IAAI,SAACznB,EAAS,CAAK,OAAA0C,EAAO1C,CAAS,CAAhB,CAAiB,EAGxE,IAAM4nB,EACFjlB,EAAQ,OAAO,SAACxG,EAAGa,EAAM,CAAA,OAAA0qB,EAAc1qB,CAAC,CAAf,CAAgB,EAE7C,OAAO2qB,EAAmB,OAAOC,CAAmB,CACrD,CAOD,MAAO,CAAA,GAQTpD,EAAU,UAAA,WAAV,SACIxe,EAAoBX,EAAiBY,EACrCwQ,EAAuB,CACzB,GAAIzQ,GAAU,KACZ,MAAM,IAAI,MAAM,+CAA+C,EAEjEC,EAAQA,GAAS,UACjBwQ,EAAUA,GAAW,KAAK,QAC1B,IAAIoR,EAAc7hB,EACdC,IAAU,UAAY6hB,GAAc9hB,EAAO,CAAC,CAAC,IAC/C6hB,EAAe7hB,EAAoB,IAAI,SAAAlL,EAAK,CAAA,OAAAitB,GAAkBjtB,CAAC,CAAnB,CAAoB,GAElE,IAAM8K,EAAS6Q,EAAQ,MAAMoR,EAAaxiB,EAAOY,CAAK,EAChD7J,EAAI,IAAIgmB,GAAO/c,EAAOY,EAAOL,EAAQ,KAAK,aAAY,CAAE,EAI9D,GAHA,KAAK,YAAYxJ,EAAGqa,CAAO,EAGvBxQ,IAAU,SAAU,CACtB,IAAMof,EAAO,KAAK,MAAM,WAAW,IAAIzf,CAAM,EACvCoiB,EAAW1f,GAAqBuf,CAA2B,EACjE,KAAK,MAAM,UAAYG,EAAW3C,EAAK,MACvCA,EAAK,MAAQ2C,CACd,CACD,OAAO5rB,GASTooB,EAAoB,UAAA,qBAApB,SACE5e,EAAgBP,EAAiBY,EACjCwQ,EAAuB,CACvBxQ,EAAQA,GAAS,UACjB,IAAMgiB,EAAyB,CAAC,OAAMriB,EAAE,MAAKP,EAAE,MAAKY,CAAA,EACpD,OAAO,KAAK,yBAAyBgiB,EAAYxR,CAAO,GAQ1D+N,EAAA,UAAA,yBAAA,SAAyByD,EAAwBxR,EAAuB,CAE/D,IAAA7Q,EAAwBqiB,EAAU,OAA1B5iB,EAAgB4iB,EAAU,MAAnBhiB,EAASgiB,EAAU,MACnC7rB,EAAI,IAAIgmB,GAAO/c,EAAOY,EAAOL,EAAQ,KAAK,aAAY,CAAE,EAC9D,YAAK,YAAYxJ,EAAGqa,CAAO,EACpBra,GAGTooB,EAAY,UAAA,aAAZ,SACI5B,EAAsBL,EAAkBxkB,EACxCkI,EAAgB,CADMsc,IAAA,SAAAA,EAAgB,IAExCxkB,EAAOA,GAAQ,KAAK,eAAc,EAAG,SAAQ,EACzCkI,GAAS,MAAQA,IAAU2c,EAAa,QAC1CA,EAAeA,EAAa,KAAK3c,CAAK,GAExC,IAAMvJ,EAAI,IAAIgmB,GAASE,EAAcL,EAAWxkB,EAAM,KAAK,aAAY,CAAE,EACzE,GAAI,KAAK,MAAM,oBAAoBrB,EAAE,IAAI,GAAK,KAC5C,MAAM,IAAI,MAAM,sBAAA,OAAsBA,EAAE,KAA6B,yBAAA,CAAA,EAEvE,YAAK,MAAM,oBAAoBA,EAAE,IAAI,EAAIA,EACzC,KAAK,OAAOA,EAAG,KAAK,OAAO,EACpBA,GAGT8nB,EAAA,UAAA,YAAA,SAAY3d,EAAW4P,EAAsB,CAC3C,KAAK,MAAM,aACP5P,EAAE,QAAU,UACd,KAAK,MAAM,mBAIb,IAAI2B,EAAQ,EACR3B,EAAE,QAAU,aAAeA,EAAE,QAAU,WACzC2B,EAAQ3B,EAAE,KAAOqhB,GAAqBrhB,EAAE,KAAK,GAE/C,KAAK,MAAM,UAAY2B,EAElB,KAAK,MAAM,WAAW,IAAI3B,EAAE,MAAM,IACrC,KAAK,MAAM,iBACX,KAAK,MAAM,WAAW,IAAIA,EAAE,OAAQ,CAClC,QAAS4P,GAAW,KAAK,QACzB,MAAO5P,EAAE,MACT,MAAOA,EAAE,MACT,MAAK2B,CACN,CAAA,GAGG3B,aAAa6b,IACjB,KAAK,MAAM7b,CAAC,GAShB2d,EAAA,UAAA,OAAA,SAAO3d,EAAW4P,EAAsB,CACtC,KAAK,YAAY5P,EAAG4P,CAAO,EAC3B,KAAK,QAAQ,OAAO5P,EAAE,MAAM,GAG9B2d,EAAA,UAAA,aAAA,SAAa5e,EAAgB6Q,EAAsB,CAC7C,KAAK,MAAM,WAAW,IAAI7Q,CAAM,GAChC,KAAK,MAAM,WAAW,IAAIA,CAAM,EAAE,UAAY6Q,IAChD,KAAK,MAAM,WAAW,OAAO7Q,CAAM,EACnC,KAAK,MAAM,mBAGf4e,EAAa,UAAA,cAAb,SAAc3d,EAAS,CACrB,GAAK,KAAK,MAAM,WAAW,IAAIA,EAAE,MAAM,EAGvC,KAAMwe,EAAO,KAAK,MAAM,WAAW,IAAIxe,EAAE,MAAM,EAS/C,GAPA,KAAK,MAAM,aACPA,EAAE,QAAU,WACd,KAAK,MAAM,mBACX,KAAK,MAAM,UAAYwe,EAAK,OAI1Bxe,EAAE,QAAU,aAAeA,EAAE,QAAU,SAAU,CACnD,IAAM2B,EAAQ3B,EAAE,KAAOqhB,GAAqBrhB,EAAE,KAAK,EACnD,KAAK,MAAM,UAAY2B,CACxB,CAGG6c,EAAK,QAAQ,YAAYxe,EAAE,MAAM,GACnC,KAAK,aAAaA,EAAE,OAAQwe,EAAK,OAAO,IAQ5Cb,EAAA,UAAA,iBAAA,UAAA,CACE,QAAW2D,KAAW,KAAK,MAAM,oBAAqB,CACpD,IAAMzrB,EAAI,KAAK,MAAM,oBAAoByrB,CAAO,EAChD,KAAK,gBAAgBzrB,CAAC,CACvB,GAGH8nB,EAAe,UAAA,gBAAf,SAAgB9nB,EAAW,CACzB,KAAK,cAAcA,CAAC,EAChB,KAAK,MAAM,oBAAoBA,EAAE,IAAI,GAAK,MAC5C,OAAO,KAAK,MAAM,oBAAoBA,EAAE,IAAI,GAIhD8nB,EAAA,UAAA,OAAA,UAAA,CACE,IAAMa,EAAO,KAAK,QAAQ,OAAM,EAChC,OAAAA,EAAK,WAAa,KAAK,MAAM,WAC7BA,EAAK,eAAiB,KAAK,MAAM,eACjCA,EAAK,SAAW,KAAK,MAAM,SACvB,KAAK,MAAM,iBAAmB,IAChCA,EAAK,WAAa,GACdA,EAAK,SAAW,OAClBA,EAAK,QAAU,CAAA,GAEjBA,EAAK,QAAQ,KACT,uEACyB,GAExBA,GAGHb,EAAO,UAAA,QAAb,SAAc4D,EAAyD,qHAErE,YAAK,MAAM,UAAY,GAEjBC,EAAa,KAAK,MAAM,SACxBC,EAAkB,KAAK,MAAM,WAEnC,KAAK,MAAM,cAAc,QAAU,CAAA,EACnCnpB,EAAA,KAAK,MAAM,cAA6B,CAAA,EAAAipB,EAAK,CAAE,SAA/CjpB,EAAyB,OAASopB,EAAA,KAAA,EAElC,KAAK,MAAM,UAAY,GAEvB,KAAK,MAAM,cAAc,UAAY,KAAK,IAAL,MAAA,KAC9BlrB,GAAA,CAAA,EAAAJ,EAAA,KAAK,MAAM,cAAc,QAAQ,IAAI,SAAA,EAAC,CAAI,OAAA,EAAE,kBAAkB,CAAA,CAAC,EAAA,EAAA,CAAA,EACtE,KAAK,MAAM,cAAc,SAAW,KAAK,MAAM,SAAWorB,EAC1D,KAAK,MAAM,cAAc,WACrB,KAAK,MAAM,WAAaC,2CACP7oB,EAAA7C,GAAA,KAAK,MAAM,cAAc,OAAO,EAAA8N,EAAAjL,EAAA,KAAA,wCAA1CulB,EAAMta,EAAA,MACf8d,EAAAxD,EAA4B,CAAA,EAAAA,EAAO,YAAY,UAA/C,OAAAwD,EAAO,aAAeD,EAAA,KAAA,EACtBE,EAAAzD,EAAyB,CAAA,EAAAA,EAAO,SAAS,SAAzCyD,EAAO,UAAYF,EAAA,KAAA,+LAErB,IAAA,IAAA,MAAA,CAAA,EAAO,KAAK,MAAM,aAAa,MAChC,EAED/D,EAAA,UAAA,SAAA,UAAA,CACE,OAAO,KAAK,MAAM,cAAgB,GAAK,KAAK,MAAM,cAAgB,GAG5DA,EAAA,UAAA,YAAA,SACJre,EAAoBzD,EAAwBC,EAC5C+lB,EAAyB7C,EAAiB5gB,EAAmB,CAFzD,IA4BP7C,EAAA,KAzBOumB,EACF,CAAC,GAAI,KAAK,MAAM,iBAAkB,WAAUxiB,EAAE,OAAMzD,EAAE,QAAOC,EAAE,MAAKkjB,CAAA,EAElE2B,EAAapR,GAAYjQ,CAAU,EACrCqhB,GAAc,OAChBkB,EAAgBlB,EAAW,UAEzBkB,GAAiB,OACnBC,EAAS,SAAW,SAACzJ,EAAa,CAGhC,OAAAA,EAAMA,EAAI,IAAI,SAACyG,EAAI3oB,EAAC,CAClB,GAAI2oB,GAAM,KAAM,CACd,IAAMjhB,EAAS/B,EAAQ3F,CAAC,EAClBkL,EAAO0gB,GAAyBlkB,EAAO,KAAMA,EAAO,KAAK,EAC/D,OAAOtC,EAAK,WAAW8F,EAAMxD,EAAO,MAAOA,EAAO,KAAK,CACxD,CACD,OAAOihB,CACT,CAAC,EAGM+C,EAAcxJ,EAAI,OAAS,EAAIA,EAAMA,EAAI,CAAC,EAAG2G,EAAO5gB,CAAK,CAClE,GAEF,KAAK,MAAM,WAAW,KAAK0jB,CAAQ,GAGrCnE,EAAI,UAAA,KAAJ,SAAuBxoB,EAAS,CAC9B,OAAAA,EAAO,KAAO,GACPA,GAGDwoB,EAAA,UAAA,UAAA,UAAA,CACF,KAAK,MAAM,gBAAkB,IAC/B,KAAK,MAAM,WAAa,CAAA,GAE1B,KAAK,MAAM,iBAGLA,EAAA,UAAA,QAAA,UAAA,CACN,KAAK,MAAM,iBAObA,EAAU,UAAA,WAAV,SAAWzmB,EAAa,CACtB,IAAM8qB,EAAwB,CAC5B,MAAO,CAAA,EACP,KAAM,gBACN,GAAI,KAAK,MAAM,eAEb9qB,IACF8qB,EAAU,KAAO9qB,GAEnB,KAAK,MAAM,WAAW,KAAK8qB,CAAS,EACpC,KAAK,MAAM,YAAcA,GAO3BrE,EAAQ,UAAA,SAAR,SAASxoB,EAAwB,CAM/B,QAoBDoG,EAAA,KAzBO0mB,EAAyBlF,GAAsB5nB,CAAM,EACrD+sB,EACF,IAAI,IAAID,EAAuB,IAAI,SAAA1sB,EAAK,CAAA,OAAAA,EAAE,EAAE,CAAA,CAAC,EAGxCY,EAAI,EAAGA,EAAI,KAAK,MAAM,YAAY,MAAM,OAAQA,IAAK,CAC5D,IAAMoC,EAAS,KAAK,MAAM,YAAY,MAAMpC,CAAC,EACzC,CAACoC,EAAO,MAAQ,CAAC2pB,EAA0B,IAAI3pB,EAAO,EAAE,GAC1DA,EAAO,QAAO,CAEjB,CAED,IAAM4pB,EAAW,KAAK,MAAM,WAAW,IAAG,EAC1C,KAAK,MAAM,YAAc,KAAK,MAAM,WAAW,SAAW,EACtD,KACA,KAAK,MAAM,WAAW,KAAK,MAAM,WAAW,OAAS,CAAC,EAG1DF,EAAuB,QAAQ,SAAA1pB,EAAM,CAG/B,CAACA,EAAO,MAAQA,EAAO,UAAY4pB,EAAS,IAC9C5mB,EAAK,MAAMhD,CAAM,CAErB,CAAC,GASHolB,EAAS,UAAA,UAAT,SACInoB,EAAY8hB,EAAcwH,EAC1BsD,EAAwB,CAF5B,IAkDC7mB,EAAA,KA7CC,GAHE6mB,IAAA,SAAAA,EAAwB,IAC1BxH,EACItD,EAAG,OAAS,EAAG,UAAA,CAAM,MAAA,2CAAA,CAA2C,EAChEwH,GAAM,MAAQA,EAAG,QAAU,UAC7B,MAAM,IAAI,MAAM,0CAAA,OAA0CA,EAAG,MAAQ,GAAA,CAAA,EAGvE,IAAMrpB,EAAI,KAAK,UACX,UAAM,CAAA,OAAA8F,EAAK,UAAS,CAAE,EAAE,UAAA,CAAM,OAAAA,EAAK,QAAO,CAAZ,EAC9B,UAAA,CAAM,OAAAA,EAAK,KAAK,UAAW/F,CAAC,CAAtB,CAAuB,EAEjColB,EACInlB,aAAa8lB,GACb,UAAA,CAAM,MAAA,gDAAA,CAAgD,EAE1D,IAAM1D,EAAeT,GAAqB,KAAK,MAAM,WAAYE,EAAI7hB,CAAC,EACtE,GAAI,CAAC2sB,GAAoBvK,EAAa,SAAW,GAAKP,EAAG,OAAS,EAChE,MAAM,IAAI,MACN,qIAEO,EAGb,OAAO,KAAK,KAAK,WAAY,UAAA,CAC3B,IAAM+K,EAAuD,CAAA,EAC7DA,EAAuB5sB,EAAE,EAAE,EAAKqpB,GAAcwD,GAAK7sB,EAAE,KAAK,EAG1DwiB,GACIoK,EAAwBxK,EAExB,SAAAriB,EAAK,CAAA,OAAA+F,EAAK,KAAK/F,CAAoB,CAAC,EAEpC4iB,EAAG,EACP,IAAMmK,EAAQjL,EAAG,IAAI,SAAA1V,EAAC,CAAI,OAAAygB,EAAuBzgB,EAAE,EAAE,CAA3B,CAA4B,EAEtD,OAAIrG,EAAK,MAAM,gBAAkB,IAG/BA,EAAK,MAAM,WAAW,QAAQ,SAAA9D,EAAI,aAChC,QAAqBmB,EAAA7C,GAAA0B,EAAK,KAAK,EAAAoM,EAAAjL,EAAA,KAAA,EAAE,CAAAiL,EAAA,KAAAA,EAAAjL,EAAA,KAAA,EAAA,CAA5B,IAAML,EAAMsL,EAAA,MACftL,EAAO,QAAO,CACf,mGACH,CAAC,EACDgD,EAAK,MAAM,WAAa,MAEnB,CAAC,MAAO9F,EAAG,MAAK8sB,CAAA,CACzB,CAAC,GAGH5E,EAAU,UAAA,WAAV,SAA6BnoB,EAAwB,CAArD,IA2DC+F,EAAA,KAzDCqf,OAAAA,EACI4H,GAAgBhtB,CAAC,EACjB,UAAA,CAAM,MAAA,mDAAA,CAAmD,EACtD,UAAA,SAAoBqG,EAAA,CAAA,EAAAwI,EAAA,EAAnBA,EAAmB,UAAA,OAAnBA,IAAAxI,EAAmBwI,CAAA,EAAA,UAAAA,CAAA,EACzBuW,EACI/e,EAAO,MAAM,SAAAtG,EAAC,CAAI,OAAAA,aAAagmB,EAAb,CAAmB,EACrC,UAAA,CAAM,MAAA,kEACO,CAAA,EAEjB,IAAIrH,EAIEuO,EAA2B,CAAA,EACjC5mB,EAAO,QAAQ,SAACc,EAAOxG,EAAC,CACtBssB,EAAStsB,CAAC,EAAIwG,CAChB,CAAC,EAED,IAAM+lB,EAA8B,SAACptB,EAAGqtB,EAAI,CAC1C,OAAAzO,EAAM1e,EAAC,MAAA,OAAAgB,GAAA,CAAA,EAAAJ,EAAAI,GAAAA,GAAA,CAAA,EAAAJ,EAAQyF,CAAM,EAAE,EAAA,EAAA,CAAA8mB,CAAI,EAAA,EAAA,CAAA,EAAA,EAAA,CAAA,EAC3B/H,EACI1G,EAAI,iBAAiBqH,GACrB,UAAM,CAAA,MAAA,4FACoC,CAAA,EAC9CX,EACI4H,GAAgBtO,EAAI,QAAQ,EAC5B,UAAA,CAAM,MAAA,kGAC0C,CAAA,EAC7CA,EAAI,KACb,EAEMuM,EAAgB,SAAC3B,EAAOE,EAAe,CAC3C,IAAM4D,EAAU1O,EAAI,SAAS4K,EAAIE,CAAK,EAChCuD,EAAkB,MAAM,QAAQK,CAAO,EAAIA,EAAU,CAACA,CAAO,EACnEhI,EACI2H,EAAM,SAAW1mB,EAAO,OACxB,UAAA,CAAM,MAAA,qKAEsD,CAAA,EAChE+e,EACI2H,EAAM,MAAM,SAAAhtB,EAAC,CAAI,OAAAA,aAAagmB,EAAb,CAAmB,EACpC,UAAA,CAAM,MAAA,sIAEuB,CAAA,EACjC,IAAMsH,EAAyC,CAAA,EAC/C,OAAAN,EAAM,QAAQ,SAAC1D,EAAM1oB,EAAC,CACpB0sB,EAAQ1sB,CAAC,EAAI,UAAA,CAAM,OAAA0oB,CAAA,CACrB,CAAC,EACMgE,CACT,EAEA,OAAOtnB,EAAK,cAAc,CACxB,YAAWmnB,EACX,cAAajC,EACb,OAAQgC,CACT,CAAA,CACH,GAGF9E,EAAQ,UAAA,SAAR,SAAS5e,EAAc,CAErB,IAAMyf,EAAO,KAAK,MAAM,WAAW,IAAIzf,CAAM,EAC7C,OAAOyf,EAAK,QAAQ,SAASzf,CAAM,GAErC4e,EAAI,UAAA,KAAJ,SAAK5e,EAAc,CAEjB,IAAMyf,EAAO,KAAK,MAAM,WAAW,IAAIzf,CAAM,EAC7C,OAAOyf,EAAK,QAAQ,KAAKzf,CAAM,GAGjC4e,EAAA,UAAA,UAAA,SAAU5e,EAAgBE,EAA0B,CAElD,IAAMuf,EAAO,KAAK,MAAM,WAAW,IAAIzf,CAAM,EAC7C,OAAOyf,EAAK,QAAQ,UAAUzf,EAAQE,CAAO,GAGzC0e,EAAI,UAAA,KAAV,SAAW4D,EAAiB,mGACpB,OAAAzpB,EAAQud,GAAG,EACQ,CAAA,EAAA,KAAK,QAAQ,KAAKkM,CAAK,CAAe,SAAzD,OAAAuB,EAAaxqB,EAA4C,KAAA,EAC/DwqB,EAAW,OAASzN,GAAG,EAAKvd,EAC5B,CAAA,EAAOgrB,CAAU,MAClB,EAQOnF,EAAK,UAAA,MAAL,SAAwBxoB,EAAS,CACvC,OAAI,KAAK,MAAM,aAAe,OAC5BA,EAAO,QAAU,KAAK,MAAM,YAAY,GACxC,KAAK,MAAM,YAAY,MAAM,KAAKA,CAAM,GAGnCA,GAGT,OAAA,eAAIwoB,EAAmB,UAAA,sBAAA,CAAvB,IAAA,UAAA,CACE,OAAO,KAAK,MAAM,kDACnB,CAAA,EAMDA,EAAA,UAAA,MAAA,UAAA,CAEE,KAAK,uBAEL,KAAK,MAAM,QAAO,EAClB,KAAK,IAAI,MAAK,EACd,KAAK,MAAQ,IAAIF,GAEjB,QAAWpO,KAAe,KAAK,SAC7B,KAAK,yBAAyBA,CAAW,EACzC,KAAK,SAASA,CAAW,EAAE,QAAO,EAClC,OAAO,KAAK,SAASA,CAAW,EAElC,KAAK,YAAc,KACnB,KAAK,gBAAkB,KACvB,KAAK,mBAAqB,YAvxBbsO,GAAY,aAAG,EAKfA,GAAc,eAAG,EAsxBlC,SAAS2E,GAAK9jB,EAAe,CAC3B,IAAMW,EAAS0D,GAAmB5C,GAAczB,CAAK,EAAG,SAAS,EACjE,OAAOogB,EAAO,WAAWzf,EAAQX,EAAO,SAAS,CACnD,UAEgBukB,IAAe,CAC7B,IAAMne,EAAKD,GAAkB,EAC7B,GAAIC,EAAG,WAAa,KAAM,CACxB,IAAMH,EAAc,IAAIpB,GAAYuB,CAAE,EACtCA,EAAG,UAAY,IAAI+Y,GAAOlZ,CAAW,CACtC,CACD,OAAAD,GAAqBI,EAAG,UAAU,GAAG,EAIrCyW,GAAiB,UAAA,CAAM,OAAAzW,EAAG,SAAS,CAAA,EAC5BA,EAAG,SACZ,CAEO,IAAMga,EAASmE,GAAe,EAQrB,SAAA3K,GAAIpY,EAAW9L,EAAS,CAEtC,IAAM2H,EAAS,CAAC,EAACmE,EAAE,EAAC9L,CAAA,EACpB,OAAO0qB,EAAO,UAAUvZ,GAAKxJ,CAAmC,CAClE,CC1wCgB,SAAAmnB,GACZlR,EAAsC1S,EAAgB,CACxD,IAAI6jB,EAAwBnR,EAE5B,GAAI2D,GAAa3D,CAAG,EAClB,OAAO1S,IAAU,SAAW,CAAA,EAAK,CAAC0S,EAAI,MAAM,EAG9C,GAAI6K,GAAY7K,CAAG,EAAG,CACpB,IAAMoR,EAAepR,EAAI,UAAY,OACrC,MAAO,CAACA,EAAI,OAAQA,EAAI,MAAQoR,EAAa,MAAM,CACpD,SAAUtG,GAAa9K,CAAG,EACzB,MAAO,CAACA,EAAI,OAAO,MAAQ1S,GAAS,KAAO,EAAIoC,GAAgBpC,CAAK,EAAE,EAExE,GAAI,CAAC,MAAM,QAAQ0S,CAAG,EACpB,MAAO,CAAA,EAIT,QAFMtT,EAAkB,CAAA,EAEjB,MAAM,QAAQykB,CAAS,GACvBxN,GAAawN,CAAS,GAAK7jB,IAAU,UAC1CZ,EAAM,KAAKykB,EAAU,MAAM,EAC3BA,EAAYA,EAAU,CAAC,EAEzB,OAAI,MAAM,QAAQnR,CAAG,GACjBhe,GAAG,EAAG,QAAQ,oCAAoC,GACpDqvB,GAA2BrR,EAAKtT,EAAO,CAAA,CAAE,EAGpCA,CACT,CAEA,SAAS2kB,GACLrR,EAAiBtT,EAAiB4kB,EAAiB,CAErD,GADAA,EAAUA,GAAW,CAAA,EACjB,CAAE,MAAM,QAAQtR,CAAG,GAAM,CAAC2D,GAAa3D,CAAG,EAAG,CAC/CvS,EACIf,EAAM,SAAW,EACjB,UAAA,CAAM,MAAA,eAAA,OAAe4kB,EAAQ,KAAK,IAAI,EAAqB,oBAAA,EACvD,wCAAwC,OAAA5kB,EAAM,CAAC,EAAC,WAAA,CAD9C,CACyD,EACnE,MACD,CACDe,EACIf,EAAM,OAAS,EACf,UAAA,CAAM,MAAA,eAAA,OAAe4kB,EAAQ,KAAK,IAAI,EAA4B,2BAAA,EAC9D,sBAAA,OAAsBtR,EAAI,OAAM,WAAA,CAD9B,CACyC,EACnDvS,EACIuS,EAAI,SAAWtT,EAAM,CAAC,EACtB,UAAM,CAAA,MAAA,eAAA,OAAe4kB,EAAQ,KAAK,IAAI,EAAC,gBAAA,EAAA,OAAiB5kB,EAAM,CAAC,EAAI,GAAA,EAC/D,qBAAA,OAAqBsT,EAAI,OAAM,WAAA,CAD7B,CACwC,EAElD,QADMuR,EAAW7kB,EAAM,MAAM,CAAC,EACrBrI,EAAI,EAAGA,EAAI2b,EAAI,OAAQ,EAAE3b,EAChCgtB,GAA2BrR,EAAI3b,CAAC,EAAGktB,EAAUD,EAAQ,OAAOjtB,CAAC,CAAC,CAElE,CAEA,SAASmtB,GACLC,EACAC,EAAuBC,EAAiBC,EAAoB,CAC9D,GAAIH,IAAkB,oBAGtB,IAAIA,GAAiB,KACnB,MAAM,IAAI,MAAM,gCAAgC,EAElD,GAAIA,IAAkB,WAAaA,IAAkBC,GACjDD,IAAkB,WAAaC,IAAgB,SACjD,MAAM,IAAI,MACN,aAAA,OAAaC,EAAO,eAAA,EAAA,OAAgBC,EAAqB,SAAA,EACzD,MAAA,OAAMH,EAAa,mBAAA,EAAA,OAAoBC,EAAW,SAAA,CAAS,EAEnE,CAEM,SAAUG,EACZ/hB,EAAiB6hB,EAAiBC,EAClCE,EAAgE,CAClE,GADEA,IAAA,SAAAA,EAAgE,WAC9DhiB,aAAaga,GAAoB,EACnC,OAAA0H,GAAYM,EAAchiB,EAAE,MAAO6hB,EAASC,CAAY,EACjD9hB,EAET,IAAIiiB,EAAgB7hB,GAAWJ,CAAC,EAShC,GANIiiB,IAAkB,UAClB,CAAC,OAAQ,QAAS,SAAS,EAAE,QAAQD,CAAY,GAAK,IACxDC,EAAgBD,GAElBN,GAAYM,EAAcC,EAAeJ,EAASC,CAAY,EAEzD9hB,GAAK,MACL,CAAC6T,GAAa7T,CAAC,GAAK,CAAC,MAAM,QAAQA,CAAC,GAAK,OAAOA,GAAM,UACtD,OAAOA,GAAM,WAAa,OAAOA,GAAM,SAAW,CACrD,IAAM/E,EAAO+E,GAAK,KAAO,OAAUA,EAAS,YAAY,KACxD,MAAM,IAAI,MACN,aAAA,OAAa6hB,EAAO,eAAA,EAAA,OAAgBC,EAA0B,cAAA,EAC9D,kCAAkC,OAAA7mB,EAAO,GAAA,CAAA,CAC9C,CACD,IAAMinB,EAAgBd,GAAWphB,EAAGiiB,CAAa,EAC7C,CAACpO,GAAa7T,CAAC,GAAK,CAAC,MAAM,QAAQA,CAAC,IACtCA,EAAI,CAACA,CAAC,GAER,IAAM8T,EAAiB,GACjBvW,EAAS0kB,IAAkB,SAC7B5O,GAAarT,EAAGiiB,CAAyB,EACzC3O,GAAQtT,EAAe,CAAA,EAAI8T,CAAc,EAC7C,OAAOkJ,EAAO,WAAWzf,EAAQ2kB,EAAeD,CAAa,CAC/D,CAEM,SAAUE,GACZrmB,EAA0B+lB,EAAiBC,EAC3CE,EAAgE,CAClE,GADEA,IAAA,SAAAA,EAAgE,WAC9D,CAAC,MAAM,QAAQlmB,CAAG,EACpB,MAAM,IAAI,MACN,YAAA,OAAY+lB,EAAO,aAAA,EAAA,OAAcC,EAAyB,aAAA,EAC1D,8BAA8B,EAEpC,IAAMnD,EAAU7iB,EAChB,OAAO6iB,EAAQ,IACX,SAAChrB,EAAGY,EAAC,CACD,OAAAwtB,EAAgBpuB,EAAG,GAAA,OAAGkuB,EAAO,GAAA,EAAA,OAAIttB,EAAC,GAAA,EAAKutB,EAAcE,CAAY,CAAC,CAAA,CAC5E,CC7HO,IAAMI,GAAkB,OAOzB,SAAUluB,EAAuBN,EAAsB,CAC3D,IAAMyuB,EAAO,OAAO,KAAKzuB,CAAC,EAC1B,GAAIyuB,EAAK,SAAW,EAClB,MAAM,IAAI,MACN,yGAEA,GAAA,OAAGA,EAAK,OAAM,QAAA,CAAQ,EAG5B,IAAIC,EAASD,EAAK,CAAC,EACb3I,EAAK9lB,EAAE0uB,CAAM,EAGfA,EAAO,SAAS,GAAG,IACrBA,EAASA,EAAO,UAAU,EAAGA,EAAO,OAAS,CAAC,GAIhDA,EAASA,EAASF,GAGlB,IAAMG,EAAK,UAAA,SAAeC,EAAA,CAAA,EAAA/f,EAAA,EAAdA,EAAc,UAAA,OAAdA,IAAA+f,EAAc/f,CAAA,EAAA,UAAAA,CAAA,EACxBua,EAAO,WAAWsF,CAAM,EACxB,GAAI,CACF,IAAM/uB,EAASmmB,EAAM,MAAA,OAAA9kB,GAAA,CAAA,EAAAJ,EAAAguB,CAAI,EAAA,EAAA,CAAA,EACzB,OAAIlhB,GAAU/N,CAAM,GAClB,QAAQ,MAAM,yCAAyC,EAEzDypB,EAAO,SAASzpB,CAAM,EACfA,CACR,OAAQwpB,EAAI,CACX,MAAAC,EAAO,SAAS,IAAI,EACdD,CACP,CACH,EACA,cAAO,eAAewF,EAAI,OAAQ,CAAC,MAAOD,EAAQ,aAAc,EAAI,CAAC,EAG9DC,CACT,CC3BA,SAASE,GAAuBziB,EAAe,CAC7C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,KAAK,EAExC,GAAI0iB,EAAG,QAAU,YAAa,CAC5B,IAAMzoB,EAA2B,CAAC,EAAGyoB,CAAE,EACvC,OAAO1F,EAAO,UAAUjY,GAAY9K,CAAmC,CACxE,KAAM,CACL,IAAMA,EAAoB,CAAC,EAAGyoB,CAAE,EAChC,OAAO1F,EAAO,UAAU1Z,GAAKrJ,CAAmC,CACjE,CACH,CAEO,IAAM0oB,GAAsBzuB,EAAG,CAAC,KAAIuuB,EAAA,CAAC,ECd5C,SAASG,GAAwB5iB,EAAe,CAC9C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,MAAM,EACnC/F,EAAqB,CAAC,EAAGyoB,CAAE,EAEjC,OAAO1F,EAAO,UAAUzZ,GAAMtJ,CAAmC,CACnE,CACO,IAAM4oB,GAAuB3uB,EAAG,CAAC,MAAK0uB,EAAA,CAAC,ECH9C,SAASE,GAAyB9iB,EAAe,CAC/C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,OAAO,EACpC/F,EAAsB,CAAC,EAAGyoB,CAAE,EAElC,OAAO1F,EAAO,UAAUxZ,GAAOvJ,CAAmC,CACpE,CACO,IAAM8oB,GAAwB7uB,EAAG,CAAC,OAAM4uB,EAAA,CAAC,ECIhD,SAASE,GAAuB5kB,EAAsB9L,EAAoB,OACpE2wB,EAAKlB,EAAgB3jB,EAAG,IAAK,KAAK,EAClC8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,KAAK,EACtCoE,EAAAlC,EAAWymB,GAAegI,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAEvsB,EAAA,CAAA,EAAEwsB,EAAExsB,EAAA,CAAA,EAEP,IAAMuD,EAAoB,CAAC,EAAGgpB,EAAI,EAAGC,CAAE,EAEvC,OAAOlG,EAAO,UAAUvZ,GAAKxJ,CAAmC,CAClE,CAEO,IAAMuc,GAAsBtiB,EAAG,CAAC,KAAI8uB,EAAA,CAAC,ECpB5C,SAASG,GAAwBxE,EAA4B,CAC3D3F,EACI,MAAM,QAAQ2F,CAAO,EACrB,UAAA,CAAM,MAAA,4DAAA,CAA4D,EACtE3F,EACI2F,EAAQ,QAAU,EAClB,UAAM,CAAA,MAAA,uDACF,GAAA,OAAGA,EAAQ,MAAM,CADf,CACiB,EAE3B,IAAMyE,EACFzE,EAAQ,IAAI,SAAChrB,EAAGY,EAAM,CAAA,OAAAwtB,EAAgBpuB,EAAG,UAAA,OAAUY,CAAC,EAAI,MAAM,CAAC,CAAA,EAE7D8uB,EAAcD,EAAS,CAAC,EAC9BA,EAAS,QAAQ,SAAAzvB,EAAC,CAChB,GAAIA,EAAE,QAAU0vB,EAAY,MAC1B,MAAM,IAAI,MACN,0DAA0D,CAElE,CAAC,EAEDD,EAAS,QAAQ,SAAAzvB,EAAC,CAChB,GAAI,CAACkjB,GAAiBljB,EAAE,MAAO0vB,EAAY,KAAK,EAC9C,MAAM,IAAI,MACN,0DAA0D,CAElE,CAAC,EAED,IAAMppB,EAAqBmpB,EAE3B,OAAOpG,EAAO,UAAUtZ,GAAMzJ,CAAmC,CACnE,CAEO,IAAMqpB,GAAuBpvB,EAAG,CAAC,MAAKivB,EAAA,CAAC,ECf9C,SAASI,GACLvjB,EAAsBnB,EAA8B2kB,EAAgB,CAA9C3kB,IAAA,SAAAA,EAA4B,MAAE2kB,IAAA,SAAAA,EAAgB,IACtE,IAAMd,EAAKX,EAAgB/hB,EAAG,IAAK,MAAO,MAAM,EAE1C/F,EAAoB,CAAC,EAAGyoB,CAAE,EAC1BlmB,EAAkB,CAAC,KAAIqC,EAAE,SAAQ2kB,CAAA,EAEvC,OAAOxG,EAAO,UACVrZ,GAAK1J,EACLuC,CAAgC,CACtC,CAEO,IAAMinB,GAAsBvvB,EAAG,CAAC,KAAIqvB,EAAA,CAAC,ECZ5C,SAASG,GACL1jB,EAAsBnB,EAA8B2kB,EAAgB,CAA9C3kB,IAAA,SAAAA,EAA4B,MAAE2kB,IAAA,SAAAA,EAAgB,IACtE,IAAMd,EAAKX,EAAgB/hB,EAAG,IAAK,MAAO,MAAM,EAE1C/F,EAAoB,CAAC,EAAGyoB,CAAE,EAC1BlmB,EAAkB,CAAC,KAAIqC,EAAE,SAAQ2kB,CAAA,EAEvC,OAAOxG,EAAO,UACVpZ,GAAK3J,EACLuC,CAAgC,CACtC,CAGO,IAAMmnB,GAAsBzvB,EAAG,CAAC,KAAIwvB,EAAA,CAAC,EClB5C,SAASE,GAA0B5jB,EAAsBnB,EAAQ,CAARA,IAAA,SAAAA,EAAQ,GAC/D,IAAM6jB,EAAKX,EAAgB/hB,EAAG,IAAK,QAAQ,EAErC/F,EAAuB,CAAC,EAAGyoB,CAAE,EAC7BlmB,EAAqB,CAAC,KAAIqC,CAAA,EAEhC,OAAOme,EAAO,UACVnZ,GAAQ5J,EACRuC,CAAgC,CACtC,CAEO,IAAMqnB,GAAyB3vB,EAAG,CAAC,QAAO0vB,EAAA,CAAC,ECXlD,SAASE,GAA0B9jB,EAAsBnB,EAAQ,CAARA,IAAA,SAAAA,EAAQ,GAC/D,IAAM6jB,EAAKX,EAAgB/hB,EAAG,IAAK,QAAQ,EAErC/F,EAAuB,CAAC,EAAGyoB,CAAE,EAC7BlmB,EAAqB,CAAC,KAAIqC,CAAA,EAEhC,OAAOme,EAAO,UACVlZ,GAAQ7J,EACRuC,CAAgC,CACtC,CAEO,IAAMunB,GAAyB7vB,EAAG,CAAC,QAAO4vB,EAAA,CAAC,ECzBlD,SAASE,GAAwBhkB,EAAe,CAC9C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,MAAM,EACnC/F,EAAqB,CAAC,EAAGyoB,CAAE,EAEjC,OAAO1F,EAAO,UAAUjZ,GAAM9J,CAAmC,CACnE,CACO,IAAMgqB,GAAuB/vB,EAAG,CAAC,MAAK8vB,EAAA,CAAC,ECJ9C,SAASE,GAAyBlkB,EAAe,CAC/C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,OAAO,EAEpC/F,EAAsB,CAAC,EAAGyoB,CAAE,EAElC,OAAO1F,EAAO,UAAUhZ,GAAO/J,CAAmC,CACpE,CACO,IAAMkqB,GAAwBjwB,EAAG,CAAC,OAAMgwB,EAAA,CAAC,ECRhD,SAASE,GAAwBpkB,EAAe,CAC9C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,MAAM,EAEnC/F,EAAqB,CAAC,EAAGyoB,CAAE,EAEjC,OAAO1F,EAAO,UAAU/Y,GAAMhK,CAAmC,CACnE,CACO,IAAMoqB,GAAuBnwB,EAAG,CAAC,MAAKkwB,EAAA,CAAC,ECF9C,SAASE,GACLlmB,EAAsB9L,EAAoB,OACxC2wB,EAAKlB,EAAgB3jB,EAAG,IAAK,OAAO,EACpC8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,OAAO,EACxCoE,EAAAlC,EAAWymB,GAAegI,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAEvsB,EAAA,CAAA,EAAEwsB,EAAExsB,EAAA,CAAA,EAEP,IAAMuD,EAAsB,CAAC,EAAGgpB,EAAI,EAAGC,CAAE,EAEzC,OAAOlG,EAAO,UAAU7Y,GAAOlK,CAAmC,CACpE,CAEO,IAAMsqB,GAAwBrwB,EAAG,CAAC,OAAMowB,EAAA,CAAC,ECfhD,SAASE,GAAyBxkB,EAAe,CAC/C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,OAAO,EAEpC/F,EAAsB,CAAC,EAAGyoB,CAAE,EAElC,OAAO1F,EAAO,UAAU9Y,GAAOjK,CAAmC,CACpE,CACO,IAAMwqB,GAAwBvwB,EAAG,CAAC,OAAMswB,EAAA,CAAC,ECPhD,SAASE,GAAwB1kB,EAAiBxC,EAAe,CAC/D,IAAMklB,EAAKX,EAAgB/hB,EAAG,IAAK,MAAM,EAGzC,GAAI,CAAC2kB,GAAkBnnB,CAAK,EAC1B,MAAM,IAAI,MAAM,mCAAA,OAAmCA,CAAK,CAAE,EAE5D,GAAIA,IAAU,UAAYklB,EAAG,QAAU,UACnCllB,IAAU,UAAYklB,EAAG,QAAU,SACrC,MAAM,IAAI,MAAM,uCAAuC,EAGzD,IAAMzoB,EAAqB,CAAC,EAAGyoB,CAAE,EAC3BlmB,EAAmB,CAAC,MAAKgB,CAAA,EAE/B,OAAOwf,EAAO,UACVrY,GAAM1K,EACNuC,CAAgC,CACtC,CAEO,IAAMooB,GAAuB1wB,EAAG,CAAC,MAAKwwB,EAAA,CAAC,EC2D9B,SAAAG,GACZC,EACAC,EAAqCxkB,EACrCykB,EACAntB,EACAotB,EACAC,EAA2D,CAA3DA,IAAA,SAAAA,EAA2D,gBACvD,IAAAxuB,EAAAlC,EAA8B2wB,GAAgBJ,CAAU,EAAC,CAAA,EAAxDK,EAAY1uB,EAAA,CAAA,EAAE2uB,EAAW3uB,EAAA,CAAA,EAE5B4uB,EACJ,GAAIJ,IAAe,eACjBI,EAAc,CAACF,EAAcC,EAAaP,EAAQ,CAAC,EAAGA,EAAQ,CAAC,CAAC,UACvDI,IAAe,gBACxBI,EAAc,CAACF,EAAcC,EAAaP,EAAQ,CAAC,EAAGA,EAAQ,CAAC,CAAC,MAEhE,OAAM,IAAI,MAAM,sBAAA,OAAsBI,CAAU,CAAE,EAGpD,OAAOK,GACHT,EAASQ,EAAa/kB,EAASykB,EAAWntB,EAAKotB,EAAc,GAC7DC,CAAU,CAChB,UAqCgBK,GACZT,EACAQ,EACA/kB,EAAkCykB,EAClCntB,EACAotB,EAAuCO,EACvCN,EAA2D,SADpBM,IAAA,SAAAA,EAAiB,IACxDN,IAAA,SAAAA,EAA2D,gBACzD,IAAAjjB,EAAAzN,EAA6C,CAAC,GAAI,GAAI,GAAI,EAAE,EAAC,CAAA,EAA5DixB,EAASxjB,EAAA,CAAA,EAAEyjB,EAAQzjB,EAAA,CAAA,EAAE0jB,EAAO1jB,EAAA,CAAA,EAAE2jB,EAAU3jB,EAAA,CAAA,EAC7C,GAAIijB,IAAe,eACjBxuB,EAAAlC,EAA6CswB,EAAO,CAAA,EAAnDW,EAAS/uB,EAAA,CAAA,EAAEgvB,EAAQhvB,EAAA,CAAA,EAAEivB,EAAOjvB,EAAA,CAAA,EAAEkvB,EAAUlvB,EAAA,CAAA,UAChCwuB,IAAe,gBACxBluB,EAAAxC,EAA6CswB,EAAO,CAAA,EAAnDW,EAASzuB,EAAA,CAAA,EAAE4uB,EAAU5uB,EAAA,CAAA,EAAE0uB,EAAQ1uB,EAAA,CAAA,EAAE2uB,EAAO3uB,EAAA,CAAA,MAEzC,OAAM,IAAI,MAAM,sBAAA,OAAsBkuB,CAAU,CAAE,EAG9C,IAAAnF,EAAAvrB,EAAgD8wB,EAAW,CAAA,EAA1DF,EAAYrF,EAAA,CAAA,EAAEsF,EAAWtF,EAAA,CAAA,EAAI8F,EAAc9F,EAAA,CAAA,EAC5CC,EAAAxrB,EAA8B2wB,GAAgB5kB,CAAO,EAAC,CAAA,EAArDulB,EAAY9F,EAAA,CAAA,EAAE+F,EAAW/F,EAAA,CAAA,EAC1BgG,EAAAxxB,EAAkC2wB,GAAgBH,CAAS,EAAC,CAAA,EAA3DiB,EAAcD,EAAA,CAAA,EAAEE,EAAaF,EAAA,CAAA,EAE9BG,EACFC,GAAuBhB,EAAca,CAAc,EACjDI,EACFD,GAAuBf,EAAaa,CAAa,EAC/CpG,EAAiCwG,GACnCzuB,EAAK6tB,EAAUC,EAASG,EAAcC,EAAaI,EACnDE,EAAsBpB,EAAcC,CAAU,EAF3CqB,EAAOzG,EAAA,QAAE0G,EAAS1G,EAAA,UAAE2G,EAAQ3G,EAAA,SAI7B4G,EAAclB,EAAYK,EAAiBD,EAAaC,EAE1Dc,EACJ,OAAIzB,IAAe,gBACjByB,EAAW,CAAClB,EAAWiB,EAAaF,EAAWC,CAAQ,EAC9CvB,IAAe,iBACxByB,EAAW,CAAClB,EAAWe,EAAWC,EAAUC,CAAW,GAGlD,CACL,UAASjB,EACT,WAAUP,EACV,SAAQQ,EACR,QAAOC,EACP,WAAUC,EACV,UAASY,EACT,SAAQC,EACR,YAAWC,EACX,QAAOH,EACP,aAAYT,EACZ,YAAWC,EACX,aAAYX,EACZ,YAAWC,EACX,sBAAqBc,EACrB,qBAAoBE,EACpB,eAAcJ,EACd,cAAaC,EACb,QAAOpB,EACP,SAAQ6B,EACR,YAAWrB,EAEf,CAkHA,SAASsB,GACL9B,EAA2B+B,EAAmBpO,EAC9CqO,EAAkB7B,EAAqC,CACrD6B,GAAW,OACbA,EAAUC,GAAkBjC,EAAS+B,EAAWpO,CAAM,GAExD,IAAMuO,EAAYlC,EAAQ,CAAC,EACrBmC,EAAYnC,EAAQ,CAAC,EAErBoC,EACFC,IAAOH,EAAYH,EAAY,EAAIC,GAAWrO,EAAS,EAAGwM,CAAY,EACpEmC,EACFD,IAAOF,EAAYJ,EAAY,EAAIC,GAAWrO,EAAS,EAAGwM,CAAY,EAE1E,MAAO,CAACiC,EAAYE,CAAU,CAChC,CAsBM,SAAUL,GACZzR,EACAuR,EAAmBpO,EAAgB4O,EAAY,CAAZA,IAAA,SAAAA,EAAY,GACjD,IAAMC,EAAqBlB,GAAuBS,EAAWQ,CAAQ,EACrE,OAAO,KAAK,OACP/R,EAAW,CAAC,GAAKmD,EAAS,GAAKA,EAAS6O,GAAsB,CAAC,CACtE,CAEA,SAASnC,GAAgBnqB,EAAsB,CAC7C,OAAI,OAAOA,GAAU,SACZ,CAACA,EAAOA,EAAOA,CAAK,EAEzBA,EAAM,SAAW,EACZ,CAACA,EAAM,CAAC,EAAGA,EAAM,CAAC,EAAG,CAAC,EAExBA,CACT,CAkBA,SAASorB,GAAuBrB,EAAoBsC,EAAgB,CAClE,OAAIA,GAAY,EACPtC,EAGFA,GAAcA,EAAa,IAAMsC,EAAW,EACrD,CAEA,SAASf,GACLzuB,EAA4C6tB,EAC5CC,EAAiBG,EAAsBC,EACvCX,EAAsBC,EACtBJ,EACAC,EACc,CAChB,IAAIqB,EACAC,EACAC,EAEJ,GAAI,OAAO5uB,GAAQ,SAAU,CAC3B,IAAM0vB,EAAW1vB,IAAQ,EAAK,QAAU,SACxC0uB,EAAU,CAAC,IAAK1uB,EAAK,OAAQA,EAAK,KAAMA,EAAK,MAAOA,EAAK,KAAM0vB,CAAO,EACtE,IAAMZ,EAAWC,GACb,CAAClB,EAAUC,CAAO,EAAGP,EAAcU,EAAcjuB,EAAKotB,CAAY,EACtEuB,EAAYG,EAAS,CAAC,EACtBF,EAAWE,EAAS,CAAC,CACtB,SAAU9uB,IAAQ,OAAQ,CACzB2uB,EAAY,KAAK,KAAKd,EAAWI,CAAY,EAC7CW,EAAW,KAAK,KAAKd,EAAUI,CAAW,EAC1C,IAAMyB,EACF,KAAK,IAAI,GAAIhB,EAAY,GAAKV,EAAeV,EAAeM,CAAQ,EAClE+B,EACF,KAAK,IAAI,GAAIhB,EAAW,GAAKV,EAAcV,EAAcM,CAAO,EAC9D+B,EAAM,KAAK,MAAMF,EAAiB,CAAC,EACnCG,EAASH,EAAiBE,EAC1BE,EAAO,KAAK,MAAMH,EAAgB,CAAC,EACnCI,EAAQJ,EAAgBG,EAC9BrB,EAAU,CAAC,IAAGmB,EAAE,OAAMC,EAAE,KAAIC,EAAE,MAAKC,EAAE,KAAM,MAAM,CAClD,SAAUhwB,IAAQ,QACjB0uB,EAAU,CAAC,IAAK,EAAG,OAAQ,EAAG,KAAM,EAAG,MAAO,EAAG,KAAM,OAAO,EAC9DC,EAAY,KAAK,MAAMd,EAAWN,EAAe,GAAKU,CAAY,EAClEW,EAAW,KAAK,MAAMd,EAAUN,EAAc,GAAKU,CAAW,UACrD,OAAOluB,GAAQ,SAAU,CAClC,IAAM6vB,EAAMxC,IAAe,eAAiBrtB,EAAI,CAAC,EAAE,CAAC,EAAIA,EAAI,CAAC,EAAE,CAAC,EAC1D8vB,EAASzC,IAAe,eAAiBrtB,EAAI,CAAC,EAAE,CAAC,EAAIA,EAAI,CAAC,EAAE,CAAC,EAC7D+vB,EAAO1C,IAAe,eAAiBrtB,EAAI,CAAC,EAAE,CAAC,EAAIA,EAAI,CAAC,EAAE,CAAC,EAC3DgwB,EAAQ3C,IAAe,eAAiBrtB,EAAI,CAAC,EAAE,CAAC,EAAIA,EAAI,CAAC,EAAE,CAAC,EAC5D0vB,EAAWG,IAAQ,GAAKC,IAAW,GAAKC,IAAS,GAAKC,IAAU,EAClE,QACA,WACJtB,EAAU,CAAC,IAAGmB,EAAE,OAAMC,EAAE,KAAIC,EAAE,MAAKC,EAAE,KAAMN,CAAO,EAClDf,EAAYW,IACPzB,EAAWN,EAAesC,EAAMC,GAAU7B,EAAe,EAC1Db,CAAY,EAChBwB,EAAWU,IACNxB,EAAUN,EAAcuC,EAAOC,GAAS9B,EAAc,EAAGd,CAAY,CAC3E,KACC,OAAM,MAAM,8BAAA,OAA8BptB,CAAG,CAAE,EAEjD,MAAO,CAAC,QAAO0uB,EAAE,UAASC,EAAE,SAAQC,CAAA,CACtC,CAmEA,SAASU,GAAMn0B,EAAeiyB,EAAqC,CACjE,GAAI,CAACA,EACH,OAAO,KAAK,MAAMjyB,CAAK,EAEzB,OAAQiyB,EAAY,CAClB,IAAK,QAEH,OAAO,KAAK,MAAMjyB,CAAK,EACzB,IAAK,OAEH,OAAO,KAAK,KAAKA,CAAK,EACxB,IAAK,QACH,OAAO,KAAK,MAAMA,CAAK,EACzB,QACE,MAAM,IAAI,MAAM,wBAAA,OAAwBiyB,CAAY,CAAE,CACzD,CACH,CAEM,SAAU6C,GAAkB9sB,EAAsB,CAChD,IAAAtE,EAAAlC,EAAqB2wB,GAAgBnqB,CAAK,EAAC,CAAA,EAA1C+sB,EAAIrxB,EAAA,CAAA,EAAEsxB,EAAItxB,EAAA,CAAA,EAAEuxB,EAAIvxB,EAAA,CAAA,EACvB,OAAOqxB,IAAS,GAAKC,IAAS,GAAKC,IAAS,CAC9C,CAEgB,SAAAC,GACZ3nB,EAA0BykB,EAA0B,CACtD,OAAO8C,GAAkBvnB,CAAO,GAAKunB,GAAkB9C,CAAS,CAClE,CAEM,SAAUmD,GAA8B5qB,EACQ,CACpD,OAAO4nB,GAAgB5nB,CAAM,EAAE,MAAM,SAAAvK,EAAK,CAAI,OAAAA,EAAQ,CAAR,CAAS,CACzD,UAmCgBo1B,GACZC,EAAgBxwB,EAChBywB,EAAwC,CAC1C,GAAIA,GAAmB,KAAM,CAC3B,GAAI,OAAOzwB,GAAQ,SACjB,MAAM,MACF,YAAY,OAAAwwB,EAA4C,sCAAA,EACxD,mBAAA,OAAmBC,EAAe,eAAA,EAAA,OAAgBzwB,EAAG,GAAA,CAAG,EACvD,GAAI,OAAOA,GAAQ,SACxBmhB,EACIuP,GAAW1wB,CAAG,EACd,UAAA,CAAM,MAAA,YAAA,OAAYwwB,EAA4C,sCAAA,EAC1D,mBAAA,OAAmBC,EAA+B,eAAA,EAAA,OAAAzwB,EAAG,GAAA,CADnD,CACsD,UACvD,OAAOA,GAAQ,SACvBA,EAAwB,QAAQ,SAAAtF,EAAC,CAChCA,EAAE,QAAQ,SAAA0B,EAAC,CACT+kB,EACIuP,GAAWt0B,CAAC,EACZ,UAAA,CAAM,MAAA,YAAA,OAAYo0B,EAA4C,sCAAA,EAC1D,mBAAA,OAAmBC,EAA+B,eAAA,EAAA,OAAAr0B,EAAC,GAAA,CADjD,CACoD,CAChE,CAAC,CACH,CAAC,MAED,OAAM,MAAM,YAAY,OAAAo0B,EAAM,+BAAA,EAAA,OAAgCxwB,CAAG,CAAE,CAEtE,CACH,CC1kBA,SAAS2wB,GACLxoB,EAAsBpD,EAAkB,CAC1C,IAAM8lB,EAAKX,EAAgB/hB,EAAG,IAAK,UAAW,mBAAmB,EAE3D/F,EAAwB,CAAC,EAAGyoB,CAAE,EAC9BlmB,EAAsB,CAAC,MAAKI,CAAA,EAClC,OAAOogB,EAAO,UACV7S,GAASlQ,EACTuC,CAAgC,CACtC,CACO,IAAMisB,EAA0Bv0B,EAAG,CAAC,SAAQs0B,EAAA,CAAC,ECVpD,SAASE,GACL1oB,EAAiB+kB,EACjBxkB,EACA1I,EACAywB,EAAwC,CAC1C,IAAM5F,EAAKX,EAAgB/hB,EAAG,IAAK,UAAW,SAAS,EACjDglB,EAAY,EAElBhM,EACI2P,GAAyCpoB,EAASykB,CAAS,EAC3D,UAAA,CAAM,MAAA,4DACF,eAAA,OAAezkB,EAA0B,kBAAA,EAAA,OAAAykB,EAAS,GAAA,CADhD,CACmD,EAE7D,IAAI4D,EAAMlG,EACNmG,EAAe,GACfnG,EAAG,OAAS,IACdmG,EAAe,GACfD,EAAMH,EAAQ/F,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAG9D1J,EACI4P,EAAI,OAAS,EACb,UAAA,CAAM,MAAA,mDAAA,OAAmDA,EAAI,KAAI,GAAA,CAA3D,CAA8D,EACxEE,GAAoC,UAAWjxB,EAAKywB,CAAe,EACnE,IAAMruB,EAAwB,CAAC,EAAG2uB,CAAG,EAC/BpsB,EAAsB,CAAC,WAAUuoB,EAAE,QAAOxkB,EAAE,IAAG1I,EAAE,gBAAeywB,CAAA,EAGlEhW,EAAM0K,EAAO,UACH5Y,GAASnK,EACTuC,CAAgC,EAI9C,OAFA8V,EAAMsS,GAAKtS,EAAKoQ,EAAG,KAAK,EAEpBmG,EACKJ,EAAQnW,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAGzDA,CACT,CAEO,IAAMyW,GAA0B70B,EAAG,CAAC,SAAQw0B,EAAA,CAAC,EC3BpD,SAASM,GACLhpB,EAAiB+kB,EACjBxkB,EAA0C1I,EAC1CywB,EACApD,EAAqC,CAArCA,IAAA,SAAAA,EAAqC,SACvC,IAAMxC,EAAKX,EAAgB/hB,EAAG,IAAK,YAAa,SAAS,EAErDipB,EAAMvG,EACNwG,EAAe,GACfxG,EAAG,OAAS,IACdwG,EAAe,GACfD,EAAMR,EAAQ/F,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAG3E1J,EACIiQ,EAAI,OAAS,EACb,UAAA,CAAM,MAAA,qDAAA,OAAqDA,EAAI,KAAI,GAAA,CAA7D,CAAgE,EAC1EjQ,EACIkM,IAAe,QACf,UAAM,CAAA,MAAA,0DACF,yBAAA,OAAyBA,CAAU,CADjC,CACmC,EAC7ClM,EACK,OAAOzY,GAAY,UAAYA,EAAU,GACrC,MAAM,QAAQA,CAAO,GAAKA,EAAQ,CAAC,EAAI,GAAKA,EAAQ,CAAC,EAAI,GACzDA,EAAQ,CAAC,EAAI,EAClB,UAAM,CAAA,MAAA,oDAAA,OAAoDA,EAAO,GAAA,CAA3D,CAA8D,EACxE6nB,GAA0B,YAAavwB,EAAKywB,CAAe,EAC3D,IAAMruB,EAA0B,CAAC,EAAGgvB,CAAG,EACjCzsB,EACe,CAAC,WAAUuoB,EAAE,QAAOxkB,EAAE,IAAG1I,EAAE,gBAAeywB,EAAE,WAAUpD,CAAA,EAGvE5S,EAAM0K,EAAO,UACH3Y,GAAWpK,EACXuC,CAAgC,EAI9C,OAFA8V,EAAMsS,GAAKtS,EAAK2W,EAAI,KAAK,EAErBC,EACKT,EACInW,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAInEA,CACT,CAEO,IAAM6W,GAA4Bj1B,EAAG,CAAC,WAAU80B,EAAA,CAAC,EC1ExD,SAASI,GAAyBppB,EAAe,CAC/C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,QAAS,mBAAmB,EACzD/F,EAAyB,CAAC,EAAGyoB,CAAE,EAIrC,OAAO1F,EAAO,UAAU5V,GAAUnN,CAAmC,CACvE,CAEO,IAAMjC,GAAwB9D,EAAG,CAAC,OAAMk1B,EAAA,CAAC,ECmBhD,SAASC,GAA0B1K,EAA8B9f,EAAQ,CAARA,IAAA,SAAAA,EAAQ,GACvElB,EAAOghB,EAAQ,QAAU,EAAG,UAAA,CAAM,MAAA,oCAAA,CAAoC,EAEtE,IAAMyE,EACFjB,GAAqBxD,EAAS,UAAW,SAAU,mBAAmB,EAW1E,GATIyE,EAAS,CAAC,EAAE,QAAU,aACxBA,EAAS,QAAQ,SAAAzsB,EAAM,CACrB,GAAIA,EAAO,QAAU,YACnB,MAAM,IAAI,MAAM;uBAAA,OACDA,EAAO,MAAS,IAAA,CAAA,CAEnC,CAAC,EAGCysB,EAAS,SAAW,EACtB,OAAOprB,GAAMorB,EAAS,CAAC,CAAC,EAG1B,IAAMnpB,EAAuBmpB,EACvBkG,EAAoB,CAAC,KAAIzqB,CAAA,EAE/B,OAAOme,EAAO,UACVhY,GAAQ/K,EACRqvB,CAA+B,CACrC,CAEO,IAAMC,GAAyBr1B,EAAG,CAAC,QAAOm1B,EAAA,CAAC,ECpDlD,SAASG,GACLprB,EAAsB9L,EAAsBm3B,EAC5CC,EAAkB,OAD0BD,IAAA,SAAAA,EAAkB,IAC9DC,IAAA,SAAAA,EAAkB,IACpB,IAAIzG,EAAKlB,EAAgB3jB,EAAG,IAAK,QAAQ,EACrC8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,QAAQ,EACzCoE,EAAAlC,EAAWymB,GAAegI,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAEvsB,EAAA,CAAA,EAAEwsB,EAAExsB,EAAA,CAAA,EAEP,IAAMuD,EAA4B,CAAC,EAAGgpB,EAAI,EAAGC,CAAE,EACzC1mB,EAA0B,CAAC,WAAUitB,EAAE,WAAUC,CAAA,EAEvD,OAAO1M,EAAO,UACV1Y,GAAarK,EACbuC,CAAgC,CACtC,CAEO,IAAMmtB,GAAyBz1B,EAAG,CAAC,QAAOs1B,EAAA,CAAC,ECNlD,SAASI,GAAuBxrB,EAAsB9L,EAAoB,OACpE2wB,EAAKlB,EAAgB3jB,EAAG,IAAK,KAAK,EAClC8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,KAAK,EACtCoE,EAAAlC,EAAWymB,GAAegI,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAEvsB,EAAA,CAAA,EAAEwsB,EAAExsB,EAAA,CAAA,EAEP,IAAMuD,EAAyB,CAAC,EAAGgpB,EAAI,EAAGC,CAAE,EAE5C,OAAOlG,EAAO,UAAUjU,GAAU9O,CAAmC,CACvE,CACO,IAAM4vB,GAAsB31B,EAAG,CAAC,KAAI01B,EAAA,CAAC,ECvB5C,SAASE,GAA2B9pB,EAAe,CACjD,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,UAAW,SAAS,EAEjD/F,EAAwB,CAAC,EAAGyoB,CAAE,EAEpC,OAAO1F,EAAO,UAAU7R,GAASlR,CAAmC,CACtE,CACO,IAAM8vB,GAA0B71B,EAAG,CAAC,SAAQ41B,EAAA,CAAC,ECgBpD,SAASE,GACLhqB,EAAiBiqB,EAAwB3rB,EAAsB,CACjE,IAAMokB,EAAKX,EAAgB/hB,EAAG,IAAK,QAAS,mBAAmB,EAE/D,GAAI0iB,EAAG,OAAS,EACd,MAAM,IAAI,MAAM,gCAAgC,EAGlD,IAAMzoB,EAAsB,CAAC,EAAGyoB,CAAE,EAC5BlmB,EAAoB,CAAC,MAAKytB,EAAE,KAAI3rB,CAAA,EAEtC,OAAO0e,EAAO,UACVjS,GAAO9Q,EACPuC,CAAgC,CACtC,CAEO,IAAM0tB,GAAwBh2B,EAAG,CAAC,OAAM81B,EAAA,CAAC,ECvChD,SAASG,GAAwBnqB,EAAe,CAC9C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,OAAQ,SAAS,EAE9C/F,EAAqB,CAAC,EAAGyoB,CAAE,EAEjC,OAAO1F,EAAO,UAAUzQ,GAAMtS,CAAmC,CACnE,CACO,IAAMmwB,GAAuBl2B,EAAG,CAAC,MAAKi2B,EAAA,CAAC,ECC9C,SAASE,GACLC,EAA+BC,EAC/BC,EAA+B5zB,EAC/BmK,EAAwB0pB,EAAsB,CAChD,IAAMC,EACF3I,EAAgBuI,EAAY,aAAc,eAAe,EACvDK,EACF5I,EAAgBwI,EAAY,aAAc,eAAe,EACvDK,EAAY7I,EAAgByI,EAAU,WAAY,eAAe,EACjEK,EAAQ9I,EAAgBnrB,EAAM,OAAQ,eAAe,EACrDk0B,EAAK/I,EAAgBhhB,EAAG,IAAK,eAAe,EAC5CgqB,EAAKhJ,EAAgB0I,EAAG,IAAK,eAAe,EAE5CO,EAAWzB,GAAO,CAACsB,EAAOE,CAAE,EAAG,CAAC,EAChCE,EAAWtB,GAAOqB,EAAUL,CAAW,EACvCrY,EAAgBkE,GAAIyU,EAAUL,CAAS,EAGvCnF,EAAYnT,EAAI,MAAM,CAAC,EACvB4Y,EAAY5Y,EAAI,MAAM,CAAC,EAAI,EAC3B6Y,EAA8B,CAAC1F,EAAWyF,CAAS,EACnD32B,EAAI21B,GAAM5X,EAAK,CAAC,EAAG,CAAC,EAAG6Y,CAAS,EAChC9rB,EAAI6qB,GAAM5X,EAAK,CAAC,EAAG4Y,CAAS,EAAGC,CAAS,EACxCv3B,EAAIs2B,GAAM5X,EAAK,CAAC,EAAG4Y,EAAY,CAAC,EAAGC,CAAS,EAC5C/2B,EAAI81B,GAAM5X,EAAK,CAAC,EAAG4Y,EAAY,CAAC,EAAGC,CAAS,EAE5CC,EACF5U,GAAIqT,GAAIE,GAAQx1B,CAAC,EAAG61B,GAAK/qB,CAAC,CAAC,EACvBwqB,GAAIiB,EAAIf,GAAQvT,GAAIkU,EAAa92B,CAAC,CAAC,CAAa,CAAC,EACnDy3B,EAAiBxB,GAAIO,GAAKgB,CAAI,EAAGrB,GAAQ31B,CAAC,CAAC,EACjD,MAAO,CAACg3B,EAAMC,CAAI,CACpB,CAEO,IAAMC,GAAgCp3B,EAAG,CAAC,eAAcm2B,EAAA,CAAC,ECHhE,SAASkB,GACLvrB,EAAiBwrB,EAAsBC,EAAiB,CAC1D,IAAM/I,EAAKX,EAAgB/hB,EAAG,IAAK,gBAAgB,EAC7C0rB,EAAOF,EAAW,OAAO,SAACptB,EAAG9L,EAAC,CAAK,OAAA8L,EAAI9L,CAAJ,CAAK,EAE9C0mB,EACI0J,EAAG,MAAQ,EAAI8I,EAAW,OAC1B,UAAM,CAAA,MAAA,iBAAiB,OAAA9I,EAAG,KACtB,0CAAA,EAAA,OAAA8I,EAAW,MAAM,CAAE,CAAA,EAE3BxS,EACIyS,EAAM,SAAWD,EAAW,OAC5B,UAAA,CAAM,MAAA,mBACF,OAAAC,EAAM,OACN,6CAAA,EAAA,OAAAD,EAAW,MAAM,CAAE,CAAA,EAE3BxS,EACI0J,EAAG,MAAM,CAAC,EAAIgJ,IAAS,EACvB,UAAM,CAAA,MAAA,yBACI,OAAAhJ,EAAG,MAAM,CAAC,EAA2C,0CAAA,EAC3D,8BAAA,OAA8B8I,EAAW,KAAK,KAAK,EAAS,OAAA,EAAA,OAAAE,CAAI,CAAE,CAAA,EAE1E,IAAMzxB,EAA+B,CAAC,EAAGyoB,CAAE,EACrClmB,EAA6B,CAAC,WAAUgvB,EAAE,MAAKC,CAAA,EAErD,OAAOzO,EAAO,UACVzY,GAAgBtK,EAChBuC,CAAgC,CACtC,CAEO,IAAMmvB,GAAiCz3B,EAAG,CAAC,gBAAeq3B,EAAA,CAAC,ECtF5D,SAAUK,GAAsB5rB,EAAY,CAChD,IAAI4oB,EACJ,OAAI5oB,EAAE,OAAS,GAAKA,EAAE,OAAS,EAC7B4oB,EAAMH,EAAQzoB,EAAG,CAAC,EAAG,EAAG,EAAGA,EAAE,IAAI,CAAC,EACzBA,EAAE,OAAS,EACpB4oB,EAAMH,EAAQzoB,EAAG,CAAC,EAAG,EAAGA,EAAE,MAAM,CAAC,EAAGA,EAAE,MAAM,CAAC,CAAC,CAAC,EACtCA,EAAE,OAAS,EACpB4oB,EAAMH,EAAQzoB,EAAG,CAAC,EAAGA,EAAE,MAAM,CAAC,EAAGA,EAAE,MAAM,CAAC,EAAGA,EAAE,MAAM,CAAC,CAAC,CAAC,EAExD4oB,EAAM5oB,EAGD4oB,CACT,CCuBA,SAASiD,GACL7rB,EAAyB8rB,EACzBC,EACAtrB,EACAurB,EACAC,EAAwB,CACtBA,GAAmB,OACrBA,EAAkB,MAEpB,IAAMvJ,EAAKX,EAAgB/hB,EAAG,IAAK,WAAW,EACxCksB,EAAQnK,EAAgB+J,EAAM,OAAQ,WAAW,EACjDK,EAAYpK,EAAgBgK,EAAU,WAAY,WAAW,EAC/DK,EACAJ,GAAS,OACXI,EAASrK,EAAgBiK,EAAO,QAAS,WAAW,GAEtD,IAAIK,EACA5rB,GAAU,OACZ4rB,EAAUtK,EAAgBthB,EAAQ,SAAU,WAAW,GAGzDuY,EACIkT,EAAM,OAASC,EAAU,KACzB,UAAA,CAAM,MAAA,8EACY,CAAA,EACtBnT,EACIqT,GAAW,MAAQH,EAAM,OAASG,EAAQ,KAC1C,UAAA,CAAM,MAAA,4EACY,CAAA,EACtBrT,EACIoT,GAAU,MAAQF,EAAM,OAASE,EAAO,KACxC,UAAA,CAAM,MAAA,2EACY,CAAA,EAEtB,IAAMxD,EAAgBgD,GAAMlJ,CAAE,EAExBzoB,EAA+B,CACnC,EAAG2uB,EACH,MAAOwD,EACP,OAAQC,EACR,KAAMH,EACN,SAAUC,GAGN3vB,EAA6B,CAAC,gBAAeyvB,CAAA,EAG7C3Z,EAAM0K,EAAO,UACHjW,GAAgB9M,EAChBuC,CAAgC,EAEhD,OAAOisB,EAAQnW,EAAKoQ,EAAG,KAAK,CAC9B,CAEO,IAAM4J,GAA4Bp4B,EAAG,CAAC,WAAU23B,EAAA,CAAC,EC3ExD,SAASU,GACLvsB,EAAwB8rB,EACxBC,EACAtrB,EAAuCurB,EACvCC,EAAwB,CAC1B,IAAMvJ,EAAKX,EAAgB/hB,EAAG,IAAK,WAAW,EACxCksB,EAAQnK,EAAgB+J,EAAM,OAAQ,WAAW,EACjDK,EAAYpK,EAAgBgK,EAAU,WAAY,WAAW,EAC/DK,EACAJ,GAAS,OACXI,EAASrK,EAAgBiK,EAAO,QAAS,WAAW,GAEtD,IAAIK,EACJ,OAAI5rB,GAAU,OACZ4rB,EAAUtK,EAAgBthB,EAAQ,SAAU,WAAW,GAEzDuY,EACI0J,EAAG,OAAS,EACZ,UAAM,CAAA,MAAA,uDACF,GAAA,OAAGA,EAAG,KAAI,GAAA,CADR,CACW,EACrB1J,EACIkT,EAAM,OAAS,GAAKA,EAAM,OAAS,EACnC,UAAA,CAAM,MAAA,2DACF,YAAA,OAAYA,EAAM,KAAI,GAAA,CADpB,CACuB,EACjClT,EACImT,EAAU,OAAS,GAAKA,EAAU,OAAS,EAC3C,UAAA,CAAM,MAAA,2DACF,gBAAA,OAAgBA,EAAU,KAAI,GAAA,CAD5B,CAC+B,EACrCC,GAAU,MACZpT,EACIoT,EAAO,OAAS,GAAKA,EAAO,OAAS,EACrC,UAAA,CAAM,MAAA,wDACF,gBAAA,OAAgBA,EAAO,KAAI,GAAA,CADzB,CAC4B,EAEpCC,GAAW,MACbrT,EACIqT,EAAQ,OAAS,GAAKA,EAAQ,OAAS,EACvC,UAAA,CAAM,MAAA,yDACF,gBAAA,OAAgBA,EAAQ,KAAI,GAAA,CAD1B,CAC6B,EAGlCC,GAAU5J,EAAIwJ,EAAOC,EAAWE,EAASD,EAAQH,CAAe,CACzE,CAEO,IAAMO,GAA8Bt4B,EAAG,CAAC,aAAYq4B,EAAA,CAAC,EC5C5D,SAASE,GACLzsB,EAAwB8rB,EACxBC,EACAtrB,EAAuCurB,EACvCC,EAAwB,CAC1B,IAAMvJ,EAAKX,EAAgB/hB,EAAG,IAAK,WAAW,EACxCksB,EAAQnK,EAAgB+J,EAAM,OAAQ,WAAW,EACjDK,EAAYpK,EAAgBgK,EAAU,WAAY,WAAW,EAC/DK,EACAJ,GAAS,OACXI,EAASrK,EAAgBiK,EAAO,QAAS,WAAW,GAEtD,IAAIK,EACJ,OAAI5rB,GAAU,OACZ4rB,EAAUtK,EAAgBthB,EAAQ,SAAU,WAAW,GAEzDuY,EACI0J,EAAG,OAAS,EACZ,UAAM,CAAA,MAAA,uDACF,GAAA,OAAGA,EAAG,KAAI,GAAA,CADR,CACW,EACrB1J,EACIkT,EAAM,OAAS,GAAKA,EAAM,OAAS,EACnC,UAAA,CAAM,MAAA,2DACF,YAAA,OAAYA,EAAM,KAAI,GAAA,CADpB,CACuB,EACjClT,EACImT,EAAU,OAAS,GAAKA,EAAU,OAAS,EAC3C,UAAA,CAAM,MAAA,2DACF,gBAAA,OAAgBA,EAAU,KAAI,GAAA,CAD5B,CAC+B,EACrCC,GAAU,MACZpT,EACIoT,EAAO,OAAS,GAAKA,EAAO,OAAS,EACrC,UAAA,CAAM,MAAA,wDACF,gBAAA,OAAgBA,EAAO,KAAI,GAAA,CADzB,CAC4B,EAEpCC,GAAW,MACbrT,EACIqT,EAAQ,OAAS,GAAKA,EAAQ,OAAS,EACvC,UAAA,CAAM,MAAA,yDACF,gBAAA,OAAgBA,EAAQ,KAAI,GAAA,CAD1B,CAC6B,EAGlCC,GAAU5J,EAAIwJ,EAAOC,EAAWE,EAASD,EAAQH,CAAe,CACzE,CAEO,IAAMS,GAA8Bx4B,EAAG,CAAC,aAAYu4B,EAAA,CAAC,EC5C5D,SAASE,GACL3sB,EAAwB8rB,EACxBC,EACAtrB,EAAuCurB,EACvCC,EAAwB,CAC1B,IAAMvJ,EAAKX,EAAgB/hB,EAAG,IAAK,WAAW,EACxCksB,EAAQnK,EAAgB+J,EAAM,OAAQ,WAAW,EACjDK,EAAYpK,EAAgBgK,EAAU,WAAY,WAAW,EAC/DK,EACAJ,GAAS,OACXI,EAASrK,EAAgBiK,EAAO,QAAS,WAAW,GAEtD,IAAIK,EACJ,OAAI5rB,GAAU,OACZ4rB,EAAUtK,EAAgBthB,EAAQ,SAAU,WAAW,GAEzDuY,EACI0J,EAAG,OAAS,EACZ,UAAM,CAAA,MAAA,uDACF,GAAA,OAAGA,EAAG,KAAI,GAAA,CADR,CACW,EACrB1J,EACIkT,EAAM,OAAS,GAAKA,EAAM,OAAS,EACnC,UAAA,CAAM,MAAA,2DACF,YAAA,OAAYA,EAAM,KAAI,GAAA,CADpB,CACuB,EACjClT,EACImT,EAAU,OAAS,GAAKA,EAAU,OAAS,EAC3C,UAAA,CAAM,MAAA,2DACF,gBAAA,OAAgBA,EAAU,KAAI,GAAA,CAD5B,CAC+B,EACrCC,GAAU,MACZpT,EACIoT,EAAO,OAAS,GAAKA,EAAO,OAAS,EACrC,UAAA,CAAM,MAAA,wDACF,gBAAA,OAAgBA,EAAO,KAAI,GAAA,CADzB,CAC4B,EAEpCC,GAAW,MACbrT,EACIqT,EAAQ,OAAS,GAAKA,EAAQ,OAAS,EACvC,UAAA,CAAM,MAAA,yDACF,gBAAA,OAAgBA,EAAQ,KAAI,GAAA,CAD1B,CAC6B,EAElCC,GAAU5J,EAAIwJ,EAAOC,EAAWE,EAASD,EAAQH,CAAe,CACzE,CAEO,IAAMW,GAA8B14B,EAAG,CAAC,aAAYy4B,EAAA,CAAC,ECjC5D,SAASE,GACL7sB,EAAiBlG,EAAuBwE,EAAY,CACtD,IAAMokB,EAAKX,EAAgB/hB,EAAG,IAAK,UAAU,EACvC8sB,EAAW/K,EAAgBjoB,EAAS,UAAW,UAAU,EAE/Dkf,EACI0J,EAAG,QAAU,QACb,UAAM,CAAA,MAAA,4BACF,gCAAA,OAAgCA,EAAG,KAAK,CADtC,CACwC,EAClD1J,EAAY1a,GAAQ,EAAG,UAAM,CAAA,MAAA,sCAAA,OAAsCA,EAAI,GAAA,CAA1C,CAA6C,EAC1E0a,EACI8T,EAAS,OAASpK,EAAG,MAAQoK,EAAS,OAAS,EAC/C,UAAA,CAAM,MAAA,iEACF,kCAAkC,OAAApK,EAAG,MAAwB,mBAAA,EAC7D,GAAA,OAAGoK,EAAS,MAAK,GAAA,CAFf,CAEkB,EAE5B,IAAM7yB,EAAyB,CAAC,EAAGyoB,EAAI,QAASoK,CAAQ,EAClDtwB,EAAuB,CAAC,KAAI8B,CAAA,EAElC,OAAO0e,EAAO,UACVxY,GAAUvK,EACVuC,CAAgC,CACtC,CAEO,IAAMuwB,GAA2B74B,EAAG,CAAC,UAAS24B,EAAA,CAAC,ECtBtD,SAASG,GAA4BhtB,EAAWnM,EAAS,CACvD,IAAM6uB,EAAKX,EAAgB/hB,EAAG,IAAK,YAAY,EACzCitB,EAAKlL,EAAgBluB,EAAG,IAAK,YAAY,EAE/C,GAAI,CAACqK,GAAYwkB,EAAG,MAAOuK,EAAG,KAAK,EACjC,MAAM,IAAI,MAAM,oDAAA,OACZvK,EAAG,MAAK,OAAA,EAAA,OAAQuK,EAAG,KAAK,CAAE,EAEhC,GAAIvK,EAAG,QAAU,SAAWuK,EAAG,QAAU,QACvC,MAAM,IAAI,MACN,wEAAA,OACIvK,EAAG,MAAK,kBAAA,EAAA,OAAmBuK,EAAG,KAAK,CAAE,EAG/C,IAAMhzB,EAA2B,CAAC,EAAGyoB,EAAI,EAAGuK,CAAE,EAC9C,OAAOjQ,EAAO,UAAUvY,GAAYxK,CAAmC,CACzE,CACO,IAAMizB,GAA6Bh5B,EAAG,CAAC,YAAW84B,EAAA,CAAC,ECxB1D,SAASG,GACPC,EAAyBC,EAAuB,CAChD,IAAMC,EAAcvL,EAAgBqL,EAAI,KAAM,gBAAiB,OAAO,EAChEG,EAAcxL,EAAgBsL,EAAI,KAAM,gBAAiB,OAAO,EAEtE,GAAIC,EAAY,OAAS,EACvB,MAAM,IAAI,MACR,2DACA,YAAA,OAAYA,EAAY,IAAI,CAAE,EAGlC,GAAIC,EAAY,OAAS,EACvB,MAAM,IAAI,MACR,4DACA,YAAA,OAAYA,EAAY,IAAI,CAAE,EAGlC,IAAMtzB,EAA8B,CAAE,GAAIqzB,EAAa,GAAIC,CAAW,EACtE,OAAOvQ,EAAO,UAAUtY,GAAezK,CAAmC,CAC5E,CAEO,IAAMuzB,GAAgCt5B,EAAG,CAAE,eAAci5B,EAAA,CAAE,ECjBlE,SAASM,GACLztB,EAAsBpD,EAAkB,CAC1C,IAAI7B,EAAQgnB,EAAgB/hB,EAAG,cAAe,GAAG,EAC3C0tB,EAAS3yB,EAAM,MAIrB,GAFAqG,GAAmCxE,CAAK,EAEpCA,EAAM,OAAS7B,EAAM,KACvB,MAAM,IAAI,MAAM,+BAAA,OAA+B6B,EAAM,OAAM,gBAAA,EAAA,OACvD7B,EAAM,KAAI,GAAA,CAAG,EAGnB,GAAI6B,EAAM,OAAS7B,EAAM,KAAM,CAE7B,QADMkE,EAAWlE,EAAM,MAAM,MAAK,EAC3BkE,EAAS,OAASrC,EAAM,QAC7BqC,EAAS,QAAQ,CAAC,EAEpBlE,EAAQ0tB,EAAQ1tB,EAAOkE,CAAQ,CAChC,CAID,QAFMqW,EAAava,EAAM,MACnB4yB,EAAiB,MAAM,KAAK/wB,CAAK,EAC9B,EAAIA,EAAM,OAAS,EAAG,GAAK,EAAG,IACrC,GAAI0Y,EAAW,CAAC,IAAM1Y,EAAM,CAAC,EAC3B+wB,EAAK,CAAC,EAAI,UACD5yB,EAAM,MAAM,CAAC,IAAM,EAC5B,MAAM,IAAI,MACN,mBAAA,OAAmB2yB,EAAmC,4BAAA,EAAA,OAAA9wB,EAAS,IAAA,CAAA,EAGvE,IAAMwC,EAAOuuB,EAAK,IAAI,SAAC35B,EAAGO,EAAC,CAAK,OAAAP,EAAI,EAAIO,EAAI,EAAE,CAAA,EAAE,OAAO,SAAAA,EAAC,CAAI,OAAAA,GAAK,CAAL,CAAM,EAElE,GAAI6K,EAAK,SAAW,EAClB,OAAOpH,GAAM+C,CAAK,EAIpB,IAAMd,EAAqB,CAAC,EAAGc,CAAK,EAC9ByB,EAAmB,CAAC,KAAImxB,CAAA,EAC9B,OAAO3Q,EAAO,UACVxQ,GAAMvS,EACNuC,CAAgC,CACtC,CAEO,IAAMoxB,GAA8B15B,EAAG,CAAC,aAAYu5B,EAAA,CAAC,WCzC5CI,GACZjxB,EAAoBY,EACpBD,EAAuB,CADH,OAAAC,IAAA,SAAAA,EAAyB,WAE/CA,EAAQA,GAAS,UACjBswB,GAAwClxB,CAAK,EACtC,IAAIic,GAAmBjc,EAAOY,EAAOD,CAAM,CACpD,CCfA,SAASwwB,GAAwB/tB,EAAe,CAC9C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,OAAQ,SAAS,EAE9C/F,EAAqB,CAAC,EAAGyoB,CAAE,EACjC,OAAO1F,EAAO,UAAUpY,GAAM3K,CAAmC,CACnE,CACO,IAAM+zB,GAAuB95B,EAAG,CAAC,MAAK65B,EAAA,CAAC,ECL9C,SAASE,GACLrxB,EAAoB5J,EAAsBwK,EAAgB,CAC5D4D,GAAmCxE,CAAK,EAExCY,EAAQA,GAAS4C,GAAWpN,CAAK,EACjC,IAAMwJ,EAAmB,CAAC,MAAKI,EAAE,MAAK5J,EAAE,MAAKwK,CAAA,EAE7C,OAAOwf,EAAO,UAAUrW,GAAM,CAAA,EAAInK,CAAgC,CACpE,CCLA,SAAS0xB,GACLluB,EAAiBmuB,EAAsBC,EAAoB,CAC7D,IAAM1L,EAAKX,EAAgB/hB,EAAG,IAAK,aAAa,EAMhD,GALAgZ,EACKmV,GAAgBC,EACjB,UAAA,CAAM,MAAA,uBAAA,OAAuBD,EAAwB,YAAA,EACjD,8BAAA,OAA8BC,EAAY,IAAA,CADxC,CAC4C,EAElDD,IAAiBC,EACnB,OAAOH,GAAKvL,EAAG,MAAOyL,EAAczL,EAAG,KAAK,EAG9C,IAAMzoB,EAA4B,CAAC,EAAGyoB,CAAE,EAClClmB,EAA0B,CAAC,aAAY2xB,EAAE,aAAYC,CAAA,EAE3D,OAAOpR,EAAO,UACVnY,GAAa5K,EACbuC,CAAgC,CACtC,CAEO,IAAM6xB,GAA8Bn6B,EAAG,CAAC,aAAYg6B,EAAA,CAAC,EChB5D,SAASI,GAA2BC,EAAoBC,EAAkB,CACxE,IAAMC,EAAQ1M,EAAgBwM,EAAM,OAAQ,SAAS,EAC/CG,EAAQ3M,EAAgByM,EAAM,OAAQ,SAAS,EACrDG,GACIF,EAAM,MAAOC,EAAM,MACnB,yBAAA,OAAyBD,EAAM,MAAK,OAAA,EAAA,OAAQC,EAAM,MAAS,IAAA,EACvD,qCAAqC,EAE7C,IAAMz0B,EAAwB,CAAC,KAAMw0B,EAAO,KAAMC,CAAK,EACvD,OAAO1R,EAAO,UAAUlY,GAAS7K,CAAmC,CACtE,CAEO,IAAM20B,GAA0B16B,EAAG,CAAC,SAAQo6B,EAAA,CAAC,ECzBpD,SAASO,GAAUlQ,EAAmC,CACpD,OAAO4K,GAAO5K,EAAS,CAAC,CAC1B,CAEO,IAAMmQ,GAA2B56B,EAAG,CAAC,UAAS26B,EAAA,CAAC,ECYtD,SAASE,GACLpQ,EAAqC9f,EAAY,CACnD,OAAO0qB,GAAO5K,EAAS9f,CAAI,CAC7B,CAEO,IAAMmwB,GAA2B96B,EAAG,CAAC,UAAS66B,EAAA,CAAC,ECDtD,SAASE,GACLtQ,EAAqC9f,EAAY,CACnD,OAAO0qB,GAAO5K,EAAS9f,CAAI,CAC7B,CAEO,IAAMqwB,GAA2Bh7B,EAAG,CAAC,UAAS+6B,EAAA,CAAC,EC5BtD,SAASE,GACLxQ,EAAqC9f,EAAY,CACnD,OAAO0qB,GAAO5K,EAAS9f,CAAI,CAC7B,CAEO,IAAMuwB,GAA2Bl7B,EAAG,CAAC,UAASi7B,EAAA,CAAC,EC0BtD,SAASE,GACLrvB,EAAiBsvB,EACjB/uB,EACA1I,EACAqtB,EACAF,EACAsD,EAAwC,CAFxCpD,IAAA,SAAAA,EAAkC,QAClCF,IAAA,SAAAA,EAAA,CAAsC,EAAG,CAAC,GAE5C,IAAMtC,EAAKX,EAAgB/hB,EAAG,IAAK,SAAU,SAAS,EAChDuvB,EAAUxN,EAAgBuN,EAAQ,SAAU,SAAU,SAAS,EAEjE1G,EAAMlG,EACNmG,EAAe,GAEfnG,EAAG,OAAS,IACdmG,EAAe,GACfD,EAAMH,EAAQ/F,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAG9D1J,EACI4P,EAAI,OAAS,EACb,UAAA,CAAM,MAAA,uDAAA,OAAuDA,EAAI,KAAI,GAAA,CAA/D,CAAkE,EAC5E5P,EACIuW,EAAQ,OAAS,EACjB,UAAM,CAAA,MAAA,wDACF,GAAA,OAAGA,EAAQ,KAAI,GAAA,CADb,CACgB,EAC1BzG,GAAoC,SAAUjxB,EAAKywB,CAAe,EAClE,IAAMkH,EAAUtK,IAAe,OAAS0D,EAAI,MAAM,CAAC,EAAIA,EAAI,MAAM,CAAC,EAClE5P,EACIwW,IAAYD,EAAQ,MAAM,CAAC,EAC3B,UAAA,CAAM,MAAA,oCAAA,OAAoCC,EAAsB,eAAA,EAC5D,0BAA0B,OAAAD,EAAQ,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EACrDvW,EACI2P,GAAyCpoB,EAASykB,CAAS,EAC3D,UAAA,CAAM,MAAA,2DACF,eAAA,OAAezkB,EAA0B,kBAAA,EAAA,OAAAykB,EAAS,GAAA,CADhD,CACmD,EAC7DhM,EACIyW,GAAwCzK,CAAS,EACjD,UAAA,CAAM,MAAA,yDAAA,CAAyD,EACnEhM,EACIyW,GAAwClvB,CAAO,EAC/C,UAAA,CAAM,MAAA,mDAAA,CAAmD,EAE7D,IAAMtG,EAAuB,CAAC,EAAG2uB,EAAK,OAAQ2G,CAAO,EAC/C/yB,EACY,CAAC,QAAO+D,EAAE,IAAG1I,EAAE,WAAUqtB,EAAE,UAASF,EAAE,gBAAesD,CAAA,EAGjEhW,EAAM0K,EAAO,UACH/X,GAAQhL,EACRuC,CAAgC,EAEhD,OAAIqsB,EACKJ,EAAQnW,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAEzDA,CACT,CAEO,IAAMod,GAAyBx7B,EAAG,CAAC,QAAOm7B,EAAA,CAAC,EChElD,SAASM,GACL3vB,EAAiBsvB,EAA6B7W,EAC9C5gB,EACAqtB,EAAiCmC,EACjCiB,EAAwC,CADxCpD,IAAA,SAAAA,EAA+B,OAAEmC,IAAA,SAAAA,EAAY,GAE/C,IAAM3E,EAAKX,EAAgB/hB,EAAG,IAAK,QAAQ,EACrCuvB,EAAUxN,EAAgBuN,EAAQ,SAAU,QAAQ,EAEtDM,EAAMlN,EACNmN,EAAe,GACfnN,EAAG,OAAS,IACdmN,EAAe,GACfD,EAAMnH,EAAQ/F,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAGjD1J,EACI4W,EAAI,OAAS,EACb,UAAA,CAAM,MAAA,uDAAA,OAAuDA,EAAI,KAAI,GAAA,CAA/D,CAAkE,EAC5E5W,EACIuW,EAAQ,OAAS,EACjB,UAAM,CAAA,MAAA,wDACF,GAAA,OAAGA,EAAQ,KAAI,GAAA,CADb,CACgB,EAC1BzG,GAAoC,SAAUjxB,EAAKywB,CAAe,EAClEtP,EACI4W,EAAI,MAAM,CAAC,IAAML,EAAQ,MAAM,CAAC,EAChC,UAAA,CAAM,MAAA,oCAAA,OAAoCK,EAAI,MAAM,CAAC,EAAgB,eAAA,EACjE,0BAA0B,OAAAL,EAAQ,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EACrDvW,EACI2P,GAAyClQ,EAAQ4O,CAAQ,EACzD,UAAA,CAAM,MAAA,yDACF,cAAA,OAAc5O,EAAwB,iBAAA,EAAA,OAAA4O,EAAQ,GAAA,CAD5C,CAC+C,EACzDrO,EACIyW,GAAwCpI,CAAQ,EAChD,UAAA,CAAM,MAAA,yDAAA,CAAyD,EACnErO,EACIyW,GAAwChX,CAAM,EAC9C,UAAA,CAAM,MAAA,kDAAA,CAAkD,EAC5DO,EACIkM,IAAe,MACf,UAAM,CAAA,MAAA,sCAAA,OACFA,EAAU,uCAAA,CADR,CAC+C,EAEzD,IAAM4K,EAAWrH,EACb8G,EAAS,CAAC,EAAGA,EAAQ,MAAM,CAAC,EAAGA,EAAQ,MAAM,CAAC,EAAGA,EAAQ,MAAM,CAAC,CAAC,CAAC,EAChEQ,EAAUtH,EAAQmH,EAAK,CAACA,EAAI,MAAM,CAAC,EAAG,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EACpErvB,EAA4B,CAAC,EAAGkY,CAAM,EACtCuM,EAA8B,CAAC,EAAGqC,CAAQ,EAE1C2I,EAAmB,OAEnB1d,EAAMod,GACPK,EAAuBD,EAAuBvvB,EAAS1I,EACxDm4B,EAAkBhL,EAAWsD,CAAe,EAEhD,OAAIuH,EACKpH,EAAQnW,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAG3CmW,EAAQnW,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,CAChE,CAEO,IAAM2d,GAAyB/7B,EAAG,CAAC,QAAOy7B,EAAA,CAAC,EChElD,SAASO,GACLxC,EAAmExQ,EACnEoS,EAAkB/uB,EAClB1I,EACAqtB,EACAoD,EAAwC,CADxCpD,IAAA,SAAAA,EAAkC,QAEpClM,EACI0U,EAAO,SAAWxQ,EAAG,KACrB,UAAA,CAAM,MAAA,qBACF,IAAI,OAAAwQ,EAAO,OAA2B,oBAAA,EAAA,OAAAxQ,EAAG,KAAkB,cAAA,CAAA,CAAA,EAEnE,IAAIiT,EAAWzC,EACX0C,EAAOlT,EACP2L,EAAe,GACf3L,EAAG,OAAS,IACd2L,EAAe,GACfuH,EAAO3H,EAAQvL,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,EAC7DiT,EAAW,CAAC,EAAGzC,EAAO,CAAC,EAAGA,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,GAGhD1U,EACImX,EAAS,SAAW,EACpB,UACI,CAAA,MAAA,qEACA,GAAA,OAAGA,EAAS,OAAM,GAAA,CADlB,CACqB,EAC7BnX,EACIoX,EAAK,OAAS,EACd,UAAM,CAAA,MAAA,uDACF,QAAA,OAAQA,EAAK,IAAI,CADf,CACiB,EAC3BpX,EACIsW,EAAO,OAAS,EAChB,UAAM,CAAA,MAAA,2DACF,QAAA,OAAQA,EAAO,IAAI,CADjB,CACmB,EAC7B,IAAME,EAAUtK,IAAe,OAASiL,EAAS,CAAC,EAAIA,EAAS,CAAC,EAC1DE,EAAWnL,IAAe,OAASkL,EAAK,MAAM,CAAC,EAAIA,EAAK,MAAM,CAAC,EACrEpX,EACIwW,IAAYF,EAAO,MAAM,CAAC,EAC1B,UAAA,CAAM,MAAA,4CAAA,OAA4CE,EAAgB,SAAA,EAC9D,gCAAgC,OAAAF,EAAO,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EAC1DtW,EACIqX,IAAaf,EAAO,MAAM,CAAC,EAC3B,UAAA,CAAM,MAAA,6CAAA,OAA6Ce,EAAiB,SAAA,EAChE,iCAAiC,OAAAf,EAAO,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EAC3DxG,GAAoC,iBAAkBjxB,EAAKywB,CAAe,EAC1E,IAAMruB,EAAoC,CAAC,GAAIm2B,EAAM,OAAMd,CAAA,EACrD9yB,EACF,CAAC,QAAO+D,EAAE,IAAG1I,EAAE,WAAUqtB,EAAE,gBAAeoD,EAAE,WAAY6H,CAAQ,EAG9D7d,EAAM0K,EAAO,UACH7X,GAAqBlL,EACrBuC,CAAgC,EAEhD,OAAIqsB,EACKJ,EAAQnW,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAEzDA,CACT,CAEO,IAAMge,GAAsCp8B,EAAG,CAAC,qBAAoBg8B,EAAA,CAAC,EClE5E,SAASK,GACLvwB,EAAiBsvB,EACjBkB,EACAjwB,EACA1I,EACAywB,EAAwC,CAC1C,IAAM5F,EAAKX,EAAgB/hB,EAAG,IAAK,iBAAiB,EAC9CuvB,EAAUxN,EAAgBuN,EAAQ,SAAU,iBAAiB,EAEnE,OAAOgB,GACHE,EAAa9N,EAAI6M,EAAShvB,EAAS1I,EAAK,OAAQywB,CAAe,CACrE,CAEO,IAAMmI,GAAkCv8B,EAAG,CAAC,iBAAgBq8B,EAAA,CAAC,ECIpE,SAASG,GACL1wB,EAAiBsvB,EACjB/uB,EAA0C1I,EAC1CqtB,EACAF,EAAsD,CADtDE,IAAA,SAAAA,EAAqC,SACrCF,IAAA,SAAAA,EAA8C,CAAA,EAAG,EAAG,CAAC,GACvD,IAAMtC,EAAKX,EAAgB/hB,EAAG,IAAK,QAAQ,EACrCuvB,EAAUxN,EAAgBuN,EAAQ,SAAU,QAAQ,EAEtDrG,EAAMvG,EACNwG,EAAe,GAEfxG,EAAG,OAAS,IACdwG,EAAe,GACfD,EAAMR,EAAQ/F,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAE3E1J,EACIiQ,EAAI,OAAS,EACb,UAAA,CAAM,MAAA,uDAAA,OAAuDA,EAAI,KAAI,GAAA,CAA/D,CAAkE,EAC5EjQ,EACIuW,EAAQ,OAAS,EACjB,UAAM,CAAA,MAAA,wDACF,GAAA,OAAGA,EAAQ,KAAI,GAAA,CADb,CACgB,EAC1BvW,EACIiQ,EAAI,MAAM,CAAC,IAAMsG,EAAQ,MAAM,CAAC,EAChC,UAAA,CAAM,MAAA,oCAAA,OAAoCtG,EAAI,MAAM,CAAC,EAAgB,eAAA,EACjE,0BAA0B,OAAAsG,EAAQ,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EACrDvW,EACIkP,GAA+B3nB,EAASykB,CAAS,EACjD,UAAM,CAAA,MAAA,2DACF,eAAA,OAAezkB,EAA0B,kBAAA,EAAA,OAAAykB,EAAS,GAAA,CADhD,CACmD,EAC7DhM,EACIkM,IAAe,QACf,UAAM,CAAA,MAAA,sCAAA,OACFA,EAAU,yCAAA,CADR,CACiD,EAC3DlM,EACImP,GAA8BnD,CAAS,EACvC,UAAA,CAAM,MAAA,yDAAA,CAAyD,EACnEhM,EACImP,GAA8B5nB,CAAO,EACrC,UAAA,CAAM,MAAA,mDAAA,CAAmD,EAE7D,IAAMtG,EAAuB,CAAC,EAAGgvB,EAAK,OAAQsG,CAAO,EAE/C/yB,EAAqB,CAAC,QAAO+D,EAAE,IAAG1I,EAAE,WAAUqtB,EAAE,UAASF,CAAA,EAGzD1S,EAAM0K,EAAO,UACH5X,GAAQnL,EACRuC,CAAgC,EAEhD,OAAI0sB,EACKT,EACInW,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAGnEA,CACT,CAEO,IAAMqe,GAAyBz8B,EAAG,CAAC,QAAOw8B,EAAA,CAAC,EC3ElD,SAASE,GACLlD,EAGAxQ,EAAOoS,EAAkB/uB,EACzB1I,EAAmB,CACrBmhB,EACI0U,EAAO,SAAWxQ,EAAG,KACrB,UAAA,CAAM,MAAA,qBACF,IAAI,OAAAwQ,EAAO,OAA2B,oBAAA,EAAA,OAAAxQ,EAAG,KAAkB,cAAA,CAAA,CAAA,EAEnE,IAAI2T,EAAWnD,EACXoD,EAAO5T,EACPgM,EAAe,GACfhM,EAAG,OAAS,IACdgM,EAAe,GACf4H,EAAOrI,EAAQvL,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,EAC1E2T,EAAW,CAAC,EAAGnD,EAAO,CAAC,EAAGA,EAAO,CAAC,EAAGA,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,GAG3D,IAAM8B,EAAUqB,EAAS,CAAC,EACpBR,EAAWS,EAAK,MAAM,CAAC,EAC7B9X,EACI6X,EAAS,SAAW,EACpB,UACI,CAAA,MAAA,qEACA,GAAA,OAAGA,EAAS,OAAM,GAAA,CADlB,CACqB,EAC7B7X,EACI8X,EAAK,OAAS,EACd,UAAM,CAAA,MAAA,uDACF,QAAA,OAAQA,EAAK,IAAI,CADf,CACiB,EAC3B9X,EACIsW,EAAO,OAAS,EAChB,UAAM,CAAA,MAAA,2DACF,QAAA,OAAQA,EAAO,IAAI,CADjB,CACmB,EAC7BtW,EACIwW,IAAYF,EAAO,MAAM,CAAC,EAC1B,UAAA,CAAM,MAAA,4CAAA,OAA4CE,EAAgB,SAAA,EAC9D,gCAAgC,OAAAF,EAAO,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EAC1DtW,EACIqX,IAAaf,EAAO,MAAM,CAAC,EAC3B,UAAA,CAAM,MAAA,6CAAA,OAA6Ce,EAAiB,SAAA,EAChE,iCAAiC,OAAAf,EAAO,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EAE3D,IAAMr1B,EAAsC,CAAC,GAAI62B,EAAM,OAAMxB,CAAA,EAEvD9yB,EAC2B,CAAC,IAAG3E,EAAE,QAAO0I,EAAE,WAAYswB,CAAQ,EAG9Dve,EAAM0K,EAAO,UACH3X,GAAuBpL,EACvBuC,CAAgC,EAEhD,OAAI0sB,EACKT,EACInW,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAGnEA,CACT,CAEO,IAAMye,GAAsC78B,EAAG,CAAC,qBAAoB08B,EAAA,CAAC,EChE5E,SAASI,GACLhxB,EAAiBsvB,EACjBkB,EAGAjwB,EAA0C1I,EAAmB,CAC/D,IAAM6qB,EAAKX,EAAgB/hB,EAAG,IAAK,iBAAiB,EAC9CuvB,EAAUxN,EAAgBuN,EAAQ,SAAU,iBAAiB,EAEnE,OAAOyB,GAAoBP,EAAa9N,EAAI6M,EAAShvB,EAAS1I,CAAG,CACnE,CAEO,IAAMo5B,GAAkC/8B,EAAG,CAAC,iBAAgB88B,EAAA,CAAC,EChBpE,SAASE,GAAuBlxB,EAAe,CAC7C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,MAAO,SAAS,EAE7C/F,EAAoB,CAAC,EAAGyoB,CAAE,EAEhC,OAAO1F,EAAO,UAAU1X,GAAKrL,CAAmC,CAClE,CACO,IAAMk3B,GAAsBj9B,EAAG,CAAC,KAAIg9B,EAAA,CAAC,ECP5C,SAASE,GAAwBpxB,EAAe,CAC9C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,OAAQ,SAAS,EAC9C/F,EAAqB,CAAC,EAAGyoB,CAAE,EAEjC,OAAO1F,EAAO,UAAUzX,GAAMtL,CAAmC,CACnE,CACO,IAAMo3B,GAAuBn9B,EAAG,CAAC,MAAKk9B,EAAA,CAAC,ECM9C,SAASE,GACPtxB,EACAnB,EACA0yB,EACAC,EAAe,CAFf3yB,IAAA,SAAAA,EAAQ,GACR0yB,IAAA,SAAAA,EAAiB,IACjBC,IAAA,SAAAA,EAAe,IAEf,IAAM9O,EAAKX,EAAgB/hB,EAAG,IAAK,SAAS,EAEtC/F,EAAwB,CAAE,EAAGyoB,CAAE,EAC/BlmB,EAAsB,CAAE,KAAIqC,EAAE,UAAS0yB,EAAE,QAAOC,CAAA,EAEtD,OAAOxU,EAAO,UACZxX,GACAvL,EACAuC,CAAgC,CAEpC,CAEO,IAAMi1B,GAA0Bv9B,EAAG,CAAE,SAAQo9B,EAAA,CAAE,EClBtD,SAASI,GACL1xB,EAAsBnB,EAAU0yB,EAAmBC,EAAe,CAA5C3yB,IAAA,SAAAA,EAAQ,GAAE0yB,IAAA,SAAAA,EAAiB,IAAEC,IAAA,SAAAA,EAAe,IACpE,IAAM9O,EAAKX,EAAgB/hB,EAAG,IAAK,QAAQ,EAErC/F,EAAuB,CAAC,EAAGyoB,CAAE,EAC7BlmB,EAAqB,CAAC,KAAIqC,EAAE,UAAS0yB,EAAE,QAAOC,CAAA,EAEpD,OAAOxU,EAAO,UACVvX,GAAQxL,EACRuC,CAAgC,CACtC,CAEO,IAAMm1B,GAAyBz9B,EAAG,CAAC,QAAOw9B,EAAA,CAAC,ECflD,SAASE,GACL5xB,EAAiBlG,EAAuBwE,EACxCuzB,EAAoB,CAApBA,IAAA,SAAAA,EAAoB,IACtB,IAAMnP,EAAKX,EAAgB/hB,EAAG,IAAK,eAAe,EAC5C8sB,EAAW/K,EAAgBjoB,EAAS,UAAW,eAAe,EAEpEkf,EACI0J,EAAG,QAAU,QACb,UAAM,CAAA,MAAA,iCACF,gCAAA,OAAgCA,EAAG,KAAK,CADtC,CACwC,EAClD1J,EACI0J,EAAG,MAAQ,EACX,UAAM,CAAA,MAAA,iEACF,QAAA,OAAQA,EAAG,KAAI,GAAA,CADb,CACgB,EAC1B1J,EAAY1a,GAAQ,EAAG,UAAM,CAAA,MAAA,sCAAA,OAAsCA,EAAI,GAAA,CAA1C,CAA6C,EAC1E0a,EACI8T,EAAS,OAASpK,EAAG,MAAQoK,EAAS,OAAS,EAC/C,UAAA,CACI,MAAA,oEACA,8BAA8B,OAAApK,EAAG,MAAwB,mBAAA,EACzD,GAAA,OAAGoK,EAAS,MAAK,GAAA,CAFjB,CAEoB,EAE5B,IAAM7yB,EAA8B,CAAC,EAAGyoB,EAAI,QAASoK,CAAQ,EACvDtwB,EAA4B,CAAC,KAAI8B,EAAE,aAAYuzB,CAAA,EAErD,OAAO7U,EAAO,UACVrX,GAAe1L,EACfuC,CAAgC,CACtC,CAEO,IAAMs1B,GAAgC59B,EAAG,CAAC,eAAc09B,EAAA,CAAC,ECZhE,SAASG,GACL/xB,EAA0BgyB,EAC1B9M,EAAkC,CAAlCA,IAAA,SAAAA,EAAkC,QACpC,IAAMxC,EAAKX,EAAgB/hB,EAAG,IAAK,eAAgB,SAAS,EAEtDiyB,EAAe/M,IAAe,OAAUxC,EAAG,MAAM,CAAC,EAAIA,EAAG,MAAM,CAAC,EAChEwP,EAAchN,IAAe,OAAUxC,EAAG,MAAM,CAAC,EAAIA,EAAG,MAAM,CAAC,EAC/DyP,EAAcjN,IAAe,OAAUxC,EAAG,MAAM,CAAC,EAAIA,EAAG,MAAM,CAAC,EAErE1J,EACIgZ,EAAY,EACZ,UAAM,CAAA,MAAA,sDAAA,OAAsDA,CAAS,CAA/D,CAAiE,EAE3EhZ,EACIiZ,EAAcD,GAAa,EAC3B,UAAM,CAAA,MAAA;MAAA,OACNC,EAAW,OAAA,EAAA,OAAQD,EAAS;KAAA,EAAA,OAC5BtP,EAAG,KAAK,CAAE,CAAA,EAEd1J,EACIkZ,EAAaF,GAAa,EAC1B,UAAM,CAAA,MAAA;MAAA,OACNE,EAAU,OAAA,EAAA,OAAQF,EAAS;SAAA,EAAA,OACvBtP,EAAG,KAAK,CAAE,CAAA,EAElB1J,EACKmZ,GAAcH,EAAYA,KAAe,EAC1C,UAAM,CAAA,MAAA,8CACF,OAAAA,EAAYA,EAAS,UAAA,EAAA,OACrBG,EAAU,qCAAA,EAAA,OAAsCzP,EAAG,KAAK,CAFtD,CAEwD,EAElE,IAAMzoB,EAA6B,CAAC,EAAGyoB,CAAE,EACnClmB,EAA2B,CAAC,UAASw1B,EAAE,WAAU9M,CAAA,EAEvD,OAAOlI,EAAO,UACVpX,GAAc3L,EACduC,CAAgC,CACtC,CAEO,IAAM41B,GAA+Bl+B,EAAG,CAAC,cAAa69B,EAAA,CAAC,EC9B9D,SAASM,GACLryB,EAAiBsvB,EACjB/uB,EACA1I,EACAqtB,EACAF,EACAsD,EAAwC,CAFxCpD,IAAA,SAAAA,EAAkC,QAClCF,IAAA,SAAAA,EAAA,CAAsC,EAAG,CAAC,GAE5C,IAAMtC,EAAKX,EAAgB/hB,EAAG,IAAK,kBAAmB,SAAS,EACzDuvB,EACFxN,EAAgBuN,EAAQ,SAAU,kBAAmB,SAAS,EAE9D1G,EAAMlG,EACNmG,EAAe,GACfnG,EAAG,OAAS,IACdmG,EAAe,GACfD,EAAMH,EAAQ/F,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAE9D1J,EACI4P,EAAI,OAAS,EACb,UAAM,CAAA,MAAA,2DACF,QAAA,OAAQA,EAAI,KAAI,GAAA,CADd,CACiB,EAC3B5P,EACIuW,EAAQ,OAAS,EACjB,UAAM,CAAA,MAAA,iEACF,GAAA,OAAGA,EAAQ,KAAI,GAAA,CADb,CACgB,EAC1B,IAAM3J,EAAaV,IAAe,OAAS0D,EAAI,MAAM,CAAC,EAAIA,EAAI,MAAM,CAAC,EACrE5P,EACI4M,IAAe2J,EAAQ,MAAM,CAAC,EAC9B,UAAA,CAAM,MAAA,sDACF,IAAA,OAAI3J,EAAqD,2CAAA,EACzD,UAAU,OAAA2J,EAAQ,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EACrCzG,GAAoC,kBAAmBjxB,EAAKywB,CAAe,EAC3E,IAAMruB,EAAsC,CAAC,EAAG2uB,EAAK,OAAQ2G,CAAO,EAC9D/yB,EACF,CAAC,QAAO+D,EAAE,IAAG1I,EAAE,WAAUqtB,EAAE,UAASF,EAAE,gBAAesD,CAAA,EAGnDhW,EAAM0K,EAAO,UACHnX,GAAuB5L,EACvBuC,CAAgC,EAEhD,OAAIqsB,EACKJ,EAAQnW,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAEzDA,CACT,CAEO,IAAMggB,GAAkCp+B,EAAG,CAAC,iBAAgBm+B,EAAA,CAAC,ECzEpE,SAASE,GAAMvyB,EAAS,CACtB,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,MAAM,EAEnC/F,EAAqB,CAAC,EAAGyoB,CAAE,EAEjC,OAAO1F,EAAO,UAAUhX,GAAM/L,CAAmC,CACnE,CAEO,IAAMu4B,GAAuBt+B,EAAG,CAAC,MAAKq+B,EAAA,CAAC,ECI9C,SAASE,GACLzyB,EAAiBsvB,EACjB/uB,EAAkC1I,EAClCmtB,EACAE,EAA2B,CAD3BF,IAAA,SAAAA,EAAA,CAAsC,EAAG,CAAC,GAC1CE,IAAA,SAAAA,EAA2B,QAC7B,IAAMxC,EAAKX,EAAgB/hB,EAAG,IAAK,YAAY,EACzCuvB,EAAUxN,EAAgBuN,EAAQ,SAAU,YAAY,EAE9DtW,EACI0J,EAAG,OAAS,GAAKA,EAAG,OAAS,EAC7B,UAAA,CAAM,MAAA,gEACF,GAAA,OAAGA,EAAG,KAAI,GAAA,CADR,CACW,EACrB1J,EACIuW,EAAQ,OAAS,EACjB,UAAM,CAAA,MAAA,4DACF,GAAA,OAAGA,EAAQ,KAAI,GAAA,CADb,CACgB,EAC1BvW,EACIkM,IAAe,OACf,UAAM,CAAA,MAAA,0DACF,yBAAA,OAAyBA,CAAU,CADjC,CACmC,EAE7C,IAAI0D,EAAMlG,EACNmG,EAAe,GAEfnG,EAAG,OAAS,IACdkG,EAAMH,EAAQ/F,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,EAC5DmG,EAAe,IAGjB7P,EACI4P,EAAI,MAAM,CAAC,IAAM2G,EAAQ,MAAM,CAAC,EAChC,UAAA,CAAM,MAAA,oEAAA,OACF3G,EAAI,MAAM,CAAC,EAAQ,MAAA,EAAA,OAAA2G,EAAQ,MAAM,CAAC,CAAC,CADjC,CACmC,EAE7C,IAAMt1B,EAA2B,CAAC,EAAG2uB,EAAK,OAAQ2G,CAAO,EACnD/yB,EAAyB,CAAC,QAAO+D,EAAE,IAAG1I,EAAE,UAASmtB,CAAA,EAGjD1S,EAAM0K,EAAO,UACH/W,GAAYhM,EACZuC,CAAgC,EAEhD,OAAIqsB,EACKJ,EAAQnW,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAGzDA,CACT,CAEO,IAAMogB,GAA6Bx+B,EAAG,CAAC,YAAWu+B,EAAA,CAAC,ECxD1D,SAASE,GACLv0B,EAAsB9L,EAAoB,OACxC2wB,EAAKlB,EAAgB3jB,EAAG,IAAK,UAAU,EACvC8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,UAAU,EAC3CoE,EAAAlC,EAAWymB,GAAegI,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAEvsB,EAAA,CAAA,EAAEwsB,EAAExsB,EAAA,CAAA,EAEP,IAAMuD,EAAyB,CAAC,EAAGgpB,EAAI,EAAGC,CAAE,EAE5C,OAAOlG,EAAO,UAAUlW,GAAU7M,CAAmC,CACvE,CAEO,IAAM24B,GAA2B1+B,EAAG,CAAC,UAASy+B,EAAA,CAAC,ECZtD,SAASE,GAAuBz0B,EAAsB9L,EAAoB,OACpE2wB,EAAKlB,EAAgB3jB,EAAG,IAAK,KAAK,EAClC8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,KAAK,EAGtC,GAFAoE,EAAAlC,EAAWymB,GAAegI,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAEvsB,EAAA,CAAA,EAAEwsB,EAAExsB,EAAA,CAAA,EAEHusB,EAAG,QAAU,SAAWC,EAAG,QAAU,QACvC,OAAO0P,GAAS3P,EAAIC,CAAE,EAGxB,IAAMjpB,EAAwB,CAAC,EAAGgpB,EAAI,EAAGC,CAAE,EACrC1mB,EAAQ,CAAA,EAGd,OAAOwgB,EAAO,UAAU9W,GACAjM,EAAqCuC,CAAK,CACpE,CAEO,IAAMmU,GAAsBzc,EAAG,CAAC,KAAI2+B,EAAA,CAAC,ECxB5B,SAAAC,GACZhO,EAAmB6B,EAAkB,CAEvC,QADMpzB,EAAmB,CAAA,EAChBgB,EAAI,EAAGA,EAAIoyB,EAAS,OAAQpyB,IAAK,CACxC,IAAMw+B,EAAQjO,EAAQA,EAAQ,OAASvwB,EAAI,CAAC,EACtCy+B,EAAUrM,EAAS,OAASpyB,EAAI,EAChC0+B,EAAStM,EAASqM,CAAO,GAC3BD,GAAS,MAASA,IAAU,GAAKE,EAAS,IAC5C1/B,EAAO,QAAQy/B,CAAO,CAEzB,CACD,OAAOz/B,CACT,CAEgB,SAAA2/B,GACZn1B,EAAkBC,EAAgB,CAIpC,QAHMhJ,EAAI,KAAK,IAAI+I,EAAO,OAAQC,EAAO,MAAM,EACzCzK,EAAS,IAAI,MAAMyB,CAAC,EAEjBT,EAAI,EAAGA,EAAIS,EAAGT,IAAK,CAC1B,IAAI6J,EAAIL,EAAOA,EAAO,OAASxJ,EAAI,CAAC,EAChC6J,GAAK,OACPA,EAAI,GAEN,IAAI9L,EAAI0L,EAAOA,EAAO,OAASzJ,EAAI,CAAC,EAIpC,GAHIjC,GAAK,OACPA,EAAI,GAEF8L,IAAM,EACR7K,EAAOyB,EAAIT,EAAI,CAAC,EAAIjC,UACXA,IAAM,EACfiB,EAAOyB,EAAIT,EAAI,CAAC,EAAI6J,UACXA,IAAM9L,EAAG,CAClB,IAAM6gC,EAAS,wDACX,GAAA,OAAGp1B,EAAM,OAAA,EAAA,OAAQC,EAAM,GAAA,EAC3B,MAAM,MAAMm1B,CAAM,CACnB,MACC5/B,EAAOyB,EAAIT,EAAI,CAAC,EAAI6J,CAEvB,CACD,OAAO7K,CACT,CC5CA,SAAS6/B,GACLh1B,EAAsB9L,EAAoB,OACxC2wB,EAAKlB,EAAgB3jB,EAAG,IAAK,QAAS,mBAAmB,EACzD8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,QAAS,mBAAmB,EAC7DoE,EAAAlC,EAAWymB,GAAegI,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAEvsB,EAAA,CAAA,EAAEwsB,EAAExsB,EAAA,CAAA,EAEPw8B,GAA2BjQ,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMjpB,EAAsB,CAAC,EAAGgpB,EAAI,EAAGC,CAAE,EAEzC,OAAOlG,EAAO,UAAU1W,GAAOrM,CAAmC,CACpE,CAEO,IAAMo5B,GAAwBn/B,EAAG,CAAC,OAAMk/B,EAAA,CAAC,ECJhD,SAASE,GACLC,EAA8Bn1B,EAAiB9L,EAAe,CAChE,IAAM2wB,EAAKlB,EAAgB3jB,EAAG,IAAK,OAAO,EACpC8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,OAAO,EACpCkhC,EAAazR,EAAgBwR,EAAW,YAAa,QAAS,MAAM,EAIpEE,EAAiBP,GACnBA,GAA2BM,EAAW,MAAOvQ,EAAG,KAAK,EAAGC,EAAG,KAAK,EAC9DwQ,EAAwB9F,GAAY4F,EAAYC,CAAc,EAC9DE,EAAgB/F,GAAY3K,EAAIwQ,CAAc,EAC9CG,EAAgBhG,GAAY1K,EAAIuQ,CAAc,EAE9Cx5B,EAAuB,CAC3B,UAAWy5B,EACX,EAAGC,EACH,EAAGC,GAEL,OAAO5W,EAAO,UAAUnS,GAAQ5Q,CAAmC,CACrE,CAEO,IAAM45B,GAAwB3/B,EAAG,CAAC,OAAMo/B,EAAA,CAAC,EClChD,SAASQ,GAA6B9zB,EAAe,CACnD,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,WAAW,EACxC/F,EAA0B,CAAC,EAAGyoB,CAAE,EACtC,OAAO1F,EAAO,UAAUjQ,GAAW9S,CAAmC,CACxE,CACO,IAAM85B,GAA4B7/B,EAAG,CAAC,WAAU4/B,EAAA,CAAC,ECcxD,SAASE,GACL51B,EAAsB9L,EAAoB,OAExC2wB,EAAKlB,EAAgB3jB,EAAG,IAAK,KAAK,EAClC8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,KAAK,EACtCoE,EAAAlC,EAAWymB,GAAegI,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAEvsB,EAAA,CAAA,EAAEwsB,EAAExsB,EAAA,CAAA,EAEP,IAAMu9B,EAAYtjB,GAAIsS,EAAIC,CAAE,EACtBgR,EAAQH,GAAUE,CAAS,EAC3BE,EAAcd,GAAMnQ,EAAIgR,CAAK,EACnC,OAAOL,GAAMM,EAAaD,EAAOD,CAAS,CAC5C,CAEO,IAAMG,GAA2BlgC,EAAG,CAAC,UAAS8/B,EAAA,CAAC,EC5BtD,SAASK,GAAKC,EAAuBC,EAAqB,CACxD,IAAMC,EAAMzS,EAAgBuS,EAAI,KAAM,KAAK,EACrCG,EAAM1S,EAAgBwS,EAAI,KAAM,KAAK,EAE3Cvb,GACKwb,EAAI,OAAS,GAAKA,EAAI,OAAS,KAAOC,EAAI,OAAS,GAAKA,EAAI,OAAS,GACtE,UAAA,CAAM,MAAA,+DACF,GAAG,OAAAD,EAAI,KAAY,OAAA,EAAA,OAAAC,EAAI,KAAO,GAAA,CAAA,CAAA,EAEtC,IAAMC,EAAWF,EAAI,OAAS,EAAIA,EAAI,KAAOA,EAAI,MAAM,CAAC,EAClDG,EAAWF,EAAI,OAAS,EAAIA,EAAI,KAAOA,EAAI,MAAM,CAAC,EAOxD,GALAzb,EACI0b,IAAYC,EACZ,UAAM,CAAA,MAAA,gEACF,GAAA,OAAGD,EAAe,OAAA,EAAA,OAAAC,EAAO,GAAA,CADvB,CAC0B,EAEhCH,EAAI,OAAS,GAAKC,EAAI,OAAS,EAAG,CACpC,IAAMG,EAAOnM,EAAQ+L,EAAK,CAAC,EAAG,EAAE,CAAC,EAC3BK,EAAOpM,EAAQgM,EAAK,CAAC,GAAI,CAAC,CAAC,EAC3BK,EAAOnL,GAAOiL,EAAMC,CAAI,EAC9B,OAAOpM,EAAQqM,EAAM,CAAA,CAAE,CACxB,SAAUN,EAAI,OAAS,GAAKC,EAAI,OAAS,EAAG,CAC3C,IAAMG,EAAOnM,EAAQ+L,EAAK,CAAC,EAAG,EAAE,CAAC,EAC3BK,EAAOpM,EAAQgM,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAChDK,EAAOnL,GAAOiL,EAAMC,CAAI,EAC9B,OAAOpM,EAAQqM,EAAM,CAACA,EAAK,IAAI,CAAC,CACjC,SAAUN,EAAI,OAAS,GAAKC,EAAI,OAAS,EAAG,CAC3C,IAAMI,EAAOpM,EAAQgM,EAAK,CAAC,GAAI,CAAC,CAAC,EAC3BK,EAAOnL,GAAO6K,EAAKK,CAAI,EAC7B,OAAOpM,EAAQqM,EAAM,CAACA,EAAK,IAAI,CAAC,CACjC,KAAM,CACL,IAAMD,EAAOpM,EAAQgM,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAChDK,EAAOnL,GAAO6K,EAAKK,CAAI,EAC7B,OAAOC,CACR,CACH,CAEO,IAAMC,GAAsB7gC,EAAG,CAAC,KAAImgC,EAAA,CAAC,ECqBtC,SAAUW,GAAQC,EAAgB,SAAsBtW,EAAA,CAAA,EAAAlc,EAAA,EAApBA,EAAoB,UAAA,OAApBA,IAAAkc,EAAoBlc,EAAA,CAAA,EAAA,UAAAA,CAAA,EAC5D,IAAM2gB,EACFzE,EAAQ,IAAI,SAAChrB,EAAGY,EAAM,CAAA,OAAAwtB,EAAgBpuB,EAAG,UAAA,OAAUY,CAAC,EAAI,QAAQ,CAAC,CAAA,EAC/DiI,EAAqB,CAAC,SAAQy4B,CAAA,EACpC,OAAOjY,EAAO,UACV7W,GAAQid,EACR5mB,CAAgC,CACtC,CAEO,IAAM04B,GAAyBhhC,EAAG,CAAC,QAAO8gC,EAAA,CAAC,ECzElD,SAASG,GAAuBn1B,EAAe,CAC7C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,MAAO,SAAS,EAE7C/F,EAAoB,CAAC,EAAGyoB,CAAE,EAEhC,OAAO1F,EAAO,UAAU5W,GAAKnM,CAAmC,CAClE,CAEO,IAAMm7B,GAAsBlhC,EAAG,CAAC,KAAIihC,EAAA,CAAC,ECG5C,SAASE,GAA6Br1B,EAAWpD,EAAkB,CACjE,IAAM8lB,EAAKX,EAAgB/hB,EAAG,IAAK,cAAe,mBAAmB,EACrE,GAAI,CAACzB,GAAoBmkB,EAAG,MAAO9lB,CAAK,EACtC,MAAM,IAAI,MAAM,gCACZ,OAAA8lB,EAAG,MAA+C,yCAAA,EAAA,OAAA9lB,CAAK,CAAE,EAG/D,OAAOoD,CACT,CACO,IAAMs1B,GAA8BphC,EAAG,CAAC,aAAYmhC,EAAA,CAAC,ECjB5D,SAASE,GAAuBv1B,EAAe,CAC7C,IAAI0iB,EAAKX,EAAgB/hB,EAAG,IAAK,KAAK,EACtCgZ,EACI0J,EAAG,QAAU,SAAWA,EAAG,QAAU,UACrC,UAAA,CAAM,MAAA,2CAA2C,CAAA,EAEjDA,EAAG,QAAU,UACfA,EAAKkC,GAAKlC,EAAI,SAAS,GAGzB,IAAMzoB,EAAoB,CAAC,EAAGyoB,CAAE,EAChC,OAAO1F,EAAO,UAAU3W,GAAKpM,CAAmC,CAClE,CACO,IAAMu7B,GAAsBthC,EAAG,CAAC,KAAIqhC,EAAA,CAAC,WCtB5BE,GACZC,EAAqBC,EAAqBv2B,EAAc,CAKxD,QAJIN,EAAO42B,EAAU,OAASC,EAAU,OACpCtc,EAAM,CAAA,EACRuc,EAAS,EACTC,EAAY,EACLh5B,EAAM,EAAGA,EAAMiC,EAAMjC,IAC1BuC,EAAK,QAAQvC,CAAG,IAAM,GACxBwc,EAAI,KAAKqc,EAAUE,GAAQ,CAAC,EAE5Bvc,EAAI,KAAKsc,EAAUE,GAAW,CAAC,EAGnC,OAAOxc,CACT,CAegB,SAAAyc,GACZl5B,EAAiBwC,EAAc,CACjC,IAAM22B,EAAiB32B,EAAK,IAAI,SAAAY,EAAC,CAAI,MAAA,EAAA,CAAC,EACtC,OAAOy1B,GAAiB74B,EAAOm5B,EAAgB32B,CAAI,CACrD,CCTA,SAAS42B,GACLh2B,EAAsBnB,EAA8B2kB,EAAgB,CAA9C3kB,IAAA,SAAAA,EAA4B,MAAE2kB,IAAA,SAAAA,EAAgB,IACtE,IAAMd,EAAKX,EAAgB/hB,EAAG,IAAK,KAAK,EAElC/F,EAAoB,CAAC,EAAGyoB,CAAE,EAC1BlmB,EAAkB,CAAC,iBAAkBqC,EAAM,SAAQ2kB,CAAA,EAEzD,OAAOxG,EAAO,UACV5U,GAAKnO,EACLuC,CAAgC,CACtC,CAEO,IAAMy5B,GAAsB/hC,EAAG,CAAC,KAAI8hC,EAAA,CAAC,ECb5C,SAASE,GACLl2B,EAAsBnB,EAA8B2kB,EAAgB,CAA9C3kB,IAAA,SAAAA,EAA4B,MAAE2kB,IAAA,SAAAA,EAAgB,IACtE,IAAMd,EAAKX,EAAgB/hB,EAAG,IAAK,KAAK,EAElC/F,EAAoB,CAAC,EAAGyoB,CAAE,EAC1BlmB,EAAkB,CAAC,KAAIqC,EAAE,SAAQ2kB,CAAA,EAGvC,OAAOxG,EAAO,UACHtU,GAAKzO,EACLuC,CAAgC,CAC7C,CAEO,IAAM25B,GAAsBjiC,EAAG,CAAC,KAAIgiC,EAAA,CAAC,ECd5C,SAASE,GACLC,EAAyBC,EAAsB,OAC7CC,EAAQxU,EAAgBsU,EAAM,OAAQ,KAAK,EAC3CG,EAAOzU,EAAgBuU,EAAK,MAAO,KAAK,EAC5C5/B,EAAAlC,EAAgBymB,GAAesb,EAAOC,CAAI,EAAC,CAAA,EAA1CD,EAAK7/B,EAAA,CAAA,EAAE8/B,EAAI9/B,EAAA,CAAA,EAEZ,IAAMuD,EAAoB,CAAC,EAAGs8B,EAAO,EAAGC,CAAI,EAE5C,OAAOxZ,EAAO,UAAUvT,GAAKxP,CAAmC,CAClE,CAEO,IAAMw8B,GAAsBviC,EAAG,CAAC,KAAIkiC,EAAA,CAAC,ECzCtC,SAAUM,GACZn5B,EAAyCX,EACzCslB,EAAyB1kB,EAAgB,CAC3C,GAAIA,GAAS,KACXA,EAAQ4C,GAAW7C,CAAM,UAChBC,IAAU,YACnB,MAAM,IAAI,MACN,kFACoC,EAG1C,GAAIwd,GAAazd,CAAM,GAAKwd,GAAYxd,CAAM,EAAG,CAC/C,GAAIC,IAAU,WAAaA,IAAU,QACnC,MAAM,IAAI,MACN,+CACA,+CAA+C,OAAAA,EAAQ,GAAA,CAAA,EAE7D,OAAOwf,EAAO,QAAQ,wBAClBzf,EAAQX,GAASslB,EAAe1kB,CAAK,CAC1C,CAED,GAAI,CAACqW,GAAatW,CAAM,GAAK,CAAC,MAAM,QAAQA,CAAM,GAC9C,OAAOA,GAAW,UAAY,OAAOA,GAAW,WAChD,OAAOA,GAAW,SACpB,MAAM,IAAI,MACN,0HACuD,EAG7D,GAAIX,GAAS,KAAM,CACjBwE,GAAmCxE,CAAK,EAExC,IAAM+5B,EAAet4B,GAAczB,CAAK,EAClCg6B,EAAev4B,GAAc6jB,CAAa,EAChDvkB,EACIg5B,IAAiBC,EACjB,UACI,CAAA,MAAA,iCAAiC,OAAAh6B,EAAiC,4BAAA,EAClE,GAAA,OAAG+5B,EAA+B,kBAAA,EAAA,OAAAC,CAAY,CAD9C,CACgD,EAExD,QAASriC,EAAI,EAAGA,EAAI2tB,EAAc,OAAQ,EAAE3tB,EAAG,CAC7C,IAAMsiC,EAAW3U,EAAc3tB,CAAC,EAC1BuiC,EAAoBviC,IAAM2tB,EAAc,OAAS,EACnD2U,IAAax4B,GAAczB,EAAM,MAAMrI,CAAC,CAAC,EACzC,GACJoJ,EACIukB,EAAc3tB,CAAC,IAAMqI,EAAMrI,CAAC,GAAK,CAACuiC,EAClC,UAAA,CAAM,MAAA,+CACF,IAAA,OAAI5U,EAA6C,gCAAA,EACjD,UAAA,OAAUtlB,EAAK,KAAA,CAFb,CAEkB,CAC7B,CACF,CAED,MAAI,CAACiX,GAAatW,CAAM,GAAK,CAAC,MAAM,QAAQA,CAAM,IAChDA,EAAS,CAACA,CAAM,GAGlBX,EAAQA,GAASslB,EACjB3kB,EAASC,IAAU,SACf6V,GAAa9V,EAAQC,CAAK,EAC1B8V,GAAQ/V,EAAoB,CAAA,EAAI,EAAI,EACjCyf,EAAO,WAAWzf,EAAsBX,EAAOY,CAAK,CAC7D,CCjDgB,SAAAu5B,GACZ/jC,EAAyCwK,EAAgB,CAC3D,IAAMqW,GAAa7gB,CAAK,GAAKwK,IAAU,UAAa,MAAM,QAAQxK,CAAK,IACnEwK,IAAU,YACZ,MAAM,IAAI,MACN,gFACyB,EAE/B,GAAIA,IAAU,UAAYqW,GAAa7gB,CAAK,GACxC,EAAEA,aAAiB,YACrB,MAAM,IAAI,MACN,2EACiC,EAEvC,IAAM4J,EAAkB,CAAA,EAClBslB,EAA0B,CAAA,EAChC,OAAOwU,GAAW1jC,EAAO4J,EAAOslB,EAAe1kB,CAAK,CACtD,CChBA,SAASw5B,GAAwBh3B,EAAe,CAC9C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,OAAQ,SAAS,EAE9C/F,EAAqB,CAAC,EAAGyoB,CAAE,EAEjC,OAAO1F,EAAO,UAAU3R,GAAMpR,CAAmC,CACnE,CACO,IAAMg9B,GAAuB/iC,EAAG,CAAC,MAAK8iC,EAAA,CAAC,ECV9C,SAASE,GAA0Bl3B,EAAe,CAChD,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,QAAQ,EACrCxD,EAAQ,CAAA,EACd,OAAOwgB,EAAO,UAAU,SAAU,CAAC,EAAG0F,CAAE,EAAGlmB,CAAK,CAClD,CAEO,IAAM26B,GAAyBjjC,EAAG,CAAC,QAAOgjC,EAAA,CAAC,ECgBlD,SAASE,GACLp3B,EAAsBnB,EAA8B2kB,EAAgB,CAA9C3kB,IAAA,SAAAA,EAA4B,MAAE2kB,IAAA,SAAAA,EAAgB,IACtE,IAAId,EAAKX,EAAgB/hB,EAAG,IAAK,KAAK,EAClC0iB,EAAG,QAAU,SACfA,EAAKkC,GAAKlC,EAAI,OAAO,GAGvB,IAAMzoB,EAAoB,CAAC,EAAGyoB,CAAE,EAC1BlmB,EAAkB,CAAC,KAAIqC,EAAE,SAAQ2kB,CAAA,EAEvC,OAAOxG,EAAO,UACV1R,GAAKrR,EACLuC,CAAgC,CACtC,CAEO,IAAM66B,GAAsBnjC,EAAG,CAAC,KAAIkjC,EAAA,CAAC,ECA5C,SAASE,GACLt3B,EAAsBu3B,EACtB14B,EAA8B2kB,EAAgB,CADxB+T,IAAA,SAAAA,EAA2C,aACjE14B,IAAA,SAAAA,EAA4B,MAAE2kB,IAAA,SAAAA,EAAgB,IAChDxjB,EAAI+hB,EAAgB/hB,EAAG,IAAK,MAAM,EAElC,IAAMw3B,EAAOC,GAASz3B,EAAGu3B,EAAK14B,CAAI,EAC9B64B,EAAgBF,EAAK,MACzB,GAAIhU,EAAU,CACZ,IAAMpkB,EAAOR,GAAeC,EAAMmB,EAAE,KAAK,EACzC03B,EAAgBC,GAA+BH,EAAK,MAAOp4B,CAAI,CAChE,CACD,OAAOqpB,EAAQ+O,EAAME,CAAa,CACpC,CAEA,SAASD,GACLz3B,EAAWzN,EAAkBsM,EAA4B,CAC3D,GAD+BA,IAAA,SAAAA,EAA4B,MACvDmB,EAAE,OAAS,EACb,OAAO2iB,GAAI3iB,CAAC,EAId,GAAIA,EAAE,OAAS,GAAKnB,IAAS,KAC3B,OAAO44B,GAAShP,EAAQzoB,EAAG,CAAC,EAAE,CAAC,EAAGzN,EAAGsM,CAAI,EAI3C,GAAImB,EAAE,OAAS,GAAK,OAAOnB,GAAS,UAChC,MAAM,QAAQA,CAAI,GAAKA,EAAK,SAAW,EAAG,CAC5C,GAAItM,IAAM,EACR,OAAO8kC,GAAI1U,GAAI3iB,CAAC,EAAGnB,CAAI,EAEzB,GAAItM,IAAM,IACR,OAAO0jC,GAAItT,GAAI3iB,CAAC,EAAGnB,CAAI,EAEzB,GAAItM,IAAM,KACR,OAAO4jC,GAAIxT,GAAI3iB,CAAC,EAAGnB,CAAI,EAEzB,GAAItM,IAAM,aAAeA,IAAM,EAE7B,OAAO0kC,GAAKI,GAAIZ,GAAI9T,GAAI3iB,CAAC,EAAG+2B,GAAO,EAAG,OAAO,CAAC,EAAGl4B,CAAI,CAAC,EAGxD,MAAM,IAAI,MAAM,qCAAA,OAAqCtM,CAAC,CAAE,CACzD,CAGD,GAAI,MAAM,QAAQsM,CAAI,GAAKA,EAAK,SAAW,EAAG,CAC5C,GAAItM,IAAM,EACR,OAAO0jC,GAAIoB,GAAI1U,GAAI3iB,CAAC,EAAGnB,EAAK,CAAC,CAAC,EAAGA,EAAK,CAAC,EAAI,CAAC,EAE9C,GAAItM,IAAM,IACR,OAAO0jC,GAAIoB,GAAI1U,GAAI3iB,CAAC,EAAGnB,EAAK,CAAC,CAAC,EAAGA,EAAK,CAAC,CAAC,EAE1C,GAAItM,IAAM,KACR,OAAO4jC,GAAIkB,GAAI1U,GAAI3iB,CAAC,EAAGnB,EAAK,CAAC,CAAC,EAAGA,EAAK,CAAC,CAAC,EAE1C,GAAItM,IAAM,OAASA,IAAM,YAEvB,OAAO0kC,GAAKI,GAAIF,GAAOn3B,CAAC,EAAGnB,CAAI,CAAC,EAGlC,MAAM,IAAI,MAAM,qCAAA,OAAqCtM,CAAC,CAAE,CACzD,CAED,MAAM,IAAI,MAAM,gCAAA,OAAgCsM,CAAI,CAAE,CACxD,CAEO,IAAM24B,GAAuBtjC,EAAG,CAAC,MAAKojC,EAAA,CAAC,EC7F9C,SAASM,GACL53B,EAAsBnB,EACtB2kB,EAAgB,CADM,OAAA3kB,IAAA,SAAAA,EAA4B,MAClD2kB,IAAA,SAAAA,EAAgB,IACXgU,GAAKx3B,EAAG,YAAanB,EAAM2kB,CAAQ,CAC5C,CAEO,IAAMqU,GAAgC3jC,EAAG,CAAC,eAAc0jC,EAAA,CAAC,ECdhE,SAASE,GAAuB93B,EAAe,CAC7C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,KAAK,EAElC/F,EAAoB,CAAC,EAAGyoB,CAAE,EAChC,OAAO1F,EAAO,UAAUzW,GAAKtM,CAAmC,CAClE,CACO,IAAMq8B,GAAsBpiC,EAAG,CAAC,KAAI4jC,EAAA,CAAC,ECA5C,SAASC,GAA8B/3B,EAAsBnB,EAAQ,CAARA,IAAA,SAAAA,EAAQ,GACnE,IAAM6jB,EAAKX,EAAgB/hB,EAAG,IAAK,aAAc,mBAAmB,EAEpEgZ,EAAYna,GAAQ6jB,EAAG,KAAM,UAAA,CAAM,MAAA,oCAAA,CAAoC,EAEvE,IAAMzoB,EAA2B,CAAC,MAAOyoB,CAAE,EACrClmB,EAAyB,CAAC,IAAKqC,CAAI,EAEzC,OAAOme,EAAO,UACVxW,GAAYvM,EACZuC,CAAgC,CACtC,CAEO,IAAMw7B,GAA6B9jC,EAAG,CAAC,YAAW6jC,EAAA,CAAC,EClB1D,SAASE,GAAyBj4B,EAAe,CAC/C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,OAAO,EAEpC/F,EAAsB,CAAC,EAAGyoB,CAAE,EAClC,OAAO1F,EAAO,UAAUvW,GAAOxM,CAAmC,CACpE,CACO,IAAMi+B,GAAwBhkC,EAAG,CAAC,OAAM+jC,EAAA,CAAC,ECQhD,SAASE,GAAwBn4B,EAAiB2tB,EAAc,CAC9D,IAAMjL,EAAKX,EAAgB/hB,EAAG,IAAK,OAAQ,mBAAmB,EAC9DgZ,EACI0J,EAAG,OAASiL,EAAK,OACjB,UAAM,CAAA,MAAA,qCAAA,OAAqCjL,EAAG,KAAO,GAAA,EACjD,6BAAA,OAA6BiL,EAAI,GAAA,CAD/B,CACkC,EAE5C,IAAM1zB,EAAqB,CAAC,EAAGyoB,CAAE,EAC3BlmB,EAAmB,CAAC,KAAImxB,CAAA,EAE9B,OAAO3Q,EAAO,UACVxQ,GAAMvS,EACNuC,CAAgC,CACtC,CAEO,IAAM47B,GAAuBlkC,EAAG,CAAC,MAAKikC,EAAA,CAAC,EC5B9C,SAASE,GACLC,EAAiBC,EACjBC,EAKAh7B,EAA2B,CAA3BA,IAAA,SAAAA,EAA2B,WACzB+6B,GAAc,OAChBA,EAAaD,GAIf,QAFMG,EAAO5K,GAAO,CAACyK,EAASC,CAAU,EAAG/6B,CAAK,EAC1CxJ,EAAIskC,GAAWC,EAAaD,EAAUC,EACnChkC,EAAI,EAAGA,EAAIP,EAAG,EAAEO,EACvBkkC,EAAK,IAAI,EAAGlkC,EAAGA,CAAC,EAElB,IAAM0pB,EAAgBwK,EAAQgQ,EAAK,SAAQ,EAAI,CAACH,EAASC,CAAU,CAAC,EACpE,GAAIC,GAAc,KAChB,OAAOva,EAEP,GAAIua,EAAW,SAAW,EACxB,OAAOJ,GAAKJ,GAAW/Z,EAAK,CAAC,EAAG,CAACua,EAAW,CAAC,EAAG,EAAG,CAAC,CAAC,EAChD,GAAIA,EAAW,SAAW,EAE/B,OAAOJ,GACIJ,GAAWA,GAAW/Z,EAAK,CAAC,EAAG,CAAC,EAChC,CAACua,EAAW,CAAC,EAAGA,EAAW,CAAC,EAAG,EAAG,CAAC,CAAC,EAC1C,GAAIA,EAAW,SAAW,EAE/B,OAAOJ,GAAKJ,GAAWA,GAAWA,GAAW/Z,EAAK,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CACrDua,EAAW,CAAC,EAAGA,EAAW,CAAC,EAAGA,EAAW,CAAC,EAAG,EAAG,CACjD,CAAA,EAER,MAAM,IAAI,MACN,2CAEA,6BAAA,OAA8BA,EAAmB,OAAM,IAAA,CAAI,CAGrE,CAEO,IAAME,GAAsBxkC,EAAG,CAAC,KAAImkC,EAAA,CAAC,EC5C5C,SAASM,GAAyB34B,EAAe,CAC/C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,QAAS,SAAS,EAE/C/F,EAAsB,CAAC,EAAGyoB,CAAE,EAClC,OAAO1F,EAAO,UAAUnW,GAAO5M,CAAmC,CACpE,CACO,IAAM2+B,GAAwB1kC,EAAG,CAAC,OAAMykC,EAAA,CAAC,ECUhD,SAASE,GACL74B,EAAiBwhB,EAA4B3iB,EAAUi6B,EAAa,CAAvBj6B,IAAA,SAAAA,EAAQ,GAAEi6B,IAAA,SAAAA,EAAa,GACtE,IAAMpW,EAAKX,EAAgB/hB,EAAG,IAAK,QAAQ,EACrC+4B,EAAWhX,EAAgBP,EAAS,UAAW,SAAU,OAAO,EAEhEvnB,EAAyB,CAAC,EAAGyoB,EAAI,QAASqW,CAAQ,EAClDv8B,EAAuB,CAAC,KAAIqC,EAAE,UAASi6B,CAAA,EAE7C,OAAO9b,EAAO,UACVhW,GAAU/M,EACVuC,CAAgC,CACtC,CAEO,IAAMw8B,GAAyB9kC,EAAG,CAAC,QAAO2kC,EAAA,CAAC,ECxBlD,SAASI,GACL76B,EAAsB9L,EAAoB,OACxC2wB,EAAKlB,EAAgB3jB,EAAG,IAAK,UAAW,mBAAmB,EAC3D8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,UAAW,mBAAmB,EAC/DoE,EAAAlC,EAAWymB,GAAegI,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAEvsB,EAAA,CAAA,EAAEwsB,EAAExsB,EAAA,CAAA,EAEPw8B,GAA2BjQ,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMjpB,EAAwB,CAAC,EAAGgpB,EAAI,EAAGC,CAAE,EAE3C,OAAOlG,EAAO,UAAU9V,GAASjN,CAAmC,CACtE,CAEO,IAAMi/B,GAA0BhlC,EAAG,CAAC,SAAQ+kC,EAAA,CAAC,ECbpD,SAASE,GACL/6B,EAAsB9L,EAAoB,OACxC2wB,EAAKlB,EAAgB3jB,EAAG,IAAK,eAAgB,mBAAmB,EAChE8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,eAAgB,mBAAmB,EACpEoE,EAAAlC,EAAWymB,GAAegI,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAEvsB,EAAA,CAAA,EAAEwsB,EAAExsB,EAAA,CAAA,EAEPw8B,GAA2BjQ,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMjpB,EAA6B,CAAC,EAAGgpB,EAAI,EAAGC,CAAE,EAEhD,OAAOlG,EAAO,UAAU7V,GAAclN,CAAmC,CAC3E,CAEO,IAAMm/B,GAA+BllC,EAAG,CAAC,cAAailC,EAAA,CAAC,ECjB9D,SAASE,GAAwBt+B,EAAmB,CAClD,IAAMu+B,EAASvX,EAAgBhnB,EAAO,QAAS,MAAM,EAE/Cd,EAAqB,CAAC,MAAOq/B,CAAM,EACzC,OAAOtc,EAAO,UAAU1V,GAAMrN,CAAmC,CACnE,CAEO,IAAMu0B,GAAuBt6B,EAAG,CAAC,MAAKmlC,EAAA,CAAC,ECP9C,SAASE,GAA4Bv5B,EAAe,CAClD,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,UAAU,EAEvC/F,EAAyB,CAAC,EAAGyoB,CAAE,EAErC,OAAO1F,EAAO,UAAUzV,GAAUtN,CAAmC,CACvE,CACO,IAAMu/B,GAA2BtlC,EAAG,CAAC,UAASqlC,EAAA,CAAC,ECPtD,SAASE,GAAyBz5B,EAAe,CAC/C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,OAAO,EAEpC/F,EAAsB,CAAC,EAAGyoB,CAAE,EAElC,OAAO1F,EAAO,UAAUxV,GAAOvN,CAAmC,CACpE,CACO,IAAMy/B,GAAwBxlC,EAAG,CAAC,OAAMulC,EAAA,CAAC,ECPhD,SAASE,GAAyB35B,EAAe,CAC/C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,OAAO,EACpC/F,EAAsB,CAAC,EAAGyoB,CAAE,EAElC,OAAO1F,EAAO,UAAUvV,GAAOxN,CAAmC,CACpE,CACO,IAAM2/B,GAAwB1lC,EAAG,CAAC,OAAMylC,EAAA,CAAC,ECAhD,SAASE,GAA6B75B,EAAiB85B,EAAW,CAAXA,IAAA,SAAAA,EAAW,IAChE,IAAMpX,EAAKX,EAAgB/hB,EAAG,IAAK,WAAW,EAExC/F,EAA0B,CAAC,EAAGyoB,CAAE,EAChClmB,EAAwB,CAAC,MAAKs9B,CAAA,EAEpC,OAAO9c,EAAO,UACVtV,GAAWzN,EACXuC,CAAgC,CACtC,CAEO,IAAMu9B,GAA4B7lC,EAAG,CAAC,WAAU2lC,EAAA,CAAC,ECdxD,SAASG,GACL57B,EAAsB9L,EAAoB,OACxC2wB,EAAKlB,EAAgB3jB,EAAG,IAAK,OAAQ,mBAAmB,EACxD8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,OAAQ,mBAAmB,EAC5DoE,EAAAlC,EAAWymB,GAAegI,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAEvsB,EAAA,CAAA,EAAEwsB,EAAExsB,EAAA,CAAA,EAEPw8B,GAA2BjQ,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMjpB,EAAqB,CAAC,EAAGgpB,EAAI,EAAGC,CAAE,EAExC,OAAOlG,EAAO,UAAUrV,GAAM1N,CAAmC,CACnE,CAEO,IAAMggC,GAAuB/lC,EAAG,CAAC,MAAK8lC,EAAA,CAAC,ECZ9C,SAASE,GACL97B,EAAsB9L,EAAoB,OACxC2wB,EAAKlB,EAAgB3jB,EAAG,IAAK,YAAa,mBAAmB,EAC7D8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,YAAa,mBAAmB,EACjEoE,EAAAlC,EAAWymB,GAAegI,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAEvsB,EAAA,CAAA,EAAEwsB,EAAExsB,EAAA,CAAA,EAEPw8B,GAA2BjQ,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMjpB,EAA0B,CAAC,EAAGgpB,EAAI,EAAGC,CAAE,EAE7C,OAAOlG,EAAO,UAAUpV,GAAW3N,CAAmC,CACxE,CAEO,IAAMkgC,GAA4BjmC,EAAG,CAAC,WAAUgmC,EAAA,CAAC,WCrBxCE,GAASlkC,EAAemkC,EAAc36B,EAAW,CAC/D,GAAIA,GAAO,EACT,MAAM,IAAI,MAAM,0CAA0C,EAG5D,IAAMlD,EAAuB,CAAC,MAAKtG,EAAE,KAAImkC,EAAE,IAAG36B,CAAA,EAC9C,OAAOsd,EAAO,UAAUnV,GAAU,CAAA,EAAIrL,CAAgC,CACxE,CCGA,SAAS89B,GACLt6B,EAAiBu6B,EAAiBC,EAAUV,EAAWW,EAAU,CAAhDF,IAAA,SAAAA,EAAe,GAAEC,IAAA,SAAAA,EAAQ,GAAEV,IAAA,SAAAA,EAAS,GAAEW,IAAA,SAAAA,EAAU,IACnE,IAAM/X,EAAKX,EAAgB/hB,EAAG,IAAK,4BAA4B,EAC/DgZ,EACI0J,EAAG,OAAS,GAAKA,EAAG,OAAS,EAC7B,UAAM,CAAA,MAAA;sBACU,OAAAA,EAAG,KAAO,GAAA,CAAA,CAAA,EAC9B1J,EACIuP,GAAWgS,CAAW,EACtB,UAAM,CAAA,MAAA,+DACF,+BAAA,OAA+BA,EAAW,GAAA,CADxC,CAC2C,EAErD,IAAI3R,EAAMlG,EACNmG,EAAe,GACfnG,EAAG,OAAS,IACdmG,EAAe,GACfD,EAAMH,EAAQ/F,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAG9D,IAAMzoB,EAAoB,CAAC,EAAG2uB,CAAG,EAE3BpsB,EAAkB,CAAC,YAAW+9B,EAAE,KAAIC,EAAE,MAAKV,EAAE,KAAIW,CAAA,EAGjDnoB,EAAM0K,EAAO,UACH7U,GAAKlO,EACLuC,CAAgC,EAEhD,OAAIqsB,EACKJ,EAAQnW,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAEvDA,CAEX,CAEO,IAAMooB,GAA6CxmC,EAAG,CAAC,4BAA2BomC,EAAA,CAAC,ECzC1F,SAASK,GAAuB36B,EAAe,CAC7C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,MAAO,SAAS,EAE7C/F,EAAoB,CAAC,EAAGyoB,CAAE,EAChC,OAAO1F,EAAO,UAAUlV,GAAK7N,CAAmC,CAClE,CACO,IAAM2gC,GAAsB1mC,EAAG,CAAC,KAAIymC,EAAA,CAAC,ECL5C,SAASE,GAAyB76B,EAAe,CAC/C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,OAAO,EAEpC/F,EAAsB,CAAC,EAAGyoB,CAAE,EAClC,OAAO1F,EAAO,UAAUjV,GAAO9N,CAAmC,CACpE,CACO,IAAM6gC,GAAwB5mC,EAAG,CAAC,OAAM2mC,EAAA,CAAC,ECwUhD,SAASE,GAA6BnnC,EAAwB,CAE5D,OAAOopB,EAAO,WAAWppB,CAAC,CAC5B,CCjVA,SAASonC,GAAuBh7B,EAAe,CAC7C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,KAAK,EAElC/F,EAAoB,CAAC,EAAGyoB,CAAE,EAChC,OAAO1F,EAAO,UAAUhU,GAAK/O,CAAmC,CAClE,CACO,IAAMghC,GAAsB/mC,EAAG,CAAC,KAAI8mC,EAAA,CAAC,ECP5C,SAASE,GAA4Bl7B,EAAe,CAClD,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,UAAU,EAEvC/F,EAAyB,CAAC,EAAGyoB,CAAE,EACrC,OAAO1F,EAAO,UAAU5R,GAAUnR,CAAmC,CACvE,CACO,IAAMkhC,GAA2BjnC,EAAG,CAAC,UAASgnC,EAAA,CAAC,ECHtD,SAASE,GAA8Bp7B,EAAe,CACpD,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,YAAY,EAKzCq7B,EAAWN,GAAW,SAAC/6B,EAAS,CAIpC,IAAMhN,EAAQioC,GAAIE,GAASF,GAAIj7B,CAAC,CAAC,CAAC,EAE5Bs7B,EAAW,SAACpe,EAAK,CACrB,IAAMqe,EAAO1R,GAAI3M,EAAI6M,GAAQkR,GAAIj7B,CAAC,CAAC,CAAC,EACpC,OAAOu7B,CACT,EACA,MAAO,CAAC,MAAKvoC,EAAE,SAAQsoC,CAAA,CACzB,CAAC,EAED,OAAOD,EAAS3Y,CAAE,CACpB,CACO,IAAM8Y,GAA6BtnC,EAAG,CAAC,YAAWknC,EAAA,CAAC,ECb1D,SAASK,GAAuBr9B,EAAsB9L,EAAoB,OACpE2wB,EAAKlB,EAAgB3jB,EAAG,IAAK,KAAK,EAClC8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,KAAK,EACtCoE,EAAAlC,EAAWymB,GAAegI,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAEvsB,EAAA,CAAA,EAAEwsB,EAAExsB,EAAA,CAAA,EAEP,IAAMuD,EAAoB,CAAC,EAAGgpB,EAAI,EAAGC,CAAE,EAEvC,OAAOlG,EAAO,UAAU3Q,GAAKpS,CAAmC,CAClE,CAEO,IAAMyhC,GAAsBxnC,EAAG,CAAC,KAAIunC,EAAA,CAAC,ECL5C,SAASE,GAA8BC,EAAsB/8B,EAAS,CAATA,IAAA,SAAAA,EAAA,IAC3D,IAAMg9B,EAAU9Z,EAAgB6Z,EAAQ,SAAU,YAAY,EAK9D,GAHI/8B,IAAS,KACXA,EAAOg9B,EAAQ,KAAO,GAEpBh9B,IAASg9B,EAAQ,KAAO,EAC1B,MAAM,MACF,gEACA,mBAAA,OAAmBA,EAAQ,KAAI,gBAAA,EAAA,OAAiBh9B,CAAI,CAAE,EAe5D,IAAMw8B,EAAWN,GAAW,SAACa,EAAgB7a,EAAkB,CAC7D,IAAMyC,EAAW,GACXsY,EAAO7F,GAAI2F,EAAQ/8B,EAAM,EAAI,EAC7Bk9B,EAAUL,GAAIE,EAAQE,CAAI,EAC1B9oC,EACF0oC,GAAI9W,GAAKmX,EAAS,SAAS,EAAGnB,GAAIvD,GAAIf,GAAIyF,CAAO,EAAGl9B,EAAM2kB,CAAQ,CAAC,CAAC,EACxEzC,EAAK,CAAC/tB,CAAK,CAAC,EAEZ,IAAMsoC,EAAW,SAACpe,EAAYE,EAAe,CACrC,IAAA1mB,EAAAlC,EAAU4oB,EAAK,CAAA,EAAdpqB,EAAK0D,EAAA,CAAA,EACN8sB,EAAW,GACXwY,EAAU1F,GAAItjC,CAAK,EACzB,OAAO0oC,GAAIxe,EAAI2M,GAAIwN,GAAIna,EAAIre,EAAM2kB,CAAQ,EAAGwY,CAAO,CAAC,CACtD,EACA,MAAO,CAAC,MAAKhpC,EAAE,SAAQsoC,CAAA,CACzB,CAAC,EAED,OAAOD,EAASQ,CAAO,CAQzB,CAEO,IAAMI,GAA6B/nC,EAAG,CAAC,YAAWynC,EAAA,CAAC,EC5C1D,SAASO,GACLl8B,EAAsBnB,EAA8B2kB,EAAgB,CAA9C3kB,IAAA,SAAAA,EAA4B,MAAE2kB,IAAA,SAAAA,EAAgB,IACtE,IAAMd,EAAKX,EAAgB/hB,EAAG,IAAK,WAAW,EAExCZ,EAAOR,GAAeC,EAAM6jB,EAAG,KAAK,EACpCoZ,EAAO7F,GAAIvT,EAAItjB,EAAM,EAAI,EACzBhB,EAAIs9B,GAAIhZ,EAAIoZ,CAAI,EAChBxpC,EAAIgkC,GAAIl4B,CAAC,EACT2C,EAAIs2B,GAAI/kC,EAAG8M,CAAI,EACf/M,EAAIuoC,GAAI75B,CAAC,EACTuR,EAAMkE,GAAIiS,EAAQqT,EAAMzpC,EAAE,KAAK,EAAGA,CAAC,EAEzC,GAAImxB,EAAU,CACZ,IAAMvkB,EAAW62B,GAAqBxjB,EAAI,MAAOlT,CAAI,EACrD,OAAOqpB,EAAQnW,EAAKrT,CAAQ,CAC7B,CACD,OAAOqT,CACT,CAEO,IAAM6pB,GAA4BjoC,EAAG,CAAC,WAAUgoC,EAAA,CAAC,ECvCxD,SAASE,GACLh+B,EAAsB9L,EAAoB,CAC5C,IAAM2wB,EAAKlB,EAAgB3jB,EAAG,IAAK,aAAc,MAAM,EACjD8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,aAAc,MAAM,EACvD4gC,GAA2BjQ,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMjpB,EAA2B,CAAC,EAAGgpB,EAAI,EAAGC,CAAE,EAE9C,OAAOlG,EAAO,UAAUhV,GAAY/N,CAAmC,CACzE,CAEO,IAAMoiC,GAA6BnoC,EAAG,CAAC,YAAWkoC,EAAA,CAAC,ECd1D,SAASE,GAA8Bt8B,EAAe,CACpD,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,aAAc,MAAM,EACjD/F,EAA2B,CAAC,EAAGyoB,CAAE,EACvC,OAAO1F,EAAO,UAAU/U,GAAYhO,CAAmC,CACzE,CAEO,IAAMsiC,GAA6BroC,EAAG,CAAC,YAAWooC,EAAA,CAAC,ECJ1D,SAASE,GACLp+B,EAAsB9L,EAAoB,CAC5C,IAAM2wB,EAAKlB,EAAgB3jB,EAAG,IAAK,YAAa,MAAM,EAChD8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,YAAa,MAAM,EACtD4gC,GAA2BjQ,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMjpB,EAA0B,CAAC,EAAGgpB,EAAI,EAAGC,CAAE,EAC7C,OAAOlG,EAAO,UAAU9U,GAAWjO,CAAmC,CACxE,CACO,IAAMwiC,GAA4BvoC,EAAG,CAAC,WAAUsoC,EAAA,CAAC,ECPxD,SAASE,GACLt+B,EAAsB9L,EAAoB,CAC5C,IAAM2wB,EAAKlB,EAAgB3jB,EAAG,IAAK,aAAc,MAAM,EACjD8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,aAAc,MAAM,EACvD,OAAA4gC,GAA2BjQ,EAAG,MAAOC,EAAG,KAAK,EAGtCmZ,GAAWI,GAAUr+B,EAAG9L,CAAC,EAAGiqC,GAAWF,GAAWj+B,EAAG9L,CAAC,CAAC,CAAC,CACjE,CAEO,IAAMqqC,GAA6BzoC,EAAG,CAAC,YAAWwoC,EAAA,CAAC,EC1B1D,IAAME,GAAY,WAqDlB,SAASC,GACLC,EAAmCv/B,EACnCw/B,EAA6B,CAA7BA,IAAA,SAAAA,EAA6B,QAC/B,IAAMC,EACFjb,EAAgB+a,EAAgB,iBAAkB,cAAc,EAC9DG,EAAUlb,EAAgBxkB,EAAQ,SAAU,cAAc,EAE1D2/B,EAAeF,EAAgB,MAAMA,EAAgB,MAAM,OAAS,CAAC,EACrEG,EAAaF,EAAQ,MAAMA,EAAQ,MAAM,OAAS,CAAC,EACnDG,EAAoB3U,EAAQuU,EAAiB,CAAC,GAAIE,CAAY,CAAC,EAC/DG,EAAY5U,EAAQwU,EAAS,CAAC,GAAIE,CAAU,CAAC,EAEnD,GAAIC,EAAkB,KAAO,EAC3B,MAAM,IAAI,MAAM,sDAAsD,EAExE,GAAIA,EAAkB,MAAM,CAAC,IAAMC,EAAU,MAAM,CAAC,EAClD,MAAM,IAAI,MACN,gEAAgE,EAEtE,GAAIh/B,GAAcg/B,EAAU,KAAK,GAAKT,GACpC,MAAM,IAAI,MAAM,qCAAA,OAAqCA,EAAS,CAAE,EAElE,GAAIQ,EAAkB,MAAM,CAAC,GAAKR,GAChC,MAAM,IAAI,MAAM,oCAAA,OACZA,GAAwC,8BAAA,EAAA,OAAAQ,EAAkB,MAAM,CAAC,CAAC,CAAE,EAG1E,IAAMnjC,EAA6B,CACjC,eAAgBmjC,EAChB,OAAQC,GAEJ7gC,EAA2B,CAAC,KAAIugC,CAAA,EAEtC,OAAO/f,EAAO,UAAUpS,GAAc3Q,EAAcuC,CAAW,CACjE,CAEO,IAAM8gC,GAA+BppC,EAAG,CAAC,cAAa2oC,EAAA,CAAC,EC/C9C,SAAAU,GACZT,EAAmCv/B,EAAyB,CAC9D,OAAO+/B,GAAaR,EAAgBv/B,EAAQ,MAAM,CACpD,CChBA,SAASigC,GACLx9B,EAAiB+kB,EACjBxkB,EACA1I,EACAywB,EAAwC,CAC1C,IAAM5F,EAAKX,EAAgB/hB,EAAG,IAAK,SAAS,EACtCglB,EAAY,EAEd4D,EAAMlG,EACNmG,EAAe,GACfnG,EAAG,OAAS,IACdmG,EAAe,GACfD,EAAMH,EAAQ/F,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAG9D1J,EACI4P,EAAI,OAAS,EACb,UAAA,CAAM,MAAA,uDAAA,OAAuDA,EAAI,KAAI,GAAA,CAA/D,CAAkE,EAC5E5P,EACI2P,GAAyCpoB,EAASykB,CAAS,EAC3D,UAAA,CAAM,MAAA,4DACF,eAAA,OAAezkB,EAA0B,kBAAA,EAAA,OAAAykB,EAAS,GAAA,CADhD,CACmD,EAC7D8D,GAAoC,UAAWjxB,EAAKywB,CAAe,EACnE,IAAMruB,EAAwB,CAAC,EAAG2uB,CAAG,EAC/BpsB,EAAsB,CAAC,WAAUuoB,EAAE,QAAOxkB,EAAE,IAAG1I,EAAE,gBAAeywB,CAAA,EAGhEhW,EAAM0K,EAAO,UACH1U,GAASrO,EACTuC,CAAgC,EAEhD,OAAIqsB,EACKJ,EAAQnW,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAEzDA,CACT,CAEO,IAAMmrB,GAA0BvpC,EAAG,CAAC,SAAQspC,EAAA,CAAC,EC3BpD,SAASE,GACL19B,EAAiB+kB,EACjBxkB,EAA0C1I,EAC1CywB,EACApD,EAAqC,CAHpBH,IAAA,SAAAA,EAA+C,CAAA,EAAG,EAAG,CAAC,GAGvEG,IAAA,SAAAA,EAAqC,SACvC,IAAMxC,EAAKX,EAAgB/hB,EAAG,IAAK,WAAW,EAE1CipB,EAAMvG,EACNwG,EAAe,GACfxG,EAAG,OAAS,IACdwG,EAAe,GACfD,EAAMR,EAAQ/F,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAG3E1J,EACIiQ,EAAI,OAAS,EACb,UAAA,CAAM,MAAA,qDAAA,OAAqDA,EAAI,KAAI,GAAA,CAA7D,CAAgE,EAC1EjQ,EACIkM,IAAe,QACf,UAAM,CAAA,MAAA,0DACF,yBAAA,OAAyBA,CAAU,CADjC,CACmC,EAC7CkD,GAA0B,YAAavwB,EAAKywB,CAAe,EAC3D,IAAMruB,EAA0B,CAAC,EAAGgvB,CAAG,EACjCzsB,EACe,CAAC,WAAUuoB,EAAE,QAAOxkB,EAAE,IAAG1I,EAAE,gBAAeywB,EAAE,WAAUpD,CAAA,EAGrE5S,EAAM0K,EAAO,UACHzU,GAAWtO,EACXuC,CAAgC,EAEhD,OAAI0sB,EACKT,EACInW,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAInEA,CACT,CAEO,IAAMqrB,GAA4BzpC,EAAG,CAAC,WAAUwpC,EAAA,CAAC,EC7CxD,SAASE,GACL59B,EAAiB+kB,EACjBxkB,EAAkC1I,EAClCgmC,EAA2B,CAA3BA,IAAA,SAAAA,EAA2B,IAC7B,IAAMnb,EAAKX,EAAgB/hB,EAAG,IAAK,mBAAmB,EAEhD/F,EAAkC,CAAC,EAAGyoB,CAAE,EACxClmB,EACuB,CAAC,WAAUuoB,EAAE,QAAOxkB,EAAE,IAAG1I,EAAE,oBAAmBgmC,CAAA,EAGrEtqC,EAASypB,EAAO,UACHxU,GAAmBvO,EACnBuC,CAAgC,EAEnD,MAAO,CAAC,OAAQjJ,EAAO,CAAC,EAAG,QAASA,EAAO,CAAC,CAAC,CAC/C,CAEO,IAAMuqC,GAAoC5pC,EAAG,CAAC,mBAAkB0pC,EAAA,CAAC,ECtBxE,SAASG,GACL3/B,EAAsB9L,EAAoB,OACxC2wB,EAAKlB,EAAgB3jB,EAAG,IAAK,SAAS,EACtC8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,SAAS,EAC1CoE,EAAAlC,EAAWymB,GAAegI,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAEvsB,EAAA,CAAA,EAAEwsB,EAAExsB,EAAA,CAAA,EAEHusB,EAAG,QAAU,SACfA,EAAK2B,GAAK3B,EAAI,OAAO,EACrBC,EAAK0B,GAAK1B,EAAI,OAAO,GAEvBgQ,GAA2BjQ,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMjpB,EAAwB,CAAC,EAAGgpB,EAAI,EAAGC,CAAE,EAE3C,OAAOlG,EAAO,UAAU3U,GAASpO,CAAmC,CACtE,CAEO,IAAM+jC,GAA0B9pC,EAAG,CAAC,SAAQ6pC,EAAA,CAAC,ECjBpD,SAASE,GACLj+B,EAAsBnB,EAA8B2kB,EAAgB,CAA9C3kB,IAAA,SAAAA,EAA4B,MAAE2kB,IAAA,SAAAA,EAAgB,IACtE,IAAMd,EAAKX,EAAgB/hB,EAAG,IAAK,MAAM,EAEnC/F,EAAqB,CAAC,EAAGyoB,CAAE,EAC3BlmB,EAAmB,CAAC,KAAIqC,EAAE,SAAQ2kB,CAAA,EAExC,OAAOxG,EAAO,UACVvU,GAAMxO,EACNuC,CAAgC,CACtC,CAEO,IAAMsvB,GAAuB53B,EAAG,CAAC,MAAK+pC,EAAA,CAAC,EC/B9B,SAAA/J,GACZt3B,EAAoBY,EAA2B,CAEjD,GAFsBA,IAAA,SAAAA,EAA2B,WACjD4D,GAAmCxE,CAAK,EACpCY,IAAU,YAAa,CACzB,IAAM+wB,EAAO2F,GAAMt3B,EAAO,SAAS,EAC7B4xB,EAAO0F,GAAMt3B,EAAO,SAAS,EACnC,OAAOgyB,GAAQL,EAAMC,CAAI,CAC1B,CACD,IAAMjxB,EAAS4D,GAAoB9C,GAAczB,CAAK,EAAGY,CAAK,EAC9D,OAAOwf,EAAO,WAAWzf,EAAQX,EAAOY,CAAK,CAC/C,CCTgB,SAAAkjB,GACZ9jB,EAAoBY,EAA2B,CAEjD,GAFsBA,IAAA,SAAAA,EAA2B,WACjD4D,GAAmCxE,CAAK,EACpCY,IAAU,YAAa,CACzB,IAAM+wB,EAAO7N,GAAK9jB,EAAO,SAAS,EAC5B4xB,EAAO0F,GAAMt3B,EAAO,SAAS,EACnC,OAAOgyB,GAAQL,EAAMC,CAAI,CAC1B,CACD,IAAMjxB,EAAS0D,GAAmB5C,GAAczB,CAAK,EAAGY,CAAK,EAC7D,OAAOwf,EAAO,WAAWzf,EAAQX,EAAOY,CAAK,CAC/C,UCQgB0gC,GACZl+B,EAAkBnM,EAAkB6C,EAAsB,KAAtBM,EAAoBN,IAAA,OAAA,CAAA,EAAEA,EAArBuL,EAAAjL,EAAA,SAAAmnC,EAAQl8B,IAAA,OAAG,KAAIA,EACtD,GAAIk8B,IAAa,MAAQA,IAAa,KACpC,MAAM,IAAI,UACN,GAAA,OAAGA,EAAQ,4CAAA,CAA4C,EAE7D,GAAIn+B,IAAM,OACR,MAAO,CAAA,EAET,IAAI0iB,EAAKX,EACL/hB,EAAG,IAAK,WAAYA,aAAa2Z,GAAS3Z,EAAE,MAAQ,SAAS,EAEjE,GAAInM,IAAM,OACR,MAAO,CAAC6uB,CAAE,EAEZ,IAAIuK,EAAKlL,EACLluB,EAAG,IAAK,WAAYA,aAAa8lB,GAAS9lB,EAAE,MAAQ,SAAS,EAE3DuqC,EAAI//B,GAAcqkB,EAAG,KAAK,EAC1B+H,EAAIpsB,GAAc4uB,EAAG,KAAK,EAEhC,OAAIkR,IAAa,MACfzb,EAAK+F,EAAQ/F,EAAI,CAAC,EAAG,EAAE,CAAC,EACxBuK,EAAKxE,EAAQwE,EAAI,CAAC,GAAI,CAAC,CAAC,EACjB,CACLtD,GAAOjJ,GAAK,CAAC+J,EAAG,CAAC,EAAG/H,EAAG,KAAK,EAAGA,CAAE,EACjCiH,GAAOsD,EAAIvM,GAAK,CAAC,EAAG0d,CAAC,EAAGnR,EAAG,KAAK,CAAC,KAIrCvK,EAAK+F,EAAQ/F,EAAI,CAAC,GAAI,CAAC,CAAC,EACxBuK,EAAKxE,EAAQwE,EAAI,CAAC,EAAG,EAAE,CAAC,EACjB,CACLtD,GAAOjH,EAAIhC,GAAK,CAAC,EAAG+J,CAAC,EAAG/H,EAAG,KAAK,CAAC,EACjCiH,GAAOjJ,GAAK,CAAC0d,EAAG,CAAC,EAAGnR,EAAG,KAAK,EAAGA,CAAE,GAErC,CCpCA,SAASoR,GACLjgC,EAAsB9L,EAAoB,OACxC2wB,EAAKlB,EAAgB3jB,EAAG,IAAK,SAAS,EACtC8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,SAAS,EAC1CoE,EAAAlC,EAAWymB,GAAegI,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAEvsB,EAAA,CAAA,EAAEwsB,EAAExsB,EAAA,CAAA,EAEHusB,EAAG,QAAU,SACfA,EAAK2B,GAAK3B,EAAI,OAAO,EACrBC,EAAK0B,GAAK1B,EAAI,OAAO,GAGvBgQ,GAA2BjQ,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMjpB,EAAwB,CAAC,EAAGgpB,EAAI,EAAGC,CAAE,EAE3C,OAAOlG,EAAO,UAAUrU,GAAS1O,CAAmC,CACtE,CAEO,IAAMqkC,GAA0BpqC,EAAG,CAAC,SAAQmqC,EAAA,CAAC,ECrBpD,SAASE,GACLv+B,EAAiBw+B,EACjBC,EAA2B,CAC7BzlB,EACIylB,IAAS,WAAaA,IAAS,YAC/B,UAAA,CAAM,MAAA,2DACF,OAAA,OAAOA,EAAI,GAAA,CADT,CACY,EAEtB,IAAM/b,EAAKX,EAAgB/hB,EAAG,IAAK,WAAW,EAC9C,GAAI0iB,EAAG,OAAS,EACd,MAAM,IAAI,MACN,gEAC8B,EAEpC1J,EACIwlB,EAAS,SAAW9b,EAAG,KACvB,UAAM,CAAA,MAAA,wCAAA,OAAwCA,EAAG,KAAQ,IAAA,EACrD,OAAA,OAAO8b,EAAS,OAAM,GAAA,CADpB,CACuB,EAEjC,QADME,EAAcD,IAAS,UAAY,EAAI,aACpClqC,EAAC,CACRykB,EACIwlB,EAASjqC,CAAC,EAAE,SAAW,EACvB,UAAM,CAAA,MAAA,uDAAA,CAAuD,EACjEykB,EACIwlB,EAASjqC,CAAC,EAAE,CAAC,GAAK,GAAKiqC,EAASjqC,CAAC,EAAE,CAAC,GAAKmuB,EAAG,MAAMnuB,CAAC,EAAImqC,GACnDF,EAASjqC,CAAC,EAAE,CAAC,GAAK,GAAKiqC,EAASjqC,CAAC,EAAE,CAAC,GAAKmuB,EAAG,MAAMnuB,CAAC,EAAImqC,EAC3D,UAAA,CAAM,MAAA,wBAAA,OAAwBnqC,EAAoC,mCAAA,EAC9D,MAAM,OAAAmuB,EAAG,MAAMnuB,CAAC,EAAImqC,EAA0C,+BAAA,EAC9D,SAAA,OAAShc,EAAG,KAAK,CAFf,CAEiB,GATpBnuB,EAAI,EAAGA,EAAImuB,EAAG,KAAMnuB,MAApBA,CAAC,EAYV,IAAMiI,EAAwB,CAAC,SAAQgiC,EAAE,KAAIC,CAAA,EACvCxkC,EAA0B,CAAC,EAAGyoB,CAAE,EACtC,OAAO1F,EAAO,UACVpU,GAAW3O,EACXuC,CAAgC,CACtC,CAEO,IAAMmiC,GAA4BzqC,EAAG,CAAC,WAAUqqC,EAAA,CAAC,ECpCxD,SAASK,GAAuBxgC,EAAsB9L,EAAoB,OACpE2wB,EAAKlB,EAAgB3jB,EAAG,IAAK,KAAK,EAClC8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,KAAK,EACtCoE,EAAAlC,EAAWymB,GAAegI,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAEvsB,EAAA,CAAA,EAAEwsB,EAAExsB,EAAA,CAAA,EAEP,IAAMuD,EAAoB,CAAC,EAAGgpB,EAAI,EAAGC,CAAE,EAEvC,OAAOlG,EAAO,UAAUnU,GAAK5O,CAAmC,CAClE,CAEO,IAAM4kC,GAAsB3qC,EAAG,CAAC,KAAI0qC,EAAA,CAAC,ECrB5C,SAASE,GACL9+B,EAAsBnB,EACtB2kB,EAAgB,CADM3kB,IAAA,SAAAA,EAA4B,MAClD2kB,IAAA,SAAAA,EAAgB,IAClBxjB,EAAI+hB,EAAgB/hB,EAAG,IAAK,SAAS,EACrC,IAAMZ,EAAOR,GAAeC,EAAMmB,EAAE,KAAK,EACnC++B,EAAQjT,GAAK9rB,EAAGZ,EAAMokB,CAAQ,EAChCkU,EAAgBqH,EAAM,MACrBvb,IACHkU,EAAgB5B,GAAqBiJ,EAAM,MAAO3/B,CAAI,GAExD,IAAM4/B,EACF7H,GAAOuE,GAAI9W,GAAK5kB,EAAG,SAAS,EAAGyoB,EAAQsW,EAAOrH,CAAa,CAAC,CAAC,EAC3D3L,EAAWD,GAAKkT,EAAY5/B,EAAMokB,CAAQ,EAChD,MAAO,CAAC,KAAMub,EAAO,SAAQhT,CAAA,CAC/B,CAEO,IAAMkT,GAA0B/qC,EAAG,CAAC,SAAQ4qC,EAAA,CAAC,EChBpD,SAASI,GACLC,EAA2BvoC,EAC3BmK,EACA0pB,EAA6B,CAO/B,QANMI,EAAQ9I,EAAgBnrB,EAAM,OAAQ,cAAc,EACpDk0B,EAAK3I,GAAqBphB,EAAG,IAAK,cAAc,EAChDgqB,EAAK5I,GAAqBsI,EAAG,IAAK,cAAc,EAElD1vB,EAAQ8vB,EACNuU,EAAY,CAAA,EACT7qC,EAAI,EAAGA,EAAI4qC,EAAU,OAAQ5qC,IAAK,CACzC,IAAM0H,EAASkjC,EAAU5qC,CAAC,EAAEwG,EAAO+vB,EAAGv2B,CAAC,EAAGw2B,EAAGx2B,CAAC,CAAC,EAC/C6qC,EAAU,KAAKnjC,EAAO,CAAC,CAAC,EACxBmjC,EAAU,KAAKnjC,EAAO,CAAC,CAAC,EACxBlB,EAAQkB,EAAO,CAAC,CACjB,CAGD,QAFMmvB,EAAmB,CAAA,EACnBC,EAAmB,CAAA,EAChB92B,EAAI,EAAGA,EAAI6qC,EAAU,OAAQ7qC,GAAK,EACzC62B,EAAK,KAAKgU,EAAU7qC,CAAC,CAAC,EACtB82B,EAAK,KAAK+T,EAAU7qC,EAAI,CAAC,CAAC,EAE5B,MAAO,CAAC62B,EAAMC,CAAI,CACpB,CACO,IAAMgU,GAA+BnrC,EAAG,CAAC,cAAagrC,EAAA,CAAC,ECpB9D,SAASI,GACL1D,EAAsC2D,EAAoBC,EAC1DC,EAAkB,CAAlBA,IAAA,SAAAA,EAAkB,IACpB,IAAM5D,EAAU9Z,EAAgB6Z,EAAQ,SAAU,aAAa,EACzD8D,EAAc7D,EAAQ,KACtB8D,EAAW9D,EAAQ,KACzB,GAAI6D,EAAc,EAChB,MAAM,IAAI,MACN,+DACA,GAAG,OAAAA,EAAc,GAAA,CAAA,EAEvB,GAAIC,EAAW,EACb,MAAM,IAAI,MAAM,gDAAA,OAAgDA,CAAQ,CAAE,EAI5EH,EAAOA,GAAQ,KAAK,OAAM,EAG1B,IAAMI,EACFD,IAAa,EAAIlX,EAAQoT,EAAS,CAAC,EAAG,EAAE,CAAC,EAAIA,EAE3C5hC,EAA4B,CAAC,OAAQ2lC,CAAQ,EAC7CpjC,EAA0B,CAAC,WAAU+iC,EAAE,KAAIC,EAAE,WAAUC,CAAA,EAGvDntB,EAAM0K,EAAO,UACHlU,GAAa7O,EACbuC,CAAgC,EAGhD,OAAOmjC,IAAa,EAAIlX,EAAQnW,EAAK,CAACA,EAAI,IAAI,CAAC,EAAgBA,CACjE,CAEO,IAAMutB,GAA8B3rC,EAAG,CAAC,aAAYorC,EAAA,CAAC,ECzC5D,SAASQ,GACL1hC,EAAsB9L,EAAoB,OACxC2wB,EAAKlB,EAAgB3jB,EAAG,IAAK,WAAY,mBAAmB,EAC5D8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,WAAY,mBAAmB,EAChEoE,EAAAlC,EAAWymB,GAAegI,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAEvsB,EAAA,CAAA,EAAEwsB,EAAExsB,EAAA,CAAA,EAEPw8B,GAA2BjQ,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMjpB,EAAyB,CAAC,EAAGgpB,EAAI,EAAGC,CAAE,EAE5C,OAAOlG,EAAO,UAAU/T,GAAUhP,CAAmC,CACvE,CAEO,IAAM8lC,GAA2B7rC,EAAG,CAAC,UAAS4rC,EAAA,CAAC,ECHtD,SAASE,GACLxe,EAA4Bye,EAAeC,EAAaC,EACxD3iC,EAAyB,CAC3B,GAF6C0iC,IAAA,SAAAA,EAAW,GAAEC,IAAA,SAAAA,EAAY,GACpE3iC,IAAA,SAAAA,EAAyB,SACvByiC,EAAQ,EACV,MAAM,IAAI,MAAM,iDAAA,OAAiDA,CAAK,CAAE,EAE1E,IAAMlH,EAAWhX,EAAgBP,EAAS,UAAW,SAAU,OAAO,EAEhEvnB,EAAuB,CAAC,QAAS8+B,CAAQ,EACzCv8B,EAAqB,CAAC,MAAKgB,EAAE,MAAKyiC,EAAE,QAAOC,EAAE,SAAQC,CAAA,EAE3D,OAAOnjB,EAAO,UACV1T,GAAQrP,EACRuC,CAAgC,CACtC,CAEO,IAAM4jC,GAAyBlsC,EAAG,CAAC,QAAO8rC,EAAA,CAAC,EC7BlD,SAASK,GAA4BrgC,EAAe,CAClD,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,UAAU,EAEvC/F,EAAyB,CAAC,EAAGyoB,CAAE,EACrC,OAAO1F,EAAO,UAAU3T,GAAUpP,CAAmC,CACvE,CAEO,IAAMqmC,GAA2BpsC,EAAG,CAAC,UAASmsC,EAAA,CAAC,ECNtD,SAASE,GACLC,EAAyBC,EAAuB,CAClD,IAAMC,EAAM3e,EAAgBye,EAAI,KAAM,cAAc,EAC9CG,EAAM5e,EAAgB0e,EAAI,KAAM,cAAc,EAEpDznB,EACI0nB,EAAI,OAAS,GAAKC,EAAI,OAAS,EAC/B,UAAA,CAAM,MAAA,+DACF,GAAG,OAAAD,EAAI,KAAY,OAAA,EAAA,OAAAC,EAAI,KAAO,GAAA,CAAA,CAAA,EAEtC,IAAMC,EAAOnY,EAAQiY,EAAK,CAAC,GAAI,CAAC,CAAC,EAC3BG,EAAOpY,EAAQkY,EAAK,CAAC,EAAG,EAAE,CAAC,EACjC,OAAOhX,GAAOiX,EAAMC,CAAI,CAC1B,CAEO,IAAMC,GAA+B5sC,EAAG,CAAC,cAAaqsC,EAAA,CAAC,ECF9D,SAASQ,GACL/gC,EAAiBw+B,EAAmCwC,EAAiB,CAAjBA,IAAA,SAAAA,EAAiB,GACvE,IAAMte,EAAKX,EAAgB/hB,EAAG,IAAK,KAAK,EACxC,GAAI0iB,EAAG,OAAS,EACd,MAAM,IAAI,MAAM,oDAAoD,EAGtE,IAAMlmB,EAAoB,CAAC,SAAQgiC,EAAE,cAAawC,CAAA,EAC5C/mC,EAAsB,CAAC,EAAGyoB,CAAE,EAClC,OAAO1F,EAAO,UACVxT,GAAOvP,EACPuC,CAAgC,CACtC,CAEO,IAAM3E,GAAsB3D,EAAG,CAAC,KAAI6sC,EAAA,CAAC,ECzC5C,SAASE,GACLjhC,EAAwBw+B,EACxBwC,EAAiB,CAAjB,OAAAA,IAAA,SAAAA,EAAiB,GACnBrjC,EACI6gC,EAAS,SAAW,EACpB,UAAA,CAAM,MAAA,kDAAA,CAAkD,EACrD3mC,GAAImI,EAAG,CAACw+B,CAAQ,EAAGwC,CAAa,CACzC,CAEO,IAAME,GAAwBhtC,EAAG,CAAC,OAAM+sC,EAAA,CAAC,ECThD,SAASE,GACLnhC,EAAwBw+B,EACxBwC,EAAiB,CAAjB,OAAAA,IAAA,SAAAA,EAAiB,GACnBrjC,EACI6gC,EAAS,SAAW,GAAKA,EAAS,CAAC,EAAE,SAAW,GAC5CA,EAAS,CAAC,EAAE,SAAW,EAC3B,UAAA,CAAM,MAAA,uDAAA,CAAuD,EAC1D3mC,GAAImI,EAAGw+B,EAAUwC,CAAa,CACvC,CAEO,IAAMI,GAAwBltC,EAAG,CAAC,OAAMitC,EAAA,CAAC,ECVhD,SAASE,GACLrhC,EACAw+B,EACAwC,EAAiB,CAAjB,OAAAA,IAAA,SAAAA,EAAiB,GACnBrjC,EACI6gC,EAAS,SAAW,GAAKA,EAAS,CAAC,EAAE,SAAW,GAC5CA,EAAS,CAAC,EAAE,SAAW,GAAKA,EAAS,CAAC,EAAE,SAAW,EACvD,UAAA,CAAM,MAAA,uDAAuD,CAAA,EAC1D3mC,GAAImI,EAAGw+B,EAAUwC,CAAa,CACvC,CAEO,IAAMM,GAAwBptC,EAAG,CAAC,OAAMmtC,EAAA,CAAC,ECXhD,SAASE,GACLvhC,EACAw+B,EAIAwC,EAAiB,CAAjB,OAAAA,IAAA,SAAAA,EAAiB,GACnBrjC,EACI6gC,EAAS,SAAW,GAAKA,EAAS,CAAC,EAAE,SAAW,GAC5CA,EAAS,CAAC,EAAE,SAAW,GAAKA,EAAS,CAAC,EAAE,SAAW,GACnDA,EAAS,CAAC,EAAE,SAAW,EAC3B,UAAA,CAAM,MAAA,uDAAA,CAAuD,EAC1D3mC,GAAImI,EAAGw+B,EAAUwC,CAAa,CACvC,CAEO,IAAMQ,GAAwBttC,EAAG,CAAC,OAAMqtC,EAAA,CAAC,ECoChD,SAASE,GACLzhC,EAAiBwrB,EAAsBgT,EAAoB,CAC7D,IAAM9b,EAAKX,EAAgB/hB,EAAG,IAAK,gBAAgB,EAEnDgZ,EACI0J,EAAG,MAAQ,EAAI8I,EAAW,OAC1B,UAAM,CAAA,MAAA,cAAc,OAAA9I,EAAG,KACnB,iCAAA,EAAA,OAAA8I,EAAW,MAAM,CAAE,CAAA,EAE3BxS,EACIwlB,EAAS,SAAWhT,EAAW,OAC/B,UAAA,CAAM,MAAA,qBACF,OAAAgT,EAAS,OAAwC,iCAAA,EAAA,OAAAhT,EAAW,MAAM,CAAE,CAAA,EAE5ExS,EACI0J,EAAG,MAAM,OACL,SAACtkB,EAAG9L,EAAGiC,EAAC,CACN,OAAIA,EAAI,GAAKA,GAAKi3B,EAAW,OACpBptB,IACD9L,EAAIksC,EAASjqC,EAAI,CAAC,EAAE,CAAC,EAAIiqC,EAASjqC,EAAI,CAAC,EAAE,CAAC,GACvCi3B,EAAWj3B,EAAI,CAAC,IACpB,EAEA6J,CACT,EACA,EAAI,EACR,UAAM,CAAA,MAAA,4BAA4B,OAAAskB,EAAG,MAAM,MAAM,CAAC,EAAC,iBAAA,EAAA,OAC/C8b,EAAS,SAAQ,EACjB,oCAAA,EAAA,OAAAhT,EAAW,SAAQ,CAAE,CAFnB,CAEqB,EAE/B,IAAMvxB,EAA+B,CAAC,EAAGyoB,CAAE,EACrClmB,EAA6B,CAAC,WAAUgvB,EAAE,SAAQgT,CAAA,EAExD,OAAOxhB,EAAO,UACVzR,GAAgBtR,EAChBuC,CAAgC,CACtC,CAEO,IAAMklC,GAAiCxtC,EAAG,CAAC,gBAAeutC,EAAA,CAAC,ECxDlE,SAASE,GACL5mC,EAAqB6mC,EACrBC,EACAhqC,EACAmtB,EAAqCzkB,EACrC+nB,EAAwC,CACtCtD,GAAa,OACfA,EAAY,CAAC,EAAG,CAAC,GAEfzkB,GAAW,OACbA,EAAU,GAER1I,IAAQ,IACVA,EAAM,SAGR,IAAM6qB,EAAKX,EAAgBhnB,EAAO,IAAK,SAAS,EAC5C6tB,EAAMlG,EACNmG,EAAe,GAEfnG,EAAG,OAAS,IACdmG,EAAe,GACfD,EAAMH,EAAQ/F,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAG9D1J,EACI2P,GAAyCpoB,EAASykB,CAAS,EAC3D,UAAA,CAAM,MAAA,yDACF,eAAA,OAAezkB,EAA0B,kBAAA,EAAA,OAAAykB,EAAS,GAAA,CADhD,CACmD,EAE7D,IAAM8c,EAAWC,GACbnZ,EAAI,MAAOgZ,EAAarhC,EAASykB,EAAWntB,CAAG,EAC7CwvB,EACF,CAACya,EAAS,eAAgBA,EAAS,aAAa,EAOhDE,EACAnqC,IAAQ,OACVmqC,EAAcC,GACV,CAACH,EAAS,aAAcA,EAAS,WAAW,EAAGza,CAAQ,EAE3D2a,EAAc,CAAC,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,CAAC,EAG/B,IAAME,EAAgB7a,EAAS,CAAC,IAAM,GAAKA,EAAS,CAAC,IAAM,EACrD3wB,EAAAlC,EAAmC2tC,GACrC,CAACL,EAAS,SAAUA,EAAS,OAAO,EAAGza,EAAU2a,CAAW,EAAC,CAAA,EAD1DI,EAAe1rC,EAAA,CAAA,EAAE2rC,EAAa3rC,EAAA,CAAA,EAE/B4rC,EAAeJ,EAAgBrqC,EAAM,QACrC0qC,EACFL,EAAgBtZ,EAAM8Y,GAAe9Y,EAAKvB,EAAU+a,CAAe,EAEjEI,EAAYX,IAAgB,MAC9B,UAAA,CAAM,OAAA9Y,GAAQwZ,EAAYX,EAAarhC,EAAS+hC,EAClCha,CAAe,CADvB,EAEN,UAAA,CAAM,OAAAmV,GAAQ8E,EAAYX,EAAarhC,EAAS+hC,EAClCha,CAAe,CAAC,EAC5Bz0B,EAAI2uC,EAAS,EAEblwB,EAAM4vB,EAAgBruC,EAAI83B,GAAe93B,EAAGwzB,EAAUgb,CAAa,EAEzE,OAAIxZ,EACKJ,EAAQnW,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAGzDA,CACT,CAKA,SAAS6vB,GACL7sB,EAA8BkW,EAC9BwW,EAAuB,CACzB,IAAMS,EAAWT,EAAY,IAAI,SAAA1vC,EAAK,CAAA,OAAAA,EAAE,CAAC,CAAH,CAAI,EACpCowC,EAAaV,EAAY,IAAI,SAAA1vC,EAAK,CAAA,OAAAA,EAAE,CAAC,CAAH,CAAI,EACtCqwC,EAAiBrtB,EAAW,OAAOmtB,EAAUC,CAAU,EACvDE,EAAcpX,EAAW,IAAI,SAACl5B,EAAGiC,EAAC,CAAK,OAACjC,EAAIqwC,EAAepuC,CAAC,EAAIjC,GAAKA,CAAC,CAAA,EACtEuwC,EAASH,EAAW,IAAI,SAACruC,EAAGE,EAAC,CAAK,OAAAF,EAAIuuC,EAAYruC,CAAC,CAAC,CAAA,EACpDiqC,EAAWhT,EAAW,IAAI,SAAC93B,EAAGa,EAAC,CAAK,MAAA,CAACkuC,EAASluC,CAAC,EAAGsuC,EAAOtuC,CAAC,CAAC,CAAC,CAAA,EAC5Dk3B,EAAQD,EAAW,IAAI,SAAC93B,EAAGa,EAAC,CAAK,MAAA,CAAC,EAAGquC,EAAYruC,CAAC,CAAC,CAAC,CAAA,EAC1D,MAAO,CAACiqC,EAAU/S,CAAK,CACzB,CAKA,SAASwW,GACL3c,EAA+B+B,EAA0B,CAG3D,IAAMyb,EAAqBxd,EAAY,IAAI,SAACjxB,EAAG,EAAC,CAC9C,OAAOA,GAAKA,EAAI,IAAMgzB,EAAS,CAAC,EAAI,EACtC,CAAC,EACK0b,EAAgBD,EAAmB,IAAI,SAAAzuC,EAAK,CAAA,OAAAA,EAAI,CAAJ,CAAK,EAIjD2uC,EAAgBD,EAAc,IAAI,SAAA1uC,EAAK,CAAA,OAAA,KAAK,MAAMA,EAAI,CAAC,CAAC,CAAA,EACxD4uC,EAAcF,EAAc,IAAI,SAAC1uC,EAAG,EAAC,CAAK,OAAAA,EAAI2uC,EAAc,CAAC,CAAC,CAAA,EACpE,OAAOD,EAAc,IAAI,SAACrvC,EAAG,EAAC,CAC5B,MAAO,CAACsvC,EAAc,CAAC,EAAGC,EAAY,CAAC,CAAC,CAC1C,CAAC,CACH,CAEO,IAAMC,GAAuBhvC,EAAG,CAAC,MAAKytC,EAAA,CAAC,EC5H9C,SAASwB,GAAyBnjC,EAAiB85B,EAAmB,CACpE,IAAMpX,EAAKX,EAAgB/hB,EAAG,IAAK,OAAO,EACpCojC,EAASrhB,EAAgB+X,EAAO,QAAS,OAAO,EAEhD7/B,EAAsB,CAAC,EAAGyoB,EAAI,MAAO0gB,CAAM,EACjD,OAAOpmB,EAAO,UAAUtT,GAAOzP,CAAmC,CACpE,CAEO,IAAMopC,GAAwBnvC,EAAG,CAAC,OAAMivC,EAAA,CAAC,EClBhC,SAAAG,GAAwBtjC,EAAMmX,EAAe,CAAfA,IAAA,SAAAA,EAAe,IAC3D,QAAQ,IAAInX,EAAE,SAASmX,CAAO,CAAC,CACjC,CCwBA,SAASosB,GACLvjC,EAAsBnB,EAA8B2kB,EAAgB,CAA9C3kB,IAAA,SAAAA,EAA4B,MAAE2kB,IAAA,SAAAA,EAAgB,IACtE,IAAId,EAAKX,EAAgB/hB,EAAG,IAAK,MAAM,EAEnC0iB,EAAG,QAAU,SAEfA,EAAKkC,GAAKlC,EAAI,OAAO,GAGvB,IAAMzoB,EAAqB,CAAC,EAAGyoB,CAAE,EAC3BlmB,EAAmB,CAAC,KAAIqC,EAAE,SAAQ2kB,CAAA,EAExC,OAAOxG,EAAO,UACVrT,GAAM1P,EACNuC,CAAgC,CACtC,CAEO,IAAMkvB,GAAuBx3B,EAAG,CAAC,MAAKqvC,EAAA,CAAC,ECzB9C,SAASC,GACLC,EAA8BC,EAC9BliB,EAA4BmiB,EAAwB,CACtD,IAAMC,EAAsBH,EAAmB,IAC3C,SAAC9vC,EAAGY,EAAC,CAAK,OAAAwtB,EAAgBpuB,EAAG,UAAA,OAAUY,CAAC,EAAI,eAAgB,OAAO,CAAC,CAAA,EAClEsvC,EACF9hB,EAAgB2hB,EAAmB,oBAAqB,cAAc,EACpE3K,EAAWhX,EAAgBP,EAAS,UAAW,eAAgB,OAAO,EAEtEvnB,EAA6B,CACjC,mBAAoB2pC,EACpB,kBAAmBC,EACnB,QAAS9K,GAELv8B,EAA2B,CAAC,iBAAgBmnC,CAAA,EAE5CpwC,EACFypB,EAAO,UAAUpT,GAAc3P,EAAcuC,CAAW,EAC5D,MAAO,CACL,mBAAoBjJ,EAAO,MAAM,EAAGA,EAAO,OAAS,CAAC,EACrD,kBAAmBA,EAAOA,EAAO,OAAS,CAAC,EAE/C,CAEO,IAAMuwC,GAA+B5vC,EAAG,CAAC,cAAasvC,EAAA,CAAC,EClC9D,SAASO,GACLC,EAA2BC,EAC3BC,EAAyB,CAC3B,IAAMC,EAAUpiB,EAAgBiiB,EAAQ,SAAU,aAAa,EACzDI,EACFriB,EAAgBkiB,EAAQ,SAAU,cAAeE,EAAQ,KAAK,EAC5DE,EACFtiB,EAAgBmiB,EAAQ,SAAU,cAAeC,EAAQ,KAAK,EAE5DlqC,EAA4B,CAChC,OAAQkqC,EACR,OAAQC,EACR,OAAQC,GAGJ9wC,EAAmBypB,EAAO,UAAUnT,GAAa5P,CAAY,EACnE,MAAO,CACL,eAAgB1G,EAAO,CAAC,EACxB,cAAeA,EAAO,CAAC,EAE3B,CAEO,IAAM+wC,GAA8BpwC,EAAG,CAAC,aAAY6vC,EAAA,CAAC,ECe5D,SAASQ,GACL3nC,EAA0BW,EAC1BR,EAAiCynC,EACjCC,EAA2B,CAC7B,IAAMC,EACF3iB,EAAgBnlB,EAAO,QAAS,uBAAwB,OAAO,EAC7DqgC,EAAUlb,EAAgBxkB,EAAQ,SAAU,sBAAsB,EAClEonC,EAAgB5iB,EAClBhlB,EAAc,eAAgB,uBAAwBkgC,EAAQ,KAAK,EACjE2H,EAAuBJ,EAAoB,IAC7C,SAAC7wC,EAAGY,EAAC,CACD,OAAAwtB,EAAgBpuB,EAAG,UAAA,OAAUY,CAAC,EAAI,uBAAwB,OAAO,CAAC,CAAA,EAEpE0F,EAAqC,CACzC,MAAOyqC,EACP,OAAQzH,EACR,aAAc0H,EACd,oBAAqBC,GAEjBpoC,EAAmC,CAAC,kBAAiBioC,CAAA,EAE3D,OAAOznB,EAAO,UAAUlT,GAAsB7P,EAAcuC,CAAW,CACzE,CAEO,IAAMqoC,GAAuC3wC,EAAG,CAAC,sBAAqBqwC,EAAA,CAAC,ECjE9E,SAASO,GACLloC,EAAoBmoC,EACpBvnC,EAAgB,CAClB4D,GAAmCxE,CAAK,EACxC,IAAM0B,EAAOD,GAAczB,CAAK,EAC5BW,EAAS,KACb,GAAIC,GAAS,MAAQA,IAAU,UAC7BD,EAAS,IAAI,aAAae,CAAI,UACrBd,IAAU,QACnBD,EAAS,IAAI,WAAWe,CAAI,UACnBd,IAAU,OACnBD,EAAS,IAAI,WAAWe,CAAI,MAE5B,OAAM,IAAI,MAAM,qBAAA,OAAqBd,CAAK,CAAE,EAE9C,QAASjJ,EAAI,EAAGA,EAAI+J,EAAM/J,IACxBgJ,EAAOhJ,CAAC,EAAIwwC,EAAY,EAE1B,OAAO/nB,EAAO,WAAWzf,EAAQX,EAAOY,CAAK,CAC/C,CAEO,IAAMwnC,GAAuB9wC,EAAG,CAAC,MAAK4wC,EAAA,CAAC,gCC9B7C,SAASzoC,EAAQ4oC,EAAQC,EAAM,CAEhC,SAASC,EAAK3F,EAAI,CAChB,IAAI4F,EAAK,KAAMC,EAAOC,EAAI,EAE1BF,EAAG,KAAO,UAAA,CACR,IAAIzxC,EAAI,QAAUyxC,EAAG,GAAKA,EAAG,EAAI,sBACjC,OAAAA,EAAG,GAAKA,EAAG,GACXA,EAAG,GAAKA,EAAG,GACJA,EAAG,GAAKzxC,GAAKyxC,EAAG,EAAIzxC,EAAI,EACnC,EAGEyxC,EAAG,EAAI,EACPA,EAAG,GAAKC,EAAK,GAAG,EAChBD,EAAG,GAAKC,EAAK,GAAG,EAChBD,EAAG,GAAKC,EAAK,GAAG,EAChBD,EAAG,IAAMC,EAAK7F,CAAI,EACd4F,EAAG,GAAK,IAAKA,EAAG,IAAM,GAC1BA,EAAG,IAAMC,EAAK7F,CAAI,EACd4F,EAAG,GAAK,IAAKA,EAAG,IAAM,GAC1BA,EAAG,IAAMC,EAAK7F,CAAI,EACd4F,EAAG,GAAK,IAAKA,EAAG,IAAM,GAC1BC,EAAO,KAGT,SAASE,EAAK3xC,EAAGD,EAAC,CAChB,OAAAA,EAAE,EAAIC,EAAE,EACRD,EAAE,GAAKC,EAAE,GACTD,EAAE,GAAKC,EAAE,GACTD,EAAE,GAAKC,EAAE,GACFD,EAGT,SAAS6xC,EAAKhG,EAAMiG,EAAI,CACtB,IAAIC,EAAK,IAAIP,EAAK3F,CAAI,EAClBmG,EAAQF,GAAQA,EAAK,MACrBG,EAAOF,EAAG,KACd,OAAAE,EAAK,MAAQ,UAAA,CAAa,OAAQF,EAAG,KAAI,EAAK,WAAe,CAAE,EAC/DE,EAAK,OAAS,UAAA,CACZ,OAAOA,EAAI,GAAMA,EAAI,EAAK,QAAW,GAAK,qBAC9C,EACEA,EAAK,MAAQA,EACTD,IACE,OAAOA,GAAU,UAAUJ,EAAKI,EAAOD,CAAE,EAC7CE,EAAK,MAAQ,UAAA,CAAa,OAAOL,EAAKG,EAAI,CAAA,CAAE,CAAE,GAEzCE,EAGT,SAASN,GAAI,CACX,IAAItxC,EAAI,WAEJqxC,EAAO,SAASzuC,EAAI,CACtBA,EAAO,OAAOA,CAAI,EAClB,QAASrC,EAAI,EAAGA,EAAIqC,EAAK,OAAQrC,IAAK,CACpCP,GAAK4C,EAAK,WAAWrC,CAAC,EACtB,IAAIk2B,EAAI,mBAAsBz2B,EAC9BA,EAAIy2B,IAAM,EACVA,GAAKz2B,EACLy2B,GAAKz2B,EACLA,EAAIy2B,IAAM,EACVA,GAAKz2B,EACLA,GAAKy2B,EAAI,UACV,CACD,OAAQz2B,IAAM,GAAK,qBACvB,EAEE,OAAOqxC,EAILJ,GAAUA,EAAO,QACnBA,EAAO,QAAUO,EACRN,GAAUA,EAAO,IAC1BA,EAAO,UAAA,CAAa,OAAOM,CAAK,CAAE,EAElC,KAAK,KAAOA,CAGd,GACEK,GAC+BZ,EAC9B,0DC3GF,SAAS5oC,EAAQ4oC,EAAQC,EAAM,CAEhC,SAASY,EAAOtG,EAAI,CAClB,IAAI4F,EAAK,KAAMW,EAAU,GAEzBX,EAAG,EAAI,EACPA,EAAG,EAAI,EACPA,EAAG,EAAI,EACPA,EAAG,EAAI,EAGPA,EAAG,KAAO,UAAA,CACR,IAAIzxC,EAAIyxC,EAAG,EAAKA,EAAG,GAAK,GACxB,OAAAA,EAAG,EAAIA,EAAG,EACVA,EAAG,EAAIA,EAAG,EACVA,EAAG,EAAIA,EAAG,EACHA,EAAG,GAAMA,EAAG,IAAM,GAAMzxC,EAAKA,IAAM,CAC9C,EAEM6rC,KAAUA,EAAO,GAEnB4F,EAAG,EAAI5F,EAGPuG,GAAWvG,EAIb,QAAS9jB,EAAI,EAAGA,EAAIqqB,EAAQ,OAAS,GAAIrqB,IACvC0pB,EAAG,GAAKW,EAAQ,WAAWrqB,CAAC,EAAI,EAChC0pB,EAAG,KAAI,EAIX,SAASG,EAAK3xC,EAAGD,EAAC,CAChB,OAAAA,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACDD,EAGT,SAAS6xC,EAAKhG,EAAMiG,EAAI,CACtB,IAAIC,EAAK,IAAII,EAAOtG,CAAI,EACpBmG,EAAQF,GAAQA,EAAK,MACrBG,EAAO,UAAa,CAAA,OAAQF,EAAG,KAAI,IAAO,GAAK,UAAY,EAC/D,OAAAE,EAAK,OAAS,UAAA,CACZ,EACE,KAAIle,EAAMge,EAAG,KAAI,IAAO,GACpBM,GAAON,EAAG,KAAI,IAAO,GAAK,WAC1BnyC,GAAUm0B,EAAMse,IAAQ,GAAK,UAC1BzyC,IAAW,GACpB,OAAOA,CACX,EACEqyC,EAAK,MAAQF,EAAG,KAChBE,EAAK,MAAQA,EACTD,IACE,OAAOA,GAAU,UAAUJ,EAAKI,EAAOD,CAAE,EAC7CE,EAAK,MAAQ,UAAA,CAAa,OAAOL,EAAKG,EAAI,CAAA,CAAE,CAAE,GAEzCE,EAGLX,GAAUA,EAAO,QACnBA,EAAO,QAAUO,EACRN,GAAUA,EAAO,IAC1BA,EAAO,UAAA,CAAa,OAAOM,CAAK,CAAE,EAElC,KAAK,OAASA,CAGhB,GACEK,GAC+BZ,EAC9B,0DC1EF,SAAS5oC,EAAQ4oC,EAAQC,EAAM,CAEhC,SAASY,EAAOtG,EAAI,CAClB,IAAI4F,EAAK,KAAMW,EAAU,GAGzBX,EAAG,KAAO,UAAA,CACR,IAAIzxC,EAAKyxC,EAAG,EAAKA,EAAG,IAAM,EAC1B,OAAAA,EAAG,EAAIA,EAAG,EAAGA,EAAG,EAAIA,EAAG,EAAGA,EAAG,EAAIA,EAAG,EAAGA,EAAG,EAAIA,EAAG,GACzCA,EAAG,EAAKA,EAAG,EAAI,OAAS,IAC5BA,EAAG,EAAKA,EAAG,EAAKA,EAAG,GAAK,GAAOzxC,EAAKA,GAAK,IAAO,CACxD,EAEEyxC,EAAG,EAAI,EACPA,EAAG,EAAI,EACPA,EAAG,EAAI,EACPA,EAAG,EAAI,EACPA,EAAG,EAAI,EAEH5F,KAAUA,EAAO,GAEnB4F,EAAG,EAAI5F,EAGPuG,GAAWvG,EAIb,QAAS9jB,EAAI,EAAGA,EAAIqqB,EAAQ,OAAS,GAAIrqB,IACvC0pB,EAAG,GAAKW,EAAQ,WAAWrqB,CAAC,EAAI,EAC5BA,GAAKqqB,EAAQ,SACfX,EAAG,EAAIA,EAAG,GAAK,GAAKA,EAAG,IAAM,GAE/BA,EAAG,KAAI,EAIX,SAASG,EAAK3xC,EAAGD,EAAC,CAChB,OAAAA,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACDD,EAGT,SAAS6xC,EAAKhG,EAAMiG,EAAI,CACtB,IAAIC,EAAK,IAAII,EAAOtG,CAAI,EACpBmG,EAAQF,GAAQA,EAAK,MACrBG,EAAO,UAAa,CAAA,OAAQF,EAAG,KAAI,IAAO,GAAK,UAAY,EAC/D,OAAAE,EAAK,OAAS,UAAA,CACZ,EACE,KAAIle,EAAMge,EAAG,KAAI,IAAO,GACpBM,GAAON,EAAG,KAAI,IAAO,GAAK,WAC1BnyC,GAAUm0B,EAAMse,IAAQ,GAAK,UAC1BzyC,IAAW,GACpB,OAAOA,CACX,EACEqyC,EAAK,MAAQF,EAAG,KAChBE,EAAK,MAAQA,EACTD,IACE,OAAOA,GAAU,UAAUJ,EAAKI,EAAOD,CAAE,EAC7CE,EAAK,MAAQ,UAAA,CAAa,OAAOL,EAAKG,EAAI,CAAA,CAAE,CAAE,GAEzCE,EAGLX,GAAUA,EAAO,QACnBA,EAAO,QAAUO,EACRN,GAAUA,EAAO,IAC1BA,EAAO,UAAA,CAAa,OAAOM,CAAK,CAAE,EAElC,KAAK,OAASA,CAGhB,GACEK,GAC+BZ,EAC9B,0DC7EF,SAAS5oC,EAAQ4oC,EAAQC,EAAM,CAEhC,SAASY,EAAOtG,EAAI,CAClB,IAAI4F,EAAK,KAGTA,EAAG,KAAO,UAAA,CAER,IAAIa,EAAIb,EAAG,EAAG7wC,EAAI6wC,EAAG,EAAGzxC,EAAGM,EAC3B,OAAAN,EAAIsyC,EAAE1xC,CAAC,EAAGZ,GAAMA,IAAM,EAAIM,EAAIN,EAAKA,GAAK,GACxCA,EAAIsyC,EAAG1xC,EAAI,EAAK,CAAC,EAAGN,GAAKN,EAAKA,IAAM,GACpCA,EAAIsyC,EAAG1xC,EAAI,EAAK,CAAC,EAAGN,GAAKN,EAAKA,IAAM,EACpCA,EAAIsyC,EAAG1xC,EAAI,EAAK,CAAC,EAAGN,GAAKN,EAAKA,GAAK,EACnCA,EAAIsyC,EAAG1xC,EAAI,EAAK,CAAC,EAAGZ,EAAIA,EAAKA,GAAK,GAAKM,GAAKN,EAAKA,GAAK,EACtDsyC,EAAE1xC,CAAC,EAAIN,EACPmxC,EAAG,EAAK7wC,EAAI,EAAK,EACVN,CACX,EAEE,SAASkP,EAAKiiC,EAAI5F,EAAI,CACpB,IAAIngC,EAAM4mC,EAAI,CAAA,EAEd,GAAIzG,KAAUA,EAAO,GAEfyG,EAAE,CAAC,EAAIzG,MAIX,KADAA,EAAO,GAAKA,EACPngC,EAAI,EAAGA,EAAImgC,EAAK,OAAQ,EAAEngC,EAC7B4mC,EAAE5mC,EAAI,CAAC,EAAK4mC,EAAE5mC,EAAI,CAAC,GAAK,GACnBmgC,EAAK,WAAWngC,CAAC,EAAI4mC,EAAG5mC,EAAI,EAAK,CAAC,GAAK,GAIhD,KAAO4mC,EAAE,OAAS,GAAGA,EAAE,KAAK,CAAC,EAC7B,IAAK5mC,EAAI,EAAGA,EAAI,GAAK4mC,EAAE5mC,CAAC,IAAM,EAAG,EAAEA,EAAE,CAOrC,IANIA,GAAK,EAAO4mC,EAAE,CAAC,EAAI,GAAaA,EAAE5mC,CAAC,EAEvC+lC,EAAG,EAAIa,EACPb,EAAG,EAAI,EAGF/lC,EAAI,IAAKA,EAAI,EAAG,EAAEA,EACrB+lC,EAAG,KAAI,EAIXjiC,EAAKiiC,EAAI5F,CAAI,EAGf,SAAS+F,EAAK3xC,EAAGD,EAAC,CAChB,OAAAA,EAAE,EAAIC,EAAE,EAAE,MAAK,EACfD,EAAE,EAAIC,EAAE,EACDD,EAGT,SAAS6xC,EAAKhG,EAAMiG,EAAI,CAClBjG,GAAQ,OAAMA,EAAO,CAAE,IAAI,MAC/B,IAAIkG,EAAK,IAAII,EAAOtG,CAAI,EACpBmG,EAAQF,GAAQA,EAAK,MACrBG,EAAO,UAAa,CAAA,OAAQF,EAAG,KAAI,IAAO,GAAK,UAAY,EAC/D,OAAAE,EAAK,OAAS,UAAA,CACZ,EACE,KAAIle,EAAMge,EAAG,KAAI,IAAO,GACpBM,GAAON,EAAG,KAAI,IAAO,GAAK,WAC1BnyC,GAAUm0B,EAAMse,IAAQ,GAAK,UAC1BzyC,IAAW,GACpB,OAAOA,CACX,EACEqyC,EAAK,MAAQF,EAAG,KAChBE,EAAK,MAAQA,EACTD,IACEA,EAAM,GAAGJ,EAAKI,EAAOD,CAAE,EAC3BE,EAAK,MAAQ,UAAA,CAAa,OAAOL,EAAKG,EAAI,CAAA,CAAE,CAAE,GAEzCE,EAGLX,GAAUA,EAAO,QACnBA,EAAO,QAAUO,EACRN,GAAUA,EAAO,IAC1BA,EAAO,UAAA,CAAa,OAAOM,CAAK,CAAE,EAElC,KAAK,UAAYA,CAGnB,GACEK,GAC+BZ,EAC9B,0DCrEF,SAAS5oC,EAAQ4oC,EAAQC,EAAM,CAEhC,SAASY,EAAOtG,EAAI,CAClB,IAAI4F,EAAK,KAGTA,EAAG,KAAO,UAAA,CACR,IAAIhH,EAAIgH,EAAG,EACPa,EAAIb,EAAG,EAAG7wC,EAAI6wC,EAAG,EAAGzxC,EAAGM,EAE3B,OAAAmxC,EAAG,EAAIhH,EAAKA,EAAI,WAAc,EAE9BnqC,EAAIgyC,EAAG1xC,EAAI,GAAM,GAAG,EACpBZ,EAAIsyC,EAAE1xC,EAAMA,EAAI,EAAK,GAAI,EACzBN,GAAKA,GAAK,GACVN,GAAKA,GAAK,GACVM,GAAKA,IAAM,GACXN,GAAKA,IAAM,GAEXM,EAAIgyC,EAAE1xC,CAAC,EAAIN,EAAIN,EACfyxC,EAAG,EAAI7wC,EAECN,GAAKmqC,EAAKA,IAAM,IAAQ,CACpC,EAEE,SAASj7B,EAAKiiC,EAAI5F,EAAI,CACpB,IAAI7rC,EAAGM,EAAGM,EAAG8K,EAAG++B,EAAG6H,EAAI,CAAA,EAAIC,EAAQ,IAYnC,IAXI1G,KAAUA,EAAO,IAEnBvrC,EAAIurC,EACJA,EAAO,OAGPA,EAAOA,EAAO,KACdvrC,EAAI,EACJiyC,EAAQ,KAAK,IAAIA,EAAO1G,EAAK,MAAM,GAGhCjrC,EAAI,EAAG8K,EAAI,IAAKA,EAAI6mC,EAAO,EAAE7mC,EAE5BmgC,IAAMvrC,GAAKurC,EAAK,YAAYngC,EAAI,IAAMmgC,EAAK,MAAM,GAEjDngC,IAAM,IAAG++B,EAAInqC,GACjBA,GAAKA,GAAK,GACVA,GAAKA,IAAM,GACXA,GAAKA,GAAK,EACVA,GAAKA,IAAM,GACPoL,GAAK,IACP++B,EAAKA,EAAI,WAAc,EACvBzqC,EAAKsyC,EAAE5mC,EAAI,GAAG,GAAMpL,EAAImqC,EACxB7pC,EAAUZ,GAAL,EAAUY,EAAI,EAAI,GAW3B,IAPIA,GAAK,MACP0xC,GAAGzG,GAAQA,EAAK,QAAU,GAAK,GAAG,EAAI,IAKxCjrC,EAAI,IACC8K,EAAI,IAASA,EAAI,EAAG,EAAEA,EACzBpL,EAAIgyC,EAAG1xC,EAAI,GAAM,GAAG,EACpBZ,EAAIsyC,EAAE1xC,EAAMA,EAAI,EAAK,GAAI,EACzBN,GAAKA,GAAK,GACVN,GAAKA,GAAK,GACVM,GAAKA,IAAM,GACXN,GAAKA,IAAM,GACXsyC,EAAE1xC,CAAC,EAAIN,EAAIN,EAGbyxC,EAAG,EAAIhH,EACPgH,EAAG,EAAIa,EACPb,EAAG,EAAI7wC,EAGT4O,EAAKiiC,EAAI5F,CAAI,EAGf,SAAS+F,EAAK3xC,EAAGD,EAAC,CAChB,OAAAA,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EAAE,MAAK,EACRD,EAGT,SAAS6xC,EAAKhG,EAAMiG,EAAI,CAClBjG,GAAQ,OAAMA,EAAO,CAAE,IAAI,MAC/B,IAAIkG,EAAK,IAAII,EAAOtG,CAAI,EACpBmG,EAAQF,GAAQA,EAAK,MACrBG,EAAO,UAAa,CAAA,OAAQF,EAAG,KAAI,IAAO,GAAK,UAAY,EAC/D,OAAAE,EAAK,OAAS,UAAA,CACZ,EACE,KAAIle,EAAMge,EAAG,KAAI,IAAO,GACpBM,GAAON,EAAG,KAAI,IAAO,GAAK,WAC1BnyC,GAAUm0B,EAAMse,IAAQ,GAAK,UAC1BzyC,IAAW,GACpB,OAAOA,CACX,EACEqyC,EAAK,MAAQF,EAAG,KAChBE,EAAK,MAAQA,EACTD,IACEA,EAAM,GAAGJ,EAAKI,EAAOD,CAAE,EAC3BE,EAAK,MAAQ,UAAA,CAAa,OAAOL,EAAKG,EAAI,CAAA,CAAE,CAAE,GAEzCE,EAGLX,GAAUA,EAAO,QACnBA,EAAO,QAAUO,EACRN,GAAUA,EAAO,IAC1BA,EAAO,UAAA,CAAa,OAAOM,CAAK,CAAE,EAElC,KAAK,QAAUA,CAGjB,GACEK,GAC+BZ,EAC9B,0DC5IF,SAAS5oC,EAAQ4oC,EAAQC,EAAM,CAEhC,SAASY,EAAOtG,EAAI,CAClB,IAAI4F,EAAK,KAAMW,EAAU,GAGzBX,EAAG,KAAO,UAAA,CACR,IAAI9yC,EAAI8yC,EAAG,EAAGrkC,EAAIqkC,EAAG,EAAG/yC,EAAI+yC,EAAG,EAAGhnC,EAAIgnC,EAAG,EACzC,OAAA9yC,EAAKA,GAAK,GAAOA,IAAM,EAAKyO,EAC5BA,EAAKA,EAAI1O,EAAK,EACdA,EAAKA,GAAK,GAAOA,IAAM,EAAK+L,EAC5BA,EAAKA,EAAI9L,EAAK,EACd8yC,EAAG,EAAI9yC,EAAKA,GAAK,GAAOA,IAAM,GAAMyO,EACpCqkC,EAAG,EAAIrkC,EAAKA,EAAI1O,EAAK,EACrB+yC,EAAG,EAAK/yC,GAAK,GAAO0O,IAAM,GAAM3C,EACzBgnC,EAAG,EAAKhnC,EAAI9L,EAAK,CAC5B,EAkBE8yC,EAAG,EAAI,EACPA,EAAG,EAAI,EACPA,EAAG,EAAI,YACPA,EAAG,EAAI,WAEH5F,IAAS,KAAK,MAAMA,CAAI,GAE1B4F,EAAG,EAAK5F,EAAO,WAAe,EAC9B4F,EAAG,EAAI5F,EAAO,GAGduG,GAAWvG,EAIb,QAAS9jB,EAAI,EAAGA,EAAIqqB,EAAQ,OAAS,GAAIrqB,IACvC0pB,EAAG,GAAKW,EAAQ,WAAWrqB,CAAC,EAAI,EAChC0pB,EAAG,KAAI,EAIX,SAASG,EAAK3xC,EAAGD,EAAC,CAChB,OAAAA,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACDD,EAGT,SAAS6xC,EAAKhG,EAAMiG,EAAI,CACtB,IAAIC,EAAK,IAAII,EAAOtG,CAAI,EACpBmG,EAAQF,GAAQA,EAAK,MACrBG,EAAO,UAAa,CAAA,OAAQF,EAAG,KAAI,IAAO,GAAK,UAAY,EAC/D,OAAAE,EAAK,OAAS,UAAA,CACZ,EACE,KAAIle,EAAMge,EAAG,KAAI,IAAO,GACpBM,GAAON,EAAG,KAAI,IAAO,GAAK,WAC1BnyC,GAAUm0B,EAAMse,IAAQ,GAAK,UAC1BzyC,IAAW,GACpB,OAAOA,CACX,EACEqyC,EAAK,MAAQF,EAAG,KAChBE,EAAK,MAAQA,EACTD,IACE,OAAOA,GAAU,UAAUJ,EAAKI,EAAOD,CAAE,EAC7CE,EAAK,MAAQ,UAAA,CAAa,OAAOL,EAAKG,EAAI,CAAA,CAAE,CAAE,GAEzCE,EAGLX,GAAUA,EAAO,QACnBA,EAAO,QAAUO,EACRN,GAAUA,EAAO,IAC1BA,EAAO,UAAA,CAAa,OAAOM,CAAK,CAAE,EAElC,KAAK,OAASA,CAGhB,GACEK,GAC+BZ,EAC9B,yGC3EF,SAAU5oC,EAAQ6mC,EAAMiD,EAAI,CAK7B,IAAIC,EAAQ,IACRC,EAAS,EACTr1B,EAAS,GACTs1B,EAAU,SACVC,EAAaJ,EAAK,IAAIC,EAAOC,CAAM,EACnCG,EAAeL,EAAK,IAAI,EAAGn1B,CAAM,EACjCy1B,EAAWD,EAAe,EAC1BE,EAAON,EAAQ,EACfO,EAMJ,SAASC,EAAWpH,EAAMniC,EAASwpC,EAAQ,CACzC,IAAIvsC,EAAM,CAAA,EACV+C,EAAWA,GAAW,GAAQ,CAAE,QAAS,EAAI,EAAMA,GAAW,CAAA,EAG9D,IAAIypC,EAAYC,EAAOzzB,EACrBjW,EAAQ,QAAU,CAACmiC,EAAMwH,EAAS9D,CAAI,CAAC,EACtC1D,GAAgByH,EAAQ,EAAW,CAAC,EAAG3sC,CAAG,EAGzC4sC,EAAO,IAAIC,EAAK7sC,CAAG,EAInBsrC,EAAO,UAAA,CAIT,QAHI5xC,EAAIkzC,EAAK,EAAEb,CAAM,EACjBh0C,EAAIk0C,EACJvmC,EAAI,EACDhM,EAAIwyC,GACTxyC,GAAKA,EAAIgM,GAAKomC,EACd/zC,GAAK+zC,EACLpmC,EAAIknC,EAAK,EAAE,CAAC,EAEd,KAAOlzC,GAAKyyC,GACVzyC,GAAK,EACL3B,GAAK,EACL2N,KAAO,EAET,OAAQhM,EAAIgM,GAAK3N,CACrB,EAEE,OAAAuzC,EAAK,MAAQ,UAAa,CAAA,OAAOsB,EAAK,EAAE,CAAC,EAAI,CAAE,EAC/CtB,EAAK,MAAQ,UAAa,CAAA,OAAOsB,EAAK,EAAE,CAAC,EAAI,UAAY,EACzDtB,EAAK,OAASA,EAGdmB,EAAOC,EAASE,EAAK,CAAC,EAAGhE,CAAI,GAGrB7lC,EAAQ,MAAQwpC,GACpB,SAASjB,EAAMpG,EAAM4H,EAAczB,EAAK,CAUtC,OATIA,IAEEA,EAAM,GAAKJ,EAAKI,EAAOuB,CAAI,EAE/BtB,EAAK,MAAQ,UAAA,CAAa,OAAOL,EAAK2B,EAAM,CAAA,CAAE,CAAE,GAK9CE,GAAgBjB,EAAKG,CAAO,EAAIV,EAAapG,GAIrCoG,CACb,GACLA,EACAkB,EACA,WAAYzpC,EAAUA,EAAQ,OAAU,MAAQ8oC,EAChD9oC,EAAQ,KAAK,EAaf,SAAS8pC,EAAK7sC,EAAG,CACf,IAAI3G,EAAG0zC,EAAS/sC,EAAI,OAChB8qC,EAAK,KAAM7wC,EAAI,EAAG8K,EAAI+lC,EAAG,EAAIA,EAAG,EAAI,EAAG/wC,EAAI+wC,EAAG,EAAI,CAAA,EAMtD,IAHKiC,IAAU/sC,EAAM,CAAC+sC,GAAQ,GAGvB9yC,EAAI6xC,GACT/xC,EAAEE,CAAC,EAAIA,IAET,IAAKA,EAAI,EAAGA,EAAI6xC,EAAO7xC,IACrBF,EAAEE,CAAC,EAAIF,EAAEgL,EAAIqnC,EAAQrnC,EAAI/E,EAAI/F,EAAI8yC,CAAM,GAAK1zC,EAAIU,EAAEE,CAAC,EAAG,EACtDF,EAAEgL,CAAC,EAAI1L,GAIRyxC,EAAG,EAAI,SAASkC,EAAK,CAIpB,QAFI3zC,EAAGc,EAAI,EACPF,EAAI6wC,EAAG,EAAG/lC,EAAI+lC,EAAG,EAAG/wC,EAAI+wC,EAAG,EACxBkC,KACL3zC,EAAIU,EAAEE,EAAImyC,EAAQnyC,EAAI,CAAE,EACxBE,EAAIA,EAAI2xC,EAAQ/xC,EAAEqyC,GAASryC,EAAEE,CAAC,EAAIF,EAAEgL,EAAIqnC,EAAQrnC,EAAI1L,CAAE,IAAMU,EAAEgL,CAAC,EAAI1L,EAAG,EAExE,OAAAyxC,EAAG,EAAI7wC,EAAG6wC,EAAG,EAAI/lC,EACV5K,CAIR,GAAE2xC,CAAK,EAOV,SAASb,EAAK3xC,EAAGD,EAAC,CAChB,OAAAA,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EACRD,EAAE,EAAIC,EAAE,EAAE,MAAK,EACRD,EAOT,SAAS2f,EAAQ7E,EAAKwxB,EAAK,CACzB,IAAI1sC,EAAS,CAAA,EAAIg0C,EAAO,OAAO94B,EAAM+4B,EACrC,GAAIvH,GAASsH,GAAO,SAClB,IAAKC,KAAQ/4B,EACX,GAAI,CAAElb,EAAO,KAAK+f,EAAQ7E,EAAI+4B,CAAI,EAAGvH,EAAQ,CAAC,CAAC,CAAI,MAAW,CAAA,CAGlE,OAAQ1sC,EAAO,OAASA,EAASg0C,GAAO,SAAW94B,EAAMA,EAAM,KAQjE,SAASs4B,EAAOvH,EAAMllC,EAAG,CAEvB,QADImtC,EAAajI,EAAO,GAAIkI,EAAOroC,EAAI,EAChCA,EAAIooC,EAAW,QACpBntC,EAAIosC,EAAOrnC,CAAC,EACVqnC,GAASgB,GAASptC,EAAIosC,EAAOrnC,CAAC,EAAI,IAAMooC,EAAW,WAAWpoC,GAAG,EAErE,OAAO2nC,EAAS1sC,CAAG,EAQrB,SAAS2sC,GAAQ,CACf,GAAI,CACF,IAAIhpB,EACJ,OAAI0oB,IAAe1oB,EAAM0oB,EAAW,aAElC1oB,EAAMA,EAAImoB,CAAK,GAEfnoB,EAAM,IAAI,WAAWmoB,CAAK,GACzB/pC,EAAO,QAAUA,EAAO,UAAU,gBAAgB4hB,CAAG,GAEjD+oB,EAAS/oB,CAAG,CACpB,MAAW,CACV,IAAI0pB,EAAUtrC,EAAO,UACjBurC,EAAUD,GAAWA,EAAQ,QACjC,MAAO,CAAC,CAAC,IAAI,KAAMtrC,EAAQurC,EAASvrC,EAAO,OAAQ2qC,EAAS9D,CAAI,CAAC,CAClE,EAOH,SAAS8D,EAAS5oC,EAAC,CACjB,OAAO,OAAO,aAAa,MAAM,EAAGA,CAAC,EAgBvC,GANA2oC,EAAOZ,EAAK,OAAM,EAAIjD,CAAI,EAMS+B,EAAO,QAAS,CACjDA,EAAA,QAAiB2B,EAEjB,GAAI,CACFD,EAAakB,EACd,MAAY,CAAA,CACd,MAIC1B,EAAK,OAASG,CAAO,EAAIM,CAK3B,GAGG,OAAO,KAAS,IAAe,KAAOf,GACvC,CAAA,EACA,8BC/OEiC,GAAOD,GAKPE,GAASC,GAKTC,GAASC,GAQTC,GAAYC,GASZC,GAAUC,GAOVC,GAASC,GAITC,GAAKC,GAETD,GAAG,KAAOX,GACVW,GAAG,OAASV,GACZU,GAAG,OAASR,GACZQ,GAAG,UAAYN,GACfM,GAAG,QAAUJ,GACbI,GAAG,OAASF,GAEZ,IAAA3B,GAAiB6B,GClBjB,IAAAE,IAAA,UAAA,CAUE,SACIA,EAAA7c,EAAc8c,EAAsBprC,EACpCqrC,EAAqBrJ,EAAa,CACpC,KAAK,KAAO1T,EACZ,KAAK,OAAS8c,EACd,KAAK,MAAQprC,EACb,KAAK,QAAU,IACf,KAAK,UAAYqrC,EACb,KAAK,YACP,KAAK,MAAQ,KAAK,KAAO,KAAK,OAAS,EACvC,KAAK,MAAQ,KAAK,KAAO,KAAK,OAAS,GAEzC,IAAMC,EAAYtJ,GAAc,KAAK,OAAM,EAC3C,KAAK,OAASuJ,GAAAA,KAAgBD,EAAU,SAAQ,CAAE,EAI7C,OAAAH,EAAA,UAAA,UAAA,UAAA,CACL,GAAI,CAAC,MAAM,KAAK,OAAO,EAAG,CACxB,IAAM31C,EAAQ,KAAK,QACnB,YAAK,QAAU,IACRA,CACR,CAID,QAFIg2C,EAAiBC,EACjBC,EAAU,GACP,CAACA,GAAS,CACf,IAAI1I,EAAU,OAAEC,EAAU,OAAEpsC,EAAS,OACrC,GACEmsC,EAAK,EAAI,KAAK,OAAM,EAAK,EACzBC,EAAK,EAAI,KAAK,OAAM,EAAK,EACzBpsC,EAAImsC,EAAKA,EAAKC,EAAKA,QACZpsC,GAAK,GAAKA,IAAM,GAEzB,IAAMw1B,EAAM,KAAK,KAAK,GAAO,KAAK,IAAIx1B,CAAC,EAAIA,CAAC,EAC5C20C,EAAU,KAAK,KAAO,KAAK,OAASxI,EAAK3W,EACzCof,EAAU,KAAK,KAAO,KAAK,OAASxI,EAAK5W,GAErC,CAAC,KAAK,WAAa,KAAK,iBAAiBmf,CAAO,KAClDE,EAAU,GAEb,CAED,OAAI,CAAC,KAAK,WAAa,KAAK,iBAAiBD,CAAO,KAClD,KAAK,QAAU,KAAK,aAAaA,CAAO,GAEnC,KAAK,aAAaD,CAAO,GAI1BL,EAAY,UAAA,aAAZ,SAAa31C,EAAa,CAChC,OAAI,KAAK,OAAS,MAAQ,KAAK,QAAU,UAChCA,EAEF,KAAK,MAAMA,CAAK,GAIjB21C,EAAgB,UAAA,iBAAhB,SAAiB31C,EAAa,CACpC,OAAOA,GAAS,KAAK,OAASA,GAAS,KAAK,OAE/C21C,CAAA,GAAA,EAIDQ,IAAA,UAAA,CASE,SAAAA,EACIrP,EAAeW,EAAcj9B,EAC7BgiC,EAAa,CACf,KAAK,MAAQ1F,EACb,KAAK,KAAO,EAAIW,EAChB,KAAK,MAAQj9B,EAEb,IAAMsrC,EAAYtJ,GAAc,KAAK,OAAM,EAC3C,KAAK,MAAQuJ,GAAAA,KAAgBD,EAAU,SAAQ,CAAE,EACjD,KAAK,MAAQ,IAAIH,GAAY,EAAG,EAAGnrC,EAAO,GAAO,KAAK,MAAK,CAAE,EAEzDs8B,EAAQ,EACV,KAAK,EAAIA,EAAS,EAAI,EAEtB,KAAK,EAAIA,EAAS,EAAI,EAExB,KAAK,EAAI,EAAI,KAAK,KAAK,EAAI,KAAK,CAAC,EAI5B,OAAAqP,EAAA,UAAA,UAAA,UAAA,CAEL,QADIC,EAAYC,EAAY7I,EAAYxgC,EAAWspC,EAAWr1C,IACjD,CACX,GACE+L,EAAI,KAAK,MAAM,UAAS,EACxB/L,EAAI,EAAK,KAAK,EAAI+L,QACX/L,GAAK,GAMd,GALAA,GAAKA,EAAIA,EACTm1C,EAAKppC,EAAIA,EACTqpC,EAAK,EAAK,KAAQD,EAAKA,EACvB5I,EAAM,GAAM4I,EAAO,KAAK,GAAK,EAAIn1C,EAAI,KAAK,IAAIA,CAAC,GAC/Cq1C,EAAI,KAAK,MAAK,EACVA,EAAID,GAAM,KAAK,IAAIC,CAAC,EAAI9I,EAC1B,KAEH,CACD,OAAAvsC,EAAK,EAAI,KAAK,KAAQ,KAAK,EAAIA,EAC3B,KAAK,MAAQ,IACfA,GAAK,KAAK,IAAI,KAAK,MAAK,EAAI,EAAI,KAAK,KAAK,GAErC,KAAK,aAAaA,CAAC,GAGpBk1C,EAAY,UAAA,aAAZ,SAAan2C,EAAa,CAChC,OAAI,KAAK,QAAU,UACVA,EAEF,KAAK,MAAMA,CAAK,GAE1Bm2C,CAAA,GAAA,EAEDI,IAAA,UAAA,CAME,SAAAA,EACIpT,EAASF,EAASz4B,EAClBgiC,EAAoB,CADpBrJ,IAAA,SAAAA,EAAO,GAAEF,IAAA,SAAAA,EAAO,GADpB,IAkBCt8B,EAAA,KALC,GAQM,KAAA,eAAiB,UAAA,CACrB,OAACA,EAAK,OAAS,MAAQA,EAAK,QAAU,SAAU,EAnBlD,KAAK,IAAMw8B,EACX,KAAK,MAAQF,EAAME,EACnB,KAAK,MAAQ34B,EACTgiC,GAAQ,OACVA,EAAO,KAAK,OAAM,GAEhB,OAAOA,GAAS,WAClBA,EAAOA,EAAK,SAAQ,GAGlB,CAAC,KAAK,eAAc,GAAM,KAAK,OAAS,EAC1C,MAAM,IAAI,MACN,0BAAA,OAA0BrJ,EAAS,KAAA,EAAA,OAAAF,EAAiC,8BAAA,CAAA,EAE1E,KAAK,OAAS8S,GAAAA,KAAgBvJ,CAAI,EAO5B,OAAA+J,EAAY,UAAA,aAAZ,SAAav2C,EAAa,CAChC,OAAI,KAAK,eAAc,EACdA,EAEF,KAAK,MAAMA,CAAK,GAGzBu2C,EAAA,UAAA,UAAA,UAAA,CACE,OAAO,KAAK,aAAa,KAAK,IAAM,KAAK,MAAQ,KAAK,OAAM,CAAE,GAEjEA,CAAA,GAAA,EC/KD,SAASC,GACL5sC,EAAoBk9B,EAAeW,EACnCj9B,EAAsCgiC,EAAa,CAQrD,GATqC/E,IAAA,SAAAA,EAAQ,GAC3Cj9B,IAAA,SAAAA,EAAoC,WACtC4D,GAAmCxE,CAAK,EACpC69B,GAAQ,OACVA,EAAO,GAELj9B,GAAS,OACXA,EAAQ,WAENA,IAAU,WAAaA,IAAU,QACnC,MAAM,IAAI,MAAM,yBAAA,OAAyBA,CAAK,CAAE,EAIlD,QAFMisC,EAAS,IAAIN,GAAUrP,EAAOW,EAAMj9B,EAAOgiC,CAAI,EAC/CltB,EAAMub,GAAOjxB,EAAOY,CAAK,EACtB,EAAI,EAAG,EAAI8U,EAAI,OAAO,OAAQ,IACrCA,EAAI,OAAO,CAAC,EAAIm3B,EAAO,UAAS,EAElC,OAAOn3B,EAAI,SAAQ,CACrB,CAEO,IAAMo3B,GAA8Bx1C,EAAG,CAAC,aAAYs1C,EAAA,CAAC,ECtB5D,SAASG,GACL/sC,EAAoBkvB,EAAU8d,EAAYpsC,EAC1CgiC,EAAa,CAEf,GAHsB1T,IAAA,SAAAA,EAAQ,GAAE8d,IAAA,SAAAA,EAAU,GAE1CxoC,GAAmCxE,CAAK,EACpCY,GAAS,MAASA,IAAuB,OAC3C,MAAM,IAAI,MAAM,yBAAA,OAAyBA,CAAK,CAAE,EAKlD,QAHMqsC,EACF,IAAIlB,GAAY7c,EAAM8d,EAAQpsC,EAAO,GAAuBgiC,CAAI,EAC9DltB,EAAMub,GAAOjxB,EAAOY,CAAK,EACtB,EAAI,EAAG,EAAI8U,EAAI,OAAO,OAAQ,IACrCA,EAAI,OAAO,CAAC,EAAIu3B,EAAU,UAAS,EAErC,OAAOv3B,EAAI,SAAQ,CACrB,CAEO,IAAMw3B,GAA+B51C,EAAG,CAAC,cAAay1C,EAAA,CAAC,EClB9D,SAASI,GACLntC,EAAoBY,EAA2BgiC,EAAa,CAC9D,GAAIhiC,GAAS,MAASA,IAAuB,OAC3C,MAAM,IAAI,MAAM,yBAAA,OAAyBA,CAAK,CAAE,EAElD,OAAOssC,GAAaltC,EAAO,EAAG,EAAGY,EAAOgiC,CAAI,CAC9C,CAEO,IAAMwK,GAAuC91C,EAAG,CAAC,sBAAqB61C,EAAA,CAAC,ECE9E,SAASE,GACLrtC,EAAoBstC,EAAYC,EAAY3sC,EAC5CgiC,EAAoB,CADA0K,IAAA,SAAAA,EAAU,GAAEC,IAAA,SAAAA,EAAU,GAAE3sC,IAAA,SAAAA,EAA2B,WAEzE4D,GAAmCxE,CAAK,EAGxC,QAFM0V,EAAMub,GAAOjxB,EAAOY,CAAK,EACzB4sC,EAAS,IAAIb,GAAcW,EAAQC,EAAQ,KAAM3K,CAAI,EAClD,EAAI,EAAG,EAAIltB,EAAI,OAAO,OAAQ,IACrCA,EAAI,OAAO,CAAC,EAAI83B,EAAO,UAAS,EAElC,OAAO93B,EAAI,SAAQ,CACrB,CAEO,IAAM+3B,GAAgCn2C,EAAG,CAAC,eAAc+1C,EAAA,CAAC,EClBhE,SAASK,GACP1tC,EAAoBstC,EAAgBC,EAClC3K,EAAoB,CAEtB,OAAO6K,GAAcztC,EAAOstC,EAAQC,EAAQ,QAAS3K,CAAI,CAC3D,CAEO,IAAM+K,GAAmCr2C,EAAG,CAAC,kBAAiBo2C,EAAA,CAAC,ECRhE,SAAUE,GACZt0C,EAAemkC,EAAcjnC,EAC7BoK,EAAoC,CACtC,GAF+BpK,IAAA,SAAAA,EAAQ,GACrCoK,IAAA,SAAAA,EAAoC,WAClCpK,IAAS,EACX,MAAM,IAAI,MAAM,4BAA4B,EAG9C,IAAMoJ,EAAoB,CAAC,MAAKtG,EAAE,KAAImkC,EAAE,KAAIjnC,EAAE,MAAKoK,CAAA,EAEnD,OAAOwf,EAAO,UAAUjT,GAAO,CAAA,EAC3BvN,CAAgC,CACtC,CCZA,SAASiuC,GAAwB1vC,EAAmB,CAClD,IAAMu+B,EAASvX,EAAgBhnB,EAAO,QAAS,MAAM,EAE/Cd,EAAqB,CAAC,MAAOq/B,CAAM,EACzC,OAAOtc,EAAO,UAAUhT,GAAM/P,CAAmC,CACnE,CAEO,IAAMs0B,GAAuBr6B,EAAG,CAAC,MAAKu2C,EAAA,CAAC,ECT9C,SAASC,GAA8B1qC,EAAe,CACpD,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,YAAY,EAEzC/F,EAA2B,CAAC,EAAGyoB,CAAE,EACvC,OAAO1F,EAAO,UAAU/S,GAAYhQ,CAAmC,CACzE,CACO,IAAM0wC,GAA6Bz2C,EAAG,CAAC,YAAWw2C,EAAA,CAAC,ECL1D,SAASE,GAAwB5qC,EAAe,CAC9C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,MAAM,EAEnC/F,EAAqB,CAAC,EAAGyoB,CAAE,EAEjC,OAAO1F,EAAO,UAAU9S,GAAMjQ,CAAmC,CACnE,CAEO,IAAM4wC,GAAuB32C,EAAG,CAAC,MAAK02C,EAAA,CAAC,ECR9C,SAASE,GAAyB9qC,EAAe,CAC/C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,OAAO,EAEpC/F,EAAsB,CAAC,EAAGyoB,CAAE,EAElC,OAAO1F,EAAO,UAAU1S,GAAOrQ,CAAmC,CACpE,CAEO,IAAM8wC,GAAwB72C,EAAG,CAAC,OAAM42C,EAAA,CAAC,ECWhD,SAASE,GACLhrC,EAAiBnB,EAAsB,CACzC,IAAM6jB,EAAKX,EAAgB/hB,EAAG,IAAK,SAAS,EAEtC/F,EAAwB,CAAC,EAAGyoB,CAAE,EAC9BlmB,EAAsB,CAAC,KAAMqC,CAAI,EAEvC,OAAOme,EAAO,UACVzS,GAAStQ,EACTuC,CAAgC,CACtC,CAEO,IAAMg1B,GAA0Bt9B,EAAG,CAAC,SAAQ82C,EAAA,CAAC,ECzCpD,SAASC,GAAWjrC,EAAsB,CACxC,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,SAAS,EAC5CgZ,OAAAA,EACI0J,EAAG,OAAS,EACZ,UAAA,CAAM,MAAA,qDAAA,OAAqDA,EAAG,KAAI,GAAA,CAA5D,CAA+D,EAClE8O,GAAQ9O,EAAI,CAAC,CACtB,CAEO,IAAMwoB,GAA4Bh3C,EAAG,CAAC,WAAU+2C,EAAA,CAAC,ECNxD,SAASE,GAAWnrC,EAAwBnB,EAAsB,CAChE,IAAM6jB,EAAKX,EAAgB/hB,EAAG,IAAK,SAAS,EAC5CgZ,OAAAA,EACI0J,EAAG,OAAS,EACZ,UAAA,CAAM,MAAA,qDAAA,OAAqDA,EAAG,KAAI,GAAA,CAA5D,CAA+D,EAClE8O,GAAQ9O,EAAI7jB,CAAI,CACzB,CAEO,IAAMusC,GAA4Bl3C,EAAG,CAAC,WAAUi3C,EAAA,CAAC,ECRxD,SAASE,GAAWrrC,EAAwBnB,EAAsB,CAChE,IAAM6jB,EAAKX,EAAgB/hB,EAAG,IAAK,SAAS,EAC5CgZ,OAAAA,EACI0J,EAAG,OAAS,EACZ,UAAA,CAAM,MAAA,qDAAA,OAAqDA,EAAG,KAAI,GAAA,CAA5D,CAA+D,EAClE8O,GAAQ9O,EAAI7jB,CAAI,CACzB,CAEO,IAAMysC,GAA4Bp3C,EAAG,CAAC,WAAUm3C,EAAA,CAAC,ECRxD,SAASE,GAAWvrC,EAAwBnB,EAAsB,CAChE,IAAM6jB,EAAKX,EAAgB/hB,EAAG,IAAK,SAAS,EAC5CgZ,OAAAA,EACI0J,EAAG,OAAS,EACZ,UAAA,CAAM,MAAA,qDAAA,OAAqDA,EAAG,KAAI,GAAA,CAA5D,CAA+D,EAClE8O,GAAQ9O,EAAI7jB,CAAI,CACzB,CAEO,IAAM2sC,GAA4Bt3C,EAAG,CAAC,WAAUq3C,EAAA,CAAC,ECAxD,SAASE,GAAyBzrC,EAAe,CAC/C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,OAAO,EACpC/F,EAAsB,CAAC,EAAGyoB,CAAE,EAElC,OAAO1F,EAAO,UAAUxS,GAAOvQ,CAAmC,CACpE,CAEO,IAAMktB,GAAwBjzB,EAAG,CAAC,OAAMu3C,EAAA,CAAC,ECPhD,SAASC,GAAyB1rC,EAAe,CAC/C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,QAAS,SAAS,EAE/C/F,EAAsB,CAAC,EAAGyoB,CAAE,EAElC,OAAO1F,EAAO,UAAUvS,GAAOxQ,CAAmC,CACpE,CACO,IAAM0xC,GAAwBz3C,EAAG,CAAC,OAAMw3C,EAAA,CAAC,ECNhD,SAASE,GAAwB5rC,EAAe,CAC9C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,MAAM,EAEnC/F,EAAqB,CAAC,EAAGyoB,CAAE,EAEjC,OAAO1F,EAAO,UAAUlS,GAAM7Q,CAAmC,CACnE,CAEO,IAAM4xC,GAAuB33C,EAAG,CAAC,MAAK03C,EAAA,CAAC,ECuB9C,SAASE,GACL9rC,EAAiB+rC,EACjBC,EAAsCzrC,EACtC1I,EAAqBwvB,EACrBnC,EAAkC,CADbmC,IAAA,SAAAA,EAAA,CAAqC,EAAG,CAAC,GAC9DnC,IAAA,SAAAA,EAAkC,QACpC,IAAMxC,EAAKX,EAAgB/hB,EAAG,IAAK,iBAAiB,EAC9CisC,EACFlqB,EAAgBgqB,EAAiB,kBAAmB,iBAAiB,EACnEG,EACFnqB,EAAgBiqB,EAAiB,kBAAmB,iBAAiB,EAErEpjB,EAAMlG,EACNmG,EAAe,GAMnB,GALInG,EAAG,OAAS,IACdmG,EAAe,GACfD,EAAMH,EAAQ/F,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAG1DwC,IAAe,OACjB,MAAM,IAAI,MACN,oFACmB,EAGzBlM,EACI4P,EAAI,OAAS,EACb,UAAM,CAAA,MAAA,2DACF,QAAA,OAAQA,EAAI,KAAI,GAAA,CADd,CACiB,EAC3B5P,EACIizB,EAAiB,OAAS,EAC1B,UAAM,CAAA,MAAA,kEACF,YAAA,OAAYA,EAAiB,KAAI,GAAA,CAD/B,CACkC,EAC5CjzB,EACIkzB,EAAiB,OAAS,EAC1B,UAAM,CAAA,MAAA,kEACF,YAAA,OAAYD,EAAiB,KAAI,GAAA,CAD/B,CACkC,EAC5CjzB,EACIkzB,EAAiB,MAAM,CAAC,IAAM,EAC9B,UAAA,CACI,MAAA,qEACA,uBAAuB,OAAAA,EAAiB,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EAC3DlzB,EACIkzB,EAAiB,MAAM,CAAC,IAAM,EAC9B,UAAA,CAAM,MAAA,+DACF,6BAA6B,OAAAA,EAAiB,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EAEjE,IAAMtmB,EAAaqmB,EAAiB,MAAM,CAAC,EACrCE,EAAoBF,EAAiB,MAAM,CAAC,EAClDjzB,EACIkzB,EAAiB,MAAM,CAAC,IAAMtmB,EAAaumB,EAC3C,UAAA,CACI,MAAA,qEACA,WAAW,OAAAvmB,EAAaumB,EAAqB,IAAA,EAC7C,WAAW,OAAAD,EAAiB,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EAE/C,IAAM1mB,EAAY8M,GACd1J,EAAKqjB,EAAkB1rC,EAAS1I,EAAKqtB,EAAYmC,CAAQ,EACvD+kB,EAAkB,EAClB95B,EACFod,GAAOlK,EAAW0mB,EAAkBE,EAAiB,QAASlnB,CAAU,EAE5E,OAAI2D,EACKJ,EAAQnW,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAEzDA,CACT,CAEO,IAAM+5B,GAAkCn4C,EAAG,CAAC,iBAAgB43C,EAAA,CAAC,ECxFpE,SAAeQ,GACXtsC,EAAsBnM,EAAoB,qHACtC,OAAA6uB,EAAKX,EAAgB/hB,EAAG,IAAK,WAAW,EACxCitB,EAAKlL,EAAgBluB,EAAG,IAAK,WAAW,EAE9CmlB,EACI0J,EAAG,QAAUuK,EAAG,MAChB,UAAA,CAAM,MAAA,kDACF,OAAAvK,EAAG,MAAiB,WAAA,EAAA,OAAAuK,EAAG,MAAS,IAAA,CAAA,CAAA,EAExCjU,EACI0J,EAAG,OAAS,EAAG,UAAA,CAAM,MAAA,qCAAA,OAAqCA,EAAG,MAAK,IAAA,CAA7C,CAAiD,EAE1E1J,EACIiU,EAAG,OAAS,EAAG,UAAA,CAAM,MAAA,qCAAA,OAAqCA,EAAG,MAAK,IAAA,CAA7C,CAAiD,EAE5D,CAAA,EAAMvK,EAAG,KAAI,CAAE,SAAvB,OAAA6pB,EAAQ71C,EAAe,KAAA,EACf,CAAA,EAAMu2B,EAAG,KAAI,CAAE,SAI7B,IAJMuf,EAAQ91C,EAAe,KAAA,EACvB+1C,EAAO,IAAI,IAAID,CAAK,EAEtBE,EAAa,EACRn4C,EAAI,EAAGA,EAAIg4C,EAAM,OAAQh4C,IAC3Bk4C,EAAK,IAAIF,EAAMh4C,CAAC,CAAC,GACpBm4C,IAMJ,IAFM7e,EAAS,IAAIhV,GAAa,CAAC6zB,CAAU,EAAGhqB,EAAG,KAAK,EAChDlB,EAAU,IAAI3I,GAAa,CAAC6zB,CAAU,EAAG,OAAO,EAC7Cn4C,EAAI,EAAGhC,EAAI,EAAGgC,EAAIg4C,EAAM,OAAQh4C,IAClCk4C,EAAK,IAAIF,EAAMh4C,CAAC,CAAC,IACpBs5B,EAAO,OAAOt7B,CAAC,EAAIg6C,EAAMh4C,CAAC,EAC1BitB,EAAQ,OAAOjvB,CAAC,EAAIgC,EACpBhC,KAGJ,MAAO,CAAA,EAAA,CAACs7B,EAAO,SAAQ,EAAIrM,EAAQ,SAAQ,CAAE,CAAC,MAC/C,CACM,IAAMmrB,GAAiBL,GClD9B,SAASM,GAAwB5sC,EAAe,CAC9C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,MAAM,EACnC/F,EAAqB,CAAC,EAAGyoB,CAAE,EACjC,OAAO1F,EAAO,UAAU9R,GAAMjR,CAAmC,CACnE,CACO,IAAM4yC,GAAuB34C,EAAG,CAAC,MAAK04C,EAAA,CAAC,ECL9C,SAASE,GAAuB9sC,EAAe,CAC7C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,MAAO,SAAS,EAE7C/F,EAAoB,CAAC,EAAGyoB,CAAE,EAEhC,OAAO1F,EAAO,UAAUhS,GAAK/Q,CAAmC,CAClE,CACO,IAAM8yC,GAAsB74C,EAAG,CAAC,KAAI44C,EAAA,CAAC,ECP5C,SAASE,GAAwBhtC,EAAe,CAC9C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,MAAM,EACnC/F,EAAqB,CAAC,EAAGyoB,CAAE,EAEjC,OAAO1F,EAAO,UAAU/R,GAAMhR,CAAmC,CACnE,CACO,IAAMgzC,GAAuB/4C,EAAG,CAAC,MAAK84C,EAAA,CAAC,ECf9C,SAASE,GACLltC,EAAwBiqB,EAAe3rB,EAAY,CACrD,IAAMokB,EAAKX,EAAgB/hB,EAAG,IAAK,SAAS,EAC5CgZ,OAAAA,EACI0J,EAAG,OAAS,EACZ,UAAA,CACI,MAAA,mDAAA,OAAmDA,EAAG,KAAI,SAAA,CAA1D,CAAmE,EACpEwH,GAAMxH,EAAI,CAACuH,CAAK,EAAG,CAAC3rB,CAAI,CAAC,CAClC,CACO,IAAM6uC,GAA0Bj5C,EAAG,CAAC,SAAQg5C,EAAA,CAAC,ECTpD,SAASE,GACLptC,EAAwBiqB,EACxB3rB,EAAsB,CACxB,IAAMokB,EAAKX,EAAgB/hB,EAAG,IAAK,SAAS,EAC5CgZ,OAAAA,EACI0J,EAAG,OAAS,EACZ,UAAA,CACI,MAAA,mDAAA,OAAmDA,EAAG,KAAI,SAAA,CAA1D,CAAmE,EACpEwH,GAAMxH,EAAIuH,EAAO3rB,CAAI,CAC9B,CACO,IAAM+uC,GAA0Bn5C,EAAG,CAAC,SAAQk5C,EAAA,CAAC,ECVpD,SAASE,GACLttC,EAAwBiqB,EACxB3rB,EAA8B,CAChC,IAAMokB,EAAKX,EAAgB/hB,EAAG,IAAK,SAAS,EAC5CgZ,OAAAA,EACI0J,EAAG,OAAS,EACZ,UAAA,CACI,MAAA,mDAAA,OAAmDA,EAAG,KAAI,SAAA,CAA1D,CAAmE,EACpEwH,GAAMxH,EAAIuH,EAAO3rB,CAAI,CAC9B,CACO,IAAMivC,GAA0Br5C,EAAG,CAAC,SAAQo5C,EAAA,CAAC,ECVpD,SAASE,GACLxtC,EAAwBiqB,EACxB3rB,EAAsC,CACxC,IAAMokB,EAAKX,EAAgB/hB,EAAG,IAAK,SAAS,EAC5CgZ,OAAAA,EACI0J,EAAG,OAAS,EACZ,UAAA,CACI,MAAA,mDAAA,OAAmDA,EAAG,KAAI,SAAA,CAA1D,CAAmE,EACpEwH,GAAMxH,EAAIuH,EAAO3rB,CAAI,CAC9B,CACO,IAAMmvC,GAA0Bv5C,EAAG,CAAC,SAAQs5C,EAAA,CAAC,ECSpD,SAASE,GAA2B9R,EAAsB/+B,EAAQ,CAARA,IAAA,SAAAA,EAAA,IACxD,IAAMg/B,EAAU9Z,EAAgB6Z,EAAQ,SAAU,UAAW,SAAS,EAKtE,GAHI/+B,IAAQ,KACVA,EAAMg/B,EAAQ,KAAO,GAEnBh/B,IAAQg/B,EAAQ,KAAO,EACzB,MAAM,MACF,4DACA,mBAAA,OAAmBA,EAAQ,KAAI,eAAA,EAAA,OAAgBh/B,CAAG,CAAE,EAG1D,IAAM5C,EAAwB,CAAC,OAAQ4hC,CAAO,EACxCr/B,EAAsB,CAAC,IAAGK,CAAA,EAEhC,OAAOmgB,EAAO,UACVvR,GAASxR,EACTuC,CAAgC,CACtC,CAEO,IAAMw/B,GAA0B9nC,EAAG,CAAC,SAAQw5C,EAAA,CAAC,EC3BpD,SAASC,GAAK5yC,EAAa,CACzB4C,EACI5C,EAAM,QAAU,YAChB,UAAM,CAAA,MAAA,qDACF,WAAA,OAAWA,EAAM,MAAK,GAAA,CADpB,CACuB,EAEjC,IAAMd,EAAoB,CAAC,MAAKc,CAAA,EAEhC,OAAOiiB,EAAO,UAAUtW,GAAKzM,CAAmC,CAClE,CAEO,IAAM2zC,GAAsB15C,EAAG,CAAC,KAAIy5C,EAAA,CAAC,ECX5C,SAASE,GAAM9yC,EAAa,CAC1B4C,EACI5C,EAAM,QAAU,YAChB,UAAM,CAAA,MAAA,sDACF,WAAA,OAAWA,EAAM,MAAK,GAAA,CADpB,CACuB,EAEjC,IAAMd,EAAqB,CAAC,MAAKc,CAAA,EAEjC,OAAOiiB,EAAO,UAAU3V,GAAMpN,CAAmC,CACnE,CAEO,IAAM6zC,GAAuB55C,EAAG,CAAC,MAAK25C,EAAA,CAAC,ECJ9C,SAASE,GAAOhzC,EAAa,CAC3B,IAAMizC,EAAqBjzC,EAAM,MAAMA,EAAM,MAAM,OAAS,CAAC,EACvDkzC,EAAQlzC,EAAM,KAAOizC,EACvBrtC,EACJ,GAAIqtC,GAAsB,EAAG,CAC3B,IAAME,EAAezlB,EAAQ1tB,EAAO,CAACkzC,EAAOD,CAAkB,CAAC,EAC/DrtC,EAAMmtC,GAAKI,CAAY,CACxB,KAAM,CAGL,IAAM1d,EAAc,CAACyd,EAAO,GAAKD,EAAqB,EAAE,EAClDG,EAAY1lB,EAAQ8F,GAAKxzB,CAAK,EAAG,CAACkzC,EAAOD,CAAkB,CAAC,EAC5DI,EAAY3lB,EAAQ+F,GAAKzzB,CAAK,EAAG,CAACkzC,EAAOD,CAAkB,CAAC,EAE5DK,EACF7c,GAAQtH,GAAMikB,EAAW,CAAC,EAAG,CAAC,EAAG,CAACF,EAAOD,EAAqB,CAAC,CAAC,EAAG,CAAC,EAClEM,EAA0BzkB,GAC5B2H,GAAQtH,GAAMkkB,EAAW,CAAC,EAAG,CAAC,EAAG,CAACH,EAAOD,EAAqB,CAAC,CAAC,EAAG,CAAC,EACpEjX,GAAO,EAAE,CAAC,EAERtiC,EAAI80B,GAAO,CAAC4kB,EAAWE,CAAa,EAAG,CAAC,EACxC95C,EAAIg1B,GAAO,CAAC6kB,EAAWE,CAAa,EAAG,CAAC,EACxCJ,EACFzlB,EAAQmG,GAAQn6B,EAAGF,CAAC,EAAG,CAACi8B,EAAY,CAAC,EAAGA,EAAY,CAAC,CAAC,CAAC,EAC3D7vB,EAAMmtC,GAAKI,CAAY,CACxB,CAGD,GAFAvtC,EAAM4tB,GAAK5tB,CAAG,EAEV5F,EAAM,OAAS,GAAKA,EAAM,MAAM,CAAC,IAAM,EAAG,CAC5C,IAAMwzC,EAAO5tC,EACP6tC,EAAQzzC,EAAM,MAAM,CAAC,EAC3B4F,EAAM8nB,EAAQ9nB,EAAK,CAAC6tC,EAAO7tC,EAAI,MAAM,CAAC,EAAI6tC,EAAO7tC,EAAI,MAAM,CAAC,CAAC,CAAC,EAC9D4tC,EAAK,QAAO,CACb,CACD,OAAO5tC,CACT,CAEO,IAAM8tC,GAAwBv6C,EAAG,CAAC,OAAM65C,EAAA,CAAC,ECxBhD,SAASW,GACL1uC,EAAsB2uC,EAAkC9vC,EAAQ,CAARA,IAAA,SAAAA,EAAQ,GAClE,IAAM6jB,EAAKX,EAAgB/hB,EAAG,IAAK,OAAO,EAEpC/F,EAAuB,CAAC,EAAGyoB,CAAE,EAC7B4G,EAAoB,CAAC,gBAAeqlB,EAAE,KAAI9vC,CAAA,EAEhD,OAAOme,EAAO,UACHxR,GAAQvR,EACRqvB,CAA+B,CAC5C,CAEO,IAAMslB,GAAwB16C,EAAG,CAAC,OAAMw6C,EAAA,CAAC,EC1BhD,SAASG,GAAM9zC,EAAe+zC,EAAkB,CAC9CnxC,EACI5C,EAAM,QAAU,UAChB,UAAA,CAAM,MAAA,mDAAA,OAAmDA,EAAM,KAAK,CAA9D,CAAgE,EAE1E,IAAIizC,EAAqBjzC,EAAM,MAAMA,EAAM,MAAM,OAAS,CAAC,EACrDkzC,EAAQlzC,EAAM,KAAOizC,EAEvBe,EACJ,GAAID,GAAa,MAAQA,EAAYd,EAAoB,CAEvD,IAAM/jB,EAAQlvB,EAAM,MAAM,IAAI,SAAA9G,EAAC,CAAI,MAAA,EAAA,CAAC,EAC9BqK,EAAOvD,EAAM,MAAM,IAAI,SAAA9G,EAAC,CAAI,OAAAA,CAAA,CAAC,EACnCqK,EAAKvD,EAAM,MAAM,OAAS,CAAC,EAAI+zC,EAC/BC,EAAgB7kB,GAAMnvB,EAAOkvB,EAAO3rB,CAAI,EACxC0vC,EAAqBc,CACtB,SAAUA,GAAa,MAAQA,EAAYd,EAAoB,CAE9D,IAAMgB,EAAaj0C,EAAM,MAAM,IAAI,SAAA9G,EAAC,CAAI,OAAAA,CAAA,CAAC,EACzC+6C,EAAWj0C,EAAM,MAAM,OAAS,CAAC,EAAI+zC,EAAYd,EACjDe,EAAgBxlB,GAAO,CAACxuB,EAAOm5B,GAAM8a,CAAU,CAAC,EAAGj0C,EAAM,MAAM,OAAS,CAAC,EACzEizC,EAAqBc,CACtB,MACCC,EAAgBh0C,EAIlB,IAAMk0C,EAAalb,GAAUgb,CAAa,EACpCb,EACFzlB,EAAQmG,GAAQmgB,EAAeE,CAAU,EAAG,CAAChB,EAAOD,CAAkB,CAAC,EAErErtC,EAAMitC,GAAIM,CAAY,EAGtBgB,EAAO,KAAK,MAAMlB,EAAqB,CAAC,EAAI,EAC5CmB,EAAa5gB,GAAK5tB,CAAG,EACrByuC,EAAa5gB,GAAK7tB,CAAG,EACrB0uC,EAAuBT,GACzBO,EAAY,CAACD,EAAMlB,EAAqBkB,CAAI,EAC5CC,EAAW,MAAM,OAAS,CAAC,EACzBG,EAAuBV,GACzBQ,EAAY,CAACF,EAAMlB,EAAqBkB,CAAI,EAC5CE,EAAW,MAAM,OAAS,CAAC,EAEzB5e,EAAcue,EAAc,MAAM,MAAK,EAC7C,OAAAve,EAAYue,EAAc,MAAM,OAAS,CAAC,EAAIG,EAEvCzmB,EACHmG,GAAQygB,EAAqB,CAAC,EAAGC,EAAqB,CAAC,CAAC,EAAG9e,CAAW,CAC5E,CAEO,IAAM+e,GAAuBr7C,EAAG,CAAC,MAAK26C,EAAA,CAAC,EC9C9C,SAASW,GACLpxC,EAAsB9L,EAAoB,OACxC2wB,EAAKlB,EAAgB3jB,EAAG,IAAK,mBAAmB,EAChD8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,mBAAmB,EACpDoE,EAAAlC,EAAWymB,GAAegI,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAEvsB,EAAA,CAAA,EAAEwsB,EAAExsB,EAAA,CAAA,EAEPw8B,GAA2BjQ,EAAG,MAAOC,EAAG,KAAK,EAE7C,IAAMjpB,EAAkC,CAAC,EAAGgpB,EAAI,EAAGC,CAAE,EAC/C1mB,EAAQ,CAAA,EAEd,OAAOwgB,EAAO,UACVjR,GAAmB9R,EAAqCuC,CAAK,CACnE,CAEO,IAAMizC,GAAoCv7C,EAAG,CAAC,mBAAkBs7C,EAAA,CAAC,EC3BxE,SAASE,GAA2B1vC,EAAsBnB,EAAe,CACvE,IAAM6jB,EAAKX,EAAgB/hB,EAAG,IAAK,UAAW,mBAAmB,EACjE,OAAOyoB,EAAQ/F,EAAI1jB,GAAa0jB,EAAG,MAAO7jB,CAAI,EAAE,QAAQ,CAC1D,CAEO,IAAM8wC,GAA0Bz7C,EAAG,CAAC,SAAQw7C,EAAA,CAAC,ECFpD,SAASE,GACLjxB,EAA8B9f,EAAQ,CAARA,IAAA,SAAAA,EAAQ,GACxC,IAAMukB,EACFjB,GAAqBxD,EAAS,UAAW,QAAS,mBAAmB,EAEzE3F,EACIoK,EAAS,QAAU,EAAG,UAAA,CAAM,MAAA,sCAAA,CAAsC,EAElEA,EAAS,OAAS,GACpBpK,EACIna,GAAQukB,EAAS,CAAC,EAAE,KAAM,UAAM,CAAA,MAAA,oCAAA,CAAoC,EAG1E,IAAMnpB,EAAqBmpB,EACrB5mB,EAAmB,CAAC,KAAIqC,CAAA,EAE9B,OAAOme,EAAO,UACVzT,GAAMtP,EACNuC,CAAgC,CACtC,CAEO,IAAMqzC,GAAwB37C,EAAG,CAAC,OAAM07C,EAAA,CAAC,ECxBhD,SAASE,GAAwB9vC,EAAiB85B,EAAW,CAAXA,IAAA,SAAAA,EAAW,GAC3D,IAAMpX,EAAKX,EAAgB/hB,EAAG,IAAK,MAAM,EAEnC/F,EAAqB,CAAC,EAAGyoB,CAAE,EAC3BlmB,EAAmB,CAAC,MAAKs9B,CAAA,EAE/B,OAAO9c,EAAO,UACVhQ,GAAM/S,EACNuC,CAAgC,CACtC,CACO,IAAMpJ,GAAuBc,EAAG,CAAC,MAAK47C,EAAA,CAAC,ECU9C,SAASC,GACL/vC,EAAsBiqB,EAAiB9zB,EAAeoK,EACtDyvC,EAAeC,EAAaC,EAAkBC,EAC9CC,EAAkB,CADlBJ,IAAA,SAAAA,EAAa,GAAEC,IAAA,SAAAA,EAAW,GAAEC,IAAA,SAAAA,EAAgB,GAAEC,IAAA,SAAAA,EAAe,GAC7DC,IAAA,SAAAA,EAAkB,GACpB,IAAM1tB,EAAKX,EAAgB/hB,EAAG,IAAK,eAAgB,mBAAmB,EAEhE/F,EAA6B,CAAC,EAAGyoB,CAAE,EACnClmB,EAA2B,CAC/B,MAAKytB,EACL,IAAG9zB,EACH,QAAOoK,EACP,UAASyvC,EACT,QAAOC,EACP,aAAYC,EACZ,YAAWC,EACX,eAAcC,GAGhB,OAAOpzB,EAAO,UACV/Q,GAAchS,EACduC,CAAgC,CACtC,CAEO,IAAM6zC,GAA+Bn8C,EAAG,CAAC,cAAa67C,EAAA,CAAC,EC7C9D,SAASO,GAAuBtwC,EAAe,CAC7C,IAAM0iB,EAAKX,EAAgB/hB,EAAG,IAAK,MAAO,SAAS,EAE7C/F,EAAoB,CAAC,EAAGyoB,CAAE,EAEhC,OAAO1F,EAAO,UAAU1Q,GAAKrS,CAAmC,CAClE,CACO,IAAMs2C,GAAsBr8C,EAAG,CAAC,KAAIo8C,EAAA,CAAC,WC8J5B35C,GACZ4G,EAAyCX,EACzCY,EAAgB,CAClB,IAAM0kB,EAAgBd,GAAW7jB,EAAQC,CAAK,EAC9C,OAAOk5B,GAAWn5B,EAAQX,EAAOslB,EAAe1kB,CAAK,CACvD,CCxKgB,SAAAgzC,GAASjzC,EAAsBC,EAAgB,CAC7DW,GAAcZ,CAAM,EACpB,IAAM2kB,EAAgBd,GAAW7jB,EAAQC,CAAK,EAC9C,GAAI0kB,EAAc,SAAW,EAC3B,MAAM,IAAI,MAAM,oDAAoD,EAEtE,IAAMtlB,EAAkB,KACxB,OAAO85B,GAAWn5B,EAAQX,EAAOslB,EAAe1kB,CAAK,CACvD,UCDgBizC,GACZlzC,EAAsBX,EACtBY,EAAgB,CAElB,GADAW,GAAcZ,CAAM,EAChBX,GAAS,MAAQA,EAAM,SAAW,EACpC,MAAM,IAAI,MAAM,+CAA+C,EAEjE,IAAMslB,EAAgBd,GAAW7jB,EAAQC,CAAK,EAC9C,GAAI0kB,EAAc,SAAW,GAAKA,EAAc,SAAW,EACzD,MAAM,IAAI,MACN,gEAAgE,EAEtE,GAAIA,EAAc,SAAW,GAAKtlB,GAAS,KACzC,MAAM,IAAI,MACN,8EACuB,EAE7B,OAAO85B,GAAWn5B,EAAQX,EAAOslB,EAAe1kB,CAAK,CACvD,UClBgBkzC,GACZnzC,EAAsBX,EACtBY,EAAgB,CAElB,GADAW,GAAcZ,CAAM,EAChBX,GAAS,MAAQA,EAAM,SAAW,EACpC,MAAM,IAAI,MAAM,iDAAiD,EAEnE,IAAMslB,EAAgBd,GAAW7jB,EAAQC,CAAK,EAC9C,GAAI0kB,EAAc,SAAW,GAAKA,EAAc,SAAW,EACzD,MAAM,IAAI,MACN,kEAAkE,EAExE,GAAIA,EAAc,SAAW,GAAKtlB,GAAS,KACzC,MAAM,IAAI,MACN,yEACkB,EAExB,OAAO85B,GAAWn5B,EAAQX,EAAOslB,EAAe1kB,CAAK,CACvD,UClBgBmzC,GACZpzC,EAAsBX,EACtBY,EAAgB,CAElB,GADAW,GAAcZ,CAAM,EAChBX,GAAS,MAAQA,EAAM,SAAW,EACpC,MAAM,IAAI,MAAM,gDAAgD,EAElE,IAAMslB,EAAgBd,GAAW7jB,EAAQC,CAAK,EAC9C,GAAI0kB,EAAc,SAAW,GAAKA,EAAc,SAAW,EACzD,MAAM,IAAI,MACN,oEAAoE,EAE1E,GAAIA,EAAc,SAAW,GAAKtlB,GAAS,KACzC,MAAM,IAAI,MACN,yEACkB,EAExB,OAAO85B,GAAWn5B,EAAQX,EAAOslB,EAAe1kB,CAAK,CACvD,UClBgBozC,GACZrzC,EAAsBX,EACtBY,EAAgB,CAElB,GADAW,GAAcZ,CAAM,EAChBX,GAAS,MAAQA,EAAM,SAAW,EACpC,MAAM,IAAI,MAAM,gDAAgD,EAElE,IAAMslB,EAAgBd,GAAW7jB,EAAQC,CAAK,EAC9C,GAAI0kB,EAAc,SAAW,GAAKA,EAAc,SAAW,EACzD,MAAM,IAAI,MACN,sEACqC,EAE3C,GAAIA,EAAc,SAAW,GAAKtlB,GAAS,KACzC,MAAM,IAAI,MACN,yEACkB,EAExB,OAAO85B,GAAWn5B,EAAQX,EAAOslB,EAAe1kB,CAAK,CACvD,UCnBgBqzC,GACZtzC,EACAX,EACAY,EAAgB,CAElB,GADAW,GAAcZ,CAAM,EAChBX,GAAS,MAAQA,EAAM,SAAW,EACpC,MAAM,IAAI,MAAM,+CAA+C,EAEjE,IAAMslB,EAAgBd,GAAW7jB,EAAQC,CAAK,EAC9C,GAAI0kB,EAAc,SAAW,GAAKA,EAAc,SAAW,EACzD,MAAM,IAAI,MACN,wEACiB,EAEvB,GAAIA,EAAc,SAAW,GAAKtlB,GAAS,KACzC,MAAM,IAAI,MACN,yEACkB,EAExB,OAAAA,EAAQA,GACJslB,EACGwU,GAAWn5B,EAAQX,EAAOslB,EAAe1kB,CAAK,CACvD,UC3CgBszC,GACZl0C,EAAiB4kB,EAAiBuvB,EAAe,CACnD,IAAMC,EAAYxvB,EAAQ,KAAO,EAAKA,EAAQ,MAAMA,EAAQ,KAAO,CAAC,EAAI,EAClEyvB,EAAYzvB,EAAQ,KAAO,EAAKA,EAAQ,KAAO,EAAI,EAEnD0vB,EAAa,wDACf,wCAAwC,OAAAH,EAAQ,KAAK,EACrD,oBAAA,OAAoBvvB,EAAQ,MAAK,WAAA,EAAA,OAAY5kB,CAAK,EAClD,eAAA,OAAeo0C,EAAQ,kBAAA,EAAA,OAAmBC,EAAQ,GAAA,EAEtD,GAAIF,EAAQ,KAAOE,EACjB,MAAM,IAAI,MAAMC,EAAa,kBAAkB,OAAAD,EAAY,IAAA,CAAA,EAE7D,GAAIr0C,EAAM,OAASo0C,GAAYD,EAAQ,KAAOE,GAC5C,MAAM,IAAI,MACNC,EACA,0BAA0B,OAAAF,GAAYD,EAAQ,KAAOE,EAAS,CAAE,EAEtE,GAAIF,EAAQ,OAASE,EAAWr0C,EAAM,OAASo0C,EAC7C,MAAM,IAAI,MACNE,EAAa,mBAAmB,OAAAD,EAAWr0C,EAAM,OAASo0C,CAAQ,CAAE,EAE1E,QAAS3+C,EAAI,EAAGA,EAAI4+C,EAAU,EAAE5+C,EAC9B,GAAI0+C,EAAQ,MAAM1+C,CAAC,IAAMmvB,EAAQ,MAAMnvB,CAAC,EACtC,MAAM,IAAI,MACN6+C,EACA,kBAAA,OAAkB7+C,EAAO,KAAA,EAAA,OAAA0+C,EAAQ,MAAM1+C,CAAC,EAAC,qBAAA,EAAA,OAAsBA,EAC3D,KAAA,EAAA,OAAAmvB,EAAQ,MAAMnvB,CAAC,EAAC,IAAA,CAAI,EAGhC,QAASA,EAAI,EAAGA,EAAI0+C,EAAQ,KAAOE,EAAU,EAAE5+C,EAC7C,GAAI0+C,EAAQ,MAAM1+C,EAAI4+C,CAAQ,IAAMr0C,EAAMvK,EAAI2+C,CAAQ,EACpD,MAAM,IAAI,MACNE,EACA,kBAAkB,OAAA7+C,EAAI4+C,EAClB,KAAA,EAAA,OAAAF,EAAQ,MAAM1+C,EAAI4+C,CAAQ,EAAC,aAAA,EAAA,OAAc5+C,EAAI4+C,EAAQ,KAAA,EAAA,OACrDr0C,EAAMvK,EAAI4+C,CAAQ,EAAI,GAAA,CAAA,CAGpC,UAgBgBE,GACZJ,EAAiBvvB,EAAiB5kB,EAAe,CACnD,GAAI4kB,EAAQ,KAAO,EACjB,MAAM,IAAI,MACN,6DACA,qBAAA,OAAqBA,EAAQ,KAAI,GAAA,CAAG,EAE1C,GAAIuvB,EAAQ,KAAO,EACjB,MAAM,IAAI,MACN,6DACA,qBAAA,OAAqBA,EAAQ,KAAI,GAAA,CAAG,EAE1C,GAAIvvB,EAAQ,QAAU,QACpB,MAAM,IAAI,MAAM,0DAAA,OACZA,EAAQ,KAAK,CAAE,EAErB,GAAI5kB,EAAM,OAAS,EACjB,MAAM,IAAI,MACN,6DAAA,OAA6DA,CAAK,CAAE,EAG1E,GAAIA,EAAM,SAAW,EAAG,CACtB,GAAI4kB,EAAQ,OAAS,EACnB,MAAM,IAAI,MAAM,sDAAA,OACZA,EAAQ,KAAK,CAAE,EAErB,GAAIuvB,EAAQ,OAAS,EACnB,MAAM,IAAI,MAAM,sDAAA,OACZA,EAAQ,KAAK,CAAE,CAEtB,CAEDD,GAAoBl0C,EAAO4kB,EAASuvB,CAAO,CAC7C,CCvDA,SAASK,GACLz6C,EAA8B6qB,EAC9BuvB,EAA0B,CAC5B,IAAMM,EAAUtvB,EAAgBprB,EAAQ,SAAU,qBAAqB,EACjEoiC,EACFhX,EAAgBP,EAAS,UAAW,sBAAuB,OAAO,EAChE8vB,EAAWvvB,EAAgBgvB,EAAS,UAAW,qBAAqB,EAE1E,GADAQ,GAA8BD,EAAUvY,EAAUsY,EAAQ,KAAK,EAC3DA,EAAQ,QAAUC,EAAS,MAC7B,MAAM,IAAI,MACN,iEAAA,OACID,EAAQ,MAAK,OAAA,EAAA,OAAQC,EAAS,MAAK,GAAA,CAAG,EAGhD,IAAMr3C,EAAoC,CACxC,OAAQo3C,EACR,QAAStY,EACT,QAASuY,GAEL90C,EAAkC,CAAA,EAGxC,OAAOwgB,EAAO,UACHrS,GAAqB1Q,EACrBuC,CAAgC,CAC7C,CAEO,IAAMg1C,GAAsBt9C,EAAG,CAAC,qBAAoBk9C,EAAA,CAAC,ECnC5D,SAASK,GACLzxC,EAAiB0b,EAAOg2B,EAAa,CAApBh2B,IAAA,SAAAA,EAAK,GAAEg2B,IAAA,SAAAA,EAAa,IACvC,IAAMhvB,EAAKX,EAAgB/hB,EAAG,IAAK,MAAM,EACzC,GAAI0iB,EAAG,OAAS,EACd,MAAM,IAAI,MAAM,oDAAoD,EAEtE,IAAMivB,EAAUjvB,EAAG,MAAMA,EAAG,MAAM,OAAS,CAAC,EAE5C,GAAIhH,EAAI,EACN,MAAM,IAAI,MAAM,6CAAA,OAA6CA,CAAC,CAAE,EAGlE,GAAIA,EAAIi2B,EACN,MAAM,IAAI,MACN,uDAAA,OAAuDA,EAAW,IAAA,EAClE,WAAW,OAAAj2B,CAAC,CAAE,EAGpB,IAAMzhB,EAAqB,CAAC,EAAGyoB,CAAE,EAC3BlmB,EAAmB,CAAC,EAACkf,EAAE,OAAMg2B,CAAA,EAE7Bh7C,EAAAlC,EAAoBwoB,EAAO,UAC7BvQ,GAAMxS,EACNuC,CAAgC,EAAW,CAAA,EAFxCe,EAAM7G,EAAA,CAAA,EAAE8qB,EAAO9qB,EAAA,CAAA,EAItB,MAAO,CAAC,OAAM6G,EAAE,QAAOikB,CAAA,CACzB,CAEO,IAAMowB,GAAuB19C,EAAG,CAAC,MAAKu9C,EAAA,CAAC,EClC9C,SAASI,GACLj1C,EAAoBkvB,EAAU8d,EAAYpsC,EAC1CgiC,EAAa,CAEf,GAHsB1T,IAAA,SAAAA,EAAQ,GAAE8d,IAAA,SAAAA,EAAU,GAE1CxoC,GAAmCxE,CAAK,EACpCY,GAAS,MAASA,IAAuB,OAC3C,MAAM,IAAI,MAAM,mCAAmC,EAKrD,QAHMqsC,EACF,IAAIlB,GAAY7c,EAAM8d,EAAQpsC,EAAO,GAAsBgiC,CAAI,EAC7DltB,EAAMub,GAAOjxB,EAAOY,CAAK,EACtB,EAAI,EAAG,EAAI8U,EAAI,OAAO,OAAQ,IACrCA,EAAI,OAAO,CAAC,EAAIu3B,EAAU,UAAS,EAErC,OAAOv3B,EAAI,SAAQ,CACrB,CAEO,IAAMw/B,GAAkC59C,EAAG,CAAC,iBAAgB29C,EAAA,CAAC,ECgBpE,SAASE,GACL/xC,EAAiBnB,EAAQ,CAARA,IAAA,SAAAA,EAAQ,GAC3B,IAAM6jB,EAAKX,EAAgB/hB,EAAG,IAAK,SAAU,mBAAmB,EAChErC,EAAO+kB,EAAG,KAAO,EAAG,UAAA,CAAM,MAAA,sCAAA,CAAsC,EAEhE,IAAMzoB,EAAuB,CAAC,EAAGyoB,CAAE,EAC7BlmB,EAAqB,CAAC,KAAIqC,CAAA,EAC1BnI,EAAAlC,EAAoBwoB,EAAO,UAC7BpQ,GAAQ3S,EACRuC,CAAgC,EAAkB,CAAA,EAF/Ce,EAAM7G,EAAA,CAAA,EAAE8qB,EAAO9qB,EAAA,CAAA,EAGtB,MAAO,CAAC,OAAM6G,EAAE,QAAOikB,CAAA,CACzB,CAEO,IAAMwwB,GAAyB99C,EAAG,CAAC,QAAO69C,EAAA,CAAC,EC5ClD,SAASE,GACLjyC,EAAiBkyC,EAAiCC,EAAmB,CACvE,IAAMzvB,EAAKX,EAAgB/hB,EAAG,IAAK,oBAAoB,EACjDoyC,EACFrwB,EAAgBmwB,EAAY,aAAc,qBAAsB,OAAO,EAC3Ev0C,EAAOe,GAAMyzC,CAAW,EAAG,UAAM,CAAA,MAAA,kCAAkC,CAAA,EAEnE,IAAMl4C,EAAmC,CAAC,EAAGyoB,EAAI,WAAY0vB,CAAW,EAClE51C,EAAiC,CAAC,YAAW21C,CAAA,EAEnD,OAAOn1B,EAAO,UACVlQ,GAAoB7S,EACpBuC,CAAgC,CACtC,CAEO,IAAM61C,GAAqCn+C,EAAG,CAAC,oBAAmB+9C,EAAA,CAAC,ECnB1E,SAASK,GAAStyC,EAAsBnB,EAAQ,CAARA,IAAA,SAAAA,EAAQ,GAC9C,IAAM6jB,EAAKX,EAAgB/hB,EAAG,IAAK,UAAW,mBAAmB,EACjEgZ,EACIna,GAAQ,CAAC6jB,EAAG,MAAM,QAAU7jB,EAAO6jB,EAAG,MAAM,OAC5C,UACI,CAAA,MAAA,UAAA,OAAU7jB,EAAI,eAAA,EAAA,OAAgB6jB,EAAG,MAAM,OAAM,IAAA,EAAA,OAAKA,EAAG,MAAM,OAAM,GAAA,CAAjE,CAAoE,EAE5E,IAAMzoB,EAAuB,CAAC,MAAOyoB,CAAE,EACjClmB,EAAqB,CAAC,KAAIqC,CAAA,EAEhC,OAAOme,EAAO,UACVnQ,GAAQ5S,EACRuC,CAAgC,CACtC,CAEO,IAAM+1C,GAA0Br+C,EAAG,CAAC,SAAQo+C,EAAA,CAAC,ECFpC,SAAAE,GACZ1V,EAAmCv/B,EAAyB,CAC9D,OAAO+/B,GAAaR,EAAgBv/B,EAAQ,OAAO,CACrD,CCrBM,SAAUk1C,GACZt4B,EAAyBL,EAAkBxkB,EAC3CkI,EAAgB,CADS,OAAAsc,IAAA,SAAAA,EAAgB,IAEpCkD,EAAO,aAAa7C,EAAcL,EAAWxkB,EAAMkI,CAAK,CAEjE,CCnBgB,SAAAk1C,GAAUC,EAAqBC,EAAoB,CAEjE,QADMpxB,EAAU,CAAA,EACPjtB,EAAI,EAAGA,EAAIq+C,EAAS,OAAQr+C,IAC/Bq+C,EAASr+C,CAAC,GACZitB,EAAQ,KAAKjtB,CAAC,EAOlB,QAHMs+C,EAAWhlB,GAAO8kB,EAAW,OAAO,EAEpC10B,EAAM4P,GAAO,CAACrM,EAAQ,OAAQmxB,EAAU,MAAM,EAAG,OAAO,EACrDp+C,EAAI,EAAGA,EAAIitB,EAAQ,OAAQjtB,IAAK,CACvC,IAAM8kB,EAAMw5B,EAAS,WAAWrxB,EAAQjtB,CAAC,CAAC,EACpCkM,EAASlM,EAAIo+C,EAAU,OAC7B10B,EAAI,OAAO,IAAI5E,EAAK5Y,CAAM,CAC3B,CACD,OAAOwd,EAAI,SAAQ,CACrB,CCCA,SAAe60B,GAAYvf,EAA4B,qGAC/C,OAAAC,EACFzR,EAAgBwR,EAAW,YAAa,aAAc,MAAM,EACnD,CAAA,EAAMC,EAAW,KAAI,CAAE,SAA9B,OAAA/zB,EAAO/I,EAAuB,KAAA,EAC9B4b,EAAMogC,GAAUlf,EAAW,MAAO/zB,CAAI,EACxC8zB,IAAcC,GAChBA,EAAW,QAAO,EAEpB,CAAA,EAAOlhB,CAAG,MACX,CAEM,IAAMygC,GAAaD,GCP1B,SAAeE,GACXr8C,EAA2B+vC,EAC3B7nC,EAAa,yHAcf,IAbMwyC,EAAUtvB,EAAgBprB,EAAQ,SAAU,UAAU,EACtDs8C,EAAQlxB,EAAgB2kB,EAAM,OAAQ,WAAY,MAAM,EAExDwM,EAAWr0C,GAAe,EAC1Bs0C,EAAUF,EAAM,KAChBG,EAAc/B,EAAQ,MAE5Br4B,EAAYm6B,EAAU,EAAG,UAAA,CAAM,MAAA,uBAAA,CAAuB,EACtDxkB,GACIykB,EAAY,MAAMF,EAAUA,EAAWC,CAAO,EAAGF,EAAM,MACvD,mEAAmE,EAEnEI,EAAc,EACT9+C,EAAI2+C,EAAU3+C,EAAI2+C,EAAWC,EAAS5+C,IAC7C8+C,GAAeD,EAAY7+C,CAAC,EAExB,OAAA++C,EACFF,EAAY,MAAM,EAAGF,CAAQ,EACxB,OAAO,CAACG,CAAW,EAAGD,EAAY,MAAMF,EAAWC,CAAO,CAAC,EAC9DI,EAAiB9qB,EAAQ4oB,EAASiC,CAAiB,EACnDE,EAAe/qB,EAAQwqB,EAAO,CAAC,EAAE,CAAC,EACd,CAAA,EAAMF,GAAWS,CAAY,CAAC,SAAlD,OAAAC,EAAoB/8C,EAA8B,KAAA,EAClD8qB,EAAUmuB,GAAQ8D,EAAmB,CAAC,CAAC,CAAC,EAExCnhC,EAAM0mB,GAAOua,EAAgB/xB,EAAS0xB,CAAQ,EAGhDv8C,IAAW06C,GACbA,EAAQ,QAAO,EAEb3K,IAASuM,GACXA,EAAM,QAAO,EAEfzxB,EAAQ,QAAO,EACf+xB,EAAe,QAAO,EACtBC,EAAa,QAAO,EACpBC,EAAkB,QAAO,EAEzB,CAAA,EAAOnhC,CAAG,MACX,CAEM,IAAMohC,GAAmBV,GCoGhB,SAAAz8B,GACZuG,EAA6BpD,EAAe,CAC9C,OAAOsD,EAAO,KAAKF,EAAUpD,CAAE,CACjC,CAaM,SAAUi6B,GAAQp4B,EAA0B,CAChD,IAAMoD,EAAUxD,GAAsBI,CAAS,EAC/CoD,EAAQ,QAAQ,SAAAhoB,EAAU,CAAA,OAAAA,EAAO,QAAO,CAAd,CAAgB,CAC5C,UAuGgBi9C,IAAU,CACxB,OAAO52B,EAAO,WAChB,UA0DgBhP,IAAO,CACrB,OAAOgP,EAAO,OAChB,CCjUA,SAAS62B,GACL7zC,EAAiB8zC,EAAiBC,EAAmB,CACvD,IAAMrxB,EAAKX,EAAgB/hB,EAAG,IAAK,WAAW,EAgB9C,GAdI8zC,GAAQ,OACVA,EAAOpxB,EAAG,MAAM,IAAI,SAACruB,EAAG,EAAM,CAAA,OAAA,CAAA,CAAC,EAAE,QAAO,GAE1C2kB,EACI0J,EAAG,OAASoxB,EAAK,OACjB,UAAM,CAAA,MAAA,qCAAA,OAAqCpxB,EAAG,KAAO,GAAA,EACjD,6BAAA,OAA6BoxB,EAAI,GAAA,CAD/B,CACkC,EAC5CA,EAAK,QAAQ,SAAAj1C,EAAI,CACfma,EACIna,GAAQ,GAAKA,EAAO6jB,EAAG,KACvB,UAAA,CAAM,MAAA,+CAAA,OAA+CA,EAAG,KAAO,CAAC,EAC5D,YAAA,OAAYoxB,CAAI,CADd,CACgB,CAC5B,CAAC,EAEGpxB,EAAG,MAAQ,EACb,OAAOA,EAAG,MAAK,EAGjB,IAAMzoB,EAA0B,CAAC,EAAGyoB,CAAE,EAChClmB,EAAwB,CAAC,KAAIs3C,CAAA,EAEnC,OAAIpxB,EAAG,QAAU,YACRnM,GAAK,UAAA,CACV,IAAIkY,EAAQF,GAAK7L,CAAE,EACfgM,EAAQF,GAAK9L,CAAE,EACnB,OAAA+L,EAAQzR,EAAO,UACXrQ,GAAW,CAAC,EAAG8hB,CAAK,EACpBjyB,CAAgC,EACpCkyB,EAAQ1R,EAAO,UACXrQ,GAAW,CAAC,EAAG+hB,CAAK,EACpBlyB,CAAgC,EAChCu3C,IACFrlB,EAAQuM,GAAIvM,CAAK,GAEZE,GAAQH,EAAOC,CAAK,CAC7B,CAAC,EAGI1R,EAAO,UACVrQ,GAAW1S,EACXuC,CAAgC,CACtC,CAEO,IAAMw3C,GAA4B9/C,EAAG,CAAC,WAAU2/C,EAAA,CAAC,ECxCxD,SAASI,GACLhgD,EAAiB+L,EAAiBk0C,EAClC9gD,EAAsB+gD,EAAiB,CAAjBA,IAAA,SAAAA,EAAiB,IACzC,IAAMC,EAAKryB,EAAgB9tB,EAAG,IAAK,eAAe,EAC5CyuB,EAAKX,EAAgB/hB,EAAG,IAAK,eAAe,EAC5Cq0C,EAAStyB,EAAgBmyB,EAAO,QAAS,eAAe,EAE9Dh5B,GAAiBk5B,EAAI1xB,CAAE,EACvB1J,EACInC,GAAiBu9B,EAAG,MAAO1xB,EAAG,KAAK,EAAG,UAAA,CAAM,MAAA,2BAA2B,CAAA,EAE3E,IAAM4xB,EAAMvd,GAAO,CAAC,EACdwd,EAAgB7Y,GAAI4Y,EAAKD,CAAM,EAEjCG,EAAS3qB,GAAI6R,GAAIhZ,EAAI0xB,CAAE,EAAGG,CAAa,EAC3C,GAAIJ,EAAY,CACdn7B,EACI5lB,GAAQ,KAAM,UAAA,CAAM,MAAA,gDAAA,CAAgD,EACxE,IAAMqhD,EAAQ1yB,EAAgB3uB,EAAM,OAAQ,eAAe,EAC3DohD,EAAS7jC,GAAI6jC,EAAQ9Y,GAAI4Y,EAAK7d,GAAI4d,EAAQI,CAAK,CAAC,CAAC,CAClD,CACD,OAAOj+B,GAAI49B,EAAII,CAAM,CACvB,CAEO,IAAME,GAAgCxgD,EAAG,CAAC,eAAc+/C,EAAA,CAAC,ECnChE,SAASU,GACLnzB,EAA4BuvB,EAC5Bn0C,EAAkB,CACpBwE,GAAmCxE,CAAK,EACxC,IAAMm8B,EAAWhX,EAAgBP,EAAS,UAAW,YAAa,OAAO,EACnE8vB,EAAWvvB,EAAgBgvB,EAAS,UAAW,WAAW,EAChEQ,GAA8BD,EAAUvY,EAAUn8B,CAAK,EAEvD,IAAM3C,EAA0B,CAAC,QAAS8+B,EAAU,QAASuY,CAAQ,EAC/D90C,EAAwB,CAAC,MAAKI,CAAA,EAGpC,OAAOogB,EAAO,UACHtS,GAAWzQ,EACXuC,CAAgC,CAC7C,CAEO,IAAMo4C,GAA4B1gD,EAAG,CAAC,WAAUygD,EAAA,CAAC,EClClD,SAAUxD,GACZ0D,EAAuBC,EAAsBtkB,EAC7CukB,EAAqB,CACvB,GAAIF,EAAc,QAAU,QAC1B,MAAM,IAAI,MACN,2DACA,sBAAA,OAAsBA,EAAc,MAAK,GAAA,CAAG,EAElD,GAAIA,EAAc,KAAO,EACvB,MAAM,IAAI,MACN,uDACA,kBAAA,OAAkBA,EAAc,MAAK,GAAA,CAAG,EAG9C,IAAMG,EAAWH,EAAc,KAAO,EAAIA,EAAc,MAAM,CAAC,EAAI,EAC7DI,EAAUJ,EAAc,KAAO,EAAIA,EAAc,MAAM,CAAC,EAAI,EAElE,GAAIrkB,EAAY,SAAWykB,EACzB,MAAM,IAAI,MACN,iDACA,IAAA,OAAIzkB,EAAY,OAAM,eAAA,EAAA,OAAgBykB,EAAO,GAAA,CAAG,EAGtD,IAAMC,EAAYJ,EAAa,KAC/B,GAAI,EAAEA,EAAa,OAAS,GACtBA,EAAa,OAAS,GAAKI,IAAcF,GAC7C,MAAM,IAAI,MACN,oCACA,GAAA,OAAGF,EAAa,MAAK,qBAAA,EAAA,OAAsBE,EAAQ,GAAA,CAAG,EAG5D,GAAIF,EAAa,QAAUC,EAAc,MACvC,MAAM,IAAI,MAAM,mDAAmD,CAEvE,CCEA,SAASI,GACLN,EAAkCC,EAClCtkB,EAA0BzzB,EAAmC,CAAnCA,IAAA,SAAAA,EAAmC,GAC/DqE,GAAmCovB,CAAW,EAE9C,IAAM4kB,EACFrzB,EAAgB8yB,EAAe,gBAAiB,gBAAiB,OAAO,EACtEQ,EAAgBtzB,EAClB+yB,EAAc,eAAgB,gBAAiB,mBAAmB,EAChEnQ,EAAgB5iB,EAClBhlB,EAAc,eAAgB,gBAAiBs4C,EAAc,KAAK,EAEtEC,GACIF,EAAgBC,EAAe7kB,EAAamU,CAAa,EAE7D,IAAM1qC,EAA8B,CAClC,cAAem7C,EACf,aAAcC,EACd,aAAc1Q,GAGVnoC,EAA4B,CAAC,YAAWg0B,CAAA,EAE9C,OAAOxT,EAAO,UACVlR,GAAe7R,EACfuC,CAAgC,CACtC,CAEO,IAAM+4C,GAAgCrhD,EAAG,CAAC,eAAcihD,EAAA,CAAC,ECjChE,SAASK,GAAUx1C,EAAsBwhB,EAA0B,CACjE,IAAMuX,EAAWhX,EAAgBP,EAAS,UAAW,WAAY,OAAO,EAClEkB,EAAKX,EAAgB/hB,EAAG,IAAK,WAAY,mBAAmB,EAE5D/F,EAAyB,CAAC,OAAQyoB,EAAI,QAASqW,CAAQ,EAE7D,OAAO/b,EAAO,UAAU/V,GAAUhN,CAAmC,CACvE,CAEO,IAAMw7C,GAA2BvhD,EAAG,CAAC,UAASshD,EAAA,CAAC,EC3CtC,SAAAE,GAAc11C,EAAW21C,EAAqB,CAC5D,GAAIA,GAAc,KAChB,OAAO31C,EAAE,MAAM,MAAK,EAEtB,GAAI6W,GAAiB7W,EAAE,MAAO21C,CAAU,EACtC,OAAOA,EAET,GAAI31C,EAAE,MAAM,SAAW21C,EAAW,OAAQ,CAExC,QADMC,EAAyB,CAAA,EACtBrhD,EAAI,EAAGA,EAAIyL,EAAE,MAAM,OAAQzL,IAC9BohD,EAAWphD,CAAC,GAAK,MAAQyL,EAAE,MAAMzL,CAAC,GAAK,KACzCqhD,EAAa,KAAK51C,EAAE,MAAMzL,CAAC,CAAC,EAE5BqhD,EAAa,KAAKD,EAAWphD,CAAC,CAAC,EAGnC,OAAOqhD,CACR,CAED,OAAOD,CACT,CCIA,SAASE,GACL71C,EAAsB81C,EAAcH,EACpCnW,EAAoB,CACtB,IAAM9c,EAAKX,EAAgB/hB,EAAG,IAAK,SAAS,EAU5C,GARAgZ,EACI0J,EAAG,QAAU,UACb,UAAM,CAAA,MAAA,8DACF,qBAAA,OAAqBA,EAAG,MAAK,kBAAA,CAD3B,CAC6C,EACvD1J,EACI88B,GAAQ,GAAKA,EAAO,EACpB,UAAA,CAAM,MAAA,qDAAqD,OAAAA,EAAI,GAAA,CAAzD,CAA4D,EAElEA,IAAS,EACX,OAAO91C,aAAa2Z,GAAS+I,EAAG,MAAK,EAAKA,EAG5C,IAAMqzB,EAAcL,GAAchzB,EAAIizB,CAAU,EAC1CK,EAAW,EAAIF,EACf3jC,EAAaxB,GACfioB,GAAMpiB,GAAI6zB,GAAc0L,EAAa,EAAG,EAAG,UAAWvW,CAAI,EAAGwW,CAAQ,CAAC,EACtEA,CAAQ,EAEZ,OAAOnsB,GAAInH,EAAIvQ,CAAU,CAC3B,CAEO,IAAM8jC,GAA0B/hD,EAAG,CAAC,SAAQ2hD,EAAA,CAAC,EC1D9C,SAAUK,GAAoBljD,EAAa,CAE/C,OAAO,KAAK,MAAM,KAAK,IAAI,EAAG,KAAK,KAAK,KAAK,IAAIA,CAAK,EAAI,KAAK,IAAI,CAAG,CAAC,CAAC,CAAC,CAC3E,UAEgBmjD,GACZC,EAAsBh4C,EAAW9L,EAAS,CAG5C,QAFM+jD,EAAO,EAAID,EAAe,EAC1BE,EAAY,IAAI,aAAaF,CAAY,EACtC7hD,EAAI,EAAGA,EAAI6hD,EAAc,EAAE7hD,EAAG,CACrC,IAAMgiD,EAAU,EAAM,KAAK,GAAKhiD,GAAM6hD,EAAeC,EAAO,GAC5DC,EAAU/hD,CAAC,EAAI6J,EAAI9L,EAAI,KAAK,IAAIikD,CAAM,CACvC,CACD,OAAO/F,GAAS8F,EAAW,SAAS,CACtC,CCMA,SAAeE,GACXC,EAA2BC,EAAuBh7B,EAAK,CAAL,OAAAA,IAAA,SAAAA,EAAK,wHACnD,OAAAi7B,EAAe50B,EAAgB00B,EAAa,cAAe,QAAQ,EACnEG,EAAW70B,EAAgB20B,EAAS,UAAW,QAAQ,EAE7D/4C,EACIg5C,EAAa,KAAO,EACpB,UAAM,CAAA,MAAA,+DACF,WAAA,OAAWA,EAAa,IAAI,CAD1B,CAC4B,EACtCh5C,EACIg5C,EAAa,KAAO,IAAMC,EAAS,KACnC,UAAA,CAAM,MAAA,mFAEF,GAAG,OAAAD,EAAa,KAAyB,oBAAA,EAAA,OAAAC,EAAS,IAAI,CAAE,CAAA,EAChE94C,GACI64C,EAAa,MAAM,MAAM,EAAGA,EAAa,MAAM,OAAS,CAAC,EACzDC,EAAS,MACT,yFACgC,EAC9BjF,EAAUgF,EAAa,MAAMA,EAAa,MAAM,OAAS,CAAC,EAChEh5C,EACI+d,EAAI,GAAKA,GAAKi2B,EACd,UAAM,CAAA,MAAA,iEACF,cAAA,OAAcA,EAAqB,aAAA,EAAA,OAAAj2B,CAAC,CADlC,CACoC,EAEtB,CAAA,EAAMi7B,EAAa,KAAI,CAAE,SAA3C,OAAAE,EAAkB7/C,EAAyB,KAAA,EAC7B,CAAA,EAAM4/C,EAAS,KAAI,CAAE,SAOzC,IAPME,EAAc9/C,EAAqB,KAAA,EAInCN,EAAAlC,EAAgB,CAACqiD,EAAgB,OAASlF,EAASA,CAAO,EAAC,CAAA,EAA1D1D,EAAKv3C,EAAA,CAAA,EAAE4H,EAAI5H,EAAA,CAAA,EACZqgD,EAAYz3C,GAAuB,OAAQ2uC,CAAK,EAE7C37C,EAAI,EAAGA,EAAI27C,EAAO37C,IAAK,CAI9B,IAHMmO,EAASnO,EAAIgM,EACbmB,EAAOo3C,EAAgB,SAASp2C,EAAQA,EAASnC,CAAI,EACrD04C,EAAmD,CAAA,EAChDziD,EAAI,EAAGA,EAAIkL,EAAK,OAAQlL,IAC/ByiD,EAAU,KAAK,CAAC,MAAOv3C,EAAKlL,CAAC,EAAG,MAAOA,CAAC,CAAC,EAK3C,IAHAyiD,EAAU,KAAK,SAAC54C,EAAG9L,EAAM,CAAA,OAAAA,EAAE,MAAQ8L,EAAE,KAAZ,CAAiB,EAE1C24C,EAAUzkD,CAAC,EAAI,EACNiC,EAAI,EAAGA,EAAImnB,EAAGnnB,IACrB,GAAIyiD,EAAUziD,CAAC,EAAE,QAAUuiD,EAAYxkD,CAAC,EAAG,CACzCykD,EAAUzkD,CAAC,EAAI,EACf,KACD,CAEJ,CAED,OAAImkD,IAAgBE,GAClBA,EAAa,QAAO,EAElBD,IAAYE,GACdA,EAAS,QAAO,EAIX,CAAA,EAAAjgD,GAAOogD,EAAWH,EAAS,MAAO,MAAM,CAAM,MACtD,CAEM,IAAMK,GAAcT,GCvD3B,SAASU,GACLl3C,EAAMkd,EAAOoI,EACb/kB,EACA1I,EACAqtB,EACAoD,EAAwC,CADxCpD,IAAA,SAAAA,EAAkC,QAEpC,IAAI0D,EAAM5oB,EACNA,EAAE,OAAS,IACb4oB,EAAMH,EAAQzoB,EAAG,CAAC,EAAGA,EAAE,MAAM,CAAC,EAAGA,EAAE,MAAM,CAAC,EAAGA,EAAE,MAAM,CAAC,CAAC,CAAC,GAE1D,IAAIowB,EAAOlT,EACPkT,EAAK,OAAS,IAChBA,EAAO3H,EAAQvL,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAE/DlE,EACI4P,EAAI,OAAS,EACb,UAAM,CAAA,MAAA,iEACF,GAAA,OAAGA,EAAI,MAAK,GAAA,CADV,CACa,EACvB5P,EACIoX,EAAK,OAAS,EACd,UAAM,CAAA,MAAA,8DACF,GAAA,OAAGA,EAAK,MAAK,GAAA,CADX,CACc,EACxBpX,EACIsM,EAAY,SAAW,EACvB,UAAM,CAAA,MAAA,mEACF,GAAA,OAAGA,EAAW,GAAA,CADZ,CACe,EACzB,IAAMkK,EAAUtK,IAAe,OAAS0D,EAAI,MAAM,CAAC,EAAIA,EAAI,MAAM,CAAC,EAC5DyH,EAAWnL,IAAe,OAASkL,EAAK,MAAM,CAAC,EAAIA,EAAK,MAAM,CAAC,EACrEpX,EACIwW,IAAYlK,EAAY,CAAC,EACzB,UAAA,CAAM,MAAA,4CAAA,OAA4CkK,EAAgB,SAAA,EAC9D,gCAAgC,OAAAlK,EAAY,CAAC,EAAC,GAAA,CAD5C,CAC+C,EACzDtM,EACIqX,IAAa/K,EAAY,CAAC,EAC1B,UAAA,CAAM,MAAA,0CAAA,OAA0C+K,EAAiB,SAAA,EAC7D,kCAAkC,OAAA/K,EAAY,CAAC,EAAC,IAAA,CAD9C,CACkD,EAC5DwD,GAAoC,kBAAmBjxB,EAAKywB,CAAe,EAC3E,IAAMruB,EAAqC,CAAC,EAAG2uB,EAAK,GAAIwH,CAAI,EACtD5zB,EACF,CAAC,QAAO+D,EAAE,IAAG1I,EAAE,WAAUqtB,EAAE,gBAAeoD,EAAE,YAAWhD,CAAA,EAG3D,OAAOtI,EAAO,UACH9X,GAAsBjL,EACtBuC,CAAgC,CAC7C,CAEO,IAAM26C,GAAuCjjD,EAAG,CAAC,sBAAqBgjD,EAAA,CAAC,WC7D9DE,GACZl6B,EAAYrpB,EAAWwjD,EAAsB,CAC/C,GAAIA,GAAc,MAAQA,IAAe,SACvC,OAAOn6B,EAET,GAAIm6B,IAAe,OACjB,OAAOxtB,GAAI3M,EAAI9pB,GAAKS,CAAC,CAAC,EAExB,MAAM,IAAI,MACN,gDAAA,OAAgDwjD,EAAU,GAAA,CAAG,CACnE,CAGgB,SAAAC,GACZ9c,EAAc+c,EAAoB,CACpC,IAAIjlC,EAAMilC,EACJC,EACFC,GAAgCjd,EAAK,MAAO+c,EAAa,KAAK,EAClE,OAAIC,EAAW,OAAS,IACtBllC,EAAM+kB,GAAI/kB,EAAKklC,CAAU,GAEpB/uB,EAAQnW,EAAKkoB,EAAK,KAAK,CAChC,CAEM,SAAUkd,GACZ13C,EAAWq3C,EAAwBM,EACnCC,EAAuB,CACzB,GAAIP,IAAe,SACjB,OAAOr3C,EACF,GAAIq3C,IAAe,OACxB,OAAOxM,GAAK7qC,CAAC,EACR,GAAIq3C,IAAe,MACxB,OAAOjiB,GAAIp1B,CAAC,EACP,GAAIq3C,IAAe,QACxB,OAAOtM,GAAM/qC,CAAC,EACT,GAAIq3C,IAAe,QACxB,OAAOhU,GAAMrjC,EAAG23C,CAAsB,EACjC,GAAIN,IAAe,YACxB,OAAOtd,GAAU/5B,EAAG43C,CAAc,EAC7B,GAAIP,IAAe,UACxB,OAAOttB,GAAQ/pB,CAAC,EAElB,MAAM,IAAI,MAAM,4BAAA,OAA4Bq3C,EAAU,GAAA,CAAG,CAC3D,CAGO,IAAMQ,GAAa,SAACC,EAAuBT,EAAsB,CACtE,IAAMU,EAAeD,EAAgB,EACrC,MAAO,CAACC,GAAgBV,IAAe,QACzC,ECaA,SAASW,GAA0CthD,EAwBlD,OAvBCsJ,EAACtJ,EAAA,EACD44B,EAAM54B,EAAA,OACN6J,EAAO7J,EAAA,QACPmB,EAAGnB,EAAA,IACHuL,EAAmBvL,EAAA,WAAnBwuB,EAAajjB,IAAA,OAAA,OAAMA,EACnB8d,EAAArpB,EAAA,UAAAsuB,EAAYjF,IAAA,OAAA,CAAC,EAAG,CAAC,EAACA,EAClBuI,EAAe5xB,EAAA,gBACf8jC,EAAI9jC,EAAA,KACJspB,EAAAtpB,EAAA,WAAA2gD,EAAUr3B,IAAA,OAAG,SAAQA,EACrB23B,EAAsBjhD,EAAA,uBACtBkhD,EAAclhD,EAAA,eAgBd,GAFA2gD,EAAaA,GAAc,SAEvBQ,GAAW76B,EAAO,MAAM,cAAeq6B,CAAU,IAAM,GAAO,CAGhEr+B,EACIkM,IAAe,OACf,UAAM,CAAA,MAAA,4CAA4C,OAAAA,EAAiB,OAAA,EAC/D,wGACwC,CAAA,EAEhD,IAAI3xB,EAAS0kD,GACTj4C,EAAGsvB,EAAQ/uB,EAAS1I,EAAKqtB,EAAYF,EAAWsD,CAAe,EACnE,OAAIkS,GAAQ,OACVjnC,EAASijB,GAAIjjB,EAAQinC,CAAI,GAGpBkd,GACInkD,EAAQ8jD,EAAYM,EAAwBC,CAAc,CACtE,CAED,IAAMl1B,EAAKX,EAAgB/hB,EAAG,IAAK,SAAU,SAAS,EAChDuvB,EAAUxN,EAAgBuN,EAAQ,SAAU,SAAU,SAAS,EAEjE1G,EAAMlG,EACNmG,EAAe,GAEfnG,EAAG,OAAS,IACdmG,EAAe,GACfD,EAAMH,EAAQ/F,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAE9D1J,EACI4P,EAAI,OAAS,EACb,UAAM,CAAA,MAAA,6DACF,GAAA,OAAGA,EAAI,KAAI,GAAA,CADT,CACY,EACtB5P,EACIuW,EAAQ,OAAS,EACjB,UAAM,CAAA,MAAA,8DACF,GAAA,OAAGA,EAAQ,KAAI,GAAA,CADb,CACgB,EAC1BzG,GAAoC,eAAgBjxB,EAAKywB,CAAe,EACxE,IAAM4vB,EAAgBhzB,IAAe,OAAS0D,EAAI,MAAM,CAAC,EAAIA,EAAI,MAAM,CAAC,EACxE5P,EACIuW,EAAQ,MAAM,CAAC,IAAM2oB,EACrB,UAAA,CAAM,MAAA,oCAAA,OAAoCA,EAA4B,eAAA,EAClE,0BAA0B,OAAA3oB,EAAQ,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EACrDvW,EACI2P,GAAyCpoB,EAASykB,CAAS,EAC3D,UAAA,CAAM,MAAA,2DACF,eAAA,OAAezkB,EAA0B,kBAAA,EAAA,OAAAykB,EAAS,GAAA,CADhD,CACmD,EAE7D,IAAM8c,EAAWqW,GACbvvB,EAAI,MAAO2G,EAAQ,MAAOhvB,EAASykB,EAAWntB,EAAKywB,CAAe,EAElE8vB,EACA5d,GAAQ,OACV4d,EAAQr2B,EAAgByY,EAAM,OAAQ,cAAc,EACpDxjC,EAAAxC,EAAUymB,GAAem9B,EAAO11B,CAAE,EAAC,CAAA,EAAlC01B,EAAKphD,EAAA,CAAA,EAQFkuB,IAAe,OACjBmzB,GAA0CvW,EAAS,SAAUsW,EAAM,KAAK,GAExEp/B,EACIo/B,EAAM,MAAM,QAAU,EACtB,UAAA,CAAM,MAAA,sGAEF,QAAQ,OAAAA,EAAM,MAAM,OAAS,GAAA,CAAA,CAAA,EAErCp/B,EACIo/B,EAAM,MAAM,SAAW,GAAKA,EAAM,MAAM,CAAC,IAAMtW,EAAS,aACpDsW,EAAM,MAAM,CAAC,IAAM,EACvB,UAAA,CAAM,MAAA,sCAAA,OAAsCA,EAAM,MAAgB,WAAA,EAC9D,iDACA,IAAA,OAAItW,EAAS,YAAW,GAAA,CAFtB,CAEyB,IAIvC,IAAIwW,EACJ,GAAIX,GAA0B,KAAM,CAGlC,IAAMY,EAAaZ,EAAuB,MAO1C,GANA3+B,EACIu/B,EAAW,QAAU,GAAKA,EAAW,SAAW,EAChD,UAAA,CAAM,MAAA,sHAEF,QAAA,OAAQA,EAAW,OAAM,GAAA,CAFvB,CAE0B,EAEhCA,EAAW,SAAW,EAIxBv/B,EACIu/B,EAAW,CAAC,IAAM,GAAKA,EAAW,CAAC,IAAMzW,EAAS,YAClD,UAAM,CAAA,MAAA,mDACF,IAAA,OAAIyW,EAA0D,gDAAA,EAC9D,aAAA,OAAazW,EAAS,YAAW,IAAA,CAF/B,CAEmC,UACpCyW,EAAW,SAAW,EAG/B,GAAI,CACFF,GACIE,EAAYzW,EAAS,QAAQ,CAClC,MAAW,CACV,IAAM3O,EACF,oDAAoD,OAAAolB,EAAc,IAAA,EAClE,yDACA,IAAA,OAAIzW,EAAS,SAAQ,IAAA,EACzB,MAAM,MAAM3O,CAAM,CACnB,CAGHmlB,EAA0Bv2B,EACtB41B,EAAwB,gBAAiB,cAAc,CAC5D,CAED,IAAM16B,EAAO,SAACC,EAAcE,GAAe,CACzCpE,EACIkM,IAAe,OACf,UAAM,CAAA,MAAA,wDAAA,OACFA,EAAU,wCAAA,CADR,CACgD,EAEpD,IAAAxuB,EAAAlC,EACF4oB,GAA+C,CAAA,EAD5CmS,EAAO74B,EAAA,CAAA,EAAEkyB,EAAGlyB,EAAA,CAAA,EAAE7C,GAAC6C,EAAA,CAAA,EAAE0hD,GAAK1hD,EAAA,CAAA,EAGvB6gD,GAAeH,GAAqBl6B,EAAIrpB,GAAGwjD,CAAU,EAE3Dr+B,EACIw/B,GAA4BxzB,CAAS,EACrC,UAAM,CAAA,MAAA,oEAEF,sDAAA,OAAsDA,EAAS,GAAA,CAF7D,CAEgE,EAE1E,IAAMyzB,GACFnoB,GAAoB1H,EAAI,MAAO2uB,GAAchoB,EAAShvB,EAAS1I,CAAG,EAChE6gD,GACFvB,GAAqBvuB,EAAK2uB,GAAchoB,EAAQ,MAAOhvB,EAAS1I,CAAG,EACjE8gD,GAAgB,CAACF,GAAMC,EAAS,EAEtC,GAAIN,IAAS,KAAM,CACjB,IAAMQ,GAAUtB,GAAqBc,GAAOb,EAAY,EACxDoB,GAAI,KAAKC,EAAO,CACjB,CACD,OAAOD,EACT,EAEM1+C,EAA4B,CAChC2uB,EACA,OAAQ2G,EACR,KAAM6oB,EACN,uBAAwBE,GAGpB97C,EAA0B,CAC9B,QAAO+D,EACP,IAAG1I,EACH,WAAUqtB,EACV,UAASF,EACT,gBAAesD,EACf,WAAU+uB,EACV,eAAcO,GAKhB,GAAIpd,GAAQ,KAAM,CAChB,IAAMa,EACFN,GAAW,SAACnS,EAAe0G,GAAkBvO,EAAkB,CAC7D,IAAIzO,EAEA0K,EAAO,UACH7P,GAAalT,EACbuC,CAAgC,EAExC,OAAAukB,EAAK,CAACuO,GAAQ1G,EAAKtW,CAAG,CAAC,EAEnBuW,IAEFvW,EAAMmW,EAAQnW,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,GAIxD,CAAC,MAAOA,EAAK,SAAU2K,CAAI,CACpC,CAAC,EACL,OAAOoe,EAASzS,EAAK2G,CAAO,CAC7B,KAAM,CACL,IAAMspB,EAAmB9d,GACrB,SAACnS,EAAe0G,GAAkBkL,EAAczZ,EAAkB,CAChE,IAAIzO,EAAyB0K,EAAO,UAChC7P,GAAalT,EACbuC,CAAgC,EAEpC,OAAAukB,EAAK,CAACuO,GAAQ1G,EAAKtW,EAAKkoB,CAAI,CAAC,EAEzB3R,IAEFvW,EAAMmW,EAAQnW,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,GAIxD,CAAC,MAAOA,EAAK,SAAU2K,CAAI,CACpC,CAAC,EAEL,OAAO47B,EAAiBjwB,EAAK2G,EAAS6oB,CAAK,CAC5C,CACH,CACO,IAAM1oB,GAAyBx7B,EAAG,CAAC,aAAY8jD,EAAA,CAAC,ECjTvD,SAASc,GACL94C,EAAMkd,EAAOoI,EACb/kB,EACA1I,EACAmtB,EACAsD,EAAwC,CADxCtD,IAAA,SAAAA,EAAA,CAAsC,EAAG,CAAC,GAE5C,IAAI4D,EAAM5oB,EACNA,EAAE,OAAS,IACb4oB,EAAMH,EAAQzoB,EAAG,CAAC,EAAGA,EAAE,MAAM,CAAC,EAAGA,EAAE,MAAM,CAAC,EAAGA,EAAE,MAAM,CAAC,CAAC,CAAC,GAE1D,IAAIowB,EAAOlT,EACPkT,EAAK,OAAS,IAChBA,EAAO3H,EAAQvL,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAG/D,IAAMjjB,EAAoD,CAAC,EAAG2uB,EAAK,GAAIwH,CAAI,EACrE5zB,EACF,CAAC,QAAO+D,EAAE,IAAG1I,EAAE,gBAAeywB,EAAE,UAAStD,EAAE,YAAWM,CAAA,EAG1D,OAAOtI,EAAO,UACHlX,GACA7L,EACAuC,CAAgC,CAC7C,CAEO,IAAMu8C,GACT7kD,EAAG,CAAC,qCAAoC4kD,EAAA,CAAC,EC3B7C,SAASE,GACLtrB,EAA0CxQ,EAAOoS,EACjD/uB,EACA1I,EACAmtB,EACAsD,EAAwC,CADxCtD,IAAA,SAAAA,EAAA,CAAsC,EAAG,CAAC,GAE5C,IAAIoL,EAAOlT,EACP2L,EAAe,GACf3L,EAAG,OAAS,IACd2L,EAAe,GACfuH,EAAO3H,EAAQvL,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAG/D,IAAMjjB,EAAmD,CAAC,GAAIm2B,EAAM,OAAMd,CAAA,EACpE9yB,EACF,CAAC,QAAO+D,EAAE,IAAG1I,EAAE,gBAAeywB,EAAE,UAAStD,EAAE,WAAY0I,CAAM,EAE3Dpb,EAEF0K,EAAO,UACHjX,GACA9L,EACAuC,CAAgC,EAExC,OAAIqsB,EACKJ,EAAQnW,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAEzDA,CACT,CAEO,IAAM2mC,GACT/kD,EAAG,CAAC,oCAAmC8kD,EAAA,CAAC,ECgC5C,SAASE,GAAmDxiD,EAwB3D,OAvBCsJ,EAACtJ,EAAA,EACD44B,EAAM54B,EAAA,OACN6J,EAAO7J,EAAA,QACPmB,EAAGnB,EAAA,IACHuL,EAAmBvL,EAAA,WAAnBwuB,EAAajjB,IAAA,OAAA,OAAMA,EACnB8d,EAAArpB,EAAA,UAAAsuB,EAAYjF,IAAA,OAAA,CAAC,EAAG,CAAC,EAACA,EAClBuI,EAAe5xB,EAAA,gBACf8jC,EAAI9jC,EAAA,KACJspB,EAAAtpB,EAAA,WAAA2gD,EAAUr3B,IAAA,OAAG,SAAQA,EACrB23B,EAAsBjhD,EAAA,uBACtBkhD,EAAclhD,EAAA,eAcd,GAAImhD,GAAW76B,EAAO,MAAM,cAAeq6B,CAAU,IAAM,GAAO,CAChE,IAAI9jD,EAAS4lD,GACTn5C,EAAGsvB,EAAQ/uB,EAAS1I,EAAKqtB,EAAYF,EAAWsD,CAAe,EACnE,OAAIkS,GAAQ,OACVjnC,EAASijB,GAAIjjB,EAAQinC,CAAI,GAGpBkd,GACInkD,EAAQ8jD,EAAYM,EAAwBC,CAAc,CACtE,CAED,IAAMl1B,EAAKX,EAAgB/hB,EAAG,IAAK,kBAAmB,SAAS,EACzDuvB,EACFxN,EAAgBuN,EAAQ,SAAU,kBAAmB,SAAS,EAE9D1G,EAAMlG,EACNmG,EAAe,GACfnG,EAAG,OAAS,IACdmG,EAAe,GACfD,EAAMH,EAAQ/F,EAAI,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,EAAGA,EAAG,MAAM,CAAC,CAAC,CAAC,GAE9D1J,EACI4P,EAAI,OAAS,EACb,UAAM,CAAA,MAAA,iEACF,QAAA,OAAQA,EAAI,KAAI,GAAA,CADd,CACiB,EAC3B5P,EACIuW,EAAQ,OAAS,EACjB,UAAM,CAAA,MAAA,0DACF,gBAAA,OAAgBA,EAAQ,KAAI,GAAA,CAD1B,CAC6B,EACvCvW,EACI4P,EAAI,MAAM,CAAC,IAAM2G,EAAQ,MAAM,CAAC,EAChC,UAAA,CAAM,MAAA,4DACF,IAAA,OAAI3G,EAAI,MAAM,CAAC,EAA4C,2CAAA,EAC3D,UAAU,OAAA2G,EAAQ,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EACjCvK,GAAa,OACfA,EAAY,CAAC,EAAG,CAAC,GAEnBhM,EACI2P,GAAyCpoB,EAASykB,CAAS,EAC3D,UAAA,CACI,MAAA,oEACA,qBAAA,OAAqBzkB,EAA0B,kBAAA,EAAA,OAAAykB,EAAS,GAAA,CADxD,CAC2D,EACnE8D,GACI,wBAAyBjxB,EAAKywB,CAAe,EACjD,IAAMwZ,EAAWqW,GACbvvB,EAAI,MAAO2G,EAAQ,MAAOhvB,EAASykB,EAAWntB,EAAKywB,EACnD,EAAI,EAEJ8vB,EACA5d,GAAQ,OACV4d,EAAQr2B,EAAgByY,EAAM,OAAQ,cAAc,EACpDxjC,EAAAxC,EAAUymB,GAAem9B,EAAO11B,CAAE,EAAC,CAAA,EAAlC01B,EAAKphD,EAAA,CAAA,EAENqhD,GAA0CvW,EAAS,SAAUsW,EAAM,KAAK,GAG1E,IAAIE,EACAX,GAA0B,OAC5BW,EAA0Bv2B,EACtB41B,EAAwB,gBAAiB,uBAAuB,GAGtE,IAAM16B,EAAO,SAACC,EAAcE,EAAe,CACzCpE,EACIw/B,GAA4BxzB,CAAS,EACrC,UAAM,CAAA,MAAA,kHAEF,IAAA,OAAIA,EAAS,GAAA,CAFX,CAEc,EAClB,IAAAtuB,EAAAlC,EAA0B4oB,EAAK,CAAA,EAA9BmS,EAAO74B,EAAA,CAAA,EAAEkyB,GAAGlyB,EAAA,CAAA,EAAE7C,EAAC6C,EAAA,CAAA,EAAE8jC,EAAI9jC,EAAA,CAAA,EAEtB6gD,EAAeH,GAAqBl6B,EAAIrpB,EAAGwjD,CAAU,EAErDoB,GAAOQ,GACRrwB,GAAiB,MAAO2uB,EAAchoB,EAAqBhvB,EAC5D1I,EAAKmtB,EAAWsD,CAAe,EAC7BowB,GAAYK,GACdnwB,GAAiB2uB,EAAehoB,EAAqB,MAAOhvB,EAC5D1I,EAAKmtB,EAAWsD,CAAe,EAEnC,GAAIkS,GAAQ,KAAM,CAChB,IAAMoe,GAAUtB,GAAqBc,EAAOb,CAAY,EACxD,MAAO,CAACkB,GAAMC,GAAWE,EAAO,CACjC,CACD,MAAO,CAACH,GAAMC,EAAS,CACzB,EAEMz+C,EAAqC,CACzC2uB,EACA,OAAQ2G,EACR,KAAM6oB,EACN,uBAAwBE,GAEpB97C,EAAmC,CACvC,QAAO+D,EACP,IAAG1I,EACH,WAAUqtB,EACV,UAASF,EACT,gBAAesD,EACf,WAAU+uB,EACV,eAAcO,GAKhB,GAAIpd,GAAQ,KAAM,CAChB,IAAMa,EACFN,GAAW,SAACnS,EAAe0G,EAAkBvO,EAAkB,CAE7D,IAAIzO,EAAyB0K,EAAO,UAChC5P,GAAsBnT,EACtBuC,CAAgC,EAEpC,OAAAukB,EAAK,CAACuO,EAAQ1G,EAAKtW,CAAG,CAAC,EAEnBuW,IAEFvW,EAAMmW,EAAQnW,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,GAIxD,CAAC,MAAOA,EAAK,SAAU2K,CAAI,CACpC,CAAC,EACL,OAAOoe,EAASzS,EAAK2G,CAAO,CAC7B,KAAM,CACL,IAAMspB,EAAmB9d,GACrB,SAACnS,EAAe0G,EAAkBkL,EAAczZ,EAAkB,CAEhE,IAAIzO,GAAyB0K,EAAO,UAChC5P,GAAsBnT,EACtBuC,CAAgC,EAEpC,OAAAukB,EAAK,CAACuO,EAAQ1G,EAAKtW,GAAKkoB,CAAI,CAAC,EAEzB3R,IAEFvW,GAAMmW,EAAQnW,GAAK,CAACA,GAAI,MAAM,CAAC,EAAGA,GAAI,MAAM,CAAC,EAAGA,GAAI,MAAM,CAAC,CAAC,CAAC,GAIxD,CAAC,MAAOA,GAAK,SAAU2K,CAAI,CACpC,CAAC,EAEL,OAAO47B,EAAiBjwB,EAAK2G,EAAS6oB,CAAK,CAC5C,CACH,CACO,IAAM9lB,GAAkCp+B,EAAG,CAAC,sBAAqBglD,EAAA,CAAC,EC1MzE,SAASE,GAAa1iD,EAkBrB,SAjBC0H,EAAC1H,EAAA,EACDpE,EAACoE,EAAA,EACDqpB,EAAArpB,EAAA,WAAA+yB,EAAa1J,IAAA,OAAA,GAAKA,EAClBC,EAAAtpB,EAAA,WAAAgzB,EAAU1J,IAAA,OAAG,GAAKA,EAClBwa,EAAI9jC,EAAA,KACJsvB,EAAAtvB,EAAA,WAAA2gD,EAAUrxB,IAAA,OAAG,SAAQA,EACrB2xB,EAAsBjhD,EAAA,uBACtBopB,EAAAppB,EAAA,eAAAkhD,EAAc93B,IAAA,OAAG,GAAGA,EAWlB,GAAI+3B,GAAW76B,EAAO,MAAM,cAAeq6B,CAAU,IAAM,GAAO,CAChE,IAAI9jD,EAAS8lD,GAAcj7C,EAAG9L,EAAGm3B,EAAYC,CAAU,EACvD,OAAI8Q,GAAQ,OACVjnC,EAASijB,GAAIjjB,EAAQinC,CAAI,GAGpBkd,GACInkD,EAAQ8jD,EAAYM,EAAwBC,CAAc,CACtE,CAED,IAAI30B,EAAKlB,EAAgB3jB,EAAG,IAAK,cAAc,EAC3C8kB,EAAKnB,EAAgBzvB,EAAG,IAAK,cAAc,EAC/C0E,EAAAxC,EAAWymB,GAAegI,EAAIC,CAAE,EAAC,CAAA,EAAhCD,EAAEjsB,EAAA,CAAA,EAAEksB,EAAElsB,EAAA,CAAA,EAEP,IAAMsiD,EACF7vB,EAAaxG,EAAG,MAAMA,EAAG,KAAO,CAAC,EAAIA,EAAG,MAAMA,EAAG,KAAO,CAAC,EACvDs2B,EACF7vB,EAAaxG,EAAG,MAAMA,EAAG,KAAO,CAAC,EAAIA,EAAG,MAAMA,EAAG,KAAO,CAAC,EAEvDs2B,EACF/vB,EAAaxG,EAAG,MAAMA,EAAG,KAAO,CAAC,EAAIA,EAAG,MAAMA,EAAG,KAAO,CAAC,EACvDw2B,EACF/vB,EAAaxG,EAAG,MAAMA,EAAG,KAAO,CAAC,EAAIA,EAAG,MAAMA,EAAG,KAAO,CAAC,EAEvDw2B,EAAaz2B,EAAG,MAAM,MAAM,EAAG,EAAE,EACjC02B,EAAaz2B,EAAG,MAAM,MAAM,EAAG,EAAE,EACjC02B,EAAY9gC,GAAmB4gC,CAAU,EACzCG,EAAY/gC,GAAmB6gC,CAAU,EAE/C3gC,EACIsgC,IAAgBC,EAChB,UAAM,CAAA,MAAA,wCAAwC,OAAAD,EAAoB,SAAA,EAC9D,GAAA,OAAGC,EAAW,2BAAA,EAAA,OAA4Bt2B,EAAG,MAAY,OAAA,EACzD,GAAA,OAAGC,EAAG,MAAK,kBAAA,EAAA,OAAmBuG,CAAU,EACxC,mBAAA,OAAmBC,EAAU,cAAA,CAH3B,CAGyC,EAEnD,IAAMowB,EAAoBzB,GACtBp1B,EAAG,MAAM,MAAM,EAAG,EAAE,EAAGC,EAAG,MAAM,MAAM,EAAG,EAAE,CAAC,EAC1CyD,EAAWmzB,EAAkB,OAAO,CAACN,EAAaC,CAAW,CAAC,EAE9DM,EAAgBtwB,EAClBhB,EAAQxF,EAAI,CAAC22B,EAAWN,EAAaE,CAAW,CAAC,EACjD/wB,EAAQxF,EAAI,CAAC22B,EAAWJ,EAAaF,CAAW,CAAC,EAC/CU,EAAgBtwB,EAClBjB,EAAQvF,EAAI,CAAC22B,EAAWJ,EAAaF,CAAW,CAAC,EACjD9wB,EAAQvF,EAAI,CAAC22B,EAAWN,EAAaE,CAAW,CAAC,EAEjDrB,EACA5d,GAAQ,OACV4d,EAAQr2B,EAAgByY,EAAM,OAAQ,cAAc,EACpDv4B,EAAAzN,EAAUymB,GAAem9B,EAAOn1B,CAAE,EAAC,CAAA,EAAlCm1B,EAAKn2C,EAAA,CAAA,EAENo2C,GAA0C1xB,EAAUyxB,EAAM,KAAK,GAGjE,IAAIE,EACAX,GAA0B,OAC5BW,EAA0Bv2B,EACtB41B,EAAwB,gBAAiB,cAAc,GAG7D,IAAM16B,EAAO,SAACC,GAAcE,GAAe,CACnC,IAAA1mB,GAAAlC,EAAuB4oB,GAAK,CAAA,EAA3B28B,GAAGrjD,GAAA,CAAA,EAAEsjD,GAAGtjD,GAAA,CAAA,EAAE7C,GAAC6C,GAAA,CAAA,EAAE0hD,GAAK1hD,GAAA,CAAA,EAInB6gD,GACFH,GAAqB3uB,EAAQvL,GAAIrpB,GAAE,KAAK,EAAGA,GAAGwjD,CAAU,EACxD4C,GACAC,GAgBJ,GAdI,CAACzwB,GAAc,CAACC,GAClBuwB,GAAOZ,GAAc9B,GAAcyC,GAAK,GAAO,EAAI,EACnDE,GAAOb,GAAcU,GAAKxC,GAAc,GAAM,EAAK,GAC1C,CAAC9tB,GAAcC,GACxBuwB,GAAOZ,GAAc9B,GAAcyC,GAAK,GAAO,EAAK,EACpDE,GAAOb,GAAc9B,GAAcwC,GAAK,GAAM,EAAK,GAC1CtwB,GAAc,CAACC,GACxBuwB,GAAOZ,GAAcW,GAAKzC,GAAc,GAAO,EAAI,EACnD2C,GAAOb,GAAcU,GAAKxC,GAAc,GAAO,EAAK,IAEpD0C,GAAOZ,GAAcW,GAAKzC,GAAc,GAAM,EAAI,EAClD2C,GAAOb,GAAc9B,GAAcwC,GAAK,GAAM,EAAI,GAGhDvf,GAAQ,KAAM,CAChB,IAAMoe,GAAUtB,GAAqBc,GAAOb,EAAY,EACxD,MAAO,CAAC0C,GAAMC,GAAMtB,EAAO,CAC5B,KACC,OAAO,CAACqB,GAAMC,EAAI,CAEtB,EAEMjgD,GAA6B,CACjC,EAAG8/C,EACH,EAAGC,EACH,KAAM5B,EACN,uBAAwBE,GAEpB97C,EACF,CAAC,WAAUitB,EAAE,WAAUC,EAAE,WAAU2tB,EAAE,eAAcO,CAAA,EAIvD,GAAIpd,GAAQ,KAAM,CAChB,IAAMa,EACFN,GAAW,SAACgf,GAAeC,GAAej5B,GAAkB,CAC1D,IAAMzO,GAEF0K,EAAO,UACH9P,GAAcjT,GACduC,CAAgC,EAExC,OAAAukB,GAAK,CAACg5B,GAAKC,GAAK1nC,EAAG,CAAC,EAEb,CAAC,MAAOmW,EAAQnW,GAAKqU,CAAQ,EAAG,SAAU1J,CAAI,CACvD,CAAC,EACL,OAAOoe,EAAS0e,EAAKC,CAAG,CACzB,KAAM,CACL,IAAMnB,EAAmB9d,GACrB,SAACgf,GAAeC,GAAe5B,GAAer3B,GAAkB,CAC9D,IAAMzO,GAEF0K,EAAO,UACH9P,GAAcjT,GACduC,CAAgC,EAExC,OAAAukB,GAAK,CAACg5B,GAAKC,GAAK1nC,GAAK8lC,EAAK,CAAC,EAEpB,CAAC,MAAO3vB,EAAQnW,GAAKqU,CAAQ,EAAG,SAAU1J,CAAI,CACvD,CAAC,EAEL,OAAO47B,EAAiBkB,EAAKC,EAAK5B,CAAK,CACxC,CACH,CAEO,IAAMzuB,GAAyBz1B,EAAG,CAAC,aAAYklD,EAAA,CAAC,iEEnLzD,SAASe,GAAe/D,EAAoB,CAC1C,OAAOD,GAAaC,EAAc,IAAM,GAAI,CAC9C,CACO,IAAMgE,GAAgClmD,EAAG,CAAC,eAAcimD,EAAA,CAAC,ECHhE,SAASE,GAAYjE,EAAoB,CACvC,OAAOD,GAAaC,EAAc,GAAK,EAAG,CAC5C,CAEO,IAAMkE,GAA6BpmD,EAAG,CAAC,YAAWmmD,EAAA,CAAC,ECI1D,SAASE,GACLC,EAAkBC,EAAqBC,EAAmB7X,EAC1D8X,EAAY,CAD8C9X,IAAA,SAAAA,EAAc,IACxE8X,IAAA,SAAAA,EAAY,GAGd,QAFIzkD,EAAQ,EACN+F,EAAmB,CAAA,EAClB/F,EAAQukD,GAAeD,EAAO,MACnCv+C,EAAO,KAAKiuB,GAAMswB,EAAQtkD,EAAOukD,CAAW,CAAC,EAC7CvkD,GAASwkD,EAGX,GAAI7X,EACF,KAAO3sC,EAAQskD,EAAO,MAAM,CAC1B,IAAMI,EAAU1kD,EAAQukD,EAAeD,EAAO,KACxC3iD,EAAM0xB,GAAO,CACjBW,GAAMswB,EAAQtkD,EAAOukD,EAAcG,CAAM,EAAG3sB,GAAK,CAAC2sB,CAAM,EAAGD,CAAQ,CACpE,CAAA,EACD1+C,EAAO,KAAKpE,CAAG,EACf3B,GAASwkD,CACV,CAGH,OAAIz+C,EAAO,SAAW,EACbw0C,GAAS,CAAA,EAAI,CAAC,EAAGgK,CAAW,CAAC,EAG/BhyB,EAAQc,GAAOttB,CAAM,EAAG,CAACA,EAAO,OAAQw+C,CAAW,CAAC,CAC7D,CACO,IAAMI,GAAwB3mD,EAAG,CAAC,OAAMqmD,EAAA,CAAC,EC1BhD,SAASO,GACLN,EAAkBC,EAAqBC,EACvC5L,EACAiM,EAAmD,CAAnDA,IAAA,SAAAA,EAAmDT,IACjDxL,GAAa,OACfA,EAAYoH,GAAoBuE,CAAW,GAE7C,IAAMO,EAAeH,GAAML,EAAQC,EAAaC,CAAS,EACnDO,EAAiBpxB,GAAImxB,EAAcD,EAASN,CAAW,CAAC,EAC9D,OAAOlL,GAAK0L,EAAgBnM,CAAS,CACvC,CACO,IAAMoM,GAAuBhnD,EAAG,CAAC,MAAK4mD,EAAA,CAAC,ECF9C,SAASK,GACLtiD,EACAuiD,EACAC,EACAC,EACAC,EACAC,EAAsB,CADtBD,IAAA,SAAAA,EAAyC,YACzCC,IAAA,SAAAA,EAAsB,GAExB,IAAMC,EAAS15B,EAAgBlpB,EAAO,QAAS,eAAe,EACxD6iD,EAAS35B,EAAgBq5B,EAAO,QAAS,gBAAiB,SAAS,EACnEO,EAAU55B,EAAgBs5B,EAAQ,SAAU,gBAAiB,OAAO,EAEpEO,EAAWF,EAAO,MAAM,CAAC,EAE/B1iC,EACIyiC,EAAO,OAAS,EAChB,UAAM,CAAA,MAAA,gDACF,gBAAA,OAAgBA,EAAO,KAAI,GAAA,CADzB,CAC4B,EACtCziC,EACI0iC,EAAO,OAAS,GAAKA,EAAO,MAAM,CAAC,IAAM,EACzC,UAAM,CAAA,MAAA,oDAAoD,OAAAE,EAAc,MAAA,EACpE,iBAAA,OAAiBF,EAAO,MAAK,GAAA,CAD3B,CAC8B,EACxC1iC,EACI2iC,EAAQ,OAAS,GAAKA,EAAQ,MAAM,CAAC,IAAMC,EAC3C,UAAM,CAAA,MAAA,qDAAqD,OAAAA,EAAY,IAAA,EACnE,iBAAA,OAAiBF,EAAO,MAAK,GAAA,CAD3B,CAC8B,EACxC1iC,EACIsiC,EAAS,SAAW,EACpB,UAAM,CAAA,MAAA,iEACF,UAAA,OAAUA,EAAS,OAAM,GAAA,CADvB,CAC0B,EACpCtiC,EACIsiC,EAAS,CAAC,GAAK,GAAKA,EAAS,CAAC,GAAK,EACnC,UAAM,CAAA,MAAA,2CAA2C,OAAAA,CAAQ,CAAE,CAAA,EAC/DtiC,EACIuiC,IAAW,YAAcA,IAAW,UACpC,UAAA,CAAM,MAAA,+CAA+C,OAAAA,CAAM,CAArD,CAAuD,EAEjE,IAAMthD,EACoB,CAAC,MAAOwhD,EAAQ,MAAOC,EAAQ,OAAQC,CAAO,EAClEn/C,EAA4B,CAAC,OAAM++C,EAAE,mBAAkBC,EAAE,SAAQF,CAAA,EACjEhpC,EAAM0K,EAAO,UACftX,GAAezL,EACfuC,CAAgC,EACpC,OAAO8V,CACT,CAEO,IAAMupC,GAAgC3nD,EAAG,CAAC,eAAcinD,EAAA,CAAC,EChEhE,SAASW,GAAejjD,EAA0B,CAChD,IAAM4iD,EAAS15B,EAAgBlpB,EAAO,QAAS,gBAAiB,SAAS,EAEzEmgB,EACIyiC,EAAO,OAAS,EAChB,UAAM,CAAA,MAAA,gDACF,gBAAA,OAAgBA,EAAO,KAAI,GAAA,CADzB,CAC4B,EAEtC,IAAMxhD,EAA8B,CAAC,MAAOwhD,CAAM,EAC5CnpC,EACF0K,EAAO,UAAUpW,GAAe3M,EAAqC,CAAA,CAAE,EAC3E,OAAOqY,CACT,CAEO,IAAMypC,GAAgC7nD,EAAG,CAAC,eAAc4nD,EAAA,CAAC,ECdhE,SAASE,GAC0BnjD,EAAmB,CACpD,IAAM4iD,EAAS15B,EAAgBlpB,EAAO,QAAS,gBAAgB,EAEzDojD,EAAcR,EAAO,KAAO,EAC5BS,EAAWT,EAAO,MAAMQ,CAAW,EAEzCjjC,EACIyiC,EAAO,MAAQ,EACf,UAAM,CAAA,MAAA,4DACF,gBAAA,OAAgBA,EAAO,KAAI,GAAA,CADzB,CAC4B,EAEtCziC,EACIkjC,IAAa,EACb,UAAM,CAAA,MAAA,gEACF,kCAAA,OAAkCA,EAAQ,GAAA,CADxC,CAC2C,EAErD,IAAMvuB,EAAO,IAAI,MAAM8tB,EAAO,IAAI,EAElC,OAAA9tB,EAAK,KAAK,EAAG,EAAGsuB,CAAW,EAC3BtuB,EAAKsuB,CAAW,EAAI,EAEb7jB,GAAKqjB,EAAQ9tB,CAAI,CAC1B,CAEO,IAAMwuB,GAAiCjoD,EAAG,CAAC,gBAAe8nD,EAAA,CAAC,ECvBlE,SAASI,GAC0BvjD,EAAmB,CACpD,IAAM4iD,EAAS15B,EAAgBlpB,EAAO,QAAS,gBAAgB,EAEzDojD,EAAcR,EAAO,KAAO,EAC5BS,EAAWT,EAAO,MAAMQ,CAAW,EAEzCjjC,EACIyiC,EAAO,MAAQ,EACf,UAAM,CAAA,MAAA,4DACF,gBAAA,OAAgBA,EAAO,KAAI,GAAA,CADzB,CAC4B,EAEtCziC,EACIkjC,IAAa,EACb,UAAM,CAAA,MAAA,2DACF,kCAAA,OAAkCA,EAAQ,GAAA,CADxC,CAC2C,EAGrD,IAAMG,EAAYZ,EAAO,MACnBa,EAAW13B,GAAK62B,EAAQ,SAAS,EAEjCc,EAAa/L,GAAS,CAAC,MAAQ,KAAQ,IAAM,CAAC,EAEhDgM,EACJ,OAAQf,EAAO,KAAI,CACjB,IAAK,GACHe,EAAYtnB,GAAO,UAAWonB,EAAUC,CAAU,EAClD,MACF,IAAK,GACHC,EAAYtnB,GAAO,YAAaonB,EAAUC,CAAU,EACpD,MACF,IAAK,GACHC,EAAYtnB,GAAO,cAAeonB,EAAUC,CAAU,EACtD,MACF,IAAK,GACHC,EAAYtnB,GAAO,gBAAiBonB,EAAUC,CAAU,EACxD,MACF,IAAK,GACHC,EAAYtnB,GAAO,kBAAmBonB,EAAUC,CAAU,EAC1D,MACF,QACE,MAAM,IAAI,MAAM,0BAA0B,CAC7C,CACD,OAAAC,EAAYxkB,GAAWwkB,EAAW,EAAE,EAE7B53B,GAAK43B,EAAWH,CAAS,CAClC,CAEO,IAAMI,GAAiCvoD,EAAG,CAAC,gBAAekoD,EAAA,CAAC,ECvClE,SAASM,GACL7jD,EAA4B8jD,EAC5BC,EACAC,EAAqC,CADrCD,IAAA,SAAAA,EAA8C,GAC9CC,IAAA,SAAAA,EAAqC,IACvC,IAAMpB,EAAS15B,EAAgBlpB,EAAO,QAAS,mBAAoB,SAAS,EAE5EmgB,EACIyiC,EAAO,OAAS,EAChB,UAAM,CAAA,MAAA,mDACF,gBAAA,OAAgBA,EAAO,KAAI,GAAA,CADzB,CAC4B,EAEtC,IAAMxhD,EAAiC,CAAC,MAAOwhD,CAAM,EAC/Cj/C,EAA+B,CAAC,QAAOmgD,EAAE,UAASC,EAAE,OAAMC,CAAA,EAC1DvqC,EAAM0K,EAAO,UACf/P,GAAkBhT,EAClBuC,CAAgC,EACpC,OAAO8V,CACT,CAEO,IAAMwqC,GAAmC5oD,EAAG,CAAC,kBAAiBwoD,EAAA,CAAC,EC3CtE,SAASK,GACL3B,EAAiB4B,EAAkBC,EACnCC,EAAsBC,EAAwBC,EAAqB,CAMjEF,GAAgB,OAClBA,EAAe,IAEbC,GAAkB,OACpBA,EAAiB,OAAO,mBAEtBC,GAAgB,OAClBA,EAAe,GAGjB,IAAMxB,EAAWR,EAAM,MAAM,CAAC,EAC9B,OAAA6B,EAAgB,KAAK,IAAIA,EAAerB,CAAQ,EAEhD5iC,EACI,GAAKkkC,GAAgBA,GAAgB,EACrC,UAAA,CAAM,MAAA,4CAA4C,OAAAA,EAAY,GAAA,CAAxD,CAA2D,EACrElkC,EACIoiC,EAAM,OAAS,EACf,UAAA,CAAM,MAAA,+CAAA,OAA+CA,EAAM,KAAI,GAAA,CAAzD,CAA4D,EACtEpiC,EACIoiC,EAAM,MAAM,CAAC,IAAM,EACnB,UAAA,CACI,MAAA,oDAAA,OAAoDA,EAAM,MAAM,CAAC,CAAC,CAAE,CAAA,EAC5EpiC,EAAYgkC,EAAO,OAAS,EAAG,UAAA,CAAM,MAAA,4BAAA,CAA4B,EACjEhkC,EACIgkC,EAAO,MAAM,CAAC,IAAMpB,EACpB,UAAA,CAAM,MAAA,sDAAA,OAAsDA,EAAY,IAAA,EACpE,WAAW,OAAAoB,EAAO,MAAM,CAAC,CAAC,CAAE,CAAA,EACpChkC,EACI,GAAKokC,GAAgBA,GAAgB,EACrC,UAAA,CAAM,MAAA,4CAA4C,OAAAA,EAAY,GAAA,CAAxD,CAA2D,EAC9D,CAAC,cAAaH,EAAE,aAAYC,EAAE,eAAcC,EAAE,aAAYC,CAAA,CACnE,CCjBA,SAASC,GACLjC,EAA4B4B,EAC5BC,EAAuBC,EACvBC,EAAyC,CADlBD,IAAA,SAAAA,EAAkB,IACzCC,IAAA,SAAAA,EAAiB,OAAO,mBAC1B,IAAMzB,EACF35B,EAAgBq5B,EAAO,QAAS,oBAAqB,SAAS,EAC5DkC,EACFv7B,EAAgBi7B,EAAQ,SAAU,oBAAqB,SAAS,EAE9D/iD,EAAS8iD,GACXrB,EAAQ4B,EAASL,EAAeC,EAAcC,CAAc,EAChEF,EAAgBhjD,EAAO,cACvBijD,EAAejjD,EAAO,aACtBkjD,EAAiBljD,EAAO,eAExB,IAAMuC,EAAQ,CAAC,cAAaygD,EAAE,aAAYC,EAAE,eAAcC,CAAA,EAC1D,OAAOngC,EAAO,UACV9T,GAAqB,CAAC,MAAOwyC,EAAQ,OAAQ4B,CAAO,EAAG9gD,CAAK,CAClE,CAEO,IAAM+gD,GAAoCrpD,EAAG,CAAC,mBAAkBmpD,EAAA,CAAC,WCjCxDG,GACZ19C,EAAU29C,EAAYC,EAAmC,CAC3D,IAAMjnD,EAAQknD,GAAa79C,EAAK29C,EAASC,CAAU,EAC7CE,EAAiBnnD,EAAQ,EAAI,EAAEA,EAAQ,GAAKA,EAClDqJ,EAAI,OAAO89C,EAAgB,EAAGH,CAAO,CACvC,UAiBgBE,GACZ79C,EAAU+9C,EAAWH,EAAmC,CAC1D,OAAOI,GAAch+C,EAAK+9C,EAAQH,GAAcK,EAAiB,CACnE,CASA,SAASA,GAAqB3/C,EAAM9L,EAAI,CACtC,OAAO8L,EAAI9L,EAAI,EAAI8L,EAAI9L,EAAI,GAAK,CAClC,CAEA,SAASwrD,GACLh+C,EAAU+9C,EAAWH,EAAkC,CAKzD,QAJI91B,EAAO,EACPC,EAAQ/nB,EAAI,OACZk+C,EAAS,EACTC,EAAQ,GACLr2B,EAAOC,GAAO,CACnBm2B,EAASp2B,GAASC,EAAQD,IAAU,GACpC,IAAMs2B,EAAgBR,EAAWG,EAAQ/9C,EAAIk+C,CAAM,CAAC,EAChDE,EAAgB,EAClBt2B,EAAOo2B,EAAS,GAEhBn2B,EAAQm2B,EAGRC,EAAQ,CAACC,EAEZ,CAED,OAAOD,EAAQr2B,EAAO,CAACA,EAAO,CAChC,CCrDM,SAAUu2B,GACZ/C,EAAmB4B,EAAoBC,EACvCC,EAAsBC,EAAsB,CAC9C,OAAOiB,GACHhD,EAAO4B,EAAQC,EAAeC,EAAcC,EAC5C,CAAC,CACP,CAEgB,SAAAkB,GACZjD,EAAmB4B,EAAoBC,EACvCC,EAAsBC,EACtBmB,EAA2B,CAC7B,OAAOF,GACHhD,EAAO4B,EAAQC,EAAeC,EAAcC,EAC5C,EAAsB,GACtBmB,EAA6C,EAC7C,CACN,CAEgB,SAAAC,GACZnD,EAAmB4B,EAAoBC,EACvCC,EAAsBC,EACtBC,EAAoB,CACtB,OAAOgB,GACHhD,EAAO4B,EAAQC,EAAeC,EAAcC,EAAgBC,EAC5D,EAAI,CACV,CAEA,SAASgB,GACLhD,EAAmB4B,EAAoBC,EACvCC,EAAsBC,EAAwBC,EAC9CoB,EAA4BF,EAC5BG,EAA0B,CAD1BD,IAAA,SAAAA,EAA0B,IAAEF,IAAA,SAAAA,EAA0B,IACtDG,IAAA,SAAAA,EAA0B,IAK5B,QAFMC,EAAa,CAAA,EAEVnqD,EAAI,EAAGA,EAAIyoD,EAAO,OAAQzoD,IAC7ByoD,EAAOzoD,CAAC,EAAI4oD,GACduB,EAAW,KAAK,CAAC,MAAO1B,EAAOzoD,CAAC,EAAG,SAAUA,EAAG,mBAAoB,CAAC,CAAC,EAI1EmqD,EAAW,KAAKC,EAAmB,EASnC,QALM3yB,EAAQoxB,EAAe,EAAK,IAAOA,EAAgB,EAEnDwB,EAA4B,CAAA,EAC5BC,EAA2B,CAAA,EAE1BD,EAAgB,OAAS3B,GAAiByB,EAAW,OAAS,GAAG,CACtE,IAAMI,EAAYJ,EAAW,IAAG,EAClBK,EAA+CD,EAAS,MAAzCE,EAAgCF,EAAS,SAA/BG,EAAsBH,EAAS,mBAEtE,GAAIC,EAAgB5B,EAClB,MAUF,QADI+B,EAAkB,GACb7/C,EAAIu/C,EAAgB,OAAS,EAAGv/C,GAAK4/C,EAAoB,EAAE5/C,EAAG,CACrE,IAAM8/C,EAAMC,GAAsBhE,EAAO4D,EAAUJ,EAAgBv/C,CAAC,CAAC,EAErE,GAAI8/C,GAAOjC,EAAc,CACvBgC,EAAkB,GAClB,KACD,CAKD,GAHAJ,EAAU,MACNA,EAAU,MAAQO,GAAenC,EAAclxB,EAAOmzB,CAAG,EAEzDL,EAAU,OAAS3B,EACrB,KAEH,CASD2B,EAAU,mBAAqBF,EAAgB,OAE1CM,IAGCJ,EAAU,QAAUC,GACtBH,EAAgB,KAAKI,CAAQ,EAC7BH,EAAe,KAAKC,EAAU,KAAK,GAC1BA,EAAU,MAAQ3B,GAG3BK,GAAakB,EAAYI,EAAWH,EAAmB,EAG5D,CAGD,IAAMW,EAAeV,EAAgB,OAC/BW,EAAatC,EAAgBqC,EAE/BhB,GAAsBiB,EAAa,IACrCX,EAAgB,KAAhB,MAAAA,EAAehqD,GAAA,CAAA,EAAAJ,EAAS,IAAI,MAAM+qD,CAAU,EAAE,KAAK,CAAC,CAAC,EAAE,EAAA,CAAA,EACvDV,EAAe,KAAf,MAAAA,EAAcjqD,GAAA,CAAA,EAAAJ,EAAS,IAAI,MAAM+qD,CAAU,EAAE,KAAK,CAAG,CAAC,EAAE,EAAA,CAAA,GAG1D,IAAMhsD,EAAkC,CAAC,gBAAeqrD,CAAA,EAExD,OAAIJ,IACFjrD,EAAO,eAAoBsrD,GAGzBJ,IACFlrD,EAAO,aAAkB+rD,GAGpB/rD,CACT,CAEA,SAAS6rD,GAAsBhE,EAAmB7mD,EAAW8K,EAAS,CACpE,IAAMmgD,EAASpE,EAAM,SAAS7mD,EAAI,EAAGA,EAAI,EAAI,CAAC,EACxCkrD,EAASrE,EAAM,SAAS/7C,EAAI,EAAGA,EAAI,EAAI,CAAC,EACxCqgD,EAAQ,KAAK,IAAIF,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EACrCG,EAAQ,KAAK,IAAIH,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EACrCI,EAAQ,KAAK,IAAIJ,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EACrCK,EAAQ,KAAK,IAAIL,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EACrCM,EAAQ,KAAK,IAAIL,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EACrCM,EAAQ,KAAK,IAAIN,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EACrCO,EAAQ,KAAK,IAAIP,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EACrCQ,EAAQ,KAAK,IAAIR,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EACrCS,GAASN,EAAQF,IAAUG,EAAQF,GACnCQ,GAASH,EAAQF,IAAUG,EAAQF,GACzC,GAAIG,GAAS,GAAKC,GAAS,EACzB,MAAO,GAET,IAAMC,EAAmB,KAAK,IAAIV,EAAOI,CAAK,EACxCO,EAAmB,KAAK,IAAIV,EAAOI,CAAK,EACxCO,EAAmB,KAAK,IAAIV,EAAOI,CAAK,EACxCO,EAAmB,KAAK,IAAIV,EAAOI,CAAK,EACxCO,EAAmB,KAAK,IAAIF,EAAmBF,EAAkB,CAAG,EACtE,KAAK,IAAIG,EAAmBF,EAAkB,CAAG,EACrD,OAAOG,GAAoBN,EAAQC,EAAQK,EAC7C,CAMA,SAASnB,GAAenC,EAAsBlxB,EAAemzB,EAAW,CACtE,IAAMsB,EAAS,KAAK,IAAIz0B,EAAQmzB,EAAMA,CAAG,EACzC,OAAOA,GAAOjC,EAAeuD,EAAS,CACxC,CAEA,SAAS9B,GAAoB+B,EAAeC,EAAa,CAKvD,OAAQD,EAAG,MAAQC,EAAG,OAChBD,EAAG,QAAUC,EAAG,OAAWA,EAAG,SAAWD,EAAG,QACpD,CChKA,SAAeE,GACXxF,EAA4B4B,EAC5BC,EAAuBC,EACvBC,EAAyC,CADlB,OAAAD,IAAA,SAAAA,EAAkB,IACzCC,IAAA,SAAAA,EAAiB,OAAO,wHACpB,OAAAzB,EAAS35B,EAAgBq5B,EAAO,QAAS,wBAAwB,EACjEkC,EAAUv7B,EAAgBi7B,EAAQ,SAAU,wBAAwB,EAEpE/iD,EAAS8iD,GACXrB,EAAQ4B,EAASL,EAAeC,EAAcC,CAAc,EAChEF,EAAgBhjD,EAAO,cACvBijD,EAAejjD,EAAO,aACtBkjD,EAAiBljD,EAAO,eAED,CAAA,EAAM,QAAQ,IAAI,CAACyhD,EAAO,KAAI,EAAI4B,EAAQ,KAAI,CAAE,CAAC,CAAC,SAAnE,OAAAuD,EAAiBnqD,EAAkD,KAAA,EACnEoqD,EAAYD,EAAe,CAAC,EAC5BE,EAAaF,EAAe,CAAC,EAK5BjC,EAAmBT,GACtB2C,EAAWC,EAAY9D,EAAeC,EAAcC,CAAc,EAAC,gBACnEzB,IAAWN,GACbM,EAAO,QAAO,EAEZ4B,IAAYN,GACdM,EAAQ,QAAO,EAGjB,CAAA,EAAO9M,GAASoO,EAAiB,OAAO,CAAC,MAC1C,CAEM,IAAMoC,GAAyBJ,GCnBtC,SAASK,GACL7F,EAA4B4B,EAC5BC,EAAuBC,EACvBC,EACAC,EAAkB,CAFKF,IAAA,SAAAA,EAAkB,IACzCC,IAAA,SAAAA,EAAiB,OAAO,mBACxBC,IAAA,SAAAA,EAAkB,GACpB,IAAM1B,EAAS35B,EAAgBq5B,EAAO,QAAS,mBAAmB,EAC5DkC,EAAUv7B,EAAgBi7B,EAAQ,SAAU,mBAAmB,EAE/Dx6C,EAASu6C,GACXrB,EAAQ4B,EAASL,EAAeC,EAAcC,EAC9CC,CAAY,EAChBH,EAAgBz6C,EAAO,cACvB06C,EAAe16C,EAAO,aACtB26C,EAAiB36C,EAAO,eACxB46C,EAAe56C,EAAO,aAEtB,IAAMvI,EAAoC,CAAC,MAAOyhD,EAAQ,OAAQ4B,CAAO,EACnE9gD,EACF,CAAC,cAAaygD,EAAE,aAAYC,EAAE,eAAcC,EAAE,aAAYC,CAAA,EAGxD7pD,EAASypB,EAAO,UACH5T,GAAqBnP,EACrBuC,CAAgC,EAEnD,MAAO,CAAC,gBAAiBjJ,EAAO,CAAC,EAAG,eAAgBA,EAAO,CAAC,CAAC,CAC/D,CAEO,IAAM2tD,GAA6ChtD,EAAG,CAAC,4BAA2B+sD,EAAA,CAAC,EChC1F,SAAeE,GACX/F,EAA4B4B,EAC5BC,EAAuBC,EACvBC,EACAC,EAAkB,CAFK,OAAAF,IAAA,SAAAA,EAAkB,IACzCC,IAAA,SAAAA,EAAiB,OAAO,mBACxBC,IAAA,SAAAA,EAAkB,4GACd,OAAA1B,EAAS35B,EAAgBq5B,EAAO,QAAS,wBAAwB,EACjEkC,EAAUv7B,EAAgBi7B,EAAQ,SAAU,wBAAwB,EAEpEx6C,EAASu6C,GACXrB,EAAQ4B,EAASL,EAAeC,EAAcC,EAC9CC,CAAY,EAChBH,EAAgBz6C,EAAO,cACvB06C,EAAe16C,EAAO,aACtB26C,EAAiB36C,EAAO,eACxB46C,EAAe56C,EAAO,aAEC,CAAA,EAAM,QAAQ,IAAI,CAACk5C,EAAO,KAAI,EAAI4B,EAAQ,KAAI,CAAE,CAAC,CAAC,SAAnE,OAAAuD,EAAiB7pD,EAAkD,KAAA,EACnE8pD,EAAYD,EAAe,CAAC,EAC5BE,EAAaF,EAAe,CAAC,EAK7BnqD,EAAoC6nD,GACtCuC,EAAWC,EAAY9D,EAAeC,EAAcC,EACpDC,CAAY,EAFTwB,EAAeloD,EAAA,gBAAEmoD,EAAcnoD,EAAA,eAIlCglD,IAAWN,GACbM,EAAO,QAAO,EAEZ4B,IAAYN,GACdM,EAAQ,QAAO,EAGV,CAAA,EAAA,CACL,gBAAiB9M,GAASoO,EAAiB,OAAO,EAClD,eAAgBpO,GAASqO,CAAc,EACxC,MACF,CAEM,IAAMuC,GAAkCD,GC1C/C,SAASE,GACLjG,EAA4B4B,EAC5BC,EAAuBC,EACvBC,EACAmB,EAA0B,CAFHpB,IAAA,SAAAA,EAAkB,IACzCC,IAAA,SAAAA,EAAiB,OAAO,mBACxBmB,IAAA,SAAAA,EAA0B,IAC5B,IAAM5C,EAAS35B,EAAgBq5B,EAAO,QAAS,mBAAmB,EAC5DkC,EAAUv7B,EAAgBi7B,EAAQ,SAAU,mBAAmB,EAE/Dx6C,EAASu6C,GACXrB,EAAQ4B,EAASL,EAAeC,EAAcC,EAC9C,IAAI,EACFmE,EAAiB9+C,EAAO,cACxB++C,EAAgB/+C,EAAO,aACvBg/C,EAAkBh/C,EAAO,eAEzBvI,EAAoC,CAAC,MAAOyhD,EAAQ,OAAQ4B,CAAO,EACnE9gD,EAAkC,CACtC,cAAe8kD,EACf,aAAcC,EACd,eAAgBC,EAChB,mBAAkBlD,GAId/qD,EAASypB,EAAO,UACH7T,GAAqBlP,EACrBuC,CAAgC,EAEnD,MAAO,CAAC,gBAAiBjJ,EAAO,CAAC,EAAG,aAAcA,EAAO,CAAC,CAAC,CAC7D,CAEO,IAAMkuD,GAA0CvtD,EAAG,CAAC,yBAAwBmtD,EAAA,CAAC,EClCpF,SAAeK,GACXtG,EAA4B4B,EAC5BC,EAAuBC,EACvBC,EACAmB,EAA0B,CAFH,OAAApB,IAAA,SAAAA,EAAkB,IACzCC,IAAA,SAAAA,EAAiB,OAAO,mBACxBmB,IAAA,SAAAA,EAA0B,mHACtB,OAAA5C,EAAS35B,EAAgBq5B,EAAO,QAAS,wBAAwB,EACjEkC,EAAUv7B,EAAgBi7B,EAAQ,SAAU,wBAAwB,EAEpEx6C,EAASu6C,GACXrB,EAAQ4B,EAASL,EAAeC,EAAcC,EAC9C,IAAI,EACFmE,EAAiB9+C,EAAO,cACxB++C,EAAgB/+C,EAAO,aACvBg/C,EAAkBh/C,EAAO,eAG3B,CAAA,EAAM,QAAQ,IAAI,CAACk5C,EAAO,KAAI,EAAI4B,EAAQ,KAAI,CAAE,CAAC,CAAC,SADhD,OAAA5mD,EAAAlC,EAAA,MAAA,OAAA,CACFyN,EAAA,KAAA,EAAkD,CAAA,CAAA,EAD/C6+C,EAASpqD,EAAA,CAAA,EAAEqqD,EAAUrqD,EAAA,CAAA,EAMtBM,EAAkCqnD,GACpCyC,EAAWC,EAAYO,EAAgBC,EAAeC,EACtDlD,CAAkB,EAFfM,EAAe5nD,EAAA,gBAAEsoD,EAAYtoD,EAAA,aAIhC0kD,IAAWN,GACbM,EAAO,QAAO,EAEZ4B,IAAYN,GACdM,EAAQ,QAAO,EAGV,CAAA,EAAA,CACL,gBAAiB9M,GAASoO,EAAiB,OAAO,EAClD,aAAc7nB,GAAOuoB,EAAc,OAAO,EAC3C,MACF,CAEM,IAAMqC,GAA+BD,GCxC5C,SAASE,GACLC,EAAsBvjD,EAAwBwjD,EAC9CC,EAAwB,CADsBD,IAAA,SAAAA,EAAoB,IAClEC,IAAA,SAAAA,EAAwB,IAC1B,IAAMC,EAAUjgC,EAAgB8/B,EAAQ,SAAU,gBAAgB,EAElE7oC,EACIgpC,EAAQ,OAAS,GAAKA,EAAQ,OAAS,EACvC,UAAA,CAAM,MAAA,2DACF,QAAA,OAAQA,EAAQ,KAAI,GAAA,CADlB,CACqB,EAC/BhpC,EACI1a,EAAK,SAAW,EAChB,UAAM,CAAA,MAAA,6DACF,GAAA,OAAGA,EAAI,GAAA,CADL,CACQ,EAClB0a,EACI+oC,IAAqB,IAASD,IAAiB,GAC/C,UAAA,CAAM,MAAA,mFAC2B,CAAA,EAErC,IAAIG,EAAcD,EACdn5B,EAAe,GACfm5B,EAAQ,OAAS,IACnBn5B,EAAe,GACfo5B,EAAcx5B,EACVu5B,EAAS,CAAC,EAAGA,EAAQ,MAAM,CAAC,EAAGA,EAAQ,MAAM,CAAC,EAAGA,EAAQ,MAAM,CAAC,CAAC,CAAC,GAGlExtD,EAAK8J,EAAI,CAAA,EAEf,IAAMrE,EAA+B,CAAC,OAAQgoD,CAAW,EACnDzlD,EAA6B,CAAC,aAAYslD,EAAE,iBAAgBC,EAAE,KAAIzjD,CAAA,EAGlEgU,EAAM0K,EAAO,UACH3S,GAAgBpQ,EAChBuC,CAAgC,EAEhD,OAAIqsB,EACKJ,EAAQnW,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAEzDA,CACT,CAEO,IAAM4vC,GAAiChuD,EAAG,CAAC,gBAAe0tD,EAAA,CAAC,ECzClE,SAASO,GACLN,EAAsBvjD,EAAwBwjD,EAC9CC,EAAwB,CADsBD,IAAA,SAAAA,EAAoB,IAClEC,IAAA,SAAAA,EAAwB,IAC1B,IAAMC,EAAUjgC,EAAgB8/B,EAAQ,SAAU,uBAAuB,EAEzE7oC,EACIgpC,EAAQ,OAAS,GAAKA,EAAQ,OAAS,EACvC,UAAA,CAAM,MAAA,kEACF,QAAA,OAAQA,EAAQ,KAAI,GAAA,CADlB,CACqB,EAC/BhpC,EACI1a,EAAK,SAAW,EAChB,UACI,CAAA,MAAA,oEACA,GAAA,OAAGA,EAAI,GAAA,CADP,CACU,EAClB0a,EACIgpC,EAAQ,QAAU,WAAaA,EAAQ,QAAU,QACjD,UAAA,CAAM,MAAA,kDAAkD,CAAA,EAC5DhpC,EACI+oC,IAAqB,IAASD,IAAiB,GAC/C,UAAA,CAAM,MAAA,0FAC2B,CAAA,EACrC,IAAIG,EAAcD,EACdn5B,EAAe,GACfm5B,EAAQ,OAAS,IACnBn5B,EAAe,GACfo5B,EAAcx5B,EACVu5B,EAAS,CAAC,EAAGA,EAAQ,MAAM,CAAC,EAAGA,EAAQ,MAAM,CAAC,EAAGA,EAAQ,MAAM,CAAC,CAAC,CAAC,GAElExtD,EAAK8J,EAAI,CAAA,EAEf,IAAMrE,EAAsC,CAAC,OAAQgoD,CAAW,EAC1DzlD,EAC2B,CAAC,aAAYslD,EAAE,iBAAgBC,EAAE,KAAIzjD,CAAA,EAGhEgU,EAAM0K,EAAO,UACH5S,GAAuBnQ,EACvBuC,CAAgC,EAEhD,OAAIqsB,EACKJ,EAAQnW,EAAK,CAACA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,EAAGA,EAAI,MAAM,CAAC,CAAC,CAAC,EAEzDA,CACT,CAEO,IAAM8vC,GAAwCluD,EAAG,CAAC,uBAAsBiuD,EAAA,CAAC,ECpChF,SAASE,GACLxpD,EACA0iD,EACA+G,EACAC,EAAiB,OAFjBhH,IAAA,SAAAA,EAAiB,UACjB+G,IAAA,SAAAA,EAAgB,IAChBC,IAAA,SAAAA,EAAiB,IAEjB,IAAM9G,EAAS15B,EAAgBlpB,EAAO,QAAS,WAAW,EAKpD2pD,EAAqB,MACrBC,EAAuB,KACvBC,EAAsB,KACtBC,EAAqBlH,EAAO,MAAM,CAAC,EAAIA,EAAO,MAAM,CAAC,EAEvDmH,EAAa/4B,GAAI2mB,GAAS,CAAC+R,CAAW,CAAC,EAAG,GAAG,EAC7C9tD,EAAGX,EAAGxB,EAAGuwD,EAsBb,GApBA7pC,EACIyiC,EAAO,OAAS,EAChB,UAAM,CAAA,MAAA,4CACF,gBAAA,OAAgBA,EAAO,KAAI,GAAA,CADzB,CAC4B,EAEtCziC,EACIyiC,EAAO,MAAM,CAAC,IAAM,GAAKA,EAAO,MAAM,CAAC,IAAK,EAC5C,UAAM,CAAA,MAAA,kEAEF,WAAW,OAAAA,EAAO,MAAM,CAAC,EAAI,GAAA,CAAA,CAAA,EAErCziC,EACEyiC,EAAO,QAAU,SAAWA,EAAO,QAAU,UAC7C,UAAA,CAAM,MAAA,wDACF,iBAAA,OAAiBA,EAAO,MAAK,GAAA,CAD3B,CAC8B,EAEtCziC,EACEuiC,IAAW,QAAUA,IAAW,SAChC,UAAA,CAAM,MAAA,0CAA0C,OAAAA,CAAM,CAAhD,CAAkD,EAEtDE,EAAO,MAAM,CAAC,IAAM,EAAG,CACvB/kD,EAAAlC,EAAYo6C,GAAM6M,EAAQ,CAAC,EAAG,EAAG,CAAC,EAAG,EAAE,EAAC,CAAA,EAAvChnD,EAACiC,EAAA,CAAA,EAAE5C,EAAC4C,EAAA,CAAA,EAAEpE,EAACoE,EAAA,CAAA,EACR,IAAMosD,EAAKj5B,GAAIp1B,EAAE+tD,CAAkB,EAC7BO,EAAKl5B,GAAI/1B,EAAE2uD,CAAoB,EAC/Bv/B,EAAK2G,GAAIv3B,EAAEowD,CAAmB,EACpCG,EAAYrsC,GAAIA,GAAIssC,EAAIC,CAAE,EAAG7/B,CAAE,CAClC,MACG2/B,EAAYhqD,EAGhB,GAAI0iD,IAAW,OAAQ,CACnB,IAAMyH,EAAaj2B,GAASnI,GAAKuC,GAAM07B,CAAS,EAAG,OAAO,EACtDlsD,GAAO,CAAA,CAAE,EACT,GAAG,EACPisD,EAAaK,GAAKD,EAAYL,CAAkB,CACnD,CAED,IAAMO,EAAeZ,EACjBnoB,GAAU0oB,EAAWD,CAAU,EAAI1pB,GAAQ2pB,EAAWD,CAAU,EAE9DrvD,EAASqxB,GAAKiF,GAAIq5B,EAAa,GAAG,EAAG,OAAO,EAElD,OAAO3vD,CACX,CAEA,SAAS0vD,GAAKE,EAAqBC,EAAa,CAQ5C,QANIC,EAAa7S,GAAS,CAAC,EAAE,CAAC,EAC1B8S,EAAe9S,GAAS,CAAC,CAAC,CAAC,EAC3B+S,EAAY/S,GAAS,CAAC,CAAC,CAAC,EACxBgT,EAAYC,EAAaC,EACzBC,EAASC,EAAkBC,EAEtBptD,EAAQ,EAAGA,EAAQ0sD,EAAU,KAAK,EAAG1sD,IAAS,CAEnD+sD,EAAat5B,GAAMi5B,EAAW,EAAG1sD,EAAQ,CAAC,EAE1CgtD,EAAcv5B,GAAMi5B,EAAU1sD,EAAQ,CAAC,EAEvCmtD,EAAmBjzC,GAAI0mB,GAAImsB,CAAU,EAAEJ,CAAK,EAE5CS,EAAalzC,GAAI0mB,GAAIosB,CAAW,EAAEL,CAAK,EAEvC,IAAMU,EAAgBzsB,GAAIxN,GAAI25B,EAAYhZ,GAAM,EAAGgZ,EAAW,IAAI,CAAC,CAAC,EAEpEE,EAAY/yC,GAAImzC,EAAezsB,GAAImsB,CAAU,CAAC,EAE9C,IAAMO,EAAc91B,GAAKw1B,EAAY,MAAOD,EAAW,IAAI,EACrDQ,EAAaxtC,GAAIg0B,GAAM,EAAEiZ,EAAY,IAAI,EAAEM,CAAW,EACtDE,EAAap6B,GAAI45B,EAAcO,CAAU,EAC/CL,EAAUhzC,GAAI0mB,GAAI4sB,CAAU,EAAG5sB,GAAIosB,CAAW,CAAC,EAE/C,IAAMS,EAAgBxoB,GAAIgoB,EAAWC,CAAO,EACtCQ,EAAgBzoB,GAAIgoB,EAAWC,CAAO,EACtCS,EAAev6B,GAAI+5B,EAAkBC,CAAU,EACrDN,EAAY15B,GAAIA,GAAIu6B,EAAaF,CAAa,EAAGC,CAAa,EAE9D,IAAM5wB,EAAY2F,GAAQqqB,EAAWD,CAAY,EAEjDA,EAAezvB,GAAMN,EAAWgwB,EAAWD,CAAY,EAEvDD,EAAaxvB,GAAMN,EAAWid,GAAS,CAAC/5C,CAAK,CAAC,EAAG4sD,CAAU,CAE9D,CACD,OAAOA,CACX,CAEO,IAAMgB,GAA4BnwD,EAAG,CAAE,WAAUmuD,EAAA,CAAE,ECzG1D,SAASiC,GACLzrD,EAA4B0rD,EAC5BC,EACAC,EAA8D7H,EAC9DpsB,EAA8B,CAF9Bg0B,IAAA,SAAAA,EAA+C,WAC/CC,IAAA,SAAAA,EAA4D,YAAE7H,IAAA,SAAAA,EAAa,GAE7E,IAAMnB,EAAS15B,EAAgBlpB,EAAO,QAAS,YAAa,SAAS,EAC/D6rD,EACF3iC,EAAgBwiC,EAAY,aAAc,YAAa,SAAS,EAEpEvrC,EACIyiC,EAAO,OAAS,EAChB,UAAM,CAAA,MAAA,4CACF,gBAAA,OAAgBA,EAAO,KAAI,GAAA,CADzB,CAC4B,EAEtCziC,EACI0rC,EAAY,OAAS,IAChBA,EAAY,MAAM,CAAC,IAAMjJ,EAAO,MAAM,CAAC,GACvCiJ,EAAY,MAAM,CAAC,IAAM,IAC1BA,EAAY,MAAM,CAAC,IAAM,EAC7B,UAAA,CAAM,MAAA,kEAAA,CAAkE,EAE5E1rC,EACIwX,GAAe,MAAQA,EAAY,SAAW,EAC9C,UAAA,CACI,MAAA,oEACA,WAAA,OAAWA,EAAW,GAAA,CADtB,CACyB,EAEjC,IAAMv2B,EAA0B,CAAC,MAAOwhD,EAAQ,WAAYiJ,CAAW,EACjEloD,EACe,CAAC,cAAagoD,EAAE,SAAQC,EAAE,UAAS7H,EAAE,YAAWpsB,CAAA,EAErE,OAAOxT,EAAO,UACVtQ,GAAWzS,EACXuC,CAAgC,CACtC,CAEO,IAAMmoD,GAA4BzwD,EAAG,CAAC,WAAUowD,EAAA,CAAC,EClBxD,SAASM,GACLxmD,EAAiBymD,EAAyBC,EAAuB,CACnE,IAAM7hC,EAAKlB,EAAgB3jB,EAAG,IAAK,UAAU,EAC7CT,EACIslB,EAAG,MAAQ,EACX,UAAA,CAAM,MAAA,4CAAA,OAA4CA,EAAG,KAAI,GAAA,CAAnD,CAAsD,EAEhE,IAAMrmB,EAAQqmB,EAAG,MACXvsB,EAAAlC,EAASyuB,EAAG,MAAM,MAAM,EAAE,EAAC,CAAA,EAA1B8hC,EAACruD,EAAA,CAAA,EAAEsuD,EAACtuD,EAAA,CAAA,EAEPuuD,EACAC,EACA,OAAOL,GAAa,UACtBlnD,EACIknD,EAAW,IAAM,EACjB,UAAM,CAAA,MAAA,gDAAA,OAAgDA,EAAQ,GAAA,CAAxD,CAA2D,EACrElnD,EACIknD,GAAYE,EACZ,UAAM,CAAA,MAAA,yBAAyB,OAAAF,EAAW,GAAA,EACtC,iDAAA,OAAiDE,EAAC,IAAA,CADhD,CACoD,EAC9DE,EACIljC,EAAgB8iC,EAAW,EAAIE,EAAIF,EAAU,WAAY,UAAU,IAGvElnD,EACIknD,EAAS,QAAU,QACnB,UAAA,CAAM,MAAA,gDAAA,CAAgD,EAG1DI,EAAYpxB,GAAMoG,GAAK4qB,EAAU,CAAC,EAAGE,EAAGzmB,GAAQumB,EAAUE,CAAC,CAAC,GAG1D,OAAOD,GAAa,UACtBnnD,EACImnD,EAAW,IAAM,EACjB,UAAM,CAAA,MAAA,gDAAA,OAAgDA,EAAQ,GAAA,CAAxD,CAA2D,EACrEnnD,EACImnD,GAAYE,EACZ,UAAM,CAAA,MAAA,yBAAyB,OAAAF,EAAW,GAAA,EACtC,oDAAA,OAAoDE,EAAC,IAAA,CADnD,CACuD,EACjEE,EACInjC,EAAgB+iC,EAAW,EAAIE,EAAIF,EAAU,WAAY,UAAU,IAGvEnnD,EACImnD,EAAS,QAAU,QACnB,UAAA,CAAM,MAAA,gDAAA,CAAgD,EAC1DI,EAAYrxB,GAAMoG,GAAK6qB,EAAU,CAAC,EAAGE,EAAG1mB,GAAQwmB,EAAUE,CAAC,CAAC,GAG9D,IAAMzwD,EAAIk0B,EAAQ+hB,GAAM,EAAGua,EAAG,EAAG,OAAO,EAAG,CAAC,GAAI,CAAC,CAAC,EAC5C1lD,EAAImrC,GAAM,EAAGwa,EAAG,EAAG,OAAO,EAC1BG,EAAKzpB,GAAInnC,EAAG8K,CAAC,EAEb+lD,EACF/oB,GAAWlC,GAAUgrB,EAAIF,CAAS,EAAG7rB,GAAa+rB,EAAIlqB,GAAIiqB,CAAS,CAAC,CAAC,EAEnEG,EAAOnxB,GAAM,CAAC6wB,EAAGC,CAAC,EAAG/hC,EAAG,KAAK,EAEnC,OAAOwF,EACIonB,GAAM0C,GAAQ9pB,EAAQxF,EAAI,CAAC,GAAI8hC,EAAGC,CAAC,CAAC,CAAC,EAC1B,IAAI,SAAAM,EAAG,CAAI,OAAAzxB,GAAMuxB,EAAQE,EAAKD,CAAI,CAAC,CAAA,CAAC,EAC/CzoD,CAAK,CAClB,CAEO,IAAM2oD,GAA2BrxD,EAAG,CAAC,UAAS0wD,EAAA,CAAC,ECjFtD,SAASY,GAAa9vC,EAAuB,CAC3C,IAAI+vC,EACJ,GAAI,MAAM,QAAQ/vC,CAAE,EAAG,CACrB+vC,EAAkB,GAClB9nD,EACI+X,GAAM,MAAQA,EAAG,OAAS,EAC1B,UAAA,CAAM,MAAA,mEACK,CAAA,EAEf,QADMgwC,EAAMhwC,EAAG,CAAC,EAAE,MAAM,CAAC,aAChBnhB,EAAC,CACRoJ,EACI+X,EAAGnhB,CAAC,EAAE,MAAM,CAAC,IAAMmxD,EACnB,UAAA,CACI,MAAA,gEACA,IAAA,OAAKhwC,EAAkBnhB,CAAC,EAAE,MAAM,CAAC,EAAC,OAAA,EAAA,OAAQmxD,EAAG,GAAA,CAD7C,CACgD,GALjDnxD,EAAI,EAAGA,EAAImhB,EAAG,OAAQ,EAAEnhB,IAAxBA,CAAC,CAOX,MACCkxD,EAAkB,GAClB/vC,EAAKk5B,GAAMl5B,EAAIA,EAAG,MAAM,CAAC,EAAG,CAAC,EAAE,IAAI,SAAA1V,EAAC,CAAI,OAAA2vC,GAAQ3vC,EAAG,CAAC,CAAC,CAAC,CAAd,CAAe,EAGzDrC,EACI+X,EAAG,QAAUA,EAAG,CAAC,EAAE,MAAM,CAAC,EAC1B,UAAA,CAAM,MAAA,oCACK,OAAAA,EAAkB,OAAkB,YAAA,EAC3C,yBAAA,OAA0BA,EAAkB,CAAC,EAAE,MAAM,CAAC,EAAC,IAAA,CAFrD,CAEyD,EAInE,QAFMiwC,EAAiB,CAAA,EACjBC,EAAOlwC,aACJnhB,EAAC,CACRoxD,EAAG,KAAK3oC,EAAO,KAAK,UAAA,CAClB,IAAIhd,EAAI4lD,EAAKrxD,CAAC,EACd,GAAIA,EAAI,EACN,QAAS8K,EAAI,EAAGA,EAAI9K,EAAG,EAAE8K,EAAG,CAC1B,IAAMwmD,EAAOh8B,GAAIwN,GAAIxN,GAAI87B,EAAGtmD,CAAC,EAAGW,CAAC,CAAC,EAAG2lD,EAAGtmD,CAAC,CAAC,EAC1CW,EAAI07B,GAAI17B,EAAG6lD,CAAI,CAChB,CAEH,OAAOl1C,GAAI3Q,EAAGw3B,GAAKx3B,EAAG,WAAW,CAAC,EACnC,CAAC,GAVKzL,EAAI,EAAGA,EAAImhB,EAAG,OAAQ,EAAEnhB,IAAxBA,CAAC,EAaV,OAAIkxD,EACK5V,GAAM8V,EAAI,CAAC,EAEXA,CAEX,CAEO,IAAMG,GAA8B5xD,EAAG,CAAC,aAAYsxD,EAAA,CAAC,ECzB5D,SAASO,GAAI/lD,EAAWgmD,EAAoB,CAM1C,GANsBA,IAAA,SAAAA,EAAoB,IAC1CroD,EACIqC,EAAE,MAAQ,EACV,UAAA,CAAM,MAAA,gEAAA,OACFA,EAAE,IAAI,CADJ,CACM,EAEZA,EAAE,OAAS,EACb,OAAOimD,GAAKjmD,EAAegmD,CAAY,EAMvC,IAAME,EAAgBlmD,EAAE,MAAM,MAAM,EAAGA,EAAE,MAAM,OAAS,CAAC,EAC9B,OAAO,SAAChN,EAAO4H,EAAI,CAAK,OAAA5H,EAAQ4H,CAAR,CAAY,EACzDurD,EAAO5T,GACT9pB,EACIzoB,EACA,CACEkmD,EAAelmD,EAAE,MAAMA,EAAE,MAAM,OAAS,CAAC,EACzCA,EAAE,MAAMA,EAAE,MAAM,OAAS,CAAC,EAC3B,EACL,CAAC,EACComD,EAAmB,CAAA,EACnBC,EAAmB,CAAA,EACzBF,EAAK,QAAQ,SAAAG,EAAG,CACR,IAAA5vD,EAAAlC,EAAayxD,GAAKK,EAAiBN,CAAY,EAAC,CAAA,EAA/CO,EAAG7vD,EAAA,CAAA,EAAE8vD,EAAG9vD,EAAA,CAAA,EACf0vD,EAAK,KAAKG,CAAG,EACbF,EAAK,KAAKG,CAAG,CACf,CAAC,EACD,IAAMC,EAAIh+B,EAAQonB,GAAMuW,EAAM,CAAC,EAAGpmD,EAAE,KAAK,EACnCvL,EAAIg0B,EAAQonB,GAAMwW,EAAM,CAAC,EAAGrmD,EAAE,KAAK,EACzC,MAAO,CAACymD,EAAGhyD,CAAC,CAEhB,CAEA,SAASwxD,GAAKjmD,EAAagmD,EAAoB,CAApB,OAAAA,IAAA,SAAAA,EAAoB,IACtChpC,EAAO,KAAK,UAAA,CACjBrf,EACIqC,EAAE,MAAM,SAAW,EACnB,UAAA,CAAM,MAAA,0CACF,OAAAA,EAAE,MAAM,OAAiB,WAAA,CAAA,CAAA,EAYjC,QAVM1L,EAAI0L,EAAE,MAAM,CAAC,EACb,EAAIA,EAAE,MAAM,CAAC,EAEfymD,EAAI/tB,GAAIpkC,CAAC,EACTG,EAAIuD,GAAMgI,CAAC,EAET0mD,EAAQjW,GAAS,CAAC,CAAC,CAAC,CAAC,EAAG,CAAC,EAAG,CAAC,CAAC,EAChCrS,EAAcpmC,GAAM0uD,CAAK,EAEvBC,EAAQryD,GAAK,EAAI,EAAIA,aAClB+K,EAAC,OAGFunD,EAAQnyD,EACRoyD,EAAQzoB,EACR0oB,EAAQL,EACd/vD,EAAAlC,EAAYwoB,EAAO,KAAK,UAAA,CAEtB,IAAM+pC,EAAS78B,GAAMz1B,EAAG,CAAC4K,EAAGA,CAAC,EAAG,CAAC/K,EAAI+K,EAAG,CAAC,CAAC,EACpC2nD,EAAQxvB,GAAKuvB,CAAM,EACnBE,EAAM/8B,GAAMz1B,EAAG,CAAC4K,EAAGA,CAAC,EAAG,CAAC,EAAG,CAAC,CAAC,EAG7BhL,EAAIw/B,GAAMqF,GAAQ+tB,EAAK,CAAC,EAAGxW,GAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAGA,GAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAE5DyW,EAAKxrB,GAAIurB,EAAKp9B,GAAIx1B,EAAG2yD,CAAK,CAAC,EAC3BG,EAAOx2C,GAAIo2C,EAAQG,CAAE,EACvBC,EAAK,MAAM,CAAC,IAAM,EACpB/oB,EAAIpmC,GAAM0uD,CAAK,EAEftoB,EAAI7U,GACA,CACEm9B,EACAx8B,GAAMi9B,EAAM,CAAC,EAAG,CAAC,EAAG,CAACA,EAAK,MAAM,CAAC,EAAI,EAAGA,EAAK,MAAM,CAAC,CAAC,CAAC,GAGxD,CAAC,EAEP,IAAMC,EAAMnsB,GAAItqB,GAAIgZ,GAAOt1B,EAAG6yD,CAAE,EAAGF,CAAK,CAAC,EAGnCK,EAAWn9B,GAAMz1B,EAAG,CAAC4K,EAAG,CAAC,EAAG,CAAC/K,EAAI+K,EAAG,CAAC,CAAC,EACtCioD,EAAsBz9B,GAAIu9B,EAAKhpB,CAAC,EAChCmpB,EAAevT,GAAU5V,CAAC,EAChC,GAAI/+B,IAAM,EACR5K,EAAIinC,GAAI2rB,EAAU19B,GAAO29B,EAAW39B,GAAO49B,EAAIF,CAAQ,CAAC,CAAC,MACpD,CACL,IAAMG,EACF9rB,GAAI2rB,EAAU19B,GAAO29B,EAAW39B,GAAO49B,EAAIF,CAAQ,CAAC,CAAC,EACzD5yD,EAAI80B,GAAO,CAACW,GAAMz1B,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC4K,EAAG,CAAC,CAAC,EAAGmoD,CAAS,EAAG,CAAC,CACpD,CACD,IAAMC,EAAuBzT,GAAUsT,CAAS,EAC1CI,EAAWx9B,GAAMu8B,EAAG,CAAC,EAAGpnD,CAAC,EAAG,CAAC/K,EAAGmyD,EAAE,MAAM,CAAC,EAAIpnD,CAAC,CAAC,EACrD,GAAIA,IAAM,EACRonD,EAAI/qB,GAAIgsB,EAAU/9B,GAAOA,GAAO+9B,EAAUtpB,CAAC,EAAGqpB,CAAU,CAAC,MACpD,CACL,IAAME,EACFjsB,GAAIgsB,EAAU/9B,GAAOA,GAAO+9B,EAAUtpB,CAAC,EAAGqpB,CAAU,CAAC,EACzDhB,EAAIl9B,GAAO,CAACW,GAAMu8B,EAAG,CAAC,EAAG,CAAC,EAAG,CAACnyD,EAAG+K,CAAC,CAAC,EAAGsoD,CAAS,EAAG,CAAC,CACpD,CACD,MAAO,CAACvpB,EAAG3pC,EAAGgyD,CAAC,EAChB,EAAC,CAAA,EA7CDroB,EAAC1nC,EAAA,CAAA,EAAEjC,EAACiC,EAAA,CAAA,EAAE+vD,EAAC/vD,EAAA,CAAA,EA8CRi9C,GAAQ,CAACiT,EAAOC,EAAOC,CAAK,CAAC,GApDtBznD,EAAI,EAAGA,EAAIsnD,EAAO,EAAEtnD,IAApBA,CAAC,EAuDV,MAAI,CAAC2mD,GAAgB1xD,EAAI,IACvBmyD,EAAIv8B,GAAMu8B,EAAG,CAAC,EAAG,CAAC,EAAG,CAACnyD,EAAG,CAAC,CAAC,EAC3BG,EAAIy1B,GAAMz1B,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,EAAG,CAAC,CAAC,GAGtB,CAACgyD,EAAGhyD,CAAC,CACd,CAAC,CACH,CAEO,IAAMmzD,GAAqB1zD,EAAG,CAAC,IAAG6xD,EAAA,CAAC,ECvL1C,IAAY8B,IAAZ,SAAYA,EAAS,CACnBA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,KAAA,CAAA,EAAA,OACAA,EAAAA,EAAA,IAAA,CAAA,EAAA,MACAA,EAAAA,EAAA,uBAAA,CAAA,EAAA,wBACF,GALYA,KAAAA,GAKX,CAAA,EAAA,ECoBD,SAASC,GACLC,EAAsBjuD,EACtBb,EAA4C,CAA5CA,IAAA,SAAAA,EAAY4uD,GAAU,wBACxB,IAAMG,EAAUjmC,EAAgBgmC,EAAQ,SAAU,qBAAqB,EACnEj7B,EAAmB,KACnBhzB,GAAW,OACbgzB,EAAW/K,EAAgBjoB,EAAS,UAAW,qBAAqB,GAGtE,IAAMmuD,EAAgBn7B,GAAY,KAAQk7B,EAAUn+B,GAAIm+B,EAASl7B,CAAQ,EAEzE,GAAI7zB,IAAc4uD,GAAU,KAC1B,OAAOI,EAET,GAAIhvD,IAAc4uD,GAAU,IAC1B,OAAOxwB,GAAI4wB,CAAY,EAEzB,GAAIhvD,IAAc4uD,GAAU,KAAM,CAChC,GAAI/6B,GAAY,KACd,OAAOhB,GAAKm8B,CAAY,EAExB,IAAMC,EAAkBF,EAAQ,KAAOl7B,EAAS,KAC1Cv5B,EAASod,GAAI0mB,GAAI4wB,CAAY,EAAG5wB,GAAIvK,CAAQ,CAAC,EACnD,OAAOo7B,EAAkB,EAAIv3C,GAAIpd,EAAQwjC,GAAOmxB,CAAe,CAAC,EACnC30D,CAEhC,CACD,GAAI0F,IAAc4uD,GAAU,uBAAwB,CAClD,GAAI/6B,GAAY,KACd,OAAOnc,GAAI0mB,GAAI4wB,CAAY,EAAGlxB,GAAOixB,EAAQ,IAAI,CAAC,EAElD,IAAMG,EAAqBt+B,GAAIiD,EAAUpM,GAAKsnC,EAAQ,KAAK,CAAC,EAEtDI,EACFxjC,GAAKyS,GAAI0I,GAASooB,EAAoBpxB,GAAO,CAAC,CAAC,CAAC,EAAG,SAAS,EAChE,OAAOpmB,GAAI0mB,GAAI4wB,CAAY,EAAGG,CAAW,CAE5C,CAED,MAAM,MAAM,sBAAA,OAAsBnvD,CAAS,CAAE,CAC/C,CACO,IAAMovD,GAAsCn0D,EAAG,CAAC,qBAAoB4zD,EAAA,CAAC,ECxC5E,SAASQ,GACLC,EAAsB9R,EACtB38C,EACAb,EAA4C,CAA5CA,IAAA,SAAAA,EAAY4uD,GAAU,wBACxB,IAAMW,EAAUzmC,EAAgBwmC,EAAQ,SAAU,oBAAoB,EAChE5R,EACF50B,EAAgB00B,EAAa,cAAe,oBAAoB,EAChE3pB,EAAmB,KACnBhzB,GAAW,OACbgzB,EAAW/K,EAAgBjoB,EAAS,UAAW,oBAAoB,GAErEgE,GACI0qD,EAAQ,MAAO7R,EAAa,MAAO,+BAA+B,EAEtE,IAAMoR,EAASplC,GAAI+Y,GAAI8sB,EAAS7R,CAAY,CAAC,EAC7C,OAAO0R,GAAoBN,EAAQj7B,EAAU7zB,CAAS,CACxD,CAEO,IAAMwvD,GAAqCv0D,EAAG,CAAC,oBAAmBo0D,EAAA,CAAC,EChB1E,SAASI,GACLH,EAAsB9R,EAA2B53C,EACjD/E,EACAb,EAA4C,CAA5CA,IAAA,SAAAA,EAAY4uD,GAAU,wBACxB,IAAMW,EAAUzmC,EAAgBwmC,EAAQ,SAAU,gBAAgB,EAC5D5R,EACF50B,EAAgB00B,EAAa,cAAe,gBAAgB,EAC5D3pB,EAAmB,KACnBhzB,GAAW,OACbgzB,EAAW/K,EAAgBjoB,EAAS,UAAW,gBAAgB,GAEjEgE,GACI0qD,EAAQ,MAAO7R,EAAa,MAAO,2BAA2B,EAElE,IAAMrC,EAAMvd,GAAO,CAAC,EACdgxB,EAASrsB,GAAI4Y,EAAKjd,GAAIxN,GAAI2+B,EAAS7R,CAAY,EAAG93C,EAAM,EAAI,CAAC,EACnE,OAAOwpD,GAAoBN,EAAQj7B,EAAU7zB,CAAS,CACxD,CACO,IAAM0vD,GAAiCz0D,EAAG,CAAC,gBAAew0D,EAAA,CAAC,ECnBlE,SAASE,GACLL,EAAsB9R,EACtB38C,EACAb,EAA4C,CAA5CA,IAAA,SAAAA,EAAY4uD,GAAU,wBACxB,IAAIW,EAAUzmC,EAAgBwmC,EAAQ,SAAU,WAAW,EACrD5R,EAAe50B,EAAgB00B,EAAa,cAAe,WAAW,EACxE3pB,EAAmB,KACnBhzB,GAAW,OACbgzB,EAAW/K,EAAgBjoB,EAAS,UAAW,WAAW,GAE5DgE,GAAkB0qD,EAAQ,MAAO7R,EAAa,MAAO,sBAAsB,EAE3E,IAAMrC,EAAMvd,GAAO,CAAC,EAEpByxB,EAAU9sB,GAAI7R,GAAIkN,GAAO,CAAC,EAAGyxB,CAAO,EAAGlU,CAAG,EAC1C,IAAMyT,EAASld,GAAKnP,GAAI4Y,EAAKzqB,GAAI2+B,EAAS7R,CAAY,CAAC,CAAC,EACxD,OAAO0R,GAAoBN,EAAQj7B,EAAU7zB,CAAS,CACxD,CACO,IAAM4vD,GAA4B30D,EAAG,CAAC,WAAU00D,EAAA,CAAC,ECbxD,SAASE,GACLP,EAAsB9R,EACtB38C,EAA6B2Y,EAC7BxZ,EAA4C,CADfwZ,IAAA,SAAAA,EAAW,GACxCxZ,IAAA,SAAAA,EAAY4uD,GAAU,wBACxB,IAAMW,EAAUzmC,EAAgBwmC,EAAQ,SAAU,WAAW,EACvD5R,EAAe50B,EAAgB00B,EAAa,cAAe,WAAW,EACxE3pB,EAAmB,KACnBhzB,GAAW,OACbgzB,EAAW/K,EAAgBjoB,EAAS,UAAW,WAAW,GAE5DgE,GAAkB0qD,EAAQ,MAAO7R,EAAa,MAAO,sBAAsB,EAE3E,IAAMoS,EAAchyB,GAAOtkB,CAAK,EAC1B9d,EAAQguB,GAAI+Y,GAAIib,EAAc6R,CAAO,CAAC,EACtCQ,EAAY1qB,GAAQ3pC,EAAOo0D,CAAW,EACtCE,EAASvtB,GAAI/mC,EAAOq0D,CAAS,EAE7BjB,EACFvxC,GAAIqT,GAAIkN,GAAO,EAAG,EAAGI,GAAO6xB,CAAS,CAAC,EAAGn/B,GAAIk/B,EAAaE,CAAM,CAAC,EACrE,OAAOZ,GAAoBN,EAAQj7B,EAAU7zB,CAAS,CACxD,CACO,IAAMiwD,GAA4Bh1D,EAAG,CAAC,WAAU40D,EAAA,CAAC,ECtBxD,SAASK,GACLZ,EAAsB9R,EACtB38C,EAA6BsvD,EAC7BnwD,EAA4C,CADfmwD,IAAA,SAAAA,EAAc,MAC3CnwD,IAAA,SAAAA,EAAY4uD,GAAU,wBACxB,IAAMW,EAAUzmC,EAAgBwmC,EAAQ,SAAU,SAAS,EACrD5R,EAAe50B,EAAgB00B,EAAa,cAAe,SAAS,EACtE3pB,EAAmB,KACnBhzB,GAAW,OACbgzB,EAAW/K,EAAgBjoB,EAAS,UAAW,SAAS,GAE1DgE,GAAkB0qD,EAAQ,MAAO7R,EAAa,MAAO,oBAAoB,EAEzE,IAAMrC,EAAMvd,GAAO,CAAC,EACdsyB,EAAgBtyB,GAAOqyB,CAAO,EAE9BE,EAAKruB,GAAIpR,GAAI2+B,EAAS5tB,GAAIpkB,GAAImgC,EAAc0S,CAAa,CAAC,CAAC,CAAC,EAC5DE,EACF1/B,GAAI6R,GAAI4Y,EAAKkU,CAAO,EAAG5tB,GAAIpkB,GAAIklB,GAAI4Y,EAAKqC,CAAY,EAAG0S,CAAa,CAAC,CAAC,EACpEtB,EAASrsB,GAAI4tB,EAAIC,CAAE,EACzB,OAAOlB,GAAoBN,EAAQj7B,EAAU7zB,CAAS,CACxD,CACO,IAAMuwD,GAA0Bt1D,EAAG,CAAC,SAAQi1D,EAAA,CAAC,EC3BpD,SAASM,GACLlB,EAAsB9R,EACtB38C,EACAb,EAA4C,CAA5CA,IAAA,SAAAA,EAAY4uD,GAAU,wBACxB,IAAMW,EAAUzmC,EAAgBwmC,EAAQ,SAAU,kBAAkB,EAC9D5R,EACF50B,EAAgB00B,EAAa,cAAe,kBAAkB,EAC9D3pB,EAAmB,KACnBhzB,GAAW,OACbgzB,EAAW/K,EAAgBjoB,EAAS,UAAW,kBAAkB,GAEnEgE,GACI0qD,EAAQ,MAAO7R,EAAa,MAAO,6BAA6B,EAEpE,IAAMoR,EAAStY,GAAkB+Y,EAAS7R,CAAY,EACtD,OAAO0R,GAAoBN,EAAQj7B,EAAU7zB,CAAS,CACxD,CACO,IAAMywD,GAAmCx1D,EAAG,CAAC,kBAAiBu1D,EAAA,CAAC,ECxBtE,SAASE,GACLpB,EAAsB3sB,EAAoB,CAC5C,IAAM4sB,EACFzmC,EAAgBwmC,EAAQ,SAAU,+BAA+B,EAC/D1sB,EACF9Z,EAAgB6Z,EAAQ,SAAU,+BAA+B,EACrE99B,GACI0qD,EAAQ,MAAO3sB,EAAQ,MAAO,0CAA0C,EAsB5E,IAAM+tB,EAAY/e,GAAKhP,CAAO,EACxBguB,EAAgBhgC,GAAIgS,EAAS2sB,CAAO,EACpCsB,EAAgBhvB,GAAMxE,GAAI2E,GAAItY,GAAIkZ,CAAO,CAAC,CAAC,CAAC,EAElD,OAAOrlB,GAAIklB,GAAIkuB,EAAWC,CAAa,EAAGC,CAAa,CACzD,CAuBA,SAASC,GACLC,EAAgCpuB,EAChC9hC,EAA6BmwD,EAC7BhxD,EAA4C,CADfgxD,IAAA,SAAAA,EAAkB,GAC/ChxD,IAAA,SAAAA,EAAY4uD,GAAU,wBACxB,IAAIqC,EAAoBnoC,EACpBioC,EAAkB,mBAAoB,qBAAqB,EACzDnuB,EAAU9Z,EAAgB6Z,EAAQ,SAAU,qBAAqB,EACnE9O,EAAmB,KAOvB,GANIhzB,GAAW,OACbgzB,EAAW/K,EAAgBjoB,EAAS,UAAW,qBAAqB,GAEtEgE,GACIosD,EAAkB,MAAOruB,EAAQ,MAAO,gCAAgC,EAExEouB,EAAiB,EAAG,CACtB,IAAME,EAAuBpzB,GAAOkzB,CAAc,EAC5C3V,EAAMvd,GAAO,CAAC,EACdmY,EAAOnY,GAAO,EAAG,EAEvBmzB,EACI1zC,GAAIqT,GAAIqgC,EAAmBxuB,GAAI4Y,EAAK6V,CAAoB,CAAC,EACrDtgC,GAAIqlB,EAAMib,CAAoB,CAAC,CACxC,CACD,IAAMpC,EAAS4B,GAA+BO,EAAmBruB,CAAO,EAExE,OAAOwsB,GAAoBN,EAAQj7B,EAAU7zB,CAAS,CACxD,CAEO,IAAMmxD,GAAsCl2D,EAAG,CAAC,qBAAoB61D,EAAA,CAAC,ECzD5E,SAASM,GACL9B,EAAW3sB,EAAW/+B,EAAQ,CAKhC,GALwBA,IAAA,SAAAA,EAAA,IACpBA,IAAQ,KACVA,EAAM++B,EAAO,KAAO,GAGlB/+B,IAAQ++B,EAAO,KAAO,EACxB,MAAM,MACF,+DACA,uCAAuC,OAAAA,EAAO,KAAO,GAAA,EACrD,eAAe,OAAA/+B,CAAG,CAAE,EAG1B,IAAMw+B,EACFN,GAAW,SAACwtB,EAAgB3sB,EAAgB7a,EAAkB,CAI5D,IAAMyC,EAAW,GACX8mC,EAAMnuB,GAAUP,EAAQ,CAAC/+B,CAAG,EAAG2mB,CAAQ,EACvC+mC,EAAY7uB,GAAI9W,GAAKgX,EAAQ,SAAS,EAAG0uB,CAAG,EAClDvpC,EAAK,CAACwnC,EAAQgC,CAAS,CAAC,EAExB,IAAMC,EAAavvB,GAAIpR,GAAI0gC,EAAWhC,CAAM,CAAC,EACvCv1D,EAAWqkC,GAAImzB,EAAY,CAAC3tD,CAAG,CAAC,EAEhCy+B,EAAW,SAACpe,EAAOE,EAAe,CAChC,IAAA1mB,EAAAlC,EAAsB4oB,EAAK,CAAA,EAA1BmrC,EAAM7xD,EAAA,CAAA,EAAE6zD,EAAS7zD,EAAA,CAAA,EAClB+zD,EAAU30B,GAAqB5Y,EAAG,MAAO,CAACrgB,CAAG,CAAC,EACpD,MAAO,CACLgtB,GAAIpB,EAAQvL,EAAIutC,CAAO,EACnB/uB,GAAI9W,GAAK2jC,EAAQ,SAAS,EAAGjyB,GAAIi0B,CAAS,CAAC,CAAC,EAChD1gC,GAAIpB,EAAQvL,EAAIutC,CAAO,EACnB/uB,GAAIpF,GAAIi0B,CAAS,EAAG3lC,GAAK2jC,EAAQ,SAAS,CAAC,CAAC,EAEpD,EACA,MAAO,CAAC,MAAKv1D,EAAE,SAAQsoC,CAAA,CACzB,CAAC,EAEL,OAAOD,EAASktB,EAAQ3sB,CAAM,CAChC,CAqBA,SAAS8uB,GACLC,EAA4B/uB,EAC5B9hC,EAA6BmwD,EAC7BhxD,EAA4C,CADfgxD,IAAA,SAAAA,EAAkB,GAC/ChxD,IAAA,SAAAA,EAAY4uD,GAAU,wBACxB,IAAI+C,EACA7oC,EAAgB4oC,EAAc,eAAgB,qBAAqB,EACjE9uB,EAAU9Z,EAAgB6Z,EAAQ,SAAU,qBAAqB,EACnE9O,EAAmB,KASvB,GAPIhzB,GAAW,OACbgzB,EAAW/K,EAAgBjoB,EAAS,UAAW,qBAAqB,GAGtEgE,GACI8sD,EAAc,MAAO/uB,EAAQ,MAAO,gCAAgC,EAEpEouB,EAAiB,EAAG,CACtB,IAAME,EAAuBpzB,GAAOkzB,CAAc,EAC5C3V,EAAMvd,GAAO,CAAC,EACd8zB,EAAa9zB,GAAO6zB,EAAc,MAAM,CAAC,CAAC,EAEhDA,EACIp0C,GAAIqT,GAAI+gC,EAAelvB,GAAI4Y,EAAK6V,CAAoB,CAAC,EACjDx5C,GAAIw5C,EAAsBU,CAAU,CAAC,CAC9C,CAED,IAAM9C,EAASsC,GAA+BO,EAAe/uB,CAAO,EAEpE,OAAOwsB,GAAoBN,EAAQj7B,EAAU7zB,CAAS,CACxD,CAEO,IAAM6xD,GAAsC52D,EAAG,CAAC,qBAAoBw2D,EAAA,CAAC,EC1E5E,SAASK,GACLvpC,EAA8BjkB,EAC9BytD,EACAjuD,EAA+B,CACjC,IAAMg8B,EACFhX,EAAgBP,EAAS,UAAW,sBAAuB,OAAO,EAChEyb,EAAUlb,EAAgBxkB,EAAQ,SAAU,qBAAqB,EACjE0tD,EACFlpC,EAAgBipC,EAAY,aAAc,sBAAuB,OAAO,EACtErmB,EAAgB5iB,EAClBhlB,EAAc,eAAgB,sBAAuBkgC,EAAQ,KAAK,EAEtE,GAAIlE,EAAS,OAAS,EACpB,MAAM,IAAI,MAAM;UAAA,OACVA,EAAS,KAAK,CAAE,EAExB,GAAIkE,EAAQ,OAAS,EACnB,MAAM,IAAI,MACN,gDAAA,OAAgDA,EAAQ,KAAK,CAAE,EAErE,GAAIguB,EAAY,OAAS,EACvB,MAAM,IAAI,MAAM,qDAAA,OACZA,EAAY,KAAK,CAAE,EAEzB,GAAItmB,EAAc,OAAS,EACzB,MAAM,IAAI,MAAM,uDAAA,OACZA,EAAc,KAAK,CAAE,EAG3B,IAAM1qC,EAAoC,CACxC,QAAS8+B,EACT,OAAQkE,EACR,WAAYguB,EACZ,aAActmB,GAGVpxC,EAAmBypB,EAAO,UAAUtR,GAAqBzR,CAAY,EAC3E,MAAO,CACL,cAAe1G,EAAO,CAAC,EACvB,aAAcA,EAAO,CAAC,EACtB,kBAAmBA,EAAO,CAAC,EAC3B,gBAAiBA,EAAO,CAAC,EAE7B,CAEO,IAAM23D,GAAsCh3D,EAAG,CAAC,qBAAoB62D,EAAA,CAAC,ECnE5E,SAASI,GACLC,EAAmC91C,EACnCrW,EAA6B,CAC/B,IAAMosD,EACFtpC,EAAgBqpC,EAAc,eAAgB,gBAAiB,OAAO,EACpEE,EACFvpC,EAAgBzM,EAAY,aAAc,gBAAiB,OAAO,EAChEi2C,EACFxpC,EAAgB9iB,EAAU,WAAY,gBAAiB,OAAO,EAElE,GAAIosD,EAAc,OAAS,EACzB,MAAM,IAAI,MAAM;UAAA,OACVA,EAAc,KAAK,CAAE,EAE7B,GAAIC,EAAY,OAAS,EACvB,MAAM,IAAI,MAAM,qDAAA,OACZA,EAAY,KAAK,CAAE,EAEzB,GAAIC,EAAU,OAAS,EACrB,MAAM,IAAI,MACN,mDAAA,OAAmDA,EAAU,KAAK,CAAE,EAG1E,IAAMtxD,EAA8B,CAClC,aAAcoxD,EACd,WAAYC,EACZ,SAAUC,GAENh4D,EAAmBypB,EAAO,UAAUrR,GAAe1R,CAAY,EACrE,MAAO,CAAC,cAAe1G,EAAO,CAAC,EAAG,YAAaA,EAAO,CAAC,CAAC,CAC1D,CAEO,IAAMi4D,GAAgCt3D,EAAG,CAAC,eAAci3D,EAAA,CAAC,ECjChE,SAASM,GACL70D,EAAyB4qB,EACzB0wB,EAA+B,CACjC,IAAMrnB,EAAQ9I,EAAgBnrB,EAAM,OAAQ,mBAAmB,EACzDmiC,EACFhX,EAAgBP,EAAS,UAAW,oBAAqB,OAAO,EAC9D4wB,EACFrwB,EAAgBmwB,EAAY,aAAc,oBAAqB,OAAO,EAE1E,GAAIrnB,EAAM,KAAO,EACf,MAAM,IAAI,MACN,2DAA2D,EAEjE,GAAIkO,EAAS,OAAS,EACpB,MAAM,IAAI,MAAM;YAAA,OACRA,EAAS,KAAK,CAAE,EAE1B,GAAIqZ,EAAY,OAAS,EACvB,MAAM,IAAI,MAAM;YAAA,OACRA,EAAY,KAAK,CAAE,EAG7B,IAAMn4C,EAAkC,CACtC,KAAM4wB,EACN,QAASkO,EACT,WAAYqZ,GAGd,OAAOp1B,EAAO,UAAUpR,GAAmB3R,CAAY,CACzD,CAEO,IAAMyxD,GAAoCx3D,EAAG,CAAC,mBAAkBu3D,EAAA,CAAC,EC/BxE,SAASE,GACL/0D,EAAyB4qB,EACzB0wB,EAA+B,CACjC,IAAMrnB,EAAQ9I,EAAgBnrB,EAAM,OAAQ,kBAAkB,EACxDmiC,EACFhX,EAAgBP,EAAS,UAAW,mBAAoB,OAAO,EAC7D4wB,EACFrwB,EAAgBmwB,EAAY,aAAc,mBAAoB,OAAO,EAEzE,GAAIrnB,EAAM,KAAO,EACf,MAAM,IAAI,MACN,2DAA2D,EAEjE,GAAIkO,EAAS,OAAS,EACpB,MAAM,IAAI,MAAM;WAAA,OACTA,EAAS,KAAK,CAAE,EAEzB,GAAIqZ,EAAY,OAAS,EACvB,MAAM,IAAI,MAAM;WAAA,OACTA,EAAY,KAAK,CAAE,EAG5B,IAAMn4C,EAAiC,CACrC,KAAM4wB,EACN,QAASkO,EACT,WAAYqZ,GAGd,OAAOp1B,EAAO,UAAUnR,GAAkB5R,CAAY,CACxD,CAEO,IAAM2xD,GAAmC13D,EAAG,CAAC,kBAAiBy3D,EAAA,CAAC,ECvBtE,SAASE,GACLj1D,EAA2Bk1D,EAA+BC,EAC1DC,EAAuBC,EAAiBttD,EAAkButD,EAC1DC,EAA+B,CACjC,IAAMthC,EAAQ9I,EAAgBnrB,EAAM,OAAQ,eAAgB,QAAQ,EACpE,GAAIi0B,EAAM,QAAU,SAClB,MAAM,IAAI,MAAM,iCAAiC,EAEnD,GAAIA,EAAM,MAAM,SAAW,EACzB,MAAM,IAAI,MAAM,+BAAA,OAA+BA,EAAM,KAAK,CAAE,EAG9D,IAAMuhC,EAAcrqC,EAAgB+pC,EAAY,aAAc,cAAc,EAC5E,GAAIM,EAAY,QAAU,QACxB,MAAM,IAAI,MAAM,uCAAuC,EAGzD,IAAM5vD,EAA2B,CAC/B,UAASuvD,EACT,YAAWC,EACX,QAAOC,EACP,SAAQttD,EACR,SAAQutD,EACR,uBAAsBC,GAGlBlyD,EAA6B,CAAC,KAAM4wB,EAAO,WAAYuhC,CAAW,EAClE74D,EACFypB,EAAO,UAAU9Q,GAAcjS,EAAcuC,CAAW,EAC5D,MAAO,CAAC,OAAQjJ,EAAO,CAAC,EAAG,aAAcA,EAAO,CAAC,CAAC,CACpD,CAEO,IAAM84D,GAA+Bn4D,EAAG,CAAC,cAAa23D,EAAA,CAAC,ECzC9D,SAASS,GACLvxD,EAA4BwxD,EAC5BC,EAAgB,CAAhBA,IAAA,SAAAA,EAAgB,IAClB,IAAMlzB,EAASvX,EAAgBhnB,EAAO,QAAS,cAAe,QAAQ,EAChE0xD,EACF1qC,EAAgBwqC,EAAW,YAAa,cAAe,QAAQ,EAEnE,GAAIjzB,EAAO,OAAS,EAClB,MAAM,IAAI,MACN,+CAAA,OAA+CA,EAAO,KAAK,CAAE,EAEnE,GAAImzB,EAAW,OAAS,EACtB,MAAM,IAAI,MACN,mDAAA,OAAmDA,EAAW,KAAK,CAAE,EAG3E,IAAMjwD,EAA0B,CAAC,UAASgwD,CAAA,EACpCvyD,EAA4B,CAAC,MAAOq/B,EAAQ,UAAWmzB,CAAU,EACjEl5D,EACFypB,EAAO,UAAU7Q,GAAalS,EAAcuC,CAAW,EAC3D,MAAO,CAAC,QAASjJ,EAAO,CAAC,EAAG,OAAQA,EAAO,CAAC,EAAG,MAAOA,EAAO,CAAC,CAAC,CACjE,CAEO,IAAMm5D,GAA8Bx4D,EAAG,CAAC,aAAYo4D,EAAA,CAAC,ECnC5D,SAASK,GACL5xD,EAA0B6xD,EAAkB,CAC9C,IAAMtzB,EACFvX,EAAgBhnB,EAAO,QAAS,yBAA0B,QAAQ,EAChEyB,EAAqC,CAAC,WAAUowD,CAAA,EAEtD,GAAIA,GAAc,EAChB,MAAM,IAAI,MAAM,sCAAsC,EAGxD,IAAM3yD,EAAuC,CAAC,MAAOq/B,CAAM,EAC3D,OAAOtc,EAAO,UAAU5Q,GAAwBnS,EAAcuC,CAAW,CAC3E,CAEO,IAAMqwD,GAAyC34D,EAAG,CAAC,wBAAuBy4D,EAAA,CAAC,ECflF,SAASG,GACP/xD,EAA4BgyD,EAAiBC,EAC7CC,EAAkB,CAAlBA,IAAA,SAAAA,EAAkB,IAElB,IAAM3zB,EAASvX,EAAgBhnB,EAAO,QAAS,qBAChB,QAAQ,EACjCyB,EAAiC,CAAC,QAAOuwD,EAAE,QAAOC,EAAE,cAAaC,CAAA,EACvE,OAAOjwC,EAAO,UAAUhR,GAAoB,CAAC,EAAGstB,CAAM,EAC9B98B,CAAgC,CAC1D,CAEO,IAAM0wD,GAAqCh5D,EAAG,CAAC,oBAAmB44D,EAAA,CAAC,ECiL1E,IAAM1zD,GAAW,CACf,IAAGw0C,GACH,KAAIE,GACJ,KAAIyB,GACJ,MAAKd,IASD+L,GAAS,CACb,cAAaJ,GACb,WAAUE,GACV,MAAKO,GACL,KAAIK,IAmBAriD,GAAQ,CACZ,cAAakjD,GACb,eAAcI,GACd,sBAAqBiG,GACrB,eAAcF,GACd,eAAczF,GACd,iBAAgBK,GAChB,cAAajB,GACb,kBAAiB0B,GACjB,uBAAsByD,GACtB,2BAA0BE,GAC1B,gCAA+BE,GAC/B,wBAAuBK,GACvB,6BAA4BE,GAC5B,UAAS0C,GACT,UAASM,IAOLwI,GAAS,CACb,SAAQ5H,GACR,YAAWO,GACX,GAAE8B,IAaEG,GAAS,CACb,mBAAkBU,GAClB,oBAAmBJ,GACnB,eAAcM,GACd,UAASE,GACT,UAASK,GACT,QAAOM,GACP,iBAAgBE,GAChB,oBAAmBU,GACnB,oBAAmBU,IAOf3xD,GAAS,CACb,oBAAmB+xD,GACnB,cAAaM,GACb,kBAAiBE,GACjB,iBAAgBE,IAQZvyD,GAAS,CACb,aAAYgzD,GACZ,YAAWK,GACX,uBAAsBG,GACtB,mBAAkBK,o/EEvTb,IAAME,GACT,SAACv3D,EAAYC,EACZC,EAA2BoC,EAAW,CACrC,OAD0BA,IAAA,SAAAA,EAAWk1D,IAC7Bx3D,EAAK,GAAE,CACb,IAAK,UACL,IAAK,QACL,IAAK,MACH,MAAO,CAACsC,EAAI,IACPxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC5CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,OACH,MAAO,CAACoC,EAAI,KACRxC,EAAc,UAAWE,EAAMC,EAAWC,CAAO,CAAc,CAAC,EAEtE,IAAK,WACL,IAAK,MACH,MAAO,CAACoC,EAAI,IACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,MACH,MAAO,CAACoC,EAAI,IACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,UACL,IAAK,MACH,MAAO,CAACoC,EAAI,IACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,WACH,MAAO,CAACoC,EAAI,SACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,WACH,MAAO,CAACoC,EAAI,SACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,MACH,MAAO,CAACoC,EAAI,IACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,UACH,MAAO,CAACoC,EAAI,QACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,UACH,MAAO,CAACoC,EAAI,QACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,MACH,MAAO,CAACoC,EAAI,IACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,oBACH,MAAO,CAACoC,EAAI,kBACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,QACE,MAAM,UAAU,aAAa,OAAAF,EAAK,GAAE,qBAAA,CAAqB,CAC5D,CACH,ECpEG,IAAMu3D,GACT,SAACv3D,EAAYC,EAA4BC,EACxCoC,EAAW,CACV,OADDA,IAAA,SAAAA,EAAWk1D,IACFx3D,EAAK,GAAE,CACb,IAAK,MACL,IAAK,aACH,MAAO,CAACsC,EAAI,IACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,OACH,MAAO,CAACoC,EAAI,KACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,QACH,MAAO,CAACoC,EAAI,MACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,OACH,MAAO,CAACoC,EAAI,KACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,QACH,MAAO,CAACoC,EAAI,MACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,OACH,MAAO,CAACoC,EAAI,KACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,QACH,MAAO,CAACoC,EAAI,MACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,QACH,MAAO,CAACoC,EAAI,MACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,OACH,MAAO,CAACoC,EAAI,KACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,UACH,MAAO,CAACoC,EAAI,QACRxC,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC9CJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAChE,IAAK,MACH,MAAO,CAACoC,EAAI,IACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,OACH,MAAO,CAACoC,EAAI,KACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,MACH,MAAO,CAACoC,EAAI,IACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,MACH,MAAO,CAACoC,EAAI,IACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,MACH,MAAO,CAACoC,EAAI,IACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,QACH,MAAO,CAACoC,EAAI,MACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,QACH,MAAO,CAACoC,EAAI,MACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,MACH,MAAO,CAACoC,EAAI,IACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,QACH,MAAO,CAACoC,EAAI,MACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,OACH,MAAO,CAACoC,EAAI,KACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,MACH,MAAO,CAACoC,EAAI,IACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,aACH,MAAO,CAACoC,EAAI,WACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,OACH,MAAO,CAACoC,EAAI,KACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,OACH,MAAO,CAACoC,EAAI,KACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,QACH,MAAO,CAACoC,EAAI,MACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,OACH,MAAO,CAACoC,EAAI,KACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,UACH,MAAO,CAACoC,EAAI,QACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,MACH,MAAO,CAACoC,EAAI,IACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,OACH,MAAO,CAACoC,EAAI,KACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,OACH,MAAO,CAACoC,EAAI,KACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,WACH,MAAO,CAACoC,EAAI,SACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,OACH,MAAO,CAACoC,EAAI,KACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,SACH,MAAO,CAACoC,EAAI,OACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,OACH,MAAO,CAACoC,EAAI,KACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,MACH,MAAO,CAACoC,EAAI,IACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,cACH,MAAO,CAACoC,EAAI,YACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACtDJ,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,CAC5C,CAAC,EACjB,IAAK,QACH,MAAO,CAACoC,EAAI,MACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAC7D,IAAK,QACH,MAAO,CAACoC,EAAI,MAAM9B,GAAUR,EAAK,WAAW,CAAC,EAAGC,EAAWC,CAAO,CAAC,CAAC,EACtE,IAAK,YACH,MAAO,CAACoC,EAAI,UACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,QAASE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EACjE,IAAK,QACH,MAAO,CAACoC,EAAI,MACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,QAASE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EACjE,IAAK,QACH,MAAO,CAACoC,EAAI,MAAM9B,GAAUR,EAAK,WAAW,CAAC,EAAGC,EAAWC,CAAO,CAAC,CAAC,EACtE,IAAK,QACH,MAAO,CAACoC,EAAI,MAAM9B,GAAUR,EAAK,WAAW,CAAC,EAAGC,EAAWC,CAAO,CAAC,CAAC,EACtE,IAAK,WACH,MAAO,CAACoC,EAAI,SACR9B,GAAUR,EAAK,WAAW,CAAC,EAAGC,EAAWC,CAAO,CAAC,CAAC,EACxD,QACE,MAAM,UAAU,aAAa,OAAAF,EAAK,GAAE,qBAAA,CAAqB,CAC5D,CACH,WCnJYy3D,GACZvvD,EAAyBC,EACzBC,EAAuB,CAEzB,GAFEA,IAAA,SAAAA,EAAuB,IAErB,SAAOF,GAAW,UAAY,OAAOC,GAAW,UAGpDnH,CAAAA,GAAAA,KAAK,OACDkH,EAAO,SAAWC,EAAO,OACzB,UAAA,CAAM,OAAAC,EAAqB,WAAA,OAAWF,EAAM,OAAA,EAAA,OAAQC,EAAmB,aAAA,CAAA,CAAA,EAC3E,QAASzJ,EAAI,EAAGA,EAAIwJ,EAAO,OAAQxJ,IAAK,CACtC,IAAMg5D,EAAOxvD,EAAOxJ,CAAC,EACfi5D,EAAOxvD,EAAOzJ,CAAC,EACrBsC,GAAAA,KAAK,OACD02D,EAAO,GAAKC,EAAO,GAAKD,IAASC,EACjC,UACI,CAAA,OAAAvvD,EAAqB,WAAW,OAAAF,EAAc,OAAA,EAAA,OAAAC,EAAmB,aAAA,CAAA,CAAA,CAC1E,EACH,CAEM,SAAUyvD,GAAiBC,EAA6B,CAC5D,MAAI,SAAOA,GAAiB,UAAYA,EAAa,KAAK,SAAA7wD,EAAG,CAAI,OAAAA,EAAM,CAAN,CAAO,EAI1E,UAQgB8wD,GACZC,EAAmCjvC,EACnC+uC,EAA6B,CAC/B,IAAIG,EAAeC,GAAkBF,EAAkBF,CAAY,EAC7DK,EAAsB,CAACN,GAAiBI,CAAY,EAC1D,GAAIE,GAAuBpvC,EAAQ,SAAW,EAC5C,MAAM,IAAI,MACN,+CACA,yCAAyC,OAAAkvC,CAAY,CAAE,EAO7D,GALIE,GACFpvC,EAAQ,QAAQ,SAAAhoB,EAAM,CACpBk3D,EAAeC,GAAkBn3D,EAAO,MAAOk3D,CAAY,CAC7D,CAAC,EAEC,CAACJ,GAAiBI,CAAY,EAChC,MAAM,IAAI,MAAM,mCAAA,OAAmCA,CAAY,CAAE,EAEnE,OAAOA,CACT,CAEgB,SAAAC,GACZE,EAAgCC,EAA8B,CAEhE,GAAI,OAAOD,GAAkB,SAC3B,OAAOC,EAET,GAAI,OAAOA,GAAkB,SAC3B,OAAOD,EAGT,GAAIA,EAAc,SAAWC,EAAc,OACzC,MAAM,IAAI,MAAM,oCAAA,OAAoCD,EAChD,OAAA,EAAA,OAAAC,CAAa,CAAE,EAIrB,QADM16D,EAAmB,CAAA,EAChBgB,EAAI,EAAGA,EAAIy5D,EAAc,OAAQ,EAAEz5D,EAAG,CAC7C,IAAMg5D,EAAOS,EAAcz5D,CAAC,EACtBi5D,EAAOS,EAAc15D,CAAC,EAC5B,GAAIg5D,GAAQ,GAAKC,GAAQ,GAAKD,IAASC,EACrC,MAAM,IAAI,MAAM,oCAAA,OAAoCQ,EAChD,OAAA,EAAA,OAAAC,CAAa,CAAE,EAErB16D,EAAOgB,CAAC,EAAIg5D,GAAQ,EAAIA,EAAOC,CAChC,CACD,OAAOj6D,CACT,CCjFA,IAAA26D,IAAA,UAAA,CAIE,SAAAA,EACa54D,EAAuBkI,EAAyB2wD,EACjDT,EAAiCU,EAChCC,EAA+BC,EAAuB,CAFtD,KAAI,KAAJh5D,EAAuB,KAAK,MAALkI,EAAyB,KAAO,QAAP2wD,EACjD,KAAY,aAAZT,EAAiC,KAAsB,uBAAtBU,EAChC,KAAW,YAAXC,EAA+B,KAAc,eAAdC,EANpC,KAAO,QAAsB,CAAA,EAC7B,KAAO,QAAG,GAMhB,KAAK,SAAWv3B,GAAAA,OAAO,CAAC,EACxBw3B,GAAAA,KAAK,KAAK,QAAQ,EAGpB,cAAA,eAAIL,EAAE,UAAA,KAAA,CAAN,IAAA,UAAA,CACE,OAAO,KAAK,SAAS,iCACtB,CAAA,EAED,OAAA,eAAIA,EAAM,UAAA,SAAA,CAAV,IAAA,UAAA,CACE,OAAO,KAAK,sCACb,CAAA,EAKDA,EAAa,UAAA,cAAb,SAAcM,EAAqB,CACjC,KAAK,QAAQ,QAAQ,SAAA73D,EAAM,EACrB63D,GAAW,MAAQ,CAACA,EAAQ,IAAI73D,EAAO,OAAO,EAAE,IAClDA,EAAO,OAAO,QAAO,CAEzB,CAAC,EACD,KAAK,QAAU,CAAA,EACf,KAAK,QAAU,GACf,KAAK,SAAS,QAAO,GAGvBu3D,EAAA,UAAA,KAAA,UAAA,CACE,OAAO,KAAK,QAAQ,QAOtBA,EAAI,UAAA,KAAJ,SAAKz3D,EAAa,CAChB,GAAI,KAAK,QACP,MAAM,IAAI,MAAM,eAAA,OAAe,KAAK,KAA+B,2BAAA,CAAA,EAGrE,GAAIA,EAAQ,GAAKA,GAAS,KAAK,KAAI,EACjC,MAAM,IAAI,MAAM,4BAAA,OAA4BA,EAAK,uBAAA,EAAA,OAC7C,KAAK,KAAI,CAAE,CAAE,EAGnB,IAAMg4D,EAAkB,KAAK,QAAQh4D,CAAK,EAC1C,GAAIg4D,EAAgB,QAClB,MAAM,IAAI,MACN,eAAA,OAAe,KAAK,KAChB,yBAAA,EAAA,OAAAh4D,EAA2D,sDAAA,EAC/D,kDAAkD,EAGxD,OAAI,KAAK,iBACPg4D,EAAgB,QAAU,IAG5BA,EAAgB,KAAO,GAChBA,EAAgB,QAMzBP,EAAQ,UAAA,SAAR,SAAS1sC,EAAiB,CAA1B,IAEC7nB,EAAA,KADC,OAAO6nB,EAAQ,IAAI,SAAA/qB,EAAS,CAAA,OAAAkD,EAAK,KAAKlD,CAAK,CAAf,CAAgB,GAQ9Cy3D,EAAA,UAAA,MAAA,SAAMz3D,EAAeE,EAAc,CACjC,GAAI,KAAK,QACP,MAAM,IAAI,MAAM,eAAA,OAAe,KAAK,KAA+B,2BAAA,CAAA,EAGrE,GAAIF,EAAQ,GAAK,CAAC,KAAK,aAAeA,GAAS,KAAK,QAClD,MAAM,IAAI,MAAM,2BACZ,OAAAA,EAAmD,6CAAA,EAAA,OAAA,KAAK,OAAO,CAAE,EAGvE,IAAM9C,EAAI,KAAK,QAAQ8C,CAAK,GAAK,CAAA,EAEjC,GAAIE,EAAO,QAAU,KAAK,MACxB,MAAM,IAAI,MAAM,eAAA,OACZ,KAAK,KAA8C,yCAAA,EAAA,OAAAF,EAAK;sCAAA,EAAA,OAExDE,EAAO,MAAmC,6BAAA,EAAA,OAAA,KAAK,MAAK,GAAA,CAAG,EAc7D,GAVI,KAAK,KAAI,IAAO,IACf,KAAK,cAAgB,MAAQ,KAAK,aAAa,SAAW,KAC7D,KAAK,aAAeA,EAAO,OAG7B22D,GACI,KAAK,aAAc32D,EAAO,MAC1B,eAAA,OAAe,KAAK,KAAI,yCAAA,EAAA,OACpBF,EAAK,GAAA,CAAG,EAEZ9C,EAAE,KACJ,MAAM,IAAI,MACN,eAAe,OAAA,KAAK,KAChB,yCAAA,EAAA,OAAA8C,EAA0C,qCAAA,CAAA,EAGpD,GAAI9C,EAAE,QACJ,MAAM,IAAI,MACN,eAAe,OAAA,KAAK,KAChB,yCAAA,EAAA,OAAA8C,EAA6C,wCAAA,CAAA,EAGvD9C,EAAE,OAASgD,EACX43D,GAAAA,KAAK53D,CAAM,EACXhD,EAAE,QAAU,GAEZ,KAAK,QAAQ8C,CAAK,EAAI9C,GAMxBu6D,EAAA,UAAA,UAAA,SAAU1sC,EAAmB7C,EAAiB,CAA9C,IAUChlB,EAAA,KATC,GAAI6nB,EAAQ,SAAW7C,EAAQ,OAC7B,MAAM,IAAI,MACN,eAAA,OAAe,KAAK,KAAyC,qCAAA,EAC7D,2BACI,OAAA6C,EAAQ,OAAM,oCAAA,EAAA,OACd7C,EAAQ,OAAS,GAAA,CAAA,EAG3B6C,EAAQ,QAAQ,SAACjtB,EAAGkC,EAAU,CAAA,OAAAkD,EAAK,MAAMpF,EAAGoqB,EAAQloB,CAAK,CAAC,CAAC,CAAA,GAW7Dy3D,EAAA,UAAA,OAAA,SAAO1sC,EAAoBhkB,EAAgB,CACzC,GAAMA,GAASA,IAAU,KAAK,MAC5B,MAAM,IAAI,MAAM,wBACZ,OAAA,KAAK,MAAoC,8BAAA,EAAA,OAAAA,CAAK,CAAE,EAGtD,GAAKgkB,EAMHA,EAAUA,EAAQ,MAAM,EAAG,KAAK,KAAI,CAAE,MAN1B,CACZA,EAAU,CAAA,EACV,QAASjtB,EAAI,EAAGA,EAAI,KAAK,KAAI,EAAIA,IAC/BitB,EAAQ,KAAKjtB,CAAC,CAEjB,CAID,GAAIitB,EAAQ,SAAW,EACrB,OAAO7qB,GAAAA,OAAO,CAAA,EAAI,CAAC,CAAC,EAAE,OAAO,KAAK,YAAY,CAAC,EAKjD,IAAMgoB,EAAU,KAAK,SAAS6C,CAAO,EAErC,OAAA8rC,GACI,KAAK,aAAc3uC,EAAQ,CAAC,EAAE,MAAO,8BAA8B,EAEhEkxB,GAAAA,MAAMlxB,EAAS,CAAC,GAMzBuvC,EAAM,UAAA,OAAN,SAAO1wD,EAAgB,CACrB,GAAMA,GAASA,IAAU,KAAK,MAC5B,MAAM,IAAI,MAAM,wBACZ,OAAA,KAAK,MAAoC,8BAAA,EAAA,OAAAA,CAAK,CAAE,EAGtD,GAAI,KAAK,KAAI,IAAO,EAClB,OAAO7G,GAAAA,OAAO,CAAA,EAAI,CAAC,CAAC,EAAE,OAAO,KAAK,YAAY,CAAC,EAIjD,QADM6qB,EAAU,CAAA,EACPjtB,EAAI,EAAGA,EAAI,KAAK,KAAI,EAAIA,IAC/BitB,EAAQ,KAAKjtB,CAAC,EAGhB,IAAMoqB,EAAU,KAAK,SAAS6C,CAAO,EAErC,OAAA8rC,GACI,KAAK,aAAc3uC,EAAQ,CAAC,EAAE,MAC9B,mDAAA,OACI,KAAK,aAAY,2BAAA,EAAA,OAA4BA,EAAQ,CAAC,EAAE,MAAQ,GAAA,CAAA,EAEjE4K,GAAAA,OAAO5K,EAAS,CAAC,GAS1BuvC,EAAA,UAAA,QAAA,SAAQ1sC,EAAmB7qB,EAAc,CACvC,GAAIA,EAAO,QAAU,KAAK,MACxB,MAAM,IAAI,MAAM,wBAAA,OACZ,KAAK,MAAK,wBAAA,EAAA,OAAyBA,EAAO,KAAK,CAAE,EAGvD,GAAI6qB,EAAQ,SAAW7qB,EAAO,MAAM,CAAC,EACnC,MAAM,IAAI,MAAM,sDACZ,OAAA6qB,EAAQ,OAAM,OAAA,EAAA,OAAQ7qB,EAAO,MAAM,CAAC,CAAC,CAAE,EAG7C,IAAMqd,EAAW,KAAK,IAAG,MAAR,KAAIpf,GAAA,CAAA,EAAAJ,EAAQgtB,CAAO,EAAA,EAAA,CAAA,EAEpC,GAAI,CAAC,KAAK,aAAexN,GAAY,KAAK,QACxC,MAAM,IAAI,MACN,mCAAmC,OAAAA,EAAiB,QAAA,EAAA,OAAA,KAAK,QAAU,GAAA,CAAA,EAGzE,KAAK,UAAUwN,EAAS+wB,GAAAA,QAAQ57C,EAAQ,CAAC,CAAC,GAS5Cu3D,EAAA,UAAA,MAAA,SAAMQ,EAAkB/3D,EAAc,CAAtC,IAyCCgD,EAAA,KAxCC,GAAIhD,EAAO,QAAU,KAAK,MACxB,MAAM,IAAI,MAAM,wBAAA,OACZ,KAAK,MAAK,wBAAA,EAAA,OAAyBA,EAAO,KAAK,CAAE,EAEvD,IAAIg4D,EAAc,EACZC,EAAoBF,EAAO,IAAI,SAAA7tD,EAAG,CACtC,OAAA8tD,GAAe9tD,EACR8tD,CACT,CAAC,EAED,GAAIA,IAAgBh4D,EAAO,MAAM,CAAC,EAChC,MAAM,IAAI,MAAM;;UAEZ,OAAAg4D,EAAuC,2BAAA,EAAA,OAAAh4D,EAAO,KAAK,CAAE,EAG3D,GAAI,CAAC,KAAK,aAAe+3D,EAAO,SAAW,KAAK,QAC9C,MAAM,IAAI,MACN,2DACI,OAAA,KAAK,QAAe,OAAA,EAAA,OAAAA,EAAO,OAAW,KAAA,EAC1C,6DAA6D,EAGnE,IAAMG,EAAgBF,IAAgB,EAAI,EAAIh4D,EAAO,KAAOg4D,EACtDhwC,EAAoB,CAAA,EAC1BpI,GAAAA,KAAK,UAAA,CACH5f,EAAS8xB,GAAAA,QAAQ9xB,EAAQ,CAAC,EAAGg4D,EAAaE,CAAa,CAAC,EACxD,QAASt6D,EAAI,EAAGA,EAAIm6D,EAAO,OAAQ,EAAEn6D,EAAG,CACtC,IAAMu6D,EAAkBv6D,IAAM,EAAK,EAAIq6D,EAAkBr6D,EAAI,CAAC,EACxDw6D,EAAU,CAAC,EAAGD,EAAgB,CAAC,EAC/BE,EAAQ,CAAC,EAAGN,EAAOn6D,CAAC,EAAGs6D,CAAa,EAC1ClwC,EAAQpqB,CAAC,EAAIk0B,GAAAA,QAAQyB,GAAAA,MAAMvzB,EAAQo4D,EAASC,CAAK,EAAGr1D,EAAK,YAAY,CACtE,CACD,OAAOglB,CACT,CAAC,EAED,QADM6C,EAAU,CAAA,EACPjtB,EAAI,EAAGA,EAAIm6D,EAAO,OAAQn6D,IACjCitB,EAAQjtB,CAAC,EAAIA,EAEf,KAAK,UAAUitB,EAAS7C,CAAO,GAElCuvC,CAAA,GAAA,ECvRDe,IAAA,UAAA,CAgBE,SAAAA,EACatwC,EAA4B+uC,EAC5BwB,EAAwBC,EAAmB,CAAnBA,IAAA,SAAAA,EAAA,IADxB,KAAO,QAAPxwC,EAA4B,KAAY,aAAZ+uC,EAC5B,KAAY,aAAZwB,EAETvwC,GAAQ,QAAQ,SAAAhoB,EAAM,CACpB,GAAIu4D,IAAiBv4D,EAAO,MAC1B,MAAM,IAAI,MAAM,mCACZ,OAAAu4D,EAAmC,sBAAA,EAAA,OAAAv4D,EAAO,KAAK,CAAE,EAEvD22D,GACII,EAAc/2D,EAAO,MAAO,6BAA6B,EAE7D43D,GAAAA,KAAK53D,CAAM,CACb,CAAC,EAEH,KAAK,SAAWogC,GAAAA,OAAO,CAAC,EACxB,KAAK,eAAiBo4B,EACtBZ,GAAAA,KAAK,KAAK,QAAQ,EA7BpB,cAAA,eAAIU,EAAE,UAAA,KAAA,CAAN,IAAA,UAAA,CACE,OAAO,KAAK,SAAS,iCACtB,CAAA,EAiCDA,EAAA,UAAA,KAAA,UAAA,CACE,OAAO,IAAIA,EACHr6D,GAAA,CAAA,EAAAJ,EAAA,KAAK,OAAO,EAAA,EAAA,EAAG,KAAK,aAAc,KAAK,YAAY,GAM7Dy6D,EAAa,UAAA,cAAb,SAAcT,EAAqB,CACjC,KAAK,QAAQ,QAAQ,SAAA73D,EAAM,EACrB63D,GAAW,MAAQ,CAACA,EAAQ,IAAI73D,EAAO,EAAE,IAC3CA,EAAO,QAAO,CAElB,CAAC,EACD,KAAK,QAAQ,OAAS,EACtB,KAAK,SAAS,QAAO,GAKvBs4D,EAAA,UAAA,KAAA,UAAA,CACE,OAAO,KAAK,QAAQ,QAUtBA,EAAA,UAAA,MAAA,SAAMvB,EAAwBwB,EAAwBE,EAAgB,CAAtE,IAoBCz1D,EAAA,KAlBC,GAFoDy1D,IAAA,SAAAA,EAAA,IAEhDF,IAAiB,KAAK,aACxB,MAAM,IAAI,MAAM,mCACZ,OAAAA,EAAmC,sBAAA,EAAA,OAAA,KAAK,YAAY,CAAE,EAE5D,GAAIE,IAAgB,IAAM,KAAK,QAAQ,SAAWA,EAChD,MAAM,IAAI,MAAM,kCAAA,OACZA,EAAW,gCAAA,EAAA,OACX,KAAK,QAAQ,OAAM,YAAA,CAAY,EAErC9B,GACII,EAAc,KAAK,aAAc,6BAA6B,EAClE,IAAM2B,EACF1B,GAAkB,KAAK,aAAc,KAAK,QAASD,CAAY,EACnE,OAAOn3C,GAAAA,KAAK,UAAA,CACV,IAAM+4C,EACF31D,EAAK,QAAQ,IAAI,SAAAhD,EAAM,CAAI,OAAA8xB,GAAAA,QAAQ9xB,EAAQ04D,CAAkB,CAAC,CAAA,EAClE,OAAOxf,GAAAA,MAAMyf,EAAiB,CAAC,CACjC,CAAC,GAQHL,EAAA,UAAA,QAAA,SAAQvB,EAAwBwB,EAAsB,CACpD,GAAIA,IAAiB,KAAK,aACxB,MAAM,IAAI,MAAM,mCACZ,OAAAA,EAAmC,sBAAA,EAAA,OAAA,KAAK,YAAY,CAAE,EAG5D,GAAI,KAAK,KAAI,IAAO,EAClB,MAAM,IAAI,MAAM,mCAAmC,EAErD,IAAMG,EACF1B,GAAkB,KAAK,aAAc,KAAK,QAASD,CAAY,EAC7D/2D,EAAS,KAAK,QAAQ,IAAG,EAC/B,OAAAA,EAAO,KAAO,GAEd22D,GACI32D,EAAO,MAAO+2D,EAAc,6BAA6B,EAEtDjlC,GAAAA,QAAQ9xB,EAAQ04D,CAAkB,GAO3CJ,EAAQ,UAAA,SAAR,SAASt4D,EAAc,CACrB,GAAIA,EAAO,QAAU,KAAK,aACxB,MAAM,IAAI,MAAM,mCAAA,OACZA,EAAO,MAAK,sBAAA,EAAA,OAAuB,KAAK,YAAY,CAAE,EAM5D,GAHA22D,GACI32D,EAAO,MAAO,KAAK,aAAc,6BAA6B,EAE9D,KAAK,iBAAmB,KAAK,KAAI,EACnC,MAAM,IAAI,MAAM,0CAA0C,EAE5D43D,GAAAA,KAAK53D,CAAM,EACX,KAAK,QAAQ,KAAKA,CAAM,GAO1Bs4D,EAAM,UAAA,OAAN,SAAO3wD,EAAY,CACjB,GAAIA,EAAO,EACT,MAAM,IAAI,MACN,0DAAA,OAA0DA,CAAI,CAAE,EAGtE,GAAI,KAAK,iBAAmB,IAAMA,EAAO,KAAK,eAC5C,MAAM,IAAI,MAAM,+BACZ,OAAAA,EAAiC,4BAAA,EAAA,OAAA,KAAK,eAAiB,GAAA,CAAA,EAG7D,IAAMixD,EAA6B,IAAIN,EACnC,CAAA,EAAI,KAAK,aAAc,KAAK,aAAc,KAAK,cAAc,EACjEM,EAAe,QAAQ,OAASjxD,EAChC,QAAS/J,EAAI,EAAGA,EAAI,KAAK,IAAI,KAAK,QAAQ,OAAQ+J,CAAI,EAAG,EAAE/J,EACzDg7D,EAAe,QAAQh7D,CAAC,EAAI,KAAK,QAAQA,CAAC,EAE5C,OAAOg7D,GASTN,EAAA,UAAA,QAAA,SAAQO,EAAsB9B,EAAwBwB,EAAsB,CAE1E,GAAIA,IAAiB,KAAK,aACxB,MAAM,IAAI,MAAM,mCACZ,OAAAA,EAAmC,sBAAA,EAAA,OAAA,KAAK,YAAY,CAAE,EAE5D,GAAIM,EAAe,GAAKA,EAAe,KAAK,QAAQ,OAClD,MAAM,IAAI,MAAM,4BAAA,OACZA,EAAY,kBAAA,EAAA,OAAmB,KAAK,QAAQ,OAAM,YAAA,CAAY,EAGpE,GAAI,KAAK,QAAQA,CAAY,GAAK,KAChC,MAAM,IAAI,MAAM,oBAAA,OAAoBA,EAAY,WAAA,CAAW,EAG7DlC,GACI,KAAK,QAAQkC,CAAY,EAAE,MAAO9B,EAClC,6BAA6B,EACjC,IAAM2B,EACF1B,GAAkB,KAAK,aAAc,KAAK,QAASD,CAAY,EACnE,OAAOjlC,GAAAA,QAAQ,KAAK,QAAQ+mC,CAAY,EAAGH,CAAkB,GAQ/DJ,EAAA,UAAA,QAAA,SAAQO,EAAsB74D,EAAc,CAC1C,GAAIA,EAAO,QAAU,KAAK,aACxB,MAAM,IAAI,MAAM,mCAAA,OACZA,EAAO,MAAK,sBAAA,EAAA,OAAuB,KAAK,YAAY,CAAE,EAG5D,GAAI64D,EAAe,GACf,KAAK,iBAAmB,IAAMA,GAAgB,KAAK,eACrD,MAAM,IAAI,MAAM,yBACZ,OAAAA,EAAmC,sBAAA,EAAA,OAAA,KAAK,eAA0B,YAAA,CAAA,EAGxElC,GACI,KAAK,aAAc32D,EAAO,MAAO,6BAA6B,EAClE43D,GAAAA,KAAK53D,CAAM,EAGP,KAAK,QAAQ64D,CAAY,GAAK,OAChC,KAAK,QAAQA,CAAY,EAAE,KAAO,IAGpC,KAAK,QAAQA,CAAY,EAAI74D,GAU/Bs4D,EAAA,UAAA,OAAA,SAAOztC,EAAmB0tC,EAAwBxB,EAAsB,CAAxE,IAwBC/zD,EAAA,KAtBC,GAAIu1D,IAAiB,KAAK,aACxB,MAAM,IAAI,MAAM,mCACZ,OAAAA,EAAmC,sBAAA,EAAA,OAAA,KAAK,YAAY,CAAE,EAG5D5B,GACI,KAAK,aAAcI,EAAc,6BAA6B,EAIlElsC,EAAUA,EAAQ,MAAM,EAAG,KAAK,KAAI,CAAE,EACtC,IAAM6tC,EACF1B,GAAkB,KAAK,aAAc,KAAK,QAASD,CAAY,EACnE,OAAIlsC,EAAQ,SAAW,EACd7qB,GAAAA,OAAO,CAAA,EAAI,CAAC,CAAC,EAAE,OAAO04D,CAAkB,CAAC,EAG3C94C,GAAAA,KAAK,UAAA,CACV,IAAMoI,EACF6C,EAAQ,IAAI,SAAA,EAAK,CAAA,OAAAiH,GAAAA,QAAQ9uB,EAAK,QAAQ,CAAC,EAAG01D,CAAkB,CAAC,CAAA,EACjE,OAAOxf,GAAAA,MAAMlxB,EAAS,CAAC,CACzB,CAAC,GAQHswC,EAAA,UAAA,OAAA,SAAOC,EAAwBxB,EAAsB,CAArD,IAkBC/zD,EAAA,KAjBC,GAAMu1D,GAAgBA,IAAiB,KAAK,aAC1C,MAAM,IAAI,MAAM,uBACZ,OAAA,KAAK,aAA2C,8BAAA,EAAA,OAAAA,CAAY,CAAE,EAGpE5B,GACI,KAAK,aAAcI,EAAc,6BAA6B,EAClE,IAAM2B,EACF1B,GAAkB,KAAK,aAAc,KAAK,QAASD,CAAY,EAEnE,OAAI,KAAK,KAAI,IAAO,EACX/2D,GAAAA,OAAO,CAAA,EAAI,CAAC,CAAC,EAAE,OAAO04D,CAAkB,CAAC,EAE3C94C,GAAAA,KAAK,UAAA,CACV,IAAMoI,EAAUhlB,EAAK,QAAQ,IAAI,SAAAhG,EAAC,CAAI,OAAA80B,GAAAA,QAAQ90B,EAAG07D,CAAkB,CAAC,CAAA,EACpE,OAAO9lC,GAAAA,OAAO5K,EAAS,CAAC,CAC1B,CAAC,GAEJswC,CAAA,GAAA,WAOeQ,GACZ94D,EAAgB+2D,EAAwBwB,EAAsB,CAChE,IAAM1xD,EAAQ7G,EAAO,MACrB,GAAIA,EAAO,MAAM,OAAS,EACxB,MAAM,IAAI,MACN,oDAAA,OAAoDA,EAAO,KAAK,CAAE,EAExE,GAAIA,EAAO,QAAUu4D,EACnB,MAAM,IAAI,MAAM,mCACZ,OAAAv4D,EAAO,MAA4B,sBAAA,EAAA,OAAAu4D,CAAY,CAAE,EAEvD,IAAMQ,EAAqB/4D,EAAO,MAAM,MAAM,CAAC,EAC/C22D,GACIoC,EAAoBhC,EAAc,6BAA6B,EACnE,IAAMiC,EAAuBpd,GAAAA,QAAQ57C,CAAM,EAC3C,OAAO,IAAIs4D,GAAWU,EAAYjC,EAAclwD,CAAK,CACvD,CASM,SAAUoyD,GACZlC,EAAwBwB,EAAwBE,EAChDD,EAAsB,CACxB,OAAO,IAAIF,GAAW,CAAA,EAAIvB,EAAcwB,EAAcC,CAAc,CACtE,CASM,SAAUU,GACZl5D,EAAgB6qB,EAAmBksC,EACnC0B,EAAoB,CACtB,GAAI5tC,EAAQ,SAAW7qB,EAAO,MAAM,CAAC,EACnC,MAAM,IAAI,MAAM,sDACZ,OAAA6qB,EAAQ,OAAM,OAAA,EAAA,OAAQ7qB,EAAO,MAAM,CAAC,CAAC,CAAE,EAG7C,IAAMqd,EAAW,KAAK,IAAG,MAAR,KAAIpf,GAAA,CAAA,EAAAJ,EAAQgtB,CAAO,EAAA,EAAA,CAAA,EAEpC,GAAI4tC,GAAe,MAAQA,IAAgB,IAAMp7C,GAAYo7C,EAC3D,MAAM,IAAI,MACN,mCAAA,OAAmCp7C,EAAiB,QAAA,EAAA,OAAAo7C,EAAc,GAAA,CAAA,EAGxE,IAAMh0C,EAAO,IAAI6zC,GAAW,CAAA,EAAIvB,EAAc/2D,EAAO,MAAOy4D,CAAW,EACjEzwC,EAAU4zB,GAAAA,QAAQ57C,EAAQ,CAAC,EACjC,OAAA6qB,EAAQ,QAAQ,SAACxuB,EAAOyD,EAAK,CAC3B2kB,EAAK,QAAQpoB,EAAO2rB,EAAQloB,CAAK,CAAC,CACpC,CAAC,EACM2kB,CACT,UASgBwzB,GACZj4C,EAAgB+3D,EAAkBhB,EAAsB,CAC1D,IAAIiB,EAAc,EACZC,EAAoBF,EAAO,IAAI,SAAA7tD,EAAG,CACtC,OAAA8tD,GAAe9tD,EACR8tD,CACT,CAAC,EAED,GAAIA,IAAgBh4D,EAAO,MAAM,CAAC,EAChC,MAAM,IAAI,MAAM;;UAEV,OAAAg4D,EAAuC,2BAAA,EAAA,OAAAh4D,EAAO,KAAK,CAAE,EAuB7D,QApBMm5D,EAAuBn5D,EAAO,MAAM,MAAM,CAAC,EAC3C04D,EACFvB,GAAkBgC,EAAsBpC,CAAY,EAClDmB,EAAgBF,IAAgB,EAAI,EAAIh4D,EAAO,KAAOg4D,EACtDhwC,EAAoBpI,GAAAA,KAAK,UAAA,CAC7B,IAAMoI,EAAU,CAAA,EAChBhoB,EAAS8xB,GAAAA,QAAQ9xB,EAAQ,CAAC,EAAGg4D,EAAaE,CAAa,CAAC,EACxD,QAASt6D,EAAI,EAAGA,EAAIm6D,EAAO,OAAQ,EAAEn6D,EAAG,CACtC,IAAMu6D,EAAkBv6D,IAAM,EAAK,EAAIq6D,EAAkBr6D,EAAI,CAAC,EACxDitB,EAAU,CAAC,EAAGstC,EAAgB,CAAC,EAC/BE,EAAQ,CAAC,EAAGN,EAAOn6D,CAAC,EAAGs6D,CAAa,EAC1ClwC,EAAQpqB,CAAC,EAAIk0B,GAAAA,QACTyB,GAAAA,MAAMvzB,EAAQ6qB,EAASwtC,CAAK,EAAGK,CAA8B,CAClE,CACD,OAAA14D,EAAO,QAAO,EACPgoB,CACT,CAAC,EAEKvD,EAAO,IAAI6zC,GAAW,CAAA,EAAIvB,EAAc/2D,EAAO,MAAO+3D,EAAO,MAAM,EAEhEn6D,EAAI,EAAGA,EAAIoqB,EAAQ,OAAQpqB,IAClC6mB,EAAK,QAAQ7mB,EAAGoqB,EAAQpqB,CAAC,CAAC,EAE5B,OAAO6mB,CACT,CC9YO,IAAMgyC,GAAqC,SAC9Cv3D,EAAYC,EACZC,EAAyB,CAAA,OAAArD,GAAA,OAAA,OAAA,OAAA,UAAA,wWACnBgE,EAAAb,EAAK,UACN,KAAA,MAAI,CAAA,EAAA,CAAA,MACJ,cAAA,MAAa,CAAA,EAAA,CAAA,MAgBb,QAAA,MAAO,CAAA,EAAA,CAAA,MACP,iBAAA,MAAgB,CAAA,EAAA,CAAA,MAsDhB,WAAA,MAAU,CAAA,EAAA,CAAA,MAIV,SAAA,MAAQ,CAAA,EAAA,EAAA,MASR,QAAA,MAAO,CAAA,EAAA,EAAA,MASP,QAAA,MAAO,CAAA,EAAA,EAAA,MAOP,OAAA,MAAM,CAAA,EAAA,EAAA,MAKN,gBAAA,MAAe,CAAA,EAAA,EAAA,MAKf,gBAAA,MAAe,CAAA,EAAA,EAAA,MAoBf,qBAAA,MAAoB,CAAA,EAAA,EAAA,MAUpB,oBAAA,MAAmB,CAAA,EAAA,EAAA,MAQnB,sBAAA,MAAqB,CAAA,EAAA,EAAA,MAUrB,uBAAA,MAAsB,CAAA,EAAA,EAAA,MAWtB,sBAAA,MAAqB,CAAA,EAAA,EAAA,MAQrB,qBAAA,MAAoB,CAAA,EAAA,EAAA,MAWpB,oBAAA,MAAmB,CAAA,EAAA,EAAA,MAMnB,qBAAA,MAAoB,CAAA,EAAA,EAAA,MAOpB,oBAAA,MAAmB,CAAA,EAAA,EAAA,MAUnB,oBAAA,MAAmB,CAAA,EAAA,EAAA,MAanB,sBAAA,MAAqB,CAAA,EAAA,EAAA,MACrB,oBAAA,MAAmB,CAAA,EAAA,EAAA,MAcnB,oBAAA,MAAmB,CAAA,EAAA,EAAA,MACnB,kBAAA,MAAiB,CAAA,EAAA,EAAA,MAqBjB,mBAAA,MAAkB,CAAA,EAAA,EAAA,MAYlB,kBAAA,MAAiB,CAAA,EAAA,EAAA,MAYjB,uBAAA,MAAsB,CAAA,EAAA,EAAA,MAWtB,mBAAA,MAAkB,CAAA,EAAA,EAAA,MAClB,qBAAA,MAAoB,CAAA,EAAA,EAAA,MAUpB,qBAAA,MAAoB,CAAA,EAAA,EAAA,MASpB,oBAAA,MAAmB,CAAA,EAAA,EAAA,MAUnB,kBAAA,MAAiB,CAAA,EAAA,EAAA,MAYjB,mBAAA,MAAkB,CAAA,EAAA,EAAA,MAMlB,mBAAA,MAAkB,CAAA,EAAA,EAAA,sBAvVf,OAAAk6D,EACFp6D,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EAClDi6D,EACFr6D,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EAClDk6D,EAAOt6D,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EACrDysB,EAAO7sB,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EACzC,CAAA,EAAMk6D,EAAK,KAAI,CAAE,SACnC,OADMC,EAAYl5D,GAAiB,KAAA,EAC/Bk5D,EAAU,CAAC,EACb,CAAA,EAAOn6D,EAAQ,YAAYg6D,CAAQ,EAAE,qBACjCvtC,EAAMzsB,EAAQ,eAAgBA,EAAQ,aAAa,CAAC,EAExD,CAAA,EAAOA,EAAQ,YAAYi6D,CAAQ,EAAE,qBACjCxtC,EAAMzsB,EAAQ,eAAgBA,EAAQ,aAAa,CAAC,SAKpD,OAAAo6D,EACFx6D,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5Cq6D,EACFz6D,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5CysB,EAAO7sB,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAItD,CAAA,EAAMA,EAAQ,YAAYq6D,CAAQ,EAAE,qBACjC5tC,EAAMzsB,EAAQ,eAAgBA,EAAQ,aAAa,CAAC,SAFtD,OAAAs6D,EACDr5D,GAAA,KAAA,EAECs5D,EAAS9tC,EAAK,IAAI,SAAA7rB,GAAM,CAAI,OAAAA,GAAO,EAAP,CAAS,EAC3B,CAAA,EAAM05D,EAAW,CAAC,EAAE,KAAI,CAAE,SAAtCH,EAAYl5D,GAA0B,KAAA,EAE1Cq5D,EAAW,QAAQ,SAAA15D,GAAM,CACnB,CAACA,GAAO,MAAQ25D,EAAO,QAAQ35D,GAAO,EAAE,IAAM,IAChDA,GAAO,QAAO,CAElB,CAAC,EAEGpD,EAAmBivB,gFAIf,OAAA+tC,GAAah9D,EAEV,CAAA,EAAMwC,EAAQ,YAAYo6D,CAAQ,EAAE,qBACzC58D,EAAQwC,EAAQ,eAAgBA,EAAQ,aAAa,CAAC,SAD1D,OAAAxC,EAAS0O,GAAA,KAAA,EAEHuuD,GAAYj9D,EAAO,IAAI,SAAAoD,GAAU,CAAA,OAAAA,GAAO,EAAP,CAAS,EAIhD45D,GAAW,QAAQ,SAAA55D,GAAM,CACnB,CAACA,GAAO,MAAQ25D,EAAO,QAAQ35D,GAAO,EAAE,IAAM,IAC9C65D,GAAU,QAAQ75D,GAAO,EAAE,IAAM,IACnCA,GAAO,QAAO,CAElB,CAAC,EAII,CAAA,EAAMZ,EAAQ,YAAYq6D,CAAQ,EAAE,qBACjC78D,EAAQwC,EAAQ,eAAgBA,EAAQ,aAAa,CAAC,SAFxD,OAAA06D,GACDxuD,GAAA,KAAA,EAEO,CAAA,EAAMwuD,GAAW,CAAC,EAAE,KAAI,CAAE,SAAtC,OAAAP,EAAYjuD,GAAA,KAAA,EAEZwuD,GAAW,QAAQ,SAAA95D,GAAM,CACnB,CAACA,GAAO,MAAQ25D,EAAO,QAAQ35D,GAAO,EAAE,IAAM,IAC9C65D,GAAU,QAAQ75D,GAAO,EAAE,IAAM,IACnCA,GAAO,QAAO,CAElB,CAAC,mCA5BIu5D,EAAU,CAAC,UAAC,CAAA,EAAA,CAAA,gCA8BnB,IAAA,GAAA,MAAA,CAAA,EAAO38D,CAAM,SAGP,OAAAm9D,EAAO/6D,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC3D,CAAA,EAAO,CAACgC,GAAY24D,CAAI,CAAC,CAAC,UAGpB,OAAAA,EAAO/6D,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EACvDa,EAAOjB,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EACpDa,EAAK,OACRA,EAAOmB,GAAYnB,CAAI,GAGjB,CAAA,EAAM85D,EAAK,KAAI,CAAE,UAAzB,MAAO,CAAA,EAAC15D,GAAA,KAAA,EAAmB,CAAC,EAAI,CAAC,OAAWJ,CAAI,EAAI,CAACA,EAAM,MAAS,CAAC,UAKrE,OAFMW,EAAY1B,EAAK,WAAW,KAC9B,SAAAP,GAAI,CAAI,OAAAe,GAAUf,GAAMQ,EAAWC,CAAO,IAAM,MAAS,CAAA,EACzDwB,GACIX,EAAOP,GAAUkB,EAAWzB,EAAWC,CAAO,EACpD,CAAA,EAAO,CAACgC,GAAYnB,CAAI,CAAC,CAAC,GAE5B,CAAA,EAAO,MAAS,UAGV,OAAA+5D,EACFh7D,EAAc,YAAaE,EAAMC,EAAWC,CAAO,EACjDa,EAAOjB,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC7DA,EAAQ,WAAW46D,CAAO,EAC1B,CAAA,EAAO,CAAC54D,GAAYnB,CAAI,CAAC,CAAC,UAGpB,OAAAA,EAAOjB,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC7DA,EAAQ,UAAS,EACjB,CAAA,EAAO,CAACgC,GAAYnB,CAAI,CAAC,CAAC,UAGpB,OAAAA,EAAOjB,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC7DA,EAAQ,cAAa,EACrB,CAAA,EAAO,CAACgC,GAAYnB,CAAI,CAAC,CAAC,UAGpB,OAAA0H,GAAO3I,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EACrDyH,EACF7H,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC7C23D,GACF/3D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpDs4D,EACF14D,EAAc,cAAeE,EAAMC,EAAWC,CAAO,EACnDu4D,EACF34D,EAAc,iBAAkBE,EAAMC,EAAWC,CAAO,EACtDq4D,EACFz4D,EAAc,yBAA0BE,EAAMC,EAAWC,CAAO,EAE9DT,EAAOK,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EACrD66D,EAAc,IAAI1C,GACpB54D,EAAMkI,EAAOc,GAAMovD,GAAcU,EAAwBC,EACzDC,CAAc,EAClBv4D,EAAQ,eAAe66D,CAAW,EAC3B,CAAA,EAAA,CAACA,EAAY,SAAU75B,GAAAA,OAAO,CAAG,CAAC,CAAC,UAGpC,OAAAnd,EACFjkB,EAAc,gBAAiBE,EAAMC,EAAWC,CAAO,EACrDU,GAAQd,EAAc,QAASE,EAAMC,EAAWC,CAAO,EACvD86D,GACFl7D,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC9C+6D,EAAmB/6D,EAAQ,eAAe6jB,EAAG,EAAE,EACrDk3C,EAAiB,MAAMr6D,GAAOo6D,EAAW,EACzC,CAAA,EAAO,CAACC,EAAiB,QAAQ,CAAC,UAG5B,OAAAC,EACFp7D,EAAc,gBAAiBE,EAAMC,EAAWC,CAAO,EACrDi7D,GACFr7D,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC7Ck7D,EAAkBl7D,EAAQ,eAAeg7D,EAAO,EAAE,EACjD,CAAA,EAAA,CAACE,EAAgB,KAAKD,EAAS,CAAC,CAAC,UAGlC,OAAAE,GACFv7D,EAAc,gBAAiBE,EAAMC,EAAWC,CAAO,EACrDo7D,GACFx7D,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/Cq7D,EACFz7D,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC7Cs7D,EAAoBt7D,EAAQ,eAAem7D,GAAS,EAAE,EACrD,CAAA,EAAA,CAACG,EAAkB,OAAOF,GAAeC,CAAW,CAAC,CAAC,UAGvD,OAAAE,EACF37D,EAAc,gBAAiBE,EAAMC,EAAWC,CAAO,EACrDw7D,GACF57D,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/Cy7D,GACF77D,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC9C07D,EAAqB17D,EAAQ,eAAeu7D,EAAU,EAAE,EAC9DG,EAAmB,QAAQF,GAAgBC,EAAa,EACxD,CAAA,EAAO,CAACC,EAAmB,QAAQ,CAAC,UAG9B,OAAAC,GACF/7D,EAAc,gBAAiBE,EAAMC,EAAWC,CAAO,EACrD47D,GAAoB57D,EAAQ,eAAe27D,GAAS,EAAE,EACtDE,GACFj8D,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC5C,CAAA,EAAA,CAAC47D,GAAkB,OAAOC,EAAW,CAAC,CAAC,UAGxC,OAAAC,EACFl8D,EAAc,gBAAiBE,EAAMC,EAAWC,CAAO,EACrD+7D,GACFn8D,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC9Cg8D,GACFp8D,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/Ci8D,EAAmBj8D,EAAQ,eAAe87D,EAAQ,EAAE,EAC1DG,EAAiB,MAAMD,GAASD,EAAW,EAC3C,CAAA,EAAO,CAACE,EAAiB,QAAQ,CAAC,UAG5B,OAAAC,EACFt8D,EAAc,gBAAiBE,EAAMC,EAAWC,CAAO,EACrDm8D,GAAkBn8D,EAAQ,eAAek8D,EAAO,EAAE,EACjD,CAAA,EAAA,CAACl7B,GAAAA,OAAOm7B,GAAgB,KAAI,EAAI,OAAO,CAAC,CAAC,UAG1C,OAAAC,GACFx8D,EAAc,gBAAiBE,EAAMC,EAAWC,CAAO,EACrDq8D,GAAmBr8D,EAAQ,eAAeo8D,GAAQ,EAAE,EAC1DC,GAAiB,cAAa,EAC9B,CAAA,EAAO,CAACA,GAAiB,QAAQ,CAAC,UAG5B,OAAAC,GACF18D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpDU,GAAQd,EAAc,QAASE,EAAMC,EAAWC,CAAO,EACvD86D,GACFl7D,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC9C45D,GAAa55D,EAAQ,cAAcs8D,GAAS,EAAE,EACpD1C,GAAW,QAAQl5D,GAAOo6D,EAAW,EACrC,CAAA,EAAO,CAAClB,GAAW,QAAQ,CAAC,UAGtB,OAAA0C,GACF18D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpDi7D,GACFr7D,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC7C23D,GACF/3D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EAEpDu8D,GACF38D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpD45D,GAAa55D,EAAQ,cAAcs8D,GAAS,EAAE,EACpD,CAAA,EAAO,CAAC1C,GAAW,QAAQqB,GAAWtD,GAAc4E,EAAY,CAAC,CAAC,UAI5D,OAAAf,GACF57D,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/Cy7D,GACF77D,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC9C23D,GACF/3D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpDq5D,GACFz5D,EAAc,cAAeE,EAAMC,EAAWC,CAAO,EACnD45D,GACFE,GAAQ2B,GAAeD,GAAgB7D,GAAc0B,EAAW,EACpEr5D,EAAQ,cAAc45D,EAAU,EAChC,CAAA,EAAO,CAACA,GAAW,QAAQ,CAAC,UAItB,OAAAjC,GACF/3D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpDm5D,GACFv5D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACtDw8D,GAAgB,OAEhB18D,EAAK,KAAO,oBACd08D,GAAmB,cAEnBA,GAAmB,iBAGfnD,GACFz5D,EAAc48D,GAAkB18D,EAAMC,EAAWC,CAAO,EACtDo5D,GAAiBt5D,EAAK,KAAO,oBAAsB,GAAKu5D,GACxDO,GACFC,GAAQlC,GAAcwB,GAAcE,GAAaD,EAAc,EACnEp5D,EAAQ,cAAc45D,EAAU,EAChC,CAAA,EAAO,CAACA,GAAW,QAAQ,CAAC,UAGtB,OAAAuB,GACFv7D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpDo7D,GACFx7D,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/C23D,GACF/3D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpDm5D,GACFv5D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpD45D,GAAa55D,EAAQ,cAAcm7D,GAAS,EAAE,EACpD,CAAA,EAAO,CAACvB,GAAW,OAAOwB,GAAejC,GAAcxB,EAAY,CAAC,CAAC,UAG/D,OAAA2E,GACF18D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpD23D,GACF/3D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpDm5D,GACFv5D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpDq5D,GACFz5D,EAAc,cAAeE,EAAMC,EAAWC,CAAO,EACnD45D,GAAa55D,EAAQ,cAAcs8D,GAAS,EAAE,EACpD,CAAA,EAAO,CAAC1C,GAAW,MAAMjC,GAAcwB,GAAcE,EAAW,CAAC,CAAC,UAG5D,OAAAz4D,GACFhB,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC9C23D,GACF/3D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpDm5D,GACFv5D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpD45D,GAAaF,GAAW94D,GAAQ+2D,GAAcwB,EAAY,EAChEn5D,EAAQ,cAAc45D,EAAU,EAChC,CAAA,EAAO,CAACA,GAAW,QAAQ,CAAC,UAItB,OAAA+B,GACF/7D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpD45D,GAAa55D,EAAQ,cAAc27D,GAAS,EAAE,EAC9CE,GACFj8D,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC7C23D,GACF/3D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACnD,CAAA,EAAA,CAAC45D,GAAW,OAAOiC,GAAalE,EAAY,CAAC,CAAC,UAG/C,OAAA2E,GACF18D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpD86D,GACFl7D,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC9C45D,GAAa55D,EAAQ,cAAcs8D,GAAS,EAAE,EACpD1C,GAAW,SAASkB,EAAW,EAC/B,CAAA,EAAO,CAAClB,GAAW,QAAQ,CAAC,UAGtB,OAAA0C,GACF18D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpD23D,GACF/3D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpDu8D,GACF38D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpD45D,GAAa55D,EAAQ,cAAcs8D,GAAS,EAAE,EAC7C,CAAA,EAAA,CAAC1C,GAAW,QAAQjC,GAAc4E,EAAY,CAAC,CAAC,UAGjD,OAAAR,GACFn8D,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC9C23D,GACF/3D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpDg8D,GACFp8D,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAE/C45D,GAAa/gB,GAAMkjB,GAAaC,GAASrE,EAAY,EAC3D33D,EAAQ,cAAc45D,EAAU,EAChC,CAAA,EAAO,CAACA,GAAW,QAAQ,CAAC,UAGtB,OAAA0C,GACF18D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpD45D,GAAa55D,EAAQ,cAAcs8D,GAAS,EAAE,EAC7C,CAAA,EAAA,CAACt7B,GAAAA,OAAO44B,GAAW,KAAI,EAAI,OAAO,CAAC,CAAC,UAGrC,OAAA0C,GACF18D,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpDuI,GAAO3I,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAErDy8D,GAAgBz8D,EAAQ,cAAcs8D,GAAS,EAAE,EACjD9C,GAAiBiD,GAAc,OAAOl0D,EAAI,EAChDvI,EAAQ,cAAcw5D,EAAc,EACpC,CAAA,EAAO,CAACA,GAAe,QAAQ,CAAC,UAGhC,MAAM,UAAU,aAAa,OAAA15D,EAAK,GAAE,qBAAA,CAAqB,QCxW/D,SAAS48D,GACL58D,EAAYC,EAA4BC,EAAyB,CAC7D,IAAAW,EAAAlC,EACDmB,EAAc,WAAYE,EAAMC,EAAWC,CAAO,EAAc,CAAA,EAD9D28D,EAAOh8D,EAAA,CAAA,EAAEi8D,EAAcj8D,EAAA,CAAA,EAGxBk8D,EAAYF,IAAY,UACxBG,EAAY,CAACD,EACbE,EAAUH,IAAmB,QAC7BI,EAAcL,IAAY,iBAE1BM,EACDr9D,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EACtD,GAAI68D,EAAW,CACb,GAAIE,GAAWE,IAAY,EACzB,MAAM,IAAI,MACN,uGACgD,EAEtD,GAAI,CAACF,GAAWF,GAAaI,IAAY,EACvC,MAAM,IAAI,MACN,kFAC2B,CAElC,CACD,GAAID,EACF,MAAM,IAAI,MACN,sEAAsE,EAE5E,IAAMt6C,EAAS9iB,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC1D8B,EAAMD,GAAW/B,EAAMC,EAAWC,CAAO,EACzCmvB,EACDvvB,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EAChD,YAAW,EACdivB,EACFrvB,EAAc,YAAaE,EAAMC,EAAWC,CAAO,EACnDiB,EAAAxC,EACAmB,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAAa,CAAA,EAD1Dk9D,EAAOj8D,EAAA,CAAA,EAAEk8D,EAAQl8D,EAAA,CAAA,EAElB67D,IACFK,EAAWD,EACXA,EAAU,QAEZ,IAAMrb,EACFjiD,EAAc,iBAAkBE,EAAMC,EAAWC,CAAO,EAE5D,MAAO,CACL,OAAM0iB,EACN,IAAG5gB,EACH,WAAUqtB,EACV,UAASF,EACT,QAAOiuC,EACP,SAAQC,EACR,eAAcP,EACd,eAAc/a,EAElB,CAEO,IAAMwV,GACT,SAACv3D,EAAYC,EACZC,EAA2BoC,EAAW,CACrC,OAD0BA,IAAA,SAAAA,EAAWk1D,IAC7Bx3D,EAAK,GAAE,CACb,IAAK,SAAU,CACb,IAAM4iB,EACF9iB,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC9C8B,EAAMlC,EAAc,MAAOE,EAAMC,EAAWC,CAAO,EACnDmvB,EACDvvB,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EAChD,YAAW,EACdsxB,EACF1xB,EAAc,WAAYE,EAAMC,EAAWC,CAAO,EACtD,MAAO,CAACoC,EAAI,OACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAChD0iB,EAAQ5gB,EAAyBqtB,EACjCmC,CAAQ,CAAC,CACd,CACD,IAAK,SAAU,CACb,IAAM5O,EACF9iB,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/C8B,EAAMD,GAAW/B,EAAMC,EAAWC,CAAO,EACzCmvB,EACDvvB,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EAChD,YAAW,EACdivB,EACFrvB,EAAc,YAAaE,EAAMC,EAAWC,CAAO,EACvD,MAAO,CAACoC,EAAI,OACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAE3CJ,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAChD,CAAC0iB,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EAAG5gB,EACxBqtB,EAA+B,CAACF,EAAU,CAAC,EAAGA,EAAU,CAAC,CAAC,CAAC,CAAC,CACjE,CACD,IAAK,eAAgB,CACb,IAAAtuB,EASF+7D,GAA4B58D,EAAMC,EAAWC,CAAO,EARtD0iB,EAAM/hB,EAAA,OACNmB,EAAGnB,EAAA,IACHwuB,EAAUxuB,EAAA,WACVsuB,EAAStuB,EAAA,UACTu8D,EAAOv8D,EAAA,QACPw8D,EAAQx8D,EAAA,SACRi8D,EAAcj8D,EAAA,eACdkhD,EAAclhD,EAAA,eAGhB,MAAO,CAACyB,EAAI,MAAM,OAAO,CACvB,EAAGxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAE9C,OAAQJ,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAExD,QAAS,CAAC0iB,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EAC9B,IAAK5gB,EACL,WAAYqtB,EACZ,UAAW,CAACF,EAAU,CAAC,EAAGA,EAAU,CAAC,CAAC,EACtC,KAAMiuC,EACN,WAAYN,EACZ,uBAAwBO,EACxB,eAActb,CACf,CAAA,CAAC,CACH,CAED,IAAK,6BAA8B,CAC3B,IAAA5gD,EASFy7D,GAA4B58D,EAAMC,EAAWC,CAAO,EARtD0iB,EAAMzhB,EAAA,OACNa,EAAGb,EAAA,IACHkuB,EAAUluB,EAAA,WACVguB,EAAShuB,EAAA,UACTi8D,EAAOj8D,EAAA,QACPk8D,EAAQl8D,EAAA,SACR27D,EAAc37D,EAAA,eACd4gD,EAAc5gD,EAAA,eAGhB,MAAO,CAACmB,EAAI,MAAM,gBAAgB,CAChC,EAAGxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAE9C,OAAQJ,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAExD,QAAS,CAAC0iB,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EAC9B,IAAK5gB,EACL,WAAYqtB,EACZ,UAAW,CAACF,EAAU,CAAC,EAAGA,EAAU,CAAC,CAAC,EACtC,KAAMiuC,EACN,WAAYN,EACZ,uBAAwBO,EACxB,eAActb,CACf,CAAA,CAAC,CACH,CACD,IAAK,sBACL,IAAK,kBAAmB,CACtB,IAAMh7C,EAAQjH,EACI,cAAeE,EAAMC,EACrBC,CAAO,EAEnB0iB,EACF9iB,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/C8B,EAAMD,GAAW/B,EAAMC,EAAWC,CAAO,EAC/C,MAAO,CAACoC,EAAI,gBACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAE3CJ,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAChD6G,EAAO,CAAC6b,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EAAG5gB,CAAuB,CAAC,CAC5D,CACD,IAAK,wBACL,IAAK,kBAAmB,CACtB,IAAM4gB,EACF9iB,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/C8B,EAAMD,GAAW/B,EAAMC,EAAWC,CAAO,EACzCivB,EACFrvB,EAAc,YAAaE,EAAMC,EAAWC,CAAO,EACjDmvB,EACDvvB,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EAChD,YAAW,EAEpB,MAAO,CAACoC,EAAI,gBACRxC,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAE/CJ,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAChD,CAAC0iB,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EAAG5gB,EACxBqtB,EAA+B,CAACF,EAAU,CAAC,EAAGA,EAAU,CAAC,CAAC,CAAC,CAAC,CACjE,CACD,IAAK,SAAU,CACb,IAAMvM,EACF9iB,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/C8B,EAAMlC,EAAc,MAAOE,EAAMC,EAAWC,CAAO,EACnDmvB,EACDvvB,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EAChD,YAAW,EACdivB,EACFrvB,EAAc,YAAaE,EAAMC,EAAWC,CAAO,EACvD,MAAO,CAACoC,EAAI,OACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAE3CJ,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAEhD,CAAC0iB,EAAO,CAAC,EAAGA,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EAAG5gB,EACnCqtB,EACA,CAACF,EAAU,CAAC,EAAGA,EAAU,CAAC,EAAGA,EAAU,CAAC,CAAC,CAAC,CAAC,CAChD,CACD,IAAK,UAAW,CACd,IAAMvM,EACF9iB,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/C8B,EAAMlC,EAAc,MAAOE,EAAMC,EAAWC,CAAO,EACnDo9D,EACFx9D,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EAExD,MAAO,CAACoC,EAAI,QACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAE3C,CAACo9D,EAAW,CAAC,EAAGA,EAAW,CAAC,CAAC,EAAG,CAAC16C,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EACrD5gB,CAAuB,CAAC,CAC7B,CACD,IAAK,UAAW,CACd,IAAM4gB,EACF9iB,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/C8B,EAAMlC,EAAc,MAAOE,EAAMC,EAAWC,CAAO,EACnDo9D,EACFx9D,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EAExD,MAAO,CAACoC,EAAI,QACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAE3C,CAACo9D,EAAW,CAAC,EAAGA,EAAW,CAAC,CAAC,EAAG,CAAC16C,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EACrD5gB,CAAuB,CAAC,CAC7B,CACD,IAAK,oBAAqB,CACxB,IAAM4gB,EACF9iB,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/C8B,EAAMlC,EAAc,MAAOE,EAAMC,EAAWC,CAAO,EACnDo9D,EACFx9D,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EAClD8nC,EACFloC,EAAc,sBAAuBE,EAAMC,EAAWC,CAAO,EAE3DkM,EAAoB9J,EAAI,kBAC1BxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3C,CAACo9D,EAAW,CAAC,EAAGA,EAAW,CAAC,CAAC,EAAG,CAAC16C,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EACrD5gB,EAAyBgmC,CAAmB,EAHzCtqC,EAAM0O,EAAA,OAAEmxD,EAAOnxD,EAAA,QAItB,MAAO,CAAC1O,EAAQ6/D,CAAO,CACxB,CACD,IAAK,YAAa,CAChB,IAAM36C,EACF9iB,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/C8B,EAAMlC,EAAc,MAAOE,EAAMC,EAAWC,CAAO,EACnDo9D,EACFx9D,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EAExD,MAAO,CAACoC,EAAI,UACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3C,CAACo9D,EAAW,CAAC,EAAGA,EAAW,CAAC,EAAGA,EAAW,CAAC,CAAC,EAC5C,CAAC16C,EAAO,CAAC,EAAGA,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EAAG5gB,CAAuB,CAAC,CAChE,CAED,IAAK,YAAa,CAChB,IAAM4gB,EACF9iB,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/C8B,EAAMlC,EAAc,MAAOE,EAAMC,EAAWC,CAAO,EACnDo9D,EACFx9D,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EAExD,MAAO,CAACoC,EAAI,UACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3C,CAACo9D,EAAW,CAAC,EAAGA,EAAW,CAAC,EAAGA,EAAW,CAAC,CAAC,EAC5C,CAAC16C,EAAO,CAAC,EAAGA,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EAAG5gB,CAAuB,CAAC,CAChE,CAED,IAAK,aAAc,CACjB,IAAM0I,EACF5K,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/C8B,EAAMlC,EAAc,MAAOE,EAAMC,EAAWC,CAAO,EACnDivB,EACFrvB,EAAc,YAAaE,EAAMC,EAAWC,CAAO,EAGjD+vB,EAAevlB,EAAQ,CAAC,EACxBwlB,EAAcxlB,EAAQ,CAAC,EAGvB0lB,EAAiBjB,EAAU,CAAC,EAC5BkB,EAAgBlB,EAAU,CAAC,EAEjC,MAAO,CAAC7sB,EAAI,WACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAE3CJ,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAChD,CAAC+vB,EAAcC,CAAW,EAAGluB,EAC7B,CAACouB,EAAgBC,CAAa,EAAG,MAAM,CAAkB,CAC9D,CAED,QACE,MAAM,UAAU,aAAa,OAAArwB,EAAK,GAAE,qBAAA,CAAqB,CAC5D,CACH,EClSG,IAAMu3D,GACT,SAACv3D,EAAYC,EAA4BC,EACxCoC,EAAW,CACV,OADDA,IAAA,SAAAA,EAAWk1D,IACFx3D,EAAK,GAAE,CACb,IAAK,OAAQ,CACX,IAAM+G,EACFjH,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC7CyH,EACF7H,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC7C/C,EACF2C,EAAc,QAASE,EAAMC,EAAWC,CAAO,EACnD,MAAO,CAACoC,EAAI,KAAKyE,EAAO5J,EAAOwK,CAAK,CAAC,CACtC,CACD,IAAK,WAAY,CACf,IAAMtH,EACFP,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC7CskC,EACF1kC,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5C2J,EAAM/J,EAAc,MAAOE,EAAMC,EAAWC,CAAO,EACzD,MAAO,CAACoC,EAAI,SAASjC,EAAOmkC,EAAM36B,CAAG,CAAC,CACvC,CACD,IAAK,cAAe,CAClB,IAAMk8B,EACFjmC,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC9CwpC,EACF5pC,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EAClDypC,EACF7pC,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAClD,MAAO,CAACoC,EAAI,YAAYyjC,EAAQ2D,EAAYC,CAAI,CAAC,CAClD,CACD,IAAK,SAAU,CACb,IAAMhe,EACF7rB,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/CkqC,EACFtqC,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC7CmqC,EACFvqC,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/CoqC,EACFxqC,EAAc,WAAYE,EAAMC,EAAWC,CAAO,EAChDyH,EACF7H,EAAc,QAASE,EAAMC,EAAWC,CAAO,EACnD,MAAO,CAACoC,EAAI,OAAOqpB,EAASye,EAAOC,EAASC,EAAU3iC,CAAK,CAAC,CAC7D,CACD,IAAK,OACH,MAAO,CAACrF,EAAI,KACRxC,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC/CJ,EAAc,QAASE,EAAMC,EAAWC,CAAO,CAAa,CAAC,EAEnE,IAAK,WACH,MAAO,CAACoC,EAAI,SACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,uBACH,MAAO,CAACoC,EAAI,qBACRxC,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC/CJ,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAE/CJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAEhE,IAAK,gBACH,MAAO,CAACoC,EAAI,cAERxC,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC/CJ,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAChDJ,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAChDJ,EAAc,QAASE,EAAMC,EAAWC,CAAO,CAAa,CAAC,EAEnE,IAAK,mBACH,MAAO,CAACoC,EAAI,iBACRxC,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC/CJ,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAChDJ,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAChDJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAEhE,IAAK,QAAS,CACZ,IAAMG,EACFP,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC7CskC,EACF1kC,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5C3C,EACFuC,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAClD,MAAO,CAACoC,EAAI,MACRjC,EAAOmkC,EAAMjnC,EACbuC,EAAc,QAASE,EAAMC,EAAWC,CAAO,CACpC,CAAC,CACjB,CACD,IAAK,kBAAmB,CACtB,IAAM6G,EACFjH,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC7C+1B,EACFn2B,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5C6zC,EACFj0C,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC9CypC,EACF7pC,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAClD,MAAO,CAACoC,EAAI,gBACRyE,EAAOkvB,EAAM8d,EACbj0C,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAE/CypC,CAAI,CAAC,CACV,CACD,IAAK,QACH,MAAO,CAACrnC,EAAI,MACRxC,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC/CJ,EAAc,QAASE,EAAMC,EAAWC,CAAO,CAAa,CAAC,EAEnE,IAAK,YACH,MAAO,CAACoC,EAAI,UACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,QACE,MAAM,UAAU,aAAa,OAAAF,EAAK,GAAE,qBAAA,CAAqB,CAC5D,CACH,EChHJ,SAASw9D,GACLx9D,EAAYC,EAA4BC,EAAyB,CACnE,IAAMqlD,EAAQzlD,EAAc,QAASE,EAAMC,EAAWC,CAAO,EACvDinD,EAASrnD,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EACzDknD,EACFtnD,EAAc,gBAAiBE,EAAMC,EAAWC,CAAO,EACrDmnD,EACFvnD,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpDonD,EACFxnD,EAAc,iBAAkBE,EAAMC,EAAWC,CAAO,EACtDqnD,EACFznD,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EAE1D,MAAO,CACL,MAAKqlD,EACL,OAAM4B,EACN,cAAaC,EACb,aAAYC,EACZ,eAAcC,EACd,aAAYC,EAEhB,CAEO,IAAMgQ,GAAqC,SAC9Cv3D,EAAYC,EACZC,EAA2BC,EAC3BmC,EAAW,CAAX,OAAAA,IAAA,SAAAA,EAAWk1D,sJACL32D,EAAAb,EAAK,UACN,sBAAA,MAAqB,CAAA,EAAA,CAAA,MAgBrB,sBAAA,MAAqB,CAAA,EAAA,CAAA,MAcrB,sBAAA,MAAqB,CAAA,EAAA,CAAA,MACrB,sBAAA,MAAqB,CAAA,EAAA,CAAA,MAQrB,QAAA,MAAO,CAAA,EAAA,CAAA,MAQP,WAAA,MAAU,CAAA,EAAA,CAAA,sBA9CP,OAAAmB,EAOFq8D,GAAUx9D,EAAMC,EAAWC,CAAO,EANpCqlD,EAAKpkD,EAAA,MACLgmD,EAAMhmD,EAAA,OACNimD,EAAajmD,EAAA,cACbkmD,EAAYlmD,EAAA,aACZmmD,EAAcnmD,EAAA,eACdomD,EAAYpmD,EAAA,aAGC,CAAA,EAAMmB,EAAI,MAAM,gCAC3BijD,EAAmB4B,EAAoBC,EAAeC,EACtDC,EAAgBC,CAAY,CAAC,SAF3B,OAAA7pD,EAASysB,EAEkB,KAAA,EAE1B,CAAA,EAAA,CAACzsB,EAAO,gBAAiBA,EAAO,cAAc,CAAC,SAGhD,OAAA0O,EACFoxD,GAAUx9D,EAAMC,EAAWC,CAAO,EAD/BqlD,EAAKn5C,EAAA,MAAE+6C,EAAM/6C,EAAA,OAAEg7C,EAAah7C,EAAA,cAAEi7C,EAAYj7C,EAAA,aAAEk7C,EAAcl7C,EAAA,eAG3Dq8C,EACF3oD,EAAc,qBAAsBE,EAAMC,EAAWC,CAAO,EAGjD,CAAA,EAAMoC,EAAI,MAAM,6BAC3BijD,EAAmB4B,EAAoBC,EAAeC,EACtDC,EAAgBmB,CAAkB,CAAC,SAFjC,OAAA/qD,EAASysB,EAEwB,KAAA,EAEhC,CAAA,EAAA,CAACzsB,EAAO,gBAAiBA,EAAO,YAAY,CAAC,SAI9C,OAAAwsB,EACFszC,GAAUx9D,EAAMC,EAAWC,CAAO,EAD/BqlD,EAAKr7B,EAAA,MAAEi9B,EAAMj9B,EAAA,OAAEk9B,EAAal9B,EAAA,cAAEm9B,EAAYn9B,EAAA,aAAEo9B,EAAcp9B,EAAA,eAGzD,CAAA,EAAM5nB,EAAI,MAAM,uBACpBijD,EAAmB4B,EAAoBC,EAAeC,EACtDC,CAAc,CAAC,EAFnB,IAAA,GAAA,MAAA,CAAA,EAAA,CAAQn9B,EAAA,KAAA,CAEW,CAAE,SAGf,OAAAuT,EAAYp7B,EAAI,KACjBxC,EAAc,YAAaE,EAAMC,EAAWC,CAAO,EACpD,MAAM,EACM,CAAA,EAAMoC,EAAI,WAAWo7B,CAAS,CAAC,SAAzC,OAAAhgC,EAAM,CAAIysB,EAAA,KAAA,CAA+B,EAC/CuT,EAAU,QAAO,EACjB,CAAA,EAAOhgC,CAAM,SAGb,MAAO,CAAA,EAAA4E,EAAI,eACPxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,UAG3D,MAAM,UAAU,aAAa,OAAAF,EAAK,GAAE,qBAAA,CAAqB,QClFxD,IAAMu3D,GACT,SAACv3D,EAAYC,EAA4BC,EACxCoC,EAAW,CAEN,OAFLA,IAAA,SAAAA,EAAWk1D,IAEEx3D,EAAK,GAAE,CACb,IAAK,aAAc,CACjB,IAAMinC,EACFnnC,EAAc,iBAAkBE,EAAMC,EAAWC,CAAO,EAEtDwH,EACF5H,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EACpD,MAAO,CAACoC,EAAI,WAAW2kC,EAAgBv/B,CAAM,CAAC,CAC/C,CACD,IAAK,SAAU,CACb,IAAMyC,EAAIrK,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC/C2lB,EAAI/lB,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC/C27C,EACF/7C,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC9CxC,EAAS4E,EAAI,KAAK6H,EAAG0b,EAAGg2B,CAAM,EACpC,MAAO,CAACn+C,EAAO,OAAQA,EAAO,OAAO,CACtC,CACD,IAAK,aAAc,CACjB,IAAMupC,EACFnnC,EAAc,iBAAkBE,EAAMC,EAAWC,CAAO,EAEtDwH,EACF5H,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EACpD,MAAO,CAACoC,EAAI,WAAW2kC,EAAgBv/B,CAAM,CAAC,CAC/C,CACD,IAAK,SAAU,CACb,IAAMyC,EAAIrK,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC/CxC,EAAS4E,EAAI,OAAO6H,CAAC,EAC3B,MAAO,CAACzM,EAAO,OAAQA,EAAO,OAAO,CACtC,CACD,IAAK,WAAY,CACf,IAAMyM,EAAIrK,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC/C8I,EACFlJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5CxC,EAAS4E,EAAI,OAAO6H,EAAGnB,CAAI,EACjC,MAAO,CAACtL,EAAO,OAAQA,EAAO,OAAO,CACtC,CACD,QACE,MAAM,UAAU,aAAa,OAAAsC,EAAK,GAAE,qBAAA,CAAqB,CAC5D,CACH,EC5CD,IAAMu3D,GACT,SAACv3D,EAAYC,EACZC,EAA2BoC,EAAW,CACrC,OAD0BA,IAAA,SAAAA,EAAWk1D,IAC7Bx3D,EAAK,GAAE,CACb,IAAK,QACH,OAAOC,EAAUD,EAAK,IAAI,EAE5B,IAAK,yBACH,IAAM4G,EACF9G,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EACrD,MAAO,CAACM,GAAUR,EAAK,KAAMC,EAAWC,CAAO,GAAK0G,CAAG,EACzD,IAAK,cACH,MAAO,CAACpG,GAAUR,EAAK,KAAMC,EAAWC,CAAO,CAAC,EAClD,IAAK,WACL,IAAK,eACL,IAAK,0BAA2B,CAC9B,IAAMu9D,EAAO39D,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EACxD,MAAO,CAACgC,GAAYu7D,CAAI,CAAC,CAC1B,CACD,IAAK,YACH,OAAQ39D,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC9C,IAAI,SAACpC,EAAS,CAAK,OAAAoE,GAAYpE,CAAC,CAAC,CAAA,EACxC,IAAK,WACH,IAAM4/D,EACD59D,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAChD,MAAO,CAACgC,GAAYw7D,CAAQ,CAAC,EAC/B,IAAK,QACH,MAAO,CAACp7D,EAAI,SACPxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAAa,MACzD,OAAO,CAAC,EACd,IAAK,SACH,OAAQJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC9C,IAAI,SAACpC,EAAc,CAAA,OAAAwE,EAAI,SAASxE,EAAE,KAAK,CAApB,CAAqB,EAC/C,IAAK,OACH,MAAO,CAACwE,EAAI,OACPxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAAa,KACzD,OAAO,CAAC,EACd,IAAK,OACH,MAAO,CAACoC,EAAI,OACPxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAAa,KACzD,OAAO,CAAC,EACd,IAAK,OACH,MAAO,CAACoC,EAAI,OAAO,CAAC,CAAC,EACvB,IAAK,QACH,IAAM4C,EAAQpF,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EACnDa,EACFjB,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5Cy9D,EACF79D,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/C09D,EACF99D,EAAc,YAAaE,EAAMC,EAAWC,CAAO,EACvD,QAAQ,KACJ,gGAC2D,EAC/D,QAAQ,IAAIy9D,CAAO,EACnB,QAASj/D,EAAI,EAAGA,EAAIqC,EAAK,OAAQrC,IAC/B,QAAQ,IAAI,MAAM,UAAU,MAAM,KAAKqC,EAAKrC,CAAC,EAAE,SAAQ,CAAE,EACxC,MAAM,EAAGk/D,CAAS,CAAC,EAEtC,MAAO,CAAC14D,CAAK,EAEf,QACE,MAAM,UAAU,aAAa,OAAAlF,EAAK,GAAE,qBAAA,CAAqB,CAC5D,CACH,ECpEJ69D,IAAA,UAAA,CAgBE,SAAqBA,EAAAC,EAA6BC,EAAoB,CAAjD,KAAQ,SAARD,EAA6B,KAAU,WAAVC,EAChD,KAAK,OAAS78B,GAAAA,OAAO,CAAC,EAEtB,KAAK,UAAY,IAAI,IAErBw3B,GAAAA,KAAK,KAAK,MAAM,EAflB,cAAA,eAAImF,EAAE,UAAA,KAAA,CAAN,IAAA,UAAA,CACE,OAAO,KAAK,OAAO,iCACpB,CAAA,EAmBDA,EAAA,UAAA,cAAA,UAAA,CACE,KAAK,UAAU,QAAQ,SAAA1gE,EAAK,CAAI,OAAAA,EAAM,QAAO,CAAb,CAAe,EAC/C,KAAK,UAAU,MAAK,EACpB,KAAK,OAAO,QAAO,GAMrB0gE,EAAA,UAAA,KAAA,UAAA,CACE,OAAO,KAAK,UAAU,MAMxBA,EAAA,UAAA,WAAA,UAAA,CACE,OAAOG,GAAa,KAAK,KAAI,EAAI,OAAO,GAQpCH,EAAA,UAAA,OAAN,SAAarxC,EAAc9kB,EAAc,wGACvC,YAAK,uBAAuB8kB,EAAM9kB,CAAM,EAI1B,CAAA,EAAM8kB,EAAK,KAAI,CAAE,SAAzB,OAAAyxC,EAAQp9D,EAAiB,KAAA,EAG/B,KAAK,UAAU,QAAQ,SAAA1D,EAAK,CAAI,OAAAA,EAAM,QAAO,CAAb,CAAe,EAC/C,KAAK,UAAU,MAAK,EAEpB,CAAA,EAAOujB,GAAAA,KAAK,UAAA,CACV,IAAM0mB,EAAUsV,GAAAA,QAAQh1C,CAAM,EAExBw2D,EAAaD,EAAM,OACnBE,EAAe/2B,EAAQ,OAE7BpmC,GAAAA,KAAK,OACDk9D,IAAeC,EACf,UAAM,CAAA,MAAA,kDACF,GAAG,OAAAD,EAAuC,4BAAA,EAAA,OAAAC,EAAe,GAAA,EACzD,WAAW,CAAA,EAEnB,QAASz/D,EAAI,EAAGA,EAAIw/D,EAAYx/D,IAAK,CACnC,IAAM+F,EAAMw5D,EAAMv/D,CAAC,EACbvB,EAAQiqC,EAAQ1oC,CAAC,EAEvBg6D,GAAAA,KAAKv7D,CAAK,EACV2G,EAAK,UAAU,IAAIW,EAAKtH,CAAK,CAC9B,CAED,OAAO2G,EAAK,MACd,CAAC,CAAC,MACH,EAiBK+5D,EAAA,UAAA,KAAN,SAAWrxC,EAActlB,EAAoB,wGAC3C,YAAK,uBAAuBslB,EAAMtlB,CAAY,EAEhC,CAAA,EAAMslB,EAAK,KAAI,CAAE,SAAzB,OAAAyxC,EAAQp9D,EAAiB,KAAA,EAE/B,CAAA,EAAO6f,GAAAA,KAAK,UAAA,CAGV,QAFMhjB,EAAmB,CAAA,EAEhB,EAAI,EAAG,EAAIugE,EAAM,OAAQ,IAAK,CACrC,IAAMx5D,EAAMw5D,EAAM,CAAC,EAEb9gE,EAAQ2G,EAAK,gBAAgBW,EAAKyC,CAAY,EACpDxJ,EAAO,KAAKP,CAAK,CAClB,CAED,OAAO68C,GAAAA,MAAMt8C,CAAM,CACrB,CAAC,CAAC,MACH,EAGOmgE,EAAA,UAAA,gBAAA,SAAgBp5D,EAAUyC,EAAoB,CACpD,IAAMxJ,EAAS,KAAK,UAAU,IAAI+G,CAAG,EAErC,OAAO/G,GAA0BwJ,GAG3B22D,EAAA,UAAA,uBAAA,SAAuBp5D,EAAatH,EAAa,CACvD,GAAIsH,EAAI,QAAU,KAAK,SACrB,MAAM,IAAI,MACN,oBAAA,OAAoB,KAAK,SAAoB,YAAA,EAC7C,GAAA,OAAGA,EAAI,KAAK,CAAE,EAGpB,GAAItH,EAAM,QAAU,KAAK,WACvB,MAAM,IAAI,MACN,sBAAA,OAAsB,KAAK,WAAsB,YAAA,EACjD,GAAA,OAAGA,EAAM,KAAK,CAAE,GAGzB0gE,CAAA,GAAA,ECzIYtG,GAAqC,SAC9Cv3D,EAAYC,EAA4BC,EACxCC,EAAgC,CAAA,OAAAtD,GAAA,OAAA,OAAA,OAAA,UAAA,4FAC1BgE,EAAAb,EAAK,UACN,YAAA,MAAW,CAAA,EAAA,CAAA,MACX,cAAA,MAAa,CAAA,EAAA,CAAA,MAiBb,kBAAA,MAAiB,CAAA,EAAA,CAAA,MACjB,oBAAA,MAAmB,CAAA,EAAA,CAAA,MACnB,oBAAA,MAAmB,CAAA,EAAA,CAAA,MACnB,sBAAA,MAAqB,CAAA,EAAA,CAAA,MAYrB,kBAAA,MAAiB,CAAA,EAAA,CAAA,MACjB,oBAAA,MAAmB,CAAA,EAAA,CAAA,MAWnB,kBAAA,MAAiB,CAAA,EAAA,CAAA,MACjB,oBAAA,MAAmB,CAAA,EAAA,CAAA,qBAzCtB,OAHMo+D,EACFj+D,EAAgB,yBAAyBH,EAAK,IAAI,EAElDo+D,GAAuB,KAClB,CAAA,EAAA,CAACA,CAAmB,CAAC,GAEtBN,EACFh+D,EAAc,WAAYE,EAAMC,EAAWC,CAAO,EAChD69D,EACFj+D,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EAElD6C,EAAY,IAAI86D,GAAUC,EAAUC,CAAU,EACpD59D,EAAgB,aAAaH,EAAK,KAAM+C,CAAS,EACjD,CAAA,EAAO,CAACA,EAAU,MAAM,CAAC,UAOrB,OAAAs7D,EAASv+D,EACI,cAAeE,EAAMC,EAAWC,EAChCC,CAAe,EAC5BqsB,EAAO1sB,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EACrDwH,EACF5H,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAE9C6C,EAAY5C,EAAgB,iBAAiBk+D,EAAO,EAAE,EAE9C,CAAA,EAAAt7D,EAAU,OAAOypB,EAAM9kB,CAAM,CAAC,EAA5C,IAAA,GAAA,MAAA,CAAA,EAAA,CAAQvG,EAAA,KAAA,CAAoC,CAAE,SAIxC,OAAAk9D,EAASv+D,EACI,cAAeE,EAAMC,EAAWC,EAChCC,CAAe,EAC5BqsB,EAAO1sB,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EACrDgH,EACFpH,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EAEpD6C,EAAY5C,EAAgB,iBAAiBk+D,EAAO,EAAE,EAC9C,CAAA,EAAAt7D,EAAU,KAAKypB,EAAMtlB,CAAY,CAAC,EAAhD,IAAA,GAAA,MAAA,CAAA,EAAA,CAAQ/F,EAAA,KAAA,CAAwC,CAAE,SAI5C,OAAAk9D,EAASv+D,EACI,cAAeE,EAAMC,EAAWC,EAChCC,CAAe,EAE5B4C,EAAY5C,EAAgB,iBAAiBk+D,EAAO,EAAE,EAC5D,CAAA,EAAO,CAACt7D,EAAU,WAAU,CAAE,CAAC,SAG/B,MAAM,UAAU,aAAa,OAAA/C,EAAK,GAAE,qBAAA,CAAqB,QC3DxD,IAAMu3D,GACT,SAACv3D,EAAYC,EACZC,EAA2BoC,EAAW,CACrC,OAD0BA,IAAA,SAAAA,EAAWk1D,IAC7Bx3D,EAAK,GAAE,CACb,IAAK,iBAAkB,CACrB,IAAMgsD,EACFlsD,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC9CuI,EACF3I,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5C+rD,EACFnsD,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EAEpDgsD,EACFpsD,EAAc,mBAAoBE,EAAMC,EAAWC,CAAO,EAE9D,MAAO,CAACoC,EAAI,MAAM,eACd0pD,EAA+B,CAACvjD,EAAK,CAAC,EAAGA,EAAK,CAAC,CAAC,EAAGwjD,EACnDC,CAAgB,CAAC,CACtB,CACD,IAAK,wBAAyB,CAC5B,IAAMF,EACFlsD,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC9CuI,EACF3I,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5C+rD,EACFnsD,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EAEpDgsD,EACFpsD,EAAc,mBAAoBE,EAAMC,EAAWC,CAAO,EAE9D,MAAO,CAACoC,EAAI,MAAM,sBACd0pD,EAA+B,CAACvjD,EAAK,CAAC,EAAGA,EAAK,CAAC,CAAC,EAAGwjD,EACnDC,CAAgB,CAAC,CACtB,CACD,IAAK,gBAAiB,CACpB,IAAMlpD,EACFlD,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC7CqlD,EACFzlD,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC7CslD,EACF1lD,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC9CulD,EACF3lD,EAAc,WAAYE,EAAMC,EAAWC,CAAO,EAChDwlD,EACF5lD,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC9CylD,EACF7lD,EAAc,qBAAsBE,EAAMC,EAAWC,CAAO,EAEhE,MAAO,CAACoC,EAAI,MAAM,cACdU,EAAmBuiD,EAAmBC,EACtCC,EAA8BC,EAC9BC,CAAkB,CAAC,CACxB,CACD,IAAK,6BAA8B,CACjC,IAAMqG,EACFlsD,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC9CwuD,EACF5uD,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EAClDy6B,EACF76B,EAAc,cAAeE,EAAMC,EAAWC,CAAO,EAEnD6mD,EACFjnD,EAAc,YAAaE,EAAMC,EAAWC,CAAO,EACjDyuD,EACF7uD,EAAc,gBAAiBE,EAAMC,EAAWC,CAAO,EAErD0uD,EACF9uD,EAAc,WAAYE,EAAMC,EAAWC,CAAO,EACtD,MAAO,CAACoC,EAAI,MAAM,UACd0pD,EACA0C,EACAC,EAAc,YAAW,EACzBC,EAAS,YAAW,EACpB7H,EACApsB,CAA+B,CAAC,CACrC,CACD,QACE,MAAM,UAAU,aAAa,OAAA36B,EAAK,GAAE,qBAAA,CAAqB,CAC5D,CACH,EC/EG,IAAMu3D,GACT,SAACv3D,EAAYC,EAA4BC,EACxCoC,EAAW,CACV,OADDA,IAAA,SAAAA,EAAWk1D,IACFx3D,EAAK,GAAE,CACb,IAAK,QACH,MAAO,CAACsC,EAAI,MACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,WACH,MAAO,CAACoC,EAAI,SACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,UACH,MAAO,CAACoC,EAAI,QACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,eACH,MAAO,CAACoC,EAAI,aACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,OACH,MAAO,CAACoC,EAAI,KACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,YACH,MAAO,CAACoC,EAAI,UACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,aACH,MAAO,CAACoC,EAAI,WACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,aACH,MAAO,CAACoC,EAAI,WACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,YACH,MAAO,CAACoC,EAAI,UACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,SACL,IAAK,WACH,MAAO,CAACoC,EAAI,MACRxC,EAAc,YAAaE,EAAMC,EAAWC,CAAO,EACnDJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,aACH,MAAO,CAACoC,EAAI,WACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,QACE,MAAM,UAAU,aAAa,OAAAF,EAAK,GAAE,qBAAA,CAAqB,CAC5D,CACH,EC/DSu3D,GACT,SAACv3D,EAAYC,EAA4BC,EACxCoC,EAAW,CACV,OADDA,IAAA,SAAAA,EAAWk1D,IACFx3D,EAAK,GAAE,CACb,IAAK,cACL,IAAK,gBACL,IAAK,SACH,MAAO,CAACsC,EAAI,OACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EACpDJ,EAAc,aAAcE,EAAMC,EAAWC,CAAO,CACzC,CAAC,EAElB,IAAK,SACH,MAAO,CAACoC,EAAI,OAAJ,MAAAA,EACJvD,GAAA,CAAAe,EAAc,WAAYE,EAAMC,EAAWC,CAAO,CAAW,EAAAvB,EAC1DmB,EAAc,UAAWE,EAAMC,EAAWC,CAAO,CACxC,EAAA,EAAA,CAAA,CAAA,EAElB,IAAK,YACH,MAAO,CAACoC,EAAI,UACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,CAAa,CAAC,EAElE,IAAK,eACG,IAAAW,EAAAlC,EACDmB,EAAc,WAAYE,EAAMC,EAAWC,CAAO,EAAc,CAAA,EAD9D28D,EAAOh8D,EAAA,CAAA,EAAEi8D,EAAcj8D,EAAA,CAAA,EAGxBk8D,EAAYF,IAAY,UACxBI,EAAUH,IAAmB,QAE7BK,EACDr9D,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAChD6hD,EACFjiD,EAAc,iBAAkBE,EAAMC,EAAWC,CAAO,EAG5D,GAAI68D,EAAW,CACb,GAAIE,GAAWE,IAAY,EACzB,MAAM,IAAI,MACN,oFACkC,EAExC,GAAI,CAACF,GAAWE,IAAY,EAC1B,MAAM,IAAI,MACN,+DAA+D,CAEtE,CACK,IAAAh8D,EAAAxC,EACFmB,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAAa,CAAA,EADxDk9D,EAAOj8D,EAAA,CAAA,EAAEk8D,EAAQl8D,EAAA,CAAA,EAExB,MAAO,CAACmB,EAAI,MAAM,OAAO,CACvB,EAAGxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC9C,EAAGJ,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC9C,WAAYJ,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EAEhE,WAAYJ,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EAEhE,KAAMk9D,EACN,WAAYN,EACZ,uBAAwBO,EACxB,eAActb,CACf,CAAA,CAAC,EAEJ,IAAK,iBACH,MAAO,CAACz/C,EAAI,OAAO,SACfxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,WAAYE,EAAMC,EAAWC,CAAO,EAClDJ,EAAc,WAAYE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAEpE,QACE,MAAM,UAAU,aAAa,OAAAF,EAAK,GAAE,qBAAA,CAAqB,CAC5D,CACH,ECzEG,IAAMu3D,GACT,SAACv3D,EAAYC,EACZC,EAA2BoC,EAAW,CACrC,OAD0BA,IAAA,SAAAA,EAAWk1D,IAC7Bx3D,EAAK,GAAE,CACb,IAAK,gBACH,MAAO,CAACsC,EAAI,cACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC9CJ,EAAc,WAAYE,EAAMC,EAAWC,CAAO,CAAY,CAAC,EACrE,IAAK,iBACL,IAAK,mBACH,MAAO,CAACoC,EAAI,UACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC9CJ,EAAc,WAAYE,EAAMC,EAAWC,CAAO,EAClDJ,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAChDJ,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC/CJ,EAAc,UAAWE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAEnE,IAAK,mBACH,MAAO,CAACoC,EAAI,UACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC9CJ,EAAc,WAAYE,EAAMC,EAAWC,CAAO,EAClDJ,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAChDJ,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC/CJ,EAAc,UAAWE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAEnE,IAAK,MACH,MAAO,CAACoC,EAAI,2BACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAE3CJ,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAChDJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC9CJ,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC/CJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAEhE,IAAK,UACH,MAAO,CAACoC,EAAI,QACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,aACH,MAAO,CAACoC,EAAI,WACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,QACE,MAAM,UAAU,aAAa,OAAAF,EAAK,GAAE,qBAAA,CAAqB,CAC5D,CACH,EChDG,IAAMu3D,GACT,SAACv3D,EAAYC,EAA4BC,EACxCoC,EAAW,CACV,OADDA,IAAA,SAAAA,EAAWk1D,IACFx3D,EAAK,GAAE,CACb,IAAK,eAAgB,CACb,IAAAa,EAIFyB,EAAI,aACAxC,EACI,qBAAsBE,EAAMC,EAAWC,CAAO,EAElDJ,EACI,oBAAqBE,EAAMC,EAAWC,CAAO,EACjDJ,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EACjDJ,EAAc,mBAAoBE,EAAMC,EAAWC,CAAO,CAChD,EAXhBo+D,EAAkBz9D,EAAA,mBAClB09D,EAAiB19D,EAAA,kBAWnB,OAAOy9D,EAAmB,OAAOC,CAAiB,CACnD,CACD,IAAK,cAAe,CACZ,IAAAp9D,EAAkCmB,EAAI,YACxCxC,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAChDJ,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAChDJ,EAAc,SAAUE,EAAMC,EAAWC,CAAO,CAAW,EAHxDs+D,EAAcr9D,EAAA,eAAEs9D,EAAat9D,EAAA,cAIpC,MAAO,CAACq9D,EAAgBC,CAAa,CACtC,CACD,IAAK,uBACH,MAAO,CAACn8D,EAAI,qBACRxC,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC/CJ,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAChDJ,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACtDJ,EAAc,sBAAuBE,EAAMC,EAAWC,CAAO,EAE7DJ,EAAc,oBAAqBE,EAAMC,EAAWC,CAAO,CAC/C,CAAC,EAEnB,QACE,MAAM,UAAU,aAAa,OAAAF,EAAK,GAAE,qBAAA,CAAqB,CAC5D,CACH,ECxCG,IAAMu3D,GACT,SAACv3D,EAAYC,EACZC,EAA2BoC,EAAW,CACrC,OAD0BA,IAAA,SAAAA,EAAWk1D,IAC7Bx3D,EAAK,GAAE,CACb,IAAK,MAAO,CACV,IAAMgJ,EACFlJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5CytB,EACF7tB,EAAc,WAAYE,EAAMC,EAAWC,CAAO,EACtD,MAAO,CAACoC,EAAI,IACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAAa8I,EACxD2kB,CAAQ,CAAC,CACd,CACD,IAAK,OAAQ,CACX,IAAM3kB,EACFlJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5CytB,EACF7tB,EAAc,WAAYE,EAAMC,EAAWC,CAAO,EACtD,MAAO,CAACoC,EAAI,KACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAAa8I,EACxD2kB,CAAQ,CAAC,CACd,CACD,IAAK,MAAO,CACV,IAAM3kB,EACFlJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5CytB,EACF7tB,EAAc,WAAYE,EAAMC,EAAWC,CAAO,EACtD,MAAO,CAACoC,EAAI,IACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAAa8I,EACxD2kB,CAAQ,CAAC,CACd,CACD,IAAK,MAAO,CACV,IAAM3kB,EACFlJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5CytB,EACF7tB,EAAc,WAAYE,EAAMC,EAAWC,CAAO,EACtD,MAAO,CAACoC,EAAI,IACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAAa8I,EACxD2kB,CAAQ,CAAC,CACd,CACD,IAAK,MAAO,CACV,IAAM3kB,EACFlJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5CytB,EACF7tB,EAAc,WAAYE,EAAMC,EAAWC,CAAO,EACtD,MAAO,CAACoC,EAAI,IACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAAa8I,EACxD2kB,CAAQ,CAAC,CACd,CACD,IAAK,MAAO,CACV,IAAM3kB,EACFlJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5CytB,EACF7tB,EAAc,WAAYE,EAAMC,EAAWC,CAAO,EACtD,MAAO,CAACoC,EAAI,IACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAAa8I,EACxD2kB,CAAQ,CAAC,CACd,CACD,IAAK,SAAU,CACb,IAAM3kB,EACFlJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAClD,MAAO,CAACoC,EAAI,OACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAAa8I,CAAI,CAAC,CAClE,CACD,IAAK,SAAU,CACb,IAAMA,EACFlJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAClD,MAAO,CAACoC,EAAI,OACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAAa8I,CAAI,CAAC,CAClE,CACD,IAAK,OAAQ,CACX,IAAMA,EACFlJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5CytB,EACF7tB,EAAc,WAAYE,EAAMC,EAAWC,CAAO,EACtD,MAAO,CAACoC,EAAI,KACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAAa8I,EACxD2kB,CAAQ,CAAC,CACd,CACD,IAAK,UAAW,CACd,IAAM3kB,EACFlJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5Cw7B,EACF57B,EAAc,YAAaE,EAAMC,EAAWC,CAAO,EACjDy7B,EACF77B,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EACrD,MAAO,CAACoC,EAAI,QACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAAa8I,EACxD0yB,EAAWC,CAAO,CAAC,CACxB,CACD,IAAK,SAAU,CACb,IAAM3yB,EACFlJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5Cw7B,EACF57B,EAAc,YAAaE,EAAMC,EAAWC,CAAO,EACjDy7B,EACF77B,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EACrD,MAAO,CAACoC,EAAI,OACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAAa8I,EACxD0yB,EAAWC,CAAO,CAAC,CACxB,CACD,IAAK,WACH,IAAMxxB,EAAIrK,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC/C+D,EACFnE,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/CuI,EACF3I,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAElD,MAAO,CAACoC,EAAI,SAAS6H,EAAGlG,EAASwE,CAAI,CAAC,EACxC,IAAK,gBAAiB,CACpB,IAAMi2D,EAAI5+D,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAE/Cy+D,EACF7+D,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAE/C0+D,EACF9+D,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAE5C87B,EACFl8B,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EAG1D,MAAO,CAACoC,EAAI,cAAco8D,EAAGC,EAASC,EAAM5iC,CAAY,CAAC,CAC1D,CACD,QACE,MAAM,UAAU,aAAa,OAAAh8B,EAAK,GAAE,qBAAA,CAAqB,CAC5D,CACH,EC/HG,IAAMu3D,GACT,SAACv3D,EAAYC,EAA4BC,EACxCoC,EAAW,CACV,OADDA,IAAA,SAAAA,EAAWk1D,IACFx3D,EAAK,GAAE,CACb,IAAK,WACL,IAAK,SAAU,CACb,IAAM7B,EAAI2B,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC/C8I,EACFlJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC9CkE,EACAtE,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EACrD,OAAAkE,EAASA,EAAO,MAAM,EAAGjG,CAAC,EACnB,CAACmE,EAAI,OAAO8B,EAAQ4E,CAAI,CAAC,CACjC,CACD,IAAK,SAAU,CACb,IAAM9D,EAAQpF,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EACnDyrB,EACF7rB,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EACrD,MAAO,CAACoC,EAAI,OAAO4C,EAAO5C,EAAI,KAAKqpB,EAAS,OAAO,EAAG,CAAC,CAAC,CACzD,CACD,IAAK,WAAY,CACf,IAAM3iB,EACFlJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5C+iC,EACFnjC,EAAc,YAAaE,EAAMC,EAAWC,CAAO,EACjDgF,EAAQpF,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EACnDyrB,EACF7rB,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EACrD,MAAO,CAACoC,EAAI,OACR4C,EAAO5C,EAAI,KAAKqpB,EAAS,OAAO,EAAG3iB,EAAMi6B,CAAS,CAAC,CACxD,CACD,IAAK,UAAW,CAId,QAHM47B,EACF/+D,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5C8I,EAAO,CAAA,EACJtK,EAAI,EAAGA,EAAImgE,EAAK,OAAQngE,IAC3BmgE,EAAKngE,CAAC,GACRsK,EAAK,KAAKtK,CAAC,EAGf,IAAMwG,EAAQpF,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EACzD,MAAO,CAACoC,EAAI,QAAQ4C,EAAO8D,CAAI,CAAC,CACjC,CACD,IAAK,YAAa,CAChB,IAAMA,EACFlJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5CgF,EAAQpF,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EACzD,MAAO,CAACoC,EAAI,QAAQ4C,EAAO8D,CAAI,CAAC,CACjC,CACD,IAAK,QAAS,CAEZ,IAAMorB,EAAQt0B,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAEvDuI,EAAO3I,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC3D,MAAO,CAACoC,EAAI,MACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAAak0B,EACxD3rB,CAAI,CAAC,CACV,CACD,IAAK,eAAgB,CACnB,IAAM2rB,EACFt0B,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC7CI,EACFR,EAAc,MAAOE,EAAMC,EAAWC,CAAO,EAC3CwK,EACF5K,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/Ci6C,EACFr6C,EAAc,YAAaE,EAAMC,EAAWC,CAAO,EACjDk6C,EACFt6C,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/Cm6C,EACFv6C,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpDo6C,EACFx6C,EAAc,cAAeE,EAAMC,EAAWC,CAAO,EACnDq6C,EACFz6C,EAAc,iBAAkBE,EAAMC,EAAWC,CAAO,EAEtDY,EAAShB,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAE1D,MAAO,CAACoC,EAAI,aACRxB,EAAQszB,EAAO9zB,EAAKoK,EAASyvC,EAAWC,EAASC,EACjDC,EAAaC,CAAc,CAAC,CACjC,CACD,IAAK,OACH,OAAO75B,GAAAA,KAAK,UAAA,CACV,IAAM1X,EACFlJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5C4oB,EACFhpB,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAG/C6G,EAAQ+hB,EAAQ,CAAC,EAAE,MACnBg2C,EAAgBx8D,EAAI,QAAQwmB,EAAQ,CAAC,CAAC,EAAE,MACxCi2C,GAASj2C,EAAQ,IAAI,SAAAhoB,EAAM,CAC/B,IAAMk+D,EAAYh+D,GAAAA,KAAK,YAAYF,EAAO,MAAOiG,CAAK,EACtD,GAAI,CAACi4D,GACD,CAACh+D,GAAAA,KAAK,YAAYsB,EAAI,QAAQxB,CAAM,EAAE,MAAOg+D,CAAa,EAC5D,MAAM,IAAI,MAAM,wCAAwC,EAE1D,OAAOE,EAAYl+D,EAASwB,EAAI,QAAQxB,EAAQiG,CAAK,CACvD,CAAC,EACD,MAAO,CAACzE,EAAI,MAAMy8D,GAAQ/1D,CAAI,CAAC,CACjC,CAAC,EAEH,IAAK,SAAU,CACb,IAAMA,EACFlJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5CY,EACFhB,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EACpD,OAAOoC,EAAI,QAAQxB,EAAQkI,CAAI,CAChC,CACD,IAAK,OAAQ,CACX,IAAM8uB,EACFh4B,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAClD,MAAO,CAACoC,EAAI,KACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAAa43B,CAAI,CAAC,CAClE,CACD,IAAK,QACL,IAAK,SAAU,CACb,IAAM9uB,EACFlJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC5C44C,EACFh5C,EAAc,kBAAmBE,EAAMC,EAAWC,CAAO,EAGvDY,EAAShB,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAE1D,OAAOoC,EAAI,MAAMxB,EAAQg4C,EAAiB9vC,CAAI,CAC/C,CACD,IAAK,YAAa,CAChB,IAAM2iB,EACF7rB,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/CwH,EACF5H,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC9C6G,EACFjH,EAAc,QAASE,EAAMC,EAAWC,CAAO,EACnD,MAAO,CAACoC,EAAI,UAAUqpB,EAASjkB,EAAQX,CAAK,CAAC,CAC9C,CACD,IAAK,WAAY,CACf,IAAMoD,EAAIrK,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC/CyrB,EACF7rB,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EACrD,MAAO,CAACoC,EAAI,SAAS6H,EAAGwhB,CAAO,CAAC,CACjC,CACD,IAAK,gBAAiB,CACpB,IAAMA,EACF7rB,EAAc,gBAAiBE,EAAMC,EAAWC,CAAO,EAErD6G,EACFjH,EAAc,cAAeE,EAAMC,EAAWC,CAAO,EAEnD++C,EACFn/C,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EACpDgH,EACFpH,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EAC1D,MAAO,CAACoC,EAAI,cACRqpB,EAASszB,EAAcl4C,EACvBk4C,EAAa,QAAU/3C,EAAa,MAChCA,EACA5E,EAAI,KAAK4E,EAAc+3C,EAAa,KAAK,CAAC,CAAC,CACpD,CACD,IAAK,sBAAuB,CAC1B,IAAMtzB,EACF7rB,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAC/CwH,EACF5H,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAC9CY,EACFhB,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EACpD,MAAO,CAACoC,EAAI,oBAAoBxB,EAAQ6qB,EAASjkB,CAAM,CAAC,CACzD,CACD,QACE,MAAM,UAAU,aAAa,OAAA1H,EAAK,GAAE,qBAAA,CAAqB,CAC5D,CACH,EC5KG,IAAMu3D,GACT,SAACv3D,EAAYC,EACZC,EAA2BoC,EAAW,CACrC,OAD0BA,IAAA,SAAAA,EAAWk1D,IAC7Bx3D,EAAK,GAAE,CACb,IAAK,sBAAuB,CACpB,IAAAa,EAMFyB,EAAI,OAAO,oBACPxC,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAEjDJ,EAAc,SAAUE,EAAMC,EAAWC,CAAO,EAChDJ,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EAEpDJ,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,CAC5C,EAZhB++D,EAAap+D,EAAA,cACbq+D,EAAYr+D,EAAA,aACZs+D,EAAiBt+D,EAAA,kBACjBu+D,EAAev+D,EAAA,gBAUjB,MAAO,CACLo+D,EAAeC,EAAcC,EAAmBC,EAEnD,CACD,IAAK,gBAAiB,CACd,IAAAj+D,EAA+BmB,EAAI,OAAO,cAC5CxC,EAAc,eAAgBE,EAAMC,EAAWC,CAAO,EAEtDJ,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EACpDJ,EAAc,WAAYE,EAAMC,EAAWC,CAAO,CAAa,EAJ5D++D,EAAa99D,EAAA,cAAEw5B,EAAWx5B,EAAA,YAKjC,MAAO,CAAC89D,EAAetkC,CAAW,CACnC,CACD,IAAK,oBAAqB,CACxB,IAAM0kC,EAAa/8D,EAAI,OAAO,kBAC1BxC,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC9CJ,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EACjDJ,EAAc,aAAcE,EAAMC,EAAWC,CAAO,CACxC,EAChB,MAAO,CAACm/D,CAAU,CACnB,CACD,IAAK,mBAAoB,CACvB,IAAMA,EAAa/8D,EAAI,OAAO,iBAC1BxC,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC9CJ,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EACjDJ,EAAc,aAAcE,EAAMC,EAAWC,CAAO,CACxC,EAChB,MAAO,CAACm/D,CAAU,CACnB,CACD,QACE,MAAM,UAAU,aAAa,OAAAr/D,EAAK,GAAE,qBAAA,CAAqB,CAC5D,CACH,EClDG,IAAMu3D,GACT,SAACv3D,EAAYC,EAA4BC,EACxCoC,EAAW,CACN,OADLA,IAAA,SAAAA,EAAWk1D,IACEx3D,EAAK,GAAE,CACb,IAAK,MACH,MAAO,CAACsC,EAAI,IACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,OACH,MAAO,CAACoC,EAAI,KACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,OACH,MAAO,CAACoC,EAAI,KACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,IAAK,QACH,MAAO,CAACoC,EAAI,MACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE7D,QACE,MAAM,UAAU,aAAa,OAAAF,EAAK,GAAE,qBAAA,CAAqB,CAC5D,CACH,ECvBD,IAAMu3D,GACT,SAACv3D,EAAYC,EACZC,EAA2BoC,EAAW,CACrC,OAD0BA,IAAA,SAAAA,EAAWk1D,IAC7Bx3D,EAAK,GAAE,CACb,IAAK,qBACH,MAAO,CAACsC,EAAI,OAAO,mBACjBxC,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC/CJ,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EACjDJ,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EACjDJ,EAAc,gBAAiBE,EAAMC,EAAWC,CAAO,CAAY,CACpE,EAEH,IAAK,eAAgB,CACb,IAAAW,EAAyByB,EAAI,OAAO,aACtCxC,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAC9CJ,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EACpDJ,EAAc,YAAaE,EAAMC,EAAWC,CAAO,EACnDJ,EAAc,cAAeE,EAAMC,EAAWC,CAAO,EAErDJ,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EACjDJ,EAAc,WAAYE,EAAMC,EAAWC,CAAO,EAClDJ,EAAc,WAAYE,EAAMC,EAAWC,CAAO,EAClDJ,EACI,yBAA0BE,EAAMC,EAAWC,CAAO,CAC3C,EAXRo/D,EAAMz+D,EAAA,OAAE0+D,EAAY1+D,EAAA,aAY3B,MAAO,CAACy+D,EAAQC,CAAY,CAC7B,CACD,IAAK,cAAe,CACZ,IAAAp+D,EAA2BmB,EAAI,OAAO,YACxCxC,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC/CJ,EAAc,YAAaE,EAAMC,EAAWC,CAAO,EACnDJ,EAAc,YAAaE,EAAMC,EAAWC,CAAO,CAAY,EAH5DyrB,EAAOxqB,EAAA,QAAEuG,EAAMvG,EAAA,OAAE4F,EAAK5F,EAAA,MAI7B,MAAO,CAACwqB,EAASjkB,EAAQX,CAAK,CAC/B,CACD,IAAK,yBAA0B,CAC7B,IAAMX,EAAS9D,EAAI,OAAO,uBACtBxC,EAAc,QAASE,EAAMC,EAAWC,CAAO,EAC/CJ,EAAc,aAAcE,EAAMC,EAAWC,CAAO,CAAW,EACnE,MAAO,CAACkG,CAAM,CACf,CACD,QACE,MAAM,UAAU,aAAa,OAAApG,EAAK,GAAE,qBAAA,CAAqB,CAC5D,CACH,EC3CG,IAAMu3D,GACT,SAACv3D,EAAYC,EAA4BC,EACxCoC,EAAW,CACV,OADDA,IAAA,SAAAA,EAAWk1D,IACFx3D,EAAK,GAAE,CACb,IAAK,OACH,MAAO,CAACsC,EAAI,KACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,QAASE,EAAMC,EAAWC,CAAO,CACzB,CAAC,EAE7B,IAAK,aAAc,CACjB,IAAM8I,EACFlJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAClD,MAAO,CAACoC,EAAI,WACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAAa8I,CAAI,CAAC,CAClE,CACD,IAAK,UAAW,CACd,IAAMA,EACFlJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,EAClD,MAAO,CAACoC,EAAI,QACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAAa8I,CAAI,CAAC,CAClE,CAED,IAAK,UACH,MAAO,CAAC1G,EAAI,QACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,QAASE,EAAMC,EAAWC,CAAO,CAAa,CAAC,EAEnE,IAAK,cACH,MAAO,CAACoC,EAAI,YACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,QAASE,EAAMC,EAAWC,CAAO,CAAa,CAAC,EAEnE,IAAK,YACH,MAAO,CAACoC,EAAI,UACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAEjDJ,EAAc,OAAQE,EAAMC,EAAWC,CAAO,CAC/B,CAAC,EAEtB,IAAK,QACL,IAAK,MACH,MAAO,CAACoC,EAAI,IACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,UAAWE,EAAMC,EAAWC,CAAO,EAEjDJ,EAAc,gBAAiBE,EAAMC,EAAWC,CAAO,CAC7C,CAAC,EAEjB,IAAK,iBAAkB,CACrB,IAAMy1B,EACF71B,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EAClDyoC,EACF7oC,EAAc,WAAYE,EAAMC,EAAWC,CAAO,EACtD,MAAO,CAACoC,EAAI,eACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3Cy1B,EAAYgT,CAAQ,CAAC,CAC1B,CACD,IAAK,iBAAkB,CACrB,IAAMhT,EACF71B,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EAClD01B,EACF91B,EAAc,QAASE,EAAMC,EAAWC,CAAO,EACnD,MAAO,CAACoC,EAAI,eACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3Cy1B,EAAYC,CAAK,CAAC,CACvB,CACD,IAAK,eAAgB,CACnB,IAAMuG,EACFr8B,EAAc,YAAaE,EAAMC,EAAWC,CAAO,EACjDmvB,EACDvvB,EAAc,aAAcE,EAAMC,EAAWC,CAAO,EAC5C,YAAW,EAExB,MAAO,CAACoC,EAAI,aACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3Ci8B,EAAW9M,CAAU,CAAC,CAC3B,CACD,IAAK,cACH,MAAO,CAAC/sB,EAAI,YACRxC,EAAc,IAAKE,EAAMC,EAAWC,CAAO,EAC3CJ,EAAc,QAASE,EAAMC,EAAWC,CAAO,CAAa,CAAC,EAEnE,IAAK,gBACH,MAAO,CAACoC,EAAI,cACRxC,EAAc,KAAME,EAAMC,EAAWC,CAAO,EAC5CJ,EAAc,KAAME,EAAMC,EAAWC,CAAO,CAAW,CAAC,EAE9D,QACE,MAAM,UAAU,aAAa,OAAAF,EAAK,GAAE,qBAAA,CAAqB,CAC5D,CACH,ECjEE,SAAUu3D,GACZv3D,EAAYC,EAA4BC,EACxCC,EAAmCugB,EAAe,CAAfA,IAAA,SAAAA,EAAO8+C,GAAI,MAEhD,IAAMriE,GACD,SAAC6C,EAAYC,EAA4BC,EAAyB,CACjE,OAAQF,EAAK,SAAQ,CACnB,IAAK,aACH,OAAO0gB,EAAK,UAAA,CAAM,OAAA++C,GAAqBz/D,EAAMC,EAAWC,CAAO,CAA7C,CAA8C,EAClE,IAAK,aACH,OAAOwgB,EAAK,UAAA,CAAM,OAAAg/C,GAAoB1/D,EAAMC,EAAWC,CAAO,CAA5C,CAA6C,EACjE,IAAK,UACH,OAAOy/D,GAAkB3/D,EAAMC,EAAWC,CAAO,EACnD,IAAK,cACH,OAAOwgB,EAAK,UAAA,CAAM,OAAAk/C,GAAsB5/D,EAAMC,EAAWC,CAAO,CAA9C,CAA+C,EACnE,IAAK,WACH,OAAOwgB,EAAK,UAAA,CAAM,OAAAm/C,GAAmB7/D,EAAMC,EAAWC,CAAO,CAA3C,CAA4C,EAChE,IAAK,UACH,OAAO4/D,GAAkB9/D,EAAMC,EAAWC,CAAO,EACnD,IAAK,aACH,OAAOwgB,EAAK,UAAA,CAAM,OAAAq/C,GAAqB//D,EAAMC,EAAWC,CAAO,CAA7C,CAA8C,EAClE,IAAK,QACH,OAAOwgB,EAAK,UAAA,CAAM,OAAAs/C,GAAgBhgE,EAAMC,EAAWC,CAAO,CAAxC,CAAyC,EAC7D,IAAK,QACH,OAAOwgB,EAAK,UAAA,CAAM,OAAAu/C,GAAgBjgE,EAAMC,EAAWC,CAAO,CAAxC,CAAyC,EAC7D,IAAK,UACH,OAAOwgB,EAAK,UAAA,CAAM,OAAAw/C,GAAkBlgE,EAAMC,EAAWC,CAAO,CAA1C,CAA2C,EAC/D,IAAK,WACH,OAAOwgB,EAAK,UAAA,CAAM,OAAAy/C,GAAmBngE,EAAMC,EAAWC,CAAO,CAA3C,CAA4C,EAChE,IAAK,gBACH,OAAOwgB,EACH,UAAA,CAAM,OAAA0/C,GAAwBpgE,EAAMC,EAAWC,CAAO,CAAhD,CAAiD,EAC7D,IAAK,SACH,OAAOwgB,EAAK,UAAA,CAAM,OAAA2/C,GAAiBrgE,EAAMC,EAAWC,CAAO,CAAzC,CAA0C,EAC9D,IAAK,YACH,OAAOwgB,EAAK,UAAA,CAAM,OAAA4/C,GAAoBtgE,EAAMC,EAAWC,CAAO,CAA5C,CAA6C,EACjE,IAAK,aACH,OAAOwgB,EAAK,UAAA,CAAM,OAAA6/C,GAAoBvgE,EAAMC,EAAWC,CAAO,CAA5C,CAA6C,EACjE,IAAK,SACH,OAAOwgB,EAAK,UAAA,CAAM,OAAA8/C,GAAiBxgE,EAAMC,EAAWC,CAAO,CAAzC,CAA0C,EAC9D,IAAK,WACH,OAAOwgB,EAAK,UAAA,CAAM,OAAA+/C,GAAmBzgE,EAAMC,EAAWC,CAAO,CAA3C,CAA4C,EAChE,IAAK,SACH,OAAOwgB,EAAK,UAAA,CAAM,OAAAggD,GAAiB1gE,EAAMC,EAAWC,CAAO,CAAzC,CAA0C,EAC9D,IAAK,iBACH,OAAOwgB,EACH,UAAA,CAAM,OAAAigD,GAAyB3gE,EAAMC,EAAWC,CAAO,CAAjD,CAAkD,EAC9D,IAAK,aACH,OAAO0gE,GACH5gE,EAAMC,EAAWC,EAASC,CAAe,EAC/C,IAAK,SACH,IAAMR,EAAWC,GAAgBI,EAAK,EAAE,EACxC,GAAIL,GAAYA,EAAS,eACvB,OAAOA,EAAS,eACZ,IAAIsH,GAAcjH,EAAMC,EAAWC,CAAO,CAAC,EAE/C,MAAM,UAAU,aAAa,OAAAF,EAAK,GAAE,qBAAA,CAAqB,EAE7D,QACE,MAAM,UACF,eAAA,OAAeA,EAAK,GAAwB,sBAAA,EAC5C,iHACuD,CAC9D,IACAA,EAAMC,EAAWC,CAAO,EAC/B,OAAIs/D,GAAI,KAAK,UAAUriE,CAAK,EACnBA,EAAM,KAAK,SAAC4D,EAAS,CAAA,MAAA,CAAA,EAAG,OAAOA,CAAI,CAAd,CAAe,EAEtC,CAAA,EAAG,OAAO5D,CAAK,CACxB,CCnFA,IAAA0jE,IAAA,UAAA,CAME,SACaA,EAAAC,EACAC,EACAC,EACAC,EACAC,EAA2D,CAJ3DJ,IAAA,SAAAA,EAA+B,CAAA,GAC/BC,IAAA,SAAAA,EAAmC,CAAA,GACnCC,IAAA,SAAAA,EAAiC,CAAA,GACjCC,IAAA,SAAAA,EAAmD,CAAA,GAHnD,KAAS,UAATH,EACA,KAAc,eAAdC,EACA,KAAa,cAAbC,EACA,KAAW,YAAXC,EACA,KAAkB,mBAAlBC,EAVL,KAAA,YAAc,CAAC,GAAI,EAAG,UAAW,GAAI,YAAa,CAAC,EACnD,KAAA,SAAmC,CAAC,KAAK,WAAW,EACpD,KAAM,OAAG,EASf,KAAK,0BAAyB,EAGxB,OAAAL,EAAA,UAAA,SAAA,SAAS98C,EAAYo9C,EAAiB,CAC5C,MAAO,CAAC,GAAEp9C,EAAE,UAASo9C,EAAE,YAAa,CAAC,GAQvC,OAAA,eAAIN,EAAc,UAAA,iBAAA,CAOlB,IAAA,UAAA,CACE,OAAO,KAAK,UARd,IAAA,SAAmBO,EAAgC,CAC7C,KAAK,WAAaA,IACpB,KAAK,SAAWA,EAChB,KAAK,0BAAyB,iCAEjC,CAAA,EASD,OAAA,eAAIP,EAAgB,UAAA,mBAAA,CAApB,IAAA,UAAA,CACE,OAAO,KAAK,mBAAmB,CAAC,gCACjC,CAAA,EAMD,OAAA,eAAIA,EAAiB,UAAA,oBAAA,CAArB,IAAA,UAAA,CACE,OAAO,KAAK,iDACb,CAAA,EAEOA,EAAA,UAAA,0BAAA,UAAA,CAEN,QADMQ,EAAQ,CAAA,EACL3iE,EAAI,EAAGA,EAAI,KAAK,SAAS,OAAS,EAAGA,IAAK,CACjD,IAAM0iE,EAAW,KAAK,SAAS,MAAM,EAAG,KAAK,SAAS,OAAS1iE,CAAC,EAChE2iE,EAAM,KAAK,KAAK,qBAAqBD,CAAQ,CAAC,CAC/C,CACDC,EAAM,KAAK,EAAE,EACb,KAAK,mBAAqBA,GAGpBR,EAAoB,UAAA,qBAApB,SAAqBO,EAAgC,CAC3D,OAAOA,EACHA,EACK,IACG,SAAAlhE,EAAO,CAAI,OAACA,EAAQ,KAAO,GAAKA,EAAQ,cAAgB,EACpD,GACA,GAAG,OAAAA,EAAQ,UAAa,GAAA,EAAA,OAAAA,EAAQ,WAAW,CAFpC,CAEsC,EACpD,KAAK,GAAG,EACb,IAON2gE,EAAU,UAAA,WAAV,SAAW/F,EAAe,CACpB,KAAK,WACP,KAAK,SACL,KAAK,SAAW,KAAK,SAAS,MAAK,EACnC,KAAK,SAAS,KAAK,KAAK,SAAS,KAAK,OAAQA,CAAO,CAAC,EACtD,KAAK,mBAAmB,QAAQ,KAAK,qBAAqB,KAAK,QAAQ,CAAC,IAQ5E+F,EAAA,UAAA,UAAA,UAAA,CACE,GAAI,KAAK,UAAY,KAAK,SAAS,OAAS,EAC1C,KAAK,SAAW,KAAK,SAAS,MAAK,EACnC,KAAK,SAAS,OAAO,EAAE,EACvB,KAAK,kBAAkB,MAAK,MAE5B,OAAM,IAAI,MAAM,yCAAyC,GAQ7DA,EAAA,UAAA,cAAA,UAAA,CACE,GAAI,KAAK,UAAY,KAAK,SAAS,OAAS,EAAG,CAC7C,KAAK,SAAW,KAAK,SAAS,MAAK,EACnC,KAAK,SACL,IAAM3gE,EACF,OAAO,OAAO,CAAA,EAAI,KAAK,SAAS,KAAK,SAAS,OAAS,CAAC,CAAC,EAC7DA,EAAQ,aAAe,EACvBA,EAAQ,GAAK,KAAK,OAClB,KAAK,SAAS,OAAO,GAAI,EAAGA,CAAO,EACnC,KAAK,mBAAmB,OACpB,EAAG,EAAG,KAAK,qBAAqB,KAAK,QAAQ,CAAC,CACnD,KACC,OAAM,IAAI,MAAM,uDAAuD,GAI3E2gE,EAAS,UAAA,UAAT,SAAUphE,EAAY,CACpB,OAAO,KAAK,UAAUA,CAAI,GAG5BohE,EAAc,UAAA,eAAd,SAAe9F,EAAwB,CACrC,KAAK,eAAeA,EAAY,EAAE,EAAIA,GAGxC8F,EAAc,UAAA,eAAd,SAAe98C,EAAU,CACvB,OAAO,KAAK,eAAeA,CAAE,GAG/B88C,EAAa,UAAA,cAAb,SAAc/G,EAAsB,CAClC,KAAK,cAAcA,EAAW,EAAE,EAAIA,GAGtC+G,EAAa,UAAA,cAAb,SAAc98C,EAAU,CACtB,OAAO,KAAK,cAAcA,CAAE,GAG9B88C,EAAO,UAAA,QAAP,SAAQlI,EAAoB,CAC1B,QAAWl0D,KAAO,KAAK,eACrB,KAAK,eAAeA,CAAG,EAAE,cAAck0D,CAAO,EAGhD,QAAWl0D,KAAO,KAAK,cACrB,KAAK,cAAcA,CAAG,EAAE,cAAck0D,CAAO,GAGlDkI,CAAA,GAAA,ECnJK,SAAUS,GACZl9D,EAAwBC,EAAiBy8D,EACzC58D,EAAkB,CACpB,IAAMq9D,EAAY,IAAI,IAChBC,EAA0B,CAAA,EAC5BC,EAAoB,KACpBC,EAAuB,KAIrBl8C,EAAO,IAAI,IACXm8C,EACF,IAAI,IAAI,OAAO,KAAKv9D,CAAM,EAAE,IAAI,SAAC3E,EAAS,CAAA,OAAA2B,GAAc3B,CAAI,EAAE,CAAC,CAAC,CAAA,CAAC,EAErEyE,EAAYA,GAAa,CAAA,EAKzB,QAJM09D,EACF,IAAI,IAAI19D,EAAU,IAAI,SAAClE,EAAS,CAAA,OAAAoB,GAAcpB,EAAK,IAAI,EAAE,CAAC,CAA1B,CAA2B,CAAC,EAE1D6hE,EAAQ9iE,GAAA,CAAA,EAAAJ,EAAO0F,CAAO,EAAA,EAAA,EACrBw9D,EAAS,OAAS,GAAG,CAC1B,IAAM7hE,EAAO6hE,EAAS,IAAG,EAWzB,IAVIC,GAAc9hE,CAAI,GAAK+hE,GAAe/hE,CAAI,GAAKgiE,GAAYhiE,CAAI,IAC7DyhE,GAAe,OACjBA,EAAczhE,EACd0hE,EAAaD,EAAY,SAAS,IAAI,SAAAQ,EAAK,CAAI,OAAAA,EAAM,IAAI,CAAA,EACvC,OAAO,SAAAxiE,EAAI,CAAI,OAAA8hE,EAAU,IAAI9hE,CAAI,CAAlB,CAAmB,GAGxD8hE,EAAU,IAAIvhE,EAAK,IAAI,EAGnB8gE,EAAU9gE,EAAK,IAAI,GAAK,MAIxB,CAAA2hE,EAAe,IAAI3hE,EAAK,IAAI,GAI5B,CAAA4hE,EAAc,IAAI5hE,EAAK,IAAI,EAG/B,IAAIA,EAAK,OAAO,SAAW,EAAG,CAC5BwhE,EAAc,KAAKxhE,EAAK,IAAI,EAC5B,QACD,CACDA,EAAK,OAAO,QAAQ,SAAAkF,EAAK,CAEnBsgB,EAAK,IAAItgB,EAAM,IAAI,IAGvBsgB,EAAK,IAAItgB,EAAM,IAAI,EACnB28D,EAAS,KAAK38D,CAAK,EACrB,CAAC,EACF,CACD,MAAO,CAAC,OAAMd,EAAE,QAAOC,EAAE,UAASk9D,EAAE,cAAaC,EAAE,YAAWC,EAAE,WAAUC,CAAA,CAC5E,CAMgB,SAAAQ,GACZp/D,EAAcq/D,EAA4B,iBACrCZ,EAAqBY,EAAa,UAAvB/9D,EAAU+9D,EAAa,OACnCC,EAAa,OAAO,KAAKh+D,CAAM,EACb,IAAI,SAAA3E,EAAI,CAAI,OAAA2B,GAAc3B,CAAI,EAAE,CAAC,CAAC,CAAA,EAClC,IAAI,SAAAA,EAAI,CAAI,OAAAqD,EAAM,MAAMrD,CAAI,CAAhB,CAAiB,EAC/CyE,EAAYpB,EAAM,WAAa,CAAA,EAE/Bu/D,EAAS,SAACriE,EAAiB,CAC7B,OAAAuhE,EAAU,IAAI,OAAOvhE,GAAS,SAAWA,EAAOA,EAAK,IAAI,CAAzD,EAEJ,SAASm8C,EAAOh4C,EAAa,CAC3B,OAAWpF,GAAA,CAAA,EAAAJ,EAAA,IAAI,IAAIwF,EAAM,IAAI,SAACnE,EAAI,CAAK,MAAA,CAACA,EAAK,KAAMA,CAAI,CAAC,CAAA,CAAC,EAAE,OAAM,CAAE,EAAE,EAAA,EAEvE,IAAMsiE,EAAkBnmB,EACKp9C,GAAAA,GAAAA,GAAA,CAAA,EAAAJ,EAAAyjE,CAAU,EAAA,EAAA,EAAAzjE,EACVmE,EAAM,OAAO,EAAA,EAAA,EAAAnE,EACbuF,CAAS,EACZ,EAAA,CAAA,EAAC,OAAOm+D,CAAM,EAClC79D,EAAW23C,EAAMp9C,GAAAA,GAAA,CAAA,EAAAJ,EACD2jE,CAAe,EACf,EAAA,EAAA3jE,EAAA,OAAO,OAAOmE,EAAM,KAAK,CAAC,EAC7B,EAAA,CAAA,EAAC,OAAOu/D,CAAM,EAC3BE,EACF,IAAI,IAAkB/9D,EAAS,IAAI,SAACxE,EAAI,CAAK,MAAA,CAACA,EAAK,KAAMA,CAAI,CAAhB,CAAiB,CAAC,EAE7DwiE,EAAmC,CAAA,MACzC,QAAmBC,EAAAnkE,GAAAkG,CAAQ,EAAAk+D,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAAxB,IAAMziE,EAAI0iE,EAAA,MACbF,EAASxiE,EAAK,IAAI,EAAIwiE,EAASxiE,EAAK,IAAI,GAAK,MAC7C,QAAoBkqB,GAAAy4C,EAAA,OAAArkE,GAAA0B,EAAK,QAAQ,GAAAmqB,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAA9B,IAAM+3C,EAAK93C,EAAA,MAGTk4C,EAAOJ,CAAK,IACfO,EAASP,EAAM,IAAI,EAAI,OAAO,mBAEhCO,EAASP,EAAM,IAAI,GAAKO,EAASP,EAAM,IAAI,GAAK,GAAK,CACtD,mGACF,mGAQD,QAJMJ,EAAW,OAAO,QAAQW,CAAQ,EAClB,OAAO,SAAC3hE,EAAW,KAAXM,EAAAxC,EAAAkC,EAAA,CAAA,EAAG+hE,GAAOzhE,EAAA,CAAA,EAAM,OAAAyhE,KAAY,CAAZ,CAAa,EACrC,IAAI,SAAC/hE,EAAM,KAANM,EAAAxC,EAAAkC,EAAA,CAAA,EAACpB,GAAI0B,EAAA,CAAA,EAAM,OAAA1B,EAAA,CAAI,EACpCojE,EAAgB9jE,GAAA,CAAA,EAAAJ,EAAOkjE,CAAQ,EAAA,EAAA,EAC9BA,EAAS,OAAS,GAAG,CAC1B,IAAMxgE,EAAWwgE,EAAS,IAAG,EACvB7hE,EAAOuiE,EAAW,IAAIlhE,CAAQ,MACpC,QAAoB8uB,GAAA2yC,EAAA,OAAAxkE,GAAA0B,EAAK,SAAS,OAAOqiE,CAAM,CAAC,GAAAp4C,EAAAkG,EAAA,KAAA,EAAE,CAAAlG,EAAA,KAAAA,EAAAkG,EAAA,KAAA,EAAA,CAA7C,IAAM8xC,EAAKh4C,EAAA,MACV,EAAEu4C,EAASP,EAAM,IAAI,IAAM,IAC7BY,EAAiB,KAAKZ,EAAM,IAAI,EAChCJ,EAAS,KAAKI,EAAM,IAAI,EAE3B,mGACF,CAED,IAAMc,EAAeF,EAAiB,IAAI,SAACpjE,EAAI,CAAK,OAAA8iE,EAAW,IAAI9iE,CAAI,CAAnB,CAAoB,EAClEujE,EACFC,GAA+BF,EAAcT,CAAe,EAGhE,OAAAY,GAA4BF,EAAsBV,CAAe,EAE1DU,CACT,CAgBA,SAASC,GACLF,EAAsBT,EAAuB,CAS/C,YARMC,EACF,IAAI,IAAkBQ,EAAa,IAAI,SAAC/iE,EAAI,CAAK,MAAA,CAACA,EAAK,KAAMA,CAAI,CAAhB,CAAiB,CAAC,EAGjEg6C,EAAQsoB,EAAgB,IAAI,SAACtiE,EAAS,CAAA,OAAAA,EAAK,IAAL,CAAS,EAC/CmjE,EAA+B,IAAI,IAAInpB,CAAK,EAG3CA,EAAM,OAAS,GAAG,CACvB,IAAM34C,EAAW24C,EAAM,IAAG,EACpBh6C,EAAOuiE,EAAW,IAAIlhE,CAAQ,MACpC,QAAoBF,GAAAiiE,EAAA,OAAA9kE,GAAA0B,EAAK,QAAQ,GAAAoM,EAAAjL,EAAA,KAAA,EAAE,CAAAiL,EAAA,KAAAA,EAAAjL,EAAA,KAAA,EAAA,CAA9B,IAAM8gE,EAAK71D,EAAA,MACV,CAACm2D,EAAW,IAAIN,EAAM,IAAI,GAC1BkB,EAA6B,IAAIlB,EAAM,IAAI,IAG/CkB,EAA6B,IAAIlB,EAAM,IAAI,EAC3CjoB,EAAM,KAAKioB,EAAM,IAAI,EACtB,mGACF,CAGD,IAAMe,EAAuBD,EAAa,OACtC,SAAC/iE,EAAS,CAAA,OAAAmjE,EAA6B,IAAInjE,EAAK,IAAI,CAAC,CAAA,EAEzD,OAAOgjE,CACT,CAEA,IAAAK,IAAA,SAAAh/C,EAAA,CAAuC1nB,GAAK0mE,EAAAh/C,CAAA,EAC1C,SAAAg/C,EAAY1F,EAAe,QACzBt5C,EAAM,KAAA,KAAA,6BAAA,OAA6Bs5C,CAAO,CAAE,GAAC,KAEhD,OAAA0F,CAAA,GAJsC,KAAK,EAe5C,SAASH,GACLH,EAAsBT,EAAuB,iBACzCgB,EAAkB,IAAI,IACxBP,EAAa,IAAI,SAAC/iE,EAAMujE,EAAK,CAAK,MAAA,CAACvjE,EAAK,KAAMujE,CAAK,CAAjB,CAAkB,CAAC,EACnDC,EAAsB,IAAI,IAAIlB,EAAgB,IAAI,SAACtiE,EAAS,CAAA,OAAAA,EAAK,IAAI,CAAA,CAAC,EACtEyjE,EAAe,SAACzjE,EAAiB,CACnC,OAAAwjE,EAAoB,IAAI,OAAOxjE,GAAS,SAAWA,EAAOA,EAAK,IAAI,CAAnE,EACE0jE,EACF,IAAI,IAAIX,EAAa,IAAI,SAAC/iE,EAAS,CAAA,OAAAA,EAAK,IAAI,CAAA,CAAC,EAC3C2jE,EAAiB,SAAC3jE,EAAiB,CACrC,OAAA0jE,EAAwB,IAAI,OAAO1jE,GAAS,SAAWA,EAAOA,EAAK,IAAI,CAAvE,MAEJ,QAAmB4jE,EAAAtlE,GAAAykE,CAAY,EAAAc,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAA5B,IAAM5jE,EAAI6jE,EAAA,UACb,QAAoB35C,GAAA45C,EAAA,OAAAxlE,GAAA0B,EAAK,SAAS,OAAO2jE,CAAc,CAAC,GAAAx5C,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAArD,IAAM+3C,EAAK93C,EAAA,MACd,GAAI,CAACm5C,EAAgB,IAAIrB,EAAM,IAAI,EACjC,MAAM,IAAIoB,GACN,SAAA,OAASpB,EAAM,KAAI,WAAA,EAAA,OAAYjiE,EAAK,KAAI,kBAAA,CAAkB,EAEhE,GAAIsjE,EAAgB,IAAItjE,EAAK,IAAI,EAAIsjE,EAAgB,IAAIrB,EAAM,IAAI,EACjE,MAAM,IAAIoB,GAAyB,QAAA,OAC/BrjE,EAAK,KAAI,uCAAA,EAAA,OAAwCiiE,EAAM,KAAI,GAAA,CAAG,CAErE,mGACD,GAAI,CAACwB,EAAazjE,CAAI,MACpB,QAAoBmwB,GAAA4zC,EAAA,OAAAzlE,GAAA0B,EAAK,MAAM,GAAAiqB,EAAAkG,EAAA,KAAA,EAAE,CAAAlG,EAAA,KAAAA,EAAAkG,EAAA,KAAA,EAAA,CAA5B,IAAMjrB,EAAK+kB,EAAA,MACd,GAAI,CAACq5C,EAAgB,IAAIp+D,EAAM,IAAI,EACjC,MAAM,IAAIm+D,GACN,SAAA,OAASn+D,EAAM,KAAI,WAAA,EAAA,OAAYlF,EAAK,KAAI,kBAAA,CAAkB,EAEhE,GAAIsjE,EAAgB,IAAIp+D,EAAM,IAAI,EAAIo+D,EAAgB,IAAItjE,EAAK,IAAI,EACjE,MAAM,IAAIqjE,GAAyB,QAAA,OAC/BrjE,EAAK,KAAI,wCAAA,EAAA,OAAyCkF,EAAM,KAAI,GAAA,CAAG,CAEtE,mGAEJ,mGACH,CAWM,SAAU8+D,GAAoBjB,EAAoB,CAmCtD,QAlCMO,EAAkB,IAAI,IACxBP,EAAa,IAAI,SAAC/iE,EAAMujE,EAAK,CAAK,MAAA,CAACvjE,EAAK,KAAMujE,CAAK,CAAjB,CAAkB,CAAC,EAEnDU,EAAW,OAAO,iBAGlBC,EAAgBnB,EAAa,IAC/B,SAAC/iE,EAAMmkE,EAAS,CAAK,OAAArC,GAAc9hE,CAAI,EAAIikE,EAAWE,CAAS,CAAA,EAC7DC,EAAkB,SAACpkE,EAAU,CACjC,IAAMqkE,EAAWH,EAAcZ,EAAgB,IAAItjE,EAAK,IAAI,CAAE,EAC9D,OAAIqkE,GAGK,EAGX,EAQMC,EAAkBvB,EAAa,IAAI,SAAC/iE,EAAMmkE,EAAS,CACvD,OAAOnkE,EAAK,SAAS,IAAIokE,CAAe,EACnC,OAAO,SAAC77D,EAAG9L,EAAM,CAAA,OAAA,KAAK,IAAI8L,EAAG9L,CAAC,CAAC,EAAEynE,EAAcC,CAAS,CAAC,CAChE,CAAC,EAMKI,EAAe,IAAI,IAChBJ,EAAY,EAAGA,EAAYpB,EAAa,OAAQ,EAAEoB,EAAW,CACpE,IAAMK,EAAiBF,EAAgBH,CAAS,EAChD,GAAIK,IAAmBP,EAGvB,KAAMjkE,EAAO+iE,EAAaoB,CAAS,EAC7BM,EAAgB1B,EAAayB,CAAc,EAC5CD,EAAa,IAAIE,EAAc,IAAI,GACtCF,EAAa,IAAIE,EAAc,KAAM,CAAA,CAAE,EAEzCF,EAAa,IAAIE,EAAc,IAAI,EAAG,KAAKzkE,CAAI,EAChD,CACD,OAAOukE,CACT,CAEA,IAAMG,GAAmB,IAAI,IAAI,CAC/B,SAAU,QAAS,QAAS,OAAQ,gBAAiB,cACrD,iBAAkB,KAAM,OACzB,CAAA,EACKC,GAAoB,IAAI,IAAI,CAChC,sBAAuB,sBAAuB,sBAAuB,OACtE,CAAA,EACKC,GAAiB,IAAI,IAAI,CAC7B,YAAa,cAAe,oBAAqB,sBACjD,kBAAmB,oBAAqB,kBAAmB,mBAC5D,CAAA,EAEK,SAAU9C,GAAc9hE,EAAU,CACtC,OAAO0kE,GAAiB,IAAI1kE,EAAK,EAAE,CACrC,CAEM,SAAU+hE,GAAe/hE,EAAU,CACvC,OAAO2kE,GAAkB,IAAI3kE,EAAK,EAAE,CACtC,CAEM,SAAUgiE,GAAYhiE,EAAU,CACpC,OAAO4kE,GAAe,IAAI5kE,EAAK,EAAE,CACnC,CCvTA,IAAA6kE,IAAA,UAAA,CAkGE,SAAoBA,EAAA/hE,EAAsBgiE,EAAsB,CAAhE,IAaChhE,EAAA,KAbmB,KAAK,MAALhB,EAAsB,KAAM,OAANgiE,EAjGlC,KAAA,YAAc,IAAI,IAClB,KAAA,mBAAqB,IAAI,IACzB,KAAU,WAAoB,CAAA,EAM9B,KAAS,UAAG,IACZ,KAAU,WAA2B,CAAA,EACrC,KAAoB,qBAAsC,CAAA,EAG1D,KAAuB,wBAAG,GAqFhC,KAAK,SAAWhiE,EAAM,QACtB,KAAK,QAAUA,EAAM,OACrB,KAAK,WAAaA,EAAM,UACxB,KAAK,WAAaA,EAAM,UACxB,KAAK,WAAaA,EAAM,UAEpBA,EAAM,WAAa,MACrB,OAAO,KAAKA,EAAM,SAAS,EAAE,QAAQ,SAAArD,EAAI,CACvCqE,EAAK,qBAAqBrE,CAAI,EAC1B,IAAIolE,EAAc/hE,EAAM,UAAUrD,CAAI,EAAGqE,CAAI,CACnD,CAAC,EA7FL,cAAA,eAAI+gE,EAAS,UAAA,YAAA,CAAb,IAAA,UAAA,CACE,OAAO,KAAK,OAAS,KAAK,OAAO,UAAY,KAAK,yCACnD,CAAA,EAED,OAAA,eAAIA,EAAmB,UAAA,sBAAA,CAAvB,IAAA,UAAA,CACE,OAAO,KAAK,OAAS,KAAK,OAAO,oBACZ,KAAK,mDAC3B,CAAA,EAED,OAAA,eAAIA,EAAS,UAAA,YAAA,CAAb,IAAA,UAAA,CACE,OAAO,KAAK,OAAS,KAAK,OAAO,UAAY,KAAK,YAGpD,IAAA,SAAc/D,EAA0B,CACtC,IAAMiE,EAAY,OAAO,KAAKjE,CAAS,EAAE,IACrC,SAAAr8D,EAAG,CAAI,OAAAq8D,EAAUr8D,CAAG,EAAE,IAAI,SAAA3D,EAAM,CAAI,OAAAA,EAAO,EAAE,CAAA,CAAtC,CAAuC,EAClD,KAAK,WAAa,CAAA,EAAG,OAAM,MAAT,CAAA,EAAE/B,GAAA,CAAA,EAAAJ,EAAWomE,CAAS,EAAA,EAAA,CAAA,EACxC,KAAK,WAAajE,gCANnB,CAAA,EAaD,OAAA,eAAI+D,EAAe,UAAA,kBAAA,CAAnB,IAAA,SAAoB1kE,EAAgC,CAClD,KAAK,iBAAmBA,gCACzB,CAAA,EAED,OAAA,eAAI0kE,EAAM,UAAA,SAAA,CAAV,IAAA,UAAA,CACE,OAAO,KAAK,QAAQ,IAAI,SAAA7kE,EAAI,CAC1B,MAAO,CACL,KAAMA,EAAK,KACX,MAAOA,EAAK,WAAW,MACnBA,EAAK,WAAW,MAAS,MACzB,OACJ,MAAOA,EAAK,WAAW,MACnBA,EAAK,WAAW,MAAS,MACzB,OAER,CAAC,gCACF,CAAA,EAED,OAAA,eAAI6kE,EAAO,UAAA,UAAA,CAAX,IAAA,UAAA,CACE,OAAO,KAAK,SAAS,IAAI,SAAA7kE,EAAI,CAC3B,MAAO,CACL,KAAMA,EAAK,KACX,MAAOA,EAAK,WAAW,MACnBA,EAAK,WAAW,MAAS,MACzB,OACJ,MAAOA,EAAK,WAAW,MACnBA,EAAK,WAAW,MAAS,MACzB,OAER,CAAC,gCACF,CAAA,EAED,OAAA,eAAI6kE,EAAU,UAAA,aAAA,CAAd,IAAA,UAAA,CACE,OAAO,KAAK,QAAQ,IAAI,SAAA7kE,EAAQ,CAAA,OAAAA,EAAK,cAAgBA,EAAK,IAA1B,CAA8B,gCAC/D,CAAA,EAED,OAAA,eAAI6kE,EAAW,UAAA,cAAA,CAAf,IAAA,UAAA,CACE,OAAO,KAAK,SAAS,IAAI,SAAC7kE,EAAI,CAC5B,IAAMP,EAAOO,EAAK,cAAgBA,EAAK,KACvC,OAAOA,EAAK,cAAiB,GAAG,OAAAP,EAAI,GAAA,EAAA,OAAIO,EAAK,aAAa,EAAMP,CAClE,CAAC,gCACF,CAAA,EAED,OAAA,eAAIolE,EAAS,UAAA,YAAA,CAAb,IAAA,UAAA,CAAA,IAKC/gE,EAAA,KAJC,OAAO,OAAO,KAAK,KAAK,UAAU,EAAE,OAAO,SAACH,EAAKc,EAAG,CAClD,OAAAd,EAAIc,CAAG,EAAIX,EAAK,WAAWW,CAAG,EAAE,UACzBd,GACN,CAAA,CAAoC,gCACxC,CAAA,EAyBOkhE,EAAA,UAAA,kBAAA,SAAkBzgE,EAAgBC,EAAe,CACvD,IAAM2gE,EAAe5gE,EAAO,IAAI,SAAApE,EAAI,CAAI,OAAAA,EAAK,IAAL,CAAS,EAAE,KAAI,EACjDilE,EAAgB5gE,EAAQ,IAAI,SAAArE,EAAI,CAAI,OAAAA,EAAK,IAAL,CAAS,EAAE,KAAI,EACzD,OAAOglE,EAAa,KAAK,KAAK,SAAS,EAAI,KACvCC,EAAc,KAAK,KAAK,SAAS,GAc/BJ,EAAA,UAAA,QAAA,SAAQzgE,EAAwBC,EAAe,CAErD,IAAM89D,EACFb,GAAqBl9D,EAAQC,EAAS,KAAK,UAAW,KAAK,UAAU,EAClEm9D,EAA0CW,EAAa,cAAxCV,EAA2BU,EAAa,YAA3BT,EAAcS,EAAa,WAC9D,GAAIV,GAAe,KACjB,MAAM,IAAI,MACN,qCAAA,OAAqCA,EAAY,KAAmB,eAAA,EACpE,mBAAmB,OAAAA,EAAY,GAAkB,gBAAA,EACjD,6DACA,oCAAoC,OAAAC,EAAa,GAAA,CAAA,EAGvD,GAAIF,EAAc,OAAS,EAAG,CAC5B,IAAM0D,EAAW7gE,EAAQ,IAAI,SAAAlG,EAAK,CAAA,OAAAA,EAAE,IAAF,CAAM,EAClCgnE,EAAU,OAAO,KAAK/gE,CAAM,EAClC,MAAM,IAAI,MACN,+BAAA,OAA+B8gE,EAAqC,6BAAA,EACpE,IAAA,OAAIC,EAAO,oCAAA,EAAA,OAAqC3D,EAAa,GAAA,CAAG,CACrE,CAED,IAAMuB,EAAeb,GAA2B,KAAK,MAAOC,CAAa,EACnEiD,EAAmBpB,GAAoBjB,CAAY,EACzD,MAAO,CAAC,aAAYA,EAAE,iBAAgBqC,CAAA,GAGhCP,EAAkB,UAAA,mBAAlB,SAAmB/jE,EAAc,CACvC,GAAIA,GAAU,KACZ,OAAO,KAET,IAAMqB,EAAQrB,EAAO,MAAK,EAI1B43D,OAAAA,GAAAA,KAAKv2D,CAAK,EACHA,GAGD0iE,EAAe,UAAA,gBAAf,SAAgB/7C,EAAiB,CAAjC,IAQPhlB,EAAA,KAPC,GAAI,CAACglB,EACH,OAAO,KAET,IAAMu8C,EAAev8C,EAAQ,IAAI,SAAAhoB,EAAM,CACrC,OAAOgD,EAAK,mBAAmBhD,CAAM,CACvC,CAAC,EACD,OAAOukE,GAGDR,EAAc,UAAA,eAAd,SAAe3jE,EAA2B,CAA1C,IAKP4C,EAAA,KAJC,OAAO,OAAO,YACV,OAAO,QAAQ5C,CAAU,EAAE,IAAI,SAACkL,EAAmB,CAAnB,IAAA8d,EAAAvrB,EAAAyN,EAAA,CAAA,EAAC3M,EAAIyqB,EAAA,CAAA,EAAEo7C,EAAWp7C,EAAA,CAAA,EAChD,MAAO,CAACzqB,EAAMqE,EAAK,gBAAgBwhE,CAAW,CAAC,EAChD,CAAC,GAYRT,EAAA,UAAA,QAAA,SAAQzgE,EAAwBC,EAAkB,CAAlD,IAuFCP,EAAA,KArFC,KAAK,2BAA0B,EAC/BM,EAAS,KAAK,UAAUA,CAAM,EAC9B,IAAMi9D,EAAQ,OAAO,KAAKj9D,CAAM,EAAE,KAAI,EACtC,KAAK,YAAYA,CAAM,EACvB,KAAK,uBAAuBA,CAAM,EAClCC,EAAU,KAAK,WAAWA,CAAO,EACjC,KAAK,aAAaA,CAAO,EACzB,IAAM+9D,EACFf,EAAM,IAAI,SAAA5hE,EAAI,CAAI,OAAAqE,EAAK,MAAM,MAAM1C,GAAc3B,CAAI,EAAE,CAAC,CAAC,CAAC,CAAA,EACxD8lE,EAAkBlhE,EAAQ,IAAI,SAAA5E,EAAQ,CAAA,OAAA2B,GAAc3B,CAAI,EAAE,CAAC,CAArB,CAAsB,EAC5D+lE,EAAoB,IAAI,IAAID,CAAe,EAC7CE,EAAcF,EAAgB,IAAI,SAAA9lE,EAAQ,CAAA,OAAAqE,EAAK,MAAM,MAAMrE,CAAI,CAAC,CAAA,EAEhEgmE,EAAY,SAAW,IACzBA,EAAc,KAAK,UAGrB,IAAMC,EAAiB,KAAK,kBAAkBtD,EAAYqD,CAAW,EAGjEE,EAAc,KAAK,YAAY,IAAID,CAAc,EACjDC,GAAe,OACjBA,EAAc,KAAK,QAAQvhE,EAAQqhE,CAAW,EAC9C,KAAK,YAAY,IAAIC,EAAgBC,CAAW,GAIlD,GAAI,CACF,KAAK,wBAA0BtpE,GAAAA,IAAG,EAAG,QAAQ,2BAA2B,CACzE,OAAQmB,EAAG,CACV,KAAK,wBAA0B,GAC/B,QAAQ,KAAKA,EAAE,OAAO,CACvB,CACD,IAAMujE,EAAiC,CAAA,EACjCC,EAA+B,CAAA,EAErC,OAAOtgD,GAAAA,KAAK,UAAA,SACJxgB,EAAU,IAAI2gE,GAChB/8D,EAAK,UAAWi9D,EAAgBC,EAChCl9D,EAAK,oBAAqBA,EAAK,kBAAkB,EAC/C5C,EAAkC,OAAA,OAAA,CAAA,EAAA4C,EAAK,SAAS,EAClDA,EAAK,0BACPA,EAAK,iBAAmBA,EAAK,eAAeA,EAAK,SAAS,GAG5D,OAAO,KAAKM,CAAM,EAAE,QAAQ,SAAA3E,EAAI,CACxB,IAAA2M,EAAAzN,EAAoByC,GAAc3B,EAAMS,CAAO,EAAC,CAAA,EAA/CmB,EAAQ+K,EAAA,CAAA,EAAExL,EAAKwL,EAAA,CAAA,EAChB0c,EAAoB,CAAA,EAC1BA,EAAQloB,CAAK,EAAIwD,EAAO3E,CAAI,EAC5ByB,EAAWG,CAAQ,EAAIynB,EACnBhlB,EAAK,0BACPA,EAAK,iBAAiBzC,CAAQ,EAAIyC,EAAK,gBAAgBglB,CAAO,EAElE,CAAC,EAED,IAAM88C,EAAgB9hE,EAAK,mBAAmB5C,CAAU,EACjD6hE,EAAkC4C,EAAW,aAA/BP,EAAoBO,EAAW,qBACpD,QAAmB/B,EAAAtlE,GAAAykE,CAAY,EAAAc,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAA5B,IAAM5jE,EAAI6jE,EAAA,MACb,GAAI,CAAA3iE,EAAWlB,EAAK,IAAI,EAGxB,KAAM8oB,EACFyuC,GAAUv3D,EAAMkB,EAAYhB,EAAS4D,EAAK,gBAAgB,EAE9D,GAAI9C,GAAAA,KAAK,UAAU8nB,CAAO,EACxB,MAAM,IAAI,MACN,4BAAA,OAA4B9oB,EAAK,GAA0B,wBAAA,EAC3D,0CAA0C,EAEhDkB,EAAWlB,EAAK,IAAI,EAAI8oB,EACpBhlB,EAAK,0BACPA,EAAK,iBAAiB9D,EAAK,IAAI,EAAI8D,EAAK,gBAAgBglB,CAAO,GAEjEhlB,EAAK,4CACD9D,EAAMkB,EAAYhB,EAAS0lE,EAAeJ,EAC1CJ,EAAiB,IAAIplE,EAAK,IAAI,CAAC,EACpC,mGAGD,OAAI8D,EAAK,QAAU,MACjB5D,EAAQ,QAAQ0lE,CAAa,EAGxBvhE,EAAQ,IAAI,SAAA5E,EAAI,CAAI,OAAAe,GAAUf,EAAMyB,EAAYhB,CAAO,CAAnC,CAAoC,CACjE,CAAC,GAGK2kE,EAAkB,UAAA,mBAAlB,SAAmB5kE,EAA0B,CACnD,IAAM4lE,EAAM,CAAA,EAAG,OAAO,MAClB,CAAA,EACA,OAAO,KAAK5lE,CAAS,EAChB,IAAI,SAAAwE,EAAO,CAAA,OAAAxE,EAAUwE,CAAG,CAAb,CAAc,EACzB,IAAI,SAAAqkB,EAAO,CAAI,OAAAA,EAAQ,IAAI,SAAAhoB,EAAM,CAAI,OAAAA,EAAO,EAAP,CAAS,CAA/B,CAAgC,CAAC,EACzD,OAAO,IAAI,IAAI+kE,CAAG,GAGZhB,EAAA,UAAA,uBAAA,SACJxjE,EAAkBrB,EAAYC,EAC9BC,EAA2B0lE,EAC3BJ,EACAM,EAAwD,iBAG1D,GAAI,EAAAhE,GAAc9hE,CAAI,GAAKwlE,EAAkB,IAAInkE,CAAQ,QAIzD,QAAqB8uB,EAAA7xB,GAAA2B,EAAUoB,CAAQ,CAAC,EAAA4oB,EAAAkG,EAAA,KAAA,EAAE,CAAAlG,EAAA,KAAAA,EAAAkG,EAAA,KAAA,EAAA,CAArC,IAAMrvB,EAAMmpB,EAAA,MACXnpB,GAAU,OAGdglE,EAAgChlE,EAAO,EAAE,GACpCglE,EAAgChlE,EAAO,EAAE,GAAK,GAC/Cd,EAAK,SAAS,OACnB,uGAED,QAAoB+lE,EAAAznE,GAAA0B,EAAK,MAAM,EAAAgmE,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAA5B,IAAM7gE,EAAK8gE,EAAA,MAGd,GAAI,CAAAlE,GAAc58D,CAAK,EAIvB,KAAM4jB,EACFtnB,GAA4B0D,EAAM,KAAMjF,EAAWC,CAAO,EAC9D,GAAI4oB,GAAW,SAIf,QAAqBm9C,GAAA7C,EAAA,OAAA9kE,GAAAwqB,CAAO,GAAAo9C,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAAzB,IAAMnlE,EAAMolE,EAAA,MACf,GAAI,GAACplE,GAAUA,EAAO,MAAQ8kE,EAAc,IAAI9kE,EAAO,EAAE,GAQzD,KAAM2wC,EAAQq0B,EAAgChlE,EAAO,EAAE,EACnD2wC,IAAU,GACZ3wC,EAAO,QAAO,EACd,OAAOglE,EAAgChlE,EAAO,EAAE,GACvC2wC,GAAS,MAClBq0B,EAAgChlE,EAAO,EAAE,IAE5C,oGACF,sGAGK+jE,EAAA,UAAA,4CAAA,SACJ7kE,EAAYC,EAA4BC,EACxC0lE,EAA4BJ,EAC5BW,EAAuB,aACzB,SAASC,EAAoBpmE,EAAU,CAGrC,OAAO8hE,GAAc9hE,CAAI,GAAKwlE,EAAkB,IAAIxlE,EAAK,IAAI,EAG/D,GAAI,EAAA8hE,GAAc9hE,CAAI,GAAKmmE,GAAkB,UAI7C,QAA4BE,EAAA/nE,GAAA6nE,CAAc,EAAAG,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAAvC,IAAME,EAAaD,EAAA,MACtB,GAAI,CAAAF,EAAoBG,CAAa,EAGrC,KAAMz9C,EAAUtnB,GACZ+kE,EAAc,KAAMtmE,EAAWC,CAAO,MAC1C,QAAqBsmE,GAAA1C,EAAA,OAAAxlE,GAAAwqB,CAAO,GAAA29C,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAAzB,IAAM1lE,EAAM2lE,EAAA,MACX,CAAC3lE,GAAUA,EAAO,MAAQ8kE,EAAc,IAAI9kE,EAAO,EAAE,GAGzDA,EAAO,QAAO,CACf,oGACF,qGAYG+jE,EAAA,UAAA,aAAN,SAAmBzgE,EAAwBC,EAAkB,oEAE3D,MAAO,CAAA,EAAA,KAAK,cAAcD,EAAQC,CAAO,CAAC,KAC3C,EAEDwgE,EAAA,UAAA,2BAAA,UAAA,CACO,KAAK,mBAGV,OAAO,OAAO,KAAK,gBAAgB,EAAE,QAAQ,SAAAS,EAAW,aACtD,QAAqBoB,EAAApoE,GAAAgnE,CAAW,EAAAqB,EAAAD,EAAA,KAAA,EAAE,CAAAC,EAAA,KAAAA,EAAAD,EAAA,KAAA,EAAA,CAA7B,IAAM5lE,EAAM6lE,EAAA,MACX7lE,GAAU,CAACA,EAAO,YACpBA,EAAO,QAAO,CAEjB,mGACH,CAAC,EAED,KAAK,iBAAmB,OAG1B+jE,EAAA,UAAA,uBAAA,UAAA,CACE,OAAO,KAAK,kBAiBAA,EAAa,UAAA,cAAnB,SACJzgE,EAAwBC,EAAoBuiE,EAC5C7F,EACAC,EAAiC,CAFW,OAAA4F,IAAA,SAAAA,EAA2B,IACvE7F,IAAA,SAAAA,EAAmC,CAAA,GACnCC,IAAA,SAAAA,EAAiC,CAAA,sGAEnC,KAAK,2BAA0B,EAC1B4F,IACHxiE,EAAS,KAAK,UAAUA,CAAM,EAC9B,KAAK,YAAYA,CAAM,EACvB,KAAK,uBAAuBA,CAAM,EAClCC,EAAU,KAAK,WAAWA,CAAO,EACjC,KAAK,aAAaA,CAAO,GAI3B,GAAI,CACF,KAAK,wBAA0BhI,GAAAA,IAAG,EAAG,QAAQ,2BAA2B,CACzE,OAAQmB,EAAG,CACV,KAAK,wBAA0B,GAC/B,QAAQ,KAAKA,EAAE,OAAO,CACvB,CAEK,OAAA0C,EAAU,IAAI2gE,GAChB,KAAK,UAAWE,EAAgBC,EAAe,KAAK,oBACpD,KAAK,kBAAkB,EAEvB,KAAK,0BACP,KAAK,iBAAmB,KAAK,eAAe,KAAK,SAAS,GAMzC,CAAA,EAAM,KAAK,uBAC1B58D,EAAQlE,EAASmE,EAASuiE,CAAmB,CAAC,SAD5C,OAAA1lE,EAAakL,EAC+B,KAAA,EAC5Cy6D,EAAUxiE,EAAQ,IAAI,SAAA5E,EAAI,CAAI,OAAAe,GAAUf,EAAMyB,EAAYhB,CAAO,CAAnC,CAAoC,EAGlE4mE,EAAYD,EAAQ,IAAI,SAAA/oE,EAAK,CAAA,OAAAA,EAAE,EAAF,CAAI,EACjCipE,EAAW,OAAO,KAAK3iE,CAAM,EAAE,IAAI,SAAA3E,EAAQ,CAAA,OAAA2E,EAAO3E,CAAI,EAAE,EAAE,CAAA,EAC1Dk5D,EACF,IAAI,IAAG55D,GAAAA,GAAAA,GAAA,CAAA,EAAAJ,EAAamoE,CAAS,EAAA,EAAA,EAAAnoE,EAAKooE,CAAQ,EAAA,EAAA,EAAApoE,EAAK,KAAK,SAAS,EAAA,EAAA,CAAA,EAEjE,OAAO,OAAOuC,CAAU,EAAE,QAAQ,SAAAokE,EAAW,CAC3CA,EAAY,QAAQ,SAAAxkE,EAAM,CACpBA,GAAU,CAACA,EAAO,YAAc,CAAC63D,EAAQ,IAAI73D,EAAO,EAAE,GACxDA,EAAO,QAAO,CAElB,CAAC,CACH,CAAC,EAGG,KAAK,QAAU,MACjBZ,EAAQ,QAAQy4D,CAAO,EAGzB,CAAA,EAAOkO,CAAO,MACf,EAEKhC,EAAA,UAAA,qBAAN,SACIzgE,EAAkB28D,EAClBC,EAA4B,iFACxB,OAAAgG,EAAe5iE,EAAO,OAAO,SAACT,EAAK7C,EAAQF,EAAK,CACpD,OAAA+C,EAAIG,EAAK,OAAOlD,CAAK,EAAE,IAAI,EAAIE,EACxB6C,GACN,CAAA,CAAoB,EAEvB,CAAA,EAAO,KAAK,cACRqjE,EAAc,KAAK,YAAa,GAAMjG,EAAgBC,CAAa,CAAC,KACzE,EAaa6D,EAAsB,UAAA,uBAA5B,SACJzgE,EAAwBlE,EAA2B+mE,EACnDL,EAA6B,0IACzBvF,EAAQ,OAAO,KAAKj9D,CAAM,EAC1Bg+D,EACFf,EAAM,IAAI,SAAA5hE,EAAQ,CAAA,OAAAqE,EAAK,MAAM,MAAM1C,GAAc3B,CAAI,EAAE,CAAC,CAAC,CAAC,CAAA,EACxD8lE,EAAkB0B,EAAY,IAAI,SAAAxnE,EAAQ,CAAA,OAAA2B,GAAc3B,CAAI,EAAE,CAAC,CAArB,CAAsB,EAChE+lE,EAAoB,IAAI,IAAID,CAAe,EAC7CE,EAAcF,EAAgB,IAAI,SAAA9lE,EAAI,CAAI,OAAAqE,EAAK,MAAM,MAAMrE,CAAI,CAArB,CAAsB,EAGhEgmE,EAAY,SAAW,IACzBA,EAAc,KAAK,UAGfr5D,EACFk1D,GACIl9D,EAAQqhE,EAAa,KAAK,UAAW,KAAK,UAAU,EAFrDlE,EAASn1D,EAAA,UAAEo1D,EAAap1D,EAAA,cAAEq1D,EAAWr1D,EAAA,YAAEs1D,EAAUt1D,EAAA,WAKlD4tC,EAA4Bj7C,GAAAA,GAAAA,GAAA,CAAA,EAAAJ,EAC7ByjE,CAAU,EAAA,EAAA,EAAAzjE,EAAK,KAAK,MAAM,OAAO,EAAA,EAAA,EAAAA,EAAM,KAAK,YAAc,CAAA,CAAE,EAC/D,EAAA,EAAA,IAAI,SAAAqB,EAAI,CACR,MAAO,CAAC,KAAIA,EAAE,SAAUE,EAAQ,cAAc,CAChD,CAAC,EACKgB,EAAkC,OAAA,OAAA,CAAA,EAAA,KAAK,SAAS,EACtD,OAAO,KAAKkD,CAAM,EAAE,QAAQ,SAAA3E,EAAI,CACxB,IAAA2M,EAAAzN,EAAoByC,GAAc3B,CAAI,EAAC,CAAA,EAAtC4B,EAAQ+K,EAAA,CAAA,EAAExL,EAAKwL,EAAA,CAAA,EAChB0c,EAAoB,CAAA,EAC1BA,EAAQloB,CAAK,EAAIwD,EAAO3E,CAAI,EAC5ByB,EAAWG,CAAQ,EAAIynB,CACzB,CAAC,EACKg9C,EAA2D,CAAA,EAC3DF,EAAgB,KAAK,mBAAmB1kE,CAAU,EAClDgmE,EAAkC,CAAA,mBACjC,OAAAltB,EAAM,OAAS,GACdmtB,EAAW,KAAK,aAClB/E,EAAYpoB,EAAO95C,EAASgB,EAAYgmE,EAAOtB,EAC/CJ,EAAmBM,EAAiCvE,CAAS,EACjE,CAAA,EAAM,QAAQ,IAAI4F,CAAQ,CAAC,GAJN,CAAA,EAAA,CAAA,SAIrB,OAAAj9C,EAAA,KAAA,eAaF,GAXIu3C,GAAe,MAAQ,CAACmF,GAC1B,QAAQ,KACJ,iIACgE,EAEhEQ,EACF3B,EACK,OACG,SAAAzlE,EAAI,CAAI,MAAA,CAAC8hE,GAAc9hE,CAAI,GACvB,CAACQ,GAAUR,EAAK,KAAMkB,EAAYhB,CAAO,CADrC,CACsC,EACjD,IAAI,SAAAF,EAAQ,CAAA,OAAAA,EAAK,IAAI,CAAA,EAC1BonE,EAAe,OAAS,EACtB,MAAAC,EAAiB,GACjB5F,GAAe,OACjB4F,EACI,gEACA,2BAA2B,OAAA3F,EAAU,GAAA,GAErC,IAAI,MACN,+BAAA,OAA+B0F,EAAoC,sBAAA,EACnE,WAAA,OAAW/F,EAAmD,8CAAA,EAC9D,IAAA,OAAIG,EAAa,KAAA,EAAA,OAAM6F,CAAc,CAAE,EAE7C,MAAA,CAAA,EAAOnmE,CAAU,MAClB,EAEO2jE,EAAA,UAAA,aAAA,SACJzC,EAAoBpoB,EAA2B95C,EAC/CD,EAA4BinE,EAC5BtB,EAA4BJ,EAC5BM,EACAvE,EAAsB,CAExB,QAoDDz9D,EAAA,KArDOqjE,EAAqC,CAAA,uBAEnCl+C,EAAO+wB,EAAM,IAAG,EACtB95C,EAAQ,eAAiB+oB,EAAK,SAC9B,IAAI5nB,EAAW,GAWf,GAPI4nB,EAAK,KAAK,KAAO,SACjBnpB,EAAc,aAAcmpB,EAAK,KAAMhpB,EAAWC,CAAO,IAC3DkM,EAAAzN,EAAa8C,GAAoBwnB,EAAK,KAAK,KAAM/oB,CAAO,EAAC,CAAA,EAAxDmB,EAAQ+K,EAAA,CAAA,GAKPnM,EAAUgpB,EAAK,KAAK,IAAI,GAAK,KAAM,CACrC,IAAMH,EACFyuC,GAAUtuC,EAAK,KAAMhpB,EAAWC,EAASonE,EAAK,gBAAgB,EAC7DjmE,IACH6oB,EAAAvrB,EAAa8C,GAAoBwnB,EAAK,KAAK,KAAM/oB,CAAO,EAAC,CAAA,EAAxDmB,EAAQ6oB,EAAA,CAAA,GAEX,IAAMq9C,EAAiBrnE,EAAQ,eAC3Bc,GAAAA,KAAK,UAAU8nB,CAAO,EACxBq+C,EAAS,KAAKr+C,EAAQ,KAAK,SAAAhrB,EAAC,CAC1B,OAAAmC,EAAUoB,CAAQ,EAAIvD,EAClBgG,EAAK,0BACPA,EAAK,iBAAiBzC,CAAQ,EAAIyC,EAAK,gBAAgBhG,CAAC,GAE1DoC,EAAQ,eAAiBqnE,EACzBzjE,EAAK,uBACDzC,EAAU4nB,EAAK,KAAMhpB,EAAWC,EAAS0lE,EACzCJ,EAAmBM,CAA+B,EACtDhiE,EAAK,kBACDmlB,EAAK,KAAM+wB,EAAO95C,EAASD,EAAWinE,EAAO3F,CAAS,EACnDzjE,EACR,CAAC,GAEFmC,EAAUoB,CAAQ,EAAIynB,EAClBw+C,EAAK,0BACPA,EAAK,iBAAiBjmE,CAAQ,EAAIimE,EAAK,gBAAgBx+C,CAAO,GAEhEw+C,EAAK,uBACDjmE,EAAU4nB,EAAK,KAAMhpB,EAAWC,EAAS0lE,EACzCJ,EAAmBM,CAA+B,EACtDwB,EAAK,kBACDr+C,EAAK,KAAM+wB,EAAO95C,EAASD,EAAWinE,EAAO3F,CAAS,EAE7D,MACC+F,EAAK,kBACDr+C,EAAK,KAAM+wB,EAAO95C,EAASD,EAAWinE,EAAO3F,CAAS,UAhDvDvnB,EAAM,OAAS,OAmDtB,OAAOmtB,GAGDtC,EAAA,UAAA,kBAAA,SACJ7kE,EAAYg6C,EAA2B95C,EACvCD,EAA4BinE,EAC5B3F,EAAsB,CACxBvhE,EAAK,SAAS,QAAQ,SAACwnE,EAAS,CACxB,IAAAp7D,EAAAzN,EAAe8C,GAAoB+lE,EAAU,KAAMtnE,CAAO,EAAC,CAAA,EAA1DmB,EAAQ+K,EAAA,CAAA,EACX86D,EAAM7lE,CAAQ,GAAK,CAACkgE,EAAU,IAAIiG,EAAU,IAAI,IAIhDA,EAAU,KAAO,QACfA,EAAU,WAAW,KAAK,SAAA/nE,EAAI,CAC5B,MAAO,CAAC,CAACe,GAAUf,EAAMQ,EAAWC,CAAO,CAC7C,CAAC,IACHgnE,EAAM7lE,CAAQ,EAAI,GAClB24C,EAAM,KAAK,CAAC,SAAU95C,EAAQ,eAAgB,KAAMsnE,CAAS,CAAC,GAG1DA,EAAU,WAAW,MAAM,SAAA/nE,EAAI,CAC7B,MAAO,CAAC,CAACe,GAAUf,EAAMQ,EAAWC,CAAO,CAC7C,CAAC,IACPgnE,EAAM7lE,CAAQ,EAAI,GAClB24C,EAAM,KAAK,CAAC,SAAU95C,EAAQ,eAAgB,KAAMsnE,CAAS,CAAC,GAElE,CAAC,GAMH3C,EAAA,UAAA,QAAA,UAAA,CAAA,IAIC/gE,EAAA,KAHC,OAAO,KAAK,KAAK,SAAS,EACrB,QACG,SAAAW,EAAG,CAAI,OAAAX,EAAK,UAAUW,CAAG,EAAE,QAAQ,SAAA3D,EAAU,CAAA,OAAAA,EAAO,QAAO,CAAd,CAAgB,CAAC,CAAA,GAGhE+jE,EAAsB,UAAA,uBAAtB,SAAuBzgE,EAAsB,CAA7C,IAwBPN,EAAA,KAvBC,OAAO,KAAKM,CAAM,EAAE,QAAQ,SAAA3E,EAAI,CAC9B,IAAMyF,EAAQd,EAAO3E,CAAI,EACnB2M,EAAAzN,EAAeyC,GAAc3B,CAAI,EAAC,CAAA,EAAjC4B,EAAQ+K,EAAA,CAAA,EACTpM,EAAO8D,EAAK,MAAM,MAAMzC,CAAQ,EACtC,GAAIrB,EAAK,WAAW,OAAYA,EAAK,WAAW,MAAS,MAAO,CAC9D,IAAMynE,EAAQznE,EAAK,WAAW,MAAS,MACjC0nE,EAAQD,EAAM,SAAWviE,EAAM,MAAM,QACvCA,EAAM,MAAM,MACR,SAAC8B,EAAKpG,EAAK,CAAK,OAAA6mE,EAAM7mE,CAAK,IAAM,IAAM6mE,EAAM7mE,CAAK,IAAMoG,CAAG,CAAA,EACnEhG,GAAAA,KAAK,OACD0mE,EACA,UAAM,CAAA,MAAA,sBAAsB,OAAA1nE,EAAK,KAAqB,iBAAA,EAClD,gCAAA,OAAgCynE,EAAkB,aAAA,EAClD,IAAA,OAAIviE,EAAM,MAAK,GAAA,CAFb,CAEgB,CAC3B,CACGlF,EAAK,WAAW,OAAYA,EAAK,WAAW,MAAS,OACvDgB,GAAAA,KAAK,OACDkE,EAAM,QAAUlF,EAAK,WAAW,MAAS,MACzC,UAAA,CAAM,MAAA,sBAAsB,OAAAA,EAAK,KAAqB,iBAAA,EAClD,+BACA,GAAA,OAAGA,EAAK,WAAW,MAAS,MAAkB,YAAA,EAAA,OAAAkF,EAAM,KAAK,CAFvD,CAEyD,CAEvE,CAAC,GAGK2/D,EAAS,UAAA,UAAT,SAAUzgE,EAAsB,SAChC1G,EAAyB,CAAA,EAC/B,QAAWgE,KAAa0C,EAAQ,CAC9B,IAAMtD,GAASK,GAAAN,EAAA,KAAK,cAAU,MAAAA,IAAA,OAAA,OAAAA,EAAG,UAAM,MAAAM,IAAA,OAAA,OAAAA,EAAIO,CAAS,EAChDZ,GAAU,KACZpD,EAAOoD,EAAO,IAAI,EAAIsD,EAAO1C,CAAS,EAEtChE,EAAOgE,CAAS,EAAI0C,EAAO1C,CAAS,CAEvC,CACD,OAAOhE,GAGDmnE,EAAW,UAAA,YAAX,SAAYzgE,EAAsB,CAAlC,IAUPN,EAAA,KATO6jE,EAAa,OAAO,KAAKvjE,CAAM,EAAE,OAAO,SAAA3E,EAAI,CAC1C,IAAA2M,EAAAzN,EAAayC,GAAc3B,CAAI,EAAC,CAAA,EAA/B4B,EAAQ+K,EAAA,CAAA,EACf,OAAOtI,EAAK,MAAM,MAAMzC,CAAQ,GAAK,IACvC,CAAC,EACD,GAAIsmE,EAAW,OAAS,EACtB,MAAM,IAAI,MACN,gDACA,UAAU,OAAAA,EAAwC,8BAAA,CAAA,GAIlD9C,EAAU,UAAA,WAAV,SAAWxgE,EAAiB,CAA5B,IAQPP,EAAA,KAPC,OAAOO,EAAQ,IAAI,SAAA5E,EAAI,SACfqB,GAASK,GAAAN,EAAAiD,EAAK,cAAU,MAAAjD,IAAA,OAAA,OAAAA,EAAG,WAAO,MAAAM,IAAA,OAAA,OAAAA,EAAI1B,CAAI,EAChD,OAAIqB,GAAU,KACLA,EAAO,KAETrB,GACN,CAAA,CAAE,GAGColE,EAAY,UAAA,aAAZ,SAAaxgE,EAAiB,CAA9B,IAOPP,EAAA,KANCO,EAAQ,QAAQ,SAAA5E,EAAI,CACZ,IAAA2M,EAAAzN,EAAmByC,GAAc3B,CAAI,EAAC,CAAA,EAArCmoE,EAAcx7D,EAAA,CAAA,EACrB,GAAI,CAACtI,EAAK,MAAM,MAAM8jE,CAAc,EAClC,MAAM,IAAI,MAAM,eAAA,OAAenoE,EAAI,6BAAA,CAA6B,CAEpE,CAAC,GAEJolE,CAAA,GAAA,EC9uBDgD,IAAA,UAAA,CACE,SACaA,EAAAC,EACAC,EAA+B,CAD/BD,IAAA,SAAAA,EAA0C,CAAA,GAC1CC,IAAA,SAAAA,EAA+B,CAAA,GAD/B,KAAqB,sBAArBD,EACA,KAAY,aAAZC,EAWb,OAAAF,EAAA,UAAA,aAAA,SAAapoE,EAAcsD,EAAoB,CAC7C,KAAK,sBAAsBtD,CAAI,EAAIsD,EAAU,OAC7C,KAAK,aAAaA,EAAU,EAAE,EAAIA,GAQpC8kE,EAAwB,UAAA,yBAAxB,SAAyBpoE,EAAY,CACnC,OAAO,KAAK,sBAAsBA,CAAI,GAOxCooE,EAAgB,UAAA,iBAAhB,SAAiB9jD,EAAU,CACzB,OAAO,KAAK,aAAaA,CAAE,GAM7B8jD,EAAA,UAAA,QAAA,UAAA,CACE,QAAWpjE,KAAO,KAAK,aACrB,KAAK,aAAaA,CAAG,EAAE,cAAa,EACpC,OAAO,KAAK,aAAaA,CAAG,EAG9B,QAAWhF,KAAQ,KAAK,sBACtB,KAAK,sBAAsBA,CAAI,EAAE,QAAO,EACxC,OAAO,KAAK,sBAAsBA,CAAI,GAG3CooE,CAAA,GAAA,EClDM,IAAMG,GAAkD,CAC7D,QAAW,EACX,QAAW,EACX,MAAS,EACT,OAAU,EACV,MAAS,EACT,KAAQ,EACR,UAAa,GCGTC,GAA0B,EA+HhC,SAAeC,GACbC,EACA9zC,EAA2D,+GAKvD,OAFE5rB,EAAOD,GAAc2/D,EAAK,KAAK,EAEjC,iBAAkBA,GACdC,EAAeD,EAAK,aAC1BE,EAAgBL,GAAqBI,EAAa,KAAK,SAF/B,CAAA,EAAA,CAAA,SAGf,GAAAD,EAAK,QAAU,SAAf,MAAuB,CAAA,EAAA,CAAA,EAE5BG,EAAa,EACR5pE,EAAI,0BAAGA,EAAI+J,GAClB5H,EAAAynE,EAAcnnE,EAAA8mE,KAA8B,YAAW,KAC/C,CAAA,EAAA5zC,EAAMi0C,EAAYA,EAAaL,EAAuB,CAAC,GAFzC,CAAA,EAAA,CAAA,SACtBK,EAAAznE,GAAcM,EAA0B,IAAAiL,EAAA,MAAI,YAAW,CAAA,OACrD8d,EAA6D,KAAA,CAAA,CAAA,GAAA,EAAE,CAAC,oBAF1C,OAAAxrB,UAI1B,IAAA,GAAA,MAAA,CAAA,EAAO4pE,CAAU,SAEjBD,EAAgBL,GAAqBG,EAAK,KAAK,mBAGjD,MAAO,CAAA,EAAA1/D,EAAO4/D,CAAa,MAC5B,CAED,SAASE,GACPJ,EACAK,EAAuB,CAEvB,IAAM/oE,EAAO0oE,EAAK,KACZxgE,EAAQwgE,EAAK,MACbphE,EAAQohE,EAAK,MACb1/D,EAAOD,GAAczB,CAAK,EAC5BW,EACAkD,EAAS,EAEb,GAAI,iBAAkBu9D,EAAM,CAC1B,IAAMC,EAAeD,EAAK,aAC1B,GAAIC,EAAa,QAAU,SAAWA,EAAa,QAAU,UAC3D,GAAI,EAAE,QAASA,GAAgB,UAAWA,GACxC,MAAM,IAAI,MACN,UAAU,OAAAD,EAAK,KAA0B,qBAAA,EAAA,OAAAC,EAAa,MAAQ,GAAA,EAC9D,oDAAoD,UAEjDA,EAAa,QAAU,WAChC,GAAIzgE,IAAU,UACZ,MAAM,IAAI,MACN,UAAU,OAAAwgE,EAAK,KAA0B,qBAAA,EAAA,OAAAC,EAAa,MAAQ,GAAA,EAC9D,mDAAmD,OAAAzgE,EAAQ,GAAA,CAAA,MAGjE,OAAM,IAAI,MACN,UAAA,OAAUwgE,EAAK,KAAmB,eAAA,EAClC,sBAAsB,OAAAC,EAAa,MAAS,IAAA,EAC5C,sEACmC,EAEzC,IAAMK,EAAyBT,GAAqBI,EAAa,KAAK,EAChEM,EAAkBN,EAAa,QAAU,QAC7C,IAAI,WAAWI,CAAU,EACzB,IAAI,YAAYA,CAAU,EAC5B,GAAI7gE,IAAU,UACZ,GAAIygE,EAAa,QAAU,SAAWA,EAAa,QAAU,SAAU,CACrE1gE,EAAS,IAAI,aAAaghE,EAAe,MAAM,EAC/C,QAAShqE,EAAI,EAAGA,EAAIgqE,EAAe,OAAQhqE,IAAK,CAC9C,IAAMN,EAAIsqE,EAAehqE,CAAC,EAC1BgJ,EAAOhJ,CAAC,EAAIN,EAAIgqE,EAAa,MAAQA,EAAa,GACnD,CACF,SAAUA,EAAa,QAAU,UAAW,CAE3C,IAAMO,EAAgBC,GAAiB,EACvClhE,EAASihE,EAAcD,CAA6B,CACrD,KACC,OAAM,IAAI,MACR,iCAAA,OAAiCN,EAAa,MAAQ,GAAA,EACtD,0BAA0B,UAErBzgE,IAAU,QAAS,CAC5B,GAAIygE,EAAa,QAAU,SAAWA,EAAa,QAAU,SAC3D,MAAM,IAAI,MACR,iCAAA,OAAiCA,EAAa,MAAQ,GAAA,EACtD,wBAAwB,EAE5B1gE,EAAS,IAAI,WAAWghE,EAAe,MAAM,EAC7C,QAAShqE,EAAI,EAAGA,EAAIgqE,EAAe,OAAQhqE,IAAK,CAC9C,IAAMN,EAAIsqE,EAAehqE,CAAC,EAC1BgJ,EAAOhJ,CAAC,EAAI,KAAK,MAAMN,EAAIgqE,EAAa,MAAQA,EAAa,GAAG,CACjE,CACF,KACC,OAAM,IAAI,MAAM,gCAAA,OAAgC3oE,EAAU,KAAA,EAAA,OAAAkI,CAAK,CAAE,EAEnEiD,GAAUnC,EAAOggE,CAClB,SAAU9gE,IAAU,SAAU,CAC7B,IAAMi3D,EAAOp2D,GAAc2/D,EAAK,KAAK,EACrCzgE,EAAS,CAAA,EACT,QAAShJ,EAAI,EAAGA,EAAIkgE,EAAMlgE,IAAK,CAC7B,IAAM4pE,EAAa,IAAI,YACrBE,EAAW,MAAM59D,EAAQA,EAASq9D,EAAuB,CAAC,EAAE,CAAC,EAC/Dr9D,GAAUq9D,GACV,IAAM/9D,EAAQ,IAAI,WAChBs+D,EAAW,MAAM59D,EAAQA,EAAS09D,CAAU,CAAC,EAC9C5gE,EAAwB,KAAKwC,CAAK,EACnCU,GAAU09D,CACX,CACF,KAAM,CACL,IAAMO,EAAcb,GAAqBrgE,CAAK,EAC9C,GAAIA,IAAU,UACZD,EAAS,IAAI,aAAa8gE,CAAU,UAC3B7gE,IAAU,QACnBD,EAAS,IAAI,WAAW8gE,CAAU,UACzB7gE,IAAU,OACnBD,EAAS,IAAI,WAAW8gE,CAAU,UACzB7gE,IAAU,YAAa,CAChCD,EAAS,IAAI,aAAa8gE,CAAU,EAGpC,QAFM9vC,EAAO,IAAI,aAAahxB,EAAO,OAAS,CAAC,EACzC1E,EAAQ,IAAI,aAAa0E,EAAO,OAAS,CAAC,EACvChJ,EAAI,EAAGA,EAAIg6B,EAAK,OAAQh6B,IAC/Bg6B,EAAKh6B,CAAC,EAAIgJ,EAAOhJ,EAAI,CAAC,EACtBsE,EAAMtE,CAAC,EAAIgJ,EAAOhJ,EAAI,EAAI,CAAC,EAE7B,IAAMoqE,EAAahoE,GAAO43B,EAAM3xB,EAAO,SAAS,EAC1CgiE,EAAcjoE,GAAOkC,EAAO+D,EAAO,SAAS,EAC5CiiE,EAAgBjwC,GAAQ+vC,EAAYC,CAAW,EACrD,OAAAD,EAAW,QAAO,EAClBC,EAAY,QAAO,EACZC,CACR,KACC,OAAM,IAAI,MAAM,gCAAA,OAAgCvpE,EAAU,KAAA,EAAA,OAAAkI,CAAK,CAAE,EAEnEiD,GAAUnC,EAAOogE,CAClB,CACD,OAAO/nE,GAAO4G,EAAQX,EAAOY,CAAK,CACpC,CAEA,SAAeshE,GAAaC,EACAC,EACAtQ,EAAc,2GACpC93D,EAAO,IAAI,WAAWooE,CAAW,mBAE9B,OAAApoE,EAAK,WAAa83D,EACD,CAAA,EAAMqQ,EAAO,KAAI,CAAE,EADZ,CAAA,EAAA,CAAA,SAE7B,GADMroE,EAAgBM,EAAA,KAAA,EAAf8W,EAAIpX,EAAA,KAAE1D,EAAK0D,EAAA,MACdoX,GAAQ9a,GAAS,KACb,MAAAisE,EAAWvQ,EAAS93D,EAAK,WACzB,IAAI,MAAM,sBAAA,OAAsBqoE,EAAO,2BAAA,CAA2B,EAIpE,OAAAC,EAAU,IAAI,WAAWtoE,EAAK,OAAS5D,EAAM,UAAU,EAC7DksE,EAAQ,IAAItoE,EAAM,CAAC,EACnBsoE,EAAQ,IAAI,IAAI,WAAWlsE,CAAK,EAAG4D,EAAK,MAAM,EAC9CA,EAAOsoE,eAGT,MAAO,CAAA,EAAAtoE,EAAK,MAAM,MACnB,CAEqB,SAAAuoE,GACpBC,EACAC,EAA6B,gIAEvB1gD,EAA0B,CAAA,EAC1BogD,EAASK,EAAa,UAAS,EACjCxoE,EAAO,IAAI,YAAY,CAAC,0CAET0oE,EAAAnrE,GAAAkrE,CAAK,EAAAE,EAAAD,EAAA,KAAA,wCAAbtB,EAAIuB,EAAA,MACM,CAAA,EAAMxB,GAAyBC,EACA,SAAO9nE,EAAOC,EAAG,CAAA,OAAAzD,GAAAiH,EAAA,OAAA,OAAA,UAAA,mDAC1D,MAAM,CAAA,EAAAmlE,GAAaC,EAAQnoE,EAAMT,CAAG,CAAC,SAA5C,OAAAS,EAAOF,EAAA,KAAA,EACA,CAAA,EAAAE,EAAK,MAAMV,EAAOC,CAAG,CAAC,IAC9B,CAAA,CAAA,CAAA,CAAC,UAJI,OAAAgoE,EAAannE,EAIjB,KAAA,EACW,CAAA,EAAA8nE,GAAaC,EAAQnoE,EAAMunE,CAAU,CAAC,SAAnDvnE,EAAOI,EAAA,KAAA,EAGDwoE,EAAa5oE,EAAK,MAAM,EAAGunE,CAAU,EAC3CvnE,EAAOA,EAAK,MAAMunE,CAAU,EAEtBsB,EAAerB,GAAaJ,EAAMwB,CAAU,EAClD7gD,EAAQq/C,EAAK,IAAI,EAAIyB,EAIjB7rB,GAAU,IAAO,WACbthD,EAAI0b,GAAO,EAEb,gBAAiB1b,GACnB+L,GAAcohE,EAAa,KAAK,GAAMvtE,GAAG,EACtC,IAAI,mCAAmC,GACzCI,EAAE,YAAyCmtE,EAAa,MAAM,8LAKrE,IAAA,GAAA,MAAA,CAAA,EAAO9gD,CAAO,MACf,CAoSD,SAAS+gD,IAA0B,CACjC,IAAMC,EAAkB,SAACprE,EAAS,CAIhC,QAHID,EAAIC,GAAK,GACTlB,EAAI,GAEAiB,EAAI,WAAgB,GAC1BjB,GAAK,QACLiB,IAAM,EAER,OAAAA,GAAK,SACLjB,GAAK,UAEEiB,EAAIjB,CACb,EAEMusE,EAAe,IAAI,YAAY,IAAI,EAEzCA,EAAa,CAAC,EAAI,EAClB,QAASrrE,EAAI,EAAGA,EAAI,KAAMA,IACxBqrE,EAAarrE,CAAC,EAAIorE,EAAgBprE,CAAC,EAErC,QAASA,EAAI,KAAMA,EAAI,KAAMA,IAC3BqrE,EAAarrE,CAAC,EAAI,WAAeA,EAAI,MAAS,IAGhD,OAAOqrE,CACT,CAQA,SAASC,IAA2B,CAClC,IAAMC,EAAgB,IAAI,YAAY,EAAE,EAExCA,EAAc,CAAC,EAAI,EACnBA,EAAc,EAAE,EAAI,WACpBA,EAAc,EAAE,EAAI,WACpBA,EAAc,EAAE,EAAI,WACpB,QAASvrE,EAAI,EAAGA,EAAI,GAAIA,IACtBurE,EAAcvrE,CAAC,EAAIA,GAAK,GAE1B,QAASA,EAAI,GAAIA,EAAI,GAAIA,IACvBurE,EAAcvrE,CAAC,EAAI,YAAeA,EAAI,IAAO,IAG/C,OAAOurE,CACT,CAQA,SAASC,IAAyB,CAGhC,QAFMC,EAAc,IAAI,YAAY,EAAE,EAE7BzrE,EAAI,EAAGA,EAAI,GAAIA,IACtByrE,EAAYzrE,CAAC,EAAI,KAEnB,OAAAyrE,EAAY,CAAC,EAAIA,EAAY,EAAE,EAAI,EAE5BA,CACT,UASgBvB,IAAiB,CAK/B,IAAMmB,EAAeF,GAA0B,EACzCI,EAAgBD,GAA2B,EAC3CG,EAAcD,GAAyB,EAE7C,OAAO,SAACxB,EAA2B,CAGjC,QAFM1wC,EAAS,IAAI,YAAY,EAAI0wC,EAAe,MAAM,EAClD0B,EAAmB,IAAI,YAAYpyC,CAAM,EACtCp3B,EAAQ,EAAGA,EAAQ8nE,EAAe,OAAQ9nE,IAAS,CAC1D,IAAMypE,EAAc3B,EAAe9nE,CAAK,EAClC0pE,EACFP,EAAaI,EAAYE,GAAe,EAAE,GAAKA,EAAc,KAAM,EACnEJ,EAAcI,GAAe,EAAE,EACnCD,EAAiBxpE,CAAK,EAAI0pE,CAC3B,CACD,OAAO,IAAI,aAAatyC,CAAM,CAChC,CACF,CCxsBO,IAAMuyC,GAAqB,oBACrBC,GAAqB,aAclCC,IAAA,UAAA,CA4DE,SAAAA,EACYC,EAA4BC,EACpCC,EAAS,CAD2BD,IAAA,SAAAA,EAAgC,CAAA,GACpEC,IAAA,SAAAA,EAASC,GAAAA,IADD,KAAQ,SAARH,EAA4B,KAAW,YAAXC,EA1DhC,KAAO,QAAG,MA4DhB,KAAK,GAAKC,EACND,GAAe,OACjB,KAAK,YAAc,CAAA,GAErB,KAAK,gBAAkB,IAAI9C,GApD7B,cAAA,eAAI4C,EAAY,UAAA,eAAA,CAAhB,IAAA,UAAA,CACE,OAAO,KAAK,sCACb,CAAA,EAED,OAAA,eAAIA,EAAU,UAAA,aAAA,CAAd,IAAA,UAAA,CACE,OAAO,KAAK,SAAS,yCACtB,CAAA,EAED,OAAA,eAAIA,EAAW,UAAA,cAAA,CAAf,IAAA,UAAA,CACE,OAAO,KAAK,SAAS,0CACtB,CAAA,EAED,OAAA,eAAIA,EAAM,UAAA,SAAA,CAAV,IAAA,UAAA,CACE,OAAO,KAAK,SAAS,qCACtB,CAAA,EAED,OAAA,eAAIA,EAAO,UAAA,UAAA,CAAX,IAAA,UAAA,CACE,OAAO,KAAK,SAAS,sCACtB,CAAA,EAED,OAAA,eAAIA,EAAO,UAAA,UAAA,CAAX,IAAA,UAAA,CACE,OAAO,KAAK,SAAS,wCACtB,CAAA,EAED,OAAA,eAAIA,EAAQ,UAAA,WAAA,CAAZ,IAAA,UAAA,CACE,OAAO,KAAK,UAAU,kDACvB,CAAA,EAED,OAAA,eAAIA,EAAc,UAAA,iBAAA,CAAlB,IAAA,UAAA,CACE,OAAO,KAAK,wCACb,CAAA,EAED,OAAA,eAAIA,EAAyB,UAAA,4BAAA,CAA7B,IAAA,UAAA,CACE,OAAO,KAAK,mDACb,CAAA,EAqBOA,EAAA,UAAA,cAAA,UAAA,CAEN,IAAMK,EAAO,KAAK,SAClB,GAAKA,EAAsB,MAAQ,KAEjC,KAAK,QAAUA,UACN,KAAK,YAAY,aAAe,KACzC,KAAK,QAAU,KAAK,GAAG,mBACJA,EAAgB,KAAK,WAAW,MAC9C,CACL,IAAMC,EACF,KAAK,GAAG,gBAAgBD,EAAgB,KAAK,WAAW,EAC5D,GAAIC,EAAS,SAAW,EAGtBA,EAAS,KACL,KAAK,GAAG,mBAAmBD,EAAgB,KAAK,WAAW,CAAC,UACvDC,EAAS,OAAS,EAC3B,MAAM,IAAI,MACN,wBAAA,OAAwBA,EAAS,OAA4B,sBAAA,EAC7D,QAAA,OAAQ,CAACD,CAAI,EAAC,GAAA,CAAG,EAEvB,KAAK,QAAUC,EAAS,CAAC,CAC1B,GAOHN,EAAA,UAAA,KAAA,UAAA,CAAA,IAwBC3mE,EAAA,KApBC,GADA,KAAK,cAAa,EACd,KAAK,QAAQ,MAAQ,KACvB,MAAM,IAAI,MACN,+GAC8C,EAMpD,IAAMknE,EAAa,KAAK,QAAQ,KAAI,EACpC,OAAIhqE,GAAAA,KAAK,UAAUgqE,CAAU,EACpBA,EAAW,KAAK,SAAAC,EAAS,CAC9B,OAAIA,EAAU,iBAAmB,KACxBnnE,EAAK,SAASmnE,CAAS,EAEzBnnE,EAAK,cAAcmnE,CAAS,CACrC,CAAC,EAGI,KAAK,SAASD,CAAU,GASjCP,EAAQ,UAAA,SAAR,SAASQ,EAA4B,CACnC,IAAMnK,EAAY,KAAK,GAAG,cACtBmK,EAAU,WAAYA,EAAU,WAAW,EAE/C,OAAO,KAAK,kBAAkBA,EAAWnK,CAAS,GAGtC2J,EAAa,UAAA,cAAnB,SAAoBQ,EAA4B,iGACtD,GAAIA,EAAU,iBAAmB,KAC/B,MAAM,IAAI,MAAM,gDAAgD,EAGhD,MAAM,CAAA,EAAA3B,GACtB2B,EAAU,gBAAe,EAAIA,EAAU,WAAW,CAAC,SAD/C,OAAAnK,EAAY52C,EACmC,KAAA,EAE9C,CAAA,EAAA,KAAK,kBAAkB+gD,EAAWnK,CAAS,CAAC,MACpD,EAEO2J,EAAA,UAAA,kBAAA,SAAkBQ,EACAnK,EAAyB,CACjD,KAAK,UAAYmK,EACjB,IAAMnoE,EAAQ,KAAK,UAAU,cAEzBe,EAAY,KAAK,UAAU,UAC/B,GAAI,KAAK,UAAU,qBAAuB,KAAM,CAC9C,IAAMqnE,EAAW,KAAK,UAAU,oBAC5BA,EAAS,WAAa,OACxBrnE,EAAYqnE,EAAS,WAGnBA,EAAS,sBAAwB,OACnC,KAAK,qBAAuBA,EAAS,qBAExC,CAWD,GAVA,KAAK,UAAYrnE,EAEjB,KAAK,QAAU,GAAG,OAAAf,EAAM,SAAS,SAAQ,GAAA,EAAA,OAAIA,EAAM,SAAS,WAAW,EACvE,KAAK,SAAW,IAAI+hE,GAChBxiE,GAAgB,SAAS,eAAeS,EAAO,KAAK,SAAS,CAAC,EAClE,KAAK,SAAS,UAAY,KAAK,6BAA6Bg+D,CAAS,EAGrE,KAAK,SAAS,gBAAkB,KAAK,gBAEjCmK,EAAU,kBAAoB,MAC7BA,EAAU,iBAA0C,MAAQ,KAAM,CACrE,IAAME,EACF9oE,GAAgB,SAAS,eAAe4oE,EAAU,gBAAgB,EACtE,KAAK,YAAc,IAAIpG,GAAcsG,CAAW,EAChD,KAAK,YAAY,UAAY,KAAK,SAAS,UAI3C,KAAK,YAAY,gBAAkB,KAAK,gBACxC,KAAK,qBAAuBF,EAAU,oBACvC,CAED,MAAO,IA+CHR,EAAA,UAAA,KAAN,SAAWW,EAAmClzD,EAAsB,0EAElE,GAAI,OAAOkzD,GAAiB,SAAU,CAEpC,GADML,EAAW,KAAK,GAAG,gBAAgBK,CAAY,EACjDL,EAAS,SAAW,EACtB,MAAM,IAAI,MACN,0CAAA,OAA0CK,EAAY,GAAA,CAAG,EACxD,GAAIL,EAAS,OAAS,EAC3B,MAAM,IAAI,MACN,wBAAA,OAAwBA,EAAS,OAA4B,sBAAA,EAC7D,QAAQ,OAAAK,EAAe,GAAA,CAAA,EAE7BA,EAAeL,EAAS,CAAC,CAC1B,CACD,GAAIK,EAAa,MAAQ,KACvB,MAAM,IAAI,MACN,6GACsD,EAG5D,MAAO,CAAA,EAAAA,EAAa,KAAK,KAAK,SAAS,CAAC,KACzC,EAEOX,EAAwB,UAAA,yBAAxB,SAAyBY,EAA8B,CAAvD,IAaPvnE,EAAA,KAZC,GAAI,KAAK,qBAAsB,CAC7B,IAAMwnE,EACFD,aAAyBvnD,GAAAA,OAAS,CAACunD,CAAa,EAAIA,EAClDE,EAAkC,CAAA,EAExC,OAAAD,EAAmB,QACf,SAACE,EAAc9sE,EAAC,CAAK,OAAA6sE,EAAgBznE,EAAK,qBAAqBpF,CAAC,CAAC,EAC7D8sE,CAAY,CAAA,EAEbD,CACR,CACD,OAAOF,GA0CTZ,EAAA,UAAA,QAAA,SAAQrmE,EAAwC8T,EAA2B,CAEzE,IAAMmzD,EAAgB,KAAK,QAAQjnE,EAAQ,KAAK,WAAW,EAC3D,OAAO,KAAK,yBAAyBinE,CAAa,GA2C9CZ,EAAA,UAAA,aAAN,SACIrmE,EACA8T,EAA2B,iGACP,MAAM,CAAA,EAAA,KAAK,aAAa9T,EAAQ,KAAK,WAAW,CAAC,SAAjE,OAAAinE,EAAgBnhD,EAAiD,KAAA,EACvE,CAAA,EAAO,KAAK,yBAAyBmhD,CAAa,CAAC,MACpD,EAEOZ,EAAe,UAAA,gBAAf,SAAgBrmE,EACc,CAD9B,IAoCPN,EAAA,OAlCC,GAAI,EAAEM,aAAkB0f,GAAAA,SAAW,CAAC,MAAM,QAAQ1f,CAAM,EAAG,CAEzD,IAAMqnE,GAAkB5qE,EAAA,KAAK,aAAS,MAAAA,IAAA,OAAA,OAAAA,EAAE,OACxC,GAAI4qE,GAAmB,KACrB,QAAWvmE,KAASumE,EAAiB,CACnC,IAAM3qE,EAAS2qE,EAAgBvmE,CAAK,EAChCpE,EAAO,YAAc,OACvBsD,EAAOc,CAAK,EAAI,KAAK,0BAA0BpE,EAAO,UAAU,EAEnE,CAEH,OAAOsD,CACR,CACDA,EAAS,MAAM,QAAQA,CAAM,EAAIA,EAAS,CAACA,CAAM,EAEjD,IAAMsnE,EACF,OAAO,KAAK,KAAK,yBAAyB,EAAE,OAChD,GAAItnE,EAAO,OAASsnE,IAAsB,KAAK,WAAW,OACxD,MAAM,IAAI,MAAM,oDAAA,OACZ,KAAK,WAAW,OAChBA,EAAiB,8CAAA,EAAA,OACjBtnE,EAAO,OAAM,0BAAA,CAA0B,EAG7C,IAAIunE,EAAa,EACjB,OAAO,KAAK,WAAW,OAAO,SAAChoE,EAAKjC,EAAS,WACrCkqE,GAAax/D,GAAAjL,GAAAN,EAAAiD,EAAK,aAAS,MAAAjD,IAAA,OAAA,OAAAA,EAAE,UAAS,MAAAM,IAAA,OAAA,OAAAA,EAAAO,CAAS,KAAC,MAAA0K,IAAA,OAAA,OAAAA,EAAE,WACxD,OAAIw/D,GAAc,KAChBjoE,EAAIjC,CAAS,EAAIoC,EAAK,0BAA0B8nE,CAAU,EAE1DjoE,EAAIjC,CAAS,EAAK0C,EAAoBunE,GAAY,EAE7ChoE,GACN,CAAA,CAAoB,GAGjB8mE,EAAgB,UAAA,iBAAhB,SAAiBpmE,EAAwB,CAC/C,OAAAA,EAAUA,GAAW,KAAK,YAClB,MAAM,QAAQA,CAAO,EAAgBA,EAAZ,CAACA,CAAO,GAGnComE,EAAA,UAAA,wBAAA,UAAA,CACN,OAAI,KAAK,aAAe,KACf,CAAA,EAEL,KAAK,sBAAwB,KACxB,KAAK,YAAY,QAAQ,CAAA,EAAI,CAAA,CAAE,EAE/B,KAAK,YAAY,QACpB,CAAA,EAAI,OAAO,KAAK,KAAK,qBAAqB,OAAO,CAAC,GAI5CA,EAAA,UAAA,6BAAN,UAAA,oEACN,OAAI,KAAK,aAAe,KACtB,CAAA,EAAO,CAAA,CAAE,EAEP,KAAK,sBAAwB,KACxB,CAAA,EAAA,KAAK,YAAY,aAAa,CAAA,EAAI,CAAA,CAAE,CAAC,EAE5C,CAAA,EAAO,KAAK,YAAY,aACpB,CAAA,EAAI,OAAO,KAAK,KAAK,qBAAqB,OAAO,CAAC,CAAC,KAE1D,EAEOA,EAA4B,UAAA,6BAA5B,SAA6BpmE,EAAiB,CAGpD,GAFA,KAAK,0BAA4B,CAAA,EAE7B,KAAK,qBAGP,QAFMwnE,EAAmB,KAAK,qBAAqB,QAC7C5E,EAAc,OAAO,KAAK4E,CAAgB,EACvCntE,EAAI,EAAGA,EAAIuoE,EAAY,OAAQvoE,IAAK,CAC3C,IAAMiD,EAAaslE,EAAYvoE,CAAC,EAC1BirB,EAAakiD,EAAiBlqE,CAAU,EAC9C,KAAK,0BAA0BgoB,EAAW,UAAU,EAAItlB,EAAQ3F,CAAC,CAClE,GAoBL+rE,EAAA,UAAA,QAAA,SAAQrmE,EAAwCC,EAAyB,CAEnE,KAAK,2BAA6B,MACpC,KAAK,6BAA6B,KAAK,wBAAuB,CAAE,EAElED,EAAS,KAAK,gBAAgBA,CAAM,EACpCC,EAAU,KAAK,iBAAiBA,CAAO,EACvC,IAAM3G,EAAS,KAAK,SAAS,QAAQ0G,EAAQC,CAAO,EACpD,OAAO3G,EAAO,OAAS,EAAIA,EAASA,EAAO,CAAC,GAmBxC+sE,EAAA,UAAA,aAAN,SACIrmE,EACAC,EAAyB,mGACvB,OAAA,KAAK,2BAA6B,KAAI,CAAA,EAAA,CAAA,GACxC6lB,EAAA,KAAK,6BACD,CAAA,EAAM,KAAK,6BAA4B,CAAE,UAD7CA,EAAA,MAAA,KAAI,CACAC,EAAyC,KAAA,CAAA,CAAA,mBAE/C,OAAA/lB,EAAS,KAAK,gBAAgBA,CAAM,EACpCC,EAAU,KAAK,iBAAiBA,CAAO,EAClB,CAAA,EAAA,KAAK,SAAS,aAAaD,EAAQC,CAAO,CAAC,SAA1D,OAAA3G,EAASysB,EAAiD,KAAA,EAChE,CAAA,EAAOzsB,EAAO,OAAS,EAAIA,EAASA,EAAO,CAAC,CAAC,MAC9C,EAQD+sE,EAAA,UAAA,uBAAA,UAAA,CACE,OAAO,KAAK,SAAS,uBAAsB,GAS7CA,EAAA,UAAA,2BAAA,UAAA,CACE,KAAK,SAAS,2BAA0B,GAGlCA,EAA4B,UAAA,6BAA5B,SAA6B9mE,EAAmB,CACtD,OAAO,OAAO,KAAKA,CAAG,EAAE,OAAO,SAACmoE,EAAyBrnE,EAAG,CAC1D,OAAAqnE,EAAOrnE,CAAG,EAAI,CAACd,EAAIc,CAAG,CAAC,EAChBqnE,GACN,CAAA,CAAE,GAQPrB,EAAA,UAAA,QAAA,UAAA,CACE,KAAK,SAAS,QAAO,EAEjB,KAAK,cACP,KAAK,YAAY,QAAO,EACpB,KAAK,2BACP3sB,GAAAA,QAAQ,KAAK,yBAAyB,GAI1C,KAAK,gBAAgB,QAAO,GAE/B2sB,CAAA,GAAA,WAiCqBsB,GAClBrB,EAA+BljE,EAC/BojE,EAAS,CADsB,OAAApjE,IAAA,SAAAA,EAA4B,CAAA,GAC3DojE,IAAA,SAAAA,EAASC,GAAAA,6FACX,GAAIH,GAAY,KACd,MAAM,IAAI,MACN,wGACsC,EAE5C,OAAIljE,GAAW,OACbA,EAAU,CAAA,GAGRA,EAAQ,WAAa,OAAOkjE,GAAa,WAC3CA,EAAWsB,GAAYtB,CAAQ,GAE3BuB,EAAQ,IAAIxB,GAAWC,EAAUljE,EAASojE,CAAI,EACpD,CAAA,EAAMqB,EAAM,KAAI,CAAE,SAAlB,OAAA/hD,EAAA,KAAA,EACA,CAAA,EAAO+hD,CAAK,MACb,CAYK,SAAUC,GACZC,EAC2D,CAE7D,GAAIA,GAAe,KACjB,MAAM,IAAI,MACN,sHACsD,EAG5D,IAAIC,EACJ,GAAID,aAAuB,MAAO,CAC1B,IAAAjiD,EAAAvrB,EAAuBwtE,EAAW,CAAA,EAAjCE,EAASniD,EAAA,CAAA,EAAEjmB,EAAOimB,EAAA,CAAA,EACzB,GAAI,CAACmiD,EACH,MAAM,IAAI,MAAM,kDAAkD,EAEpE,GAAI,CAACpoE,GAAW,EAAEA,aAAmB,aACnC,MAAM,IAAI,MACN,mEACY,EAElB,GAAI,EAAE,kBAAmBooE,GACvB,MAAM,IAAI,MAAM,uCAAyC,EAE3D,GAAI,EAAE,oBAAqBA,GACzB,MAAM,IAAI,MAAM,yCAA2C,EAG7D,IAAMC,EAAczB,GAAAA,GAAG,eAAewB,EAAU,eAAe,EACzDE,EACF1B,GAAAA,GAAG,6BAA6BwB,EAAWC,EAAaroE,CAAO,EACnEmoE,EAAYvB,GAAAA,GAAG,eAAe0B,CAAc,CAC7C,SAAU,SAAUJ,EAEnBC,EAAYD,UAEV,kBAAmBA,GAAe,gBAAiBA,GACnD,eAAgBA,EAElBC,EAAYvB,GAAAA,GAAG,eAAesB,CAAW,MAEzC,OAAM,IAAI,MAAM,sBAAsB,EAGxC,IAAMF,EAAQ,IAAIxB,GAAW2B,CAAS,EACtC,OAAAH,EAAM,KAAI,EACHA,CACT,CAEA,SAASD,GAAYtB,EAAgB,CACnC,OAAKA,EAAS,SAAS,GAAG,IACxBA,EAAYA,EAAY,KAEnB,GAAA,OAAGA,CAAQ,EAAA,OAAGF,EAAkB,EAAG,OAAAD,EAAkB,CAC9D,CChsBM,IAAAiC,GAAU,sICHhB,OAAOC,OAAQ,KACf,OAAOC,OAAU,OACjB,OAAOC,OAAU,OCFjB,IAAAC,GAA6C,WAC7CC,GAA2C,WCMpC,IAAMC,GAA+B,KAAM,CAI9C,aAAc,CAOV,IAAIC,EAAU,YAAaC,EAAM,CAC7B,OAAOD,EAAQ,MAAM,GAAGC,CAAI,CAChC,EACA,OAAO,OAAO,eAAeD,EAAS,WAAW,SAAS,CAC9D,CASA,SAASC,EAAM,CACX,MAAM,MAAM,yCAAyC,CACzD,CACJ,ECiCO,SAASC,GAAiBC,EAAmBC,EAAM,CAClDD,GAAmBA,EAAkBC,CAAI,CACjD,CASO,SAASC,GAAkBD,EAAM,CAEpC,OAAO,OAAO,YAAY,OAAO,QAAQA,CAAI,EAAE,IAAI,CAAC,CAACE,EAAKC,CAAK,IAAM,CAACA,EAAOD,CAAG,CAAC,CAAC,CACtF,CAQO,SAASE,GAAaC,EAAQ,CACjC,OAAOA,EAAO,QAAQ,sBAAuB,MAAM,CACvD,CAmBO,SAASC,GAAiBC,EAAG,CAChC,OAAO,OAAO,UAAUA,CAAC,GAAK,OAAOA,GAAM,QAC/C,CAqDO,SAASC,MAAeC,EAAM,CACjC,OAAO,MAAM,UAAU,OAAO,MAAM,CAAC,EAAGA,CAAI,CAChD,CAyEO,SAASC,GAAIC,EAAG,CACnB,IAAIC,EAAS,EACb,QAAWC,KAAKF,EAAG,EAAEC,EACrB,OAAOA,CACX,CC7OA,OAAOE,OAAQ,UACf,OAAOC,OAAU,YCgBjB,OAAOC,OAAQ,UACf,OAAOC,OAAU,YACjB,OAAOC,OAAS,WAEhB,IAAMC,GAAU,QAGVC,GAAiB,OAAO,OAAW,KAAe,OAAO,OAAO,SAAa,IAC7EC,GAAmB,OAAO,KAAS,KAAgB,CAAC,6BAA8B,2BAA4B,yBAAyB,EAAE,SAAS,KAAK,aAAa,IAAI,EACxKC,GAAyB,OAAO,KAAS,KAAe,WAAY,KACpEC,GAAsB,OAAO,UAAc,KAAe,QAAS,UACnEC,GAAqB,OAAO,UAAc,KAAe,OAAQ,UAEjEC,GAAuB,OAAO,QAAY,IAC1CC,GAAcD,IAAwB,SAAS,SAAS,OAAS,OACjEE,GAAkB,CAACC,GAAQZ,EAAE,EAC7Ba,GAAoB,CAACD,GAAQX,EAAI,EAGjCa,GAAkB,OAAO,WAAW,KAAS,IAC7CC,GAAiB,OAAO,WAAW,IAAQ,IAKpCC,GAAO,OAAO,OAAO,CAE9B,eAAAZ,GAGA,iBAAAC,GAGA,uBAAAC,GAGA,oBAAAC,GAGA,mBAAAC,GAGA,qBAAAC,GAGA,YAAAC,GAGA,gBAAAC,GAGA,kBAAAE,EACJ,CAAC,EAEKI,GAAkBN,IAAmBE,GAEvCK,GAAY,KAChB,GAAID,GAAiB,CAIjB,IAAME,EAAmB,OAAO,WAAW,EAAE,IAEzCA,EACAD,GAAYjB,GAAK,QAAQA,GAAK,QAAQC,GAAI,cAAciB,CAAgB,CAAC,CAAC,EACnE,OAAO,UAAc,MAC5BD,GAAYjB,GAAK,QAAQ,SAAS,EAE1C,CAGA,IAAMmB,GAAoBH,GACpBhB,GAAK,KAAKiB,GAAW,UAAU,EAC/B,KAGAG,GAA2B,WAC3BC,GAAiBL,GACjBhB,GAAK,KAAKiB,GAAWG,EAAwB,EAC7CA,GA0BOE,GAAM,CACf,QAASpB,GAIT,SAAU,CAEN,KAAM,CAAC,CACX,EAGA,kBAAmB,GACnB,WAAY,0BACZ,mBAAoB,8BAEpB,iBAAkB,EAAEC,IAAkBC,IACtC,eAAgBiB,GAChB,MAAOX,GAGP,gBAAiBL,IAA0B,CAACQ,GAE5C,WAAYH,GACZ,SAAUS,GAEV,eAAgB,GAChB,YAAa,IAEjB,EAOA,SAASR,GAAQY,EAAK,CAClB,OAAO,OAAO,KAAKA,CAAG,EAAE,SAAW,CACvC,CDnHA,IAAMC,GAAmB,CACrB,IAAO,aACP,KAAQ,YACR,IAAO,WACP,GAAM,kBACN,KAAQ,mBACR,IAAO,YACP,IAAO,aACP,KAAQ,aACR,IAAO,WACX,EACMC,GAAN,MAAMC,CAAa,CAMf,YAAYC,EAAU,CAKlB,GAJA,KAAK,SAAWA,EAChB,KAAK,QAAU,IAAI,QAEnB,KAAK,OAASC,GAAG,WAAWD,CAAQ,EAChC,KAAK,OAAQ,CACb,KAAK,OAAS,IACd,KAAK,WAAa,KAElB,IAAIE,EAAQD,GAAG,SAASD,CAAQ,EAChC,KAAK,QAAQ,IAAI,iBAAkBE,EAAM,KAAK,SAAS,CAAC,EAExD,KAAK,kBAAkB,EAEvB,IAAMC,EAASF,GAAG,iBAAiBD,CAAQ,EAC3C,KAAK,KAAO,IAAI,eAAe,CAC3B,MAAMI,EAAY,CACdD,EAAO,GAAG,OAASE,GAAUD,EAAW,QAAQC,CAAK,CAAC,EACtDF,EAAO,GAAG,MAAO,IAAMC,EAAW,MAAM,CAAC,EACzCD,EAAO,GAAG,QAAUG,GAAQF,EAAW,MAAME,CAAG,CAAC,CACrD,EACA,QAAS,CACLH,EAAO,QAAQ,CACnB,CACJ,CAAC,CACL,MACI,KAAK,OAAS,IACd,KAAK,WAAa,YAClB,KAAK,KAAO,IAEpB,CAOA,mBAAoB,CAEhB,IAAMI,EAAY,KAAK,SAAS,SAAS,EAAE,MAAM,GAAG,EAAE,IAAI,EAAE,YAAY,EACxE,KAAK,QAAQ,IAAI,eAAgBV,GAAiBU,CAAS,GAAK,0BAA0B,CAC9F,CAMA,OAAQ,CACJ,IAAIC,EAAW,IAAIT,EAAa,KAAK,QAAQ,EAC7C,OAAAS,EAAS,OAAS,KAAK,OACvBA,EAAS,OAAS,KAAK,OACvBA,EAAS,WAAa,KAAK,WAC3BA,EAAS,QAAU,IAAI,QAAQ,KAAK,OAAO,EACpCA,CACX,CAQA,MAAM,aAAc,CAEhB,OADa,MAAMP,GAAG,SAAS,SAAS,KAAK,QAAQ,GACb,MAC5C,CAQA,MAAM,MAAO,CACT,IAAMQ,EAAO,MAAMR,GAAG,SAAS,SAAS,KAAK,QAAQ,EACrD,OAAO,IAAI,KAAK,CAACQ,CAAI,EAAG,CAAE,KAAM,KAAK,QAAQ,IAAI,cAAc,CAAE,CAAC,CACtE,CAQA,MAAM,MAAO,CAET,OADa,MAAMR,GAAG,SAAS,SAAS,KAAK,SAAU,MAAM,CAEjE,CASA,MAAM,MAAO,CACT,OAAO,KAAK,MAAM,MAAM,KAAK,KAAK,CAAC,CACvC,CACJ,EASA,SAASS,GAAWC,EAAQC,EAAY,KAAMC,EAAa,KAAM,CAC7D,IAAIC,EACJ,GAAI,CACAA,EAAM,IAAI,IAAIH,CAAM,CACxB,MAAY,CACR,MAAO,EACX,CAIA,MAHI,EAAAC,GAAa,CAACA,EAAU,SAASE,EAAI,QAAQ,GAG7CD,GAAc,CAACA,EAAW,SAASC,EAAI,QAAQ,EAIvD,CAEA,IAAMC,GAAgB,uCAStB,SAASC,GAAiBL,EAAQ,CAG9B,MAFI,GAACI,GAAc,KAAKJ,CAAM,GAC1BA,EAAO,SAAS,IAAI,GAAKA,EAAO,SAAS,IAAI,GAC7CA,EAAO,SAAS,MAAM,GAAKA,EAAO,SAAS,QAAQ,EAE3D,CAQA,eAAsBM,GAAQC,EAAW,CAErC,GAAIC,GAAI,OAAS,CAACT,GAAWQ,EAAW,CAAC,QAAS,SAAU,OAAO,CAAC,EAChE,OAAO,IAAIpB,GACToB,aAAqB,IACjBA,EAAU,WAAa,QACrBA,EAAU,SACVA,EAAU,SAAS,EACrBA,CACN,EACG,GAAI,OAAO,QAAY,KAAe,SAAS,SAAS,OAAS,OAAQ,CAC5E,IAAME,EAAQ,CAAC,CAAC,QAAQ,KAAK,iBACvBC,EAAUF,GAAI,QAEdG,EAAU,IAAI,QAKpB,GAJAA,EAAQ,IAAI,aAAc,mBAAmBD,CAAO,WAAWD,CAAK,GAAG,EAGvDV,GAAWQ,EAAW,CAAC,QAAS,QAAQ,EAAG,CAAC,iBAAkB,OAAO,CAAC,EACzE,CAIT,IAAMK,EAAQ,QAAQ,KAAK,UAAY,QAAQ,KAAK,gBAChDA,GACAD,EAAQ,IAAI,gBAAiB,UAAUC,CAAK,EAAE,CAEtD,CACA,OAAO,MAAML,EAAW,CAAE,QAAAI,CAAQ,CAAC,CACvC,KAII,QAAO,MAAMJ,CAAS,CAE9B,CAEA,IAAMM,GAAgB,CAElB,IAAK,uDACL,IAAK,8BACL,IAAK,2BACL,IAAK,wBACL,IAAK,2DAGL,IAAK,iEACL,IAAK,uDACL,IAAK,+DACL,IAAK,0DACT,EASA,SAASC,GAAYC,EAAQC,EAAWC,EAAO,CAC3C,GAAI,CAACA,EAGD,OAAO,KAGX,IAAMC,EAAUL,GAAcE,CAAM,GAAK,UAAUA,CAAM,uCACzD,MAAM,MAAM,GAAGG,CAAO,MAAMF,CAAS,IAAI,CAC7C,CAEA,IAAMG,GAAN,KAAgB,CAKZ,YAAYC,EAAM,CACd,KAAK,KAAOA,CAChB,CAOA,MAAM,MAAMC,EAAS,CAEjB,IAAIhC,EAAW+B,GAAK,KAAK,KAAK,KAAMC,CAAO,EACvCC,EAAO,IAAInC,GAAaE,CAAQ,EAEpC,GAAIiC,EAAK,OACL,OAAOA,CAIf,CAUA,MAAM,IAAID,EAASxB,EAAU0B,EAAoB,OAAW,CACxD,IAAIlC,EAAW+B,GAAK,KAAK,KAAK,KAAMC,CAAO,EAE3C,GAAI,CACA,IAAMG,EAAgB3B,EAAS,QAAQ,IAAI,gBAAgB,EACrD4B,EAAQ,SAASD,GAAiB,GAAG,EACvCE,EAAS,EAEb,MAAMpC,GAAG,SAAS,MAAM8B,GAAK,QAAQ/B,CAAQ,EAAG,CAAE,UAAW,EAAK,CAAC,EACnE,IAAMsC,EAAarC,GAAG,kBAAkBD,CAAQ,EAC1CuC,EAAS/B,EAAS,KAAK,UAAU,EAEvC,OAAa,CACT,GAAM,CAAE,KAAAgC,EAAM,MAAAC,CAAM,EAAI,MAAMF,EAAO,KAAK,EAC1C,GAAIC,EACA,MAGJ,MAAM,IAAI,QAAQ,CAACE,EAASC,IAAW,CACnCL,EAAW,MAAMG,EAAQnC,GAAQ,CAC7B,GAAIA,EAAK,CACLqC,EAAOrC,CAAG,EACV,MACJ,CACAoC,EAAQ,CACZ,CAAC,CACL,CAAC,EAEDL,GAAUI,EAAM,OAChB,IAAMG,EAAWR,EAASC,EAASD,EAAS,IAAM,EAElDF,IAAoB,CAAE,SAAAU,EAAU,OAAAP,EAAQ,MAAAD,CAAM,CAAC,CACnD,CAEAE,EAAW,MAAM,CACrB,OAASO,EAAO,CAEZ,GAAI,CACA,MAAM5C,GAAG,SAAS,OAAOD,CAAQ,CACrC,MAAQ,CAAE,CACV,MAAM6C,CACV,CACJ,CAQJ,EAQA,eAAeC,GAASC,KAAUC,EAAO,CACrC,QAASC,KAAQD,EACb,GAAI,CACA,IAAIE,EAAS,MAAMH,EAAM,MAAME,CAAI,EACnC,GAAIC,EAAQ,OAAOA,CACvB,MAAY,CACR,QACJ,CAGR,CAiBA,eAAsBC,GAAaC,EAAiBC,EAAUzB,EAAQ,GAAM0B,EAAU,CAAC,EAAGC,EAAc,GAAO,CAE3G,GAAI,CAACpC,GAAI,iBAAkB,CAGvB,GAAImC,EAAQ,iBACR,MAAM,MAAM,qKAAqK,EAC9K,GAAI,CAACnC,GAAI,kBACZ,MAAM,MAAM,wJAAwJ,CAE5K,CAGAqC,GAAiBF,EAAQ,kBAAmB,CACxC,OAAQ,WACR,KAAMF,EACN,KAAMC,CACV,CAAC,EAID,IAAIN,EACJ,GAAI,CAACA,GAAS5B,GAAI,eAAgB,CAE9B,GAAI,CAACA,GAAI,YACL,MAAM,MAAM,kEAAkE,EAIlF,GAAI,CAACA,GAAI,YAAY,OAAS,CAACA,GAAI,YAAY,IAC3C,MAAM,IAAI,MACN,6LAEJ,EAEJ4B,EAAQ5B,GAAI,WAChB,CAEA,GAAI,CAAC4B,GAAS5B,GAAI,gBAAiB,CAC/B,GAAI,OAAO,OAAW,IAClB,MAAM,MAAM,qDAAqD,EAErE,GAAI,CAMA4B,EAAQ,MAAM,OAAO,KAAK,oBAAoB,CAClD,OAASU,EAAG,CACR,QAAQ,KAAK,qDAAsDA,CAAC,CACxE,CACJ,CAEA,GAAI,CAACV,GAAS5B,GAAI,WAAY,CAC1B,GAAI,CAACuC,GAAK,gBACN,MAAM,MAAM,yDAAyD,EAIzEX,EAAQ,IAAIjB,GAAUwB,EAAQ,WAAanC,GAAI,QAAQ,CAC3D,CAEA,IAAMwC,EAAWL,EAAQ,UAAY,OAC/BM,EAAaC,GAAST,EAAiBC,CAAQ,EAE/CS,EAAe9C,GAAiBoC,CAAe,EAC/CW,EAAYD,EACZD,GAAS1C,GAAI,eAAgByC,CAAU,EACvCA,EACAjC,EAAYkC,GACd1C,GAAI,WACJA,GAAI,mBACC,WAAW,UAAWiC,CAAe,EACrC,WAAW,aAAc,mBAAmBO,CAAQ,CAAC,EAC1DN,CACJ,EAGIW,EACEC,EAAmBlB,aAAiBjB,GAIpC6B,IAAa,OAASC,EAAaC,GAAST,EAAiBO,EAAUN,CAAQ,EAC/E1B,EAGFuC,EAAkB,GAGlB1D,EAEAuC,IAKAvC,EAAW,MAAMsC,GAASC,EAAOgB,EAAWE,CAAgB,GAGhE,IAAME,EAAW3D,IAAa,OAC9B,GAAIA,IAAa,OAAW,CAGxB,GAAIW,GAAI,iBAIJ,GADcT,GAAWkD,EAAY,CAAC,QAAS,QAAQ,CAAC,EAUjD,IAAIN,EAAQ,iBACf,MAAM,IAAI,MAAM,wEAAwEM,CAAU,GAAG,EAClG,GAAI,CAACzC,GAAI,kBACZ,MAAM,IAAI,MAAM,8EAA8EyC,CAAU,GAAG,MAX3G,IAAI,CACApD,EAAW,MAAMS,GAAQ8C,CAAS,EAClCC,EAAWD,CACf,OAASN,EAAG,CAGR,QAAQ,KAAK,mCAAmCM,CAAS,OAAON,CAAC,GAAG,CACxE,CAQR,GAAIjD,IAAa,QAAaA,EAAS,SAAW,IAAK,CAMnD,GAAI8C,EAAQ,kBAAoB,CAACnC,GAAI,kBAAmB,CAEpD,GAAIS,EACA,MAAM,MAAM,mGAAmGmC,CAAS,IAAI,EAI5H,OAAO,IAEf,CACA,GAAI,CAACD,EAGD,MAAM,MAAM,0BAA0BC,CAAS,mDAAmDX,CAAe,IAAI,EAMzH,GAFA5C,EAAW,MAAMS,GAAQU,CAAS,EAE9BnB,EAAS,SAAW,IACpB,OAAOiB,GAAYjB,EAAS,OAAQmB,EAAWC,CAAK,EAIxDoC,EAAWC,CACf,CAGAC,EACInB,GACG,OAAO,SAAa,KACpBvC,aAAoB,UACpBA,EAAS,SAAW,GAC/B,CAGAgD,GAAiBF,EAAQ,kBAAmB,CACxC,OAAQ,WACR,KAAMF,EACN,KAAMC,CACV,CAAC,EAED,IAAIH,EACJ,GAAI,EAAEQ,GAAK,aAAeH,GAAc,CAEpC,IAAIa,EAECd,EAAQ,kBAMTa,GAEA,OAAO,UAAc,KAAe,WAAW,KAAK,UAAU,SAAS,GAIvEC,EAAS,IAAI,WAAW,MAAM5D,EAAS,YAAY,CAAC,EAGpDgD,GAAiBF,EAAQ,kBAAmB,CACxC,OAAQ,WACR,KAAMF,EACN,KAAMC,EACN,SAAU,IACV,OAAQe,EAAO,OACf,MAAOA,EAAO,MAClB,CAAC,GAEDA,EAAS,MAAMC,GAAa7D,EAAUC,GAAQ,CAC1C+C,GAAiBF,EAAQ,kBAAmB,CACxC,OAAQ,WACR,KAAMF,EACN,KAAMC,EACN,GAAG5C,CACP,CAAC,CACL,CAAC,EA5BD2D,EAAS,IAAI,WAAW,MAAM5D,EAAS,YAAY,CAAC,EA8BxD0C,EAASkB,CACb,CAEA,GAGIF,GAAmBF,GAGlB,MAAMjB,EAAM,MAAMiB,CAAQ,IAAM,OAEjC,GAAKd,EAcD,MAAMH,EAAM,IAAIiB,EAAU,IAAI,SAASd,EAAQ,CAC3C,QAAS1C,EAAS,OACtB,CAAC,CAAC,EACG,MAAMF,GAAO,CAGV,QAAQ,KAAK,4CAA4CA,CAAG,GAAG,CACnE,CAAC,MArBI,CAGT,IAAMgE,EAAmBhB,EAAQ,kBAC1B7C,GAAS+C,GAAiBF,EAAQ,kBAAmB,CACpD,OAAQ,WACR,KAAMF,EACN,KAAMC,EACN,GAAG5C,CACP,CAAC,EACC,OACN,MAAMsC,EAAM,IAAIiB,EAAkCxD,EAAW8D,CAAgB,CACjF,CAkBJ,GANAd,GAAiBF,EAAQ,kBAAmB,CACxC,OAAQ,OACR,KAAMF,EACN,KAAMC,CACV,CAAC,EAEGH,EAAQ,CACR,GAAI,CAACQ,GAAK,aAAeH,EACrB,MAAM,IAAI,MAAM,8CAA8C,EAElE,OAAOL,CACX,CACA,GAAI1C,aAAoBV,GACpB,OAAOU,EAAS,SAKpB,IAAM+D,EAAiB,MAAMxB,GAAO,MAAMiB,CAAQ,EAClD,GAAIO,aAA0BzE,GAC1B,OAAOyE,EAAe,SACnB,GAAIA,aAA0B,SACjC,OAAO,IAAI,WAAW,MAAMA,EAAe,YAAY,CAAC,EACrD,GAAI,OAAOA,GAAmB,SACjC,OAAOA,EAGX,MAAM,IAAI,MAAM,0CAA0C,CAC9D,CAYA,eAAsBC,GAAaC,EAAWC,EAAU9C,EAAQ,GAAM0B,EAAU,CAAC,EAAG,CAChF,IAAMc,EAAS,MAAMjB,GAAasB,EAAWC,EAAU9C,EAAO0B,EAAS,EAAK,EAC5E,OAAIc,IAAW,KACJ,KAGK,IAAI,YAAY,OAAO,EACxB,OAAiCA,CAAO,CAC3D,CAYA,eAAsBO,GAAaF,EAAWC,EAAU9C,EAAQ,GAAM0B,EAAU,CAAC,EAAG,CAChF,IAAMsB,EAAO,MAAMJ,GAAaC,EAAWC,EAAU9C,EAAO0B,CAAO,EACnE,OAAIsB,IAAS,KAEF,CAAC,EAGL,KAAK,MAAMA,CAAI,CAC1B,CAQA,eAAeP,GAAa7D,EAAU0B,EAAmB,CAErD,IAAMC,EAAgB3B,EAAS,QAAQ,IAAI,gBAAgB,EACvD2B,IAAkB,MAClB,QAAQ,KAAK,2FAA2F,EAE5G,IAAIC,EAAQ,SAASD,GAAiB,GAAG,EACrCiC,EAAS,IAAI,WAAWhC,CAAK,EAC7BC,EAAS,EAEPE,EAAS/B,EAAS,KAAK,UAAU,EACvC,eAAeqE,GAAO,CAClB,GAAM,CAAE,KAAArC,EAAM,MAAAC,CAAM,EAAI,MAAMF,EAAO,KAAK,EAC1C,GAAIC,EAAM,OAEV,IAAMsC,EAAYzC,EAASI,EAAM,OACjC,GAAIqC,EAAY1C,EAAO,CACnBA,EAAQ0C,EAIR,IAAMC,EAAY,IAAI,WAAW3C,CAAK,EAGtC2C,EAAU,IAAIX,CAAM,EAEpBA,EAASW,CACb,CACAX,EAAO,IAAI3B,EAAOJ,CAAM,EACxBA,EAASyC,EAET,IAAMlC,EAAYP,EAASD,EAAS,IAGpC,OAAAF,EAAkB,CAAE,SAAAU,EAAU,OAAAP,EAAQ,MAAAD,CAAM,CAAC,EAEtCyC,EAAK,CAChB,CAGA,aAAMA,EAAK,EAEJT,CACX,CAQA,SAASP,MAAYmB,EAAO,CAExB,OAAAA,EAAQA,EAAM,IAAI,CAACC,EAAMC,KACjBA,IACAD,EAAOA,EAAK,QAAQ,IAAI,OAAO,IAAI,EAAG,EAAE,GAExCC,IAAUF,EAAM,OAAS,IACzBC,EAAOA,EAAK,QAAQ,IAAI,OAAO,IAAI,EAAG,EAAE,GAErCA,EACV,EACMD,EAAM,KAAK,GAAG,CACzB,CEnrBO,SAASG,GAAaC,EAAOC,EAAMC,EAAM,CAG5C,IAAMC,EAAQ,IAAI,MAAMD,EAAK,MAAM,EAC7BE,EAAS,IAAI,MAAMF,EAAK,MAAM,EAEpC,QAAS,EAAIA,EAAK,OAAS,EAAGG,EAAI,EAAG,GAAK,EAAG,EAAE,EAC3CD,EAAO,CAAC,EAAIC,EACZF,EAAM,CAAC,EAAIF,EAAKC,EAAK,CAAC,CAAC,EACvBG,GAAKF,EAAM,CAAC,EAIhB,IAAMG,EAAYJ,EAAK,IAAI,CAACK,EAAGC,IAAMJ,EAAOF,EAAK,QAAQM,CAAC,CAAC,CAAC,EAItDC,EAAe,IAAIT,EAAM,YAAYA,EAAM,MAAM,EAGvD,QAAS,EAAI,EAAG,EAAIA,EAAM,OAAQ,EAAE,EAAG,CACnC,IAAIU,EAAW,EACf,QAASC,EAAIV,EAAK,OAAS,EAAGW,EAAI,EAAGD,GAAK,EAAG,EAAEA,EAC3CD,GAAaE,EAAIX,EAAKU,CAAC,EAAKL,EAAUK,CAAC,EACvCC,EAAI,KAAK,MAAMA,EAAIX,EAAKU,CAAC,CAAC,EAE9BF,EAAaC,CAAQ,EAAIV,EAAM,CAAC,CACpC,CAEA,MAAO,CAACS,EAAcN,CAAK,CAC/B,CAyGO,SAASU,GAAIC,EAAK,CACrB,GAAIA,EAAI,SAAW,EAAG,MAAM,MAAM,yBAAyB,EAC3D,IAAID,EAAMC,EAAI,CAAC,EACXC,EAAa,EACjB,QAASC,EAAI,EAAGA,EAAIF,EAAI,OAAQ,EAAEE,EAC1BF,EAAIE,CAAC,EAAIH,IACTA,EAAMC,EAAIE,CAAC,EACXD,EAAaC,GAGrB,MAA6F,CAACH,EAAKE,CAAU,CACjH,CAUO,SAASE,GAAIH,EAAK,CACrB,GAAIA,EAAI,SAAW,EAAG,MAAM,MAAM,yBAAyB,EAC3D,IAAIG,EAAMH,EAAI,CAAC,EACXI,EAAa,EACjB,QAASF,EAAI,EAAGA,EAAIF,EAAI,OAAQ,EAAEE,EAC1BF,EAAIE,CAAC,EAAIC,IACTA,EAAMH,EAAIE,CAAC,EACXE,EAAaF,GAGrB,MAA6F,CAACC,EAAKC,CAAU,CACjH,CCxQA,IAAAC,GAAA,GAAAC,GAAAD,GAAA,aAAAE,KAAA,IAAOA,GAAQ,IAAI,MAAM,CAAC,EAAG,CAE3B,IAAK,IAAM,IAAM,CAAC,CACpB,CAAC,E,6MCHD,IAAAC,GAAA,GAAAC,GAAAD,GAAA,sBAAAE,GAAA,UAAAC,GAAA,qBAAAC,GAAA,mBAAAC,GAAA,WAAAC,GAAA,QAAAC,GAAA,oBAAAC,KCgBA,IAAMC,GAAqC,IAAI,IACzCC,GAAqC,CAAA,EAY9BC,GAAkB,CAACC,EAAcC,EAAkBC,IAA0B,CACxF,GAAID,GAAW,OAAOA,EAAQ,MAAS,YAAc,OAAOA,EAAQ,+BAAkC,WAAY,CAChH,IAAME,EAAiBN,GAAS,IAAIG,CAAI,EACxC,GAAIG,IAAmB,OACrBN,GAAS,IAAIG,EAAM,CAAE,QAAAC,EAAS,SAAAC,CAAQ,CAAE,MACnC,IAAIC,EAAe,SAAWD,EAEnC,OACK,GAAIC,EAAe,WAAaD,GACjCC,EAAe,UAAYF,EAC7B,MAAM,IAAI,MAAM,4BAA4BD,CAAI,oBAAoBE,CAAQ,EAAE,EAIlF,GAAIA,GAAY,EAAG,CACjB,IAAME,EAAIN,GAAyB,QAAQE,CAAI,EAC3CI,IAAM,IACRN,GAAyB,OAAOM,EAAG,CAAC,EAGtC,QAASA,EAAI,EAAGA,EAAIN,GAAyB,OAAQM,IACnD,GAAIP,GAAS,IAAIC,GAAyBM,CAAC,CAAC,EAAG,UAAYF,EAAU,CACnEJ,GAAyB,OAAOM,EAAG,EAAGJ,CAAI,EAC1C,OAGJF,GAAyB,KAAKE,CAAI,EAEpC,OAGF,MAAM,IAAI,UAAU,qBAAqB,CAC3C,EAQMK,GAAiC,MAAOC,GAAkD,CAC9F,IAAMC,EAAcV,GAAS,IAAIS,CAAW,EAC5C,GAAI,CAACC,EACH,MAAO,qBAGT,GAAIA,EAAY,YACd,OAAOA,EAAY,QACd,GAAIA,EAAY,QACrB,OAAOA,EAAY,MACd,CACL,IAAMC,EAAiB,CAAC,CAACD,EAAY,YACrC,GAAI,CACF,OAAKC,IACHD,EAAY,YAAcA,EAAY,QAAQ,KAAKD,CAAW,GAEhE,MAAMC,EAAY,YAClBA,EAAY,YAAc,GACnBA,EAAY,cACZE,EAAG,CACV,OAAKD,IACHD,EAAY,MAAQ,GAAGE,CAAC,GACxBF,EAAY,QAAU,IAEjBA,EAAY,cAEnB,OAAOA,EAAY,aAGzB,EAWaG,GAAsC,MACjDC,GACyE,CAEzE,IAAMC,EAAMD,EAAQ,oBAAsB,CAAA,EACpCE,EAAeD,EAAI,IAAKR,GAAO,OAAOA,GAAM,SAAWA,EAAIA,EAAE,IAAK,EAClEU,EAAeD,EAAa,SAAW,EAAIf,GAA2Be,EAGxEZ,EACEc,EAAS,CAAA,EACTC,EAAwB,IAAI,IAClC,QAAWV,KAAeQ,EAAc,CACtC,IAAMG,EAAgB,MAAMZ,GAA+BC,CAAW,EAClE,OAAOW,GAAkB,SAC3BF,EAAO,KAAK,CAAE,KAAMT,EAAa,IAAKW,CAAa,CAAE,GAEhDhB,IACHA,EAAUgB,GAERhB,IAAYgB,GACdD,EAAsB,IAAIV,CAAW,GAM3C,GAAI,CAACL,EACH,MAAM,IAAI,MAAM,oCAAoCc,EAAO,IAAKN,GAAM,IAAIA,EAAE,IAAI,KAAKA,EAAE,GAAG,EAAE,EAAE,KAAK,IAAI,CAAC,EAAE,EAI5G,OAAW,CAAE,KAAAT,EAAM,IAAAkB,CAAG,IAAMH,EACtBF,EAAa,SAASb,CAAI,GAE5B,QAAQ,KACN,0CAA0CA,CAAI,uDAAuDkB,CAAG,EAAE,EAKhH,IAAMC,EAAcP,EAAI,OAAQR,GAAMY,EAAsB,IAAI,OAAOZ,GAAM,SAAWA,EAAIA,EAAE,IAAI,CAAC,EAEnG,MAAO,CACLH,EACA,IAAI,MAAMU,EAAS,CACjB,IAAK,CAACS,EAAQC,IACRA,IAAS,qBACJF,EAEF,QAAQ,IAAIC,EAAQC,CAAI,EAElC,EAEL,EC7JO,IAAMC,GAAU,iCCEvB,IAAIC,GAAwC,UAE/BC,GAAW,CACtB,KAAM,CAAA,EACN,MAAO,CAAA,EACP,OAAQ,CAAA,EACR,SAAU,CAAE,OAAQC,EAAO,EAE3B,IAAI,SAASC,EAAmB,CAC9B,GAAIA,IAAU,OAGd,IAAI,OAAOA,GAAU,UAAY,CAAC,UAAW,OAAQ,UAAW,QAAS,OAAO,EAAE,QAAQA,CAAK,IAAM,GACnG,MAAM,IAAI,MAAM,8BAA8BA,CAAK,EAAE,EAEvDH,GAAgBG,EAClB,EACA,IAAI,UAAQ,CACV,OAAOH,EACT,GAIF,OAAO,eAAeC,GAAK,WAAY,CAAE,WAAY,EAAI,CAAE,EC0QpD,IAAMG,GAAWA,GChSjB,IAAMC,GAAkB,CAACC,EAAgBC,IAA4C,CAC1F,IAAMC,EAAS,OAAO,SAAa,IAAc,SAAS,cAAc,QAAQ,EAAI,IAAI,gBAAgB,EAAG,CAAC,EAC5GA,EAAO,MAAQF,EAAO,KAAK,CAAC,EAC5BE,EAAO,OAASF,EAAO,KAAK,CAAC,EAC7B,IAAMG,EAAkBD,EAAO,WAAW,IAAI,EAK9C,GAAIC,GAAmB,KAAM,CAE3B,IAAIC,EACAC,EACAJ,GAAS,eAAiB,QAAaA,EAAQ,eAAiB,QAClEG,EAAQJ,EAAO,KAAK,CAAC,EACrBK,EAASL,EAAO,KAAK,CAAC,IAGtBI,EAAQJ,EAAO,KAAK,CAAC,EACrBK,EAASL,EAAO,KAAK,CAAC,GAGxB,IAAMM,EAAcL,GAAS,SAAW,OAAYA,EAAQ,OAAS,MAE/DM,EAAON,GAAS,KAClBO,EACAC,EACAF,IAAS,QAAaA,EAAK,OAAS,OACtCC,EAAW,CAAC,IAAK,IAAK,IAAK,GAAG,EAE1B,OAAOD,EAAK,MAAS,SACvBC,EAAW,CAACD,EAAK,KAAMA,EAAK,KAAMA,EAAK,KAAMA,EAAK,IAAI,GAEtDC,EAAW,CAACD,EAAK,KAAK,CAAC,EAAGA,EAAK,KAAK,CAAC,EAAGA,EAAK,KAAK,CAAC,EAAG,CAAC,EACnDA,EAAK,KAAK,CAAC,IAAM,SACnBC,EAAS,CAAC,EAAID,EAAK,KAAK,CAAC,IAI3BA,IAAS,QAAaA,EAAK,OAAS,OACtCE,EAAW,CAAC,EAAG,EAAG,EAAG,CAAC,EAElB,OAAOF,EAAK,MAAS,SACvBE,EAAW,CAACF,EAAK,KAAMA,EAAK,KAAMA,EAAK,KAAMA,EAAK,IAAI,GAEtDE,EAAW,CAACF,EAAK,KAAK,CAAC,EAAGA,EAAK,KAAK,CAAC,EAAGA,EAAK,KAAK,CAAC,EAAG,CAAC,EACnDA,EAAK,KAAK,CAAC,IAAM,SACnBE,EAAS,CAAC,EAAIF,EAAK,KAAK,CAAC,IAK/B,IAAMG,EAASL,EAASD,EAEpBO,EAAiB,EACnBC,EAAiBF,EACjBG,EAAiBH,EAAS,EAC1BI,EAAiB,GAGfR,IAAgB,QAClBK,EAAiB,EACjBC,EAAiBF,EACjBG,EAAiBH,EAAS,EAC1BI,EAAiBJ,EAAS,GACjBJ,IAAgB,OACzBK,EAAiB,EACjBC,EAAiBF,EACjBG,EAAiBH,EAAS,GACjBJ,IAAgB,QACzBK,EAAiB,EACjBE,EAAiBH,EACjBE,EAAiBF,EAAS,GAG5B,QAASK,EAAI,EAAGA,EAAIV,EAAQU,IAC1B,QAASC,EAAI,EAAGA,EAAIZ,EAAOY,IAAK,CAC9B,IAAMC,GAAMjB,EAAO,KAAKW,GAAgB,EAAeF,EAAS,CAAC,GAAKD,EAAS,CAAC,EAC1EU,GAAMlB,EAAO,KAAKY,GAAgB,EAAeH,EAAS,CAAC,GAAKD,EAAS,CAAC,EAC1EW,GAAMnB,EAAO,KAAKa,GAAgB,EAAeJ,EAAS,CAAC,GAAKD,EAAS,CAAC,EAC1EY,EAAIN,IAAmB,GAAK,KAAQd,EAAO,KAAKc,GAAgB,EAAeL,EAAS,CAAC,GAAKD,EAAS,CAAC,EAE9GL,EAAgB,UAAY,QAAUc,EAAI,IAAMC,EAAI,IAAMC,EAAI,IAAMC,EAAI,IACxEjB,EAAgB,SAASa,EAAGD,EAAG,EAAG,CAAC,EAGvC,GAAI,cAAeb,EACjB,OAAOA,EAAO,UAAS,EAEvB,MAAM,IAAI,MAAM,4BAA4B,MAG9C,OAAM,IAAI,MAAM,2BAA2B,CAE/C,EAKamB,GAAoB,CAACrB,EAAgBC,IAAiD,CACjG,IAAME,EACJ,OAAO,SAAa,IAChB,SAAS,cAAc,QAAQ,EAAE,WAAW,IAAI,EAC/C,IAAI,gBAAgB,EAAG,CAAC,EAAE,WAAW,IAAI,EAC5CmB,EACJ,GAAInB,GAAmB,KAAM,CAE3B,IAAIC,EACAC,EACAkB,EACAtB,GAAS,eAAiB,QAAaA,EAAQ,eAAiB,QAClEG,EAAQJ,EAAO,KAAK,CAAC,EACrBK,EAASL,EAAO,KAAK,CAAC,EACtBuB,EAAWvB,EAAO,KAAK,CAAC,IAGxBI,EAAQJ,EAAO,KAAK,CAAC,EACrBK,EAASL,EAAO,KAAK,CAAC,EACtBuB,EAAWvB,EAAO,KAAK,CAAC,GAE1B,IAAMM,EAAcL,IAAY,QAAaA,EAAQ,SAAW,OAAYA,EAAQ,OAAkB,MAEhGM,EAAON,GAAS,KAClBO,EACAC,EACAF,IAAS,QAAaA,EAAK,OAAS,OACtCC,EAAW,CAAC,IAAK,IAAK,IAAK,GAAG,EAE1B,OAAOD,EAAK,MAAS,SACvBC,EAAW,CAACD,EAAK,KAAMA,EAAK,KAAMA,EAAK,KAAMA,EAAK,IAAI,GAEtDC,EAAW,CAACD,EAAK,KAAK,CAAC,EAAGA,EAAK,KAAK,CAAC,EAAGA,EAAK,KAAK,CAAC,EAAG,GAAG,EACrDA,EAAK,KAAK,CAAC,IAAM,SACnBC,EAAS,CAAC,EAAID,EAAK,KAAK,CAAC,IAI3BA,IAAS,QAAaA,EAAK,OAAS,OACtCE,EAAW,CAAC,EAAG,EAAG,EAAG,CAAC,EAElB,OAAOF,EAAK,MAAS,SACvBE,EAAW,CAACF,EAAK,KAAMA,EAAK,KAAMA,EAAK,KAAMA,EAAK,IAAI,GAEtDE,EAAW,CAACF,EAAK,KAAK,CAAC,EAAGA,EAAK,KAAK,CAAC,EAAGA,EAAK,KAAK,CAAC,EAAG,CAAC,EACnDA,EAAK,KAAK,CAAC,IAAM,SACnBE,EAAS,CAAC,EAAIF,EAAK,KAAK,CAAC,IAK/B,IAAMG,EAASL,EAASD,EACxB,GAAIH,IAAY,SAEXA,EAAQ,SAAW,QAAasB,IAAa,GAAKtB,EAAQ,SAAW,QACrEsB,IAAa,GAAKtB,EAAQ,SAAW,OAASA,EAAQ,SAAW,OAElE,MAAM,IAAI,MAAM,+CAA+C,EAKnE,IAAMuB,EAAO,EACTC,EAAgB,EAClBC,EAAgB,EAChBC,EAAgB,EAChBC,EAAgB,EACdjB,EAAiB,EACnBC,EAAiBF,EACjBG,EAAiBH,EAAS,EAC1BI,EAAiB,GAGfR,IAAgB,QAClBK,EAAiB,EACjBC,EAAiBF,EACjBG,EAAiBH,EAAS,EAC1BI,EAAiBJ,EAAS,GACjBJ,IAAgB,OACzBK,EAAiB,EACjBC,EAAiBF,EACjBG,EAAiBH,EAAS,GACjBJ,IAAgB,QACzBK,EAAiB,EACjBE,EAAiBH,EACjBE,EAAiBF,EAAS,GAG5BY,EAAQnB,EAAgB,gBAAgBC,EAAOC,CAAM,EAErD,QACMU,EAAI,EACRA,EAAIV,EAASD,EACbqB,GAAiBD,EAAME,GAAiBF,EAAMG,GAAiBH,EAAMI,GAAiBJ,EAAMT,IAE5FO,EAAM,KAAKG,CAAa,GAAMzB,EAAO,KAAKW,GAAgB,EAAeF,EAAS,CAAC,GAAKD,EAAS,CAAC,EAClGc,EAAM,KAAKI,CAAa,GAAM1B,EAAO,KAAKY,GAAgB,EAAeH,EAAS,CAAC,GAAKD,EAAS,CAAC,EAClGc,EAAM,KAAKK,CAAa,GAAM3B,EAAO,KAAKa,GAAgB,EAAeJ,EAAS,CAAC,GAAKD,EAAS,CAAC,EAClGc,EAAM,KAAKM,CAAa,EACtBd,IAAmB,GAAK,KAAQd,EAAO,KAAKc,GAAgB,EAAeL,EAAS,CAAC,GAAKD,EAAS,CAAC,MAGxG,OAAM,IAAI,MAAM,2BAA2B,EAE7C,OAAOc,CACT,ECnLO,IAAMO,GAAiB,CAACC,EAAuCC,IAA0C,CAC9G,GAAID,IAAW,OACb,MAAM,IAAI,MAAM,8BAA8B,EAEhD,GAAIC,EAAQ,SAAW,QAAaA,EAAQ,QAAU,OACpD,MAAM,IAAI,MAAM,wCAAwC,EAE1D,GAAIA,EAAQ,eAAiB,OAC3B,MAAM,IAAI,MAAM,yCAAyC,EAG3D,GAAM,CAAE,OAAAC,EAAQ,MAAAC,CAAK,EAAKF,EAEpBG,EAAOH,EAAQ,MAAQ,CAAE,KAAM,IAAK,KAAM,CAAC,EAC7CI,EACAC,EAEA,OAAOF,EAAK,MAAS,SACvBC,EAAW,CAACD,EAAK,KAAMA,EAAK,KAAMA,EAAK,KAAMA,EAAK,IAAI,EAEtDC,EAAW,CAACD,EAAK,KAAM,CAAC,EAAGA,EAAK,KAAM,CAAC,EAAGA,EAAK,KAAM,CAAC,EAAGA,EAAK,KAAM,CAAC,GAAK,GAAG,EAG3E,OAAOA,EAAK,MAAS,SACvBE,EAAW,CAACF,EAAK,KAAMA,EAAK,KAAMA,EAAK,KAAMA,EAAK,IAAI,EAEtDE,EAAW,CAACF,EAAK,KAAM,CAAC,EAAGA,EAAK,KAAM,CAAC,EAAGA,EAAK,KAAM,CAAC,EAAGA,EAAK,KAAM,CAAC,GAAK,CAAC,EAG7E,IAAMG,EAAcN,EAAQ,SAAW,OAAYA,EAAQ,OAAS,OAG9DO,EACJP,EAAQ,eAAiB,QAAaA,EAAQ,eAAiB,OAAYA,EAAQ,aAAwB,MACvGQ,EAASP,EAASC,EAClBO,EAAcF,IAAiB,OAAS,IAAI,aAAaC,EAAS,CAAC,EAAI,IAAI,aAAaA,EAAS,CAAC,EAGpGE,EAAO,EACTC,EAAgB,EAChBC,EAAgB,EAChBC,EAAgB,EAChBC,EAAgB,EACdC,EAAiB,EACnBC,EAAiBR,EACjBS,EAAiBT,EAAS,EAC1BU,EAAiB,GAGfZ,IAAgB,QAClBI,EAAO,EACPC,EAAgB,EAChBC,EAAgB,EAChBC,EAAgB,EAChBC,EAAgB,IAIdP,IAAiB,OACnBW,EAAiBV,EAAS,EACjBD,IAAiB,OAC1BQ,EAAiB,EACjBE,EAAiBT,EACjBQ,EAAiBR,EAAS,GACjBD,IAAiB,QAC1BU,EAAiB,EACjBD,EAAiBR,EACjBO,EAAiBP,EAAS,GAG5B,QACMW,EAAI,EACRA,EAAIX,EACJW,IAAKR,GAAiBD,EAAMG,GAAiBH,EAAME,GAAiBF,EAAMI,GAAiBJ,EAE3FD,EAAYM,GAAgB,GAAKhB,EAAOY,CAAa,EAAIN,EAAS,CAAC,GAAKD,EAAS,CAAC,EAClFK,EAAYO,GAAgB,GAAKjB,EAAOa,CAAa,EAAIP,EAAS,CAAC,GAAKD,EAAS,CAAC,EAClFK,EAAYQ,GAAgB,GAAKlB,EAAOc,CAAa,EAAIR,EAAS,CAAC,GAAKD,EAAS,CAAC,EAC9Ec,IAAmB,IAAMJ,IAAkB,KAC7CL,EAAYS,GAAgB,GAAKnB,EAAOe,CAAa,EAAIT,EAAS,CAAC,GAAKD,EAAS,CAAC,GAStF,OAHEG,IAAiB,OACb,IAAIa,GAAO,UAAWX,EAAa,CAAC,EAAG,EAAGR,EAAQC,CAAK,CAAC,EACxD,IAAIkB,GAAO,UAAWX,EAAa,CAAC,EAAG,EAAGR,EAAQC,CAAK,CAAC,CAEhE,EAKamB,GAAkB,MAC7BC,EACAtB,IAKmB,CAEnB,IAAMuB,EAAiB,OAAO,iBAAqB,KAAeD,aAAiB,iBAC7EE,EAAiB,OAAO,UAAc,KAAeF,aAAiB,UACtEG,EAAgB,OAAO,YAAgB,KAAeH,aAAiB,YACvEI,EAAW,OAAOJ,GAAU,SAE9BK,EACAC,EAA+C5B,GAAW,CAAA,EAExD6B,EAAe,IAAK,CACxB,GAAI,OAAO,SAAa,IACtB,OAAO,SAAS,cAAc,QAAQ,EACjC,GAAI,OAAO,gBAAoB,IACpC,OAAO,IAAI,gBAAgB,EAAG,CAAC,EAE/B,MAAM,IAAI,MAAM,yBAAyB,CAE7C,EACMC,EAAuBC,GACvB,OAAO,kBAAsB,KAAeA,aAAkB,mBAEvDA,aAAkB,gBADpBA,EAAO,WAAW,IAAI,EAItB,KAIX,GAAIR,EAAgB,CAElB,IAAMQ,EAASF,EAAY,EAC3BE,EAAO,MAAQT,EAAM,MACrBS,EAAO,OAAST,EAAM,OACtB,IAAMU,EAAkBF,EAAoBC,CAAM,EAElD,GAAIC,GAAmB,KAAM,CAC3B,IAAI/B,EAASqB,EAAM,OACfpB,EAAQoB,EAAM,MAMlB,GALItB,IAAY,QAAaA,EAAQ,gBAAkB,QAAaA,EAAQ,eAAiB,SAC3FC,EAASD,EAAQ,cACjBE,EAAQF,EAAQ,cAGdA,IAAY,OAAW,CAEzB,GADA4B,EAAwB5B,EACpBA,EAAQ,eAAiB,OAC3B,MAAM,IAAI,MAAM,6DAA6D,EAE7E4B,EAAsB,aAAe,OAEvCA,EAAsB,OAAS3B,EAC/B2B,EAAsB,MAAQ1B,OAE9B0B,EAAsB,aAAe,OACrCA,EAAsB,OAAS3B,EAC/B2B,EAAsB,MAAQ1B,EAGhC8B,EAAgB,UAAUV,EAAO,EAAG,CAAC,EACrCK,EAAOK,EAAgB,aAAa,EAAG,EAAG9B,EAAOD,CAAM,EAAE,SAEzD,OAAM,IAAI,MAAM,2BAA2B,UAEpCuB,EAAgB,CACzB,IAAIvB,EACAC,EAiBJ,GAfIF,IAAY,QAAaA,EAAQ,eAAiB,QAAaA,EAAQ,gBAAkB,QAC3FC,EAASD,EAAQ,cACjBE,EAAQF,EAAQ,eAEhBC,EAASqB,EAAM,OACfpB,EAAQoB,EAAM,OAGZtB,IAAY,SACd4B,EAAwB5B,GAE1B4B,EAAsB,OAAS,OAC/BA,EAAsB,OAAS3B,EAC/B2B,EAAsB,MAAQ1B,EAE1BF,IAAY,OAAW,CACzB,IAAMiC,EAAaJ,EAAY,EAE/BI,EAAW,MAAQ/B,EACnB+B,EAAW,OAAShC,EAEpB,IAAM+B,EAAkBF,EAAoBG,CAAU,EAEtD,GAAID,GAAmB,KACrBA,EAAgB,aAAaV,EAAO,EAAG,CAAC,EACxCK,EAAOK,EAAgB,aAAa,EAAG,EAAG9B,EAAOD,CAAM,EAAE,SAEzD,OAAM,IAAI,MAAM,2BAA2B,OAG7C0B,EAAOL,EAAM,aAENG,EAAe,CAExB,GAAIzB,IAAY,OACd,MAAM,IAAI,MAAM,yDAAyD,EAG3E,IAAM+B,EAASF,EAAY,EAC3BE,EAAO,MAAQT,EAAM,MACrBS,EAAO,OAAST,EAAM,OACtB,IAAMU,EAAkBF,EAAoBC,CAAM,EAElD,GAAIC,GAAmB,KAAM,CAC3B,IAAM/B,EAASqB,EAAM,OACfpB,EAAQoB,EAAM,MACpB,OAAAU,EAAgB,UAAUV,EAAO,EAAG,EAAGpB,EAAOD,CAAM,EACpD0B,EAAOK,EAAgB,aAAa,EAAG,EAAG9B,EAAOD,CAAM,EAAE,KACzD2B,EAAsB,OAAS3B,EAC/B2B,EAAsB,MAAQ1B,EACvBJ,GAAe6B,EAAMC,CAAqB,MAEjD,OAAM,IAAI,MAAM,2BAA2B,MAExC,IAAIF,EACT,OAAO,IAAI,QAAQ,CAACQ,EAASC,IAAU,CACrC,IAAMJ,EAASF,EAAY,EACrBO,EAAUN,EAAoBC,CAAM,EAC1C,GAAI,CAACT,GAAS,CAACc,EACb,OAAOD,EAAM,EAEf,IAAME,EAAW,IAAI,MACrBA,EAAS,YAAc,YACvBA,EAAS,IAAMf,EACfe,EAAS,OAAS,IAAK,CACrBN,EAAO,MAAQM,EAAS,MACxBN,EAAO,OAASM,EAAS,OACzBD,EAAQ,UAAUC,EAAU,EAAG,EAAGN,EAAO,MAAOA,EAAO,MAAM,EAC7D,IAAMO,EAAMF,EAAQ,aAAa,EAAG,EAAGL,EAAO,MAAOA,EAAO,MAAM,EAElEH,EAAsB,OAASG,EAAO,OACtCH,EAAsB,MAAQG,EAAO,MACrCG,EAAQpC,GAAewC,EAAI,KAAMV,CAAqB,CAAC,CACzD,CACF,CAAC,EAED,MAAM,IAAI,MAAM,gEAAgE,EAGlF,GAAID,IAAS,OACX,OAAO7B,GAAe6B,EAAMC,CAAqB,EAEjD,MAAM,IAAI,MAAM,gEAAgE,CAEpF,EAKaW,GAAoB,CAC/BC,EACAxC,IACU,CACV,GAAM,CAAE,MAAAE,EAAO,OAAAD,EAAQ,SAAAwC,EAAU,QAAAC,CAAO,EAAK1C,EAEvC2C,EAAO,CAAC,EAAG1C,EAAQC,EAAO,CAAC,EACjC,OAAO,IAAIkB,GAAO,CAAE,SAAU,UAAW,KAAM,UAAW,QAAAoB,EAAS,KAAAG,EAAM,SAAAF,EAAU,QAAAC,CAAO,CAAE,CAC9F,EAKaE,GAAsB,CACjCC,EACA7C,IACU,CACV,GAAM,CAAE,SAAA8C,EAAU,KAAAH,EAAM,SAAAF,EAAU,QAAAC,CAAO,EAAK1C,EAC9C,OAAO,IAAIoB,GAAO,CAAE,SAAU,aAAc,KAAM0B,GAAY,UAAW,UAAAD,EAAW,KAAAF,EAAM,SAAAF,EAAU,QAAAC,CAAO,CAAE,CAC/G,EAKaK,GAAqB,CAChCC,EACAhD,IACU,CACV,GAAM,CAAE,SAAA8C,EAAU,KAAAH,EAAM,SAAAF,EAAU,QAAAC,CAAO,EAAK1C,EAC9C,OAAO,IAAIoB,GAAO,CAAE,SAAU,YAAa,KAAM0B,GAAY,UAAW,SAAAE,EAAU,KAAAL,EAAM,SAAAF,EAAU,QAAAC,CAAO,CAAE,CAC7G,EAKaO,GAAyB,CACpCC,EACAnD,EACA4C,IACW,IAAIvB,GAAO,CAAE,SAAU,aAAc,KAAA8B,EAAM,KAAMnD,EAAQ,KAAM4C,GAAQ,CAAC5C,EAAO,MAAM,CAAC,CAAE,ECvT9F,IAAMoD,GAAwC,IAAI,IAA6C,CACpG,CAAC,UAAW,YAAY,EACxB,CAAC,QAAS,UAAU,EACpB,CAAC,OAAQ,SAAS,EAClB,CAAC,SAAU,WAAW,EACtB,CAAC,QAAS,UAAU,EACpB,CAAC,QAAS,UAAU,EACpB,CAAC,OAAQ,UAAU,EACnB,CAAC,UAAW,YAAY,EACxB,CAAC,SAAU,WAAW,EACtB,CAAC,OAAQ,UAAU,EACnB,CAAC,QAAS,UAAU,EACrB,EAGYC,GAAwC,IAAI,IAAkD,CACzG,CAAC,aAAc,SAAS,EACxB,CAAC,WAAY,OAAO,EACpB,CAAC,UAAW,MAAM,EAClB,CAAC,YAAa,QAAQ,EACtB,CAAC,WAAY,OAAO,EACpB,CAAC,WAAY,OAAO,EACpB,CAAC,aAAc,SAAS,EACxB,CAAC,YAAa,QAAQ,EACvB,EAKGC,GAAsB,GACbC,GAAkB,IAAK,CAClC,GAAI,CAACD,GAAqB,CACxBA,GAAsB,GACtB,IAAME,EAA2B,OAAO,cAAkB,KAAe,cAAc,KACjFC,EAA4B,OAAO,eAAmB,KAAe,eAAe,KAGpFC,EAAgB,WAAmB,aACnCC,EAA0B,OAAOD,EAAiB,KAAeA,EAAa,KAEhFF,IACFJ,GAAsC,IAAI,QAAS,aAAa,EAChEC,GAAsC,IAAI,cAAe,OAAO,GAE9DI,IACFL,GAAsC,IAAI,SAAU,cAAc,EAClEC,GAAsC,IAAI,eAAgB,QAAQ,GAEhEM,GACFP,GAAsC,IAAI,UAAWM,CAAY,EACjEL,GAAsC,IAAIK,EAAc,SAAS,GAGjEN,GAAsC,IAAI,UAAW,WAAW,EAGtE,EC5DO,IAAMQ,GAAiBC,GAAoC,CAChE,IAAIC,EAAO,EACX,QAASC,EAAI,EAAGA,EAAIF,EAAK,OAAQE,IAAK,CACpC,IAAMC,EAAMH,EAAKE,CAAC,EAClB,GAAI,OAAOC,GAAQ,UAAY,CAAC,OAAO,cAAcA,CAAG,EACtD,MAAM,IAAI,UAAU,QAAQD,CAAC,8BAA8BC,CAAG,EAAE,EAElE,GAAIA,EAAM,EACR,MAAM,IAAI,WAAW,QAAQD,CAAC,0CAA0CC,CAAG,EAAE,EAE/EF,GAAQE,EAEV,OAAOF,CACT,EAKaG,GAAgB,CAACC,EAAgBL,IAAmC,CAC/E,OAAQK,EAAO,SAAU,CACvB,IAAK,MACH,OAAO,IAAIC,GAAOD,EAAO,KAAMA,EAAO,KAAML,CAAI,EAClD,IAAK,aACH,OAAO,IAAIM,GAAO,CAChB,SAAU,aACV,KAAMD,EAAO,KACb,KAAMA,EAAO,KACb,KAAAL,EACD,EACH,IAAK,UACH,OAAO,IAAIM,GAAO,CAChB,SAAU,UACV,QAASD,EAAO,QAChB,KAAMA,EAAO,KACb,KAAAL,EACD,EACH,IAAK,aACH,OAAO,IAAIM,GAAO,CAChB,SAAU,aACV,UAAWD,EAAO,UAClB,KAAMA,EAAO,KACb,KAAAL,EACD,EACH,IAAK,YACH,OAAO,IAAIM,GAAO,CAChB,SAAU,YACV,SAAUD,EAAO,SACjB,KAAMA,EAAO,KACb,KAAAL,EACD,EACH,QACE,MAAM,IAAI,MAAM,kCAAkCK,EAAO,QAAQ,mBAAmB,EAE1F,ECpBM,IAAOE,GAAP,KAAa,CAuDjB,YACEC,EAUAC,EACAC,EAAwB,CAGxBC,GAAe,EAEf,IAAIC,EACAC,EAEJ,GAAI,OAAOL,GAAS,UAAY,aAAcA,EAO5C,OAHA,KAAK,aAAeA,EAAK,SACzBI,EAAOJ,EAAK,KACZK,EAAOL,EAAK,KACJA,EAAK,SAAU,CACrB,IAAK,aAAc,CACjB,IAAMM,EAAgCC,GAAsC,IAAIH,CAAI,EACpF,GAAI,CAACE,EACH,MAAM,IAAI,UAAU,qBAAqBF,CAAI,uCAAuC,EAEtF,GAAI,EAAEJ,EAAK,gBAAgBM,GACzB,MAAM,IAAI,UAAU,4BAA4BA,EAA8B,IAAI,EAAE,EAEtF,KAAK,QAAUN,EAAK,KACpB,MAEF,IAAK,UAAW,CACd,GAAII,IAAS,UACX,MAAM,IAAI,UAAU,qBAAqBA,CAAI,iCAAiC,EAEhF,KAAK,eAAiBJ,EAAK,QAC3B,KAAK,WAAaA,EAAK,SACvB,KAAK,SAAWA,EAAK,QACrB,MAEF,IAAK,aAAc,CACjB,GACEI,IAAS,WACTA,IAAS,WACTA,IAAS,SACTA,IAAS,SACTA,IAAS,UACTA,IAAS,SACTA,IAAS,QACTA,IAAS,SACTA,IAAS,OAET,MAAM,IAAI,UAAU,qBAAqBA,CAAI,oCAAoC,EAEnF,KAAK,cAAgBJ,EAAK,UAC1B,KAAK,WAAaA,EAAK,SACvB,KAAK,SAAWA,EAAK,QACrB,MAEF,IAAK,YAAa,CAChB,GACEI,IAAS,WACTA,IAAS,WACTA,IAAS,SACTA,IAAS,SACTA,IAAS,UACTA,IAAS,UACTA,IAAS,QACTA,IAAS,SACTA,IAAS,QACTA,IAAS,SACTA,IAAS,OAET,MAAM,IAAI,UAAU,qBAAqBA,CAAI,kCAAkC,EAEjF,KAAK,aAAeJ,EAAK,SACzB,KAAK,WAAaA,EAAK,SACvB,KAAK,SAAWA,EAAK,QACrB,MAEF,QACE,MAAM,IAAI,MAAM,6CAA6C,KAAK,YAAY,GAAG,MAEhF,CAIL,IAAIQ,EACAC,EAEJ,GAAI,OAAOT,GAAS,SAMlB,GAFAI,EAAOJ,EACPS,EAAYP,EACRF,IAAS,SAAU,CAErB,GAAI,CAAC,MAAM,QAAQC,CAAI,EACrB,MAAM,IAAI,UAAU,gDAAgD,EAItEO,EAAOP,MACF,CAEL,IAAMS,EAAwBH,GAAsC,IAAIP,CAAI,EAC5E,GAAIU,IAA0B,OAC5B,MAAM,IAAI,UAAU,4BAA4BV,CAAI,GAAG,EAEzD,GAAI,MAAM,QAAQC,CAAI,EAAG,CACvB,GAAKD,IAAS,WAAaU,IAA0B,aAAgBV,IAAS,SAAWA,IAAS,OAWhG,MAAM,IAAI,UACR,cAAcA,CAAI,0DAA0DU,EAAsB,IAAI,WAAW,EAE1GV,IAAS,UAAYA,IAAS,QAYvCQ,EAAQE,EAA8B,KAAKT,EAAM,MAAM,EAIvDO,EAAQE,EAA8B,KAAKT,CAAI,UAExCA,aAAgBS,EACzBF,EAAOP,UACEA,aAAgB,kBACzB,GAAID,IAAS,QACXQ,EAAO,WAAW,KAAKP,CAAI,MAE3B,OAAM,IAAI,UAAU,yDAAyD,UAEtED,IAAS,WAAaC,aAAgB,aAAeS,IAA0B,YAMxFF,EAAO,IAAK,WAAmB,aAAaP,EAAK,OAAQA,EAAK,WAAYA,EAAK,MAAM,MAErF,OAAM,IAAI,UAAU,KAAKG,CAAI,kCAAkCM,CAAqB,EAAE,UAO1FD,EAAYR,EACR,MAAM,QAAQD,CAAI,EAAG,CAEvB,GAAIA,EAAK,SAAW,EAClB,MAAM,IAAI,UAAU,qDAAqD,EAE3E,IAAMW,EAAmB,OAAOX,EAAK,CAAC,EACtC,GAAIW,IAAqB,SACvBP,EAAO,SACPI,EAAOR,UACEW,IAAqB,UAC9BP,EAAO,OAIPI,EAAO,WAAW,KAAKR,CAAa,MAEpC,OAAM,IAAI,UAAU,uCAAuCW,CAAgB,GAAG,UAEvEX,aAAgB,kBACzBI,EAAO,QACPI,EAAO,WAAW,KAAKR,CAAI,MACtB,CAEL,IAAMY,EAAaC,GAAsC,IACvDb,EAAK,WAA8C,EAErD,GAAIY,IAAe,OACjB,MAAM,IAAI,UAAU,qCAAqCZ,EAAK,WAAW,GAAG,EAE9EI,EAAOQ,EACPJ,EAAOR,EAKX,GAAIS,IAAc,OAEhBA,EAAY,CAACD,EAAK,MAAM,UACf,CAAC,MAAM,QAAQC,CAAS,EACjC,MAAM,IAAI,UAAU,wCAAwC,EAE9DJ,EAAOI,EAEP,KAAK,QAAUD,EACf,KAAK,aAAe,MAItB,IAAMM,EAAOC,GAAcV,CAAI,EAE/B,GAAI,KAAK,SAAWS,IAAS,KAAK,QAAQ,QACnC,GAAAV,IAAS,SAAWA,IAAS,SAAW,KAAK,KAAKU,EAAO,CAAC,IAAM,KAAK,QAAQ,QAGhF,MAAM,IAAI,MAAM,iBAAiBA,CAAI,gCAAgC,KAAK,QAAQ,MAAM,IAAI,EAIhG,KAAK,KAAOV,EACZ,KAAK,KAAOC,EACZ,KAAK,KAAOS,CACd,CAIA,aAAa,UACXE,EACAC,EAIwB,CAExB,OAAOC,GAAgBF,EAAOC,CAAO,CACvC,CAEA,OAAO,YACLE,EACAF,EAAoC,CAEpC,OAAOG,GAAkBD,EAASF,CAAO,CAC3C,CAEA,OAAO,cACLI,EACAJ,EAAsC,CAEtC,OAAOK,GAAoBD,EAAWJ,CAAO,CAC/C,CAEA,OAAO,aACLM,EACAN,EAAqC,CAErC,OAAOO,GAAmBD,EAAUN,CAAO,CAC7C,CAEA,OAAO,iBACLb,EACAqB,EACApB,EAAwB,CAExB,OAAOqB,GAAuBtB,EAAMqB,EAAQpB,CAAI,CAClD,CAKA,UAAUY,EAAgC,CACxC,OAAOU,GAAgB,KAAMV,CAAO,CACtC,CAEA,YAAYA,EAAkC,CAC5C,OAAOW,GAAkB,KAAMX,CAAO,CACxC,CAqDA,IAAI,MAAI,CAEN,GADA,KAAK,YAAW,EACZ,CAAC,KAAK,QACR,MAAM,IAAI,MACR,gJAC6E,EAGjF,OAAO,KAAK,OACd,CAEA,IAAI,UAAQ,CACV,OAAO,KAAK,YACd,CAEA,IAAI,SAAO,CAET,GADA,KAAK,YAAW,EACZ,CAAC,KAAK,eACR,MAAM,IAAI,MAAM,4CAA4C,EAE9D,OAAO,KAAK,cACd,CAEA,IAAI,WAAS,CAEX,GADA,KAAK,YAAW,EACZ,CAAC,KAAK,cACR,MAAM,IAAI,MAAM,4CAA4C,EAE9D,OAAO,KAAK,aACd,CAEA,IAAI,UAAQ,CAEV,GADA,KAAK,YAAW,EACZ,CAAC,KAAK,aACR,MAAM,IAAI,MAAM,6CAA6C,EAE/D,OAAO,KAAK,YACd,CAKA,MAAM,QAAQY,EAAqB,CAEjC,OADA,KAAK,YAAW,EACR,KAAK,aAAc,CACzB,IAAK,MACL,IAAK,aACH,OAAO,KAAK,KACd,IAAK,UACL,IAAK,aACL,IAAK,YAAa,CAChB,GAAI,CAAC,KAAK,WACR,MAAM,IAAI,MAAM,qEAAqE,EAEvF,GAAI,KAAK,cACP,MAAM,IAAI,MAAM,yCAAyC,EAE3D,GAAI,CACF,KAAK,cAAgB,GACrB,IAAMrB,EAAO,MAAM,KAAK,WAAU,EAClC,YAAK,WAAa,OAClB,KAAK,aAAe,MACpB,KAAK,QAAUA,EAEXqB,GAAe,KAAK,WACtB,KAAK,SAAQ,EACb,KAAK,SAAW,QAGXrB,UAEP,KAAK,cAAgB,IAGzB,QACE,MAAM,IAAI,MAAM,kCAAkC,KAAK,YAAY,EAAE,EAE3E,CAEA,SAAO,CACL,GAAI,KAAK,cACP,MAAM,IAAI,MAAM,yCAAyC,EAGvD,KAAK,WACP,KAAK,SAAQ,EACb,KAAK,SAAW,QAElB,KAAK,QAAU,OACf,KAAK,eAAiB,OACtB,KAAK,cAAgB,OACrB,KAAK,aAAe,OACpB,KAAK,WAAa,OAClB,KAAK,cAAgB,OAErB,KAAK,aAAe,MACtB,CAKQ,aAAW,CACjB,GAAI,KAAK,eAAiB,OACxB,MAAM,IAAI,MAAM,yBAAyB,CAE7C,CAEA,QAAQH,EAAuB,CAE7B,GADA,KAAK,YAAW,EACZ,KAAK,YAAc,KAAK,SAC1B,MAAM,IAAI,MAAM,iDAAiD,EAEnE,OAAOyB,GAAc,KAAMzB,CAAI,CACjC,GCzKK,IAAM0B,GAASA,GC9Xf,IAAMC,GAAQ,CAACC,EAAoBC,IAAiB,EACrD,OAAOC,GAAI,MAAU,IAAc,CAACA,GAAI,KAAK,MAAQ,CAACA,GAAI,QAI9D,QAAQ,UAAU,GAAGF,CAAU,UAAUC,CAAK,EAAE,CAClD,EAEME,GAAa,CAACC,EAAaC,IAAqB,CACpD,IAAMC,EAAQ,IAAI,MAAK,EAAG,OAAO,MAAM,aAAa,GAAK,CAAA,EACrDC,EAAe,GACnB,QAASC,EAAI,EAAGA,EAAIF,EAAM,OAAQE,IAAK,CACrC,GAAID,GAAgB,CAACD,EAAME,CAAC,EAAE,SAAS,YAAY,EAAG,CACpD,IAAIP,EAAQ,QAAQG,CAAG,KAAKE,EAAME,CAAC,EAAE,KAAI,EAAG,MAAM,GAAG,EAAE,CAAC,CAAC,GACrDH,IACFJ,GAAS,KAAKI,CAAQ,IAExBN,GAAM,MAAOE,CAAK,EAClB,OAEEK,EAAME,CAAC,EAAE,SAAS,YAAY,IAChCD,EAAe,IAGrB,EAKaE,GAAoBJ,GAAqB,EAChD,OAAOH,GAAI,MAAU,IAAc,CAACA,GAAI,KAAK,MAAQ,CAACA,GAAI,QAG9DC,GAAW,QAASE,CAAQ,CAC9B,EAKaK,GAAkBL,GAAqB,EAC9C,OAAOH,GAAI,MAAU,IAAc,CAACA,GAAI,KAAK,MAAQ,CAACA,GAAI,QAG9DC,GAAW,MAAOE,CAAQ,CAC5B,ECpCM,IAAOM,GAAP,MAAOC,CAAgB,CAC3B,YAAoBC,EAAgC,CAClD,KAAK,QAAUA,CACjB,CAGA,MAAM,IAAIC,EAAkBC,EAAiCC,EAAiB,CAC5EC,GAAgB,EAChB,IAAMC,EAAgD,CAAA,EAClDC,EAAsB,CAAA,EAE1B,GAAI,OAAOL,GAAU,UAAYA,IAAU,MAAQA,aAAiBM,IAAU,MAAM,QAAQN,CAAK,EAC/F,MAAM,IAAI,UACR,+FAA+F,EAInG,IAAIO,EAAiB,GAErB,GAAI,OAAON,GAAS,SAAU,CAC5B,GAAIA,IAAS,KACX,MAAM,IAAI,UAAU,yCAAyC,EAE/D,GAAIA,aAAgBK,GAClB,MAAM,IAAI,UAAU,8BAA8B,EAGpD,GAAI,MAAM,QAAQL,CAAI,EAAG,CACvB,GAAIA,EAAK,SAAW,EAClB,MAAM,IAAI,UAAU,qCAAqC,EAE3DM,EAAiB,GAEjB,QAAWC,KAAQP,EAAM,CACvB,GAAI,OAAOO,GAAS,SAClB,MAAM,IAAI,UAAU,gDAAgD,EAEtE,GAAI,KAAK,YAAY,QAAQA,CAAI,IAAM,GACrC,MAAM,IAAI,WAAW,2CAA2CA,CAAI,GAAG,EAEzEJ,EAAQI,CAAI,EAAI,KAGlB,GAAI,OAAON,GAAS,UAAYA,IAAS,KACvCG,EAAUH,UACD,OAAOA,EAAS,IACzB,MAAM,IAAI,UAAU,8BAA8B,MAE/C,CAGL,IAAIO,EAAY,GACVC,EAAW,OAAO,oBAAoBT,CAAI,EAChD,QAAWO,KAAQ,KAAK,YACtB,GAAIE,EAAS,QAAQF,CAAI,IAAM,GAAI,CACjC,IAAMG,EAAKV,EAA4DO,CAAI,GACvEG,IAAM,MAAQA,aAAaL,MAC7BG,EAAY,GACZF,EAAiB,GACjBH,EAAQI,CAAI,EAAIG,GAKtB,GAAIF,GACF,GAAI,OAAOP,GAAS,UAAYA,IAAS,KACvCG,EAAUH,UACD,OAAOA,EAAS,IACzB,MAAM,IAAI,UAAU,8BAA8B,OAGpDG,EAAUJ,WAGL,OAAOA,EAAS,IACzB,MAAM,IAAI,UAAU,yDAAyD,EAI/E,QAAWO,KAAQ,KAAK,WACtB,GAAI,OAAOR,EAAMQ,CAAI,EAAM,IACzB,MAAM,IAAI,MAAM,UAAUA,CAAI,0BAA0B,EAK5D,GAAID,EACF,QAAWC,KAAQ,KAAK,YACtBJ,EAAQI,CAAI,EAAI,KAMpB,IAAMI,EAAU,MAAM,KAAK,QAAQ,IAAIZ,EAAOI,EAASC,CAAO,EACxDQ,EAA6C,CAAA,EACnD,QAAWC,KAAOF,EAChB,GAAI,OAAO,eAAe,KAAKA,EAASE,CAAG,EAAG,CAC5C,IAAMC,EAASH,EAAQE,CAAG,EACtBC,aAAkBT,GACpBO,EAAYC,CAAG,EAAIC,EAEnBF,EAAYC,CAAG,EAAI,IAAIR,GAAOS,EAAO,KAAMA,EAAO,KAAMA,EAAO,IAAI,EAIzE,OAAAC,GAAc,EACPH,CACT,CAEA,MAAM,SAAO,CACX,OAAO,KAAK,QAAQ,QAAO,CAC7B,CAWA,aAAa,OACXI,EACAhB,EACAC,EACAgB,EAAqB,CAErBf,GAAgB,EAEhB,IAAIgB,EACAd,EAA0B,CAAA,EAE9B,GAAI,OAAOY,GAAS,UAElB,GADAE,EAAuBF,EACnB,OAAOhB,GAAS,UAAYA,IAAS,KACvCI,EAAUJ,UACD,OAAOA,EAAS,IACzB,MAAM,IAAI,UAAU,8BAA8B,UAE3CgB,aAAgB,YAEzB,GADAE,EAAuBF,EACnB,OAAOhB,GAAS,UAAYA,IAAS,KACvCI,EAAUJ,UACD,OAAOA,EAAS,IACzB,MAAM,IAAI,UAAU,8BAA8B,UAGpDgB,aAAgB,aACf,OAAO,kBAAsB,KAAeA,aAAgB,kBAC7D,CACA,IAAMG,EAASH,EACXI,EAAa,EACbC,EAAaL,EAAK,WACtB,GAAI,OAAOhB,GAAS,UAAYA,IAAS,KACvCI,EAAUJ,UACD,OAAOA,GAAS,SAAU,CAEnC,GADAoB,EAAapB,EACT,CAAC,OAAO,cAAcoB,CAAU,EAClC,MAAM,IAAI,WAAW,kCAAkC,EAEzD,GAAIA,EAAa,GAAKA,GAAcD,EAAO,WACzC,MAAM,IAAI,WAAW,oCAAoCA,EAAO,UAAU,IAAI,EAGhF,GADAE,EAAaL,EAAK,WAAaI,EAC3B,OAAOnB,GAAS,SAAU,CAE5B,GADAoB,EAAapB,EACT,CAAC,OAAO,cAAcoB,CAAU,EAClC,MAAM,IAAI,WAAW,kCAAkC,EAEzD,GAAIA,GAAc,GAAKD,EAAaC,EAAaF,EAAO,WACtD,MAAM,IAAI,WAAW,oCAAoCA,EAAO,WAAaC,CAAU,IAAI,EAE7F,GAAI,OAAOH,GAAS,UAAYA,IAAS,KACvCb,EAAUa,UACD,OAAOA,EAAS,IACzB,MAAM,IAAI,UAAU,8BAA8B,UAE3C,OAAOhB,EAAS,IACzB,MAAM,IAAI,UAAU,gCAAgC,UAE7C,OAAOD,EAAS,IACzB,MAAM,IAAI,UAAU,8BAA8B,EAEpDkB,EAAuB,IAAI,WAAWC,EAAQC,EAAYC,CAAU,MAEpE,OAAM,IAAI,UAAU,qDAAqD,EAI3E,GAAM,CAACC,EAASC,CAAuB,EAAI,MAAMC,GAAoCpB,CAAO,EACtFN,EAAU,MAAMwB,EAAQ,8BAA8BJ,EAAsBK,CAAuB,EACzG,OAAAR,GAAc,EACP,IAAIlB,EAAiBC,CAAO,CACrC,CAEA,gBAAc,CACZ,KAAK,QAAQ,eAAc,CAC7B,CACA,cAAY,CACV,KAAK,QAAQ,aAAY,CAC3B,CAEA,IAAI,YAAU,CACZ,OAAO,KAAK,QAAQ,UACtB,CACA,IAAI,aAAW,CACb,OAAO,KAAK,QAAQ,WACtB,CAEA,IAAI,eAAa,CACf,OAAO,KAAK,QAAQ,aACtB,CAEA,IAAI,gBAAc,CAChB,OAAO,KAAK,QAAQ,cACtB,GCkYK,IAAM2B,GAA4CA,wqBCxmB5CC,GAHbC,GAAAC,GAAA,IAAA,CAAA,aAGaF,GAAS,CAAC,EAAE,OAAO,QAAY,KAAe,QAAQ,UAAY,QAAQ,SAAS,KAAA,CAAA,ECQ1FG,GAgCOC,GAGPC,GAiDOC,GAOAC,GAUPC,GAaAC,GAaAC,GAcAC,GAeAC,GA2CAC,GAsBOC,GAxObC,GAAAb,GAAA,IAAA,CAAA,aAIAD,GAAAA,EAOME,GAASH,IAAU,OAAO,SAAa,IAAc,OAAY,SAAS,OAgCnEI,GACU,YAAA,IAAkC,SAAW,YAAA,IAAkC,QAEhGC,GAAe,IAA0B,CAE7C,GAAI,CAAAL,GAaF,CAAA,GAAII,GAAsC,CAcxC,IAAMY,EAAO,IACb,OAAO,IAAI,IAAI,IAAIA,EAAK,mBAA4B,YAAA,GAA8B,EAAE,KAAMb,EAAM,EAAE,IACpG,CAEA,OAAO,YAAA,GAAA,CASX,EAOaG,GAAYD,GAAa,EAOzBE,GAAmC,IAA0B,CACxE,GAAID,IAAa,CAACA,GAAU,WAAW,OAAO,EAC5C,OAAOA,GAAU,UAAU,EAAGA,GAAU,YAAY,GAAG,EAAI,CAAC,CAGhE,EAKME,GAAe,CAACS,EAAkBC,IAA4B,CAClE,GAAI,CACF,IAAMC,EAAUD,GAAkBZ,GAElC,OADYa,EAAU,IAAI,IAAIF,EAAUE,CAAO,EAAI,IAAI,IAAIF,CAAQ,GACxD,SAAWd,EACxB,MAAQ,CACN,MAAO,EACT,CACF,EAKMM,GAAe,CAACQ,EAAkBC,IAA4B,CAClE,IAAMC,EAAUD,GAAkBZ,GAClC,GAAI,CAEF,OADYa,EAAU,IAAI,IAAIF,EAAUE,CAAO,EAAI,IAAI,IAAIF,CAAQ,GACxD,IACb,MAAQ,CACN,MACF,CACF,EAKMP,GAAc,CAACO,EAAkBC,IAA4B,GAAGA,GAAkB,IAAI,GAAGD,CAAQ,GAcjGN,GAAU,MAAOS,GAAyC,CAE9D,IAAMC,EAAO,MADI,MAAM,MAAMD,EAAa,CAAE,YAAa,aAAc,CAAC,GAC5C,KAAK,EACjC,OAAO,IAAI,gBAAgBC,CAAI,CACjC,EAWMT,GAAuB,MAAUU,IACpC,MAAM,OAAiCA,IAAM,QA0C1CT,GAQA,OAcOC,GAAmB,MAC9BS,EACAL,EACAM,IAC0E,CAC1E,GAAI,CAACD,GAAe,CAACL,GAAkBL,IAAsBP,IAAaE,GAAaF,EAAS,EAC9F,MAAO,CAAC,OAAWO,EAAkB,EAChC,CACL,IAAMY,EAEF,6BACEC,EAAgBH,GAAed,GAAagB,EAAoBP,CAAc,EAW9ES,EAAc,CAAC3B,IAAUwB,GAAmBE,GAAiB,CAAClB,GAAakB,EAAeR,CAAc,EACxGI,EAAMK,EACR,MAAMhB,GAAQe,CAAa,EAC1BA,GAAiBhB,GAAYe,EAAoBP,CAAc,EACpE,MAAO,CAACS,EAAcL,EAAM,OAAW,MAAMV,GAA6DU,CAAG,CAAC,CAChH,CACF,CAAA,CAAA,EC5PIM,GACAC,GACAC,GACAC,GAEEC,GA0BAC,GA2BAC,GA4BOC,GAuIAC,GArObC,GAAAnC,GAAA,IAAA,CAAA,aAMAa,GAAAA,EAGIc,GAAc,GACdC,GAAe,GACfC,GAAU,GAERC,GAAyB,IAAe,CAE5C,GAAI,OAAO,kBAAsB,IAC/B,MAAO,GAGT,GAAI,CAGF,OAAI,OAAO,eAAmB,KAC5B,IAAI,eAAe,EAAE,MAAM,YAAY,IAAI,kBAAkB,CAAC,CAAC,EAK1D,YAAY,SACjB,IAAI,WAAW,CACb,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,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,IAAK,GAC3G,EAAG,EAAG,GAAI,EACZ,CAAC,CACH,CACF,MAAY,CACV,MAAO,EACT,CACF,EAEMC,GAAkB,IAAe,CACrC,GAAI,CAeF,OAAO,YAAY,SACjB,IAAI,WAAW,CACb,EAAG,GAAI,IAAK,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,IAAK,GAAI,IAAK,GAAI,EAAG,EAAG,EAC7G,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IAAK,EAAG,GAAI,EAC1D,CAAC,CACH,CACF,MAAY,CACV,MAAO,EACT,CACF,EAEMC,GAAyB,IAAe,CAC5C,GAAI,CAgBF,OAAO,YAAY,SACjB,IAAI,WAAW,CACb,EAAG,GAAI,IAAK,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,IAAK,GAAI,GAAI,EAAG,IAC1G,GAAI,GAAI,EAAG,IAAK,GAAI,IAAK,IAAK,EAAG,EACnC,CAAC,CACH,CACF,MAAY,CACV,MAAO,EACT,CACF,EAEaC,GAAwB,MAAOG,GAA+C,CACzF,GAAIT,GACF,OAAO,QAAQ,QAAQ,EAEzB,GAAIC,GACF,MAAM,IAAI,MAAM,uDAAuD,EAEzE,GAAIC,GACF,MAAM,IAAI,MAAM,oDAAoD,EAGtED,GAAe,GAGf,IAAMS,EAAUD,EAAM,YAClBE,EAAaF,EAAM,WAGvB,GAAIA,EAAM,OAAS,IAEZ,GAAIA,EAAM,OAAS,WAExB,GAAI,CAACJ,GAAuB,EAC1B,MAAM,IAAI,MAAM,uEAAuE,UAEhF,CAACD,GAAgB,EAC1B,MAAM,IAAI,MAAM,+DAA+D,EAIjF,IAAMQ,EAAuBT,GAAuB,EAChDQ,EAAa,GAAK,CAACC,IACjB,OAAO,KAAS,KAAe,CAAC,KAAK,qBAEvC,QAAQ,KACN,iCACED,EACA,uIAEJ,EAIF,QAAQ,KACN,4GACF,EAGAF,EAAM,WAAaE,EAAa,GAGlC,IAAME,EAAYJ,EAAM,UAClBK,EAAqB,OAAOD,GAAc,SAAWA,EAAY,OACjEE,EAAuBF,GAAiC,IACxDG,EAAmBD,GAA6B,MAAQA,EACxDE,EAAwBJ,GAAiC,KACzDK,EAAoBD,GAA8B,MAAQA,EAC1DE,EAAqBV,EAAM,WAE3B,CAACW,EAAWC,CAAc,EAAI,MAAMpC,GAAiB+B,EAAiBF,EAAoBH,EAAa,CAAC,EAE1GW,EAAY,GAEVC,EAA8B,CAAC,EAmErC,GAhEIb,EAAU,GACZa,EAAM,KACJ,IAAI,QAASC,GAAY,CACvB,WAAW,IAAM,CACfF,EAAY,GACZE,EAAQ,CACV,EAAGd,CAAO,CACZ,CAAC,CACH,EAIFa,EAAM,KACJ,IAAI,QAAQ,CAACC,EAASC,IAAW,CAC/B,IAAMC,EAAiC,CAKrC,WAAAf,CACF,EAEA,GAAIQ,EAEFO,EAAO,WAAaP,UACXD,GAAoBJ,EAI7BY,EAAO,WAAcC,GAAaT,GAAoBJ,EAAqBa,UAClEX,GAAmBA,EAAgB,QAAQ,OAAO,IAAM,EAEjEU,EAAO,WAAcC,GAAa,IAAI,IAAIA,EAAUX,CAAe,EAAE,aAC5DI,EAAW,CACpB,IAAMQ,EAAyBlD,GAAiC,EAC5DkD,IAEFF,EAAO,WAAcC,GAAaC,EAAyBD,EAE/D,CAEAN,EAAeK,CAAM,EAAE,KAEpBG,GAAW,CACV5B,GAAe,GACfD,GAAc,GACdD,GAAO8B,EACPL,EAAQ,EACJJ,GACF,IAAI,gBAAgBA,CAAS,CAEjC,EAECU,GAAS,CACR7B,GAAe,GACfC,GAAU,GACVuB,EAAOK,CAAI,CACb,CACF,CACF,CAAC,CACH,EAEA,MAAM,QAAQ,KAAKP,CAAK,EAEpBD,EACF,MAAM,IAAI,MAAM,2DAA2DZ,CAAO,IAAI,CAE1F,EAEaH,GAAc,IAAqB,CAC9C,GAAIP,IAAeD,GACjB,OAAOA,GAGT,MAAM,IAAI,MAAM,qCAAqC,CACvD,CAAA,CAAA,ECtOagC,GAeAC,GAgCAC,GApDbC,GAAA7D,GAAA,IAAA,CAAA,aAGAmC,GAAAA,EAEauB,GAAkB,CAACI,EAAcC,IAA6B,CACzE,IAAMrC,EAAOQ,GAAY,EAEnB8B,EAAatC,EAAK,gBAAgBoC,CAAI,EAAI,EAC1CG,EAAavC,EAAK,QAAQsC,CAAU,EAC1C,OAAAtC,EAAK,aAAaoC,EAAMG,EAAYD,CAAU,EAC9CD,EAAO,KAAKE,CAAU,EAEfA,CACT,EAMaN,GAAsB,CACjCO,EACAC,EACAC,EACAC,IACS,CACT,GAAI,OAAOH,GAAW,UAAYA,IAAY,KAAM,CAClD,GAAIE,EAAK,IAAIF,CAAO,EAClB,MAAM,IAAI,MAAM,+BAA+B,EAE/CE,EAAK,IAAIF,CAAO,CAEpB,CAEA,OAAO,QAAQA,CAAO,EAAE,QAAQ,CAAC,CAACI,EAAKC,CAAK,IAAM,CAChD,IAAMC,EAAOL,EAASA,EAASG,EAAMA,EACrC,GAAI,OAAOC,GAAU,SACnBZ,GAAoBY,EAAkCC,EAAO,IAAKJ,EAAMC,CAAO,UACtE,OAAOE,GAAU,UAAY,OAAOA,GAAU,SACvDF,EAAQG,EAAMD,EAAM,SAAS,CAAC,UACrB,OAAOA,GAAU,UAC1BF,EAAQG,EAAMD,EAAQ,IAAM,GAAG,MAE/B,OAAM,IAAI,MAAM,mCAAmC,OAAOA,CAAK,EAAE,CAErE,CAAC,CACH,EAMaX,GAAkBa,GAA0B,CACvD,IAAM/C,EAAOQ,GAAY,EAEnBwC,EAAQhD,EAAK,UAAU,EAC7B,GAAI,CACF,IAAMiD,EAAUjD,EAAK,SACfkD,EAAelD,EAAK,WAAW,EAAIiD,CAAO,EAChDjD,EAAK,iBAAiBkD,EAAcA,EAAeD,CAAO,EAC1D,IAAME,EAAY,OAAOnD,EAAK,SAASkD,EAAcD,IAAY,EAAI,MAAQ,KAAK,CAAC,EAC7EG,EAAsBpD,EAAK,SAASkD,EAAeD,EAAS,GAAG,EAC/DI,EAAeD,EAAsBpD,EAAK,aAAaoD,CAAmB,EAAI,GACpF,MAAM,IAAI,MAAM,GAAGL,CAAO,gBAAgBI,CAAS,oBAAoBE,CAAY,EAAE,CACvF,QAAA,CACErD,EAAK,aAAagD,CAAK,CACzB,CACF,CAAA,CAAA,EC3DaM,GARbC,GAAAjF,GAAA,IAAA,CAAA,aAKAmC,GAAAA,EACA0B,GAAAA,EAEamB,GAAiBd,GAA6D,CACzF,IAAMxC,EAAOQ,GAAY,EACrBgD,EAAmB,EACjBnB,EAAmB,CAAC,EAEpBoB,EAA0CjB,GAAW,CAAC,EAE5D,GAAI,CACF,GAAIA,GAAS,mBAAqB,OAChCiB,EAAW,iBAAmB,UAE9B,OAAOjB,EAAQ,kBAAqB,UACpC,CAAC,OAAO,UAAUA,EAAQ,gBAAgB,GAC1CA,EAAQ,iBAAmB,GAC3BA,EAAQ,iBAAmB,EAE3B,MAAM,IAAI,MAAM,qCAAqCA,EAAQ,gBAAgB,EAAE,EAGjF,GAAIA,GAAS,oBAAsB,OACjCiB,EAAW,kBAAoB,UACtB,OAAOjB,EAAQ,mBAAsB,UAAY,CAAC,OAAO,UAAUA,EAAQ,iBAAiB,EACrG,MAAM,IAAI,MAAM,qCAAqCA,EAAQ,iBAAiB,EAAE,EAG9EA,GAAS,YAAc,SACzBiB,EAAW,UAAY,IAGzB,IAAIC,EAAgB,EACpB,OAAIlB,GAAS,MAAQ,SACnBkB,EAAgB1B,GAAgBQ,EAAQ,IAAKH,CAAM,GAGrDmB,EAAmBxD,EAAK,qBACtByD,EAAW,iBACXA,EAAW,kBACX,CAAC,CAACA,EAAW,UACbC,CACF,EACIF,IAAqB,GACvBtB,GAAe,2BAA2B,EAGxCM,GAAS,QAAU,QACrBP,GAAoBO,EAAQ,MAAO,GAAI,IAAI,QAAoC,CAACI,EAAKC,IAAU,CAC7F,IAAMc,EAAgB3B,GAAgBY,EAAKP,CAAM,EAC3CuB,EAAkB5B,GAAgBa,EAAOR,CAAM,EAEjDrC,EAAK,sBAAsBwD,EAAkBG,EAAeC,CAAe,IAAM,GACnF1B,GAAe,iCAAiCU,CAAG,MAAMC,CAAK,GAAG,CAErE,CAAC,EAGI,CAACW,EAAkBnB,CAAM,CAClC,OAASwB,EAAG,CACV,MAAIL,IAAqB,GACvBxD,EAAK,sBAAsBwD,CAAgB,EAE7CnB,EAAO,QAASyB,GAAU9D,EAAK,MAAM8D,CAAK,CAAC,EACrCD,CACR,CACF,CAAA,CAAA,EC/DME,GAeAC,GAWAC,GAsBAC,GAcAC,GA+FOC,GArKbC,GAAA/F,GAAA,IAAA,CAAA,aAKAmC,GAAAA,EACA0B,GAAAA,EAEM4B,GAA4BO,GAAqD,CACrF,OAAQA,EAAwB,CAC9B,IAAK,WACH,MAAO,GACT,IAAK,QACH,MAAO,GACT,IAAK,WACH,MAAO,GACT,IAAK,MACH,MAAO,IACT,QACE,MAAM,IAAI,MAAM,yCAAyCA,CAAsB,EAAE,CACrF,CACF,EAEMN,GAAoBO,GAAqD,CAC7E,OAAQA,EAAe,CACrB,IAAK,aACH,MAAO,GACT,IAAK,WACH,MAAO,GACT,QACE,MAAM,IAAI,MAAM,+BAA+BA,CAAa,EAAE,CAClE,CACF,EAEMN,GAAwBzB,GAAmD,CAC1EA,EAAQ,QACXA,EAAQ,MAAQ,CAAC,GAEdA,EAAQ,MAAM,UACjBA,EAAQ,MAAM,QAAU,CAAC,GAE3B,IAAMgC,EAAUhC,EAAQ,MAAM,QACzBgC,EAAQ,+BAEXA,EAAQ,6BAA+B,KAKvChC,EAAQ,oBACRA,EAAQ,mBAAmB,KAAMiC,IAAQ,OAAOA,GAAO,SAAWA,EAAKA,EAAG,QAAU,QAAQ,IAE5FjC,EAAQ,iBAAmB,GAE/B,EAEM0B,GAAsB,CAACQ,EAA8B9B,EAAaC,EAAeR,IAA2B,CAChH,IAAMsB,EAAgB3B,GAAgBY,EAAKP,CAAM,EAC3CuB,EAAkB5B,GAAgBa,EAAOR,CAAM,EACjD7B,GAAY,EAAE,0BAA0BkE,EAAsBf,EAAeC,CAAe,IAAM,GACpG1B,GAAe,qCAAqCU,CAAG,MAAMC,CAAK,GAAG,CAEzE,EAQMsB,GAAwB,MAC5BO,EACAC,EACAtC,IACkB,CAClB,QAAWoC,KAAME,EAAoB,CACnC,IAAIC,EAAS,OAAOH,GAAO,SAAWA,EAAKA,EAAG,KACxCI,EAAqC,CAAC,EAG5C,OAAQD,EAAQ,CACd,IAAK,QAEH,GADAA,EAAS,QACL,OAAOH,GAAO,SAAU,CAG1B,IAAMK,EAFeL,GAEsD,WACvEK,GACFZ,GAAoBQ,EAAsB,aAAcI,EAAYzC,CAAM,CAE9E,CACA,MACF,IAAK,SA2BD,GADAuC,EAAS,KACL,OAAOH,GAAO,SAAU,CAC1B,IAAMM,EAAgBN,EACtB,GAAIM,GAAe,gBAAiB,CAClC,GAAIA,EAAc,kBAAoB,QAAUA,EAAc,kBAAoB,OAChF,MAAM,IAAI,MAAM,oDAAoDA,EAAc,eAAe,EAAE,EAErGb,GAAoBQ,EAAsB,kBAAmBK,EAAc,gBAAiB1C,CAAM,CACpG,CACF,CAEF,MACF,IAAK,OACL,IAAK,MACH,SACF,QACE,MAAM,IAAI,MAAM,qCAAqCuC,CAAM,EAAE,CACjE,CAEA,IAAMI,EAAmBhD,GAAgB4C,EAAQvC,CAAM,EACjD4C,EAAiBJ,EAAU,OAC7BK,EAAa,EACbC,EAAe,EACnB,GAAIF,EAAiB,EAAG,CACtBC,EAAa1E,GAAY,EAAE,QAAQyE,EAAiBzE,GAAY,EAAE,QAAQ,EAC1E6B,EAAO,KAAK6C,CAAU,EACtBC,EAAe3E,GAAY,EAAE,QAAQyE,EAAiBzE,GAAY,EAAE,QAAQ,EAC5E6B,EAAO,KAAK8C,CAAY,EACxB,QAASC,EAAI,EAAGA,EAAIH,EAAgBG,IAClC5E,GAAY,EAAE,SAAS0E,EAAaE,EAAI5E,GAAY,EAAE,SAAUqE,EAAUO,CAAC,EAAE,CAAC,EAAG,GAAG,EACpF5E,GAAY,EAAE,SAAS2E,EAAeC,EAAI5E,GAAY,EAAE,SAAUqE,EAAUO,CAAC,EAAE,CAAC,EAAG,GAAG,CAE1F,CAEG,MAAM5E,GAAY,EAAE,4BACnBkE,EACAM,EACAE,EACAC,EACAF,CACF,IAAO,GAEP/C,GAAe,oCAAoC0C,CAAM,GAAG,CAEhE,CACF,EAEaR,GAAoB,MAAO5B,GAA2E,CACjH,IAAMxC,EAAOQ,GAAY,EACrBkE,EAAuB,EACrBrC,EAAmB,CAAC,EAEpBgD,EAAkD7C,GAAW,CAAC,EACpEyB,GAAqBoB,CAAc,EAEnC,GAAI,CACF,IAAMf,EAAyBP,GAAyBsB,EAAe,wBAA0B,KAAK,EAChGd,EAAgBP,GAAiBqB,EAAe,eAAiB,YAAY,EAC7EC,EACJ,OAAOD,EAAe,OAAU,SAAWrD,GAAgBqD,EAAe,MAAOhD,CAAM,EAAI,EAEvFkD,EAAmBF,EAAe,kBAAoB,EAC5D,GAAI,CAAC,OAAO,UAAUE,CAAgB,GAAKA,EAAmB,GAAKA,EAAmB,EACpF,MAAM,IAAI,MAAM,qCAAqCA,CAAgB,EAAE,EAGzE,IAAMC,EAAoBH,EAAe,mBAAqB,EAC9D,GAAI,CAAC,OAAO,UAAUG,CAAiB,GAAKA,EAAoB,GAAKA,EAAoB,EACvF,MAAM,IAAI,MAAM,qCAAqCA,CAAiB,EAAE,EAG1E,IAAMC,EACJ,OAAOJ,EAAe,wBAA2B,SAC7CrD,GAAgBqD,EAAe,uBAAwBhD,CAAM,EAC7D,EAsBN,GApBAqC,EAAuB1E,EAAK,yBAC1BsE,EACA,CAAC,CAACe,EAAe,kBACjB,CAAC,CAACA,EAAe,iBACjBd,EACA,CAAC,CAACc,EAAe,gBACjB,EACAC,EACAC,EACAC,EACAC,CACF,EACIf,IAAyB,GAC3BxC,GAAe,+BAA+B,EAG5CmD,EAAe,oBACjB,MAAMlB,GAAsBO,EAAsBW,EAAe,mBAAoBhD,CAAM,EAGzFgD,EAAe,qBAAuB,OAAW,CACnD,GAAI,OAAOA,EAAe,oBAAuB,UAC/C,MAAM,IAAI,MAAM,+CAA+CA,EAAe,kBAAkB,EAAE,EAEpGnB,GACEQ,EACA,qBACAW,EAAe,mBAAmB,SAAS,EAC3ChD,CACF,CACF,CAEA,GAAIgD,EAAe,uBACjB,OAAW,CAACvC,EAAMD,CAAK,IAAK,OAAO,QAAQwC,EAAe,sBAAsB,EAAG,CACjF,GAAI,OAAOvC,GAAS,SAClB,MAAM,IAAI,MAAM,kDAAkDA,CAAI,EAAE,EAE1E,GAAI,OAAOD,GAAU,UAAY,CAAC,OAAO,UAAUA,CAAK,GAAKA,EAAQ,EACnE,MAAM,IAAI,MAAM,iEAAiEA,CAAK,EAAE,EAE1F,IAAM6C,EAAa1D,GAAgBc,EAAMT,CAAM,EAC3CrC,EAAK,6BAA6B0E,EAAsBgB,EAAY7C,CAAK,IAAM,GACjFX,GAAe,wCAAwCY,CAAI,MAAMD,CAAK,GAAG,CAE7E,CAGF,OAAIwC,EAAe,QAAU,QAC3BpD,GAAoBoD,EAAe,MAAO,GAAI,IAAI,QAAoC,CAACzC,EAAKC,IAAU,CACpGqB,GAAoBQ,EAAsB9B,EAAKC,EAAOR,CAAM,CAC9D,CAAC,EAGI,CAACqC,EAAsBrC,CAAM,CACtC,OAASwB,EAAG,CACV,MAAIa,IAAyB,GACvB1E,EAAK,0BAA0B0E,CAAoB,IAAM,GAC3DxC,GAAe,gCAAgC,EAGnDG,EAAO,QAASyB,GAAU9D,EAAK,MAAM8D,CAAK,CAAC,EACrCD,CACR,CACF,CAAA,CAAA,ECtNa8B,GAyCAC,GA0CAC,GAqCAC,GAgDAC,GAoBAC,GAcAC,GAgBAC,GArQbC,GAAA7H,GAAA,IAAA,CAAA,aA2CaqH,GAA8BS,GAA2B,CACpE,OAAQA,EAAM,CACZ,IAAK,OACH,MAAO,GACT,IAAK,QACH,MAAO,GACT,IAAK,OACH,MAAO,GACT,IAAK,QACH,MAAO,GACT,IAAK,SACH,MAAO,GACT,IAAK,QACH,MAAO,GACT,IAAK,SACH,MAAO,IACT,IAAK,UACH,MAAO,IACT,IAAK,UACH,MAAO,GACT,IAAK,UACH,MAAO,IACT,IAAK,SACH,MAAO,GACT,IAAK,QACH,MAAO,GACT,IAAK,SACH,MAAO,IACT,IAAK,OACH,MAAO,IACT,IAAK,QACH,MAAO,IAET,QACE,MAAM,IAAI,MAAM,0BAA0BA,CAAI,EAAE,CACpD,CACF,EAKaR,GAA8BS,GAAqC,CAC9E,OAAQA,EAAW,CACjB,IAAK,GACH,MAAO,OACT,IAAK,GACH,MAAO,QACT,IAAK,GACH,MAAO,OACT,IAAK,GACH,MAAO,QACT,IAAK,GACH,MAAO,SACT,IAAK,GACH,MAAO,QACT,IAAK,IACH,MAAO,SACT,IAAK,IACH,MAAO,UACT,IAAK,GACH,MAAO,UACT,IAAK,IACH,MAAO,UACT,IAAK,GACH,MAAO,SACT,IAAK,GACH,MAAO,QACT,IAAK,IACH,MAAO,SACT,IAAK,IACH,MAAO,OACT,IAAK,IACH,MAAO,QAET,QACE,MAAM,IAAI,MAAM,0BAA0BA,CAAS,EAAE,CACzD,CACF,EAMaR,GAA6B,CACxCS,EACAC,IACuB,CACvB,IAAMC,EAAc,CAClB,GACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GACA,EACA,EACA,EACA,EACA,EACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,EACF,EAAEF,CAAQ,EAEJG,EAAO,OAAOF,GAAe,SAAWA,EAAaA,EAAW,OAAO,CAACG,EAAGC,IAAMD,EAAIC,EAAG,CAAC,EAC/F,OAAOH,EAAc,EAAI,KAAK,KAAKC,EAAOD,CAAW,EAAI,MAC3D,EAKaV,GACXM,GAY+B,CAC/B,OAAQA,EAAM,CACZ,IAAK,UAEH,OAAO,OAAO,aAAiB,KAAe,aAAa,KAAO,aAAe,YACnF,IAAK,UACH,OAAO,aACT,IAAK,QACH,OAAO,WACT,IAAK,OACH,OAAO,UACT,IAAK,SACH,OAAO,YACT,IAAK,QACH,OAAO,WACT,IAAK,QACH,OAAO,WACT,IAAK,OACH,OAAO,WACT,IAAK,UACH,OAAO,aACT,IAAK,SACH,OAAO,YACT,IAAK,QACH,OAAO,cACT,IAAK,SACH,OAAO,eACT,QACE,MAAM,IAAI,MAAM,qBAAqBA,CAAI,EAAE,CAC/C,CACF,EAKaL,GAAwBa,GAA0E,CAC7G,OAAQA,EAAU,CAChB,IAAK,UACH,MAAO,GACT,IAAK,OACH,MAAO,GACT,IAAK,UACH,MAAO,GACT,IAAK,QACH,MAAO,GACT,IAAK,QACH,MAAO,GACT,QACE,MAAM,IAAI,MAAM,8BAA8BA,CAAQ,EAAE,CAC5D,CACF,EAKaZ,GAA4BI,GACvCA,IAAS,WACTA,IAAS,WACTA,IAAS,SACTA,IAAS,SACTA,IAAS,UACTA,IAAS,SACTA,IAAS,QACTA,IAAS,SACTA,IAAS,OAKEH,GAA2BG,GACtCA,IAAS,WACTA,IAAS,WACTA,IAAS,SACTA,IAAS,SACTA,IAAS,UACTA,IAAS,UACTA,IAAS,QACTA,IAAS,SACTA,IAAS,QACTA,IAAS,SACTA,IAAS,OAKEF,GAA4BW,GAA0C,CACjF,OAAQA,EAAU,CAChB,IAAK,OACH,MAAO,GACT,IAAK,MACH,MAAO,GACT,IAAK,aACH,MAAO,GACT,IAAK,UACH,MAAO,GACT,IAAK,aACH,MAAO,GACT,IAAK,YACH,MAAO,GACT,QACE,MAAM,IAAI,MAAM,8BAA8BA,CAAQ,EAAE,CAC5D,CACF,CAAA,CAAA,EC3QaC,GAXbC,GAAAzI,GAAA,IAAA,CAAA,aAGAD,GAAAA,EAQayI,GAAW,MAAOE,GAA4E,CACzG,GAAI,OAAOA,GAAS,SAClB,GAAI5I,GAEF,GAAI,CACF,GAAM,CAAE,SAAA6I,CAAS,EAAIC,GAAQ,kBAAkB,EAC/C,OAAO,IAAI,WAAW,MAAMD,EAASD,CAAI,CAAC,CAC5C,OAASnD,EAAG,CACV,GAAIA,EAAE,OAAS,wBAAyB,CAEtC,GAAM,CAAE,iBAAAsD,CAAiB,EAAID,GAAQ,SAAS,EACxCE,EAASD,EAAiBH,CAAI,EAC9BK,EAAuB,CAAC,EAC9B,cAAiBC,KAASF,EACxBC,EAAO,KAAKC,CAAK,EAEnB,OAAO,IAAI,WAAW,OAAO,OAAOD,CAAM,CAAC,CAC7C,CACA,MAAMxD,CACR,KACK,CAEL,IAAM0D,EAAW,MAAM,MAAMP,CAAI,EACjC,GAAI,CAACO,EAAS,GACZ,MAAM,IAAI,MAAM,sCAAsCP,CAAI,EAAE,EAE9D,IAAMQ,EAAsBD,EAAS,QAAQ,IAAI,gBAAgB,EAC3DE,EAAWD,EAAsB,SAASA,EAAqB,EAAE,EAAI,EAC3E,GAAIC,EAAW,WAGb,OAAO,IAAI,WAAW,MAAMF,EAAS,YAAY,CAAC,EAC7C,CAEL,GAAI,CAACA,EAAS,KACZ,MAAM,IAAI,MAAM,sCAAsCP,CAAI,qBAAqB,EAEjF,IAAMU,EAASH,EAAS,KAAK,UAAU,EAEnCI,EACJ,GAAI,CAEFA,EAAS,IAAI,YAAYF,CAAQ,CACnC,OAAS5D,EAAG,CACV,GAAIA,aAAa,WAAY,CAE3B,IAAM+D,EAAQ,KAAK,KAAKH,EAAW,KAAK,EACxCE,EAAS,IAAI,YAAY,OAAO,CAAE,QAASC,EAAO,QAASA,CAAM,CAAC,EAAE,MACtE,KACE,OAAM/D,CAEV,CAEA,IAAIgE,EAAS,EAEb,OAAa,CACX,GAAM,CAAE,KAAAC,EAAM,MAAAjF,CAAM,EAAI,MAAM6E,EAAO,KAAK,EAC1C,GAAII,EACF,MAEF,IAAMC,EAAYlF,EAAM,WACV,IAAI,WAAW8E,EAAQE,EAAQE,CAAS,EAChD,IAAIlF,CAAK,EACfgF,GAAUE,CACZ,CACA,OAAO,IAAI,WAAWJ,EAAQ,EAAGF,CAAQ,CAC3C,CACF,KACK,QAAIT,aAAgB,KAClB,IAAI,WAAW,MAAMA,EAAK,YAAY,CAAC,EACrCA,aAAgB,WAClBA,EAEA,IAAI,WAAWA,CAAI,CAE9B,CAAA,CAAA,ECLMgB,GAWOC,GAWAC,GAwGPC,GAOAC,GAiBAC,GAiDOC,GAkBAC,GAkMAC,GA+BAC,GAoIAC,GAiXAC,GAhgCbC,GAAAtK,GAAA,IAAA,CAAA,aAgBAiF,GAAAA,EACAc,GAAAA,EACA8B,GAAAA,EAUA1F,GAAAA,EACA0B,GAAAA,EACA4E,GAAAA,EAmDMiB,GAAU,CAACpH,EAAoBiI,IAA+B,CAChDrI,GAAY,EAAE,SAASI,EAAYiI,CAAY,IAC/C,GAChB3G,GAAe,+BAA+B,CAElD,EAMa+F,GAAc,MAAOa,GAA4B,CAE5Dd,GAAQc,EAAI,KAAK,WAAa/C,GAAqB+C,EAAI,QAAQ,CAAC,CAClE,EAQaZ,GAAS,MAAOY,EAAUlE,IAAkC,CAEvEpE,GAAY,EAAE,YAAY,CA8D5B,EAwCM2H,GAAiB,IAAI,IAOrBC,GAA8BW,GAA4C,CAC9E,IAAM/I,EAAOQ,GAAY,EACnBwC,EAAQhD,EAAK,UAAU,EAC7B,GAAI,CACF,IAAMiD,EAAUjD,EAAK,SACfuC,EAAavC,EAAK,WAAW,EAAIiD,CAAO,EAC5BjD,EAAK,wBAAwB+I,EAAexG,EAAYA,EAAaU,CAAO,IAC5E,GAChBf,GAAe,uCAAuC,EAExD,IAAMkE,EAAOnD,IAAY,EAAI,MAAQ,MACrC,MAAO,CAAC,OAAOjD,EAAK,SAASuC,EAAY6D,CAAI,CAAC,EAAG,OAAOpG,EAAK,SAASuC,EAAaU,EAASmD,CAAI,CAAC,CAAC,CACpG,QAAA,CACEpG,EAAK,aAAagD,CAAK,CACzB,CACF,EAEMqF,GAAgC,CACpCU,EACAC,IAC6E,CAC7E,IAAMhJ,EAAOQ,GAAY,EACnBwC,EAAQhD,EAAK,UAAU,EACzBiJ,EAAiB,EACrB,GAAI,CACF,IAAMhG,EAAUjD,EAAK,SACfuC,EAAavC,EAAK,WAAW,EAAIiD,CAAO,EAC5BjD,EAAK,2BAA2B+I,EAAeC,EAAOzG,EAAYA,EAAaU,CAAO,IACtF,GAChBf,GAAe,0CAA0C,EAE3D,IAAMwD,EAAa,OAAO1F,EAAK,SAASuC,EAAY,GAAG,CAAC,EACxD0G,EAAiB,OAAOjJ,EAAK,SAASuC,EAAaU,EAAS,GAAG,CAAC,EAEhE,IAAMiG,EAAclJ,EAAK,OAAOiJ,EAAiB,CAAC,EAClD,GAAIC,IAAgB,EAClB,MAAO,CAACxD,EAAY,CAAC,EAIvB,IAAMyD,EAAYnJ,EAAK,QAAQiJ,EAAiB,EAAI,CAAC,EAE/CG,EAA+B,CAAC,EACtC,QAAShE,EAAI,EAAGA,EAAI+D,EAAW/D,IAAK,CAClC,IAAMiE,EAAwB,OAAOrJ,EAAK,SAASiJ,EAAiB,EAAI7D,EAAInC,EAAS,GAAG,CAAC,EACzFmG,EAAK,KACHC,IAA0B,EACtBrJ,EAAK,aAAaqJ,CAAqB,EACvC,OAAOrJ,EAAK,SAASiJ,EAAiB,GAAK7D,EAAI+D,GAAalG,EAAS,GAAG,CAAC,CAC/E,CACF,CACA,MAAO,CAACyC,EAAYwD,EAAaE,CAAI,CACvC,QAAA,CACEpJ,EAAK,aAAagD,CAAK,EACnBiG,IAAmB,GACrBjJ,EAAK,SAASiJ,CAAc,CAEhC,CACF,EAQaX,GAA0BgB,GAAwC,CAC7E,IAAMtJ,EAAOQ,GAAY,EACnB+I,EAAkBvJ,EAAK,QAAQsJ,EAAM,UAAU,EACrD,GAAIC,IAAoB,EACtB,MAAM,IAAI,MAAM,+DAA+DD,EAAM,UAAU,GAAG,EAEpG,OAAAtJ,EAAK,OAAO,IAAIsJ,EAAOC,CAAe,EAC/B,CAACA,EAAiBD,EAAM,UAAU,CAC3C,EAUaf,GAAgB,MAC3BiB,EACAhH,IACyC,CACzC,IAAI+G,EAAyBE,EACvBzJ,EAAOQ,GAAY,EAErB,MAAM,QAAQgJ,CAAS,EAEzB,CAACD,EAAiBE,CAAe,EAAID,EAC5BA,EAAU,SAAWxJ,EAAK,OAAO,OAE1C,CAACuJ,EAAiBE,CAAe,EAAI,CAACD,EAAU,WAAYA,EAAU,UAAU,EAGhF,CAACD,EAAiBE,CAAe,EAAInB,GAAuBkB,CAAS,EAGvE,IAAIT,EAAgB,EAChBrE,EAAuB,EACvBgF,EAAkB,EAClBrH,EAAmB,CAAC,EAClBsH,EAAwB,CAAC,EACzBC,EAAyB,CAAC,EAEhC,GAAI,CAGF,GAFA,CAAClF,EAAsBrC,CAAM,EAAI,MAAM+B,GAAkB5B,CAAO,EAE5DA,GAAS,cAAgBxC,EAAK,kBAAmB,CACnD,IAAM6J,EAAkB,CAAC,EACzB,QAAW7C,KAAQxE,EAAQ,aAAc,CACvC,IAAMsH,EAAO,OAAO9C,GAAS,SAAWA,EAAOA,EAAK,KACpD6C,EAAgB,KACd/C,GAAS,OAAOE,GAAS,SAAWA,EAAOA,EAAK,IAAI,EAAE,KAAM5E,GAAS,CACnEpC,EAAK,kBAAkB8J,EAAM1H,CAAI,CACnC,CAAC,CACH,CACF,CAGA,MAAM,QAAQ,IAAIyH,CAAe,CACnC,CAEA,QAAWE,KAAYvH,GAAS,oBAAsB,CAAC,EAErD,IADqB,OAAOuH,GAAa,SAAWA,EAAWA,EAAS,QACnD,QAAS,CAE5B,GADA/J,EAAK,yBAA2B,GAC5B,OAAO+J,GAAa,SAAU,CAChC,IAAMC,EAAeD,EACfE,EAAWD,GAA6D,QACxEE,EAAaF,GAAsD,UACnElF,EAAckF,GAAuD,WACrEG,EAAmBH,GAAuD,gBAC5EC,EACFjK,EAAK,eAAiBiK,EACbC,EACTlK,EAAK,eAAiB,MAAMA,EAAK,qBAAsBkK,CAAS,EAEhElK,EAAK,eAAiB,MAAMA,EAAK,qBAAsB,CAAE,WAAA8E,EAAY,gBAAAqF,CAAgB,CAAC,CAE1F,MACEnK,EAAK,eAAiB,MAAMA,EAAK,qBAAsB,EAEzD,KACF,CAGF+I,EAAgB,MAAM/I,EAAK,kBAAkBuJ,EAAiBE,EAAiB/E,CAAoB,EACnG1E,EAAK,wBAAwB+I,CAAa,EACtCA,IAAkB,GACpB7G,GAAe,yBAAyB,EAG1ClC,EAAK,sBAAsB,EAGvBA,EAAK,iBACPA,EAAK,uBAAwB+I,EAAe/I,EAAK,cAAc,EAC/DA,EAAK,eAAiB,OACtBA,EAAK,yBAA2B,IAGlC,GAAM,CAACoK,EAAYC,CAAW,EAAIjC,GAA2BW,CAAa,EAEpEuB,EAAqB,CAAC,CAAC9H,GAAS,mBAEhC+H,EAAa,CAAC,EACdC,EAAc,CAAC,EACfC,EAAkD,CAAC,EACnDC,EAAmD,CAAC,EACpDC,EAAwE,CAAC,EAC/E,QAASvF,EAAI,EAAGA,EAAIgF,EAAYhF,IAAK,CACnC,GAAM,CAACM,EAAYwD,EAAa0B,CAAK,EAAIvC,GAA8BU,EAAe3D,CAAC,EACnFM,IAAe,GACjBxD,GAAe,0BAA0B,EAE3CyH,EAAsB,KAAKjE,CAAU,EACrC,IAAM5C,EAAO9C,EAAK,aAAa0F,CAAU,EACzC6E,EAAW,KAAKzH,CAAI,EACpB2H,EAAc,KACZvB,IAAgB,EACZ,CAAE,KAAApG,EAAM,SAAU,EAAM,EACxB,CAAE,KAAAA,EAAM,SAAU,GAAM,KAAM8C,GAA2BsD,CAAW,EAAG,MAAO0B,CAAO,CAC3F,CACF,CACA,QAASxF,EAAI,EAAGA,EAAIiF,EAAajF,IAAK,CACpC,GAAM,CAACM,EAAYwD,EAAa0B,CAAK,EAAIvC,GAA8BU,EAAe3D,EAAIgF,CAAU,EAChG1E,IAAe,GACjBxD,GAAe,2BAA2B,EAE5C0H,EAAuB,KAAKlE,CAAU,EACtC,IAAMmF,EAAa7K,EAAK,aAAa0F,CAAU,EAC/C8E,EAAY,KAAKK,CAAU,EAC3BH,EAAe,KACbxB,IAAgB,EACZ,CAAE,KAAM2B,EAAY,SAAU,EAAM,EACpC,CAAE,KAAMA,EAAY,SAAU,GAAM,KAAMjF,GAA2BsD,CAAW,EAAG,MAAO0B,CAAO,CACvG,CAqBF,CAiBA,OAAAzC,GAAe,IAAIY,EAAe,CAChCA,EACAY,EACAC,EAjBwC,KAmBxCU,EACA,EACF,CAAC,EACM,CAACvB,EAAewB,EAAYC,EAAaC,EAAeC,CAAc,CAC/E,OAAS7G,EAAG,CACV,MAAA8F,EAAsB,QAASmB,GAAQ9K,EAAK,SAAS8K,CAAG,CAAC,EACzDlB,EAAuB,QAASkB,GAAQ9K,EAAK,SAAS8K,CAAG,CAAC,EAEtDpB,IAAoB,GAClB1J,EAAK,mBAAmB0J,CAAe,IAAM,GAC/CxH,GAAe,2BAA2B,EAI1C6G,IAAkB,GAChB/I,EAAK,mBAAmB+I,CAAa,IAAM,GAC7C7G,GAAe,wBAAwB,EAGrC2B,CACR,QAAA,CACE7D,EAAK,MAAMuJ,CAAe,EACtB7E,IAAyB,GACvB1E,EAAK,0BAA0B0E,CAAoB,IAAM,GAC3DxC,GAAe,gCAAgC,EAGnDG,EAAO,QAASyB,GAAU9D,EAAK,MAAM8D,CAAK,CAAC,EAG3C9D,EAAK,sBAAsB,CAC7B,CACF,EAEawI,GAAkBuC,GAA4B,CACzD,IAAM/K,EAAOQ,GAAY,EACnBgE,EAAU2D,GAAe,IAAI4C,CAAS,EAC5C,GAAI,CAACvG,EACH,MAAM,IAAI,MAAM,+CAA+CuG,CAAS,EAAE,EAE5E,GAAM,CAAChC,EAAeY,EAAuBC,EAAwBoB,EAAgBV,CAAkB,EAAI9F,EAEvGwG,IACEV,GACEtK,EAAK,sBAAsBgL,EAAe,MAAM,IAAM,GACxD9I,GAAe,4BAA4B,EAG3ClC,EAAK,mBAAmBgL,EAAe,MAAM,IAAM,GACrD9I,GAAe,2BAA2B,GAI9ClC,EAAK,uBAAuB+K,CAAS,EACrC/K,EAAK,wBAAwB+K,CAAS,EACtC/K,EAAK,yBAAyB+K,CAAS,EAEvCpB,EAAsB,QAASmB,GAAQ9K,EAAK,SAAS8K,CAAG,CAAC,EACzDlB,EAAuB,QAASkB,GAAQ9K,EAAK,SAAS8K,CAAG,CAAC,EACtD9K,EAAK,mBAAmB+I,CAAa,IAAM,GAC7C7G,GAAe,wBAAwB,EAEzCiG,GAAe,OAAO4C,CAAS,CACjC,EAEatC,GAA2B,MACtCwC,EACAC,EACA7I,EACA0I,EACAI,EACAnC,EACAsB,EAAqB,KACH,CAClB,GAAI,CAACW,EAAQ,CACXC,EAAc,KAAK,CAAC,EACpB,MACF,CAEA,IAAMlL,EAAOQ,GAAY,EACnByC,EAAUjD,EAAK,SAEfoL,EAAWH,EAAO,CAAC,EACnB7B,EAAO6B,EAAO,CAAC,EACfpE,EAAWoE,EAAO,CAAC,EACrBI,EAAiBxE,EAEjByE,EACAC,EAEJ,GAAIH,IAAa,WAAavE,IAAa,cAAgBA,IAAa,aACtE,MAAM,IAAI,MAAM,wCAAwC,EAG1D,GAAIyD,GAAsBzD,IAAa,aACrC,MAAM,IAAI,MACR,2DAA2DmC,CAAK,mCAClE,EAGF,GAAInC,IAAa,aAAc,CAC7B,IAAM2E,EAAYP,EAAO,CAAC,EAAE,UAC5BM,EAAiB1F,GAA2BF,GAA2ByF,CAAQ,EAAGhC,CAAI,EAS/E,CACL,IAAMqC,EAAiBzL,EAAK,mBAC5B,GAAI,CAACyL,EACH,MAAM,IAAI,MAAM,qEAAqE,EAEvFH,EAAUG,EAAeV,EAAW/B,EAAOwC,EAAWD,CAAc,CACtE,CACF,SAAW1E,IAAa,YAAa,CACnC,IAAM6E,EAAWT,EAAO,CAAC,EAAE,SAC3BM,EAAiB1F,GAA2BF,GAA2ByF,CAAQ,EAAGhC,CAAI,EAEtF,IAAMuC,EAAmB3L,EAAK,sBAC9B,GAAI,CAAC2L,EACH,MAAM,IAAI,MAAM,mEAAmE,EAErFL,EAAUK,EAAiBZ,EAAWW,EAAU/F,GAA2ByF,CAAQ,EAAGhC,CAAI,CAC5F,KAAO,CACL,IAAMhH,EAAO6I,EAAO,CAAC,EAErB,GAAI,MAAM,QAAQ7I,CAAI,EAAG,CAEvBmJ,EAAiBtI,EAAUb,EAAK,OAChCkJ,EAAUtL,EAAK,QAAQuL,CAAc,EACrClJ,EAAO,KAAKiJ,CAAO,EACnB,QAASlG,EAAI,EAAGA,EAAIhD,EAAK,OAAQgD,IAAK,CACpC,GAAI,OAAOhD,EAAKgD,CAAC,GAAM,SACrB,MAAM,IAAI,UAAU,wBAAwBA,CAAC,kBAAkB,EAEjEpF,EAAK,SAASsL,EAAUlG,EAAInC,EAASjB,GAAgBI,EAAKgD,CAAC,EAAG/C,CAAM,EAAG,GAAG,CAC5E,CACF,KAAO,CACL,IAAMuJ,EAAe5L,EAAK,kBAC1B,GAAIoL,IAAa,UAAYQ,EAAc,CACzC,IAAMC,EAAa7L,EAAK,aAAamL,CAAqB,EAE1D,GAAIS,EAAab,EAAWc,CAAU,EAAG,CACvC,IAAMC,EAAenG,GAA2ByF,CAAQ,EACxDG,EAAiB1F,GAA2BiG,EAAc1C,CAAI,EAC9DiC,EAAiB,YACjB,IAAMU,EAAwB/L,EAAK,2BAC7BgM,EAAehM,EAAK,kBAC1B,GAAI,CAAC+L,GAAyB,CAACC,EAC7B,MAAM,IAAI,MAAM,mEAAmE,EAErF,IAAMC,EAAW,MAAMF,EAAsBhB,EAAWe,EAAc1C,CAAgB,EACtF4C,EAAaC,EAAU,IAAI,WAAW7J,EAAK,OAAQA,EAAK,WAAYA,EAAK,UAAU,CAAC,EACpFkJ,EAAUW,CACZ,MACEV,EAAiBnJ,EAAK,WACtBkJ,EAAUtL,EAAK,QAAQuL,CAAc,EACrClJ,EAAO,KAAKiJ,CAAO,EACnBtL,EAAK,OAAO,IAAI,IAAI,WAAWoC,EAAK,OAAQA,EAAK,WAAYmJ,CAAc,EAAGD,CAAO,CAEzF,MACEC,EAAiBnJ,EAAK,WACtBkJ,EAAUtL,EAAK,QAAQuL,CAAc,EACrClJ,EAAO,KAAKiJ,CAAO,EACnBtL,EAAK,OAAO,IAAI,IAAI,WAAWoC,EAAK,OAAQA,EAAK,WAAYmJ,CAAc,EAAGD,CAAO,CAEzF,CACF,CAEA,IAAMtI,EAAQhD,EAAK,UAAU,EACvBkM,EAAalM,EAAK,WAAW,EAAIoJ,EAAK,MAAM,EAClD,GAAI,CACFA,EAAK,QAAQ,CAAC+C,EAAGnD,IAAUhJ,EAAK,SAASkM,EAAalD,EAAQ/F,EAASkJ,EAAGlJ,IAAY,EAAI,MAAQ,KAAK,CAAC,EACxG,IAAMgI,EAASjL,EAAK,iBAClB2F,GAA2ByF,CAAQ,EACnCE,EACAC,EACAW,EACA9C,EAAK,OACLlD,GAAyBmF,CAAc,CACzC,EACIJ,IAAW,GACb/I,GAAe,iDAAiD6I,CAAS,WAAW/B,CAAK,GAAG,EAE9FkC,EAAc,KAAKD,CAAM,CAC3B,QAAA,CACEjL,EAAK,aAAagD,CAAK,CACzB,CACF,EAKa0F,GAAM,MACjBqC,EACAqB,EACAC,EACAC,EACAC,EACA/J,IAC8B,CAC9B,IAAMxC,EAAOQ,GAAY,EACnByC,EAAUjD,EAAK,SACfwE,EAAU2D,GAAe,IAAI4C,CAAS,EAC5C,GAAI,CAACvG,EACH,MAAM,IAAI,MAAM,6CAA6CuG,CAAS,EAAE,EAE1E,IAAMhC,EAAgBvE,EAAQ,CAAC,EACzBmF,EAAwBnF,EAAQ,CAAC,EACjCoF,EAAyBpF,EAAQ,CAAC,EAClCwG,EAAiBxG,EAAQ,CAAC,EAC1B8F,EAAqB9F,EAAQ,CAAC,EAC9BgI,EAAmBhI,EAAQ,CAAC,EAE5B4F,EAAagC,EAAa,OAC1B/B,EAAciC,EAAc,OAE9B9I,EAAmB,EACnBiJ,EAA6B,CAAC,EAE5BC,EAA+B,CAAC,EAChCC,EAAgC,CAAC,EACjCC,EAA8B,CAAC,EAE/BC,EAAiB7M,EAAK,UAAU,EAChC8M,EAAoB9M,EAAK,WAAWoK,EAAanH,CAAO,EACxD8J,EAAmB/M,EAAK,WAAWoK,EAAanH,CAAO,EACvD+J,EAAqBhN,EAAK,WAAWqK,EAAcpH,CAAO,EAC1DgK,EAAoBjN,EAAK,WAAWqK,EAAcpH,CAAO,EAE/D,GAAI,CACF,CAACO,EAAkBiJ,CAAgB,EAAInJ,GAAcd,CAAO,EAG5D,QAAS4C,EAAI,EAAGA,EAAIgF,EAAYhF,IAC9B,MAAMqD,GACJ4D,EAAajH,CAAC,EACdsH,EACAE,EACA7B,EACApB,EAAsByC,EAAahH,CAAC,CAAC,EACrCgH,EAAahH,CAAC,EACdkF,CACF,EAIF,QAASlF,EAAI,EAAGA,EAAIiF,EAAajF,IAC/B,MAAMqD,GACJ8D,EAAcnH,CAAC,EACfuH,EACAC,EACA7B,EACAnB,EAAuB0C,EAAclH,CAAC,CAAC,EACvCgF,EAAakC,EAAclH,CAAC,EAC5BkF,CACF,EAGF,QAASlF,EAAI,EAAGA,EAAIgF,EAAYhF,IAC9BpF,EAAK,SAAS8M,EAAoB1H,EAAInC,EAASyJ,EAAmBtH,CAAC,EAAG,GAAG,EACzEpF,EAAK,SAAS+M,EAAmB3H,EAAInC,EAAS0G,EAAsByC,EAAahH,CAAC,CAAC,EAAG,GAAG,EAE3F,QAASA,EAAI,EAAGA,EAAIiF,EAAajF,IAC/BpF,EAAK,SAASgN,EAAqB5H,EAAInC,EAAS0J,EAAoBvH,CAAC,EAAG,GAAG,EAC3EpF,EAAK,SAASiN,EAAoB7H,EAAInC,EAAS2G,EAAuB0C,EAAclH,CAAC,CAAC,EAAG,GAAG,EAuD9FpF,EAAK,iBAAiB+I,CAAa,EACnC/I,EAAK,kBAAkB+I,CAAa,EAEpC,IAAI5F,EAUFA,EAAY,MAAMnD,EAAK,QACrB+I,EACAgE,EACAD,EACA1C,EACA6C,EACA5C,EACA2C,EACAxJ,CACF,EAGEL,IAAc,GAChBjB,GAAe,0BAA0B,EAG3C,IAAMgL,EAA2B,CAAC,EAElC,QAAS9H,EAAI,EAAGA,EAAIiF,EAAajF,IAAK,CACpC,IAAM6F,EAAS,OAAOjL,EAAK,SAASgN,EAAqB5H,EAAInC,EAAS,GAAG,CAAC,EAC1E,GAAIgI,IAAW0B,EAAoBvH,CAAC,EAAG,CAErC8H,EAAO,KAAKX,EAAcnH,CAAC,CAAE,EAC7B,QACF,CAEA,IAAM+H,EAA2BnN,EAAK,UAAU,EAE1CoN,EAAmBpN,EAAK,WAAW,EAAIiD,CAAO,EAEhDoK,GAAmB,GACnBjH,EACF7D,EAAa,EACf,GAAI,CACgBvC,EAAK,kBACrBiL,EACAmC,EACAA,EAAmBnK,EACnBmK,EAAmB,EAAInK,EAEvBmK,EAAmB,EAAInK,CACzB,IACkB,GAChBf,GAAe,4CAA4CkD,CAAC,GAAG,EAEjE,IAAMkI,EAAYrK,IAAY,EAAI,MAAQ,MACpCmI,GAAW,OAAOpL,EAAK,SAASoN,EAAkBE,CAAS,CAAC,EAClE/K,EAAavC,EAAK,SAASoN,EAAmBnK,EAAS,GAAG,EAC1D,IAAMiJ,GAAalM,EAAK,SAASoN,EAAmBnK,EAAU,EAAG,GAAG,EAC9DsK,GAAa,OAAOvN,EAAK,SAASoN,EAAmBnK,EAAU,EAAGqK,CAAS,CAAC,EAC5ElE,GAAO,CAAC,EACd,QAAShE,GAAI,EAAGA,GAAImI,GAAYnI,KAC9BgE,GAAK,KAAK,OAAOpJ,EAAK,SAASkM,GAAa9G,GAAInC,EAASqK,CAAS,CAAC,CAAC,EAElEtN,EAAK,SAASkM,EAAU,IAAM,GAChChK,GAAe,oCAAoC,EAErD,IAAMuE,GAAO2C,GAAK,OAAO,CAAC1C,GAAGC,KAAMD,GAAIC,GAAG,CAAC,EAC3CP,EAAOR,GAA2BwF,EAAQ,EAE1C,IAAMoC,GAAoBxC,GAAgB,yBAAyBsB,EAAclH,CAAC,CAAC,EAEnF,GAAIgB,IAAS,SAAU,CACrB,GAAIoH,KAAsB,cAAgBA,KAAsB,YAC9D,MAAM,IAAI,MAAM,wCAAwC,EAE1D,IAAMC,GAAuB,CAAC,EAC9B,QAASrI,GAAI,EAAGA,GAAIqB,GAAMrB,KAAK,CAC7B,IAAMyC,GAAS7H,EAAK,SAASuC,EAAa6C,GAAInC,EAAS,GAAG,EACpDyK,GAAa1N,EAAK,SAASuC,GAAc6C,GAAI,GAAKnC,EAAS,GAAG,EAC9D0K,GAAiBvI,KAAMqB,GAAO,EAAI,OAAYiH,GAAa7F,GACjE4F,GAAW,KAAKzN,EAAK,aAAa6H,GAAQ8F,EAAc,CAAC,CAC3D,CACAT,EAAO,KAAK,CAAC9G,EAAMgD,GAAMqE,GAAY,KAAK,CAAC,CAC7C,SAGMD,KAAsB,cAAgB/G,GAAO,EAAG,CAClD,IAAMmH,GAA8D5N,EAAK,cACzE,GAAI,CAAC4N,GACH,MAAM,IAAI,MAAM,uEAAuE,EAEzF,IAAMpC,GAAYoC,GAAUrL,CAAU,EAChCsL,GAAahI,GAA2BuF,GAAU3E,EAAI,EAC5D,GAAIoH,KAAe,QAAa,CAAC7H,GAAyBI,CAAI,EAC5D,MAAM,IAAI,MAAM,0BAA0BA,CAAI,EAAE,EAIlDiH,GAAmB,GAwBjBH,EAAO,KAAK,CACV9G,EACAgD,GACA,CACE,UAAAoC,GACA,SAAUxL,EAAK,qBAAsBwL,GAAWqC,GAAYzH,CAAI,EAChE,QAAS,IAAM,CACTpG,EAAK,kBAAkBiL,CAAM,IAAM,GACrC/I,GAAe,uBAAuB,CAE1C,CACF,EACA,YACF,CAAC,CAEL,SAAWsL,KAAsB,aAAe/G,GAAO,EAAG,CACxD,IAAMqH,GAAe9N,EAAK,kBACpB+N,GAAmB/N,EAAK,sBAC9B,GAAI,CAAC8N,IAAgB,CAACC,GACpB,MAAM,IAAI,MAAM,qEAAqE,EAGvF,GADmBlI,GAA2BuF,GAAU3E,EAAI,IACzC,QAAa,CAACR,GAAwBG,CAAI,EAC3D,MAAM,IAAI,MAAM,0BAA0BA,CAAI,EAAE,EAElD,GAAIA,IAAS,SAAW,CAAC2H,GAAiBhD,CAAS,EACjD,MAAM,IAAI,MACR,2FACF,EAMF,IAAMW,GAAW,MAAMoC,GAAa/C,EAAWxI,EAAY6I,GAAUhC,GAAM,EAAK,EAGhFiE,GAAmB,GAEnBH,EAAO,KAAK,CACV9G,EACAgD,GACA,CACE,SAAAsC,GACA,SAAU1L,EAAK,8BAA+BuC,EAAY6D,CAAI,EAC9D,QAAS,IAAM,CACbpG,EAAK,qBAAsBuC,CAAU,EACrCvC,EAAK,kBAAkBiL,CAAM,CAC/B,CACF,EACA,WACF,CAAC,CACH,KAAO,CACL,IAAM+C,GAAwBlI,GAAkCM,CAAI,EAC9DhE,GAAO,IAAI4L,GAAsBvH,EAAI,EAC3C,IAAI,WAAWrE,GAAK,OAAQA,GAAK,WAAYA,GAAK,UAAU,EAAE,IAC5DpC,EAAK,OAAO,SAASuC,EAAYA,EAAaH,GAAK,UAAU,CAC/D,EACA8K,EAAO,KAAK,CAAC9G,EAAMgD,GAAMhH,GAAM,KAAK,CAAC,CACvC,CAEJ,QAAA,CACEpC,EAAK,aAAamN,CAAwB,EACtC/G,IAAS,UAAY7D,GACvBvC,EAAK,MAAMuC,CAAU,EAElB8K,IACHrN,EAAK,kBAAkBiL,CAAM,EAE/BjL,EAAK,gBAAgB+I,CAAa,CACpC,CACF,CAEA,OAAIiC,GAAkB,CAACV,IACjBtK,EAAK,sBAAsBgL,EAAe,MAAM,IAAM,GACxD9I,GAAe,4BAA4B,EAE7CiG,GAAe,IAAI4C,EAAW,CAC5BhC,EACAY,EACAC,EACAoB,EACAV,EACA,EACF,CAAC,GAEI4C,CACT,QAAA,CACElN,EAAK,aAAa6M,CAAc,EAchCH,EAAmB,QAASuB,GAAMjO,EAAK,kBAAkBiO,CAAC,CAAC,EAC3DtB,EAAoB,QAASsB,GAAMjO,EAAK,kBAAkBiO,CAAC,CAAC,EAC5DrB,EAAkB,QAASsB,GAAMlO,EAAK,MAAMkO,CAAC,CAAC,EAE1C1K,IAAqB,GACvBxD,EAAK,sBAAsBwD,CAAgB,EAE7CiJ,EAAiB,QAASyB,GAAMlO,EAAK,MAAMkO,CAAC,CAAC,CAC/C,CACF,EAKavF,GAAgBoC,GAA4B,CACvD,IAAM/K,EAAOQ,GAAY,EACnBgE,EAAU2D,GAAe,IAAI4C,CAAS,EAC5C,GAAI,CAACvG,EACH,MAAM,IAAI,MAAM,oBAAoB,EAEtC,IAAMuE,EAAgBvE,EAAQ,CAAC,EAGzB2J,EAAkBnO,EAAK,iBAAiB+I,CAAa,EACvDoF,IAAoB,GACtBjM,GAAe,iCAAiC,EAElDlC,EAAK,SAASmO,CAAe,CAC/B,CAAA,CAAA,ECx/BIjO,GACAD,GACAE,GAwDSiO,GA+EAC,GAaA/F,GAaAC,GAwBAC,GAaAE,GAgCAC,GA9Pb2F,GAAAhQ,GAAA,IAAA,CAAA,aAYAsK,GAAAA,EACAnI,GAAAA,EACAtB,GAAAA,EAQIe,GAAe,GACfD,GAAc,GACdE,GAAU,GAwDDiO,GAAqC,SAA2B,CAC3E,GAAI,CAAAnO,GAGJ,CAAA,GAAIC,GACF,MAAM,IAAI,MAAM,0CAA0C,EAE5D,GAAIC,GACF,MAAM,IAAI,MAAM,uCAAuC,EAGzDD,GAAe,GAuDb,GAAI,CACF,MAAMK,GAAsBuI,GAAI,IAAI,EACpC,MAAWb,GAAYa,EAAG,EAC1B7I,GAAc,EAChB,OAAS4D,EAAG,CACV,MAAA1D,GAAU,GACJ0D,CACR,QAAA,CACE3D,GAAe,EACjB,CAAA,CAEJ,EAEamO,GAAkB,MAAOzJ,GAAkC,CASpE,MAAWsD,GAAOY,GAAKlE,CAAM,CAEjC,EAEa0D,GAAyB,MAAOX,GAS7BW,GAAuBX,CAAM,EAIhCY,GAAgB,MAC3Be,EACA9G,IAkBc+F,GAAce,EAAO9G,CAAO,EAI/BgG,GAAiB,MAAOuC,GAAqC,CASjEvC,GAAeuC,CAAS,CAEjC,EAEarC,GAAM,MACjBqC,EACAqB,EACAmC,EACAjC,EACAkC,EACAhM,IAsBckG,GAAIqC,EAAWqB,EAAcmC,EAAQjC,EAAekC,EAAShM,CAAO,EAIvEmG,GAAe,MAAOoC,GAAqC,CAS/DpC,GAAaoC,CAAS,CAE/B,CAAA,CAAA,ECvPa0D,GAaAC,GAyBAC,GAxDbC,GAAAtQ,GAAA,IAAA,CAAA,aAaAgQ,GAAAA,EACAnI,GAAAA,EACA9H,GAAAA,EACA0I,GAAAA,EAEa0H,GAAuB,CAACxD,EAAgB4D,IAA0C,CAC7F,OAAQ5D,EAAO,SAAU,CACvB,IAAK,MACH,MAAO,CAACA,EAAO,KAAMA,EAAO,KAAMA,EAAO,KAAM,KAAK,EACtD,IAAK,aACH,MAAO,CAACA,EAAO,KAAMA,EAAO,KAAM,CAAE,UAAWA,EAAO,SAAU,EAAG,YAAY,EACjF,IAAK,YACH,MAAO,CAACA,EAAO,KAAMA,EAAO,KAAM,CAAE,SAAUA,EAAO,QAAS,EAAG,WAAW,EAC9E,QACE,MAAM,IAAI,MAAM,0BAA0BA,EAAO,QAAQ,QAAQ4D,EAAQ,CAAC,EAAE,CAChF,CACF,EAEaH,GAAwBzD,GAAmC,CACtE,OAAQA,EAAO,CAAC,EAAG,CACjB,IAAK,MACH,OAAO,IAAI6D,GAAO7D,EAAO,CAAC,EAAGA,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,EACnD,IAAK,aAAc,CACjB,IAAMG,EAAWH,EAAO,CAAC,EACzB,GAAI,CAACjF,GAAyBoF,CAAQ,EACpC,MAAM,IAAI,MAAM,4BAA4BA,CAAQ,+BAA+B,EAErF,GAAM,CAAE,UAAAI,EAAW,SAAAuD,EAAU,QAAAC,CAAQ,EAAI/D,EAAO,CAAC,EACjD,OAAO6D,GAAO,cAActD,EAAW,CAAE,SAAAJ,EAAU,KAAMH,EAAO,CAAC,EAAG,SAAA8D,EAAU,QAAAC,CAAQ,CAAC,CACzF,CACA,IAAK,YAAa,CAChB,IAAM5D,EAAWH,EAAO,CAAC,EACzB,GAAI,CAAChF,GAAwBmF,CAAQ,EACnC,MAAM,IAAI,MAAM,4BAA4BA,CAAQ,oCAAoC,EAE1F,GAAM,CAAE,SAAAM,EAAU,SAAAqD,EAAU,QAAAC,CAAQ,EAAI/D,EAAO,CAAC,EAChD,OAAO6D,GAAO,aAAapD,EAAU,CAAE,SAAAN,EAAU,KAAMH,EAAO,CAAC,EAAG,SAAA8D,EAAU,QAAAC,CAAQ,CAAC,CACvF,CACA,QACE,MAAM,IAAI,MAAM,0BAA0B/D,EAAO,CAAC,CAAC,EAAE,CACzD,CACF,EAEa0D,GAAN,KAA8E,CAQnF,MAAM,8BAA8B7E,EAAmD,CAErF,OAAOxB,GAAuB,MAAMxB,GAASgD,CAAI,CAAC,CACpD,CAEA,MAAM,UAAUmF,EAAmCzM,EAA0D,CAC3G0M,GAAiB,EACjB,IAAI5F,EAEA,OAAO2F,GAAiB,SACtB7Q,GAEFkL,EAAQ,MAAMxC,GAASmI,CAAY,EAInC3F,EAAQ,MAAM,KAAK,8BAA8B2F,CAAY,EAG/D3F,EAAQ2F,EAGV,CAAC,KAAK,UAAW,KAAK,WAAY,KAAK,YAAa,KAAK,cAAe,KAAK,cAAc,EAAI,MAAM1G,GACnGe,EACA9G,CACF,EACA2M,GAAe,CACjB,CAEA,MAAM,SAAyB,CAC7B,OAAO3G,GAAe,KAAK,SAAS,CACtC,CAEA,MAAM,IACJ4G,EACAC,EACA7M,EACoC,CACpC0M,GAAiB,EACjB,IAAMI,EAAuB,CAAC,EACxBlD,EAAyB,CAAC,EAChC,OAAO,QAAQgD,CAAK,EAAE,QAASG,GAAQ,CACrC,IAAMzM,EAAOyM,EAAI,CAAC,EACZtE,EAASsE,EAAI,CAAC,EACdvG,EAAQ,KAAK,WAAW,QAAQlG,CAAI,EAC1C,GAAIkG,IAAU,GACZ,MAAM,IAAI,MAAM,kBAAkBlG,CAAI,GAAG,EAE3CwM,EAAW,KAAKrE,CAAM,EACtBmB,EAAa,KAAKpD,CAAK,CACzB,CAAC,EAED,IAAMwG,EAAoC,CAAC,EACrClD,EAA0B,CAAC,EACjC,OAAO,QAAQ+C,CAAO,EAAE,QAASE,GAAQ,CACvC,IAAMzM,EAAOyM,EAAI,CAAC,EACZtE,EAASsE,EAAI,CAAC,EACdvG,EAAQ,KAAK,YAAY,QAAQlG,CAAI,EAC3C,GAAIkG,IAAU,GACZ,MAAM,IAAI,MAAM,mBAAmBlG,CAAI,GAAG,EAE5C0M,EAAY,KAAKvE,CAAM,EACvBqB,EAAc,KAAKtD,CAAK,CAC1B,CAAC,EAED,IAAMuF,EAASe,EAAW,IAAI,CAACG,EAAGrK,IAChCqJ,GAAqBgB,EAAG,IAAM,UAAU,KAAK,WAAWrD,EAAahH,CAAC,CAAC,CAAC,GAAG,CAC7E,EACMoJ,EAAUgB,EAAY,IAAI,CAACC,EAAGrK,IAClCqK,EAAIhB,GAAqBgB,EAAG,IAAM,WAAW,KAAK,YAAYnD,EAAclH,CAAC,CAAC,CAAC,GAAG,EAAI,IACxF,EAEMsK,EAAU,MAAMhH,GAAI,KAAK,UAAW0D,EAAcmC,EAAQjC,EAAekC,EAAShM,CAAO,EAEzFmN,EAAuC,CAAC,EAC9C,QAASvK,EAAI,EAAGA,EAAIsK,EAAQ,OAAQtK,IAClCuK,EAAU,KAAK,YAAYrD,EAAclH,CAAC,CAAC,CAAC,EAAIoK,EAAYpK,CAAC,GAAKsJ,GAAqBgB,EAAQtK,CAAC,CAAC,EAEnG,OAAA+J,GAAe,EACRQ,CACT,CAEA,gBAAuB,CAEvB,CAEA,cAAqB,CACdhH,GAAa,KAAK,SAAS,CAClC,CACF,CAAA,CAAA,ECzJAiH,GAAA,CAAA,EAAAC,GAAAD,GAAA,CAAA,8BAAA,IAAAE,GAAA,gBAAA,IAAAC,GAAA,YAAA,IAAAC,EAAAA,CAAAA,EAAA,IAcaD,GA4CAD,GAqCAE,GA/FbC,GAAA3R,GAAA,IAAA,CAAA,aAKAgQ,GAAAA,EACAM,GAAAA,EAQamB,GAAkB,IAAY,EACrC,OAAOjH,GAAI,KAAK,aAAgB,UAAYA,GAAI,KAAK,YAAc,KACrEA,GAAI,KAAK,YAAc,GAGzB,IAAMoH,EAAOpH,GAAI,KAAK,KAiBtB,GAhBI,OAAOoH,GAAS,WAAaA,IAAS,QAAaA,IAAS,SAAWA,IAAS,YAElF,QAAQ,KACN,qDAAqDA,CAAI,4DAC3D,EACApH,GAAI,KAAK,KAAO,IAGd,OAAOA,GAAI,KAAK,OAAU,YAC5BA,GAAI,KAAK,MAAQ,IAGf,OAAOA,GAAI,KAAK,OAAU,YAC5BA,GAAI,KAAK,MAAQ,IAGf,OAAOA,GAAI,KAAK,YAAe,UAAY,CAAC,OAAO,UAAUA,GAAI,KAAK,UAAU,GAAKA,GAAI,KAAK,YAAc,EAY9G,GAAI,OAAO,KAAS,KAAe,CAAC,KAAK,oBACvCA,GAAI,KAAK,WAAa,MACjB,CACL,IAAMqH,EACJ,OAAO,UAAc,IAAcjJ,GAAQ,SAAS,EAAE,KAAK,EAAE,OAAS,UAAU,oBAClF4B,GAAI,KAAK,WAAa,KAAK,IAAI,EAAG,KAAK,MAAMqH,GAAsB,GAAK,CAAC,CAAC,CAC5E,CAEJ,EAEaL,GAAN,KAAuD,CAS5D,MAAM,KAAKM,EAAoC,CAE7CL,GAAgB,EAGhB,MAAM3B,GAAmC,EAGzC,MAAMC,GAAgB+B,CAAW,CACnC,CASA,MAAM,8BACJnB,EACAzM,EACkC,CAClC,IAAMG,EAAU,IAAIgM,GACpB,OAAA,MAAMhM,EAAQ,UAAUsM,EAAczM,CAAO,EACtCG,CACT,CACF,EAEaqN,GAAc,IAAIF,EAAAA,CAAAA,EEzFlBO,GAAU,iCDKhBC,GAAQC,GAUe,CAC5B,IAAMP,GAAcQ,GAAA,EAAAC,GAAAC,EAAA,GAA0B,YAK9CC,GAAgB,MAAOX,EAAa,EAAE,EACtCW,GAAgB,OAAQX,EAAa,EAAE,CACzC,CAEA,OAAO,eAAelH,GAAI,SAAU,MAAO,CAAE,MAAOuH,GAAS,WAAY,EAAK,CAAC,EEzBxE,IAAMO,GAAU,SCEvB,IAAIC,GAAwC,UAE/BC,GAAW,CACtB,KAAM,CAAA,EACN,MAAO,CAAA,EACP,OAAQ,CAAA,EACR,SAAU,CAAE,OAAQC,EAAO,EAE3B,IAAI,SAASC,EAAmB,CAC9B,GAAIA,IAAU,OAGd,IAAI,OAAOA,GAAU,UAAY,CAAC,UAAW,OAAQ,UAAW,QAAS,OAAO,EAAE,QAAQA,CAAK,IAAM,GACnG,MAAM,IAAI,MAAM,8BAA8BA,CAAK,EAAE,EAEvDH,GAAgBG,EAClB,EACA,IAAI,UAAQ,CACV,OAAOH,EACT,GAIF,OAAO,eAAeC,GAAK,WAAY,CAAE,WAAY,EAAI,CAAE,ECtBpD,IAAMG,GAAkB,CAACC,EAAgBC,IAA4C,CAC1F,IAAMC,EAAS,OAAO,SAAa,IAAc,SAAS,cAAc,QAAQ,EAAI,IAAI,gBAAgB,EAAG,CAAC,EAC5GA,EAAO,MAAQF,EAAO,KAAK,CAAC,EAC5BE,EAAO,OAASF,EAAO,KAAK,CAAC,EAC7B,IAAMG,EAAkBD,EAAO,WAAW,IAAI,EAK9C,GAAIC,GAAmB,KAAM,CAE3B,IAAIC,EACAC,EACAJ,GAAS,eAAiB,QAAaA,EAAQ,eAAiB,QAClEG,EAAQJ,EAAO,KAAK,CAAC,EACrBK,EAASL,EAAO,KAAK,CAAC,IAGtBI,EAAQJ,EAAO,KAAK,CAAC,EACrBK,EAASL,EAAO,KAAK,CAAC,GAGxB,IAAMM,EAAcL,GAAS,SAAW,OAAYA,EAAQ,OAAS,MAE/DM,EAAON,GAAS,KAClBO,EACAC,EACAF,IAAS,QAAaA,EAAK,OAAS,OACtCC,EAAW,CAAC,IAAK,IAAK,IAAK,GAAG,EAE1B,OAAOD,EAAK,MAAS,SACvBC,EAAW,CAACD,EAAK,KAAMA,EAAK,KAAMA,EAAK,KAAMA,EAAK,IAAI,GAEtDC,EAAW,CAACD,EAAK,KAAK,CAAC,EAAGA,EAAK,KAAK,CAAC,EAAGA,EAAK,KAAK,CAAC,EAAG,CAAC,EACnDA,EAAK,KAAK,CAAC,IAAM,SACnBC,EAAS,CAAC,EAAID,EAAK,KAAK,CAAC,IAI3BA,IAAS,QAAaA,EAAK,OAAS,OACtCE,EAAW,CAAC,EAAG,EAAG,EAAG,CAAC,EAElB,OAAOF,EAAK,MAAS,SACvBE,EAAW,CAACF,EAAK,KAAMA,EAAK,KAAMA,EAAK,KAAMA,EAAK,IAAI,GAEtDE,EAAW,CAACF,EAAK,KAAK,CAAC,EAAGA,EAAK,KAAK,CAAC,EAAGA,EAAK,KAAK,CAAC,EAAG,CAAC,EACnDA,EAAK,KAAK,CAAC,IAAM,SACnBE,EAAS,CAAC,EAAIF,EAAK,KAAK,CAAC,IAK/B,IAAMG,EAASL,EAASD,EAEpBO,EAAiB,EACnBC,EAAiBF,EACjBG,EAAiBH,EAAS,EAC1BI,EAAiB,GAGfR,IAAgB,QAClBK,EAAiB,EACjBC,EAAiBF,EACjBG,EAAiBH,EAAS,EAC1BI,EAAiBJ,EAAS,GACjBJ,IAAgB,OACzBK,EAAiB,EACjBC,EAAiBF,EACjBG,EAAiBH,EAAS,GACjBJ,IAAgB,QACzBK,EAAiB,EACjBE,EAAiBH,EACjBE,EAAiBF,EAAS,GAG5B,QAASK,EAAI,EAAGA,EAAIV,EAAQU,IAC1B,QAASC,EAAI,EAAGA,EAAIZ,EAAOY,IAAK,CAC9B,IAAMC,GAAMjB,EAAO,KAAKW,GAAgB,EAAeF,EAAS,CAAC,GAAKD,EAAS,CAAC,EAC1EU,GAAMlB,EAAO,KAAKY,GAAgB,EAAeH,EAAS,CAAC,GAAKD,EAAS,CAAC,EAC1EW,GAAMnB,EAAO,KAAKa,GAAgB,EAAeJ,EAAS,CAAC,GAAKD,EAAS,CAAC,EAC1EY,EAAIN,IAAmB,GAAK,KAAQd,EAAO,KAAKc,GAAgB,EAAeL,EAAS,CAAC,GAAKD,EAAS,CAAC,EAE9GL,EAAgB,UAAY,QAAUc,EAAI,IAAMC,EAAI,IAAMC,EAAI,IAAMC,EAAI,IACxEjB,EAAgB,SAASa,EAAGD,EAAG,EAAG,CAAC,EAGvC,GAAI,cAAeb,EACjB,OAAOA,EAAO,UAAS,EAEvB,MAAM,IAAI,MAAM,4BAA4B,MAG9C,OAAM,IAAI,MAAM,2BAA2B,CAE/C,EAKamB,GAAoB,CAACrB,EAAgBC,IAAiD,CACjG,IAAME,EACJ,OAAO,SAAa,IAChB,SAAS,cAAc,QAAQ,EAAE,WAAW,IAAI,EAC/C,IAAI,gBAAgB,EAAG,CAAC,EAAE,WAAW,IAAI,EAC5CmB,EACJ,GAAInB,GAAmB,KAAM,CAE3B,IAAIC,EACAC,EACAkB,EACAtB,GAAS,eAAiB,QAAaA,EAAQ,eAAiB,QAClEG,EAAQJ,EAAO,KAAK,CAAC,EACrBK,EAASL,EAAO,KAAK,CAAC,EACtBuB,EAAWvB,EAAO,KAAK,CAAC,IAGxBI,EAAQJ,EAAO,KAAK,CAAC,EACrBK,EAASL,EAAO,KAAK,CAAC,EACtBuB,EAAWvB,EAAO,KAAK,CAAC,GAE1B,IAAMM,EAAcL,IAAY,QAAaA,EAAQ,SAAW,OAAYA,EAAQ,OAAkB,MAEhGM,EAAON,GAAS,KAClBO,EACAC,EACAF,IAAS,QAAaA,EAAK,OAAS,OACtCC,EAAW,CAAC,IAAK,IAAK,IAAK,GAAG,EAE1B,OAAOD,EAAK,MAAS,SACvBC,EAAW,CAACD,EAAK,KAAMA,EAAK,KAAMA,EAAK,KAAMA,EAAK,IAAI,GAEtDC,EAAW,CAACD,EAAK,KAAK,CAAC,EAAGA,EAAK,KAAK,CAAC,EAAGA,EAAK,KAAK,CAAC,EAAG,GAAG,EACrDA,EAAK,KAAK,CAAC,IAAM,SACnBC,EAAS,CAAC,EAAID,EAAK,KAAK,CAAC,IAI3BA,IAAS,QAAaA,EAAK,OAAS,OACtCE,EAAW,CAAC,EAAG,EAAG,EAAG,CAAC,EAElB,OAAOF,EAAK,MAAS,SACvBE,EAAW,CAACF,EAAK,KAAMA,EAAK,KAAMA,EAAK,KAAMA,EAAK,IAAI,GAEtDE,EAAW,CAACF,EAAK,KAAK,CAAC,EAAGA,EAAK,KAAK,CAAC,EAAGA,EAAK,KAAK,CAAC,EAAG,CAAC,EACnDA,EAAK,KAAK,CAAC,IAAM,SACnBE,EAAS,CAAC,EAAIF,EAAK,KAAK,CAAC,IAK/B,IAAMG,EAASL,EAASD,EACxB,GAAIH,IAAY,SAEXA,EAAQ,SAAW,QAAasB,IAAa,GAAKtB,EAAQ,SAAW,QACrEsB,IAAa,GAAKtB,EAAQ,SAAW,OAASA,EAAQ,SAAW,OAElE,MAAM,IAAI,MAAM,+CAA+C,EAKnE,IAAMuB,EAAO,EACTC,EAAgB,EAClBC,EAAgB,EAChBC,EAAgB,EAChBC,EAAgB,EACdjB,EAAiB,EACnBC,EAAiBF,EACjBG,EAAiBH,EAAS,EAC1BI,EAAiB,GAGfR,IAAgB,QAClBK,EAAiB,EACjBC,EAAiBF,EACjBG,EAAiBH,EAAS,EAC1BI,EAAiBJ,EAAS,GACjBJ,IAAgB,OACzBK,EAAiB,EACjBC,EAAiBF,EACjBG,EAAiBH,EAAS,GACjBJ,IAAgB,QACzBK,EAAiB,EACjBE,EAAiBH,EACjBE,EAAiBF,EAAS,GAG5BY,EAAQnB,EAAgB,gBAAgBC,EAAOC,CAAM,EAErD,QACMU,EAAI,EACRA,EAAIV,EAASD,EACbqB,GAAiBD,EAAME,GAAiBF,EAAMG,GAAiBH,EAAMI,GAAiBJ,EAAMT,IAE5FO,EAAM,KAAKG,CAAa,GAAMzB,EAAO,KAAKW,GAAgB,EAAeF,EAAS,CAAC,GAAKD,EAAS,CAAC,EAClGc,EAAM,KAAKI,CAAa,GAAM1B,EAAO,KAAKY,GAAgB,EAAeH,EAAS,CAAC,GAAKD,EAAS,CAAC,EAClGc,EAAM,KAAKK,CAAa,GAAM3B,EAAO,KAAKa,GAAgB,EAAeJ,EAAS,CAAC,GAAKD,EAAS,CAAC,EAClGc,EAAM,KAAKM,CAAa,EACtBd,IAAmB,GAAK,KAAQd,EAAO,KAAKc,GAAgB,EAAeL,EAAS,CAAC,GAAKD,EAAS,CAAC,MAGxG,OAAM,IAAI,MAAM,2BAA2B,EAE7C,OAAOc,CACT,ECnLO,IAAMO,GAAiB,CAACC,EAAuCC,IAA0C,CAC9G,GAAID,IAAW,OACb,MAAM,IAAI,MAAM,8BAA8B,EAEhD,GAAIC,EAAQ,SAAW,QAAaA,EAAQ,QAAU,OACpD,MAAM,IAAI,MAAM,wCAAwC,EAE1D,GAAIA,EAAQ,eAAiB,OAC3B,MAAM,IAAI,MAAM,yCAAyC,EAG3D,GAAM,CAAE,OAAAC,EAAQ,MAAAC,CAAK,EAAKF,EAEpBG,EAAOH,EAAQ,MAAQ,CAAE,KAAM,IAAK,KAAM,CAAC,EAC7CI,EACAC,EAEA,OAAOF,EAAK,MAAS,SACvBC,EAAW,CAACD,EAAK,KAAMA,EAAK,KAAMA,EAAK,KAAMA,EAAK,IAAI,EAEtDC,EAAW,CAACD,EAAK,KAAM,CAAC,EAAGA,EAAK,KAAM,CAAC,EAAGA,EAAK,KAAM,CAAC,EAAGA,EAAK,KAAM,CAAC,GAAK,GAAG,EAG3E,OAAOA,EAAK,MAAS,SACvBE,EAAW,CAACF,EAAK,KAAMA,EAAK,KAAMA,EAAK,KAAMA,EAAK,IAAI,EAEtDE,EAAW,CAACF,EAAK,KAAM,CAAC,EAAGA,EAAK,KAAM,CAAC,EAAGA,EAAK,KAAM,CAAC,EAAGA,EAAK,KAAM,CAAC,GAAK,CAAC,EAG7E,IAAMG,EAAcN,EAAQ,SAAW,OAAYA,EAAQ,OAAS,OAG9DO,EACJP,EAAQ,eAAiB,QAAaA,EAAQ,eAAiB,OAAYA,EAAQ,aAAwB,MACvGQ,EAASP,EAASC,EAClBO,EAAcF,IAAiB,OAAS,IAAI,aAAaC,EAAS,CAAC,EAAI,IAAI,aAAaA,EAAS,CAAC,EAGpGE,EAAO,EACTC,EAAgB,EAChBC,EAAgB,EAChBC,EAAgB,EAChBC,EAAgB,EACdC,EAAiB,EACnBC,EAAiBR,EACjBS,EAAiBT,EAAS,EAC1BU,EAAiB,GAGfZ,IAAgB,QAClBI,EAAO,EACPC,EAAgB,EAChBC,EAAgB,EAChBC,EAAgB,EAChBC,EAAgB,IAIdP,IAAiB,OACnBW,EAAiBV,EAAS,EACjBD,IAAiB,OAC1BQ,EAAiB,EACjBE,EAAiBT,EACjBQ,EAAiBR,EAAS,GACjBD,IAAiB,QAC1BU,EAAiB,EACjBD,EAAiBR,EACjBO,EAAiBP,EAAS,GAG5B,QACMW,EAAI,EACRA,EAAIX,EACJW,IAAKR,GAAiBD,EAAMG,GAAiBH,EAAME,GAAiBF,EAAMI,GAAiBJ,EAE3FD,EAAYM,GAAgB,GAAKhB,EAAOY,CAAa,EAAIN,EAAS,CAAC,GAAKD,EAAS,CAAC,EAClFK,EAAYO,GAAgB,GAAKjB,EAAOa,CAAa,EAAIP,EAAS,CAAC,GAAKD,EAAS,CAAC,EAClFK,EAAYQ,GAAgB,GAAKlB,EAAOc,CAAa,EAAIR,EAAS,CAAC,GAAKD,EAAS,CAAC,EAC9Ec,IAAmB,IAAMJ,IAAkB,KAC7CL,EAAYS,GAAgB,GAAKnB,EAAOe,CAAa,EAAIT,EAAS,CAAC,GAAKD,EAAS,CAAC,GAStF,OAHEG,IAAiB,OACb,IAAIa,GAAO,UAAWX,EAAa,CAAC,EAAG,EAAGR,EAAQC,CAAK,CAAC,EACxD,IAAIkB,GAAO,UAAWX,EAAa,CAAC,EAAG,EAAGR,EAAQC,CAAK,CAAC,CAEhE,EAKamB,GAAkB,MAC7BC,EACAtB,IAKmB,CAEnB,IAAMuB,EAAiB,OAAO,iBAAqB,KAAeD,aAAiB,iBAC7EE,EAAiB,OAAO,UAAc,KAAeF,aAAiB,UACtEG,EAAgB,OAAO,YAAgB,KAAeH,aAAiB,YACvEI,EAAW,OAAOJ,GAAU,SAE9BK,EACAC,EAA+C5B,GAAW,CAAA,EAExD6B,EAAe,IAAK,CACxB,GAAI,OAAO,SAAa,IACtB,OAAO,SAAS,cAAc,QAAQ,EACjC,GAAI,OAAO,gBAAoB,IACpC,OAAO,IAAI,gBAAgB,EAAG,CAAC,EAE/B,MAAM,IAAI,MAAM,yBAAyB,CAE7C,EACMC,EAAuBC,GACvB,OAAO,kBAAsB,KAAeA,aAAkB,mBAEvDA,aAAkB,gBADpBA,EAAO,WAAW,IAAI,EAItB,KAIX,GAAIR,EAAgB,CAElB,IAAMQ,EAASF,EAAY,EAC3BE,EAAO,MAAQT,EAAM,MACrBS,EAAO,OAAST,EAAM,OACtB,IAAMU,EAAkBF,EAAoBC,CAAM,EAElD,GAAIC,GAAmB,KAAM,CAC3B,IAAI/B,EAASqB,EAAM,OACfpB,EAAQoB,EAAM,MAMlB,GALItB,IAAY,QAAaA,EAAQ,gBAAkB,QAAaA,EAAQ,eAAiB,SAC3FC,EAASD,EAAQ,cACjBE,EAAQF,EAAQ,cAGdA,IAAY,OAAW,CAEzB,GADA4B,EAAwB5B,EACpBA,EAAQ,eAAiB,OAC3B,MAAM,IAAI,MAAM,6DAA6D,EAE7E4B,EAAsB,aAAe,OAEvCA,EAAsB,OAAS3B,EAC/B2B,EAAsB,MAAQ1B,OAE9B0B,EAAsB,aAAe,OACrCA,EAAsB,OAAS3B,EAC/B2B,EAAsB,MAAQ1B,EAGhC8B,EAAgB,UAAUV,EAAO,EAAG,CAAC,EACrCK,EAAOK,EAAgB,aAAa,EAAG,EAAG9B,EAAOD,CAAM,EAAE,SAEzD,OAAM,IAAI,MAAM,2BAA2B,UAEpCuB,EAAgB,CACzB,IAAIvB,EACAC,EAiBJ,GAfIF,IAAY,QAAaA,EAAQ,eAAiB,QAAaA,EAAQ,gBAAkB,QAC3FC,EAASD,EAAQ,cACjBE,EAAQF,EAAQ,eAEhBC,EAASqB,EAAM,OACfpB,EAAQoB,EAAM,OAGZtB,IAAY,SACd4B,EAAwB5B,GAE1B4B,EAAsB,OAAS,OAC/BA,EAAsB,OAAS3B,EAC/B2B,EAAsB,MAAQ1B,EAE1BF,IAAY,OAAW,CACzB,IAAMiC,EAAaJ,EAAY,EAE/BI,EAAW,MAAQ/B,EACnB+B,EAAW,OAAShC,EAEpB,IAAM+B,EAAkBF,EAAoBG,CAAU,EAEtD,GAAID,GAAmB,KACrBA,EAAgB,aAAaV,EAAO,EAAG,CAAC,EACxCK,EAAOK,EAAgB,aAAa,EAAG,EAAG9B,EAAOD,CAAM,EAAE,SAEzD,OAAM,IAAI,MAAM,2BAA2B,OAG7C0B,EAAOL,EAAM,aAENG,EAAe,CAExB,GAAIzB,IAAY,OACd,MAAM,IAAI,MAAM,yDAAyD,EAG3E,IAAM+B,EAASF,EAAY,EAC3BE,EAAO,MAAQT,EAAM,MACrBS,EAAO,OAAST,EAAM,OACtB,IAAMU,EAAkBF,EAAoBC,CAAM,EAElD,GAAIC,GAAmB,KAAM,CAC3B,IAAM/B,EAASqB,EAAM,OACfpB,EAAQoB,EAAM,MACpB,OAAAU,EAAgB,UAAUV,EAAO,EAAG,EAAGpB,EAAOD,CAAM,EACpD0B,EAAOK,EAAgB,aAAa,EAAG,EAAG9B,EAAOD,CAAM,EAAE,KACzD2B,EAAsB,OAAS3B,EAC/B2B,EAAsB,MAAQ1B,EACvBJ,GAAe6B,EAAMC,CAAqB,MAEjD,OAAM,IAAI,MAAM,2BAA2B,MAExC,IAAIF,EACT,OAAO,IAAI,QAAQ,CAACQ,EAASC,IAAU,CACrC,IAAMJ,EAASF,EAAY,EACrBO,EAAUN,EAAoBC,CAAM,EAC1C,GAAI,CAACT,GAAS,CAACc,EACb,OAAOD,EAAM,EAEf,IAAME,EAAW,IAAI,MACrBA,EAAS,YAAc,YACvBA,EAAS,IAAMf,EACfe,EAAS,OAAS,IAAK,CACrBN,EAAO,MAAQM,EAAS,MACxBN,EAAO,OAASM,EAAS,OACzBD,EAAQ,UAAUC,EAAU,EAAG,EAAGN,EAAO,MAAOA,EAAO,MAAM,EAC7D,IAAMO,EAAMF,EAAQ,aAAa,EAAG,EAAGL,EAAO,MAAOA,EAAO,MAAM,EAElEH,EAAsB,OAASG,EAAO,OACtCH,EAAsB,MAAQG,EAAO,MACrCG,EAAQpC,GAAewC,EAAI,KAAMV,CAAqB,CAAC,CACzD,CACF,CAAC,EAED,MAAM,IAAI,MAAM,gEAAgE,EAGlF,GAAID,IAAS,OACX,OAAO7B,GAAe6B,EAAMC,CAAqB,EAEjD,MAAM,IAAI,MAAM,gEAAgE,CAEpF,EAKaW,GAAoB,CAC/BC,EACAxC,IACU,CACV,GAAM,CAAE,MAAAE,EAAO,OAAAD,EAAQ,SAAAwC,EAAU,QAAAC,CAAO,EAAK1C,EAEvC2C,EAAO,CAAC,EAAG1C,EAAQC,EAAO,CAAC,EACjC,OAAO,IAAIkB,GAAO,CAAE,SAAU,UAAW,KAAM,UAAW,QAAAoB,EAAS,KAAAG,EAAM,SAAAF,EAAU,QAAAC,CAAO,CAAE,CAC9F,EAKaE,GAAsB,CACjCC,EACA7C,IACU,CACV,GAAM,CAAE,SAAA8C,EAAU,KAAAH,EAAM,SAAAF,EAAU,QAAAC,CAAO,EAAK1C,EAC9C,OAAO,IAAIoB,GAAO,CAAE,SAAU,aAAc,KAAM0B,GAAY,UAAW,UAAAD,EAAW,KAAAF,EAAM,SAAAF,EAAU,QAAAC,CAAO,CAAE,CAC/G,EAKaK,GAAqB,CAChCC,EACAhD,IACU,CACV,GAAM,CAAE,SAAA8C,EAAU,KAAAH,EAAM,SAAAF,EAAU,QAAAC,CAAO,EAAK1C,EAC9C,OAAO,IAAIoB,GAAO,CAAE,SAAU,YAAa,KAAM0B,GAAY,UAAW,SAAAE,EAAU,KAAAL,EAAM,SAAAF,EAAU,QAAAC,CAAO,CAAE,CAC7G,EAKaO,GAAyB,CACpCC,EACAnD,EACA4C,IACW,IAAIvB,GAAO,CAAE,SAAU,aAAc,KAAA8B,EAAM,KAAMnD,EAAQ,KAAM4C,GAAQ,CAAC5C,EAAO,MAAM,CAAC,CAAE,ECvT9F,IAAMoD,GAAwC,IAAI,IAA6C,CACpG,CAAC,UAAW,YAAY,EACxB,CAAC,QAAS,UAAU,EACpB,CAAC,OAAQ,SAAS,EAClB,CAAC,SAAU,WAAW,EACtB,CAAC,QAAS,UAAU,EACpB,CAAC,QAAS,UAAU,EACpB,CAAC,OAAQ,UAAU,EACnB,CAAC,UAAW,YAAY,EACxB,CAAC,SAAU,WAAW,EACtB,CAAC,OAAQ,UAAU,EACnB,CAAC,QAAS,UAAU,EACrB,EAGYC,GAAwC,IAAI,IAAkD,CACzG,CAAC,aAAc,SAAS,EACxB,CAAC,WAAY,OAAO,EACpB,CAAC,UAAW,MAAM,EAClB,CAAC,YAAa,QAAQ,EACtB,CAAC,WAAY,OAAO,EACpB,CAAC,WAAY,OAAO,EACpB,CAAC,aAAc,SAAS,EACxB,CAAC,YAAa,QAAQ,EACvB,EAKGC,GAAsB,GACbC,GAAkB,IAAK,CAClC,GAAI,CAACD,GAAqB,CACxBA,GAAsB,GACtB,IAAME,EAA2B,OAAO,cAAkB,KAAe,cAAc,KACjFC,EAA4B,OAAO,eAAmB,KAAe,eAAe,KAGpFC,EAAgB,WAAmB,aACnCC,EAA0B,OAAOD,EAAiB,KAAeA,EAAa,KAEhFF,IACFJ,GAAsC,IAAI,QAAS,aAAa,EAChEC,GAAsC,IAAI,cAAe,OAAO,GAE9DI,IACFL,GAAsC,IAAI,SAAU,cAAc,EAClEC,GAAsC,IAAI,eAAgB,QAAQ,GAEhEM,GACFP,GAAsC,IAAI,UAAWM,CAAY,EACjEL,GAAsC,IAAIK,EAAc,SAAS,GAGjEN,GAAsC,IAAI,UAAW,WAAW,EAGtE,EC5DO,IAAMQ,GAAiBC,GAAoC,CAChE,IAAIC,EAAO,EACX,QAASC,EAAI,EAAGA,EAAIF,EAAK,OAAQE,IAAK,CACpC,IAAMC,EAAMH,EAAKE,CAAC,EAClB,GAAI,OAAOC,GAAQ,UAAY,CAAC,OAAO,cAAcA,CAAG,EACtD,MAAM,IAAI,UAAU,QAAQD,CAAC,8BAA8BC,CAAG,EAAE,EAElE,GAAIA,EAAM,EACR,MAAM,IAAI,WAAW,QAAQD,CAAC,0CAA0CC,CAAG,EAAE,EAE/EF,GAAQE,EAEV,OAAOF,CACT,EAKaG,GAAgB,CAACC,EAAgBL,IAAmC,CAC/E,OAAQK,EAAO,SAAU,CACvB,IAAK,MACH,OAAO,IAAIC,GAAOD,EAAO,KAAMA,EAAO,KAAML,CAAI,EAClD,IAAK,aACH,OAAO,IAAIM,GAAO,CAChB,SAAU,aACV,KAAMD,EAAO,KACb,KAAMA,EAAO,KACb,KAAAL,EACD,EACH,IAAK,UACH,OAAO,IAAIM,GAAO,CAChB,SAAU,UACV,QAASD,EAAO,QAChB,KAAMA,EAAO,KACb,KAAAL,EACD,EACH,IAAK,aACH,OAAO,IAAIM,GAAO,CAChB,SAAU,aACV,UAAWD,EAAO,UAClB,KAAMA,EAAO,KACb,KAAAL,EACD,EACH,IAAK,YACH,OAAO,IAAIM,GAAO,CAChB,SAAU,YACV,SAAUD,EAAO,SACjB,KAAMA,EAAO,KACb,KAAAL,EACD,EACH,QACE,MAAM,IAAI,MAAM,kCAAkCK,EAAO,QAAQ,mBAAmB,EAE1F,ECpBM,IAAOE,GAAP,KAAa,CAuDjB,YACEC,EAUAC,EACAC,EAAwB,CAGxBC,GAAe,EAEf,IAAIC,EACAC,EAEJ,GAAI,OAAOL,GAAS,UAAY,aAAcA,EAO5C,OAHA,KAAK,aAAeA,EAAK,SACzBI,EAAOJ,EAAK,KACZK,EAAOL,EAAK,KACJA,EAAK,SAAU,CACrB,IAAK,aAAc,CACjB,IAAMM,EAAgCC,GAAsC,IAAIH,CAAI,EACpF,GAAI,CAACE,EACH,MAAM,IAAI,UAAU,qBAAqBF,CAAI,uCAAuC,EAEtF,GAAI,EAAEJ,EAAK,gBAAgBM,GACzB,MAAM,IAAI,UAAU,4BAA4BA,EAA8B,IAAI,EAAE,EAEtF,KAAK,QAAUN,EAAK,KACpB,MAEF,IAAK,UAAW,CACd,GAAII,IAAS,UACX,MAAM,IAAI,UAAU,qBAAqBA,CAAI,iCAAiC,EAEhF,KAAK,eAAiBJ,EAAK,QAC3B,KAAK,WAAaA,EAAK,SACvB,KAAK,SAAWA,EAAK,QACrB,MAEF,IAAK,aAAc,CACjB,GACEI,IAAS,WACTA,IAAS,WACTA,IAAS,SACTA,IAAS,SACTA,IAAS,UACTA,IAAS,SACTA,IAAS,QACTA,IAAS,SACTA,IAAS,OAET,MAAM,IAAI,UAAU,qBAAqBA,CAAI,oCAAoC,EAEnF,KAAK,cAAgBJ,EAAK,UAC1B,KAAK,WAAaA,EAAK,SACvB,KAAK,SAAWA,EAAK,QACrB,MAEF,IAAK,YAAa,CAChB,GACEI,IAAS,WACTA,IAAS,WACTA,IAAS,SACTA,IAAS,SACTA,IAAS,UACTA,IAAS,UACTA,IAAS,QACTA,IAAS,SACTA,IAAS,QACTA,IAAS,SACTA,IAAS,OAET,MAAM,IAAI,UAAU,qBAAqBA,CAAI,kCAAkC,EAEjF,KAAK,aAAeJ,EAAK,SACzB,KAAK,WAAaA,EAAK,SACvB,KAAK,SAAWA,EAAK,QACrB,MAEF,QACE,MAAM,IAAI,MAAM,6CAA6C,KAAK,YAAY,GAAG,MAEhF,CAIL,IAAIQ,EACAC,EAEJ,GAAI,OAAOT,GAAS,SAMlB,GAFAI,EAAOJ,EACPS,EAAYP,EACRF,IAAS,SAAU,CAErB,GAAI,CAAC,MAAM,QAAQC,CAAI,EACrB,MAAM,IAAI,UAAU,gDAAgD,EAItEO,EAAOP,MACF,CAEL,IAAMS,EAAwBH,GAAsC,IAAIP,CAAI,EAC5E,GAAIU,IAA0B,OAC5B,MAAM,IAAI,UAAU,4BAA4BV,CAAI,GAAG,EAEzD,GAAI,MAAM,QAAQC,CAAI,EAAG,CACvB,GAAKD,IAAS,WAAaU,IAA0B,aAAgBV,IAAS,SAAWA,IAAS,OAWhG,MAAM,IAAI,UACR,cAAcA,CAAI,0DAA0DU,EAAsB,IAAI,WAAW,EAE1GV,IAAS,UAAYA,IAAS,QAYvCQ,EAAQE,EAA8B,KAAKT,EAAM,MAAM,EAIvDO,EAAQE,EAA8B,KAAKT,CAAI,UAExCA,aAAgBS,EACzBF,EAAOP,UACEA,aAAgB,kBACzB,GAAID,IAAS,QACXQ,EAAO,WAAW,KAAKP,CAAI,MAE3B,OAAM,IAAI,UAAU,yDAAyD,UAEtED,IAAS,WAAaC,aAAgB,aAAeS,IAA0B,YAMxFF,EAAO,IAAK,WAAmB,aAAaP,EAAK,OAAQA,EAAK,WAAYA,EAAK,MAAM,MAErF,OAAM,IAAI,UAAU,KAAKG,CAAI,kCAAkCM,CAAqB,EAAE,UAO1FD,EAAYR,EACR,MAAM,QAAQD,CAAI,EAAG,CAEvB,GAAIA,EAAK,SAAW,EAClB,MAAM,IAAI,UAAU,qDAAqD,EAE3E,IAAMW,EAAmB,OAAOX,EAAK,CAAC,EACtC,GAAIW,IAAqB,SACvBP,EAAO,SACPI,EAAOR,UACEW,IAAqB,UAC9BP,EAAO,OAIPI,EAAO,WAAW,KAAKR,CAAa,MAEpC,OAAM,IAAI,UAAU,uCAAuCW,CAAgB,GAAG,UAEvEX,aAAgB,kBACzBI,EAAO,QACPI,EAAO,WAAW,KAAKR,CAAI,MACtB,CAEL,IAAMY,EAAaC,GAAsC,IACvDb,EAAK,WAA8C,EAErD,GAAIY,IAAe,OACjB,MAAM,IAAI,UAAU,qCAAqCZ,EAAK,WAAW,GAAG,EAE9EI,EAAOQ,EACPJ,EAAOR,EAKX,GAAIS,IAAc,OAEhBA,EAAY,CAACD,EAAK,MAAM,UACf,CAAC,MAAM,QAAQC,CAAS,EACjC,MAAM,IAAI,UAAU,wCAAwC,EAE9DJ,EAAOI,EAEP,KAAK,QAAUD,EACf,KAAK,aAAe,MAItB,IAAMM,EAAOC,GAAcV,CAAI,EAE/B,GAAI,KAAK,SAAWS,IAAS,KAAK,QAAQ,QACnC,GAAAV,IAAS,SAAWA,IAAS,SAAW,KAAK,KAAKU,EAAO,CAAC,IAAM,KAAK,QAAQ,QAGhF,MAAM,IAAI,MAAM,iBAAiBA,CAAI,gCAAgC,KAAK,QAAQ,MAAM,IAAI,EAIhG,KAAK,KAAOV,EACZ,KAAK,KAAOC,EACZ,KAAK,KAAOS,CACd,CAIA,aAAa,UACXE,EACAC,EAIwB,CAExB,OAAOC,GAAgBF,EAAOC,CAAO,CACvC,CAEA,OAAO,YACLE,EACAF,EAAoC,CAEpC,OAAOG,GAAkBD,EAASF,CAAO,CAC3C,CAEA,OAAO,cACLI,EACAJ,EAAsC,CAEtC,OAAOK,GAAoBD,EAAWJ,CAAO,CAC/C,CAEA,OAAO,aACLM,EACAN,EAAqC,CAErC,OAAOO,GAAmBD,EAAUN,CAAO,CAC7C,CAEA,OAAO,iBACLb,EACAqB,EACApB,EAAwB,CAExB,OAAOqB,GAAuBtB,EAAMqB,EAAQpB,CAAI,CAClD,CAKA,UAAUY,EAAgC,CACxC,OAAOU,GAAgB,KAAMV,CAAO,CACtC,CAEA,YAAYA,EAAkC,CAC5C,OAAOW,GAAkB,KAAMX,CAAO,CACxC,CAqDA,IAAI,MAAI,CAEN,GADA,KAAK,YAAW,EACZ,CAAC,KAAK,QACR,MAAM,IAAI,MACR,gJAC6E,EAGjF,OAAO,KAAK,OACd,CAEA,IAAI,UAAQ,CACV,OAAO,KAAK,YACd,CAEA,IAAI,SAAO,CAET,GADA,KAAK,YAAW,EACZ,CAAC,KAAK,eACR,MAAM,IAAI,MAAM,4CAA4C,EAE9D,OAAO,KAAK,cACd,CAEA,IAAI,WAAS,CAEX,GADA,KAAK,YAAW,EACZ,CAAC,KAAK,cACR,MAAM,IAAI,MAAM,4CAA4C,EAE9D,OAAO,KAAK,aACd,CAEA,IAAI,UAAQ,CAEV,GADA,KAAK,YAAW,EACZ,CAAC,KAAK,aACR,MAAM,IAAI,MAAM,6CAA6C,EAE/D,OAAO,KAAK,YACd,CAKA,MAAM,QAAQY,EAAqB,CAEjC,OADA,KAAK,YAAW,EACR,KAAK,aAAc,CACzB,IAAK,MACL,IAAK,aACH,OAAO,KAAK,KACd,IAAK,UACL,IAAK,aACL,IAAK,YAAa,CAChB,GAAI,CAAC,KAAK,WACR,MAAM,IAAI,MAAM,qEAAqE,EAEvF,GAAI,KAAK,cACP,MAAM,IAAI,MAAM,yCAAyC,EAE3D,GAAI,CACF,KAAK,cAAgB,GACrB,IAAMrB,EAAO,MAAM,KAAK,WAAU,EAClC,YAAK,WAAa,OAClB,KAAK,aAAe,MACpB,KAAK,QAAUA,EAEXqB,GAAe,KAAK,WACtB,KAAK,SAAQ,EACb,KAAK,SAAW,QAGXrB,UAEP,KAAK,cAAgB,IAGzB,QACE,MAAM,IAAI,MAAM,kCAAkC,KAAK,YAAY,EAAE,EAE3E,CAEA,SAAO,CACL,GAAI,KAAK,cACP,MAAM,IAAI,MAAM,yCAAyC,EAGvD,KAAK,WACP,KAAK,SAAQ,EACb,KAAK,SAAW,QAElB,KAAK,QAAU,OACf,KAAK,eAAiB,OACtB,KAAK,cAAgB,OACrB,KAAK,aAAe,OACpB,KAAK,WAAa,OAClB,KAAK,cAAgB,OAErB,KAAK,aAAe,MACtB,CAKQ,aAAW,CACjB,GAAI,KAAK,eAAiB,OACxB,MAAM,IAAI,MAAM,yBAAyB,CAE7C,CAEA,QAAQH,EAAuB,CAE7B,GADA,KAAK,YAAW,EACZ,KAAK,YAAc,KAAK,SAC1B,MAAM,IAAI,MAAM,iDAAiD,EAEnE,OAAOyB,GAAc,KAAMzB,CAAI,CACjC,GCzKK,IAAM0B,GAASA,GCtWtB,IAAMC,GAAuC,OAAO,OAAO,CACvD,KAAM,KACN,IAAK,KACL,IAAK,MACL,KAAM,OACN,OAAQ,SACR,KAAM,OACN,IAAK,MAEL,MAAO,CAAE,KAAM,QAAS,WAAY,KAAM,EAC1C,YAAa,CAAE,KAAM,QAAS,WAAY,KAAM,EAChD,YAAa,CAAE,KAAM,QAAS,WAAY,KAAM,EAChD,YAAa,CAAE,KAAM,QAAS,WAAY,KAAM,CACpD,CAAC,EAMKC,GAAmB,CAAC,EAGtBC,GACAC,GACEC,GAAa,OAAO,IAAI,aAAa,EAE3C,GAAIA,MAAc,WAEdD,GAAO,WAAWC,EAAU,UAErBC,GAAK,YAAa,CAUzB,OATAF,GAAiBG,IAAWC,GASpB,QAAQ,SAAU,CACtB,IAAK,QACDN,GAAiB,KAAK,KAAK,EAC3B,MACJ,IAAK,QACG,QAAQ,OAAS,OACjBA,GAAiB,KAAK,MAAM,EAEhC,MACJ,IAAK,SACD,KACR,CAEAA,GAAiB,KAAK,KAAK,EAC3BC,GAAiB,CAAC,KAAK,CAC3B,MACIC,GAAOK,GAEHH,GAAK,oBAELJ,GAAiB,KAAK,YAAa,YAAa,YAAa,OAAO,EAGpEI,GAAK,qBACLJ,GAAiB,KAAK,QAAQ,EAGlCA,GAAiB,KAAK,MAAM,EAC5BC,GAAiB,CAAC,MAAM,EAI5B,IAAMO,GAAmBN,GAAK,iBAgE9B,IAAIO,GAAoB,QAAQ,QAAQ,EAElCC,GAAaC,GAAK,gBAAkBA,GAAK,iBAuBxC,SAASC,GAAaC,EAAG,CAC5B,OAAOA,aAAaC,GAAK,MAC7B,CAIA,IAAMC,GAAWD,IAAM,IACnBC,IAAU,OAON,EAAE,OAAO,yBAA6B,KAAe,gBAAgB,2BAClE,CAACA,GAAS,KAAK,YAElBA,GAAS,KAAK,UAAY,0DAA0DC,GAAI,OAAO,UAQnGD,GAAS,KAAK,MAAQ,IAGtBA,IAAU,SACVA,GAAS,OAAO,gBAAkB,oBAatCE,GAAI,SAAS,KAAOC,GCrNb,IAAMC,GAAc,OAAO,OAAO,CACrC,QAAS,aAGT,QAAS,OAAO,aAAiB,IAAc,aAAc,YAC7D,QAAS,aACT,OAAQ,MACR,KAAM,UACN,MAAO,WACP,MAAO,WACP,OAAQ,YACR,MAAO,WACP,OAAQ,YACR,MAAO,cACP,OAAQ,eACR,KAAM,WACN,MAAO,WACP,KAAM,SACV,CAAC,EAQYC,GAAN,MAAMC,CAAO,CAEhB,IAAI,MAAO,CAEP,OAAO,KAAK,WAAW,IAC3B,CACA,IAAI,KAAKC,EAAO,CAGZ,KAAK,WAAW,KAAOA,CAC3B,CAGA,IAAI,MAAO,CACP,OAAO,KAAK,WAAW,IAC3B,CAGA,IAAI,MAAO,CACP,OAAO,KAAK,WAAW,IAC3B,CAGA,IAAI,MAAO,CACP,OAAO,KAAK,WAAW,IAC3B,CAGA,IAAI,UAAW,CACX,OAAO,KAAK,WAAW,QAC3B,CAEA,WAMA,eAAeC,EAAM,CACjB,OAAIC,GAAaD,EAAK,CAAC,CAAC,EACpB,KAAK,WAAwCA,EAAK,CAAC,EAGnD,KAAK,WAAa,IAAIH,GACMG,EAAK,CAAC,EAEgDA,EAAK,CAAC,EACpFA,EAAK,CAAC,CACV,EAGG,IAAI,MAAM,KAAM,CACnB,IAAK,CAACE,EAAKC,IAAQ,CACf,GAAI,OAAOA,GAAQ,SAAU,CACzB,IAAIC,EAAQ,OAAOD,CAAG,EACtB,GAAI,OAAO,UAAUC,CAAK,EAEtB,OAAOF,EAAI,SAASE,CAAK,CAEjC,CAEA,OAAOF,EAAIC,CAAG,CAClB,EACA,IAAK,CAACD,EAAKC,EAAKJ,IAILG,EAAIC,CAAG,EAAIJ,CAE1B,CAAC,CACL,CAEA,SAAU,CACN,KAAK,WAAW,QAAQ,CAE5B,CAOA,EAAE,OAAO,QAAQ,GAAI,CACjB,GAAM,CAACM,EAAY,GAAGC,CAAQ,EAAI,KAAK,KAEvC,GAAIA,EAAS,OAAS,EAAG,CACrB,IAAMC,EAAWD,EAAS,OAAO,CAAC,EAAGE,IAAM,EAAIA,CAAC,EAChD,QAASC,EAAI,EAAGA,EAAIJ,EAAY,EAAEI,EAC9B,MAAM,KAAK,UAAUA,EAAGF,EAAUD,CAAQ,CAElD,MACI,MAAO,KAAK,IAGpB,CAOA,SAASF,EAAO,CACZ,GAAM,CAACC,EAAY,GAAGC,CAAQ,EAAI,KAAK,KAIvC,GAFAF,EAAQM,GAAUN,EAAOC,CAAU,EAE/BC,EAAS,OAAS,EAAG,CACrB,IAAMC,EAAWD,EAAS,OAAO,CAACK,EAAGH,IAAMG,EAAIH,CAAC,EAChD,OAAO,KAAK,UAAUJ,EAAOG,EAAUD,CAAQ,CACnD,KACI,QAAO,IAAIR,EAAO,KAAK,KAAM,CAAC,KAAK,KAAKM,CAAK,CAAC,EAAGE,CAAQ,CAEjE,CAMA,QAAQM,EAAM,CACV,IAAMC,EAAY,KAAK,KACvB,QAAST,EAAQ,EAAGA,EAAQS,EAAU,OAAQ,EAAET,EAE5C,GAAIS,EAAUT,CAAK,GAAKQ,EACpB,OAAOR,EAGf,MAAO,EACX,CAQA,UAAUA,EAAOG,EAAUD,EAAU,CACjC,IAAMQ,EAAKV,EAAQG,EACbQ,GAAMX,EAAQ,GAAKG,EAGnBS,EACD,aAAc,KAAK,KACd,KAAK,KAAK,SAASF,EAAIC,CAAE,EACzB,KAAK,KAAK,MAAMD,EAAIC,CAAE,EAChC,OAAO,IAAIjB,EAAO,KAAK,KAAMkB,EAAMV,CAAQ,CAC/C,CAQA,MAAO,CACH,IAAMO,EAAY,KAAK,KACvB,GAAIA,EAAU,SAAW,EACrB,MAAM,IAAI,MAAM,iBAAiBA,EAAU,MAAM,yCAAyC,EAE9F,OAAOA,EAAU,CAAC,CACtB,CAMA,QAAS,CACL,OAAOI,GAAQ,KAAK,KAAM,KAAK,IAAI,CACvC,CAMA,SAAU,CACN,OAAO,KAAK,MAAM,EAAE,SAAS,CACjC,CAMA,UAAW,CACP,IAAMJ,EAAY,KAAK,KACvB,QAASJ,EAAI,EAAGA,EAAII,EAAU,OAAQ,EAAEJ,EACpCI,EAAUJ,CAAC,EAAI,GAAK,EAAI,KAAK,IAAI,CAACI,EAAUJ,CAAC,CAAC,GAElD,OAAO,IACX,CAQA,IAAIS,EAAU,CACV,OAAO,KAAK,MAAM,EAAE,KAAKA,CAAQ,CACrC,CAQA,KAAKA,EAAU,CACX,IAAML,EAAY,KAAK,KACvB,QAASJ,EAAI,EAAGA,EAAII,EAAU,OAAQ,EAAEJ,EACpCI,EAAUJ,CAAC,EAAIS,EAASL,EAAUJ,CAAC,EAAGA,EAAGI,CAAS,EAEtD,OAAO,IACX,CAOA,IAAIM,EAAK,CACL,OAAO,KAAK,MAAM,EAAE,KAAKA,CAAG,CAChC,CAOA,KAAKA,EAAK,CACN,IAAMN,EAAY,KAAK,KACvB,QAASJ,EAAI,EAAGA,EAAII,EAAU,OAAQ,EAAEJ,EACpCI,EAAUJ,CAAC,GAAKU,EAEpB,OAAO,IACX,CAOA,IAAIA,EAAK,CACL,OAAO,KAAK,MAAM,EAAE,KAAKA,CAAG,CAChC,CAOA,KAAKA,EAAK,CACN,IAAMN,EAAY,KAAK,KACvB,QAASJ,EAAI,EAAGA,EAAII,EAAU,OAAQ,EAAEJ,EACpCI,EAAUJ,CAAC,GAAKU,EAEpB,OAAO,IACX,CAOA,IAAIA,EAAK,CACL,OAAO,KAAK,MAAM,EAAE,KAAKA,CAAG,CAChC,CAOA,KAAKA,EAAK,CACN,IAAMN,EAAY,KAAK,KACvB,QAASJ,EAAI,EAAGA,EAAII,EAAU,OAAQ,EAAEJ,EACpCI,EAAUJ,CAAC,GAAKU,EAEpB,OAAO,IACX,CAOA,IAAIA,EAAK,CACL,OAAO,KAAK,MAAM,EAAE,KAAKA,CAAG,CAChC,CAOA,KAAKA,EAAK,CACN,IAAMN,EAAY,KAAK,KACvB,QAASJ,EAAI,EAAGA,EAAII,EAAU,OAAQ,EAAEJ,EACpCI,EAAUJ,CAAC,GAAKU,EAEpB,OAAO,IACX,CAMA,OAAQ,CACJ,OAAO,IAAIrB,EAAO,KAAK,KAAM,KAAK,KAAK,MAAM,EAAG,KAAK,KAAK,MAAM,CAAC,CACrE,CA+BA,SAASsB,EAAQ,CAEb,IAAMC,EAAgB,CAAC,EACjBC,EAAa,CAAC,EAIpB,QAASC,EAAa,EAAGA,EAAa,KAAK,KAAK,OAAQ,EAAEA,EAAY,CAClE,IAAIC,EAAQJ,EAAOG,CAAU,EAE7B,GAAIC,GAAU,KAEVF,EAAW,KAAK,CAAC,EAAG,KAAK,KAAKC,CAAU,CAAC,CAAC,EAC1CF,EAAc,KAAK,KAAK,KAAKE,CAAU,CAAC,UAEjC,OAAOC,GAAU,SACxBA,EAAQd,GAAUc,EAAO,KAAK,KAAKD,CAAU,EAAGA,CAAU,EAG1DD,EAAW,KAAK,CAACE,EAAOA,EAAQ,CAAC,CAAC,UAE3B,MAAM,QAAQA,CAAK,GAAKA,EAAM,SAAW,EAAG,CAEnD,GAAI,CAACC,EAAOC,CAAG,EAAIF,EAQnB,GAPAC,EAAQA,IAAU,KACZ,EACAf,GAAUe,EAAO,KAAK,KAAKF,CAAU,EAAGA,EAAY,EAAK,EAC/DG,EAAMA,IAAQ,KACR,KAAK,KAAKH,CAAU,EACpBb,GAAUgB,EAAK,KAAK,KAAKH,CAAU,EAAGA,EAAY,EAAK,EAEzDE,EAAQC,EACR,MAAM,IAAI,MAAM,kBAAkBF,CAAK,EAAE,EAG7C,IAAMG,EAAU,CACZ,KAAK,IAAIF,EAAO,CAAC,EACjB,KAAK,IAAIC,EAAK,KAAK,KAAKH,CAAU,CAAC,CACvC,EAEAD,EAAW,KAAKK,CAAO,EACvBN,EAAc,KAAKM,EAAQ,CAAC,EAAIA,EAAQ,CAAC,CAAC,CAE9C,KACI,OAAM,IAAI,MAAM,kBAAkBH,CAAK,EAAE,CAEjD,CAEA,IAAMI,EAAUN,EAAW,IAAI,CAAC,CAACG,EAAOC,CAAG,IAAMA,EAAMD,CAAK,EACtDI,EAAgBD,EAAQ,OAAO,CAACjB,EAAGH,IAAMG,EAAIH,CAAC,EAE9CK,EAAY,KAAK,KAGjBG,EAAO,IAAIH,EAAU,YAAYgB,CAAa,EAG9CC,EAAS,KAAK,OAAO,EAGvBC,EAAe,GACnB,QAAStB,EAAI,EAAGA,EAAImB,EAAQ,OAAQ,EAAEnB,EAClC,GAAIa,EAAWb,CAAC,EAAE,CAAC,IAAM,GAAKa,EAAWb,CAAC,EAAE,CAAC,IAAM,KAAK,KAAKA,CAAC,EAAG,CAC7DsB,EAAe,GACf,KACJ,CAGJ,GAAIA,EAAc,CAEd,IAAMN,EAAQH,EAAW,CAAC,EAAE,CAAC,EAAIQ,EAAO,CAAC,EACnCJ,EAAMJ,EAAW,CAAC,EAAE,CAAC,EAAIQ,EAAO,CAAC,EAEvC,GAAI,YAAY,OAAOjB,CAAS,EAG5BG,EAAK,IAAIH,EAAU,SAASY,EAAOC,CAAG,CAAC,UAChC,MAAM,QAAQb,CAAS,EAAG,CAEjC,IAAMmB,EAAanB,EAAU,MAAMY,EAAOC,CAAG,EAC7C,QAASjB,EAAI,EAAGA,EAAIuB,EAAW,OAAQ,EAAEvB,EACrCO,EAAKP,CAAC,EAAIuB,EAAWvB,CAAC,CAE9B,KACI,OAAM,IAAI,MAAM,mCAAmC,CAE3D,KAEI,SAASA,EAAI,EAAGA,EAAIoB,EAAe,EAAEpB,EAAG,CACpC,IAAIwB,EAAgB,EACpB,QAASC,EAAIN,EAAQ,OAAS,EAAGO,EAAM1B,EAAGyB,GAAK,EAAG,EAAEA,EAAG,CACnD,IAAME,EAAOR,EAAQM,CAAC,EACtBD,IAAmBE,EAAMC,EAAQd,EAAWY,CAAC,EAAE,CAAC,GAAKJ,EAAOI,CAAC,EAC7DC,EAAM,KAAK,MAAMA,EAAMC,CAAI,CAC/B,CACApB,EAAKP,CAAC,EAAII,EAAUoB,CAAa,CACrC,CAGJ,OAAO,IAAInC,EAAO,KAAK,KAAMkB,EAAMK,CAAa,CACpD,CAOA,WAAWgB,EAAM,CACb,OAAOC,GAAQ,KAAMD,CAAI,CAC7B,CAGA,aAAaA,EAAM,CACf,OAAO,KAAK,QAAQ,GAAGA,CAAI,CAC/B,CASA,IAAIE,EAAM,KAAMC,EAAU,GAAO,CAC7B,OAAO,KAAK,KAAK,EAAGD,EAAKC,CAAO,CACpC,CAUA,KAAKC,EAAI,MAAOF,EAAM,KAAMC,EAAU,GAAO,CACzC,GAAIC,IAAM,MAENA,EAAI,UACG,OAAOA,GAAM,SACpB,MAAM,MAAM,qBAAqBA,CAAC,EAAE,EAGxC,IAAM5B,EAAY,KAAK,KACjB6B,EAAK,CAAC/B,EAAGH,IAAMG,EAAKH,GAAKiC,EAE/B,GAAIF,IAAQ,KAAM,CAEd,IAAMpB,EAAMN,EAAU,OAAO6B,EAAI,CAAC,IAAM,EAAID,GAC5C,OAAO,IAAI3C,EAAO,KAAK,KAAM,CAACqB,CAAG,EAAG,CAAC,CAAC,CAC1C,CAEA,GAAM,CAACwB,EAAMC,EAAQC,CAAU,EAAIC,GAAcJ,EAAI,KAAMH,EAAKC,CAAO,EAEvE,GAAIC,IAAM,EACN,QAAShC,EAAI,EAAGA,EAAImC,EAAO,OAAQ,EAAEnC,EACjCmC,EAAOnC,CAAC,EAAImC,EAAOnC,CAAC,IAAM,EAAIgC,GAGtC,OAAO,IAAI3C,EAAO6C,EAAMC,EAAQC,CAAU,CAC9C,CAQA,WAAWJ,EAAI,EAAKF,EAAM,EAAG,CACzBA,EAAM7B,GAAU6B,EAAK,KAAK,KAAK,MAAM,EAErC,IAAMQ,EAAO,KAAK,KAAKN,EAAGF,EAAK,EAAI,EAE7B1B,EAAY,KAAK,KACjBmC,EAAYD,EAAK,KACvB,QAAStC,EAAI,EAAGA,EAAII,EAAU,OAAQ,EAAEJ,EAAG,CAGvC,IAAIwC,EAAc,EAElB,QAASf,EAAI,KAAK,KAAK,OAAS,EAAGC,EAAM1B,EAAGyC,EAAmB,EAAGhB,GAAK,EAAG,EAAEA,EAAG,CAC3E,IAAME,EAAO,KAAK,KAAKF,CAAC,EACxB,GAAIA,IAAMK,EAAK,CACX,IAAMnC,EAAQ+B,EAAMC,EACpBa,GAAe7C,EAAQ8C,EACvBA,GAAoB,KAAK,KAAKhB,CAAC,CACnC,CACAC,EAAM,KAAK,MAAMA,EAAMC,CAAI,CAC/B,CAGAvB,EAAUJ,CAAC,GAAKuC,EAAUC,CAAW,CACzC,CAEA,OAAO,IACX,CAQA,UAAUR,EAAI,EAAKF,EAAM,EAAG,CACxB,OAAO,KAAK,MAAM,EAAE,WAAWE,EAAGF,CAAG,CACzC,CAOA,QAAS,CACL,OAAOY,GAAa,KAAK,IAAI,CACjC,CAWA,QAAQZ,EAAM,KAAM,CAChB,OAAO,IAAIzC,EACP,KAAK,KACL,KAAK,KACLsD,GAAkB,KAAK,KAAMb,CAAG,CACpC,CACJ,CAKA,SAASA,EAAM,KAAM,CACjB,YAAK,KAAOa,GAAkB,KAAK,KAAMb,CAAG,EACrC,IACX,CAUA,UAAUA,EAAM,KAAM,CAClB,OAAO,IAAIzC,EACP,KAAK,KACL,KAAK,KACLuD,GAAoB,KAAK,KAAMd,CAAG,CACtC,CACJ,CAKA,WAAWA,EAAM,KAAM,CACnB,YAAK,KAAOc,GAAoB,KAAK,KAAMd,CAAG,EACvC,IACX,CAKA,SAASe,EAAY,EAAGC,EAAU,GAAI,CAElCA,GAAWA,EAAU,KAAK,KAAK,QAAU,KAAK,KAAK,OAEnD,IAAIC,EAAmB,KAAK,KAAK,MAAM,EAAGF,CAAS,EAC/CG,EAAgB,KAAK,KAAK,MAAMH,EAAWC,EAAU,CAAC,EACtDG,EAAkB,KAAK,KAAK,MAAMH,EAAU,CAAC,EAEjD,YAAK,KAAO,CAAC,GAAGC,EAAkBC,EAAc,OAAO,CAAC9C,EAAGH,IAAMG,EAAIH,EAAG,CAAC,EAAG,GAAGkD,CAAe,EACvF,IACX,CAUA,QAAQJ,EAAY,EAAGC,EAAU,GAAI,CACjC,OAAO,KAAK,MAAM,EAAE,SAASD,EAAWC,CAAO,CACnD,CAOA,QAAQlB,EAAM,CAEV,IAAIsB,EAAgB,GACpB,QAASlD,EAAI,EAAGA,EAAI4B,EAAK,OAAQ,EAAE5B,EAC/B,GAAI4B,EAAK5B,CAAC,IAAM,GAAI,CAChB,GAAIkD,IAAkB,GAClB,MAAM,IAAI,MAAM,oCAAoC,EAExDA,EAAgBlD,CACpB,CAGJ,IAAMI,EAAY,KAAK,KACvB,GAAI8C,IAAkB,GAAI,CAEtB,IAAMC,EAAevB,EAAK,OAAO,CAACwB,EAASC,EAAM1D,IACtCA,IAAUuD,EAAgBE,EAAUC,EAAOD,EACnD,CAAC,EAEJxB,EAAKsB,CAAa,EAAI9C,EAAU,OAAS+C,CAC7C,CACA,OAAO,IAAI9D,EAAO,KAAK,KAAMe,EAAWwB,CAAI,CAChD,CAEA,MAAO,CACH,IAAMxB,EAAY,KAAK,KACvB,QAASJ,EAAI,EAAGA,EAAII,EAAU,OAAQ,EAAEJ,EACpCI,EAAUJ,CAAC,EAAI,CAACI,EAAUJ,CAAC,EAE/B,OAAO,IACX,CACA,KAAM,CACF,OAAO,KAAK,MAAM,EAAE,KAAK,CAC7B,CAOA,GAAGU,EAAK,CACJ,IAAM4C,EAAO,IAAI,WAAW,KAAK,KAAK,MAAM,EACtClD,EAAY,KAAK,KACvB,QAASJ,EAAI,EAAGA,EAAII,EAAU,OAAQ,EAAEJ,EACpCsD,EAAKtD,CAAC,EAAII,EAAUJ,CAAC,EAAIU,EAAM,EAAI,EAEvC,OAAO,IAAIrB,EAAO,OAAQiE,EAAM,KAAK,IAAI,CAC7C,CAOA,GAAG5C,EAAK,CACJ,IAAM4C,EAAO,IAAI,WAAW,KAAK,KAAK,MAAM,EACtClD,EAAY,KAAK,KACvB,QAASJ,EAAI,EAAGA,EAAII,EAAU,OAAQ,EAAEJ,EACpCsD,EAAKtD,CAAC,EAAII,EAAUJ,CAAC,EAAIU,EAAM,EAAI,EAEvC,OAAO,IAAIrB,EAAO,OAAQiE,EAAM,KAAK,IAAI,CAC7C,CAKA,OAAOC,EAAKC,EAAK,CACb,IAAMpD,EAAY,KAAK,KACvB,QAASJ,EAAI,EAAGA,EAAII,EAAU,OAAQ,EAAEJ,EACpCI,EAAUJ,CAAC,EAAI,KAAK,IAAI,KAAK,IAAII,EAAUJ,CAAC,EAAGuD,CAAG,EAAGC,CAAG,EAE5D,OAAO,IACX,CAQA,MAAMD,EAAKC,EAAK,CACZ,OAAO,KAAK,MAAM,EAAE,OAAOD,EAAKC,CAAG,CACvC,CAKA,QAAS,CACL,IAAMpD,EAAY,KAAK,KACvB,QAASJ,EAAI,EAAGA,EAAII,EAAU,OAAQ,EAAEJ,EACpCI,EAAUJ,CAAC,EAAI,KAAK,MAAMI,EAAUJ,CAAC,CAAC,EAE1C,OAAO,IACX,CAMA,OAAQ,CACJ,OAAO,KAAK,MAAM,EAAE,OAAO,CAC/B,CAEA,KAAK8B,EAAM,KAAMC,EAAU,GAAO,CAC9B,OAAO0B,GAAK,KAAM3B,EAAKC,CAAO,CAClC,CAEA,IAAID,EAAM,KAAMC,EAAU,GAAO,CAC7B,GAAID,IAAQ,KAAM,CAEd,IAAMpB,EAAM6C,GAAI,KAAK,IAAI,EAAE,CAAC,EAC5B,OAAO,IAAIlE,EAAO,KAAK,KAAM,CAACqB,CAAG,EAAG,CAAa,CAAC,CACtD,CACA,GAAM,CAACwB,EAAMC,EAAQC,CAAU,EAAIC,GAAc,CAACnC,EAAGH,IAAM,KAAK,IAAIG,EAAGH,CAAC,EAAG,KAAM+B,EAAKC,EAAS,GAAQ,EACvG,OAAO,IAAI1C,EAAO6C,EAAMC,EAAQC,CAAU,CAC9C,CAEA,IAAIN,EAAM,KAAMC,EAAU,GAAO,CAC7B,GAAID,IAAQ,KAAM,CAEd,IAAMpB,EAAM8C,GAAI,KAAK,IAAI,EAAE,CAAC,EAC5B,OAAO,IAAInE,EAAO,KAAK,KAAM,CAACqB,CAAG,EAAG,CAAa,CAAC,CACtD,CACA,GAAM,CAACwB,EAAMC,EAAQC,CAAU,EAAIC,GAAc,CAACnC,EAAGH,IAAM,KAAK,IAAIG,EAAGH,CAAC,EAAG,KAAM+B,EAAKC,EAAS,IAAS,EACxG,OAAO,IAAI1C,EAAO6C,EAAMC,EAAQC,CAAU,CAC9C,CAEA,OAAON,EAAM,KAAMC,EAAU,GAAO,CAChC,GAAID,IAAQ,KACR,MAAM,IAAI,MAAM,qCAAqC,EAEzD,IAAMnC,EAAQ4D,GAAI,KAAK,IAAI,EAAE,CAAC,EAC9B,OAAO,IAAIlE,EAAO,QAAS,CAAC,OAAOM,CAAK,CAAC,EAAG,CAAC,CAAC,CAClD,CACA,OAAOmC,EAAM,KAAMC,EAAU,GAAO,CAChC,GAAID,IAAQ,KACR,MAAM,IAAI,MAAM,qCAAqC,EAEzD,IAAMnC,EAAQ6D,GAAI,KAAK,IAAI,EAAE,CAAC,EAC9B,OAAO,IAAInE,EAAO,QAAS,CAAC,OAAOM,CAAK,CAAC,EAAG,CAAC,CAAC,CAClD,CAOA,GAAGuC,EAAM,CAEL,GAAI,KAAK,OAASA,EAAM,OAAO,KAG/B,GAAI,CAAC/C,GAAY,eAAe+C,CAAI,EAChC,MAAM,IAAI,MAAM,qBAAqBA,CAAI,EAAE,EAI/C,IAAIwB,EACEC,EAAmB,CAAC,QAAS,QAAQ,EAAE,SAAS,KAAK,IAAI,EACzDC,EAAiB,CAAC,QAAS,QAAQ,EAAE,SAAS1B,CAAI,EACxD,OAAIyB,GAAoB,CAACC,EAErBF,EAAS,OACF,CAACC,GAAoBC,IAExB,CAAC,UAAW,UAAW,SAAS,EAAE,SAAS,KAAK,IAAI,EACpDF,EAAUG,GAAM,OAAO,KAAK,MAAMA,CAAC,CAAC,EAEpCH,EAAS,QAKV,IAAIrE,EAAO6C,EAAM/C,GAAY+C,CAAI,EAAE,KAAK,KAAK,KAAMwB,CAAM,EAAG,KAAK,IAAI,CAChF,CACJ,EA+BA,SAASlD,GAAQD,EAAMuD,EAAY,CAE/B,IAAMC,EAAgBxD,EAAK,OACrByD,EAAgBF,EAAW,OAAO,CAAC5D,EAAGH,IAAMG,EAAIH,CAAC,EAEvD,GAAIgE,IAAkBC,EAClB,MAAM,MAAM,gCAAgCD,CAAa,gBAAgBD,CAAU,GAAG,EAI1F,IAAIG,EAAgB1D,EAEpB,QAASP,EAAI8D,EAAW,OAAS,EAAG9D,GAAK,EAAGA,IACxCiE,EAAgBA,EAAc,OAAO,CAACC,EAAKxD,IAAQ,CAC/C,IAAIyD,EAAYD,EAAIA,EAAI,OAAS,CAAC,EAElC,OAAIC,EAAU,OAASL,EAAW9D,CAAC,EAC/BmE,EAAU,KAAKzD,CAAG,EAElBwD,EAAI,KAAK,CAACxD,CAAG,CAAC,EAGXwD,CACX,EAAG,CAAC,CAAC,CAAC,CAAC,EAGX,OAAOD,EAAc,CAAC,CAC1B,CAQO,SAASpC,GAAQuC,EAAQC,EAAM,CAClC,GAAM,CAACC,EAAcC,CAAK,EAAIC,GAAaJ,EAAO,KAAMA,EAAO,KAAMC,CAAI,EACzE,OAAO,IAAIjF,GAAOgF,EAAO,KAAME,EAAcC,CAAK,CACtD,CAwPA,SAASE,GAAkBC,EAAMC,EAAK,CAClC,OAAAD,EAAOA,EAAK,MAAM,EACdC,IAAQ,KACRD,EAAOA,EAAK,OAAQE,GAAMA,IAAM,CAAC,EAC1B,OAAOD,GAAQ,SAClBD,EAAKC,CAAG,IAAM,GACdD,EAAK,OAAOC,EAAK,CAAC,EAEf,MAAM,QAAQA,CAAG,IACxBD,EAAOA,EAAK,OAAO,CAACG,EAAGC,IACZD,IAAM,GAAK,CAACF,EAAI,SAASG,CAAC,CACpC,GAEEJ,CACX,CASA,SAASK,GAAoBL,EAAMC,EAAK,CAGpC,OAAAA,EAAMK,GAAUL,EAAKD,EAAK,OAAS,CAAC,EACpCA,EAAOA,EAAK,MAAM,EAElBA,EAAK,OAAOC,EAAK,EAAG,CAAC,EACdD,CACX,CAYA,SAASM,GAAUC,EAAOC,EAAMC,EAAY,KAAMC,EAAc,GAAM,CAClE,GAAIH,EAAQ,CAACC,GAAQD,GAASC,EAAM,CAChC,GAAIE,EACA,MAAM,IAAI,MAAM,qBAAqBH,CAAK,kCAAkCE,IAAc,KAAO,GAAK,IAAMA,CAAS,cAAcD,CAAI,EAAE,EAEzI,OAAOD,EAAQ,CAACC,EAAO,EAAIA,CAEnC,CAEA,OAAID,EAAQ,IAERA,GAAUA,EAAQC,EAAQA,GAAQA,GAE/BD,CACX,CAsFA,SAASI,GAAcC,EAAYC,EAAOC,EAAM,KAAMC,EAAU,GAAOC,EAAe,KAAM,CACxF,IAAMC,EAAYJ,EAAM,KAClBK,EAAYL,EAAM,KAGxBC,EAAMK,GAAUL,EAAKI,EAAU,MAAM,EAGrC,IAAME,EAAaF,EAAU,MAAM,EACnCE,EAAWN,CAAG,EAAI,EAIlB,IAAMO,EAAS,IAAIJ,EAAU,YAAYA,EAAU,OAASC,EAAUJ,CAAG,CAAC,EACtEE,IAAiB,MACjBK,EAAO,KAAKL,CAAY,EAI5B,QAASM,EAAI,EAAGA,EAAIL,EAAU,OAAQ,EAAEK,EAAG,CAGvC,IAAIC,EAAc,EAElB,QAASC,EAAIN,EAAU,OAAS,EAAGO,EAAMH,EAAGI,EAAmB,EAAGF,GAAK,EAAG,EAAEA,EAAG,CAC3E,IAAMG,EAAOT,EAAUM,CAAC,EACxB,GAAIA,IAAMV,EAAK,CACX,IAAMc,EAAQH,EAAME,EACpBJ,GAAeK,EAAQF,EACvBA,GAAoBN,EAAWI,CAAC,CACpC,CACAC,EAAM,KAAK,MAAMA,EAAME,CAAI,CAC/B,CAGAN,EAAOE,CAAW,EAAIX,EAAWS,EAAOE,CAAW,EAAGN,EAAUK,CAAC,EAAGA,EAAGC,CAAW,CACtF,CAEA,OAAKR,GAASK,EAAW,OAAON,EAAK,CAAC,EAE/B,CAACD,EAAM,KAAMQ,EAAQD,CAAU,CAC1C,CAkDO,SAASS,GAAKC,EAAOC,EAAM,KAAMC,EAAU,GAAO,CACrD,IAAMC,EAAYH,EAAM,KAClBI,EAAwCJ,EAAM,KAEpD,GAAIC,IAAQ,KAAM,CAEd,IAAMI,EAAMD,EAAU,OAAO,CAACE,EAAGC,IAAMD,EAAIC,EAAG,CAAC,EAC/C,OAAO,IAAIC,GAAOR,EAAM,KAAM,CAACK,EAAMD,EAAU,MAAM,EAAG,CAAa,CAAC,CAC1E,CACAH,EAAMQ,GAAUR,EAAKE,EAAU,MAAM,EAGrC,GAAM,CAACO,EAAMC,EAAQC,CAAU,EAAIC,GAAc,CAACP,EAAGC,IAAMD,EAAIC,EAAGP,EAAOC,EAAKC,CAAO,EAGrF,GAAIC,EAAUF,CAAG,IAAM,EACnB,QAASa,EAAI,EAAGA,EAAIH,EAAO,OAAQ,EAAEG,EACjCH,EAAOG,CAAC,GAAKX,EAAUF,CAAG,EAIlC,OAAO,IAAIO,GAAOE,EAAMC,EAAQC,CAAU,CAC9C,CAGA,SAASG,GAAaC,EAAM,CACxB,IAAMC,EAAS,IAAI,MAAMD,EAAK,MAAM,EACpC,QAASF,EAAIE,EAAK,OAAS,EAAGE,EAAK,EAAGJ,GAAK,EAAG,EAAEA,EAC5CG,EAAOH,CAAC,EAAII,EACZA,GAAMF,EAAKF,CAAC,EAEhB,OAAOG,CACX,CC74CO,IAAME,GAAN,KAAoB,CAMvB,YAAYC,EAAa,CAACC,EAAGC,IAAMD,EAAIC,EAAGC,EAAU,IAAU,CAC1D,KAAK,MAAQ,CAAC,EACd,KAAK,YAAcH,EACnB,KAAK,SAAWG,CACpB,CAKA,IAAI,MAAO,CACP,OAAO,KAAK,MAAM,MACtB,CAMA,SAAU,CACN,OAAO,KAAK,OAAS,CACzB,CAMA,MAAO,CACH,OAAO,KAAK,MAAM,CAAC,CACvB,CAOA,QAAQC,EAAQ,CACZ,OAAO,KAAK,OAAOA,CAAM,CAC7B,CAOA,OAAOA,EAAQ,CACX,QAAWC,KAASD,EAChB,GAAI,KAAK,KAAO,KAAK,SACjB,KAAK,MAAM,KAAKC,CAAK,EACrB,KAAK,QAAQ,MACV,CAEH,IAAMC,EAAW,KAAK,UAAU,EAI5B,KAAK,YAAYD,EAAO,KAAK,MAAMC,CAAQ,CAAC,IAC5C,KAAK,MAAMA,CAAQ,EAAID,EACvB,KAAK,YAAYC,CAAQ,EAEjC,CAEJ,OAAO,KAAK,IAChB,CAMA,KAAM,CACF,IAAMC,EAAc,KAAK,KAAK,EACxBC,EAAS,KAAK,KAAO,EAC3B,OAAIA,EAAS,GACT,KAAK,MAAM,EAAGA,CAAM,EAExB,KAAK,MAAM,IAAI,EACf,KAAK,UAAU,EACRD,CACX,CAOA,QAAQF,EAAO,CACX,IAAMI,EAAgB,KAAK,KAAK,EAChC,YAAK,MAAM,CAAC,EAAIJ,EAChB,KAAK,UAAU,EACRI,CACX,CAQA,QAAQC,EAAG,CACP,OAASA,EAAI,IAAO,GAAK,CAC7B,CAQA,MAAMA,EAAG,CACL,OAAQA,GAAK,GAAK,CACtB,CAQA,OAAOA,EAAG,CACN,OAAQA,EAAI,GAAM,CACtB,CASA,SAASA,EAAGC,EAAG,CACX,OAAO,KAAK,YAAY,KAAK,MAAMD,CAAC,EAAG,KAAK,MAAMC,CAAC,CAAC,CACxD,CAQA,MAAMD,EAAGC,EAAG,CACR,IAAMC,EAAO,KAAK,MAAMF,CAAC,EACzB,KAAK,MAAMA,CAAC,EAAI,KAAK,MAAMC,CAAC,EAC5B,KAAK,MAAMA,CAAC,EAAIC,CACpB,CAOA,SAAU,CACN,KAAK,YAAY,KAAK,KAAO,CAAC,CAClC,CAMA,YAAYC,EAAM,CACd,KAAOA,EAAO,GAAK,KAAK,SAASA,EAAM,KAAK,QAAQA,CAAI,CAAC,GACrD,KAAK,MAAMA,EAAM,KAAK,QAAQA,CAAI,CAAC,EACnCA,EAAO,KAAK,QAAQA,CAAI,CAEhC,CAOA,WAAY,CACR,IAAIA,EAAO,EACX,KACK,KAAK,MAAMA,CAAI,EAAI,KAAK,MAAQ,KAAK,SAAS,KAAK,MAAMA,CAAI,EAAGA,CAAI,GACpE,KAAK,OAAOA,CAAI,EAAI,KAAK,MAAQ,KAAK,SAAS,KAAK,OAAOA,CAAI,EAAGA,CAAI,GACzE,CACE,IAAMC,EAAY,KAAK,OAAOD,CAAI,EAAI,KAAK,MAAQ,KAAK,SAAS,KAAK,OAAOA,CAAI,EAAG,KAAK,MAAMA,CAAI,CAAC,EAC9F,KAAK,OAAOA,CAAI,EAChB,KAAK,MAAMA,CAAI,EACrB,KAAK,MAAMA,EAAMC,CAAQ,EACzBD,EAAOC,CACX,CACJ,CAOA,WAAY,CACR,MAAQ,IAAM,KAAK,MAAM,KAAK,KAAK,KAAK,IAAI,CAAC,EAAK,CACtD,CACJ,EAKaC,GAAN,KAAe,CAClB,aAAc,CACV,KAAK,KAAOC,GAAa,QAAQ,CACrC,CAMA,OAAOC,EAAO,CACV,QAAWC,KAAQD,EACf,KAAK,KAAKC,CAAI,CAEtB,CAMA,KAAKA,EAAM,CACP,IAAIL,EAAO,KAAK,KAChB,QAAWM,KAAMD,EAAM,CACnB,IAAIE,EAAQP,EAAK,SAAS,IAAIM,CAAE,EAC5BC,IAAU,SACVA,EAAQJ,GAAa,QAAQ,EAC7BH,EAAK,SAAS,IAAIM,EAAIC,CAAK,GAE/BP,EAAOO,CACX,CACAP,EAAK,OAAS,EAClB,CAOA,CAAC,mBAAmBK,EAAM,CACtB,IAAIL,EAAO,KAAK,KAChB,GAAIA,IAAS,OAAW,OAExB,IAAIQ,EAAS,GACb,QAAWF,KAAMD,EAAM,CAGnB,GAFAG,GAAUF,EACVN,EAAOA,EAAK,SAAS,IAAIM,CAAE,EACvBN,IAAS,OAAW,OACpBA,EAAK,SACL,MAAMQ,EAEd,CACJ,CACJ,EAKML,GAAN,MAAMM,CAAa,CAMf,YAAYC,EAAQC,EAAU,CAC1B,KAAK,OAASD,EACd,KAAK,SAAWC,CACpB,CAMA,OAAO,SAAU,CACb,OAAO,IAAIF,EAAa,GAAO,IAAI,GAAK,CAC5C,CACJ,EAKaG,GAAN,KAAmB,CAQtB,YAAYC,EAAUC,EAAYC,EAAY,CAC1C,KAAK,MAAQ,MAAM,KAAKF,CAAQ,EAChC,KAAK,IAAM,KAAK,MAAM,OACtB,KAAK,WAAaC,EAClB,KAAK,WAAaC,EAClB,KAAK,MAAQ,CAAC,EACd,KAAK,WAAa,MAAM,KAAK,CAAE,OAAQ,KAAK,IAAM,CAAE,EAAG,IAAM,CAAC,CAAC,EAC/D,KAAK,SAAW,MAAM,KAAK,CAAE,OAAQ,KAAK,IAAM,CAAE,EAAG,IAAM,CAAC,CAAC,EAE7D,IAAMC,EAAM,IAAIC,GAAiB,KAAK,WAAY,EAAG,EAAG,EAAG,CAAG,EACxDC,EAAM,IAAID,GAAiB,KAAK,WAAY,EAAG,KAAK,IAAK,EAAG,CAAG,EACrE,KAAK,MAAM,KAAKD,EAAI,MAAM,CAAC,EAC3B,KAAK,MAAM,KAAKE,EAAI,MAAM,CAAC,EAC3B,KAAK,WAAW,KAAK,GAAG,EAAE,KAAKA,CAAG,EAClC,KAAK,SAAS,CAAC,EAAE,KAAKF,CAAG,CAC7B,CAUA,OAAOG,EAAKC,EAAQC,EAAOC,EAAS,CAChC,IAAMC,EAAS,KAAK,MAAM,OACpBvB,EAAO,IAAIiB,GAAiBK,EAASC,EAAQJ,EAAKC,EAAQC,CAAK,EACrE,KAAK,WAAWF,CAAG,EAAE,KAAKnB,CAAI,EAC9B,KAAK,SAASmB,EAAMC,CAAM,EAAE,KAAKpB,CAAI,EACrC,KAAK,MAAM,KAAKA,CAAI,CACxB,CAOA,SAAU,CACN,IAAMwB,EAAM,KAAK,IACbL,EAAM,EACV,KAAOA,GAAOK,GAAK,CACf,GAAI,KAAK,WAAWL,CAAG,EAAE,QAAU,EAC/B,MAAO,CAAC,EAEZ,QAASM,KAAS,KAAK,WAAWN,CAAG,EAAG,CACpCM,EAAM,KAAO,KACb,IAAIC,EAAY,EACZC,EAAW,KACf,QAASC,KAAS,KAAK,SAAST,CAAG,EAAG,CAClC,IAAME,EAAQO,EAAM,eAAiBH,EAAM,OACvCE,IAAa,MAAQN,EAAQK,KAC7BC,EAAWC,EAAM,MAAM,EACvBF,EAAYL,EAEpB,CAEA,GAAIM,IAAa,KACbF,EAAM,KAAOE,EACbF,EAAM,eAAiBC,MAEvB,OAAO,CAAC,CAEhB,CACA,EAAEP,CACN,CAEA,IAAMU,EAAU,CAAC,EAEXC,EADO,KAAK,WAAWN,CAAG,EAAE,CAAC,EACjB,KAClB,GAAIM,IAAS,KACT,MAAO,CAAC,EAGZ,IAAI9B,EAAO8B,EAAK,MAAM,EACtB,KAAO9B,EAAK,OAAS,MACjB6B,EAAQ,KAAK7B,EAAK,MAAM,CAAC,EAEzBA,EADUA,EAAK,MAAM,EACZ,KAAK,MAAM,EAGxB,OAAA6B,EAAQ,QAAQ,EACTA,CACX,CAMA,MAAM7B,EAAM,CACR,OAAO,KAAK,MAAM,MAAMA,EAAK,IAAKA,EAAK,IAAMA,EAAK,MAAM,EAAE,KAAK,EAAE,CACrE,CAKA,QAAS,CAEL,OADc,KAAK,QAAQ,EACd,IAAI+B,GAAK,KAAK,MAAMA,CAAC,CAAC,CACvC,CAKA,UAAW,CAEP,OADc,KAAK,QAAQ,EACd,IAAIA,GAAKA,EAAE,OAAO,CACnC,CACJ,EACMd,GAAN,MAAMe,CAAiB,CASnB,YAAYV,EAASC,EAAQJ,EAAKC,EAAQC,EAAO,CAC7C,KAAK,QAAUC,EACf,KAAK,OAASC,EACd,KAAK,IAAMJ,EACX,KAAK,OAASC,EACd,KAAK,MAAQC,EACb,KAAK,KAAO,KACZ,KAAK,eAAiB,CAC1B,CAMA,OAAQ,CACJ,IAAMY,EAAI,IAAID,EAAiB,KAAK,QAAS,KAAK,OAAQ,KAAK,IAAK,KAAK,OAAQ,KAAK,KAAK,EAC3F,OAAAC,EAAE,KAAO,KAAK,KACdA,EAAE,eAAiB,KAAK,eACjBA,CACX,CACJ,EAQaC,GAAN,KAAyB,CAI5B,YAAYC,EAAY,CACpB,KAAK,KAAO,KAAK,WAAWA,CAAU,CAC1C,CAQA,WAAWA,EAAY,CACnB,IAAMC,EAAO,OAAO,OAAO,IAAI,EAC/B,QAAWC,KAAQF,EAAY,CAC3B,IAAInC,EAAOoC,EACX,QAASvC,EAAI,EAAGA,EAAIwC,EAAK,OAAQ,EAAExC,EAC/BG,EAAQA,EAAKqC,EAAKxC,CAAC,CAAC,IAAM,OAAO,OAAO,IAAI,EAEhDG,EAAK,IAAMqC,CACf,CACA,OAAOD,CACX,CAOA,MAAM/B,EAAM,CACR,IAAMiC,EAAS,CAAC,EACV,EAAIjC,EAAK,OACXkC,EAAQ,EACR1C,EAAI,EAER,KAAOA,EAAI,GAAG,CACV,IAAIG,EAAO,KAAK,KACZwC,EAAQ,KACR1C,EAAID,EAER,KAAOC,EAAI,IAAME,EAAOA,EAAKK,EAAKP,CAAC,CAAC,IAC5BE,EAAK,MAELwC,EAAQxC,EAAK,KAEjB,EAAEF,EAGF0C,GACI3C,EAAI0C,GACJD,EAAO,KAAKjC,EAAK,MAAMkC,EAAO1C,CAAC,CAAC,EAEpCyC,EAAO,KAAKE,CAAK,EACjB3C,GAAK2C,EAAM,OACXD,EAAQ1C,GAER,EAAEA,CAEV,CACA,OAAI0C,EAAQ,GACRD,EAAO,KAAKjC,EAAK,MAAMkC,CAAK,CAAC,EAE1BD,CACX,CACJ,EAOaG,GAAN,KAAe,CAKlB,YAAYC,EAAU,CAClB,KAAK,SAAWA,EAChB,KAAK,MAAQ,IAAI,GACrB,CAOA,IAAIC,EAAK,CACL,GAAI,CAAC,KAAK,MAAM,IAAIA,CAAG,EAAG,OAC1B,IAAMnD,EAAQ,KAAK,MAAM,IAAImD,CAAG,EAChC,YAAK,MAAM,OAAOA,CAAG,EACrB,KAAK,MAAM,IAAIA,EAAKnD,CAAK,EAClBA,CACX,CASA,IAAImD,EAAKnD,EAAO,CACR,KAAK,MAAM,IAAImD,CAAG,GAClB,KAAK,MAAM,OAAOA,CAAG,EAEzB,KAAK,MAAM,IAAIA,EAAKnD,CAAK,EACrB,KAAK,MAAM,KAAO,KAAK,UACvB,KAAK,MAAM,OAAO,KAAK,MAAM,KAAK,EAAE,KAAK,EAAE,KAAK,CAExD,CAKA,OAAQ,CACJ,KAAK,MAAM,MAAM,CACrB,CACJ,EC5jBA,IAAIoD,EAAc,OAAO,OAAO,CAC9B,KAAM,OAEN,eAAgB,iBAEhB,cAAe,gBAEf,WAAY,aAEZ,OAAQ,SAER,UAAW,YAEX,WAAY,aAEZ,cAAe,gBAEf,eAAgB,iBAEhB,eAAgB,iBAEhB,gBAAiB,kBAEjB,kBAAmB,oBAEnB,mBAAoB,qBAEpB,iBAAkB,mBAElB,kBAAmB,oBAEnB,MAAO,QAEP,IAAK,MAEL,MAAO,QAEP,KAAM,OAEN,aAAc,eAEd,uBAAwB,yBAExB,6BAA8B,+BAE9B,yBAA0B,2BAE1B,cAAe,gBAEf,QAAS,SAEX,CAAC,EACGC,GAAQ,KAAM,CAMhB,YAAYC,EAAOC,EAAM,CACvB,KAAK,MAAQD,EACb,KAAK,KAAOC,CACd,CACF,EACA,SAASC,GAAOC,EAAM,CACpB,MAAO,KAAK,KAAKA,CAAI,CACvB,CACA,SAASC,GAAUD,EAAM,CACvB,MAAO,QAAQ,KAAKA,CAAI,CAC1B,CACA,SAASE,GAAaF,EAAM,CAC1B,MAAO,KAAK,KAAKA,CAAI,CACvB,CACA,IAAIG,GAAwB,CAE1B,CAAC,KAAMR,EAAY,aAAa,EAChC,CAAC,KAAMA,EAAY,cAAc,EACjC,CAAC,KAAMA,EAAY,cAAc,EACjC,CAAC,KAAMA,EAAY,eAAe,EAElC,CAAC,IAAKA,EAAY,SAAS,EAC3B,CAAC,IAAKA,EAAY,UAAU,EAC5B,CAAC,IAAKA,EAAY,gBAAgB,EAClC,CAAC,IAAKA,EAAY,iBAAiB,EACnC,CAAC,IAAKA,EAAY,iBAAiB,EACnC,CAAC,IAAKA,EAAY,kBAAkB,EACpC,CAAC,IAAKA,EAAY,KAAK,EACvB,CAAC,IAAKA,EAAY,GAAG,EACrB,CAAC,IAAKA,EAAY,KAAK,EACvB,CAAC,IAAKA,EAAY,IAAI,EAEtB,CAAC,KAAMA,EAAY,wBAAwB,EAC3C,CAAC,KAAMA,EAAY,wBAAwB,EAC3C,CAAC,KAAMA,EAAY,wBAAwB,EAC3C,CAAC,KAAMA,EAAY,wBAAwB,EAC3C,CAAC,IAAKA,EAAY,wBAAwB,EAC1C,CAAC,IAAKA,EAAY,wBAAwB,EAE1C,CAAC,IAAKA,EAAY,sBAAsB,EACxC,CAAC,IAAKA,EAAY,sBAAsB,EACxC,CAAC,IAAKA,EAAY,sBAAsB,EACxC,CAAC,IAAKA,EAAY,4BAA4B,EAC9C,CAAC,IAAKA,EAAY,4BAA4B,EAC9C,CAAC,IAAKA,EAAY,4BAA4B,EAE9C,CAAC,IAAKA,EAAY,MAAM,CAC1B,EACIS,GAAoC,IAAI,IAAI,CAC9C,CAAC,IAAK;AAAA,CAAI,EAEV,CAAC,IAAK,GAAG,EAET,CAAC,IAAK,IAAI,EAEV,CAAC,IAAK,IAAI,EAEV,CAAC,IAAK,IAAI,EAEV,CAAC,IAAK,IAAI,EAEV,CAAC,IAAK,GAAG,EAET,CAAC,IAAK,GAAG,EAET,CAAC,KAAM,IAAI,CAEb,CAAC,EACD,SAASC,GAAWC,EAAUC,EAAU,CAAC,EAAG,CAC1C,OAAID,EAAS,SAAS;AAAA,CAAI,IACxBA,EAAWA,EAAS,MAAM,EAAG,EAAE,GAE7BC,EAAQ,gBACVD,EAAWA,EAAS,QAAQ,oBAAqB,IAAI,GAEnDC,EAAQ,cACVD,EAAWA,EAAS,QAAQ,cAAe,IAAI,GAE1CA,EAAS,QAAQ,+BAAgC,EAAE,CAC5D,CACA,SAASE,GAASC,EAAQF,EAAU,CAAC,EAAG,CACtC,IAAMG,EAAS,CAAC,EACVC,EAAMN,GAAWI,EAAQF,CAAO,EAClCK,EAAiB,EACjBC,EAAoB,EAClBC,EAAgBC,GAAc,CAClC,IAAIC,EAAM,GACV,KAAOD,EAAUJ,EAAIC,CAAc,CAAC,GAAG,CACrC,GAAID,EAAIC,CAAc,IAAM,KAAM,CAEhC,GADA,EAAEA,EACEA,GAAkBD,EAAI,OACxB,MAAM,IAAI,YAAY,yBAAyB,EACjD,IAAMM,EAAUN,EAAIC,GAAgB,EAC9BM,EAAYd,GAAkB,IAAIa,CAAO,EAC/C,GAAIC,IAAc,OAChB,MAAM,IAAI,YAAY,iCAAiCD,CAAO,EAAE,EAElED,GAAOE,EACP,QACF,CAEA,GADAF,GAAOL,EAAIC,GAAgB,EACvBA,GAAkBD,EAAI,OACxB,MAAM,IAAI,YAAY,yBAAyB,CACnD,CACA,OAAOK,CACT,EACMG,EAA0B,IAAM,CACpC,IAAMC,EAAYV,EAAO,GAAG,EAAE,EAC1BU,GAAaA,EAAU,OAASzB,EAAY,OAC9CyB,EAAU,MAAQA,EAAU,MAAM,QAAQ,EACtCA,EAAU,QAAU,IACtBV,EAAO,IAAI,EAGjB,EACMW,EAAwB,IAAM,CAClC,KAAOT,EAAiBD,EAAI,QAAUT,GAAaS,EAAIC,CAAc,CAAC,GACpE,EAAEA,CAEN,EACAU,EACE,KAAOV,EAAiBD,EAAI,QAAQ,CAClC,IAAMY,EAAgBb,EAAO,GAAG,EAAE,GAAG,KACrC,GAAIa,IAAkB,QAAUA,IAAkB5B,EAAY,gBAAkB4B,IAAkB5B,EAAY,iBAAmB4B,IAAkB5B,EAAY,QAAS,CACtK,IAAI6B,EAAO,GACX,KAAOZ,EAAiBD,EAAI,QAC5B,EAAEA,EAAIC,CAAc,IAAM,MAAQD,EAAIC,EAAiB,CAAC,IAAM,KAAOD,EAAIC,EAAiB,CAAC,IAAM,KAAOD,EAAIC,EAAiB,CAAC,IAAM,OAClIY,GAAQb,EAAIC,GAAgB,EAE9B,GAAIY,EAAK,OAAS,EAAG,CACnBd,EAAO,KAAK,IAAId,GAAM4B,EAAM7B,EAAY,IAAI,CAAC,EAC7C,QACF,CACF,CACA,GAAIgB,EAAIC,CAAc,IAAM,KAAOD,EAAIC,EAAiB,CAAC,IAAM,IAAK,CAClEA,GAAkB,EAClB,IAAMa,EAAcd,EAAIC,CAAc,IAAM,IACxCa,GACF,EAAEb,EAEJ,IAAIc,EAAU,GACd,KAAOf,EAAIC,CAAc,IAAM,KAAOD,EAAIC,EAAiB,CAAC,IAAM,KAAK,CACrE,GAAIA,EAAiB,GAAKD,EAAI,OAC5B,MAAM,IAAI,YAAY,4BAA4B,EAEpDe,GAAWf,EAAIC,GAAgB,CACjC,CACA,IAAMe,EAAaD,EAAQ,SAAS,GAAG,EACnCC,IACFD,EAAUA,EAAQ,MAAM,EAAG,EAAE,GAE3BD,GACFN,EAAwB,EAE1BT,EAAO,KAAK,IAAId,GAAM8B,EAAS/B,EAAY,OAAO,CAAC,EACnDiB,GAAkB,EACde,GACFN,EAAsB,EAExB,QACF,CACA,GAAIV,EAAI,MAAMC,EAAgBA,EAAiB,CAAC,IAAM,MAAO,CAC3DO,EAAwB,EACxBT,EAAO,KAAK,IAAId,GAAM,KAAMD,EAAY,aAAa,CAAC,EACtDiB,GAAkB,EAClB,QACF,CACA,GAAID,EAAI,MAAMC,EAAgBA,EAAiB,CAAC,IAAM,MAAO,CAC3DO,EAAwB,EACxBT,EAAO,KAAK,IAAId,GAAM,KAAMD,EAAY,cAAc,CAAC,EACvDkB,EAAoB,EACpBD,GAAkB,EAClB,QACF,CAEA,GADAE,EAAaZ,EAAY,EACrBS,EAAI,MAAMC,EAAgBA,EAAiB,CAAC,IAAM,MAAO,CAC3DF,EAAO,KAAK,IAAId,GAAM,KAAMD,EAAY,cAAc,CAAC,EACvDiB,GAAkB,EAClBS,EAAsB,EACtB,QACF,CACA,GAAIV,EAAI,MAAMC,EAAgBA,EAAiB,CAAC,IAAM,MAAO,CAC3DF,EAAO,KAAK,IAAId,GAAM,KAAMD,EAAY,eAAe,CAAC,EACxDiB,GAAkB,EAClBS,EAAsB,EACtB,QACF,CACA,IAAMrB,EAAOW,EAAIC,CAAc,EAC/B,GAAIZ,IAAS,KAAOA,IAAS,IAAK,CAChC,IAAM4B,EAAiBlB,EAAO,GAAG,EAAE,GAAG,KACtC,GAAIkB,IAAmBjC,EAAY,MAAQiC,IAAmB,OAC5D,MAAM,IAAI,YAAY,yBAAyB5B,CAAI,EAAE,EAEvD,OAAQ4B,EAAgB,CACtB,KAAKjC,EAAY,WACjB,KAAKA,EAAY,eACjB,KAAKA,EAAY,cACjB,KAAKA,EAAY,WACjB,KAAKA,EAAY,mBACf,MACF,QAAS,CACP,EAAEiB,EACF,IAAMiB,EAAMf,EAAab,EAAS,EAClCS,EAAO,KACL,IAAId,GAAM,GAAGI,CAAI,GAAG6B,CAAG,GAAIA,EAAI,OAAS,EAAIlC,EAAY,eAAiBA,EAAY,aAAa,CACpG,EACA,QACF,CACF,CACF,CACA,OAAW,CAACmC,EAAKhC,CAAI,IAAKK,GAAuB,CAC/C,GAAI2B,IAAQ,MAAQjB,EAAoB,EACtC,SAGF,GADeF,EAAI,MAAMC,EAAgBA,EAAiBkB,EAAI,MAAM,IACrDA,EAAK,CAClBpB,EAAO,KAAK,IAAId,GAAMkC,EAAKhC,CAAI,CAAC,EAC5BA,IAASH,EAAY,eACvBkB,EAAoB,EACXf,IAASH,EAAY,iBAC9B,EAAEkB,EACOf,IAASH,EAAY,mBAC9B,EAAEkB,EAEJD,GAAkBkB,EAAI,OACtB,SAASR,CACX,CACF,CACA,GAAItB,IAAS,KAAOA,IAAS,IAAK,CAChC,EAAEY,EACF,IAAMI,EAAMF,EAAciB,GAAMA,IAAM/B,CAAI,EAC1CU,EAAO,KAAK,IAAId,GAAMoB,EAAKrB,EAAY,aAAa,CAAC,EACrD,EAAEiB,EACF,QACF,CACA,GAAIX,GAAUD,CAAI,EAAG,CACnB,IAAI6B,EAAMf,EAAab,EAAS,EAChC,GAAIU,EAAIC,CAAc,IAAM,KAAOX,GAAUU,EAAIC,EAAiB,CAAC,CAAC,EAAG,CACrE,EAAEA,EACF,IAAMoB,EAAOlB,EAAab,EAAS,EACnC4B,EAAM,GAAGA,CAAG,IAAIG,CAAI,EACtB,CACAtB,EAAO,KAAK,IAAId,GAAMiC,EAAKlC,EAAY,cAAc,CAAC,EACtD,QACF,CACA,GAAII,GAAOC,CAAI,EAAG,CAChB,IAAMiC,EAAOnB,EAAaf,EAAM,EAChCW,EAAO,KAAK,IAAId,GAAMqC,EAAMtC,EAAY,UAAU,CAAC,EACnD,QACF,CACA,MAAM,IAAI,YAAY,yBAAyBK,CAAI,EAAE,CACvD,CACF,OAAOU,CACT,CAGA,IAAIwB,GAAY,KAAM,CACpB,KAAO,WACT,EACIC,GAAU,cAAcD,EAAU,CACpC,YAAYE,EAAM,CAChB,MAAM,EACN,KAAK,KAAOA,CACd,CACA,KAAO,SACT,EACIC,GAAK,cAAcH,EAAU,CAC/B,YAAYI,EAAMF,EAAMG,EAAW,CACjC,MAAM,EACN,KAAK,KAAOD,EACZ,KAAK,KAAOF,EACZ,KAAK,UAAYG,CACnB,CACA,KAAO,IACT,EACIC,GAAM,cAAcN,EAAU,CAChC,YAAYO,EAASC,EAAUN,EAAMO,EAAc,CACjD,MAAM,EACN,KAAK,QAAUF,EACf,KAAK,SAAWC,EAChB,KAAK,KAAON,EACZ,KAAK,aAAeO,CACtB,CACA,KAAO,KACT,EACIC,GAAQ,cAAcV,EAAU,CAClC,KAAO,OACT,EACIW,GAAW,cAAcX,EAAU,CACrC,KAAO,UACT,EACIY,GAAe,cAAcZ,EAAU,CACzC,YAAYa,EAAUlD,EAAOuC,EAAM,CACjC,MAAM,EACN,KAAK,SAAWW,EAChB,KAAK,MAAQlD,EACb,KAAK,KAAOuC,CACd,CACA,KAAO,KACT,EACIY,GAAQ,cAAcd,EAAU,CAClC,YAAYe,EAAMC,EAAMd,EAAM,CAC5B,MAAM,EACN,KAAK,KAAOa,EACZ,KAAK,KAAOC,EACZ,KAAK,KAAOd,CACd,CACA,KAAO,OACT,EACIe,GAAU,cAAcjB,EAAU,CACpC,YAAYrC,EAAO,CACjB,MAAM,EACN,KAAK,MAAQA,CACf,CACA,KAAO,SACT,EACIuD,GAAa,cAAclB,EAAU,CACvC,KAAO,YACT,EACImB,GAAmB,cAAcD,EAAW,CAC9C,YAAYE,EAAQC,EAAUC,EAAU,CACtC,MAAM,EACN,KAAK,OAASF,EACd,KAAK,SAAWC,EAChB,KAAK,SAAWC,CAClB,CACA,KAAO,kBACT,EACIC,GAAiB,cAAcL,EAAW,CAC5C,YAAYM,EAAQR,EAAM,CACxB,MAAM,EACN,KAAK,OAASQ,EACd,KAAK,KAAOR,CACd,CACA,KAAO,gBACT,EACIS,GAAa,cAAcP,EAAW,CAIxC,YAAYvD,EAAO,CACjB,MAAM,EACN,KAAK,MAAQA,CACf,CACA,KAAO,YACT,EACI+D,GAAU,cAAcR,EAAW,CACrC,YAAYvD,EAAO,CACjB,MAAM,EACN,KAAK,MAAQA,CACf,CACA,KAAO,SACT,EACIgE,GAAiB,cAAcD,EAAQ,CACzC,KAAO,gBACT,EACIE,GAAe,cAAcF,EAAQ,CACvC,KAAO,cACT,EACIG,GAAgB,cAAcH,EAAQ,CACxC,KAAO,eACT,EACII,GAAe,cAAcJ,EAAQ,CACvC,KAAO,cACT,EACIK,GAAe,cAAcL,EAAQ,CACvC,KAAO,cACT,EACIM,GAAgB,cAAcN,EAAQ,CACxC,KAAO,eACT,EACIO,GAAmB,cAAcf,EAAW,CAC9C,YAAYgB,EAAUC,EAAMC,EAAO,CACjC,MAAM,EACN,KAAK,SAAWF,EAChB,KAAK,KAAOC,EACZ,KAAK,MAAQC,CACf,CACA,KAAO,kBACT,EACIC,GAAmB,cAAcnB,EAAW,CAC9C,YAAYoB,EAASC,EAAQ,CAC3B,MAAM,EACN,KAAK,QAAUD,EACf,KAAK,OAASC,CAChB,CACA,KAAO,kBACT,EACIC,GAAkB,cAAcxC,EAAU,CAC5C,YAAYuC,EAAQrC,EAAM,CACxB,MAAM,EACN,KAAK,OAASqC,EACd,KAAK,KAAOrC,CACd,CACA,KAAO,iBACT,EACIuC,GAAmB,cAAcvB,EAAW,CAC9C,YAAYwB,EAAKtC,EAAM,CACrB,MAAM,EACN,KAAK,IAAMsC,EACX,KAAK,KAAOtC,CACd,CACA,KAAO,kBACT,EACIuC,GAAiB,cAAczB,EAAW,CAC5C,YAAYoB,EAASM,EAAQxC,EAAM,CACjC,MAAM,EACN,KAAK,QAAUkC,EACf,KAAK,OAASM,EACd,KAAK,KAAOxC,CACd,CACA,KAAO,gBACT,EACIyC,GAAkB,cAAc3B,EAAW,CAC7C,YAAYgB,EAAUY,EAAU,CAC9B,MAAM,EACN,KAAK,SAAWZ,EAChB,KAAK,SAAWY,CAClB,CACA,KAAO,iBACT,EACIC,GAAkB,cAAc7B,EAAW,CAC7C,YAAY8B,EAAQ,OAAQC,EAAO,OAAQC,EAAO,OAAQ,CACxD,MAAM,EACN,KAAK,MAAQF,EACb,KAAK,KAAOC,EACZ,KAAK,KAAOC,CACd,CACA,KAAO,iBACT,EACIC,GAA4B,cAAcjC,EAAW,CACvD,YAAYkC,EAAKzF,EAAO,CACtB,MAAM,EACN,KAAK,IAAMyF,EACX,KAAK,MAAQzF,CACf,CACA,KAAO,2BACT,EACI0F,GAAmB,cAAcnC,EAAW,CAC9C,YAAY4B,EAAU,CACpB,MAAM,EACN,KAAK,SAAWA,CAClB,CACA,KAAO,kBACT,EACIQ,GAAgB,cAActD,EAAU,CAC1C,YAAYuD,EAAMC,EAAYtD,EAAM,CAClC,MAAM,EACN,KAAK,KAAOqD,EACZ,KAAK,WAAaC,EAClB,KAAK,KAAOtD,CACd,CACA,KAAO,eACT,EACIuD,GAAU,cAAcvC,EAAW,CACrC,YAAYwC,EAAWC,EAAUC,EAAW,CAC1C,MAAM,EACN,KAAK,UAAYF,EACjB,KAAK,SAAWC,EAChB,KAAK,UAAYC,CACnB,CACA,KAAO,SACT,EAGA,SAASC,GAAMrF,EAAQ,CACrB,IAAMsF,EAAU,IAAI7D,GAAQ,CAAC,CAAC,EAC1B8D,EAAU,EACd,SAASC,EAAOpG,EAAMqG,EAAO,CAC3B,IAAMC,EAAO1F,EAAOuF,GAAS,EAC7B,GAAI,CAACG,GAAQA,EAAK,OAAStG,EACzB,MAAM,IAAI,MAAM,iBAAiBqG,CAAK,KAAKC,EAAK,IAAI,QAAQtG,CAAI,GAAG,EAErE,OAAOsG,CACT,CACA,SAASC,EAAiBpD,EAAM,CAC9B,GAAI,CAACqD,EAAarD,CAAI,EACpB,MAAM,IAAI,YAAY,YAAYA,CAAI,EAAE,EAE1C,EAAEgD,CACJ,CACA,SAASM,GAAW,CAClB,OAAQ7F,EAAOuF,CAAO,EAAE,KAAM,CAC5B,KAAKtG,EAAY,QACf,OAAO,IAAIwD,GAAQzC,EAAOuF,GAAS,EAAE,KAAK,EAC5C,KAAKtG,EAAY,KACf,OAAO6G,EAAU,EACnB,KAAK7G,EAAY,cACf,OAAO8G,EAAoB,EAC7B,KAAK9G,EAAY,eACf,OAAO+G,EAAqB,EAC9B,QACE,MAAM,IAAI,YAAY,0BAA0BhG,EAAOuF,CAAO,EAAE,IAAI,EAAE,CAC1E,CACF,CACA,SAASU,KAAMC,EAAO,CACpB,OAAOX,EAAUW,EAAM,QAAUlG,EAAO,QAAUkG,EAAM,MAAM,CAAC9G,EAAM+G,IAAM/G,IAASY,EAAOuF,EAAUY,CAAC,EAAE,IAAI,CAC9G,CACA,SAASC,KAAeC,EAAO,CAC7B,OAAOrG,EAAOuF,CAAO,GAAG,OAAStG,EAAY,eAAiBe,EAAOuF,EAAU,CAAC,GAAG,OAAStG,EAAY,YAAcoH,EAAM,SAASrG,EAAOuF,EAAU,CAAC,GAAG,KAAK,CACjK,CACA,SAASK,KAAgBS,EAAO,CAC9B,OAAOd,EAAUc,EAAM,QAAUrG,EAAO,QAAUqG,EAAM,MAAM,CAAC9D,EAAM4D,IAAMnG,EAAOuF,EAAUY,CAAC,EAAE,OAAS,cAAgB5D,IAASvC,EAAOuF,EAAUY,CAAC,EAAE,KAAK,CAC5J,CACA,SAASL,GAAY,CACnB,OAAO,IAAIzC,GAAcmC,EAAOvG,EAAY,KAAM,qBAAqB,EAAE,KAAK,CAChF,CACA,SAAS8G,GAAsB,CAE7B,GADAP,EAAOvG,EAAY,cAAe,kCAAkC,EAChEe,EAAOuF,CAAO,EAAE,OAAStG,EAAY,WACvC,MAAM,IAAI,YAAY,0BAA0Be,EAAOuF,CAAO,EAAE,IAAI,EAAE,EAExE,IAAMhD,EAAOvC,EAAOuF,CAAO,EAAE,MACzBe,EACJ,OAAQ/D,EAAM,CACZ,IAAK,MACH,EAAEgD,EACFe,EAASC,EAAkB,EAC3B,MACF,IAAK,KACH,EAAEhB,EACFe,EAASE,EAAiB,EAC1BhB,EAAOvG,EAAY,cAAe,mBAAmB,EACrD0G,EAAiB,OAAO,EACxBH,EAAOvG,EAAY,eAAgB,mBAAmB,EACtD,MACF,IAAK,QACH,EAAEsG,EACFe,EAASG,EAAoB,EAC7BjB,EAAOvG,EAAY,cAAe,mBAAmB,EACrD0G,EAAiB,UAAU,EAC3BH,EAAOvG,EAAY,eAAgB,mBAAmB,EACtD,MACF,IAAK,MACH,EAAEsG,EACFe,EAASI,EAAkB,EAC3BlB,EAAOvG,EAAY,cAAe,mBAAmB,EACrD0G,EAAiB,QAAQ,EACzBH,EAAOvG,EAAY,eAAgB,mBAAmB,EACtD,MACF,IAAK,OAAQ,CACX,EAAEsG,EACF,IAAIP,EAAa,KACbiB,EAAGhH,EAAY,SAAS,IAC1B+F,EAAa2B,EAAU,GAEzB,IAAM3D,GAAS4D,GAAuB,EACtC,GAAI5D,GAAO,OAAS,aAClB,MAAM,IAAI,YAAY,8CAA8C,EAEtE,IAAM6D,GAAWF,EAAU,EAC3BnB,EAAOvG,EAAY,eAAgB,kCAAkC,EACrE,IAAMyC,GAAO,CAAC,EACd,KAAO,CAAC0E,EAAY,SAAS,GAC3B1E,GAAK,KAAKmE,EAAS,CAAC,EAEtBL,EAAOvG,EAAY,cAAe,eAAe,EACjD0G,EAAiB,SAAS,EAC1BH,EAAOvG,EAAY,eAAgB,kCAAkC,EACrE,IAAM6H,GAAW,IAAI/D,GAAeC,GAAQ6D,EAAQ,EACpDP,EAAS,IAAIxB,GAAcgC,GAAU9B,EAAYtD,EAAI,EACrD,KACF,CACA,IAAK,QACH,EAAE6D,EACFC,EAAOvG,EAAY,eAAgB,kCAAkC,EACrEqH,EAAS,IAAIpE,GACb,MACF,IAAK,WACH,EAAEqD,EACFC,EAAOvG,EAAY,eAAgB,kCAAkC,EACrEqH,EAAS,IAAInE,GACb,MACF,IAAK,SAAU,CACb,EAAEoD,EACF,IAAIwB,EAAaH,GAAuB,EACpCG,aAAsB9D,IAAcgD,EAAGhH,EAAY,SAAS,IAC9D8H,EAAaC,EAAoBD,CAAU,GAE7CvB,EAAOvG,EAAY,eAAgB,kCAAkC,EACrE,IAAMgI,GAAa,CAAC,EACpB,KAAO,CAACb,EAAY,WAAW,GAC7Ba,GAAW,KAAKpB,EAAS,CAAC,EAE5BL,EAAOvG,EAAY,cAAe,eAAe,EACjD0G,EAAiB,WAAW,EAC5BH,EAAOvG,EAAY,eAAgB,eAAe,EAClDqH,EAAS,IAAItC,GAAgB+C,EAAYE,EAAU,EACnD,KACF,CACA,QACE,MAAM,IAAI,YAAY,2BAA2B1E,CAAI,EAAE,CAC3D,CACA,OAAO+D,CACT,CACA,SAASN,GAAuB,CAC9BR,EAAOvG,EAAY,eAAgB,mCAAmC,EACtE,IAAMqH,EAASY,EAAgB,EAC/B,OAAA1B,EAAOvG,EAAY,gBAAiB,mCAAmC,EAChEqH,CACT,CACA,SAASC,GAAoB,CAC3B,IAAM5C,EAAOwD,EAAwB,EACjChI,EAAQ,KACNuC,EAAO,CAAC,EACd,GAAIuE,EAAGhH,EAAY,MAAM,EACvB,EAAEsG,EACFpG,EAAQgI,EAAwB,MAC3B,CAEL,IADA3B,EAAOvG,EAAY,eAAgB,mBAAmB,EAC/C,CAACmH,EAAY,QAAQ,GAC1B1E,EAAK,KAAKmE,EAAS,CAAC,EAEtBL,EAAOvG,EAAY,cAAe,mBAAmB,EACrD0G,EAAiB,QAAQ,CAC3B,CACA,OAAAH,EAAOvG,EAAY,eAAgB,kCAAkC,EAC9D,IAAImD,GAAauB,EAAMxE,EAAOuC,CAAI,CAC3C,CACA,SAAS8E,GAAmB,CAC1B,IAAM5E,EAAOsF,EAAgB,EAC7B1B,EAAOvG,EAAY,eAAgB,kCAAkC,EACrE,IAAMyC,EAAO,CAAC,EACRG,EAAY,CAAC,EACnB,KAAO,CAACuE,EAAY,OAAQ,OAAQ,OAAO,GACzC1E,EAAK,KAAKmE,EAAS,CAAC,EAEtB,GAAIO,EAAY,MAAM,EAAG,CACvB,EAAEb,EACF,EAAEA,EACF,IAAMe,GAASE,EAAiB,EAChC3E,EAAU,KAAKyE,EAAM,CACvB,SAAWF,EAAY,MAAM,EAI3B,IAHA,EAAEb,EACF,EAAEA,EACFC,EAAOvG,EAAY,eAAgB,kCAAkC,EAC9D,CAACmH,EAAY,OAAO,GACzBvE,EAAU,KAAKgE,EAAS,CAAC,EAG7B,OAAO,IAAIlE,GAAGC,EAAMF,EAAMG,CAAS,CACrC,CACA,SAAS4E,GAAsB,CAC7B,IAAMlE,EAAOqE,GAAuB,EACpC,GAAIrE,EAAK,OAAS,aAChB,MAAM,IAAI,YAAY,+CAA+C,EAEvE,IAAMC,EAAOmE,EAAU,EACvBnB,EAAOvG,EAAY,eAAgB,kCAAkC,EACrE,IAAMyC,EAAO,CAAC,EACd,KAAO,CAAC0E,EAAY,UAAU,GAC5B1E,EAAK,KAAKmE,EAAS,CAAC,EAEtB,OAAO,IAAIvD,GAAMC,EAAMC,EAAMd,CAAI,CACnC,CACA,SAASyF,EAAwBC,EAAU,GAAO,CAChD,IAAMC,EAAKD,EAAUR,GAAyBM,EACxCI,EAAc,CAACD,EAAG,CAAC,EACnBE,GAAUtB,EAAGhH,EAAY,KAAK,EACpC,KAAOsI,KACL,EAAEhC,EACF+B,EAAY,KAAKD,EAAG,CAAC,EACjB,EAACpB,EAAGhH,EAAY,KAAK,IAAzB,CAIF,OAAOsI,GAAU,IAAIhE,GAAa+D,CAAW,EAAIA,EAAY,CAAC,CAChE,CACA,SAASZ,GAAoB,CAC3B,IAAMc,EAAeL,EAAwB,EAAI,EACjD,GAAI,EAAEK,aAAwBvE,IAAcuE,aAAwBjE,IAClE,MAAM,IAAI,YAAY,wDAAwDiE,EAAa,IAAI,UAAU,EAE3G,GAAI,CAAC5B,EAAa,IAAI,EACpB,MAAM,IAAI,YAAY,+CAA+C,EAEvE,EAAEL,EACF,IAAMvD,EAAWkF,EAAgB,EACjC1B,EAAOvG,EAAY,eAAgB,kCAAkC,EACrE,IAAMyC,EAAO,CAAC,EACd,KAAO,CAAC0E,EAAY,SAAU,MAAM,GAClC1E,EAAK,KAAKmE,EAAS,CAAC,EAEtB,IAAM4B,GAAc,CAAC,EACrB,GAAIrB,EAAY,MAAM,EAIpB,IAHA,EAAEb,EACF,EAAEA,EACFC,EAAOvG,EAAY,eAAgB,kCAAkC,EAC9D,CAACmH,EAAY,QAAQ,GAC1BqB,GAAY,KAAK5B,EAAS,CAAC,EAG/B,OAAO,IAAI/D,GAAI0F,EAAcxF,EAAUN,EAAM+F,EAAW,CAC1D,CACA,SAASP,GAAkB,CACzB,OAAOQ,EAAkB,CAC3B,CACA,SAASA,GAAoB,CAC3B,IAAMC,EAAIC,EAAyB,EACnC,GAAIhC,EAAa,IAAI,EAAG,CACtB,EAAEL,EACF,IAAM3D,EAAOgG,EAAyB,EACtC,GAAIhC,EAAa,MAAM,EAAG,CACxB,EAAEL,EACF,IAAMH,EAAYsC,EAAkB,EACpC,OAAO,IAAIzC,GAAQrD,EAAM+F,EAAGvC,CAAS,CACvC,KACE,QAAO,IAAInB,GAAiB0D,EAAG/F,CAAI,CAEvC,CACA,OAAO+F,CACT,CACA,SAASC,GAA2B,CAClC,IAAIjE,EAAOkE,EAA0B,EACrC,KAAOjC,EAAa,IAAI,GAAG,CACzB,IAAMlC,EAAW1D,EAAOuF,CAAO,EAC/B,EAAEA,EACF,IAAM3B,EAAQiE,EAA0B,EACxClE,EAAO,IAAIF,GAAiBC,EAAUC,EAAMC,CAAK,CACnD,CACA,OAAOD,CACT,CACA,SAASkE,GAA4B,CACnC,IAAIlE,EAAOmE,EAA+B,EAC1C,KAAOlC,EAAa,KAAK,GAAG,CAC1B,IAAMlC,EAAW1D,EAAOuF,CAAO,EAC/B,EAAEA,EACF,IAAM3B,EAAQkE,EAA+B,EAC7CnE,EAAO,IAAIF,GAAiBC,EAAUC,EAAMC,CAAK,CACnD,CACA,OAAOD,CACT,CACA,SAASmE,GAAiC,CACxC,IAAIlE,EACJ,KAAOgC,EAAa,KAAK,GAAG,CAC1B,IAAMlC,EAAW1D,EAAOuF,CAAO,EAC/B,EAAEA,EACF,IAAMwC,EAAMD,EAA+B,EAC3ClE,EAAQ,IAAIS,GAAgBX,EAAUqE,CAAG,CAC3C,CACA,OAAOnE,GAASoE,EAA0B,CAC5C,CACA,SAASA,GAA4B,CACnC,IAAIrE,EAAOsE,EAAwB,EACnC,OAAa,CACX,IAAIvE,EACJ,GAAIkC,EAAa,MAAO,IAAI,EAC1BlC,EAAW,IAAIxE,GAAM,SAAUD,EAAY,UAAU,EACrDsG,GAAW,UACFK,EAAa,IAAI,EAC1BlC,EAAW1D,EAAOuF,GAAS,UAClBU,EAAGhH,EAAY,wBAAwB,EAChDyE,EAAW1D,EAAOuF,GAAS,MAE3B,OAEF,IAAM3B,EAAQqE,EAAwB,EACtCtE,EAAO,IAAIF,GAAiBC,EAAUC,EAAMC,CAAK,CACnD,CACA,OAAOD,CACT,CACA,SAASsE,GAA0B,CACjC,IAAItE,EAAOuE,EAA8B,EACzC,KAAOjC,EAAGhH,EAAY,sBAAsB,GAAG,CAC7C,IAAMyE,EAAW1D,EAAOuF,CAAO,EAC/B,EAAEA,EACF,IAAM3B,EAAQsE,EAA8B,EAC5CvE,EAAO,IAAIF,GAAiBC,EAAUC,EAAMC,CAAK,CACnD,CACA,OAAOD,CACT,CACA,SAASwE,GAA4B,CACnC,IAAMC,EAASC,EAAsBzB,GAAuB,CAAC,EAC7D,OAAIX,EAAGhH,EAAY,SAAS,EACnB+H,EAAoBoB,CAAM,EAE5BA,CACT,CACA,SAASpB,EAAoBhE,EAAQ,CACnC,IAAIsF,EAAa,IAAIvF,GAAeC,EAAQ2D,EAAU,CAAC,EACvD,OAAA2B,EAAaD,EAAsBC,CAAU,EACzCrC,EAAGhH,EAAY,SAAS,IAC1BqJ,EAAatB,EAAoBsB,CAAU,GAEtCA,CACT,CACA,SAAS3B,GAAY,CACnBnB,EAAOvG,EAAY,UAAW,iDAAiD,EAC/E,IAAMuD,EAAO+F,EAAmB,EAChC,OAAA/C,EAAOvG,EAAY,WAAY,iDAAiD,EACzEuD,CACT,CACA,SAAS+F,GAAqB,CAC5B,IAAM/F,EAAO,CAAC,EACd,KAAO,CAACyD,EAAGhH,EAAY,UAAU,GAAG,CAClC,IAAIqF,EACJ,GAAItE,EAAOuF,CAAO,EAAE,OAAStG,EAAY,8BAAgCe,EAAOuF,CAAO,EAAE,QAAU,IAAK,CACtG,EAAEA,EACF,IAAMiD,EAAOtB,EAAgB,EAC7B5C,EAAW,IAAIO,GAAiB2D,CAAI,CACtC,SACElE,EAAW4C,EAAgB,EACvBjB,EAAGhH,EAAY,MAAM,EAAG,CAE1B,GADA,EAAEsG,EACE,EAAEjB,aAAoBrB,IACxB,MAAM,IAAI,YAAY,0CAA0C,EAElE,IAAM9D,EAAQ+H,EAAgB,EAC9B5C,EAAW,IAAIK,GAA0BL,EAAUnF,CAAK,CAC1D,CAEFqD,EAAK,KAAK8B,CAAQ,EACd2B,EAAGhH,EAAY,KAAK,GACtB,EAAEsG,CAEN,CACA,OAAO/C,CACT,CACA,SAASiG,GAAqC,CAC5C,IAAMC,EAAS,CAAC,EACZC,EAAU,GACd,KAAO,CAAC1C,EAAGhH,EAAY,kBAAkB,GACnCgH,EAAGhH,EAAY,KAAK,GACtByJ,EAAO,KAAK,MAAM,EAClB,EAAEnD,EACFoD,EAAU,KAEVD,EAAO,KAAKxB,EAAgB,CAAC,EACzBjB,EAAGhH,EAAY,KAAK,IACtB,EAAEsG,EACFoD,EAAU,KAIhB,GAAID,EAAO,SAAW,EACpB,MAAM,IAAI,YAAY,4DAA4D,EAEpF,GAAIC,EAAS,CACX,GAAID,EAAO,OAAS,EAClB,MAAM,IAAI,YAAY,6CAA6C,EAErE,OAAO,IAAInE,GAAgB,GAAGmE,CAAM,CACtC,CACA,OAAOA,EAAO,CAAC,CACjB,CACA,SAASL,EAAsBzF,EAAQ,CACrC,KAAOqD,EAAGhH,EAAY,GAAG,GAAKgH,EAAGhH,EAAY,iBAAiB,GAAG,CAC/D,IAAMyE,EAAW1D,EAAOuF,CAAO,EAC/B,EAAEA,EACF,IAAI1C,EACEC,GAAWY,EAAS,OAASzE,EAAY,kBAC/C,GAAI6D,GACFD,EAAW4F,EAAmC,EAC9CjD,EAAOvG,EAAY,mBAAoB,iCAAiC,UAExE4D,EAAW+D,GAAuB,EAC9B/D,EAAS,OAAS,aACpB,MAAM,IAAI,YAAY,4CAA4C,EAGtED,EAAS,IAAID,GAAiBC,EAAQC,EAAUC,EAAQ,CAC1D,CACA,OAAOF,CACT,CACA,SAASsF,GAAgC,CACvC,IAAIvE,EAAOiF,EAAoB,EAC/B,KAAO3C,EAAGhH,EAAY,4BAA4B,GAAG,CACnD,IAAMyE,EAAW1D,EAAOuF,GAAS,EAC3B3B,EAAQgF,EAAoB,EAClCjF,EAAO,IAAIF,GAAiBC,EAAUC,EAAMC,CAAK,CACnD,CACA,OAAOD,CACT,CACA,SAASiF,GAAsB,CAC7B,IAAI9E,EAAU+E,EAAsB,EACpC,KAAOjD,EAAa,IAAI,GAAG,CACzB,EAAEL,EACF,IAAMnB,EAASwB,EAAa,KAAK,EAC7BxB,GACF,EAAEmB,EAEJ,IAAMxB,EAAS6C,GAAuB,EACtC,GAAI,EAAE7C,aAAkBd,IACtB,MAAM,IAAI,YAAY,kCAAkC,EAE1Da,EAAU,IAAIK,GAAeL,EAASM,EAAQL,CAAM,CACtD,CACA,OAAOD,CACT,CACA,SAAS+E,GAAwB,CAC/B,IAAI/E,EAAUqE,EAA0B,EACxC,KAAOlC,EAAGhH,EAAY,IAAI,GAAG,CAC3B,EAAEsG,EACF,IAAIxB,EAAS6C,GAAuB,EACpC,GAAI,EAAE7C,aAAkBd,IACtB,MAAM,IAAI,YAAY,oCAAoC,EAExDgD,EAAGhH,EAAY,SAAS,IAC1B8E,EAASiD,EAAoBjD,CAAM,GAErCD,EAAU,IAAID,GAAiBC,EAASC,CAAM,CAChD,CACA,OAAOD,CACT,CACA,SAAS8C,IAAyB,CAChC,IAAMkC,EAAQ9I,EAAOuF,GAAS,EAC9B,OAAQuD,EAAM,KAAM,CAClB,KAAK7J,EAAY,eAAgB,CAC/B,IAAMkC,EAAM2H,EAAM,MAClB,OAAO3H,EAAI,SAAS,GAAG,EAAI,IAAIiC,GAAa,OAAOjC,CAAG,CAAC,EAAI,IAAIgC,GAAe,OAAOhC,CAAG,CAAC,CAC3F,CACA,KAAKlC,EAAY,cAAe,CAC9B,IAAIE,EAAQ2J,EAAM,MAClB,KAAO7C,EAAGhH,EAAY,aAAa,GACjCE,GAASa,EAAOuF,GAAS,EAAE,MAE7B,OAAO,IAAIlC,GAAclE,CAAK,CAChC,CACA,KAAKF,EAAY,WACf,OAAO,IAAIgE,GAAW6F,EAAM,KAAK,EACnC,KAAK7J,EAAY,UAAW,CAC1B,IAAMqJ,EAAanB,EAAwB,EAC3C,OAAA3B,EAAOvG,EAAY,WAAY,oEAAoE,EAC5FqJ,CACT,CACA,KAAKrJ,EAAY,kBAAmB,CAClC,IAAM8J,EAAS,CAAC,EAChB,KAAO,CAAC9C,EAAGhH,EAAY,kBAAkB,GACvC8J,EAAO,KAAK7B,EAAgB,CAAC,EACzBjB,EAAGhH,EAAY,KAAK,GACtB,EAAEsG,EAGN,QAAEA,EACK,IAAIjC,GAAayF,CAAM,CAChC,CACA,KAAK9J,EAAY,iBAAkB,CACjC,IAAM8J,EAAyB,IAAI,IACnC,KAAO,CAAC9C,EAAGhH,EAAY,iBAAiB,GAAG,CACzC,IAAM2F,EAAMsC,EAAgB,EAC5B1B,EAAOvG,EAAY,MAAO,wDAAwD,EAClF,IAAME,GAAQ+H,EAAgB,EAC9B6B,EAAO,IAAInE,EAAKzF,EAAK,EACjB8G,EAAGhH,EAAY,KAAK,GACtB,EAAEsG,CAEN,CACA,QAAEA,EACK,IAAI/B,GAAcuF,CAAM,CACjC,CACA,QACE,MAAM,IAAI,YAAY,qBAAqBD,EAAM,IAAI,EAAE,CAC3D,CACF,CACA,KAAOvD,EAAUvF,EAAO,QACtBsF,EAAQ,KAAK,KAAKO,EAAS,CAAC,EAE9B,OAAOP,CACT,CAGA,SAAS0D,GAAMxE,EAAOC,EAAMC,EAAO,EAAG,CAKpC,GAJID,IAAS,SACXA,EAAOD,EACPA,EAAQ,GAENE,IAAS,EACX,MAAM,IAAI,MAAM,+BAA+B,EAEjD,IAAM4B,EAAS,CAAC,EAChB,GAAI5B,EAAO,EACT,QAASyB,EAAI3B,EAAO2B,EAAI1B,EAAM0B,GAAKzB,EACjC4B,EAAO,KAAKH,CAAC,MAGf,SAASA,EAAI3B,EAAO2B,EAAI1B,EAAM0B,GAAKzB,EACjC4B,EAAO,KAAKH,CAAC,EAGjB,OAAOG,CACT,CACA,SAAS2C,GAAMC,EAAO1E,EAAOC,EAAMC,EAAO,EAAG,CAC3C,IAAMyE,EAAY,KAAK,KAAKzE,CAAI,EAC5ByE,GAAa,GACf3E,GAASA,IAAU,GAAK,EAAI,KAAK,IAAI0E,EAAM,OAAS1E,EAAO,CAAC,EAAI,KAAK,IAAIA,EAAO0E,EAAM,MAAM,EAC5FzE,GAAQA,IAASyE,EAAM,QAAU,EAAI,KAAK,IAAIA,EAAM,OAASzE,EAAM,CAAC,EAAI,KAAK,IAAIA,EAAMyE,EAAM,MAAM,IAEnG1E,GAASA,IAAU0E,EAAM,OAAS,GAAK,EAAI,KAAK,IAAIA,EAAM,OAAS1E,EAAO,EAAE,EAAI,KAAK,IAAIA,EAAO0E,EAAM,OAAS,CAAC,EAChHzE,GAAQA,IAAS,IAAM,GAAK,KAAK,IAAIyE,EAAM,OAASzE,EAAM,EAAE,EAAI,KAAK,IAAIA,EAAMyE,EAAM,OAAS,CAAC,GAEjG,IAAM5C,EAAS,CAAC,EAChB,QAASH,EAAI3B,EAAO2E,EAAYhD,EAAIgD,EAAY1E,EAAM0B,GAAKzB,EACzD4B,EAAO,KAAK4C,EAAM/C,CAAC,CAAC,EAEtB,OAAOG,CACT,CACA,SAAS8C,GAAUjK,EAAO,CACxB,OAAOA,EAAM,QAAQ,QAAUkC,GAAMA,EAAE,YAAY,CAAC,CACtD,CACA,SAASgI,GAAaC,EAAS,CAC7B,OAAOC,GAAyB,IAAI,KAAQD,CAAO,CACrD,CACA,SAASC,GAASC,EAAMF,EAAS,CAC/B,IAAMG,EAAqB,IAAI,KAAK,eAAe,OAAQ,CAAE,MAAO,MAAO,CAAC,EACtEC,EAAsB,IAAI,KAAK,eAAe,OAAQ,CAAE,MAAO,OAAQ,CAAC,EACxEC,EAAQC,GAAMA,EAAI,GAAK,IAAMA,EAAIA,EAAE,SAAS,EAClD,OAAON,EAAQ,QAAQ,eAAiBR,GAAU,CAChD,OAAQA,EAAO,CACb,IAAK,KACH,OAAOU,EAAK,YAAY,EAAE,SAAS,EACrC,IAAK,KACH,OAAOG,EAAKH,EAAK,SAAS,EAAI,CAAC,EACjC,IAAK,KACH,OAAOG,EAAKH,EAAK,QAAQ,CAAC,EAC5B,IAAK,KACH,OAAOE,EAAoB,OAAOF,CAAI,EACxC,IAAK,KACH,OAAOC,EAAmB,OAAOD,CAAI,EACvC,IAAK,KACH,OAAOG,EAAKH,EAAK,SAAS,CAAC,EAC7B,IAAK,KACH,OAAOG,EAAKH,EAAK,WAAW,CAAC,EAC/B,IAAK,KACH,MAAO,IACT,QACE,OAAOV,CACX,CACF,CAAC,CACH,CACA,SAASe,GAAaC,EAAG,CACvB,OAAOA,EAAE,QAAQ,sBAAuB,MAAM,CAChD,CACA,SAASC,GAAQzJ,EAAK0J,EAAUC,EAAUC,EAAO,CAC/C,GAAIA,IAAU,EACZ,OAAO5J,EACT,IAAI6J,EAAYD,GAAS,MAAQA,EAAQ,EAAI,IAAWA,EAClDE,EAAUJ,EAAS,SAAW,EAAI,IAAI,OAAO,OAAQ,IAAI,EAAI,IAAI,OAAOH,GAAaG,CAAQ,EAAG,IAAI,EAC1G,OAAO1J,EAAI,WAAW8J,EAAUC,GAC1BF,EAAY,GACd,EAAEA,EACKF,GAEFI,CACR,CACH,CAGA,IAAIC,GAAe,cAAc,KAAM,CACvC,EACIC,GAAkB,cAAc,KAAM,CAC1C,EACIC,GAAe,KAAM,CACvB,KAAO,eACP,MAIA,SAA2B,IAAI,IAI/B,YAAYrL,EAAQ,OAAQ,CAC1B,KAAK,MAAQA,CACf,CAMA,UAAW,CACT,OAAO,IAAIsL,GAAa,CAAC,CAAC,KAAK,KAAK,CACtC,CACA,UAAW,CACT,OAAO,OAAO,KAAK,KAAK,CAC1B,CACF,EACIC,GAAe,cAAcF,EAAa,CAC5C,KAAO,cACT,EACIG,GAAa,cAAcH,EAAa,CAC1C,KAAO,aACP,UAAW,CACT,OAAO,KAAK,MAAQ,IAAM,EAAI,KAAK,MAAM,QAAQ,CAAC,EAAI,KAAK,MAAM,SAAS,CAC5E,CACF,EACII,GAAc,cAAcJ,EAAa,CAC3C,KAAO,cACP,SAA2B,IAAI,IAAI,CACjC,CACE,QACA,IAAIK,GAAc,IACT,IAAID,GAAY,KAAK,MAAM,YAAY,CAAC,CAChD,CACH,EACA,CACE,QACA,IAAIC,GAAc,IACT,IAAID,GAAY,KAAK,MAAM,YAAY,CAAC,CAChD,CACH,EACA,CACE,QACA,IAAIC,GAAc,IACT,IAAID,GAAY,KAAK,MAAM,KAAK,CAAC,CACzC,CACH,EACA,CACE,QACA,IAAIC,GAAc,IACT,IAAID,GAAYxB,GAAU,KAAK,KAAK,CAAC,CAC7C,CACH,EACA,CACE,aACA,IAAIyB,GAAc,IACT,IAAID,GAAY,KAAK,MAAM,OAAO,CAAC,EAAE,YAAY,EAAI,KAAK,MAAM,MAAM,CAAC,CAAC,CAChF,CACH,EACA,CAAC,SAAU,IAAIF,GAAa,KAAK,MAAM,MAAM,CAAC,EAC9C,CACE,SACA,IAAIG,GAAc,IACT,IAAID,GAAY,KAAK,MAAM,QAAQ,CAAC,CAC5C,CACH,EACA,CACE,SACA,IAAIC,GAAc,IACT,IAAID,GAAY,KAAK,MAAM,UAAU,CAAC,CAC9C,CACH,EACA,CACE,aACA,IAAIC,GAAerI,GAAS,CAC1B,GAAIA,EAAK,SAAW,EAClB,MAAM,IAAI,MAAM,6CAA6C,EAE/D,IAAM4H,EAAU5H,EAAK,CAAC,EACtB,GAAI4H,aAAmBQ,GACrB,OAAO,IAAIH,GAAa,KAAK,MAAM,WAAWL,EAAQ,KAAK,CAAC,EACvD,GAAIA,aAAmBU,GAAY,CACxC,QAAWC,KAAQX,EAAQ,MAAO,CAChC,GAAI,EAAEW,aAAgBH,IACpB,MAAM,IAAI,MAAM,6CAA6C,EAE/D,GAAI,KAAK,MAAM,WAAWG,EAAK,KAAK,EAClC,OAAO,IAAIN,GAAa,EAAI,CAEhC,CACA,OAAO,IAAIA,GAAa,EAAK,CAC/B,CACA,MAAM,IAAI,MAAM,4DAA4D,CAC9E,CAAC,CACH,EACA,CACE,WACA,IAAII,GAAerI,GAAS,CAC1B,GAAIA,EAAK,SAAW,EAClB,MAAM,IAAI,MAAM,2CAA2C,EAE7D,IAAM4H,EAAU5H,EAAK,CAAC,EACtB,GAAI4H,aAAmBQ,GACrB,OAAO,IAAIH,GAAa,KAAK,MAAM,SAASL,EAAQ,KAAK,CAAC,EACrD,GAAIA,aAAmBU,GAAY,CACxC,QAAWC,KAAQX,EAAQ,MAAO,CAChC,GAAI,EAAEW,aAAgBH,IACpB,MAAM,IAAI,MAAM,2CAA2C,EAE7D,GAAI,KAAK,MAAM,SAASG,EAAK,KAAK,EAChC,OAAO,IAAIN,GAAa,EAAI,CAEhC,CACA,OAAO,IAAIA,GAAa,EAAK,CAC/B,CACA,MAAM,IAAI,MAAM,0DAA0D,CAC5E,CAAC,CACH,EACA,CACE,QAGA,IAAII,GAAerI,GAAS,CAC1B,IAAMwI,EAAMxI,EAAK,CAAC,GAAK,IAAIyI,GAC3B,GAAI,EAAED,aAAeJ,IAAeI,aAAeC,IACjD,MAAM,IAAI,MAAM,uCAAuC,EAEzD,IAAMC,EAAW1I,EAAK,CAAC,GAAK,IAAIkI,GAAa,EAAE,EAC/C,GAAI,EAAEQ,aAAoBR,IACxB,MAAM,IAAI,MAAM,oCAAoC,EAEtD,IAAIpE,EAAS,CAAC,EACd,GAAI0E,aAAeC,GAAW,CAC5B,IAAMnK,EAAO,KAAK,MAAM,UAAU,EAClC,OAAW,CAAE,EAAGuJ,EAAO,MAAAc,CAAM,IAAKrK,EAAK,SAAS,MAAM,EAAG,CACvD,GAAIoK,EAAS,QAAU,IAAM5E,EAAO,QAAU4E,EAAS,OAASC,IAAU,OAAQ,CAChF7E,EAAO,KAAK+D,EAAQvJ,EAAK,MAAMqK,EAAQd,EAAM,MAAM,CAAC,EACpD,KACF,CACA/D,EAAO,KAAK+D,CAAK,CACnB,CACF,KAAO,CACL,GAAIW,EAAI,QAAU,GAChB,MAAM,IAAI,MAAM,iBAAiB,EAEnC1E,EAAS,KAAK,MAAM,MAAM0E,EAAI,KAAK,EAC/BE,EAAS,QAAU,IAAM5E,EAAO,OAAS4E,EAAS,OACpD5E,EAAO,KAAKA,EAAO,OAAO4E,EAAS,KAAK,EAAE,KAAKF,EAAI,KAAK,CAAC,CAE7D,CACA,OAAO,IAAIF,GAAWxE,EAAO,IAAK8E,GAAS,IAAIR,GAAYQ,CAAI,CAAC,CAAC,CACnE,CAAC,CACH,EACA,CACE,UACA,IAAIP,GAAerI,GAAS,CAC1B,GAAIA,EAAK,OAAS,EAChB,MAAM,IAAI,MAAM,2CAA2C,EAE7D,IAAM6I,EAAW7I,EAAK,CAAC,EACjB8I,EAAW9I,EAAK,CAAC,EACvB,GAAI,EAAE6I,aAAoBT,IAAeU,aAAoBV,IAC3D,MAAM,IAAI,MAAM,qCAAqC,EAEvD,IAAIV,EAUJ,GATI1H,EAAK,OAAS,EACZA,EAAK,CAAC,EAAE,OAAS,wBACnB0H,EAAQ1H,EAAK,CAAC,EAAE,MAAM,IAAI,OAAO,GAAK,IAAIyI,GAE1Cf,EAAQ1H,EAAK,CAAC,EAGhB0H,EAAQ,IAAIe,GAEV,EAAEf,aAAiBQ,IAAgBR,aAAiBe,IACtD,MAAM,IAAI,MAAM,mDAAmD,EAErE,OAAO,IAAIL,GAAYb,GAAQ,KAAK,MAAOsB,EAAS,MAAOC,EAAS,MAAOpB,EAAM,KAAK,CAAC,CACzF,CAAC,CACH,CACF,CAAC,CACH,EACIO,GAAe,cAAcD,EAAa,CAC5C,KAAO,cACT,EACIe,GAAkB,iBACtB,SAASC,GAAclL,EAAK,CAC1B,OAAOA,EAAI,QAAQiL,GAAkBjM,GAAS,MAAQA,EAAK,WAAW,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAAC,CACxG,CACA,SAASmM,GAAOC,EAAO7L,EAAU,CAAC,EAAG8L,EAAQ,EAAGC,EAAyB,GAAM,CAC7E,GAAM,CAAE,OAAAC,EAAS,KAAM,YAAAC,EAAc,GAAO,WAAAC,EAAa,KAAM,SAAAC,EAAW,EAAM,EAAInM,EAChFoM,EACAC,EAUJ,OATIH,EACF,CAACE,EAAeC,CAAY,EAAIH,EACvBF,GACTI,EAAgB,IAChBC,EAAe,OAEfD,EAAgB,KAChBC,EAAe,MAETR,EAAM,KAAM,CAClB,IAAK,YACH,MAAO,OACT,IAAK,iBACH,OAAOE,EAAyB,OAAS,YAC3C,IAAK,eACL,IAAK,aACL,IAAK,eACH,OAAO,KAAK,UAAUF,EAAM,KAAK,EACnC,IAAK,cAAe,CAClB,IAAIpF,EAAS,KAAK,UAAUoF,EAAM,KAAK,EACvC,OAAII,IACFxF,EAASkF,GAAclF,CAAM,GAExBA,CACT,CACA,IAAK,aACL,IAAK,cAAe,CAClB,IAAM6F,EAAcN,EAAS,IAAI,OAAOA,CAAM,EAAI,GAC5CO,EAAc;AAAA,EAAOD,EAAY,OAAOR,CAAK,EAC7CU,EAAkBD,EAAcD,EACtC,GAAIT,EAAM,OAAS,aAAc,CAC/B,IAAMY,EAAOZ,EAAM,MAAM,IAAKa,GAAMd,GAAOc,EAAG1M,EAAS8L,EAAQ,EAAGC,CAAsB,CAAC,EACzF,OAAOC,EAAS,IAAIQ,CAAe,GAAGC,EAAK,KAAK,GAAGL,CAAa,GAAGI,CAAe,EAAE,CAAC,GAAGD,CAAW,IAAM,IAAIE,EAAK,KAAKL,CAAa,CAAC,GACvI,KAAO,CACL,IAAIO,EAAU,MAAM,KAAKd,EAAM,MAAM,QAAQ,CAAC,EAC1CM,IACFQ,EAAUA,EAAQ,KAAK,CAAC,CAAC7E,CAAC,EAAG,CAAC8E,CAAC,IAAM9E,EAAE,cAAc8E,CAAC,CAAC,GAEzD,IAAMH,EAAOE,EAAQ,IAAI,CAAC,CAAC5H,EAAKzF,CAAK,IAAM,CACzC,IAAIuN,EAAS,KAAK,UAAU9H,CAAG,EAC3BkH,IACFY,EAASlB,GAAckB,CAAM,GAE/B,IAAMC,EAAI,GAAGD,CAAM,GAAGR,CAAY,GAAGT,GAAOtM,EAAOU,EAAS8L,EAAQ,EAAGC,CAAsB,CAAC,GAC9F,OAAOC,EAAS,GAAGQ,CAAe,GAAGM,CAAC,GAAKA,CAC7C,CAAC,EACD,OAAOd,EAAS,IAAIS,EAAK,KAAKL,CAAa,CAAC,GAAGG,CAAW,IAAM,IAAIE,EAAK,KAAKL,CAAa,CAAC,GAC9F,CACF,CACA,QACE,MAAM,IAAI,MAAM,2BAA2BP,EAAM,IAAI,EAAE,CAC3D,CACF,CACA,IAAIkB,GAAc,cAAcpC,EAAa,CAC3C,KAAO,cASP,UAAW,CACT,OAAO,IAAIC,GAAa,KAAK,MAAM,KAAO,CAAC,CAC7C,CACA,SAA2B,IAAI,IAAI,CACjC,CACE,MACA,IAAII,GAAc,CAAC,CAACjG,EAAKiI,CAAY,IAAM,CACzC,GAAI,EAAEjI,aAAegG,IACnB,MAAM,IAAI,MAAM,oCAAoChG,EAAI,IAAI,EAAE,EAEhE,OAAO,KAAK,MAAM,IAAIA,EAAI,KAAK,GAAKiI,GAAgB,IAAI5B,EAC1D,CAAC,CACH,EACA,CAAC,QAAS,IAAIJ,GAAc,IAAM,KAAK,MAAM,CAAC,CAAC,EAC/C,CAAC,OAAQ,IAAIA,GAAc,IAAM,KAAK,KAAK,CAAC,CAAC,EAC7C,CAAC,SAAU,IAAIA,GAAc,IAAM,KAAK,OAAO,CAAC,CAAC,EACjD,CACE,WACA,IAAIA,GAAerI,GAAS,CAC1B,IAAIsK,EAAyB,IAAI,IAC3BC,EAAiBvK,EAAK,OAAQuF,GAC9BA,aAAeiF,IACjBF,EAAS/E,EAAI,MACN,IAEF,EACR,EACKkF,EAAgBF,EAAe,GAAG,CAAC,GAAKD,EAAO,IAAI,gBAAgB,GAAK,IAAIrC,GAAa,EAAK,EACpG,GAAI,EAAEwC,aAAyBxC,IAC7B,MAAM,IAAI,MAAM,kCAAkC,EAEpD,IAAMyC,EAAKH,EAAe,GAAG,CAAC,GAAKD,EAAO,IAAI,IAAI,GAAK,IAAIlC,GAAY,KAAK,EAC5E,GAAI,EAAEsC,aAActC,IAClB,MAAM,IAAI,MAAM,qBAAqB,EAEvC,GAAI,CAAC,CAAC,MAAO,OAAO,EAAE,SAASsC,EAAG,KAAK,EACrC,MAAM,IAAI,MAAM,oCAAoC,EAEtD,IAAMC,EAAUJ,EAAe,GAAG,CAAC,GAAKD,EAAO,IAAI,SAAS,GAAK,IAAIrC,GAAa,EAAK,EACvF,GAAI,EAAE0C,aAAmB1C,IACvB,MAAM,IAAI,MAAM,2BAA2B,EAE7C,IAAM2C,EAAQ,MAAM,KAAK,KAAK,MAAM,QAAQ,CAAC,EAAE,IAAI,CAAC,CAACxI,EAAKzF,CAAK,IAAM,IAAI2L,GAAW,CAAC,IAAIF,GAAYhG,CAAG,EAAGzF,CAAK,CAAC,CAAC,EAAE,KAAK,CAACwI,EAAG8E,IAAM,CACjI,IAAMtB,EAAQ+B,EAAG,QAAU,MAAQ,EAAI,EACjCG,EAAO1F,EAAE,MAAMwD,CAAK,EACpBmC,EAAOb,EAAE,MAAMtB,CAAK,EACpB7E,EAASiH,GAAqBF,EAAMC,EAAML,EAAc,KAAK,EACnE,OAAOE,EAAQ,MAAQ,CAAC7G,EAASA,CACnC,CAAC,EACD,OAAO,IAAIwE,GAAWsC,CAAK,CAC7B,CAAC,CACH,CACF,CAAC,EACD,OAAQ,CACN,OAAO,IAAItC,GACT,MAAM,KAAK,KAAK,MAAM,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAClG,EAAKzF,CAAK,IAAM,IAAI2L,GAAW,CAAC,IAAIF,GAAYhG,CAAG,EAAGzF,CAAK,CAAC,CAAC,CACtG,CACF,CACA,MAAO,CACL,OAAO,IAAI2L,GAAW,MAAM,KAAK,KAAK,MAAM,KAAK,CAAC,EAAE,IAAKlG,GAAQ,IAAIgG,GAAYhG,CAAG,CAAC,CAAC,CACxF,CACA,QAAS,CACP,OAAO,IAAIkG,GAAW,MAAM,KAAK,KAAK,MAAM,OAAO,CAAC,CAAC,CACvD,CACA,UAAW,CACT,OAAOW,GAAO,KAAM,CAAC,EAAG,EAAG,EAAK,CAClC,CACF,EACIuB,GAAwB,cAAcJ,EAAY,CACpD,KAAO,uBACT,EACI9B,GAAa,cAAcN,EAAa,CAC1C,KAAO,aACP,SAA2B,IAAI,IAAI,CAAC,CAAC,SAAU,IAAIE,GAAa,KAAK,MAAM,MAAM,CAAC,CAAC,CAAC,EASpF,UAAW,CACT,OAAO,IAAID,GAAa,KAAK,MAAM,OAAS,CAAC,CAC/C,CACA,UAAW,CACT,OAAOgB,GAAO,KAAM,CAAC,EAAG,EAAG,EAAK,CAClC,CACF,EACI+B,GAAa,cAAc1C,EAAW,CACxC,KAAO,YACT,EACID,GAAgB,cAAcL,EAAa,CAC7C,KAAO,eACT,EACIS,GAAY,cAAcT,EAAa,CACzC,KAAO,WACT,EACIiD,GAAiB,cAAcjD,EAAa,CAC9C,KAAO,gBACT,EACIkD,GAAc,KAAM,CACtB,YAAYC,EAAQ,CAClB,KAAK,OAASA,CAChB,CAIA,UAA4B,IAAI,IAAI,CAClC,CACE,YACA,IAAI9C,GAAerI,GAAS,CAC1B,GAAIA,EAAK,SAAW,EAClB,OAAO,IAAIoK,GAA4B,IAAI,GAAK,EAElD,GAAIpK,EAAK,SAAW,GAAK,EAAEA,EAAK,CAAC,YAAaoK,IAC5C,MAAM,IAAI,MAAM,uEAAuE,EAEzF,OAAOpK,EAAK,CAAC,CACf,CAAC,CACH,CACF,CAAC,EAID,MAAwB,IAAI,IAAI,CAC9B,CAAC,UAAYsB,GAAYA,EAAQ,OAAS,cAAc,EACxD,CAAC,WAAaA,GAAYA,aAAmB+G,EAAa,EAC1D,CACE,MACC/G,GAAY,CACX,GAAI,EAAEA,aAAmB4G,IACvB,MAAM,IAAI,MAAM,iBAAiB5G,EAAQ,IAAI,EAAE,EAEjD,OAAOA,EAAQ,MAAQ,IAAM,CAC/B,CACF,EACA,CACE,OACCA,GAAY,CACX,GAAI,EAAEA,aAAmB4G,IACvB,MAAM,IAAI,MAAM,kBAAkB5G,EAAQ,IAAI,EAAE,EAElD,OAAOA,EAAQ,MAAQ,IAAM,CAC/B,CACF,EACA,CAAC,QAAUA,GAAYA,EAAQ,OAAS,gBAAkB,CAACA,EAAQ,KAAK,EACxE,CAAC,OAASA,GAAYA,EAAQ,OAAS,gBAAkBA,EAAQ,KAAK,EACtE,CAAC,OAASA,GAAYA,EAAQ,OAAS,WAAW,EAClD,CAAC,SAAWA,GAAYA,EAAQ,OAAS,aAAa,EACtD,CAAC,SAAWA,GAAYA,aAAmB4G,IAAgB5G,aAAmB6G,EAAU,EACxF,CAAC,UAAY7G,GAAYA,aAAmB4G,EAAY,EACxD,CAAC,WAAa5G,GAAYA,EAAQ,OAAS,cAAgBA,EAAQ,OAAS,aAAa,EACzF,CAAC,UAAYA,GAAYA,EAAQ,OAAS,aAAa,EACvD,CACE,QACCA,GAAY,CACX,IAAMxD,EAAMwD,EAAQ,MACpB,OAAOA,EAAQ,OAAS,eAAiBxD,IAAQA,EAAI,YAAY,CACnE,CACF,EACA,CACE,QACCwD,GAAY,CACX,IAAMxD,EAAMwD,EAAQ,MACpB,OAAOA,EAAQ,OAAS,eAAiBxD,IAAQA,EAAI,YAAY,CACnE,CACF,EACA,CAAC,OAASwD,GAAYA,EAAQ,OAAS,WAAW,EAClD,CAAC,UAAYA,GAAYA,EAAQ,OAAS,gBAAgB,EAC1D,CAAC,YAAcA,GAAYA,EAAQ,OAAS,gBAAgB,EAC5D,CAAC,UAAW,CAAC6D,EAAG8E,IAAM9E,EAAE,QAAU8E,EAAE,KAAK,EACzC,CAAC,KAAM,CAAC9E,EAAG8E,IAAM9E,EAAE,QAAU8E,EAAE,KAAK,CACtC,CAAC,EAID,IAAIlK,EAAMpD,EAAO,CACf,OAAO,KAAK,gBAAgBoD,EAAMqL,GAAuBzO,CAAK,CAAC,CACjE,CACA,gBAAgBoD,EAAMpD,EAAO,CAC3B,GAAI,KAAK,UAAU,IAAIoD,CAAI,EACzB,MAAM,IAAI,YAAY,8BAA8BA,CAAI,EAAE,EAE5D,YAAK,UAAU,IAAIA,EAAMpD,CAAK,EACvBA,CACT,CAUA,YAAYoD,EAAMpD,EAAO,CACvB,YAAK,UAAU,IAAIoD,EAAMpD,CAAK,EACvBA,CACT,CAMA,QAAQoD,EAAM,CACZ,GAAI,KAAK,UAAU,IAAIA,CAAI,EACzB,OAAO,KAET,GAAI,KAAK,OACP,OAAO,KAAK,OAAO,QAAQA,CAAI,EAEjC,MAAM,IAAI,MAAM,qBAAqBA,CAAI,EAAE,CAC7C,CACA,eAAeA,EAAM,CACnB,GAAI,CACF,OAAO,KAAK,QAAQA,CAAI,EAAE,UAAU,IAAIA,CAAI,GAAK,IAAIkL,EACvD,MAAQ,CACN,OAAO,IAAIA,EACb,CACF,CACF,EACA,SAASI,GAAaC,EAAK,CACzBA,EAAI,IAAI,QAAS,EAAK,EACtBA,EAAI,IAAI,OAAQ,EAAI,EACpBA,EAAI,IAAI,OAAQ,IAAI,EACpBA,EAAI,IAAI,kBAAoBtL,GAAS,CACnC,MAAM,IAAI,MAAMA,CAAI,CACtB,CAAC,EACDsL,EAAI,IAAI,QAAS9E,EAAK,EACtB8E,EAAI,IAAI,eAAgBzE,EAAY,EACpCyE,EAAI,IAAI,OAAQ,EAAI,EACpBA,EAAI,IAAI,QAAS,EAAK,EACtBA,EAAI,IAAI,OAAQ,IAAI,CACtB,CACA,SAASC,GAAkBhD,EAAMiD,EAAe,CAC9C,IAAMC,EAAQD,EAAc,MAAM,GAAG,EACjC7O,EAAQ4L,EACZ,QAAWK,KAAQ6C,EACjB,GAAI9O,aAAiByN,GACnBzN,EAAQA,EAAM,MAAM,IAAIiM,CAAI,GAAK,IAAIqC,WAC5BtO,aAAiB2L,GAAY,CACtC,IAAMK,EAAQ,SAASC,EAAM,EAAE,EAC/B,GAAI,CAAC,MAAMD,CAAK,GAAKA,GAAS,GAAKA,EAAQhM,EAAM,MAAM,OACrDA,EAAQA,EAAM,MAAMgM,CAAK,MAEzB,QAAO,IAAIsC,EAEf,KACE,QAAO,IAAIA,GAGf,OAAOtO,CACT,CACA,SAASoO,GAAqB5F,EAAG8E,EAAGQ,EAAgB,GAAO,CACzD,GAAItF,aAAasD,IAAawB,aAAaxB,GACzC,MAAO,GAET,GAAItD,aAAasD,IAAawB,aAAaxB,GACzC,MAAM,IAAI,MAAM,kBAAkBtD,EAAE,IAAI,SAAS8E,EAAE,IAAI,EAAE,EAE3D,GAAI9E,aAAa8F,IAAkBhB,aAAagB,GAC9C,MAAO,GAET,GAAI9F,aAAa8F,IAAkBhB,aAAagB,GAC9C,MAAM,IAAI,MAAM,kBAAkB9F,EAAE,IAAI,SAAS8E,EAAE,IAAI,EAAE,EAE3D,IAAMyB,EAAiBvB,GAAMA,aAAajC,IAAgBiC,aAAahC,IAAcgC,aAAalC,GAC5F0D,EAAmBxB,GACnBA,aAAalC,GACRkC,EAAE,MAAQ,EAAI,EAEhBA,EAAE,MAEX,GAAIuB,EAAcvG,CAAC,GAAKuG,EAAczB,CAAC,EAAG,CACxC,IAAM2B,EAAOD,EAAgBxG,CAAC,EACxB0G,EAAOF,EAAgB1B,CAAC,EAC9B,OAAO2B,EAAOC,EAAO,GAAKD,EAAOC,EAAO,EAAI,CAC9C,CACA,GAAI1G,EAAE,OAAS8E,EAAE,KACf,MAAM,IAAI,MAAM,mCAAmC9E,EAAE,IAAI,QAAQ8E,EAAE,IAAI,EAAE,EAE3E,GAAQ9E,EAAE,OACH,cAAe,CAClB,IAAI2G,EAAO3G,EAAE,MACT4G,EAAO9B,EAAE,MACb,OAAKQ,IACHqB,EAAOA,EAAK,YAAY,EACxBC,EAAOA,EAAK,YAAY,GAEnBD,EAAOC,EAAO,GAAKD,EAAOC,EAAO,EAAI,CAC9C,KAEE,OAAM,IAAI,MAAM,wBAAwB5G,EAAE,IAAI,EAAE,CAEtD,CACA,IAAI6G,GAAc,KAAM,CACtB,OACA,YAAYV,EAAK,CACf,KAAK,OAASA,GAAO,IAAIJ,EAC3B,CAIA,IAAIpI,EAAS,CACX,OAAO,KAAK,SAASA,EAAS,KAAK,MAAM,CAC3C,CAIA,yBAAyBmJ,EAAMC,EAAa,CAC1C,IAAM/K,EAAO,KAAK,SAAS8K,EAAK,KAAMC,CAAW,EACjD,OAAQD,EAAK,SAAS,MAAO,CAC3B,IAAK,MACH,OAAO9K,EAAK,SAAS,EAAE,MAAQ,KAAK,SAAS8K,EAAK,MAAOC,CAAW,EAAI/K,EAC1E,IAAK,KACH,OAAOA,EAAK,SAAS,EAAE,MAAQA,EAAO,KAAK,SAAS8K,EAAK,MAAOC,CAAW,CAC/E,CACA,IAAM9K,EAAQ,KAAK,SAAS6K,EAAK,MAAOC,CAAW,EACnD,OAAQD,EAAK,SAAS,MAAO,CAC3B,IAAK,KACH,OAAO,IAAIhE,GAAa9G,EAAK,OAASC,EAAM,KAAK,EACnD,IAAK,KACH,OAAO,IAAI6G,GAAa9G,EAAK,OAASC,EAAM,KAAK,CACrD,CACA,GAAID,aAAgB8J,IAAkB7J,aAAiB6J,GAAgB,CACrE,GAAI7J,aAAiB6J,IAAkB,CAAC,KAAM,QAAQ,EAAE,SAASgB,EAAK,SAAS,KAAK,EAClF,OAAO,IAAIhE,GAAagE,EAAK,SAAS,QAAU,QAAQ,EAE1D,MAAM,IAAI,MAAM,4BAA4BA,EAAK,SAAS,KAAK,sBAAsB,CACvF,KAAO,IAAI9K,aAAgBsH,IAAarH,aAAiBqH,GACvD,MAAM,IAAI,MAAM,yCAAyC,EACpD,GAAIwD,EAAK,SAAS,QAAU,IACjC,OAAO,IAAI7D,GAAYjH,EAAK,MAAM,SAAS,EAAIC,EAAM,MAAM,SAAS,CAAC,EAChE,IAAKD,aAAgB+G,IAAgB/G,aAAgBgH,MAAgB/G,aAAiB8G,IAAgB9G,aAAiB+G,IAAa,CACzI,IAAM,EAAIhH,EAAK,MAAO8I,EAAI7I,EAAM,MAChC,OAAQ6K,EAAK,SAAS,MAAO,CAC3B,IAAK,IACL,IAAK,IACL,IAAK,IAAK,CACR,IAAME,EAAMF,EAAK,SAAS,QAAU,IAAM,EAAIhC,EAAIgC,EAAK,SAAS,QAAU,IAAM,EAAIhC,EAAI,EAAIA,EAE5F,OADgB9I,aAAgBgH,IAAc/G,aAAiB+G,GAC9C,IAAIA,GAAWgE,CAAG,EAAI,IAAIjE,GAAaiE,CAAG,CAC7D,CACA,IAAK,IACH,OAAO,IAAIhE,GAAW,EAAI8B,CAAC,EAC7B,IAAK,IAAK,CACR,IAAMmC,EAAM,EAAInC,EAEhB,OADgB9I,aAAgBgH,IAAc/G,aAAiB+G,GAC9C,IAAIA,GAAWiE,CAAG,EAAI,IAAIlE,GAAakE,CAAG,CAC7D,CACA,IAAK,IACH,OAAO,IAAInE,GAAa,EAAIgC,CAAC,EAC/B,IAAK,IACH,OAAO,IAAIhC,GAAa,EAAIgC,CAAC,EAC/B,IAAK,KACH,OAAO,IAAIhC,GAAa,GAAKgC,CAAC,EAChC,IAAK,KACH,OAAO,IAAIhC,GAAa,GAAKgC,CAAC,CAClC,CACF,SAAW9I,aAAgBmH,IAAclH,aAAiBkH,IACxD,GAAQ2D,EAAK,SAAS,QACf,IACH,OAAO,IAAI3D,GAAWnH,EAAK,MAAM,OAAOC,EAAM,KAAK,CAAC,UAE/CA,aAAiBkH,GAAY,CACtC,IAAM1C,EAASxE,EAAM,MAAM,KAAM2I,GAAMA,EAAE,QAAU5I,EAAK,KAAK,IAAM,OACnE,OAAQ8K,EAAK,SAAS,MAAO,CAC3B,IAAK,KACH,OAAO,IAAIhE,GAAarC,CAAM,EAChC,IAAK,SACH,OAAO,IAAIqC,GAAa,CAACrC,CAAM,CACnC,CACF,EACA,IAAIzE,aAAgBiH,IAAehH,aAAiBgH,KAC1C6D,EAAK,SAAS,QACf,IACH,OAAO,IAAI7D,GAAYjH,EAAK,MAAM,SAAS,EAAIC,EAAM,MAAM,SAAS,CAAC,EAG3E,GAAID,aAAgBiH,IAAehH,aAAiBgH,GAClD,OAAQ6D,EAAK,SAAS,MAAO,CAC3B,IAAK,KACH,OAAO,IAAIhE,GAAa7G,EAAM,MAAM,SAASD,EAAK,KAAK,CAAC,EAC1D,IAAK,SACH,OAAO,IAAI8G,GAAa,CAAC7G,EAAM,MAAM,SAASD,EAAK,KAAK,CAAC,CAC7D,CAEF,GAAIA,aAAgBiH,IAAehH,aAAiBgJ,GAClD,OAAQ6B,EAAK,SAAS,MAAO,CAC3B,IAAK,KACH,OAAO,IAAIhE,GAAa7G,EAAM,MAAM,IAAID,EAAK,KAAK,CAAC,EACrD,IAAK,SACH,OAAO,IAAI8G,GAAa,CAAC7G,EAAM,MAAM,IAAID,EAAK,KAAK,CAAC,CACxD,CAEF,MAAM,IAAI,YAAY,qBAAqB8K,EAAK,SAAS,KAAK,aAAa9K,EAAK,IAAI,QAAQC,EAAM,IAAI,EAAE,CAC1G,CACA,kBAAkBpB,EAAMkM,EAAa,CACnC,IAAMG,EAAsB,CAAC,EACvBC,EAAmC,IAAI,IAC7C,QAAWxK,KAAY9B,EACrB,GAAI8B,EAAS,OAAS,mBAAoB,CACxC,IAAMyK,EAAazK,EACb0K,EAAM,KAAK,SAASD,EAAW,SAAUL,CAAW,EAC1D,GAAI,EAAEM,aAAelE,IACnB,MAAM,IAAI,MAAM,oCAAoCkE,EAAI,IAAI,EAAE,EAEhE,QAAWjE,KAAQiE,EAAI,MACrBH,EAAoB,KAAK9D,CAAI,CAEjC,SAAWzG,EAAS,OAAS,4BAA6B,CACxD,IAAM2K,EAAQ3K,EACdwK,EAAiB,IAAIG,EAAM,IAAI,MAAO,KAAK,SAASA,EAAM,MAAOP,CAAW,CAAC,CAC/E,KAAO,CACL,GAAII,EAAiB,KAAO,EAC1B,MAAM,IAAI,MAAM,yDAAyD,EAE3ED,EAAoB,KAAK,KAAK,SAASvK,EAAUoK,CAAW,CAAC,CAC/D,CAEF,MAAO,CAACG,EAAqBC,CAAgB,CAC/C,CACA,YAAYhL,EAASiD,EAAY2H,EAAa,CAC5C,GAAI3H,EAAW,OAAS,aAAc,CACpC,IAAMhD,EAASgD,EACf,GAAIhD,EAAO,QAAU,SACnB,OAAO,IAAI6G,GAAYa,GAAO3H,EAAS,CAAC,CAAC,CAAC,EAE5C,GAAIA,aAAmBgH,GACrB,OAAQ/G,EAAO,MAAO,CACpB,IAAK,OACH,OAAOD,EACT,IAAK,QACH,OAAOA,EAAQ,MAAM,CAAC,EACxB,IAAK,OACH,OAAOA,EAAQ,MAAMA,EAAQ,MAAM,OAAS,CAAC,EAC/C,IAAK,SACH,OAAO,IAAI4G,GAAa5G,EAAQ,MAAM,MAAM,EAC9C,IAAK,UACH,OAAO,IAAIgH,GAAWhH,EAAQ,MAAM,MAAM,EAAE,QAAQ,CAAC,EACvD,IAAK,OACH,OAAO,IAAIgH,GAAWhH,EAAQ,MAAM,MAAM,EAAE,KAAK,CAAC,EAAG2I,IAAMc,GAAqB,EAAGd,EAAG,EAAK,CAAC,CAAC,EAE/F,IAAK,OACH,OAAO,IAAI7B,GAAY9G,EAAQ,MAAM,IAAKyI,GAAMA,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EACnE,IAAK,SACH,OAAO,IAAI3B,GAAYa,GAAO3H,EAAS,CAAC,EAAG,EAAG,EAAK,CAAC,EACtD,IAAK,SAAU,CACb,IAAMoL,EAAuB,IAAI,IAC3BC,EAAS,CAAC,EAChB,QAAWpE,KAAQjH,EAAQ,MACpBoL,EAAK,IAAInE,EAAK,KAAK,IACtBmE,EAAK,IAAInE,EAAK,KAAK,EACnBoE,EAAO,KAAKpE,CAAI,GAGpB,OAAO,IAAID,GAAWqE,CAAM,CAC9B,CACA,QACE,MAAM,IAAI,MAAM,8BAA8BpL,EAAO,KAAK,EAAE,CAChE,SACSD,aAAmB8G,GAC5B,OAAQ7G,EAAO,MAAO,CACpB,IAAK,SACL,IAAK,QACL,IAAK,QACL,IAAK,QACL,IAAK,aAAc,CACjB,IAAMqL,EAAUtL,EAAQ,SAAS,IAAIC,EAAO,KAAK,EACjD,GAAIqL,aAAmBvE,GACrB,OAAOuE,EAAQ,MAEb,CAAC,EACDV,CACF,EACK,GAAIU,aAAmB1E,GAC5B,OAAO0E,EAEP,MAAM,IAAI,MAAM,+BAA+BrL,EAAO,KAAK,EAAE,CAEjE,CACA,IAAK,OACH,OAAO,IAAI6G,GAAY9G,EAAQ,MAAM,KAAK,CAAC,EAC7C,IAAK,SACH,OAAO,IAAI8G,GACT9G,EAAQ,MAAM,MAAM;AAAA,CAAI,EAAE,IACxB,CAACyI,EAAGpG,IAEFA,IAAM,GAAKoG,EAAE,SAAW,EAAIA,EAAI,OAASA,CAE7C,EAAE,KAAK;AAAA,CAAI,CACb,EACF,IAAK,OACL,IAAK,SACH,OAAOzI,EACT,IAAK,MAAO,CACV,IAAMkL,EAAM,SAASlL,EAAQ,MAAO,EAAE,EACtC,OAAO,IAAI4G,GAAa,MAAMsE,CAAG,EAAI,EAAIA,CAAG,CAC9C,CACA,IAAK,QAAS,CACZ,IAAMA,EAAM,WAAWlL,EAAQ,KAAK,EACpC,OAAO,IAAI6G,GAAW,MAAMqE,CAAG,EAAI,EAAIA,CAAG,CAC5C,CACA,QACE,MAAM,IAAI,MAAM,+BAA+BjL,EAAO,KAAK,EAAE,CACjE,SACSD,aAAmB4G,IAAgB5G,aAAmB6G,GAC/D,OAAQ5G,EAAO,MAAO,CACpB,IAAK,MACH,OAAOD,aAAmB4G,GAAe,IAAIA,GAAa,KAAK,IAAI5G,EAAQ,KAAK,CAAC,EAAI,IAAI6G,GAAW,KAAK,IAAI7G,EAAQ,KAAK,CAAC,EAC7H,IAAK,MACH,OAAO,IAAI4G,GAAa,KAAK,MAAM5G,EAAQ,KAAK,CAAC,EACnD,IAAK,QACH,OAAO,IAAI6G,GAAW7G,EAAQ,KAAK,EACrC,QACE,MAAM,IAAI,MAAM,gCAAgCC,EAAO,KAAK,EAAE,CAClE,SACSD,aAAmB8I,GAC5B,OAAQ7I,EAAO,MAAO,CACpB,IAAK,QACH,OAAO,IAAI+G,GACT,MAAM,KAAKhH,EAAQ,MAAM,QAAQ,CAAC,EAAE,IAAI,CAAC,CAACc,EAAKzF,CAAK,IAAM,IAAI2L,GAAW,CAAC,IAAIF,GAAYhG,CAAG,EAAGzF,CAAK,CAAC,CAAC,CACzG,EACF,IAAK,SACH,OAAO,IAAIuL,GAAa5G,EAAQ,MAAM,IAAI,EAC5C,QAAS,CACP,IAAMsL,EAAUtL,EAAQ,SAAS,IAAIC,EAAO,KAAK,EACjD,GAAIqL,EACF,OAAIA,aAAmBvE,GACduE,EAAQ,MAAM,CAAC,EAAGV,CAAW,EAE/BU,EAET,MAAM,IAAI,MAAM,+BAA+BrL,EAAO,KAAK,EAAE,CAC/D,CACF,SACSD,aAAmB2G,GAC5B,OAAQ1G,EAAO,MAAO,CACpB,IAAK,OACH,OAAO,IAAI0G,GAAa3G,EAAQ,KAAK,EACvC,IAAK,MACH,OAAO,IAAI4G,GAAa5G,EAAQ,MAAQ,EAAI,CAAC,EAC/C,IAAK,QACH,OAAO,IAAI6G,GAAW7G,EAAQ,MAAQ,EAAI,CAAC,EAC7C,IAAK,SACH,OAAO,IAAI8G,GAAY9G,EAAQ,MAAQ,OAAS,OAAO,EACzD,QACE,MAAM,IAAI,MAAM,gCAAgCC,EAAO,KAAK,EAAE,CAClE,CAEF,MAAM,IAAI,MAAM,wBAAwBA,EAAO,KAAK,cAAcD,EAAQ,IAAI,EAAE,CAClF,SAAWiD,EAAW,OAAS,iBAAkB,CAC/C,IAAMhD,EAASgD,EACf,GAAIhD,EAAO,OAAO,OAAS,aACzB,MAAM,IAAI,MAAM,mBAAmBA,EAAO,OAAO,IAAI,EAAE,EAEzD,IAAMsL,EAAatL,EAAO,OAAO,MACjC,GAAIsL,IAAe,SAAU,CAC3B,GAAM,CAAC,CAAEvC,CAAM,EAAI,KAAK,kBAAkB/I,EAAO,KAAM2K,CAAW,EAC5D7C,EAASiB,EAAO,IAAI,QAAQ,GAAK,IAAI7B,GAC3C,GAAI,EAAEY,aAAkBnB,IAAgBmB,aAAkBZ,IACxD,MAAM,IAAI,MAAM,iCAAiC,EAEnD,IAAMa,EAAcgB,EAAO,IAAI,cAAc,GAAK,IAAIrC,GAAa,EAAK,EACxE,GAAI,EAAEqB,aAAuBrB,IAC3B,MAAM,IAAI,MAAM,wCAAwC,EAE1D,IAAMuB,EAAWc,EAAO,IAAI,WAAW,GAAK,IAAIrC,GAAa,EAAK,EAClE,GAAI,EAAEuB,aAAoBvB,IACxB,MAAM,IAAI,MAAM,qCAAqC,EAEvD,IAAM6E,EAAgBxC,EAAO,IAAI,YAAY,GAAK,IAAI7B,GAClDc,EAAa,KACjB,GAAIuD,aAAyBxE,IAAcwE,aAAyB9B,GAAY,CAC9E,GAAI8B,EAAc,MAAM,SAAW,EACjC,MAAM,IAAI,MAAM,2CAA2C,EAE7D,GAAM,CAACC,EAASC,CAAM,EAAIF,EAAc,MACxC,GAAI,EAAEC,aAAmB3E,KAAgB,EAAE4E,aAAkB5E,IAC3D,MAAM,IAAI,MAAM,2CAA2C,EAE7DmB,EAAa,CAACwD,EAAQ,MAAOC,EAAO,KAAK,CAC3C,SAAW,EAAEF,aAAyBrE,IACpC,MAAM,IAAI,MAAM,mDAAmD,EAErE,OAAO,IAAIL,GACTa,GAAO3H,EAAS,CACd,OAAQ+H,EAAO,MACf,YAAaC,EAAY,MACzB,SAAUE,EAAS,MACnB,WAAAD,CACF,CAAC,CACH,CACF,SAAWsD,IAAe,OAAQ,CAChC,IAAIlQ,EACJ,GAAI2E,aAAmB8G,GACrBzL,EAAQ,MAAM,KAAK2E,EAAQ,KAAK,UACvBA,aAAmBgH,GAC5B3L,EAAQ2E,EAAQ,MAAM,IAAKyI,GAAMA,EAAE,KAAK,MAExC,OAAM,IAAI,MAAM,wBAAwB8C,CAAU,cAAcvL,EAAQ,IAAI,EAAE,EAEhF,GAAM,CAACtB,EAAMsK,CAAM,EAAI,KAAK,kBAAkB/I,EAAO,KAAM2K,CAAW,EAChEe,EAAYjN,EAAK,GAAG,CAAC,GAAKsK,EAAO,IAAI,WAAW,GAAK,IAAIlC,GAAY,EAAE,EAC7E,GAAI,EAAE6E,aAAqB7E,IACzB,MAAM,IAAI,MAAM,4BAA4B,EAE9C,OAAO,IAAIA,GAAYzL,EAAM,KAAKsQ,EAAU,KAAK,CAAC,CACpD,SAAWJ,IAAe,OAASA,IAAe,QAAS,CACzD,GAAM,CAAC7M,EAAMsK,CAAM,EAAI,KAAK,kBAAkB/I,EAAO,KAAM2K,CAAW,EAChE7B,EAAerK,EAAK,GAAG,CAAC,GAAKsK,EAAO,IAAI,SAAS,IAAMuC,IAAe,MAAQ,IAAI3E,GAAa,CAAC,EAAI,IAAIC,GAAW,CAAC,GAC1H,GAAI7G,aAAmB8G,GAAa,CAClC,IAAMoE,EAAMK,IAAe,MAAQ,SAASvL,EAAQ,MAAO,EAAE,EAAI,WAAWA,EAAQ,KAAK,EACzF,OAAO,MAAMkL,CAAG,EAAInC,EAAewC,IAAe,MAAQ,IAAI3E,GAAasE,CAAG,EAAI,IAAIrE,GAAWqE,CAAG,CACtG,KAAO,IAAIlL,aAAmB4G,IAAgB5G,aAAmB6G,GAC/D,OAAO7G,EACF,GAAIA,aAAmB2G,GAC5B,OAAO4E,IAAe,MAAQ,IAAI3E,GAAa5G,EAAQ,MAAQ,EAAI,CAAC,EAAI,IAAI6G,GAAW7G,EAAQ,MAAQ,EAAI,CAAC,EAE5G,MAAM,IAAI,MAAM,wBAAwBuL,CAAU,cAAcvL,EAAQ,IAAI,EAAE,EAElF,SAAWuL,IAAe,UAAW,CACnC,GAAM,CAAC7M,EAAMsK,CAAM,EAAI,KAAK,kBAAkB/I,EAAO,KAAM2K,CAAW,EAChE7B,EAAerK,EAAK,CAAC,GAAK,IAAIoI,GAAY,EAAE,EAC5C8E,EAAelN,EAAK,CAAC,GAAKsK,EAAO,IAAI,SAAS,GAAK,IAAIrC,GAAa,EAAK,EAC/E,GAAI,EAAEiF,aAAwBjF,IAC5B,MAAM,IAAI,MAAM,yCAAyC,EAE3D,OAAI3G,aAAmB2J,IAAkBiC,EAAa,OAAS,CAAC5L,EAAQ,SAAS,EAAE,MAC1E+I,EAEF/I,CACT,CACA,GAAIA,aAAmBgH,GAAY,CACjC,OAAQuE,EAAY,CAClB,IAAK,OAAQ,CACX,GAAM,CAAC7M,EAAMsK,CAAM,EAAI,KAAK,kBAAkB/I,EAAO,KAAM2K,CAAW,EAChEvB,EAAU3K,EAAK,GAAG,CAAC,GAAKsK,EAAO,IAAI,SAAS,GAAK,IAAIrC,GAAa,EAAK,EAC7E,GAAI,EAAE0C,aAAmB1C,IACvB,MAAM,IAAI,MAAM,2BAA2B,EAE7C,IAAMwC,EAAgBzK,EAAK,GAAG,CAAC,GAAKsK,EAAO,IAAI,gBAAgB,GAAK,IAAIrC,GAAa,EAAK,EAC1F,GAAI,EAAEwC,aAAyBxC,IAC7B,MAAM,IAAI,MAAM,kCAAkC,EAEpD,IAAMkF,EAAYnN,EAAK,GAAG,CAAC,GAAKsK,EAAO,IAAI,WAAW,GAAK,IAAI7B,GAC/D,GAAI,EAAE0E,aAAqB/E,IAAe+E,aAAqBjF,IAAgBiF,aAAqB1E,IAClG,MAAM,IAAI,MAAM,8CAA8C,EAEhE,IAAM2E,EAAgB7E,GAAS,CAC7B,GAAI4E,aAAqB1E,GACvB,OAAOF,EAET,IAAM8E,EAAWF,aAAqBjF,GAAe,OAAOiF,EAAU,KAAK,EAAIA,EAAU,MACzF,OAAO5B,GAAkBhD,EAAM8E,CAAQ,CACzC,EACA,OAAO,IAAI/E,GACThH,EAAQ,MAAM,MAAM,EAAE,KAAK,CAAC6D,EAAG8E,IAAM,CACnC,IAAMY,EAAOuC,EAAajI,CAAC,EACrB2F,EAAOsC,EAAanD,CAAC,EACrBnG,EAASiH,GAAqBF,EAAMC,EAAML,EAAc,KAAK,EACnE,OAAOE,EAAQ,MAAQ,CAAC7G,EAASA,CACnC,CAAC,CACH,CACF,CACA,IAAK,aACL,IAAK,aAAc,CACjB,IAAMwJ,EAAST,IAAe,aAC9B,GAAIvL,EAAQ,MAAM,KAAMyI,GAAM,EAAEA,aAAaK,GAAY,EACvD,MAAM,IAAI,MAAM,KAAKyC,CAAU,4CAA4C,EAE7E,GAAItL,EAAO,KAAK,KAAMwI,GAAMA,EAAE,OAAS,eAAe,EACpD,MAAM,IAAI,MAAM,kBAAkB8C,CAAU,oBAAoB,EAElE,GAAM,CAACU,EAAMC,EAAU7Q,CAAK,EAAI4E,EAAO,KAAK,IAAKwI,GAAM,KAAK,SAASA,EAAGmC,CAAW,CAAC,EAChFuB,EACJ,GAAID,EAAU,CACZ,IAAMpO,EAAO8M,EAAY,MAAM,IAAIsB,EAAS,KAAK,EACjD,GAAI,CAACpO,EACH,MAAM,IAAI,MAAM,iBAAiBoO,EAAS,KAAK,EAAE,EAEnDC,EAAerO,CACjB,MACEqO,EAAe,IAAI1D,IAAMA,EAAE,CAAC,EAAE,SAAS,EAAE,MAE3C,IAAM2D,EAAWpM,EAAQ,MAAM,OAAQiH,GAAS,CAC9C,IAAMpD,EAAIoD,EAAK,MAAM,IAAIgF,EAAK,KAAK,EAC7BzJ,EAASqB,EAAIsI,EAAatI,EAAGxI,CAAK,EAAI,GAC5C,OAAO2Q,EAASxJ,EAAS,CAACA,CAC5B,CAAC,EACD,OAAO,IAAIwE,GAAWoF,CAAQ,CAChC,CACA,IAAK,MAAO,CACV,GAAM,CAAC,CAAEpD,CAAM,EAAI,KAAK,kBAAkB/I,EAAO,KAAM2K,CAAW,EAClE,GAAI5B,EAAO,IAAI,WAAW,EAAG,CAC3B,IAAMiD,EAAOjD,EAAO,IAAI,WAAW,EACnC,GAAI,EAAEiD,aAAgBnF,IACpB,MAAM,IAAI,MAAM,4BAA4B,EAE9C,IAAMiC,EAAeC,EAAO,IAAI,SAAS,EACnCqD,EAASrM,EAAQ,MAAM,IAAKiH,GAAS,CACzC,GAAI,EAAEA,aAAgB6B,IACpB,MAAM,IAAI,MAAM,gCAAgC,EAElD,IAAMzN,EAAQ4O,GAAkBhD,EAAMgF,EAAK,KAAK,EAChD,OAAO5Q,aAAiBsO,GAAiBZ,GAAgB,IAAIY,GAAmBtO,CAClF,CAAC,EACD,OAAO,IAAI2L,GAAWqF,CAAM,CAC9B,KACE,OAAM,IAAI,MAAM,wEAAwE,CAE5F,CACF,CACA,MAAM,IAAI,MAAM,8BAA8Bd,CAAU,EAAE,CAC5D,SAAWvL,aAAmB8G,GAAa,CACzC,OAAQyE,EAAY,CAClB,IAAK,SAAU,CACb,GAAM,CAAC7M,EAAMsK,CAAM,EAAI,KAAK,kBAAkB/I,EAAO,KAAM2K,CAAW,EAChE0B,EAAQ5N,EAAK,GAAG,CAAC,GAAKsK,EAAO,IAAI,OAAO,GAAK,IAAIpC,GAAa,CAAC,EACrE,GAAI,EAAE0F,aAAiB1F,IACrB,MAAM,IAAI,MAAM,wBAAwB,EAE1C,IAAM2F,EAAQ7N,EAAK,GAAG,CAAC,GAAKsK,EAAO,IAAI,OAAO,GAAK,IAAIrC,GAAa,EAAK,EACnE6F,EAAQ9N,EAAK,GAAG,CAAC,GAAKsK,EAAO,IAAI,OAAO,GAAK,IAAIrC,GAAa,EAAK,EACnE8F,EAAQzM,EAAQ,MAAM,MAAM;AAAA,CAAI,EAChC+H,EAAS,IAAI,OAAOuE,EAAM,KAAK,EAC/BI,EAAWD,EAAM,IACrB,CAAChE,EAAGpG,IAAM,CAACkK,EAAM,OAASlK,IAAM,GAAK,CAACmK,EAAM,OAAS/D,EAAE,SAAW,EAAIA,EAAIV,EAASU,CACrF,EACA,OAAO,IAAI3B,GAAY4F,EAAS,KAAK;AAAA,CAAI,CAAC,CAC5C,CACA,IAAK,UAAW,CACd,IAAMC,EAAY3M,EAAQ,SAAS,IAAI,SAAS,EAChD,GAAI,EAAE2M,aAAqB5F,IACzB,MAAM,IAAI,MAAM,8BAA8B,EAEhD,GAAM,CAACrI,EAAMsK,CAAM,EAAI,KAAK,kBAAkB/I,EAAO,KAAM2K,CAAW,EACtE,OAAO+B,EAAU,MAAM,CAAC,GAAGjO,EAAM,IAAIwK,GAAsBF,CAAM,CAAC,EAAG4B,CAAW,CAClF,CACF,CACA,MAAM,IAAI,MAAM,+BAA+BW,CAAU,EAAE,CAC7D,SAAWvL,aAAmB8I,GAAa,CACzC,IAAMwC,EAAUtL,EAAQ,SAAS,IAAIuL,CAAU,EAC/C,GAAID,GAAWA,aAAmBvE,GAAe,CAC/C,GAAM,CAACrI,EAAMsK,CAAM,EAAI,KAAK,kBAAkB/I,EAAO,KAAM2K,CAAW,EACtE,OAAI5B,EAAO,KAAO,GAChBtK,EAAK,KAAK,IAAIwK,GAAsBF,CAAM,CAAC,EAEtCsC,EAAQ,MAAM5M,EAAMkM,CAAW,CACxC,CACA,MAAM,IAAI,MAAM,+BAA+BW,CAAU,EAAE,CAC7D,KACE,OAAM,IAAI,MAAM,wBAAwBA,CAAU,cAAcvL,EAAQ,IAAI,EAAE,CAElF,CACA,MAAM,IAAI,MAAM,mBAAmBiD,EAAW,IAAI,EAAE,CACtD,CAIA,yBAAyB0H,EAAMC,EAAa,CAC1C,IAAM5K,EAAU,KAAK,SAAS2K,EAAK,QAASC,CAAW,EACvD,OAAO,KAAK,YAAY5K,EAAS2K,EAAK,OAAQC,CAAW,CAC3D,CAIA,uBAAuBD,EAAMC,EAAa,CACxC,IAAM5K,EAAU,KAAK,SAAS2K,EAAK,QAASC,CAAW,EACjD9M,EAAO8M,EAAY,MAAM,IAAID,EAAK,KAAK,KAAK,EAClD,GAAI,CAAC7M,EACH,MAAM,IAAI,MAAM,iBAAiB6M,EAAK,KAAK,KAAK,EAAE,EAEpD,IAAMnI,EAAS1E,EAAKkC,CAAO,EAC3B,OAAO,IAAI2G,GAAagE,EAAK,OAAS,CAACnI,EAASA,CAAM,CACxD,CAIA,yBAAyBmI,EAAMC,EAAa,CAE1C,OADkB,KAAK,SAASD,EAAK,KAAMC,CAAW,EACvC,SAAS,EAAE,MAGnB,KAAK,SAASD,EAAK,IAAKC,CAAW,EAFjC,IAAIjB,EAGf,CAIA,wBAAwBgB,EAAMC,EAAa,CACzC,IAAMpK,EAAW,KAAK,SAASmK,EAAK,SAAUC,CAAW,EACzD,GAAQD,EAAK,SAAS,QACf,MACH,OAAO,IAAIhE,GAAa,CAACnG,EAAS,KAAK,EAEvC,MAAM,IAAI,YAAY,qBAAqBmK,EAAK,SAAS,KAAK,EAAE,CAEtE,CACA,0BAA0BA,EAAMC,EAAa,CAE3C,OADa,KAAK,SAASD,EAAK,UAAWC,CAAW,EAC1C,SAAS,EAAE,MAAQ,KAAK,SAASD,EAAK,SAAUC,CAAW,EAAI,KAAK,SAASD,EAAK,UAAWC,CAAW,CACtH,CACA,YAAYpJ,EAASoJ,EAAa,CAChC,OAAO,KAAK,cAAcpJ,EAAQ,KAAMoJ,CAAW,CACrD,CACA,cAAcgC,EAAYhC,EAAa,CACrC,IAAIpI,EAAS,GACb,QAAWqK,KAAaD,EAAY,CAClC,IAAME,EAAgB,KAAK,SAASD,EAAWjC,CAAW,EACtDkC,EAAc,OAAS,aAAeA,EAAc,OAAS,mBAC/DtK,GAAUsK,EAAc,SAAS,EAErC,CACA,OAAO,IAAIhG,GAAYtE,CAAM,CAC/B,CACA,mBAAmBmI,EAAMC,EAAa,CACpC,OAAOA,EAAY,eAAeD,EAAK,KAAK,CAC9C,CACA,uBAAuBjG,EAAMkG,EAAa,CACxC,GAAM,CAAClM,EAAMsK,CAAM,EAAI,KAAK,kBAAkBtE,EAAK,KAAMkG,CAAW,EAChE5B,EAAO,KAAO,GAChBtK,EAAK,KAAK,IAAIwK,GAAsBF,CAAM,CAAC,EAE7C,IAAMzF,EAAK,KAAK,SAASmB,EAAK,OAAQkG,CAAW,EACjD,GAAIrH,EAAG,OAAS,gBACd,MAAM,IAAI,MAAM,qDAAqDA,EAAG,IAAI,EAAE,EAEhF,OAAOA,EAAG,MAAM7E,EAAMkM,CAAW,CACnC,CACA,wBAAwB9L,EAAQ4F,EAAMkG,EAAa,CACjD,GAAI,EAAE9L,aAAkBkI,IAAclI,aAAkBgI,IACtD,MAAM,IAAI,MAAM,yCAAyC,EAE3D,IAAMpG,EAAQ,KAAK,SAASgE,EAAK,MAAOkG,CAAW,EAC7CjK,EAAO,KAAK,SAAS+D,EAAK,KAAMkG,CAAW,EAC3ChK,EAAO,KAAK,SAAS8D,EAAK,KAAMkG,CAAW,EACjD,GAAI,EAAElK,aAAiBkG,IAAgBlG,aAAiBiJ,IACtD,MAAM,IAAI,MAAM,0CAA0C,EAE5D,GAAI,EAAEhJ,aAAgBiG,IAAgBjG,aAAgBgJ,IACpD,MAAM,IAAI,MAAM,yCAAyC,EAE3D,GAAI,EAAE/I,aAAgBgG,IAAgBhG,aAAgB+I,IACpD,MAAM,IAAI,MAAM,yCAAyC,EAE3D,OAAI7K,aAAkBkI,GACb,IAAIA,GAAW7B,GAAMrG,EAAO,MAAO4B,EAAM,MAAOC,EAAK,MAAOC,EAAK,KAAK,CAAC,EAEvE,IAAIkG,GAAY3B,GAAM,MAAM,KAAKrG,EAAO,KAAK,EAAG4B,EAAM,MAAOC,EAAK,MAAOC,EAAK,KAAK,EAAE,KAAK,EAAE,CAAC,CAExG,CACA,yBAAyB8D,EAAMkG,EAAa,CAC1C,IAAM9L,EAAS,KAAK,SAAS4F,EAAK,OAAQkG,CAAW,EACjD7L,EACJ,GAAI2F,EAAK,SAAU,CACjB,GAAIA,EAAK,SAAS,OAAS,kBACzB,OAAO,KAAK,wBAAwB5F,EAAQ4F,EAAK,SAAUkG,CAAW,EAEtE7L,EAAW,KAAK,SAAS2F,EAAK,SAAUkG,CAAW,CAEvD,MACE7L,EAAW,IAAI+H,GAAYpC,EAAK,SAAS,KAAK,EAEhD,IAAIrJ,EACJ,GAAIyD,aAAkBgK,GAAa,CACjC,GAAI,EAAE/J,aAAoB+H,IACxB,MAAM,IAAI,MAAM,+CAA+C/H,EAAS,IAAI,EAAE,EAEhF1D,EAAQyD,EAAO,MAAM,IAAIC,EAAS,KAAK,GAAKD,EAAO,SAAS,IAAIC,EAAS,KAAK,CAChF,SAAWD,aAAkBkI,IAAclI,aAAkBgI,GAC3D,GAAI/H,aAAoB6H,GACtBvL,EAAQyD,EAAO,MAAM,GAAGC,EAAS,KAAK,EAClCD,aAAkBgI,KACpBzL,EAAQ,IAAIyL,GAAYhI,EAAO,MAAM,GAAGC,EAAS,KAAK,CAAC,WAEhDA,aAAoB+H,GAC7BzL,EAAQyD,EAAO,SAAS,IAAIC,EAAS,KAAK,MAE1C,OAAM,IAAI,MAAM,0DAA0DA,EAAS,IAAI,EAAE,MAEtF,CACL,GAAI,EAAEA,aAAoB+H,IACxB,MAAM,IAAI,MAAM,+CAA+C/H,EAAS,IAAI,EAAE,EAEhF1D,EAAQyD,EAAO,SAAS,IAAIC,EAAS,KAAK,CAC5C,CACA,OAAO1D,aAAiBqL,GAAerL,EAAQ,IAAIsO,EACrD,CACA,YAAYgB,EAAMC,EAAa,CAC7B,IAAMmC,EAAMpC,EAAK,MAAQ,KAAK,SAASA,EAAK,MAAOC,CAAW,EAAI,KAAK,cAAcD,EAAK,KAAMC,CAAW,EAC3G,GAAID,EAAK,SAAS,OAAS,aAAc,CACvC,IAAMqC,EAAerC,EAAK,SAAS,MACnCC,EAAY,YAAYoC,EAAcD,CAAG,CAC3C,SAAWpC,EAAK,SAAS,OAAS,eAAgB,CAChD,IAAMsC,EAAQtC,EAAK,SACnB,GAAI,EAAEoC,aAAe/F,IACnB,MAAM,IAAI,MAAM,2CAA2C+F,EAAI,IAAI,EAAE,EAEvE,IAAMG,EAAMH,EAAI,MAChB,GAAIG,EAAI,SAAWD,EAAM,MAAM,OAC7B,MAAM,IAAI,MAAM,OAAOA,EAAM,MAAM,OAASC,EAAI,OAAS,MAAQ,MAAM,yBAAyB,EAElG,QAAS7K,EAAI,EAAGA,EAAI4K,EAAM,MAAM,OAAQ,EAAE5K,EAAG,CAC3C,IAAM8K,EAAOF,EAAM,MAAM5K,CAAC,EAC1B,GAAI8K,EAAK,OAAS,aAChB,MAAM,IAAI,MAAM,2CAA2CA,EAAK,IAAI,EAAE,EAExEvC,EAAY,YAAYuC,EAAK,MAAOD,EAAI7K,CAAC,CAAC,CAC5C,CACF,SAAWsI,EAAK,SAAS,OAAS,mBAAoB,CACpD,IAAMrG,EAASqG,EAAK,SACd7L,EAAS,KAAK,SAASwF,EAAO,OAAQsG,CAAW,EACvD,GAAI,EAAE9L,aAAkBgK,IACtB,MAAM,IAAI,MAAM,uCAAuC,EAEzD,GAAIxE,EAAO,SAAS,OAAS,aAC3B,MAAM,IAAI,MAAM,sDAAsD,EAExExF,EAAO,MAAM,IAAIwF,EAAO,SAAS,MAAOyI,CAAG,CAC7C,KACE,OAAM,IAAI,MAAM,6CAA6C,KAAK,UAAUpC,EAAK,QAAQ,CAAC,EAAE,EAE9F,OAAO,IAAIxD,EACb,CACA,WAAWwD,EAAMC,EAAa,CAC5B,IAAM9M,EAAO,KAAK,SAAS6M,EAAK,KAAMC,CAAW,EACjD,OAAO,KAAK,cAAc9M,EAAK,SAAS,EAAE,MAAQ6M,EAAK,KAAOA,EAAK,UAAWC,CAAW,CAC3F,CACA,YAAYD,EAAMC,EAAa,CAC7B,IAAMwC,EAAQ,IAAIxD,GAAYgB,CAAW,EACrC9M,EAAMI,EACV,GAAIyM,EAAK,SAAS,OAAS,mBAAoB,CAC7C,IAAMqB,EAASrB,EAAK,SACpBzM,EAAW,KAAK,SAAS8N,EAAO,IAAKoB,CAAK,EAC1CtP,EAAOkO,EAAO,IAChB,MACE9N,EAAW,KAAK,SAASyM,EAAK,SAAUyC,CAAK,EAE/C,GAAI,EAAElP,aAAoB8I,IAAc9I,aAAoB4K,IAC1D,MAAM,IAAI,MAAM,qDAAqD5K,EAAS,IAAI,EAAE,EAElFA,aAAoB4K,KACtB5K,EAAWA,EAAS,KAAK,GAE3B,IAAMoL,EAAQ,CAAC,EACT+D,EAAuB,CAAC,EAC9B,QAAShL,EAAI,EAAGA,EAAInE,EAAS,MAAM,OAAQ,EAAEmE,EAAG,CAC9C,IAAMiL,EAAY,IAAI1D,GAAYwD,CAAK,EACjC3L,EAAUvD,EAAS,MAAMmE,CAAC,EAC5BkL,EACJ,GAAI5C,EAAK,QAAQ,OAAS,aACxB4C,EAAuBC,GAAWA,EAAO,YAAY7C,EAAK,QAAQ,MAAOlJ,CAAO,UACvEkJ,EAAK,QAAQ,OAAS,eAAgB,CAC/C,IAAM1M,EAAU0M,EAAK,QACrB,GAAIlJ,EAAQ,OAAS,aACnB,MAAM,IAAI,MAAM,oCAAoCA,EAAQ,IAAI,EAAE,EAEpE,IAAMlE,EAAIkE,EACV,GAAIxD,EAAQ,MAAM,SAAWV,EAAE,MAAM,OACnC,MAAM,IAAI,MAAM,OAAOU,EAAQ,MAAM,OAASV,EAAE,MAAM,OAAS,MAAQ,MAAM,kBAAkB,EAEjGgQ,EAAuBC,GAAW,CAChC,QAASC,EAAI,EAAGA,EAAIxP,EAAQ,MAAM,OAAQ,EAAEwP,EAAG,CAC7C,GAAIxP,EAAQ,MAAMwP,CAAC,EAAE,OAAS,aAC5B,MAAM,IAAI,MAAM,sCAAsCxP,EAAQ,MAAMwP,CAAC,EAAE,IAAI,EAAE,EAE/ED,EAAO,YAAYvP,EAAQ,MAAMwP,CAAC,EAAE,MAAOlQ,EAAE,MAAMkQ,CAAC,CAAC,CACvD,CACF,CACF,KACE,OAAM,IAAI,MAAM,6BAA6B9C,EAAK,QAAQ,IAAI,EAAE,EAE9D7M,IACFyP,EAAoBD,CAAS,EAEzB,CADc,KAAK,SAASxP,EAAMwP,CAAS,EAChC,SAAS,EAAE,SAI5BhE,EAAM,KAAK7H,CAAO,EAClB4L,EAAqB,KAAKE,CAAmB,EAC/C,CACA,IAAI/K,EAAS,GACTkL,EAAc,GAClB,QAASrL,EAAI,EAAGA,EAAIiH,EAAM,OAAQ,EAAEjH,EAAG,CACrC,IAAMsL,EAAuB,IAAI,IAAI,CACnC,CAAC,QAAS,IAAI/G,GAAavE,EAAI,CAAC,CAAC,EACjC,CAAC,SAAU,IAAIuE,GAAavE,CAAC,CAAC,EAC9B,CAAC,WAAY,IAAIuE,GAAa0C,EAAM,OAASjH,CAAC,CAAC,EAC/C,CAAC,YAAa,IAAIuE,GAAa0C,EAAM,OAASjH,EAAI,CAAC,CAAC,EACpD,CAAC,QAAS,IAAIsE,GAAatE,IAAM,CAAC,CAAC,EACnC,CAAC,OAAQ,IAAIsE,GAAatE,IAAMiH,EAAM,OAAS,CAAC,CAAC,EACjD,CAAC,SAAU,IAAI1C,GAAa0C,EAAM,MAAM,CAAC,EACzC,CAAC,WAAYjH,EAAI,EAAIiH,EAAMjH,EAAI,CAAC,EAAI,IAAIsH,EAAgB,EACxD,CAAC,WAAYtH,EAAIiH,EAAM,OAAS,EAAIA,EAAMjH,EAAI,CAAC,EAAI,IAAIsH,EAAgB,CACzE,CAAC,EACDyD,EAAM,YAAY,OAAQ,IAAItE,GAAY6E,CAAI,CAAC,EAC/CN,EAAqBhL,CAAC,EAAE+K,CAAK,EAC7B,GAAI,CACF,IAAMQ,EAAY,KAAK,cAAcjD,EAAK,KAAMyC,CAAK,EACrD5K,GAAUoL,EAAU,KACtB,OAASC,EAAK,CACZ,GAAIA,aAAepH,GACjB,SAEF,GAAIoH,aAAerH,GACjB,MAEF,MAAMqH,CACR,CACAH,EAAc,EAChB,CACA,GAAIA,EAAa,CACf,IAAMI,EAAmB,KAAK,cAAcnD,EAAK,aAAcyC,CAAK,EACpE5K,GAAUsL,EAAiB,KAC7B,CACA,OAAO,IAAIhH,GAAYtE,CAAM,CAC/B,CAIA,cAAcmI,EAAMC,EAAa,CAC/B,OAAAA,EAAY,YACVD,EAAK,KAAK,MACV,IAAI5D,GAAc,CAACrI,EAAM0O,IAAU,CACjC,IAAMW,EAAa,IAAInE,GAAYwD,CAAK,EACxC1O,EAAOA,EAAK,MAAM,EAClB,IAAIsK,EACAtK,EAAK,GAAG,EAAE,GAAG,OAAS,0BACxBsK,EAAStK,EAAK,IAAI,GAEpB,QAAS2D,EAAI,EAAGA,EAAIsI,EAAK,KAAK,OAAQ,EAAEtI,EAAG,CACzC,IAAM2L,EAAUrD,EAAK,KAAKtI,CAAC,EACrB4L,EAAYvP,EAAK2D,CAAC,EACxB,GAAI2L,EAAQ,OAAS,aAAc,CACjC,IAAME,EAAaF,EACnB,GAAI,CAACC,EACH,MAAM,IAAI,MAAM,gCAAgCC,EAAW,KAAK,EAAE,EAEpEH,EAAW,YAAYG,EAAW,MAAOD,CAAS,CACpD,SAAWD,EAAQ,OAAS,4BAA6B,CACvD,IAAM7C,EAAQ6C,EACR3S,EAAQ4S,GACdjF,GAAQ,MAAM,IAAImC,EAAM,IAAI,KAAK,GACjC,KAAK,SAASA,EAAM,MAAO4C,CAAU,EACrCA,EAAW,YAAY5C,EAAM,IAAI,MAAO9P,CAAK,CAC/C,KACE,OAAM,IAAI,MAAM,0BAA0B2S,EAAQ,IAAI,EAAE,CAE5D,CACA,OAAO,KAAK,cAAcrD,EAAK,KAAMoD,CAAU,CACjD,CAAC,CACH,EACO,IAAI5G,EACb,CACA,sBAAsBwD,EAAMC,EAAa,CACvC,IAAMuD,EAAW,IAAIpH,GAAc,CAAC7F,EAAYkN,IAAc,CAC5D,IAAMC,EAAe,IAAIzE,GAAYwE,CAAS,EAC9C,GAAIzD,EAAK,WACP,QAAStI,EAAI,EAAGA,EAAIsI,EAAK,WAAW,OAAQ,EAAEtI,EAAG,CAC/C,IAAMiM,EAAQ3D,EAAK,WAAWtI,CAAC,EAC/B,GAAIiM,EAAM,OAAS,aACjB,MAAM,IAAI,MAAM,+CAA+CA,EAAM,IAAI,EAAE,EAE7ED,EAAa,YAAYC,EAAM,MAAOpN,EAAWmB,CAAC,GAAK,IAAIsH,EAAgB,CAC7E,CAEF,OAAO,KAAK,cAAcgB,EAAK,KAAM0D,CAAY,CACnD,CAAC,EACK,CAACE,EAAWC,CAAW,EAAI,KAAK,kBAAkB7D,EAAK,KAAK,KAAMC,CAAW,EACnF2D,EAAU,KAAK,IAAIrF,GAAsBsF,CAAW,CAAC,EACrD,IAAMjL,EAAK,KAAK,SAASoH,EAAK,KAAK,OAAQC,CAAW,EACtD,GAAIrH,EAAG,OAAS,gBACd,MAAM,IAAI,MAAM,qDAAqDA,EAAG,IAAI,EAAE,EAEhF,IAAMkL,EAAS,IAAI7E,GAAYgB,CAAW,EAC1C,OAAA6D,EAAO,YAAY,SAAUN,CAAQ,EAC9B5K,EAAG,MAAMgL,EAAWE,CAAM,CACnC,CACA,wBAAwB9D,EAAMC,EAAa,CACzC,IAAM8D,EAAW,KAAK,cAAc/D,EAAK,KAAMC,CAAW,EAC1D,OAAO,KAAK,YAAY8D,EAAU/D,EAAK,OAAQC,CAAW,CAC5D,CACA,SAASiC,EAAWjC,EAAa,CAC/B,GAAI,CAACiC,EACH,OAAO,IAAIlD,GACb,OAAQkD,EAAU,KAAM,CACtB,IAAK,UACH,OAAO,KAAK,YAAYA,EAAWjC,CAAW,EAChD,IAAK,MACH,OAAO,KAAK,YAAYiC,EAAWjC,CAAW,EAChD,IAAK,KACH,OAAO,KAAK,WAAWiC,EAAWjC,CAAW,EAC/C,IAAK,MACH,OAAO,KAAK,YAAYiC,EAAWjC,CAAW,EAChD,IAAK,QACH,OAAO,KAAK,cAAciC,EAAWjC,CAAW,EAClD,IAAK,gBACH,OAAO,KAAK,sBAAsBiC,EAAWjC,CAAW,EAC1D,IAAK,QACH,MAAM,IAAIpE,GACZ,IAAK,WACH,MAAM,IAAIC,GACZ,IAAK,iBACH,OAAO,IAAIG,GAAaiG,EAAU,KAAK,EACzC,IAAK,eACH,OAAO,IAAIhG,GAAWgG,EAAU,KAAK,EACvC,IAAK,gBACH,OAAO,IAAI/F,GAAY+F,EAAU,KAAK,EACxC,IAAK,eACH,OAAO,IAAI7F,GAAW6F,EAAU,MAAM,IAAKpE,GAAM,KAAK,SAASA,EAAGmC,CAAW,CAAC,CAAC,EACjF,IAAK,eACH,OAAO,IAAIlB,GAAWmD,EAAU,MAAM,IAAKpE,GAAM,KAAK,SAASA,EAAGmC,CAAW,CAAC,CAAC,EACjF,IAAK,gBAAiB,CACpB,IAAM+D,EAA0B,IAAI,IACpC,OAAW,CAAC7N,EAAKzF,CAAK,IAAKwR,EAAU,MAAO,CAC1C,IAAM+B,EAAe,KAAK,SAAS9N,EAAK8J,CAAW,EACnD,GAAI,EAAEgE,aAAwB9H,IAC5B,MAAM,IAAI,MAAM,oCAAoC8H,EAAa,IAAI,EAAE,EAEzED,EAAQ,IAAIC,EAAa,MAAO,KAAK,SAASvT,EAAOuP,CAAW,CAAC,CACnE,CACA,OAAO,IAAI9B,GAAY6F,CAAO,CAChC,CACA,IAAK,aACH,OAAO,KAAK,mBAAmB9B,EAAWjC,CAAW,EACvD,IAAK,iBACH,OAAO,KAAK,uBAAuBiC,EAAWjC,CAAW,EAC3D,IAAK,mBACH,OAAO,KAAK,yBAAyBiC,EAAWjC,CAAW,EAC7D,IAAK,kBACH,OAAO,KAAK,wBAAwBiC,EAAWjC,CAAW,EAC5D,IAAK,mBACH,OAAO,KAAK,yBAAyBiC,EAAWjC,CAAW,EAC7D,IAAK,mBACH,OAAO,KAAK,yBAAyBiC,EAAWjC,CAAW,EAC7D,IAAK,kBACH,OAAO,KAAK,wBAAwBiC,EAAWjC,CAAW,EAC5D,IAAK,iBACH,OAAO,KAAK,uBAAuBiC,EAAWjC,CAAW,EAC3D,IAAK,mBACH,OAAO,KAAK,yBAAyBiC,EAAWjC,CAAW,EAC7D,IAAK,UACH,OAAO,KAAK,0BAA0BiC,EAAWjC,CAAW,EAC9D,IAAK,UACH,OAAO,IAAIzD,GACb,QACE,MAAM,IAAI,YAAY,sBAAsB0F,EAAU,IAAI,EAAE,CAChE,CACF,CACF,EACA,SAAS/C,GAAuBlC,EAAO,CACrC,OAAQ,OAAOA,EAAO,CACpB,IAAK,SACH,OAAO,OAAO,UAAUA,CAAK,EAAI,IAAIhB,GAAagB,CAAK,EAAI,IAAIf,GAAWe,CAAK,EACjF,IAAK,SACH,OAAO,IAAId,GAAYc,CAAK,EAC9B,IAAK,UACH,OAAO,IAAIjB,GAAaiB,CAAK,EAC/B,IAAK,YACH,OAAO,IAAI+B,GACb,IAAK,SACH,OAAI/B,IAAU,KACL,IAAIT,GACF,MAAM,QAAQS,CAAK,EACrB,IAAIZ,GAAWY,EAAM,IAAIkC,EAAsB,CAAC,EAEhD,IAAIhB,GACT,IAAI,IAAI,OAAO,QAAQlB,CAAK,EAAE,IAAI,CAAC,CAAC9G,EAAKzF,CAAK,IAAM,CAACyF,EAAKgJ,GAAuBzO,CAAK,CAAC,CAAC,CAAC,CAC3F,EAEJ,IAAK,WACH,OAAO,IAAI0L,GAAc,CAACrI,EAAMmQ,IAAW,CACzC,IAAMrM,EAASoF,EAAM,GAAGlJ,EAAK,IAAK+J,GAAMA,EAAE,KAAK,CAAC,GAAK,KACrD,OAAOqB,GAAuBtH,CAAM,CACtC,CAAC,EACH,QACE,MAAM,IAAI,MAAM,oCAAoCoF,CAAK,EAAE,CAC/D,CACF,CAGA,IAAIkH,GAAU;AAAA,EACVC,GAAiB,OACjBC,GAAkB,OACtB,SAASC,GAA4BvK,EAAM,CACzC,OAAQA,EAAK,SAAS,KAAM,CAC1B,IAAK,+BACH,MAAO,GACT,IAAK,yBACH,MAAO,GACT,IAAK,2BACH,MAAO,GACT,IAAK,aACH,OAAIA,EAAK,SAAS,QAAU,MACnB,EACLA,EAAK,SAAS,QAAU,MAAQA,EAAK,SAAS,QAAU,SACnD,EACF,CACX,CACA,MAAO,EACT,CACA,SAASwK,GAAO1N,EAASuG,EAAS,IAAK,CACrC,IAAMoH,EAAY,OAAOpH,GAAW,SAAW,IAAI,OAAOA,CAAM,EAAIA,EAEpE,OADaqH,GAAiB5N,EAAQ,KAAM,EAAG2N,CAAS,EAC5C,QAAQ,MAAO,EAAE,CAC/B,CACA,SAASE,MAAmBrS,EAAM,CAChC,OAAO+R,GAAiB/R,EAAK,KAAK,GAAG,EAAIgS,EAC3C,CACA,SAASI,GAAiBE,EAAOzH,EAAOsH,EAAW,CACjD,OAAOG,EAAM,IAAKC,GAASC,GAAgBD,EAAM1H,EAAOsH,CAAS,CAAC,EAAE,KAAKL,EAAO,CAClF,CACA,SAASU,GAAgB7E,EAAM9C,EAAOsH,EAAW,CAC/C,IAAMM,EAAMN,EAAU,OAAOtH,CAAK,EAClC,OAAQ8C,EAAK,KAAM,CACjB,IAAK,UACH,OAAOyE,GAAiBzE,EAAK,KAAM9C,EAAOsH,CAAS,EACrD,IAAK,KACH,OAAOO,GAAS/E,EAAM9C,EAAOsH,CAAS,EACxC,IAAK,MACH,OAAOQ,GAAUhF,EAAM9C,EAAOsH,CAAS,EACzC,IAAK,MACH,OAAOS,GAAUjF,EAAM9C,EAAOsH,CAAS,EACzC,IAAK,QACH,OAAOU,GAAYlF,EAAM9C,EAAOsH,CAAS,EAC3C,IAAK,QACH,OAAOM,EAAMJ,GAAgB,OAAO,EACtC,IAAK,WACH,OAAOI,EAAMJ,GAAgB,UAAU,EACzC,IAAK,gBACH,OAAOS,GAAoBnF,EAAM9C,EAAOsH,CAAS,EACnD,IAAK,kBACH,OAAOY,GAAsBpF,EAAM9C,EAAOsH,CAAS,EACrD,IAAK,UACH,OAAOM,EAAM,MAAQ9E,EAAK,MAAQ,MACpC,QACE,OAAO8E,EAAM,OAASO,GAAiBrF,CAAI,EAAI,MACnD,CACF,CACA,SAAS+E,GAAS/E,EAAM9C,EAAOsH,EAAW,CACxC,IAAMM,EAAMN,EAAU,OAAOtH,CAAK,EAC5BoI,EAAU,CAAC,EACbxO,EAAUkJ,EACd,KAAOlJ,IACLwO,EAAQ,KAAK,CAAE,KAAMxO,EAAQ,KAAM,KAAMA,EAAQ,IAAK,CAAC,EACnDA,EAAQ,UAAU,SAAW,GAAKA,EAAQ,UAAU,CAAC,EAAE,OAAS,OAClEA,EAAUA,EAAQ,UAAU,CAAC,EAKjC,IAAIyO,EAAMT,EAAMJ,GAAgB,KAAMW,GAAiBC,EAAQ,CAAC,EAAE,IAAI,CAAC,EAAInB,GAAUM,GAAiBa,EAAQ,CAAC,EAAE,KAAMpI,EAAQ,EAAGsH,CAAS,EAC3I,QAAS,EAAI,EAAG,EAAIc,EAAQ,OAAQ,EAAE,EACpCC,GAAOpB,GAAUW,EAAMJ,GAAgB,OAAQW,GAAiBC,EAAQ,CAAC,EAAE,IAAI,CAAC,EAAInB,GAAUM,GAAiBa,EAAQ,CAAC,EAAE,KAAMpI,EAAQ,EAAGsH,CAAS,EAEtJ,OAAI1N,GAAWA,EAAQ,UAAU,OAAS,IACxCyO,GAAOpB,GAAUW,EAAMJ,GAAgB,MAAM,EAAIP,GAAUM,GAAiB3N,EAAQ,UAAWoG,EAAQ,EAAGsH,CAAS,GAErHe,GAAOpB,GAAUW,EAAMJ,GAAgB,OAAO,EACvCa,CACT,CACA,SAASP,GAAUhF,EAAM9C,EAAOsH,EAAW,CACzC,IAAMM,EAAMN,EAAU,OAAOtH,CAAK,EAC9BsI,EAAoB,GACxB,GAAIxF,EAAK,SAAS,OAAS,mBAAoB,CAC7C,IAAM7E,EAAI6E,EAAK,SACfwF,EAAoB,GAAGH,GAAiBlK,EAAE,GAAG,CAAC,OAAOkK,GAAiBlK,EAAE,IAAI,CAAC,EAC/E,MACEqK,EAAoBH,GAAiBrF,EAAK,QAAQ,EAEpD,IAAIuF,EAAMT,EAAMJ,GAAgB,MAAOW,GAAiBrF,EAAK,OAAO,EAAG,KAAMwF,CAAiB,EAAIrB,GAAUM,GAAiBzE,EAAK,KAAM9C,EAAQ,EAAGsH,CAAS,EAC5J,OAAIxE,EAAK,aAAa,OAAS,IAC7BuF,GAAOpB,GAAUW,EAAMJ,GAAgB,MAAM,EAAIP,GAAUM,GAAiBzE,EAAK,aAAc9C,EAAQ,EAAGsH,CAAS,GAErHe,GAAOpB,GAAUW,EAAMJ,GAAgB,QAAQ,EACxCa,CACT,CACA,SAASN,GAAUjF,EAAM9C,EAAOsH,EAAW,CACzC,IAAMM,EAAMN,EAAU,OAAOtH,CAAK,EAC5BhI,EAAOmQ,GAAiBrF,EAAK,QAAQ,EACrC7K,EAAQ6K,EAAK,MAAQqF,GAAiBrF,EAAK,KAAK,EAAI,GACpDtP,EAAQoU,EAAMJ,GAAgB,MAAO,GAAGxP,CAAI,GAAG8K,EAAK,MAAQ,MAAQ7K,EAAQ,EAAE,EAAE,EACtF,OAAI6K,EAAK,KAAK,SAAW,EAChBtP,EAEFA,EAAQyT,GAAUM,GAAiBzE,EAAK,KAAM9C,EAAQ,EAAGsH,CAAS,EAAIL,GAAUW,EAAMJ,GAAgB,QAAQ,CACvH,CACA,SAASQ,GAAYlF,EAAM9C,EAAOsH,EAAW,CAC3C,IAAMM,EAAMN,EAAU,OAAOtH,CAAK,EAC5BnJ,EAAOiM,EAAK,KAAK,IAAIqF,EAAgB,EAAE,KAAK,IAAI,EACtD,OAAOP,EAAMJ,GAAgB,QAAS,GAAG1E,EAAK,KAAK,KAAK,IAAIjM,CAAI,GAAG,EAAIoQ,GAAUM,GAAiBzE,EAAK,KAAM9C,EAAQ,EAAGsH,CAAS,EAAIL,GAAUW,EAAMJ,GAAgB,UAAU,CACjL,CACA,SAASS,GAAoBnF,EAAM9C,EAAOsH,EAAW,CACnD,IAAMM,EAAMN,EAAU,OAAOtH,CAAK,EAC5BuI,EAASzF,EAAK,YAAcA,EAAK,WAAW,OAAS,EAAI,IAAIA,EAAK,WAAW,IAAIqF,EAAgB,EAAE,KAAK,IAAI,CAAC,IAAM,GACnHhN,EAAWgN,GAAiBrF,EAAK,IAAI,EACvCuF,EAAMT,EAAMJ,GAAgB,OAAOe,CAAM,GAAIpN,CAAQ,EAAI8L,GAC7D,OAAAoB,GAAOd,GAAiBzE,EAAK,KAAM9C,EAAQ,EAAGsH,CAAS,EAAIL,GAC3DoB,GAAOT,EAAMJ,GAAgB,SAAS,EAC/Ba,CACT,CACA,SAASH,GAAsBpF,EAAM9C,EAAOsH,EAAW,CACrD,IAAMM,EAAMN,EAAU,OAAOtH,CAAK,EAC5BwI,EAAO1F,EAAK,OAAO,OAAS,aAAeA,EAAK,OAAO,MAAQqF,GAAiBrF,EAAK,MAAM,EAC7FuF,EAAMT,EAAMJ,GAAgB,SAAUgB,CAAI,EAAIvB,GAClD,OAAAoB,GAAOd,GAAiBzE,EAAK,KAAM9C,EAAQ,EAAGsH,CAAS,EAAIL,GAC3DoB,GAAOT,EAAMJ,GAAgB,WAAW,EACjCa,CACT,CACA,SAASF,GAAiBrF,EAAM2F,EAAa,GAAI,CAC/C,OAAQ3F,EAAK,KAAM,CACjB,IAAK,mBAEH,MAAO,IAAIqF,GADDrF,EACoB,QAAQ,CAAC,GAEzC,IAAK,aACH,OAAOA,EAAK,MACd,IAAK,iBACH,MAAO,GAAGA,EAAK,KAAK,GACtB,IAAK,eACH,MAAO,GAAGA,EAAK,KAAK,GACtB,IAAK,gBACH,OAAO,KAAK,UAAUA,EAAK,KAAK,EAClC,IAAK,mBAAoB,CACvB,IAAM7E,EAAI6E,EACJ4F,EAAiBtB,GAA4BnJ,CAAC,EAC9CjG,EAAOmQ,GAAiBlK,EAAE,KAAMyK,CAAc,EAC9CzQ,EAAQkQ,GAAiBlK,EAAE,MAAOyK,EAAiB,CAAC,EACpD7L,EAAO,GAAG7E,CAAI,IAAIiG,EAAE,SAAS,KAAK,IAAIhG,CAAK,GACjD,OAAOyQ,EAAiBD,EAAa,IAAI5L,CAAI,IAAMA,CACrD,CACA,IAAK,kBAAmB,CACtB,IAAMoB,EAAI6E,EAEV,OADY7E,EAAE,SAAS,OAASA,EAAE,SAAS,QAAU,MAAQ,IAAM,IAAMkK,GAAiBlK,EAAE,SAAU,GAAQ,CAEhH,CACA,IAAK,iBAAkB,CACrB,IAAMA,EAAI6E,EACJjM,EAAOoH,EAAE,KAAK,IAAIkK,EAAgB,EAAE,KAAK,IAAI,EACnD,MAAO,GAAGA,GAAiBlK,EAAE,MAAM,CAAC,IAAIpH,CAAI,GAC9C,CACA,IAAK,mBAAoB,CACvB,IAAMoH,EAAI6E,EACN6F,EAAMR,GAAiBlK,EAAE,MAAM,EAC9B,CACH,aACA,mBACA,iBACA,gBACA,iBACA,eACA,eACA,eACA,eACF,EAAE,SAASA,EAAE,OAAO,IAAI,IACtB0K,EAAM,IAAIA,CAAG,KAEf,IAAIC,EAAOT,GAAiBlK,EAAE,QAAQ,EACtC,MAAI,CAACA,EAAE,UAAYA,EAAE,SAAS,OAAS,eACrC2K,EAAO,IAAIA,CAAI,KAEV3K,EAAE,SAAW,GAAG0K,CAAG,IAAIC,CAAI,IAAM,GAAGD,CAAG,IAAIC,CAAI,EACxD,CACA,IAAK,mBAAoB,CACvB,IAAM3K,EAAI6E,EACJ3K,EAAUgQ,GAAiBlK,EAAE,QAAS,GAAQ,EACpD,OAAIA,EAAE,OAAO,OAAS,iBACb,GAAG9F,CAAO,MAAMgQ,GAAiBlK,EAAE,MAAM,CAAC,GAE5C,GAAG9F,CAAO,MAAM8F,EAAE,OAAO,KAAK,EACvC,CACA,IAAK,mBAAoB,CACvB,IAAMA,EAAI6E,EACV,MAAO,GAAGqF,GAAiBlK,EAAE,GAAG,CAAC,OAAOkK,GAAiBlK,EAAE,IAAI,CAAC,EAClE,CACA,IAAK,iBAAkB,CACrB,IAAMA,EAAI6E,EACV,MAAO,GAAGqF,GAAiBlK,EAAE,OAAO,CAAC,MAAMA,EAAE,OAAS,OAAS,EAAE,IAAIA,EAAE,KAAK,KAAK,EACnF,CACA,IAAK,eACL,IAAK,eAAgB,CACnB,IAAM4K,EAAQ/F,EAAK,MAAM,IAAIqF,EAAgB,EACvCW,EAAWhG,EAAK,OAAS,eAAiB,KAAO,KACvD,MAAO,GAAGgG,EAAS,CAAC,CAAC,GAAGD,EAAM,KAAK,IAAI,CAAC,GAAGC,EAAS,CAAC,CAAC,EACxD,CACA,IAAK,gBAIH,MAAO,IAHS,MAAM,KAAKhG,EAAK,MAAM,QAAQ,CAAC,EAAE,IAC/C,CAAC,CAACiG,EAAG/H,CAAC,IAAM,GAAGmH,GAAiBY,CAAC,CAAC,KAAKZ,GAAiBnH,CAAC,CAAC,EAC5D,EACmB,KAAK,IAAI,CAAC,IAE/B,IAAK,kBAAmB,CACtB,IAAM/C,EAAI6E,EACJ3E,EAAIF,EAAE,MAAQkK,GAAiBlK,EAAE,KAAK,EAAI,GAC1C+K,EAAI/K,EAAE,KAAOkK,GAAiBlK,EAAE,IAAI,EAAI,GACxCgL,EAAKhL,EAAE,KAAO,IAAIkK,GAAiBlK,EAAE,IAAI,CAAC,GAAK,GACrD,MAAO,GAAGE,CAAC,IAAI6K,CAAC,GAAGC,CAAE,EACvB,CACA,IAAK,4BAA6B,CAChC,IAAMhL,EAAI6E,EACV,MAAO,GAAG7E,EAAE,IAAI,KAAK,IAAIkK,GAAiBlK,EAAE,KAAK,CAAC,EACpD,CACA,IAAK,UAAW,CACd,IAAMA,EAAI6E,EACJjG,EAAO,GAAGsL,GAAiBlK,EAAE,QAAQ,CAAC,OAAOkK,GAAiBlK,EAAE,UAAW,CAAC,CAAC,SAASkK,GAC1FlK,EAAE,SACJ,CAAC,GACD,OAAOwK,EAAa,GAAK,IAAI5L,CAAI,IAAMA,CACzC,CACA,QACE,MAAM,IAAI,MAAM,4BAA4BiG,EAAK,IAAI,EAAE,CAC3D,CACF,CAGA,IAAIoG,GAAW,KAAM,CACnB,OAIA,YAAYjV,EAAU,CACpB,IAAMI,EAASF,GAASF,EAAU,CAChC,cAAe,GACf,YAAa,EACf,CAAC,EACD,KAAK,OAASyF,GAAMrF,CAAM,CAC5B,CACA,OAAOoN,EAAO,CACZ,IAAMU,EAAM,IAAIJ,GAEhB,GADAG,GAAaC,CAAG,EACZV,EACF,OAAW,CAACxI,EAAKzF,CAAK,IAAK,OAAO,QAAQiO,CAAK,EAC7CU,EAAI,IAAIlJ,EAAKzF,CAAK,EAKtB,OAFoB,IAAIqP,GAAYV,CAAG,EACZ,IAAI,KAAK,MAAM,EAC5B,KAChB,CACA,OAAOjO,EAAS,CACd,OAAOmT,GAAO,KAAK,OAAQnT,GAAS,QAAU,GAAG,CACnD,CACF,EChwFA,IAAMiV,GAAoB,CACtB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,QAAQ,EACf,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,QAAQ,EACf,CAAC,KAAM,QAAQ,EACf,CAAC,KAAM,UAAU,EACjB,CAAC,KAAM,YAAY,EACnB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,QAAQ,EACf,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,OAAO,EACd,CAAC,KAAM,QAAQ,EACf,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,YAAY,EACnB,CAAC,KAAM,OAAO,EACd,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,YAAY,EACnB,CAAC,KAAM,QAAQ,EACf,CAAC,KAAM,WAAW,EAClB,CAAC,KAAM,OAAO,EACd,CAAC,KAAM,OAAO,EACd,CAAC,KAAM,OAAO,EACd,CAAC,KAAM,UAAU,EACjB,CAAC,KAAM,QAAQ,EACf,CAAC,KAAM,WAAW,EAClB,CAAC,KAAM,OAAO,EACd,CAAC,KAAM,WAAW,EAClB,CAAC,KAAM,MAAM,EACb,CAAC,KAAM,MAAM,EACb,CAAC,KAAM,UAAU,EACjB,CAAC,KAAM,WAAW,EAClB,CAAC,KAAM,YAAY,EACnB,CAAC,KAAM,OAAO,EACd,CAAC,KAAM,OAAO,EACd,CAAC,KAAM,WAAW,EAClB,CAAC,KAAM,OAAO,EACd,CAAC,KAAM,QAAQ,EACf,CAAC,KAAM,QAAQ,EACf,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,aAAa,EACpB,CAAC,KAAM,WAAW,EAClB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,UAAU,EACjB,CAAC,KAAM,YAAY,EACnB,CAAC,KAAM,QAAQ,EACf,CAAC,KAAM,QAAQ,EACf,CAAC,KAAM,WAAW,EAClB,CAAC,KAAM,UAAU,EACjB,CAAC,KAAM,QAAQ,EACf,CAAC,KAAM,WAAW,EAClB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,QAAQ,EACf,CAAC,KAAM,UAAU,EACjB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,UAAU,EACjB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,OAAO,EACd,CAAC,KAAM,OAAO,EACd,CAAC,KAAM,QAAQ,EACf,CAAC,KAAM,QAAQ,EACf,CAAC,KAAM,WAAW,EAClB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,UAAU,EACjB,CAAC,KAAM,YAAY,EACnB,CAAC,KAAM,OAAO,EACd,CAAC,KAAM,QAAQ,EACf,CAAC,KAAM,UAAU,EACjB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,KAAK,EACZ,CAAC,KAAM,OAAO,EACd,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,gBAAgB,EACvB,CAAC,KAAM,QAAQ,EACf,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,UAAU,EACjB,CAAC,KAAM,eAAe,EACtB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,UAAU,EACjB,CAAC,KAAM,UAAU,EACjB,CAAC,KAAM,OAAO,EACd,CAAC,MAAO,UAAU,EAClB,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,OAAO,EACd,CAAC,KAAM,SAAS,EAChB,CAAC,KAAM,UAAU,EACjB,CAAC,KAAM,WAAW,CACtB,EAGaC,GAA2B,IAAI,IAAID,EAAiB,EAEpDE,GAAmC,IAAI,IAAI,CACpD,GAAGF,GAAkB,IAAI,CAAC,CAACG,EAAGC,CAAC,IAAM,CAACA,EAAGD,CAAC,CAAC,EAEvC,CAAC,UAAW,IAAI,EAChB,CAAC,YAAa,IAAI,EAClB,CAAC,UAAW,IAAI,EAChB,CAAC,UAAW,IAAI,EAChB,CAAC,gBAAiB,IAAI,EACtB,CAAC,SAAU,IAAI,EACf,CAAC,UAAW,IAAI,EAChB,CAAC,YAAa,IAAI,EAClB,CAAC,WAAY,IAAI,EACjB,CAAC,YAAa,IAAI,EAClB,CAAC,YAAa,IAAI,CAE1B,CAAC,ECxDD,eAAeE,GAAcC,EAA+BC,EAAS,CAEjE,IAAMC,EAAO,MAAM,QAAQ,IAAI,CAC3BC,GAAaH,EAA+B,iBAAkB,GAAMC,CAAO,EAC3EE,GAAaH,EAA+B,wBAAyB,GAAMC,CAAO,CACtF,CAAC,EAGD,OAAIA,EAAQ,SAAW,OACnBC,EAAK,CAAC,EAAE,OAASD,EAAQ,QAEtBC,CACX,CAWA,SAASE,GAAWC,EAAMC,EAAO,CAC7B,IAAMC,EAAS,CAAC,EACZC,EAAO,EACX,QAAWC,KAASJ,EAAK,SAASC,CAAK,EAAG,CACtC,IAAMI,EAAYD,EAAM,CAAC,EACrBD,EAAOC,EAAM,OACbF,EAAO,KAAKF,EAAK,MAAMG,EAAMC,EAAM,KAAK,CAAC,EAEzCC,EAAU,OAAS,GACnBH,EAAO,KAAKG,CAAS,EAEzBF,EAAOC,EAAM,MAAQC,EAAU,MACnC,CACA,OAAIF,EAAOH,EAAK,QACZE,EAAO,KAAKF,EAAK,MAAMG,CAAI,CAAC,EAEzBD,CACX,CASA,SAASI,GAAcC,EAASC,EAAS,GAAM,CAE3C,GAAID,EAAQ,QAAU,OAAW,CAM7B,IAAIN,EAAQM,EAAQ,MAAM,QAAQ,aAAc,IAAI,EAGpD,OAAW,CAACE,EAAKC,CAAK,IAAKC,GACvBV,EAAQA,EAAM,WAAWQ,EAAKC,CAAK,EAGvC,OAAO,IAAI,OAAOT,EAAO,IAAI,CAEjC,SAAWM,EAAQ,SAAW,OAAW,CACrC,IAAMK,EAAUC,GAAaN,EAAQ,MAAM,EAE3C,OAAO,IAAI,OAAOC,EAASI,EAAU,IAAIA,CAAO,IAAK,IAAI,CAE7D,KACI,gBAAQ,KAAK,wBAAyBL,CAAO,EACtC,IAEf,CAOA,SAASO,GAAYC,EAAK,CACtB,OAAO,IAAI,IAAI,OAAO,QAAQA,CAAG,CAAC,CACtC,CAOA,SAASC,GAAuBC,EAAQ,CACpC,IAAMC,EAAOD,EAAO,KACpB,OAAQC,EAAK,OAAQ,CACjB,IAAK,GACD,OAAOD,EAAO,OAAO,EACzB,IAAK,GACD,GAAIC,EAAK,CAAC,IAAM,EACZ,MAAM,IAAI,MAAM,wGAAwG,EAE5H,OAAOD,EAAO,OAAO,EAAE,CAAC,EAC5B,QACI,MAAM,IAAI,MAAM,+CAA+CC,EAAK,MAAM,GAAG,CACrF,CACJ,CAOA,SAASC,GAAsBnB,EAAM,CAGjC,OAAOA,EAAK,QAAQ,OAAQ,GAAG,EAC1B,QAAQ,OAAQ,GAAG,EACnB,QAAQ,OAAQ,GAAG,EACnB,QAAQ,MAAO,GAAG,EAClB,QAAQ,QAAS,GAAG,EACpB,QAAQ,SAAU,KAAK,EACvB,QAAQ,QAAS,IAAI,EACrB,QAAQ,QAAS,IAAI,EACrB,QAAQ,SAAU,KAAK,EACvB,QAAQ,SAAU,KAAK,CAChC,CAOA,SAASoB,GAAepB,EAAM,CAC1B,OAAOA,EAAK,QAAQ,UAAW,EAAE,CACrC,CAOA,SAASqB,GAA4BrB,EAAM,CACvC,OAAOoB,GAAepB,EAAK,YAAY,CAAC,CAC5C,CAiBO,SAASsB,GAAgBC,EAAI,CAChC,OACKA,GAAM,OAAUA,GAAM,OACnBA,GAAM,OAAUA,GAAM,OACtBA,GAAM,QAAWA,GAAM,QACvBA,GAAM,QAAWA,GAAM,QACvBA,GAAM,QAAWA,GAAM,QACvBA,GAAM,QAAWA,GAAM,QACvBA,GAAM,OAAUA,GAAM,OACtBA,GAAM,QAAWA,GAAM,MAEnC,CASA,SAASC,GAASC,EAAKC,EAAeC,EAAc,CAChD,IAAMC,EAAQ,CAAC,EACXC,EAAI,EACR,KAAOA,EAAIJ,EAAI,QAAQ,CAEnB,GADAG,EAAM,KAAKH,EAAII,CAAC,CAAC,GACZH,EAAc,IAAID,EAAII,CAAC,CAAC,GAAKF,KAAkBA,EAAc,CAC9D,EAAEE,EACF,QACJ,CAEA,KAAO,EAAEA,EAAIJ,EAAI,SAAWC,EAAc,IAAID,EAAII,CAAC,CAAC,GAAKF,KAAkBA,GACnED,EAAc,IAAIE,EAAM,GAAG,EAAE,CAAC,IAAMD,IACpCC,EAAMA,EAAM,OAAS,CAAC,GAAKH,EAAII,CAAC,EAG5C,CAEA,OAAOD,CACX,CAOA,SAASE,GAAiB9B,EAAM,CAC5B,OAAOA,EAAK,MAAM,MAAM,GAAK,CAAC,CAClC,CAEA,IAAM+B,GAAoB,qEACpBC,GAAyB,IAAI,OAAO,KAAKD,EAAiB,MAAO,IAAI,EACrEE,GAAoB,iDAGpBtB,GAAwB,IAAI,IAAI,CAGlC,CAAC,+BAAgC,uDAAuD,EACxF,CAAC,uBAAwB,oDAAoD,EAG7E,CAAC,0BAA2B,wBAAwB,EACpD,CAAC,uBAAwB,qBAAqB,EAI9C,CAAC,aAAasB,EAAiB,OAAQ,UAAUA,EAAiB,IAAI,CAC1E,CAAC,EASKC,GAAN,KAAiB,CAYb,YAAYC,EAAQ,CAChB,KAAK,QAAUA,EAAO,QACtB,KAAK,GAAKA,EAAO,GACjB,KAAK,YAAcA,EAAO,aAAe,GACzC,KAAK,OAASA,EAAO,QAAU,GAC/B,KAAK,OAASA,EAAO,QAAU,GAC/B,KAAK,QAAUA,EAAO,SAAW,GACjC,KAAK,WAAaA,EAAO,YAAc,IAC3C,CACJ,EAOaC,GAAN,cAA6BC,EAAS,CAKzC,YAAYF,EAAQ,CAChB,MAAM,EACN,KAAK,OAASA,EAGd,KAAK,MAAQ,CAAC,EAMd,KAAK,cAAgB,IAAI,IAEzB,KAAK,aAAe,OACpB,KAAK,UAAY,OACjB,KAAK,mBAAqB,OAG1B,KAAK,SAAW,KAAK,OAAO,UAAY,EAC5C,CASA,OAAO,WAAWA,KAAWG,EAAM,CAC/B,OAAQH,EAAO,KAAM,CACjB,IAAK,YACD,OAAO,IAAII,GAAmBJ,CAAM,EACxC,IAAK,UAED,OAAO,IAAIK,GAAQL,EAAQ,GAAGG,CAAI,EACtC,IAAK,MACD,OAAO,IAAIG,GAAIN,CAAM,EAEzB,QAGI,GAAIA,EAAO,MACP,OAAI,MAAM,QAAQA,EAAO,KAAK,EAGnB,IAAIK,GAAQL,EAAQ,GAAGG,CAAI,EAC3B,OAAO,OAAOH,EAAQ,2BAA2B,GAAK,OAAO,OAAOA,EAAQ,WAAW,EAC1F,OAAO,OAAOA,EAAQ,QAAQ,EACvB,IAAIM,GAAIN,CAAM,EAEd,IAAII,GAAmBJ,CAAM,EAIjC,IAAIO,GAAqBP,EAAQ,GAAGG,CAAI,EAGvD,MAAM,IAAI,MAAM,gCAAgCH,EAAO,IAAI,EAAE,CACrE,CACJ,CAOA,MAAMQ,EAAQ,CACV,OAAAA,EAAS,KAAK,OAAOA,CAAM,EACvB,KAAK,WAELA,EAASnB,GAASmB,EAAQ,KAAK,cAAe,KAAK,YAAY,GAE5DA,CACX,CAQA,OAAOA,EAAQ,CACX,MAAM,MAAM,2CAA2C,CAC3D,CAOA,sBAAsBA,EAAQ,CAC1B,OAAOA,EAAO,IAAIC,GAAK,KAAK,cAAc,IAAIA,CAAC,GAAK,KAAK,YAAY,CACzE,CAOA,sBAAsBC,EAAK,CACvB,OAAOA,EAAI,IAAIhB,GAAK,KAAK,MAAMA,CAAC,GAAK,KAAK,SAAS,CACvD,CACJ,EAMMU,GAAN,cAAiCH,EAAe,CAQ5C,YAAYD,EAAQ,CAChB,MAAMA,CAAM,EAKZ,KAAK,cAAgBrB,GAAYqB,EAAO,KAAK,EAM7C,KAAK,aAAe,KAAK,cAAc,IAAIA,EAAO,SAAS,EAM3D,KAAK,UAAYA,EAAO,UAMxB,KAAK,yBAA2BA,EAAO,0BAA4B,IAMnE,KAAK,MAAQ,IAAI,MAAM,KAAK,cAAc,IAAI,EAC9C,OAAW,CAAC1B,EAAKC,CAAK,IAAK,KAAK,cAC5B,KAAK,MAAMA,CAAK,EAAID,CAE5B,CAOA,OAAOkC,EAAQ,CACX,IAAMG,EAAe,CAAC,EACtB,QAAWC,KAASJ,EAAQ,CACxB,IAAMK,EAAQ,CAAC,GAAGD,CAAK,EACvB,GAAIC,EAAM,OAAS,KAAK,yBAA0B,CAC9CF,EAAa,KAAK,KAAK,SAAS,EAChC,QACJ,CAEA,IAAIG,EAAY,GACZC,EAAQ,EACNC,EAAY,CAAC,EAEnB,KAAOD,EAAQF,EAAM,QAAQ,CACzB,IAAII,EAAMJ,EAAM,OACZK,EAAmB,KACvB,KAAOH,EAAQE,GAAK,CAChB,IAAIE,EAASN,EAAM,MAAME,EAAOE,CAAG,EAAE,KAAK,EAAE,EAK5C,GAHIF,EAAQ,IACRI,EAAS,KAAK,OAAO,0BAA4BA,GAEjD,KAAK,cAAc,IAAIA,CAAM,EAAG,CAChCD,EAAmBC,EACnB,KACJ,CAEA,EAAEF,CACN,CACA,GAAIC,IAAqB,KAAM,CAC3BJ,EAAY,GACZ,KACJ,CACAE,EAAU,KAAKE,CAAgB,EAC/BH,EAAQE,CACZ,CACIH,EACAH,EAAa,KAAK,KAAK,SAAS,EAEhCA,EAAa,KAAK,GAAGK,CAAS,CAEtC,CAEA,OAAOL,CACX,CAEJ,EAMMN,GAAN,cAAsBJ,EAAe,CAQjC,YAAYD,EAAQoB,EAAY,CAC5B,MAAMpB,CAAM,EAEZ,IAAMqB,EAAYrB,EAAO,MAAM,OAC/B,KAAK,MAAQ,IAAI,MAAMqB,CAAS,EAEhC,KAAK,OAAS,IAAI,MAAMA,CAAS,EACjC,QAAS3B,EAAI,EAAGA,EAAI2B,EAAW,EAAE3B,EAC7B,CAAC,KAAK,MAAMA,CAAC,EAAG,KAAK,OAAOA,CAAC,CAAC,EAAIM,EAAO,MAAMN,CAAC,EAGpD,KAAK,aAAeM,EAAO,OAC3B,KAAK,UAAY,KAAK,MAAMA,EAAO,MAAM,EAEzC,KAAK,cAAgB,IAAI,IAAI,KAAK,MAAM,IAAI,CAACsB,EAAG5B,IAAM,CAAC4B,EAAG5B,CAAC,CAAC,CAAC,EAC7D,KAAK,UAAY,IAEjB,KAAK,aAAe,KAAK,cAAc,IAAI,KAAK,SAAS,EACzD,KAAK,UAAY0B,EAAW,UAE5B,KAAK,aAAe,KAAK,cAAc,IAAI,KAAK,SAAS,EACzD,KAAK,UAAY,KAAK,MAAM,KAAK,YAAY,EAE7C,KAAK,SAAWG,GAAI,KAAK,MAAM,EAAE,CAAC,EAElC,KAAK,UAAY,KAAK,SAAW,GACjC,KAAK,OAAO,KAAK,YAAY,EAAI,KAAK,UAEtC,KAAK,KAAO,IAAIC,GAChB,KAAK,KAAK,OAAO,KAAK,KAAK,EAI3B,KAAK,SAAW,EACpB,CAMA,cAAcC,EAAS,CACnB,IAAMZ,EAAQY,EAAQ,MAChBC,EAAQ,EACVC,EAAW,EACf,KAAOA,EAAWd,EAAM,QAAQ,CAC5B,IAAIe,EAAgB,GAEdpB,EAAS,CAAC,EACVqB,EAAShB,EAAM,MAAMc,CAAQ,EAAE,KAAK,EAAE,EACtCG,EAAiB,KAAK,KAAK,mBAAmBD,CAAM,EAC1D,QAAWjB,KAASkB,EAAgB,CAChCtB,EAAO,KAAKI,CAAK,EACjB,IAAMmB,EAAU,KAAK,cAAc,IAAInB,CAAK,EACtCoB,EAAa,KAAK,OAAOD,CAAO,EAChCE,EAAIC,GAAItB,CAAK,EACnBa,EAAQ,OAAOE,EAAUM,EAAGD,EAAYD,CAAO,EAC3C,CAACH,GAAiBK,IAAMP,IACxBE,EAAgB,GAExB,CACKA,GACDH,EAAQ,OAAOE,EAAUD,EAAO,KAAK,UAAW,KAAK,YAAY,EAErEC,GAAYD,CAChB,CACJ,CAQA,SAASS,EAAY,CACjB,IAAMV,EAAU,IAAIW,GAAaD,EAAY,KAAK,aAAc,KAAK,YAAY,EACjF,YAAK,cAAcV,CAAO,EACnBA,EAAQ,OAAO,CAC1B,CAOA,OAAOjB,EAAQ,CACX,IAAM6B,EAAW,CAAC,EAClB,QAAWzB,KAASJ,EAAQ,CACxB,IAAM8B,EAAY,KAAK,SAAS1B,CAAK,EACrCyB,EAAS,KAAK,GAAGC,CAAS,CAC9B,CACA,OAAOD,CACX,CAEJ,EAOME,IAAoB,IAAM,CAK5B,IAAMC,EAAK,CACP,GAAG,MAAM,KAAK,CAAE,OAAQ,EAA0C,EAAG,CAACC,EAAG/C,IAAMA,EAAI,EAAiB,EACpG,GAAG,MAAM,KAAK,CAAE,OAAQ,EAA0C,EAAG,CAAC+C,EAAG/C,IAAMA,EAAI,GAAiB,EACpG,GAAG,MAAM,KAAK,CAAE,OAAQ,EAA0C,EAAG,CAAC+C,EAAG/C,IAAMA,EAAI,GAAiB,CACxG,EACMgD,EAAKF,EAAG,MAAM,EAChBP,EAAI,EACR,QAASU,EAAI,EAAGA,EAAI,IAAK,EAAEA,EAClBH,EAAG,SAASG,CAAC,IACdH,EAAG,KAAKG,CAAC,EACTD,EAAG,KAAK,IAAMT,CAAC,EACfA,GAAK,GAGb,IAAMW,EAAMF,EAAG,IAAIT,GAAK,OAAO,aAAaA,CAAC,CAAC,EAC9C,OAAO,OAAO,YAAYO,EAAG,IAAI,CAACG,EAAGjD,IAAM,CAACiD,EAAGC,EAAIlD,CAAC,CAAC,CAAC,CAAC,CAC3D,GAAG,EAEGmD,GAAmBC,GAAkBP,EAAgB,EAgBrDjC,GAAN,cAAkBL,EAAe,CAY7B,YAAYD,EAAQ,CAChB,MAAMA,CAAM,EAGZ,KAAK,cAAgBrB,GAAYqB,EAAO,KAAK,EAE7C,KAAK,aAAe,KAAK,cAAc,IAAIA,EAAO,SAAS,EAC3D,KAAK,UAAYA,EAAO,UAExB,KAAK,MAAQ,IAAI,MAAM,KAAK,cAAc,IAAI,EAC9C,OAAW,CAAC1B,EAAKC,CAAK,IAAK,KAAK,cAC5B,KAAK,MAAMA,CAAK,EAAID,EAKxB,IAAMyE,EAAuB,MAAM,QAAQ/C,EAAO,OAAO,CAAC,CAAC,EAG3D,KAAK,OAAS+C,EAC0B/C,EAAO,OAChBA,EAAO,OAAS,IAAIsB,GAAqCA,EAAE,MAAM,IAAK,CAAC,CAAE,EACxG,KAAK,UAAY,IAAI,IAAI,KAAK,OAAO,IAAI,CAACA,EAAG5B,IAAM,CAAC,KAAK,UAAU4B,CAAC,EAAG5B,CAAC,CAAC,CAAC,EAE1E,KAAK,mBAAqBM,EAAO,mBAGjC,KAAK,0BAA4BA,EAAO,2BAA6B,KAErE,KAAK,cAAgB,KAAK,OAAO,eAAiB,GAE9C,KAAK,gBACL,KAAK,aAAe,IAAI,aAG5B,KAAK,cAAgB,KAAK,OAAO,eAAiB,GAMlD,KAAK,oBAAsB,IAK3B,KAAK,eAAiB,IACtB,KAAK,MAAQ,IAAIgD,GAAS,KAAK,cAAc,CACjD,CAKA,aAAc,CACV,KAAK,MAAM,MAAM,CACrB,CAQA,IAAIpC,EAAO,CACP,GAAIA,EAAM,SAAW,EACjB,MAAO,CAAC,EAGZ,IAAMqC,EAAS,KAAK,MAAM,IAAIrC,CAAK,EACnC,GAAIqC,IAAW,OACX,OAAOA,EAGX,IAAMC,EAAO,MAAM,KAAKtC,CAAK,EACzB,KAAK,qBACLsC,EAAKA,EAAK,OAAS,CAAC,GAAK,KAAK,oBAGlC,IAAInF,EAAS,CAAC,EACd,GAAImF,EAAK,OAAS,EAAG,CAGjB,IAAMC,EAAQ,IAAIC,GAAc,CAACC,EAAGV,IAAMU,EAAE,MAAQV,EAAE,KAAK,EAKvDW,EAAe,CACf,MAAOJ,EAAK,CAAC,EACb,KAAM,EACN,KAAM,KACN,KAAM,IACV,EAEIK,EAAeD,EACnB,QAAS5D,EAAI,EAAGA,EAAIwD,EAAK,OAAQ,EAAExD,EAAG,CAClC,IAAM8D,EAAc,CAChB,KAAM9D,EAAIwD,EAAK,OACf,MAAOA,EAAKxD,CAAC,EACb,KAAM6D,EACN,KAAM,IACV,EACAA,EAAa,KAAOC,EACpB,KAAK,UAAUL,EAAOI,CAAY,EAClCA,EAAeC,CACnB,CAEA,KAAO,CAACL,EAAM,QAAQ,GAAG,CAErB,IAAMM,EAAON,EAAM,IAAI,EAGvB,GAAIM,EAAK,SAAW,CAACA,EAAK,MAAQA,EAAK,KAAK,QAAS,SAQrD,GAJAA,EAAK,QAAU,GACfA,EAAK,KAAK,QAAU,GAGhBA,EAAK,KAAM,CAGX,IAAMC,EAAkB,CAAE,GAAGD,EAAK,IAAK,EAIvCA,EAAK,KAAK,QAAU,GACpBA,EAAK,KAAOC,EAGRA,EAAgB,KAChBA,EAAgB,KAAK,KAAOA,EAI5BJ,EAAeI,CAEvB,CAGA,IAAMC,EAAS,CACX,MAAOF,EAAK,MAAQA,EAAK,KAAK,MAC9B,KAAMA,EAAK,KACX,KAAMA,EAAK,KACX,KAAMA,EAAK,KAAK,IACpB,EAIIE,EAAO,MACPA,EAAO,KAAK,KAAOA,EACnB,KAAK,UAAUR,EAAOQ,EAAO,IAAI,GAGjCL,EAAeK,EAIfA,EAAO,OACPA,EAAO,KAAK,KAAOA,EACnB,KAAK,UAAUR,EAAOQ,CAAM,EAEpC,CAGA,QAASH,EAAcF,EAAcE,IAAgB,KAAMA,EAAcA,EAAY,KACjFzF,EAAO,KAAKyF,EAAY,KAAK,CAErC,MACIzF,EAASmF,EAIb,GAAI,KAAK,0BAEL,QAASxD,EAAI,EAAGA,EAAI3B,EAAO,OAAS,EAAG,EAAE2B,EACrC3B,EAAO2B,CAAC,GAAK,KAAK,0BAI1B,OAAIkB,EAAM,OAAS,KAAK,qBAEpB,KAAK,MAAM,IAAIA,EAAO7C,CAAM,EAGzBA,CACX,CASA,UAAUoF,EAAOM,EAAM,CAInB,IAAMG,EAAO,KAAK,UAAU,IAAI,KAAK,UAAU,CAACH,EAAK,MAAOA,EAAK,KAAK,KAAK,CAAC,CAAC,EACzEG,IAAS,SACTH,EAAK,MAAQG,EAAOH,EAAK,KACzBN,EAAM,KAAKM,CAAI,EAEvB,CAOA,OAAOjD,EAAQ,CACX,IAAMG,EAAe,CAAC,EAEtB,QAAWC,KAASJ,EAAQ,CACxB,GAAI,KAAK,eAAiB,KAAK,cAAc,IAAII,CAAK,EAAG,CACrDD,EAAa,KAAKC,CAAK,EACvB,QACJ,CACA,IAAMiD,EAAiB,KAAK,IAAIjD,CAAK,EAErC,QAAWH,KAAKoD,EACZ,GAAI,KAAK,cAAc,IAAIpD,CAAC,EACxBE,EAAa,KAAKF,CAAC,UACZ,KAAK,cAAe,CAC3B,IAAMqD,EAAa,MAAM,KAAK,KAAK,aAAa,OAAOrD,CAAC,CAAC,EACpD,IAAIa,GAAK,MAAMA,EAAE,SAAS,EAAE,EAAE,YAAY,EAAE,SAAS,EAAG,GAAG,CAAC,GAAG,EAChEwC,EAAW,MAAMxC,GAAK,KAAK,cAAc,IAAIA,CAAC,CAAC,EAI/CX,EAAa,KAAK,GAAGmD,CAAU,EAE/BnD,EAAa,KAAK,KAAK,SAAS,CAExC,MACIA,EAAa,KAAK,KAAK,SAAS,CAG5C,CAEA,OAAOA,CACX,CAEJ,EAKMJ,GAAN,cAAmCN,EAAe,CAO9C,YAAYD,EAAQoB,EAAY,CAC5B,MAAMpB,CAAM,EAGZ,KAAK,cAAgBrB,GACjByC,EAAW,YACLpB,EAAO,MAAMoB,EAAW,WAAW,EACnCpB,EAAO,KACjB,EAEA,KAAK,UAAYoB,EAAW,UAC5B,KAAK,aAAe,KAAK,cAAc,IAAI,KAAK,SAAS,EAEzD,KAAK,UAAYA,EAAW,UAC5B,KAAK,aAAe,KAAK,cAAc,IAAI,KAAK,SAAS,EAEzD,KAAK,UAAYA,EAAW,UAC5B,KAAK,aAAe,KAAK,cAAc,IAAI,KAAK,SAAS,EAEzD,KAAK,UAAYA,EAAW,UAC5B,KAAK,aAAe,KAAK,cAAc,IAAI,KAAK,SAAS,EAEzD,KAAK,MAAQ,IAAI,MAAM,KAAK,cAAc,IAAI,EAC9C,OAAW,CAAC9C,EAAKC,CAAK,IAAK,KAAK,cAC5B,KAAK,MAAMA,CAAK,EAAID,CAE5B,CAEA,OAAOkC,EAAQ,CACX,OAAOA,CACX,CACJ,EAOMuD,GAAN,cAAyB7D,EAAS,CAI9B,YAAYF,EAAQ,CAChB,MAAM,EACN,KAAK,OAASA,CAClB,CASA,OAAO,WAAWA,EAAQ,CACtB,GAAIA,IAAW,KAAM,OAAO,KAC5B,OAAQA,EAAO,KAAM,CACjB,IAAK,iBACD,OAAO,IAAIgE,GAAehE,CAAM,EACpC,IAAK,cACD,OAAO,IAAIiE,GAAYjE,CAAM,EACjC,IAAK,WACD,OAAO,IAAIkE,GAAmBlE,CAAM,EACxC,IAAK,UACD,OAAO,IAAImE,GAAQnE,CAAM,EAC7B,IAAK,MACD,OAAO,IAAIoE,GAAIpE,CAAM,EACzB,IAAK,MACD,OAAO,IAAIqE,GAAIrE,CAAM,EACzB,IAAK,OACD,OAAO,IAAIsE,GAAKtE,CAAM,EAC1B,IAAK,OACD,OAAO,IAAIuE,GAAKvE,CAAM,EAC1B,IAAK,QACD,OAAO,IAAIwE,GAAgBxE,CAAM,EACrC,IAAK,eACD,OAAO,IAAIyE,GAAazE,CAAM,EAClC,IAAK,YACD,OAAO,IAAI0E,GAAU1E,CAAM,EAC/B,IAAK,UACD,OAAO,IAAI2E,GAAQ3E,CAAM,EAC7B,QACI,MAAM,IAAI,MAAM,4BAA4BA,EAAO,IAAI,EAAE,CACjE,CACJ,CASA,UAAUnC,EAAM,CACZ,MAAM,MAAM,8CAA8C,CAC9D,CAOA,MAAMA,EAAM,CACR,OAAO,KAAK,UAAUA,CAAI,CAC9B,CAEJ,EAMMsG,GAAN,cAAsBJ,EAAW,CAM7B,UAAUlG,EAAM,CACZ,IAAMO,EAAUD,GAAc,KAAK,OAAO,OAAO,EACjD,OAAOC,IAAY,KACbP,EACAA,EAAK,WAAWO,EAAS,KAAK,OAAO,OAAO,CACtD,CACJ,EAOMwG,GAAN,cAAgCb,EAAW,CAKvC,KAAO,OAOP,UAAUlG,EAAM,CACZ,OAAAA,EAAOA,EAAK,UAAU,KAAK,IAAI,EACxBA,CACX,CACJ,EAOMuG,GAAN,cAAkBQ,EAAkB,CAChC,KAAO,KACX,EAOMP,GAAN,cAAkBO,EAAkB,CAChC,KAAO,KACX,EAOMN,GAAN,cAAmBM,EAAkB,CACjC,KAAO,MACX,EAOML,GAAN,cAAmBK,EAAkB,CACjC,KAAO,MACX,EAKMJ,GAAN,cAA8BT,EAAW,CAMrC,UAAUlG,EAAM,CACZ,OAAI,KAAK,OAAO,YAAc,KAAK,OAAO,YAEtCA,EAAOA,EAAK,KAAK,GAEb,KAAK,OAAO,aACZA,EAAOA,EAAK,UAAU,GAEtB,KAAK,OAAO,cACZA,EAAOA,EAAK,QAAQ,IAGrBA,CACX,CACJ,EAMM4G,GAAN,cAA2BV,EAAW,CAMlC,UAAUlG,EAAM,CACZ,OAAAA,EAAOoB,GAAepB,CAAI,EACnBA,CACX,CACJ,EAMM6G,GAAN,cAAwBX,EAAW,CAM/B,UAAUlG,EAAM,CACZ,OAAAA,EAAOA,EAAK,YAAY,EACjBA,CACX,CACJ,EAMM8G,GAAN,cAAsBZ,EAAW,CAM7B,UAAUlG,EAAM,CACZ,OAAAA,EAAO,KAAK,OAAO,QAAUA,EACtBA,CACX,CACJ,EAMMqG,GAAN,cAAiCH,EAAW,CAMxC,YAAY/D,EAAQ,CAChB,MAAMA,CAAM,EACZ,KAAK,YAAcA,EAAO,YAAY,IAAIsB,GAAKyC,GAAW,WAAWzC,CAAC,CAAC,CAC3E,CAMA,UAAUzD,EAAM,CACZ,OAAO,KAAK,YAAY,OAAO,CAAC4C,EAAGoE,IACxBA,EAAW,UAAUpE,CAAC,EAC9B5C,CAAI,CACX,CACJ,EAMMmG,GAAN,cAA6BD,EAAW,CAOpC,wBAAwBlG,EAAM,CAE1B,IAAMiH,EAAS,CAAC,EAChB,QAASpF,EAAI,EAAGA,EAAI7B,EAAK,OAAQ,EAAE6B,EAAG,CAClC,IAAMqF,EAAOlH,EAAK6B,CAAC,EACbN,EAAK2F,EAAK,WAAW,CAAC,EACxB5F,GAAgBC,CAAE,GAClB0F,EAAO,KAAK,GAAG,EACfA,EAAO,KAAKC,CAAI,EAChBD,EAAO,KAAK,GAAG,GAEfA,EAAO,KAAKC,CAAI,CAExB,CACA,OAAOD,EAAO,KAAK,EAAE,CACzB,CAOA,aAAajH,EAAM,CAEf,OAAOA,EAAK,UAAU,KAAK,EAAE,QAAQ,WAAY,EAAE,CACvD,CASA,YAAYkH,EAAM,CACd,OAAQA,EAAM,CACV,IAAK,IACL,IAAK;AAAA,EACL,IAAK,KAED,MAAO,GAEX,QAMI,MAAO,iCAAiC,KAAKA,CAAI,CACzD,CACJ,CAQA,YAAYlH,EAAM,CACd,IAAMiH,EAAS,CAAC,EAChB,QAAWC,KAAQlH,EAAM,CACrB,IAAMuB,EAAK2F,EAAK,WAAW,CAAC,EACxB3F,IAAO,GAAKA,IAAO,OAAU,KAAK,YAAY2F,CAAI,IAGlD,OAAO,KAAKA,CAAI,EAChBD,EAAO,KAAK,GAAG,EAEfA,EAAO,KAAKC,CAAI,EAExB,CACA,OAAOD,EAAO,KAAK,EAAE,CACzB,CAMA,UAAUjH,EAAM,CACZ,OAAI,KAAK,OAAO,aACZA,EAAO,KAAK,YAAYA,CAAI,GAG5B,KAAK,OAAO,uBACZA,EAAO,KAAK,wBAAwBA,CAAI,GAGxC,KAAK,OAAO,WACZA,EAAOA,EAAK,YAAY,EAEpB,KAAK,OAAO,gBAAkB,KAC9BA,EAAO,KAAK,aAAaA,CAAI,IAE1B,KAAK,OAAO,gBACnBA,EAAO,KAAK,aAAaA,CAAI,GAG1BA,CACX,CACJ,EAOMmH,GAAN,cAA2B9E,EAAS,CAShC,OAAO,WAAWF,EAAQ,CACtB,GAAIA,IAAW,KAAM,OAAO,KAE5B,OAAQA,EAAO,KAAM,CACjB,IAAK,mBACD,OAAO,IAAIiF,GAAiBjF,CAAM,EACtC,IAAK,WACD,OAAO,IAAIkF,GAAqBlF,CAAM,EAC1C,IAAK,aACD,OAAO,IAAImF,GAAuBnF,CAAM,EAC5C,IAAK,kBACD,OAAO,IAAIoF,GAAgBpF,CAAM,EACrC,IAAK,YACD,OAAO,IAAIqF,GAAsBrF,CAAM,EAE3C,IAAK,YACD,OAAO,IAAIsF,GAAsBtF,CAAM,EAC3C,IAAK,QACD,OAAO,IAAIuF,GAAkBvF,CAAM,EACvC,IAAK,cACD,OAAO,IAAIwF,GAAwBxF,CAAM,EAC7C,IAAK,SACD,OAAO,IAAIyF,GAAmBzF,CAAM,EACxC,IAAK,UACD,OAAO,IAAI0F,GAAoB1F,CAAM,EACzC,IAAK,cACD,OAAO,IAAI2F,GAAwB3F,CAAM,EAC7C,QACI,MAAM,IAAI,MAAM,8BAA8BA,EAAO,IAAI,EAAE,CACnE,CACJ,CAWA,kBAAkBnC,EAAMJ,EAAS,CAC7B,MAAM,MAAM,sDAAsD,CACtE,CAQA,aAAaI,EAAMJ,EAAS,CACxB,OAAQ,MAAM,QAAQI,CAAI,EACpBA,EAAK,IAAIyD,GAAK,KAAK,kBAAkBA,EAAG7D,CAAO,CAAC,EAChD,KAAK,kBAAkBI,EAAMJ,CAAO,GACxC,KAAK,CACX,CAQA,MAAMI,EAAMJ,EAAS,CACjB,OAAO,KAAK,aAAaI,EAAMJ,CAAO,CAC1C,CACJ,EAKMwH,GAAN,cAA+BD,EAAa,CAOxC,YAAYhF,EAAQ,CAChB,MAAM,EAIN,KAAK,QAAU,IAAI,OAAO,QAAQJ,EAAiB,OAAOA,EAAiB,IAAK,IAAI,CACxF,CAQA,kBAAkB/B,EAAMJ,EAAS,CAC7B,OAAOI,EAAK,KAAK,EAAE,MAAM,KAAK,OAAO,GAAK,CAAC,CAC/C,CACJ,EAMMyH,GAAN,cAAoCN,EAAa,CAK7C,YAAYhF,EAAQ,CAChB,MAAM,EACN,KAAK,OAASA,EAMd,KAAK,iBAAmB,KAAK,OAAO,iBAOpC,KAAK,aAAe,KAAK,OAAO,aAMhC,KAAK,UAAY,KAAK,OAAO,WAAa,GAC1C,KAAK,QAAU,+EAEf,KAAK,aAAeuC,GACpB,KAAK,aAAe,IAAI,WAC5B,CAQA,kBAAkB1E,EAAMJ,EAAS,CAE7B,OAAI,KAAK,kBAAoB,CAACI,EAAK,WAAW,GAAG,IAC7CA,EAAO,IAAMA,IAIF,KAAK,UAAaA,EAAK,MAAM,KAAK,OAAO,GAAK,CAAC,EAAK,CAACA,CAAI,GAG1D,IACV+C,GAAS,MAAM,KAAK,KAAK,aAAa,OAAOA,CAAK,EAAGgF,GAAQ,KAAK,aAAaA,CAAI,CAAC,EAAE,KAAK,EAAE,CACjG,CACJ,CACJ,EAUML,GAAN,cAAgCP,EAAa,CASzC,YAAYhF,EAAQ,CAChB,MAAM,EACN,KAAK,OAASA,EAGd,KAAK,QAAU7B,GAAc,KAAK,OAAO,QAAS,KAAK,OAAO,MAAM,CACxE,CAQA,kBAAkBN,EAAMJ,EAAS,CAC7B,OAAI,KAAK,UAAY,KACV,CAAC,EAGR,KAAK,OAAO,OACLI,EAAK,MAAM,KAAK,OAAO,GAAK,CAAC,EAC7B,KAAK,OAAO,UAAU,YAAY,IAAM,UACxCA,EAAK,MAAM,KAAK,OAAO,EAAE,OAAOyD,GAAKA,CAAC,EAEtC1D,GAAWC,EAAM,KAAK,OAAO,CAE5C,CACJ,EAMM2H,GAAN,cAAsCR,EAAa,CAK/C,YAAYhF,EAAQ,CAChB,MAAM,EACN,KAAK,OAASA,EACd,KAAK,QAAU,IAAI,OAAO,KAAKJ,EAAiB,OAAOA,EAAiB,KAAM,IAAI,CACtF,CAQA,kBAAkB/B,EAAMJ,EAAS,CAC7B,OAAOI,EAAK,MAAM,KAAK,OAAO,GAAK,CAAC,CACxC,CACJ,EAOM4H,GAAN,cAAiCT,EAAa,CAK1C,YAAYhF,EAAQ,CAChB,MAAM,EACN,KAAK,OAASA,EAGd,IAAM6F,EAAgB,cAAc,KAAK,OAAO,kBAAoB,GAAK,GAAG,GAC5E,KAAK,QAAU,IAAI,OAAOA,EAAe,IAAI,CACjD,CAQA,kBAAkBhI,EAAMJ,EAAS,CAC7B,OAAOI,EAAK,MAAM,KAAK,OAAO,GAAK,CAAC,CACxC,CACJ,EAoBMiI,GAAN,cAA4B5F,EAAS,CAKjC,YAAYF,EAAQ,CAChB,MAAM,EACN,KAAK,OAASA,CAClB,CASA,OAAO,WAAWA,EAAQ,CACtB,GAAIA,IAAW,KAAM,OAAO,KAC5B,OAAQA,EAAO,KAAM,CACjB,IAAK,qBACD,OAAO,IAAI+F,GAAmB/F,CAAM,EAExC,IAAK,YACD,OAAO,IAAIgG,GAAuBhG,CAAM,EAE5C,IAAK,oBACD,OAAO,IAAIiG,GAAkBjG,CAAM,EACvC,IAAK,iBACD,OAAO,IAAIkG,GAAelG,CAAM,EAEpC,IAAK,WACD,OAAO,IAAImG,GAAsBnG,CAAM,EAC3C,QACI,MAAM,IAAI,MAAM,+BAA+BA,EAAO,IAAI,EAAE,CACpE,CACJ,CAUA,aAAaQ,KAAWL,EAAM,CAC1B,MAAM,MAAM,iDAAiD,CACjE,CAQA,MAAMK,KAAWL,EAAM,CACnB,OAAO,KAAK,aAAaK,EAAQ,GAAGL,CAAI,CAC5C,CACJ,EAKM+F,GAAN,cAA6BJ,EAAc,CAMvC,YAAY9F,EAAQ,CAChB,MAAMA,CAAM,EAGZ,KAAK,IAAMA,EAAO,IAAI,CAAC,EACvB,KAAK,IAAMA,EAAO,IAAI,CAAC,CAC3B,CAQA,aAAaQ,EAAQ4F,EAAc,KAAM,CACrC,mBAAAC,EAAqB,EACzB,EAAI,CAAC,EAAG,CACAA,IACA7F,EAAS8F,GAAY,CAAC,KAAK,GAAG,EAAG9F,EAAQ,CAAC,KAAK,GAAG,CAAC,GAGvD,IAAI+F,EAAiB,IAAI,MAAM/F,EAAO,MAAM,EAAE,KAAK,CAAC,EACpD,GAAI4F,IAAgB,KAAM,CAGtB,IAAMI,EAAUH,GAAsB,gBAAgBJ,GAChD,CAAC,KAAK,GAAG,EACT,CAAC,EACDQ,EAAQJ,EAAqB,CAAC,KAAK,GAAG,EAAI,CAAC,EAEjD7F,EAAS8F,GAAY9F,EAAQgG,EAAQJ,EAAaK,CAAK,EACvDF,EAAiBD,GAAYC,EAAgB,IAAI,MAAMH,EAAY,OAASI,EAAO,OAASC,EAAM,MAAM,EAAE,KAAK,CAAC,CAAC,CACrH,CACA,MAAO,CAAE,OAAAjG,EAAQ,eAAA+F,CAAe,CACpC,CACJ,EACMN,GAAN,cAAgCC,EAAe,CAAE,EAM3CH,GAAN,cAAiCD,EAAc,CAO3C,YAAY9F,EAAQ,CAChB,MAAMA,CAAM,EAEZ,KAAK,OAASA,EAAO,OACrB,KAAK,KAAOA,EAAO,IACvB,CAQA,aAAaQ,EAAQ4F,EAAc,KAAM,CACrC,mBAAAC,EAAqB,EACzB,EAAI,CAAC,EAAG,CACJ,IAAMK,EAAON,IAAgB,KAAO,KAAK,OAAS,KAAK,KAEnDO,EAAkB,CAAC,EACnBC,EAAQ,CAAC,EACb,QAAWC,KAAQH,EACX,iBAAkBG,EACdR,IACAM,EAAgB,KAAKE,EAAK,aAAa,EAAE,EACzCD,EAAM,KAAKC,EAAK,aAAa,OAAO,GAEjC,aAAcA,IACjBA,EAAK,SAAS,KAAO,KACrBF,EAAkBL,GAAYK,EAAiBnG,CAAM,EACrDoG,EAAQN,GAAYM,EAAO,IAAI,MAAMpG,EAAO,MAAM,EAAE,KAAKqG,EAAK,SAAS,OAAO,CAAC,GAExEA,EAAK,SAAS,KAAO,MAC5BF,EAAkBL,GAAYK,EAAiBP,CAAW,EAC1DQ,EAAQN,GAAYM,EAAO,IAAI,MAAMR,EAAY,MAAM,EAAE,KAAKS,EAAK,SAAS,OAAO,CAAC,IAIhG,MAAO,CAAE,OAAQF,EAAiB,eAAgBC,CAAM,CAC5D,CACJ,EAMMZ,GAAN,cAAqCF,EAAc,CAO/C,aAAatF,EAAQ4F,EAAc,KAAM,CACrC,OAAIA,IACA5F,EAAS8F,GAAY9F,EAAQ4F,CAAW,GAErC,CAAE,OAAA5F,CAAO,CACpB,CACJ,EAMM2F,GAAN,cAAoCL,EAAc,CAO9C,YAAY9F,EAAQ,CAChB,MAAMA,CAAM,EAEZ,KAAK,WAAaA,EAAO,WAAW,IAAIsB,GAAKwE,GAAc,WAAWxE,CAAC,CAAC,CAC5E,CAQA,aAAad,EAAQ4F,EAAc,KAAM3I,EAAU,CAAC,EAAG,CACnD,IAAI8I,EACJ,QAAWO,KAAa,KAAK,WACzB,GAAIA,aAAqBd,GAGrBxF,EADesG,EAAU,aAAatG,CAAM,EAC5B,OACZ4F,IAEAA,EADoBU,EAAU,aAAaV,CAAW,EAC5B,YAE3B,CACH,IAAMtB,EAASgC,EAAU,aAAatG,EAAQ4F,EAAa3I,CAAO,EAClE+C,EAASsE,EAAO,OAChByB,EAAiBzB,EAAO,cAC5B,CAEJ,MAAO,CAAE,OAAAtE,EAAQ,eAAA+F,CAAe,CACpC,CACJ,EAMMQ,GAAN,cAAsB7G,EAAS,CAO3B,YAAYF,EAAQ,CAChB,MAAM,EACN,KAAK,OAASA,EAGd,KAAK,aAAe,CAAC,EACrB,KAAK,mBAAqB,KAC1B,KAAK,aAAeA,EAAO,YAC/B,CASA,OAAO,WAAWA,EAAQ,CACtB,GAAIA,IAAW,KAAM,OAAO,KAC5B,OAAQA,EAAO,KAAM,CACjB,IAAK,YACD,OAAO,IAAIgH,GAAiBhH,CAAM,EACtC,IAAK,YACD,OAAO,IAAIiH,GAAiBjH,CAAM,EACtC,IAAK,YACD,OAAO,IAAIkH,GAAiBlH,CAAM,EAEtC,IAAK,UACD,OAAO,IAAImH,GAAenH,CAAM,EACpC,IAAK,eACD,OAAO,IAAIoH,GAAapH,CAAM,EAClC,IAAK,OACD,OAAO,IAAIqH,GAAYrH,CAAM,EACjC,IAAK,QACD,OAAO,IAAIsH,GAAatH,CAAM,EAElC,IAAK,WACD,OAAO,IAAIuH,GAAgBvH,CAAM,EAErC,IAAK,MACD,OAAO,IAAIwH,GAAWxH,CAAM,EAChC,IAAK,aACD,OAAO,IAAIyH,GAAWzH,CAAM,EAChC,QACI,MAAM,IAAI,MAAM,yBAAyBA,EAAO,IAAI,EAAE,CAC9D,CACJ,CAQA,MAAMQ,EAAQ,CACV,OAAO,KAAK,OAAOA,CAAM,CAC7B,CAOA,OAAOA,EAAQ,CACX,OAAO,KAAK,aAAaA,CAAM,EAAE,KAAK,EAAE,CAC5C,CASA,aAAaA,EAAQ,CACjB,MAAM,MAAM,mDAAmD,CACnE,CAEJ,EAEM2G,GAAN,cAA6BJ,EAAQ,CAGjC,aAAavG,EAAQ,CACjB,IAAMpC,EAAUD,GAAc,KAAK,OAAO,OAAO,EACjD,OAAOC,IAAY,KACboC,EACAA,EAAO,IAAII,GAASA,EAAM,WAAWxC,EAAS,KAAK,OAAO,OAAO,CAAC,CAC5E,CACJ,EAGMgJ,GAAN,cAA2BL,EAAQ,CAC/B,YAAY/G,EAAQ,CAChB,MAAMA,CAAM,EAEZ,KAAK,aAAe,IAAI,WAC5B,CAGA,aAAaQ,EAAQ,CAEjB,IAAMkH,EAAa,CAAC,EAChBC,EAAuB,CAAC,EAE5B,QAAW/G,KAASJ,EAAQ,CACxB,IAAIoH,EAAQ,KACZ,GAAIhH,EAAM,SAAW,GAAKA,EAAM,WAAW,KAAK,GAAKA,EAAM,SAAS,GAAG,EAAG,CACtE,IAAMgF,EAAO,SAAShF,EAAM,MAAM,EAAG,CAAC,EAAG,EAAE,EACtC,MAAMgF,CAAI,IACXgC,EAAQhC,EAEhB,CACA,GAAIgC,IAAU,KACVD,EAAqB,KAAKC,CAAK,MAC5B,CACH,GAAID,EAAqB,OAAS,EAAG,CACjC,IAAME,EAAS,KAAK,aAAa,OAAO,WAAW,KAAKF,CAAoB,CAAC,EAC7ED,EAAW,KAAKG,CAAM,EACtBF,EAAuB,CAAC,CAC5B,CACAD,EAAW,KAAK9G,CAAK,CACzB,CACJ,CACA,GAAI+G,EAAqB,OAAS,EAAG,CACjC,IAAME,EAAS,KAAK,aAAa,OAAO,WAAW,KAAKF,CAAoB,CAAC,EAC7ED,EAAW,KAAKG,CAAM,EACtBF,EAAuB,CAAC,CAC5B,CAEA,OAAOD,CACX,CACJ,EAOML,GAAN,cAA0BN,EAAQ,CAG9B,aAAavG,EAAQ,CACjB,MAAO,CAACA,EAAO,KAAK,EAAE,CAAC,CAC3B,CACJ,EAGM8G,GAAN,cAA2BP,EAAQ,CAC/B,YAAY/G,EAAQ,CAChB,MAAMA,CAAM,EAEZ,KAAK,QAAU,KAAK,OAAO,QAC3B,KAAK,MAAQ,KAAK,OAAO,MACzB,KAAK,KAAO,KAAK,OAAO,IAC5B,CAGA,aAAaQ,EAAQ,CACjB,OAAOA,EAAO,IAAII,GAAS,CACvB,IAAIkH,EAAY,EAChB,QAASpI,EAAI,EAAGA,EAAI,KAAK,OACjBkB,EAAMlB,CAAC,IAAM,KAAK,QADM,EAAEA,EACC,CAC3BoI,EAAYpI,EAAI,EAChB,QACJ,CAKJ,IAAIqI,EAAWnH,EAAM,OACrB,QAASlB,EAAI,EAAGA,EAAI,KAAK,KAAM,EAAEA,EAAG,CAChC,IAAMsI,EAAQpH,EAAM,OAASlB,EAAI,EACjC,GAAIkB,EAAMoH,CAAK,IAAM,KAAK,QAAS,CAC/BD,EAAWC,EACX,QACJ,KACI,MAER,CAEA,OAAOpH,EAAM,MAAMkH,EAAWC,CAAQ,CAC1C,CAAC,CACL,CACJ,EAMMf,GAAN,cAA+BD,EAAQ,CAQnC,YAAY/G,EAAQ,CAChB,MAAMA,CAAM,EACZ,KAAK,QAAUA,EAAO,OAC1B,CAGA,aAAaQ,EAAQ,CACjB,OAAOA,EAAO,IAAI,CAACI,EAAOlB,KAClBA,IAAM,IACFkB,EAAM,WAAW,KAAK,OAAO,MAAM,EAEnCA,EAAQA,EAAM,QAAQ,KAAK,OAAO,OAAQ,EAAE,EAE5CA,EAAQ,IAAMA,GAGlB,KAAK,UACLA,EAAQ5B,GAAsB4B,CAAK,GAGhCA,EACV,CACL,CACJ,EAMMsG,GAAN,cAA+BH,EAAQ,CAMnC,YAAY/G,EAAQ,CAChB,MAAMA,CAAM,EAEZ,KAAK,aAAe6C,GACpB,KAAK,aAAe,IAAI,YAAY,QAAS,CACzC,MAAO,GACP,UAAW,EACf,CAAC,EAED,KAAK,mBAAqB,IAC9B,CAOA,yBAAyBrC,EAAQ,CAC7B,IAAM3C,EAAO2C,EAAO,KAAK,EAAE,EACrByH,EAAY,IAAI,WAAW,CAAC,GAAGpK,CAAI,EAAE,IAAIqK,GAAK,KAAK,aAAaA,CAAC,CAAC,CAAC,EAEzE,OADqB,KAAK,aAAa,OAAOD,CAAS,CAE3D,CAGA,aAAazH,EAAQ,CAOjB,IAAM2H,EAAY,CAAC,EACfC,EAAmB,CAAC,EACxB,QAAWxH,KAASJ,EAMZ,KAAK,aAAa,KAAKc,GAAKA,EAAE,UAAYV,CAAK,IAAM,QACjDwH,EAAiB,OAAS,IAC1BD,EAAU,KAAK,KAAK,yBAAyBC,CAAgB,CAAC,EAC9DA,EAAmB,CAAC,GAExBD,EAAU,KAAKvH,CAAK,GAEpBwH,EAAiB,KAAKxH,CAAK,EAGnC,OAAIwH,EAAiB,OAAS,GAC1BD,EAAU,KAAK,KAAK,yBAAyBC,CAAgB,CAAC,EAK3DD,CACX,CACJ,EAMMX,GAAN,cAAyBT,EAAQ,CAE7B,YAAY/G,EAAQ,CAChB,MAAMA,CAAM,EAEZ,KAAK,UAAY,KAAK,OAAO,UAC7B,KAAK,qBAAuB,KAAK,OAAO,qBACxC,KAAK,QAAU,KAAK,OAAO,OAC/B,CAMA,yBAAyBQ,EAAQ,CAC7B,GAAIA,EAAO,SAAW,EAAG,MAAO,GAGhC,IAAM6H,EAAiB,CAAC7H,EAAO,CAAC,CAAC,EACjC,QAASd,EAAI,EAAGA,EAAIc,EAAO,OAAQ,EAAEd,EAC7Bc,EAAOd,CAAC,IAAM2I,EAAe,GAAG,EAAE,GAClCA,EAAe,KAAK7H,EAAOd,CAAC,CAAC,EAOrC,IAAI7B,EAFoBwK,EAAe,OAAOzH,GAASA,IAAU,KAAK,SAAS,EAEpD,KAAK,EAAE,EAClC,OAAI,KAAK,UAEL/C,EAAOmB,GAAsBnB,CAAI,EAC5B,WAAW,KAAK,qBAAsB,GAAG,EACzC,KAAK,GAEPA,CACX,CAIA,aAAa2C,EAAQ,CACjB,MAAO,CAAC,KAAK,yBAAyBA,CAAM,CAAC,CACjD,CACJ,EAMM+G,GAAN,cAA8BR,EAAQ,CAOlC,YAAY/G,EAAQ,CAChB,MAAMA,CAAM,EACZ,KAAK,SAAWA,EAAO,SAAS,IAAIsB,GAAKyF,GAAQ,WAAWzF,CAAC,CAAC,CAClE,CAGA,aAAad,EAAQ,CAEjB,OAAO,KAAK,SAAS,OAAO,CAAC8H,EAAMC,IACxBA,EAAQ,aAAaD,CAAI,EACjC9H,CAAM,CACb,CAEJ,EAEMiH,GAAN,cAAyBV,EAAQ,CAC7B,YAAY/G,EAAQ,CAChB,MAAMA,CAAM,EAEZ,KAAK,OAAS,KAAK,OAAO,MAC9B,CAEA,aAAaQ,EAAQ,CACjB,OAAOA,EAAO,IAAI,CAACI,EAAOlB,IACfkB,EAAM,WAAW,KAAK,OAASlB,IAAMc,EAAO,OAAS,EAAK,GAAK,GAAG,CAC5E,CACL,CACJ,EAoBA,IAAMgI,GAAN,cAAoCC,EAAa,CAO7C,YAAYC,EAAQ,CAChB,MAAM,EAEN,KAAK,YAAcA,EAAO,YAC1B,KAAK,OAASA,EAAO,SAAW,KAAK,YACrC,KAAK,eAAiBA,EAAO,gBAAkB,QACnD,CAUA,kBAAkBC,EAAM,CACpB,cAAAC,EAAgB,MACpB,EAAI,CAAC,EAAG,CAEJ,IAAIC,EAAaF,EAAK,WAAW,IAAK,KAAK,MAAM,EAEjD,MAGI,CAACE,EAAW,WAAW,KAAK,WAAW,IAMnC,KAAK,iBAAmB,UACvB,KAAK,iBAAmB,SAAWD,IAAkB,KAG1DC,EAAa,KAAK,OAASA,GAExB,CAACA,CAAU,CACtB,CACJ,EAMMC,GAAN,cAA+BC,EAAQ,CAMnC,YAAYL,EAAQ,CAChB,MAAMA,CAAM,EAEZ,KAAK,YAAcA,EAAO,WAC9B,CAGA,aAAaM,EAAQ,CACjB,IAAMC,EAAS,CAAC,EAChB,QAASC,EAAI,EAAGA,EAAIF,EAAO,OAAQ,EAAEE,EAAG,CACpC,IAAIL,EAAaG,EAAOE,CAAC,EAAE,WAAW,KAAK,YAAa,GAAG,EACvDA,GAAK,GAAKL,EAAW,WAAW,GAAG,IACnCA,EAAaA,EAAW,UAAU,CAAC,GAEvCI,EAAO,KAAKJ,CAAU,CAC1B,CACA,OAAOI,CACX,CACJ,EASME,GAAN,cAA0BC,EAAW,CAMjC,YAAYV,EAAQ,CAChB,MAAMA,CAAM,EACZ,KAAK,SAAWA,EAAO,oBAC3B,CAOA,UAAUC,EAAM,CAaZ,OAAAA,EAAOA,EAAK,QAAQ,yDAA0D,EAAE,EAChFA,EAAOA,EAAK,QAAQ,wGAAyG,GAAQ,EAEjIA,EAAK,SAAS,QAAQ,EAMtBA,EADcA,EAAK,MAAM,QAAQ,EACpB,IAAIU,GAAQA,EAAK,UAAU,MAAM,CAAC,EAAE,KAAK,QAAQ,EAE9DV,EAAOA,EAAK,UAAU,MAAM,EAGzBA,CACX,CACJ,EAMMW,GAAN,cAAmCb,EAAa,CAM5C,YAAYC,EAAQ,CAChB,MAAM,EACN,KAAK,WAAaA,EAAO,cAAc,IAAIa,GAAKd,GAAa,WAAWc,CAAC,CAAC,CAC9E,CAQA,kBAAkBZ,EAAMa,EAAS,CAE7B,OAAO,KAAK,WAAW,OAAO,CAACC,EAAkBC,IACtCA,EAAU,aAAaD,EAAkBD,CAAO,EACxD,CAACb,CAAI,CAAC,CACb,CACJ,EAKMgB,GAAN,cAAqClB,EAAa,CAK9C,YAAYC,EAAQ,CAChB,MAAM,CACV,CAOA,kBAAkBC,EAAMa,EAAS,CAC7B,OAAOb,EAAK,MAAM,eAAe,GAAK,CAAC,CAC3C,CACJ,EAMMiB,GAAN,cAA8BnB,EAAa,CAKvC,YAAYC,EAAQ,CAChB,MAAM,CACV,CAOA,kBAAkBC,EAAMa,EAAS,CAC7B,OAAOK,GAAiBlB,CAAI,CAChC,CACJ,EAGMmB,GAAN,cAAkCrB,EAAa,CAM3C,YAAYC,EAAQ,CAChB,MAAM,EACN,KAAK,OAASA,EACd,KAAK,QAAUqB,GAAc,KAAK,OAAO,OAAO,EAChD,KAAK,QAAU,KAAK,OAAO,OAC/B,CAQA,kBAAkBpB,EAAMa,EAAS,CAC7B,OAAI,KAAK,UAAY,KACV,CAACb,CAAI,EAET,CAACA,EAAK,WAAW,KAAK,QAAS,KAAK,OAAO,OAAO,CAAC,CAC9D,CACJ,EAEMqB,GAAN,cAAsCvB,EAAa,CAK/C,YAAYC,EAAQ,CAChB,MAAM,EACN,KAAK,QAAUA,EAAO,MAC1B,CAQA,kBAAkBC,EAAMa,EAAS,CAC7B,IAAMR,EAAS,CAAC,EAChB,QAASE,EAAI,EAAGA,EAAIP,EAAK,OAAQO,GAAK,KAAK,QACvCF,EAAO,KAAKL,EAAK,MAAMO,EAAGA,EAAI,KAAK,OAAO,CAAC,EAE/C,OAAOF,CACX,CACJ,EAEMiB,GAA2B,CAC7B,YACA,YACA,YACA,YACA,YACA,YACA,YAEJ,EAYA,SAASC,GAAUC,EAAMC,EAAQC,EAAUC,EAAM,CAC7C,QAAWC,KAAO,OAAO,KAAKJ,CAAI,EAAG,CACjC,IAAMK,EAAOJ,EAASD,EAAKI,CAAG,EAAE,OAC1BE,EAAQJ,EAASE,CAAG,EAEpBG,EAAU,IAAI,MAAMF,CAAI,EAAE,KAAKC,CAAK,EAC1CN,EAAKI,CAAG,EAAID,IAAS,QACfK,GAAYR,EAAKI,CAAG,EAAGG,CAAO,EAC9BC,GAAYD,EAASP,EAAKI,CAAG,CAAC,CACxC,CACJ,CASA,SAASK,GAAeT,EAAMC,EAAQ,CAGlC,QAAWG,KAAO,OAAO,KAAKJ,CAAI,EAC9BA,EAAKI,CAAG,EAAE,OAASH,CAE3B,CASO,IAAMS,GAAN,cAAkCC,EAAS,CAC9C,sBAAwB,GAExB,aAAe,QAMf,YAAYC,EAAeC,EAAiB,CACxC,MAAM,EAEN,KAAK,OAASA,EAGd,KAAK,WAAa5B,GAAW,WAAW2B,EAAc,UAAU,EAChE,KAAK,cAAgBtC,GAAa,WAAWsC,EAAc,aAAa,EACxE,KAAK,MAAQE,GAAe,WAAWF,EAAc,MAAOC,CAAe,EAC3E,KAAK,eAAiBE,GAAc,WAAWH,EAAc,cAAc,EAC3E,KAAK,QAAUhC,GAAQ,WAAWgC,EAAc,OAAO,EAGvD,KAAK,eAAiB,CAAC,EACvB,KAAK,gBAAkB,CAAC,EAGxB,KAAK,aAAe,CAAC,EACrB,QAAWI,KAAcJ,EAAc,aAAc,CACjD,IAAMK,EAAQ,IAAIC,GAAWF,CAAU,EACvC,KAAK,aAAa,KAAKC,CAAK,EAE5B,KAAK,MAAM,cAAc,IAAIA,EAAM,QAASA,EAAM,EAAE,EACpD,KAAK,MAAM,MAAMA,EAAM,EAAE,EAAIA,EAAM,QAE/BA,EAAM,UACN,KAAK,eAAe,KAAKA,EAAM,OAAO,EACtC,KAAK,gBAAgB,KAAKA,EAAM,EAAE,EAE1C,CA8DA,GA3DA,KAAK,0BAA4BJ,EAAgB,2BAA6B,CAAC,EAC/E,KAAK,eAAe,KAAK,GAAG,KAAK,yBAAyB,EAC1D,KAAK,eAAiB,CAAC,GAAG,IAAI,IAAI,KAAK,cAAc,CAAC,EAElD,KAAK,UAEL,KAAK,QAAQ,aAAe,KAAK,aAMjC,KAAK,QAAQ,mBAAqB,KAAK,MAAM,oBAGjD,KAAK,sBAAwB,IAAIM,GAC7B,KAAK,aAAa,IAAI/B,GAAKA,EAAE,OAAO,CACxC,EAGA,KAAK,iBAAmB,IAAI,IAAI,KAAK,aAAa,IAAIA,GAAK,CAACA,EAAE,QAASA,CAAC,CAAC,CAAC,EAG1E,KAAK,WAAa,KAAK,SAAS,YAAY,EAC5C,KAAK,cAAgB,KAAK,MAAM,cAAc,IAAI,KAAK,UAAU,EAEjE,KAAK,UAAY,KAAK,SAAS,YAAa,WAAW,EACvD,KAAK,aAAe,KAAK,MAAM,cAAc,IAAI,KAAK,SAAS,EAE/D,KAAK,UAAY,KAAK,SAAS,WAAW,EAC1C,KAAK,aAAe,KAAK,MAAM,cAAc,IAAI,KAAK,SAAS,EAE/D,KAAK,UAAY,KAAK,SAAS,WAAW,EAC1C,KAAK,aAAe,KAAK,MAAM,cAAc,IAAI,KAAK,SAAS,EAE/D,KAAK,UAAY,KAAK,SAAS,WAAW,EAC1C,KAAK,aAAe,KAAK,MAAM,cAAc,IAAI,KAAK,SAAS,EAE/D,KAAK,UAAY,KAAK,SAAS,WAAW,EAC1C,KAAK,aAAe,KAAK,MAAM,cAAc,IAAI,KAAK,SAAS,EAE/D,KAAK,iBAAmByB,EAAgB,iBAGxC,KAAK,aAAeA,EAAgB,aAEpC,KAAK,6BAA+BA,EAAgB,8BAAgC,GACpF,KAAK,+BAAiCA,EAAgB,gCAAkC,GAEpFA,EAAgB,eAChB,KAAK,aAAeA,EAAgB,cAGxC,KAAK,cAAgBA,EAAgB,cACrC,KAAK,cAAgBA,EAAgB,cAErC,KAAK,OAAS,GAEd,KAAK,cAAgBA,EAAgB,eAAiB,KAClD,MAAM,QAAQ,KAAK,aAAa,EAAG,CAGnC,IAAMO,EAAgB,OAAO,OAAO,IAAI,EACxC,OAAW,CAAE,KAAAC,EAAM,SAAAC,CAAS,IAAK,KAAK,cAAe,CACjD,GAAI,OAAOD,GAAS,UAAY,OAAOC,GAAa,SAChD,MAAM,IAAI,MAAM,+EAA+E,EAEnGF,EAAcC,CAAI,EAAIC,CAC1B,CACA,KAAK,cAAgBF,CACzB,CACA,KAAK,yBAA2B,IAAI,GACxC,CASA,YAAYG,EAAM,CACd,QAAWnB,KAAOmB,EAAM,CACpB,IAAMvB,EAAO,KAAK,OAAOI,CAAG,EAE5B,GAAKJ,EAEL,GAAI,OAAOA,GAAS,SAAU,CAC1B,GAAIA,EAAK,SAAW,aAChB,OAAOA,EAAK,QAEZ,MAAM,MAAM,kBAAkBA,CAAI,EAAE,CAE5C,KACI,QAAOA,CAEf,CACA,OAAO,IACX,CAWA,aAAa,gBAAgBwB,EAA+B,CACxD,kBAAAC,EAAoB,KACpB,OAAAlD,EAAS,KACT,UAAAmD,EAAY,KACZ,iBAAAC,EAAmB,GACnB,SAAAC,EAAW,OACX,OAAAC,EAAS,IACb,EAAI,CAAC,EAAG,CAEJ,IAAMC,EAAO,MAAMC,GAAcP,EAA+B,CAC5D,kBAAAC,EACA,OAAAlD,EACA,UAAAmD,EACA,iBAAAC,EACA,SAAAC,EACA,OAAAC,CACJ,CAAC,EAGD,OAAO,IAAI,KAAK,GAAGC,CAAI,CAC3B,CAwBA,MAEItD,EAGA,CACI,UAAAwD,EAAY,KACZ,mBAAAC,EAAqB,GACrB,QAAAC,EAAU,GACV,WAAAC,EAAa,KACb,WAAAC,EAAa,KACb,cAAAC,EAAgB,GAChB,sBAAAC,EAAwB,IAC5B,EAAI,CAAC,EACP,CAEE,IAAMC,EAAY,MAAM,QAAQ/D,CAAI,EAGhCgE,EAEJ,GAAID,EAAW,CACX,GAAI/D,EAAK,SAAW,EAChB,MAAM,MAAM,8BAA8B,EAG9C,GAAIwD,IAAc,KAAM,CACpB,GAAK,MAAM,QAAQA,CAAS,GAGrB,GAAIxD,EAAK,SAAWwD,EAAU,OACjC,MAAM,MAAM,8CAA8C,MAH1D,OAAM,MAAM,iCAAiC,EAMjDQ,EAAgBhE,EAAK,IACjB,CAACiE,EAAG1D,IAAM,KAAK,aAAa0D,EAAG,CAAE,UAAWT,EAAUjD,CAAC,EAAG,mBAAAkD,EAAoB,sBAAAK,CAAsB,CAAC,CACzG,CAEJ,MACIE,EAAgBhE,EAAK,IAAIY,GAAK,KAAK,aAAaA,EAAG,CAAE,mBAAA6C,EAAoB,sBAAAK,CAAsB,CAAC,CAAC,CAGzG,KAAO,CACH,GAAI9D,GAAS,KACT,MAAM,MAAM,mCAAmC,EAGnD,GAAI,MAAM,QAAQwD,CAAS,EACvB,MAAM,MAAM,gHAAgH,EAIhIQ,EAAgB,CAAC,KAAK,aAAahE,EAAM,CAAE,UAAAwD,EAAW,mBAAAC,EAAoB,sBAAAK,CAAsB,CAAC,CAAC,CACtG,CA2BA,GAxBIF,IAAe,KACfA,EAAa,KAAK,iBACXD,IAAe,OAClBD,IAAY,IACZ,QAAQ,KACJ,sIAEJ,EACAE,EAAa,KAAK,kBACXF,IAAY,KACnB,QAAQ,KAAK,qKAAqK,EAClLC,EAAa,KAMjBD,IAAY,KACZE,EAAa,KAAK,IAAIM,GAAIF,EAAc,IAAIpD,GAAKA,EAAE,UAAU,MAAM,CAAC,EAAE,CAAC,EAAGgD,GAAc,GAAQ,GAIpGA,EAAa,KAAK,IAAIA,EAAY,KAAK,kBAAoB,GAAQ,EAE/DF,GAAWC,EAGX,QAASpD,EAAI,EAAGA,EAAIyD,EAAc,OAAQ,EAAEzD,EACpCyD,EAAczD,CAAC,EAAE,UAAU,SAAWqD,IAG/BI,EAAczD,CAAC,EAAE,UAAU,OAASqD,EAEvCD,GACA1B,GAAe+B,EAAczD,CAAC,EAAGqD,CAAU,EAK3CF,GACAnC,GACIyC,EAAczD,CAAC,EACfqD,EACAhC,GAAOA,IAAQ,YAAc,KAAK,aAAe,EACjD,KAAK,YACT,GAMhB,IAAMtB,EAAS,CAAC,EAEhB,GAAIuD,EAAe,CACf,GAAI,EAAEH,GAAWC,IAKTK,EAAc,KAAKpD,GAAK,CACpB,QAAWgB,KAAO,OAAO,KAAKhB,CAAC,EAC3B,GAAIA,EAAEgB,CAAG,EAAE,SAAWoC,EAAc,CAAC,EAAEpC,CAAG,GAAG,OACzC,MAAO,GAGf,MAAO,EACX,CAAC,EAED,MAAM,MACF,yKAEJ,EAOR,IAAMuC,EAAO,CAACH,EAAc,OAAQA,EAAc,CAAC,EAAE,UAAU,MAAM,EAErE,QAAWpC,KAAO,OAAO,KAAKoC,EAAc,CAAC,CAAC,EAC1C1D,EAAOsB,CAAG,EAAI,IAAIwC,GAAO,QACrB,cAAc,KAAKJ,EAAc,QAAQpD,GAAKA,EAAEgB,CAAG,CAAC,EAAE,IAAI,MAAM,CAAC,EACjEuC,CACJ,CAGR,KAAO,CACH,QAAWvC,KAAO,OAAO,KAAKoC,EAAc,CAAC,CAAC,EAC1C1D,EAAOsB,CAAG,EAAIoC,EAAc,IAAIpD,GAAKA,EAAEgB,CAAG,CAAC,EAI/C,GAAI,CAACmC,EAED,QAAWnC,KAAO,OAAO,KAAKtB,CAAM,EAChCA,EAAOsB,CAAG,EAAItB,EAAOsB,CAAG,EAAE,CAAC,CAGvC,CAEA,OAAoCtB,CACxC,CAQA,aAAaN,EAAM,CACf,GAAIA,IAAS,KAAM,OAAO,KAK1B,IAAMqE,EAAW,KAAK,sBAAsB,MAAMrE,CAAI,EAGtD,QAASO,EAAI,EAAGA,EAAI8D,EAAS,OAAQ,EAAE9D,EAAG,CACtC,IAAMiC,EAAa,KAAK,iBAAiB,IAAI6B,EAAS9D,CAAC,CAAC,EACpDiC,IACIA,EAAW,QAAUjC,EAAI,IACzB8D,EAAS9D,EAAI,CAAC,EAAI8D,EAAS9D,EAAI,CAAC,EAAE,QAAQ,GAE1CiC,EAAW,QAAUjC,EAAI8D,EAAS,OAAS,IAC3CA,EAAS9D,EAAI,CAAC,EAAI8D,EAAS9D,EAAI,CAAC,EAAE,UAAU,GAGxD,CAgCA,OA9Be8D,EAAS,QAAQ,CAACzD,EAAGX,IAAkB,CAClD,GAAIW,EAAE,SAAW,EAAG,MAAO,CAAC,EAC5B,GAAI,KAAK,iBAAiB,IAAIA,CAAC,EAAG,MAAO,CAACA,CAAC,EAe3C,GAbI,KAAK,eAAiB,KACtBA,EAAIA,EAAE,KAAK,EAAE,MAAM,KAAK,EAAE,KAAK,GAAG,GAElC,KAAK,iCACLA,EAAI0D,GAA4B1D,CAAC,GAGjC,KAAK,aAAe,OACpBA,EAAI,KAAK,WAAWA,CAAC,GAKrBA,EAAE,SAAW,EACb,MAAO,CAAC,EAGZ,IAAM2D,EAAiB,KAAK,gBAAkB,KAAQ,KAAK,cAAc3D,EAAG,CACxE,cAAAX,CACJ,CAAC,EAAI,CAACW,CAAC,EAIP,OAFe,KAAK,MAAM2D,CAAa,CAG3C,CAAC,CAGL,CAaA,aAAavE,EAAM,CACf,UAAAwD,EAAY,KACZ,mBAAAC,EAAqB,GACrB,sBAAAK,EAAwB,IAC5B,EAAI,CAAC,EAAG,CAEJ,GAAM,CAAE,OAAAzD,EAAQ,eAAAmE,CAAe,EAAI,KAAK,iBAAiBxE,EAAM,CAAE,KAAMwD,EAAW,mBAAAC,CAAmB,CAAC,EAEhGgB,EAAY,KAAK,MAAM,sBAAsBpE,CAAM,EAEnDC,EAAS,CACX,UAAAmE,EACA,eAAgB,IAAI,MAAMA,EAAU,MAAM,EAAE,KAAK,CAAC,CACtD,EACA,OAAKX,GAAyB,KAAK,wBAA0BU,IACzDlE,EAAO,eAAiBkE,GAErBlE,CACX,CAUA,iBAAiBN,EAAM,CACnB,KAAA0E,EAAO,KACP,mBAAAjB,EAAqB,EACzB,EAAI,CAAC,EAAG,CACJ,IAAMpD,EAAS,KAAK,aAAaL,CAAI,EAC/B2E,EAAU,KAAK,aAAaD,CAAI,EAEtC,OAAO,KAAK,eACN,KAAK,eAAerE,EAAQsE,EAAS,CAAE,mBAAAlB,CAAmB,CAAC,EAC3D,CAAE,OAAQzB,GAAY3B,GAAU,CAAC,EAAGsE,GAAW,CAAC,CAAC,CAAE,CAC7D,CAUA,SAAS3E,EAAM,CACX,KAAA0E,EAAO,KACP,mBAAAjB,EAAqB,EACzB,EAAI,CAAC,EAAG,CACJ,OAAO,KAAK,iBAAiBzD,EAAM,CAAE,KAAA0E,EAAM,mBAAAjB,CAAmB,CAAC,EAAE,MACrE,CAYA,OAAOzD,EAAM,CACT,UAAAwD,EAAY,KACZ,mBAAAC,EAAqB,GACrB,sBAAAK,EAAwB,IAC5B,EAAI,CAAC,EAAG,CACJ,OAAO,KAAK,aAAa9D,EAAM,CAC3B,UAAAwD,EACA,mBAAAC,EACA,sBAAAK,CACJ,CAAC,EAAE,SACP,CAQA,aAAac,EAAOC,EAAc,CAAC,EAAG,CAClC,OAAID,aAAiBR,KACjBQ,EAAQA,EAAM,OAAO,GAElBA,EAAM,IAAIhE,GAAK,KAAK,OAAOA,EAAGiE,CAAW,CAAC,CACrD,CAaA,OACIC,EACAD,EAAc,CAAC,EACjB,CAKE,GAJIC,aAAqBV,KACrBU,EAAYC,GAAuBD,CAAS,GAG5C,CAAC,MAAM,QAAQA,CAAS,GAAKA,EAAU,SAAW,GAAK,CAACE,GAAiBF,EAAU,CAAC,CAAC,EACrF,MAAM,MAAM,kDAAkD,EAGlE,OAAO,KAAK,cAAcA,EAAWD,CAAW,CACpD,CAWA,cACIC,EACA,CACI,oBAAAG,EAAsB,GACtB,6BAAAC,EAA+B,IACnC,EACF,CACE,IAAI7E,EAAS,KAAK,MAAM,sBAAsByE,CAAS,EACnDG,IACA5E,EAASA,EAAO,OAAOO,GAAK,CAAC,KAAK,eAAe,SAASA,CAAC,CAAC,GAMhE,IAAIuE,EAAU,KAAK,QAAU,KAAK,QAAQ9E,CAAM,EAAIA,EAAO,KAAK,GAAG,EAInE,OAAI,KAAK,SAAW,KAAK,QAAQ,qBAC7B8E,EAAUA,EAAQ,WAAW,KAAK,QAAQ,mBAAoB,GAAG,EAC7DF,IACAE,EAAUA,EAAQ,KAAK,KAI3BD,GAAgC,KAAK,gCACrCC,EAAUC,GAAsBD,CAAO,GAGpCA,CACX,CAoBA,kBAAkB,CACd,cAAAvC,EAAgB,KAChB,MAAAyC,EAAQ,IACZ,EAAI,CAAC,EAAG,CAGJ,GAAI,KAAK,eAAiB,OAAO,KAAK,eAAkB,SAAU,CAC9D,IAAMC,EAAgB,KAAK,cAE3B,GAAI1C,IAAkB,MAAQ,OAAO,OAAO0C,EAAe1C,CAAa,EAEpEA,EAAgB0C,EAAc1C,CAAa,UACpCA,IAAkB,KACzB,GAAIyC,IAAU,MAAQ,aAAcC,EAChC1C,EAAgB0C,EAAc,iBACvB,YAAaA,EACpB1C,EAAgB0C,EAAc,YAE9B,OAAM,MACF,kNAEsB,OAAO,KAAKA,CAAa,EAAE,KAAK,CAAC,GAC3D,CAGZ,SAAW1C,IAAkB,KAGzB,GAAI,KAAK,cACLA,EAAgB,KAAK,kBAErB,OAAM,MACF,8SAIJ,EAGR,OAAOA,CACX,CA4DA,oBAAoB2C,EAAc,CAC9B,MAAAF,EAAQ,KACR,UAAAG,EAAY,KACZ,cAAA5C,EAAgB,KAChB,sBAAA6C,EAAwB,GACxB,SAAAC,EAAW,GACX,QAAAhC,EAAU,GACV,WAAAC,EAAa,GACb,WAAAC,EAAa,KACb,cAAAC,EAAgB,GAChB,YAAA8B,EAAc,GACd,iBAAAC,EAAmB,CAAC,EACpB,GAAGC,CACP,EAAI,CAAC,EAAG,CAIJ,GAFAjD,EAAgB,KAAK,kBAAkB,CAAE,cAAAA,EAAe,MAAAyC,CAAM,CAAC,EAE3D,OAAOzC,GAAkB,SACzB,MAAM,MAAM,2CAA2C,OAAOA,CAAa,EAAE,EAIjF,IAAIkD,EAAmB,KAAK,yBAAyB,IAAIlD,CAAa,EAClEkD,IAAqB,SACrBA,EAAmB,IAAIC,GAASnD,CAAa,EAC7C,KAAK,yBAAyB,IAAIA,EAAekD,CAAgB,GAGrE,IAAME,EAAqB,OAAO,OAAO,IAAI,EAC7C,QAAWpE,KAAON,GAA0B,CACxC,IAAMQ,EAAQ,KAAK,SAASF,CAAG,EAC3BE,IACAkE,EAAmBpE,CAAG,EAAIE,EAElC,CAEA,IAAMmE,EAAWH,EAAiB,OAAO,CACrC,SAAUP,EACV,sBAAAE,EACA,MAAAJ,EACA,UAAAG,EACA,GAAGQ,EACH,GAAGH,CACP,CAAC,EAED,GAAIH,EAAU,CACV,IAAMQ,EAAM,KAAK,MAAMD,EAAU,CAC7B,mBAAoB,GACpB,QAAAvC,EACA,WAAAC,EACA,WAAAC,EACA,cAAAC,EACA,GAAG+B,CACP,CAAC,EACD,OAAOD,EAAcO,EAAMA,EAAI,SACnC,CAEA,OAAOD,CACX,CACJ,EAMaE,GAAN,cAA4BjE,EAAoB,CACnD,sBAAwB,EAC5B,EClyGA,IAAAkE,GAA+B,SCqB/B,IAAAC,GAA8B,SCJ9B,IAAAC,GAAqM,SCArM,IAAAC,GAA+B,SAEzB,SAAUC,GACZC,EAAiCC,EAAc,CAC5C,MAAM,QAAQD,CAAM,IACvBA,EAAS,CAACA,CAAM,GAElBA,EAAO,QAAQE,GAAI,CACbA,GAAK,MACP,QAAK,OACDA,EAAE,QAAU,YACZ,IAAM,GACFD,CAAM,yDAAyD,CAE3E,CAAC,CACH,CDbA,IAAME,GAAY,gBAAa,UAiBlBC,GAAb,MAAaC,UAAuB,gBAAa,CAMvC,YAAU,CAChB,OAAOA,EAAe,YACxB,CAEA,aAAA,CACE,MAAK,EAVA,KAAA,UAAY,GAGX,KAAA,SAAW,GAQjB,KAAK,KAAO,IAAI,eAAY,QAAM,WAAM,CAAE,CAC5C,CAES,MACLC,EAAoCC,EACpCC,EAAe,CACb,KAAK,WACP,KAAK,SAAW,MACZ,QAAG,EAAG,IAAI,SAAS,GACrB,gBAAa,KACT;;;6BAIgC,GAGxC,IAAMC,EAAS,CAAC,GAAI,KAAK,WAAU,CAAE,EAErC,YAAK,KAAK,IAAIA,EAAQ,CAAC,OAAAH,EAAQ,MAAAE,EAAO,SAAU,CAAC,CAAC,EAE3CC,CACT,CAQA,eACIF,EAAiBC,EACjBF,EAA4C,CAC9C,IAAII,EACJ,GAAIF,IAAU,UAAYF,GAAU,MAAQA,EAAO,OAAS,GACxD,QAAK,SAASA,EAAO,CAAC,CAAC,EAAG,CAC5B,IAAMK,EACDL,EAA+B,IAAIM,GAAK,QAAK,aAAaA,CAAC,CAAC,EAEjEF,EAAQ,KAAK,MAAMC,EAAeJ,EAAOC,CAAK,OAE9CE,EAAQ,KAAK,MAAMJ,EAAsBC,EAAOC,CAAK,EAGvD,MAAO,CAAC,OAAQE,EAAO,MAAAH,EAAO,MAAAC,CAAK,CACrC,CAGS,SAASC,EAAc,CAC9B,OAAI,KAAK,KAAK,IAAIA,CAAM,EACH,KAAK,KAAK,IAAIA,CAAM,EACrB,SAEb,CACT,CAGS,OAAOA,EAAc,CAC5B,IAAMI,EAAa,KAAK,KAAK,IAAIJ,CAAM,EACvCI,EAAW,UACb,CAGA,OAAOJ,EAAc,CACnB,GAAI,KAAK,KAAK,IAAIA,CAAM,EAAG,CACzB,IAAMI,EAAa,KAAK,KAAK,IAAIJ,CAAM,EACvCI,EAAW,WAEf,CAES,KACLJ,EAAgBH,EAAoCC,EACpDC,EAAiBM,EAAgB,CACnC,KAAK,KAAK,IAAIL,EAAQ,CAAC,OAAAH,EAAQ,MAAAE,EAAO,SAAAM,CAAQ,CAAC,CACjD,CAES,YAAU,CACjB,OAAO,KAAK,KAAK,WAAU,CAC7B,CAES,MAAM,KAAKL,EAAc,CAChC,OAAO,KAAK,SAASA,CAAM,CAC7B,CACS,SAASA,EAAc,CAC9B,GAAM,CAAC,MAAAD,EAAO,mBAAAO,CAAkB,EAAI,KAAK,KAAK,IAAIN,CAAM,EAExD,GAAID,IAAU,YAAa,CACzB,IAAMQ,EACF,KAAK,SAASD,EAAmB,KAAK,MAAM,EAC1CE,EACF,KAAK,SAASF,EAAmB,KAAK,MAAM,EAChD,OAAO,gBAAa,uBAAuBC,EAAYC,CAAU,EAEnE,OAAO,QAAK,mCACR,KAAK,KAAK,IAAIR,CAAM,EAAE,OAAQD,CAAK,CACzC,CAEA,WAA+CU,EAAa,CAE1D,IAAMC,EAAO,KAAK,SAASD,EAAE,MAAM,EACnC,GAAIA,EAAE,QAAU,SACd,GAAI,CAEF,IAAME,EAAWD,EAAsB,IAAIP,GAAK,QAAK,aAAaA,CAAC,CAAC,EACpE,SAAO,WAAOM,EAAE,MAAsBA,EAAE,MAAOE,CAAO,OAEhD,CACN,MAAM,IAAI,MAAM,kDAAkD,EAGtE,SAAO,WAAOF,EAAE,MAAsBA,EAAE,MAAOC,CAAkB,CAEnE,CAEA,WACIb,EAAoCC,EAAiBC,EAAe,CACtE,SAAO,WAAM,EAAG,yBACL,KAAK,eAAeD,EAAOC,EAAOF,CAAM,EAAG,IAAI,CAC5D,CASS,YAAYG,EAAgBY,EAAQ,GAAK,CAChD,GAAI,KAAK,KAAK,IAAIZ,CAAM,EAAG,CAEzB,GADA,KAAK,KAAK,IAAIA,CAAM,EAAE,WAClB,CAACY,GAAS,KAAK,KAAK,IAAIZ,CAAM,EAAE,SAAW,EAC7C,MAAO,GAGT,GAAM,CAAC,mBAAAM,CAAkB,EAAI,KAAK,KAAK,IAAIN,CAAM,EAE7CM,GAAsB,OACxB,KAAK,YAAYA,EAAmB,KAAK,OAAQ,EAAI,EACrD,KAAK,YAAYA,EAAmB,KAAK,OAAQ,EAAI,GAGvD,KAAK,KAAK,OAAON,CAAM,EAEzB,MAAO,EACT,CAEA,8BAA8Ba,EAAsB,CAClD,KAAK,YAAYA,EAAW,MAAM,CACpC,CAES,MAAM,KAAKC,EAAa,CAC/B,IAAMC,EAAQ,QAAK,IAAG,EACtB,OAAAD,EAAC,EAEM,CAAC,SADS,QAAK,IAAG,EAAKC,CACd,CAClB,CAES,QAAM,CACb,MAAO,CAEL,WAAY,GACZ,QACI,CAAC,oHACoD,EAE7D,CAEA,MAAMC,EAAiB,CACrBC,GAAiB,CAACD,CAAS,EAAG,OAAO,EAErC,IAAME,EAAW,KAAK,SAASF,EAAU,MAAM,EAC/C,OAAOtB,GAAUsB,EAAU,MAAOE,CAAQ,CAC5C,CAES,SAAO,CAAI,CAEX,gBAAc,CACrB,MAAO,GACT,CAGS,SAAO,CACd,OAAO,MAAM,QAAO,CACtB,GA9LevB,GAAA,WAAa,EExB9B,IAAAwB,GAAgC,SCAhC,IAAAC,GAAoF,SAO9E,SAAUC,GAA6BC,EAAyB,CAEpE,MAAO,CAACC,EAAkBC,EAAkBC,EACpCC,EAAmBC,IAA2C,CACpE,IAAMC,EAAW,gBAAa,2BAA2BL,EAAQC,CAAM,EAEjEK,EAAaD,EAAS,OACtBE,EAAgB,QAAK,eAAeF,CAAQ,EAC5CG,EAAa,QAAK,cAAcH,CAAQ,EAExCI,EACF,QAAK,uBAAuBL,EAA0BI,CAAU,EAE9DE,EAAQV,EAAO,OACfW,EAAQV,EAAO,OAEfW,EAAW,QAAK,eAAeZ,CAAM,EACrCa,EAAW,QAAK,eAAeZ,CAAM,EAErCa,EAAiB,gBAAa,iBAAiBd,EAAQK,CAAQ,EAC/DU,EAAiB,gBAAa,iBAAiBd,EAAQI,CAAQ,EAErE,GAAIS,EAAe,OAASC,EAAe,SAAW,EACpD,QAASC,EAAI,EAAGA,EAAIP,EAAO,OAAQ,EAAEO,EACnCP,EAAOO,CAAC,EAAIjB,EAAGG,EAAMc,EAAId,EAAM,MAAM,EAAGC,EAAMa,EAAIb,EAAM,MAAM,CAAC,MAGjE,SAASa,EAAI,EAAGA,EAAIP,EAAO,OAAQ,EAAEO,EAAG,CACtC,IAAMC,EAAM,QAAK,WAAWD,EAAGV,EAAYC,CAAa,EAElDW,EAAOD,EAAI,MAAM,CAACP,CAAK,EAC7BI,EAAe,QAAQK,GAAKD,EAAKC,CAAC,EAAI,CAAC,EACvC,IAAMC,EAAS,QAAK,WAAWF,EAAMR,EAAOE,CAAQ,EAE9CS,EAAOJ,EAAI,MAAM,CAACN,CAAK,EAC7BI,EAAe,QAAQI,GAAKE,EAAKF,CAAC,EAAI,CAAC,EACvC,IAAMG,EAAS,QAAK,WAAWD,EAAMV,EAAOE,CAAQ,EAEpDJ,EAAOO,CAAC,EAAIjB,EAAGG,EAAMkB,CAAM,EAAGjB,EAAMmB,CAAM,CAAC,EAI/C,MAAO,CAACb,EAAQJ,CAAQ,CAC1B,CACF,CCnDA,IAAAkB,GAAiF,SCDjF,IAAAC,GAA4G,SCC5G,IAAAC,GAAyC,SCInC,SAAUC,GAAQC,EAAsD,CAE5E,GAAM,CAAC,OAAAC,EAAQ,QAAAC,CAAO,EAAIF,EACpB,CAAC,KAAAG,EAAM,KAAAC,CAAI,EAAIH,EAEfI,EAAWH,EAAQ,KAAK,IAAIC,EAAK,MAAM,EAAE,OACzCG,EAAWJ,EAAQ,KAAK,IAAIE,EAAK,MAAM,EAAE,OAEzCG,EAAcL,EAAQ,eAAeC,EAAK,MAAO,WAAW,EAE5DJ,EAAUG,EAAQ,KAAK,IAAIK,EAAY,MAAM,EAKnD,OAAAR,EAAQ,mBAAqB,CAC3B,KAAMG,EAAQ,eAAeC,EAAK,MAAO,UAAWE,CAAQ,EAC5D,KAAMH,EAAQ,eAAeE,EAAK,MAAO,UAAWE,CAAQ,GAGvDC,CACT,CDfM,SAAUC,GACZC,EAAyBC,EACzBC,EAAkB,UAAS,CAC7B,GAAIA,IAAU,YAAa,CACzB,IAAMC,EAAOJ,GAAMC,EAASC,EAAO,SAAS,EACtCG,EAAOL,GAAMC,EAASC,EAAO,SAAS,EAE5C,OAAOI,GAAQ,CAAC,OAAQ,CAAC,KAAAF,EAAM,KAAAC,CAAI,EAAG,QAAAJ,CAAO,CAAC,EAGhD,IAAMM,EAAS,QAAK,oBAAoB,QAAK,cAAcL,CAAK,EAAGC,CAAK,EAExE,OAAOF,EAAQ,eAAeC,EAAOC,EAAOI,CAAM,CACpD,CEvBA,IAAAC,GAA6E,SAIvE,SAAUC,GACZC,EAAuD,CACzD,GAAM,CAAC,OAAAC,EAAQ,QAAAC,CAAO,EAAIF,EACpB,CAAC,EAAAG,CAAC,EAAIF,EAEZ,OAAAC,EAAQ,OAAOC,EAAE,MAAM,EAEhB,CAAC,OAAQA,EAAE,OAAQ,MAAOA,EAAE,MAAO,MAAOA,EAAE,KAAK,CAC1D,CAEO,IAAMC,GAA+B,CAC1C,WAAY,YACZ,YAAa,MACb,WAAYL,ICbR,SAAUM,GAAKC,EAAmD,CAEtE,GAAM,CAAC,OAAAC,EAAQ,QAAAC,CAAO,EAAIF,EACpB,CAAC,MAAAG,CAAK,EAAIF,EAEVF,EAAOG,EAAQ,KAAK,IAAIC,EAAM,MAAM,EAAE,mBAAmB,KACzDC,EAAUF,EAAQ,KAAK,IAAIH,EAAK,MAAM,EAAE,OAK9C,OAAOG,EAAQ,eAAeH,EAAK,MAAOA,EAAK,MAAOK,CAAO,CAC/D,CJPM,SAAUC,GACZC,EAAoBC,EAAiBC,EACrCC,EAAe,CACjB,GAAIA,IAAU,QAAS,CACrB,IAAMC,EAAe,WAAW,KAAKJ,CAAM,EAC3C,MAAO,CAACC,EAAO,QAASG,CAAY,EAGtC,GAAID,IAAU,OAAQ,CAIpB,IAAME,EAAO,QAAK,aAAa,CAAC,CAAC,EAAGH,CAAS,EAEvC,CAACI,EAAYC,CAAW,EAAIC,GAC9B,CAACC,EAAGC,IAAOD,IAAMC,EAAK,EAAI,CAAC,EAAET,EAAO,CAAA,EAAID,EAAQK,EAAM,MAAM,EAEhE,MAAO,CAACE,EAAa,OAAQD,CAAU,EAEzC,MAAM,IAAI,MAAM,iCAAiCJ,CAAS,OAAOC,CAAK,EAAE,CAC1E,CAEM,SAAUQ,GACZC,EAAqE,CAEvE,GAAM,CAAC,OAAAC,EAAQ,QAAAC,EAAS,MAAAC,CAAK,EAAIH,EAC3B,CAAC,EAAAI,CAAC,EAAIH,EACN,CAAC,MAAAV,CAAK,EAAIY,EAGhB,GAAIZ,IAAU,YAAa,CACzB,GAAIa,EAAE,QAAU,YACd,OAAOC,GAAS,CAAC,OAAQ,CAAC,EAAAD,CAAC,EAAG,QAAAF,CAAO,CAAC,EAGxC,IAAMI,EAAkBC,GAAML,EAASE,EAAE,MAAOA,EAAE,KAAK,EACjDI,EAAST,GAAK,CAAC,OAAQ,CAAC,EAAAK,CAAC,EAAG,QAAAF,EAAS,MAAO,CAAC,MAAO,SAAS,CAAC,CAAC,EAE/DO,EACFC,GAAQ,CAAC,OAAQ,CAAC,KAAMF,EAAQ,KAAMF,CAAe,EAAG,QAAAJ,CAAO,CAAC,EAEpE,OAAAA,EAAQ,8BAA8BI,CAAe,EACrDJ,EAAQ,8BAA8BM,CAAM,EAErCC,EAIT,GAAIL,EAAE,QAAU,YAAa,CAC3B,IAAMO,EAAWC,GAAK,CAAC,OAAQ,CAAC,MAAOR,CAAC,EAAG,QAAAF,CAAO,CAAC,EAC7CO,EAASV,GAAK,CAAC,OAAQ,CAAC,EAAGY,CAAQ,EAAG,QAAAT,EAAS,MAAO,CAAC,MAAAX,CAAK,CAAC,CAAC,EAEpE,OAAAW,EAAQ,8BAA8BS,CAAQ,EAEvCF,EAGT,GAAI,CAAC,QAAK,gBAAgBL,EAAE,MAAOb,CAAK,EAAG,CAGzC,IAAMkB,EAASJ,GAAS,CAAC,OAAQ,CAAC,EAAAD,CAAC,EAAG,QAAAF,CAAO,CAAC,EAC9C,MAAO,CAAC,OAAQO,EAAO,OAAQ,MAAOA,EAAO,MAAO,MAAAlB,CAAK,EAG3D,IAAMH,EAASc,EAAQ,KAAK,IAAIE,EAAE,MAAM,EAAE,OACpC,CAACT,EAAakB,EAAYnB,CAAU,EACtCP,GAASC,EAAQgB,EAAE,MAAOA,EAAE,MAAOb,CAAK,EAC5C,OAAOW,EAAQ,eAAeP,EAAakB,EAAYnB,CAAU,CACnE,CAEO,IAAMoB,GAA2B,CACtC,WAAY,QACZ,YAAa,MACb,WAAYf,ID9DR,SAAUgB,GACZC,EAAcC,EACdC,EAAuCC,EAAgB,CACzD,OAAID,GAAe,KACV,CAAC,CAAC,OAAAE,EAAQ,QAAAC,CAAO,IAAK,CAC3B,GAAM,CAAC,EAAAC,EAAG,EAAAC,CAAC,EAAIH,EACTI,EAAaH,EAEnBI,GAAiB,CAACH,EAAGC,CAAC,EAAGP,CAAI,EAE7B,IAAMU,EAAQF,EAAW,KAAK,IAAIF,EAAE,MAAM,EAAE,OACtCK,EAAQH,EAAW,KAAK,IAAID,EAAE,MAAM,EAAE,OAEtCK,EAAeN,EAAE,QAAU,SAE7B,gBAAa,uBAAuBI,CAA4B,EAChEA,EACEG,EAAeP,EAAE,QAAU,SAE7B,gBAAa,uBAAuBK,CAA4B,EAChEA,EACEG,EAASX,GAASG,EAAE,MAEpB,CAACS,EAAYC,CAAW,EAC1Bf,EAAWK,EAAE,MAAOC,EAAE,MAAOK,EAAcC,EAAcC,CAAM,EAEnE,OAAON,EAAW,eAAeQ,EAAaF,EAAQC,CAAU,CAClE,EAGK,CAAC,CAAC,OAAAX,EAAQ,QAAAC,CAAO,IAAK,CAC3B,GAAM,CAAC,EAAAC,EAAG,EAAAC,CAAC,EAAIH,EACTI,EAAaH,EAEnB,GAAIC,EAAE,QAAU,aAAeC,EAAE,QAAU,YAAa,CACtD,IAAMU,EAAYC,GACd,CAAC,OAAQ,CAAC,EAAGZ,CAAC,EAAG,QAASE,EAAY,MAAO,CAAC,MAAO,WAAW,CAAC,CAAC,EAEhEW,EAAgBX,EAAW,KAAK,IAAIS,EAAU,MAAM,EAEpDG,EAAQD,EAAc,mBAAmB,KACzCE,EAAQF,EAAc,mBAAmB,KAEzCG,EACFd,EAAW,KAAK,IAAIY,EAAM,MAAM,EAAE,OAChCG,EACFf,EAAW,KAAK,IAAIa,EAAM,MAAM,EAAE,OAEhCG,EAAYN,GACd,CAAC,OAAQ,CAAC,EAAGX,CAAC,EAAG,QAASC,EAAY,MAAO,CAAC,MAAO,WAAW,CAAC,CAAC,EAEhEiB,EAAgBjB,EAAW,KAAK,IAAIgB,EAAU,MAAM,EAEpDE,EAAQD,EAAc,mBAAmB,KACzCE,EAAQF,EAAc,mBAAmB,KAEzCG,EACFpB,EAAW,KAAK,IAAIkB,EAAM,MAAM,EAAE,OAChCG,EACFrB,EAAW,KAAK,IAAImB,EAAM,MAAM,EAAE,OAEhC,CAACG,EAAgBC,EAAgBf,CAAW,EAAId,EAClDI,EAAE,MAAOC,EAAE,MAAOe,EAAWC,EAAWK,EAAWC,CAAS,EAE1DG,EACFxB,EAAW,eAAeQ,EAAa,UAAWc,CAAc,EAE9DG,EACFzB,EAAW,eAAeQ,EAAa,UAAWe,CAAc,EAE9DG,EAASC,GACX,CAAC,OAAQ,CAAC,KAAMH,EAAY,KAAMC,CAAU,EAAG,QAASzB,CAAU,CAAC,EAEvE,OAAAA,EAAW,8BAA8BS,CAAS,EAClDT,EAAW,8BAA8BgB,CAAS,EAClDhB,EAAW,8BAA8BwB,CAAU,EACnDxB,EAAW,8BAA8ByB,CAAU,EAE5CC,MACF,CACL,IAAMxB,EAAQF,EAAW,KAAK,IAAIF,EAAE,MAAM,EAAE,OACtCK,EAAQH,EAAW,KAAK,IAAID,EAAE,MAAM,EAAE,OAEtCO,EAASX,GAASG,EAAE,MAEpB,CAACS,EAAYC,CAAW,EAC1Bf,EAAWK,EAAE,MAAOC,EAAE,MAAOG,EAAOC,EAAOG,CAAM,EAErD,OAAON,EAAW,eAAeQ,EAAaF,EAAQC,CAAU,EAEpE,CACF,CAMM,SAAUqB,GAA8BC,EAA0B,CAEtE,MAAO,CAACC,EAAkBC,EAAkBjB,EACpCC,EAAyBK,EACzBC,IAA+D,CACrE,IAAMb,EAAc,gBAAa,2BAA2BsB,EAAQC,CAAM,EACpEC,EAAa,QAAK,cAAcxB,CAAW,EAC3CyB,EAAazB,EAAY,OACzB0B,EAAgB,QAAK,eAAe1B,CAAW,EAE/C2B,EAAiB,QAAK,uBAAuB,UAAWH,CAAU,EAClEI,EAAiB,QAAK,uBAAuB,UAAWJ,CAAU,EAElEK,EAAiB,gBAAa,iBAAiBP,EAAQtB,CAAW,EAClE8B,EAAiB,gBAAa,iBAAiBP,EAAQvB,CAAW,EAElEN,EAAQ,gBAAa,uBAAuBY,EAAWC,CAAS,EAChEZ,EAAQ,gBAAa,uBAAuBiB,EAAWC,CAAS,EAEhEkB,EAAQT,EAAO,OACfU,EAAW,QAAK,eAAeV,CAAM,EAErCW,EAAQV,EAAO,OACfW,EAAW,QAAK,eAAeX,CAAM,EAE3C,GAAIM,EAAe,OAASC,EAAe,SAAW,EACpD,QAASK,EAAI,EAAGA,EAAIR,EAAe,OAAQQ,IAAK,CAC9C,IAAMC,EAAOD,EAAIzC,EAAM,OACjB2C,EAAOF,EAAIxC,EAAM,OAEjBuB,EACFG,EAAG3B,EAAM0C,EAAO,CAAC,EAAG1C,EAAM0C,EAAO,EAAI,CAAC,EAAGzC,EAAM0C,EAAO,CAAC,EACpD1C,EAAM0C,EAAO,EAAI,CAAC,CAAC,EAE1BV,EAAeQ,CAAC,EAAIjB,EAAO,KAC3BU,EAAeO,CAAC,EAAIjB,EAAO,SAG7B,SAASiB,EAAI,EAAGA,EAAIR,EAAe,OAAQQ,IAAK,CAC9C,IAAMG,EAAM,QAAK,WAAWH,EAAGV,EAAYC,CAAa,EAElDa,EAAOD,EAAI,MAAM,CAACP,CAAK,EAC7BF,EAAe,QAAQW,GAAKD,EAAKC,CAAC,EAAI,CAAC,EACvC,IAAMC,EAAS,QAAK,WAAWF,EAAMR,EAAOC,CAAQ,EAE9CU,EAAOJ,EAAI,MAAM,CAACL,CAAK,EAC7BH,EAAe,QAAQU,GAAKE,EAAKF,CAAC,EAAI,CAAC,EACvC,IAAMG,EAAS,QAAK,WAAWD,EAAMT,EAAOC,CAAQ,EAE9CU,EACFvB,EAAG3B,EAAM+C,EAAS,CAAC,EAAG/C,EAAM+C,EAAS,EAAI,CAAC,EAAG9C,EAAMgD,EAAS,CAAC,EAC1DhD,EAAMgD,EAAS,EAAI,CAAC,CAAC,EAE5BhB,EAAeQ,CAAC,EAAIS,EAAS,KAC7BhB,EAAeO,CAAC,EAAIS,EAAS,KAGjC,MAAO,CAACjB,EAAgBC,EAAgB5B,CAAW,CACrD,CACF,CF3KO,IAAM6C,GACTC,IAA8B,CAACC,EAAWC,IAAcD,EAAIC,EAAE,EACrDC,GACTC,IAA+B,CAACC,EAAOC,EAAOC,EAAOC,KAC5C,CAAC,KAAMH,EAAQE,EAAO,KAAMD,EAAQE,CAAK,GAChD,EAEOC,GAAMC,GAAiB,OAAKX,GAASI,EAAc,EAEnDQ,GAA0B,CACrC,WAAY,OACZ,YAAa,MACb,WAAYF,IQjBd,IAAAG,GAAmB,SAOb,SAAUC,GACsBC,EAA8B,CAElE,MAAO,CAACC,EAAQC,EAAOC,IAAS,CAC9B,IAAMC,EACF,QAAK,kBAAkBF,EAAOD,EAAO,MAAM,EAC/C,QAASI,EAAI,EAAGA,EAAIJ,EAAO,OAAQ,EAAEI,EACnCD,EAAUC,CAAC,EAAIL,EAAGC,EAAOI,CAAC,EAAGF,CAAK,EAEpC,OAAOC,CACT,CACF,CClBA,IAAAE,GAAiE,SAgB3D,SAAUC,GAEdC,EAAcC,EACdC,EAAsB,CAEtB,IAAMC,EAAOC,GAA4BH,CAAE,EAE3C,OAAOI,GAA8BL,EAAMG,EAAMD,CAAK,CACxD,CAWM,SAAUG,GAEdL,EAAcM,EACdJ,EAAsB,CAEtB,MAAO,CAAC,CAAC,OAAAK,EAAQ,MAAAC,EAAO,QAAAC,CAAO,IAAK,CAClC,GAAM,CAAC,EAAAC,CAAC,EAAIH,EACZI,GAAiBD,EAAGV,CAAI,EAExB,IAAMY,EAAaH,EACbI,EAASD,EAAW,KAAK,IAAIF,EAAE,MAAM,EAAE,OACzCI,EACJ,GAAIJ,EAAE,QAAU,SAAU,CACxB,GAAI,CAAC,MAAM,QAAQG,CAAM,EACvB,MAAM,IAAI,MAAM,oDAAqD,EAEvEC,EAAU,gBAAa,uBAAuBD,CAAM,OAGpDC,EAAUD,EAGZ,IAAME,EAASb,GAASQ,EAAE,MACpBM,EAAYV,EAAUQ,EAASC,EAAQP,CAAK,EAClD,OAAOI,EAAW,eAAeF,EAAE,MAAOK,EAAQC,CAAS,CAC7D,CACF,CC7DA,IAAAC,GAAsE,SAEhE,SAAUC,GACZC,EAAuDC,EACvDC,EAAiBC,EAAqB,CACxC,IAAMC,EAAU,QAAK,kBAAkBF,EAAO,QAAK,cAAcD,CAAQ,CAAC,EAE1E,GAAIE,GAAgBD,IAAU,SAAU,CAEtC,IAAIG,EAAS,EACbL,EAAO,QAAQM,GAAQ,CACrB,IAAMC,EAAO,QAAK,cAAcD,EAAM,KAAK,EAE1CF,EAAuB,IAAIE,EAAM,KAAoBD,CAAM,EAC5DA,GAAUE,CACZ,CAAC,MACI,CACL,IAAIC,EAAY,EAEhBR,EAAO,QAAQM,GAAQ,CACrB,IAAMG,EAAcP,IAAU,SAC1B,gBAAa,uBAAuBI,EAAM,IAAoB,EAC9DA,EAAM,KAENI,EAAO,EAEX,QAASC,EAAM,EAAGA,EAAML,EAAM,MAAM,CAAC,EAAG,EAAEK,EAAK,CAC7C,IAAMC,EAASD,EAAMV,EAAS,CAAC,EAAIO,EACnC,QAASK,EAAM,EAAGA,EAAMP,EAAM,MAAM,CAAC,EAAG,EAAEO,EACxCT,EAAQQ,EAASC,CAAG,EAAIJ,EAAYC,GAAM,EAI9CF,GAAaF,EAAM,MAAM,CAAC,CAC5B,CAAC,EAGH,OAAOF,CACT,CCtCA,IAAAU,GAAgC,SAKzB,IAAMC,GAAUC,GAAuBC,GAAO,KAAK,IAAIA,CAAE,CAAC,EACpDC,GAAMC,GAAwB,OAAKJ,GAAS,SAAS,ECNlE,IAAAK,GAAmD,SAE7C,SAAUC,GACZC,EAA0BC,EAC1BC,EAA4B,CAC9B,IAAMC,KAAS,WAAOD,EAAoBF,EAAK,KAAK,EACpD,QAASI,EAAI,EAAGA,EAAID,EAAO,KAAM,EAAEC,EAAG,CAGpC,IAAMC,EAFSF,EAAO,WAAWC,CAAC,EAEG,MAAK,EACpCE,EAAWD,EAAY,CAAC,EACxBE,EAAaF,EAAY,CAAC,EAC1BG,EAAeP,EAAW,WAAW,CAACK,EAAUC,CAAU,CAAC,EACjEF,EAAY,CAAC,EAAIJ,EAAW,OAAOO,CAAY,EAE/C,IAAMC,EAAgBT,EAAK,WAAWK,CAAW,EAE7C,GAAKI,GAAiBA,EAAgBT,EAAK,OAAO,SACpDG,EAAO,OAAOC,CAAC,EAAIJ,EAAK,OAAOS,CAAa,GAIhD,OAAON,CACT,CCvBA,IAAAO,GAA0D,SAEpD,SAAUC,GACZC,EAAmBC,EAAoBC,EACvCC,EAAe,CACjB,IAAMC,EAAO,QAAK,uBACdD,EAA0B,QAAK,cAAcD,CAAQ,CAAC,EAE1D,QAASG,EAAI,EAAGA,EAAID,EAAK,OAAQ,EAAEC,EAAG,CACpC,IAAMC,EAASD,EAAIJ,EACfM,EAAMP,EAAMM,CAAM,EACtB,QAASE,EAAI,EAAGA,EAAIP,EAAY,EAAEO,EAAG,CACnC,IAAMC,EAAQT,EAAMM,EAASE,CAAC,GAC1B,OAAO,MAAMC,CAAK,GAClBA,EAAQF,KACVA,EAAME,GAGVL,EAAKC,CAAC,EAAIE,EAEZ,OAAOH,CACT,CCrBA,IAAAM,GAAoC,SAK7B,IAAMC,GAAcC,IACtB,CAACC,EAAQC,IAAW,KAAK,IAAID,EAAkBC,CAAgB,EAAE,EACzDC,GAAUC,GAAiB,WAASL,EAAW,EAE/CM,GAA8B,CACzC,WAAY,WACZ,YAAa,MACb,WAAYF,ICZd,IAAAG,GAAoC,SAK7B,IAAMC,GAAcC,IACtB,CAACC,EAAQC,IAAW,KAAK,IAAID,EAAkBC,CAAgB,EAAE,EACzDC,GAAUC,GAAiB,WAASL,EAAW,EAE/CM,GAA8B,CACzC,WAAY,WACZ,YAAa,MACb,WAAYF,ICZd,IAAAG,GAAqC,SAI9B,IAAMC,GAAeC,IACvB,CAACC,EAAgBC,IAAmBD,EAASC,EAAO,EAC5CC,GACTC,IAA+B,CAACC,EAAOC,EAAOC,EAAOC,KAC5C,CACL,KAAMH,EAAQE,EAAQD,EAAQE,EAC9B,KAAMH,EAAQG,EAAQF,EAAQC,IAEhC,EAEOE,GACTC,GAAiB,YAAUX,GAAcI,EAAmB,EAEnDQ,GAA+B,CAC1C,WAAY,YACZ,YAAa,MACb,WAAYF,ICpBd,IAAAG,GAAsI,SCAtI,IAAAC,GAA2G,SCC3G,IAAAC,GAAmB,SAEb,SAAUC,GACZC,EAAmBC,EAAkBC,EAAiBC,EACtDC,EAAkB,CACpB,IAAMC,EAAQJ,EAAO,OACfK,EAAQ,QAAK,cAAcL,CAAM,EACjCM,EAAW,QAAK,eAAeN,CAAM,EACrCO,EAAa,QAAK,eAAeJ,CAAQ,EAEzCK,EAAS,QAAK,uBAChBP,EAA0B,QAAK,cAAcE,CAAQ,CAAC,EAE1D,QAASM,EAAI,EAAGA,EAAIJ,EAAO,EAAEI,EAAG,CAC9B,IAAMC,EAAM,QAAK,WAAWD,EAAGL,EAAOE,CAAQ,EAGxCK,EAAmB,IAAI,MAAMD,EAAI,MAAM,EAC7C,QAASD,EAAI,EAAGA,EAAIE,EAAO,OAAQF,IACjCE,EAAOF,CAAC,EAAIC,EAAIR,EAAKO,CAAC,CAAC,EAGzB,IAAMG,EAAW,QAAK,WAAWD,EAAQP,EAAOG,CAAU,EAC1DC,EAAOI,CAAQ,EAAIb,EAAMU,CAAC,EAE5B,OAAOD,CACT,CDpBM,SAAUK,GAAUC,EAIzB,CACC,GAAM,CAAC,OAAAC,EAAQ,MAAAC,EAAO,QAAAC,CAAO,EAAIH,EAC3B,CAAC,EAAAI,CAAC,EAAIH,EACN,CAAC,KAAAI,CAAI,EAAIH,EAEfI,GAAiBF,EAAG,WAAW,EAE/B,IAAMG,EAAQH,EAAE,MAAM,OAEhBI,EAAqB,IAAI,MAAMD,CAAK,EAC1C,QAASE,EAAI,EAAGA,EAAID,EAAS,OAAQC,IACnCD,EAASC,CAAC,EAAIL,EAAE,MAAMC,EAAKI,CAAC,CAAC,EAG/B,IAAMC,EAASP,EAAQ,KAAK,IAAIC,EAAE,MAAM,EAAE,OACpCO,EAASC,GAAcF,EAAQN,EAAE,MAAOA,EAAE,MAAOC,EAAMG,CAAQ,EAGrE,MAAO,CAAC,OADOL,EAAQ,MAAMQ,EAAQH,EAAUJ,EAAE,KAAK,EACtC,MAAOI,EAAU,MAAOJ,EAAE,KAAK,CACjD,CAEO,IAAMS,GAAgC,CAC3C,WAAY,aACZ,YAAa,MACb,WAAYd,ID7BR,SAAUe,GACZC,EAAkBC,EAAkBC,EACpCC,EAAuB,CAEzB,GAAM,CAACC,EAAUC,CAAW,EACxB,gBAAa,0BAA0BL,EAAQG,CAAa,EAC1DG,KAAW,eAAWL,EAAQ,OAAO,EACrCM,EAAU,QAAK,oBACD,QAAK,cAAcH,CAAQ,EAAGE,CAAQ,EACpDE,EAAa,QAAK,cAAcH,CAAW,EAEjD,QAASI,EAAI,EAAGA,EAAIF,EAAQ,OAAQ,EAAEE,EAAG,CACvC,IAAMC,EAASD,EAAID,EACfG,EAAO,EACX,QAASC,EAAI,EAAGA,EAAIJ,EAAY,EAAEI,EAChCD,GAAQT,EAAMQ,EAASE,CAAC,EAE1BL,EAAQE,CAAC,EAAIE,EAGf,MAAO,CAAC,QAAAJ,EAAS,SAAAH,EAAU,SAAAE,CAAQ,CACrC,CAEM,SAAUK,GACZE,EAAqE,CAEvE,GAAM,CAAC,OAAAC,EAAQ,QAAAC,EAAS,MAAAC,CAAK,EAAIH,EAC3B,CAAC,EAAAI,CAAC,EAAIH,EACN,CAAC,KAAAI,EAAM,SAAAC,CAAQ,EAAIH,EAEzBI,GAAiBH,EAAG,MAAM,EAE1B,IAAMI,EAAQJ,EAAE,MAAM,OAChBK,EAAO,QAAK,eAAeJ,EAAMD,EAAE,KAAK,EAExCM,EAAc,gBAAa,mBAAmBD,EAAMD,CAAK,EAC3DlB,EAAgBmB,EAChBE,EAAYP,EACVQ,EAA0B,CAAA,EAC5BF,GAAe,OACjBC,EAAYE,GAAU,CAAC,OAAQ,CAAC,EAAAT,CAAC,EAAG,QAAAF,EAAS,MAAO,CAAC,KAAMQ,CAAW,CAAC,CAAC,EACxEE,EAAwB,KAAKD,CAAS,EACtCrB,EAAgB,gBAAa,iBAAiBA,EAAc,OAAQkB,CAAK,GAG3E,IAAMnB,EAAQa,EAAQ,KAAK,IAAIS,EAAU,MAAM,EAAE,OAC3C,CAAC,QAAAjB,EAAS,SAAAH,EAAU,SAAAE,CAAQ,EAC9BP,GAASyB,EAAU,MAAOA,EAAU,MAAOtB,EAAOC,CAAa,EAE/DwB,EAAcvB,EAClB,OAAIe,IACFQ,EAAc,gBAAa,qBAAqBvB,EAAUkB,CAAI,GAGhEG,EAAwB,QACpBG,GAAKb,EAAQ,8BAA8Ba,CAAC,CAAC,EAE1Cb,EAAQ,eAAeY,EAAarB,EAAUC,CAAO,CAC9D,CAEO,IAAMsB,GAA2B,CACtC,WAAY,QACZ,YAAa,MACb,WAAYlB,IGrEd,IAAAmB,GAAgC,SAE1B,SAAUC,GACZC,EAAeC,EAAcC,EAC7BC,EAAwB,CAC1B,IAAMC,EAAgBJ,IAAUC,EAC1BI,EAA8BL,EAAQC,GAAQC,EAAO,EACrDI,EAA8BL,EAAOD,GAASE,EAAO,EAE3D,GAAIE,GAAiBC,GACjBC,EACF,OAAO,QAAK,oBAAoB,EAAGH,CAAK,EAG1C,IAAMI,EAAc,KAAK,IAAI,KAAK,MAAMN,EAAOD,GAASE,CAAI,CAAC,EACvDM,EAAS,QAAK,oBAAoBD,EAAaJ,CAAK,EAEtDF,EAAOD,GAASE,IAAS,IAG3BA,EAAO,IAGTM,EAAO,CAAC,EAAIR,EACZ,QAASS,EAAI,EAAGA,EAAID,EAAO,OAAQC,IACjCD,EAAOC,CAAC,EAAID,EAAOC,EAAI,CAAC,EAAIP,EAE9B,OAAOM,CACT,CC5BA,IAAAE,GAAkC,SAK3B,IAAMC,GAAYC,GAAuBC,GAAO,EAAI,KAAK,KAAKA,CAAE,CAAC,EAC3DC,GAAQC,GAAwB,SAAOJ,EAAS,EAEhDK,GAA4B,CACvC,WAAY,SACZ,YAAa,MACb,WAAYF,ICXd,IAAAG,GAAgK,SAK1J,SAAUC,GACZC,EAAqBC,EAAiBC,EAAgBC,EACtDC,EAAe,CACjB,IAAMC,EAAc,cAAW,iBAAiBF,EAAOF,EAAOC,CAAI,EAC5DI,EAAS,QAAK,cAAcJ,CAAI,EAChCK,EAAW,QAAK,eAAeJ,CAAK,EAE1C,GAAIE,EAAa,CACf,IAAMG,EAAa,cAAW,kBAAkBP,EAAOM,CAAQ,EAE/D,OAAIH,IAAU,SACJJ,EAAsB,MAAMQ,EAAYA,EAAaF,CAAM,EAG7DN,EAAoB,SAASQ,EAAYA,EAAaF,CAAM,EAGtE,IAAMG,EAAcL,IAAU,SAC1B,gBAAa,uBAAuBJ,CAAoB,EACxDA,EAEEU,KAAQ,WAAOP,EAAOC,EAAOK,CAAW,EACxCE,KAAS,WAAOT,EAAME,CAAK,EACjC,QAASQ,EAAI,EAAGA,EAAID,EAAO,KAAM,EAAEC,EAAG,CACpC,IAAMC,EAASF,EAAO,WAAWC,CAAC,EAC5BE,EAAQD,EAAO,IAAI,CAACE,EAAaC,IAAMD,EAAMd,EAAMe,CAAC,CAAC,EAC3DL,EAAO,IAAID,EAAM,IAAI,GAAGI,CAAK,EAAG,GAAGD,CAAM,EAG3C,OAAIT,IAAU,SACL,gBAAa,uBAAuBO,EAAO,MAAkB,EAE/DA,EAAO,MAChB,CAEM,SAAUM,GACZC,EAAuE,CAEzE,GAAM,CAAC,OAAAC,EAAQ,QAAAC,EAAS,MAAAC,CAAK,EAAIH,EAC3B,CAAC,EAAAI,CAAC,EAAIH,EACN,CAAC,MAAAlB,EAAO,KAAAC,CAAI,EAAImB,EAEtBE,GAAiBD,EAAG,OAAO,EAE3B,GAAM,CAACE,EAAQC,CAAK,EAAI,cAAW,iBAAiBH,EAAGrB,EAAOC,CAAI,EAClE,cAAW,kBAAkBoB,EAAGE,EAAQC,CAAK,EAE7C,IAAMzB,EAAOoB,EAAQ,KAAK,IAAIE,EAAE,MAAM,EAAE,OAClCI,EAAU3B,GAAUC,EAAMwB,EAAQC,EAAOH,EAAE,MAAOA,EAAE,KAAK,EAC/D,OAAOF,EAAQ,eAAeK,EAAOH,EAAE,MAAOI,CAAO,CACvD,CCvDA,IAAAC,GAA8C,SAKvC,IAAMC,GACTC,IAA8B,CAACC,EAAWC,IAAa,CACrD,IAAMC,EAAOF,EAAIC,EACjB,OAAOC,EAAOA,CAChB,EAAE,EACOC,GACTC,GAAiB,qBAAmBN,EAAqB,EAEhDO,GAAwC,CACnD,WAAY,qBACZ,YAAa,MACb,WAAYF,IChBd,IAAAG,GAAyC,SAEnC,SAAUC,GACZC,EAAoBC,EAAuBC,EAC3CC,EAAe,CACjB,IAAMC,KAAS,WAAOJ,EAAUC,EAAK,KAAK,EAE1C,QAASI,EAAI,EAAGA,EAAID,EAAO,KAAMC,IAAK,CACpC,IAAMC,EAAMF,EAAO,WAAWC,CAAC,EAEzBE,EAAmB,IAAI,MAAMD,EAAI,MAAM,EAC7C,QAASE,EAAI,EAAGA,EAAID,EAAO,OAAQC,IACjCD,EAAOC,CAAC,EAAIF,EAAIE,CAAC,EAAIN,EAAQM,CAAC,EAAIL,EAAMK,CAAC,EAE3CJ,EAAO,IAAIH,EAAK,IAAI,GAAGM,CAAM,EAAG,GAAGD,CAAG,EAGxC,OAAOF,CACT,CClBA,IAAAK,GAAgC,SAKzB,IAAMC,GAAUC,IAClB,CAACC,EAAgBC,IAAmBD,EAASC,EAAO,EAC5CC,GACTC,IAA+B,CAACC,EAAOC,EAAOC,EAAOC,KAC5C,CAAC,KAAMH,EAAQE,EAAO,KAAMD,EAAQE,CAAK,GAChD,EACOC,GAAMC,GAAiB,OAAKX,GAASI,EAAc,EAEnDQ,GAA0B,CACrC,WAAY,OACZ,YAAa,MACb,WAAYF,IChBd,IAAAG,GAAmD,SAO7C,SAAUC,GACZC,EACAC,EAAc,CAChB,IAAMC,EAAqB,IAAI,MAAMF,EAAK,IAAI,EAC9C,QAASG,EAAI,EAAGA,EAAID,EAAS,OAAQC,IACnCD,EAASC,CAAC,EAAIH,EAAK,MAAMG,CAAC,EAAIF,EAAKE,CAAC,EAEtC,IAAMC,KAAS,WAAOF,EAAUF,EAAK,KAAK,EAC1C,QAASG,EAAI,EAAGA,EAAIC,EAAO,OAAO,OAAQ,EAAED,EAAG,CAC7C,IAAME,EAASD,EAAO,WAAWD,CAAC,EAE5BG,EAAwB,IAAI,MAAMN,EAAK,IAAI,EACjD,QAASO,EAAI,EAAGA,EAAID,EAAY,OAAQC,IACtCD,EAAYC,CAAC,EAAIF,EAAOE,CAAC,EAAIP,EAAK,MAAMO,CAAC,EAG3C,IAAMC,EAAgBR,EAAK,WAAWM,CAAW,EAEjDF,EAAO,OAAOD,CAAC,EAAIH,EAAK,OAAOQ,CAAa,EAE9C,OAAOJ,CACT,I7BfA,oBAAgB,MAAO,IAAM,IAAIK,GAAkB,CAAgB,E8BbnE,IAAAC,GAA4H,SCA5H,IAAAC,GAA+F,SAIzF,SAAUC,GACZC,EACyE,CAE3E,GAAM,CAAC,OAAAC,EAAQ,QAAAC,EAAS,MAAAC,CAAK,EAAIH,EAC3B,CAAC,EAAAI,CAAC,EAAIH,EACN,CAAC,MAAAI,CAAK,EAAIF,EAEVG,EAAQ,QAAK,cAAcF,EAAE,KAAK,EAClCG,EAAS,QAAK,uBAAuBF,EAAOC,CAAK,EACjDE,EAAS,QAAK,cAAcD,CAAM,EAExC,QAAK,OACDD,IAAUE,EACV,IAAM,kBAAkBD,CAAM,SAASC,CAAM,gCAC/BJ,EAAE,KAAK,SAASE,CAAK,+EACe,EAEtDJ,EAAQ,OAAOE,EAAE,MAAM,EAEvB,IAAMK,EAAQP,EAAQ,KAAK,IAAIE,EAAE,MAAM,EAEvC,GAAIK,EAAM,oBAAsB,KAAM,CACpC,IAAMC,EAAOD,EAAM,mBAAmB,KAChCE,EAAOF,EAAM,mBAAmB,KAEtCC,EAAK,MAAQH,EACbI,EAAK,MAAQJ,EAGf,MAAO,CAAC,OAAQH,EAAE,OAAQ,MAAOG,EAAQ,MAAOH,EAAE,KAAK,CACzD,CAEO,IAAMQ,GAA8B,CACzC,WAAY,WACZ,YAAa,MACb,WAAYb,IDjCR,SAAUc,GAASC,EAIxB,CACC,GAAM,CAAC,OAAAC,EAAQ,QAAAC,EAAS,MAAAC,CAAK,EAAIH,EAC3B,CAAC,EAAAI,EAAG,QAAAC,CAAO,EAAIJ,EACf,CAAC,KAAAK,EAAM,UAAAC,CAAS,EAAIJ,EAE1BK,GAAiB,CAACJ,EAAGC,CAAO,EAAG,UAAU,EAGzC,IAAMI,EAAa,QAAK,eAAeH,EAAMF,EAAE,KAAK,EAAE,CAAC,EACjDM,EAAcR,EAAQ,KAAK,IAAIG,EAAQ,MAAM,EAAE,OAC/CM,EAAUP,EAAE,MAAMK,CAAU,EAClC,QAASG,EAAI,EAAGA,EAAIF,EAAY,OAAQ,EAAEE,EAAG,CAC3C,IAAMC,EAAQH,EAAYE,CAAC,EAC3B,QAAK,OACDC,GAASF,EAAU,GAAKE,GAAS,EACjC,IACI,6BAA6BA,CAAK,kBAAkBF,EAAU,CAAC,GAAG,EAG5E,IAAIG,EAAaP,EAEbA,GAAa,OACfO,EAAa,GAGf,IAAMC,EAAc,QAAK,cAAcV,EAAQ,KAAK,EAE9CW,EAAY,gBAAa,aAAa,yBACxCZ,EAAGC,EAASI,EAAYK,CAAU,EAEhCG,EAAWC,GAAQ,CACvB,OAAQ,CAAC,EAAAd,CAAC,EACV,QAAAF,EACA,MAAO,CACL,MAAO,CACLc,EAAU,UAAWA,EAAU,UAAWA,EAAU,QACpDA,EAAU,YAGf,EAEKG,EAAeD,GAAQ,CAC3B,OAAQ,CAAC,EAAGb,CAAO,EACnB,QAAAH,EACA,MAAO,CAAC,MAAO,CAACc,EAAU,UAAWD,EAAcC,EAAU,SAAS,CAAC,EACxE,EAEKI,EAAqB,CACzBJ,EAAU,UAAWA,EAAU,UAAWD,EAAcC,EAAU,UAClEA,EAAU,WAGNK,EAAanB,EAAQ,WAAWiB,CAAY,EAC5CG,EAAOpB,EAAQ,WAAWe,CAAQ,EAClCM,EAASC,GAAaF,EAAMD,EAAYD,CAAkB,EAEhE,OAAAlB,EAAQ,8BAA8Be,CAAQ,EAC9Cf,EAAQ,8BAA8BiB,CAAY,EAE3CjB,EAAQ,eACXc,EAAU,YAAaO,EAAO,MAAOA,EAAO,MAAM,CACxD,CAEO,IAAME,GAA+B,CAC1C,WAAY,YACZ,YAAa,MACb,WAAY1B,IE7Ed,IAAA2B,GAAwG,SAKlG,SAAUC,GAAWC,EAI1B,CACC,GAAM,CAAC,OAAAC,EAAQ,QAAAC,EAAS,MAAAC,CAAK,EAAIH,EAC3B,CAAC,MAAAI,CAAK,EAAIH,EACV,CAAC,IAAAI,CAAG,EAAIF,EAERG,EAAYF,EAAM,MAAM,OACxBG,EAAWH,EAAM,MAAM,MAAK,EAC9BI,EAAOH,EACX,OAAIA,EAAM,IAER,QAAK,OACD,EAAEC,EAAY,IAAMD,EACpB,IAAM,iCAAiC,EAAGC,EAAY,EAAE,KACpDA,CAAS,GAAG,EACpBE,EAAOF,EAAYD,EAAM,GAE3BE,EAAS,OAAOC,EAAM,EAAG,CAAC,EAEnBC,GAAQ,CAAC,OAAQ,CAAC,EAAGL,CAAK,EAAG,QAAAF,EAAS,MAAO,CAAC,MAAOK,CAAQ,CAAC,CAAC,CACxE,CAEO,IAAMG,GAAiC,CAC5C,WAAY,cACZ,YAAa,MACb,WAAYX,ICjCd,IAAAY,GAAgI,SAQ1H,SAAUC,GAAaC,EAI5B,CACC,GAAM,CAAC,OAAAC,EAAQ,QAAAC,EAAS,MAAAC,CAAK,EAAIH,EAC3B,CAAC,EAAAI,CAAC,EAAIH,EACN,CACJ,MAAAI,EACA,IAAAC,EACA,QAAAC,EACA,UAAAC,EACA,QAAAC,EACA,aAAAC,EACA,YAAAC,EACA,eAAAC,CAAc,EACZT,EAEJU,GAAiBT,EAAG,cAAc,EAElC,GAAM,CACJ,iBAAAU,EACA,WAAAC,EACA,WAAAC,EACA,UAAAC,EACA,cAAAC,EACA,MAAOC,EACP,IAAKC,EACL,QAASC,CAAQ,EAEf,cAAW,UACPjB,EAAE,MAAOC,EAAOC,EAAKC,EAASC,EAAWC,EAASC,EAClDC,EAAaC,CAAc,EAE/BU,EAIJ,GAAIN,EAEFM,EAASC,GAAQ,CAAC,OAAQ,CAAC,EAAAnB,CAAC,EAAG,QAAAF,EAAS,MAAO,CAAC,MAAOa,CAAU,CAAC,CAAC,UAC1DE,GAAaC,EAAe,CAErC,QAAK,OACDd,EAAE,MAAM,QAAU,EAClB,IAAM,yCAAyCA,EAAE,MAAM,MAAM,EAAE,EAEnE,IAAMoB,EAAO,cAAW,gBAAgBL,EAAQC,EAAMC,CAAQ,EAExDI,EAASC,GAAM,CAAC,OAAQ,CAAC,EAAAtB,CAAC,EAAG,QAAAF,EAAS,MAAO,CAAC,MAAOiB,EAAQ,KAAAK,CAAI,CAAC,CAAC,EACzEF,EACIC,GAAQ,CAAC,OAAQ,CAAC,EAAGE,CAAM,EAAG,QAAAvB,EAAS,MAAO,CAAC,MAAOa,CAAU,CAAC,CAAC,EACtEb,EAAQ,8BAA8BuB,CAAM,MACvC,CACL,IAAME,EAAOzB,EAAQ,WAA4BE,CAAC,EAC5CwB,EAASC,GAAiBf,EAAkBa,EAAMN,EAAUF,CAAM,EAExEG,EAASpB,EAAQ,eAAea,EAAYa,EAAO,MAAOA,EAAO,MAAM,EAGzE,OAAON,CACT,CAEO,IAAMQ,GAAmC,CAC9C,WAAY,gBACZ,YAAa,MACb,WAAY/B,IC1Ed,IAAAgC,GAAsF,SCAtF,IAAAC,GAA0G,SCIpG,SAAUC,GAAKC,EAAmD,CAEtE,GAAM,CAAC,OAAAC,EAAQ,QAAAC,CAAO,EAAIF,EACpB,CAAC,MAAAG,CAAK,EAAIF,EAEVF,EAAOG,EAAQ,KAAK,IAAIC,EAAM,MAAM,EAAE,mBAAmB,KACzDC,EAAUF,EAAQ,KAAK,IAAIH,EAAK,MAAM,EAAE,OAK9C,OAAOG,EAAQ,eAAeH,EAAK,MAAOA,EAAK,MAAOK,CAAO,CAC/D,CDLM,SAAUC,GACZC,EAAyE,CAE3E,GAAM,CAAC,OAAAC,EAAQ,QAAAC,EAAS,MAAAC,CAAK,EAAIH,EAC3B,CAAC,KAAAI,CAAI,EAAID,EAETE,EAAQ,QAAK,eAAeD,EAAMH,EAAO,CAAC,EAAE,KAAK,EAAE,CAAC,EAEpDK,EAASL,EAAO,IAAIM,GAAKA,EAAE,KAAK,EACtC,gBAAa,uBAAuBD,EAAQD,CAAK,EAEjD,IAAIG,EAAW,gBAAa,gBAAgBP,EAAO,IAAIM,GAAKA,EAAE,KAAK,EAAGF,CAAK,EAE3E,GAAI,QAAK,cAAcG,CAAQ,IAAM,EACnC,OAAON,EAAQ,eAAeM,EAAUP,EAAO,CAAC,EAAE,MAAO,CAAA,CAAE,EAI7D,IAAMQ,EAAUR,EAAO,OAAOM,GAAK,QAAK,cAAcA,EAAE,KAAK,EAAI,CAAC,EAClE,GAAIE,EAAQ,SAAW,EACrB,OAAOC,GAAS,CAAC,OAAQ,CAAC,EAAGD,EAAQ,CAAC,CAAC,EAAG,QAAAP,CAAO,CAAC,EAGpD,GAAIO,EAAQ,CAAC,EAAE,QAAU,YAAa,CACpC,IAAME,EAAQF,EAAQ,IAAKF,GAAMK,GAAK,CAAC,OAAQ,CAAC,MAAOL,CAAC,EAAG,QAAAL,CAAO,CAAC,CAAC,EAC9DW,EAAQJ,EAAQ,IAAKF,GAAMO,GAAK,CAAC,OAAQ,CAAC,MAAOP,CAAC,EAAG,QAAAL,CAAO,CAAC,CAAC,EAE9Da,EAAehB,GAAO,CAAC,OAAQY,EAAO,QAAAT,EAAS,MAAO,CAAC,KAAMG,CAAK,CAAC,CAAC,EACpEW,EAAejB,GAAO,CAAC,OAAQc,EAAO,QAAAX,EAAS,MAAO,CAAC,KAAMG,CAAK,CAAC,CAAC,EAEpEY,EACFC,GAAQ,CAAC,OAAQ,CAAC,KAAMH,EAAc,KAAMC,CAAY,EAAG,QAAAd,CAAO,CAAC,EAEvE,OAAAS,EAAM,QAAQQ,GAAKjB,EAAQ,8BAA8BiB,CAAC,CAAC,EAC3DN,EAAM,QAAQO,GAAKlB,EAAQ,8BAA8BkB,CAAC,CAAC,EAC3DlB,EAAQ,8BAA8Ba,CAAY,EAClDb,EAAQ,8BAA8Bc,CAAY,EAE3CC,EAUT,IAAMI,EAAWZ,EAAQ,IAAIF,GAAI,CAE/B,IAAMe,EAAQ,CAAC,GADG,QAAK,cAAcf,EAAE,MAAM,MAAMF,CAAK,CAAC,CAC7B,EAC5B,OAAOkB,GAAQ,CAAC,OAAQ,CAAC,EAAGhB,CAAC,EAAG,QAAAL,EAAS,MAAO,CAAC,MAAAoB,CAAK,CAAC,CAAC,CAC1D,CAAC,EAEKE,EAAkBH,EAAS,IAAId,IAC5B,CAAC,KAAML,EAAQ,KAAK,IAAIK,EAAE,MAAM,EAAE,OAAQ,MAAOA,EAAE,KAAK,EAChE,EAGDC,EACI,gBAAa,gBAAgBa,EAAS,IAAId,GAAKA,EAAE,KAAK,EAAG,CAAY,EACzE,IAAMkB,EAAeJ,EAAS,CAAC,EAAE,MAAM,CAAC,IAAM,EACxCK,EACFC,GAAWH,EAAiBhB,EAAUP,EAAO,CAAC,EAAE,MAAOwB,CAAY,EAEjEG,EACF,gBAAa,gBAAgBnB,EAAQ,IAAIF,GAAKA,EAAE,KAAK,EAAGF,CAAK,EAE3DwB,EACF3B,EAAQ,eAAe0B,EAAe3B,EAAO,CAAC,EAAE,MAAOyB,CAAO,EAElE,OAAAL,EAAS,QAAQd,GAAKL,EAAQ,8BAA8BK,CAAC,CAAC,EAEvDsB,CACT,CAEO,IAAMC,GAA6B,CACxC,WAAY,UACZ,YAAa,MACb,WAAY/B,IDpFR,SAAUgC,GACZC,EAAqE,CAEvE,GAAM,CAAC,OAAAC,EAAQ,QAAAC,EAAS,MAAAC,CAAK,EAAIH,EAC3B,CAAC,KAAAI,CAAI,EAAID,EAEf,GAAIF,EAAO,SAAW,EACpB,OAAOI,GACH,CAAC,OAAQ,CAAC,MAAOJ,EAAO,CAAC,CAAC,EAAG,QAAAC,EAAS,MAAO,CAAC,IAAKE,CAAI,CAAC,CAAC,EAG/D,IAAME,EAAQL,EAAO,CAAC,EAAE,MAClBM,EAAQN,EAAO,CAAC,EAAE,MAExBA,EAAO,QAAQO,GAAI,CACjB,QAAK,kBACDF,EAAOE,EAAE,MACT,uDAAuD,EAC3D,QAAK,OACDD,IAAUC,EAAE,MACZ,IAAM,uDAAuD,CACnE,CAAC,EAED,IAAMC,EAAwC,CAAA,EACxCC,EAAkBT,EAAO,IAAIO,GAAI,CACrC,IAAMG,EACFN,GAAW,CAAC,OAAQ,CAAC,MAAOG,CAAC,EAAG,QAAAN,EAAS,MAAO,CAAC,IAAKE,CAAI,CAAC,CAAC,EAChE,OAAAK,EAAwB,KAAKE,CAAS,EAC/BA,CACT,CAAC,EAEKC,EAASC,GAAO,CAAC,OAAQH,EAAiB,QAAAR,EAAS,MAAO,CAAC,KAAAE,CAAI,CAAC,CAAC,EAEvE,OAAAK,EAAwB,QACpBD,GAAKN,EAAQ,8BAA8BM,CAAC,CAAC,EAE1CI,CACT,CAEO,IAAME,GAA2B,CACtC,WAAY,QACZ,YAAa,MACb,WAAYf,IGhDd,IAAAgB,GAAsE,SAKhE,SAAUC,GAAMC,EAAkD,CAEtE,GAAM,CAAC,QAAAC,EAAS,MAAAC,CAAK,EAAIF,EACnB,CAAC,MAAAG,EAAO,KAAAC,EAAM,MAAAC,EAAO,KAAAC,CAAI,EAAIJ,EAE7BK,EAASC,GAAUL,EAAOC,EAAME,EAAMD,CAAK,EACjD,OAAOJ,EAAQ,eAAe,CAACM,EAAO,MAAM,EAAGF,EAAOE,CAAM,CAC9D,CAEO,IAAME,GAA4B,CACvC,WAAY,SACZ,YAAa,MACb,WAAYV,ICjBd,IAAAW,GAAoG,SCApG,IAAAC,GAAoC,SAK7B,IAAMC,GACTC,GAA6B,CAACC,EAAWC,IAAcD,EAAIC,CAAC,EACnDC,GAAMC,GAAiB,WAASL,EAAW,EAE3CM,GAA8B,CACzC,WAAY,WACZ,YAAa,MACb,WAAYF,ICZd,IAAAG,GAA6G,SAUvG,SAAUC,GACZC,EAAmE,CAErE,GAAM,CAAC,OAAAC,EAAQ,QAAAC,EAAS,MAAAC,CAAK,EAAIH,EAC3B,CAAC,EAAAI,CAAC,EAAIH,EACN,CAAC,KAAAI,EAAM,SAAAC,CAAQ,EAAIH,EAEzBI,GAAiBH,EAAG,KAAK,EAEzB,IAAII,EACAJ,EAAE,QAAU,OACdI,EAAKC,GAAK,CAAC,OAAQ,CAAC,EAAAL,CAAC,EAAG,QAAAF,EAAS,MAAO,CAAC,MAAO,OAAO,CAAC,CAAC,EAEzDM,EAAKE,GAAS,CAAC,OAAQ,CAAC,EAAAN,CAAC,EAAG,QAAAF,CAAO,CAAC,EAGtC,IAAMS,EAAQH,EAAG,MAAM,OACjBI,EAAO,QAAK,eAAeP,EAAMG,EAAG,KAAK,EACzCK,EAAc,gBAAa,mBAAmBD,EAAMD,CAAK,EAE3DG,EAAgBF,EAChBG,EAAYP,EACZK,GAAe,OACjBE,EACIC,GAAU,CAAC,OAAQ,CAAC,EAAGR,CAAE,EAAG,QAAAN,EAAS,MAAO,CAAC,KAAMW,CAAW,CAAC,CAAC,EACpEC,EAAgB,gBAAa,iBAAiBA,EAAc,OAAQH,CAAK,GAG3E,gBAAa,2BACT,MAAOG,EAAeC,EAAU,MAAM,MAAM,EAEhD,GAAM,CAACE,EAAUC,CAAW,EACxB,gBAAa,0BAA0BH,EAAU,MAAOD,CAAa,EACnEK,EAAc,gBAAa,WAAWJ,EAAU,MAAO,OAAO,EAChEK,EAASC,GAAMnB,EAASe,EAAUE,CAAW,EAC3CG,EAAa,QAAK,cAAcJ,CAAW,EAC3CK,EAAOrB,EAAQ,KAAK,IAAIkB,EAAO,MAAM,EAAE,OAEvCI,EAAQtB,EAAQ,KAAK,IAAIa,EAAU,MAAM,EAAE,OACjD,QAASU,EAAI,EAAGA,EAAIF,EAAK,OAAQ,EAAEE,EAAG,CACpC,IAAMC,EAASD,EAAIH,EACfvB,EAAM,EACV,QAAS4B,EAAI,EAAGA,EAAIL,EAAY,EAAEK,EAChC5B,GAAOyB,EAAME,EAASC,CAAC,EAEzBJ,EAAKE,CAAC,EAAI1B,EAGZ,GAAIO,EAAU,CACZ,IAAMsB,EAAW,gBAAa,qBAAqBR,EAAO,MAAOR,CAAI,EAC/DiB,EAAYT,EAClBA,EAASU,GAAQ,CAAC,OAAQ,CAAC,EAAGV,CAAM,EAAG,QAAAlB,EAAS,MAAO,CAAC,MAAO0B,CAAQ,CAAC,CAAC,EACzE1B,EAAQ,8BAA8B2B,CAAS,EAGjD,OAAA3B,EAAQ,8BAA8BM,CAAE,EAEpCK,GAAe,MACjBX,EAAQ,8BAA8Ba,CAAS,EAG1CK,CACT,CAEO,IAAMW,GAA0B,CACrC,WAAY,OACZ,YAAa,MACb,WAAYhC,IFtER,SAAUiC,GACZC,EAAqE,CAEvE,GAAM,CAAC,OAAAC,EAAQ,QAAAC,EAAS,MAAAC,CAAK,EAAIH,EAC3B,CAAC,EAAAI,CAAC,EAAIH,EACN,CAAC,KAAAI,EAAM,SAAAC,CAAQ,EAAIH,EAEnBI,EAAO,QAAK,eAAeF,EAAMD,EAAE,KAAK,EAExCI,EADS,gBAAa,0BAA0BJ,EAAE,MAAOG,CAAI,EACxC,CAAC,EACtBE,EAAa,QAAK,cAAcD,CAAW,EAC3CE,EAAY,CAAA,EACZC,EACFT,EAAQ,eAAe,CAAA,EAAI,UAAW,IAAI,aAAa,CAACO,CAAU,CAAC,CAAC,EACxEC,EAAU,KAAKC,CAAgB,EAE/B,IAAMC,EAAKC,GAAK,CAAC,OAAQ,CAAC,EAAAT,CAAC,EAAG,QAAAF,EAAS,MAAO,CAAC,MAAO,SAAS,CAAC,CAAC,EACjEQ,EAAU,KAAKE,CAAE,EAEjB,IAAME,EACFC,GAAI,CAAC,OAAQ,CAAC,EAAGH,EAAI,EAAGD,CAAgB,EAAG,QAAAT,CAAO,CAAC,EACvDQ,EAAU,KAAKI,CAAG,EAElB,IAAME,EAASC,GAAI,CAAC,OAAQ,CAAC,EAAGH,CAAG,EAAG,QAAAZ,EAAS,MAAO,CAAC,KAAAG,EAAM,SAAAC,CAAQ,CAAC,CAAC,EAEvE,OAAAI,EAAU,QAAQQ,GAAKhB,EAAQ,8BAA8BgB,CAAC,CAAC,EAExDF,CACT,CAEO,IAAMG,GAA2B,CACtC,WAAY,QACZ,YAAa,MACb,WAAYpB,IGxCd,IAAAqB,GAAmI,SAO7H,SAAUC,GAAYC,EAI3B,CACC,GAAM,CAAC,OAAAC,EAAQ,QAAAC,EAAS,MAAAC,CAAK,EAAIH,EAC3B,CAAC,EAAG,EAAAI,CAAC,EAAIH,EACT,CAAC,WAAAI,EAAY,WAAAC,CAAU,EAAIH,EAEjCI,GAAiB,CAAC,EAAGH,CAAC,EAAG,QAAQ,EAEjC,IAAMI,EAAQ,EAAE,MAAM,OAChBC,EAAQL,EAAE,MAAM,OAEhBM,EAAcL,EAAa,EAAE,MAAMG,EAAQ,CAAC,EAAI,EAAE,MAAMA,EAAQ,CAAC,EACjEG,EAAcL,EAAaF,EAAE,MAAMK,EAAQ,CAAC,EAAIL,EAAE,MAAMK,EAAQ,CAAC,EAEjEG,EAAcP,EAAa,EAAE,MAAMG,EAAQ,CAAC,EAAI,EAAE,MAAMA,EAAQ,CAAC,EACjEK,EAAcP,EAAaF,EAAE,MAAMK,EAAQ,CAAC,EAAIL,EAAE,MAAMK,EAAQ,CAAC,EAEjEK,EAAa,EAAE,MAAM,MAAM,EAAG,EAAE,EAChCC,EAAaX,EAAE,MAAM,MAAM,EAAG,EAAE,EAEhCY,EAAY,QAAK,cAAcF,CAAU,EACzCG,EAAY,QAAK,cAAcF,CAAU,EAIzCG,EAFoB,kBAAe,2BACrC,EAAE,MAAM,MAAM,EAAG,EAAE,EAAGd,EAAE,MAAM,MAAM,EAAG,EAAE,CAAC,EACX,OAAO,CAACQ,EAAaC,CAAW,CAAC,EAEpE,QAAK,OACDH,IAAgBC,EAChB,IAAM,kCAAkCD,CAAW,UAC5CC,CAAW,4BAA4B,EAAE,KAAK,QAC9CP,EAAE,KAAK,mBAAmBC,CAAU,mBACpBC,CAAU,cAAc,EAEnD,IAAMa,EAAWd,EAAa,CAACW,EAAWN,EAAaE,CAAW,EACpC,CAACI,EAAWJ,EAAaF,CAAW,EAC5DU,EAAWd,EAAa,CAACW,EAAWJ,EAAaF,CAAW,EACpC,CAACM,EAAWN,EAAaE,CAAW,EAG5DQ,EAAMC,GAAQ,CAAC,OAAQ,CAAC,EAAG,CAAC,EAAG,QAAApB,EAAS,MAAO,CAAC,MAAOiB,CAAQ,CAAC,CAAC,EACjEI,EAAMD,GAAQ,CAAC,OAAQ,CAAC,EAAGlB,CAAC,EAAG,QAAAF,EAAS,MAAO,CAAC,MAAOkB,CAAQ,CAAC,CAAC,EAEjEI,EAAYnB,EAAagB,EAAI,MAAM,CAAC,EAAIA,EAAI,MAAM,CAAC,EACnDI,EAAUpB,EAAagB,EAAI,MAAM,CAAC,EAAIA,EAAI,MAAM,CAAC,EACjDK,EAAWpB,EAAaiB,EAAI,MAAM,CAAC,EAAIA,EAAI,MAAM,CAAC,EAClDI,EAAW,KAAK,IAAIX,EAAWC,CAAS,EAExCW,EAAY1B,EAAQ,KAAK,IAAImB,EAAI,MAAM,EAAE,OACzCQ,EAAY3B,EAAQ,KAAK,IAAIqB,EAAI,MAAM,EAAE,OAEzCO,EAAa,QAAK,eAAeT,EAAI,KAAK,EAC1CU,EAAa,QAAK,eAAeR,EAAI,KAAK,EAE1C,CAACS,EAAQC,GAAYC,CAAU,EAAI7B,EACrC,CAACyB,EAAW,CAAC,EAAG,EAAGA,EAAW,CAAC,CAAC,EAChC,CAACA,EAAW,CAAC,EAAGA,EAAW,CAAC,EAAG,CAAC,EAC9B,CAACK,EAAYC,EAAYC,EAAM,EAAI/B,EACrC,CAAC,EAAGyB,EAAW,CAAC,EAAGA,EAAW,CAAC,CAAC,EAChC,CAACA,EAAW,CAAC,EAAG,EAAGA,EAAW,CAAC,CAAC,EAE9BO,GAAOb,EAAUC,EACjBa,MAAS,WAAO,CAACZ,EAAUF,EAASC,CAAQ,EAAGL,EAAI,KAAK,EAExDmB,GAAUD,GAAO,OACjBE,GAAYvC,EAAQ,UAE1B,QAASwC,GAAK,EAAGA,GAAKf,EAAUe,KAAM,CACpC,IAAMC,GAAcD,GAAK1B,EACnB4B,GAAcF,GAAKzB,EACzB,QAAS4B,GAAK,EAAGA,GAAKpB,EAASoB,IAAMJ,GAAW,CAE9C,IAAMK,GAAS,KAAK,IAAID,GAAKJ,GAAWhB,CAAO,EAC/C,QAASsB,GAAK,EAAGA,GAAKrB,EAAUqB,IAAMN,GAAW,CAC/C,IAAMO,GAAS,KAAK,IAAID,GAAKN,GAAWf,CAAQ,EAChD,QAASuB,GAAK,EAAGA,GAAKzB,EAAWyB,IAAMR,GAAW,CAChD,IAAMS,GAAS,KAAK,IAAID,GAAKR,GAAWjB,CAAS,EAEjD,QAAS2B,GAAIN,GAAIM,GAAIL,GAAQK,KAC3B,QAASC,GAAIL,GAAIK,GAAIJ,GAAQI,KAAK,CAChC,IAAIC,GAAM,EAEV,QAASC,GAAIL,GAAIK,GAAIJ,GAAQI,KAAK,CAChC,IAAMC,GAEF3B,EAAUe,GAAcX,EAASmB,GAAIlB,GAAaqB,GAAIpB,CAAU,EAC9DsB,GAEF3B,EAAUyB,GAAInB,EAAaiB,GAAIhB,EAAaQ,GAAcP,EAAM,EACpEgB,IAAOE,GAAOC,GAEhBhB,GAAQE,GAAKJ,IAAQa,GAAIzB,EAAW0B,GAAE,GAAKC,OAQvD,OAAAnD,EAAQ,8BAA8BmB,CAAG,EACzCnB,EAAQ,8BAA8BqB,CAAG,EAGlCrB,EAAQ,eACXgB,EAAUqB,GAAO,MAAOA,GAAO,MAAoB,CACzD,CAEO,IAAMkB,GAAkC,CAC7C,WAAY,eACZ,YAAa,MACb,WAAY1D,ICxHd,IAAA2D,GAA6G,SCC7G,IAAAC,GAAyC,SACzCA,GAA+B,SAQzB,SAAUC,GACZC,EAAmE,CAErE,GAAM,CAAC,OAAAC,EAAQ,QAAAC,EAAS,MAAAC,CAAK,EAAIH,EAC3B,CAAC,EAAAI,CAAC,EAAIH,EACN,CAAC,iBAAAI,EAAkB,SAAAC,CAAQ,EAAIH,EAC/BI,EAAaL,EACfM,EAASJ,EAAE,MACTK,EAAQD,EAAO,OAEfE,EAAW,QAAK,eAAeL,EAAkBG,CAAM,EACzDG,EAAOD,EACLE,EAAe,gBAAa,mBAAmBD,EAAMF,CAAK,EAC5DI,EAAQN,EAAW,KAAK,IAAIH,EAAE,MAAM,EAAE,OAC1C,GAAIQ,GAAgB,KAAM,CACxB,IAAME,EAAqB,IAAI,MAAML,CAAK,EAC1C,QAASM,EAAI,EAAGA,EAAID,EAAS,OAAQC,IACnCD,EAASC,CAAC,EAAIP,EAAOI,EAAaG,CAAC,CAAC,EAGtCF,EAAQG,GAAcH,EAAOL,EAAQJ,EAAE,MAAOQ,EAAcE,CAAQ,EACpEH,EAAO,gBAAa,iBAAiBA,EAAK,OAAQF,CAAK,EAEvDD,EAASM,EAGXG,GAAiBb,EAAG,KAAK,EACzB,gBAAa,2BAA2B,MAAOO,EAAMF,CAAK,EAC1D,GAAM,CAACS,EAAaC,CAAW,EAC3B,gBAAa,0BAA0BX,EAAQG,CAAI,EAEjDS,EAAa,QAAK,cAAcD,CAAW,EAE3CE,EAASC,GAAQT,EAAOO,EAAYF,EAAad,EAAE,KAAK,EACxDmB,EAAShB,EAAW,MAAMc,EAAQH,EAAad,EAAE,KAAK,EAExDoB,EAAWN,EACf,OAAIZ,IAGFkB,EADiB,gBAAa,qBAAqBN,EAAaR,CAAQ,GAInE,CAAC,OAAAa,EAAQ,MAAOC,EAAU,MAAOpB,EAAE,KAAK,CACjD,CD3CM,SAAUqB,GACZC,EACyE,CAE3E,GAAM,CAAC,OAAAC,EAAQ,QAAAC,EAAS,MAAAC,CAAK,EAAIH,EAC3B,CAAC,OAAAI,CAAM,EAAIH,EACX,CAAC,IAAAI,CAAG,EAAIF,EAERG,EAAaF,EAAO,MAAM,OAE5BG,EAAOF,EAIX,GAHIE,IAAS,KACXA,EAAOD,EAAa,GAElBC,IAASD,EAAa,EACxB,MAAM,MACF,4EACmBA,CAAU,gBAAgBC,CAAI,EAAE,EAGzD,IAAMC,EAAO,QAAK,eAAe,CAACD,CAAI,EAAGH,EAAO,KAAK,EAC/CK,EAAWC,GAAI,CACnB,OAAQ,CAAC,EAAGN,CAAM,EAClB,QAAAF,EACA,MAAO,CAAC,iBAAkBM,EAAM,SAAU,EAAK,EAChD,EACKG,EAAgB,gBAAa,qBAAqBF,EAAS,MAAOD,CAAI,EAEtEI,EACFC,GAAQ,CAAC,OAAQ,CAAC,EAAGJ,CAAQ,EAAG,QAAAP,EAAS,MAAO,CAAC,MAAOS,CAAa,CAAC,CAAC,EACrEG,EACFC,GAAI,CAAC,OAAQ,CAACX,EAAW,EAAGQ,CAAgB,EAAG,QAAAV,CAAO,CAAC,EACrDc,EAAIC,GAAI,CAAC,OAAQ,CAAC,EAAGH,CAAC,EAAG,QAAAZ,CAAO,CAAC,EACjCgB,EACFC,GAAI,CAAC,OAAQ,CAAC,EAAGH,CAAC,EAAG,QAAAd,EAAS,MAAO,CAAC,KAAMM,EAAM,SAAU,EAAK,CAAC,CAAC,EACjEY,EACFP,GAAQ,CAAC,OAAQ,CAAC,EAAGK,CAAM,EAAG,QAAAhB,EAAS,MAAO,CAAC,MAAOS,CAAa,CAAC,CAAC,EAEnEU,EAASC,GAAI,CAAC,OAAQ,CAAC,EAAGN,EAAGI,CAAc,EAAG,QAAAlB,CAAO,CAAC,EAE5D,OAAAA,EAAQ,8BAA8BO,CAAQ,EAC9CP,EAAQ,8BAA8BU,CAAgB,EACtDV,EAAQ,8BAA8BY,CAAC,EACvCZ,EAAQ,8BAA8Bc,CAAC,EACvCd,EAAQ,8BAA8BgB,CAAM,EAC5ChB,EAAQ,8BAA8BkB,CAAW,EAE1CC,CACT,CAEO,IAAME,GAA8B,CACzC,WAAY,WACZ,YAAa,MACb,WAAYxB,IEhEd,IAAAyB,GAA8C,SAI9C,IAAMC,GAAI,gBAAa,MACjBC,GAAK,gBAAa,OAClBC,GAAK,gBAAa,OAClBC,GAAK,gBAAa,OAClBC,GAAK,gBAAa,OAClBC,GAAK,gBAAa,OAEXC,GAAMC,GACf,OACCC,GAAM,CACL,IAAMC,EAAO,KAAK,KAAKD,CAAE,EACnBE,EAAI,KAAK,IAAIF,CAAE,EACfG,EAAI,GAAO,EAAMX,GAAIU,GAC3B,OAAOD,GACF,MACKJ,GAAKM,EAAIP,IAAMO,EAAKR,IAAMQ,EAAIT,IAAMS,EAAIV,IAAMU,EAC/C,KAAK,IAAI,CAACD,EAAIA,CAAC,EAC1B,CAAC,EAGQE,GAA0B,CACrC,WAAY,OACZ,YAAa,MACb,WAAYN,IC3Bd,IAAAO,GAAgF,SAM1E,SAAUC,GACZC,EAAqE,CAEvE,GAAM,CAAC,OAAAC,EAAQ,QAAAC,EAAS,MAAAC,CAAK,EAAIH,EAC3B,CAAC,EAAAI,CAAC,EAAIH,EACN,CAAC,KAAAI,CAAI,EAAIF,EAEfG,GAAiBF,EAAG,MAAM,EAC1B,IAAMG,EAASC,GAASN,EAAQ,WAAWE,CAAC,EAAGC,CAAI,EAEnD,OAAOH,EAAQ,eAAeK,EAAO,MAAOA,EAAO,MAAOA,EAAO,MAAM,CACzE,CAEO,IAAME,GAA2B,CACtC,WAAY,QACZ,YAAa,MACb,WAAYV,ICtBd,IAAAW,GAAmC,SAK5B,IAAMC,GAA6B,CACxC,WAAY,UACZ,YAAa,MACb,WAAY,CAAC,CAAC,OAAAC,EAAQ,QAAAC,CAAO,IAAK,CAChC,GAAM,CAAC,EAAAC,CAAC,EAAIF,EACNG,EAAaF,EACnBG,GAAiBF,EAAG,QAAQ,EAE5B,IAAMG,EAASF,EAAW,KAAK,IAAID,EAAE,MAAM,EAAE,OACvCI,EAAY,IAAI,aAAaD,EAAO,MAAM,EAChD,QAAS,EAAI,EAAG,EAAIA,EAAO,OAAQ,EAAE,EAAG,CACtC,IAAME,EAAQF,EAAO,CAAC,EACtBC,EAAU,CAAC,EAAIC,EAAQA,EAGzB,MAAO,CAAC,OADOJ,EAAW,MAAMG,EAAWJ,EAAE,MAAOA,EAAE,KAAK,EAC3C,MAAOA,EAAE,MAAO,MAAOA,EAAE,KAAK,CAChD,G/CNF,CAACM,GAAYC,GAAgBC,GAAkBC,GAAoBC,GAAeC,GAAYC,GAAWC,GAAgBC,GAAWC,GAAaC,GAAYC,GAAyBC,GAAaC,GAAYC,GAAcC,GAAmBC,GAAiBC,GAAeC,GAAWC,GAAYC,GAAWC,GAAeC,GAAeC,GAAeC,GAAcC,EAAc,EAAE,QAAQC,MAAK,mBAAeA,CAAC,CAAC,EjD5B3Z,OAAOC,OAAU,OACjB,OAAOC,OAAQ,KAGf,SAASC,GAA8BC,EAAuB,CAC5D,MAAO,CACL,KAAM,SAAY,CAChB,IAAMC,EAAMJ,GAAK,QAAQG,CAAa,EAChCE,EAAY,KAAK,MAAM,MAAMJ,GAAG,SAAS,SAASE,EAAe,OAAO,CAAC,EACzEG,EAAgBD,EAAU,cAC1BE,EAAkBF,EAAU,gBAC5BG,EAAqB,CAAC,EAKtBC,EAAWF,EAAgB,CAAC,EAClCC,EAAY,KAAK,GAAGC,EAAS,OAAO,EACpC,IAAMC,EAAYD,EAAS,MAAM,CAAC,EAC5BE,EAAWX,GAAK,QAAQI,EAAKM,CAAS,EACtCE,GAAc,MAAMX,GAAG,SAAS,SAASU,CAAQ,GAAG,OAE1D,MAAO,CACL,cAAAL,EACA,YAAAE,EACA,WAAAI,CACF,CACF,CACF,CACF,CAEO,IAAMC,GAAN,MAAMC,CAAa,CACxB,OAAe,SACP,MAA2B,KAC3B,UAAiB,KAClB,UAAY,wBAEX,aAAc,CAAC,CAEvB,OAAc,aAA4B,CACxC,OAAKA,EAAa,WAChBA,EAAa,SAAW,IAAIA,GAEvBA,EAAa,QACtB,CAEA,OAAc,eAAgB,CAC5BA,EAAa,SAAW,IAC1B,CAEA,MAAa,MAAO,CAClB,GAAI,KAAK,MAAO,OAEhB,IAAMC,EAAef,GAAK,QAAQ,YAAY,OAAO,EAC/CgB,EAAYhB,GAAK,QAAQe,EAAc,8BAA8B,EAE3E,GAAI,CACA,IAAME,EAAYf,GAA8Bc,CAAS,EAGnDE,EAAS,QAAQ,IACjBC,EAAU,QAAQ,KACxB,QAAQ,IAAM,IAAM,CAAC,EACrB,QAAQ,KAAO,IAAM,CAAC,EAEtB,GAAI,CACA,QAAM,eAAW,KAAK,EACtB,KAAK,MAAQ,QAAM,mBAAeF,CAAgB,CACtD,QAAE,CACE,QAAQ,IAAMC,EACd,QAAQ,KAAOC,CACnB,CAGA,GAAI,CACA,KAAK,UAAY,MAAMC,GAAc,gBAAgB,0BAA2B,CAAE,iBAAkB,EAAK,CAAC,CAC9G,MAAY,CACR,KAAK,UAAY,MAAMA,GAAc,gBAAgB,yBAAyB,CAClF,CACJ,OAASC,EAAG,CACR,cAAQ,MAAM,6BAA8BA,CAAC,EACvCA,CACV,CACF,CAEA,MAAa,MAAMC,EAAiC,CAIlD,IAHI,CAAC,KAAK,OAAS,CAAC,KAAK,YACrB,MAAM,KAAK,KAAK,EAEhB,CAAC,KAAK,OAAS,CAAC,KAAK,UACrB,MAAM,IAAI,MAAM,oCAAoC,EAGxD,IAAMC,EAAY,MAAM,KAAK,UAAUD,EAAM,CAAE,QAAS,GAAM,WAAY,EAAK,CAAC,EAG1EE,EAAeC,GAAgB,CACjC,IAAMC,EAAOD,EAAO,MAAQA,EAC5B,OAAO,MAAM,KAAKC,CAAI,EAAE,IAAKC,GAAW,OAAOA,CAAC,CAAC,CACrD,EAEMC,EAAeJ,EAAYD,EAAU,SAAS,EAC9CM,EAAoBL,EAAYD,EAAU,cAAc,EACxDO,EAAmBN,EAAYD,EAAU,cAAc,EAEvDQ,KAAW,aAAS,CAACH,CAAY,EAAG,OAAW,OAAO,EACtDI,KAAgB,aAAS,CAACH,CAAiB,EAAG,OAAW,OAAO,EAChEI,KAAe,aAAS,CAACH,CAAgB,EAAG,OAAW,OAAO,EAE9DI,EAAS,KAAK,MAAM,QAAQ,CAC9B,UAAaH,EACb,eAAkBC,EAClB,eAAkBC,CACtB,CAAC,EAEKP,EAAO,MAAMQ,EAAO,KAAK,EAG/B,OAAAH,EAAS,QAAQ,EACjBC,EAAc,QAAQ,EACtBC,EAAa,QAAQ,EACrBC,EAAO,QAAQ,EAER,MAAM,KAAKR,CAAI,CACxB,CAEO,UAAW,CAElB,CACF,EiGrIA,OAAS,kBAAAS,OAAsB,KAC/B,OAAOC,OAAU,OCDV,IAAMC,GAAsB,iBDI5B,SAASC,GAAcC,EAAkBC,EAAqG,CACnJ,GAAI,QAAQ,IAAI,sBAAwB,OAGxC,GAAI,CACF,IAAMC,EAAS,QAAQ,IAAI,oBAAsB,QAAQ,IAAI,EACvDC,EAAUC,GAAK,KAAKF,EAAQG,EAAmB,EAC/CC,EAAW,CACf,UAAW,IAAI,KAAK,EAAE,YAAY,EAClC,KAAMN,EACN,OAAAC,CACF,EACAM,GAAeJ,EAAS,KAAK,UAAUG,CAAQ,EAAI;AAAA,EAAM,MAAM,CACjE,OAASE,EAAK,CACZ,QAAQ,MAAM,6BAA8BA,CAAG,CACjD,CACF,ClGLA,IAAIC,GAA4J,KAEhK,SAASC,GAAWC,EAAaC,EAAqB,CACpD,IAAIF,EAAa,EACjB,QAASG,EAAI,EAAGA,EAAIF,EAAE,OAAQE,IAC5BH,GAAcC,EAAEE,CAAC,EAAID,EAAEC,CAAC,EAE1B,OAAOH,CACT,CAEA,SAASI,GAAcC,EAAqB,CAC1C,IAAIC,EAAM,EACV,QAAWC,KAAOF,EAChBC,GAAOC,EAAMA,EAEf,OAAO,KAAK,KAAKD,CAAG,CACtB,CAEA,eAAsBE,GAAeC,EAAeC,EAAQ,EAAGC,EAAgB,GAAKC,EAA0C,CAE5H,IAAMC,EAAc,MADGD,GAAYE,GAAa,YAAY,GACnB,MAAML,CAAK,EAC9CM,EAAYX,GAAcS,CAAW,EAE3C,GAAI,CAACd,GAAe,CAClB,IAAMiB,EAAeC,GAAK,KAAK,YAAY,QAAS,+BAA+B,EACnF,GAAI,CAACC,GAAG,WAAWF,CAAY,EAC7B,MAAO,CAAC,EAGV,IAAMG,EAAaD,GAAG,aAAaF,CAAY,EACzCI,EAAcC,GAAK,WAAWF,CAAU,EAAE,SAAS,OAAO,EAGhEpB,GAFqB,KAAK,MAAMqB,CAAW,EAErB,IAAIE,IAAS,CACjC,GAAIA,EAAK,GACT,YAAaA,EAAK,YAClB,SAAUA,EAAK,SACf,aAAcA,EAAK,cAAgB,CAAC,EACpC,WAAYA,EAAK,YAAc,EAC/B,OAAQA,EAAK,OACb,KAAMA,EAAK,OAASlB,GAAckB,EAAK,MAAM,EAAI,CACnD,EAAE,EAAE,OAAOA,GAAQA,EAAK,MAAM,CAChC,CAEA,IAAMC,EAAa,IAAI,IAEvB,QAAWD,KAAQvB,GAAe,CAChC,GAAIuB,EAAK,OAAS,GAAKP,IAAc,EAAG,SAExC,IAAMS,EAAMxB,GAAWa,EAAaS,EAAK,MAAM,GAAKP,EAAYO,EAAK,MAErE,GAAIE,EAAMb,EAAe,SAEzB,IAAMc,EAAWF,EAAW,IAAID,EAAK,EAAE,GACnC,CAACG,GAAYD,EAAMC,EAAS,aAC9BF,EAAW,IAAID,EAAK,GAAI,CAAE,KAAAA,EAAM,WAAYE,CAAI,CAAC,CAErD,CAEA,IAAME,EAAU,MAAM,KAAKH,EAAW,OAAO,CAAC,EAG9CG,EAAQ,KAAK,CAACzB,EAAGC,IAAMA,EAAE,WAAaD,EAAE,UAAU,EAElD,IAAM0B,EAAiBD,EAAQ,MAAM,EAAGhB,CAAK,EAAE,IAAIkB,IAAM,CACvD,GAAIA,EAAE,KAAK,GACX,YAAaA,EAAE,KAAK,YACpB,SAAUA,EAAE,KAAK,SACjB,aAAcA,EAAE,KAAK,cAAc,OAASA,EAAE,KAAK,aAAe,OAClE,WAAYA,EAAE,KAAK,WACnB,WAAY,WAAWA,EAAE,WAAW,QAAQ,CAAC,CAAC,CAChD,EAAE,EAGF,OAAAC,GAAc,mBAAoBF,EAAe,IAAIC,IAAM,CAAE,GAAIA,EAAE,GAAI,WAAYA,EAAE,UAAW,EAAE,CAAC,EAE5FD,CACT",
  "names": ["require_encoding", "__commonJSMin", "exports", "module", "iconvLite", "convert", "str", "to", "from", "checkEncoding", "result", "convertIconvLite", "E", "name", "require_lib", "__commonJSMin", "exports", "module", "_interopDefault", "ex", "Stream", "http", "Url", "whatwgUrl", "https", "zlib", "Readable", "BUFFER", "TYPE", "Blob", "_Blob", "blobParts", "options", "buffers", "size", "a", "length", "i", "element", "buffer", "type", "buf", "ab", "readable", "start", "end", "relativeStart", "relativeEnd", "span", "slicedBuffer", "blob", "FetchError", "message", "systemError", "convert", "INTERNALS", "PassThrough", "Body", "body", "_this", "_ref", "_ref$size", "_ref$timeout", "timeout", "isURLSearchParams", "isBlob", "err", "error", "consumeBody", "ct", "_this2", "_this3", "convertBody", "proto", "name", "desc", "_this4", "accum", "accumBytes", "abort", "resolve", "reject", "resTimeout", "chunk", "headers", "charset", "res", "str", "obj", "clone", "instance", "p1", "p2", "extractContentType", "getTotalBytes", "writeToStream", "dest", "invalidTokenRegex", "invalidHeaderCharRegex", "validateName", "validateValue", "value", "find", "map", "key", "MAP", "Headers", "_Headers", "init", "rawHeaders", "headerNames", "headerName", "method", "pairs", "pair", "callback", "thisArg", "getHeaders", "_pairs$i", "createHeadersIterator", "kind", "k", "INTERNAL", "target", "iterator", "HeadersIteratorPrototype", "_INTERNAL", "index", "values", "len", "exportNodeCompatibleHeaders", "hostHeaderKey", "createHeadersLenient", "val", "INTERNALS$1", "STATUS_CODES", "Response", "_Response", "opts", "status", "contentType", "INTERNALS$2", "URL", "parse_url", "format_url", "parseURL", "urlStr", "streamDestructionSupported", "isRequest", "input", "isAbortSignal", "signal", "Request", "_Request", "parsedURL", "inputBody", "getNodeRequestOptions", "request", "contentLengthValue", "totalBytes", "agent", "AbortError", "URL$1", "PassThrough$1", "isDomainOrSubdomain", "destination", "original", "orig", "isSameProtocol", "fetch", "url", "send", "response", "destroyStream", "abortAndFinalize", "finalize", "req", "reqTimeout", "socket", "fixResponseChunkedTransferBadEnding", "s", "hadError", "hasDataListener", "location", "locationURL", "requestOpts", "response_options", "codings", "zlibOptions", "raw", "errorCallback", "stream", "code", "extendStatics", "d", "b", "p", "__extends", "__", "__awaiter", "thisArg", "_arguments", "P", "generator", "adopt", "value", "resolve", "reject", "fulfilled", "step", "e", "rejected", "result", "__generator", "body", "_", "t", "f", "y", "g", "verb", "n", "v", "op", "__values", "o", "s", "m", "i", "__read", "r", "ar", "error", "__spreadArray", "to", "from", "pack", "l", "EPSILON_FLOAT32", "EPSILON_FLOAT16", "DataStorage", "backend", "dataMover", "dataId", "KernelBackend", "notYetImplemented", "options", "force", "values", "shape", "dtype", "refCount", "kernelName", "shuffle", "array", "counter", "index", "swap", "shuffleCombo", "array2", "clamp", "min", "x", "max", "nearestLargerEven", "val", "object", "left", "right", "temp", "sum", "arr", "randUniform", "a", "distSquared", "diff", "assert", "expr", "msg", "assertShapesMatch", "shapeA", "shapeB", "errorMessagePrefix", "arraysEqual", "assertNonNull", "sizeFromShape", "size", "isScalarShape", "arraysEqualWithNull", "n1", "n2", "isInt", "tanh", "e2x", "sizeToSquarishShape", "width", "createShuffledIndices", "shuffledIndices", "rightPad", "repeatedTry", "checkFn", "delayFn", "maxCounter", "scheduleFn", "tryCount", "tryFn", "nextBackoff", "inferFromImplicitShape", "shapeProd", "implicitIdx", "newShape", "parseAxisParam", "axis", "rank", "ax", "squeezeShape", "keptDims", "isEmptyArray", "axes", "j", "getTypedArrayFromDType", "getArrayFromDType", "checkConversionForErrors", "vals", "num", "isValidDtype", "hasEncodingLoss", "oldType", "newType", "bytesPerElement", "bytesFromStringArray", "bytes", "isString", "isBoolean", "isNumber", "inferDtype", "isFunction", "nearestDivisor", "start", "computeStrides", "strides", "createNestedArray", "offset", "isComplex", "ret", "rest", "len", "acc", "c", "toNestedArray", "convertBackendValuesAndArrayBuffer", "data", "makeOnesTypedArray", "makeZerosTypedArray", "makeZerosNestedTypedArray", "prev", "curr", "assertNonNegativeIntegerDimensions", "dimSize", "locToIndex", "locs", "indexToLoc", "isPromise", "TENSORFLOWJS_FLAGS_PREFIX", "Environment", "global", "getQueryParams", "platformName", "platform", "env", "flagName", "evaluationFn", "setHook", "flagValue", "_a", "_b", "_c", "flags", "_this", "urlParams", "keyValues", "keyValue", "key", "parseValue", "queryString", "params", "_i", "decodeParam", "name", "lowerCaseValue", "ENV", "setEnvironmentGlobal", "environment", "globalNameSpace", "getGlobalNamespace", "ns", "getGlobalMap", "getGlobal", "init", "globalMap", "singleton", "Abs", "Acos", "Acosh", "Add", "AddN", "All", "Any", "ArgMax", "ArgMin", "Asin", "Asinh", "Atan", "Atanh", "Atan2", "AvgPool", "AvgPoolGrad", "AvgPool3D", "AvgPool3DGrad", "BatchMatMul", "BatchToSpaceND", "Bincount", "BitwiseAnd", "BroadcastTo", "BroadcastArgs", "Cast", "Ceil", "ClipByValue", "Complex", "ComplexAbs", "Concat", "Conv2D", "Conv2DBackpropFilter", "Conv2DBackpropInput", "Conv3D", "Conv3DBackpropFilterV2", "Conv3DBackpropInputV2", "Cos", "Cosh", "Cumprod", "Cumsum", "CropAndResize", "DenseBincount", "DepthToSpace", "DepthwiseConv2dNative", "DepthwiseConv2dNativeBackpropFilter", "DepthwiseConv2dNativeBackpropInput", "Diag", "Dilation2D", "Dilation2DBackpropInput", "Dilation2DBackpropFilter", "Draw", "RealDiv", "Einsum", "Elu", "EluGrad", "Erf", "Equal", "Exp", "ExpandDims", "Expm1", "FFT", "Fill", "FlipLeftRight", "Floor", "FloorDiv", "FusedBatchNorm", "GatherV2", "GatherNd", "Greater", "GreaterEqual", "Identity", "IFFT", "Imag", "IsFinite", "IsInf", "IsNan", "LeakyRelu", "Less", "LessEqual", "LinSpace", "Log", "Log1p", "LogicalAnd", "LogicalNot", "LogicalOr", "LogicalXor", "LogSoftmax", "LowerBound", "LRN", "LRNGrad", "MatrixBandPart", "Max", "Maximum", "MaxPool", "MaxPoolGrad", "MaxPool3D", "MaxPool3DGrad", "MaxPoolWithArgmax", "Mean", "Min", "Minimum", "MirrorPad", "Mod", "Multinomial", "Multiply", "Neg", "NotEqual", "NonMaxSuppressionV3", "NonMaxSuppressionV4", "NonMaxSuppressionV5", "OnesLike", "OneHot", "Pack", "PadV2", "Pool", "Pow", "Prelu", "Prod", "RaggedGather", "RaggedRange", "RaggedTensorToTensor", "Range", "Real", "Reciprocal", "Relu", "Reshape", "ResizeNearestNeighbor", "ResizeNearestNeighborGrad", "ResizeBilinear", "ResizeBilinearGrad", "Relu6", "Reverse", "Round", "Rsqrt", "ScatterNd", "TensorScatterUpdate", "SearchSorted", "Select", "Selu", "Slice", "Sin", "Sinh", "Sign", "Sigmoid", "Softplus", "Sqrt", "Sum", "SpaceToBatchND", "SplitV", "Softmax", "SparseFillEmptyRows", "SparseReshape", "SparseSegmentMean", "SparseSegmentSum", "SparseToDense", "SquaredDifference", "Square", "StaticRegexReplace", "StridedSlice", "StringNGrams", "StringSplit", "StringToHashBucketFast", "Sub", "Tan", "Tanh", "Tile", "TopK", "Transform", "Transpose", "Unique", "Unpack", "UnsortedSegmentSum", "UpperBound", "ZerosLike", "Step", "FromPixels", "RotateWithOffset", "_FusedMatMul", "FusedConv2D", "FusedDepthwiseConv2D", "warn", "log", "kernelRegistry", "gradRegistry", "getKernel", "backendName", "makeKey", "getGradient", "getKernelsForBackend", "it", "done", "config", "registerKernel", "log.warn", "registerGradient", "unregisterKernel", "unregisterGradient", "copyRegisteredKernels", "registeredBackendName", "newBackendName", "kernels", "kernelConfig", "newKernelConfig", "isTypedArrayBrowser", "long", "Long", "wasm", "low", "high", "unsigned", "isLong", "obj", "INT_CACHE", "UINT_CACHE", "fromInt", "cachedObj", "cache", "fromBits", "fromNumber", "UZERO", "ZERO", "TWO_PWR_64_DBL", "MAX_UNSIGNED_VALUE", "TWO_PWR_63_DBL", "MIN_VALUE", "MAX_VALUE", "TWO_PWR_32_DBL", "lowBits", "highBits", "pow_dbl", "fromString", "str", "radix", "radixToPower", "power", "fromValue", "TWO_PWR_16_DBL", "TWO_PWR_24_DBL", "TWO_PWR_24", "ONE", "UONE", "NEG_ONE", "LongPrototype", "radixLong", "div", "rem1", "rem", "remDiv", "intval", "digits", "bit", "other", "thisNeg", "otherNeg", "addend", "a48", "a32", "a16", "a00", "b48", "b32", "b16", "b00", "c48", "c32", "c16", "c00", "subtrahend", "multiplier", "divisor", "approx", "res", "halfThis", "log2", "delta", "approxRes", "approxRem", "numBits", "le", "hi", "lo", "LongExports.default", "LongExports", "hexToLong", "hex", "k0", "k1", "k2", "shiftMix", "fetch", "numBytes", "fetch64", "fetch32", "rotate64", "shift", "hashLen16", "u", "mul", "weakHashLen32WithSeeds", "w", "z", "weakHashLen32WithSeedsStr", "hashLen0to16", "hashLen17to32", "hashLen33to64", "h", "fingerPrint64", "seed", "end", "last64", "createScalarValue", "encodeString", "toTypedArray", "noConversionNeeded", "flatten", "base.checkConversionForErrors", "bool", "now", "path", "requestInits", "encoding", "decodeString", "isTypedArray", "skipTypedArray", "base.isPromise", "maxIndex", "Profiler", "backendTimer", "logger", "Logger", "inputs", "outputs", "holdResultWrapperFn", "timer", "util.now", "outputs_1", "outputs_1_1", "output", "tensorVals", "checkComputationForErrors", "kernelProfile", "timing", "timeMs", "extraInfo", "valueContainer", "time", "util.rightPad", "paddedName", "inputShapesDescription", "name_1", "input", "inputShape", "inputRank", "getFilteredNodesXToY", "tape", "xs", "tensorsFromX", "nodesFromX", "node", "nodeInputs", "inputName", "anyInputFromX", "tensorsLeadToY", "nodesToY", "filteredTape", "prunedInputs", "nodeInput", "prunedNode", "backpropagateGradients", "tensorAccumulatedGradientMap", "tidy", "add", "dys", "gradTensor", "inputGradients", "dx", "util.arraysEqual", "curGradient", "FORMAT_LIMIT_NUM_VALS", "FORMAT_NUM_FIRST_LAST_VALS", "FORMAT_NUM_SIG_DIGITS", "tensorToString", "verbose", "padPerCol", "computeMaxSizePerColumn", "valsLines", "subTensorToString", "lines", "numCols", "valuesOrTuples", "createComplexTuples", "row", "valToString", "pad", "valStr", "boolNumToString", "isLast", "storagePerElement", "complexTuple", "firstValsSize", "firstVals", "lastVals", "displayVals", "subshape", "substrides", "stride", "sep", "newLineSep", "complexTuples", "TensorBuffer", "util.sizeFromShape", "n_1", "util.assert", "util.getArrayFromDType", "locs_1", "locs_1_1", "loc", "i_1", "trackerFn", "opHandler", "setTensorTracker", "fn", "setOpHandler", "handler", "Tensor", "id", "util.decodeString", "trainable", "instance", "getGlobalTensorClass", "Variable", "_super", "initialValue", "tensorId", "newValue", "Rank", "UpcastInt32AndMap", "UpcastBoolAndMap", "UpcastFloat32AndMap", "UpcastComplex64AndMap", "upcastTypeMap", "upcastType", "typeA", "typeB", "sumOutType", "type", "isWebGLData", "isWebGPUData", "makeTypesMatch", "assertTypesMatch", "isTensorInList", "tensor", "tensorList", "getTensorsInContainer", "list", "seen", "walkTensorContainer", "container", "isIterable", "iterable", "k", "isRegisteredKernelInvocation", "kernelInvocation", "EngineState", "variableName", "Engine", "sortedBackends", "success", "asyncInit", "factory", "priority", "kernel", "registryFactoryEntry", "promiseId_1", "backendInstance", "err", "info", "srcBackend", "nameOrFn", "ex", "ENGINE", "grad", "dy", "gradInputs", "attrs", "saved", "hasKernel", "numDataIdsBefore", "outInfos", "numDataIdsAfter", "numOutputDataIds", "numMoves", "dataIdsLeaked", "kernelParams", "isTapeOn", "startingBytecount", "startingNumTensors", "kernelFunc", "out", "kernelOrScopeName", "kernelName_1", "inputs_1", "attrs_1", "kernel_1", "outTensors", "outInfo", "tensorsToSave", "forwardFunc_1", "saveFunc_1", "tensors", "outs", "backwardsFunc", "item", "gradConfig", "inputsToSave", "outputsToSave_1", "inputTensorsToSave", "outputTensorsToSave", "backendVals", "util.isString", "util.encodeString", "newBytes", "tensorInfo", "util.bytesPerElement", "varName", "query", "startBytes", "startNumTensors", "_g", "_d", "_e", "gradientsFunc", "tapeNode", "util.makeZerosTypedArray", "scopeInfo", "tensorsToTrackInParent", "tensorsToTrackInParentSet", "oldScope", "allowNoGradients", "accumulatedGradientMap", "ones", "grads", "util.isFunction", "inputMap", "forwardFunc", "save", "gradRes", "gradMap", "timingInfo", "getOrMakeEngine", "_isNavigatorDefined", "isMobileMockValue", "mockIsMobile", "isMobile", "nav", "navAny", "isBrowser", "debugValue", "device_util.isBrowser", "inferShape", "firstElem", "usedChannels", "deepAssertShapeConsistency", "indices", "subShape", "assertDtype", "expectedDtype", "actualDType", "argName", "functionName", "convertToTensor", "parseAsDtype", "inferredDtype", "inferredShape", "convertToTensorArray", "arg", "OP_SCOPE_SUFFIX", "keys", "opName", "f2", "args", "complex_", "real", "imag", "$real", "$imag", "util.assertShapesMatch", "complex", "makeTensor", "providedSize_1", "inferredSize_1", "inferred", "flatDimsDontMatch", "DTYPE_VALUE_SIZE_MAP", "CompositeArrayBuffer", "buffers", "bufferOrTypedArray", "util.isTypedArray", "buffer", "startShardIndex", "outputBuffer", "outputArray", "sliced", "shard", "globalStart", "localStart", "outputStart", "globalEnd", "localEnd", "outputSlice", "byteIndex", "check", "search", "sortedArray", "compare", "middle", "side", "enableProdMode", "enableDebugMode", "disableDeprecationWarnings", "deprecationWarn", "disposeVariables", "engine", "memory", "profile", "dispose", "keep", "setBackend", "ready", "getBackend", "removeBackend", "findBackend", "findBackendFactory", "registerBackend", "setPlatform", "NUM_BYTES_STRING_LENGTH", "encodeWeights", "group", "specs", "dataPromises", "names", "spec", "utf8bytes", "totalNumBytes", "bytesOfLength", "tensorValues", "concatenateTypedArrays", "decodeWeights", "weightData", "compositeBuffer", "specs_1", "specs_1_1", "byteLength", "getWeightBytelength", "decodeWeight", "slice", "bytesPerValue", "quantization", "getWeightBytelengthAsync", "byteBuffer", "quantizationSizeFactor", "quantizedArray", "float16Decode", "getFloat16Decoder", "size_1", "dtypeFactor", "image", "realTensor", "imageTensor", "complexTensor", "readToLength", "reader", "initialData", "length", "missing", "newData", "decodeWeightsStream", "weightStream", "specs_2", "specs_2_1", "tensorData", "weightTensor", "totalByteLength", "normalizedXs", "useNodeBuffer", "stringByteLength", "arrayBufferToBase64String", "buf", "base64StringToArrayBuffer", "concatenateArrayBuffers", "basename", "SEPARATOR", "items", "getModelJSONForModelArtifacts", "artifacts", "manifest", "getModelArtifactsForJSONSync", "modelJSON", "weightSpecs", "modelArtifacts", "getModelArtifactsForJSON", "loadWeights", "getModelArtifactsInfoForJSON", "getWeightSpecs", "weightsManifest", "weightsManifest_1", "weightsManifest_1_1", "entry", "computeFloat16MantisaTable", "convertMantissa", "mantisaTable", "computeFloat16ExponentTable", "exponentTable", "computeFloat16OffsetTable", "offsetTable", "bufferUint32View", "float16Bits", "float32Bits", "IORouterRegistry", "saveRouter", "loadRouter", "url", "loadOptions", "handlerType", "validHandlers", "routers", "router", "registerSaveRouter", "loudRouter", "registerLoadRouter", "getSaveHandlers", "getLoadHandlers", "DATABASE_NAME", "DATABASE_VERSION", "MODEL_STORE_NAME", "INFO_STORE_NAME", "getIndexedDBFactory", "theWindow", "setUpDatabase", "openRequest", "db", "BrowserIndexedDB", "modelPath", "modelTx", "modelStore", "getRequest_1", "modelArtifactsInfo_1", "infoTx_1", "infoStore_1", "putInfoRequest_1", "modelTx_1", "putModelRequest", "deleteInfoRequest", "indexedDBRouter", "browserIndexedDB", "maybeStripScheme", "BrowserIndexedDBManager", "tx", "store", "getAllInfoRequest", "infoTx", "infoStore", "getInfoRequest", "deleteModelData_1", "deleteModelRequest", "PATH_SEPARATOR", "PATH_PREFIX", "INFO_SUFFIX", "MODEL_TOPOLOGY_SUFFIX", "WEIGHT_SPECS_SUFFIX", "WEIGHT_DATA_SUFFIX", "MODEL_METADATA_SUFFIX", "getModelKeys", "removeItems", "getModelPathFromKey", "BrowserLocalStorage", "topology", "modelArtifactsInfo", "weightBuffer", "metadata", "metadataString", "weightDataBase64", "localStorageRouter", "browserLocalStorage", "BrowserLocalStorageManager", "prefix", "suffix", "URL_SCHEME_SUFFIX", "ModelStoreManagerRegistry", "scheme", "manager", "registry", "parseURL", "cloneModelInternal", "sourceURL", "destURL", "deleteSource", "loadHandlers", "loadHandler", "saveHandlers", "saveHandler", "sourceScheme", "sourcePath", "sameMedium", "saveResult", "listModels", "schemes", "schemes_1", "schemes_1_1", "schemeOut", "removeModel", "schemeAndPath", "copyModel", "moveModel", "PlatformBrowser", "text", "functionRef", "delay", "event", "functionRef_1", "getNodeFetch", "systemFetch", "PlatformNode", "util.assertNonNegativeIntegerDimensions", "cast_", "$x", "util.isValidDtype", "cast", "clone_", "clone", "print", "add_", "$a", "$b", "floorDiv_", "floorDiv", "div_", "mul_", "abs_", "abs", "acos_", "acos", "acosh_", "acosh", "addN_", "$tensors", "firstTensor", "addN", "all_", "keepDims", "all", "any_", "any", "argMax_", "argMax", "argMin_", "argMin", "asin_", "asin", "asinh_", "asinh", "atan_", "atan", "atan2_", "atan2", "atanh_", "atanh", "computeDilation2DInfo", "filterShape", "dataFormat", "dilations", "inputChannels", "$filterShape", "$dataFormat", "convertConv2DDataFormat", "computeConv2DInfo", "computePool2DInfo", "inShape", "filterSize", "roundingMode", "parseTupleParam", "filterHeight", "filterWidth", "computePool3DInfo", "parse3TupleParam", "filterDepth", "computeConv3DInfo", "depthwise", "batchSize", "inHeight", "inWidth", "inChannels", "filterChannels", "strideHeight", "strideWidth", "_f", "dilationHeight", "dilationWidth", "effectiveFilterHeight", "getEffectiveFilterSize", "effectiveFilterWidth", "getPadAndOutInfo", "padInfo", "outHeight", "outWidth", "outChannels", "outShape", "inDepth", "strideDepth", "dilationDepth", "effectiveFilterDepth", "get3DPadAndOutInfo", "outDepth", "computeOutputShape2D", "fieldSize", "zeroPad", "computeDefaultPad", "inputRows", "inputCols", "outputRows", "round", "outputCols", "computeOutputShape4D", "dilation", "effectiveFieldSize", "param", "padType", "padAlongHeight", "padAlongWidth", "top", "bottom", "padAlongDepth", "front", "back", "tupleValuesAreOne", "dimA", "dimB", "dimC", "eitherStridesOrDilationsAreOne", "stridesOrDilationsArePositive", "checkPadOnDimRoundingMode", "opDesc", "dimRoundingMode", "util.isInt", "reshape_", "reshape", "avgPool_", "conv_util.eitherStridesOrDilationsAreOne", "x4D", "reshapedTo4D", "conv_util.checkPadOnDimRoundingMode", "avgPool", "avgPool3d_", "x5D", "reshapedTo5D", "avgPool3d", "concat_", "attr", "concat", "matMul_", "transposeA", "transposeB", "matMul", "sigmoid_", "sigmoid", "slice_", "begin", "tanh_", "basicLSTMCell_", "forgetBias", "lstmKernel", "lstmBias", "$forgetBias", "$lstmKernel", "$lstmBias", "$data", "$c", "$h", "combined", "weighted", "sliceCols", "sliceSize", "newC", "newH", "basicLSTMCell", "batchToSpaceND_", "blockShape", "crops", "prod", "batchToSpaceND", "xAs4D", "batchNorm_", "mean", "variance", "scale", "varianceEpsilon", "$mean", "$variance", "$scale", "$offset", "batchNorm", "batchNorm2d_", "batchNorm2d", "batchNorm3d_", "batchNorm3d", "batchNorm4d_", "batchNorm4d", "bincount_", "weights", "$weights", "bincount", "bitwiseAnd_", "$y", "bitwiseAnd", "broadcastArgs_", "s0", "s1", "shape1Input", "shape2Input", "broadcastArgs", "broadcastTo_", "xShape", "reps", "broadcastTo", "ceil_", "ceil", "fill", "clipByValue_", "clipValueMin", "clipValueMax", "clipByValue", "concat1d_", "concat1d", "concat2d_", "concat2d", "concat3d_", "concat3d", "concat4d_", "concat4d", "conv2d_", "filter", "$filter", "conv_util.stridesOrDilationsArePositive", "conv2d", "conv1d_", "x3D", "reshapedTo3D", "filter4D", "input4D", "conv2dDataFormat", "conv1d", "conv2DBackpropInput_", "xShape4D", "dy4D", "conv2DBackpropInput", "conv2dTranspose_", "outputShape", "conv2dTranspose", "conv3d_", "conv3d", "conv3DBackpropInput_", "xShape5D", "dy5D", "conv3DBackpropInput", "conv3dTranspose_", "conv3dTranspose", "cos_", "cos", "cosh_", "cosh", "cumprod_", "exclusive", "reverse", "cumprod", "cumsum_", "cumsum", "denseBincount_", "binaryOutput", "denseBincount", "depthToSpace_", "blockSize", "inputHeight", "inputWidth", "inputDepth", "depthToSpace", "depthwiseConv2d_", "depthwiseConv2d", "diag_", "diag", "dilation2d_", "dilation2d", "getBroadcastDims", "inRank", "dims", "dim", "getReductionAxes", "inDim", "outAxis", "outDim", "assertAndGetBroadcastShape", "errMsg", "equal_", "equal", "where_", "condition", "$condition", "broadcastShape", "$broadcastedCondition", "$broadcastedA", "$broadcastedB", "where", "zerosLike_", "zerosLike", "divNoNan_", "divResult", "zeros", "bEqualsZero", "divNoNan", "dot_", "t1", "t2", "$t1", "$t2", "t1Inner", "t2Inner", "t12D", "t22D", "t1t2", "dot", "einsum_", "equation", "einsum", "elu_", "elu", "ensureShape_", "ensureShape", "erf_", "erf", "axesAreInnerMostDims", "combineLocations", "outputLoc", "reduceLoc", "outIdx", "reduceIdx", "computeOutAndReduceShapes", "aShape", "reduceShape", "expandShapeToKeepDim", "reduceSubShape", "assertAxesAreInnerMostDims", "getAxesPermutation", "getUndoAxesPermutation", "getInnerMostAxes", "numAxes", "max_", "min_", "pow_", "base", "exp", "$base", "$exp", "pow", "scalar", "sqrt_", "sqrt", "square_", "square", "sum_", "norm_", "ord", "norm", "normImpl", "keepDimsShape", "axis_util.expandShapeToKeepDim", "euclideanNorm_", "euclideanNorm", "exp_", "expandDims_", "expandDims", "expm1_", "expm1", "tile_", "tile", "eye_", "numRows", "numColumns", "batchShape", "buff", "eye", "floor_", "floor", "gather_", "batchDims", "$indices", "gather", "greater_", "greater", "greaterEqual_", "greaterEqual", "imag_", "$input", "isFinite_", "isFinite", "isInf_", "isInf", "isNaN_", "isNaN", "leakyRelu_", "alpha", "leakyRelu", "less_", "less", "lessEqual_", "lessEqual", "linspace", "stop", "localResponseNormalization_", "depthRadius", "bias", "beta", "localResponseNormalization", "log_", "log1p_", "log1p", "$dy", "checkGrads", "$args", "valueAndGrad", "valueAndGrads", "variableGrads", "varList", "specifiedVarList", "specifiedNonTrainable", "variable", "originalVarCount", "namedGrads", "customGrad", "numNullGradients", "neg_", "neg", "softplus_", "softplus", "logSigmoid_", "customOp", "gradFunc", "derX", "logSigmoid", "sub_", "sub", "logSoftmax_", "logits", "$logits", "xMax", "shifted", "softmax", "logSoftmax", "logSumExp_", "logSumExp", "logicalAnd_", "logicalAnd", "logicalNot_", "logicalNot", "logicalOr_", "logicalOr", "logicalXor_", "logicalXor", "INT32_MAX", "searchSorted_", "sortedSequence", "$sortedSequence", "$values", "sequenceSize", "valuesSize", "$sortedSequence2D", "$values2D", "searchSorted", "lowerBound", "maxPool_", "maxPool", "maxPool3d_", "maxPool3d", "maxPoolWithArgmax_", "includeBatchInIndex", "maxPoolWithArgmax", "maximum_", "maximum", "mean_", "meshgrid", "indexing", "minimum_", "minimum", "mirrorPad_", "paddings", "mode", "shapeOffset", "mirrorPad", "mod_", "mod", "moments_", "xMean", "devSquared", "moments", "multiRNNCell_", "lstmCells", "newStates", "multiRNNCell", "multinomial_", "numSamples", "normalized", "numOutcomes", "origRank", "logits2D", "multinomial", "notEqual_", "notEqual", "oneHot_", "depth", "onValue", "offValue", "oneHot", "onesLike_", "onesLike", "outerProduct_", "v1", "v2", "$v1", "$v2", "v12D", "v22D", "outerProduct", "pad_", "constantValue", "pad1d_", "pad1d", "pad2d_", "pad2d", "pad3d_", "pad3d", "pad4d_", "pad4d", "spaceToBatchND_", "spaceToBatchND", "pool_", "windowShape", "poolingType", "convInfo", "conv_util.computePool2DInfo", "basePadding", "withSpaceToBatchBasePaddings", "isDilationOne", "requiredSpaceToBatchPaddings", "adjustedPadding", "adjustedCrops", "convertedPad", "convertedX", "forwardOp", "padStart", "origPadEnd", "fullInputShape", "padEndExtra", "padEnd", "dilatedFilterShape", "padExtraShape", "padExtraStart", "padExtraEnd", "pool", "prelu_", "$alpha", "prelu", "prod_", "raggedGather_", "paramsNestedSplits", "paramsDenseValues", "outputRaggedRank", "$paramsNestedSplits", "$paramsDenseValues", "raggedGather", "raggedRange_", "starts", "limits", "deltas", "$starts", "$limits", "$deltas", "raggedRange", "raggedTensorToTensor_", "defaultValue", "rowPartitionTensors", "rowPartitionTypes", "$shape", "$defaultValue", "$rowPartitionTensors", "raggedTensorToTensor", "rand_", "randFunction", "rand", "module", "define", "Alea", "me", "mash", "Mash", "copy", "impl", "opts", "xg", "state", "prng", "this", "XorGen", "strseed", "bot", "X", "limit", "math", "chunks", "rngname", "startdenom", "significance", "overflow", "mask", "nodecrypto", "seedrandom", "callback", "shortseed", "mixkey", "tostring", "autoseed", "arc4", "ARC4", "is_math_call", "keylen", "count", "typ", "prop", "stringseed", "smear", "browser", "plugins", "alea", "require$$0", "xor128", "require$$1", "xorwow", "require$$2", "xorshift7", "require$$3", "xor4096", "require$$4", "tychei", "require$$5", "sr", "require$$6", "TEST_EPSILON_FLOAT32", "TEST_EPSILON_FLOAT16", "expectArraysClose", "actual", "expected", "epsilon", "testEpsilon", "expectArraysPredicate", "areClose", "predicate", "checkClassType", "aType", "bType", "actualShape", "expectedShape", "actualFlat", "expectedFlat", "expectPromiseToFail", "expectArraysEqual", "expectNumbersClose", "expectValuesInRange", "expectArrayBuffersEqual", "actualArray", "expectedArray", "encodeStrings", "createVideoElement", "source", "video", "play", "MPRandGauss", "stdDeviation", "truncated", "seedValue", "seedrandom.alea", "resultX", "resultY", "isValid", "RandGamma", "x2", "v0", "UniformRandom", "randomGamma_", "rgamma", "randomGamma", "randomNormal_", "stdDev", "randGauss", "randomNormal", "randomStandardNormal_", "randomStandardNormal", "randomUniform_", "minval", "maxval", "random", "randomUniform", "randomUniformInt_", "randomUniformInt", "range", "real_", "reciprocal_", "reciprocal", "relu_", "relu", "relu6_", "relu6", "reverse_", "reverse1d_", "reverse1d", "reverse2d_", "reverse2d", "reverse3d_", "reverse3d", "reverse4d_", "reverse4d", "round_", "rsqrt_", "rsqrt", "selu_", "selu", "separableConv2d_", "depthwiseFilter", "pointwiseFilter", "$depthwiseFilter", "$pointwiseFilter", "channelMultiplier", "pointwiseStride", "separableConv2d", "setdiff1dAsync_", "xVals", "yVals", "ySet", "outputSize", "setdiff1dAsync", "sign_", "sign", "sin_", "sin", "sinh_", "sinh", "slice1d_", "slice1d", "slice2d_", "slice2d", "slice3d_", "slice3d", "slice4d_", "slice4d", "softmax_", "fft_", "fft", "ifft_", "ifft", "irfft_", "innerDimensionSize", "batch", "complexInput", "realInput", "imagInput", "realConjugate", "imagConjugate", "batch_1", "irfft", "split_", "numOrSizeSplits", "split", "rfft_", "fftLength", "adjustedInput", "zerosShape", "zerosInput", "half", "realValues", "imagValues", "realComplexConjugate", "imagComplexConjugate", "rfft", "squaredDifference_", "squaredDifference", "squeeze_", "squeeze", "stack_", "stack", "step_", "stridedSlice_", "beginMask", "endMask", "ellipsisMask", "newAxisMask", "shrinkAxisMask", "stridedSlice", "tan_", "tan", "tensor1d", "tensor2d", "tensor3d", "tensor4d", "tensor5d", "tensor6d", "validateUpdateShape", "updates", "sliceDim", "batchDim", "shapeError", "validateInput", "calculateShapes", "indicesRank", "sliceRank", "totalNd", "safeSliceDim", "numUpdates", "tensorScatterUpdate_", "$tensor", "$updates", "scatter_nd_util.validateInput", "tensorScatterUpdate", "topk_", "sorted", "lastDim", "topk", "truncatedNormal_", "truncatedNormal", "unique_", "unique", "unsortedSegmentSum_", "segmentIds", "numSegments", "$segmentIds", "unsortedSegmentSum", "unstack_", "unstack", "upperBound", "whereImpl", "condShape", "condVals", "inBuffer", "whereAsync_", "whereAsync", "booleanMaskAsync_", "$mask", "axisFrom", "maskDim", "tensorShape", "leadingSize", "targetTensorShape", "reshapedTensor", "reshapedMask", "positivePositions", "booleanMaskAsync", "transpose_", "perm", "conjugate", "transpose", "movingAverage_", "decay", "zeroDebias", "$v", "$decay", "one", "oneMinusDecay", "update", "$step", "movingAverage", "scatterND_", "scatterND", "sparseIndices", "sparseValues", "defaultValues", "numElems", "numDims", "numValues", "sparseToDense_", "$sparseIndices", "$sparseValues", "sparse_to_dense.validateInput", "sparseToDense", "gatherND_", "gatherND", "getNoiseShape", "noiseShape", "newDimension", "dropout_", "rate", "$noiseShape", "keepProb", "dropout", "enclosingPowerOfTwo", "cosineWindow", "windowLength", "even", "newValues", "cosArg", "inTopKAsync_", "predictions", "targets", "$predictions", "$targets", "predictionsVals", "targetsVals", "precision", "valAndInd", "inTopKAsync", "conv2DBackpropFilter_", "conv2DBackpropFilter", "getFusedDyActivation", "activation", "getFusedBiasGradient", "dyActivation", "reduceAxes", "broadcast_util.getReductionAxes", "applyActivation", "preluActivationWeights", "leakyreluAlpha", "shouldFuse", "gradientDepth", "gradientMode", "fusedConv2d_", "unfusedConv2d", "conv_util.computeConv2DInfo", "$bias", "broadcast_util.assertAndGetBroadcastShape", "$preluActivationWeights", "alphaShape_1", "conv_util.tupleValuesAreOne", "xDer", "filterDer", "der", "biasDer", "customOpWithBias", "depthwiseConv2dNativeBackpropFilter_", "depthwiseConv2dNativeBackpropFilter", "depthwiseConv2dNativeBackpropInput_", "depthwiseConv2dNativeBackpropInput", "fusedDepthwiseConv2d_", "unfusedDepthwiseConv2d", "fusedMatMul_", "unfusedMatMul", "innerShapeA", "innerShapeB", "outerShapeA", "outerShapeB", "outerDimsA", "outerDimsB", "batchDimA", "batchDimB", "outShapeOuterDims", "a3D", "b3D", "aDer", "bDer", "hammingWindow_", "hammingWindow", "hannWindow_", "hannWindow", "frame_", "signal", "frameLength", "frameStep", "padValue", "padLen", "frame", "stft_", "windowFn", "framedSignal", "windowedSignal", "stft", "cropAndResize_", "boxes", "boxInd", "cropSize", "method", "extrapolationValue", "$image", "$boxes", "$boxInd", "numBoxes", "cropAndResize", "flipLeftRight_", "flipLeftRight", "grayscaleToRGB_", "lastDimsIdx", "lastDims", "grayscaleToRGB", "rgbToGrayscale_", "origDtype", "fltImage", "rgbWeights", "grayFloat", "rgbToGrayscale", "rotateWithOffset_", "radians", "fillValue", "center", "rotateWithOffset", "nonMaxSuppSanityCheck", "scores", "maxOutputSize", "iouThreshold", "scoreThreshold", "softNmsSigma", "nonMaxSuppression_", "$scores", "nonMaxSuppression", "binaryInsert", "element", "comparator", "binarySearch", "insertionPoint", "target", "binarySearch_", "defaultComparator", "found", "compareResult", "nonMaxSuppressionV3Impl", "nonMaxSuppressionImpl_", "nonMaxSuppressionV4Impl", "padToMaxOutputSize", "nonMaxSuppressionV5Impl", "returnScoresTensor", "returnValidOutputs", "candidates", "ascendingComparator", "selectedIndices", "selectedScores", "candidate", "originalScore", "boxIndex", "suppressBeginIndex", "ignoreCandidate", "iou", "intersectionOverUnion", "suppressWeight", "validOutputs", "elemsToPad", "iCoord", "jCoord", "yminI", "xminI", "ymaxI", "xmaxI", "yminJ", "xminJ", "ymaxJ", "xmaxJ", "areaI", "areaJ", "intersectionYmin", "intersectionXmin", "intersectionYmax", "intersectionXmax", "intersectionArea", "weight", "c1", "c2", "nonMaxSuppressionAsync_", "boxesAndScores", "boxesVals", "scoresVals", "nonMaxSuppressionAsync", "nonMaxSuppressionWithScore_", "nonMaxSuppressionWithScore", "nonMaxSuppressionWithScoreAsync_", "nonMaxSuppressionWithScoreAsync", "nonMaxSuppressionPadded_", "$maxOutputSize", "$iouThreshold", "$scoreThreshold", "nonMaxSuppressionPadded", "nonMaxSuppressionPaddedAsync_", "nonMaxSuppressionPaddedAsync", "resizeBilinear_", "images", "alignCorners", "halfPixelCenters", "$images", "batchImages", "resizeBilinear", "resizeNearestNeighbor_", "resizeNearestNeighbor", "threshold_", "inverted", "threshValue", "RED_INTENCITY_COEF", "GREEN_INTENCITY_COEF", "BLUE_INTENCITY_COEF", "totalPixelsInImage", "$threshold", "grayscale", "$r", "$g", "$histogram", "otsu", "invCondition", "histogram", "total", "bestThresh", "bestInBetVar", "cInBetVar", "classFirst", "classSecond", "meanFirst", "meanSec", "weightForeground", "weightBack", "meanFirstDivA", "meanSecFill", "meanSecAdd", "meanSecMul", "cInBetVarSubA", "cInBetVarSubB", "cInBetVarMul", "threshold", "transform_", "transforms", "interpolation", "fillMode", "$transforms", "transform", "bandPart_", "numLower", "numUpper", "M", "N", "$numLower", "$numUpper", "ij", "inBand", "zero", "mat", "bandPart", "gramSchmidt_", "inputIsTensor2D", "dim_1", "ys", "xs1d", "proj", "gramSchmidt", "qr_", "fullMatrices", "qr2d", "outerDimsProd", "x2ds", "q2ds_1", "r2ds_1", "x2d", "q2d", "r2d", "q", "one2D", "iters", "rTemp", "wTemp", "qTemp", "rjEnd1", "normX", "rjj", "u1", "wPre", "tau", "rjEndAll", "tauTimesW", "wT", "rTimesTau", "tawTimesWT", "qAllJEnd", "qTimesTau", "qr", "Reduction", "computeWeightedLoss_", "losses", "reduction", "$losses", "weightedLoss", "broadcastFactor", "broadcastedWeights", "numNonZeros", "computeWeightedLoss", "absoluteDifference_", "labels", "$labels", "absoluteDifference", "cosineDistance_", "cosineDistance", "hingeLoss_", "hingeLoss", "huberLoss_", "deltaScalar", "quadratic", "linear", "huberLoss", "logLoss_", "epsilonScalar", "l1", "l2", "logLoss", "meanSquaredError_", "meanSquaredError", "sigmoidCrossEntropyWithLogits_", "maxOutput", "outputXTarget", "sigmoidOutput", "sigmoidCrossEntropy_", "multiClassLabels", "labelSmoothing", "$multiClassLabels", "labelSmoothingScalar", "sigmoidCrossEntropy", "softmaxCrossEntropyWithLogits_", "lse", "logResult", "costVector", "dyShape", "softmaxCrossEntropy_", "onehotLabels", "$onehotLabels", "numClasses", "softmaxCrossEntropy", "sparseFillEmptyRows_", "denseShape", "$denseShape", "sparseFillEmptyRows", "sparseReshape_", "inputIndices", "$inputIndices", "$inputShape", "$newShape", "sparseReshape", "sparseSegmentMean_", "sparseSegmentMean", "sparseSegmentSum_", "sparseSegmentSum", "stringNGrams_", "dataSplits", "separator", "nGramWidths", "leftPad", "padWidth", "preserveShortSequences", "$dataSplits", "stringNGrams", "stringSplit_", "delimiter", "skipEmpty", "$delimiter", "stringSplit", "stringToHashBucketFast_", "numBuckets", "stringToHashBucketFast", "staticRegexReplace_", "pattern", "rewrite", "replaceGlobal", "staticRegexReplace", "spectral", "linalg", "sparse", "string", "GLOBAL_CUSTOM_OBJECT", "GLOBAL_CUSTOM_NAMES", "Serializable", "cls", "SerializationMap", "registerClass", "pkg", "className", "registerName", "getRegisteredName", "Optimizer", "returnCost", "gradArray", "weightValues", "AdadeltaOptimizer", "learningRate", "rho", "variableGradients", "variableNames", "gradient", "accumulatedGrad", "accumulatedUpdate", "newAccumulatedGrad", "newAccumulatedUpdate", "variables", "variableCount", "AdagradOptimizer", "initialAccumulatorValue", "trainable_1", "AdamOptimizer", "beta1", "beta2", "varNames", "oneMinusAccBeta1", "oneMinusAccBeta2", "firstMoment", "secondMoment", "newFirstMoment", "newSecondMoment", "biasCorrectedFirstMoment", "biasCorrectedSecondMoment", "AdamaxOptimizer", "lr", "weightedInfNorm", "ut0", "ut1", "newWeightedInfNorm", "SGDOptimizer", "MomentumOptimizer", "momentum", "useNesterov", "accumulation", "newAccumulation", "RMSPropOptimizer", "centered", "accumulatedMeanSquare", "accumulatedMoments", "newAccumulatedMeanSquare", "accumulatedMeanGrad", "newAccumulatedMeanGrad", "gradContribution", "newAccumulatedMoments", "newAccumulatedMeanSquare_1", "OPTIMIZERS", "registerOptimizers", "OPTIMIZERS_1", "OPTIMIZERS_1_1", "optimizer", "DEFAULT_FILE_NAME_PREFIX", "DEFAULT_JSON_EXTENSION_NAME", "DEFAULT_WEIGHT_DATA_EXTENSION_NAME", "defer", "BrowserDownloads", "fileNamePrefix", "weightsURL", "modelJsonURL", "jsonAnchor_1", "weightDataAnchor_1", "BrowserFiles", "files", "jsonReader", "modelTopology", "modelArtifactsPromise", "paths", "pathToFile", "promises", "file", "weightFileReader", "basenames", "fileNames", "manifest_1", "manifest_1_1", "pathBasename", "browserDownloadsRouter", "browserDownloads", "browserFiles", "monitorPromisesProgress", "onProgress", "startFraction", "endFraction", "checkPromises", "checkFraction", "resolvedPromise", "registerMonitor", "promise", "fraction", "loadWeightsAsArrayBuffer", "fetchURLs", "fetchFunc", "requests", "fetchURL", "fetchStartFraction", "fetchEndFraction", "responses", "bufferPromises", "response", "bufferStartFraction", "bufferEndFraction", "streamWeights", "fetchIndex", "chunkReader", "controller", "filePathPrefix", "weightNames", "requestInit", "fetchWeights", "fetchUrls", "weightsLoaderFactory", "fetchWeightsFunction", "groupIndicesToFetchMap", "groupWeightsToFetch", "weightsFound", "allManifestWeightNames", "manifestGroupConfig", "groupIndex", "groupOffset", "weightsEntry", "rawDtype", "weightsBytes", "enqueueWeightsForFetchingFn", "weightName", "weightIndex", "weightsNotFound", "groupIndicesToFetch", "accumulator", "shouldFetch", "filepath", "fetchUrl", "weightsTensorMap", "bufferIndexOffset", "numBuffers", "weightsBuffer", "weightsEntries", "nameToTensorMap", "OCTET_STREAM_MIME_TYPE", "JSON_TYPE", "HTTPRequest", "modelTopologyAndWeightManifest", "modelConfigRequest", "message", "stream", "weightPath", "parseUrl", "pathPrefix", "urlPromises", "weightsGroup", "e_3", "_k", "lastSlash", "lastSearchParam", "isHTTPScheme", "httpRouter", "isHTTP", "urlItem", "http", "browserHTTPRequest", "PassthroughLoader", "PassthroughSaver", "PassthroughAsync", "fromMemory", "trainingConfig", "fromMemorySync", "isModelArtifacts", "withSaveHandler", "withSaveHandlerSync", "confusionMatrix_", "oneHotLabels", "oneHotPredictions", "oneHotLabelsT", "product", "confusionMatrix", "fromPixels2DContext", "hasToPixelsWarned", "fromPixels_", "pixels", "numChannels", "isPixelData", "isImageData", "isVideo", "isImage", "isCanvasLike", "isImageBitmap", "height", "numPixels", "channel", "isImageBitmapFullySupported", "isNonEmptyPixels", "canWrapPixelsToImageBitmap", "fromPixelsAsync", "imageBitmap", "validateImgTensor", "img", "validateImageOptions", "imageOptions", "toPixels", "canvas", "$img", "originalImgTensor", "rgba", "ctx", "imageData", "draw", "fromPixels", "prepareAndValidate", "tensorRank", "indicesShape", "nResult", "resultShape", "NEW_AXIS", "SHRINK_AXIS", "assertParamsValid", "maskToAxes", "computeOutShape", "stridesWithElidedDims", "ellipsisInsertionIndex", "numElidedAxes", "newStrides", "unnormalizeAxis", "normalizedAxis", "getElidedAxes", "elidedAxes", "getNormalizedAxes", "ellipsisAxes", "numInterpolatedAxes", "normalizedBegin", "normalizedEnd", "normalizedStrides", "fullIndex", "startIndicesWithElidedDims", "stopIndicesWithElidedDims", "startForAxis", "stopForAxis", "stridesForAxis", "originalBegin", "newIndices", "originalAxis", "originalValue", "originalEnd", "axisSize", "util.clamp", "startIndices", "stopIndices", "isSliceContinous", "firstNonOneAxis", "computeFlatOffset", "flatOffset", "parseSliceParams", "begin_", "xRank", "size_", "sliceInfo", "stridesNonNull", "ellipsisSeen", "sparseSpec", "denseSpec", "buildDenseSpec", "isIdentity", "sliceDim0", "isSimpleSlice", "processingShape", "finalShape", "shrinkI", "dimI", "masks", "validRange", "beginAndEndMasked", "xFwd", "canonical", "takeAllInDimension", "intervalLength", "knownInterval", "sizeI", "denseDim", "gatherIndex", "finalShapeSparse", "dense", "nextIndex", "strideI", "version", "OptimizerConstructors", "train", "delayCallback", "nextFrame", "assertParamsConsistent", "shapes", "firstShape", "RowPartitionType", "combineRaggedTensorToTensorShapes", "raggedRank", "valueShape", "valueDim", "outputShapeDimIndex", "outputShapeDim", "getRowPartitionTypesHelper", "rowPartitionTypeStrings", "stringToType", "rowPartitionTypeStrings_1", "rowPartitionTypeStrings_1_1", "typeStr", "getRaggedRank", "validateDefaultValueShape", "defaultValueShape", "defaultNDims", "valuesNDims", "defaultDim", "PARALLELIZE_THRESHOLD", "computeOptimalWindowSize", "inSize", "getImageCenter", "imageHeight", "imageWidth", "centerX", "centerY", "getReshaped", "batchToSpace", "reshaped", "spatialLength", "getPermuted", "reshapedRank", "blockShapeRank", "permuted", "permutedBeforeBatch", "permutedAfterBatch", "getReshapedPermuted", "reshapedPermuted", "getSliceBeginCoords", "sliceBeginCoords", "getSliceSize", "uncroppedShape", "SELU_SCALEALPHA", "SELU_SCALE", "ERF_P", "ERF_A1", "ERF_A2", "ERF_A3", "ERF_A4", "ERF_A5", "mergeRealAndImagArrays", "splitRealAndImagArrays", "complexWithEvenIndex", "complexWithOddIndex", "getComplexWithIndex", "assignToTypedArray", "exponents", "inverse", "exponent", "ARROW", "ARROW_REGEX", "COMMA", "ELLIPSIS", "decodeEinsumEquation", "numTensors", "numArrows", "inputString", "outputString", "inputTerms", "numInputs", "allDims", "dimName", "inputTerm", "idDims", "numOutDims", "summedDims", "getEinsumPermutation", "nDims", "permutationIndices", "checkEinsumDimSizes", "dimSizes", "getEinsumComputePath", "steps", "nSteps", "computedTermIndices", "summedDim", "termIndices", "findTermsWithDim", "termIndices_1", "e_1", "termIndices_1_1", "termIndex", "isIdentityPermutation", "prepareSplitSize", "splitSizes", "numOfNegs", "negIndex", "getSparseFillEmptyRowsIndicesDenseShapeMismatch", "indicesLength", "getSparseFillEmptyRowsNegativeIndexErrorMessage", "getSparseFillEmptyRowsOutOfRangeIndexErrorMessage", "getSparseReshapeMultipleNegativeOneOutputDimErrorMessage", "dim1", "dim2", "getSparseReshapeNegativeOutputDimErrorMessage", "getSparseReshapeEmptyTensorZeroOutputDimErrorMessage", "getSparseReshapeInputOutputMultipleErrorMessage", "inputSize", "getSparseReshapeInputOutputMismatchErrorMessage", "getSparseSegmentReductionNegativeSegmentIdsErrorMessage", "getSparseSegmentReductionNonIncreasingSegmentIdsErrorMessage", "getSparseSegmentReductionSegmentIdOutOfRangeErrorMessage", "segmentId", "getSparseSegmentReductionIndicesOutOfRangeErrorMessage", "indexValue", "segOpComputeOptimalWindowSize", "collectGatherOpShapeInfo", "outerSize", "fromUint8ToStringArray", "fromStringArrayToUint8", "strings", "ENV", "env", "debugValue", "extendStatics", "d", "b", "p", "__extends", "__", "__awaiter", "thisArg", "_arguments", "P", "generator", "adopt", "value", "resolve", "reject", "fulfilled", "step", "e", "rejected", "result", "__generator", "body", "_", "t", "f", "y", "g", "verb", "n", "v", "op", "__values", "o", "s", "m", "i", "__read", "r", "ar", "error", "__spreadArray", "to", "from", "pack", "l", "DataType", "SaverDef", "CheckpointFormatVersion", "CUSTOM_OPS", "registerOp", "name", "opFunc", "opMapper", "getRegisteredOp", "deregisterOp", "getParamValue", "paramName", "node", "tensorMap", "context", "resourceManager", "inputParam", "start", "end", "shiftedStart", "getTensor", "inputs_1", "inputNames", "_name", "index", "_a", "tensor", "data", "util", "attrParam", "tensorsMap", "_b", "parseNodeName", "nodeName", "contextId", "getNodeNameWithContextId", "getTensorsForCurrentContext", "getNodeNameAndIndex", "inputName", "outputName", "isCacheEnabled", "cachedResult", "parts", "getPadding", "pad", "explicitPadding", "cloneTensor", "clone", "json", "OperationMapper", "ops", "arithmetic", "basicMath", "control", "convolution", "creation", "dynamic", "evaluation", "graph", "hashTable", "image", "logical", "matrices", "normalization", "reduction", "sliceJoin", "sparse", "spectral", "string", "transformation", "mappersJson", "map", "mapper", "signature", "_this", "tfNodes", "placeholders", "weights", "initNodes", "nodes", "inputs", "outputs", "inputNodeNameToKey", "outputNodeNameToKey", "allNodes", "key", "inputNode", "outputIndex", "functions", "func", "entries", "prev", "curr", "newNode", "input", "param", "type", "getStringParam", "getStringArrayParam", "getNumberParam", "getNumericArrayParam", "getBoolParam", "getBoolArrayParam", "getTensorShapeParam", "getTensorShapeArrayParam", "getDtypeParam", "getDtypeArrayParam", "getFuncParam", "functionDef", "arg", "parseDtypeParam", "returnNodeMap", "output", "nameMap", "decodeBase64", "text", "global", "parseStringParam", "keepCase", "attrs", "def", "tensorflow.DataType", "parseTensorShapeParam", "shape", "dim", "NodeValueImpl", "defaultValue", "EPSILON_FLOAT32", "EPSILON_FLOAT16", "KernelBackend", "dataId", "notYetImplemented", "options", "force", "values", "dtype", "refCount", "kernelName", "assert", "expr", "msg", "assertShapesMatch", "shapeA", "shapeB", "errorMessagePrefix", "arraysEqual", "assertNonNull", "a", "sizeFromShape", "size", "arraysEqualWithNull", "n1", "n2", "isInt", "rightPad", "parseAxisParam", "axis", "rank", "ax", "squeezeShape", "newShape", "keptDims", "isEmptyArray", "axes", "j", "getTypedArrayFromDType", "getArrayFromDType", "checkConversionForErrors", "vals", "num", "isValidDtype", "bytesPerElement", "bytesFromStringArray", "arr", "bytes", "x", "isString", "isBoolean", "isNumber", "inferDtype", "isFunction", "computeStrides", "strides", "createNestedArray", "offset", "isComplex", "ret", "rest", "len", "acc", "c", "toNestedArray", "makeOnesTypedArray", "array", "makeZerosTypedArray", "assertNonNegativeIntegerDimensions", "dimSize", "isPromise", "object", "TENSORFLOWJS_FLAGS_PREFIX", "Environment", "getQueryParams", "platformName", "platform", "flagName", "evaluationFn", "setHook", "flagValue", "_c", "flags", "urlParams", "keyValues", "keyValue", "parseValue", "queryString", "params", "_i", "decodeParam", "lowerCaseValue", "setEnvironmentGlobal", "environment", "globalNameSpace", "getGlobalNamespace", "ns", "getGlobalMap", "getGlobal", "init", "globalMap", "singleton", "Abs", "Acos", "Acosh", "Add", "AddN", "All", "Any", "ArgMax", "ArgMin", "Asin", "Asinh", "Atan", "Atanh", "Atan2", "AvgPool", "AvgPool3D", "BatchMatMul", "BatchToSpaceND", "Bincount", "BitwiseAnd", "BroadcastArgs", "Cast", "Ceil", "ClipByValue", "Complex", "ComplexAbs", "Concat", "Conv2D", "Conv2DBackpropFilter", "Conv2DBackpropInput", "Conv3D", "Conv3DBackpropInputV2", "Cos", "Cosh", "Cumprod", "Cumsum", "CropAndResize", "DenseBincount", "DepthToSpace", "DepthwiseConv2dNative", "DepthwiseConv2dNativeBackpropFilter", "DepthwiseConv2dNativeBackpropInput", "Diag", "Dilation2D", "RealDiv", "Einsum", "Elu", "Erf", "Equal", "Exp", "ExpandDims", "Expm1", "FFT", "Fill", "FlipLeftRight", "Floor", "FloorDiv", "FusedBatchNorm", "GatherV2", "GatherNd", "Greater", "GreaterEqual", "Identity", "IFFT", "Imag", "IsFinite", "IsInf", "IsNan", "LeakyRelu", "Less", "LessEqual", "LinSpace", "Log", "Log1p", "LogicalAnd", "LogicalNot", "LogicalOr", "LRN", "Max", "Maximum", "MaxPool", "MaxPool3D", "MaxPoolWithArgmax", "Mean", "Min", "Minimum", "MirrorPad", "Mod", "Multinomial", "Multiply", "Neg", "NotEqual", "NonMaxSuppressionV3", "NonMaxSuppressionV4", "NonMaxSuppressionV5", "OnesLike", "OneHot", "Pack", "PadV2", "Pow", "Prelu", "Prod", "RaggedGather", "RaggedRange", "RaggedTensorToTensor", "Range", "Real", "Reciprocal", "Relu", "Reshape", "ResizeNearestNeighbor", "ResizeBilinear", "Relu6", "Reverse", "Round", "Rsqrt", "ScatterNd", "TensorScatterUpdate", "SearchSorted", "Select", "Selu", "Slice", "Sin", "Sinh", "Sign", "Sigmoid", "Softplus", "Sqrt", "Sum", "SpaceToBatchND", "SplitV", "Softmax", "SparseFillEmptyRows", "SparseReshape", "SparseSegmentMean", "SparseSegmentSum", "SparseToDense", "SquaredDifference", "StaticRegexReplace", "StridedSlice", "StringNGrams", "StringSplit", "StringToHashBucketFast", "Sub", "Tan", "Tanh", "Tile", "TopK", "Transform", "Transpose", "Unique", "Unpack", "UnsortedSegmentSum", "ZerosLike", "Step", "RotateWithOffset", "_FusedMatMul", "FusedConv2D", "FusedDepthwiseConv2D", "warn", "kernelRegistry", "gradRegistry", "getKernel", "backendName", "makeKey", "getGradient", "getKernelsForBackend", "it", "done", "config", "backend", "isTypedArrayBrowser", "long", "Long", "wasm", "low", "high", "unsigned", "isLong", "obj", "INT_CACHE", "UINT_CACHE", "fromInt", "cachedObj", "cache", "fromBits", "fromNumber", "UZERO", "ZERO", "TWO_PWR_64_DBL", "MAX_UNSIGNED_VALUE", "TWO_PWR_63_DBL", "MIN_VALUE", "MAX_VALUE", "TWO_PWR_32_DBL", "lowBits", "highBits", "pow_dbl", "fromString", "str", "radix", "radixToPower", "power", "fromValue", "val", "TWO_PWR_16_DBL", "TWO_PWR_24_DBL", "TWO_PWR_24", "ONE", "UONE", "NEG_ONE", "LongPrototype", "radixLong", "div", "rem1", "rem", "remDiv", "intval", "digits", "bit", "other", "thisNeg", "otherNeg", "addend", "a48", "a32", "a16", "a00", "b48", "b32", "b16", "b00", "c48", "c32", "c16", "c00", "subtrahend", "multiplier", "divisor", "approx", "res", "halfThis", "log2", "delta", "approxRes", "approxRem", "numBits", "le", "hi", "lo", "LongExports.default", "LongExports", "hexToLong", "hex", "noConversionNeeded", "toTypedArray", "flatten", "base.checkConversionForErrors", "bool", "now", "encodeString", "encoding", "decodeString", "isTypedArray", "skipTypedArray", "base.isPromise", "maxIndex", "Profiler", "backendTimer", "logger", "Logger", "holdResultWrapperFn", "timer", "util.now", "outputs_1", "outputs_1_1", "tensorVals", "checkComputationForErrors", "kernelProfile", "timing", "timeMs", "extraInfo", "valueContainer", "time", "util.rightPad", "paddedName", "inputShapesDescription", "name_1", "inputShape", "inputRank", "getFilteredNodesXToY", "tape", "xs", "tensorsFromX", "nodesFromX", "nodeInputs", "anyInputFromX", "tensorsLeadToY", "nodesToY", "filteredTape", "prunedInputs", "nodeInput", "prunedNode", "backpropagateGradients", "tensorAccumulatedGradientMap", "tidy", "add", "dys", "gradTensor", "inputGradients", "dx", "util.arraysEqual", "curGradient", "FORMAT_LIMIT_NUM_VALS", "FORMAT_NUM_FIRST_LAST_VALS", "FORMAT_NUM_SIG_DIGITS", "tensorToString", "verbose", "padPerCol", "computeMaxSizePerColumn", "valsLines", "subTensorToString", "lines", "numCols", "valuesOrTuples", "createComplexTuples", "row", "valToString", "valStr", "boolNumToString", "isLast", "storagePerElement", "complexTuple", "firstValsSize", "firstVals", "lastVals", "displayVals", "subshape", "substrides", "stride", "sep", "newLineSep", "complexTuples", "TensorBuffer", "util.sizeFromShape", "n_1", "util.assert", "util.getArrayFromDType", "locs", "locs_1", "locs_1_1", "loc", "i_1", "trackerFn", "opHandler", "setTensorTracker", "fn", "Tensor", "id", "util.decodeString", "trainable", "instance", "getGlobalTensorClass", "Variable", "_super", "initialValue", "tensorId", "newValue", "Rank", "UpcastInt32AndMap", "UpcastBoolAndMap", "UpcastFloat32AndMap", "UpcastComplex64AndMap", "upcastTypeMap", "upcastType", "typeA", "typeB", "isWebGLData", "isWebGPUData", "makeTypesMatch", "assertTypesMatch", "getTensorsInContainer", "list", "seen", "walkTensorContainer", "container", "isIterable", "iterable", "k", "isRegisteredKernelInvocation", "kernelInvocation", "EngineState", "variableName", "Engine", "sortedBackends", "success", "asyncInit", "factory", "priority", "log.warn", "kernels", "kernel", "registryFactoryEntry", "promiseId_1", "backendInstance", "err", "info", "srcBackend", "nameOrFn", "ex", "ENGINE", "grad", "dy", "gradInputs", "saved", "hasKernel", "numDataIdsBefore", "outInfos", "numDataIdsAfter", "numOutputDataIds", "numMoves", "dataIdsLeaked", "kernelParams", "isTapeOn", "startingBytecount", "startingNumTensors", "kernelFunc", "out", "kernelOrScopeName", "kernelName_1", "attrs_1", "kernel_1", "outTensors", "outInfo", "tensorsToSave", "forwardFunc_1", "saveFunc_1", "tensors", "outs", "backwardsFunc", "item", "gradConfig", "inputsToSave", "outputsToSave_1", "inputTensorsToSave", "outputTensorsToSave", "backendVals", "util.isString", "util.encodeString", "newBytes", "tensorInfo", "util.bytesPerElement", "varName", "query", "startBytes", "startNumTensors", "_g", "_d", "_e", "gradientsFunc", "tapeNode", "util.makeZerosTypedArray", "scopeInfo", "tensorsToTrackInParent", "tensorsToTrackInParentSet", "oldScope", "allowNoGradients", "accumulatedGradientMap", "ones", "grads", "util.isFunction", "inputMap", "forwardFunc", "save", "gradRes", "gradMap", "timingInfo", "getOrMakeEngine", "inferShape", "firstElem", "usedChannels", "deepAssertShapeConsistency", "indices", "subShape", "assertDtype", "expectedDtype", "actualDType", "argName", "functionName", "convertToTensor", "parseAsDtype", "inferredDtype", "inferredShape", "convertToTensorArray", "OP_SCOPE_SUFFIX", "keys", "opName", "f2", "args", "abs_", "$x", "abs", "acos_", "acos", "acosh_", "acosh", "add_", "$a", "$b", "addN_", "$tensors", "firstTensor", "addN", "all_", "keepDims", "all", "any_", "any", "argMax_", "argMax", "argMin_", "argMin", "asin_", "asin", "asinh_", "asinh", "atan_", "atan", "atan2_", "atan2", "atanh_", "atanh", "cast_", "util.isValidDtype", "cast", "computePool2DInfo", "inShape", "filterSize", "dilations", "roundingMode", "dataFormat", "parseTupleParam", "filterHeight", "filterWidth", "filterShape", "computeConv2DInfo", "depthwise", "batchSize", "inHeight", "inWidth", "inChannels", "filterChannels", "strideHeight", "strideWidth", "_f", "dilationHeight", "dilationWidth", "effectiveFilterHeight", "getEffectiveFilterSize", "effectiveFilterWidth", "getPadAndOutInfo", "padInfo", "outHeight", "outWidth", "outChannels", "outShape", "computeOutputShape2D", "fieldSize", "zeroPad", "computeDefaultPad", "inputRows", "inputCols", "outputRows", "round", "outputCols", "dilation", "effectiveFieldSize", "padType", "padAlongHeight", "padAlongWidth", "top", "bottom", "left", "right", "tupleValuesAreOne", "dimA", "dimB", "dimC", "eitherStridesOrDilationsAreOne", "stridesOrDilationsArePositive", "checkPadOnDimRoundingMode", "opDesc", "dimRoundingMode", "util.isInt", "reshape_", "reshape", "avgPool_", "conv_util.eitherStridesOrDilationsAreOne", "x4D", "reshapedTo4D", "conv_util.checkPadOnDimRoundingMode", "avgPool", "avgPool3d_", "x5D", "reshapedTo5D", "avgPool3d", "clone_", "concat_", "attr", "concat", "matMul_", "transposeA", "transposeB", "matMul", "mul_", "mul", "sigmoid_", "sigmoid", "slice_", "begin", "slice", "tanh_", "tanh", "basicLSTMCell_", "forgetBias", "lstmKernel", "lstmBias", "h", "$forgetBias", "$lstmKernel", "$lstmBias", "$data", "$c", "$h", "combined", "weighted", "sliceCols", "sliceSize", "newC", "newH", "basicLSTMCell", "batchToSpaceND_", "blockShape", "crops", "prod", "batchToSpaceND", "xAs4D", "batchNorm_", "mean", "variance", "scale", "varianceEpsilon", "$mean", "$variance", "$scale", "$offset", "batchNorm", "batchNorm2d_", "batchNorm2d", "batchNorm3d_", "batchNorm3d", "batchNorm4d_", "batchNorm4d", "bincount_", "$weights", "bincount", "bitwiseAnd_", "$y", "bitwiseAnd", "broadcastArgs_", "s0", "s1", "shape1Input", "shape2Input", "broadcastArgs", "broadcastTo_", "xShape", "reps", "broadcastTo", "buffer", "util.assertNonNegativeIntegerDimensions", "ceil_", "ceil", "fill", "clipByValue_", "clipValueMin", "clipValueMax", "clipByValue", "complex_", "real", "imag", "$real", "$imag", "util.assertShapesMatch", "complex", "concat1d_", "concat1d", "concat2d_", "concat2d", "concat3d_", "concat3d", "concat4d_", "concat4d", "conv2d_", "filter", "$filter", "inDepth", "conv_util.stridesOrDilationsArePositive", "conv2d", "conv1d_", "x3D", "reshapedTo3D", "filter4D", "input4D", "conv2dDataFormat", "conv1d", "conv2DBackpropInput_", "xShape4D", "dy4D", "outDepth", "conv2DBackpropInput", "conv2dTranspose_", "outputShape", "conv2dTranspose", "conv3d_", "conv3d", "conv3DBackpropInput_", "xShape5D", "dy5D", "conv3DBackpropInput", "conv3dTranspose_", "conv3dTranspose", "cos_", "cos", "cosh_", "cosh", "cumprod_", "exclusive", "reverse", "cumprod", "cumsum_", "cumsum", "denseBincount_", "binaryOutput", "denseBincount", "depthToSpace_", "blockSize", "inputHeight", "inputWidth", "inputDepth", "depthToSpace", "depthwiseConv2d_", "depthwiseConv2d", "diag_", "diag", "dilation2d_", "dilation2d", "floorDiv_", "floorDiv", "div_", "getReductionAxes", "inDim", "outAxis", "outDim", "assertAndGetBroadcastShape", "errMsg", "equal_", "equal", "where_", "condition", "$condition", "broadcastShape", "$broadcastedCondition", "$broadcastedA", "$broadcastedB", "where", "zerosLike_", "zerosLike", "divNoNan_", "divResult", "zeros", "bEqualsZero", "divNoNan", "dot_", "t1", "t2", "$t1", "$t2", "t1Inner", "t2Inner", "t12D", "t22D", "t1t2", "dot", "einsum_", "equation", "einsum", "elu_", "elu", "ensureShape_", "ensureShape", "erf_", "erf", "combineLocations", "outputLoc", "reduceLoc", "outIdx", "reduceIdx", "expandShapeToKeepDim", "reduceSubShape", "max_", "max", "min_", "min", "pow_", "base", "exp", "$base", "$exp", "pow", "makeTensor", "providedSize_1", "inferredSize_1", "inferred", "flatDimsDontMatch", "scalar", "sqrt_", "sqrt", "square_", "square", "sum_", "sum", "norm_", "ord", "norm", "normImpl", "keepDimsShape", "axis_util.expandShapeToKeepDim", "euclideanNorm_", "euclideanNorm", "exp_", "expandDims_", "expandDims", "expm1_", "expm1", "tile_", "tile", "eye_", "numRows", "numColumns", "batchShape", "buff", "eye", "floor_", "floor", "gather_", "batchDims", "$indices", "gather", "greater_", "greater", "greaterEqual_", "greaterEqual", "imag_", "$input", "isFinite_", "isFinite", "isInf_", "isInf", "isNaN_", "isNaN", "leakyRelu_", "alpha", "leakyRelu", "less_", "less", "lessEqual_", "lessEqual", "linspace", "stop", "localResponseNormalization_", "depthRadius", "bias", "beta", "localResponseNormalization", "log_", "log", "log1p_", "log1p", "customGrad", "neg_", "neg", "softplus_", "softplus", "logSigmoid_", "customOp", "gradFunc", "derX", "logSigmoid", "sub_", "sub", "logSoftmax_", "logits", "$logits", "xMax", "shifted", "softmax", "logSoftmax", "logSumExp_", "logSumExp", "logicalAnd_", "logicalAnd", "logicalNot_", "logicalNot", "logicalOr_", "logicalOr", "logicalXor_", "logicalXor", "INT32_MAX", "searchSorted_", "sortedSequence", "side", "$sortedSequence", "$values", "sequenceSize", "valuesSize", "$sortedSequence2D", "$values2D", "searchSorted", "lowerBound", "maxPool_", "maxPool", "maxPool3d_", "maxPool3d", "maxPoolWithArgmax_", "includeBatchInIndex", "maxPoolWithArgmax", "maximum_", "maximum", "mean_", "meshgrid", "indexing", "w", "minimum_", "minimum", "mirrorPad_", "paddings", "mode", "shapeOffset", "mirrorPad", "mod_", "mod", "moments_", "xMean", "devSquared", "moments", "multiRNNCell_", "lstmCells", "newStates", "multiRNNCell", "multinomial_", "numSamples", "seed", "normalized", "numOutcomes", "origRank", "logits2D", "multinomial", "notEqual_", "notEqual", "oneHot_", "depth", "onValue", "offValue", "oneHot", "onesLike_", "onesLike", "outerProduct_", "v1", "v2", "$v1", "$v2", "v12D", "v22D", "outerProduct", "pad_", "constantValue", "pad1d_", "pad1d", "pad2d_", "pad2d", "pad3d_", "pad3d", "pad4d_", "pad4d", "spaceToBatchND_", "spaceToBatchND", "pool_", "windowShape", "poolingType", "convInfo", "conv_util.computePool2DInfo", "basePadding", "withSpaceToBatchBasePaddings", "isDilationOne", "requiredSpaceToBatchPaddings", "adjustedPadding", "adjustedCrops", "convertedPad", "convertedX", "forwardOp", "padStart", "origPadEnd", "fullInputShape", "padEndExtra", "padEnd", "dilatedFilterShape", "padExtraShape", "padExtraStart", "padExtraEnd", "pool", "prelu_", "$alpha", "prelu", "print", "prod_", "raggedGather_", "paramsNestedSplits", "paramsDenseValues", "outputRaggedRank", "$paramsNestedSplits", "$paramsDenseValues", "raggedGather", "raggedRange_", "starts", "limits", "deltas", "$starts", "$limits", "$deltas", "raggedRange", "raggedTensorToTensor_", "rowPartitionTensors", "rowPartitionTypes", "$shape", "$defaultValue", "$rowPartitionTensors", "raggedTensorToTensor", "rand_", "randFunction", "rand", "module", "define", "Alea", "me", "mash", "Mash", "copy", "impl", "opts", "xg", "state", "prng", "this", "XorGen", "strseed", "bot", "X", "limit", "math", "width", "chunks", "rngname", "startdenom", "significance", "overflow", "mask", "nodecrypto", "seedrandom", "callback", "shortseed", "mixkey", "tostring", "autoseed", "arc4", "ARC4", "is_math_call", "keylen", "count", "typ", "prop", "stringseed", "smear", "browser", "plugins", "require$$0", "alea", "xor128", "require$$1", "xorwow", "require$$2", "xorshift7", "require$$3", "xor4096", "require$$4", "tychei", "require$$5", "sr", "require$$6", "MPRandGauss", "stdDeviation", "truncated", "seedValue", "seedrandom.alea", "resultX", "resultY", "isValid", "RandGamma", "x2", "v0", "u", "UniformRandom", "randomGamma_", "rgamma", "randomGamma", "randomNormal_", "stdDev", "randGauss", "randomNormal", "randomStandardNormal_", "randomStandardNormal", "randomUniform_", "minval", "maxval", "random", "randomUniform", "randomUniformInt_", "randomUniformInt", "range", "real_", "reciprocal_", "reciprocal", "relu_", "relu", "relu6_", "relu6", "reverse_", "reverse1d_", "reverse1d", "reverse2d_", "reverse2d", "reverse3d_", "reverse3d", "reverse4d_", "reverse4d", "round_", "rsqrt_", "rsqrt", "selu_", "selu", "separableConv2d_", "depthwiseFilter", "pointwiseFilter", "$depthwiseFilter", "$pointwiseFilter", "channelMultiplier", "pointwiseStride", "separableConv2d", "setdiff1dAsync_", "xVals", "yVals", "ySet", "outputSize", "setdiff1dAsync", "sign_", "sign", "sin_", "sin", "sinh_", "sinh", "slice1d_", "slice1d", "slice2d_", "slice2d", "slice3d_", "slice3d", "slice4d_", "slice4d", "softmax_", "fft_", "fft", "ifft_", "ifft", "irfft_", "innerDimensionSize", "batch", "complexInput", "realInput", "imagInput", "realConjugate", "imagConjugate", "temp", "batch_1", "irfft", "split_", "numOrSizeSplits", "split", "rfft_", "fftLength", "adjustedInput", "zerosShape", "zerosInput", "half", "realValues", "imagValues", "realComplexConjugate", "imagComplexConjugate", "rfft", "squaredDifference_", "squaredDifference", "squeeze_", "squeeze", "stack_", "stack", "step_", "stridedSlice_", "beginMask", "endMask", "ellipsisMask", "newAxisMask", "shrinkAxisMask", "stridedSlice", "tan_", "tan", "tensor1d", "tensor2d", "tensor3d", "tensor4d", "tensor5d", "tensor6d", "validateUpdateShape", "updates", "sliceDim", "batchDim", "shapeError", "validateInput", "tensorScatterUpdate_", "$tensor", "$updates", "scatter_nd_util.validateInput", "tensorScatterUpdate", "topk_", "sorted", "lastDim", "topk", "truncatedNormal_", "truncatedNormal", "unique_", "unique", "unsortedSegmentSum_", "segmentIds", "numSegments", "$segmentIds", "unsortedSegmentSum", "unstack_", "unstack", "upperBound", "variable", "whereImpl", "condShape", "condVals", "inBuffer", "whereAsync_", "whereAsync", "booleanMaskAsync_", "$mask", "axisFrom", "maskDim", "tensorShape", "leadingSize", "targetTensorShape", "reshapedTensor", "reshapedMask", "positivePositions", "booleanMaskAsync", "dispose", "getBackend", "transpose_", "perm", "conjugate", "transpose", "movingAverage_", "decay", "zeroDebias", "$v", "$decay", "one", "oneMinusDecay", "update", "$step", "movingAverage", "scatterND_", "scatterND", "sparseIndices", "sparseValues", "defaultValues", "numElems", "numDims", "numValues", "sparseToDense_", "$sparseIndices", "$sparseValues", "sparse_to_dense.validateInput", "sparseToDense", "gatherND_", "gatherND", "getNoiseShape", "noiseShape", "newDimension", "dropout_", "rate", "$noiseShape", "keepProb", "dropout", "enclosingPowerOfTwo", "cosineWindow", "windowLength", "even", "newValues", "cosArg", "inTopKAsync_", "predictions", "targets", "$predictions", "$targets", "predictionsVals", "targetsVals", "precision", "valAndInd", "inTopKAsync", "conv2DBackpropFilter_", "conv2DBackpropFilter", "getFusedDyActivation", "activation", "getFusedBiasGradient", "dyActivation", "reduceAxes", "broadcast_util.getReductionAxes", "applyActivation", "preluActivationWeights", "leakyreluAlpha", "shouldFuse", "gradientDepth", "gradientMode", "fusedConv2d_", "unfusedConv2d", "inputChannels", "conv_util.computeConv2DInfo", "$bias", "broadcast_util.assertAndGetBroadcastShape", "$preluActivationWeights", "alphaShape_1", "conv_util.tupleValuesAreOne", "xDer", "filterDer", "der", "biasDer", "customOpWithBias", "depthwiseConv2dNativeBackpropFilter_", "depthwiseConv2dNativeBackpropFilter", "depthwiseConv2dNativeBackpropInput_", "depthwiseConv2dNativeBackpropInput", "fusedDepthwiseConv2d_", "unfusedDepthwiseConv2d", "fusedMatMul_", "unfusedMatMul", "innerShapeA", "innerShapeB", "outerShapeA", "outerShapeB", "outerDimsA", "outerDimsB", "batchDimA", "batchDimB", "outShapeOuterDims", "a3D", "b3D", "aDer", "bDer", "hammingWindow_", "hammingWindow", "hannWindow_", "hannWindow", "frame_", "signal", "frameLength", "frameStep", "padValue", "padLen", "frame", "stft_", "windowFn", "framedSignal", "windowedSignal", "stft", "cropAndResize_", "boxes", "boxInd", "cropSize", "method", "extrapolationValue", "$image", "$boxes", "$boxInd", "numBoxes", "cropAndResize", "flipLeftRight_", "flipLeftRight", "grayscaleToRGB_", "lastDimsIdx", "lastDims", "grayscaleToRGB", "rgbToGrayscale_", "origDtype", "fltImage", "rgbWeights", "grayFloat", "rgbToGrayscale", "rotateWithOffset_", "radians", "fillValue", "center", "rotateWithOffset", "nonMaxSuppSanityCheck", "scores", "maxOutputSize", "iouThreshold", "scoreThreshold", "softNmsSigma", "nonMaxSuppression_", "$scores", "nonMaxSuppression", "binaryInsert", "element", "comparator", "binarySearch", "insertionPoint", "target", "binarySearch_", "defaultComparator", "middle", "found", "compareResult", "nonMaxSuppressionV3Impl", "nonMaxSuppressionImpl_", "nonMaxSuppressionV4Impl", "padToMaxOutputSize", "nonMaxSuppressionV5Impl", "returnScoresTensor", "returnValidOutputs", "candidates", "ascendingComparator", "selectedIndices", "selectedScores", "candidate", "originalScore", "boxIndex", "suppressBeginIndex", "ignoreCandidate", "iou", "intersectionOverUnion", "suppressWeight", "validOutputs", "elemsToPad", "iCoord", "jCoord", "yminI", "xminI", "ymaxI", "xmaxI", "yminJ", "xminJ", "ymaxJ", "xmaxJ", "areaI", "areaJ", "intersectionYmin", "intersectionXmin", "intersectionYmax", "intersectionXmax", "intersectionArea", "weight", "c1", "c2", "nonMaxSuppressionAsync_", "boxesAndScores", "boxesVals", "scoresVals", "nonMaxSuppressionAsync", "nonMaxSuppressionWithScore_", "nonMaxSuppressionWithScore", "nonMaxSuppressionWithScoreAsync_", "nonMaxSuppressionWithScoreAsync", "nonMaxSuppressionPadded_", "$maxOutputSize", "$iouThreshold", "$scoreThreshold", "nonMaxSuppressionPadded", "nonMaxSuppressionPaddedAsync_", "nonMaxSuppressionPaddedAsync", "resizeBilinear_", "images", "alignCorners", "halfPixelCenters", "$images", "batchImages", "resizeBilinear", "resizeNearestNeighbor_", "resizeNearestNeighbor", "threshold_", "inverted", "threshValue", "RED_INTENCITY_COEF", "GREEN_INTENCITY_COEF", "BLUE_INTENCITY_COEF", "totalPixelsInImage", "$threshold", "grayscale", "$r", "$g", "$histogram", "otsu", "invCondition", "histogram", "total", "bestThresh", "bestInBetVar", "cInBetVar", "classFirst", "classSecond", "meanFirst", "meanSec", "weightForeground", "weightBack", "meanFirstDivA", "meanSecFill", "meanSecAdd", "meanSecMul", "cInBetVarSubA", "cInBetVarSubB", "cInBetVarMul", "threshold", "transform_", "transforms", "interpolation", "fillMode", "$transforms", "transform", "bandPart_", "numLower", "numUpper", "M", "N", "$numLower", "$numUpper", "ij", "inBand", "zero", "mat", "bandPart", "gramSchmidt_", "inputIsTensor2D", "dim_1", "ys", "xs1d", "proj", "gramSchmidt", "qr_", "fullMatrices", "qr2d", "outerDimsProd", "x2ds", "q2ds_1", "r2ds_1", "x2d", "q2d", "r2d", "q", "one2D", "iters", "rTemp", "wTemp", "qTemp", "rjEnd1", "normX", "rjj", "u1", "wPre", "tau", "rjEndAll", "tauTimesW", "wT", "rTimesTau", "tawTimesWT", "qAllJEnd", "qTimesTau", "qr", "Reduction", "computeWeightedLoss_", "losses", "$losses", "weightedLoss", "broadcastFactor", "broadcastedWeights", "numNonZeros", "computeWeightedLoss", "absoluteDifference_", "labels", "$labels", "absoluteDifference", "cosineDistance_", "cosineDistance", "hingeLoss_", "hingeLoss", "huberLoss_", "deltaScalar", "quadratic", "linear", "huberLoss", "logLoss_", "epsilon", "epsilonScalar", "l1", "l2", "logLoss", "meanSquaredError_", "meanSquaredError", "sigmoidCrossEntropyWithLogits_", "maxOutput", "outputXTarget", "sigmoidOutput", "sigmoidCrossEntropy_", "multiClassLabels", "labelSmoothing", "$multiClassLabels", "labelSmoothingScalar", "sigmoidCrossEntropy", "softmaxCrossEntropyWithLogits_", "lse", "logResult", "costVector", "dyShape", "softmaxCrossEntropy_", "onehotLabels", "$onehotLabels", "numClasses", "softmaxCrossEntropy", "sparseFillEmptyRows_", "denseShape", "$denseShape", "sparseFillEmptyRows", "sparseReshape_", "inputIndices", "$inputIndices", "$inputShape", "$newShape", "sparseReshape", "sparseSegmentMean_", "sparseSegmentMean", "sparseSegmentSum_", "sparseSegmentSum", "stringNGrams_", "dataSplits", "separator", "nGramWidths", "leftPad", "padWidth", "preserveShortSequences", "$dataSplits", "stringNGrams", "stringSplit_", "delimiter", "skipEmpty", "$delimiter", "stringSplit", "stringToHashBucketFast_", "numBuckets", "stringToHashBucketFast", "staticRegexReplace_", "pattern", "rewrite", "replaceGlobal", "staticRegexReplace", "linalg", "executeOp", "tfOps", "assertShapesMatchAllowUndefinedSize", "dim0", "dim1", "fullDefinedShape", "elementShape", "inferElementShape", "listElementShape", "partialShape", "mergeElementShape", "notfullDefinedShape", "elementShapeA", "elementShapeB", "TensorArray", "maxSize", "identicalElementShapes", "dynamicSize", "clearAfterRead", "keep", "keepIds", "tensorWithState", "length", "totalLength", "cumulativeLengths", "elementPerRow", "previousLength", "indices_1", "sizes", "TensorList", "elementDtype", "maxNumElements", "numElements", "outputElementShape", "reshapedTensors", "destTensorList", "elementIndex", "fromTensor", "tensorElementShape", "tensorList", "reserve", "scatter", "shapeWithoutFirstDim", "thenFunc", "elseFunc", "cond", "condValue", "bodyFunc", "condFunc", "condResult", "argIds_1", "origResult", "resultIds", "condResult_1", "pred", "frameId", "tensorArray", "writeTensor", "writeTensorArray", "readId", "readIndex", "readTensorArray", "gatherId", "gatherIndices", "gatherDtype", "gatherTensorArray", "scatterId", "scatterIndices", "scatterTensor", "scatterTensorArray", "concatId", "concatTensorArray", "concatDtype", "splitId", "splitTensor", "lengths", "splitTensorArray", "sizeId", "sizeTensorArray", "closeId", "closeTensorArray", "idTensor", "elementDType", "numElementsParam", "srcTensorList", "fusedConvAndDepthWiseParams", "extraOp", "activationFunc", "isBiasAdd", "noBiasAdd", "isPrelu", "isBatchNorm", "numArgs", "biasArg", "preluArg", "kernelSize", "indexes", "nmsParams", "data_1", "snapshot", "message", "summarize", "HashTable", "keyDType", "valueDType", "tfOps.scalar", "$keys", "keysLength", "valuesLength", "existingTableHandle", "handle", "outputNestedSplits", "outputDenseValues", "rtNestedSplits", "rtDenseValues", "x_1", "weights_1", "size_1", "dims", "squeezedShape", "mapped", "sameShape", "outputIndices", "outputValues", "emptyRowIndicator", "reverseIndexMap", "outputData", "nGrams", "nGramsSplits", "tfc", "arithmetic.executeOp", "basicMath.executeOp", "control.executeOp", "convolution.executeOp", "creation.executeOp", "dynamic.executeOp", "evaluation.executeOp", "image.executeOp", "graph.executeOp", "logical.executeOp", "matrices.executeOp", "normalization.executeOp", "ragged.executeOp", "reduction.executeOp", "sliceJoin.executeOp", "sparse.executeOp", "spectral.executeOp", "string.executeOp", "transformation.executeOp", "hashTable.executeOp", "ExecutionContext", "weightMap", "tensorArrayMap", "tensorListMap", "functionMap", "parseNodeNameCache", "frameName", "contexts", "names", "getExecutionSubgraph", "usedNodes", "missingInputs", "dynamicNode", "syncInputs", "inputNodeNames", "initNodeNames", "frontier", "isControlFlow", "isDynamicShape", "isHashTable", "child", "getNodesInTopologicalOrder", "executionInfo", "inputNodes", "isUsed", "predefinedNodes", "nameToNode", "inCounts", "allNodes_1", "allNodes_1_1", "e_2", "inCount", "orderedNodeNames", "e_3", "orderedNodes", "filteredOrderedNodes", "filterPredefinedReachableNodes", "validateNodesExecutionOrder", "predefinedReachableNodeNames", "e_4", "NodesExecutionOrderError", "nodeNameToOrder", "order", "predefinedNodeNames", "isPredefined", "willBeExecutedNodeNames", "willBeExecuted", "orderedNodes_1", "orderedNodes_1_1", "e_6", "e_7", "getNodeLiveUntilMap", "INF_LIFE", "selfLifespans", "nodeOrder", "getSelfLifeSpan", "selfLife", "liveUntilOrders", "liveUntilMap", "liveUntilOrder", "liveUntilNode", "CONTROL_FLOW_OPS", "DYNAMIC_SHAPE_OPS", "HASH_TABLE_OPS", "GraphExecutor", "parent", "weightIds", "sortedInputs", "sortedOutputs", "outNames", "inNames", "nodeLiveUntilMap", "clonedTensor", "tensorsList", "outputNodeNames", "outputNodeNameSet", "outputNodes", "compilationKey", "compilation", "tensorsToKeep", "ids", "intermediateTensorConsumerCount", "_h", "_j", "tensors_1", "tensors_1_1", "liveUntilNodes", "isNonDisposableNode", "liveUntilNodes_1", "liveUntilNodes_1_1", "nodeToDispose", "tensors_2", "tensors_2_1", "tensorsList_1", "tensorsList_1_1", "isFunctionExecution", "results", "outputIds", "inputIds", "mappedInputs", "outputNames", "added", "promises", "missingOutputs", "alternativeMsg", "this_1", "currentContext_1", "childNode", "shape_1", "match", "notInGraph", "normalizedName", "ResourceManager", "hashTableNameToHandle", "hashTableMap", "DTYPE_VALUE_SIZE_MAP", "NUM_BYTES_STRING_LENGTH", "getWeightBytelengthAsync", "spec", "quantization", "bytesPerValue", "byteLength", "decodeWeight", "byteBuffer", "quantizationSizeFactor", "quantizedArray", "float16Decode", "getFloat16Decoder", "dtypeFactor", "realTensor", "imageTensor", "complexTensor", "readToLength", "reader", "initialData", "missing", "newData", "decodeWeightsStream", "weightStream", "specs", "specs_2", "specs_2_1", "tensorData", "weightTensor", "computeFloat16MantisaTable", "convertMantissa", "mantisaTable", "computeFloat16ExponentTable", "exponentTable", "computeFloat16OffsetTable", "offsetTable", "bufferUint32View", "float16Bits", "float32Bits", "TFHUB_SEARCH_PARAM", "DEFAULT_MODEL_NAME", "GraphModel", "modelUrl", "loadOptions", "tfio", "io", "path", "handlers", "loadResult", "artifacts", "metadata", "initializer", "handlerOrURL", "outputTensors", "outputTensorsArray", "outputTensorMap_1", "outputTensor", "signatureInputs", "numCapturedInputs", "inputIndex", "resourceId", "signatureOutputs", "newMap", "loadGraphModel", "getTFHubUrl", "model", "loadGraphModelSync", "modelSource", "ioHandler", "modelJSON", "weightSpecs", "modelArtifacts", "version", "fs", "path", "zlib", "import_tfjs_core", "import_tfjs_converter", "Callable", "closure", "args", "dispatchCallback", "progress_callback", "data", "reverseDictionary", "key", "value", "escapeRegExp", "string", "isIntegralNumber", "x", "mergeArrays", "arrs", "len", "s", "length", "c", "fs", "path", "fs", "path", "url", "VERSION", "IS_BROWSER_ENV", "IS_WEBWORKER_ENV", "IS_WEB_CACHE_AVAILABLE", "IS_WEBGPU_AVAILABLE", "IS_WEBNN_AVAILABLE", "IS_PROCESS_AVAILABLE", "IS_NODE_ENV", "IS_FS_AVAILABLE", "isEmpty", "IS_PATH_AVAILABLE", "IS_DENO_RUNTIME", "IS_BUN_RUNTIME", "apis", "RUNNING_LOCALLY", "dirname__", "_import_meta_url", "DEFAULT_CACHE_DIR", "DEFAULT_LOCAL_MODEL_PATH", "localModelPath", "env", "obj", "CONTENT_TYPE_MAP", "FileResponse", "_FileResponse", "filePath", "fs", "stats", "stream", "controller", "chunk", "err", "extension", "response", "data", "isValidUrl", "string", "protocols", "validHosts", "url", "REPO_ID_REGEX", "isValidHfModelId", "getFile", "urlOrPath", "env", "IS_CI", "version", "headers", "token", "ERROR_MAPPING", "handleError", "status", "remoteURL", "fatal", "message", "FileCache", "path", "request", "file", "progress_callback", "contentLength", "total", "loaded", "fileStream", "reader", "done", "value", "resolve", "reject", "progress", "error", "tryCache", "cache", "names", "name", "result", "getModelFile", "path_or_repo_id", "filename", "options", "return_path", "dispatchCallback", "e", "apis", "revision", "requestURL", "pathJoin", "validModelId", "localPath", "cacheKey", "proposedCacheKey", "toCacheResponse", "cacheHit", "buffer", "readResponse", "wrapped_progress", "cachedResponse", "getModelText", "modelPath", "fileName", "getModelJSON", "text", "read", "newLoaded", "newBuffer", "parts", "part", "index", "permute_data", "array", "dims", "axes", "shape", "stride", "s", "invStride", "_", "i", "permutedData", "newIndex", "j", "k", "min", "arr", "indexOfMin", "i", "max", "indexOfMax", "dummy_onnx_exports", "__export", "dummy_onnx_default", "esm_exports", "__export", "InferenceSession", "TRACE", "TRACE_FUNC_BEGIN", "TRACE_FUNC_END", "Tensor", "env", "registerBackend", "backends", "backendsSortedByPriority", "registerBackend", "name", "backend", "priority", "currentBackend", "i", "tryResolveAndInitializeBackend", "backendName", "backendInfo", "isInitializing", "e", "resolveBackendAndExecutionProviders", "options", "eps", "backendHints", "backendNames", "errors", "availableBackendNames", "resolveResult", "err", "filteredEps", "target", "prop", "version", "logLevelValue", "env", "version", "value", "env", "tensorToDataURL", "tensor", "options", "canvas", "pixels2DContext", "width", "height", "inputformat", "norm", "normMean", "normBias", "stride", "rTensorPointer", "gTensorPointer", "bTensorPointer", "aTensorPointer", "i", "j", "R", "G", "B", "A", "tensorToImageData", "image", "channels", "step", "rImagePointer", "gImagePointer", "bImagePointer", "aImagePointer", "bufferToTensor", "buffer", "options", "height", "width", "norm", "normMean", "normBias", "inputformat", "outputformat", "stride", "float32Data", "step", "rImagePointer", "gImagePointer", "bImagePointer", "aImagePointer", "rTensorPointer", "gTensorPointer", "bTensorPointer", "aTensorPointer", "i", "Tensor", "tensorFromImage", "image", "isHTMLImageEle", "isImageDataEle", "isImageBitmap", "isString", "data", "bufferToTensorOptions", "createCanvas", "createCanvasContext", "canvas", "pixels2DContext", "tempCanvas", "resolve", "reject", "context", "newImage", "img", "tensorFromTexture", "texture", "download", "dispose", "dims", "tensorFromGpuBuffer", "gpuBuffer", "dataType", "tensorFromMLTensor", "mlTensor", "tensorFromPinnedBuffer", "type", "NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP", "NUMERIC_TENSOR_TYPEDARRAY_TO_TYPE_MAP", "isTypedArrayChecked", "checkTypedArray", "isBigInt64ArrayAvailable", "isBigUint64ArrayAvailable", "Float16Array", "isFloat16ArrayAvailable", "calculateSize", "dims", "size", "i", "dim", "tensorReshape", "tensor", "Tensor", "Tensor", "arg0", "arg1", "arg2", "checkTypedArray", "type", "dims", "expectedTypedArrayConstructor", "NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP", "data", "maybeDims", "typedArrayConstructor", "firstElementType", "mappedType", "NUMERIC_TENSOR_TYPEDARRAY_TO_TYPE_MAP", "size", "calculateSize", "image", "options", "tensorFromImage", "texture", "tensorFromTexture", "gpuBuffer", "tensorFromGpuBuffer", "mlTensor", "tensorFromMLTensor", "buffer", "tensorFromPinnedBuffer", "tensorToDataURL", "tensorToImageData", "releaseData", "tensorReshape", "Tensor", "TRACE", "deviceType", "label", "env", "TRACE_FUNC", "msg", "extraMsg", "stack", "hasTraceFunc", "i", "TRACE_FUNC_BEGIN", "TRACE_FUNC_END", "InferenceSession", "_InferenceSession", "handler", "feeds", "arg1", "arg2", "TRACE_FUNC_BEGIN", "fetches", "options", "Tensor", "isFetchesEmpty", "name", "isFetches", "arg1Keys", "v", "results", "returnValue", "key", "result", "TRACE_FUNC_END", "arg0", "arg3", "filePathOrUint8Array", "buffer", "byteOffset", "byteLength", "backend", "optionsWithValidatedEPs", "resolveBackendAndExecutionProviders", "InferenceSession", "isNode", "init_wasm_utils_env", "__esmMin", "origin", "isEsmImportMetaUrlHardcodedAsFileUri", "getScriptSrc", "scriptSrc", "inferWasmPathPrefixFromScriptSrc", "isSameOrigin", "normalizeUrl", "fallbackUrl", "preload", "dynamicImportDefault", "embeddedWasmModule", "importWasmModule", "init_wasm_utils_import", "URL2", "filename", "prefixOverride", "baseUrl", "absoluteUrl", "blob", "url", "urlOverride", "isMultiThreaded", "wasmModuleFilename", "wasmModuleUrl", "needPreload", "wasm", "initialized", "initializing", "aborted", "isMultiThreadSupported", "isSimdSupported", "isRelaxedSimdSupported", "initializeWebAssembly", "getInstance", "init_wasm_factory", "flags", "timeout", "numThreads", "multiThreadSupported", "wasmPaths", "wasmPrefixOverride", "mjsPathOverrideFlag", "mjsPathOverride", "wasmPathOverrideFlag", "wasmPathOverride", "wasmBinaryOverride", "objectUrl", "ortWasmFactory", "isTimeout", "tasks", "resolve", "reject", "config", "fileName", "inferredWasmPathPrefix", "module", "what", "allocWasmString", "iterateExtraOptions", "checkLastError", "init_wasm_utils", "data", "allocs", "dataLength", "dataOffset", "options", "prefix", "seen", "handler", "key", "value", "name", "message", "stack", "ptrSize", "paramsOffset", "errorCode", "errorMessagePointer", "errorMessage", "setRunOptions", "init_run_options", "runOptionsHandle", "runOptions", "tagDataOffset", "keyDataOffset", "valueDataOffset", "e", "alloc", "getGraphOptimzationLevel", "getExecutionMode", "appendDefaultOptions", "appendSessionConfig", "setExecutionProviders", "setSessionOptions", "init_session_options", "graphOptimizationLevel", "executionMode", "session", "ep", "sessionOptionsHandle", "executionProviders", "epName", "epOptions", "deviceType", "webgpuOptions", "epNameDataOffset", "epOptionsCount", "keysOffset", "valuesOffset", "i", "sessionOptions", "logIdDataOffset", "logSeverityLevel", "logVerbosityLevel", "optimizedModelFilePathOffset", "nameOffset", "tensorDataTypeStringToEnum", "tensorDataTypeEnumToString", "calculateTensorSizeInBytes", "tensorTypeToTypedArrayConstructor", "logLevelStringToEnum", "isGpuBufferSupportedType", "isMLTensorSupportedType", "dataLocationStringToEnum", "init_wasm_common", "type", "typeProto", "dateType", "dimsOrSize", "elementSize", "size", "a", "b", "logLevel", "location", "loadFile", "init_wasm_utils_load_file", "file", "readFile", "de", "createReadStream", "stream", "chunks", "chunk", "response", "contentLengthHeader", "fileSize", "reader", "buffer", "pages", "offset", "done", "chunkSize", "initOrt", "initRuntime", "initEp", "activeSessions", "getSessionInputOutputCount", "getSessionInputOutputMetadata", "copyFromExternalBuffer", "createSession", "releaseSession", "prepareInputOutputTensor", "run", "endProfiling", "init_wasm_core_impl", "loggingLevel", "env", "sessionHandle", "index", "metadataOffset", "elementType", "dimsCount", "dims", "symbolicDimNameOffset", "model", "modelDataOffset", "modelData", "modelDataLength", "ioBindingHandle", "inputNamesUTF8Encoded", "outputNamesUTF8Encoded", "loadingPromises", "path", "provider", "webnnOptions", "context", "gpuDevice", "powerPreference", "inputCount", "outputCount", "enableGraphCapture", "inputNames", "outputNames", "inputMetadata", "outputMetadata", "outputPreferredLocations", "shape", "nameString", "buf", "sessionId", "ioBindingState", "tensor", "tensorHandles", "tensorNameUTF8Encoded", "dataType", "actualLocation", "rawData", "dataByteLength", "gpuBuffer", "registerBuffer", "mlTensor", "registerMLTensor", "isGraphInput", "tensorName", "dataTypeEnum", "createTemporaryTensor", "uploadTensor", "tensorId", "dimsOffset", "d", "inputIndices", "inputTensors", "outputIndices", "outputTensors", "inputOutputBound", "runOptionsAllocs", "inputTensorHandles", "outputTensorHandles", "inputOutputAllocs", "beforeRunStack", "inputValuesOffset", "inputNamesOffset", "outputValuesOffset", "outputNamesOffset", "output", "beforeGetTensorDataStack", "tensorDataOffset", "keepOutputTensor", "valueType", "dimsLength", "preferredLocation", "stringData", "nextOffset", "maxBytesToRead", "getBuffer", "bufferSize", "ensureTensor", "isInt64Supported", "typedArrayConstructor", "v", "p", "profileFileName", "initializeWebAssemblyAndOrtRuntime", "initializeOrtEp", "init_proxy_wrapper", "inputs", "outputs", "encodeTensorMetadata", "decodeTensorMetadata", "OnnxruntimeWebAssemblySessionHandler", "init_session_handler_inference", "getName", "Tensor", "download", "dispose", "pathOrBuffer", "TRACE_FUNC_BEGIN", "TRACE_FUNC_END", "feeds", "fetches", "inputArray", "kvp", "outputArray", "t", "results", "resultMap", "backend_wasm_exports", "__export", "OnnxruntimeWebAssemblyBackend", "initializeFlags", "wasmBackend", "init_backend_wasm", "simd", "numCpuLogicalCores", "backendName", "version", "index_default", "ort", "pt", "ht", "lt", "registerBackend", "version", "logLevelValue", "env", "version", "value", "tensorToDataURL", "tensor", "options", "canvas", "pixels2DContext", "width", "height", "inputformat", "norm", "normMean", "normBias", "stride", "rTensorPointer", "gTensorPointer", "bTensorPointer", "aTensorPointer", "i", "j", "R", "G", "B", "A", "tensorToImageData", "image", "channels", "step", "rImagePointer", "gImagePointer", "bImagePointer", "aImagePointer", "bufferToTensor", "buffer", "options", "height", "width", "norm", "normMean", "normBias", "inputformat", "outputformat", "stride", "float32Data", "step", "rImagePointer", "gImagePointer", "bImagePointer", "aImagePointer", "rTensorPointer", "gTensorPointer", "bTensorPointer", "aTensorPointer", "i", "Tensor", "tensorFromImage", "image", "isHTMLImageEle", "isImageDataEle", "isImageBitmap", "isString", "data", "bufferToTensorOptions", "createCanvas", "createCanvasContext", "canvas", "pixels2DContext", "tempCanvas", "resolve", "reject", "context", "newImage", "img", "tensorFromTexture", "texture", "download", "dispose", "dims", "tensorFromGpuBuffer", "gpuBuffer", "dataType", "tensorFromMLTensor", "mlTensor", "tensorFromPinnedBuffer", "type", "NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP", "NUMERIC_TENSOR_TYPEDARRAY_TO_TYPE_MAP", "isTypedArrayChecked", "checkTypedArray", "isBigInt64ArrayAvailable", "isBigUint64ArrayAvailable", "Float16Array", "isFloat16ArrayAvailable", "calculateSize", "dims", "size", "i", "dim", "tensorReshape", "tensor", "Tensor", "Tensor", "arg0", "arg1", "arg2", "checkTypedArray", "type", "dims", "expectedTypedArrayConstructor", "NUMERIC_TENSOR_TYPE_TO_TYPEDARRAY_MAP", "data", "maybeDims", "typedArrayConstructor", "firstElementType", "mappedType", "NUMERIC_TENSOR_TYPEDARRAY_TO_TYPE_MAP", "size", "calculateSize", "image", "options", "tensorFromImage", "texture", "tensorFromTexture", "gpuBuffer", "tensorFromGpuBuffer", "mlTensor", "tensorFromMLTensor", "buffer", "tensorFromPinnedBuffer", "tensorToDataURL", "tensorToImageData", "releaseData", "tensorReshape", "Tensor", "DEVICE_TO_EXECUTION_PROVIDER_MAPPING", "supportedDevices", "defaultDevices", "ONNX", "ORT_SYMBOL", "apis", "dummy_onnx_default", "dummy_onnx_exports", "ort_node_min_exports", "InferenceSession", "webInferenceChain", "IS_WEB_ENV", "apis", "isONNXTensor", "x", "ONNX", "ONNX_ENV", "env", "env", "ONNX_ENV", "DataTypeMap", "Tensor", "_Tensor", "value", "args", "isONNXTensor", "obj", "key", "index", "iterLength", "iterDims", "iterSize", "b", "i", "safeIndex", "a", "item", "this_data", "o1", "o2", "data", "reshape", "callback", "val", "slices", "newTensorDims", "newOffsets", "sliceIndex", "slice", "start", "end", "offsets", "newDims", "newBufferSize", "stride", "isContiguous", "slicedData", "originalIndex", "j", "num", "size", "dims", "permute", "dim", "keepdim", "p", "fn", "type", "result", "resultDims", "reduce_helper", "norm", "norm_data", "resultIndex", "resultMultiplier", "dimsToStride", "calc_squeeze_dims", "calc_unsqueeze_dims", "start_dim", "end_dim", "dimsToKeepBefore", "dimsToFlatten", "dimsToKeepAfter", "inferredIndex", "productOther", "product", "curr", "mask", "min", "max", "mean", "map_fn", "is_source_bigint", "is_dest_bigint", "x", "dimensions", "totalElements", "dimensionSize", "reshapedArray", "acc", "lastArray", "tensor", "axes", "permutedData", "shape", "permute_data", "calc_squeeze_dims", "dims", "dim", "d", "x", "i", "calc_unsqueeze_dims", "safeIndex", "index", "size", "dimension", "boundsCheck", "reduce_helper", "callbackfn", "input", "dim", "keepdim", "initialValue", "inputData", "inputDims", "safeIndex", "resultDims", "result", "i", "resultIndex", "j", "num", "resultMultiplier", "size", "index", "mean", "input", "dim", "keepdim", "inputDims", "inputData", "val", "a", "b", "Tensor", "safeIndex", "type", "result", "resultDims", "reduce_helper", "i", "dimsToStride", "dims", "stride", "s2", "PriorityQueue", "comparator", "a", "b", "maxSize", "values", "value", "smallest", "poppedValue", "bottom", "replacedValue", "i", "j", "temp", "node", "maxChild", "CharTrie", "CharTrieNode", "texts", "text", "ch", "child", "prefix", "_CharTrieNode", "isLeaf", "children", "TokenLattice", "sentence", "bosTokenId", "eosTokenId", "bos", "TokenLatticeNode", "eos", "pos", "length", "score", "tokenId", "nodeId", "len", "rnode", "bestScore", "bestNode", "lnode", "results", "prev", "x", "_TokenLatticeNode", "n", "DictionarySplitter", "dictionary", "trie", "word", "result", "start", "match", "LRUCache", "capacity", "key", "TOKEN_TYPES", "Token", "value", "type", "isWord", "char", "isInteger", "isWhitespace", "ORDERED_MAPPING_TABLE", "ESCAPE_CHARACTERS", "preprocess", "template", "options", "tokenize", "source", "tokens", "src", "cursorPosition", "curlyBracketDepth", "consumeWhile", "predicate", "str", "escaped", "unescaped", "stripTrailingWhitespace", "lastToken", "skipLeadingWhitespace", "main", "lastTokenType", "text", "stripBefore", "comment", "stripAfter", "lastTokenType2", "num", "seq", "c", "frac", "word", "Statement", "Program", "body", "If", "test", "alternate", "For", "loopvar", "iterable", "defaultBlock", "Break", "Continue", "SetStatement", "assignee", "Macro", "name", "args", "Comment", "Expression", "MemberExpression", "object", "property", "computed", "CallExpression", "callee", "Identifier", "Literal", "IntegerLiteral", "FloatLiteral", "StringLiteral", "ArrayLiteral", "TupleLiteral", "ObjectLiteral", "BinaryExpression", "operator", "left", "right", "FilterExpression", "operand", "filter", "FilterStatement", "SelectExpression", "lhs", "TestExpression", "negate", "UnaryExpression", "argument", "SliceExpression", "start", "stop", "step", "KeywordArgumentExpression", "key", "SpreadExpression", "CallStatement", "call", "callerArgs", "Ternary", "condition", "trueExpr", "falseExpr", "parse", "program", "current", "expect", "error", "prev", "expectIdentifier", "isIdentifier", "parseAny", "parseText", "parseJinjaStatement", "parseJinjaExpression", "is", "types", "i", "isStatement", "names", "result", "parseSetStatement", "parseIfStatement", "parseMacroStatement", "parseForStatement", "parseArgs", "parsePrimaryExpression", "callArgs", "callExpr", "filterNode", "parseCallExpression", "filterBody", "parseExpression", "parseExpressionSequence", "primary", "fn", "expressions", "isTuple", "loopVariable", "alternative", "parseIfExpression", "a", "parseLogicalOrExpression", "parseLogicalAndExpression", "parseLogicalNegationExpression", "arg", "parseComparisonExpression", "parseAdditiveExpression", "parseMultiplicativeExpression", "parseCallMemberExpression", "member", "parseMemberExpression", "expression", "parseArgumentsList", "expr", "parseMemberExpressionArgumentsList", "slices", "isSlice", "parseTestExpression", "parseFilterExpression", "token", "values", "range", "slice", "array", "direction", "titleCase", "strftime_now", "format2", "strftime", "date", "monthFormatterLong", "monthFormatterShort", "pad2", "n", "escapeRegExp", "s", "replace", "oldvalue", "newvalue", "count", "remaining", "pattern", "match", "BreakControl", "ContinueControl", "RuntimeValue", "BooleanValue", "IntegerValue", "FloatValue", "StringValue", "FunctionValue", "ArrayValue", "item", "sep", "NullValue", "maxsplit", "index", "part", "oldValue", "newValue", "NON_ASCII_CHARS", "makeAsciiSafe", "toJSON", "input", "depth", "convertUndefinedToNull", "indent", "ensureAscii", "separators", "sortKeys", "itemSeparator", "keySeparator", "indentValue", "basePadding", "childrenPadding", "core", "x", "entries", "b", "keyStr", "v", "ObjectValue", "defaultValue", "kwargs", "positionalArgs", "KeywordArgumentsValue", "caseSensitive", "by", "reverse", "items", "aVal", "bVal", "compareRuntimeValues", "TupleValue", "UndefinedValue", "Environment", "parent", "convertToRuntimeValues", "setupGlobals", "env", "getAttributeValue", "attributePath", "parts", "isNumericLike", "getNumericValue", "aNum", "bNum", "aStr", "bStr", "Interpreter", "node", "environment", "res", "rem", "positionalArguments", "keywordArguments", "spreadNode", "val", "kwarg", "seen", "output", "builtin", "filterName", "separatorsArg", "itemSep", "keySep", "separator", "booleanValue", "attribute", "getSortValue", "attrPath", "select", "attr", "testName", "testFunction", "filtered", "mapped", "width", "first", "blank", "lines", "indented", "replaceFn", "statements", "statement", "lastEvaluated", "rhs", "variableName", "tuple", "arr", "elem", "scope", "scopeUpdateFunctions", "loopScope", "scopeUpdateFunction", "scope2", "j", "noIteration", "loop", "evaluated", "err", "defaultEvaluated", "macroScope", "nodeArg", "passedArg", "identifier", "callerFn", "callerEnv", "callBlockEnv", "param", "macroArgs", "macroKwargs", "newEnv", "rendered", "mapping", "evaluatedKey", "_scope", "NEWLINE", "OPEN_STATEMENT", "CLOSE_STATEMENT", "getBinaryOperatorPrecedence", "format", "indentStr", "formatStatements", "createStatement", "stmts", "stmt", "formatStatement", "pad", "formatIf", "formatFor", "formatSet", "formatMacro", "formatCallStatement", "formatFilterStatement", "formatExpression", "clauses", "out", "formattedIterable", "params", "spec", "parentPrec", "thisPrecedence", "obj", "prop", "elems", "brackets", "k", "t", "st", "Template", "WHISPER_LANGUAGES", "WHISPER_LANGUAGE_MAPPING", "WHISPER_TO_LANGUAGE_CODE_MAPPING", "k", "v", "loadTokenizer", "pretrained_model_name_or_path", "options", "info", "getModelJSON", "regexSplit", "text", "regex", "result", "prev", "match", "fullMatch", "createPattern", "pattern", "invert", "key", "value", "PROBLEMATIC_REGEX_MAP", "escaped", "escapeRegExp", "objectToMap", "obj", "prepareTensorForDecode", "tensor", "dims", "clean_up_tokenization", "remove_accents", "lowercase_and_remove_accent", "is_chinese_char", "cp", "fuse_unk", "arr", "tokens_to_ids", "unk_token_id", "fused", "i", "whitespace_split", "PUNCTUATION_REGEX", "PUNCTUATION_ONLY_REGEX", "BLOOM_SPLIT_CHARS", "AddedToken", "config", "TokenizerModel", "Callable", "args", "WordPieceTokenizer", "Unigram", "BPE", "LegacyTokenizerModel", "tokens", "t", "ids", "outputTokens", "token", "chars", "isUnknown", "start", "subTokens", "end", "currentSubstring", "substr", "moreConfig", "vocabSize", "x", "min", "CharTrie", "lattice", "mblen", "beginPos", "hasSingleNode", "sliced", "prefixedTokens", "tokenId", "tokenScore", "n", "len", "normalized", "TokenLattice", "toReturn", "tokenized", "BYTES_TO_UNICODE", "bs", "_", "cs", "b", "ccs", "UNICODE_TO_BYTES", "reverseDictionary", "use_new_merge_format", "LRUCache", "cached", "word", "queue", "PriorityQueue", "a", "startingNode", "previousNode", "currentNode", "node", "newPreviousNode", "merged", "rank", "bpe_token_list", "byteTokens", "Normalizer", "BertNormalizer", "Precompiled", "NormalizerSequence", "Replace", "NFC", "NFD", "NFKC", "NFKD", "StripNormalizer", "StripAccents", "Lowercase", "Prepend", "UnicodeNormalizer", "normalizer", "output", "char", "PreTokenizer", "BertPreTokenizer", "PreTokenizerSequence", "WhitespacePreTokenizer", "WhitespaceSplit", "MetaspacePreTokenizer", "ByteLevelPreTokenizer", "SplitPreTokenizer", "PunctuationPreTokenizer", "DigitsPreTokenizer", "ReplacePreTokenizer", "FixedLengthPreTokenizer", "byte", "digit_pattern", "PostProcessor", "TemplateProcessing", "ByteLevelPostProcessor", "RobertaProcessing", "BertProcessing", "PostProcessorSequence", "tokens_pair", "add_special_tokens", "mergeArrays", "token_type_ids", "middle", "after", "type", "processedTokens", "types", "item", "processor", "Decoder", "WordPieceDecoder", "MetaspaceDecoder", "ByteLevelDecoder", "ReplaceDecoder", "ByteFallback", "FuseDecoder", "StripDecoder", "DecoderSequence", "CTCDecoder", "BPEDecoder", "new_tokens", "previous_byte_tokens", "bytes", "string", "start_cut", "stop_cut", "index", "byteArray", "c", "sub_texts", "current_sub_text", "grouped_tokens", "toks", "decoder", "MetaspacePreTokenizer", "PreTokenizer", "config", "text", "section_index", "normalized", "MetaspaceDecoder", "Decoder", "tokens", "result", "i", "Precompiled", "Normalizer", "part", "PreTokenizerSequence", "x", "options", "preTokenizedText", "tokenizer", "WhitespacePreTokenizer", "WhitespaceSplit", "whitespace_split", "ReplacePreTokenizer", "createPattern", "FixedLengthPreTokenizer", "SPECIAL_TOKEN_ATTRIBUTES", "padHelper", "item", "length", "value_fn", "side", "key", "diff", "value", "padData", "mergeArrays", "truncateHelper", "PreTrainedTokenizer", "Callable", "tokenizerJSON", "tokenizerConfig", "TokenizerModel", "PostProcessor", "addedToken", "token", "AddedToken", "DictionarySplitter", "chat_template", "name", "template", "keys", "pretrained_model_name_or_path", "progress_callback", "cache_dir", "local_files_only", "revision", "legacy", "info", "loadTokenizer", "text_pair", "add_special_tokens", "padding", "truncation", "max_length", "return_tensor", "return_token_type_ids", "isBatched", "encodedTokens", "t", "max", "dims", "Tensor", "sections", "lowercase_and_remove_accent", "sectionTokens", "token_type_ids", "input_ids", "pair", "tokens2", "batch", "decode_args", "token_ids", "prepareTensorForDecode", "isIntegralNumber", "skip_special_tokens", "clean_up_tokenization_spaces", "decoded", "clean_up_tokenization", "tools", "template_dict", "conversation", "documents", "add_generation_prompt", "tokenize", "return_dict", "tokenizer_kwargs", "kwargs", "compiledTemplate", "Template", "special_tokens_map", "rendered", "out", "BertTokenizer", "import_tfjs_core", "import_tfjs_core", "import_tfjs_core", "import_tfjs_core", "assertNotComplex", "tensor", "opName", "t", "whereImpl", "MathBackendCPU", "_MathBackendCPU", "values", "shape", "dtype", "dataId", "outId", "encodedValues", "d", "tensorData", "refCount", "complexTensorInfos", "realValues", "imagValues", "t", "data", "strings", "force", "tensorInfo", "f", "start", "condition", "assertNotComplex", "condVals", "import_tfjs_core", "import_tfjs_core", "createSimpleBinaryKernelImpl", "op", "aShape", "bShape", "aVals", "bVals", "dtype", "newShape", "resultRank", "resultStrides", "resultSize", "result", "aRank", "bRank", "aStrides", "bStrides", "aBroadcastDims", "bBroadcastDims", "i", "loc", "aLoc", "d", "aIndex", "bLoc", "bIndex", "import_tfjs_core", "import_tfjs_core", "import_tfjs_core", "complex", "args", "inputs", "backend", "real", "imag", "realVals", "imagVals", "complexInfo", "zeros", "backend", "shape", "dtype", "real", "imag", "complex", "values", "import_tfjs_core", "identity", "args", "inputs", "backend", "x", "identityConfig", "real", "args", "inputs", "backend", "input", "realVal", "castImpl", "values", "shape", "inputType", "dtype", "resultValues", "zero", "resultData", "resultShape", "createSimpleBinaryKernelImpl", "a", "b", "cast", "args", "inputs", "backend", "attrs", "x", "identity", "zerosTensorInfo", "zeros", "floatX", "result", "complex", "realPart", "real", "resultType", "castConfig", "binaryKernelFunc", "name", "simpleImpl", "complexImpl", "dtype", "inputs", "backend", "a", "b", "cpuBackend", "assertNotComplex", "aVals", "bVals", "decodedAVals", "decodedBVals", "$dtype", "resultData", "resultShape", "$aComplex", "cast", "$aComplexVals", "aReal", "aImag", "aRealVals", "aImagVals", "$bComplex", "$bComplexVals", "bReal", "bImag", "bRealVals", "bImagVals", "resultRealData", "resultImagData", "resultReal", "resultImag", "result", "complex", "createComplexBinaryKernelImpl", "op", "aShape", "bShape", "resultSize", "resultRank", "resultStrides", "resultRealVals", "resultImagVals", "aBroadcastDims", "bBroadcastDims", "aRank", "aStrides", "bRank", "bStrides", "i", "aIdx", "bIdx", "loc", "aLoc", "d", "aIndex", "bLoc", "bIndex", "opResult", "addImpl", "createSimpleBinaryKernelImpl", "a", "b", "addComplexImpl", "createComplexBinaryKernelImpl", "aReal", "aImag", "bReal", "bImag", "add", "binaryKernelFunc", "addConfig", "import_tfjs_core", "createSimpleUnaryImpl", "op", "values", "dtype", "attrs", "newValues", "i", "import_tfjs_core", "unaryKernelFunc", "name", "op", "dtype", "impl", "createSimpleUnaryImpl", "unaryKernelFuncFromImpl", "unaryImpl", "inputs", "attrs", "backend", "x", "assertNotComplex", "cpuBackend", "values", "decoded", "$dtype", "newValues", "import_tfjs_core", "concatImpl", "inputs", "outShape", "dtype", "simplyConcat", "outVals", "offset", "input", "size", "colOffset", "decodedData", "tIdx", "row", "resIdx", "col", "import_tfjs_core", "expImpl", "createSimpleUnaryImpl", "xi", "exp", "unaryKernelFuncFromImpl", "import_tfjs_core", "gatherV2Impl", "xBuf", "indicesBuf", "flattenOutputShape", "outBuf", "i", "originalLoc", "batchIdx", "indicesIdx", "indicesIndex", "originalIndex", "import_tfjs_core", "maxImpl", "aVals", "reduceSize", "outShape", "dtype", "vals", "i", "offset", "max", "j", "value", "import_tfjs_core", "maximumImpl", "createSimpleBinaryKernelImpl", "aValue", "bValue", "maximum", "binaryKernelFunc", "maximumConfig", "import_tfjs_core", "minimumImpl", "createSimpleBinaryKernelImpl", "aValue", "bValue", "minimum", "binaryKernelFunc", "minimumConfig", "import_tfjs_core", "multiplyImpl", "createSimpleBinaryKernelImpl", "aValue", "bValue", "multiplyComplexImpl", "createComplexBinaryKernelImpl", "aReal", "aImag", "bReal", "bImag", "multiply", "binaryKernelFunc", "multiplyConfig", "import_tfjs_core", "import_tfjs_core", "import_tfjs_core", "transposeImpl", "xVals", "xShape", "dtype", "perm", "newShape", "xRank", "xSize", "xStrides", "newStrides", "result", "i", "loc", "newLoc", "newIndex", "transpose", "args", "inputs", "attrs", "backend", "x", "perm", "assertNotComplex", "xRank", "newShape", "i", "values", "result", "transposeImpl", "transposeConfig", "prodImpl", "xShape", "xDtype", "xVals", "reductionAxes", "outShape", "reduceShape", "outDtype", "outVals", "reduceSize", "i", "offset", "prod", "j", "args", "inputs", "backend", "attrs", "x", "axis", "keepDims", "assertNotComplex", "xRank", "axes", "permutation", "permutedX", "intermediateTensorInfos", "transpose", "resultShape", "t", "prodConfig", "import_tfjs_core", "rangeImpl", "start", "stop", "step", "dtype", "sameStartStop", "increasingRangeNegativeStep", "decreasingRangePositiveStep", "numElements", "values", "i", "import_tfjs_core", "rsqrtImpl", "createSimpleUnaryImpl", "xi", "rsqrt", "unaryKernelFuncFromImpl", "rsqrtConfig", "import_tfjs_core", "sliceImpl", "vals", "begin", "size", "shape", "dtype", "isContinous", "length", "xStrides", "flatOffset", "decodedData", "inBuf", "outBuf", "i", "outLoc", "inLoc", "idx", "j", "slice", "args", "inputs", "backend", "attrs", "x", "assertNotComplex", "$begin", "$size", "outVals", "import_tfjs_core", "squaredDifferenceImpl", "createSimpleBinaryKernelImpl", "a", "b", "diff", "squaredDifference", "binaryKernelFunc", "squaredDifferenceConfig", "import_tfjs_core", "stridedSliceImpl", "outShape", "xBuf", "strides", "begin", "outBuf", "i", "loc", "newLoc", "j", "import_tfjs_core", "subImpl", "createSimpleBinaryKernelImpl", "aValue", "bValue", "subComplexImpl", "createComplexBinaryKernelImpl", "aReal", "aImag", "bReal", "bImag", "sub", "binaryKernelFunc", "subConfig", "import_tfjs_core", "tileImpl", "xBuf", "reps", "newShape", "i", "result", "newLoc", "originalLoc", "j", "originalIndex", "MathBackendCPU", "import_tfjs_core", "import_tfjs_core", "reshape", "args", "inputs", "backend", "attrs", "x", "shape", "xSize", "$shape", "$xSize", "xData", "real", "imag", "reshapeConfig", "gatherV2", "args", "inputs", "backend", "attrs", "x", "indices", "axis", "batchDims", "assertNotComplex", "parsedAxis", "indicesVals", "axisDim", "i", "index", "$batchDims", "indicesSize", "shapeInfo", "flattenX", "reshape", "flattenIndex", "flattenOutputShape", "indicesBuf", "xBuf", "outBuf", "gatherV2Impl", "gatherV2Config", "import_tfjs_core", "expandDims", "args", "inputs", "backend", "attrs", "input", "dim", "inputRank", "newShape", "$dim", "reshape", "expandDimsConfig", "import_tfjs_core", "stridedSlice", "args", "inputs", "backend", "attrs", "x", "begin", "end", "strides", "beginMask", "endMask", "ellipsisMask", "newAxisMask", "shrinkAxisMask", "assertNotComplex", "finalShapeSparse", "finalShape", "isIdentity", "sliceDim0", "isSimpleSlice", "$begin", "$end", "$strides", "result", "reshape", "size", "sliced", "slice", "xBuf", "outBuf", "stridedSliceImpl", "stridedSliceConfig", "import_tfjs_core", "import_tfjs_core", "imag", "args", "inputs", "backend", "input", "imagVal", "concat", "args", "inputs", "backend", "attrs", "axis", "$axis", "shapes", "t", "outShape", "$inputs", "identity", "reals", "real", "imags", "imag", "realConcated", "imagConcated", "result", "complex", "r", "i", "inputs2D", "shape", "reshape", "inputsValShapes", "simplyConcat", "outVals", "concatImpl", "finalOutShape", "outInfo", "concatConfig", "pack", "args", "inputs", "backend", "attrs", "axis", "expandDims", "shape", "dtype", "t", "intermediateTensorInfos", "expandedTensors", "expandedT", "result", "concat", "packConfig", "import_tfjs_core", "range", "args", "backend", "attrs", "start", "stop", "dtype", "step", "values", "rangeImpl", "rangeConfig", "import_tfjs_core", "import_tfjs_core", "realDivImpl", "createSimpleBinaryKernelImpl", "a", "b", "div", "binaryKernelFunc", "realDivConfig", "import_tfjs_core", "sum", "args", "inputs", "backend", "attrs", "x", "axis", "keepDims", "assertNotComplex", "$x", "cast", "identity", "xRank", "axes", "permutation", "reductionAxes", "permutedX", "transpose", "outShape", "reduceShape", "resultDtype", "result", "zeros", "reduceSize", "vals", "aVals", "i", "offset", "j", "newShape", "oldResult", "reshape", "sumConfig", "mean", "args", "inputs", "backend", "attrs", "x", "axis", "keepDims", "axes", "reduceShape", "reduceSize", "toDispose", "reduceSizeScalar", "$x", "cast", "res", "div", "result", "sum", "t", "meanConfig", "import_tfjs_core", "batchMatMul", "args", "inputs", "backend", "attrs", "b", "transposeA", "transposeB", "assertNotComplex", "aRank", "bRank", "innerShapeA", "innerShapeB", "outerShapeA", "outerShapeB", "outerDimsA", "outerDimsB", "batchDimA", "batchDimB", "outShape", "a3dShape", "b3dShape", "a3d", "reshape", "b3d", "sharedDim", "leftDim", "rightDim", "batchDim", "a3dValues", "b3dValues", "a3dStrides", "b3dStrides", "aBatch", "aOuterStep", "aInnerStep", "bInnerStep", "bOuterStep", "bBatch", "size", "result", "resVals", "blockSize", "bi", "batchIndexA", "batchIndexB", "i0", "iBlock", "j0", "jBlock", "k0", "kBlock", "i", "j", "sum", "k", "aVal", "bVal", "batchMatMulConfig", "import_tfjs_core", "import_tfjs_core", "max", "args", "inputs", "backend", "attrs", "x", "reductionIndices", "keepDims", "cpuBackend", "xShape", "xRank", "origAxes", "axes", "permutedAxes", "xVals", "newShape", "i", "transposeImpl", "assertNotComplex", "maxOutShape", "reduceShape", "reduceSize", "result", "maxImpl", "dataId", "outShape", "softmax", "args", "inputs", "backend", "attrs", "logits", "dim", "logitsRank", "$dim", "axes", "maxLogit", "max", "expandedShape", "maxLogitReshaped", "reshape", "a", "sub", "b", "exp", "sumExp", "sum", "sumReshaped", "result", "div", "softmaxConfig", "import_tfjs_core", "p", "a1", "a2", "a3", "a4", "a5", "erf", "unaryKernelFunc", "xi", "sign", "v", "t", "erfConfig", "import_tfjs_core", "tile", "args", "inputs", "backend", "attrs", "x", "reps", "assertNotComplex", "outBuf", "tileImpl", "tileConfig", "import_tfjs_core", "squareConfig", "inputs", "backend", "x", "cpuBackend", "assertNotComplex", "values", "newValues", "value", "castConfig", "gatherV2Config", "expandDimsConfig", "stridedSliceConfig", "reshapeConfig", "packConfig", "subConfig", "multiplyConfig", "addConfig", "rangeConfig", "meanConfig", "squaredDifferenceConfig", "rsqrtConfig", "prodConfig", "concatConfig", "batchMatMulConfig", "transposeConfig", "softmaxConfig", "erfConfig", "tileConfig", "sumConfig", "minimumConfig", "maximumConfig", "realDivConfig", "squareConfig", "identityConfig", "c", "path", "fs", "createNodeFileSystemIOHandler", "modelJsonPath", "dir", "modelJson", "modelTopology", "weightsManifest", "weightSpecs", "manifest", "shardPath", "fullPath", "weightData", "TfjsEmbedder", "_TfjsEmbedder", "benchmarkDir", "modelPath", "ioHandler", "oldLog", "oldWarn", "BertTokenizer", "e", "text", "tokenized", "extractData", "tensor", "data", "x", "inputIdsData", "attentionMaskData", "tokenTypeIdsData", "inputIds", "attentionMask", "tokenTypeIds", "result", "appendFileSync", "path", "MODERN_WEB_LOG_FILE", "logToolResult", "toolName", "result", "logDir", "logPath", "path", "MODERN_WEB_LOG_FILE", "logEntry", "appendFileSync", "err", "cachedVectors", "dotProduct", "a", "b", "i", "calculateNorm", "v", "sum", "val", "searchUseCases", "query", "limit", "minSimilarity", "embedder", "queryVector", "TfjsEmbedder", "queryNorm", "VECTORS_FILE", "path", "fs", "compressed", "jsonContent", "zlib", "item", "resultsMap", "sim", "existing", "results", "limitedResults", "r", "logToolResult"]
}