@rohal12/spindle 0.59.13 → 0.59.15

package/dist/pkg/headless.js

@@ -124,6 +124,11 @@ var LINK_SEPARATORS = [
 ];
 var NO_SELECTORS = {};
 /**
+* A CommonMark email autolink, `<` an address `>` (without braces, which
+* are markup), as markdown reads one.
+*/
+var EMAIL_AUTOLINK = /^<[a-zA-Z0-9.!#$%&'*+/=?^_`|~-]+@[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)*>$/;
+/**
 * A link's display text and target, from its text `inner` (at `at` in the
 * input), with where the target is written.
 */
@@ -401,10 +406,11 @@ function peg$parse(input, options) {
 	const peg$c10 = " ";
 	const peg$c11 = "}";
 	const peg$c12 = "/";
-	const peg$c13 = "</";
-	const peg$c14 = "=";
-	const peg$c15 = "\"";
-	const peg$c16 = "'";
+	const peg$c13 = "@";
+	const peg$c14 = "</";
+	const peg$c15 = "=";
+	const peg$c16 = "\"";
+	const peg$c17 = "'";
 	const peg$r0 = /^[^\\{[<]/;
 	const peg$r1 = /^[{}]/;
 	const peg$r2 = /^[$_@%(!\/a-zA-Z]/;
@@ -415,14 +421,16 @@ function peg$parse(input, options) {
 	const peg$r7 = /^[$_@%(!]/;
 	const peg$r8 = /^[a-zA-Z]/;
 	const peg$r9 = /^[^ \t\n\r\v\f\xA0\u1680\u2000-\u200A\u2028\u2029\u202F\u205F\u3000\uFEFF}]/;
-	const peg$r10 = /^[\t-\r \/>\xA0\u1680\u2000-\u200A\u2028-\u2029\u202F\u205F\u3000\uFEFF]/;
-	const peg$r11 = /^[a-zA-Z0-9\-]/;
-	const peg$r12 = /^[\t-\r "'\/<->{}\xA0\u1680\u2000-\u200A\u2028-\u2029\u202F\u205F\u3000\uFEFF]/;
-	const peg$r13 = /^[^"]/;
-	const peg$r14 = /^[^']/;
-	const peg$r15 = /^["']/;
-	const peg$r16 = /^[^ \t\n\r\v\f\xA0\u1680\u2000-\u200A\u2028\u2029\u202F\u205F\u3000\uFEFF>]/;
-	const peg$r17 = /^[ \t\n\r\v\f\xA0\u1680\u2000-\u200A\u2028\u2029\u202F\u205F\u3000\uFEFF]/;
+	const peg$r10 = /^[a-zA-Z0-9.!#$%&'*+\/=?\^_`|~\-]/;
+	const peg$r11 = /^[a-zA-Z0-9.\-]/;
+	const peg$r12 = /^[\t-\r \/>\xA0\u1680\u2000-\u200A\u2028-\u2029\u202F\u205F\u3000\uFEFF]/;
+	const peg$r13 = /^[a-zA-Z0-9\-]/;
+	const peg$r14 = /^[\t-\r "'\/<->{}\xA0\u1680\u2000-\u200A\u2028-\u2029\u202F\u205F\u3000\uFEFF]/;
+	const peg$r15 = /^[^"]/;
+	const peg$r16 = /^[^']/;
+	const peg$r17 = /^["']/;
+	const peg$r18 = /^[^ \t\n\r\v\f\xA0\u1680\u2000-\u200A\u2028\u2029\u202F\u205F\u3000\uFEFF>]/;
+	const peg$r19 = /^[ \t\n\r\v\f\xA0\u1680\u2000-\u200A\u2028\u2029\u202F\u205F\u3000\uFEFF]/;
 	const peg$e0 = peg$anyExpectation();
 	const peg$e1 = peg$classExpectation([
 		"\\",
@@ -504,6 +512,37 @@ function peg$parse(input, options) {
 		"}"
 	], true, false, false);
 	const peg$e24 = peg$classExpectation([
+		["a", "z"],
+		["A", "Z"],
+		["0", "9"],
+		".",
+		"!",
+		"#",
+		"$",
+		"%",
+		"&",
+		"'",
+		"*",
+		"+",
+		"/",
+		"=",
+		"?",
+		"^",
+		"_",
+		"`",
+		"|",
+		"~",
+		"-"
+	], false, false, false);
+	const peg$e25 = peg$literalExpectation("@", false);
+	const peg$e26 = peg$classExpectation([
+		["a", "z"],
+		["A", "Z"],
+		["0", "9"],
+		".",
+		"-"
+	], false, false, false);
+	const peg$e27 = peg$classExpectation([
 		["	", "\r"],
 		" ",
 		"/",
@@ -517,14 +556,14 @@ function peg$parse(input, options) {
 		"　",
 		""
 	], false, false, false);
-	const peg$e25 = peg$literalExpectation("</", false);
-	const peg$e26 = peg$classExpectation([
+	const peg$e28 = peg$literalExpectation("</", false);
+	const peg$e29 = peg$classExpectation([
 		["a", "z"],
 		["A", "Z"],
 		["0", "9"],
 		"-"
 	], false, false, false);
-	const peg$e27 = peg$classExpectation([
+	const peg$e30 = peg$classExpectation([
 		["	", "\r"],
 		" ",
 		"\"",
@@ -542,13 +581,13 @@ function peg$parse(input, options) {
 		"　",
 		""
 	], false, false, false);
-	const peg$e28 = peg$literalExpectation("=", false);
-	const peg$e29 = peg$literalExpectation("\"", false);
-	const peg$e30 = peg$classExpectation(["\""], true, false, false);
-	const peg$e31 = peg$literalExpectation("'", false);
-	const peg$e32 = peg$classExpectation(["'"], true, false, false);
-	const peg$e33 = peg$classExpectation(["\"", "'"], false, false, false);
-	const peg$e34 = peg$classExpectation([
+	const peg$e31 = peg$literalExpectation("=", false);
+	const peg$e32 = peg$literalExpectation("\"", false);
+	const peg$e33 = peg$classExpectation(["\""], true, false, false);
+	const peg$e34 = peg$literalExpectation("'", false);
+	const peg$e35 = peg$classExpectation(["'"], true, false, false);
+	const peg$e36 = peg$classExpectation(["\"", "'"], false, false, false);
+	const peg$e37 = peg$classExpectation([
 		" ",
 		"	",
 		"\n",
@@ -566,7 +605,7 @@ function peg$parse(input, options) {
 		"",
 		">"
 	], true, false, false);
-	const peg$e35 = peg$classExpectation([
+	const peg$e38 = peg$classExpectation([
 		" ",
 		"	",
 		"\n",
@@ -859,16 +898,22 @@ function peg$parse(input, options) {
 	function peg$f67(s) {
 		fail("A closing tag starts with a letter after " + LB + "/", location());
 	}
-	function peg$f68() {
+	function peg$f68(value) {
+		return EMAIL_AUTOLINK.test(value);
+	}
+	function peg$f69(value) {
+		return lexeme("text", location(), { value });
+	}
+	function peg$f70() {
 		return !textMode;
 	}
-	function peg$f69(tag) {
+	function peg$f71(tag) {
 		return VOID_TAGS.has(tag.lower);
 	}
-	function peg$f70(tag) {
+	function peg$f72(tag) {
 		return null;
 	}
-	function peg$f71(tag, list, slash) {
+	function peg$f73(tag, list, slash) {
 		const lower = tag.toLowerCase();
 		return lexeme("html", location(), {
 			tag,
@@ -878,7 +923,7 @@ function peg$parse(input, options) {
 			isSelfClose: !!slash || VOID_TAGS.has(lower)
 		});
 	}
-	function peg$f72(tag, bad) {
+	function peg$f74(tag, bad) {
 		const c = input.charAt(bad);
 		if (!c) fail("Unclosed tag <" + tag + ": no > ends it (write &lt; for a < that starts no tag)", location());
 		const at = {
@@ -896,7 +941,7 @@ function peg$parse(input, options) {
 		};
 		fail("Unexpected " + JSON.stringify(c) + " in the tag <" + tag + ">: expected an attribute, or > to end the tag", at);
 	}
-	function peg$f73(tag) {
+	function peg$f75(tag) {
 		return lexeme("html", location(), {
 			tag,
 			lower: tag.toLowerCase(),
@@ -905,44 +950,44 @@ function peg$parse(input, options) {
 			isSelfClose: false
 		});
 	}
-	function peg$f74(name) {
+	function peg$f76(name) {
 		attrCode = hooks.isCodeAttribute(name);
 		return true;
 	}
-	function peg$f75(name, v) {
+	function peg$f77(name, v) {
 		return v;
 	}
-	function peg$f76(name, value) {
+	function peg$f78(name, value) {
 		return [name, value ?? ""];
 	}
-	function peg$f77(v) {
+	function peg$f79(v) {
 		return v;
 	}
-	function peg$f78(v) {
+	function peg$f80(v) {
 		return v;
 	}
-	function peg$f79(q) {
+	function peg$f81(q) {
 		fail("Unclosed attribute value: the " + q + " here has no closing " + q, location());
 	}
-	function peg$f80() {
+	function peg$f82() {
 		return !attrCode;
 	}
-	function peg$f81(bs) {
+	function peg$f83(bs) {
 		return bs.length % 2 === 1;
 	}
-	function peg$f82() {
+	function peg$f84() {
 		return !attrCode;
 	}
-	function peg$f83(start, nameEnd) {
+	function peg$f85(start, nameEnd) {
 		return skipTo(hooks.closeBrace(input, nameEnd, start));
 	}
-	function peg$f84(start, nameEnd) {
+	function peg$f86(start, nameEnd) {
 		return skipEnd - offset();
 	}
-	function peg$f85() {
+	function peg$f87() {
 		return !attrCode;
 	}
-	function peg$f86() {
+	function peg$f88() {
 		return attrCode;
 	}
 	let peg$currPos = options.peg$currPos | 0;
@@ -1133,14 +1178,17 @@ function peg$parse(input, options) {
 				if (s0 === peg$FAILED) {
 					s0 = peg$parseLinkLexeme();
 					if (s0 === peg$FAILED) {
-						s0 = peg$parseHtmlElement();
+						s0 = peg$parseEmailAutolink();
 						if (s0 === peg$FAILED) {
-							s0 = peg$parseVoidCloser();
+							s0 = peg$parseHtmlElement();
 							if (s0 === peg$FAILED) {
-								s0 = peg$parseValue();
+								s0 = peg$parseVoidCloser();
 								if (s0 === peg$FAILED) {
-									s0 = peg$parseMacroElement();
-									if (s0 === peg$FAILED) s0 = peg$parseLiteral();
+									s0 = peg$parseValue();
+									if (s0 === peg$FAILED) {
+										s0 = peg$parseMacroElement();
+										if (s0 === peg$FAILED) s0 = peg$parseLiteral();
+									}
 								}
 							}
 						}
@@ -1488,35 +1536,18 @@ function peg$parse(input, options) {
 				if (s0 === peg$FAILED) {
 					s0 = peg$parseLinkLexeme();
 					if (s0 === peg$FAILED) {
-						s0 = peg$currPos;
-						peg$savedPos = peg$currPos;
-						s1 = peg$f29();
-						if (s1) s1 = void 0;
-						else s1 = peg$FAILED;
-						if (s1 !== peg$FAILED) {
-							s2 = peg$parseHtmlOpen();
-							if (s2 !== peg$FAILED) {
-								peg$savedPos = s0;
-								s0 = peg$f30(s2);
-							} else {
-								peg$currPos = s0;
-								s0 = peg$FAILED;
-							}
-						} else {
-							peg$currPos = s0;
-							s0 = peg$FAILED;
-						}
+						s0 = peg$parseEmailAutolink();
 						if (s0 === peg$FAILED) {
 							s0 = peg$currPos;
 							peg$savedPos = peg$currPos;
-							s1 = peg$f31();
+							s1 = peg$f29();
 							if (s1) s1 = void 0;
 							else s1 = peg$FAILED;
 							if (s1 !== peg$FAILED) {
-								s2 = peg$parseHtmlClose();
+								s2 = peg$parseHtmlOpen();
 								if (s2 !== peg$FAILED) {
 									peg$savedPos = s0;
-									s0 = peg$f32(s2);
+									s0 = peg$f30(s2);
 								} else {
 									peg$currPos = s0;
 									s0 = peg$FAILED;
@@ -1526,37 +1557,57 @@ function peg$parse(input, options) {
 								s0 = peg$FAILED;
 							}
 							if (s0 === peg$FAILED) {
-								s0 = peg$parseValue();
+								s0 = peg$currPos;
+								peg$savedPos = peg$currPos;
+								s1 = peg$f31();
+								if (s1) s1 = void 0;
+								else s1 = peg$FAILED;
+								if (s1 !== peg$FAILED) {
+									s2 = peg$parseHtmlClose();
+									if (s2 !== peg$FAILED) {
+										peg$savedPos = s0;
+										s0 = peg$f32(s2);
+									} else {
+										peg$currPos = s0;
+										s0 = peg$FAILED;
+									}
+								} else {
+									peg$currPos = s0;
+									s0 = peg$FAILED;
+								}
 								if (s0 === peg$FAILED) {
-									s0 = peg$currPos;
-									s1 = peg$parseMacroTag();
-									if (s1 !== peg$FAILED) {
-										s2 = peg$currPos;
-										peg$savedPos = peg$currPos;
-										s3 = peg$f33(s1);
-										if (s3) s3 = void 0;
-										else s3 = peg$FAILED;
-										if (s3 !== peg$FAILED) {
-											s4 = peg$parseRawTokens();
-											if (s4 !== peg$FAILED) {
-												peg$savedPos = s2;
-												s2 = peg$f34(s1, s4);
+									s0 = peg$parseValue();
+									if (s0 === peg$FAILED) {
+										s0 = peg$currPos;
+										s1 = peg$parseMacroTag();
+										if (s1 !== peg$FAILED) {
+											s2 = peg$currPos;
+											peg$savedPos = peg$currPos;
+											s3 = peg$f33(s1);
+											if (s3) s3 = void 0;
+											else s3 = peg$FAILED;
+											if (s3 !== peg$FAILED) {
+												s4 = peg$parseRawTokens();
+												if (s4 !== peg$FAILED) {
+													peg$savedPos = s2;
+													s2 = peg$f34(s1, s4);
+												} else {
+													peg$currPos = s2;
+													s2 = peg$FAILED;
+												}
 											} else {
 												peg$currPos = s2;
 												s2 = peg$FAILED;
 											}
+											if (s2 === peg$FAILED) s2 = null;
+											peg$savedPos = s0;
+											s0 = peg$f35(s1, s2);
 										} else {
-											peg$currPos = s2;
-											s2 = peg$FAILED;
+											peg$currPos = s0;
+											s0 = peg$FAILED;
 										}
-										if (s2 === peg$FAILED) s2 = null;
-										peg$savedPos = s0;
-										s0 = peg$f35(s1, s2);
-									} else {
-										peg$currPos = s0;
-										s0 = peg$FAILED;
+										if (s0 === peg$FAILED) s0 = peg$parseLiteral();
 									}
-									if (s0 === peg$FAILED) s0 = peg$parseLiteral();
 								}
 							}
 						}
@@ -2698,23 +2749,136 @@ function peg$parse(input, options) {
 		else s0 = s1;
 		return s0;
 	}
+	function peg$parseEmailAutolink() {
+		let s0, s1, s2, s3, s4, s5, s6, s7;
+		s0 = peg$currPos;
+		s1 = peg$currPos;
+		s2 = peg$currPos;
+		if (input.charCodeAt(peg$currPos) === 60) {
+			s3 = peg$c6;
+			peg$currPos++;
+		} else {
+			s3 = peg$FAILED;
+			if (peg$silentFails === 0) peg$fail(peg$e10);
+		}
+		if (s3 !== peg$FAILED) {
+			s4 = [];
+			s5 = input.charAt(peg$currPos);
+			if (peg$r10.test(s5)) peg$currPos++;
+			else {
+				s5 = peg$FAILED;
+				if (peg$silentFails === 0) peg$fail(peg$e24);
+			}
+			if (s5 !== peg$FAILED) while (s5 !== peg$FAILED) {
+				s4.push(s5);
+				s5 = input.charAt(peg$currPos);
+				if (peg$r10.test(s5)) peg$currPos++;
+				else {
+					s5 = peg$FAILED;
+					if (peg$silentFails === 0) peg$fail(peg$e24);
+				}
+			}
+			else s4 = peg$FAILED;
+			if (s4 !== peg$FAILED) {
+				if (input.charCodeAt(peg$currPos) === 64) {
+					s5 = peg$c13;
+					peg$currPos++;
+				} else {
+					s5 = peg$FAILED;
+					if (peg$silentFails === 0) peg$fail(peg$e25);
+				}
+				if (s5 !== peg$FAILED) {
+					s6 = [];
+					s7 = input.charAt(peg$currPos);
+					if (peg$r11.test(s7)) peg$currPos++;
+					else {
+						s7 = peg$FAILED;
+						if (peg$silentFails === 0) peg$fail(peg$e26);
+					}
+					if (s7 !== peg$FAILED) while (s7 !== peg$FAILED) {
+						s6.push(s7);
+						s7 = input.charAt(peg$currPos);
+						if (peg$r11.test(s7)) peg$currPos++;
+						else {
+							s7 = peg$FAILED;
+							if (peg$silentFails === 0) peg$fail(peg$e26);
+						}
+					}
+					else s6 = peg$FAILED;
+					if (s6 !== peg$FAILED) {
+						if (input.charCodeAt(peg$currPos) === 62) {
+							s7 = peg$c1;
+							peg$currPos++;
+						} else {
+							s7 = peg$FAILED;
+							if (peg$silentFails === 0) peg$fail(peg$e3);
+						}
+						if (s7 !== peg$FAILED) {
+							s3 = [
+								s3,
+								s4,
+								s5,
+								s6,
+								s7
+							];
+							s2 = s3;
+						} else {
+							peg$currPos = s2;
+							s2 = peg$FAILED;
+						}
+					} else {
+						peg$currPos = s2;
+						s2 = peg$FAILED;
+					}
+				} else {
+					peg$currPos = s2;
+					s2 = peg$FAILED;
+				}
+			} else {
+				peg$currPos = s2;
+				s2 = peg$FAILED;
+			}
+		} else {
+			peg$currPos = s2;
+			s2 = peg$FAILED;
+		}
+		if (s2 !== peg$FAILED) s1 = input.substring(s1, peg$currPos);
+		else s1 = s2;
+		if (s1 !== peg$FAILED) {
+			peg$savedPos = peg$currPos;
+			s2 = peg$f68(s1);
+			if (s2) s2 = void 0;
+			else s2 = peg$FAILED;
+			if (s2 !== peg$FAILED) {
+				peg$savedPos = s0;
+				s0 = peg$f69(s1);
+			} else {
+				peg$currPos = s0;
+				s0 = peg$FAILED;
+			}
+		} else {
+			peg$currPos = s0;
+			s0 = peg$FAILED;
+		}
+		return s0;
+	}
 	function peg$parseVoidCloser() {
 		let s0, s1, s2, s3;
 		s0 = peg$currPos;
 		peg$savedPos = peg$currPos;
-		s1 = peg$f68();
+		s1 = peg$f70();
 		if (s1) s1 = void 0;
 		else s1 = peg$FAILED;
 		if (s1 !== peg$FAILED) {
 			s2 = peg$parseHtmlClose();
 			if (s2 !== peg$FAILED) {
 				peg$savedPos = peg$currPos;
-				s3 = peg$f69(s2);
+				s3 = peg$f71(s2);
 				if (s3) s3 = void 0;
 				else s3 = peg$FAILED;
 				if (s3 !== peg$FAILED) {
 					peg$savedPos = s0;
-					s0 = peg$f70(s2);
+					s0 = peg$f72(s2);
 				} else {
 					peg$currPos = s0;
 					s0 = peg$FAILED;
@@ -2766,7 +2930,7 @@ function peg$parse(input, options) {
 				}
 				if (s6 !== peg$FAILED) {
 					peg$savedPos = s0;
-					s0 = peg$f71(s2, s3, s5);
+					s0 = peg$f73(s2, s3, s5);
 				} else {
 					peg$currPos = s0;
 					s0 = peg$FAILED;
@@ -2794,10 +2958,10 @@ function peg$parse(input, options) {
 					s3 = peg$currPos;
 					peg$silentFails++;
 					s4 = input.charAt(peg$currPos);
-					if (peg$r10.test(s4)) peg$currPos++;
+					if (peg$r12.test(s4)) peg$currPos++;
 					else {
 						s4 = peg$FAILED;
-						if (peg$silentFails === 0) peg$fail(peg$e24);
+						if (peg$silentFails === 0) peg$fail(peg$e27);
 					}
 					if (s4 === peg$FAILED) {
 						s4 = peg$currPos;
@@ -2831,7 +2995,7 @@ function peg$parse(input, options) {
 						s5 = peg$parse_();
 						s6 = peg$parseHere();
 						peg$savedPos = s0;
-						s0 = peg$f72(s2, s6);
+						s0 = peg$f74(s2, s6);
 					} else {
 						peg$currPos = s0;
 						s0 = peg$FAILED;
@@ -2850,12 +3014,12 @@ function peg$parse(input, options) {
 	function peg$parseHtmlClose() {
 		let s0, s1, s2, s4;
 		s0 = peg$currPos;
-		if (input.substr(peg$currPos, 2) === peg$c13) {
-			s1 = peg$c13;
+		if (input.substr(peg$currPos, 2) === peg$c14) {
+			s1 = peg$c14;
 			peg$currPos += 2;
 		} else {
 			s1 = peg$FAILED;
-			if (peg$silentFails === 0) peg$fail(peg$e25);
+			if (peg$silentFails === 0) peg$fail(peg$e28);
 		}
 		if (s1 !== peg$FAILED) {
 			s2 = peg$parseTagName();
@@ -2870,7 +3034,7 @@ function peg$parse(input, options) {
 				}
 				if (s4 !== peg$FAILED) {
 					peg$savedPos = s0;
-					s0 = peg$f73(s2);
+					s0 = peg$f75(s2);
 				} else {
 					peg$currPos = s0;
 					s0 = peg$FAILED;
@@ -2898,18 +3062,18 @@ function peg$parse(input, options) {
 		if (s2 !== peg$FAILED) {
 			s3 = [];
 			s4 = input.charAt(peg$currPos);
-			if (peg$r11.test(s4)) peg$currPos++;
+			if (peg$r13.test(s4)) peg$currPos++;
 			else {
 				s4 = peg$FAILED;
-				if (peg$silentFails === 0) peg$fail(peg$e26);
+				if (peg$silentFails === 0) peg$fail(peg$e29);
 			}
 			while (s4 !== peg$FAILED) {
 				s3.push(s4);
 				s4 = input.charAt(peg$currPos);
-				if (peg$r11.test(s4)) peg$currPos++;
+				if (peg$r13.test(s4)) peg$currPos++;
 				else {
 					s4 = peg$FAILED;
-					if (peg$silentFails === 0) peg$fail(peg$e26);
+					if (peg$silentFails === 0) peg$fail(peg$e29);
 				}
 			}
 			s2 = [s2, s3];
@@ -2932,10 +3096,10 @@ function peg$parse(input, options) {
 		s5 = peg$currPos;
 		peg$silentFails++;
 		s6 = input.charAt(peg$currPos);
-		if (peg$r12.test(s6)) peg$currPos++;
+		if (peg$r14.test(s6)) peg$currPos++;
 		else {
 			s6 = peg$FAILED;
-			if (peg$silentFails === 0) peg$fail(peg$e27);
+			if (peg$silentFails === 0) peg$fail(peg$e30);
 		}
 		peg$silentFails--;
 		if (s6 === peg$FAILED) s5 = void 0;
@@ -2968,10 +3132,10 @@ function peg$parse(input, options) {
 			s5 = peg$currPos;
 			peg$silentFails++;
 			s6 = input.charAt(peg$currPos);
-			if (peg$r12.test(s6)) peg$currPos++;
+			if (peg$r14.test(s6)) peg$currPos++;
 			else {
 				s6 = peg$FAILED;
-				if (peg$silentFails === 0) peg$fail(peg$e27);
+				if (peg$silentFails === 0) peg$fail(peg$e30);
 			}
 			peg$silentFails--;
 			if (s6 === peg$FAILED) s5 = void 0;
@@ -3004,25 +3168,25 @@ function peg$parse(input, options) {
 		else s2 = s3;
 		if (s2 !== peg$FAILED) {
 			peg$savedPos = peg$currPos;
-			s3 = peg$f74(s2);
+			s3 = peg$f76(s2);
 			if (s3) s3 = void 0;
 			else s3 = peg$FAILED;
 			if (s3 !== peg$FAILED) {
 				s4 = peg$currPos;
 				s5 = peg$parse_();
 				if (input.charCodeAt(peg$currPos) === 61) {
-					s6 = peg$c14;
+					s6 = peg$c15;
 					peg$currPos++;
 				} else {
 					s6 = peg$FAILED;
-					if (peg$silentFails === 0) peg$fail(peg$e28);
+					if (peg$silentFails === 0) peg$fail(peg$e31);
 				}
 				if (s6 !== peg$FAILED) {
 					peg$parse_();
 					s8 = peg$parseAttrValue();
 					if (s8 !== peg$FAILED) {
 						peg$savedPos = s4;
-						s4 = peg$f75(s2, s8);
+						s4 = peg$f77(s2, s8);
 					} else {
 						peg$currPos = s4;
 						s4 = peg$FAILED;
@@ -3033,7 +3197,7 @@ function peg$parse(input, options) {
 				}
 				if (s4 === peg$FAILED) s4 = null;
 				peg$savedPos = s0;
-				s0 = peg$f76(s2, s4);
+				s0 = peg$f78(s2, s4);
 			} else {
 				peg$currPos = s0;
 				s0 = peg$FAILED;
@@ -3048,11 +3212,11 @@ function peg$parse(input, options) {
 		let s0, s1, s2, s3, s4;
 		s0 = peg$currPos;
 		if (input.charCodeAt(peg$currPos) === 34) {
-			s1 = peg$c15;
+			s1 = peg$c16;
 			peg$currPos++;
 		} else {
 			s1 = peg$FAILED;
-			if (peg$silentFails === 0) peg$fail(peg$e29);
+			if (peg$silentFails === 0) peg$fail(peg$e32);
 		}
 		if (s1 !== peg$FAILED) {
 			s2 = peg$currPos;
@@ -3060,10 +3224,10 @@ function peg$parse(input, options) {
 			s4 = peg$parseValuePart();
 			if (s4 === peg$FAILED) {
 				s4 = input.charAt(peg$currPos);
-				if (peg$r13.test(s4)) peg$currPos++;
+				if (peg$r15.test(s4)) peg$currPos++;
 				else {
 					s4 = peg$FAILED;
-					if (peg$silentFails === 0) peg$fail(peg$e30);
+					if (peg$silentFails === 0) peg$fail(peg$e33);
 				}
 			}
 			while (s4 !== peg$FAILED) {
@@ -3071,24 +3235,24 @@ function peg$parse(input, options) {
 				s4 = peg$parseValuePart();
 				if (s4 === peg$FAILED) {
 					s4 = input.charAt(peg$currPos);
-					if (peg$r13.test(s4)) peg$currPos++;
+					if (peg$r15.test(s4)) peg$currPos++;
 					else {
 						s4 = peg$FAILED;
-						if (peg$silentFails === 0) peg$fail(peg$e30);
+						if (peg$silentFails === 0) peg$fail(peg$e33);
 					}
 				}
 			}
 			s2 = input.substring(s2, peg$currPos);
 			if (input.charCodeAt(peg$currPos) === 34) {
-				s3 = peg$c15;
+				s3 = peg$c16;
 				peg$currPos++;
 			} else {
 				s3 = peg$FAILED;
-				if (peg$silentFails === 0) peg$fail(peg$e29);
+				if (peg$silentFails === 0) peg$fail(peg$e32);
 			}
 			if (s3 !== peg$FAILED) {
 				peg$savedPos = s0;
-				s0 = peg$f77(s2);
+				s0 = peg$f79(s2);
 			} else {
 				peg$currPos = s0;
 				s0 = peg$FAILED;
@@ -3100,11 +3264,11 @@ function peg$parse(input, options) {
 		if (s0 === peg$FAILED) {
 			s0 = peg$currPos;
 			if (input.charCodeAt(peg$currPos) === 39) {
-				s1 = peg$c16;
+				s1 = peg$c17;
 				peg$currPos++;
 			} else {
 				s1 = peg$FAILED;
-				if (peg$silentFails === 0) peg$fail(peg$e31);
+				if (peg$silentFails === 0) peg$fail(peg$e34);
 			}
 			if (s1 !== peg$FAILED) {
 				s2 = peg$currPos;
@@ -3112,10 +3276,10 @@ function peg$parse(input, options) {
 				s4 = peg$parseValuePart();
 				if (s4 === peg$FAILED) {
 					s4 = input.charAt(peg$currPos);
-					if (peg$r14.test(s4)) peg$currPos++;
+					if (peg$r16.test(s4)) peg$currPos++;
 					else {
 						s4 = peg$FAILED;
-						if (peg$silentFails === 0) peg$fail(peg$e32);
+						if (peg$silentFails === 0) peg$fail(peg$e35);
 					}
 				}
 				while (s4 !== peg$FAILED) {
@@ -3123,24 +3287,24 @@ function peg$parse(input, options) {
 					s4 = peg$parseValuePart();
 					if (s4 === peg$FAILED) {
 						s4 = input.charAt(peg$currPos);
-						if (peg$r14.test(s4)) peg$currPos++;
+						if (peg$r16.test(s4)) peg$currPos++;
 						else {
 							s4 = peg$FAILED;
-							if (peg$silentFails === 0) peg$fail(peg$e32);
+							if (peg$silentFails === 0) peg$fail(peg$e35);
 						}
 					}
 				}
 				s2 = input.substring(s2, peg$currPos);
 				if (input.charCodeAt(peg$currPos) === 39) {
-					s3 = peg$c16;
+					s3 = peg$c17;
 					peg$currPos++;
 				} else {
 					s3 = peg$FAILED;
-					if (peg$silentFails === 0) peg$fail(peg$e31);
+					if (peg$silentFails === 0) peg$fail(peg$e34);
 				}
 				if (s3 !== peg$FAILED) {
 					peg$savedPos = s0;
-					s0 = peg$f78(s2);
+					s0 = peg$f80(s2);
 				} else {
 					peg$currPos = s0;
 					s0 = peg$FAILED;
@@ -3152,32 +3316,32 @@ function peg$parse(input, options) {
 			if (s0 === peg$FAILED) {
 				s0 = peg$currPos;
 				s1 = input.charAt(peg$currPos);
-				if (peg$r15.test(s1)) peg$currPos++;
+				if (peg$r17.test(s1)) peg$currPos++;
 				else {
 					s1 = peg$FAILED;
-					if (peg$silentFails === 0) peg$fail(peg$e33);
+					if (peg$silentFails === 0) peg$fail(peg$e36);
 				}
 				if (s1 !== peg$FAILED) {
 					peg$savedPos = s0;
-					s1 = peg$f79(s1);
+					s1 = peg$f81(s1);
 				}
 				s0 = s1;
 				if (s0 === peg$FAILED) {
 					s0 = peg$currPos;
 					s1 = [];
 					s2 = input.charAt(peg$currPos);
-					if (peg$r16.test(s2)) peg$currPos++;
+					if (peg$r18.test(s2)) peg$currPos++;
 					else {
 						s2 = peg$FAILED;
-						if (peg$silentFails === 0) peg$fail(peg$e34);
+						if (peg$silentFails === 0) peg$fail(peg$e37);
 					}
 					while (s2 !== peg$FAILED) {
 						s1.push(s2);
 						s2 = input.charAt(peg$currPos);
-						if (peg$r16.test(s2)) peg$currPos++;
+						if (peg$r18.test(s2)) peg$currPos++;
 						else {
 							s2 = peg$FAILED;
-							if (peg$silentFails === 0) peg$fail(peg$e34);
+							if (peg$silentFails === 0) peg$fail(peg$e37);
 						}
 					}
 					s0 = input.substring(s0, peg$currPos);
@@ -3190,7 +3354,7 @@ function peg$parse(input, options) {
 		let s0, s1, s2, s3, s4, s5, s6, s7, s8, s9, s10, s11, s12, s13;
 		s0 = peg$currPos;
 		peg$savedPos = peg$currPos;
-		s1 = peg$f80();
+		s1 = peg$f82();
 		if (s1) s1 = void 0;
 		else s1 = peg$FAILED;
 		if (s1 !== peg$FAILED) {
@@ -3219,7 +3383,7 @@ function peg$parse(input, options) {
 			if (s2 !== peg$FAILED) {
 				s3 = peg$currPos;
 				peg$savedPos = peg$currPos;
-				s4 = peg$f81(s2);
+				s4 = peg$f83(s2);
 				if (s4) s4 = void 0;
 				else s4 = peg$FAILED;
 				if (s4 !== peg$FAILED) {
@@ -3258,7 +3422,7 @@ function peg$parse(input, options) {
 		if (s0 === peg$FAILED) {
 			s0 = peg$currPos;
 			peg$savedPos = peg$currPos;
-			s1 = peg$f82();
+			s1 = peg$f84();
 			if (s1) s1 = void 0;
 			else s1 = peg$FAILED;
 			if (s1 !== peg$FAILED) {
@@ -3285,12 +3449,12 @@ function peg$parse(input, options) {
 						if (s6 !== peg$FAILED) {
 							s7 = peg$parseHere();
 							peg$savedPos = peg$currPos;
-							s8 = peg$f83(s4, s7);
+							s8 = peg$f85(s4, s7);
 							if (s8) s8 = void 0;
 							else s8 = peg$FAILED;
 							if (s8 !== peg$FAILED) {
 								s9 = peg$currPos;
-								s10 = peg$f84(s4, s7);
+								s10 = peg$f86(s4, s7);
 								s11 = peg$currPos;
 								s12 = [];
 								if (s12.length >= (s10 | 0)) s13 = peg$FAILED;
@@ -3372,7 +3536,7 @@ function peg$parse(input, options) {
 			if (s0 === peg$FAILED) {
 				s0 = peg$currPos;
 				peg$savedPos = peg$currPos;
-				s1 = peg$f85();
+				s1 = peg$f87();
 				if (s1) s1 = void 0;
 				else s1 = peg$FAILED;
 				if (s1 !== peg$FAILED) {
@@ -3463,7 +3627,7 @@ function peg$parse(input, options) {
 				if (s0 === peg$FAILED) {
 					s0 = peg$currPos;
 					peg$savedPos = peg$currPos;
-					s1 = peg$f86();
+					s1 = peg$f88();
 					if (s1) s1 = void 0;
 					else s1 = peg$FAILED;
 					if (s1 !== peg$FAILED) {
@@ -3545,10 +3709,10 @@ function peg$parse(input, options) {
 	function peg$parse_c() {
 		let s0;
 		s0 = input.charAt(peg$currPos);
-		if (peg$r17.test(s0)) peg$currPos++;
+		if (peg$r19.test(s0)) peg$currPos++;
 		else {
 			s0 = peg$FAILED;
-			if (peg$silentFails === 0) peg$fail(peg$e35);
+			if (peg$silentFails === 0) peg$fail(peg$e38);
 		}
 		return s0;
 	}
@@ -9893,6 +10057,86 @@ function parseMarkup(source, options = {}) {
 function tokenizeMarkup(source, options = {}) {
 	return run$2(source, "Tokens", options);
 }
+/**
+* `tokenizeMarkup` for half-typed markup: the tokens it can read, and every
+* error, instead of throwing at the first. At a malformed tag, the tokens
+* before it are kept, its first character is read as text and tokenizing
+* resumes after it, so what follows is read as if the tag had not been
+* started. Tokens and errors have offsets in `source`; for well-formed
+* markup the tokens are those of `tokenizeMarkup` and there are no errors.
+*/
+function tokenizeMarkupTolerant(source, options = {}) {
+	const tokens = [];
+	const errors = [];
+	const lastBrace = source.lastIndexOf("}");
+	const { closeBrace } = {
+		...defaultHooks,
+		...options.hooks
+	};
+	/** `text` shifted by `base`, tokenized: the tokens or the error. */
+	const attempt = (text, base) => {
+		const hooks = {
+			...options.hooks,
+			closeBrace: (input, codeStart, lenientStart) => base + Math.min(codeStart, lenientStart) > lastBrace ? -1 : closeBrace(input, codeStart, lenientStart)
+		};
+		try {
+			return tokenizeMarkup(text, {
+				...options,
+				hooks
+			}).map((token) => shift(token, base));
+		} catch (error) {
+			if (!(error instanceof MarkupError)) throw error;
+			return error;
+		}
+	};
+	let base = 0;
+	while (base <= source.length) {
+		const rest = source.slice(base);
+		const result = attempt(rest, base);
+		if (Array.isArray(result)) {
+			tokens.push(...result);
+			break;
+		}
+		const at = base + result.offset;
+		const { line, column } = lineColumn(source, at);
+		errors.push(new MarkupError(result.reason, at, line, column));
+		let cut = result.offset;
+		let prefix = attempt(rest.slice(0, cut), base);
+		while (!Array.isArray(prefix)) {
+			cut = prefix.offset;
+			prefix = attempt(rest.slice(0, cut), base);
+		}
+		tokens.push(...prefix);
+		if (cut < rest.length) {
+			const start = base + cut;
+			tokens.push({
+				type: "text",
+				value: rest[cut],
+				start,
+				end: start + 1
+			});
+		}
+		base += cut + 1;
+	}
+	return {
+		tokens,
+		errors
+	};
+}
+/** `token` with its offsets moved `by` on. */
+function shift(token, by) {
+	if (by === 0) return token;
+	const moved = {
+		...token,
+		start: token.start + by,
+		end: token.end + by
+	};
+	if (moved.type === "link") {
+		moved.targetStart += by;
+		moved.targetEnd += by;
+	}
+	return moved;
+}
 //#endregion
 //#region src/utils/namespace.ts
 /** The variable name no namespace can hold. */
@@ -10567,28 +10811,34 @@ function parseWidgetDef(rawArgs) {
 	return widgetDef(parseMacroArgs(rawArgs, WIDGET_PARAMETERS));
 }
 /**
-* A definition: its arguments (read like a {widget} macro's, see
-* parseWidgetDef) and its body. Macro names are not case-sensitive.
-*/
-var WIDGET_DEFINITION = /\{widget\s+([^}]*)\}([\s\S]*?)\{\/widget\}/gi;
-/** `{@children}`, also with selectors such as `{.highlight @children}`. */
-var CHILDREN_PLACEHOLDER = /\{[^{}]*@children\s*\}/;
-/**
 * The names of the block widgets (those whose body renders `{@children}`)
 * that StoryInit and the passages tagged `widget` define. They must be
 * known as block macros before any passage is parsed, so that passages
 * invoking them nest their content whatever the passage order.
+*
+* The passages are read as flat tokens, which need no block macros to be
+* known, so a `{@children}` in an HTML comment or in a `{do}` body is text
+* here as it is to the parser, and does not make a block widget (#387).
 */
 function blockWidgetNames(passages) {
 	const names = [];
 	for (const passage of passages) {
 		if (passage.name !== "StoryInit" && !passage.tags?.includes("widget")) continue;
-		for (const match of passage.content.matchAll(WIDGET_DEFINITION)) {
-			if (!CHILDREN_PLACEHOLDER.test(match[2])) continue;
+		const open = [];
+		for (const token of tokenizeMarkupTolerant(passage.content).tokens) if (token.type === "macro" && token.name.toLowerCase() === "widget") {
+			if (!token.isClose) {
+				open.push({
+					rawArgs: token.rawArgs,
+					isBlock: false
+				});
+				continue;
+			}
+			const def = open.pop();
+			if (!def?.isBlock) continue;
 			try {
-				names.push(parseWidgetDef(match[1]).name);
+				names.push(parseWidgetDef(def.rawArgs).name);
 			} catch {}
-		}
+		} else if (token.type === "variable" && token.scope === "local" && token.name === "children" && open.length > 0) open[open.length - 1].isBlock = true;
 	}
 	return names;
 }
@@ -11108,6 +11358,13 @@ function wrapContent(className, id, content) {
 function hasInterpolation(s) {
 	return s.includes("{") || s.includes("}");
 }
+/** The children context for an invocation's `children`, or null if none. */
+function widgetChildrenOf(children, outer) {
+	return children?.length ? {
+		nodes: children,
+		outer: outer ?? null
+	} : null;
+}
 var parseCache = /* @__PURE__ */ new Map();
 var PARSE_CACHE_LIMIT = 2e3;
 /**
@@ -11193,7 +11450,7 @@ var TextEvaluator = class {
 				if (node.scope === "local" && node.name === "children") {
 					const children = scope.widgetChildren;
 					if (!children) return "";
-					return this.nested("children", children, scope, depth, { widgetChildren: null });
+					return this.nested("children", children.nodes, scope, depth, { widgetChildren: children.outer });
 				}
 				return this.variable(node.scope, node.name, scope);
 			case "expression": try {
@@ -11256,7 +11513,7 @@ var TextEvaluator = class {
 			}
 			return this.nested(node.name, widget.body, scope, depth, {
 				locals,
-				widgetChildren: node.children.length > 0 ? node.children : null
+				widgetChildren: widgetChildrenOf(node.children, scope.widgetChildren)
 			});
 		}
 		const text = getMacroText(node.name);
@@ -11514,7 +11771,8 @@ function WidgetInvocation(props) {
 function WidgetContent({ body, params, rawArgs, invocationChildren }) {
 	const parentValues = useRenderOptions().locals;
 	const [mergedVars, mergedTemps, mergedLocals, mergedTrans] = useMergedLocals();
-	const childrenValue = invocationChildren?.length ? invocationChildren : null;
+	const outerChildren = useContext(WidgetChildrenContext);
+	const childrenValue = useMemo(() => widgetChildrenOf(invocationChildren, outerChildren), [invocationChildren, outerChildren]);
 	const argExprs = rawArgs ? splitArgs(rawArgs) : [];
 	const values = [];
 	for (let i = 0; i < params.length; i++) {
@@ -11796,6 +12054,19 @@ var InlineContext = createContext(false);
 */
 var RawTextContext = createContext(false);
 /**
+* The view content is rendered in: '' for the story interface, and an id of
+* its own for each passage and dialog on display (see useViewScope). The
+* radiobuttons of a variable form a native group within their view only:
+* one group across views would let a dialog's checked button uncheck the
+* passage's when it mounts (#396).
+*/
+var ViewScopeContext = createContext("");
+var viewScopes = 0;
+/** A new view scope (see ViewScopeContext), kept while mounted. */
+function useViewScope() {
+	return useState(() => `v${++viewScopes}`)[0];
+}
+/**
 * True inside an `<svg>` element. SVG attributes are case-sensitive and have
 * no live form properties, so they are set as written (see splitAttributes).
 */
@@ -12282,10 +12553,13 @@ function HtmlNodeRenderer({ node }) {
 	}) : element);
 }
 function ChildrenSlot() {
-	const childrenAST = useContext(WidgetChildrenContext);
+	const children = useContext(WidgetChildrenContext);
 	const renderOptions = useRenderOptions();
-	if (!childrenAST || childrenAST.length === 0) return null;
-	return /* @__PURE__ */ jsx(Fragment$1, { children: renderNodes(childrenAST, renderOptions) });
+	if (!children) return null;
+	return /* @__PURE__ */ jsx(WidgetChildrenContext.Provider, {
+		value: children.outer,
+		children: renderNodes(children.nodes, renderOptions)
+	});
 }
 /**
 * Stable per-node keys. Keying rendered children by AST node identity (not
@@ -13194,10 +13468,92 @@ function stringify_primitive(thing) {
 	return String(thing);
 }
 //#endregion
+//#region src/utils/value-kinds.ts
+var toStringTag = (value) => Object.prototype.toString.call(value).slice(8, -1);
+/** Temporal values are immutable: copies may share them. */
+var isTemporal = (value) => toStringTag(value).startsWith("Temporal.");
+/** new Number(), new String(), new Boolean(), Object(1n). */
+var isBoxed = (value) => value instanceof Number || value instanceof String || value instanceof Boolean || toStringTag(value) === "BigInt";
+/**
+* Values compared and copied as a whole, by their content: they have no
+* own keys to merge by, or their keys are not the data (a property written
+* into one would be dropped by clones and saves, and by Immer for Map and
+* Set).
+*/
+function isAtomic(value) {
+	return value instanceof Date || value instanceof RegExp || value instanceof Map || value instanceof Set || ArrayBuffer.isView(value) || value instanceof ArrayBuffer || value instanceof URL || value instanceof URLSearchParams || value instanceof Error || isBoxed(value) || isTemporal(value);
+}
+/** "a Map", "an Error", ... for an atomic value (see isAtomic), else undefined. */
+function atomicName(value) {
+	if (!isAtomic(value)) return void 0;
+	const tag = value instanceof Error ? "Error" : toStringTag(value);
+	return `${/^[AEIOU]/.test(tag) ? "an" : "a"} ${tag}`;
+}
+/** Whether `key` is an index of an array element. */
+var isIndexKey = (key) => key !== "4294967295" && String(Number(key) >>> 0) === key;
+/**
+* The own enumerable string keys of a collection (an Array, Map or Set) that
+* are not its elements: what an instance of a subclass may hold besides
+* them.
+*/
+function extraKeys(collection) {
+	const keys = Object.keys(collection);
+	return Array.isArray(collection) ? keys.filter((k) => !isIndexKey(k)) : keys;
+}
+/** The entries of a Map, as the built-in iterator gives them. */
+function mapEntries(map) {
+	return isDraft(map) ? map.entries() : Map.prototype.entries.call(map);
+}
+/** The members of a Set, as the built-in iterator gives them. */
+function setMembers(set) {
+	return isDraft(set) ? set.values() : Set.prototype.values.call(set);
+}
+/** The number of entries of a Map or members of a Set. */
+function collectionSize(collection) {
+	if (isDraft(collection)) return collection.size;
+	const proto = collection instanceof Map ? Map.prototype : Set.prototype;
+	return Reflect.get(proto, "size", collection);
+}
+/** The value a Map holds for `key`. */
+function mapGet(map, key) {
+	return isDraft(map) ? map.get(key) : Map.prototype.get.call(map, key);
+}
+/** Make a Map hold `value` for `key`. */
+function mapSet(map, key, value) {
+	if (isDraft(map)) map.set(key, value);
+	else Map.prototype.set.call(map, key, value);
+}
+//#endregion
 //#region src/class-registry.ts
 var registry = /* @__PURE__ */ new Map();
 var ctorToName = /* @__PURE__ */ new Map();
+/**
+* Built-ins whose instances hold their value in internal slots that a save
+* cannot rebuild: a registered class cannot extend them. (Array, Map, Set,
+* Date, RegExp and Error can be extended, see classData.)
+*/
+var UNSUPPORTED_BASES = [
+	ArrayBuffer,
+	DataView,
+	Object.getPrototypeOf(Int8Array),
+	URL,
+	URLSearchParams,
+	Number,
+	String,
+	Boolean,
+	Promise,
+	WeakMap,
+	WeakSet,
+	Function
+];
+/**
+* Register `ctor` as `name`, so that its instances keep their class through
+* copies, history and saves. Throws for a class extending a built-in whose
+* instances cannot be saved (see UNSUPPORTED_BASES).
+*/
 function registerClass(name, ctor) {
+	const base = typeof ctor === "function" ? UNSUPPORTED_BASES.find((b) => ctor.prototype instanceof b) : void 0;
+	if (base) throw new TypeError(`spindle: Cannot register class "${name}": it extends ${base.name}, whose instances cannot be saved (a registered class may extend Array, Map, Set, Date, RegExp or Error)`);
 	registry.set(name, ctor);
 	ctorToName.set(ctor, name);
 }
@@ -13233,6 +13589,9 @@ var ERROR_HIDDEN_KEYS$1 = [
 	"errors"
 ];
 var isObject = (v) => typeof v === "object" && v !== null;
+/** Whether `v` is a plain object (as devalue revives one). */
+var isPlainData = (v) => isObject(v) && Object.getPrototypeOf(v) === Object.prototype;
+var malformedClass = (name) => /* @__PURE__ */ new TypeError(`spindle: Malformed data for class "${name}"`);
 var defineData = (target, key, value) => {
 	Object.defineProperty(target, key, {
 		value,
@@ -13252,15 +13611,69 @@ function refuseSymbolKeys(value) {
 * Own enumerable keys of `value`, as a plain object; for an error also its
 * message, cause and (AggregateError) errors, which are not enumerable.
 */
-function ownData(value) {
+function ownData(value, keys = Object.keys(value)) {
 	refuseSymbolKeys(value);
 	const data = {};
 	if (value instanceof Error) {
 		for (const key of ERROR_HIDDEN_KEYS$1) if (hasOwn(value, key)) defineData(data, key, value[key]);
 	}
-	for (const key of Object.keys(value)) defineData(data, key, value[key]);
+	for (const key of keys) defineData(data, key, value[key]);
 	return data;
 }
+/**
+* The built-ins a registered class may extend whose value is not in its
+* keys, saved as their kind (see classData).
+*/
+var BUILTIN_KINDS = {
+	Array,
+	Map,
+	Set,
+	Date,
+	RegExp
+};
+/**
+* The saved form of a registered class instance: its own data (see
+* ownData), or for a subclass of a built-in kind (see BUILTIN_KINDS) its
+* kind, contents and extra keys, read with the built-in methods, which a
+* subclass may override (#391, #393).
+*/
+function classData(value) {
+	const extra = () => ownData(value, extraKeys(value));
+	if (Array.isArray(value)) {
+		const items = new Array(value.length);
+		for (let i = 0; i < value.length; i++) if (i in value) items[i] = value[i];
+		return [
+			"Array",
+			items,
+			extra()
+		];
+	}
+	if (value instanceof Map) return [
+		"Map",
+		Array.from(mapEntries(value)),
+		extra()
+	];
+	if (value instanceof Set) return [
+		"Set",
+		Array.from(setMembers(value)),
+		extra()
+	];
+	if (value instanceof Date) return [
+		"Date",
+		Date.prototype.getTime.call(value),
+		extra()
+	];
+	if (value instanceof RegExp) return [
+		"RegExp",
+		[
+			Reflect.get(RegExp.prototype, "source", value),
+			Reflect.get(RegExp.prototype, "flags", value),
+			value.lastIndex
+		],
+		extra()
+	];
+	return ownData(value);
+}
 /** Make an error's message, cause and errors non-enumerable again. */
 function hideErrorKeys(value) {
 	for (const key of ERROR_HIDDEN_KEYS$1) if (hasOwn(value, key)) Object.defineProperty(value, key, { enumerable: false });
@@ -13269,7 +13682,7 @@ function hideErrorKeys(value) {
 var isEscapedOneCharKey = (key) => key.length === 1 && JSON.stringify(key).length > 3;
 function reducers() {
 	const out = {};
-	for (const [name, ctor] of registry) out[CLASS_PREFIX + name] = (v) => isObject(v) && Object.getPrototypeOf(v) === ctor.prototype && ownData(v);
+	for (const [name, ctor] of registry) out[CLASS_PREFIX + name] = (v) => isObject(v) && Object.getPrototypeOf(v) === ctor.prototype && classData(v);
 	for (const [proto, name] of BUILTIN_ERRORS) out[ERROR_PREFIX + name] = (v) => isObject(v) && Object.getPrototypeOf(v) === proto && ownData(v);
 	out[SYMBOL_TAG] = (v) => {
 		if (typeof v !== "symbol") return false;
@@ -13282,7 +13695,7 @@ function reducers() {
 		v.lastIndex
 	];
 	out[KEYS_TAG] = (v) => {
-		if (!isObject(v) || Object.getPrototypeOf(v) !== Object.prototype) return false;
+		if (!isPlainData(v)) return false;
 		const keys = Object.keys(v);
 		if (!keys.some(isEscapedOneCharKey)) return false;
 		refuseSymbolKeys(v);
@@ -13291,27 +13704,93 @@ function reducers() {
 	};
 	return out;
 }
+/**
+* The RegExp of a `[source, flags, lastIndex]` list (an `R` entry, or the
+* contents of a RegExp subclass), or undefined if the list is malformed.
+*/
+function newRegExp(data) {
+	if (!Array.isArray(data) || typeof data[0] !== "string" || typeof data[1] !== "string" || !Number.isSafeInteger(data[2])) return;
+	const re = new RegExp(data[0], data[1]);
+	re.lastIndex = data[2];
+	return re;
+}
+/**
+* A new Date or RegExp holding `contents` (see classData), or undefined if
+* they are malformed.
+*/
+function newAtomic(kind, contents) {
+	if (kind === "RegExp") return newRegExp(contents);
+	return typeof contents === "number" ? new Date(contents) : void 0;
+}
+/**
+* The built-in of a registered class that a `[kind, contents, keys]` list
+* holds (see classData). A cycle through a collection revives it before its
+* list is complete (devalue holds unread parts as holes), so the instance
+* is kept per list and filled with what the list holds so far. (The
+* contents of a Date or RegExp hold no objects, so they are complete.)
+*/
+var collections = /* @__PURE__ */ new WeakMap();
+function reviveBuiltin(name, ctor, list) {
+	const [kind, contents, keys] = list;
+	const base = typeof kind === "string" && hasOwn(BUILTIN_KINDS, kind) ? BUILTIN_KINDS[kind] : void 0;
+	const atomic = kind === "Date" || kind === "RegExp";
+	if (list.length !== 3 || !base || !(ctor.prototype instanceof base) || !atomic && hasOwn(list, 1) && !Array.isArray(contents) || hasOwn(list, 2) && !isPlainData(keys)) throw malformedClass(name);
+	let made = collections.get(list);
+	if (!made) {
+		const value = atomic ? newAtomic(kind, contents) : new base();
+		if (!value) throw malformedClass(name);
+		made = Object.setPrototypeOf(value, ctor.prototype);
+		collections.set(list, made);
+	}
+	if (!atomic && Array.isArray(contents)) fillCollection(made, contents);
+	if (isPlainData(keys)) for (const key of Object.keys(keys)) defineData(made, key, keys[key]);
+	return made;
+}
+/** Set the elements of a revived collection, with the built-in methods. */
+function fillCollection(made, contents) {
+	if (Array.isArray(made)) {
+		made.length = contents.length;
+		for (let i = 0; i < contents.length; i++) if (hasOwn(contents, i)) made[i] = contents[i];
+		else delete made[i];
+	} else if (made instanceof Map) {
+		Map.prototype.clear.call(made);
+		for (const entry of contents) {
+			if (!Array.isArray(entry) || entry.length !== 2) throw new TypeError("spindle: Malformed map entries");
+			Map.prototype.set.call(made, entry[0], entry[1]);
+		}
+	} else {
+		Set.prototype.clear.call(made);
+		for (const member of contents) Set.prototype.add.call(made, member);
+	}
+}
 /** Restore a registered class instance in place, so cycles through it hold. */
 function reviveClass(name) {
 	return (data) => {
-		if (!isObject(data) || Object.getPrototypeOf(data) !== Object.prototype) {
+		if (Array.isArray(data)) return reviveBuiltin(name, registeredCtor(name), data);
+		if (!isPlainData(data)) {
 			if (isObject(data) && registeredClassName(data) === name) return data;
-			throw new TypeError(`spindle: Malformed data for class "${name}"`);
+			throw malformedClass(name);
 		}
-		const ctor = registry.get(name);
-		if (!ctor) throw new TypeError(`spindle: The save holds an instance of class "${name}", which is not registered`);
+		const ctor = registeredCtor(name);
+		if (Object.values(BUILTIN_KINDS).some((c) => ctor.prototype instanceof c)) throw malformedClass(name);
 		Object.setPrototypeOf(data, ctor.prototype);
 		if (data instanceof Error) hideErrorKeys(data);
 		return data;
 	};
 }
+/** The class registered as `name`; throws if there is none. */
+function registeredCtor(name) {
+	const ctor = registry.get(name);
+	if (!ctor) throw new TypeError(`spindle: The save holds an instance of class "${name}", which is not registered`);
+	return ctor;
+}
 /** Restore a built-in error in place, like a class instance. */
 function reviveError(name) {
 	const ctor = ERROR_CTORS.get(name);
 	if (!ctor) return void 0;
 	return (data) => {
 		if (Object.getPrototypeOf(data) === ctor.prototype) return data;
-		if (!isObject(data) || Object.getPrototypeOf(data) !== Object.prototype) throw new TypeError(`spindle: Malformed data for "${name}"`);
+		if (!isPlainData(data)) throw new TypeError(`spindle: Malformed data for "${name}"`);
 		Object.setPrototypeOf(data, ctor.prototype);
 		hideErrorKeys(data);
 		return data;
@@ -13355,9 +13834,8 @@ function reviverFor(key) {
 	};
 	if (key === KEYS_TAG) return reviveKeyed;
 	if (key === REGEXP_TAG) return (data) => {
-		if (!Array.isArray(data) || typeof data[0] !== "string" || typeof data[1] !== "string" || !Number.isSafeInteger(data[2])) throw new TypeError("spindle: Malformed regular expression");
-		const re = new RegExp(data[0], data[1]);
-		re.lastIndex = data[2];
+		const re = newRegExp(data);
+		if (!re) throw new TypeError("spindle: Malformed regular expression");
 		return re;
 	};
 	if (key.startsWith(CLASS_PREFIX)) return reviveClass(key.slice(2));
@@ -13908,28 +14386,6 @@ function getBackendType() {
 	return _backend?.type ?? "memory";
 }
 //#endregion
-//#region src/utils/value-kinds.ts
-var toStringTag = (value) => Object.prototype.toString.call(value).slice(8, -1);
-/** Temporal values are immutable: copies may share them. */
-var isTemporal = (value) => toStringTag(value).startsWith("Temporal.");
-/** new Number(), new String(), new Boolean(), Object(1n). */
-var isBoxed = (value) => value instanceof Number || value instanceof String || value instanceof Boolean || toStringTag(value) === "BigInt";
-/**
-* Values compared and copied as a whole, by their content: they have no
-* own keys to merge by, or their keys are not the data (a property written
-* into one would be dropped by clones and saves, and by Immer for Map and
-* Set).
-*/
-function isAtomic(value) {
-	return value instanceof Date || value instanceof RegExp || value instanceof Map || value instanceof Set || ArrayBuffer.isView(value) || value instanceof ArrayBuffer || value instanceof URL || value instanceof URLSearchParams || value instanceof Error || isBoxed(value) || isTemporal(value);
-}
-/** "a Map", "an Error", ... for an atomic value (see isAtomic), else undefined. */
-function atomicName(value) {
-	if (!isAtomic(value)) return void 0;
-	const tag = value instanceof Error ? "Error" : toStringTag(value);
-	return `${/^[AEIOU]/.test(tag) ? "an" : "a"} ${tag}`;
-}
-//#endregion
 //#region src/utils/object-path.ts
 /**
 * Traverse dot-path segments on an object and return the nested value.
@@ -14058,6 +14514,20 @@ function isPlainObject(value) {
 	const proto = Object.getPrototypeOf(value);
 	return proto === Object.prototype || proto === null;
 }
+/**
+* `empty`, a new built-in (an Array, Map, Set, Date or RegExp) standing for
+* `obj`, made like it: an instance of a registered subclass keeps its class
+* and its extra keys (#391, #393), with the values `value` gives for them;
+* other built-ins are plain. `made` gets it before its keys are filled, so
+* that cycles through it find it.
+*/
+function builtinLike(obj, empty, made, value) {
+	made(empty);
+	if (registeredClassName(obj) === void 0) return empty;
+	Object.setPrototypeOf(empty, Object.getPrototypeOf(obj));
+	for (const key of extraKeys(obj)) setOwn(empty, key, value(key));
+	return empty;
+}
 /** Own keys of an error that are not enumerable but are data. */
 var ERROR_HIDDEN_KEYS = [
 	"message",
@@ -14084,11 +14554,11 @@ function deepClone(value, options = {}) {
 		return copy;
 	}
 	function cloneBuiltin(val) {
-		if (val instanceof Date) return keep(val, new Date(val.getTime()));
+		if (val instanceof Date) return builtin(val, new Date(Date.prototype.getTime.call(val)));
 		if (val instanceof RegExp) {
-			const copy = new RegExp(val.source, val.flags);
+			const copy = new RegExp(Reflect.get(RegExp.prototype, "source", val), Reflect.get(RegExp.prototype, "flags", val));
 			copy.lastIndex = val.lastIndex;
-			return keep(val, copy);
+			return builtin(val, copy);
 		}
 		if (val instanceof ArrayBuffer) return keep(val, val.slice(0));
 		if (ArrayBuffer.isView(val)) {
@@ -14119,27 +14589,29 @@ function deepClone(value, options = {}) {
 		const settle = options.settle;
 		return settle && isObjectValue(copy) && isObjectValue(original) ? settle(copy, original) : copy;
 	}
+	/** `empty`, made the copy of the built-in `obj` (see builtinLike). */
+	const builtin = (obj, empty) => builtinLike(obj, empty, (copy) => keep(obj, copy), (key) => clone(obj[key]));
 	function clone(val) {
 		if (val === null || typeof val !== "object") return val;
 		const obj = val;
 		if (seen.has(obj)) return seen.get(obj);
 		if (Array.isArray(val)) {
-			const arr = keep(obj, new Array(val.length));
+			const arr = builtin(obj, new Array(val.length));
 			for (let i = 0; i < val.length; i++) if (i in val) arr[i] = clone(val[i]);
 			return arr;
 		}
 		if (val instanceof Map) {
-			const copy = keep(obj, /* @__PURE__ */ new Map());
-			for (const [k, v] of val) copy.set(settled(clone(k), k), clone(v));
+			const copy = builtin(obj, /* @__PURE__ */ new Map());
+			for (const [k, v] of mapEntries(val)) Map.prototype.set.call(copy, settled(clone(k), k), clone(v));
 			return copy;
 		}
 		if (val instanceof Set) {
-			const copy = keep(obj, /* @__PURE__ */ new Set());
-			for (const v of val) copy.add(settled(clone(v), v));
+			const copy = builtin(obj, /* @__PURE__ */ new Set());
+			for (const v of setMembers(val)) Set.prototype.add.call(copy, settled(clone(v), v));
 			return copy;
 		}
-		const builtin = cloneBuiltin(obj);
-		if (builtin !== void 0) return builtin;
+		const copied = cloneBuiltin(obj);
+		if (copied !== void 0) return copied;
 		const keepsProto = registeredClassName(obj) !== void 0 || isPlainObject(val);
 		if (!keepsProto && options.keepUnregistered) return val;
 		return copyKeys(obj, keep(obj, keepsProto ? Object.create(Object.getPrototypeOf(obj)) : {}));
@@ -14238,23 +14710,26 @@ function shareEqual(prev, curr) {
 		if (placed !== void 0) return placed;
 		if (!isObjectValue(p)) return fresh(c);
 		if (reuse(p, c)) return p;
+		const pr = p;
+		const cr = c;
+		/** What the result holds at `key` of `c`. */
+		const shareKey = (key) => share(hasOwn(pr, key) ? pr[key] : void 0, cr[key]);
+		/** `empty`, made the result for the collection `c` (see builtinLike). */
+		const collection = (empty) => builtinLike(c, empty, (out) => done.set(c, out), shareKey);
 		if (c instanceof Map && p instanceof Map) {
-			const out = /* @__PURE__ */ new Map();
-			done.set(c, out);
-			for (const [k, v] of c) out.set(fresh(k), share(p.get(k), v));
+			const out = collection(/* @__PURE__ */ new Map());
+			for (const [k, v] of mapEntries(c)) Map.prototype.set.call(out, fresh(k), share(mapGet(p, k), v));
 			return out;
 		}
 		if (Array.isArray(c) && Array.isArray(p)) {
-			const out = new Array(c.length);
-			done.set(c, out);
+			const out = collection(new Array(c.length));
 			for (let i = 0; i < c.length; i++) if (i in c) out[i] = share(p[i], c[i]);
 			return out;
 		}
 		if (mergesWith(p, c, false)) {
 			const out = Object.create(Object.getPrototypeOf(c));
 			done.set(c, out);
-			const cr = c;
-			for (const key of Object.keys(cr)) setOwn(out, key, share(hasOwn(p, key) ? p[key] : void 0, cr[key]));
+			for (const key of Object.keys(cr)) setOwn(out, key, shareKey(key));
 			return out;
 		}
 		return fresh(c);
@@ -14271,8 +14746,14 @@ function equalBytes(a, b) {
 }
 /** Equality of the content of atomic built-ins (see isAtomic) but Map/Set. */
 function equalBuiltin(a, b, assumed) {
-	if (a instanceof Date) return Object.is(a.getTime(), b.getTime());
-	if (a instanceof RegExp) return String(a) === String(b) && a.lastIndex === b.lastIndex;
+	if (a instanceof Date) {
+		const time = Date.prototype.getTime;
+		return Object.is(time.call(a), time.call(b)) && equalExtraKeys(a, b, assumed);
+	}
+	if (a instanceof RegExp) {
+		const text = RegExp.prototype.toString;
+		return text.call(a) === text.call(b) && a.lastIndex === b.lastIndex && equalExtraKeys(a, b, assumed);
+	}
 	if (ArrayBuffer.isView(a)) {
 		const v = b;
 		return a.byteOffset === v.byteOffset && a.byteLength === v.byteLength && equal(a.buffer, v.buffer, assumed);
@@ -14283,14 +14764,29 @@ function equalBuiltin(a, b, assumed) {
 	if (isTemporal(a)) return String(a) === String(b);
 	if (a instanceof Error) return ERROR_HIDDEN_KEYS.every((key) => hasOwn(a, key) === hasOwn(b, key) && equal(a[key], b[key], assumed)) && equalKeys(a, b, assumed);
 }
-function equalKeys(a, b, assumed) {
+function equalKeys(a, b, assumed, keysOf = Object.keys) {
 	const ao = a;
 	const bo = b;
-	const keys = Object.keys(ao);
-	if (keys.length !== Object.keys(bo).length) return false;
+	const keys = keysOf(ao);
+	if (keys.length !== keysOf(bo).length) return false;
 	for (const key of keys) if (!hasOwn(bo, key) || !equal(ao[key], bo[key], assumed)) return false;
 	return true;
 }
+/** Built-in prototypes (see builtinLike), whose instances hold no extra keys. */
+var BUILTIN_PROTOS = new Set([
+	Array.prototype,
+	Map.prototype,
+	Set.prototype,
+	Date.prototype,
+	RegExp.prototype
+]);
+/**
+* Equality of the extra keys (see extraKeys) of two built-ins of one
+* class: those of a subclass instance are part of its value.
+*/
+function equalExtraKeys(a, b, assumed) {
+	return BUILTIN_PROTOS.has(Object.getPrototypeOf(a)) || equalKeys(a, b, assumed, extraKeys);
+}
 /** `assumed` tracks the pairs of objects met (see Pairs). */
 function equal(a, b, assumed) {
 	if (Object.is(a, b) && !(assumed.strict && isObjectValue(a))) return true;
@@ -14300,11 +14796,11 @@ function equal(a, b, assumed) {
 	if (met !== void 0) return met;
 	if (a instanceof Map || a instanceof Set) {
 		const bc = b;
-		if (a.size !== bc.size) return false;
-		const ai = a.entries();
-		const bi = bc.entries();
+		if (collectionSize(a) !== collectionSize(bc)) return false;
+		const ai = a instanceof Map ? mapEntries(a) : setMembers(a);
+		const bi = bc instanceof Map ? mapEntries(bc) : setMembers(bc);
 		for (let x = ai.next(), y = bi.next(); !x.done; x = ai.next(), y = bi.next()) if (!equal(x.value, y.value, assumed)) return false;
-		return true;
+		return equalExtraKeys(a, b, assumed);
 	}
 	const builtin = equalBuiltin(a, b, assumed);
 	if (builtin !== void 0) return builtin;
@@ -14312,7 +14808,7 @@ function equal(a, b, assumed) {
 		const bc = b;
 		if (a.length !== bc.length) return false;
 		for (let i = 0; i < a.length; i++) if (i in a !== i in bc || !equal(a[i], bc[i], assumed)) return false;
-		return true;
+		return equalExtraKeys(a, b, assumed);
 	}
 	return equalKeys(a, b, assumed);
 }
@@ -14331,7 +14827,7 @@ function isMergeable(value) {
 * one class (see isMergeable), or, with `arrays`, both are arrays.
 */
 function mergesWith(a, b, arrays) {
-	if (arrays && (Array.isArray(a) || Array.isArray(b))) return Array.isArray(a) && Array.isArray(b);
+	if (arrays && (Array.isArray(a) || Array.isArray(b))) return Array.isArray(a) && Array.isArray(b) && Object.getPrototypeOf(a) === Object.getPrototypeOf(b);
 	return isMergeable(a) && isMergeable(b) && Object.getPrototypeOf(a) === Object.getPrototypeOf(b);
 }
 /**
@@ -14482,13 +14978,13 @@ function entryChildren(value) {
 	const children = [];
 	if (value instanceof Map) {
 		let index = 0;
-		for (const [k, v] of value) {
+		for (const [k, v] of mapEntries(value)) {
 			children.push([entryKey("k", index), k], [entryKey("v", index), v]);
 			index++;
 		}
 	} else if (value instanceof Set) {
 		let index = 0;
-		for (const member of value) children.push([entryKey("s", index++), member]);
+		for (const member of setMembers(value)) children.push([entryKey("s", index++), member]);
 	} else if (value instanceof Error) {
 		for (const key of ["cause", "errors"]) if (hasOwn(value, key)) children.push([entryKey(key === "cause" ? "c" : "e", 0), value[key]]);
 	} else if (ArrayBuffer.isView(value)) children.push([entryKey("b", 0), value.buffer]);
@@ -14520,8 +15016,9 @@ function setEntryValue(root, path, value) {
 	const holder = getByEntryPath(root, path.slice(0, -1));
 	const match = /^\0v(\d+)$/.exec(path[path.length - 1]);
 	if (!(holder instanceof Map) || !match) return false;
-	const key = [...holder.keys()][Number(match[1])];
-	holder.set(key, value);
+	const entry = [...mapEntries(holder)][Number(match[1])];
+	if (!entry) return false;
+	mapSet(holder, entry[0], value);
 	return true;
 }
 /**
@@ -14590,7 +15087,8 @@ function aliasMoved(x, y, at, earlier, later) {
 	if (xs && ys) {
 		if (Object.getPrototypeOf(x) !== Object.getPrototypeOf(y)) return false;
 		if (x instanceof Map || x instanceof Set) {
-			if (x.size !== y.size) return false;
+			const ySize = collectionSize(y);
+			if (collectionSize(x) !== ySize) return false;
 		}
 		const held = new Map(ys);
 		for (const [segment, a] of xs) if (held.has(segment)) pairs.push([
@@ -15605,6 +16103,11 @@ function deeplyFrozen(value, seen = /* @__PURE__ */ new Set()) {
 	if (ArrayBuffer.isView(value) || value instanceof ArrayBuffer) return true;
 	if (!Object.isFrozen(value)) return false;
 	seen.add(value);
+	if (value instanceof Map) {
+		for (const [key, entry] of mapEntries(value)) if (!deeplyFrozen(key, seen) || !deeplyFrozen(entry, seen)) return false;
+	} else if (value instanceof Set) {
+		for (const member of setMembers(value)) if (!deeplyFrozen(member, seen)) return false;
+	}
 	return Reflect.ownKeys(value).every((key) => {
 		const desc = Object.getOwnPropertyDescriptor(value, key);
 		return !desc || !("value" in desc) || deeplyFrozen(desc.value, seen);
@@ -16149,10 +16652,14 @@ function connectTriggersToStore() {
 function reinitTriggerState() {
 	for (const trigger of triggers) trigger.lastResult = evalCondition(trigger.condition);
 }
+/**
+* Forget every watcher and close every dialog on display, whoever opened it
+* (restart): a `{dialog}` or menubar dialog of the story interface, which
+* stays mounted, would otherwise stay open over the new game (#397).
+*/
 function resetTriggers() {
 	triggers = [];
-	dialogQueue = [];
-	dialogHostCallbacks?.closeAll();
+	closeAllOpenDialogs();
 }
 function subscribeTriggerDialogs(cb) {
 	dialogNotify = cb;
@@ -16464,6 +16971,15 @@ function startVariables(defaults) {
 	return initialVars;
 }
 /**
+* Fresh transient variables from their declared defaults (init, restart,
+* load). Transients are never saved, so an instance of an unregistered
+* class (an engine, a library object) is kept as it is, as mutation code
+* keeps it (#321): a copy would lose its class and methods (#398).
+*/
+function freshTransients(defaults) {
+	return createNamespace(deepClone(defaults, { keepUnregistered: true }));
+}
+/**
 * Enter the start passage with `variables`, as the only history moment
 * (init, restart). Call it inside a store update.
 */
@@ -16471,7 +16987,7 @@ function enterStart(state, passage, variables, transientDefaults) {
 	state.currentPassage = passage;
 	state.navigationId++;
 	state.variables = variables;
-	state.transient = createNamespace(deepClone(transientDefaults));
+	state.transient = freshTransients(transientDefaults);
 	state.temporary = createNamespace();
 	state.history = [{
 		passage,
@@ -17230,7 +17746,7 @@ var useStoryStore = create()(storyStore((set, get) => ({
 			state.visitCounts = createCounts(payload.visitCounts);
 			state.renderCounts = createCounts(payload.renderCounts);
 			state.temporary = createNamespace();
-			state.transient = createNamespace(deepClone(get().transientDefaults));
+			state.transient = freshTransients(get().transientDefaults);
 		});
 		if (payload.watchers) restoreMacroWatchers(payload.watchers);
 		reinitTriggerState();
@@ -17307,15 +17823,34 @@ var FOCUSABLE = [
 	"[tabindex]"
 ].join(",");
 /**
+* Whether `el` is in a closed `<details>`, other than in the summary that
+* toggles it: the browser renders none of that content (#389).
+*/
+function inClosedDetails(el) {
+	for (let e = el.parentElement; e; e = e.parentElement) {
+		if (e.localName !== "details" || e.hasAttribute("open")) continue;
+		if (!Array.from(e.children).find((c) => c.localName === "summary")?.contains(el)) return true;
+	}
+	return false;
+}
+/**
 * Whether CSS leaves `el` in the tab sequence: not `visibility: hidden`
-* (inherited, so the computed value covers ancestors) and not inside a
-* `display: none` element.
+* (inherited, so the computed value covers ancestors), not inside a
+* `display: none` element and not in the hidden content of a closed
+* `<details>`.
 */
 function isRendered(el) {
 	const { visibility } = getComputedStyle(el);
 	if (visibility === "hidden" || visibility === "collapse") return false;
 	for (let e = el; e; e = e.parentElement) if (getComputedStyle(e).display === "none") return false;
-	return true;
+	return !inClosedDetails(el);
+}
+/**
+* Whether `el` can be focused at all: shown, rendered, enabled (also by its
+* fieldset) and not inert.
+*/
+function isAvailable(el) {
+	return !el.hidden && !el.closest("[hidden], [inert]") && !el.matches(":disabled") && isRendered(el);
 }
 /** The `tabindex` of `el` as an integer, or null when absent or invalid. */
 function tabIndexAttr(el) {
@@ -17324,9 +17859,10 @@ function tabIndexAttr(el) {
 	return parseInt(raw, 10);
 }
 /**
-* Whether the tab key can reach `el`: a negative tabindex only allows
-* scripted focus, and of a radio group the browser tabs to the checked
-* member only (the first one when none is checked).
+* Whether the tab key can reach `el`, an available element (see
+* isAvailable): a negative tabindex only allows scripted focus, and of a
+* radio group the browser tabs to the checked member only (the first one
+* when none is checked), of the members it can reach.
 */
 function isTabStop(el) {
 	const tabIndex = tabIndexAttr(el);
@@ -17337,7 +17873,7 @@ function isTabStop(el) {
 		if (details?.localName !== "details" || Array.from(details.children).find((c) => c.localName === "summary") !== el) return tabIndex !== null;
 	}
 	if (el instanceof HTMLInputElement && el.type === "radio" && el.name) {
-		const group = Array.from((el.form ?? el.getRootNode()).querySelectorAll("input[type=\"radio\"]")).filter((r) => r.name === el.name && r.form === el.form && !r.disabled);
+		const group = Array.from((el.form ?? el.getRootNode()).querySelectorAll("input[type=\"radio\"]")).filter((r) => r.name === el.name && r.form === el.form && (tabIndexAttr(r) ?? 0) >= 0 && isAvailable(r));
 		return el === (group.find((r) => r.checked) ?? group[0]);
 	}
 	return true;
@@ -17347,7 +17883,7 @@ function isTabStop(el) {
 * first, ascending, then the others in document order.
 */
 function focusables(root) {
-	const stops = Array.from(root.querySelectorAll(FOCUSABLE)).filter((el) => !el.hidden && !el.closest("[hidden], [inert]") && !el.matches(":disabled") && isRendered(el) && isTabStop(el));
+	const stops = Array.from(root.querySelectorAll(FOCUSABLE)).filter((el) => isAvailable(el) && isTabStop(el));
 	const positive = (el) => Math.max(tabIndexAttr(el) ?? 0, 0);
 	return [...stops.filter((el) => positive(el) > 0).sort((a, b) => positive(a) - positive(b)), ...stops.filter((el) => positive(el) === 0)];
 }
@@ -17440,6 +17976,7 @@ function PassageDialog({ passageName, fallbackMarkup, panelClass, onClose, dismi
 		}
 	}, [markup, nobr]);
 	const panelRef = useRef(null);
+	const viewScope = useViewScope();
 	useModalFocus(panelRef, ".dialog-body", dismissible, stableOnClose);
 	useLayoutEffect(() => registerOpenDialog(stableOnClose), [stableOnClose]);
 	useLayoutEffect(() => {
@@ -17469,7 +18006,10 @@ function PassageDialog({ passageName, fallbackMarkup, panelClass, onClose, dismi
 					children: "✕"
 				}), /* @__PURE__ */ jsx("div", {
 					class: "dialog-body",
-					children: content
+					children: /* @__PURE__ */ jsx(ViewScopeContext.Provider, {
+						value: viewScope,
+						children: content
+					})
 				})]
 			})
 		})
@@ -19518,13 +20058,13 @@ function keyOf(val, ancestors) {
 	const obj = val;
 	const depth = ancestors.indexOf(obj);
 	if (depth !== -1) return `<cycle ${ancestors.length - depth}>`;
-	if (val instanceof Date) return `Date(${val.getTime()})`;
-	if (val instanceof RegExp) return `RegExp(${String(val)}@${val.lastIndex})`;
+	if (val instanceof Date) return `Date(${Date.prototype.getTime.call(val)})`;
+	if (val instanceof RegExp) return `RegExp(${RegExp.prototype.toString.call(val)}@${val.lastIndex})`;
 	ancestors.push(obj);
 	try {
 		if (Array.isArray(val)) return `[${Array.from(val, (v) => keyOf(v, ancestors)).join(",")}]`;
-		if (val instanceof Map) return `Map[${[...val].map(([k, v]) => `[${keyOf(k, ancestors)},${keyOf(v, ancestors)}]`).join(",")}]`;
-		if (val instanceof Set) return `Set[${[...val].map((v) => keyOf(v, ancestors)).join(",")}]`;
+		if (val instanceof Map) return `Map[${[...mapEntries(val)].map(([k, v]) => `[${keyOf(k, ancestors)},${keyOf(v, ancestors)}]`).join(",")}]`;
+		if (val instanceof Set) return `Set[${[...setMembers(val)].map((v) => keyOf(v, ancestors)).join(",")}]`;
 		const record = obj;
 		const body = Object.keys(record).map((k) => `${JSON.stringify(k)}:${keyOf(record[k], ancestors)}`).join(",");
 		const className = registeredClassName(obj);
@@ -20916,6 +21456,7 @@ defineMacro({
 	render(_props, ctx) {
 		const radioValue = ctx.args.value ?? "";
 		const label = ctx.args.label ?? "";
+		const view = ctx.hooks.useContext(ViewScopeContext);
 		useVariableAction(ctx, {
 			type: "radiobutton",
 			key: `$${ctx.varName}:${radioValue}`,
@@ -20927,7 +21468,7 @@ defineMacro({
 			class: ctx.cls,
 			children: [/* @__PURE__ */ jsx("input", {
 				type: "radio",
-				name: `radio-${ctx.varName}`,
+				name: view ? `radio-${view}-${ctx.varName}` : `radio-${ctx.varName}`,
 				checked: ctx.value === radioValue,
 				onChange: () => ctx.setValue(radioValue)
 			}), label ? ` ${label}` : null]
@@ -21086,27 +21627,31 @@ function Passage({ passage, dataTransition, navigationId }) {
 		if (elRef.current) emitFromRender("passagerender", passage.name, elRef.current);
 	}, [passage.name, navigationId]);
 	const nobr = passage.tags.includes("nobr");
-	const inner = /* @__PURE__ */ jsxs("div", {
-		ref: elRef,
-		class: "passage",
-		"data-passage": passage.name,
-		"data-tags": passage.tags.join(" "),
-		"data-transition": dataTransition,
-		children: [
-			headerContent && /* @__PURE__ */ jsx("div", {
-				class: "passage-header",
-				children: headerContent
-			}),
-			content,
-			footerContent && /* @__PURE__ */ jsx("div", {
-				class: "passage-footer",
-				children: footerContent
-			}),
-			doneContent && /* @__PURE__ */ jsx("div", {
-				hidden: true,
-				children: doneContent
-			})
-		]
+	const viewScope = useViewScope();
+	const inner = /* @__PURE__ */ jsx(ViewScopeContext.Provider, {
+		value: viewScope,
+		children: /* @__PURE__ */ jsxs("div", {
+			ref: elRef,
+			class: "passage",
+			"data-passage": passage.name,
+			"data-tags": passage.tags.join(" "),
+			"data-transition": dataTransition,
+			children: [
+				headerContent && /* @__PURE__ */ jsx("div", {
+					class: "passage-header",
+					children: headerContent
+				}),
+				content,
+				footerContent && /* @__PURE__ */ jsx("div", {
+					class: "passage-footer",
+					children: footerContent
+				}),
+				doneContent && /* @__PURE__ */ jsx("div", {
+					hidden: true,
+					children: doneContent
+				})
+			]
+		})
 	});
 	return nobr ? /* @__PURE__ */ jsx(NobrContext.Provider, {
 		value: true,