@genai-fi/nanogpt 0.2.3 → 0.2.4

package/dist/index-xuotMAFm.js

@@ -0,0 +1,118 @@
+function v(e) {
+  return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
+}
+var m = { exports: {} }, t = m.exports = {}, n, o;
+function f() {
+  throw new Error("setTimeout has not been defined");
+}
+function h() {
+  throw new Error("clearTimeout has not been defined");
+}
+(function() {
+  try {
+    typeof setTimeout == "function" ? n = setTimeout : n = f;
+  } catch {
+    n = f;
+  }
+  try {
+    typeof clearTimeout == "function" ? o = clearTimeout : o = h;
+  } catch {
+    o = h;
+  }
+})();
+function p(e) {
+  if (n === setTimeout)
+    return setTimeout(e, 0);
+  if ((n === f || !n) && setTimeout)
+    return n = setTimeout, setTimeout(e, 0);
+  try {
+    return n(e, 0);
+  } catch {
+    try {
+      return n.call(null, e, 0);
+    } catch {
+      return n.call(this, e, 0);
+    }
+  }
+}
+function g(e) {
+  if (o === clearTimeout)
+    return clearTimeout(e);
+  if ((o === h || !o) && clearTimeout)
+    return o = clearTimeout, clearTimeout(e);
+  try {
+    return o(e);
+  } catch {
+    try {
+      return o.call(null, e);
+    } catch {
+      return o.call(this, e);
+    }
+  }
+}
+var u = [], s = !1, a, l = -1;
+function w() {
+  !s || !a || (s = !1, a.length ? u = a.concat(u) : l = -1, u.length && d());
+}
+function d() {
+  if (!s) {
+    var e = p(w);
+    s = !0;
+    for (var r = u.length; r; ) {
+      for (a = u, u = []; ++l < r; )
+        a && a[l].run();
+      l = -1, r = u.length;
+    }
+    a = null, s = !1, g(e);
+  }
+}
+t.nextTick = function(e) {
+  var r = new Array(arguments.length - 1);
+  if (arguments.length > 1)
+    for (var c = 1; c < arguments.length; c++)
+      r[c - 1] = arguments[c];
+  u.push(new T(e, r)), u.length === 1 && !s && p(d);
+};
+function T(e, r) {
+  this.fun = e, this.array = r;
+}
+T.prototype.run = function() {
+  this.fun.apply(null, this.array);
+};
+t.title = "browser";
+t.browser = !0;
+t.env = {};
+t.argv = [];
+t.version = "";
+t.versions = {};
+function i() {
+}
+t.on = i;
+t.addListener = i;
+t.once = i;
+t.off = i;
+t.removeListener = i;
+t.removeAllListeners = i;
+t.emit = i;
+t.prependListener = i;
+t.prependOnceListener = i;
+t.listeners = function(e) {
+  return [];
+};
+t.binding = function(e) {
+  throw new Error("process.binding is not supported");
+};
+t.cwd = function() {
+  return "/";
+};
+t.chdir = function(e) {
+  throw new Error("process.chdir is not supported");
+};
+t.umask = function() {
+  return 0;
+};
+var y = m.exports;
+const b = /* @__PURE__ */ v(y);
+export {
+  b as p
+};

package/dist/{jszip.min-pMIn3RZH.js → jszip.min-CAxN99oA.js}

