void 0.7.5 → 0.7.6

package/dist/plugin-inference-CCtRkt9O.mjs

@@ -1,2476 +0,0 @@
-import { a as join } from "./pathe.M-eThtNZ-D-kmWkCS.mjs";
-import { n as globSync } from "./dist-DUyXJLkq.mjs";
-import { existsSync, readFileSync } from "node:fs";
-import { parseSync } from "vite";
-//#region ../../node_modules/.pnpm/es-module-lexer@2.1.0/node_modules/es-module-lexer/dist/lexer.asm.js
-let e, a, r, i = 2 << 19;
-const s = 1 === new Uint8Array(new Uint16Array([1]).buffer)[0] ? function(e, a) {
-	const r = e.length;
-	let i = 0;
-	for (; i < r;) a[i] = e.charCodeAt(i++);
-} : function(e, a) {
-	const r = e.length;
-	let i = 0;
-	for (; i < r;) {
-		const r = e.charCodeAt(i);
-		a[i++] = (255 & r) << 8 | r >>> 8;
-	}
-}, f = "xportmportlassforetaourceeferromsyncunctionvoyiedelecontininstantybreareturdebuggeawaithrwhileifcatcfinallels";
-let t, c, n;
-function parse(k, u = "@") {
-	t = k, c = u;
-	const l = 2 * t.length + (2 << 18);
-	if (l > i || !e) {
-		for (; l > i;) i *= 2;
-		a = new ArrayBuffer(i), s(f, new Uint16Array(a, 16, 109)), e = function(e, a, r) {
-			var i = new e.Int8Array(r), s = new e.Int16Array(r), f = new e.Int32Array(r), t = new e.Uint8Array(r);
-			new e.Uint16Array(r);
-			var n = 1040;
-			function b() {
-				var e = 0, a = 0, r = 0, t = 0, c = 0, b = 0, l = 0, d = 0, C = 0, g = 0;
-				g = n;
-				n = n + 10240 | 0;
-				i[808] = 1;
-				i[807] = 0;
-				s[401] = 0;
-				s[402] = 0;
-				f[70] = f[2];
-				i[809] = 0;
-				f[68] = 0;
-				i[806] = 0;
-				f[71] = g + 2048;
-				f[72] = g;
-				i[810] = 0;
-				e = (f[3] | 0) + -2 | 0;
-				f[73] = e;
-				a = e + (f[66] << 1) | 0;
-				f[74] = a;
-				e: while (1) {
-					r = e + 2 | 0;
-					f[73] = r;
-					if (e >>> 0 >= a >>> 0) {
-						t = 18;
-						break;
-					}
-					a: do
-						switch (s[r >> 1] | 0) {
-							case 9:
-							case 10:
-							case 11:
-							case 12:
-							case 13:
-							case 32: break;
-							case 101:
-								if ((((s[402] | 0) == 0 ? J(r) | 0 : 0) ? (I(e + 4 | 0, 16, 10) | 0) == 0 : 0) ? (k(), (i[808] | 0) == 0) : 0) {
-									t = 9;
-									break e;
-								} else t = 17;
-								break;
-							case 105:
-								if (J(r) | 0 ? (I(e + 4 | 0, 26, 10) | 0) == 0 : 0) {
-									u();
-									t = 17;
-								} else t = 17;
-								break;
-							case 59:
-								t = 17;
-								break;
-							case 47: switch (s[e + 4 >> 1] | 0) {
-								case 47:
-									P();
-									break a;
-								case 42:
-									m(1);
-									break a;
-								default:
-									t = 16;
-									break e;
-							}
-							default:
-								t = 16;
-								break e;
-						}
-					while (0);
-					if ((t | 0) == 17) {
-						t = 0;
-						f[70] = f[73];
-					}
-					e = f[73] | 0;
-					a = f[74] | 0;
-				}
-				if ((t | 0) == 9) {
-					e = f[73] | 0;
-					f[70] = e;
-					t = 19;
-				} else if ((t | 0) == 16) {
-					i[808] = 0;
-					f[73] = e;
-					t = 19;
-				} else if ((t | 0) == 18) if (!(i[806] | 0)) {
-					e = r;
-					t = 19;
-				} else e = 0;
-				do
-					if ((t | 0) == 19) {
-						e: while (1) {
-							a = e + 2 | 0;
-							f[73] = a;
-							if (e >>> 0 >= (f[74] | 0) >>> 0) {
-								t = 102;
-								break;
-							}
-							a: do
-								switch (s[a >> 1] | 0) {
-									case 9:
-									case 10:
-									case 11:
-									case 12:
-									case 13:
-									case 32: break;
-									case 101:
-										if (((s[402] | 0) == 0 ? J(a) | 0 : 0) ? (I(e + 4 | 0, 16, 10) | 0) == 0 : 0) {
-											k();
-											t = 101;
-										} else t = 101;
-										break;
-									case 105:
-										if (J(a) | 0 ? (I(e + 4 | 0, 26, 10) | 0) == 0 : 0) {
-											u();
-											t = 101;
-										} else t = 101;
-										break;
-									case 99:
-										if ((J(a) | 0 ? (I(e + 4 | 0, 36, 8) | 0) == 0 : 0) ? X(s[e + 12 >> 1] | 0) | 0 : 0) {
-											i[810] = 1;
-											t = 101;
-										} else t = 101;
-										break;
-									case 40:
-										r = f[71] | 0;
-										e = s[402] | 0;
-										t = e & 65535;
-										f[r + (t << 3) >> 2] = 1;
-										a = f[70] | 0;
-										s[402] = e + 1 << 16 >> 16;
-										f[r + (t << 3) + 4 >> 2] = a;
-										t = 101;
-										break;
-									case 91:
-										r = f[71] | 0;
-										e = s[402] | 0;
-										t = e & 65535;
-										f[r + (t << 3) >> 2] = 8;
-										a = f[70] | 0;
-										s[402] = e + 1 << 16 >> 16;
-										f[r + (t << 3) + 4 >> 2] = a;
-										t = 101;
-										break;
-									case 93:
-										e = s[402] | 0;
-										if (!(e << 16 >> 16)) {
-											t = 37;
-											break e;
-										}
-										s[402] = e + -1 << 16 >> 16;
-										t = 101;
-										break;
-									case 44:
-										t = s[401] | 0;
-										a = t & 65535;
-										if (((t << 16 >> 16 != 0 ? (c = s[402] | 0, c << 16 >> 16 != 0) : 0) ? (f[(f[71] | 0) + ((c & 65535) + -1 << 3) >> 2] | 0) == 5 : 0) ? (b = f[(f[72] | 0) + (a + -1 << 2) >> 2] | 0, d = b + 4 | 0, (f[d >> 2] | 0) == 0) : 0) {
-											f[d >> 2] = (f[70] | 0) + 2;
-											f[73] = e + 4;
-											w(1) | 0;
-											t = f[73] | 0;
-											f[b + 16 >> 2] = t;
-											f[73] = t + -2;
-											t = 101;
-										} else t = 101;
-										break;
-									case 41:
-										a = s[402] | 0;
-										if (!(a << 16 >> 16)) {
-											t = 45;
-											break e;
-										}
-										r = a + -1 << 16 >> 16;
-										s[402] = r;
-										t = s[401] | 0;
-										a = t & 65535;
-										if (t << 16 >> 16 != 0 ? (f[(f[71] | 0) + ((r & 65535) << 3) >> 2] | 0) == 5 : 0) {
-											a = f[(f[72] | 0) + (a + -1 << 2) >> 2] | 0;
-											r = a + 4 | 0;
-											if (!(f[r >> 2] | 0)) f[r >> 2] = (f[70] | 0) + 2;
-											f[a + 12 >> 2] = e + 4;
-											s[401] = t + -1 << 16 >> 16;
-											t = 101;
-										} else t = 101;
-										break;
-									case 123:
-										t = f[70] | 0;
-										r = f[63] | 0;
-										e = t;
-										do
-											if ((s[t >> 1] | 0) == 41 & (r | 0) != 0 ? (f[r + 4 >> 2] | 0) == (t | 0) : 0) {
-												a = f[64] | 0;
-												f[63] = a;
-												if (!a) {
-													f[59] = 0;
-													break;
-												} else {
-													f[a + 36 >> 2] = 0;
-													break;
-												}
-											}
-										while (0);
-										r = f[71] | 0;
-										a = s[402] | 0;
-										t = a & 65535;
-										f[r + (t << 3) >> 2] = (i[810] | 0) == 0 ? 2 : 6;
-										s[402] = a + 1 << 16 >> 16;
-										f[r + (t << 3) + 4 >> 2] = e;
-										i[810] = 0;
-										t = 101;
-										break;
-									case 125:
-										e = s[402] | 0;
-										if (!(e << 16 >> 16)) {
-											t = 58;
-											break e;
-										}
-										r = f[71] | 0;
-										t = e + -1 << 16 >> 16;
-										s[402] = t;
-										if ((f[r + ((t & 65535) << 3) >> 2] | 0) == 4) {
-											h();
-											t = 101;
-										} else t = 101;
-										break;
-									case 39:
-										v(39);
-										t = 101;
-										break;
-									case 34:
-										v(34);
-										t = 101;
-										break;
-									case 47: switch (s[e + 4 >> 1] | 0) {
-										case 47:
-											P();
-											break a;
-										case 42:
-											m(1);
-											break a;
-										default:
-											e = f[70] | 0;
-											a = s[e >> 1] | 0;
-											r: do
-												if (!(x(a) | 0)) if (a << 16 >> 16 == 41) {
-													r = s[402] | 0;
-													if (!(D(f[(f[71] | 0) + ((r & 65535) << 3) + 4 >> 2] | 0) | 0)) t = 74;
-												} else t = 73;
-												else switch (a << 16 >> 16) {
-													case 46: if (((s[e + -2 >> 1] | 0) + -48 & 65535) < 10) {
-														t = 73;
-														break r;
-													} else break r;
-													case 43: if ((s[e + -2 >> 1] | 0) == 43) {
-														t = 73;
-														break r;
-													} else break r;
-													case 45: if ((s[e + -2 >> 1] | 0) == 45) {
-														t = 73;
-														break r;
-													} else break r;
-													default: break r;
-												}
-											while (0);
-											if ((t | 0) == 73) {
-												r = s[402] | 0;
-												t = 74;
-											}
-											r: do
-												if ((t | 0) == 74) {
-													t = 0;
-													if (r << 16 >> 16 != 0 ? (l = f[71] | 0, C = (r & 65535) + -1 | 0, a << 16 >> 16 == 102 ? (f[l + (C << 3) >> 2] | 0) == 1 : 0) : 0) {
-														if (((s[e + -2 >> 1] | 0) == 111 ? A(e + -4 | 0) | 0 : 0) ? T(f[l + (C << 3) + 4 >> 2] | 0, 44, 3) | 0 : 0) break;
-													} else t = 79;
-													if ((t | 0) == 79 ? a << 16 >> 16 == 125 : 0) {
-														t = f[71] | 0;
-														r = r & 65535;
-														if (y(f[t + (r << 3) + 4 >> 2] | 0) | 0) break;
-														if ((f[t + (r << 3) >> 2] | 0) == 6) break;
-													}
-													if (!(o(e) | 0)) {
-														switch (a << 16 >> 16) {
-															case 0: break r;
-															case 47:
-																if (i[809] | 0) break r;
-																break;
-															default:
-														}
-														t = f[65] | 0;
-														if ((t | 0 ? e >>> 0 >= (f[t >> 2] | 0) >>> 0 : 0) ? e >>> 0 <= (f[t + 4 >> 2] | 0) >>> 0 : 0) {
-															p();
-															i[809] = 0;
-															t = 101;
-															break a;
-														}
-														r = f[3] | 0;
-														do {
-															if (e >>> 0 <= r >>> 0) break;
-															e = e + -2 | 0;
-															f[70] = e;
-															a = s[e >> 1] | 0;
-														} while (!(E(a) | 0));
-														if (F(a) | 0) {
-															do {
-																if (e >>> 0 <= r >>> 0) break;
-																e = e + -2 | 0;
-																f[70] = e;
-															} while (F(s[e >> 1] | 0) | 0);
-															if (j(e) | 0) {
-																p();
-																i[809] = 0;
-																t = 101;
-																break a;
-															}
-														}
-														i[809] = 1;
-														t = 101;
-														break a;
-													}
-												}
-											while (0);
-											p();
-											i[809] = 0;
-											t = 101;
-											break a;
-									}
-									case 96:
-										r = f[71] | 0;
-										a = s[402] | 0;
-										t = a & 65535;
-										f[r + (t << 3) + 4 >> 2] = f[70];
-										s[402] = a + 1 << 16 >> 16;
-										f[r + (t << 3) >> 2] = 3;
-										h();
-										t = 101;
-										break;
-									default: t = 101;
-								}
-							while (0);
-							if ((t | 0) == 101) {
-								t = 0;
-								f[70] = f[73];
-							}
-							e = f[73] | 0;
-						}
-						if ((t | 0) == 37) {
-							W();
-							e = 0;
-							break;
-						} else if ((t | 0) == 45) {
-							W();
-							e = 0;
-							break;
-						} else if ((t | 0) == 58) {
-							W();
-							e = 0;
-							break;
-						} else if ((t | 0) == 102) {
-							e = (i[806] | 0) == 0 ? (s[401] | s[402]) << 16 >> 16 == 0 : 0;
-							break;
-						}
-					}
-				while (0);
-				n = g;
-				return e | 0;
-			}
-			function k() {
-				var e = 0, a = 0, r = 0, t = 0, c = 0, n = 0, b = 0, k = 0, u = 0, o = 0, h = 0, d = 0, A = 0, g = 0;
-				k = f[73] | 0;
-				u = f[65] | 0;
-				g = k + 12 | 0;
-				f[73] = g;
-				r = w(1) | 0;
-				e = f[73] | 0;
-				if (!((e | 0) == (g | 0) ? !(U(r) | 0) : 0)) A = 3;
-				e: do
-					if ((A | 0) == 3) {
-						a: do
-							switch (r << 16 >> 16) {
-								case 123:
-									f[73] = e + 2;
-									e = w(1) | 0;
-									a = f[73] | 0;
-									while (1) {
-										if (Y(e) | 0) {
-											v(e);
-											e = (f[73] | 0) + 2 | 0;
-											f[73] = e;
-										} else {
-											q(e) | 0;
-											e = f[73] | 0;
-										}
-										w(1) | 0;
-										e = C(a, e) | 0;
-										if (e << 16 >> 16 == 44) {
-											f[73] = (f[73] | 0) + 2;
-											e = w(1) | 0;
-										}
-										if (e << 16 >> 16 == 125) {
-											A = 15;
-											break;
-										}
-										g = a;
-										a = f[73] | 0;
-										if ((a | 0) == (g | 0)) {
-											A = 12;
-											break;
-										}
-										if (a >>> 0 > (f[74] | 0) >>> 0) {
-											A = 14;
-											break;
-										}
-									}
-									if ((A | 0) == 12) {
-										W();
-										break e;
-									} else if ((A | 0) == 14) {
-										W();
-										break e;
-									} else if ((A | 0) == 15) {
-										i[807] = 1;
-										f[73] = (f[73] | 0) + 2;
-										break a;
-									}
-									break;
-								case 42:
-									f[73] = e + 2;
-									w(1) | 0;
-									g = f[73] | 0;
-									C(g, g) | 0;
-									break;
-								default:
-									i[808] = 0;
-									switch (r << 16 >> 16) {
-										case 100:
-											k = e + 14 | 0;
-											f[73] = k;
-											switch ((w(1) | 0) << 16 >> 16) {
-												case 97:
-													a = f[73] | 0;
-													if ((I(a + 2 | 0, 80, 8) | 0) == 0 ? (c = a + 10 | 0, F(s[c >> 1] | 0) | 0) : 0) {
-														f[73] = c;
-														w(0) | 0;
-														A = 22;
-													}
-													break;
-												case 102:
-													A = 22;
-													break;
-												case 99:
-													a = f[73] | 0;
-													if (((I(a + 2 | 0, 36, 8) | 0) == 0 ? (t = a + 10 | 0, g = s[t >> 1] | 0, X(g) | 0 | g << 16 >> 16 == 123) : 0) ? (f[73] = t, n = w(1) | 0, n << 16 >> 16 != 123) : 0) {
-														d = n;
-														A = 31;
-													}
-													break;
-												default:
-											}
-											r: do
-												if ((A | 0) == 22 ? (b = f[73] | 0, (I(b + 2 | 0, 88, 14) | 0) == 0) : 0) {
-													r = b + 16 | 0;
-													a = s[r >> 1] | 0;
-													if (!(X(a) | 0)) switch (a << 16 >> 16) {
-														case 40:
-														case 42: break;
-														default: break r;
-													}
-													f[73] = r;
-													a = w(1) | 0;
-													if (a << 16 >> 16 == 42) {
-														f[73] = (f[73] | 0) + 2;
-														a = w(1) | 0;
-													}
-													if (a << 16 >> 16 != 40) {
-														d = a;
-														A = 31;
-													}
-												}
-											while (0);
-											if ((A | 0) == 31 ? (o = f[73] | 0, q(d) | 0, h = f[73] | 0, h >>> 0 > o >>> 0) : 0) {
-												$(e, k, o, h);
-												f[73] = (f[73] | 0) + -2;
-												break e;
-											}
-											$(e, k, 0, 0);
-											f[73] = e + 12;
-											break e;
-										case 97:
-											f[73] = e + 10;
-											w(0) | 0;
-											e = f[73] | 0;
-											A = 35;
-											break;
-										case 102:
-											A = 35;
-											break;
-										case 99:
-											if ((I(e + 2 | 0, 36, 8) | 0) == 0 ? (a = e + 10 | 0, E(s[a >> 1] | 0) | 0) : 0) {
-												f[73] = a;
-												g = w(1) | 0;
-												A = f[73] | 0;
-												q(g) | 0;
-												g = f[73] | 0;
-												$(A, g, A, g);
-												f[73] = (f[73] | 0) + -2;
-												break e;
-											}
-											e = e + 4 | 0;
-											f[73] = e;
-											break;
-										case 108:
-										case 118: break;
-										default: break e;
-									}
-									if ((A | 0) == 35) {
-										f[73] = e + 16;
-										e = w(1) | 0;
-										if (e << 16 >> 16 == 42) {
-											f[73] = (f[73] | 0) + 2;
-											e = w(1) | 0;
-										}
-										A = f[73] | 0;
-										q(e) | 0;
-										g = f[73] | 0;
-										$(A, g, A, g);
-										f[73] = (f[73] | 0) + -2;
-										break e;
-									}
-									f[73] = e + 6;
-									i[808] = 0;
-									r = w(1) | 0;
-									e = f[73] | 0;
-									r = (q(r) | 32) << 16 >> 16 == 123;
-									t = f[73] | 0;
-									if (r) {
-										f[73] = t + 2;
-										g = w(1) | 0;
-										e = f[73] | 0;
-										q(g) | 0;
-									}
-									r: while (1) {
-										a = f[73] | 0;
-										if ((a | 0) == (e | 0)) break;
-										$(e, a, e, a);
-										a = w(1) | 0;
-										if (r) switch (a << 16 >> 16) {
-											case 93:
-											case 125: break e;
-											default:
-										}
-										e = f[73] | 0;
-										if (a << 16 >> 16 != 44) {
-											A = 51;
-											break;
-										}
-										f[73] = e + 2;
-										a = w(1) | 0;
-										e = f[73] | 0;
-										switch (a << 16 >> 16) {
-											case 91:
-											case 123:
-												A = 51;
-												break r;
-											default:
-										}
-										q(a) | 0;
-									}
-									if ((A | 0) == 51) f[73] = e + -2;
-									if (!r) break e;
-									f[73] = t + -2;
-									break e;
-							}
-						while (0);
-						g = (w(1) | 0) << 16 >> 16 == 102;
-						e = f[73] | 0;
-						if (g ? (I(e + 2 | 0, 74, 6) | 0) == 0 : 0) {
-							f[73] = e + 8;
-							l(k, w(1) | 0, 0);
-							e = (u | 0) == 0 ? 240 : u + 16 | 0;
-							while (1) {
-								e = f[e >> 2] | 0;
-								if (!e) break e;
-								f[e + 12 >> 2] = 0;
-								f[e + 8 >> 2] = 0;
-								e = e + 16 | 0;
-							}
-						}
-						f[73] = e + -2;
-					}
-				while (0);
-			}
-			function u() {
-				var e = 0, a = 0, r = 0, t = 0, c = 0, n = 0, b = 0;
-				b = f[73] | 0;
-				c = b + 12 | 0;
-				f[73] = c;
-				e = w(1) | 0;
-				t = f[73] | 0;
-				e: do
-					if (e << 16 >> 16 != 46) {
-						if (!(e << 16 >> 16 == 115 & t >>> 0 > c >>> 0)) {
-							if (!(e << 16 >> 16 == 100 & t >>> 0 > (b + 10 | 0) >>> 0)) {
-								t = 0;
-								n = 28;
-								break;
-							}
-							if (I(t + 2 | 0, 66, 8) | 0) {
-								a = t;
-								e = 100;
-								t = 0;
-								n = 59;
-								break;
-							}
-							e = t + 10 | 0;
-							if (!(X(s[e >> 1] | 0) | 0)) {
-								a = t;
-								e = 100;
-								t = 0;
-								n = 59;
-								break;
-							}
-							f[73] = e;
-							e = w(1) | 0;
-							if (e << 16 >> 16 == 42) {
-								e = 42;
-								t = 2;
-								n = 61;
-								break;
-							}
-							f[73] = t;
-							t = 0;
-							n = 28;
-							break;
-						}
-						if ((I(t + 2 | 0, 56, 10) | 0) == 0 ? (r = t + 12 | 0, X(s[r >> 1] | 0) | 0) : 0) {
-							f[73] = r;
-							e = w(1) | 0;
-							a = f[73] | 0;
-							if ((a | 0) != (r | 0)) {
-								if (e << 16 >> 16 != 102) {
-									t = 1;
-									n = 28;
-									break;
-								}
-								if (I(a + 2 | 0, 74, 6) | 0) {
-									e = 102;
-									t = 1;
-									n = 59;
-									break;
-								}
-								if (!(E(s[a + 8 >> 1] | 0) | 0)) {
-									e = 102;
-									t = 1;
-									n = 59;
-									break;
-								}
-							}
-							f[73] = t;
-							t = 0;
-							n = 28;
-						} else {
-							a = t;
-							e = 115;
-							t = 0;
-							n = 59;
-						}
-					} else {
-						f[73] = t + 2;
-						switch ((w(1) | 0) << 16 >> 16) {
-							case 109:
-								e = f[73] | 0;
-								if (I(e + 2 | 0, 50, 6) | 0) break e;
-								a = f[70] | 0;
-								if (!(G(a) | 0) ? (s[a >> 1] | 0) == 46 : 0) break e;
-								d(b, b, e + 8 | 0, 2);
-								break e;
-							case 115:
-								e = f[73] | 0;
-								if (I(e + 2 | 0, 56, 10) | 0) break e;
-								a = f[70] | 0;
-								if (!(G(a) | 0) ? (s[a >> 1] | 0) == 46 : 0) break e;
-								f[73] = e + 12;
-								e = w(1) | 0;
-								t = 1;
-								n = 28;
-								break e;
-							case 100:
-								e = f[73] | 0;
-								if (I(e + 2 | 0, 66, 8) | 0) break e;
-								a = f[70] | 0;
-								if (!(G(a) | 0) ? (s[a >> 1] | 0) == 46 : 0) break e;
-								f[73] = e + 10;
-								e = w(1) | 0;
-								t = 2;
-								n = 28;
-								break e;
-							default: break e;
-						}
-					}
-				while (0);
-				e: do
-					if ((n | 0) == 28) {
-						if (e << 16 >> 16 == 40) {
-							r = f[71] | 0;
-							a = s[402] | 0;
-							c = a & 65535;
-							f[r + (c << 3) >> 2] = 5;
-							e = f[73] | 0;
-							s[402] = a + 1 << 16 >> 16;
-							f[r + (c << 3) + 4 >> 2] = e;
-							if ((s[f[70] >> 1] | 0) == 46) break;
-							f[73] = e + 2;
-							a = w(1) | 0;
-							d(b, f[73] | 0, 0, e);
-							if (!t) e = f[63] | 0;
-							else {
-								e = f[63] | 0;
-								f[e + 28 >> 2] = (t | 0) == 1 ? 5 : 7;
-							}
-							c = f[72] | 0;
-							b = s[401] | 0;
-							s[401] = b + 1 << 16 >> 16;
-							f[c + ((b & 65535) << 2) >> 2] = e;
-							switch (a << 16 >> 16) {
-								case 39:
-									v(39);
-									break;
-								case 34:
-									v(34);
-									break;
-								default:
-									f[73] = (f[73] | 0) + -2;
-									break e;
-							}
-							e = (f[73] | 0) + 2 | 0;
-							f[73] = e;
-							switch ((w(1) | 0) << 16 >> 16) {
-								case 44:
-									f[73] = (f[73] | 0) + 2;
-									w(1) | 0;
-									c = f[63] | 0;
-									f[c + 4 >> 2] = e;
-									b = f[73] | 0;
-									f[c + 16 >> 2] = b;
-									i[c + 24 >> 0] = 1;
-									f[73] = b + -2;
-									break e;
-								case 41:
-									s[402] = (s[402] | 0) + -1 << 16 >> 16;
-									b = f[63] | 0;
-									f[b + 4 >> 2] = e;
-									f[b + 12 >> 2] = (f[73] | 0) + 2;
-									i[b + 24 >> 0] = 1;
-									s[401] = (s[401] | 0) + -1 << 16 >> 16;
-									break e;
-								default:
-									f[73] = (f[73] | 0) + -2;
-									break e;
-							}
-						}
-						if (!((t | 0) == 0 & e << 16 >> 16 == 123)) {
-							switch (e << 16 >> 16) {
-								case 42:
-								case 39:
-								case 34:
-									n = 61;
-									break e;
-								default:
-							}
-							a = f[73] | 0;
-							n = 59;
-							break;
-						}
-						e = f[73] | 0;
-						if (s[402] | 0) {
-							f[73] = e + -2;
-							break;
-						}
-						while (1) {
-							if (e >>> 0 >= (f[74] | 0) >>> 0) break;
-							e = w(1) | 0;
-							if (!(Y(e) | 0)) {
-								if (e << 16 >> 16 == 125) {
-									n = 49;
-									break;
-								}
-							} else v(e);
-							e = (f[73] | 0) + 2 | 0;
-							f[73] = e;
-						}
-						if ((n | 0) == 49) f[73] = (f[73] | 0) + 2;
-						c = (w(1) | 0) << 16 >> 16 == 102;
-						e = f[73] | 0;
-						if (c ? I(e + 2 | 0, 74, 6) | 0 : 0) {
-							W();
-							break;
-						}
-						f[73] = e + 8;
-						e = w(1) | 0;
-						if (Y(e) | 0) {
-							l(b, e, 0);
-							break;
-						} else {
-							W();
-							break;
-						}
-					}
-				while (0);
-				if ((n | 0) == 59) if ((a | 0) == (c | 0)) f[73] = b + 10;
-				else n = 61;
-				do
-					if ((n | 0) == 61) {
-						if (!((e << 16 >> 16 == 42 | (t | 0) != 2) & (s[402] | 0) == 0)) {
-							f[73] = (f[73] | 0) + -2;
-							break;
-						}
-						e = f[74] | 0;
-						a = f[73] | 0;
-						while (1) {
-							if (a >>> 0 >= e >>> 0) {
-								n = 68;
-								break;
-							}
-							r = s[a >> 1] | 0;
-							if (Y(r) | 0) {
-								n = 66;
-								break;
-							}
-							n = a + 2 | 0;
-							f[73] = n;
-							a = n;
-						}
-						if ((n | 0) == 66) {
-							l(b, r, t);
-							break;
-						} else if ((n | 0) == 68) {
-							W();
-							break;
-						}
-					}
-				while (0);
-			}
-			function l(e, a, r) {
-				e = e | 0;
-				a = a | 0;
-				r = r | 0;
-				var i = 0, t = 0, c = 0, n = 0, b = 0;
-				i = (f[73] | 0) + 2 | 0;
-				switch (a << 16 >> 16) {
-					case 39:
-						v(39);
-						t = 5;
-						break;
-					case 34:
-						v(34);
-						t = 5;
-						break;
-					default: W();
-				}
-				do
-					if ((t | 0) == 5) {
-						d(e, i, f[73] | 0, 1);
-						if ((r | 0) > 0) f[(f[63] | 0) + 28 >> 2] = (r | 0) == 1 ? 4 : 6;
-						f[73] = (f[73] | 0) + 2;
-						n = (w(0) | 0) << 16 >> 16 == 119;
-						c = f[73] | 0;
-						if (((n ? (s[c + 2 >> 1] | 0) == 105 : 0) ? (s[c + 4 >> 1] | 0) == 116 : 0) ? (s[c + 6 >> 1] | 0) == 104 : 0) {
-							f[73] = c + 8;
-							if ((w(1) | 0) << 16 >> 16 != 123) {
-								f[73] = c;
-								break;
-							}
-							n = f[73] | 0;
-							i = n;
-							t = 0;
-							e: while (1) {
-								f[73] = i + 2;
-								i = w(1) | 0;
-								do
-									if (i << 16 >> 16 != 39) {
-										a = f[73] | 0;
-										if (i << 16 >> 16 == 34) {
-											v(34);
-											e = (f[73] | 0) + 2 | 0;
-											f[73] = e;
-											i = w(1) | 0;
-											break;
-										} else {
-											i = q(i) | 0;
-											e = f[73] | 0;
-											break;
-										}
-									} else {
-										a = f[73] | 0;
-										v(39);
-										e = (f[73] | 0) + 2 | 0;
-										f[73] = e;
-										i = w(1) | 0;
-									}
-								while (0);
-								if (i << 16 >> 16 != 58) {
-									t = 21;
-									break;
-								}
-								f[73] = (f[73] | 0) + 2;
-								switch ((w(1) | 0) << 16 >> 16) {
-									case 39:
-										i = f[73] | 0;
-										v(39);
-										break;
-									case 34:
-										i = f[73] | 0;
-										v(34);
-										break;
-									default:
-										t = 25;
-										break e;
-								}
-								b = (f[73] | 0) + 2 | 0;
-								r = f[67] | 0;
-								f[67] = r + 20;
-								f[r >> 2] = a;
-								f[r + 4 >> 2] = e;
-								f[r + 8 >> 2] = i;
-								f[r + 12 >> 2] = b;
-								f[r + 16 >> 2] = 0;
-								f[((t | 0) == 0 ? (f[63] | 0) + 32 | 0 : t + 16 | 0) >> 2] = r;
-								f[73] = (f[73] | 0) + 2;
-								switch ((w(1) | 0) << 16 >> 16) {
-									case 125:
-										t = 29;
-										break e;
-									case 44: break;
-									default:
-										t = 27;
-										break e;
-								}
-								i = (f[73] | 0) + 2 | 0;
-								f[73] = i;
-								t = r;
-							}
-							if ((t | 0) == 21) {
-								f[73] = c;
-								break;
-							} else if ((t | 0) == 25) {
-								f[73] = c;
-								break;
-							} else if ((t | 0) == 27) {
-								f[73] = c;
-								break;
-							} else if ((t | 0) == 29) {
-								b = f[63] | 0;
-								f[b + 16 >> 2] = n;
-								f[b + 12 >> 2] = (f[73] | 0) + 2;
-								break;
-							}
-						}
-						f[73] = c + -2;
-					}
-				while (0);
-			}
-			function o(e) {
-				e = e | 0;
-				e: do
-					switch (s[e >> 1] | 0) {
-						case 100: switch (s[e + -2 >> 1] | 0) {
-							case 105:
-								e = T(e + -4 | 0, 102, 2) | 0;
-								break e;
-							case 108:
-								e = T(e + -4 | 0, 106, 3) | 0;
-								break e;
-							default:
-								e = 0;
-								break e;
-						}
-						case 101: switch (s[e + -2 >> 1] | 0) {
-							case 115: switch (s[e + -4 >> 1] | 0) {
-								case 108:
-									e = B(e + -6 | 0, 101) | 0;
-									break e;
-								case 97:
-									e = B(e + -6 | 0, 99) | 0;
-									break e;
-								default:
-									e = 0;
-									break e;
-							}
-							case 116:
-								e = T(e + -4 | 0, 112, 4) | 0;
-								break e;
-							case 117:
-								e = T(e + -4 | 0, 120, 6) | 0;
-								break e;
-							default:
-								e = 0;
-								break e;
-						}
-						case 102:
-							if ((s[e + -2 >> 1] | 0) == 111 ? (s[e + -4 >> 1] | 0) == 101 : 0) switch (s[e + -6 >> 1] | 0) {
-								case 99:
-									e = T(e + -8 | 0, 132, 6) | 0;
-									break e;
-								case 112:
-									e = T(e + -8 | 0, 144, 2) | 0;
-									break e;
-								default:
-									e = 0;
-									break e;
-							}
-							else e = 0;
-							break;
-						case 107:
-							e = T(e + -2 | 0, 148, 4) | 0;
-							break;
-						case 110:
-							e = e + -2 | 0;
-							if (B(e, 105) | 0) e = 1;
-							else e = T(e, 156, 5) | 0;
-							break;
-						case 111:
-							e = B(e + -2 | 0, 100) | 0;
-							break;
-						case 114:
-							e = T(e + -2 | 0, 166, 7) | 0;
-							break;
-						case 116:
-							e = T(e + -2 | 0, 180, 4) | 0;
-							break;
-						case 119: switch (s[e + -2 >> 1] | 0) {
-							case 101:
-								e = B(e + -4 | 0, 110) | 0;
-								break e;
-							case 111:
-								e = T(e + -4 | 0, 188, 3) | 0;
-								break e;
-							default:
-								e = 0;
-								break e;
-						}
-						default: e = 0;
-					}
-				while (0);
-				return e | 0;
-			}
-			function h() {
-				var e = 0, a = 0, r = 0, i = 0;
-				a = f[74] | 0;
-				r = f[73] | 0;
-				e: while (1) {
-					e = r + 2 | 0;
-					if (r >>> 0 >= a >>> 0) {
-						a = 10;
-						break;
-					}
-					switch (s[e >> 1] | 0) {
-						case 96:
-							a = 7;
-							break e;
-						case 36:
-							if ((s[r + 4 >> 1] | 0) == 123) {
-								a = 6;
-								break e;
-							}
-							break;
-						case 92:
-							e = r + 4 | 0;
-							break;
-						default:
-					}
-					r = e;
-				}
-				if ((a | 0) == 6) {
-					e = r + 4 | 0;
-					f[73] = e;
-					a = f[71] | 0;
-					i = s[402] | 0;
-					r = i & 65535;
-					f[a + (r << 3) >> 2] = 4;
-					s[402] = i + 1 << 16 >> 16;
-					f[a + (r << 3) + 4 >> 2] = e;
-				} else if ((a | 0) == 7) {
-					f[73] = e;
-					r = f[71] | 0;
-					i = (s[402] | 0) + -1 << 16 >> 16;
-					s[402] = i;
-					if ((f[r + ((i & 65535) << 3) >> 2] | 0) != 3) W();
-				} else if ((a | 0) == 10) {
-					f[73] = e;
-					W();
-				}
-			}
-			function w(e) {
-				e = e | 0;
-				var a = 0, r = 0, i = 0;
-				r = f[73] | 0;
-				e: do {
-					a = s[r >> 1] | 0;
-					a: do
-						if (a << 16 >> 16 != 47) if (e) if (X(a) | 0) break;
-						else break e;
-						else if (F(a) | 0) break;
-						else break e;
-						else switch (s[r + 2 >> 1] | 0) {
-							case 47:
-								P();
-								break a;
-							case 42:
-								m(e);
-								break a;
-							default:
-								a = 47;
-								break e;
-						}
-					while (0);
-					i = f[73] | 0;
-					r = i + 2 | 0;
-					f[73] = r;
-				} while (i >>> 0 < (f[74] | 0) >>> 0);
-				return a | 0;
-			}
-			function d(e, a, r, s) {
-				e = e | 0;
-				a = a | 0;
-				r = r | 0;
-				s = s | 0;
-				var t = 0, c = 0;
-				c = f[67] | 0;
-				f[67] = c + 40;
-				t = f[63] | 0;
-				f[((t | 0) == 0 ? 236 : t + 36 | 0) >> 2] = c;
-				f[64] = t;
-				f[63] = c;
-				f[c + 8 >> 2] = e;
-				if (2 == (s | 0)) {
-					e = 3;
-					t = r;
-				} else {
-					t = 1 == (s | 0);
-					e = t ? 1 : 2;
-					t = t ? r + 2 | 0 : 0;
-				}
-				f[c + 12 >> 2] = t;
-				f[c + 28 >> 2] = e;
-				f[c >> 2] = a;
-				f[c + 4 >> 2] = r;
-				f[c + 16 >> 2] = 0;
-				f[c + 20 >> 2] = s;
-				a = 1 == (s | 0);
-				i[c + 24 >> 0] = a & 1;
-				f[c + 32 >> 2] = 0;
-				f[c + 36 >> 2] = 0;
-				if (a | 2 == (s | 0)) i[807] = 1;
-			}
-			function v(e) {
-				e = e | 0;
-				var a = 0, r = 0, i = 0, t = 0;
-				t = f[74] | 0;
-				a = f[73] | 0;
-				while (1) {
-					i = a + 2 | 0;
-					if (a >>> 0 >= t >>> 0) {
-						a = 9;
-						break;
-					}
-					r = s[i >> 1] | 0;
-					if (r << 16 >> 16 == e << 16 >> 16) {
-						a = 10;
-						break;
-					}
-					if (r << 16 >> 16 == 92) {
-						r = a + 4 | 0;
-						if ((s[r >> 1] | 0) == 13) {
-							a = a + 6 | 0;
-							a = (s[a >> 1] | 0) == 10 ? a : r;
-						} else a = r;
-					} else if (ie(r) | 0) {
-						a = 9;
-						break;
-					} else a = i;
-				}
-				if ((a | 0) == 9) {
-					f[73] = i;
-					W();
-				} else if ((a | 0) == 10) f[73] = i;
-			}
-			function A(e) {
-				e = e | 0;
-				var a = 0, r = 0;
-				a = s[e >> 1] | 0;
-				if (X(a) | 0) r = 3;
-				else switch (a << 16 >> 16) {
-					case 41:
-					case 125:
-					case 93:
-						r = 3;
-						break;
-					default: e = 0;
-				}
-				e: do
-					if ((r | 0) == 3) {
-						r = f[3] | 0;
-						while (1) {
-							if (e >>> 0 <= r >>> 0) break;
-							e = e + -2 | 0;
-							if (!(X(a) | 0)) break;
-							a = s[e >> 1] | 0;
-						}
-						switch (a << 16 >> 16) {
-							case 41:
-							case 125:
-							case 93:
-								e = 1;
-								break e;
-							default:
-						}
-						e = (U(a) | 0) ^ 1;
-					}
-				while (0);
-				return e | 0;
-			}
-			function C(e, a) {
-				e = e | 0;
-				a = a | 0;
-				var r = 0, i = 0, t = 0, c = 0;
-				r = f[73] | 0;
-				i = s[r >> 1] | 0;
-				c = (e | 0) == (a | 0);
-				t = c ? 0 : e;
-				c = c ? 0 : a;
-				if (i << 16 >> 16 == 97) {
-					f[73] = r + 4;
-					r = w(1) | 0;
-					e = f[73] | 0;
-					if (Y(r) | 0) {
-						v(r);
-						a = (f[73] | 0) + 2 | 0;
-						f[73] = a;
-					} else {
-						q(r) | 0;
-						a = f[73] | 0;
-					}
-					i = w(1) | 0;
-					r = f[73] | 0;
-				}
-				if ((r | 0) != (e | 0)) $(e, a, t, c);
-				return i | 0;
-			}
-			function g() {
-				var e = 0, a = 0, r = 0;
-				r = f[74] | 0;
-				a = f[73] | 0;
-				e: while (1) {
-					e = a + 2 | 0;
-					if (a >>> 0 >= r >>> 0) {
-						a = 6;
-						break;
-					}
-					switch (s[e >> 1] | 0) {
-						case 13:
-						case 10:
-							a = 6;
-							break e;
-						case 93:
-							a = 7;
-							break e;
-						case 92:
-							e = a + 4 | 0;
-							break;
-						default:
-					}
-					a = e;
-				}
-				if ((a | 0) == 6) {
-					f[73] = e;
-					W();
-					e = 0;
-				} else if ((a | 0) == 7) {
-					f[73] = e;
-					e = 93;
-				}
-				return e | 0;
-			}
-			function p() {
-				var e = 0, a = 0, r = 0;
-				e: while (1) {
-					e = f[73] | 0;
-					a = e + 2 | 0;
-					f[73] = a;
-					if (e >>> 0 >= (f[74] | 0) >>> 0) {
-						r = 7;
-						break;
-					}
-					switch (s[a >> 1] | 0) {
-						case 13:
-						case 10:
-							r = 7;
-							break e;
-						case 47: break e;
-						case 91:
-							g() | 0;
-							break;
-						case 92:
-							f[73] = e + 4;
-							break;
-						default:
-					}
-				}
-				if ((r | 0) == 7) W();
-			}
-			function y(e) {
-				e = e | 0;
-				switch (s[e >> 1] | 0) {
-					case 62:
-						e = (s[e + -2 >> 1] | 0) == 61;
-						break;
-					case 41:
-					case 59:
-						e = 1;
-						break;
-					case 104:
-						e = T(e + -2 | 0, 208, 4) | 0;
-						break;
-					case 121:
-						e = T(e + -2 | 0, 216, 6) | 0;
-						break;
-					case 101:
-						e = T(e + -2 | 0, 228, 3) | 0;
-						break;
-					default: e = 0;
-				}
-				return e | 0;
-			}
-			function m(e) {
-				e = e | 0;
-				var a = 0, r = 0, i = 0, t = 0, c = 0;
-				t = (f[73] | 0) + 2 | 0;
-				f[73] = t;
-				r = f[74] | 0;
-				while (1) {
-					a = t + 2 | 0;
-					if (t >>> 0 >= r >>> 0) break;
-					i = s[a >> 1] | 0;
-					if (!e ? ie(i) | 0 : 0) break;
-					if (i << 16 >> 16 == 42 ? (s[t + 4 >> 1] | 0) == 47 : 0) {
-						c = 8;
-						break;
-					}
-					t = a;
-				}
-				if ((c | 0) == 8) {
-					f[73] = a;
-					a = t + 4 | 0;
-				}
-				f[73] = a;
-			}
-			function I(e, a, r) {
-				e = e | 0;
-				a = a | 0;
-				r = r | 0;
-				var s = 0, f = 0;
-				e: do
-					if (!r) e = 0;
-					else {
-						while (1) {
-							s = i[e >> 0] | 0;
-							f = i[a >> 0] | 0;
-							if (s << 24 >> 24 != f << 24 >> 24) break;
-							r = r + -1 | 0;
-							if (!r) {
-								e = 0;
-								break e;
-							} else {
-								e = e + 1 | 0;
-								a = a + 1 | 0;
-							}
-						}
-						e = (s & 255) - (f & 255) | 0;
-					}
-				while (0);
-				return e | 0;
-			}
-			function U(e) {
-				e = e | 0;
-				e: do
-					switch (e << 16 >> 16) {
-						case 38:
-						case 37:
-						case 33:
-							e = 1;
-							break;
-						default: if ((e & -8) << 16 >> 16 == 40 | (e + -58 & 65535) < 6) e = 1;
-						else {
-							switch (e << 16 >> 16) {
-								case 91:
-								case 93:
-								case 94:
-									e = 1;
-									break e;
-								default:
-							}
-							e = (e + -123 & 65535) < 4;
-						}
-					}
-				while (0);
-				return e | 0;
-			}
-			function x(e) {
-				e = e | 0;
-				e: do
-					switch (e << 16 >> 16) {
-						case 38:
-						case 37:
-						case 33: break;
-						default: if (!((e + -58 & 65535) < 6 | (e + -40 & 65535) < 7 & e << 16 >> 16 != 41)) {
-							switch (e << 16 >> 16) {
-								case 91:
-								case 94: break e;
-								default:
-							}
-							return e << 16 >> 16 != 125 & (e + -123 & 65535) < 4 | 0;
-						}
-					}
-				while (0);
-				return 1;
-			}
-			function S(e) {
-				e = e | 0;
-				var a = 0;
-				a = s[e >> 1] | 0;
-				e: do
-					if ((a + -9 & 65535) >= 5) {
-						switch (a << 16 >> 16) {
-							case 160:
-							case 32:
-								a = 1;
-								break e;
-							default:
-						}
-						if (U(a) | 0) return a << 16 >> 16 != 46 | (G(e) | 0) | 0;
-						else a = 0;
-					} else a = 1;
-				while (0);
-				return a | 0;
-			}
-			function O(e) {
-				e = e | 0;
-				var a = 0, r = 0, i = 0, t = 0;
-				r = n;
-				n = n + 16 | 0;
-				i = r;
-				f[i >> 2] = 0;
-				f[66] = e;
-				a = f[3] | 0;
-				t = a + (e << 1) | 0;
-				e = t + 2 | 0;
-				s[t >> 1] = 0;
-				f[i >> 2] = e;
-				f[67] = e;
-				f[59] = 0;
-				f[63] = 0;
-				f[61] = 0;
-				f[60] = 0;
-				f[65] = 0;
-				f[62] = 0;
-				n = r;
-				return a | 0;
-			}
-			function $(e, a, r, s) {
-				e = e | 0;
-				a = a | 0;
-				r = r | 0;
-				s = s | 0;
-				var t = 0, c = 0;
-				t = f[67] | 0;
-				f[67] = t + 20;
-				c = f[65] | 0;
-				f[((c | 0) == 0 ? 240 : c + 16 | 0) >> 2] = t;
-				f[65] = t;
-				f[t >> 2] = e;
-				f[t + 4 >> 2] = a;
-				f[t + 8 >> 2] = r;
-				f[t + 12 >> 2] = s;
-				f[t + 16 >> 2] = 0;
-				i[807] = 1;
-			}
-			function T(e, a, r) {
-				e = e | 0;
-				a = a | 0;
-				r = r | 0;
-				var i = 0, s = 0;
-				i = e + (0 - r << 1) | 0;
-				s = i + 2 | 0;
-				e = f[3] | 0;
-				if (s >>> 0 >= e >>> 0 ? (I(s, a, r << 1) | 0) == 0 : 0) if ((s | 0) == (e | 0)) e = 1;
-				else e = S(i) | 0;
-				else e = 0;
-				return e | 0;
-			}
-			function j(e) {
-				e = e | 0;
-				switch (s[e >> 1] | 0) {
-					case 107:
-						e = T(e + -2 | 0, 148, 4) | 0;
-						break;
-					case 101:
-						if ((s[e + -2 >> 1] | 0) == 117) e = T(e + -4 | 0, 120, 6) | 0;
-						else e = 0;
-						break;
-					default: e = 0;
-				}
-				return e | 0;
-			}
-			function B(e, a) {
-				e = e | 0;
-				a = a | 0;
-				var r = 0;
-				r = f[3] | 0;
-				if (r >>> 0 <= e >>> 0 ? (s[e >> 1] | 0) == a << 16 >> 16 : 0) if ((r | 0) == (e | 0)) r = 1;
-				else r = E(s[e + -2 >> 1] | 0) | 0;
-				else r = 0;
-				return r | 0;
-			}
-			function E(e) {
-				e = e | 0;
-				e: do
-					if ((e + -9 & 65535) < 5) e = 1;
-					else {
-						switch (e << 16 >> 16) {
-							case 32:
-							case 160:
-								e = 1;
-								break e;
-							default:
-						}
-						e = e << 16 >> 16 != 46 & (U(e) | 0);
-					}
-				while (0);
-				return e | 0;
-			}
-			function P() {
-				var e = 0, a = 0, r = 0;
-				e = f[74] | 0;
-				r = f[73] | 0;
-				e: while (1) {
-					a = r + 2 | 0;
-					if (r >>> 0 >= e >>> 0) break;
-					switch (s[a >> 1] | 0) {
-						case 13:
-						case 10: break e;
-						default: r = a;
-					}
-				}
-				f[73] = a;
-			}
-			function q(e) {
-				e = e | 0;
-				while (1) {
-					if (X(e) | 0) break;
-					if (U(e) | 0) break;
-					e = (f[73] | 0) + 2 | 0;
-					f[73] = e;
-					e = s[e >> 1] | 0;
-					if (!(e << 16 >> 16)) {
-						e = 0;
-						break;
-					}
-				}
-				return e | 0;
-			}
-			function z() {
-				var e = 0;
-				e = f[(f[61] | 0) + 20 >> 2] | 0;
-				switch (e | 0) {
-					case 1:
-						e = -1;
-						break;
-					case 2:
-						e = -2;
-						break;
-					default: e = e - (f[3] | 0) >> 1;
-				}
-				return e | 0;
-			}
-			function D(e) {
-				e = e | 0;
-				if (!(T(e, 194, 5) | 0) ? !(T(e, 44, 3) | 0) : 0) e = T(e, 204, 2) | 0;
-				else e = 1;
-				return e | 0;
-			}
-			function F(e) {
-				e = e | 0;
-				switch (e << 16 >> 16) {
-					case 160:
-					case 32:
-					case 12:
-					case 11:
-					case 9:
-						e = 1;
-						break;
-					default: e = 0;
-				}
-				return e | 0;
-			}
-			function G(e) {
-				e = e | 0;
-				if ((s[e >> 1] | 0) == 46 ? (s[e + -2 >> 1] | 0) == 46 : 0) e = (s[e + -4 >> 1] | 0) == 46;
-				else e = 0;
-				return e | 0;
-			}
-			function H() {
-				var e = 0;
-				e = f[69] | 0;
-				e = f[((e | 0) == 0 ? (f[61] | 0) + 32 | 0 : e + 16 | 0) >> 2] | 0;
-				f[69] = e;
-				return (e | 0) != 0 | 0;
-			}
-			function J(e) {
-				e = e | 0;
-				if ((f[3] | 0) == (e | 0)) e = 1;
-				else e = S(e + -2 | 0) | 0;
-				return e | 0;
-			}
-			function K() {
-				var e = 0;
-				e = f[(f[62] | 0) + 12 >> 2] | 0;
-				if (!e) e = -1;
-				else e = e - (f[3] | 0) >> 1;
-				return e | 0;
-			}
-			function L() {
-				var e = 0;
-				e = f[(f[61] | 0) + 12 >> 2] | 0;
-				if (!e) e = -1;
-				else e = e - (f[3] | 0) >> 1;
-				return e | 0;
-			}
-			function M() {
-				var e = 0;
-				e = f[(f[62] | 0) + 8 >> 2] | 0;
-				if (!e) e = -1;
-				else e = e - (f[3] | 0) >> 1;
-				return e | 0;
-			}
-			function N() {
-				var e = 0;
-				e = f[(f[61] | 0) + 16 >> 2] | 0;
-				if (!e) e = -1;
-				else e = e - (f[3] | 0) >> 1;
-				return e | 0;
-			}
-			function Q() {
-				var e = 0;
-				e = f[(f[61] | 0) + 4 >> 2] | 0;
-				if (!e) e = -1;
-				else e = e - (f[3] | 0) >> 1;
-				return e | 0;
-			}
-			function R() {
-				var e = 0;
-				e = f[61] | 0;
-				e = f[((e | 0) == 0 ? 236 : e + 36 | 0) >> 2] | 0;
-				f[61] = e;
-				return (e | 0) != 0 | 0;
-			}
-			function V() {
-				var e = 0;
-				e = f[62] | 0;
-				e = f[((e | 0) == 0 ? 240 : e + 16 | 0) >> 2] | 0;
-				f[62] = e;
-				return (e | 0) != 0 | 0;
-			}
-			function W() {
-				i[806] = 1;
-				f[68] = (f[73] | 0) - (f[3] | 0) >> 1;
-				f[73] = (f[74] | 0) + 2;
-			}
-			function X(e) {
-				e = e | 0;
-				return (e | 128) << 16 >> 16 == 160 | (e + -9 & 65535) < 5 | 0;
-			}
-			function Y(e) {
-				e = e | 0;
-				return e << 16 >> 16 == 39 | e << 16 >> 16 == 34 | 0;
-			}
-			function Z() {
-				return (f[(f[69] | 0) + 12 >> 2] | 0) - (f[3] | 0) >> 1 | 0;
-			}
-			function _() {
-				return (f[(f[69] | 0) + 8 >> 2] | 0) - (f[3] | 0) >> 1 | 0;
-			}
-			function ee() {
-				return (f[(f[69] | 0) + 4 >> 2] | 0) - (f[3] | 0) >> 1 | 0;
-			}
-			function ae() {
-				return (f[(f[61] | 0) + 8 >> 2] | 0) - (f[3] | 0) >> 1 | 0;
-			}
-			function re() {
-				return (f[(f[62] | 0) + 4 >> 2] | 0) - (f[3] | 0) >> 1 | 0;
-			}
-			function ie(e) {
-				e = e | 0;
-				return e << 16 >> 16 == 13 | e << 16 >> 16 == 10 | 0;
-			}
-			function se() {
-				return (f[f[69] >> 2] | 0) - (f[3] | 0) >> 1 | 0;
-			}
-			function fe() {
-				return (f[f[61] >> 2] | 0) - (f[3] | 0) >> 1 | 0;
-			}
-			function te() {
-				return (f[f[62] >> 2] | 0) - (f[3] | 0) >> 1 | 0;
-			}
-			function ce() {
-				return t[(f[61] | 0) + 24 >> 0] | 0;
-			}
-			function ne(e) {
-				e = e | 0;
-				f[3] = e;
-			}
-			function be() {
-				return f[(f[61] | 0) + 28 >> 2] | 0;
-			}
-			function ke() {
-				return (i[807] | 0) != 0 | 0;
-			}
-			function ue() {
-				return (i[808] | 0) != 0 | 0;
-			}
-			function le() {
-				f[69] = 0;
-			}
-			function oe() {
-				return f[68] | 0;
-			}
-			function he(e) {
-				e = e | 0;
-				n = e + 992 + 15 & -16;
-				return 992;
-			}
-			return {
-				su: he,
-				ai: N,
-				ake: ee,
-				aks: se,
-				ave: Z,
-				avs: _,
-				e: oe,
-				ee: re,
-				ele: K,
-				els: M,
-				es: te,
-				f: ue,
-				id: z,
-				ie: Q,
-				ip: ce,
-				is: fe,
-				it: be,
-				ms: ke,
-				p: b,
-				ra: H,
-				re: V,
-				ri: R,
-				rsa: le,
-				sa: O,
-				se: L,
-				ses: ne,
-				ss: ae
-			};
-		}("undefined" != typeof globalThis ? globalThis : self, {}, a), r = e.su(i - (2 << 17));
-	}
-	const h = t.length + 1;
-	e.ses(r), e.sa(h - 1), s(t, new Uint16Array(a, r, h)), e.p() || (n = e.e(), o());
-	const w = [], d = [];
-	for (; e.ri();) {
-		const a = e.is(), r = e.ie(), i = e.ai(), s = e.id(), f = e.ss(), c = e.se(), n = e.it();
-		let k;
-		e.ip() && (k = b(-1 === s ? a : a + 1, t.charCodeAt(-1 === s ? a - 1 : a)));
-		const u = [];
-		for (e.rsa(); e.ra();) {
-			const a = e.aks(), r = e.ake(), i = e.avs(), s = e.ave(), f = v(a, r), t = v(i, s);
-			u.push([f, t]);
-		}
-		w.push({
-			t: n,
-			n: k,
-			s: a,
-			e: r,
-			ss: f,
-			se: c,
-			d: s,
-			a: i,
-			at: u.length > 0 ? u : null
-		});
-	}
-	for (; e.re();) {
-		const a = e.es(), r = e.ee(), i = e.els(), s = e.ele(), f = v(a, r), t = i < 0 ? void 0 : v(i, s);
-		d.push({
-			s: a,
-			e: r,
-			ls: i,
-			le: s,
-			n: f,
-			ln: t
-		});
-	}
-	return [
-		w,
-		d,
-		!!e.f(),
-		!!e.ms()
-	];
-	function v(e, a) {
-		const r = t.charCodeAt(e);
-		return 34 === r || 39 === r ? b(e + 1, r) : t.slice(e, a);
-	}
-}
-function b(e, a) {
-	n = e;
-	let r = "", i = n;
-	for (;;) {
-		n >= t.length && o();
-		const e = t.charCodeAt(n);
-		if (e === a) break;
-		92 === e ? (r += t.slice(i, n), r += k(), i = n) : (8232 === e || 8233 === e || l(e) && o(), ++n);
-	}
-	return r += t.slice(i, n++), r;
-}
-function k() {
-	let e = t.charCodeAt(++n);
-	switch (++n, e) {
-		case 110: return "\n";
-		case 114: return "\r";
-		case 120: return String.fromCharCode(u(2));
-		case 117: return function() {
-			const e = t.charCodeAt(n);
-			let a;
-			123 === e ? (++n, a = u(t.indexOf("}", n) - n), ++n, a > 1114111 && o()) : a = u(4);
-			return a <= 65535 ? String.fromCharCode(a) : (a -= 65536, String.fromCharCode(55296 + (a >> 10), 56320 + (1023 & a)));
-		}();
-		case 116: return "	";
-		case 98: return "\b";
-		case 118: return "\v";
-		case 102: return "\f";
-		case 13: 10 === t.charCodeAt(n) && ++n;
-		case 10: return "";
-		case 56:
-		case 57: o();
-		default:
-			if (e >= 48 && e <= 55) {
-				let a = t.substr(n - 1, 3).match(/^[0-7]+/)[0], r = parseInt(a, 8);
-				return r > 255 && (a = a.slice(0, -1), r = parseInt(a, 8)), n += a.length - 1, e = t.charCodeAt(n), "0" === a && 56 !== e && 57 !== e || o(), String.fromCharCode(r);
-			}
-			return l(e) ? "" : String.fromCharCode(e);
-	}
-}
-function u(e) {
-	const a = n;
-	let r = 0, i = 0;
-	for (let a = 0; a < e; ++a, ++n) {
-		let e, s = t.charCodeAt(n);
-		if (95 !== s) {
-			if (s >= 97) e = s - 97 + 10;
-			else if (s >= 65) e = s - 65 + 10;
-			else {
-				if (!(s >= 48 && s <= 57)) break;
-				e = s - 48;
-			}
-			if (e >= 16) break;
-			i = s, r = 16 * r + e;
-		} else 95 !== i && 0 !== a || o(), i = s;
-	}
-	return 95 !== i && n - a === e || o(), r;
-}
-function l(e) {
-	return 13 === e || 10 === e;
-}
-function o() {
-	throw Object.assign(Error(`Parse error ${c}:${t.slice(0, n).split("\n").length}:${n - t.lastIndexOf("\n", n - 1)}`), { idx: n });
-}
-//#endregion
-//#region ../../node_modules/.pnpm/estree-walker@3.0.3/node_modules/estree-walker/src/walker.js
-/**
-* @typedef { import('estree').Node} Node
-* @typedef {{
-*   skip: () => void;
-*   remove: () => void;
-*   replace: (node: Node) => void;
-* }} WalkerContext
-*/
-var WalkerBase = class {
-	constructor() {
-		/** @type {boolean} */
-		this.should_skip = false;
-		/** @type {boolean} */
-		this.should_remove = false;
-		/** @type {Node | null} */
-		this.replacement = null;
-		/** @type {WalkerContext} */
-		this.context = {
-			skip: () => this.should_skip = true,
-			remove: () => this.should_remove = true,
-			replace: (node) => this.replacement = node
-		};
-	}
-	/**
-	* @template {Node} Parent
-	* @param {Parent | null | undefined} parent
-	* @param {keyof Parent | null | undefined} prop
-	* @param {number | null | undefined} index
-	* @param {Node} node
-	*/
-	replace(parent, prop, index, node) {
-		if (parent && prop) if (index != null)
- /** @type {Array<Node>} */ parent[prop][index] = node;
-		else
- /** @type {Node} */ parent[prop] = node;
-	}
-	/**
-	* @template {Node} Parent
-	* @param {Parent | null | undefined} parent
-	* @param {keyof Parent | null | undefined} prop
-	* @param {number | null | undefined} index
-	*/
-	remove(parent, prop, index) {
-		if (parent && prop) if (index !== null && index !== void 0)
- /** @type {Array<Node>} */ parent[prop].splice(index, 1);
-		else delete parent[prop];
-	}
-};
-//#endregion
-//#region ../../node_modules/.pnpm/estree-walker@3.0.3/node_modules/estree-walker/src/sync.js
-/**
-* @typedef { import('estree').Node} Node
-* @typedef { import('./walker.js').WalkerContext} WalkerContext
-* @typedef {(
-*    this: WalkerContext,
-*    node: Node,
-*    parent: Node | null,
-*    key: string | number | symbol | null | undefined,
-*    index: number | null | undefined
-* ) => void} SyncHandler
-*/
-var SyncWalker = class extends WalkerBase {
-	/**
-	*
-	* @param {SyncHandler} [enter]
-	* @param {SyncHandler} [leave]
-	*/
-	constructor(enter, leave) {
-		super();
-		/** @type {boolean} */
-		this.should_skip = false;
-		/** @type {boolean} */
-		this.should_remove = false;
-		/** @type {Node | null} */
-		this.replacement = null;
-		/** @type {WalkerContext} */
-		this.context = {
-			skip: () => this.should_skip = true,
-			remove: () => this.should_remove = true,
-			replace: (node) => this.replacement = node
-		};
-		/** @type {SyncHandler | undefined} */
-		this.enter = enter;
-		/** @type {SyncHandler | undefined} */
-		this.leave = leave;
-	}
-	/**
-	* @template {Node} Parent
-	* @param {Node} node
-	* @param {Parent | null} parent
-	* @param {keyof Parent} [prop]
-	* @param {number | null} [index]
-	* @returns {Node | null}
-	*/
-	visit(node, parent, prop, index) {
-		if (node) {
-			if (this.enter) {
-				const _should_skip = this.should_skip;
-				const _should_remove = this.should_remove;
-				const _replacement = this.replacement;
-				this.should_skip = false;
-				this.should_remove = false;
-				this.replacement = null;
-				this.enter.call(this.context, node, parent, prop, index);
-				if (this.replacement) {
-					node = this.replacement;
-					this.replace(parent, prop, index, node);
-				}
-				if (this.should_remove) this.remove(parent, prop, index);
-				const skipped = this.should_skip;
-				const removed = this.should_remove;
-				this.should_skip = _should_skip;
-				this.should_remove = _should_remove;
-				this.replacement = _replacement;
-				if (skipped) return node;
-				if (removed) return null;
-			}
-			/** @type {keyof Node} */
-			let key;
-			for (key in node) {
-				/** @type {unknown} */
-				const value = node[key];
-				if (value && typeof value === "object") {
-					if (Array.isArray(value)) {
-						const nodes = value;
-						for (let i = 0; i < nodes.length; i += 1) {
-							const item = nodes[i];
-							if (isNode(item)) {
-								if (!this.visit(item, node, key, i)) i--;
-							}
-						}
-					} else if (isNode(value)) this.visit(value, node, key, null);
-				}
-			}
-			if (this.leave) {
-				const _replacement = this.replacement;
-				const _should_remove = this.should_remove;
-				this.replacement = null;
-				this.should_remove = false;
-				this.leave.call(this.context, node, parent, prop, index);
-				if (this.replacement) {
-					node = this.replacement;
-					this.replace(parent, prop, index, node);
-				}
-				if (this.should_remove) this.remove(parent, prop, index);
-				const removed = this.should_remove;
-				this.replacement = _replacement;
-				this.should_remove = _should_remove;
-				if (removed) return null;
-			}
-		}
-		return node;
-	}
-};
-/**
-* Ducktype a node.
-*
-* @param {unknown} value
-* @returns {value is Node}
-*/
-function isNode(value) {
-	return value !== null && typeof value === "object" && "type" in value && typeof value.type === "string";
-}
-//#endregion
-//#region ../../node_modules/.pnpm/estree-walker@3.0.3/node_modules/estree-walker/src/index.js
-/**
-* @typedef {import('estree').Node} Node
-* @typedef {import('./sync.js').SyncHandler} SyncHandler
-* @typedef {import('./async.js').AsyncHandler} AsyncHandler
-*/
-/**
-* @param {Node} ast
-* @param {{
-*   enter?: SyncHandler
-*   leave?: SyncHandler
-* }} walker
-* @returns {Node | null}
-*/
-function walk(ast, { enter, leave }) {
-	return new SyncWalker(enter, leave).visit(ast, null);
-}
-//#endregion
-//#region src/shared/ast.ts
-function isIdentifier(node) {
-	return node?.type === "Identifier" && typeof node.name === "string";
-}
-function isLiteral(node) {
-	return node?.type === "Literal";
-}
-function isMemberExpression(node) {
-	return node?.type === "MemberExpression";
-}
-function isCallExpression(node) {
-	return node?.type === "CallExpression";
-}
-function isObjectExpression(node) {
-	return node?.type === "ObjectExpression";
-}
-//#endregion
-//#region src/inference/walk.ts
-const ENV_BINDING_RE = /\benv\s*\.\s*(DB|KV|STORAGE|QUEUE_\w+|AI|SANDBOX)\b/;
-/**
-* Infer which Cloudflare bindings a source file uses.
-*
-* Uses a tiered approach for performance:
-*   Tier 1: es-module-lexer to extract import sources (fast, asm.js, no init)
-*   Tier 2: Regex check for env.DB/KV/STORAGE patterns
-*   Tier 3: Full AST walk only when regex matches (to confirm member expressions)
-*/
-function inferBindingsFromSource(code, filename) {
-	const result = {
-		needsD1: false,
-		needsKV: false,
-		needsR2: false,
-		needsAuth: false,
-		needsQueues: false,
-		needsAI: false,
-		needsSandbox: false,
-		needsLive: false
-	};
-	try {
-		const [imports] = parse(code);
-		for (const imp of imports) {
-			const source = imp.n;
-			if (!source) continue;
-			switch (source) {
-				case "void/db":
-					result.needsD1 = true;
-					break;
-				case "void/kv":
-					result.needsKV = true;
-					break;
-				case "void/storage":
-					result.needsR2 = true;
-					break;
-				case "void/auth":
-					result.needsAuth = true;
-					break;
-				case "void/queue":
-					result.needsQueues = true;
-					break;
-				case "void/ai":
-					result.needsAI = true;
-					break;
-				case "void/sandbox":
-					result.needsSandbox = true;
-					break;
-				case "void/live":
-					if (!isTypeOnlyImportStatement(code.slice(imp.ss, imp.se + 1))) result.needsLive = true;
-					break;
-				case "void/client": {
-					const stmt = code.slice(imp.ss, imp.se + 1);
-					if (/\bauth\b/.test(stmt)) result.needsAuth = true;
-					break;
-				}
-			}
-		}
-	} catch {
-		if (/\bfrom\s+["']void\/db["']/.test(code)) result.needsD1 = true;
-		if (/\bfrom\s+["']void\/kv["']/.test(code)) result.needsKV = true;
-		if (/\bfrom\s+["']void\/storage["']/.test(code)) result.needsR2 = true;
-		if (/\bfrom\s+["']void\/auth["']/.test(code)) result.needsAuth = true;
-		if (/\bfrom\s+["']void\/queue["']/.test(code)) result.needsQueues = true;
-		if (/\bfrom\s+["']void\/ai["']/.test(code)) result.needsAI = true;
-		if (/\bfrom\s+["']void\/sandbox["']/.test(code)) result.needsSandbox = true;
-		if (hasRuntimeImportFrom(code, "void/live")) result.needsLive = true;
-		if (/\bfrom\s+["']void\/client["']/.test(code) && /\bauth\b/.test(code)) result.needsAuth = true;
-	}
-	if (result.needsD1 && result.needsKV && result.needsR2 && result.needsAI && result.needsSandbox && result.needsLive) return result;
-	if (!ENV_BINDING_RE.test(code)) return result;
-	let parsed;
-	try {
-		parsed = parseSync(filename, code);
-	} catch {
-		return result;
-	}
-	const program = parsed.program;
-	walk(program, { enter(node) {
-		const current = node;
-		if (!isMemberExpression(current)) return;
-		if (current.computed) return;
-		const property = current.property;
-		if (!isIdentifier(property)) return;
-		const obj = current.object;
-		const isViaContextEnv = isMemberExpression(obj) && isIdentifier(obj.property) && obj.property.name === "env";
-		const isDirectEnv = isIdentifier(obj) && obj.name === "env";
-		if (!isViaContextEnv && !isDirectEnv) return;
-		switch (property.name) {
-			case "DB":
-				result.needsD1 = true;
-				break;
-			case "KV":
-				result.needsKV = true;
-				break;
-			case "STORAGE":
-				result.needsR2 = true;
-				break;
-			case "AI":
-				result.needsAI = true;
-				break;
-			case "SANDBOX":
-				result.needsSandbox = true;
-				break;
-			default:
-				if (property.name.startsWith("QUEUE_")) result.needsQueues = true;
-				break;
-		}
-	} });
-	return result;
-}
-function isTypeOnlyImportStatement(statement) {
-	if (/^\s*import\s+type\b/.test(statement)) return true;
-	const specifierStart = statement.indexOf("{");
-	const specifierEnd = statement.lastIndexOf("}");
-	if (specifierStart === -1 || specifierEnd === -1 || specifierEnd < specifierStart) return false;
-	const beforeSpecifiers = statement.slice(0, specifierStart);
-	if (!/^\s*import\s*$/.test(beforeSpecifiers)) return false;
-	const specifiers = statement.slice(specifierStart + 1, specifierEnd).split(",").map((specifier) => specifier.trim()).filter(Boolean);
-	return specifiers.length > 0 && specifiers.every((specifier) => specifier.startsWith("type "));
-}
-function hasRuntimeImportFrom(code, source) {
-	const escapedSource = source.replaceAll("/", "\\/");
-	const importRe = new RegExp(`\\bimport\\s+(?:[\\s\\S]*?\\bfrom\\s+)?["']${escapedSource}["']\\s*;?`, "g");
-	for (const match of code.matchAll(importRe)) {
-		const statement = match[0];
-		if (!isTypeOnlyImportStatement(statement)) return true;
-	}
-	return false;
-}
-/**
-* Merge multiple InferredBindings into a single result (union).
-*/
-function mergeBindings(bindings) {
-	return {
-		needsD1: bindings.some((b) => b.needsD1),
-		needsKV: bindings.some((b) => b.needsKV),
-		needsR2: bindings.some((b) => b.needsR2),
-		needsAuth: bindings.some((b) => b.needsAuth),
-		needsQueues: bindings.some((b) => b.needsQueues),
-		needsAI: bindings.some((b) => b.needsAI),
-		needsSandbox: bindings.some((b) => b.needsSandbox),
-		needsLive: bindings.some((b) => b.needsLive)
-	};
-}
-//#endregion
-//#region src/ssr/entry.ts
-const SSR_SERVER_ENTRY_RELATIVE_PATHS = ["src/main.ssr.ts", "src/main.ssr.tsx"];
-const SSR_CLIENT_ENTRY_RELATIVE_PATHS = ["src/main.client.ts", "src/main.client.tsx"];
-function resolveSingleEntry(root, entries, label) {
-	const matches = entries.map((relativePath) => ({
-		relativePath,
-		absolutePath: join(root, relativePath)
-	})).filter((entry) => existsSync(entry.absolutePath));
-	if (matches.length === 0) return null;
-	if (matches.length > 1) {
-		const names = matches.map((entry) => entry.relativePath).join(", ");
-		throw new Error(`ssr: Multiple ${label} entry files found: ${names}. Keep only one.`);
-	}
-	return matches[0];
-}
-function getSsrServerEntryPath(root) {
-	return resolveSingleEntry(root, SSR_SERVER_ENTRY_RELATIVE_PATHS, "SSR")?.absolutePath ?? null;
-}
-function hasSsrEntry(root) {
-	return getSsrServerEntryPath(root) !== null;
-}
-function validateServerRenderExport(entry) {
-	const { absolutePath, relativePath } = entry;
-	const source = readFileSync(absolutePath, "utf-8");
-	if (/\bexport\s+(?:async\s+)?function\s+render\b/.test(source) || /\bexport\s+const\s+render\b/.test(source) || /\bexport\s+default\s+(?:defineRender\b|(?:async\s+)?function\b)/.test(source)) return;
-	let parsed;
-	try {
-		parsed = parseSync(relativePath, source);
-	} catch (err) {
-		throw new Error(`ssr: Invalid entry '${relativePath}'. Could not parse source: '${err instanceof Error ? err.message : String(err)}'.`);
-	}
-	if (!(parsed.program.body ?? []).some((node) => {
-		if (node.type === "ExportDefaultDeclaration") {
-			const declaration = node.declaration;
-			if (declaration?.type === "FunctionDeclaration" || declaration?.type === "FunctionExpression" || declaration?.type === "ArrowFunctionExpression") return true;
-			if (declaration?.type === "CallExpression") {
-				const call = declaration;
-				return isIdentifier(call.callee) && call.callee.name === "defineRender";
-			}
-			return false;
-		}
-		if (node.type !== "ExportNamedDeclaration") return false;
-		const declaration = node.declaration;
-		if (declaration?.type === "FunctionDeclaration") {
-			const fn = declaration;
-			return isIdentifier(fn.id) && fn.id.name === "render";
-		}
-		if (declaration?.type === "VariableDeclaration") return (declaration.declarations ?? []).some((decl) => isIdentifier(decl.id) && decl.id.name === "render");
-		return (node.specifiers ?? []).some((specifier) => {
-			const exported = specifier.exported;
-			return isIdentifier(exported) && exported.name === "render";
-		});
-	})) throw new Error(`ssr: Invalid entry '${relativePath}'. Export \`render(c, assetTags)\` or \`export default defineRender(...)\`.`);
-}
-/**
-* Validate SSR mode entry conventions.
-* Returns null when SSR mode is not used.
-*/
-function validateSsrEntries(root) {
-	const server = resolveSingleEntry(root, SSR_SERVER_ENTRY_RELATIVE_PATHS, "SSR");
-	const client = resolveSingleEntry(root, SSR_CLIENT_ENTRY_RELATIVE_PATHS, "SSR client");
-	if (!server && !client) return null;
-	if (server && !client) throw new Error(`ssr: Missing client entry. Add one of: ${SSR_CLIENT_ENTRY_RELATIVE_PATHS.join(", ")}.`);
-	if (!server && client) throw new Error(`ssr: Missing server entry. Add one of: ${SSR_SERVER_ENTRY_RELATIVE_PATHS.join(", ")}.`);
-	validateServerRenderExport(server);
-	return {
-		server,
-		client
-	};
-}
-function validateSsrEntry(root) {
-	return validateSsrEntries(root)?.server.absolutePath ?? null;
-}
-//#endregion
-//#region src/plugin-inference.ts
-const SOURCE_GLOB = "**/*.{ts,tsx,mts,js,jsx,mjs,astro}";
-/** Directories to scan for binding inference in framework mode. */
-const FRAMEWORK_SCAN_DIRS = [
-	"src",
-	"app",
-	"pages",
-	"routes",
-	"server",
-	"crons",
-	"queues"
-];
-/** Directories to scan for binding inference in Void app mode. */
-const DEFAULT_SCAN_DIRS = [
-	"routes",
-	"middleware",
-	"queues",
-	"pages",
-	"crons",
-	"src"
-];
-/**
-* Map from npm package name to framework identifier.
-* Only packages that unambiguously indicate framework mode are listed.
-* For example, `react-router` alone is a client-side router — only
-* `@react-router/dev` signals the framework (Vite plugin) mode.
-*/
-const FRAMEWORK_PACKAGES = {
-	"@tanstack/react-start": {
-		name: "tanstack-start",
-		class: "a"
-	},
-	"@react-router/dev": {
-		name: "react-router",
-		class: "a"
-	},
-	vinext: {
-		name: "vinext-pages",
-		class: "a"
-	},
-	"@sveltejs/kit": {
-		name: "sveltekit",
-		class: "b"
-	},
-	nuxt: {
-		name: "nuxt",
-		class: "c"
-	},
-	"@analogjs/platform": {
-		name: "analog",
-		class: "c"
-	},
-	astro: {
-		name: "astro",
-		class: "c"
-	}
-};
-/**
-* Detect a meta-framework by checking package.json dependencies.
-* Returns the detected framework with class info, or `undefined`.
-*/
-function detectFramework(root) {
-	let pkg;
-	try {
-		pkg = JSON.parse(readFileSync(join(root, "package.json"), "utf-8"));
-	} catch {
-		return;
-	}
-	const deps = {
-		...pkg.dependencies,
-		...pkg.devDependencies
-	};
-	for (const [pkgName, framework] of Object.entries(FRAMEWORK_PACKAGES)) if (pkgName in deps) {
-		if (framework.name === "vinext-pages" && existsSync(join(root, "app"))) return {
-			name: "vinext-app",
-			class: "a"
-		};
-		return framework;
-	}
-}
-function extractAstroFrontmatter(code) {
-	return code.match(/^\uFEFF?---\r?\n([\s\S]*?)\r?\n---(?:\r?\n|$)/)?.[1] ?? "";
-}
-function inferBindingsFromFile(file, code) {
-	const filename = file.split("/").pop() ?? "unknown.ts";
-	if (!filename.endsWith(".astro")) return inferBindingsFromSource(code, filename);
-	return inferBindingsFromSource(extractAstroFrontmatter(code), filename.replace(/\.astro$/, ".ts"));
-}
-/**
-* Synchronously infer which Cloudflare bindings the project needs
-* by scanning route/middleware files and optional src/main.ssr.ts with oxc-parser.
-*
-* This runs once when voidPlugin() is called (before plugins initialize),
-* so results are available to configure the Cloudflare plugin.
-*
-* @param scanDirs - Override the default scan directories (e.g., for framework mode)
-*/
-function inferProjectBindings(root, options, scanDirs) {
-	if (options?.bindings) return {
-		needsD1: Boolean(options.bindings.db),
-		needsKV: Boolean(options.bindings.kv),
-		needsR2: Boolean(options.bindings.storage),
-		needsAuth: false,
-		needsQueues: false,
-		needsAI: Boolean(options.bindings.ai),
-		needsSandbox: false,
-		needsLive: false
-	};
-	const dirs = scanDirs ?? DEFAULT_SCAN_DIRS;
-	const allBindings = [];
-	for (const dir of dirs) {
-		const dirPath = join(root, dir);
-		let files;
-		try {
-			files = globSync(SOURCE_GLOB, {
-				cwd: dirPath,
-				absolute: true
-			});
-		} catch {
-			continue;
-		}
-		for (const file of files) {
-			const code = readFileSync(file, "utf-8");
-			allBindings.push(inferBindingsFromFile(file, code));
-		}
-	}
-	const ssrEntry = getSsrServerEntryPath(root);
-	if (ssrEntry) {
-		const code = readFileSync(ssrEntry, "utf-8");
-		const filename = ssrEntry.split("/").pop() ?? "main.ssr.ts";
-		allBindings.push(inferBindingsFromSource(code, filename));
-	}
-	if (!new Set(dirs).has("src")) {
-		const srcPath = join(root, "src");
-		let srcFiles;
-		try {
-			srcFiles = globSync(SOURCE_GLOB, {
-				cwd: srcPath,
-				absolute: true
-			});
-		} catch {
-			srcFiles = [];
-		}
-		for (const file of srcFiles) {
-			const code = readFileSync(file, "utf-8");
-			allBindings.push(inferBindingsFromFile(file, code));
-		}
-	}
-	return mergeBindings(allBindings);
-}
-//#endregion
-export { SSR_CLIENT_ENTRY_RELATIVE_PATHS as a, validateSsrEntries as c, isCallExpression as d, isIdentifier as f, walk as g, isObjectExpression as h, inferProjectBindings as i, validateSsrEntry as l, isMemberExpression as m, FRAMEWORK_SCAN_DIRS as n, SSR_SERVER_ENTRY_RELATIVE_PATHS as o, isLiteral as p, detectFramework as r, hasSsrEntry as s, DEFAULT_SCAN_DIRS as t, inferBindingsFromSource as u };