@harryy/react-file-browser 0.0.0

package/dist/chunks/browser-4lIkMGbo.js

@@ -0,0 +1,436 @@
+//#region node_modules/fflate/esm/browser.js
+var e = Uint8Array, t = Uint16Array, n = Int32Array, r = new e([
+	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,
+	0,
+	0,
+	0
+]), i = new e([
+	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,
+	0,
+	0
+]), a = new e([
+	16,
+	17,
+	18,
+	0,
+	8,
+	7,
+	9,
+	6,
+	10,
+	5,
+	11,
+	4,
+	12,
+	3,
+	13,
+	2,
+	14,
+	1,
+	15
+]), o = function(e, r) {
+	for (var i = new t(31), a = 0; a < 31; ++a) i[a] = r += 1 << e[a - 1];
+	for (var o = new n(i[30]), a = 1; a < 30; ++a) for (var s = i[a]; s < i[a + 1]; ++s) o[s] = s - i[a] << 5 | a;
+	return {
+		b: i,
+		r: o
+	};
+}, s = o(r, 2), c = s.b, l = s.r;
+c[28] = 258, l[258] = 28;
+var u = o(i, 0);
+u.b;
+for (var d = u.r, f = new t(32768), p = 0; p < 32768; ++p) {
+	var m = (p & 43690) >> 1 | (p & 21845) << 1;
+	m = (m & 52428) >> 2 | (m & 13107) << 2, m = (m & 61680) >> 4 | (m & 3855) << 4, f[p] = ((m & 65280) >> 8 | (m & 255) << 8) >> 1;
+}
+for (var h = (function(e, n, r) {
+	for (var i = e.length, a = 0, o = new t(n); a < i; ++a) e[a] && ++o[e[a] - 1];
+	var s = new t(n);
+	for (a = 1; a < n; ++a) s[a] = s[a - 1] + o[a - 1] << 1;
+	var c;
+	if (r) {
+		c = new t(1 << n);
+		var l = 15 - n;
+		for (a = 0; a < i; ++a) if (e[a]) for (var u = a << 4 | e[a], d = n - e[a], p = s[e[a] - 1]++ << d, m = p | (1 << d) - 1; p <= m; ++p) c[f[p] >> l] = u;
+	} else for (c = new t(i), a = 0; a < i; ++a) e[a] && (c[a] = f[s[e[a] - 1]++] >> 15 - e[a]);
+	return c;
+}), g = new e(288), p = 0; p < 144; ++p) g[p] = 8;
+for (var p = 144; p < 256; ++p) g[p] = 9;
+for (var p = 256; p < 280; ++p) g[p] = 7;
+for (var p = 280; p < 288; ++p) g[p] = 8;
+for (var _ = new e(32), p = 0; p < 32; ++p) _[p] = 5;
+var v = /*#__PURE__*/ h(g, 9, 0), y = /*#__PURE__*/ h(_, 5, 0), b = function(e) {
+	return (e + 7) / 8 | 0;
+}, x = function(t, n, r) {
+	return (n == null || n < 0) && (n = 0), (r == null || r > t.length) && (r = t.length), new e(t.subarray(n, r));
+}, S = [
+	"unexpected EOF",
+	"invalid block type",
+	"invalid length/literal",
+	"invalid distance",
+	"stream finished",
+	"no stream handler",
+	,
+	"no callback",
+	"invalid UTF-8 data",
+	"extra field too long",
+	"date not in range 1980-2099",
+	"filename too long",
+	"stream finishing",
+	"invalid zip data"
+], C = function(e, t, n) {
+	var r = Error(t || S[e]);
+	if (r.code = e, Error.captureStackTrace && Error.captureStackTrace(r, C), !n) throw r;
+	return r;
+}, w = function(e, t, n) {
+	n <<= t & 7;
+	var r = t / 8 | 0;
+	e[r] |= n, e[r + 1] |= n >> 8;
+}, T = function(e, t, n) {
+	n <<= t & 7;
+	var r = t / 8 | 0;
+	e[r] |= n, e[r + 1] |= n >> 8, e[r + 2] |= n >> 16;
+}, E = function(n, r) {
+	for (var i = [], a = 0; a < n.length; ++a) n[a] && i.push({
+		s: a,
+		f: n[a]
+	});
+	var o = i.length, s = i.slice();
+	if (!o) return {
+		t: j,
+		l: 0
+	};
+	if (o == 1) {
+		var c = new e(i[0].s + 1);
+		return c[i[0].s] = 1, {
+			t: c,
+			l: 1
+		};
+	}
+	i.sort(function(e, t) {
+		return e.f - t.f;
+	}), i.push({
+		s: -1,
+		f: 25001
+	});
+	var l = i[0], u = i[1], d = 0, f = 1, p = 2;
+	for (i[0] = {
+		s: -1,
+		f: l.f + u.f,
+		l,
+		r: u
+	}; f != o - 1;) l = i[i[d].f < i[p].f ? d++ : p++], u = i[d != f && i[d].f < i[p].f ? d++ : p++], i[f++] = {
+		s: -1,
+		f: l.f + u.f,
+		l,
+		r: u
+	};
+	for (var m = s[0].s, a = 1; a < o; ++a) s[a].s > m && (m = s[a].s);
+	var h = new t(m + 1), g = D(i[f - 1], h, 0);
+	if (g > r) {
+		var a = 0, _ = 0, v = g - r, y = 1 << v;
+		for (s.sort(function(e, t) {
+			return h[t.s] - h[e.s] || e.f - t.f;
+		}); a < o; ++a) {
+			var b = s[a].s;
+			if (h[b] > r) _ += y - (1 << g - h[b]), h[b] = r;
+			else break;
+		}
+		for (_ >>= v; _ > 0;) {
+			var x = s[a].s;
+			h[x] < r ? _ -= 1 << r - h[x]++ - 1 : ++a;
+		}
+		for (; a >= 0 && _; --a) {
+			var S = s[a].s;
+			h[S] == r && (--h[S], ++_);
+		}
+		g = r;
+	}
+	return {
+		t: new e(h),
+		l: g
+	};
+}, D = function(e, t, n) {
+	return e.s == -1 ? Math.max(D(e.l, t, n + 1), D(e.r, t, n + 1)) : t[e.s] = n;
+}, O = function(e) {
+	for (var n = e.length; n && !e[--n];);
+	for (var r = new t(++n), i = 0, a = e[0], o = 1, s = function(e) {
+		r[i++] = e;
+	}, c = 1; c <= n; ++c) if (e[c] == a && c != n) ++o;
+	else {
+		if (!a && o > 2) {
+			for (; o > 138; o -= 138) s(32754);
+			o > 2 && (s(o > 10 ? o - 11 << 5 | 28690 : o - 3 << 5 | 12305), o = 0);
+		} else if (o > 3) {
+			for (s(a), --o; o > 6; o -= 6) s(8304);
+			o > 2 && (s(o - 3 << 5 | 8208), o = 0);
+		}
+		for (; o--;) s(a);
+		o = 1, a = e[c];
+	}
+	return {
+		c: r.subarray(0, i),
+		n
+	};
+}, k = function(e, t) {
+	for (var n = 0, r = 0; r < t.length; ++r) n += e[r] * t[r];
+	return n;
+}, ee = function(e, t, n) {
+	var r = n.length, i = b(t + 2);
+	e[i] = r & 255, e[i + 1] = r >> 8, e[i + 2] = e[i] ^ 255, e[i + 3] = e[i + 1] ^ 255;
+	for (var a = 0; a < r; ++a) e[i + a + 4] = n[a];
+	return (i + 4 + r) * 8;
+}, te = function(e, n, o, s, c, l, u, d, f, p, m) {
+	w(n, m++, o), ++c[256];
+	for (var b = E(c, 15), x = b.t, S = b.l, C = E(l, 15), D = C.t, te = C.l, A = O(x), j = A.c, M = A.n, N = O(D), P = N.c, F = N.n, I = new t(19), L = 0; L < j.length; ++L) ++I[j[L] & 31];
+	for (var L = 0; L < P.length; ++L) ++I[P[L] & 31];
+	for (var R = E(I, 7), z = R.t, B = R.l, V = 19; V > 4 && !z[a[V - 1]]; --V);
+	var H = p + 5 << 3, U = k(c, g) + k(l, _) + u, W = k(c, x) + k(l, D) + u + 14 + 3 * V + k(I, z) + 2 * I[16] + 3 * I[17] + 7 * I[18];
+	if (f >= 0 && H <= U && H <= W) return ee(n, m, e.subarray(f, f + p));
+	var G, K, q, J;
+	if (w(n, m, 1 + (W < U)), m += 2, W < U) {
+		G = h(x, S, 0), K = x, q = h(D, te, 0), J = D;
+		var ne = h(z, B, 0);
+		w(n, m, M - 257), w(n, m + 5, F - 1), w(n, m + 10, V - 4), m += 14;
+		for (var L = 0; L < V; ++L) w(n, m + 3 * L, z[a[L]]);
+		m += 3 * V;
+		for (var re = [j, P], Y = 0; Y < 2; ++Y) for (var X = re[Y], L = 0; L < X.length; ++L) {
+			var Z = X[L] & 31;
+			w(n, m, ne[Z]), m += z[Z], Z > 15 && (w(n, m, X[L] >> 5 & 127), m += X[L] >> 12);
+		}
+	} else G = v, K = g, q = y, J = _;
+	for (var L = 0; L < d; ++L) {
+		var Q = s[L];
+		if (Q > 255) {
+			var Z = Q >> 18 & 31;
+			T(n, m, G[Z + 257]), m += K[Z + 257], Z > 7 && (w(n, m, Q >> 23 & 31), m += r[Z]);
+			var $ = Q & 31;
+			T(n, m, q[$]), m += J[$], $ > 3 && (T(n, m, Q >> 5 & 8191), m += i[$]);
+		} else T(n, m, G[Q]), m += K[Q];
+	}
+	return T(n, m, G[256]), m + K[256];
+}, A = /*#__PURE__*/ new n([
+	65540,
+	131080,
+	131088,
+	131104,
+	262176,
+	1048704,
+	1048832,
+	2114560,
+	2117632
+]), j = /*#__PURE__*/ new e(0), M = function(a, o, s, c, u, f) {
+	var p = f.z || a.length, m = new e(c + p + 5 * (1 + Math.ceil(p / 7e3)) + u), h = m.subarray(c, m.length - u), g = f.l, _ = (f.r || 0) & 7;
+	if (o) {
+		_ && (h[0] = f.r >> 3);
+		for (var v = A[o - 1], y = v >> 13, S = v & 8191, C = (1 << s) - 1, w = f.p || new t(32768), T = f.h || new t(C + 1), E = Math.ceil(s / 3), D = 2 * E, O = function(e) {
+			return (a[e] ^ a[e + 1] << E ^ a[e + 2] << D) & C;
+		}, k = new n(25e3), j = new t(288), M = new t(32), N = 0, P = 0, F = f.i || 0, I = 0, L = f.w || 0, R = 0; F + 2 < p; ++F) {
+			var z = O(F), B = F & 32767, V = T[z];
+			if (w[B] = V, T[z] = B, L <= F) {
+				var H = p - F;
+				if ((N > 7e3 || I > 24576) && (H > 423 || !g)) {
+					_ = te(a, h, 0, k, j, M, P, I, R, F - R, _), I = N = P = 0, R = F;
+					for (var U = 0; U < 286; ++U) j[U] = 0;
+					for (var U = 0; U < 30; ++U) M[U] = 0;
+				}
+				var W = 2, G = 0, K = S, q = B - V & 32767;
+				if (H > 2 && z == O(F - q)) for (var J = Math.min(y, H) - 1, ne = Math.min(32767, F), re = Math.min(258, H); q <= ne && --K && B != V;) {
+					if (a[F + W] == a[F + W - q]) {
+						for (var Y = 0; Y < re && a[F + Y] == a[F + Y - q]; ++Y);
+						if (Y > W) {
+							if (W = Y, G = q, Y > J) break;
+							for (var X = Math.min(q, Y - 2), Z = 0, U = 0; U < X; ++U) {
+								var Q = F - q + U & 32767, $ = Q - w[Q] & 32767;
+								$ > Z && (Z = $, V = Q);
+							}
+						}
+					}
+					B = V, V = w[B], q += B - V & 32767;
+				}
+				if (G) {
+					k[I++] = 268435456 | l[W] << 18 | d[G];
+					var ie = l[W] & 31, ae = d[G] & 31;
+					P += r[ie] + i[ae], ++j[257 + ie], ++M[ae], L = F + W, ++N;
+				} else k[I++] = a[F], ++j[a[F]];
+			}
+		}
+		for (F = Math.max(F, L); F < p; ++F) k[I++] = a[F], ++j[a[F]];
+		_ = te(a, h, g, k, j, M, P, I, R, F - R, _), g || (f.r = _ & 7 | h[_ / 8 | 0] << 3, _ -= 7, f.h = T, f.p = w, f.i = F, f.w = L);
+	} else {
+		for (var F = f.w || 0; F < p + g; F += 65535) {
+			var oe = F + 65535;
+			oe >= p && (h[_ / 8 | 0] = g, oe = p), _ = ee(h, _ + 1, a.subarray(F, oe));
+		}
+		f.i = p;
+	}
+	return x(m, 0, c + b(_) + u);
+}, N = /*#__PURE__*/ (function() {
+	for (var e = /* @__PURE__ */ new Int32Array(256), t = 0; t < 256; ++t) {
+		for (var n = t, r = 9; --r;) n = (n & 1 && -306674912) ^ n >>> 1;
+		e[t] = n;
+	}
+	return e;
+})(), P = function() {
+	var e = -1;
+	return {
+		p: function(t) {
+			for (var n = e, r = 0; r < t.length; ++r) n = N[n & 255 ^ t[r]] ^ n >>> 8;
+			e = n;
+		},
+		d: function() {
+			return ~e;
+		}
+	};
+}, F = function(t, n, r, i, a) {
+	if (!a && (a = { l: 1 }, n.dictionary)) {
+		var o = n.dictionary.subarray(-32768), s = new e(o.length + t.length);
+		s.set(o), s.set(t, o.length), t = s, a.w = o.length;
+	}
+	return M(t, n.level == null ? 6 : n.level, n.mem == null ? a.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(t.length))) * 1.5) : 20 : 12 + n.mem, r, i, a);
+}, I = function(e, t) {
+	var n = {};
+	for (var r in e) n[r] = e[r];
+	for (var r in t) n[r] = t[r];
+	return n;
+}, L = function(e, t, n) {
+	for (; n; ++t) e[t] = n, n >>>= 8;
+};
+function R(e, t) {
+	return F(e, t || {}, 0, 0);
+}
+var z = function(t, n, r, i) {
+	for (var a in t) {
+		var o = t[a], s = n + a, c = i;
+		Array.isArray(o) && (c = I(i, o[1]), o = o[0]), ArrayBuffer.isView(o) ? r[s] = [o, c] : (r[s += "/"] = [new e(0), c], z(o, s, r, i));
+	}
+}, B = typeof TextEncoder < "u" && /*#__PURE__*/ new TextEncoder(), V = typeof TextDecoder < "u" && /*#__PURE__*/ new TextDecoder();
+try {
+	V.decode(j, { stream: !0 });
+} catch {}
+function H(t, n) {
+	if (n) {
+		for (var r = new e(t.length), i = 0; i < t.length; ++i) r[i] = t.charCodeAt(i);
+		return r;
+	}
+	if (B) return B.encode(t);
+	for (var a = t.length, o = new e(t.length + (t.length >> 1)), s = 0, c = function(e) {
+		o[s++] = e;
+	}, i = 0; i < a; ++i) {
+		if (s + 5 > o.length) {
+			var l = new e(s + 8 + (a - i << 1));
+			l.set(o), o = l;
+		}
+		var u = t.charCodeAt(i);
+		u < 128 || n ? c(u) : u < 2048 ? (c(192 | u >> 6), c(128 | u & 63)) : u > 55295 && u < 57344 ? (u = 65536 + (u & 1047552) | t.charCodeAt(++i) & 1023, c(240 | u >> 18), c(128 | u >> 12 & 63), c(128 | u >> 6 & 63), c(128 | u & 63)) : (c(224 | u >> 12), c(128 | u >> 6 & 63), c(128 | u & 63));
+	}
+	return x(o, 0, s);
+}
+var U = function(e) {
+	var t = 0;
+	if (e) for (var n in e) {
+		var r = e[n].length;
+		r > 65535 && C(9), t += r + 4;
+	}
+	return t;
+}, W = function(e, t, n, r, i, a, o, s) {
+	var c = r.length, l = n.extra, u = s && s.length, d = U(l);
+	L(e, t, o == null ? 67324752 : 33639248), t += 4, o != null && (e[t++] = 20, e[t++] = n.os), e[t] = 20, t += 2, e[t++] = n.flag << 1 | (a < 0 && 8), e[t++] = i && 8, e[t++] = n.compression & 255, e[t++] = n.compression >> 8;
+	var f = new Date(n.mtime == null ? Date.now() : n.mtime), p = f.getFullYear() - 1980;
+	if ((p < 0 || p > 119) && C(10), L(e, t, p << 25 | f.getMonth() + 1 << 21 | f.getDate() << 16 | f.getHours() << 11 | f.getMinutes() << 5 | f.getSeconds() >> 1), t += 4, a != -1 && (L(e, t, n.crc), L(e, t + 4, a < 0 ? -a - 2 : a), L(e, t + 8, n.size)), L(e, t + 12, c), L(e, t + 14, d), t += 16, o != null && (L(e, t, u), L(e, t + 6, n.attrs), L(e, t + 10, o), t += 14), e.set(r, t), t += c, d) for (var m in l) {
+		var h = l[m], g = h.length;
+		L(e, t, +m), L(e, t + 2, g), e.set(h, t + 4), t += 4 + g;
+	}
+	return u && (e.set(s, t), t += u), t;
+}, G = function(e, t, n, r, i) {
+	L(e, t, 101010256), L(e, t + 8, n), L(e, t + 10, n), L(e, t + 12, r), L(e, t + 16, i);
+};
+function K(t, n) {
+	n ||= {};
+	var r = {}, i = [];
+	z(t, "", r, n);
+	var a = 0, o = 0;
+	for (var s in r) {
+		var c = r[s], l = c[0], u = c[1], d = u.level == 0 ? 0 : 8, f = H(s), p = f.length, m = u.comment, h = m && H(m), g = h && h.length, _ = U(u.extra);
+		p > 65535 && C(11);
+		var v = d ? R(l, u) : l, y = v.length, b = P();
+		b.p(l), i.push(I(u, {
+			size: l.length,
+			crc: b.d(),
+			c: v,
+			f,
+			m: h,
+			u: p != s.length || h && m.length != g,
+			o: a,
+			compression: d
+		})), a += 30 + p + _ + y, o += 76 + 2 * (p + _) + (g || 0) + y;
+	}
+	for (var x = new e(o + 22), S = a, w = o - a, T = 0; T < i.length; ++T) {
+		var f = i[T];
+		W(x, f.o, f, f.f, f.u, f.c.length);
+		var E = 30 + f.f.length + U(f.extra);
+		x.set(f.c, f.o + E), W(x, a, f, f.f, f.u, f.c.length, f.o, f.m), a += 16 + E + (f.m ? f.m.length : 0);
+	}
+	return G(x, a, i.length, w, S), x;
+}
+//#endregion
+export { K as t };
+
+//# sourceMappingURL=browser-4lIkMGbo.js.map