@genai-fi/nanogpt 0.6.3 → 0.7.1

package/dist/{index-BAzbokzv.js → index-UdZhlibC.js}

@@ -148,6 +148,9 @@ function z(e) {
     t *= e[n];
   return t;
 }
+function Ls(e) {
+  return e.length === 0;
+}
 function xt(e, t) {
   if (e === t)
     return !0;
@@ -161,14 +164,14 @@ function xt(e, t) {
 function Ne(e) {
   return e % 1 === 0;
 }
-function Ls(e) {
+function _s(e) {
   const t = Math.ceil(Math.sqrt(e));
   return [t, Math.ceil(e / t)];
 }
 function ut(e, t) {
   return t <= e.length ? e : e + " ".repeat(t - e.length);
 }
-function _s(e, t = (r) => 0, n, s) {
+function Os(e, t = (r) => 0, n, s) {
   return new Promise((r, a) => {
     let o = 0;
     const i = () => {
@@ -187,7 +190,7 @@ function _s(e, t = (r) => 0, n, s) {
     i();
   });
 }
-function Os(e, t) {
+function Gs(e, t) {
   let n = 1, s = -1;
   for (let a = 0; a < e.length; ++a)
     if (e[a] >= 0)
@@ -214,7 +217,7 @@ function $e(e, t) {
   const n = t.length;
   return e = e == null ? t.map((s, r) => r) : [].concat(e), y(e.every((s) => s >= -n && s < n), () => `All values in axis param must be in range [-${n}, ${n}) but got axis ${e}`), y(e.every((s) => Ne(s)), () => `All values in axis param must be integers but got axis ${e}`), e.map((s) => s < 0 ? n + s : s);
 }
-function Gs(e, t) {
+function Us(e, t) {
   const n = [], s = [], r = t != null && Array.isArray(t) && t.length === 0, a = t == null || r ? null : $e(t, e).sort();
   let o = 0;
   for (let i = 0; i < e.length; ++i) {
@@ -227,7 +230,7 @@ function Gs(e, t) {
   }
   return { newShape: n, keptDims: s };
 }
-function Us(e, t) {
+function zs(e, t) {
   return te(e, t);
 }
 function te(e, t) {
@@ -254,7 +257,7 @@ function Ce(e, t) {
 function Pe(e) {
   return e === "bool" || e === "complex64" || e === "float32" || e === "int32" || e === "string";
 }
-function zs(e, t) {
+function Vs(e, t) {
   return !(t === "complex64" || t === "float32" && e !== "complex64" || t === "int32" && e !== "float32" && e !== "complex64" || t === "bool" && e === "bool");
 }
 function It(e) {
@@ -287,7 +290,7 @@ function yt(e) {
 function dt(e) {
   return !!(e && e.constructor && e.call && e.apply);
 }
-function Vs(e, t) {
+function Ws(e, t) {
   for (let n = t; n < e; ++n)
     if (e % n === 0)
       return n;
@@ -326,7 +329,7 @@ function ct(e, t, n = !1) {
     throw new Error(`[${e}] does not match the input size ${t.length}${n ? " for a complex tensor" : ""}.`);
   return ee(0, e, t, n);
 }
-function Ws(e, t) {
+function js(e, t) {
   if (Array.isArray(e))
     return e;
   if (t === "float32")
@@ -352,7 +355,7 @@ function ne(e, t) {
     return new Uint8Array(e);
   throw new Error(`Unknown data type ${t}`);
 }
-function js(e, t) {
+function qs(e, t) {
   const n = e.reduce((s, r) => s * r, 1);
   if (t == null || t === "float32")
     return ct(e, new Float32Array(n));
@@ -367,7 +370,7 @@ function Ct(e) {
     y(Number.isInteger(t) && t >= 0, () => `Tensor must have a shape comprised of positive integers but got shape [${e}].`);
   });
 }
-function qs(e, t, n) {
+function Ks(e, t, n) {
   if (t === 0)
     return 0;
   if (t === 1)
@@ -377,7 +380,7 @@ function qs(e, t, n) {
     s += n[r] * e[r];
   return s;
 }
-function Ks(e, t, n) {
+function Hs(e, t, n) {
   if (t === 0)
     return [];
   if (t === 1)
@@ -539,7 +542,7 @@ function Lt(e, t) {
     return n.set(e, s), n.get(e);
   }
 }
-const Ke = "Abs", Hs = "Acos", Xs = "Acosh", ae = "Add", Js = "AddN", Ys = "All", Zs = "Any", Qs = "ArgMax", tr = "ArgMin", er = "Asin", nr = "Asinh", sr = "Atan", rr = "Atanh", ar = "Atan2", or = "AvgPool", ir = "AvgPoolGrad", cr = "AvgPool3D", lr = "AvgPool3DGrad", ur = "BatchMatMul", hr = "BatchToSpaceND", dr = "Bincount", fr = "BitwiseAnd", gr = "BroadcastTo", mr = "BroadcastArgs", oe = "Cast", pr = "Ceil", yr = "ClipByValue", br = "Complex", He = "ComplexAbs", wr = "Concat", Sr = "Conv2D", kr = "Conv2DBackpropFilter", Ir = "Conv2DBackpropInput", Tr = "Conv3D", Er = "Conv3DBackpropFilterV2", Ar = "Conv3DBackpropInputV2", vr = "Cos", Br = "Cosh", Mr = "Cumprod", Dr = "Cumsum", Fr = "CropAndResize", Rr = "DenseBincount", xr = "DepthToSpace", Nr = "DepthwiseConv2dNative", $r = "DepthwiseConv2dNativeBackpropFilter", Cr = "DepthwiseConv2dNativeBackpropInput", Pr = "Diag", Lr = "Dilation2D", _r = "Dilation2DBackpropInput", Or = "Dilation2DBackpropFilter", Gr = "Draw", Xe = "RealDiv", Ur = "Einsum", zr = "Elu", Vr = "EluGrad", Wr = "Erf", jr = "Equal", qr = "Exp", Kr = "ExpandDims", Hr = "Expm1", Xr = "FFT", Je = "Fill", Jr = "FlipLeftRight", Yr = "Floor", Ye = "FloorDiv", Zr = "FusedBatchNorm", Qr = "GatherV2", ta = "GatherNd", ea = "Greater", na = "GreaterEqual", ie = "Identity", sa = "IFFT", ra = "Imag", aa = "IsFinite", oa = "IsInf", ia = "IsNan", ca = "LeakyRelu", la = "Less", ua = "LessEqual", ha = "LinSpace", da = "Log", fa = "Log1p", ga = "LogicalAnd", ma = "LogicalNot", pa = "LogicalOr", ya = "LogSoftmax", ba = "LRN", wa = "LRNGrad", Sa = "Max", Ze = "Maximum", ka = "MaxPool", Ia = "MaxPoolGrad", Ta = "MaxPool3D", Ea = "MaxPool3DGrad", Aa = "MaxPoolWithArgmax", va = "Mean", Ba = "Min", Ma = "Minimum", Da = "MirrorPad", Fa = "Mod", Ra = "Multinomial", Qe = "Multiply", xa = "Neg", Na = "NotEqual", $a = "NonMaxSuppressionV3", Ca = "NonMaxSuppressionV4", Pa = "NonMaxSuppressionV5", La = "OnesLike", _a = "OneHot", Oa = "Pack", Ga = "PadV2", tn = "Pow", Ua = "Prelu", za = "Prod", Va = "RaggedGather", Wa = "RaggedRange", ja = "RaggedTensorToTensor", qa = "Range", Ka = "Real", Ha = "Reciprocal", Xa = "Relu", Ja = "Reshape", Ya = "ResizeNearestNeighbor", Za = "ResizeNearestNeighborGrad", Qa = "ResizeBilinear", to = "ResizeBilinearGrad", eo = "Relu6", no = "Reverse", so = "Round", ro = "Rsqrt", ao = "ScatterNd", oo = "TensorScatterUpdate", io = "SearchSorted", co = "Select", lo = "Selu", uo = "Slice", ho = "Sin", fo = "Sinh", go = "Sign", mo = "Sigmoid", po = "Softplus", en = "Sqrt", yo = "Sum", bo = "SpaceToBatchND", wo = "SplitV", So = "Softmax", ko = "SparseFillEmptyRows", Io = "SparseReshape", To = "SparseSegmentMean", Eo = "SparseSegmentSum", Ao = "SparseToDense", vo = "SquaredDifference", Bo = "Square", Mo = "StaticRegexReplace", Do = "StridedSlice", Fo = "StringNGrams", Ro = "StringSplit", xo = "StringToHashBucketFast", nn = "Sub", No = "Tan", $o = "Tanh", Co = "Tile", Po = "TopK", Lo = "Transform", _o = "Transpose", Oo = "Unique", Go = "Unpack", Uo = "UnsortedSegmentSum", sn = "ZerosLike", zo = "Step", Vo = "FromPixels", Wo = "RotateWithOffset", jo = "_FusedMatMul", qo = "FusedConv2D", Ko = "FusedDepthwiseConv2D";
+const Ke = "Abs", Xs = "Acos", Js = "Acosh", ae = "Add", Ys = "AddN", Zs = "All", Qs = "Any", tr = "ArgMax", er = "ArgMin", nr = "Asin", sr = "Asinh", rr = "Atan", ar = "Atanh", or = "Atan2", ir = "AvgPool", cr = "AvgPoolGrad", lr = "AvgPool3D", ur = "AvgPool3DGrad", hr = "BatchMatMul", dr = "BatchToSpaceND", fr = "Bincount", gr = "BitwiseAnd", mr = "BroadcastTo", pr = "BroadcastArgs", oe = "Cast", yr = "Ceil", br = "ClipByValue", wr = "Complex", He = "ComplexAbs", Sr = "Concat", kr = "Conv2D", Ir = "Conv2DBackpropFilter", Tr = "Conv2DBackpropInput", Er = "Conv3D", Ar = "Conv3DBackpropFilterV2", vr = "Conv3DBackpropInputV2", Br = "Cos", Mr = "Cosh", Dr = "Cumprod", Fr = "Cumsum", Rr = "CropAndResize", xr = "DenseBincount", Nr = "DepthToSpace", $r = "DepthwiseConv2dNative", Cr = "DepthwiseConv2dNativeBackpropFilter", Pr = "DepthwiseConv2dNativeBackpropInput", Lr = "Diag", _r = "Dilation2D", Or = "Dilation2DBackpropInput", Gr = "Dilation2DBackpropFilter", Ur = "Draw", Xe = "RealDiv", zr = "Einsum", Vr = "Elu", Wr = "EluGrad", jr = "Erf", qr = "Equal", Kr = "Exp", Hr = "ExpandDims", Xr = "Expm1", Jr = "FFT", Je = "Fill", Yr = "FlipLeftRight", Zr = "Floor", Ye = "FloorDiv", Qr = "FusedBatchNorm", ta = "GatherV2", ea = "GatherNd", na = "Greater", sa = "GreaterEqual", ie = "Identity", ra = "IFFT", aa = "Imag", oa = "IsFinite", ia = "IsInf", ca = "IsNan", la = "LeakyRelu", ua = "Less", ha = "LessEqual", da = "LinSpace", fa = "Log", ga = "Log1p", ma = "LogicalAnd", pa = "LogicalNot", ya = "LogicalOr", ba = "LogSoftmax", wa = "LRN", Sa = "LRNGrad", ka = "Max", Ze = "Maximum", Ia = "MaxPool", Ta = "MaxPoolGrad", Ea = "MaxPool3D", Aa = "MaxPool3DGrad", va = "MaxPoolWithArgmax", Ba = "Mean", Ma = "Min", Da = "Minimum", Fa = "MirrorPad", Ra = "Mod", xa = "Multinomial", Qe = "Multiply", Na = "Neg", $a = "NotEqual", Ca = "NonMaxSuppressionV3", Pa = "NonMaxSuppressionV4", La = "NonMaxSuppressionV5", _a = "OnesLike", Oa = "OneHot", Ga = "Pack", Ua = "PadV2", tn = "Pow", za = "Prelu", Va = "Prod", Wa = "RaggedGather", ja = "RaggedRange", qa = "RaggedTensorToTensor", Ka = "Range", Ha = "Real", Xa = "Reciprocal", Ja = "Relu", Ya = "Reshape", Za = "ResizeNearestNeighbor", Qa = "ResizeNearestNeighborGrad", to = "ResizeBilinear", eo = "ResizeBilinearGrad", no = "Relu6", so = "Reverse", ro = "Round", ao = "Rsqrt", oo = "ScatterNd", io = "TensorScatterUpdate", co = "SearchSorted", lo = "Select", uo = "Selu", ho = "Slice", fo = "Sin", go = "Sinh", mo = "Sign", po = "Sigmoid", yo = "Softplus", en = "Sqrt", bo = "Sum", wo = "SpaceToBatchND", So = "SplitV", ko = "Softmax", Io = "SparseFillEmptyRows", To = "SparseReshape", Eo = "SparseSegmentMean", Ao = "SparseSegmentSum", vo = "SparseToDense", Bo = "SquaredDifference", Mo = "Square", Do = "StaticRegexReplace", Fo = "StridedSlice", Ro = "StringNGrams", xo = "StringSplit", No = "StringToHashBucketFast", nn = "Sub", $o = "Tan", Co = "Tanh", Po = "Tile", Lo = "TopK", _o = "Transform", Oo = "Transpose", Go = "Unique", Uo = "Unpack", zo = "UnsortedSegmentSum", sn = "ZerosLike", Vo = "Step", Wo = "FromPixels", jo = "RotateWithOffset", qo = "_FusedMatMul", Ko = "FusedConv2D", Ho = "FusedDepthwiseConv2D";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -559,7 +562,7 @@ const Ke = "Abs", Hs = "Acos", Xs = "Acosh", ae = "Add", Js = "AddN", Ys = "All"
 function O(...e) {
   S().getBool("IS_TEST") || S().getBool("PROD") || console.warn(...e);
 }
-function Ho(...e) {
+function Xo(...e) {
   S().getBool("IS_TEST") || S().getBool("PROD") || console.log(...e);
 }
 /**
@@ -597,11 +600,11 @@ function Wt(e) {
   }
   return n;
 }
-function Xo(e) {
+function Jo(e) {
   const { kernelName: t, backendName: n } = e, s = ce(t, n);
   ft.has(s) && O(`The kernel '${t}' for backend '${n}' is already registered`), ft.set(s, e);
 }
-function Jo(e) {
+function Yo(e) {
   const { kernelName: t } = e;
   Tt.has(t) && S().getBool("DEBUG") && O(`Overriding the gradient for '${t}'`), Tt.set(t, e);
 }
@@ -643,7 +646,7 @@ function le(e) {
  * limitations under the License.
  * =============================================================================
  */
-function Yo(e, t) {
+function Zo(e, t) {
   return t === "string" ? ue(e) : _t([e], t);
 }
 function rn(e, t) {
@@ -769,8 +772,8 @@ class cn {
     for (const m in a) {
       const p = a[m];
       if (p != null) {
-        const f = p.shape || n.shape, w = f.length;
-        d += `${m}: ${w}D ${w > 0 ? f : ""} `;
+        const g = p.shape || n.shape, w = g.length;
+        d += `${m}: ${w}D ${w > 0 ? g : ""} `;
       }
     }
     console.log(`%c${c}	%c${i}	%c${l}D ${h}	%c${u}	%c${d}	%c${o}`, "font-weight:bold", "color:red", "color:blue", "color: orange", "color: green", "color: steelblue");
@@ -803,7 +806,7 @@ function ln(e, t, n) {
       let m = !1;
       for (let p = 0; p < t.length; p++)
         if (s[d.id]) {
-          l.outputs.forEach((f) => s[f.id] = !0), m = !0, r[l.id] = !0;
+          l.outputs.forEach((g) => s[g.id] = !0), m = !0, r[l.id] = !0;
           break;
         }
       if (m)
@@ -908,8 +911,8 @@ function ht(e, t, n, s, r, a = !0) {
   const o = n === "complex64" ? 2 : 1, i = t[0], c = t.length;
   if (c === 0) {
     if (n === "complex64") {
-      const f = it(e);
-      return [ot(f[0], 0, n)];
+      const g = it(e);
+      return [ot(g[0], 0, n)];
     }
     return n === "bool" ? [he(e[0])] : [e[0].toString()];
   }
@@ -927,8 +930,8 @@ function ht(e, t, n, s, r, a = !0) {
   }
   const l = t.slice(1), u = s.slice(1), h = s[0] * o, d = [];
   if (i > qt) {
-    for (let f = 0; f < at; f++) {
-      const w = f * h, I = w + h;
+    for (let g = 0; g < at; g++) {
+      const w = g * h, I = w + h;
       d.push(...ht(
         e.slice(w, I),
         l,
@@ -940,38 +943,38 @@ function ht(e, t, n, s, r, a = !0) {
       ));
     }
     d.push("...");
-    for (let f = i - at; f < i; f++) {
-      const w = f * h, I = w + h;
+    for (let g = i - at; g < i; g++) {
+      const w = g * h, I = w + h;
       d.push(...ht(
         e.slice(w, I),
         l,
         n,
         u,
         r,
-        f === i - 1
+        g === i - 1
         /* isLast */
       ));
     }
   } else
-    for (let f = 0; f < i; f++) {
-      const w = f * h, I = w + h;
+    for (let g = 0; g < i; g++) {
+      const w = g * h, I = w + h;
       d.push(...ht(
         e.slice(w, I),
         l,
         n,
         u,
         r,
-        f === i - 1
+        g === i - 1
         /* isLast */
       ));
     }
   const m = c === 2 ? "," : "";
   d[0] = "[" + (i > 0 ? d[0] + m : "");
-  for (let f = 1; f < d.length - 1; f++)
-    d[f] = " " + d[f] + m;
+  for (let g = 1; g < d.length - 1; g++)
+    d[g] = " " + d[g] + m;
   let p = `,
 `;
-  for (let f = 2; f < c; f++)
+  for (let g = 2; g < c; g++)
     p += `
 `;
   return d[d.length - 1] = " " + d[d.length - 1] + "]" + (a ? "" : p), d;
@@ -1339,7 +1342,7 @@ function fe(e, t) {
   }
   return pn[e][t];
 }
-function Zo(e) {
+function Qo(e) {
   return fe(e, "int32");
 }
 function ge(e) {
@@ -1370,7 +1373,7 @@ function K(e, t) {
   const n = fe(e.dtype, t.dtype);
   return [e.cast(n), t.cast(n)];
 }
-function Qo(e, t) {
+function ti(e, t) {
   return t.some((n) => n.id === e.id);
 }
 function pe(e) {
@@ -1585,10 +1588,10 @@ class et {
    * execution.
    */
   clone(t) {
-    const n = g.runKernel(ie, { x: t }), s = { x: t }, r = (o) => ({
+    const n = f.runKernel(ie, { x: t }), s = { x: t }, r = (o) => ({
       x: () => {
         const i = "float32", c = { x: o }, l = { dtype: i };
-        return g.runKernel(
+        return f.runKernel(
           oe,
           c,
           // tslint:disable-next-line: no-unnecessary-type-assertion
@@ -1643,28 +1646,28 @@ class et {
     let c;
     const l = St(t) ? t.kernelName : this.state.activeScope != null ? this.state.activeScope.name : "";
     if (St(t)) {
-      const { kernelName: p, inputs: f, attrs: w } = t;
+      const { kernelName: p, inputs: g, attrs: w } = t;
       this.backendName == null && this.backend;
       const I = zt(p, this.backendName);
       y(I != null, () => `Cannot find registered kernel '${p}' for backend '${this.backendName}'`), i = () => {
         const _ = this.backend.numDataIds();
-        c = I.kernelFunc({ inputs: f, attrs: w, backend: this.backend });
+        c = I.kernelFunc({ inputs: g, attrs: w, backend: this.backend });
         const X = Array.isArray(c) ? c : [c];
         this.shouldCheckForMemLeaks() && this.checkKernelForMemLeak(p, _, X);
         const J = X.map((rt) => rt.rank != null ? rt : this.makeTensorFromTensorInfo(rt));
         if (r) {
-          const rt = this.getTensorsForGradient(p, f, J);
+          const rt = this.getTensorsForGradient(p, g, J);
           s = this.saveTensorsForBackwardMode(rt);
         }
         return J;
       };
     } else {
-      const { forwardFunc: p } = t, f = (w) => {
+      const { forwardFunc: p } = t, g = (w) => {
         r && (s = w.map((I) => this.keep(this.clone(I))));
       };
       i = () => {
         const w = this.backend.numDataIds();
-        c = this.tidy(() => p(this.backend, f));
+        c = this.tidy(() => p(this.backend, g));
         const I = Array.isArray(c) ? c : [c];
         return this.shouldCheckForMemLeaks() && this.checkKernelForMemLeak(l, w, I), I;
       };
@@ -1956,7 +1959,7 @@ et.nextTensorId = 0;
 et.nextVariableId = 0;
 function bn(e) {
   const t = Ge(z(e), "float32");
-  return g.makeTensor(t, e, "float32");
+  return f.makeTensor(t, e, "float32");
 }
 function be() {
   const e = re();
@@ -1966,10 +1969,10 @@ function be() {
   }
   return je(e._tfengine.ENV), gn(() => e._tfengine), e._tfengine;
 }
-const g = be();
+const f = be();
 function wn(e, t) {
   const n = { a: e, b: t };
-  return g.runKernel(ae, n);
+  return f.runKernel(ae, n);
 }
 /**
  * @license
@@ -1990,7 +1993,7 @@ function wn(e, t) {
 function Sn() {
   return typeof navigator < "u" && navigator != null;
 }
-function ti(e) {
+function ei(e) {
   if (e || Sn()) {
     if (e || (e = navigator), e.product === "ReactNative")
       return !0;
@@ -2086,7 +2089,7 @@ function T(e, t, n, s = "numeric") {
   const a = In(e, r);
   !F(e) && !Array.isArray(e) && (e = [e]);
   const i = r !== "string" ? _t(e, r) : lt(e, [], !0);
-  return g.makeTensor(i, a, r);
+  return f.makeTensor(i, a, r);
 }
 function Tn(e, t, n, s = "numeric") {
   if (!Array.isArray(e))
@@ -2118,12 +2121,12 @@ function D(e) {
   const s = e[n];
   n.endsWith("_") && (n = n.substring(0, n.length - 1)), n = n + En;
   const r = (...a) => {
-    g.startScope(n);
+    f.startScope(n);
     try {
       const o = s(...a);
-      return Pt(o) && console.error("Cannot return a Promise inside of tidy."), g.endScope(o), o;
+      return Pt(o) && console.error("Cannot return a Promise inside of tidy."), f.endScope(o), o;
     } catch (o) {
-      throw g.endScope(null), o;
+      throw f.endScope(null), o;
     }
   };
   return Object.defineProperty(r, "name", { value: n, configurable: !0 }), r;
@@ -2152,7 +2155,7 @@ function An(e, t, n, s) {
   if (me(e) || ge(e)) {
     if (s !== "float32" && s !== "int32")
       throw new Error(`Creating tensor from GPU data only supports 'float32'|'int32' dtype, while the dtype is ${s}.`);
-    return g.backend.createTensorFromGPUData(e, t || n, s);
+    return f.backend.createTensorFromGPUData(e, t || n, s);
   }
   if (!F(e) && !Array.isArray(e) && typeof e != "number" && typeof e != "boolean" && typeof e != "string")
     throw new Error("values passed to tensor(values) must be a number/boolean/string or an array of numbers/booleans/strings, or a TypedArray");
@@ -2165,7 +2168,7 @@ function An(e, t, n, s) {
       y(n[o] === t[o] || !c, () => `Error creating a new Tensor. Inferred shape (${n}) does not match the provided shape (${t}). `);
     }
   }
-  return !F(e) && !Array.isArray(e) && (e = [e]), t = t || n, e = s !== "string" ? _t(e, s) : lt(e, [], !0), g.makeTensor(e, t, s);
+  return !F(e) && !Array.isArray(e) && (e = [e]), t = t || n, e = s !== "string" ? _t(e, s) : lt(e, [], !0), f.makeTensor(e, t, s);
 }
 class st {
   /**
@@ -2202,8 +2205,8 @@ class st {
     const r = n - t, a = new ArrayBuffer(r), o = new Uint8Array(a);
     let i = 0;
     for (let c = s; c < this.shards.length; c++) {
-      const l = this.shards[c], h = t + i - l.start, d = i, p = Math.min(n, l.end) - l.start, f = new Uint8Array(l.buffer, h, p - h);
-      if (o.set(f, d), i += f.length, n < l.end)
+      const l = this.shards[c], h = t + i - l.start, d = i, p = Math.min(n, l.end) - l.start, g = new Uint8Array(l.buffer, h, p - h);
+      if (o.set(g, d), i += g.length, n < l.end)
         break;
     }
     return a;
@@ -2251,32 +2254,41 @@ function vn(e, t) {
  * limitations under the License.
  * =============================================================================
  */
-function ei() {
-  g.disposeVariables();
-}
 function ni() {
-  return g;
+  f.disposeVariables();
 }
 function si() {
-  return g.memory();
+  return f;
+}
+function ri() {
+  return f.memory();
 }
 function E(e, t) {
-  return g.tidy(e, t);
+  return f.tidy(e, t);
 }
 function M(e) {
   pe(e).forEach((n) => n.dispose());
 }
 function Bn(e) {
-  return g.keep(e);
+  return f.keep(e);
 }
-function ri(e, t, n = 1) {
-  return g.registerBackend(e, t, n);
+function ai(e) {
+  return f.setBackend(e);
 }
-function ai() {
-  return g.backend;
+function oi() {
+  return f.ready();
+}
+function ii() {
+  return f.backendName;
+}
+function ci(e, t, n = 1) {
+  return f.registerBackend(e, t, n);
+}
+function li() {
+  return f.backend;
 }
 const Jt = 4;
-async function oi(e, t) {
+async function ui(e, t) {
   const n = [], s = [], r = Array.isArray(e) ? e.map((o) => o.name) : Object.keys(e);
   for (let o = 0; o < r.length; ++o) {
     const i = r[o], c = Array.isArray(e) ? e[o].tensor : e[i];
@@ -2286,10 +2298,10 @@ async function oi(e, t) {
     if (c.dtype === "string") {
       const u = new Promise(async (h) => {
         const d = await c.bytes(), m = d.reduce((w, I) => w + I.length, 0) + Jt * d.length, p = new Uint8Array(m);
-        let f = 0;
+        let g = 0;
         for (let w = 0; w < d.length; w++) {
           const I = d[w], _ = new Uint8Array(new Uint32Array([I.length]).buffer);
-          p.set(_, f), f += Jt, p.set(I, f), f += I.length;
+          p.set(_, g), g += Jt, p.set(I, g), g += I.length;
         }
         h(p);
       });
@@ -2339,10 +2351,10 @@ function Fn(e) {
     n.set([t.charCodeAt(s)], s);
   return n.buffer;
 }
-function ii(e) {
+function hi(e) {
   return st.join(e);
 }
-function ci(e, t) {
+function di(e, t) {
   const n = {
     modelTopology: e.modelTopology,
     format: e.format,
@@ -2368,7 +2380,7 @@ function Rn(e, t, n) {
   }
   return e.signature != null && (s.signature = e.signature), e.userDefinedMetadata != null && (s.userDefinedMetadata = e.userDefinedMetadata), e.modelInitializer != null && (s.modelInitializer = e.modelInitializer), e.initializerSignature != null && (s.initializerSignature = e.initializerSignature), s;
 }
-async function li(e, t) {
+async function fi(e, t) {
   let n, s;
   return e.weightsManifest != null && ([n, s] = await t(e.weightsManifest)), Rn(e, n, s);
 }
@@ -2383,7 +2395,7 @@ function Se(e) {
     weightDataBytes: e.weightData == null ? 0 : new st(e.weightData).byteLength
   };
 }
-function ui(e) {
+function gi(e) {
   const t = [];
   for (const n of e)
     t.push(...n.weights);
@@ -2460,7 +2472,7 @@ class A {
     }), r;
   }
 }
-const hi = (e) => A.getSaveHandlers(e);
+const mi = (e) => A.getSaveHandlers(e);
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -2555,8 +2567,8 @@ class W {
             }
             m.onsuccess = () => s({ modelArtifactsInfo: i }), m.onerror = (p) => {
               l = c.objectStore(L);
-              const f = l.delete(this.modelPath);
-              f.onsuccess = () => (o.close(), r(m.error)), f.onerror = (w) => (o.close(), r(m.error));
+              const g = l.delete(this.modelPath);
+              g.onsuccess = () => (o.close(), r(m.error)), g.onerror = (w) => (o.close(), r(m.error));
             };
           }, u.onerror = (d) => (o.close(), r(u.error)), c.oncomplete = () => {
             h == null ? o.close() : h.oncomplete = () => o.close();
@@ -2945,7 +2957,7 @@ function Kn(e, t) {
   if (t === "string" && n.dtype !== "string" || t !== "string" && n.dtype === "string")
     throw new Error("Only strings can be casted to strings");
   const s = { x: n }, r = { dtype: t };
-  return g.runKernel(oe, s, r);
+  return f.runKernel(oe, s, r);
 }
 const Rt = /* @__PURE__ */ D({ cast_: Kn });
 /**
@@ -2966,7 +2978,7 @@ const Rt = /* @__PURE__ */ D({ cast_: Kn });
  */
 function Hn(e) {
   const n = { x: T(e, "x", "clone", "string_or_numeric") };
-  return g.runKernel(ie, n);
+  return f.runKernel(ie, n);
 }
 const Xn = /* @__PURE__ */ D({ clone_: Hn });
 /**
@@ -3032,7 +3044,7 @@ function Zn(e, t) {
   let n = T(e, "a", "add"), s = T(t, "b", "add");
   [n, s] = K(n, s);
   const r = { a: n, b: s };
-  return g.runKernel(ae, r);
+  return f.runKernel(ae, r);
 }
 const k = /* @__PURE__ */ D({ add_: Zn });
 /**
@@ -3055,7 +3067,7 @@ function Qn(e, t) {
   let n = T(e, "a", "floorDiv"), s = T(t, "b", "floorDiv");
   [n, s] = K(n, s);
   const r = { a: n, b: s };
-  return g.runKernel(Ye, r);
+  return f.runKernel(Ye, r);
 }
 const ts = /* @__PURE__ */ D({ floorDiv_: Qn });
 /**
@@ -3079,7 +3091,7 @@ function es(e, t) {
   if ([n, s] = K(n, s), n.dtype === "int32" && s.dtype === "int32")
     return ts(n, s);
   const r = { a: n, b: s }, a = {};
-  return g.runKernel(Xe, r, a);
+  return f.runKernel(Xe, r, a);
 }
 const $ = /* @__PURE__ */ D({ div_: es });
 /**
@@ -3102,7 +3114,7 @@ function ns(e, t) {
   let n = T(e, "a", "mul"), s = T(t, "b", "mul");
   [n, s] = K(n, s);
   const r = { a: n, b: s };
-  return g.runKernel(Qe, r);
+  return f.runKernel(Qe, r);
 }
 const b = /* @__PURE__ */ D({ mul_: ns });
 /**
@@ -3125,10 +3137,10 @@ function ss(e) {
   const t = T(e, "x", "abs");
   if (t.dtype === "complex64") {
     const n = { x: t };
-    return g.runKernel(He, n);
+    return f.runKernel(He, n);
   } else {
     const n = { x: t };
-    return g.runKernel(Ke, n);
+    return f.runKernel(Ke, n);
   }
 }
 const rs = /* @__PURE__ */ D({ abs_: ss });
@@ -3151,7 +3163,7 @@ const rs = /* @__PURE__ */ D({ abs_: ss });
 function as(e, t, n) {
   Ct(e), n = n || yt(t);
   const s = { shape: e, value: t, dtype: n };
-  return g.runKernel(Je, {}, s);
+  return f.runKernel(Je, {}, s);
 }
 /**
  * @license
@@ -3169,7 +3181,7 @@ function as(e, t, n) {
  * limitations under the License.
  * =============================================================================
  */
-function di(e, t) {
+function pi(e, t) {
   const n = e.length, s = [];
   for (let r = 0; r < n; r++) {
     const a = n - 1 - r, o = e[a] || 1;
@@ -3177,7 +3189,7 @@ function di(e, t) {
   }
   return s;
 }
-function fi(e, t) {
+function yi(e, t) {
   const n = [];
   for (let s = 0; s < t.length; s++) {
     const r = e[e.length - s - 1], a = t.length - s - 1, o = t[a];
@@ -3221,7 +3233,7 @@ function os(e, t) {
  */
 function is(e) {
   const n = { x: T(e, "x", "zerosLike") };
-  return g.runKernel(sn, n);
+  return f.runKernel(sn, n);
 }
 const C = /* @__PURE__ */ D({ zerosLike_: is });
 /**
@@ -3244,7 +3256,7 @@ function cs(e, t) {
   let n = T(e, "base", "pow"), s = T(t, "exp", "pow");
   [n, s] = K(n, s);
   const r = { a: n, b: s };
-  return g.runKernel(tn, r);
+  return f.runKernel(tn, r);
 }
 const Qt = /* @__PURE__ */ D({ pow_: cs });
 /**
@@ -3288,7 +3300,7 @@ function q(e, t) {
  */
 function ls(e) {
   const n = { x: T(e, "x", "sqrt", "float32") };
-  return g.runKernel(en, n);
+  return f.runKernel(en, n);
 }
 const nt = /* @__PURE__ */ D({ sqrt_: ls });
 /**
@@ -3309,7 +3321,7 @@ const nt = /* @__PURE__ */ D({ sqrt_: ls });
  */
 function us(e) {
   const t = T(e, "x", "square"), n = {};
-  return g.runKernel("Square", { x: t }, n);
+  return f.runKernel("Square", { x: t }, n);
 }
 const V = /* @__PURE__ */ D({ square_: us });
 /**
@@ -3328,12 +3340,12 @@ const V = /* @__PURE__ */ D({ square_: us });
  * limitations under the License.
  * =============================================================================
  */
-function gi(e) {
+function bi(e) {
   return y(dt(e), () => "The f passed in grads(f) must be a function"), (t, n) => {
     y(Array.isArray(t), () => "The args passed in grads(f)(args) must be an array of `Tensor`s or `TensorLike`s");
     const s = Tn(t, "args", "tf.grads", "string_or_numeric"), r = n != null ? T(n, "dy", "tf.grads") : null;
-    return g.tidy(() => {
-      const { value: a, grads: o } = g.gradients(() => e(...s), s, r);
+    return f.tidy(() => {
+      const { value: a, grads: o } = f.gradients(() => e(...s), s, r);
       return r != null && xe(a.shape, r.shape, "The shape of dy passed in grads(f)([x1,...], dy) must match the shape returned by f([x1,...])"), ds(o), o;
     });
   };
@@ -3343,20 +3355,20 @@ function hs(e, t) {
   const n = t != null;
   if (!n) {
     t = [];
-    for (const l in g.registeredVariables)
-      t.push(g.registeredVariables[l]);
+    for (const l in f.registeredVariables)
+      t.push(f.registeredVariables[l]);
   }
   const s = n ? t.filter((l) => !l.trainable) : null, r = t.length;
   t = t.filter((l) => l.trainable), y(t.length > 0, () => `variableGrads() expects at least one of the input variables to be trainable, but none of the ${r} variables is trainable.`);
-  const a = !0, { value: o, grads: i } = g.gradients(e, t, null, a);
+  const a = !0, { value: o, grads: i } = f.gradients(e, t, null, a);
   y(i.some((l) => l != null), () => "Cannot find a connection between any variable and the result of the loss function y=f(x). Please make sure the operations that use variables are inside the function f passed to minimize()."), y(o.rank === 0, () => `The f passed in variableGrads(f) must return a scalar, but it returned a rank-${o.rank} tensor`);
   const c = {};
   return t.forEach((l, u) => {
     i[u] != null && (c[l.name] = i[u]);
   }), s?.forEach((l) => c[l.name] = null), { value: o, grads: c };
 }
-function mi(e) {
-  return g.customGrad(e);
+function wi(e) {
+  return f.customGrad(e);
 }
 function ds(e) {
   if (e.filter((n) => n == null).length > 0)
@@ -3383,7 +3395,7 @@ function fs(e, t) {
   let n = T(e, "a", "sub"), s = T(t, "b", "sub");
   [n, s] = K(n, s);
   const r = { a: n, b: s };
-  return g.runKernel(nn, r);
+  return f.runKernel(nn, r);
 }
 const tt = /* @__PURE__ */ D({ sub_: fs });
 /**
@@ -3406,7 +3418,7 @@ function gs(e, t) {
   let n = T(e, "a", "maximum"), s = T(t, "b", "maximum");
   [n, s] = K(n, s), n.dtype === "bool" && (n = Rt(n, "int32"), s = Rt(s, "int32")), os(n.shape, s.shape);
   const r = { a: n, b: s };
-  return g.runKernel(Ze, r);
+  return f.runKernel(Ze, r);
 }
 const ms = /* @__PURE__ */ D({ maximum_: gs });
 /**
@@ -3596,11 +3608,11 @@ class Ss extends H {
     return "Adadelta";
   }
   constructor(t, n, s = null) {
-    super(), this.learningRate = t, this.rho = n, this.epsilon = s, this.accumulatedGrads = [], this.accumulatedUpdates = [], s == null && (this.epsilon = g.backend.epsilon());
+    super(), this.learningRate = t, this.rho = n, this.epsilon = s, this.accumulatedGrads = [], this.accumulatedUpdates = [], s == null && (this.epsilon = f.backend.epsilon());
   }
   applyGradients(t) {
     (Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t)).forEach((s, r) => {
-      const a = g.registeredVariables[s], o = !1;
+      const a = f.registeredVariables[s], o = !1;
       this.accumulatedGrads[r] == null && (this.accumulatedGrads[r] = {
         originalName: `${s}/accum_grad`,
         variable: E(() => C(a).variable(o))
@@ -3676,7 +3688,7 @@ class ks extends H {
   }
   applyGradients(t) {
     (Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t)).forEach((s, r) => {
-      const a = g.registeredVariables[s];
+      const a = f.registeredVariables[s];
       this.accumulatedGrads[r] == null && (this.accumulatedGrads[r] = {
         originalName: `${s}/accumulator`,
         variable: E(() => as(a.shape, this.initialAccumulatorValue).variable(!1))
@@ -3688,7 +3700,7 @@ class ks extends H {
       E(() => {
         const c = k(i, V(o));
         i.assign(c);
-        const l = k(b($(o, nt(k(c, g.backend.epsilon()))), -this.learningRate), a);
+        const l = k(b($(o, nt(k(c, f.backend.epsilon()))), -this.learningRate), a);
         a.assign(l);
       });
     }), this.incrementIterations();
@@ -3739,14 +3751,14 @@ class Is extends H {
   constructor(t, n, s, r = null) {
     super(), this.learningRate = t, this.beta1 = n, this.beta2 = s, this.epsilon = r, this.accumulatedFirstMoment = [], this.accumulatedSecondMoment = [], E(() => {
       this.accBeta1 = q(n).variable(), this.accBeta2 = q(s).variable();
-    }), r == null && (this.epsilon = g.backend.epsilon());
+    }), r == null && (this.epsilon = f.backend.epsilon());
   }
   applyGradients(t) {
     const n = Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t);
     E(() => {
       const s = tt(1, this.accBeta1), r = tt(1, this.accBeta2);
       n.forEach((a, o) => {
-        const i = g.registeredVariables[a], c = !1;
+        const i = f.registeredVariables[a], c = !1;
         this.accumulatedFirstMoment[o] == null && (this.accumulatedFirstMoment[o] = {
           originalName: `${a}/m`,
           variable: E(() => C(i).variable(c))
@@ -3757,9 +3769,9 @@ class Is extends H {
         const l = Array.isArray(t) ? t[o].tensor : t[a];
         if (l == null)
           return;
-        const u = this.accumulatedFirstMoment[o].variable, h = this.accumulatedSecondMoment[o].variable, d = k(b(u, this.beta1), b(l, 1 - this.beta1)), m = k(b(h, this.beta2), b(V(l), 1 - this.beta2)), p = $(d, s), f = $(m, r);
+        const u = this.accumulatedFirstMoment[o].variable, h = this.accumulatedSecondMoment[o].variable, d = k(b(u, this.beta1), b(l, 1 - this.beta1)), m = k(b(h, this.beta2), b(V(l), 1 - this.beta2)), p = $(d, s), g = $(m, r);
         u.assign(d), h.assign(m);
-        const w = k(b($(p, k(nt(f), this.epsilon)), -this.learningRate), i);
+        const w = k(b($(p, k(nt(g), this.epsilon)), -this.learningRate), i);
         i.assign(w);
       }), this.accBeta1.assign(b(this.accBeta1, this.beta1)), this.accBeta2.assign(b(this.accBeta2, this.beta2));
     }), this.incrementIterations();
@@ -3821,14 +3833,14 @@ class Ts extends H {
   constructor(t, n, s, r = null, a = 0) {
     super(), this.learningRate = t, this.beta1 = n, this.beta2 = s, this.epsilon = r, this.decay = a, this.accumulatedFirstMoment = [], this.accumulatedWeightedInfNorm = [], E(() => {
       this.iteration = q(0).variable(), this.accBeta1 = q(n).variable();
-    }), r == null && (this.epsilon = g.backend.epsilon());
+    }), r == null && (this.epsilon = f.backend.epsilon());
   }
   applyGradients(t) {
     const n = Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t);
     E(() => {
       const s = tt(1, this.accBeta1), r = $(-this.learningRate, k(b(this.iteration, this.decay), 1));
       n.forEach((a, o) => {
-        const i = g.registeredVariables[a], c = !1;
+        const i = f.registeredVariables[a], c = !1;
         this.accumulatedFirstMoment[o] == null && (this.accumulatedFirstMoment[o] = {
           originalName: `${a}/m`,
           variable: C(i).variable(c)
@@ -3839,9 +3851,9 @@ class Ts extends H {
         const l = Array.isArray(t) ? t[o].tensor : t[a];
         if (l == null)
           return;
-        const u = this.accumulatedFirstMoment[o].variable, h = this.accumulatedWeightedInfNorm[o].variable, d = k(b(u, this.beta1), b(l, 1 - this.beta1)), m = b(h, this.beta2), p = rs(l), f = ms(m, p);
-        u.assign(d), h.assign(f);
-        const w = k(b($(r, s), $(d, k(f, this.epsilon))), i);
+        const u = this.accumulatedFirstMoment[o].variable, h = this.accumulatedWeightedInfNorm[o].variable, d = k(b(u, this.beta1), b(l, 1 - this.beta1)), m = b(h, this.beta2), p = rs(l), g = ms(m, p);
+        u.assign(d), h.assign(g);
+        const w = k(b($(r, s), $(d, k(g, this.epsilon))), i);
         i.assign(w);
       }), this.iteration.assign(k(this.iteration, 1)), this.accBeta1.assign(b(this.accBeta1, this.beta1));
     }), this.incrementIterations();
@@ -3898,7 +3910,7 @@ class Be extends H {
       const a = Array.isArray(t) ? t[r].tensor : t[s];
       if (a == null)
         return;
-      const o = g.registeredVariables[s];
+      const o = f.registeredVariables[s];
       E(() => {
         const i = k(b(this.c, a), o);
         o.assign(i);
@@ -3956,7 +3968,7 @@ class Es extends Be {
   }
   applyGradients(t) {
     (Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t)).forEach((s, r) => {
-      const a = g.registeredVariables[s];
+      const a = f.registeredVariables[s];
       this.accumulations[r] == null && (this.accumulations[r] = {
         originalName: `${s}/momentum`,
         variable: E(() => C(a).variable(!1))
@@ -4022,12 +4034,12 @@ class As extends H {
     return "RMSProp";
   }
   constructor(t, n = 0.9, s = 0, r = null, a = !1) {
-    if (super(), this.learningRate = t, this.decay = n, this.momentum = s, this.epsilon = r, this.accumulatedMeanSquares = [], this.accumulatedMoments = [], this.accumulatedMeanGrads = [], this.centered = a, r == null && (this.epsilon = g.backend.epsilon()), t == null)
+    if (super(), this.learningRate = t, this.decay = n, this.momentum = s, this.epsilon = r, this.accumulatedMeanSquares = [], this.accumulatedMoments = [], this.accumulatedMeanGrads = [], this.centered = a, r == null && (this.epsilon = f.backend.epsilon()), t == null)
       throw new Error("learningRate for RMSPropOptimizer must be defined.");
   }
   applyGradients(t) {
     (Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t)).forEach((s, r) => {
-      const a = g.registeredVariables[s], o = !1;
+      const a = f.registeredVariables[s], o = !1;
       this.accumulatedMeanSquares[r] == null && (this.accumulatedMeanSquares[r] = {
         originalName: `${s}/rms`,
         variable: E(() => C(a).variable(o))
@@ -4047,8 +4059,8 @@ class As extends H {
         if (this.centered) {
           const h = this.accumulatedMeanGrads[r].variable, d = k(b(h, this.decay), b(i, 1 - this.decay)), m = $(b(i, this.learningRate), nt(tt(u, k(V(d), this.epsilon)))), p = k(b(l, this.momentum), m);
           c.assign(u), h.assign(d), l.assign(p);
-          const f = tt(a, p);
-          a.assign(f);
+          const g = tt(a, p);
+          a.assign(g);
         } else {
           const h = k(b(c, this.decay), b(V(i), 1 - this.decay)), d = k(b(l, this.momentum), $(b(i, this.learningRate), nt(k(h, this.epsilon))));
           c.assign(h), l.assign(d);
@@ -4140,293 +4152,297 @@ function Bs() {
  */
 Bs();
 export {
-  ne as $,
-  Is as A,
-  K as B,
-  ur as C,
-  Ja as D,
-  g as E,
-  wo as F,
-  Qr as G,
-  Xn as H,
-  Co as I,
-  wr as J,
-  Ha as K,
-  Rt as L,
-  Sa as M,
-  yo as N,
-  In as O,
-  Oa as P,
-  An as Q,
-  qa as R,
-  So as S,
+  Ps as $,
+  bi as A,
+  D as B,
+  T as C,
+  Tn as D,
+  f as E,
+  Ct as F,
+  ta as G,
+  Ge as H,
+  K as I,
+  hr as J,
+  Ya as K,
+  So as L,
+  Xn as M,
+  Po as N,
+  H as O,
+  Ga as P,
+  Sr as Q,
+  Ka as R,
+  ko as S,
   x as T,
-  ei as U,
-  Ps as V,
-  $t as W,
-  ao as X,
-  ta as Y,
-  xe as Z,
-  br as _,
+  ka as U,
+  Xa as V,
+  ho as W,
+  Rt as X,
+  bo as Y,
+  In as Z,
+  An as _,
   b as a,
-  Ka as a$,
-  vr as a0,
-  ho as a1,
-  Ba as a2,
-  rs as a3,
-  nt as a4,
-  V as a5,
-  Ra as a6,
-  k as a7,
-  qr as a8,
-  da as a9,
-  ci as aA,
-  Se as aB,
-  li as aC,
-  ui as aD,
-  Vs as aE,
-  jt as aF,
-  ue as aG,
-  di as aH,
-  Ho as aI,
-  O as aJ,
-  Gs as aK,
-  Ls as aL,
-  $s as aM,
-  ut as aN,
-  uo as aO,
-  dr as aP,
-  co as aQ,
-  Ur as aR,
-  Kr as aS,
-  ea as aT,
-  na as aU,
-  ra as aV,
-  la as aW,
-  ua as aX,
-  xa as aY,
-  ga as aZ,
-  Ma as a_,
-  Os as aa,
-  F as ab,
+  Na as a$,
+  ni as a0,
+  $t as a1,
+  Gs as a2,
+  oo as a3,
+  ea as a4,
+  xe as a5,
+  wr as a6,
+  ne as a7,
+  Br as a8,
+  fo as a9,
+  A as aA,
+  st as aB,
+  di as aC,
+  Se as aD,
+  fi as aE,
+  gi as aF,
+  Us as aG,
+  _s as aH,
+  $s as aI,
+  ut as aJ,
+  Ws as aK,
+  jt as aL,
+  ue as aM,
+  Xo as aN,
+  O as aO,
+  fr as aP,
+  lo as aQ,
+  zr as aR,
+  Ma as aS,
+  rs as aT,
+  V as aU,
+  Hr as aV,
+  na as aW,
+  sa as aX,
+  aa as aY,
+  ua as aZ,
+  ha as a_,
+  pi as aa,
+  xt as ab,
   S as ac,
-  pe as ad,
-  Qo as ae,
-  gt as af,
-  Yr as ag,
-  qn as ah,
-  xt as ai,
-  $ as aj,
-  ie as ak,
-  ca as al,
-  Yo as am,
-  Ua as an,
-  Ne as ao,
-  mo as ap,
-  zr as aq,
-  Xa as ar,
-  eo as as,
-  zo as at,
-  fi as au,
-  Ns as av,
-  Zo as aw,
-  Xe as ax,
-  A as ay,
-  st as az,
-  tt as b,
-  La as b$,
-  so as b0,
-  Go as b1,
-  _o as b2,
-  Fr as b3,
-  Jr as b4,
-  Wo as b5,
-  $a as b6,
-  Pa as b7,
-  Ca as b8,
-  Qa as b9,
-  Re as bA,
-  Ys as bB,
-  Zs as bC,
-  Qs as bD,
-  or as bE,
-  cr as bF,
-  $o as bG,
-  hr as bH,
-  Zr as bI,
-  yr as bJ,
-  Sr as bK,
-  Ir as bL,
-  Tr as bM,
-  Ar as bN,
-  Br as bO,
-  Mr as bP,
-  Dr as bQ,
-  Rr as bR,
-  Nr as bS,
-  Wr as bT,
-  fa as bU,
-  po as bV,
-  ma as bW,
-  ka as bX,
-  Ta as bY,
-  va as bZ,
-  _a as b_,
-  Ya as ba,
-  Lo as bb,
-  Ke as bc,
-  Us as bd,
-  Ks as be,
-  qs as bf,
-  oe as bg,
-  zs as bh,
-  _t as bi,
-  ae as bj,
-  fr as bk,
-  te as bl,
-  pr as bm,
-  jr as bn,
-  Hr as bo,
-  Ye as bp,
-  Ze as bq,
-  Qe as br,
-  Na as bs,
-  za as bt,
-  ro as bu,
-  fn as bv,
-  en as bw,
-  vo as bx,
-  Mo as by,
-  nn as bz,
-  Jo as c,
-  xr as c$,
-  Ga as c0,
-  bo as c1,
-  no as c2,
-  lo as c3,
-  fo as c4,
-  Uo as c5,
-  kr as c6,
-  qo as c7,
-  $r as c8,
-  Cr as c9,
-  oa as cA,
-  ia as cB,
-  ya as cC,
-  wa as cD,
-  ba as cE,
-  Ea as cF,
-  Ia as cG,
-  Da as cH,
-  Fa as cI,
-  tn as cJ,
-  to as cK,
-  Za as cL,
-  go as cM,
-  Bo as cN,
-  No as cO,
-  ms as cP,
-  sn as cQ,
-  ai as cR,
-  ws as cS,
-  bs as cT,
-  G as cU,
-  Oe as cV,
-  H as cW,
-  xs as cX,
-  hi as cY,
-  oi as cZ,
-  ii as c_,
-  jo as ca,
-  Be as cb,
-  Es as cc,
-  As as cd,
-  Ss as ce,
-  Ts as cf,
-  ks as cg,
-  Hs as ch,
-  Xs as ci,
-  Js as cj,
-  tr as ck,
-  er as cl,
-  nr as cm,
-  ar as cn,
-  sr as co,
-  rr as cp,
-  lr as cq,
-  ir as cr,
-  gr as cs,
-  He as ct,
-  Er as cu,
-  Lr as cv,
-  Or as cw,
-  _r as cx,
-  Vr as cy,
-  aa as cz,
+  xa as ad,
+  Kr as ae,
+  fa as af,
+  F as ag,
+  pe as ah,
+  ti as ai,
+  gt as aj,
+  Zr as ak,
+  qn as al,
+  ie as am,
+  la as an,
+  Zo as ao,
+  za as ap,
+  Ne as aq,
+  po as ar,
+  Vr as as,
+  Ja as at,
+  no as au,
+  Vo as av,
+  yi as aw,
+  Ns as ax,
+  Qo as ay,
+  Xe as az,
+  q as b,
+  Ea as b$,
+  ma as b0,
+  Da as b1,
+  Ha as b2,
+  ro as b3,
+  Uo as b4,
+  Oo as b5,
+  Rr as b6,
+  Yr as b7,
+  jo as b8,
+  Ca as b9,
+  Bo as bA,
+  Do as bB,
+  nn as bC,
+  Re as bD,
+  Zs as bE,
+  Qs as bF,
+  tr as bG,
+  ir as bH,
+  lr as bI,
+  Co as bJ,
+  dr as bK,
+  Qr as bL,
+  br as bM,
+  kr as bN,
+  Tr as bO,
+  Er as bP,
+  vr as bQ,
+  Mr as bR,
+  Dr as bS,
+  Fr as bT,
+  xr as bU,
+  $r as bV,
+  jr as bW,
+  ga as bX,
+  yo as bY,
+  pa as bZ,
+  Ia as b_,
+  La as ba,
+  Pa as bb,
+  to as bc,
+  Za as bd,
+  _o as be,
+  Ke as bf,
+  zs as bg,
+  Hs as bh,
+  Ks as bi,
+  oe as bj,
+  Vs as bk,
+  _t as bl,
+  ae as bm,
+  gr as bn,
+  te as bo,
+  yr as bp,
+  qr as bq,
+  Xr as br,
+  Ye as bs,
+  Ze as bt,
+  Qe as bu,
+  $a as bv,
+  Va as bw,
+  ao as bx,
+  fn as by,
+  en as bz,
+  tt as c,
+  mi as c$,
+  Ba as c0,
+  Oa as c1,
+  _a as c2,
+  Ua as c3,
+  wo as c4,
+  so as c5,
+  uo as c6,
+  go as c7,
+  zo as c8,
+  Ir as c9,
+  Gr as cA,
+  Or as cB,
+  Wr as cC,
+  oa as cD,
+  ia as cE,
+  ca as cF,
+  ba as cG,
+  Sa as cH,
+  wa as cI,
+  Aa as cJ,
+  Ta as cK,
+  Fa as cL,
+  Ra as cM,
+  tn as cN,
+  eo as cO,
+  Qa as cP,
+  mo as cQ,
+  Mo as cR,
+  $o as cS,
+  ms as cT,
+  sn as cU,
+  li as cV,
+  ws as cW,
+  bs as cX,
+  G as cY,
+  Oe as cZ,
+  xs as c_,
+  Ko as ca,
+  Cr as cb,
+  Pr as cc,
+  qo as cd,
+  Be as ce,
+  Es as cf,
+  As as cg,
+  Is as ch,
+  Ss as ci,
+  Ts as cj,
+  ks as ck,
+  Xs as cl,
+  Js as cm,
+  Ys as cn,
+  er as co,
+  nr as cp,
+  sr as cq,
+  or as cr,
+  rr as cs,
+  ar as ct,
+  ur as cu,
+  cr as cv,
+  mr as cw,
+  He as cx,
+  Ar as cy,
+  _r as cz,
   M as d,
-  pa as d0,
-  Xr as d1,
-  sa as d2,
-  Do as d3,
-  Po as d4,
-  Oo as d5,
-  de as d6,
-  ts as d7,
-  Fe as d8,
-  Rs as d9,
-  oo as dA,
-  ti as dB,
-  _s as dC,
-  lt as dD,
-  Cs as dE,
-  It as dF,
-  kn as dG,
-  Vo as dH,
-  Nt as da,
-  Ws as db,
-  ri as dc,
-  mr as dd,
-  Pr as de,
-  ct as df,
-  js as dg,
-  Gr as dh,
-  Je as di,
-  yt as dj,
-  Ko as dk,
-  ha as dl,
-  Aa as dm,
-  Va as dn,
-  Wa as dp,
-  ja as dq,
-  io as dr,
-  ko as ds,
-  Io as dt,
-  To as du,
-  Eo as dv,
-  Ao as dw,
-  Fo as dx,
-  Ro as dy,
-  xo as dz,
-  ni as e,
-  as as f,
-  z as g,
-  os as h,
-  y as i,
-  Qt as j,
-  Bn as k,
-  mi as l,
-  si as m,
-  gi as n,
-  D as o,
+  ui as d0,
+  hi as d1,
+  Fe as d2,
+  Rs as d3,
+  js as d4,
+  lt as d5,
+  Cs as d6,
+  Nt as d7,
+  ci as d8,
+  Je as d9,
+  qs as dA,
+  Wa as dB,
+  ja as dC,
+  qa as dD,
+  Io as dE,
+  To as dF,
+  xo as dG,
+  No as dH,
+  ei as dI,
+  Os as dJ,
+  It as dK,
+  kn as dL,
+  yt as da,
+  Ls as db,
+  pr as dc,
+  Nr as dd,
+  Lr as de,
+  Ur as df,
+  Jr as dg,
+  Wo as dh,
+  Ho as di,
+  ra as dj,
+  da as dk,
+  ya as dl,
+  va as dm,
+  co as dn,
+  Eo as dp,
+  Ao as dq,
+  vo as dr,
+  Fo as ds,
+  Ro as dt,
+  io as du,
+  Lo as dv,
+  Go as dw,
+  de as dx,
+  ts as dy,
+  ct as dz,
+  si as e,
+  Jo as f,
+  ii as g,
+  as as h,
+  Yo as i,
+  z as j,
+  os as k,
+  y as l,
+  ri as m,
+  $ as n,
+  k as o,
   $e as p,
-  T as q,
-  Xo as r,
-  q as s,
+  nt as q,
+  oi as r,
+  ai as s,
   E as t,
   fe as u,
   hs as v,
-  Tn as w,
-  Ct as x,
-  Ge as y,
+  Bn as w,
+  Qt as x,
+  wi as y,
   C as z
 };