gofront 1.5.1 → 1.6.1

package/src/backend/js/stdlib/path.js

@@ -6,26 +6,40 @@ const PATH_DISPATCH = {
 	Base: (a) =>
 		`((p) => { if (!p) return "."; const stripped = p.replace(/\\/+$/, ""); if (!stripped) return "/"; const i = stripped.lastIndexOf("/"); return i < 0 ? stripped : stripped.slice(i + 1) || "/"; })(${a[0]})`,
 	Dir: (a) =>
-		`((p) => { const i = p.lastIndexOf("/"); if (i < 0) return "."; if (i === 0) return "/"; return p.slice(0, i); })(${a[0]})`,
+		`((p) => { const i = p.lastIndexOf("/"); if (i < 0) return "."; const res = p.slice(0, i); return res === "" ? "/" : __pathClean(res); })(${a[0]})`,
 	Ext: (a) =>
 		`((p) => { const b = p.slice(p.lastIndexOf("/") + 1); const i = b.lastIndexOf("."); return i <= 0 ? "" : b.slice(i); })(${a[0]})`,
 	IsAbs: (a) => `(${a[0]}).startsWith("/")`,
 	Split: (a) =>
 		`((p) => { const i = p.lastIndexOf("/"); return i < 0 ? ["", p] : [p.slice(0, i + 1), p.slice(i + 1)]; })(${a[0]})`,
 	Match: (a) =>
-		`((pat, name) => { try { const sp=/[.+^$()|[\\]\\\\]/g; const re = new RegExp("^" + pat.replace(sp, "\\\\$&").replace(/\\*/g, "[^/]*").replace(/\\?/g, "[^/]") + "$"); return [re.test(name), null]; } catch(e) { return [false, "syntax error in pattern"]; } })(${a[0]}, ${a[1]})`,
+		`((pat, name) => { const [m, err] = __pathMatch(pat, name); return [m, err ? __path_err_bad_pattern : null]; })(${a[0]}, ${a[1]})`,
 };
 
 /** @type {ThisType<CodeGen>} */
 export const pathMethods = {
 	_genPath(fn, a, expr) {
+		if (fn === "Match") {
+			this.useHelper("error");
+			this.useHelper("pathError");
+			this.useHelper("pathClean");
+		}
+		if (fn === "Dir") {
+			this.useHelper("pathClean");
+		}
 		if (fn === "Join") {
-			this._usesPathClean = true;
-			const allArgs = expr.args.map((e) => this.genExpr(e)).join(", ");
-			return `__pathClean([${allArgs}].filter(x => x !== "").join("/"))`;
+			this.useHelper("pathClean");
+			const allArgs = expr.args
+				.map((e) =>
+					e._spread || expr.ellipsis
+						? `...(${this.genExpr(e)})`
+						: this.genExpr(e),
+				)
+				.join(", ");
+			return `((arr) => arr.length === 0 ? "" : __pathClean(arr.join("/")))([${allArgs}].filter(x => x !== ""))`;
 		}
 		if (fn === "Clean") {
-			this._usesPathClean = true;
+			this.useHelper("pathClean");
 			return `__pathClean(${a()[0]})`;
 		}
 		const gen = PATH_DISPATCH[fn];

package/src/backend/js/stdlib/rand.js

@@ -3,9 +3,12 @@
 /** @typedef {import('../index.js').CodeGen} CodeGen */
 
 const RAND_DISPATCH = {
-	Intn: (a) => `Math.floor(Math.random() * ${a[0]})`,
-	Int63n: (a) => `Math.floor(Math.random() * ${a[0]})`,
-	Int31n: (a) => `Math.floor(Math.random() * ${a[0]})`,
+	Intn: (a) =>
+		`((n) => { if (n <= 0) throw new Error("invalid argument to Intn"); return Math.floor(Math.random() * n); })(${a[0]})`,
+	Int63n: (a) =>
+		`((n) => { if (n <= 0) throw new Error("invalid argument to Int63n"); return Math.floor(Math.random() * n); })(${a[0]})`,
+	Int31n: (a) =>
+		`((n) => { if (n <= 0) throw new Error("invalid argument to Int31n"); return Math.floor(Math.random() * n); })(${a[0]})`,
 	Float64: () => "Math.random()",
 	Float32: () => "Math.random()",
 	Int: () => "Math.floor(Math.random() * 2147483647)",
@@ -13,14 +16,16 @@ const RAND_DISPATCH = {
 	Int63: () => "Math.floor(Math.random() * Number.MAX_SAFE_INTEGER)",
 	Seed: () => "(void 0)",
 	Shuffle: (a) =>
-		`((n, f) => { for (let i = n - 1; i > 0; i--) { const j = Math.floor(Math.random() * (i + 1)); f(i, j); } })(${a[0]}, ${a[1]})`,
+		`((n, f) => { if (n < 0) throw new Error("invalid argument to Shuffle"); for (let i = n - 1; i > 0; i--) { const j = Math.floor(Math.random() * (i + 1)); f(i, j); } })(${a[0]}, ${a[1]})`,
 	Perm: (a) =>
-		`((n) => { const a = Array.from({length: n}, (_, i) => i); for (let i = n - 1; i > 0; i--) { const j = Math.floor(Math.random() * (i + 1)); [a[i], a[j]] = [a[j], a[i]]; } return a; })(${a[0]})`,
+		`((n) => { if (n < 0) throw new Error("invalid argument to Perm"); const a = Array.from({length: n}, (_, i) => i); for (let i = n - 1; i > 0; i--) { const j = Math.floor(Math.random() * (i + 1)); [a[i], a[j]] = [a[j], a[i]]; } return a; })(${a[0]})`,
+	Read: (a) => `__crypto_rand_read(${a[0]})`,
 };
 
 /** @type {ThisType<CodeGen>} */
 export const randMethods = {
 	_genRand(fn, a) {
+		if (fn === "Read") this.useHelper("cryptoRand");
 		const gen = RAND_DISPATCH[fn];
 		return gen ? gen(a()) : undefined;
 	},

package/src/backend/js/stdlib/sha256.js

@@ -0,0 +1,12 @@
+// src/backend/js/stdlib/sha256.js
+// CodeGen for Go crypto/sha256 package.
+
+export const sha256Methods = {
+	_genSha256(fn, a) {
+		this.useHelper("sha256");
+		const args = a();
+		if (fn === "Sum256") return `__sha256.Sum256(${args[0]})`;
+		if (fn === "New") return "__sha256.New()";
+		return undefined;
+	},
+};

package/src/backend/js/stdlib/shared.js

@@ -0,0 +1,17 @@
+// CodeGen for the `gofront/shared` package: in js packages a shared buffer is
+// just a TypedArray (no linear memory is involved); in wasm packages the facade
+// hands out zero-copy views onto the module memory.
+
+import { SHARED_KINDS } from "../../../typechecker/stdlib/shared.js";
+
+/** @typedef {import('../index.js').CodeGen} CodeGen */
+
+/** @type {ThisType<CodeGen>} */
+export const sharedMethods = {
+	_genShared(fn, a) {
+		if (!fn.startsWith("New")) return undefined;
+		const info = SHARED_KINDS[fn.slice(3)];
+		if (!info) return undefined;
+		return `new ${info.ctor}(${a()[0]})`;
+	},
+};

package/src/backend/js/stdlib/slices.js

@@ -1,51 +1,77 @@
-// CodeGen for Go `slices` package.
+import { isTypedArraySlice } from "../../../typechecker/types.js";
 
 /** @typedef {import('../index.js').CodeGen} CodeGen */
 
 const SLICES_DISPATCH = {
 	Contains: (a) => `${a[0]}.includes(${a[1]})`,
+	ContainsFunc: (a) =>
+		`((s, f) => { s = s || []; for (let i = 0; i < s.length; i++) { if (f(s[i])) return true; } return false; })(${a[0]}, ${a[1]})`,
 	Index: (a) => `${a[0]}.indexOf(${a[1]})`,
+	IndexFunc: (a) =>
+		`((s, f) => { s = s || []; for (let i = 0; i < s.length; i++) { if (f(s[i])) return i; } return -1; })(${a[0]}, ${a[1]})`,
+	BinarySearch: (a) =>
+		`((s, target) => { s = s || []; let i = 0, j = s.length; while (i < j) { const h = (i + j) >>> 1; if (s[h] < target) i = h + 1; else j = h; } return [i, i < s.length && s[i] === target]; })(${a[0]}, ${a[1]})`,
+	BinarySearchFunc: (a) =>
+		`((s, target, cmp) => { s = s || []; let i = 0, j = s.length; while (i < j) { const h = (i + j) >>> 1; if (cmp(s[h], target) < 0) i = h + 1; else j = h; } return [i, i < s.length && cmp(s[i], target) === 0]; })(${a[0]}, ${a[1]}, ${a[2]})`,
 	Compare: (a) =>
-		`((a, b) => { for (let i = 0; i < a.length && i < b.length; i++) { if (a[i] < b[i]) return -1; if (a[i] > b[i]) return 1; } return a.length - b.length; })(${a[0]}, ${a[1]})`,
-	Sort: (a) => `${a[0]}.sort((a, b) => a < b ? -1 : a > b ? 1 : 0)`,
-	SortFunc: (a) => `${a[0]}.sort(${a[1]})`,
-	SortStableFunc: (a) => `${a[0]}.sort(${a[1]})`,
+		`((a, b) => { a = a || []; b = b || []; for (let i = 0; i < a.length && i < b.length; i++) { const x = a[i], y = b[i]; const xN = typeof x === "number" && isNaN(x), yN = typeof y === "number" && isNaN(y); if (xN && yN) continue; if (xN) return -1; if (yN) return 1; if (x < y) return -1; if (x > y) return 1; } return a.length < b.length ? -1 : a.length > b.length ? 1 : 0; })(${a[0]}, ${a[1]})`,
+	Sort: (a) =>
+		`((s) => s ? s.sort((a, b) => a < b ? -1 : a > b ? 1 : 0) : null)(${a[0]})`,
+	SortFunc: (a) => `((s, f) => s ? s.sort(f) : null)(${a[0]}, ${a[1]})`,
+	SortStableFunc: (a) => `((s, f) => s ? s.sort(f) : null)(${a[0]}, ${a[1]})`,
 	IsSorted: (a) =>
-		`((s) => { for (let i = 1; i < s.length; i++) { if (s[i] < s[i-1]) return false; } return true; })(${a[0]})`,
+		`((s) => { s = s || []; for (let i = 0; i < s.length; i++) { if (typeof s[i] === "number" && isNaN(s[i])) return false; if (i > 0 && s[i] < s[i-1]) return false; } return true; })(${a[0]})`,
 	IsSortedFunc: (a) =>
-		`((s, f) => { for (let i = 1; i < s.length; i++) { if (f(s[i], s[i-1]) < 0) return false; } return true; })(${a[0]}, ${a[1]})`,
-	Reverse: (a) => `${a[0]}.reverse()`,
-	Max: (a) => `Math.max(...${a[0]})`,
-	Min: (a) => `Math.min(...${a[0]})`,
+		`((s, f) => { s = s || []; for (let i = 1; i < s.length; i++) { if (f(s[i], s[i-1]) < 0) return false; } return true; })(${a[0]}, ${a[1]})`,
+	Reverse: (a) => `((s) => s ? s.reverse() : null)(${a[0]})`,
+	Max: (a) =>
+		`((s) => { if (!s || s.length === 0) throw new Error("slices.Max: empty list"); let m = s[0]; for (let i = 1; i < s.length; i++) { const x = s[i]; if ((typeof x === "number" && isNaN(x)) || x > m || (x === 0 && m === 0 && Object.is(m, -0) && !Object.is(x, -0))) m = x; } return m; })(${a[0]})`,
+	Min: (a) =>
+		`((s) => { if (!s || s.length === 0) throw new Error("slices.Min: empty list"); let m = s[0]; for (let i = 1; i < s.length; i++) { const x = s[i]; if ((typeof x === "number" && isNaN(x)) || x < m || (x === 0 && m === 0 && Object.is(x, -0))) m = x; } return m; })(${a[0]})`,
 	MaxFunc: (a) =>
-		`((s, f) => s.reduce((m, x) => f(x, m) > 0 ? x : m))(${a[0]}, ${a[1]})`,
+		`((s, f) => { if (!s || s.length === 0) throw new Error("slices.MaxFunc: empty list"); return s.reduce((m, x) => f(x, m) > 0 ? x : m); })(${a[0]}, ${a[1]})`,
 	MinFunc: (a) =>
-		`((s, f) => s.reduce((m, x) => f(x, m) < 0 ? x : m))(${a[0]}, ${a[1]})`,
-	Clone: (a) => `${a[0]}.slice()`,
+		`((s, f) => { if (!s || s.length === 0) throw new Error("slices.MinFunc: empty list"); return s.reduce((m, x) => f(x, m) < 0 ? x : m); })(${a[0]}, ${a[1]})`,
+	Clone: (a) => `((s) => s ? s.slice() : null)(${a[0]})`,
 	Compact: (a) =>
-		`((s) => s.filter((v, i) => i === 0 || v !== s[i-1]))(${a[0]})`,
+		`((s) => { if (!s || s.length === 0) return s; let k = 1; for (let i = 1; i < s.length; i++) { if (s[i] !== s[k - 1]) s[k++] = s[i]; } return ArrayBuffer.isView(s) ? s.subarray(0, k) : (s.length = k, s); })(${a[0]})`,
 	CompactFunc: (a) =>
-		`((s, f) => s.filter((v, i) => i === 0 || !f(v, s[i-1])))(${a[0]}, ${a[1]})`,
-	Concat: (a) => `[].concat(${a.join(", ")})`,
-	Delete: (a) => `[...${a[0]}.slice(0, ${a[1]}), ...${a[0]}.slice(${a[2]})]`,
-	DeleteFunc: (a) => `${a[0]}.filter((v) => !${a[1]}(v))`,
-	Insert: (a) =>
-		`[...${a[0]}.slice(0, ${a[1]}), ${a.slice(2).join(", ")}, ...${a[0]}.slice(${a[1]})]`,
-	Replace: (a) =>
-		`[...${a[0]}.slice(0, ${a[1]}), ${a.slice(3).join(", ")}, ...${a[0]}.slice(${a[2]})]`,
-	Grow: (a) => `${a[0]}.slice()`,
-	Clip: (a) => `${a[0]}.slice()`,
+		`((s, f) => { if (!s || s.length === 0) return s; let k = 1; for (let i = 1; i < s.length; i++) { if (!f(s[i], s[k - 1])) s[k++] = s[i]; } return ArrayBuffer.isView(s) ? s.subarray(0, k) : (s.length = k, s); })(${a[0]}, ${a[1]})`,
+	Concat: (a) =>
+		a.length === 0
+			? "null"
+			: `((...slices) => { const nonNull = slices.filter(Boolean); if (nonNull.length === 0) return slices[0] === null ? null : []; if (ArrayBuffer.isView(nonNull[0])) { const totalLen = nonNull.reduce((sum, s) => sum + s.length, 0); const out = new nonNull[0].constructor(totalLen); let off = 0; for (const s of nonNull) { out.set(s, off); off += s.length; } return out; } return [].concat(...slices.map(s => s ? (ArrayBuffer.isView(s) ? Array.from(s) : s) : [])); })(${a.map((x) => `(${x})`).join(", ")})`,
+	Delete: (a) =>
+		`((s, i, j) => { if (!s && i === 0 && j === 0) return s; s = s || []; if (i < 0 || j < i || j > s.length) throw new Error("runtime error: slice bounds out of range"); if (ArrayBuffer.isView(s)) { s.copyWithin(i, j); return s.subarray(0, s.length - (j - i)); } s.splice(i, j - i); return s; })(${a[0]}, ${a[1]}, ${a[2]})`,
+	DeleteFunc: (a) =>
+		`((s, f) => { if (!s || s.length === 0) return s; let k = 0; for (let i = 0; i < s.length; i++) { if (!f(s[i])) s[k++] = s[i]; } return ArrayBuffer.isView(s) ? s.subarray(0, k) : (s.length = k, s); })(${a[0]}, ${a[1]})`,
+	Insert: (a, isTyped) => {
+		const items = a.slice(2);
+		const nilInit = isTyped ? "new Uint8Array(0)" : "[]";
+		return `((s, i, ...v) => { if (!s && i === 0) s = ${nilInit}; if (!s || i < 0 || i > s.length) throw new Error("runtime error: slice bounds out of range"); if (ArrayBuffer.isView(s)) { const res = new s.constructor(s.length + v.length); res.set(s.subarray(0, i), 0); res.set(v, i); res.set(s.subarray(i), i + v.length); return res; } s.splice(i, 0, ...v); return s; })(${a[0]}, ${a[1]}${items.length ? `, ${items.join(", ")}` : ""})`;
+	},
+	Replace: (a, isTyped) => {
+		const items = a.slice(3);
+		const nilInit = isTyped ? "new Uint8Array(0)" : "[]";
+		return `((s, i, j, ...v) => { if (!s && i === 0 && j === 0) s = ${nilInit}; if (!s || i < 0 || j < i || j > s.length) throw new Error("runtime error: slice bounds out of range"); if (ArrayBuffer.isView(s)) { const res = new s.constructor(s.length - (j - i) + v.length); res.set(s.subarray(0, i), 0); res.set(v, i); res.set(s.subarray(j), i + v.length); return res; } s.splice(i, j - i, ...v); return s; })(${a[0]}, ${a[1]}, ${a[2]}${items.length ? `, ${items.join(", ")}` : ""})`;
+	},
+	Grow: (a, isTyped) => {
+		const nilInit = isTyped ? "new Uint8Array(0)" : "[]";
+		return `((s, n) => { if (n < 0) throw new Error("runtime error: makeslice: len out of range"); if (!s) return ${nilInit}; return s.slice(); })(${a[0]}, ${a[1]})`;
+	},
+	Clip: (a) => `((s) => s ? s.slice() : null)(${a[0]})`,
 };
 
 /** @type {ThisType<CodeGen>} */
 export const slicesMethods = {
-	_genSlices(fn, a) {
+	_genSlices(fn, a, expr) {
 		if (fn === "Equal") {
-			this._usesEqual = true;
+			this.useHelper("equal");
 			const [a1, b1] = a();
 			return `__equal(${a1}, ${b1})`;
 		}
+		const isTyped = isTypedArraySlice(expr?.args?.[0]?._type);
 		const gen = SLICES_DISPATCH[fn];
-		return gen ? gen(a()) : undefined;
+		return gen ? gen(a(), isTyped) : undefined;
 	},
 };

package/src/backend/js/stdlib/sort.js

@@ -23,7 +23,7 @@ const SORT_DISPATCH = {
 /** @type {ThisType<CodeGen>} */
 export const sortMethods = {
 	_genSort(fn, a) {
-		if (fn === "Slice" || fn === "SliceStable") this._usesSortSlice = true;
+		if (fn === "Slice" || fn === "SliceStable") this.useHelper("sortSlice");
 		const gen = SORT_DISPATCH[fn];
 		return gen ? gen(a()) : undefined;
 	},

package/src/backend/js/stdlib/strconv.js

@@ -2,32 +2,73 @@
 
 /** @typedef {import('../index.js').CodeGen} CodeGen */
 
+// Parsers return [value, msg|null] from the shared __strconv_* helpers
+// (runtime.js); the message becomes a Go error value.
+const parsed = (call, toValue = "r[0]") =>
+	`((r) => [${toValue}, r[1] === null ? null : __error(r[1], r[1].includes("invalid syntax") ? __strconv_err_syntax : r[1].includes("value out of range") ? __strconv_err_range : null)])(${call})`;
+
 const STRCONV_DISPATCH = {
 	Itoa: (a) => `String(${a[0]})`,
-	Atoi: (a) =>
-		`(Number.isNaN(Number(${a[0]})) ? [0, "invalid syntax"] : [Number(${a[0]}) | 0, null])`,
+	Atoi: (a) => parsed(`__strconv_atoi(${a[0]})`, "Number(r[0])"),
 	FormatBool: (a) => `String(${a[0]})`,
 	FormatInt: (a) => `(${a[0]}).toString(${a[1]})`,
-	FormatFloat: (a) => `String(${a[0]})`,
-	ParseFloat: (a) =>
-		`(Number.isNaN(Number(${a[0]})) ? [0, "invalid syntax"] : [Number(${a[0]}), null])`,
+	FormatFloat: (a) =>
+		a.length < 3
+			? `String(${a[0]})`
+			: `__strconv_format_float(${a[0]}, ${a[1]}, ${a[2]})`,
+	ParseFloat: (a) => parsed(`__strconv_parse_float(${a[0]})`),
 	ParseInt: (a) =>
-		`(Number.isNaN(parseInt(${a[0]}, ${a[1]} || 10)) ? [0, "invalid syntax"] : [parseInt(${a[0]}, ${a[1]} || 10), null])`,
-	ParseBool: (a) =>
-		`(${a[0]} === "true" || ${a[0]} === "1" ? [true, null] : ${a[0]} === "false" || ${a[0]} === "0" ? [false, null] : [false, "invalid syntax"])`,
+		parsed(
+			`__strconv_parse_int(${a[0]}, ${a[1]}, ${a[2] ?? 64})`,
+			"Number(r[0])",
+		),
+	ParseBool: (a) => parsed(`__strconv_parse_bool(${a[0]})`),
 	Quote: (a) => `JSON.stringify(${a[0]})`,
 	Unquote: (a) =>
-		`((s) => { try { const v = JSON.parse(s); return [v, null]; } catch(e) { return ["", "invalid syntax"]; } })(${a[0]})`,
+		`((s) => { if (typeof s === "string" && s.startsWith("\`") && s.endsWith("\`") && s.length >= 2) { if (s.slice(1, -1).includes("\`")) return ["", __strconv_err_syntax]; return [s.slice(1, -1), null]; } try { const v = JSON.parse(s); if (typeof v !== "string") throw 0; return [v, null]; } catch(e) { return ["", __strconv_err_syntax]; } })(${a[0]})`,
 	AppendInt: (a) =>
-		`[...(${a[0]}), ...new TextEncoder().encode((${a[1]}).toString(${a[2]}))]`,
+		`((d, s) => { const e = new TextEncoder().encode(s); const dl = d ? d.length : 0; const r = new Uint8Array(dl + e.length); if (dl > 0) r.set(d, 0); r.set(e, dl); return r; })(${a[0]}, (${a[1]}).toString(${a[2]}))`,
+	AppendUint: (a) =>
+		`((d, s) => { const e = new TextEncoder().encode(s); const dl = d ? d.length : 0; const r = new Uint8Array(dl + e.length); if (dl > 0) r.set(d, 0); r.set(e, dl); return r; })(${a[0]}, (BigInt.asUintN(64, BigInt(${a[1]}))).toString(${a[2]}))`,
+	AppendBool: (a) =>
+		`((d, s) => { const e = new TextEncoder().encode(s); const dl = d ? d.length : 0; const r = new Uint8Array(dl + e.length); if (dl > 0) r.set(d, 0); r.set(e, dl); return r; })(${a[0]}, String(${a[1]}))`,
 	AppendFloat: (a) =>
-		`[...(${a[0]}), ...new TextEncoder().encode(${a[1]}.toFixed(${a[3]} < 0 ? 6 : ${a[3]}))]`,
+		`((d, s) => { const e = new TextEncoder().encode(s); const dl = d ? d.length : 0; const r = new Uint8Array(dl + e.length); if (dl > 0) r.set(d, 0); r.set(e, dl); return r; })(${a[0]}, __strconv_format_float(${a[1]}, typeof (${a[2]}) === "string" ? (${a[2]}).charCodeAt(0) : (${a[2]}), ${a[3]}))`,
+	FormatUint: (a) => `(BigInt.asUintN(64, BigInt(${a[0]}))).toString(${a[1]})`,
+	ParseUint: (a) =>
+		parsed(
+			`__strconv_parse_uint(${a[0]}, ${a[1]}, ${a[2] ?? 64})`,
+			"Number(r[0])",
+		),
 };
 
+const USES_ERROR = new Set([
+	"Atoi",
+	"ParseFloat",
+	"ParseInt",
+	"ParseUint",
+	"ParseBool",
+	"Unquote",
+]);
+const USES_STRCONV = new Set([
+	"Atoi",
+	"ParseFloat",
+	"ParseInt",
+	"ParseUint",
+	"ParseBool",
+	"FormatFloat",
+	"AppendFloat",
+]);
+
 /** @type {ThisType<CodeGen>} */
 export const strconvMethods = {
 	_genStrconv(fn, a) {
 		const gen = STRCONV_DISPATCH[fn];
+		if (gen && USES_ERROR.has(fn)) {
+			this.useHelper("error");
+			this.useHelper("strconvError");
+		}
+		if (gen && USES_STRCONV.has(fn)) this.useHelper("strconv");
 		return gen ? gen(a()) : undefined;
 	},
 };

package/src/backend/js/stdlib/strings.js

@@ -21,30 +21,87 @@ const STRINGS_M2 = {
 const STRINGS_DISPATCH = {
 	Count: ([s, s2]) =>
 		`((s, sep) => sep === "" ? s.length + 1 : s.split(sep).length - 1)(${s}, ${s2})`,
-	Replace: ([s, s2, s3]) => `${s}.replace(${s2}, ${s3})`,
+	Replace: ([s, s2, s3, n]) =>
+		n === undefined
+			? `${s}.replace(${s2}, ${s3})`
+			: `((str, o, nw, cnt) => { if (cnt < 0) return str.replaceAll(o, nw); let r = ""; let i = 0; for (; cnt > 0; cnt--) { const j = str.indexOf(o, i); if (j < 0) break; r += str.slice(i, j) + nw; i = j + o.length; if (o.length === 0) { if (i >= str.length) break; r += str[i]; i++; } } return r + str.slice(i); })(${s}, ${s2}, ${s3}, ${n})`,
 	ReplaceAll: ([s, s2, s3]) => `${s}.replaceAll(${s2}, ${s3})`,
 	Trim: ([s, s2]) =>
-		`${s}.replace(new RegExp(\`^[\${${s2}}]+|[\${${s2}}]+$\`, "g"), "")`,
+		`((str, cut) => { const cs = new Set(cut); let i = 0, j = str.length; while (i < j && cs.has(str[i])) i++; while (j > i && cs.has(str[j - 1])) j--; return str.slice(i, j); })(${s}, ${s2})`,
 	TrimPrefix: ([s, s2]) =>
 		`((s, pre) => s.startsWith(pre) ? s.slice(pre.length) : s)(${s}, ${s2})`,
 	TrimSuffix: ([s, s2]) =>
 		`((s, suf) => !suf.length || !s.endsWith(suf) ? s : s.slice(0, -suf.length))(${s}, ${s2})`,
-	TrimLeft: ([s, s2]) => `${s}.replace(new RegExp(\`^[\${${s2}}]+\`), "")`,
-	TrimRight: ([s, s2]) => `${s}.replace(new RegExp(\`[\${${s2}}]+$\`), "")`,
+	TrimLeft: ([s, s2]) =>
+		`((str, cut) => { const cs = new Set(cut); let i = 0; while (i < str.length && cs.has(str[i])) i++; return str.slice(i); })(${s}, ${s2})`,
+	TrimRight: ([s, s2]) =>
+		`((str, cut) => { const cs = new Set(cut); let j = str.length; while (j > 0 && cs.has(str[j - 1])) j--; return str.slice(0, j); })(${s}, ${s2})`,
 	EqualFold: ([s, s2]) => `${s}.toLowerCase() === ${s2}.toLowerCase()`,
 	Fields: ([s]) => `(${s}).trim() === '' ? [] : (${s}).trim().split(/\\s+/)`,
+	FieldsFunc: ([s, f]) =>
+		`((s, fn) => { const res = []; const runes = Array.from(s ?? ""); let cur = ""; for (const ch of runes) { const cp = ch.codePointAt(0); if (fn(cp)) { if (cur.length > 0) { res.push(cur); cur = ""; } } else { cur += ch; } } if (cur.length > 0) res.push(cur); return res; })(${s}, ${f})`,
 	Cut: ([s, s2]) =>
 		`((s, sep) => { const i = s.indexOf(sep); return i < 0 ? [s, "", false] : [s.slice(0, i), s.slice(i + sep.length), true]; })(${s}, ${s2})`,
 	CutPrefix: ([s, s2]) =>
-		`(${s}).startsWith(${s2}) ? [(${s}).slice((${s2}).length), true] : [${s}, false]`,
+		`((str, pre) => str.startsWith(pre) ? [str.slice(pre.length), true] : [str, false])(${s}, ${s2})`,
 	CutSuffix: ([s, s2]) =>
-		`(${s}).endsWith(${s2}) ? [(${s}).slice(0, -(${s2}).length), true] : [${s}, false]`,
+		`((str, suf) => { if (suf === "") return [str, true]; return str.endsWith(suf) ? [str.slice(0, -suf.length), true] : [str, false]; })(${s}, ${s2})`,
 	SplitN: ([s, s2, s3]) =>
-		`((s, sep, n) => { if (n === 0) return []; if (n < 0) return s.split(sep); const r = []; let cur = s; for (let i = 1; i < n && cur.length; i++) { const j = cur.indexOf(sep); if (j < 0) break; r.push(cur.slice(0, j)); cur = cur.slice(j + sep.length); } r.push(cur); return r; })(${s}, ${s2}, ${s3})`,
+		`((s, sep, n) => {
+			if (n === 0) return null;
+			if (n < 0) return sep === "" ? [...s] : s.split(sep);
+			if (sep === "") {
+				const chars = [...s];
+				if (chars.length <= n) return chars;
+				const r = chars.slice(0, n - 1);
+				r.push(chars.slice(n - 1).join(""));
+				return r;
+			}
+			const r = [];
+			let cur = s;
+			for (let i = 1; i < n && cur.length; i++) {
+				const j = cur.indexOf(sep);
+				if (j < 0) break;
+				r.push(cur.slice(0, j));
+				cur = cur.slice(j + sep.length);
+			}
+			r.push(cur);
+			return r;
+		})(${s}, ${s2}, ${s3})`,
 	SplitAfter: ([s, s2]) =>
-		`((s, sep) => { if (sep === "") return [...s]; const r = []; let cur = s; while (cur.length) { const j = cur.indexOf(sep); if (j < 0) { r.push(cur); break; } r.push(cur.slice(0, j + sep.length)); cur = cur.slice(j + sep.length); } return r; })(${s}, ${s2})`,
+		`((s, sep) => {
+			if (sep === "") return [...s];
+			const r = [];
+			let cur = s;
+			while (true) {
+				const j = cur.indexOf(sep);
+				if (j < 0) { r.push(cur); break; }
+				r.push(cur.slice(0, j + sep.length));
+				cur = cur.slice(j + sep.length);
+			}
+			return r;
+		})(${s}, ${s2})`,
 	SplitAfterN: ([s, s2, s3]) =>
-		`((s, sep, n) => { if (n === 0) return []; if (n < 0 || sep === "") return ((s, sep) => { if (sep === "") return [...s]; const r = []; let cur = s; while (cur.length) { const j = cur.indexOf(sep); if (j < 0) { r.push(cur); break; } r.push(cur.slice(0, j + sep.length)); cur = cur.slice(j + sep.length); } return r; })(s, sep); const r = []; let cur = s; for (let i = 1; i < n && cur.length; i++) { const j = cur.indexOf(sep); if (j < 0) break; r.push(cur.slice(0, j + sep.length)); cur = cur.slice(j + sep.length); } r.push(cur); return r; })(${s}, ${s2}, ${s3})`,
+		`((s, sep, n) => {
+			if (n === 0) return null;
+			if (sep === "") {
+				const chars = [...s];
+				if (n < 0 || chars.length <= n) return chars;
+				const r = chars.slice(0, n - 1);
+				r.push(chars.slice(n - 1).join(""));
+				return r;
+			}
+			const r = [];
+			let cur = s;
+			for (let i = 1; (n < 0 || i < n) && cur.length; i++) {
+				const j = cur.indexOf(sep);
+				if (j < 0) break;
+				r.push(cur.slice(0, j + sep.length));
+				cur = cur.slice(j + sep.length);
+			}
+			r.push(cur);
+			return r;
+		})(${s}, ${s2}, ${s3})`,
 	IndexAny: ([s, s2]) =>
 		`((s, chars) => { let m = -1; for (const c of chars) { const i = s.indexOf(c); if (i >= 0 && (m < 0 || i < m)) m = i; } return m; })(${s}, ${s2})`,
 	LastIndexAny: ([s, s2]) =>
@@ -55,27 +112,106 @@ const STRINGS_DISPATCH = {
 	IndexByte: ([s, s2]) => `(${s}).indexOf(String.fromCharCode(${s2}))`,
 	LastIndexByte: ([s, s2]) => `(${s}).lastIndexOf(String.fromCharCode(${s2}))`,
 	Map: ([s, s2]) =>
-		`[...(${s2})].map(c => String.fromCodePoint((${s})(c.codePointAt(0)))).join("")`,
+		`((f, s) => { let out = ""; for (const c of s) { const r = f(c.codePointAt(0)); if (r >= 0) out += String.fromCodePoint(r); } return out; })(${s}, ${s2})`,
 	Title: ([s]) => `(${s}).replace(/\\b\\w/g, c => c.toUpperCase())`,
 	TrimFunc: ([s, s2]) =>
-		`((s, f) => { let l = 0, r = s.length; while (l < r && f(s.codePointAt(l))) l++; while (r > l && f(s.codePointAt(r - 1))) r--; return s.slice(l, r); })(${s}, ${s2})`,
+		`((s, f) => {
+			let l = 0, r = s.length;
+			while (l < r) {
+				const cp = s.codePointAt(l);
+				if (!f(cp)) break;
+				l += cp > 0xFFFF ? 2 : 1;
+			}
+			while (r > l) {
+				let cp, step;
+				if (r > 1 && s.charCodeAt(r - 1) >= 0xDC00 && s.charCodeAt(r - 1) <= 0xDFFF &&
+					s.charCodeAt(r - 2) >= 0xD800 && s.charCodeAt(r - 2) <= 0xDBFF) {
+					cp = s.codePointAt(r - 2);
+					step = 2;
+				} else {
+					cp = s.codePointAt(r - 1);
+					step = 1;
+				}
+				if (!f(cp)) break;
+				r -= step;
+			}
+			return s.slice(l, r);
+		})(${s}, ${s2})`,
 	TrimLeftFunc: ([s, s2]) =>
-		`((s, f) => { let l = 0; while (l < s.length && f(s.codePointAt(l))) l++; return s.slice(l); })(${s}, ${s2})`,
+		`((s, f) => {
+			let l = 0;
+			while (l < s.length) {
+				const cp = s.codePointAt(l);
+				if (!f(cp)) break;
+				l += cp > 0xFFFF ? 2 : 1;
+			}
+			return s.slice(l);
+		})(${s}, ${s2})`,
 	TrimRightFunc: ([s, s2]) =>
-		`((s, f) => { let r = s.length; while (r > 0 && f(s.codePointAt(r - 1))) r--; return s.slice(0, r); })(${s}, ${s2})`,
+		`((s, f) => {
+			let r = s.length;
+			while (r > 0) {
+				let cp, step;
+				if (r > 1 && s.charCodeAt(r - 1) >= 0xDC00 && s.charCodeAt(r - 1) <= 0xDFFF &&
+					s.charCodeAt(r - 2) >= 0xD800 && s.charCodeAt(r - 2) <= 0xDBFF) {
+					cp = s.codePointAt(r - 2);
+					step = 2;
+				} else {
+					cp = s.codePointAt(r - 1);
+					step = 1;
+				}
+				if (!f(cp)) break;
+				r -= step;
+			}
+			return s.slice(0, r);
+		})(${s}, ${s2})`,
 	IndexFunc: ([s, s2]) =>
 		`((s, f) => { for (let i = 0; i < s.length; i++) { const cp = s.codePointAt(i); if (f(cp)) return i; if (cp > 0xFFFF) i++; } return -1; })(${s}, ${s2})`,
 	LastIndexFunc: ([s, s2]) =>
-		`((s, f) => { for (let i = s.length - 1; i >= 0; i--) { const cp = s.codePointAt(i); if (f(cp)) return i; } return -1; })(${s}, ${s2})`,
+		`((s, f) => { for (let i = s.length - 1; i >= 0; i--) { let cp = s.codePointAt(i); if (i > 0 && s.charCodeAt(i) >= 0xDC00 && s.charCodeAt(i) <= 0xDFFF && s.charCodeAt(i - 1) >= 0xD800 && s.charCodeAt(i - 1) <= 0xDBFF) { cp = s.codePointAt(i - 1); i--; } if (f(cp)) return i; } return -1; })(${s}, ${s2})`,
 	NewReader: ([s]) =>
-		`{_src: ${s}, _pos: 0, Read(p) { const n = Math.min(p.length, this._src.length - this._pos); for (let i = 0; i < n; i++) p[i] = this._src.charCodeAt(this._pos + i); this._pos += n; return [n, n === 0 ? "EOF" : null]; }, Len() { return this._src.length - this._pos; }, Reset(s) { this._src = s; this._pos = 0; }}`,
+		`((s) => ({ _bytes: new TextEncoder().encode(s), _pos: 0, Read(p) { if (this._pos >= this._bytes.length) return [0, __io_eof]; const n = Math.min(p.length, this._bytes.length - this._pos); for (let i = 0; i < n; i++) p[i] = this._bytes[this._pos + i]; this._pos += n; return [n, null]; }, Len() { return Math.max(0, this._bytes.length - this._pos); }, Reset(s2) { this._bytes = new TextEncoder().encode(s2); this._pos = 0; } }))(${s})`,
 	NewReplacer: (args) =>
-		`((...pairs) => { const p = []; for (let i = 0; i < pairs.length; i += 2) p.push([pairs[i], pairs[i+1]]); return { _p: p, Replace(s) { let r = s; for (const [o, n] of this._p) r = r.split(o).join(n); return r; } }; })(${args.join(", ")})`,
+		`((...pairs) => {
+			const p = [];
+			for (let i = 0; i < pairs.length; i += 2) {
+				if (pairs[i] !== undefined && pairs[i+1] !== undefined) {
+					p.push([pairs[i], pairs[i+1]]);
+				}
+			}
+			return {
+				_p: p,
+				Replace(s) {
+					s = s ?? "";
+					if (!this._p || this._p.length === 0 || s === "") return s;
+					let out = "";
+					let i = 0;
+					while (i < s.length) {
+						let matched = false;
+						for (let k = 0; k < this._p.length; k++) {
+							const [oldStr, newStr] = this._p[k];
+							if (oldStr.length > 0 && s.startsWith(oldStr, i)) {
+								out += newStr;
+								i += oldStr.length;
+								matched = true;
+								break;
+							}
+						}
+						if (!matched) {
+							out += s[i];
+							i++;
+						}
+					}
+					return out;
+				}
+			};
+		})(${args.join(", ")})`,
 };
 
 /** @type {ThisType<CodeGen>} */
 export const stringsMethods = {
 	_genStrings(fn, a) {
+		if (fn === "NewReader") this.useHelper("ioEOF");
 		const args = a();
 		const [s, s2] = args;
 		if (STRINGS_M1[fn]) return `${s}.${STRINGS_M1[fn]}()`;

package/src/backend/js/stdlib/sync.js

@@ -0,0 +1,13 @@
+// src/backend/js/stdlib/sync.js
+// CodeGen for Go sync package.
+
+export const syncMethods = {
+	_genSync(fn) {
+		this.useHelper("sync");
+		if (fn === "Once") return "__sync_once()";
+		if (fn === "Mutex") return "__sync_mutex()";
+		if (fn === "RWMutex") return "__sync_rwmutex()";
+		if (fn === "WaitGroup") return "__sync_waitgroup()";
+		return undefined;
+	},
+};

package/src/backend/js/stdlib/testing.js

@@ -15,7 +15,7 @@ export const testingMethods = {
 	},
 
 	_genTestingMethodCall(method, expr) {
-		this._usesTesting = true;
+		this.useHelper("testing");
 		const recv = expr.func.expr;
 		const t = this.genExpr(recv);
 		const args = expr.args
@@ -27,7 +27,7 @@ export const testingMethods = {
 			method === "Logf" ||
 			method === "Skipf"
 		) {
-			this._usesSprintf = true;
+			this.useHelper("sprintf");
 		}
 		return `${t}.${method}(${args})`;
 	},