@deot/docs-client 1.1.10 → 1.2.0

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@deot/docs-client",
-  "version": "1.1.10",
+  "version": "1.2.0",
   "type": "module",
   "main": "dist/index.js",
   "style": "dist/index.style.css",
@@ -8,10 +8,11 @@
   "exports": {
     ".": {
       "types": "./dist/index.d.ts",
-      "import": "./dist/index.js",
-      "require": "./dist/index.cjs"
+      "import": "./dist/index.js"
     },
-    "./dist/index.style.css": "./dist/index.style.css"
+    "./dist/index.style.css": "./dist/index.style.css",
+    "./dist/bundle/index.js": "./dist/bundle/index.js",
+    "./dist/bundle/index.style.css": "./dist/bundle/index.style.css"
   },
   "files": [
     "dist"
@@ -25,11 +26,11 @@
     "@codemirror/lang-markdown": "^6.5.2",
     "@codemirror/state": "^6.7.6",
     "@codemirror/view": "^6.43.14",
-    "@deot/docs-locale": "^1.1.5",
-    "@deot/docs-markdown": "^1.1.10",
-    "@deot/docs-playground": "^1.1.9",
-    "@deot/docs-renderer": "^1.1.5",
-    "@deot/docs-theme": "^1.1.5",
+    "@deot/docs-locale": "^1.2.0",
+    "@deot/docs-markdown": "^1.2.0",
+    "@deot/docs-playground": "^1.2.0",
+    "@deot/docs-renderer": "^1.2.0",
+    "@deot/docs-theme": "^1.2.0",
     "@deot/helper": "^1.1.21",
     "@deot/helper-cache": "^1.1.11",
     "@deot/http": "^1.1.10",

package/dist/chunks/browser-Cmwcvs-d.js

@@ -1,505 +0,0 @@
-globalThis.process;
-//#region node_modules/.pnpm/fflate@0.8.3/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;
-for (var u = o(i, 0), d = u.b, f = u.r, p = new t(32768), m = 0; m < 32768; ++m) {
-	var h = (m & 43690) >> 1 | (m & 21845) << 1;
-	h = (h & 52428) >> 2 | (h & 13107) << 2, h = (h & 61680) >> 4 | (h & 3855) << 4, p[m] = ((h & 65280) >> 8 | (h & 255) << 8) >> 1;
-}
-for (var g = (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], f = s[e[a] - 1]++ << d, m = f | (1 << d) - 1; f <= m; ++f) c[p[f] >> l] = u;
-	} else for (c = new t(i), a = 0; a < i; ++a) e[a] && (c[a] = p[s[e[a] - 1]++] >> 15 - e[a]);
-	return c;
-}), _ = new e(288), m = 0; m < 144; ++m) _[m] = 8;
-for (var m = 144; m < 256; ++m) _[m] = 9;
-for (var m = 256; m < 280; ++m) _[m] = 7;
-for (var m = 280; m < 288; ++m) _[m] = 8;
-for (var v = new e(32), m = 0; m < 32; ++m) v[m] = 5;
-var y = /*#__PURE__*/ g(_, 9, 0), b = /*#__PURE__*/ g(_, 9, 1), x = /*#__PURE__*/ g(v, 5, 0), S = /*#__PURE__*/ g(v, 5, 1), C = function(e) {
-	for (var t = e[0], n = 1; n < e.length; ++n) e[n] > t && (t = e[n]);
-	return t;
-}, w = function(e, t, n) {
-	var r = t / 8 | 0;
-	return (e[r] | e[r + 1] << 8) >> (t & 7) & n;
-}, ee = function(e, t) {
-	var n = t / 8 | 0;
-	return (e[n] | e[n + 1] << 8 | e[n + 2] << 16) >> (t & 7);
-}, te = function(e) {
-	return (e + 7) / 8 | 0;
-}, T = 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));
-}, E = [
-	"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"
-], D = function(e, t, n) {
-	var r = Error(t || E[e]);
-	if (r.code = e, Error.captureStackTrace && Error.captureStackTrace(r, D), !n) throw r;
-	return r;
-}, O = function(t, n, o, s) {
-	var l = t.length, u = s ? s.length : 0;
-	if (!l || n.f && !n.l) return o || new e(0);
-	var f = !o, p = f || n.i != 2, m = n.i;
-	f && (o = new e(l * 3));
-	var h = function(t) {
-		var n = o.length;
-		if (t > n) {
-			var r = new e(Math.max(n * 2, t));
-			r.set(o), o = r;
-		}
-	}, _ = n.f || 0, v = n.p || 0, y = n.b || 0, x = n.l, E = n.d, O = n.m, k = n.n, A = l * 8;
-	do {
-		if (!x) {
-			_ = w(t, v, 1);
-			var j = w(t, v + 1, 3);
-			if (v += 3, !j) {
-				var M = te(v) + 4, N = t[M - 4] | t[M - 3] << 8, P = M + N;
-				if (P > l) {
-					m && D(0);
-					break;
-				}
-				p && h(y + N), o.set(t.subarray(M, P), y), n.b = y += N, n.p = v = P * 8, n.f = _;
-				continue;
-			}
-			if (j == 1) x = b, E = S, O = 9, k = 5;
-			else if (j == 2) {
-				var F = w(t, v, 31) + 257, I = w(t, v + 10, 15) + 4, L = F + w(t, v + 5, 31) + 1;
-				v += 14;
-				for (var R = new e(L), z = new e(19), B = 0; B < I; ++B) z[a[B]] = w(t, v + B * 3, 7);
-				v += I * 3;
-				for (var V = C(z), H = (1 << V) - 1, U = g(z, V, 1), B = 0; B < L;) {
-					var W = U[w(t, v, H)];
-					v += W & 15;
-					var M = W >> 4;
-					if (M < 16) R[B++] = M;
-					else {
-						var G = 0, K = 0;
-						for (M == 16 ? (K = 3 + w(t, v, 3), v += 2, G = R[B - 1]) : M == 17 ? (K = 3 + w(t, v, 7), v += 3) : M == 18 && (K = 11 + w(t, v, 127), v += 7); K--;) R[B++] = G;
-					}
-				}
-				var q = R.subarray(0, F), J = R.subarray(F);
-				O = C(q), k = C(J), x = g(q, O, 1), E = g(J, k, 1);
-			} else D(1);
-			if (v > A) {
-				m && D(0);
-				break;
-			}
-		}
-		p && h(y + 131072);
-		for (var ne = (1 << O) - 1, re = (1 << k) - 1, Y = v;; Y = v) {
-			var G = x[ee(t, v) & ne], X = G >> 4;
-			if (v += G & 15, v > A) {
-				m && D(0);
-				break;
-			}
-			if (G || D(2), X < 256) o[y++] = X;
-			else if (X == 256) {
-				Y = v, x = null;
-				break;
-			} else {
-				var Z = X - 254;
-				if (X > 264) {
-					var B = X - 257, Q = r[B];
-					Z = w(t, v, (1 << Q) - 1) + c[B], v += Q;
-				}
-				var $ = E[ee(t, v) & re], ie = $ >> 4;
-				$ || D(3), v += $ & 15;
-				var J = d[ie];
-				if (ie > 3) {
-					var Q = i[ie];
-					J += ee(t, v) & (1 << Q) - 1, v += Q;
-				}
-				if (v > A) {
-					m && D(0);
-					break;
-				}
-				p && h(y + 131072);
-				var ae = y + Z;
-				if (y < J) {
-					var oe = u - J, se = Math.min(J, ae);
-					for (oe + y < 0 && D(3); y < se; ++y) o[y] = s[oe + y];
-				}
-				for (; y < ae; ++y) o[y] = o[y - J];
-			}
-		}
-		n.l = x, n.p = Y, n.b = y, n.f = _, x && (_ = 1, n.m = O, n.d = E, n.n = k);
-	} while (!_);
-	return y != o.length && f ? T(o, 0, y) : o.subarray(0, y);
-}, k = function(e, t, n) {
-	n <<= t & 7;
-	var r = t / 8 | 0;
-	e[r] |= n, e[r + 1] |= n >> 8;
-}, A = 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;
-}, j = 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: R,
-		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 = M(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
-	};
-}, M = function(e, t, n) {
-	return e.s == -1 ? Math.max(M(e.l, t, n + 1), M(e.r, t, n + 1)) : t[e.s] = n;
-}, N = 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
-	};
-}, P = function(e, t) {
-	for (var n = 0, r = 0; r < t.length; ++r) n += e[r] * t[r];
-	return n;
-}, F = function(e, t, n) {
-	var r = n.length, i = te(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;
-}, I = function(e, n, o, s, c, l, u, d, f, p, m) {
-	k(n, m++, o), ++c[256];
-	for (var h = j(c, 15), b = h.t, S = h.l, C = j(l, 15), w = C.t, ee = C.l, te = N(b), T = te.c, E = te.n, D = N(w), O = D.c, M = D.n, I = new t(19), L = 0; L < T.length; ++L) ++I[T[L] & 31];
-	for (var L = 0; L < O.length; ++L) ++I[O[L] & 31];
-	for (var R = j(I, 7), z = R.t, B = R.l, V = 19; V > 4 && !z[a[V - 1]]; --V);
-	var H = p + 5 << 3, U = P(c, _) + P(l, v) + u, W = P(c, b) + P(l, w) + u + 14 + 3 * V + P(I, z) + 2 * I[16] + 3 * I[17] + 7 * I[18];
-	if (f >= 0 && H <= U && H <= W) return F(n, m, e.subarray(f, f + p));
-	var G, K, q, J;
-	if (k(n, m, 1 + (W < U)), m += 2, W < U) {
-		G = g(b, S, 0), K = b, q = g(w, ee, 0), J = w;
-		var ne = g(z, B, 0);
-		k(n, m, E - 257), k(n, m + 5, M - 1), k(n, m + 10, V - 4), m += 14;
-		for (var L = 0; L < V; ++L) k(n, m + 3 * L, z[a[L]]);
-		m += 3 * V;
-		for (var re = [T, O], Y = 0; Y < 2; ++Y) for (var X = re[Y], L = 0; L < X.length; ++L) {
-			var Z = X[L] & 31;
-			k(n, m, ne[Z]), m += z[Z], Z > 15 && (k(n, m, X[L] >> 5 & 127), m += X[L] >> 12);
-		}
-	} else G = y, K = _, q = x, J = v;
-	for (var L = 0; L < d; ++L) {
-		var Q = s[L];
-		if (Q > 255) {
-			var Z = Q >> 18 & 31;
-			A(n, m, G[Z + 257]), m += K[Z + 257], Z > 7 && (k(n, m, Q >> 23 & 31), m += r[Z]);
-			var $ = Q & 31;
-			A(n, m, q[$]), m += J[$], $ > 3 && (A(n, m, Q >> 5 & 8191), m += i[$]);
-		} else A(n, m, G[Q]), m += K[Q];
-	}
-	return A(n, m, G[256]), m + K[256];
-}, L = /*#__PURE__*/ new n([
-	65540,
-	131080,
-	131088,
-	131104,
-	262176,
-	1048704,
-	1048832,
-	2114560,
-	2117632
-]), R = /*#__PURE__*/ new e(0), z = function(a, o, s, c, u, d) {
-	var p = d.z || a.length, m = new e(c + p + 5 * (1 + Math.ceil(p / 7e3)) + u), h = m.subarray(c, m.length - u), g = d.l, _ = (d.r || 0) & 7;
-	if (o) {
-		_ && (h[0] = d.r >> 3);
-		for (var v = L[o - 1], y = v >> 13, b = v & 8191, x = (1 << s) - 1, S = d.p || new t(32768), C = d.h || new t(x + 1), w = Math.ceil(s / 3), ee = 2 * w, E = function(e) {
-			return (a[e] ^ a[e + 1] << w ^ a[e + 2] << ee) & x;
-		}, D = new n(25e3), O = new t(288), k = new t(32), A = 0, j = 0, M = d.i || 0, N = 0, P = d.w || 0, R = 0; M + 2 < p; ++M) {
-			var z = E(M), B = M & 32767, V = C[z];
-			if (S[B] = V, C[z] = B, P <= M) {
-				var H = p - M;
-				if ((A > 7e3 || N > 24576) && (H > 423 || !g)) {
-					_ = I(a, h, 0, D, O, k, j, N, R, M - R, _), N = A = j = 0, R = M;
-					for (var U = 0; U < 286; ++U) O[U] = 0;
-					for (var U = 0; U < 30; ++U) k[U] = 0;
-				}
-				var W = 2, G = 0, K = b, q = B - V & 32767;
-				if (H > 2 && z == E(M - q)) for (var J = Math.min(y, H) - 1, ne = Math.min(32767, M), re = Math.min(258, H); q <= ne && --K && B != V;) {
-					if (a[M + W] == a[M + W - q]) {
-						for (var Y = 0; Y < re && a[M + Y] == a[M + 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 = M - q + U & 32767, $ = Q - S[Q] & 32767;
-								$ > Z && (Z = $, V = Q);
-							}
-						}
-					}
-					B = V, V = S[B], q += B - V & 32767;
-				}
-				if (G) {
-					D[N++] = 268435456 | l[W] << 18 | f[G];
-					var ie = l[W] & 31, ae = f[G] & 31;
-					j += r[ie] + i[ae], ++O[257 + ie], ++k[ae], P = M + W, ++A;
-				} else D[N++] = a[M], ++O[a[M]];
-			}
-		}
-		for (M = Math.max(M, P); M < p; ++M) D[N++] = a[M], ++O[a[M]];
-		_ = I(a, h, g, D, O, k, j, N, R, M - R, _), g || (d.r = _ & 7 | h[_ / 8 | 0] << 3, _ -= 7, d.h = C, d.p = S, d.i = M, d.w = P);
-	} else {
-		for (var M = d.w || 0; M < p + g; M += 65535) {
-			var oe = M + 65535;
-			oe >= p && (h[_ / 8 | 0] = g, oe = p), _ = F(h, _ + 1, a.subarray(M, oe));
-		}
-		d.i = p;
-	}
-	return T(m, 0, c + te(_) + u);
-}, B = function() {
-	var e = 1, t = 0;
-	return {
-		p: function(n) {
-			for (var r = e, i = t, a = n.length | 0, o = 0; o != a;) {
-				for (var s = Math.min(o + 2655, a); o < s; ++o) i += r += n[o];
-				r = (r & 65535) + 15 * (r >> 16), i = (i & 65535) + 15 * (i >> 16);
-			}
-			e = r, t = i;
-		},
-		d: function() {
-			return e %= 65521, t %= 65521, (e & 255) << 24 | (e & 65280) << 8 | (t & 255) << 8 | t >> 8;
-		}
-	};
-}, V = 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 z(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);
-}, H = function(e, t, n) {
-	for (; n; ++t) e[t] = n, n >>>= 8;
-}, U = function(e, t) {
-	var n = t.level, r = n == 0 ? 0 : n < 6 ? 1 : n == 9 ? 3 : 2;
-	if (e[0] = 120, e[1] = r << 6 | (t.dictionary && 32), e[1] |= 31 - (e[0] << 8 | e[1]) % 31, t.dictionary) {
-		var i = B();
-		i.p(t.dictionary), H(e, 2, i.d());
-	}
-}, W = function(e, t) {
-	return ((e[0] & 15) != 8 || e[0] >> 4 > 7 || (e[0] << 8 | e[1]) % 31) && D(6, "invalid zlib data"), (e[1] >> 5 & 1) == +!t && D(6, "invalid zlib data: " + (e[1] & 32 ? "need" : "unexpected") + " dictionary"), (e[1] >> 3 & 4) + 2;
-};
-function G(e, t) {
-	t ||= {};
-	var n = B();
-	n.p(e);
-	var r = V(e, t, t.dictionary ? 6 : 2, 4);
-	return U(r, t), H(r, r.length - 4, n.d()), r;
-}
-function K(e, t) {
-	return O(e.subarray(W(e, t && t.dictionary), -4), { i: 2 }, t && t.out, t && t.dictionary);
-}
-var q = typeof TextEncoder < "u" && /*#__PURE__*/ new TextEncoder(), J = typeof TextDecoder < "u" && /*#__PURE__*/ new TextDecoder();
-try {
-	J.decode(R, { stream: !0 });
-} catch {}
-var ne = function(e) {
-	for (var t = "", n = 0;;) {
-		var r = e[n++], i = (r > 127) + (r > 223) + (r > 239);
-		if (n + i > e.length) return {
-			s: t,
-			r: T(e, n - 1)
-		};
-		i ? i == 3 ? (r = ((r & 15) << 18 | (e[n++] & 63) << 12 | (e[n++] & 63) << 6 | e[n++] & 63) - 65536, t += String.fromCharCode(55296 | r >> 10, 56320 | r & 1023)) : i & 1 ? t += String.fromCharCode((r & 31) << 6 | e[n++] & 63) : t += String.fromCharCode((r & 15) << 12 | (e[n++] & 63) << 6 | e[n++] & 63) : t += String.fromCharCode(r);
-	}
-};
-function re(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 (q) return q.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 T(o, 0, s);
-}
-function Y(e, t) {
-	if (t) {
-		for (var n = "", r = 0; r < e.length; r += 16384) n += String.fromCharCode.apply(null, e.subarray(r, r + 16384));
-		return n;
-	}
-	if (J) return J.decode(e);
-	var i = ne(e), a = i.s, n = i.r;
-	return n.length && D(8), a;
-}
-//#endregion
-export { G as i, re as n, K as r, Y as t };