@@ -1,30 +1,20 @@
-import { c as bt, g as It } from "./_commonjsHelpers-ByX85dGu.js";
-function vt(yt) {
-  throw new Error('Could not dynamically require "' + yt + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
+import { c as vt, g as Ot } from "./_commonjsHelpers-ByX85dGu.js";
+import { B as lt } from "./index-Tf7vU29b.js";
+import { p as Bt } from "./index-xuotMAFm.js";
+function yt(wt) {
+  throw new Error('Could not dynamically require "' + wt + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
 }
-var kt = { exports: {} };
-/*!
-
-JSZip v3.10.1 - A JavaScript class for generating and reading zip files
-<http://stuartk.com/jszip>
-
-(c) 2009-2016 Stuart Knightley <stuart [at] stuartk.com>
-Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip/main/LICENSE.markdown.
-
-JSZip uses the library pako released under the MIT license :
-https://github.com/nodeca/pako/blob/main/LICENSE
-*/
-var zt;
-function Ot() {
-  return zt || (zt = 1, function(yt, Rt) {
+var xt = { exports: {} }, Ct;
+function Rt() {
+  return Ct || (Ct = 1, function(wt, Dt) {
     (function(b) {
-      yt.exports = b();
+      wt.exports = b();
     })(function() {
       return function b(U, k, l) {
         function o(_, y) {
           if (!k[_]) {
             if (!U[_]) {
-              var p = typeof vt == "function" && vt;
+              var p = typeof yt == "function" && yt;
               if (!y && p) return p(_, !0);
               if (n) return n(_, !0);
               var g = new Error("Cannot find module '" + _ + "'");
@@ -38,7 +28,7 @@ function Ot() {
           }
           return k[_].exports;
         }
-        for (var n = typeof vt == "function" && vt, h = 0; h < l.length; h++) o(l[h]);
+        for (var n = typeof yt == "function" && yt, h = 0; h < l.length; h++) o(l[h]);
         return o;
       }({ 1: [function(b, U, k) {
         var l = b("./utils"), o = b("./support"), n = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
@@ -298,16 +288,16 @@ function Ot() {
           this._helper.resume();
         }, U.exports = o;
       }, { "../utils": 32, "readable-stream": 16 }], 14: [function(b, U, k) {
-        U.exports = { isNode: typeof Buffer < "u", newBufferFrom: function(l, o) {
-          if (Buffer.from && Buffer.from !== Uint8Array.from) return Buffer.from(l, o);
+        U.exports = { isNode: typeof lt < "u", newBufferFrom: function(l, o) {
+          if (lt.from && lt.from !== Uint8Array.from) return lt.from(l, o);
           if (typeof l == "number") throw new Error('The "data" argument must not be a number');
-          return new Buffer(l, o);
+          return new lt(l, o);
         }, allocBuffer: function(l) {
-          if (Buffer.alloc) return Buffer.alloc(l);
-          var o = new Buffer(l);
+          if (lt.alloc) return lt.alloc(l);
+          var o = new lt(l);
           return o.fill(0), o;
         }, isBuffer: function(l) {
-          return Buffer.isBuffer(l);
+          return lt.isBuffer(l);
         }, isStream: function(l) {
           return l && typeof l.on == "function" && typeof l.pause == "function" && typeof l.resume == "function";
         } };
@@ -634,7 +624,7 @@ function Ot() {
                       for (q = new Uint8Array(m), I = 0; I < L.length; I++) q.set(L[I], W), W += L[I].length;
                       return q;
                     case "nodebuffer":
-                      return Buffer.concat(L);
+                      return lt.concat(L);
                     default:
                       throw new Error("concat : unsupported type '" + O + "'");
                   }
@@ -681,7 +671,7 @@ function Ot() {
           return new p(this, { objectMode: this._outputType !== "nodebuffer" }, d);
         } }, U.exports = i;
       }, { "../base64": 1, "../external": 6, "../nodejs/NodejsStreamOutputAdapter": 13, "../support": 30, "../utils": 32, "./ConvertWorker": 24, "./GenericWorker": 28 }], 30: [function(b, U, k) {
-        if (k.base64 = !0, k.array = !0, k.string = !0, k.arraybuffer = typeof ArrayBuffer < "u" && typeof Uint8Array < "u", k.nodebuffer = typeof Buffer < "u", k.uint8array = typeof Uint8Array < "u", typeof ArrayBuffer > "u") k.blob = !1;
+        if (k.base64 = !0, k.array = !0, k.string = !0, k.arraybuffer = typeof ArrayBuffer < "u" && typeof Uint8Array < "u", k.nodebuffer = typeof lt < "u", k.uint8array = typeof Uint8Array < "u", typeof ArrayBuffer > "u") k.blob = !1;
         else {
           var l = new ArrayBuffer(0);
           try {
@@ -1073,7 +1063,7 @@ function Ot() {
           U.exports = function(e) {
             i.push(e) !== 1 || n || o();
           };
-        }).call(this, typeof bt < "u" ? bt : typeof self < "u" ? self : typeof window < "u" ? window : {});
+        }).call(this, typeof vt < "u" ? vt : typeof self < "u" ? self : typeof window < "u" ? window : {});
       }, {}], 37: [function(b, U, k) {
         var l = b("immediate");
         function o() {
@@ -1460,7 +1450,7 @@ function Ot() {
           var R;
           return t && t.state ? (t.total_in = t.total_out = 0, t.data_type = a, (R = t.state).pending = 0, R.pending_out = 0, R.wrap < 0 && (R.wrap = -R.wrap), R.status = R.wrap ? m : B, t.adler = R.wrap === 2 ? 0 : 1, R.last_flush = p, n._tr_init(R), i) : $(t, d);
         }
-        function lt(t) {
+        function ft(t) {
           var R = it(t);
           return R === i && function(A) {
             A.window_size = 2 * A.w_size, V(A.head), A.max_lazy_match = l[A.level].max_lazy, A.good_match = l[A.level].good_length, A.nice_match = l[A.level].nice_length, A.max_chain_length = l[A.level].max_chain, A.strstart = 0, A.block_start = 0, A.lookahead = 0, A.insert = 0, A.match_length = A.prev_length = I - 1, A.match_available = 0, A.ins_h = 0;
@@ -1472,7 +1462,7 @@ function Ot() {
           if (R === e && (R = 6), f < 0 ? (F = 0, f = -f) : 15 < f && (F = 2, f -= 16), s < 1 || v < s || A !== c || f < 8 || 15 < f || R < 0 || 9 < R || w < 0 || u < w) return $(t, d);
           f === 8 && (f = 9);
           var N = new st();
-          return (t.state = N).strm = t, N.wrap = F, N.gzhead = null, N.w_bits = f, N.w_size = 1 << N.w_bits, N.w_mask = N.w_size - 1, N.hash_bits = s + 7, N.hash_size = 1 << N.hash_bits, N.hash_mask = N.hash_size - 1, N.hash_shift = ~~((N.hash_bits + I - 1) / I), N.window = new o.Buf8(2 * N.w_size), N.head = new o.Buf16(N.hash_size), N.prev = new o.Buf16(N.w_size), N.lit_bufsize = 1 << s + 6, N.pending_buf_size = 4 * N.lit_bufsize, N.pending_buf = new o.Buf8(N.pending_buf_size), N.d_buf = 1 * N.lit_bufsize, N.l_buf = 3 * N.lit_bufsize, N.level = R, N.strategy = w, N.method = A, lt(t);
+          return (t.state = N).strm = t, N.wrap = F, N.gzhead = null, N.w_bits = f, N.w_size = 1 << N.w_bits, N.w_mask = N.w_size - 1, N.hash_bits = s + 7, N.hash_size = 1 << N.hash_bits, N.hash_mask = N.hash_size - 1, N.hash_shift = ~~((N.hash_bits + I - 1) / I), N.window = new o.Buf8(2 * N.w_size), N.head = new o.Buf16(N.hash_size), N.prev = new o.Buf16(N.w_size), N.lit_bufsize = 1 << s + 6, N.pending_buf_size = 4 * N.lit_bufsize, N.pending_buf = new o.Buf8(N.pending_buf_size), N.d_buf = 1 * N.lit_bufsize, N.l_buf = 3 * N.lit_bufsize, N.level = R, N.strategy = w, N.method = A, ft(t);
         }
         l = [new rt(0, 0, 0, 0, function(t, R) {
           var A = 65535;
@@ -1488,7 +1478,7 @@ function Ot() {
           return t.insert = 0, R === g ? (C(t, !0), t.strm.avail_out === 0 ? J : P) : (t.strstart > t.block_start && (C(t, !1), t.strm.avail_out), r);
         }), new rt(4, 4, 8, 4, ot), new rt(4, 5, 16, 8, ot), new rt(4, 6, 32, 32, ot), new rt(4, 4, 16, 16, Q), new rt(8, 16, 32, 32, Q), new rt(8, 16, 128, 128, Q), new rt(8, 32, 128, 256, Q), new rt(32, 128, 258, 1024, Q), new rt(32, 258, 258, 4096, Q)], k.deflateInit = function(t, R) {
           return ut(t, R, c, 15, 8, 0);
-        }, k.deflateInit2 = ut, k.deflateReset = lt, k.deflateResetKeep = it, k.deflateSetHeader = function(t, R) {
+        }, k.deflateInit2 = ut, k.deflateReset = ft, k.deflateResetKeep = it, k.deflateSetHeader = function(t, R) {
           return t && t.state ? t.state.wrap !== 2 ? d : (t.state.gzhead = R, i) : d;
         }, k.deflate = function(t, R) {
           var A, f, s, w;
@@ -1691,7 +1681,7 @@ function Ot() {
         k.inflateReset = S, k.inflateReset2 = x, k.inflateResetKeep = v, k.inflateInit = function(m) {
           return D(m, 15);
         }, k.inflateInit2 = D, k.inflate = function(m, B) {
-          var r, T, J, P, $, j, V, E, C, X, G, H, nt, ot, Q, rt, st, it, lt, ut, t, R, A, f, s = 0, w = new l.Buf8(4), F = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+          var r, T, J, P, $, j, V, E, C, X, G, H, nt, ot, Q, rt, st, it, ft, ut, t, R, A, f, s = 0, w = new l.Buf8(4), F = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
           if (!m || !m.state || !m.output || !m.input && m.avail_in !== 0) return i;
           (r = m.state).mode === 12 && (r.mode = 13), $ = m.next_out, J = m.output, V = m.avail_out, P = m.next_in, T = m.input, j = m.avail_in, E = r.hold, C = r.bits, X = j, G = V, R = g;
           t: for (; ; ) switch (r.mode) {
@@ -1933,7 +1923,7 @@ function Ot() {
                 j--, E += T[P++] << C, C += 8;
               }
               if (rt && (240 & rt) == 0) {
-                for (it = Q, lt = rt, ut = st; rt = (s = r.lencode[ut + ((E & (1 << it + lt) - 1) >> it)]) >>> 16 & 255, st = 65535 & s, !(it + (Q = s >>> 24) <= C); ) {
+                for (it = Q, ft = rt, ut = st; rt = (s = r.lencode[ut + ((E & (1 << it + ft) - 1) >> it)]) >>> 16 & 255, st = 65535 & s, !(it + (Q = s >>> 24) <= C); ) {
                   if (j === 0) break t;
                   j--, E += T[P++] << C, C += 8;
                 }
@@ -1967,7 +1957,7 @@ function Ot() {
                 j--, E += T[P++] << C, C += 8;
               }
               if ((240 & rt) == 0) {
-                for (it = Q, lt = rt, ut = st; rt = (s = r.distcode[ut + ((E & (1 << it + lt) - 1) >> it)]) >>> 16 & 255, st = 65535 & s, !(it + (Q = s >>> 24) <= C); ) {
+                for (it = Q, ft = rt, ut = st; rt = (s = r.distcode[ut + ((E & (1 << it + ft) - 1) >> it)]) >>> 16 & 255, st = 65535 & s, !(it + (Q = s >>> 24) <= C); ) {
                   if (j === 0) break t;
                   j--, E += T[P++] << C, C += 8;
                 }
@@ -2152,7 +2142,7 @@ function Ot() {
           for (var N = s.heap[F], z = F << 1; z <= s.heap_len && (z < s.heap_len && st(w, s.heap[z + 1], s.heap[z], s.depth) && z++, !st(w, N, s.heap[z], s.depth)); ) s.heap[F] = s.heap[z], F = z, z <<= 1;
           s.heap[F] = N;
         }
-        function lt(s, w, F) {
+        function ft(s, w, F) {
           var N, z, Z, K, M = 0;
           if (s.last_lit !== 0) for (; N = s.pending_buf[s.d_buf + 2 * M] << 8 | s.pending_buf[s.d_buf + 2 * M + 1], z = s.pending_buf[s.l_buf + M], M++, N === 0 ? H(s, z, w) : (H(s, (Z = r[z]) + p + 1, w), (K = O[Z]) !== 0 && G(s, z -= T[Z], K), H(s, Z = C(--N), F), (K = L[Z]) !== 0 && G(s, N -= j[Z], K)), M < s.last_lit; ) ;
           H(s, v, w);
@@ -2164,15 +2154,15 @@ function Ot() {
           for (w.max_code = et, F = s.heap_len >> 1; 1 <= F; F--) it(s, Z, F);
           for (z = Y; F = s.heap[1], s.heap[1] = s.heap[s.heap_len--], it(s, Z, 1), N = s.heap[1], s.heap[--s.heap_max] = F, s.heap[--s.heap_max] = N, Z[2 * z] = Z[2 * F] + Z[2 * N], s.depth[z] = (s.depth[F] >= s.depth[N] ? s.depth[F] : s.depth[N]) + 1, Z[2 * F + 1] = Z[2 * N + 1] = z, s.heap[1] = z++, it(s, Z, 1), 2 <= s.heap_len; ) ;
           s.heap[--s.heap_max] = s.heap[1], function(tt, ht) {
-            var ct, ft, pt, at, _t, wt, dt = ht.dyn_tree, xt = ht.max_code, Ct = ht.stat_desc.static_tree, Et = ht.stat_desc.has_stree, At = ht.stat_desc.extra_bits, St = ht.stat_desc.extra_base, mt = ht.stat_desc.max_length, gt = 0;
+            var pt, dt, mt, at, gt, kt, ct = ht.dyn_tree, St = ht.max_code, Et = ht.stat_desc.static_tree, At = ht.stat_desc.has_stree, It = ht.stat_desc.extra_bits, zt = ht.stat_desc.extra_base, _t = ht.stat_desc.max_length, bt = 0;
             for (at = 0; at <= u; at++) tt.bl_count[at] = 0;
-            for (dt[2 * tt.heap[tt.heap_max] + 1] = 0, ct = tt.heap_max + 1; ct < e; ct++) mt < (at = dt[2 * dt[2 * (ft = tt.heap[ct]) + 1] + 1] + 1) && (at = mt, gt++), dt[2 * ft + 1] = at, xt < ft || (tt.bl_count[at]++, _t = 0, St <= ft && (_t = At[ft - St]), wt = dt[2 * ft], tt.opt_len += wt * (at + _t), Et && (tt.static_len += wt * (Ct[2 * ft + 1] + _t)));
-            if (gt !== 0) {
+            for (ct[2 * tt.heap[tt.heap_max] + 1] = 0, pt = tt.heap_max + 1; pt < e; pt++) _t < (at = ct[2 * ct[2 * (dt = tt.heap[pt]) + 1] + 1] + 1) && (at = _t, bt++), ct[2 * dt + 1] = at, St < dt || (tt.bl_count[at]++, gt = 0, zt <= dt && (gt = It[dt - zt]), kt = ct[2 * dt], tt.opt_len += kt * (at + gt), At && (tt.static_len += kt * (Et[2 * dt + 1] + gt)));
+            if (bt !== 0) {
               do {
-                for (at = mt - 1; tt.bl_count[at] === 0; ) at--;
-                tt.bl_count[at]--, tt.bl_count[at + 1] += 2, tt.bl_count[mt]--, gt -= 2;
-              } while (0 < gt);
-              for (at = mt; at !== 0; at--) for (ft = tt.bl_count[at]; ft !== 0; ) xt < (pt = tt.heap[--ct]) || (dt[2 * pt + 1] !== at && (tt.opt_len += (at - dt[2 * pt + 1]) * dt[2 * pt], dt[2 * pt + 1] = at), ft--);
+                for (at = _t - 1; tt.bl_count[at] === 0; ) at--;
+                tt.bl_count[at]--, tt.bl_count[at + 1] += 2, tt.bl_count[_t]--, bt -= 2;
+              } while (0 < bt);
+              for (at = _t; at !== 0; at--) for (dt = tt.bl_count[at]; dt !== 0; ) St < (mt = tt.heap[--pt]) || (ct[2 * mt + 1] !== at && (tt.opt_len += (at - ct[2 * mt + 1]) * ct[2 * mt], ct[2 * mt + 1] = at), dt--);
             }
           }(s, w), ot(Z, et, s.bl_count);
         }
@@ -2221,11 +2211,11 @@ function Ot() {
             var Y;
             for (t(M, M.dyn_ltree, M.l_desc.max_code), t(M, M.dyn_dtree, M.d_desc.max_code), ut(M, M.bl_desc), Y = d - 1; 3 <= Y && M.bl_tree[2 * W[Y] + 1] === 0; Y--) ;
             return M.opt_len += 3 * (Y + 1) + 5 + 5 + 4, Y;
-          }(s), z = s.opt_len + 3 + 7 >>> 3, (Z = s.static_len + 3 + 7 >>> 3) <= z && (z = Z)) : z = Z = F + 5, F + 4 <= z && w !== -1 ? f(s, w, F, N) : s.strategy === 4 || Z === z ? (G(s, 2 + (N ? 1 : 0), 3), lt(s, q, m)) : (G(s, 4 + (N ? 1 : 0), 3), function(M, Y, et, tt) {
+          }(s), z = s.opt_len + 3 + 7 >>> 3, (Z = s.static_len + 3 + 7 >>> 3) <= z && (z = Z)) : z = Z = F + 5, F + 4 <= z && w !== -1 ? f(s, w, F, N) : s.strategy === 4 || Z === z ? (G(s, 2 + (N ? 1 : 0), 3), ft(s, q, m)) : (G(s, 4 + (N ? 1 : 0), 3), function(M, Y, et, tt) {
             var ht;
             for (G(M, Y - 257, 5), G(M, et - 1, 5), G(M, tt - 4, 4), ht = 0; ht < tt; ht++) G(M, M.bl_tree[2 * W[ht] + 1], 3);
             R(M, M.dyn_ltree, Y - 1), R(M, M.dyn_dtree, et - 1);
-          }(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, K + 1), lt(s, s.dyn_ltree, s.dyn_dtree)), Q(s), N && rt(s);
+          }(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, K + 1), ft(s, s.dyn_ltree, s.dyn_dtree)), Q(s), N && rt(s);
         }, k._tr_tally = function(s, w, F) {
           return s.pending_buf[s.d_buf + 2 * s.last_lit] = w >>> 8 & 255, s.pending_buf[s.d_buf + 2 * s.last_lit + 1] = 255 & w, s.pending_buf[s.l_buf + s.last_lit] = 255 & F, s.last_lit++, w === 0 ? s.dyn_ltree[2 * F]++ : (s.matches++, w--, s.dyn_ltree[2 * (r[F] + p + 1)]++, s.dyn_dtree[2 * C(w)]++), s.last_lit === s.lit_bufsize - 1;
         }, k._tr_align = function(s) {
@@ -2243,7 +2233,7 @@ function Ot() {
             if (!o.setImmediate) {
               var h, _, y, p, g = 1, i = {}, d = !1, e = o.document, u = Object.getPrototypeOf && Object.getPrototypeOf(o);
               u = u && u.setTimeout ? u : o, h = {}.toString.call(o.process) === "[object process]" ? function(S) {
-                process.nextTick(function() {
+                Bt.nextTick(function() {
                   c(S);
                 });
               } : function() {
@@ -2312,13 +2302,13 @@ function Ot() {
               S.source === o && typeof S.data == "string" && S.data.indexOf(p) === 0 && c(+S.data.slice(p.length));
             }
           })(typeof self > "u" ? l === void 0 ? this : l : self);
-        }).call(this, typeof bt < "u" ? bt : typeof self < "u" ? self : typeof window < "u" ? window : {});
+        }).call(this, typeof vt < "u" ? vt : typeof self < "u" ? self : typeof window < "u" ? window : {});
       }, {}] }, {}, [10])(10);
     });
-  }(kt)), kt.exports;
+  }(xt)), xt.exports;
 }
-var Bt = Ot();
-const Dt = /* @__PURE__ */ It(Bt);
+var Tt = Rt();
+const Pt = /* @__PURE__ */ Ot(Tt);
 export {
-  Dt as z
+  Pt as z
 };

package/dist/layers/TiedEmbedding.js

@@ -1,4 +1,4 @@
-import { o as p, c as a, b as V, E as u, C as X, R as Y, d as A, B as Z, S as ee, f as te, g as se, h as ne, I as re, L as ae, N as ue, P as ie, i as oe, j as le, k as ce, l as pe, n as B, t as he, T as L, m as fe, p as me, q as de, r as q, u as P, v as U, _ as H } from "../index-B8nyc6IR.js";
+import { o as p, c as a, b as V, E as u, C as X, R as Y, d as A, B as Z, S as ee, f as te, g as se, h as ne, I as re, L as ae, N as ue, P as ie, i as oe, j as le, k as ce, l as pe, n as B, t as he, T as L, m as fe, p as me, q as de, r as q, u as P, v as U, _ as H } from "../index-DcaSvB38.js";
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.