var Component = (() => { var __create = Object.create; var __defProp = Object.defineProperty; var __getOwnPropDesc = Object.getOwnPropertyDescriptor; var __getOwnPropNames = Object.getOwnPropertyNames; var __getProtoOf = Object.getPrototypeOf; var __hasOwnProp = Object.prototype.hasOwnProperty; var __esm = (fn2, res) => function __init() { return fn2 && (res = (0, fn2[__getOwnPropNames(fn2)[0]])(fn2 = 0)), res; }; var __commonJS = (cb, mod) => function __require() { return mod || (0, cb[__getOwnPropNames(cb)[0]])((mod = { exports: {} }).exports, mod), mod.exports; }; var __export = (target, all) => { for (var name in all) __defProp(target, name, { get: all[name], enumerable: true }); }; var __copyProps = (to, from, except, desc) => { if (from && typeof from === "object" || typeof from === "function") { for (let key of __getOwnPropNames(from)) if (!__hasOwnProp.call(to, key) && key !== except) __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable }); } return to; }; var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps( // If the importer is in node compatibility mode or this is not an ESM // file that has been converted to a CommonJS file using a Babel- // compatible transform (i.e. "__esModule" has not been set), then set // "default" to the CommonJS "module.exports" for node compatibility. isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target, mod )); var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod); // var init_define_process_env = __esm({ ""() { } }); // global-externals:react/jsx-runtime var require_jsx_runtime = __commonJS({ "global-externals:react/jsx-runtime"(exports, module) { init_define_process_env(); module.exports = _jsx_runtime; } }); // global-externals:react var require_react = __commonJS({ "global-externals:react"(exports, module) { init_define_process_env(); module.exports = React; } }); // _mdx_bundler_entry_point-06666160-4fd5-4d29-bb1a-5ccee70e2552.mdx var mdx_bundler_entry_point_06666160_4fd5_4d29_bb1a_5ccee70e2552_exports = {}; __export(mdx_bundler_entry_point_06666160_4fd5_4d29_bb1a_5ccee70e2552_exports, { default: () => MDXContent, frontmatter: () => frontmatter, toc: () => toc }); init_define_process_env(); var import_jsx_runtime2 = __toESM(require_jsx_runtime()); // global-externals:@mdx-js/react init_define_process_env(); var { useMDXComponents } = MdxJsReact; // ../../../components/ModelDetail.tsx init_define_process_env(); var import_react = __toESM(require_react()); // ../../../components/zlib-decoder.js init_define_process_env(); function de(e) { let i = e.length; for (; --i >= 0; ) e[i] = 0; } var Ki = 0; var fi = 1; var Pi = 2; var Xi = 3; var Yi = 258; var wt = 29; var Re = 256; var ve = Re + 1 + wt; var oe = 30; var bt = 19; var oi = 2 * ve + 1; var Q = 15; var Ye = 16; var Gi = 7; var gt = 256; var _i = 16; var hi = 17; var di = 18; var lt = new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0]); var Fe = new Uint8Array([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13]); var ji = new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7]); var si = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]); var Wi = 512; var P = new Array((ve + 2) * 2); de(P); var ge = new Array(oe * 2); de(ge); var ke = new Array(Wi); de(ke); var Ee = new Array(Yi - Xi + 1); de(Ee); var pt = new Array(wt); de(pt); var Me = new Array(oe); de(Me); function Ge(e, i, t, n, r) { this.static_tree = e, this.extra_bits = i, this.extra_base = t, this.elems = n, this.max_length = r, this.has_stree = e && e.length; } var ci; var ui; var wi; function je(e, i) { this.dyn_tree = e, this.max_code = 0, this.stat_desc = i; } var bi = (e) => e < 256 ? ke[e] : ke[256 + (e >>> 7)]; var ye = (e, i) => { e.pending_buf[e.pending++] = i & 255, e.pending_buf[e.pending++] = i >>> 8 & 255; }; var N = (e, i, t) => { e.bi_valid > Ye - t ? (e.bi_buf |= i << e.bi_valid & 65535, ye(e, e.bi_buf), e.bi_buf = i >> Ye - e.bi_valid, e.bi_valid += t - Ye) : (e.bi_buf |= i << e.bi_valid & 65535, e.bi_valid += t); }; var M = (e, i, t) => { N(e, t[i * 2], t[i * 2 + 1]); }; var gi = (e, i) => { let t = 0; do t |= e & 1, e >>>= 1, t <<= 1; while (--i > 0); return t >>> 1; }; var Vi = (e) => { e.bi_valid === 16 ? (ye(e, e.bi_buf), e.bi_buf = 0, e.bi_valid = 0) : e.bi_valid >= 8 && (e.pending_buf[e.pending++] = e.bi_buf & 255, e.bi_buf >>= 8, e.bi_valid -= 8); }; var Ji = (e, i) => { let t = i.dyn_tree, n = i.max_code, r = i.stat_desc.static_tree, a = i.stat_desc.has_stree, o = i.stat_desc.extra_bits, f = i.stat_desc.extra_base, c = i.stat_desc.max_length, l, _, y, s, h, u, T = 0; for (s = 0; s <= Q; s++) e.bl_count[s] = 0; for (t[e.heap[e.heap_max] * 2 + 1] = 0, l = e.heap_max + 1; l < oi; l++) _ = e.heap[l], s = t[t[_ * 2 + 1] * 2 + 1] + 1, s > c && (s = c, T++), t[_ * 2 + 1] = s, !(_ > n) && (e.bl_count[s]++, h = 0, _ >= f && (h = o[_ - f]), u = t[_ * 2], e.opt_len += u * (s + h), a && (e.static_len += u * (r[_ * 2 + 1] + h))); if (T !== 0) { do { for (s = c - 1; e.bl_count[s] === 0; ) s--; e.bl_count[s]--, e.bl_count[s + 1] += 2, e.bl_count[c]--, T -= 2; } while (T > 0); for (s = c; s !== 0; s--) for (_ = e.bl_count[s]; _ !== 0; ) y = e.heap[--l], !(y > n) && (t[y * 2 + 1] !== s && (e.opt_len += (s - t[y * 2 + 1]) * t[y * 2], t[y * 2 + 1] = s), _--); } }; var pi = (e, i, t) => { let n = new Array(Q + 1), r = 0, a, o; for (a = 1; a <= Q; a++) r = r + t[a - 1] << 1, n[a] = r; for (o = 0; o <= i; o++) { let f = e[o * 2 + 1]; f !== 0 && (e[o * 2] = gi(n[f]++, f)); } }; var Qi = () => { let e, i, t, n, r, a = new Array(Q + 1); for (t = 0, n = 0; n < wt - 1; n++) for (pt[n] = t, e = 0; e < 1 << lt[n]; e++) Ee[t++] = n; for (Ee[t - 1] = n, r = 0, n = 0; n < 16; n++) for (Me[n] = r, e = 0; e < 1 << Fe[n]; e++) ke[r++] = n; for (r >>= 7; n < oe; n++) for (Me[n] = r << 7, e = 0; e < 1 << Fe[n] - 7; e++) ke[256 + r++] = n; for (i = 0; i <= Q; i++) a[i] = 0; for (e = 0; e <= 143; ) P[e * 2 + 1] = 8, e++, a[8]++; for (; e <= 255; ) P[e * 2 + 1] = 9, e++, a[9]++; for (; e <= 279; ) P[e * 2 + 1] = 7, e++, a[7]++; for (; e <= 287; ) P[e * 2 + 1] = 8, e++, a[8]++; for (pi(P, ve + 1, a), e = 0; e < oe; e++) ge[e * 2 + 1] = 5, ge[e * 2] = gi(e, 5); ci = new Ge(P, lt, Re + 1, ve, Q), ui = new Ge(ge, Fe, 0, oe, Q), wi = new Ge(new Array(0), ji, 0, bt, Gi); }; var xi = (e) => { let i; for (i = 0; i < ve; i++) e.dyn_ltree[i * 2] = 0; for (i = 0; i < oe; i++) e.dyn_dtree[i * 2] = 0; for (i = 0; i < bt; i++) e.bl_tree[i * 2] = 0; e.dyn_ltree[gt * 2] = 1, e.opt_len = e.static_len = 0, e.sym_next = e.matches = 0; }; var vi = (e) => { e.bi_valid > 8 ? ye(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0; }; var yt = (e, i, t, n) => { let r = i * 2, a = t * 2; return e[r] < e[a] || e[r] === e[a] && n[i] <= n[t]; }; var We = (e, i, t) => { let n = e.heap[t], r = t << 1; for (; r <= e.heap_len && (r < e.heap_len && yt(i, e.heap[r + 1], e.heap[r], e.depth) && r++, !yt(i, n, e.heap[r], e.depth)); ) e.heap[t] = e.heap[r], t = r, r <<= 1; e.heap[t] = n; }; var mt = (e, i, t) => { let n, r, a = 0, o, f; if (e.sym_next !== 0) do n = e.pending_buf[e.sym_buf + a++] & 255, n += (e.pending_buf[e.sym_buf + a++] & 255) << 8, r = e.pending_buf[e.sym_buf + a++], n === 0 ? M(e, r, i) : (o = Ee[r], M(e, o + Re + 1, i), f = lt[o], f !== 0 && (r -= pt[o], N(e, r, f)), n--, o = bi(n), M(e, o, t), f = Fe[o], f !== 0 && (n -= Me[o], N(e, n, f))); while (a < e.sym_next); M(e, gt, i); }; var ft = (e, i) => { let t = i.dyn_tree, n = i.stat_desc.static_tree, r = i.stat_desc.has_stree, a = i.stat_desc.elems, o, f, c = -1, l; for (e.heap_len = 0, e.heap_max = oi, o = 0; o < a; o++) t[o * 2] !== 0 ? (e.heap[++e.heap_len] = c = o, e.depth[o] = 0) : t[o * 2 + 1] = 0; for (; e.heap_len < 2; ) l = e.heap[++e.heap_len] = c < 2 ? ++c : 0, t[l * 2] = 1, e.depth[l] = 0, e.opt_len--, r && (e.static_len -= n[l * 2 + 1]); for (i.max_code = c, o = e.heap_len >> 1; o >= 1; o--) We(e, t, o); l = a; do o = e.heap[1], e.heap[1] = e.heap[e.heap_len--], We(e, t, 1), f = e.heap[1], e.heap[--e.heap_max] = o, e.heap[--e.heap_max] = f, t[l * 2] = t[o * 2] + t[f * 2], e.depth[l] = (e.depth[o] >= e.depth[f] ? e.depth[o] : e.depth[f]) + 1, t[o * 2 + 1] = t[f * 2 + 1] = l, e.heap[1] = l++, We(e, t, 1); while (e.heap_len >= 2); e.heap[--e.heap_max] = e.heap[1], Ji(e, i), pi(t, c, e.bl_count); }; var zt = (e, i, t) => { let n, r = -1, a, o = i[1], f = 0, c = 7, l = 4; for (o === 0 && (c = 138, l = 3), i[(t + 1) * 2 + 1] = 65535, n = 0; n <= t; n++) a = o, o = i[(n + 1) * 2 + 1], !(++f < c && a === o) && (f < l ? e.bl_tree[a * 2] += f : a !== 0 ? (a !== r && e.bl_tree[a * 2]++, e.bl_tree[_i * 2]++) : f <= 10 ? e.bl_tree[hi * 2]++ : e.bl_tree[di * 2]++, f = 0, r = a, o === 0 ? (c = 138, l = 3) : a === o ? (c = 6, l = 3) : (c = 7, l = 4)); }; var St = (e, i, t) => { let n, r = -1, a, o = i[1], f = 0, c = 7, l = 4; for (o === 0 && (c = 138, l = 3), n = 0; n <= t; n++) if (a = o, o = i[(n + 1) * 2 + 1], !(++f < c && a === o)) { if (f < l) do M(e, a, e.bl_tree); while (--f !== 0); else a !== 0 ? (a !== r && (M(e, a, e.bl_tree), f--), M(e, _i, e.bl_tree), N(e, f - 3, 2)) : f <= 10 ? (M(e, hi, e.bl_tree), N(e, f - 3, 3)) : (M(e, di, e.bl_tree), N(e, f - 11, 7)); f = 0, r = a, o === 0 ? (c = 138, l = 3) : a === o ? (c = 6, l = 3) : (c = 7, l = 4); } }; var qi = (e) => { let i; for (zt(e, e.dyn_ltree, e.l_desc.max_code), zt(e, e.dyn_dtree, e.d_desc.max_code), ft(e, e.bl_desc), i = bt - 1; i >= 3 && e.bl_tree[si[i] * 2 + 1] === 0; i--) ; return e.opt_len += 3 * (i + 1) + 5 + 5 + 4, i; }; var en = (e, i, t, n) => { let r; for (N(e, i - 257, 5), N(e, t - 1, 5), N(e, n - 4, 4), r = 0; r < n; r++) N(e, e.bl_tree[si[r] * 2 + 1], 3); St(e, e.dyn_ltree, i - 1), St(e, e.dyn_dtree, t - 1); }; var tn = (e) => { let i = 4093624447, t; for (t = 0; t <= 31; t++, i >>>= 1) if (i & 1 && e.dyn_ltree[t * 2] !== 0) return 0; if (e.dyn_ltree[18] !== 0 || e.dyn_ltree[20] !== 0 || e.dyn_ltree[26] !== 0) return 1; for (t = 32; t < Re; t++) if (e.dyn_ltree[t * 2] !== 0) return 1; return 0; }; var At = false; var nn = (e) => { At || (Qi(), At = true), e.l_desc = new je(e.dyn_ltree, ci), e.d_desc = new je(e.dyn_dtree, ui), e.bl_desc = new je(e.bl_tree, wi), e.bi_buf = 0, e.bi_valid = 0, xi(e); }; var ki = (e, i, t, n) => { N(e, (Ki << 1) + (n ? 1 : 0), 3), vi(e), ye(e, t), ye(e, ~t), t && e.pending_buf.set(e.window.subarray(i, i + t), e.pending), e.pending += t; }; var an = (e) => { N(e, fi << 1, 3), M(e, gt, P), Vi(e); }; var rn = (e, i, t, n) => { let r, a, o = 0; e.level > 0 ? (e.strm.data_type === 2 && (e.strm.data_type = tn(e)), ft(e, e.l_desc), ft(e, e.d_desc), o = qi(e), r = e.opt_len + 3 + 7 >>> 3, a = e.static_len + 3 + 7 >>> 3, a <= r && (r = a)) : r = a = t + 5, t + 4 <= r && i !== -1 ? ki(e, i, t, n) : e.strategy === 4 || a === r ? (N(e, (fi << 1) + (n ? 1 : 0), 3), mt(e, P, ge)) : (N(e, (Pi << 1) + (n ? 1 : 0), 3), en(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, o + 1), mt(e, e.dyn_ltree, e.dyn_dtree)), xi(e), n && vi(e); }; var ln = (e, i, t) => (e.pending_buf[e.sym_buf + e.sym_next++] = i, e.pending_buf[e.sym_buf + e.sym_next++] = i >> 8, e.pending_buf[e.sym_buf + e.sym_next++] = t, i === 0 ? e.dyn_ltree[t * 2]++ : (e.matches++, i--, e.dyn_ltree[(Ee[t] + Re + 1) * 2]++, e.dyn_dtree[bi(i) * 2]++), e.sym_next === e.sym_end); var fn = nn; var on = ki; var _n = rn; var hn = ln; var dn = an; var sn = { _tr_init: fn, _tr_stored_block: on, _tr_flush_block: _n, _tr_tally: hn, _tr_align: dn }; var cn = (e, i, t, n) => { let r = e & 65535 | 0, a = e >>> 16 & 65535 | 0, o = 0; for (; t !== 0; ) { o = t > 2e3 ? 2e3 : t, t -= o; do r = r + i[n++] | 0, a = a + r | 0; while (--o); r %= 65521, a %= 65521; } return r | a << 16 | 0; }; var me = cn; var un = () => { let e, i = []; for (var t = 0; t < 256; t++) { e = t; for (var n = 0; n < 8; n++) e = e & 1 ? 3988292384 ^ e >>> 1 : e >>> 1; i[t] = e; } return i; }; var wn = new Uint32Array(un()); var bn = (e, i, t, n) => { let r = wn, a = n + t; e ^= -1; for (let o = n; o < a; o++) e = e >>> 8 ^ r[(e ^ i[o]) & 255]; return e ^ -1; }; var Z = bn; var te = { 2: "need dictionary", 1: "stream end", 0: "", "-1": "file error", "-2": "stream error", "-3": "data error", "-4": "insufficient memory", "-5": "buffer error", "-6": "incompatible version" }; var ae = { Z_NO_FLUSH: 0, Z_PARTIAL_FLUSH: 1, Z_SYNC_FLUSH: 2, Z_FULL_FLUSH: 3, Z_FINISH: 4, Z_BLOCK: 5, Z_TREES: 6, Z_OK: 0, Z_STREAM_END: 1, Z_NEED_DICT: 2, Z_ERRNO: -1, Z_STREAM_ERROR: -2, Z_DATA_ERROR: -3, Z_MEM_ERROR: -4, Z_BUF_ERROR: -5, Z_NO_COMPRESSION: 0, Z_BEST_SPEED: 1, Z_BEST_COMPRESSION: 9, Z_DEFAULT_COMPRESSION: -1, Z_FILTERED: 1, Z_HUFFMAN_ONLY: 2, Z_RLE: 3, Z_FIXED: 4, Z_DEFAULT_STRATEGY: 0, Z_BINARY: 0, Z_TEXT: 1, Z_UNKNOWN: 2, Z_DEFLATED: 8 }; var { _tr_init: gn, _tr_stored_block: ot, _tr_flush_block: pn, _tr_tally: j, _tr_align: xn } = sn; var { Z_NO_FLUSH: W, Z_PARTIAL_FLUSH: vn, Z_FULL_FLUSH: kn, Z_FINISH: C, Z_BLOCK: Rt, Z_OK: I, Z_STREAM_END: Tt, Z_STREAM_ERROR: H, Z_DATA_ERROR: En, Z_BUF_ERROR: Ve, Z_DEFAULT_COMPRESSION: yn, Z_FILTERED: mn, Z_HUFFMAN_ONLY: Ne, Z_RLE: zn, Z_FIXED: Sn, Z_DEFAULT_STRATEGY: An, Z_UNKNOWN: Rn, Z_DEFLATED: Ke } = ae; var Tn = 9; var Dn = 15; var Zn = 8; var In = 29; var On = 256; var _t = On + 1 + In; var Nn = 30; var Ln = 19; var Un = 2 * _t + 1; var Cn = 15; var v = 3; var G = 258; var B = G + v + 1; var $n = 32; var _e = 42; var xt = 57; var ht = 69; var dt = 73; var st = 91; var ct = 103; var q = 113; var we = 666; var O = 1; var se = 2; var ie = 3; var ce = 4; var Fn = 3; var ee = (e, i) => (e.msg = te[i], i); var Dt = (e) => e * 2 - (e > 4 ? 9 : 0); var Y = (e) => { let i = e.length; for (; --i >= 0; ) e[i] = 0; }; var Mn = (e) => { let i, t, n, r = e.w_size; i = e.hash_size, n = i; do t = e.head[--n], e.head[n] = t >= r ? t - r : 0; while (--i); i = r, n = i; do t = e.prev[--n], e.prev[n] = t >= r ? t - r : 0; while (--i); }; var Hn = (e, i, t) => (i << e.hash_shift ^ t) & e.hash_mask; var V = Hn; var L = (e) => { let i = e.state, t = i.pending; t > e.avail_out && (t = e.avail_out), t !== 0 && (e.output.set(i.pending_buf.subarray(i.pending_out, i.pending_out + t), e.next_out), e.next_out += t, i.pending_out += t, e.total_out += t, e.avail_out -= t, i.pending -= t, i.pending === 0 && (i.pending_out = 0)); }; var U = (e, i) => { pn(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, i), e.block_start = e.strstart, L(e.strm); }; var z = (e, i) => { e.pending_buf[e.pending++] = i; }; var ue = (e, i) => { e.pending_buf[e.pending++] = i >>> 8 & 255, e.pending_buf[e.pending++] = i & 255; }; var ut = (e, i, t, n) => { let r = e.avail_in; return r > n && (r = n), r === 0 ? 0 : (e.avail_in -= r, i.set(e.input.subarray(e.next_in, e.next_in + r), t), e.state.wrap === 1 ? e.adler = me(e.adler, i, r, t) : e.state.wrap === 2 && (e.adler = Z(e.adler, i, r, t)), e.next_in += r, e.total_in += r, r); }; var Ei = (e, i) => { let t = e.max_chain_length, n = e.strstart, r, a, o = e.prev_length, f = e.nice_match, c = e.strstart > e.w_size - B ? e.strstart - (e.w_size - B) : 0, l = e.window, _ = e.w_mask, y = e.prev, s = e.strstart + G, h = l[n + o - 1], u = l[n + o]; e.prev_length >= e.good_match && (t >>= 2), f > e.lookahead && (f = e.lookahead); do if (r = i, !(l[r + o] !== u || l[r + o - 1] !== h || l[r] !== l[n] || l[++r] !== l[n + 1])) { n += 2, r++; do ; while (l[++n] === l[++r] && l[++n] === l[++r] && l[++n] === l[++r] && l[++n] === l[++r] && l[++n] === l[++r] && l[++n] === l[++r] && l[++n] === l[++r] && l[++n] === l[++r] && n < s); if (a = G - (s - n), n = s - G, a > o) { if (e.match_start = i, o = a, a >= f) break; h = l[n + o - 1], u = l[n + o]; } } while ((i = y[i & _]) > c && --t !== 0); return o <= e.lookahead ? o : e.lookahead; }; var he = (e) => { let i = e.w_size, t, n, r; do { if (n = e.window_size - e.lookahead - e.strstart, e.strstart >= i + (i - B) && (e.window.set(e.window.subarray(i, i + i - n), 0), e.match_start -= i, e.strstart -= i, e.block_start -= i, e.insert > e.strstart && (e.insert = e.strstart), Mn(e), n += i), e.strm.avail_in === 0) break; if (t = ut(e.strm, e.window, e.strstart + e.lookahead, n), e.lookahead += t, e.lookahead + e.insert >= v) for (r = e.strstart - e.insert, e.ins_h = e.window[r], e.ins_h = V(e, e.ins_h, e.window[r + 1]); e.insert && (e.ins_h = V(e, e.ins_h, e.window[r + v - 1]), e.prev[r & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = r, r++, e.insert--, !(e.lookahead + e.insert < v)); ) ; } while (e.lookahead < B && e.strm.avail_in !== 0); }; var yi = (e, i) => { let t = e.pending_buf_size - 5 > e.w_size ? e.w_size : e.pending_buf_size - 5, n, r, a, o = 0, f = e.strm.avail_in; do { if (n = 65535, a = e.bi_valid + 42 >> 3, e.strm.avail_out < a || (a = e.strm.avail_out - a, r = e.strstart - e.block_start, n > r + e.strm.avail_in && (n = r + e.strm.avail_in), n > a && (n = a), n < t && (n === 0 && i !== C || i === W || n !== r + e.strm.avail_in))) break; o = i === C && n === r + e.strm.avail_in ? 1 : 0, ot(e, 0, 0, o), e.pending_buf[e.pending - 4] = n, e.pending_buf[e.pending - 3] = n >> 8, e.pending_buf[e.pending - 2] = ~n, e.pending_buf[e.pending - 1] = ~n >> 8, L(e.strm), r && (r > n && (r = n), e.strm.output.set(e.window.subarray(e.block_start, e.block_start + r), e.strm.next_out), e.strm.next_out += r, e.strm.avail_out -= r, e.strm.total_out += r, e.block_start += r, n -= r), n && (ut(e.strm, e.strm.output, e.strm.next_out, n), e.strm.next_out += n, e.strm.avail_out -= n, e.strm.total_out += n); } while (o === 0); return f -= e.strm.avail_in, f && (f >= e.w_size ? (e.matches = 2, e.window.set(e.strm.input.subarray(e.strm.next_in - e.w_size, e.strm.next_in), 0), e.strstart = e.w_size, e.insert = e.strstart) : (e.window_size - e.strstart <= f && (e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, e.insert > e.strstart && (e.insert = e.strstart)), e.window.set(e.strm.input.subarray(e.strm.next_in - f, e.strm.next_in), e.strstart), e.strstart += f, e.insert += f > e.w_size - e.insert ? e.w_size - e.insert : f), e.block_start = e.strstart), e.high_water < e.strstart && (e.high_water = e.strstart), o ? ce : i !== W && i !== C && e.strm.avail_in === 0 && e.strstart === e.block_start ? se : (a = e.window_size - e.strstart, e.strm.avail_in > a && e.block_start >= e.w_size && (e.block_start -= e.w_size, e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, a += e.w_size, e.insert > e.strstart && (e.insert = e.strstart)), a > e.strm.avail_in && (a = e.strm.avail_in), a && (ut(e.strm, e.window, e.strstart, a), e.strstart += a, e.insert += a > e.w_size - e.insert ? e.w_size - e.insert : a), e.high_water < e.strstart && (e.high_water = e.strstart), a = e.bi_valid + 42 >> 3, a = e.pending_buf_size - a > 65535 ? 65535 : e.pending_buf_size - a, t = a > e.w_size ? e.w_size : a, r = e.strstart - e.block_start, (r >= t || (r || i === C) && i !== W && e.strm.avail_in === 0 && r <= a) && (n = r > a ? a : r, o = i === C && e.strm.avail_in === 0 && n === r ? 1 : 0, ot(e, e.block_start, n, o), e.block_start += n, L(e.strm)), o ? ie : O); }; var Je = (e, i) => { let t, n; for (; ; ) { if (e.lookahead < B) { if (he(e), e.lookahead < B && i === W) return O; if (e.lookahead === 0) break; } if (t = 0, e.lookahead >= v && (e.ins_h = V(e, e.ins_h, e.window[e.strstart + v - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), t !== 0 && e.strstart - t <= e.w_size - B && (e.match_length = Ei(e, t)), e.match_length >= v) if (n = j(e, e.strstart - e.match_start, e.match_length - v), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= v) { e.match_length--; do e.strstart++, e.ins_h = V(e, e.ins_h, e.window[e.strstart + v - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart; while (--e.match_length !== 0); e.strstart++; } else e.strstart += e.match_length, e.match_length = 0, e.ins_h = e.window[e.strstart], e.ins_h = V(e, e.ins_h, e.window[e.strstart + 1]); else n = j(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++; if (n && (U(e, false), e.strm.avail_out === 0)) return O; } return e.insert = e.strstart < v - 1 ? e.strstart : v - 1, i === C ? (U(e, true), e.strm.avail_out === 0 ? ie : ce) : e.sym_next && (U(e, false), e.strm.avail_out === 0) ? O : se; }; var le = (e, i) => { let t, n, r; for (; ; ) { if (e.lookahead < B) { if (he(e), e.lookahead < B && i === W) return O; if (e.lookahead === 0) break; } if (t = 0, e.lookahead >= v && (e.ins_h = V(e, e.ins_h, e.window[e.strstart + v - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), e.prev_length = e.match_length, e.prev_match = e.match_start, e.match_length = v - 1, t !== 0 && e.prev_length < e.max_lazy_match && e.strstart - t <= e.w_size - B && (e.match_length = Ei(e, t), e.match_length <= 5 && (e.strategy === mn || e.match_length === v && e.strstart - e.match_start > 4096) && (e.match_length = v - 1)), e.prev_length >= v && e.match_length <= e.prev_length) { r = e.strstart + e.lookahead - v, n = j(e, e.strstart - 1 - e.prev_match, e.prev_length - v), e.lookahead -= e.prev_length - 1, e.prev_length -= 2; do ++e.strstart <= r && (e.ins_h = V(e, e.ins_h, e.window[e.strstart + v - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart); while (--e.prev_length !== 0); if (e.match_available = 0, e.match_length = v - 1, e.strstart++, n && (U(e, false), e.strm.avail_out === 0)) return O; } else if (e.match_available) { if (n = j(e, 0, e.window[e.strstart - 1]), n && U(e, false), e.strstart++, e.lookahead--, e.strm.avail_out === 0) return O; } else e.match_available = 1, e.strstart++, e.lookahead--; } return e.match_available && (n = j(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < v - 1 ? e.strstart : v - 1, i === C ? (U(e, true), e.strm.avail_out === 0 ? ie : ce) : e.sym_next && (U(e, false), e.strm.avail_out === 0) ? O : se; }; var Bn = (e, i) => { let t, n, r, a, o = e.window; for (; ; ) { if (e.lookahead <= G) { if (he(e), e.lookahead <= G && i === W) return O; if (e.lookahead === 0) break; } if (e.match_length = 0, e.lookahead >= v && e.strstart > 0 && (r = e.strstart - 1, n = o[r], n === o[++r] && n === o[++r] && n === o[++r])) { a = e.strstart + G; do ; while (n === o[++r] && n === o[++r] && n === o[++r] && n === o[++r] && n === o[++r] && n === o[++r] && n === o[++r] && n === o[++r] && r < a); e.match_length = G - (a - r), e.match_length > e.lookahead && (e.match_length = e.lookahead); } if (e.match_length >= v ? (t = j(e, 1, e.match_length - v), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (t = j(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), t && (U(e, false), e.strm.avail_out === 0)) return O; } return e.insert = 0, i === C ? (U(e, true), e.strm.avail_out === 0 ? ie : ce) : e.sym_next && (U(e, false), e.strm.avail_out === 0) ? O : se; }; var Kn = (e, i) => { let t; for (; ; ) { if (e.lookahead === 0 && (he(e), e.lookahead === 0)) { if (i === W) return O; break; } if (e.match_length = 0, t = j(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, t && (U(e, false), e.strm.avail_out === 0)) return O; } return e.insert = 0, i === C ? (U(e, true), e.strm.avail_out === 0 ? ie : ce) : e.sym_next && (U(e, false), e.strm.avail_out === 0) ? O : se; }; function F(e, i, t, n, r) { this.good_length = e, this.max_lazy = i, this.nice_length = t, this.max_chain = n, this.func = r; } var be = [new F(0, 0, 0, 0, yi), new F(4, 4, 8, 4, Je), new F(4, 5, 16, 8, Je), new F(4, 6, 32, 32, Je), new F(4, 4, 16, 16, le), new F(8, 16, 32, 32, le), new F(8, 16, 128, 128, le), new F(8, 32, 128, 256, le), new F(32, 128, 258, 1024, le), new F(32, 258, 258, 4096, le)]; var Pn = (e) => { e.window_size = 2 * e.w_size, Y(e.head), e.max_lazy_match = be[e.level].max_lazy, e.good_match = be[e.level].good_length, e.nice_match = be[e.level].nice_length, e.max_chain_length = be[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = v - 1, e.match_available = 0, e.ins_h = 0; }; function Xn() { this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = Ke, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new Uint16Array(Un * 2), this.dyn_dtree = new Uint16Array((2 * Nn + 1) * 2), this.bl_tree = new Uint16Array((2 * Ln + 1) * 2), Y(this.dyn_ltree), Y(this.dyn_dtree), Y(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(Cn + 1), this.heap = new Uint16Array(2 * _t + 1), Y(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * _t + 1), Y(this.depth), this.sym_buf = 0, this.lit_bufsize = 0, this.sym_next = 0, this.sym_end = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0; } var Te = (e) => { if (!e) return 1; let i = e.state; return !i || i.strm !== e || i.status !== _e && i.status !== xt && i.status !== ht && i.status !== dt && i.status !== st && i.status !== ct && i.status !== q && i.status !== we ? 1 : 0; }; var mi = (e) => { if (Te(e)) return ee(e, H); e.total_in = e.total_out = 0, e.data_type = Rn; let i = e.state; return i.pending = 0, i.pending_out = 0, i.wrap < 0 && (i.wrap = -i.wrap), i.status = i.wrap === 2 ? xt : i.wrap ? _e : q, e.adler = i.wrap === 2 ? 0 : 1, i.last_flush = -2, gn(i), I; }; var zi = (e) => { let i = mi(e); return i === I && Pn(e.state), i; }; var Yn = (e, i) => Te(e) || e.state.wrap !== 2 ? H : (e.state.gzhead = i, I); var Si = (e, i, t, n, r, a) => { if (!e) return H; let o = 1; if (i === yn && (i = 6), n < 0 ? (o = 0, n = -n) : n > 15 && (o = 2, n -= 16), r < 1 || r > Tn || t !== Ke || n < 8 || n > 15 || i < 0 || i > 9 || a < 0 || a > Sn || n === 8 && o !== 1) return ee(e, H); n === 8 && (n = 9); let f = new Xn(); return e.state = f, f.strm = e, f.status = _e, f.wrap = o, f.gzhead = null, f.w_bits = n, f.w_size = 1 << f.w_bits, f.w_mask = f.w_size - 1, f.hash_bits = r + 7, f.hash_size = 1 << f.hash_bits, f.hash_mask = f.hash_size - 1, f.hash_shift = ~~((f.hash_bits + v - 1) / v), f.window = new Uint8Array(f.w_size * 2), f.head = new Uint16Array(f.hash_size), f.prev = new Uint16Array(f.w_size), f.lit_bufsize = 1 << r + 6, f.pending_buf_size = f.lit_bufsize * 4, f.pending_buf = new Uint8Array(f.pending_buf_size), f.sym_buf = f.lit_bufsize, f.sym_end = (f.lit_bufsize - 1) * 3, f.level = i, f.strategy = a, f.method = t, zi(e); }; var Gn = (e, i) => Si(e, i, Ke, Dn, Zn, An); var jn = (e, i) => { if (Te(e) || i > Rt || i < 0) return e ? ee(e, H) : H; let t = e.state; if (!e.output || e.avail_in !== 0 && !e.input || t.status === we && i !== C) return ee(e, e.avail_out === 0 ? Ve : H); let n = t.last_flush; if (t.last_flush = i, t.pending !== 0) { if (L(e), e.avail_out === 0) return t.last_flush = -1, I; } else if (e.avail_in === 0 && Dt(i) <= Dt(n) && i !== C) return ee(e, Ve); if (t.status === we && e.avail_in !== 0) return ee(e, Ve); if (t.status === _e && t.wrap === 0 && (t.status = q), t.status === _e) { let r = Ke + (t.w_bits - 8 << 4) << 8, a = -1; if (t.strategy >= Ne || t.level < 2 ? a = 0 : t.level < 6 ? a = 1 : t.level === 6 ? a = 2 : a = 3, r |= a << 6, t.strstart !== 0 && (r |= $n), r += 31 - r % 31, ue(t, r), t.strstart !== 0 && (ue(t, e.adler >>> 16), ue(t, e.adler & 65535)), e.adler = 1, t.status = q, L(e), t.pending !== 0) return t.last_flush = -1, I; } if (t.status === xt) { if (e.adler = 0, z(t, 31), z(t, 139), z(t, 8), t.gzhead) z(t, (t.gzhead.text ? 1 : 0) + (t.gzhead.hcrc ? 2 : 0) + (t.gzhead.extra ? 4 : 0) + (t.gzhead.name ? 8 : 0) + (t.gzhead.comment ? 16 : 0)), z(t, t.gzhead.time & 255), z(t, t.gzhead.time >> 8 & 255), z(t, t.gzhead.time >> 16 & 255), z(t, t.gzhead.time >> 24 & 255), z(t, t.level === 9 ? 2 : t.strategy >= Ne || t.level < 2 ? 4 : 0), z(t, t.gzhead.os & 255), t.gzhead.extra && t.gzhead.extra.length && (z(t, t.gzhead.extra.length & 255), z(t, t.gzhead.extra.length >> 8 & 255)), t.gzhead.hcrc && (e.adler = Z(e.adler, t.pending_buf, t.pending, 0)), t.gzindex = 0, t.status = ht; else if (z(t, 0), z(t, 0), z(t, 0), z(t, 0), z(t, 0), z(t, t.level === 9 ? 2 : t.strategy >= Ne || t.level < 2 ? 4 : 0), z(t, Fn), t.status = q, L(e), t.pending !== 0) return t.last_flush = -1, I; } if (t.status === ht) { if (t.gzhead.extra) { let r = t.pending, a = (t.gzhead.extra.length & 65535) - t.gzindex; for (; t.pending + a > t.pending_buf_size; ) { let f = t.pending_buf_size - t.pending; if (t.pending_buf.set(t.gzhead.extra.subarray(t.gzindex, t.gzindex + f), t.pending), t.pending = t.pending_buf_size, t.gzhead.hcrc && t.pending > r && (e.adler = Z(e.adler, t.pending_buf, t.pending - r, r)), t.gzindex += f, L(e), t.pending !== 0) return t.last_flush = -1, I; r = 0, a -= f; } let o = new Uint8Array(t.gzhead.extra); t.pending_buf.set(o.subarray(t.gzindex, t.gzindex + a), t.pending), t.pending += a, t.gzhead.hcrc && t.pending > r && (e.adler = Z(e.adler, t.pending_buf, t.pending - r, r)), t.gzindex = 0; } t.status = dt; } if (t.status === dt) { if (t.gzhead.name) { let r = t.pending, a; do { if (t.pending === t.pending_buf_size) { if (t.gzhead.hcrc && t.pending > r && (e.adler = Z(e.adler, t.pending_buf, t.pending - r, r)), L(e), t.pending !== 0) return t.last_flush = -1, I; r = 0; } t.gzindex < t.gzhead.name.length ? a = t.gzhead.name.charCodeAt(t.gzindex++) & 255 : a = 0, z(t, a); } while (a !== 0); t.gzhead.hcrc && t.pending > r && (e.adler = Z(e.adler, t.pending_buf, t.pending - r, r)), t.gzindex = 0; } t.status = st; } if (t.status === st) { if (t.gzhead.comment) { let r = t.pending, a; do { if (t.pending === t.pending_buf_size) { if (t.gzhead.hcrc && t.pending > r && (e.adler = Z(e.adler, t.pending_buf, t.pending - r, r)), L(e), t.pending !== 0) return t.last_flush = -1, I; r = 0; } t.gzindex < t.gzhead.comment.length ? a = t.gzhead.comment.charCodeAt(t.gzindex++) & 255 : a = 0, z(t, a); } while (a !== 0); t.gzhead.hcrc && t.pending > r && (e.adler = Z(e.adler, t.pending_buf, t.pending - r, r)); } t.status = ct; } if (t.status === ct) { if (t.gzhead.hcrc) { if (t.pending + 2 > t.pending_buf_size && (L(e), t.pending !== 0)) return t.last_flush = -1, I; z(t, e.adler & 255), z(t, e.adler >> 8 & 255), e.adler = 0; } if (t.status = q, L(e), t.pending !== 0) return t.last_flush = -1, I; } if (e.avail_in !== 0 || t.lookahead !== 0 || i !== W && t.status !== we) { let r = t.level === 0 ? yi(t, i) : t.strategy === Ne ? Kn(t, i) : t.strategy === zn ? Bn(t, i) : be[t.level].func(t, i); if ((r === ie || r === ce) && (t.status = we), r === O || r === ie) return e.avail_out === 0 && (t.last_flush = -1), I; if (r === se && (i === vn ? xn(t) : i !== Rt && (ot(t, 0, 0, false), i === kn && (Y(t.head), t.lookahead === 0 && (t.strstart = 0, t.block_start = 0, t.insert = 0))), L(e), e.avail_out === 0)) return t.last_flush = -1, I; } return i !== C ? I : t.wrap <= 0 ? Tt : (t.wrap === 2 ? (z(t, e.adler & 255), z(t, e.adler >> 8 & 255), z(t, e.adler >> 16 & 255), z(t, e.adler >> 24 & 255), z(t, e.total_in & 255), z(t, e.total_in >> 8 & 255), z(t, e.total_in >> 16 & 255), z(t, e.total_in >> 24 & 255)) : (ue(t, e.adler >>> 16), ue(t, e.adler & 65535)), L(e), t.wrap > 0 && (t.wrap = -t.wrap), t.pending !== 0 ? I : Tt); }; var Wn = (e) => { if (Te(e)) return H; let i = e.state.status; return e.state = null, i === q ? ee(e, En) : I; }; var Vn = (e, i) => { let t = i.length; if (Te(e)) return H; let n = e.state, r = n.wrap; if (r === 2 || r === 1 && n.status !== _e || n.lookahead) return H; if (r === 1 && (e.adler = me(e.adler, i, t, 0)), n.wrap = 0, t >= n.w_size) { r === 0 && (Y(n.head), n.strstart = 0, n.block_start = 0, n.insert = 0); let c = new Uint8Array(n.w_size); c.set(i.subarray(t - n.w_size, t), 0), i = c, t = n.w_size; } let a = e.avail_in, o = e.next_in, f = e.input; for (e.avail_in = t, e.next_in = 0, e.input = i, he(n); n.lookahead >= v; ) { let c = n.strstart, l = n.lookahead - (v - 1); do n.ins_h = V(n, n.ins_h, n.window[c + v - 1]), n.prev[c & n.w_mask] = n.head[n.ins_h], n.head[n.ins_h] = c, c++; while (--l); n.strstart = c, n.lookahead = v - 1, he(n); } return n.strstart += n.lookahead, n.block_start = n.strstart, n.insert = n.lookahead, n.lookahead = 0, n.match_length = n.prev_length = v - 1, n.match_available = 0, e.next_in = o, e.input = f, e.avail_in = a, n.wrap = r, I; }; var Jn = Gn; var Qn = Si; var qn = zi; var ea = mi; var ta = Yn; var ia = jn; var na = Wn; var aa = Vn; var ra = "pako deflate (from Nodeca project)"; var pe = { deflateInit: Jn, deflateInit2: Qn, deflateReset: qn, deflateResetKeep: ea, deflateSetHeader: ta, deflate: ia, deflateEnd: na, deflateSetDictionary: aa, deflateInfo: ra }; var la = (e, i) => Object.prototype.hasOwnProperty.call(e, i); var fa = function(e) { let i = Array.prototype.slice.call(arguments, 1); for (; i.length; ) { let t = i.shift(); if (t) { if (typeof t != "object") throw new TypeError(t + "must be non-object"); for (let n in t) la(t, n) && (e[n] = t[n]); } } return e; }; var oa = (e) => { let i = 0; for (let n = 0, r = e.length; n < r; n++) i += e[n].length; let t = new Uint8Array(i); for (let n = 0, r = 0, a = e.length; n < a; n++) { let o = e[n]; t.set(o, r), r += o.length; } return t; }; var Pe = { assign: fa, flattenChunks: oa }; var Ai = true; try { String.fromCharCode.apply(null, new Uint8Array(1)); } catch { Ai = false; } var ze = new Uint8Array(256); for (let e = 0; e < 256; e++) ze[e] = e >= 252 ? 6 : e >= 248 ? 5 : e >= 240 ? 4 : e >= 224 ? 3 : e >= 192 ? 2 : 1; ze[254] = ze[254] = 1; var _a = (e) => { if (typeof TextEncoder == "function" && TextEncoder.prototype.encode) return new TextEncoder().encode(e); let i, t, n, r, a, o = e.length, f = 0; for (r = 0; r < o; r++) t = e.charCodeAt(r), (t & 64512) === 55296 && r + 1 < o && (n = e.charCodeAt(r + 1), (n & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (n - 56320), r++)), f += t < 128 ? 1 : t < 2048 ? 2 : t < 65536 ? 3 : 4; for (i = new Uint8Array(f), a = 0, r = 0; a < f; r++) t = e.charCodeAt(r), (t & 64512) === 55296 && r + 1 < o && (n = e.charCodeAt(r + 1), (n & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (n - 56320), r++)), t < 128 ? i[a++] = t : t < 2048 ? (i[a++] = 192 | t >>> 6, i[a++] = 128 | t & 63) : t < 65536 ? (i[a++] = 224 | t >>> 12, i[a++] = 128 | t >>> 6 & 63, i[a++] = 128 | t & 63) : (i[a++] = 240 | t >>> 18, i[a++] = 128 | t >>> 12 & 63, i[a++] = 128 | t >>> 6 & 63, i[a++] = 128 | t & 63); return i; }; var ha = (e, i) => { if (i < 65534 && e.subarray && Ai) return String.fromCharCode.apply(null, e.length === i ? e : e.subarray(0, i)); let t = ""; for (let n = 0; n < i; n++) t += String.fromCharCode(e[n]); return t; }; var da = (e, i) => { let t = i || e.length; if (typeof TextDecoder == "function" && TextDecoder.prototype.decode) return new TextDecoder().decode(e.subarray(0, i)); let n, r, a = new Array(t * 2); for (r = 0, n = 0; n < t; ) { let o = e[n++]; if (o < 128) { a[r++] = o; continue; } let f = ze[o]; if (f > 4) { a[r++] = 65533, n += f - 1; continue; } for (o &= f === 2 ? 31 : f === 3 ? 15 : 7; f > 1 && n < t; ) o = o << 6 | e[n++] & 63, f--; if (f > 1) { a[r++] = 65533; continue; } o < 65536 ? a[r++] = o : (o -= 65536, a[r++] = 55296 | o >> 10 & 1023, a[r++] = 56320 | o & 1023); } return ha(a, r); }; var sa = (e, i) => { i = i || e.length, i > e.length && (i = e.length); let t = i - 1; for (; t >= 0 && (e[t] & 192) === 128; ) t--; return t < 0 || t === 0 ? i : t + ze[e[t]] > i ? t : i; }; var Se = { string2buf: _a, buf2string: da, utf8border: sa }; function ca() { this.input = null, this.next_in = 0, this.avail_in = 0, this.total_in = 0, this.output = null, this.next_out = 0, this.avail_out = 0, this.total_out = 0, this.msg = "", this.state = null, this.data_type = 2, this.adler = 0; } var Ri = ca; var Ti = Object.prototype.toString; var { Z_NO_FLUSH: ua, Z_SYNC_FLUSH: wa, Z_FULL_FLUSH: ba, Z_FINISH: ga, Z_OK: He, Z_STREAM_END: pa, Z_DEFAULT_COMPRESSION: xa, Z_DEFAULT_STRATEGY: va, Z_DEFLATED: ka } = ae; function De(e) { this.options = Pe.assign({ level: xa, method: ka, chunkSize: 16384, windowBits: 15, memLevel: 8, strategy: va }, e || {}); let i = this.options; i.raw && i.windowBits > 0 ? i.windowBits = -i.windowBits : i.gzip && i.windowBits > 0 && i.windowBits < 16 && (i.windowBits += 16), this.err = 0, this.msg = "", this.ended = false, this.chunks = [], this.strm = new Ri(), this.strm.avail_out = 0; let t = pe.deflateInit2(this.strm, i.level, i.method, i.windowBits, i.memLevel, i.strategy); if (t !== He) throw new Error(te[t]); if (i.header && pe.deflateSetHeader(this.strm, i.header), i.dictionary) { let n; if (typeof i.dictionary == "string" ? n = Se.string2buf(i.dictionary) : Ti.call(i.dictionary) === "[object ArrayBuffer]" ? n = new Uint8Array(i.dictionary) : n = i.dictionary, t = pe.deflateSetDictionary(this.strm, n), t !== He) throw new Error(te[t]); this._dict_set = true; } } De.prototype.push = function(e, i) { let t = this.strm, n = this.options.chunkSize, r, a; if (this.ended) return false; for (i === ~~i ? a = i : a = i === true ? ga : ua, typeof e == "string" ? t.input = Se.string2buf(e) : Ti.call(e) === "[object ArrayBuffer]" ? t.input = new Uint8Array(e) : t.input = e, t.next_in = 0, t.avail_in = t.input.length; ; ) { if (t.avail_out === 0 && (t.output = new Uint8Array(n), t.next_out = 0, t.avail_out = n), (a === wa || a === ba) && t.avail_out <= 6) { this.onData(t.output.subarray(0, t.next_out)), t.avail_out = 0; continue; } if (r = pe.deflate(t, a), r === pa) return t.next_out > 0 && this.onData(t.output.subarray(0, t.next_out)), r = pe.deflateEnd(this.strm), this.onEnd(r), this.ended = true, r === He; if (t.avail_out === 0) { this.onData(t.output); continue; } if (a > 0 && t.next_out > 0) { this.onData(t.output.subarray(0, t.next_out)), t.avail_out = 0; continue; } if (t.avail_in === 0) break; } return true; }; De.prototype.onData = function(e) { this.chunks.push(e); }; De.prototype.onEnd = function(e) { e === He && (this.result = Pe.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg; }; function vt(e, i) { let t = new De(i); if (t.push(e, true), t.err) throw t.msg || te[t.err]; return t.result; } function Ea(e, i) { return i = i || {}, i.raw = true, vt(e, i); } function ya(e, i) { return i = i || {}, i.gzip = true, vt(e, i); } var ma = De; var za = vt; var Sa = Ea; var Aa = ya; var Ra = ae; var Ta = { Deflate: ma, deflate: za, deflateRaw: Sa, gzip: Aa, constants: Ra }; var Le = 16209; var Da = 16191; var Za = function(i, t) { let n, r, a, o, f, c, l, _, y, s, h, u, T, k, g, S, p, d, m, D, w, A, E, b, x = i.state; n = i.next_in, E = i.input, r = n + (i.avail_in - 5), a = i.next_out, b = i.output, o = a - (t - i.avail_out), f = a + (i.avail_out - 257), c = x.dmax, l = x.wsize, _ = x.whave, y = x.wnext, s = x.window, h = x.hold, u = x.bits, T = x.lencode, k = x.distcode, g = (1 << x.lenbits) - 1, S = (1 << x.distbits) - 1; e: do { u < 15 && (h += E[n++] << u, u += 8, h += E[n++] << u, u += 8), p = T[h & g]; t: for (; ; ) { if (d = p >>> 24, h >>>= d, u -= d, d = p >>> 16 & 255, d === 0) b[a++] = p & 65535; else if (d & 16) { m = p & 65535, d &= 15, d && (u < d && (h += E[n++] << u, u += 8), m += h & (1 << d) - 1, h >>>= d, u -= d), u < 15 && (h += E[n++] << u, u += 8, h += E[n++] << u, u += 8), p = k[h & S]; i: for (; ; ) { if (d = p >>> 24, h >>>= d, u -= d, d = p >>> 16 & 255, d & 16) { if (D = p & 65535, d &= 15, u < d && (h += E[n++] << u, u += 8, u < d && (h += E[n++] << u, u += 8)), D += h & (1 << d) - 1, D > c) { i.msg = "invalid distance too far back", x.mode = Le; break e; } if (h >>>= d, u -= d, d = a - o, D > d) { if (d = D - d, d > _ && x.sane) { i.msg = "invalid distance too far back", x.mode = Le; break e; } if (w = 0, A = s, y === 0) { if (w += l - d, d < m) { m -= d; do b[a++] = s[w++]; while (--d); w = a - D, A = b; } } else if (y < d) { if (w += l + y - d, d -= y, d < m) { m -= d; do b[a++] = s[w++]; while (--d); if (w = 0, y < m) { d = y, m -= d; do b[a++] = s[w++]; while (--d); w = a - D, A = b; } } } else if (w += y - d, d < m) { m -= d; do b[a++] = s[w++]; while (--d); w = a - D, A = b; } for (; m > 2; ) b[a++] = A[w++], b[a++] = A[w++], b[a++] = A[w++], m -= 3; m && (b[a++] = A[w++], m > 1 && (b[a++] = A[w++])); } else { w = a - D; do b[a++] = b[w++], b[a++] = b[w++], b[a++] = b[w++], m -= 3; while (m > 2); m && (b[a++] = b[w++], m > 1 && (b[a++] = b[w++])); } } else if ((d & 64) === 0) { p = k[(p & 65535) + (h & (1 << d) - 1)]; continue i; } else { i.msg = "invalid distance code", x.mode = Le; break e; } break; } } else if ((d & 64) === 0) { p = T[(p & 65535) + (h & (1 << d) - 1)]; continue t; } else if (d & 32) { x.mode = Da; break e; } else { i.msg = "invalid literal/length code", x.mode = Le; break e; } break; } } while (n < r && a < f); m = u >> 3, n -= m, u -= m << 3, h &= (1 << u) - 1, i.next_in = n, i.next_out = a, i.avail_in = n < r ? 5 + (r - n) : 5 - (n - r), i.avail_out = a < f ? 257 + (f - a) : 257 - (a - f), x.hold = h, x.bits = u; }; var fe = 15; var Zt = 852; var It = 592; var Ot = 0; var Qe = 1; var Nt = 2; var Ia = new Uint16Array([3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0]); var Oa = new Uint8Array([16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78]); var Na = new Uint16Array([1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577, 0, 0]); var La = new Uint8Array([16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 64, 64]); var Ua = (e, i, t, n, r, a, o, f) => { let c = f.bits, l = 0, _ = 0, y = 0, s = 0, h = 0, u = 0, T = 0, k = 0, g = 0, S = 0, p, d, m, D, w, A = null, E, b = new Uint16Array(fe + 1), x = new Uint16Array(fe + 1), J = null, Et, Ie, Oe; for (l = 0; l <= fe; l++) b[l] = 0; for (_ = 0; _ < n; _++) b[i[t + _]]++; for (h = c, s = fe; s >= 1 && b[s] === 0; s--) ; if (h > s && (h = s), s === 0) return r[a++] = 1 << 24 | 64 << 16 | 0, r[a++] = 1 << 24 | 64 << 16 | 0, f.bits = 1, 0; for (y = 1; y < s && b[y] === 0; y++) ; for (h < y && (h = y), k = 1, l = 1; l <= fe; l++) if (k <<= 1, k -= b[l], k < 0) return -1; if (k > 0 && (e === Ot || s !== 1)) return -1; for (x[1] = 0, l = 1; l < fe; l++) x[l + 1] = x[l] + b[l]; for (_ = 0; _ < n; _++) i[t + _] !== 0 && (o[x[i[t + _]]++] = _); if (e === Ot ? (A = J = o, E = 20) : e === Qe ? (A = Ia, J = Oa, E = 257) : (A = Na, J = La, E = 0), S = 0, _ = 0, l = y, w = a, u = h, T = 0, m = -1, g = 1 << h, D = g - 1, e === Qe && g > Zt || e === Nt && g > It) return 1; for (; ; ) { Et = l - T, o[_] + 1 < E ? (Ie = 0, Oe = o[_]) : o[_] >= E ? (Ie = J[o[_] - E], Oe = A[o[_] - E]) : (Ie = 96, Oe = 0), p = 1 << l - T, d = 1 << u, y = d; do d -= p, r[w + (S >> T) + d] = Et << 24 | Ie << 16 | Oe | 0; while (d !== 0); for (p = 1 << l - 1; S & p; ) p >>= 1; if (p !== 0 ? (S &= p - 1, S += p) : S = 0, _++, --b[l] === 0) { if (l === s) break; l = i[t + o[_]]; } if (l > h && (S & D) !== m) { for (T === 0 && (T = h), w += y, u = l - T, k = 1 << u; u + T < s && (k -= b[u + T], !(k <= 0)); ) u++, k <<= 1; if (g += 1 << u, e === Qe && g > Zt || e === Nt && g > It) return 1; m = S & D, r[m] = h << 24 | u << 16 | w - a | 0; } } return S !== 0 && (r[w + S] = l - T << 24 | 64 << 16 | 0), f.bits = h, 0; }; var xe = Ua; var Ca = 0; var Di = 1; var Zi = 2; var { Z_FINISH: Lt, Z_BLOCK: $a, Z_TREES: Ue, Z_OK: ne, Z_STREAM_END: Fa, Z_NEED_DICT: Ma, Z_STREAM_ERROR: $, Z_DATA_ERROR: Ii, Z_MEM_ERROR: Oi, Z_BUF_ERROR: Ha, Z_DEFLATED: Ut } = ae; var Xe = 16180; var Ct = 16181; var $t = 16182; var Ft = 16183; var Mt = 16184; var Ht = 16185; var Bt = 16186; var Kt = 16187; var Pt = 16188; var Xt = 16189; var Be = 16190; var K = 16191; var qe = 16192; var Yt = 16193; var et = 16194; var Gt = 16195; var jt = 16196; var Wt = 16197; var Vt = 16198; var Ce = 16199; var $e = 16200; var Jt = 16201; var Qt = 16202; var qt = 16203; var ei = 16204; var ti = 16205; var tt = 16206; var ii = 16207; var ni = 16208; var R = 16209; var Ni = 16210; var Li = 16211; var Ba = 852; var Ka = 592; var Pa = 15; var Xa = Pa; var ai = (e) => (e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24); function Ya() { this.strm = null, this.mode = 0, this.last = false, this.wrap = 0, this.havedict = false, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new Uint16Array(320), this.work = new Uint16Array(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0; } var re = (e) => { if (!e) return 1; let i = e.state; return !i || i.strm !== e || i.mode < Xe || i.mode > Li ? 1 : 0; }; var Ui = (e) => { if (re(e)) return $; let i = e.state; return e.total_in = e.total_out = i.total = 0, e.msg = "", i.wrap && (e.adler = i.wrap & 1), i.mode = Xe, i.last = 0, i.havedict = 0, i.flags = -1, i.dmax = 32768, i.head = null, i.hold = 0, i.bits = 0, i.lencode = i.lendyn = new Int32Array(Ba), i.distcode = i.distdyn = new Int32Array(Ka), i.sane = 1, i.back = -1, ne; }; var Ci = (e) => { if (re(e)) return $; let i = e.state; return i.wsize = 0, i.whave = 0, i.wnext = 0, Ui(e); }; var $i = (e, i) => { let t; if (re(e)) return $; let n = e.state; return i < 0 ? (t = 0, i = -i) : (t = (i >> 4) + 5, i < 48 && (i &= 15)), i && (i < 8 || i > 15) ? $ : (n.window !== null && n.wbits !== i && (n.window = null), n.wrap = t, n.wbits = i, Ci(e)); }; var Fi = (e, i) => { if (!e) return $; let t = new Ya(); e.state = t, t.strm = e, t.window = null, t.mode = Xe; let n = $i(e, i); return n !== ne && (e.state = null), n; }; var Ga = (e) => Fi(e, Xa); var ri = true; var it; var nt; var ja = (e) => { if (ri) { it = new Int32Array(512), nt = new Int32Array(32); let i = 0; for (; i < 144; ) e.lens[i++] = 8; for (; i < 256; ) e.lens[i++] = 9; for (; i < 280; ) e.lens[i++] = 7; for (; i < 288; ) e.lens[i++] = 8; for (xe(Di, e.lens, 0, 288, it, 0, e.work, { bits: 9 }), i = 0; i < 32; ) e.lens[i++] = 5; xe(Zi, e.lens, 0, 32, nt, 0, e.work, { bits: 5 }), ri = false; } e.lencode = it, e.lenbits = 9, e.distcode = nt, e.distbits = 5; }; var Mi = (e, i, t, n) => { let r, a = e.state; return a.window === null && (a.wsize = 1 << a.wbits, a.wnext = 0, a.whave = 0, a.window = new Uint8Array(a.wsize)), n >= a.wsize ? (a.window.set(i.subarray(t - a.wsize, t), 0), a.wnext = 0, a.whave = a.wsize) : (r = a.wsize - a.wnext, r > n && (r = n), a.window.set(i.subarray(t - n, t - n + r), a.wnext), n -= r, n ? (a.window.set(i.subarray(t - n, t), 0), a.wnext = n, a.whave = a.wsize) : (a.wnext += r, a.wnext === a.wsize && (a.wnext = 0), a.whave < a.wsize && (a.whave += r))), 0; }; var Wa = (e, i) => { let t, n, r, a, o, f, c, l, _, y, s, h, u, T, k = 0, g, S, p, d, m, D, w, A, E = new Uint8Array(4), b, x, J = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]); if (re(e) || !e.output || !e.input && e.avail_in !== 0) return $; t = e.state, t.mode === K && (t.mode = qe), o = e.next_out, r = e.output, c = e.avail_out, a = e.next_in, n = e.input, f = e.avail_in, l = t.hold, _ = t.bits, y = f, s = c, A = ne; e: for (; ; ) switch (t.mode) { case Xe: if (t.wrap === 0) { t.mode = qe; break; } for (; _ < 16; ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } if (t.wrap & 2 && l === 35615) { t.wbits === 0 && (t.wbits = 15), t.check = 0, E[0] = l & 255, E[1] = l >>> 8 & 255, t.check = Z(t.check, E, 2, 0), l = 0, _ = 0, t.mode = Ct; break; } if (t.head && (t.head.done = false), !(t.wrap & 1) || (((l & 255) << 8) + (l >> 8)) % 31) { e.msg = "incorrect header check", t.mode = R; break; } if ((l & 15) !== Ut) { e.msg = "unknown compression method", t.mode = R; break; } if (l >>>= 4, _ -= 4, w = (l & 15) + 8, t.wbits === 0 && (t.wbits = w), w > 15 || w > t.wbits) { e.msg = "invalid window size", t.mode = R; break; } t.dmax = 1 << t.wbits, t.flags = 0, e.adler = t.check = 1, t.mode = l & 512 ? Xt : K, l = 0, _ = 0; break; case Ct: for (; _ < 16; ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } if (t.flags = l, (t.flags & 255) !== Ut) { e.msg = "unknown compression method", t.mode = R; break; } if (t.flags & 57344) { e.msg = "unknown header flags set", t.mode = R; break; } t.head && (t.head.text = l >> 8 & 1), t.flags & 512 && t.wrap & 4 && (E[0] = l & 255, E[1] = l >>> 8 & 255, t.check = Z(t.check, E, 2, 0)), l = 0, _ = 0, t.mode = $t; case $t: for (; _ < 32; ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } t.head && (t.head.time = l), t.flags & 512 && t.wrap & 4 && (E[0] = l & 255, E[1] = l >>> 8 & 255, E[2] = l >>> 16 & 255, E[3] = l >>> 24 & 255, t.check = Z(t.check, E, 4, 0)), l = 0, _ = 0, t.mode = Ft; case Ft: for (; _ < 16; ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } t.head && (t.head.xflags = l & 255, t.head.os = l >> 8), t.flags & 512 && t.wrap & 4 && (E[0] = l & 255, E[1] = l >>> 8 & 255, t.check = Z(t.check, E, 2, 0)), l = 0, _ = 0, t.mode = Mt; case Mt: if (t.flags & 1024) { for (; _ < 16; ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } t.length = l, t.head && (t.head.extra_len = l), t.flags & 512 && t.wrap & 4 && (E[0] = l & 255, E[1] = l >>> 8 & 255, t.check = Z(t.check, E, 2, 0)), l = 0, _ = 0; } else t.head && (t.head.extra = null); t.mode = Ht; case Ht: if (t.flags & 1024 && (h = t.length, h > f && (h = f), h && (t.head && (w = t.head.extra_len - t.length, t.head.extra || (t.head.extra = new Uint8Array(t.head.extra_len)), t.head.extra.set(n.subarray(a, a + h), w)), t.flags & 512 && t.wrap & 4 && (t.check = Z(t.check, n, h, a)), f -= h, a += h, t.length -= h), t.length)) break e; t.length = 0, t.mode = Bt; case Bt: if (t.flags & 2048) { if (f === 0) break e; h = 0; do w = n[a + h++], t.head && w && t.length < 65536 && (t.head.name += String.fromCharCode(w)); while (w && h < f); if (t.flags & 512 && t.wrap & 4 && (t.check = Z(t.check, n, h, a)), f -= h, a += h, w) break e; } else t.head && (t.head.name = null); t.length = 0, t.mode = Kt; case Kt: if (t.flags & 4096) { if (f === 0) break e; h = 0; do w = n[a + h++], t.head && w && t.length < 65536 && (t.head.comment += String.fromCharCode(w)); while (w && h < f); if (t.flags & 512 && t.wrap & 4 && (t.check = Z(t.check, n, h, a)), f -= h, a += h, w) break e; } else t.head && (t.head.comment = null); t.mode = Pt; case Pt: if (t.flags & 512) { for (; _ < 16; ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } if (t.wrap & 4 && l !== (t.check & 65535)) { e.msg = "header crc mismatch", t.mode = R; break; } l = 0, _ = 0; } t.head && (t.head.hcrc = t.flags >> 9 & 1, t.head.done = true), e.adler = t.check = 0, t.mode = K; break; case Xt: for (; _ < 32; ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } e.adler = t.check = ai(l), l = 0, _ = 0, t.mode = Be; case Be: if (t.havedict === 0) return e.next_out = o, e.avail_out = c, e.next_in = a, e.avail_in = f, t.hold = l, t.bits = _, Ma; e.adler = t.check = 1, t.mode = K; case K: if (i === $a || i === Ue) break e; case qe: if (t.last) { l >>>= _ & 7, _ -= _ & 7, t.mode = tt; break; } for (; _ < 3; ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } switch (t.last = l & 1, l >>>= 1, _ -= 1, l & 3) { case 0: t.mode = Yt; break; case 1: if (ja(t), t.mode = Ce, i === Ue) { l >>>= 2, _ -= 2; break e; } break; case 2: t.mode = jt; break; case 3: e.msg = "invalid block type", t.mode = R; } l >>>= 2, _ -= 2; break; case Yt: for (l >>>= _ & 7, _ -= _ & 7; _ < 32; ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } if ((l & 65535) !== (l >>> 16 ^ 65535)) { e.msg = "invalid stored block lengths", t.mode = R; break; } if (t.length = l & 65535, l = 0, _ = 0, t.mode = et, i === Ue) break e; case et: t.mode = Gt; case Gt: if (h = t.length, h) { if (h > f && (h = f), h > c && (h = c), h === 0) break e; r.set(n.subarray(a, a + h), o), f -= h, a += h, c -= h, o += h, t.length -= h; break; } t.mode = K; break; case jt: for (; _ < 14; ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } if (t.nlen = (l & 31) + 257, l >>>= 5, _ -= 5, t.ndist = (l & 31) + 1, l >>>= 5, _ -= 5, t.ncode = (l & 15) + 4, l >>>= 4, _ -= 4, t.nlen > 286 || t.ndist > 30) { e.msg = "too many length or distance symbols", t.mode = R; break; } t.have = 0, t.mode = Wt; case Wt: for (; t.have < t.ncode; ) { for (; _ < 3; ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } t.lens[J[t.have++]] = l & 7, l >>>= 3, _ -= 3; } for (; t.have < 19; ) t.lens[J[t.have++]] = 0; if (t.lencode = t.lendyn, t.lenbits = 7, b = { bits: t.lenbits }, A = xe(Ca, t.lens, 0, 19, t.lencode, 0, t.work, b), t.lenbits = b.bits, A) { e.msg = "invalid code lengths set", t.mode = R; break; } t.have = 0, t.mode = Vt; case Vt: for (; t.have < t.nlen + t.ndist; ) { for (; k = t.lencode[l & (1 << t.lenbits) - 1], g = k >>> 24, S = k >>> 16 & 255, p = k & 65535, !(g <= _); ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } if (p < 16) l >>>= g, _ -= g, t.lens[t.have++] = p; else { if (p === 16) { for (x = g + 2; _ < x; ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } if (l >>>= g, _ -= g, t.have === 0) { e.msg = "invalid bit length repeat", t.mode = R; break; } w = t.lens[t.have - 1], h = 3 + (l & 3), l >>>= 2, _ -= 2; } else if (p === 17) { for (x = g + 3; _ < x; ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } l >>>= g, _ -= g, w = 0, h = 3 + (l & 7), l >>>= 3, _ -= 3; } else { for (x = g + 7; _ < x; ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } l >>>= g, _ -= g, w = 0, h = 11 + (l & 127), l >>>= 7, _ -= 7; } if (t.have + h > t.nlen + t.ndist) { e.msg = "invalid bit length repeat", t.mode = R; break; } for (; h--; ) t.lens[t.have++] = w; } } if (t.mode === R) break; if (t.lens[256] === 0) { e.msg = "invalid code -- missing end-of-block", t.mode = R; break; } if (t.lenbits = 9, b = { bits: t.lenbits }, A = xe(Di, t.lens, 0, t.nlen, t.lencode, 0, t.work, b), t.lenbits = b.bits, A) { e.msg = "invalid literal/lengths set", t.mode = R; break; } if (t.distbits = 6, t.distcode = t.distdyn, b = { bits: t.distbits }, A = xe(Zi, t.lens, t.nlen, t.ndist, t.distcode, 0, t.work, b), t.distbits = b.bits, A) { e.msg = "invalid distances set", t.mode = R; break; } if (t.mode = Ce, i === Ue) break e; case Ce: t.mode = $e; case $e: if (f >= 6 && c >= 258) { e.next_out = o, e.avail_out = c, e.next_in = a, e.avail_in = f, t.hold = l, t.bits = _, Za(e, s), o = e.next_out, r = e.output, c = e.avail_out, a = e.next_in, n = e.input, f = e.avail_in, l = t.hold, _ = t.bits, t.mode === K && (t.back = -1); break; } for (t.back = 0; k = t.lencode[l & (1 << t.lenbits) - 1], g = k >>> 24, S = k >>> 16 & 255, p = k & 65535, !(g <= _); ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } if (S && (S & 240) === 0) { for (d = g, m = S, D = p; k = t.lencode[D + ((l & (1 << d + m) - 1) >> d)], g = k >>> 24, S = k >>> 16 & 255, p = k & 65535, !(d + g <= _); ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } l >>>= d, _ -= d, t.back += d; } if (l >>>= g, _ -= g, t.back += g, t.length = p, S === 0) { t.mode = ti; break; } if (S & 32) { t.back = -1, t.mode = K; break; } if (S & 64) { e.msg = "invalid literal/length code", t.mode = R; break; } t.extra = S & 15, t.mode = Jt; case Jt: if (t.extra) { for (x = t.extra; _ < x; ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } t.length += l & (1 << t.extra) - 1, l >>>= t.extra, _ -= t.extra, t.back += t.extra; } t.was = t.length, t.mode = Qt; case Qt: for (; k = t.distcode[l & (1 << t.distbits) - 1], g = k >>> 24, S = k >>> 16 & 255, p = k & 65535, !(g <= _); ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } if ((S & 240) === 0) { for (d = g, m = S, D = p; k = t.distcode[D + ((l & (1 << d + m) - 1) >> d)], g = k >>> 24, S = k >>> 16 & 255, p = k & 65535, !(d + g <= _); ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } l >>>= d, _ -= d, t.back += d; } if (l >>>= g, _ -= g, t.back += g, S & 64) { e.msg = "invalid distance code", t.mode = R; break; } t.offset = p, t.extra = S & 15, t.mode = qt; case qt: if (t.extra) { for (x = t.extra; _ < x; ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } t.offset += l & (1 << t.extra) - 1, l >>>= t.extra, _ -= t.extra, t.back += t.extra; } if (t.offset > t.dmax) { e.msg = "invalid distance too far back", t.mode = R; break; } t.mode = ei; case ei: if (c === 0) break e; if (h = s - c, t.offset > h) { if (h = t.offset - h, h > t.whave && t.sane) { e.msg = "invalid distance too far back", t.mode = R; break; } h > t.wnext ? (h -= t.wnext, u = t.wsize - h) : u = t.wnext - h, h > t.length && (h = t.length), T = t.window; } else T = r, u = o - t.offset, h = t.length; h > c && (h = c), c -= h, t.length -= h; do r[o++] = T[u++]; while (--h); t.length === 0 && (t.mode = $e); break; case ti: if (c === 0) break e; r[o++] = t.length, c--, t.mode = $e; break; case tt: if (t.wrap) { for (; _ < 32; ) { if (f === 0) break e; f--, l |= n[a++] << _, _ += 8; } if (s -= c, e.total_out += s, t.total += s, t.wrap & 4 && s && (e.adler = t.check = t.flags ? Z(t.check, r, s, o - s) : me(t.check, r, s, o - s)), s = c, t.wrap & 4 && (t.flags ? l : ai(l)) !== t.check) { e.msg = "incorrect data check", t.mode = R; break; } l = 0, _ = 0; } t.mode = ii; case ii: if (t.wrap && t.flags) { for (; _ < 32; ) { if (f === 0) break e; f--, l += n[a++] << _, _ += 8; } if (t.wrap & 4 && l !== (t.total & 4294967295)) { e.msg = "incorrect length check", t.mode = R; break; } l = 0, _ = 0; } t.mode = ni; case ni: A = Fa; break e; case R: A = Ii; break e; case Ni: return Oi; case Li: default: return $; } return e.next_out = o, e.avail_out = c, e.next_in = a, e.avail_in = f, t.hold = l, t.bits = _, (t.wsize || s !== e.avail_out && t.mode < R && (t.mode < tt || i !== Lt)) && Mi(e, e.output, e.next_out, s - e.avail_out), y -= e.avail_in, s -= e.avail_out, e.total_in += y, e.total_out += s, t.total += s, t.wrap & 4 && s && (e.adler = t.check = t.flags ? Z(t.check, r, s, e.next_out - s) : me(t.check, r, s, e.next_out - s)), e.data_type = t.bits + (t.last ? 64 : 0) + (t.mode === K ? 128 : 0) + (t.mode === Ce || t.mode === et ? 256 : 0), (y === 0 && s === 0 || i === Lt) && A === ne && (A = Ha), A; }; var Va = (e) => { if (re(e)) return $; let i = e.state; return i.window && (i.window = null), e.state = null, ne; }; var Ja = (e, i) => { if (re(e)) return $; let t = e.state; return (t.wrap & 2) === 0 ? $ : (t.head = i, i.done = false, ne); }; var Qa = (e, i) => { let t = i.length, n, r, a; return re(e) || (n = e.state, n.wrap !== 0 && n.mode !== Be) ? $ : n.mode === Be && (r = 1, r = me(r, i, t, 0), r !== n.check) ? Ii : (a = Mi(e, i, t, t), a ? (n.mode = Ni, Oi) : (n.havedict = 1, ne)); }; var qa = Ci; var er = $i; var tr = Ui; var ir = Ga; var nr = Fi; var ar = Wa; var rr = Va; var lr = Ja; var fr = Qa; var or = "pako inflate (from Nodeca project)"; var X = { inflateReset: qa, inflateReset2: er, inflateResetKeep: tr, inflateInit: ir, inflateInit2: nr, inflate: ar, inflateEnd: rr, inflateGetHeader: lr, inflateSetDictionary: fr, inflateInfo: or }; function _r() { this.text = 0, this.time = 0, this.xflags = 0, this.os = 0, this.extra = null, this.extra_len = 0, this.name = "", this.comment = "", this.hcrc = 0, this.done = false; } var hr = _r; var Hi = Object.prototype.toString; var { Z_NO_FLUSH: dr, Z_FINISH: sr, Z_OK: Ae, Z_STREAM_END: at, Z_NEED_DICT: rt, Z_STREAM_ERROR: cr, Z_DATA_ERROR: li, Z_MEM_ERROR: ur } = ae; function Ze(e) { this.options = Pe.assign({ chunkSize: 1024 * 64, windowBits: 15, to: "" }, e || {}); let i = this.options; i.raw && i.windowBits >= 0 && i.windowBits < 16 && (i.windowBits = -i.windowBits, i.windowBits === 0 && (i.windowBits = -15)), i.windowBits >= 0 && i.windowBits < 16 && !(e && e.windowBits) && (i.windowBits += 32), i.windowBits > 15 && i.windowBits < 48 && (i.windowBits & 15) === 0 && (i.windowBits |= 15), this.err = 0, this.msg = "", this.ended = false, this.chunks = [], this.strm = new Ri(), this.strm.avail_out = 0; let t = X.inflateInit2(this.strm, i.windowBits); if (t !== Ae) throw new Error(te[t]); if (this.header = new hr(), X.inflateGetHeader(this.strm, this.header), i.dictionary && (typeof i.dictionary == "string" ? i.dictionary = Se.string2buf(i.dictionary) : Hi.call(i.dictionary) === "[object ArrayBuffer]" && (i.dictionary = new Uint8Array(i.dictionary)), i.raw && (t = X.inflateSetDictionary(this.strm, i.dictionary), t !== Ae))) throw new Error(te[t]); } Ze.prototype.push = function(e, i) { let t = this.strm, n = this.options.chunkSize, r = this.options.dictionary, a, o, f; if (this.ended) return false; for (i === ~~i ? o = i : o = i === true ? sr : dr, Hi.call(e) === "[object ArrayBuffer]" ? t.input = new Uint8Array(e) : t.input = e, t.next_in = 0, t.avail_in = t.input.length; ; ) { for (t.avail_out === 0 && (t.output = new Uint8Array(n), t.next_out = 0, t.avail_out = n), a = X.inflate(t, o), a === rt && r && (a = X.inflateSetDictionary(t, r), a === Ae ? a = X.inflate(t, o) : a === li && (a = rt)); t.avail_in > 0 && a === at && t.state.wrap > 0 && e[t.next_in] !== 0; ) X.inflateReset(t), a = X.inflate(t, o); switch (a) { case cr: case li: case rt: case ur: return this.onEnd(a), this.ended = true, false; } if (f = t.avail_out, t.next_out && (t.avail_out === 0 || a === at)) if (this.options.to === "string") { let c = Se.utf8border(t.output, t.next_out), l = t.next_out - c, _ = Se.buf2string(t.output, c); t.next_out = l, t.avail_out = n - l, l && t.output.set(t.output.subarray(c, c + l), 0), this.onData(_); } else this.onData(t.output.length === t.next_out ? t.output : t.output.subarray(0, t.next_out)); if (!(a === Ae && f === 0)) { if (a === at) return a = X.inflateEnd(this.strm), this.onEnd(a), this.ended = true, true; if (t.avail_in === 0) break; } } return true; }; Ze.prototype.onData = function(e) { this.chunks.push(e); }; Ze.prototype.onEnd = function(e) { e === Ae && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = Pe.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg; }; function kt(e, i) { let t = new Ze(i); if (t.push(e), t.err) throw t.msg || te[t.err]; return t.result; } function wr(e, i) { return i = i || {}, i.raw = true, kt(e, i); } var br = Ze; var gr = kt; var pr = wr; var xr = kt; var vr = ae; var kr = { Inflate: br, inflate: gr, inflateRaw: pr, ungzip: xr, constants: vr }; var { Deflate: Er, deflate: yr, deflateRaw: mr, gzip: zr } = Ta; var { Inflate: Sr, inflate: Ar, inflateRaw: Rr, ungzip: Tr } = kr; var Dr = Er; var Zr = yr; var Ir = mr; var Or = zr; var Nr = Sr; var Lr = Ar; var Ur = Rr; var Cr = Tr; var $r = ae; var Bi = { Deflate: Dr, deflate: Zr, deflateRaw: Ir, gzip: Or, Inflate: Nr, inflate: Lr, inflateRaw: Ur, ungzip: Cr, constants: $r }; var Hr = Bi.ungzip; // ../../../components/ModelDetail.tsx var import_jsx_runtime = __toESM(require_jsx_runtime()); var KNOWN_LABELS = { "ai21": "AI21 Labs", "amazon": "Amazon", "anthropic": "Anthropic", "arcee-ai": "Arcee AI", "bedrock": "Amazon Bedrock", "bytedance": "ByteDance", "byteplus": "BytePlus", "cohere": "Cohere", "deepseek": "DeepSeek", "fireworks": "Fireworks AI", "google": "Google", "meta": "Meta", "minimax": "MiniMax", "mistral": "Mistral", "moonshot": "Moonshot", "nvidia": "NVIDIA", "openai": "OpenAI", "qwen": "Qwen", "togetherai": "Together AI", "vertexai": "Vertex AI", "writer": "Writer", "xai": "xAI", "zai": "Z.AI", "zhipu": "Zhipu", "baseten": "Baseten", "parasail": "Parasail" }; function titleize(slug) { return slug.split(/[-_]/g).filter(Boolean).map((p) => p.charAt(0).toUpperCase() + p.slice(1)).join(" "); } function labelFor(slug) { return KNOWN_LABELS[slug] ?? titleize(slug); } function formatContext(value) { if (!value) return "-"; if (value >= 1e6) return `${(value / 1e6).toFixed(1).replace(/\.0$/, "")}M`; if (value >= 1e3) return `${Math.round(value / 1e3)}K`; return String(value); } function formatPrice(value) { if (value == null) return "-"; if (value === 0) return "Free"; if (value < 0.01) return `$${value.toFixed(3)}/M`; return `$${value.toFixed(2)}/M`; } var MONTHS = ["Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"]; function formatLaunch(iso) { if (!iso) return "-"; const parts = iso.slice(0, 10).split("-"); if (parts.length < 2) return "-"; const year = Number(parts[0]); const monthIndex = Number(parts[1]) - 1; if (Number.isNaN(year) || monthIndex < 0 || monthIndex > 11) return "-"; return `${MONTHS[monthIndex]} ${year}`; } function decode(encoded) { try { const binary = atob(encoded); const bytes = new Uint8Array(binary.length); for (let i = 0; i < binary.length; i++) bytes[i] = binary.charCodeAt(i); const decompressed = Hr(bytes); return JSON.parse(new TextDecoder().decode(decompressed)); } catch (err) { console.error("Failed to decode model detail:", err); return null; } } function prettyModality(m) { if (m === "tool_use") return "Tool use"; return m.charAt(0).toUpperCase() + m.slice(1); } var ModelDetail = ({ encodedData }) => { const payload = (0, import_react.useMemo)(() => encodedData ? decode(encodedData) : null, [encodedData]); if (!payload?.model) { return /* @__PURE__ */ (0, import_jsx_runtime.jsx)("div", { className: "model-detail__error", children: "This model is not in the catalog" }); } const model = payload.model; const vendors = Object.entries(model.vendors ?? {}); const vendorValues = vendors.map(([, v2]) => v2); let supportsToolCalling = false; let supportsStructuredOutputs = false; let streaming = false; const inputModalities = /* @__PURE__ */ new Set(); for (const v2 of vendorValues) { const caps = v2.capabilities ?? {}; if (caps.supports_tool_calling) supportsToolCalling = true; if (caps.supports_structured_outputs) supportsStructuredOutputs = true; if (caps.streaming) streaming = true; for (const m of caps.input ?? []) inputModalities.add(m); } const vision = inputModalities.has("image"); const capabilities = [ { label: "Tool calling", active: supportsToolCalling }, { label: "Vision", active: vision }, { label: "Structured output", active: supportsStructuredOutputs }, { label: "Streaming", active: streaming } ]; const nums = (pick) => vendorValues.map(pick).filter((n) => typeof n === "number"); const inputs = nums((v2) => v2.pricing?.input_per_million); const outputs = nums((v2) => v2.pricing?.output_per_million); const lowestInput = inputs.length ? Math.min(...inputs) : null; const lowestOutput = outputs.length ? Math.min(...outputs) : null; const maxContextNums = nums((v2) => v2.context_window); const maxContext = maxContextNums.length ? Math.max(...maxContextNums) : null; const isMultimodal = vendorValues.some((v2) => (v2.capabilities?.input ?? []).includes("image")); const launchDate = model.launch_date ?? null; const hostCount = vendors.length; const stats = model.statistics ?? null; const hasStats = !!stats && (stats.artificial_analysis_intelligence_index != null || stats.artificial_analysis_coding_index != null || stats.artificial_analysis_math_index != null); return /* @__PURE__ */ (0, import_jsx_runtime.jsxs)("div", { className: "model-detail", children: [ /* @__PURE__ */ (0, import_jsx_runtime.jsxs)("section", { className: "model-detail__section", children: [ /* @__PURE__ */ (0, import_jsx_runtime.jsx)("h3", { className: "model-detail__heading", children: "Overview" }), /* @__PURE__ */ (0, import_jsx_runtime.jsxs)("div", { className: "model-detail__card", children: [ /* @__PURE__ */ (0, import_jsx_runtime.jsxs)("div", { className: "model-detail__group", children: [ /* @__PURE__ */ (0, import_jsx_runtime.jsx)("div", { className: "model-detail__group-label", children: "Capabilities" }), /* @__PURE__ */ (0, import_jsx_runtime.jsx)("div", { className: "model-detail__badges", children: capabilities.map((c) => /* @__PURE__ */ (0, import_jsx_runtime.jsx)( "span", { className: `model-detail__badge${c.active ? "" : " model-detail__badge--inactive"}`, children: c.label }, c.label )) }) ] }), /* @__PURE__ */ (0, import_jsx_runtime.jsxs)("div", { className: "model-detail__stats", children: [ lowestInput != null && lowestOutput != null && /* @__PURE__ */ (0, import_jsx_runtime.jsx)(Stat, { label: "Pricing (lowest)", value: `${formatPrice(lowestInput)} / ${formatPrice(lowestOutput)}` }), maxContext != null && /* @__PURE__ */ (0, import_jsx_runtime.jsx)(Stat, { label: "Context window", value: formatContext(maxContext) }), /* @__PURE__ */ (0, import_jsx_runtime.jsx)(Stat, { label: "Modality", value: isMultimodal ? "Multimodal" : "Text" }), launchDate && /* @__PURE__ */ (0, import_jsx_runtime.jsx)(Stat, { label: "Launched", value: formatLaunch(launchDate) }), /* @__PURE__ */ (0, import_jsx_runtime.jsx)(Stat, { label: "Hosts", value: `${hostCount} host${hostCount === 1 ? "" : "s"}` }) ] }) ] }) ] }), /* @__PURE__ */ (0, import_jsx_runtime.jsxs)("section", { className: "model-detail__section", children: [ /* @__PURE__ */ (0, import_jsx_runtime.jsx)("h3", { className: "model-detail__heading", children: "Vendor details" }), /* @__PURE__ */ (0, import_jsx_runtime.jsx)("div", { className: "model-detail__matrix-wrap", children: /* @__PURE__ */ (0, import_jsx_runtime.jsxs)("table", { className: "model-detail__matrix", children: [ /* @__PURE__ */ (0, import_jsx_runtime.jsx)("thead", { children: /* @__PURE__ */ (0, import_jsx_runtime.jsxs)("tr", { children: [ /* @__PURE__ */ (0, import_jsx_runtime.jsx)("th", { className: "model-detail__matrix-label-col", "aria-hidden": true }), vendors.map(([slug]) => /* @__PURE__ */ (0, import_jsx_runtime.jsx)("th", { className: "model-detail__matrix-vendor", children: labelFor(slug) }, slug)) ] }) }), /* @__PURE__ */ (0, import_jsx_runtime.jsxs)("tbody", { children: [ /* @__PURE__ */ (0, import_jsx_runtime.jsx)(MatrixRow, { label: "Input cost", vendors, render: (v2) => formatPrice(v2.pricing?.input_per_million) }), /* @__PURE__ */ (0, import_jsx_runtime.jsx)(MatrixRow, { label: "Output cost", vendors, render: (v2) => formatPrice(v2.pricing?.output_per_million) }), /* @__PURE__ */ (0, import_jsx_runtime.jsx)(MatrixRow, { label: "Currency", vendors, render: (v2) => v2.pricing?.currency ?? "-" }), /* @__PURE__ */ (0, import_jsx_runtime.jsx)(MatrixRow, { label: "Availability", vendors, render: (v2) => /* @__PURE__ */ (0, import_jsx_runtime.jsx)("span", { className: "model-detail__capitalize", children: v2.availability_status ?? "-" }) }), /* @__PURE__ */ (0, import_jsx_runtime.jsx)(MatrixRow, { label: "Context window", vendors, render: (v2) => formatContext(v2.context_window) }), /* @__PURE__ */ (0, import_jsx_runtime.jsx)(MatrixRow, { label: "Max output", vendors, render: (v2) => formatContext(v2.max_output_tokens) }), /* @__PURE__ */ (0, import_jsx_runtime.jsx)(MatrixRow, { label: "Zero data retention", vendors, render: (v2) => v2.zero_data_retention ? "Yes" : "No" }), /* @__PURE__ */ (0, import_jsx_runtime.jsx)(MatrixRow, { label: "Launched", vendors, render: (v2) => formatLaunch(v2.launch_date) }), /* @__PURE__ */ (0, import_jsx_runtime.jsx)(MatrixRow, { label: "Capabilities", vendors, render: (v2) => /* @__PURE__ */ (0, import_jsx_runtime.jsx)(VendorCapabilityChips, { vendor: v2 }) }), /* @__PURE__ */ (0, import_jsx_runtime.jsx)(MatrixRow, { label: "Modalities", vendors, render: (v2) => /* @__PURE__ */ (0, import_jsx_runtime.jsx)(VendorModalityChips, { vendor: v2 }) }) ] }) ] }) }) ] }), hasStats && /* @__PURE__ */ (0, import_jsx_runtime.jsxs)("section", { className: "model-detail__section", children: [ /* @__PURE__ */ (0, import_jsx_runtime.jsx)("h3", { className: "model-detail__heading", children: "Intelligence" }), /* @__PURE__ */ (0, import_jsx_runtime.jsxs)("div", { className: "model-detail__card model-detail__stats", children: [ /* @__PURE__ */ (0, import_jsx_runtime.jsx)(StatLarge, { label: "Intelligence index", value: stats?.artificial_analysis_intelligence_index }), /* @__PURE__ */ (0, import_jsx_runtime.jsx)(StatLarge, { label: "Coding index", value: stats?.artificial_analysis_coding_index }), /* @__PURE__ */ (0, import_jsx_runtime.jsx)(StatLarge, { label: "Math index", value: stats?.artificial_analysis_math_index }) ] }) ] }) ] }); }; var Stat = ({ label, value }) => /* @__PURE__ */ (0, import_jsx_runtime.jsxs)("div", { className: "model-detail__stat", children: [ /* @__PURE__ */ (0, import_jsx_runtime.jsx)("div", { className: "model-detail__stat-label", children: label }), /* @__PURE__ */ (0, import_jsx_runtime.jsx)("div", { className: "model-detail__stat-value", children: value }) ] }); var StatLarge = ({ label, value }) => /* @__PURE__ */ (0, import_jsx_runtime.jsxs)("div", { className: "model-detail__stat", children: [ /* @__PURE__ */ (0, import_jsx_runtime.jsx)("div", { className: "model-detail__stat-label", children: label }), /* @__PURE__ */ (0, import_jsx_runtime.jsx)("div", { className: "model-detail__stat-value model-detail__stat-value--large", children: value != null ? value.toString() : "-" }) ] }); var MatrixRow = ({ label, vendors, render }) => /* @__PURE__ */ (0, import_jsx_runtime.jsxs)("tr", { children: [ /* @__PURE__ */ (0, import_jsx_runtime.jsx)("td", { className: "model-detail__matrix-label", children: label }), vendors.map(([slug, vendor]) => /* @__PURE__ */ (0, import_jsx_runtime.jsx)("td", { className: "model-detail__matrix-cell", children: render(vendor) }, slug)) ] }); var VendorCapabilityChips = ({ vendor }) => { const caps = vendor.capabilities ?? {}; const flags = [ { active: caps.supports_tool_calling, label: "Tool calling" }, { active: caps.supports_tool_choice, label: "Tool choice" }, { active: caps.supports_structured_outputs, label: "Structured output" }, { active: caps.streaming, label: "Streaming" } ]; const active = flags.filter((f) => f.active); if (active.length === 0) return /* @__PURE__ */ (0, import_jsx_runtime.jsx)("span", { className: "model-detail__muted", children: "-" }); return /* @__PURE__ */ (0, import_jsx_runtime.jsx)("div", { className: "model-detail__chips", children: active.map((f) => /* @__PURE__ */ (0, import_jsx_runtime.jsx)("span", { className: "model-detail__chip", children: f.label }, f.label)) }); }; var VendorModalityChips = ({ vendor }) => { const caps = vendor.capabilities ?? {}; const inputs = caps.input ?? []; const outputs = caps.output ?? []; if (inputs.length === 0 && outputs.length === 0) { return /* @__PURE__ */ (0, import_jsx_runtime.jsx)("span", { className: "model-detail__muted", children: "-" }); } return /* @__PURE__ */ (0, import_jsx_runtime.jsxs)("div", { className: "model-detail__chips", children: [ inputs.map((m) => /* @__PURE__ */ (0, import_jsx_runtime.jsxs)("span", { className: "model-detail__chip", children: [ "Input: ", prettyModality(m) ] }, `in-${m}`)), outputs.map((m) => /* @__PURE__ */ (0, import_jsx_runtime.jsxs)("span", { className: "model-detail__chip", children: [ "Output: ", prettyModality(m) ] }, `out-${m}`)) ] }); }; var ModelDetail_default = ModelDetail; // _mdx_bundler_entry_point-06666160-4fd5-4d29-bb1a-5ccee70e2552.mdx var toc = []; var frontmatter = { "title": "Zai.Glm 5", "subtitle": "bedrock/zai.glm-5" }; function _createMdxContent(props) { const { ErrorBoundary } = { ...useMDXComponents(), ...props.components }; if (!ErrorBoundary) _missingMdxReference("ErrorBoundary", true); return (0, import_jsx_runtime2.jsx)(ErrorBoundary, { children: (0, import_jsx_runtime2.jsx)(ModelDetail_default, { encodedData: "H4sIAAAAAAAAE41Ry04DMQz8FeRzWtqtQJAzEh+AuIBQ5CamWM0mUeL0qf13lC0VRb2QUzIztseTI/TRkQd9PF9gSS5Hu749IE9Xvp/cgYKU44Yd5V8aFDguyePeBOwJNLwhT599f9P0Gwou5tLanvX6CB5rsF/GoTR9N+vuJ7PFZP4ICmwMQjsxWw4ubkF3s3YU9LgzsUqqYiSuKRTQ8+5hpHCD7HHJnmVviqDUAvqMegIFB8qxTUOTSSgIxwBaciUFFtOplGl0ySFVAf0OzQV8KDgNvURKTSlmKUZi9Mai9xxWoD/RF7pivyJbuiaL5GqlZnI/W5VfjWTCfmzZLA4tdLbj+wi25kzB7kHD68sTqJNfkyibnr0fF5ufTf+FF9NuGIb/xGUzoZAzKKBD9V5BTe2vLpFWyEXYttSGYfgGBjSikEACAAA=" }) }); } function MDXContent(props = {}) { const { wrapper: MDXLayout } = { ...useMDXComponents(), ...props.components }; return MDXLayout ? (0, import_jsx_runtime2.jsx)(MDXLayout, { ...props, children: (0, import_jsx_runtime2.jsx)(_createMdxContent, { ...props }) }) : _createMdxContent(props); } function _missingMdxReference(id, component) { throw new Error("Expected " + (component ? "component" : "object") + " `" + id + "` to be defined: you likely forgot to import, pass, or provide it."); } return __toCommonJS(mdx_bundler_entry_point_06666160_4fd5_4d29_bb1a_5ccee70e2552_exports); })(); /*! Bundled license information: pako/dist/pako.esm.mjs: (*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) *) */ ;return Component;

	Amazon Bedrock
Input cost	$1.00/M
Output cost	$3.20/M
Currency	USD
Availability	available
Context window	200K
Max output	128K
Zero data retention	Yes
Launched	Mar 2026
Capabilities	Streaming
Modalities	Input: TextOutput: Text