isorite 0.12.0 → 0.13.0

package/dist/core.js

@@ -1,2464 +0,0 @@
-import { Document, Scalar, isMap, isScalar, isSeq, parseDocument, stringify } from "yaml";
-import MarkdownIt from "markdown-it";
-import { parse, stringify as stringify$1 } from "smol-toml";
-//#region packages/core/src/text.ts
-const WS = "\\t\\n\\x0b\\x0c\\r\\x1c-\\x1f \\x85\\xa0\\u1680\\u2000-\\u200a\\u2028\\u2029\\u202f\\u205f\\u3000";
-const LEAD = new RegExp(`^[${WS}]+`, "u");
-const TRAIL = new RegExp(`[${WS}]+$`, "u");
-const strip = (s) => s.replace(LEAD, "").replace(TRAIL, "");
-const rstrip = (s) => s.replace(TRAIL, "");
-/** Compare by code point, as Python sorts strings. */
-function cmp(a, b) {
-	if (a === b) return 0;
-	const x = [...a], y = [...b];
-	for (let i = 0; i < Math.min(x.length, y.length); i++) {
-		const d = x[i].codePointAt(0) - y[i].codePointAt(0);
-		if (d) return d;
-	}
-	return x.length - y.length;
-}
-/** Compare arrays of strings (or numbers) element by element, as Python compares tuples. */
-function cmpTuple(a, b) {
-	for (let i = 0; i < Math.min(a.length, b.length); i++) {
-		const x = a[i], y = b[i];
-		const d = typeof x === "number" && typeof y === "number" ? x - y : cmp(String(x), String(y));
-		if (d) return d;
-	}
-	return a.length - b.length;
-}
-/** A frontmatter value as text: true/false, whole-number floats without ".0",
-*  nothing for null. */
-function text(value) {
-	if (value === null || value === void 0) return "";
-	if (typeof value === "boolean") return value ? "true" : "false";
-	return String(value);
-}
-const DATETIME = /^(\d{4})-(\d{2})-(\d{2})(?:[Tt ](\d{2}):(\d{2})(?::(\d{2})(?:\.(\d+))?)?(?:([Zz])|([+-])(\d{2}):?(\d{2}))?)?$/;
-/** Milliseconds since the epoch for a frontmatter time, or null when it is not one. */
-function toTime(value) {
-	if (value instanceof Date) return value.getTime();
-	if (typeof value !== "string") return null;
-	const m = DATETIME.exec(strip(value));
-	if (!m) return null;
-	const [, y, mo, d, hh = "0", mm = "0", ss = "0", frac = "0", , sign, oh = "0", om = "0"] = m;
-	const n = (s) => Number(s);
-	const [Y, M, D, H, Mi, S] = [
-		n(y),
-		n(mo),
-		n(d),
-		n(hh),
-		n(mm),
-		n(ss)
-	];
-	const probe = new Date(Date.UTC(Y, M - 1, D, H, Mi, S));
-	if (Y < 1 || probe.getUTCFullYear() !== Y || probe.getUTCMonth() !== M - 1 || probe.getUTCDate() !== D || probe.getUTCHours() !== H || probe.getUTCMinutes() !== Mi || probe.getUTCSeconds() !== S) return null;
-	const micro = Number(frac.slice(0, 6).padEnd(6, "0"));
-	let t = probe.getTime() + Math.floor(micro / 1e3);
-	if (sign) {
-		if (n(oh) > 23 || n(om) > 59) return null;
-		const offset = (n(oh) * 60 + n(om)) * 6e4;
-		t += sign === "+" ? -offset : offset;
-	}
-	return t;
-}
-/** ISO 8601 in UTC to the second, as the Python core writes times. */
-function iso(time) {
-	return (/* @__PURE__ */ new Date(Math.floor(time / 1e3) * 1e3)).toISOString().replace(".000Z", "Z");
-}
-/** Decode %XX escapes as UTF-8, replacing invalid sequences (Python's unquote). */
-function unquote(s) {
-	if (!s.includes("%")) return s;
-	const bytes = [];
-	const enc = new TextEncoder();
-	for (let i = 0; i < s.length;) if (s[i] === "%" && /^[0-9a-fA-F]{2}$/.test(s.slice(i + 1, i + 3))) {
-		bytes.push(parseInt(s.slice(i + 1, i + 3), 16));
-		i += 3;
-	} else {
-		const cp = s.codePointAt(i);
-		const ch = String.fromCodePoint(cp);
-		bytes.push(...enc.encode(ch));
-		i += ch.length;
-	}
-	return new TextDecoder("utf-8").decode(new Uint8Array(bytes));
-}
-/** Python's posixpath.dirname. */
-function dirname(p) {
-	let head = p.slice(0, p.lastIndexOf("/") + 1);
-	if (head && !/^\/+$/.test(head)) head = head.replace(/\/+$/, "");
-	return head;
-}
-function basename(p) {
-	return p.slice(p.lastIndexOf("/") + 1);
-}
-function join(a, b) {
-	if (b.startsWith("/") || !a) return b;
-	return a.endsWith("/") ? a + b : `${a}/${b}`;
-}
-/** Python's posixpath.normpath. */
-function normpath(p) {
-	if (!p) return ".";
-	const initial = p.startsWith("/") ? p.startsWith("//") && !p.startsWith("///") ? 2 : 1 : 0;
-	const out = [];
-	for (const part of p.split("/")) {
-		if (!part || part === ".") continue;
-		if (part !== ".." || !initial && !out.length || out[out.length - 1] === "..") out.push(part);
-		else if (out.length) out.pop();
-	}
-	return "/".repeat(initial) + out.join("/") || ".";
-}
-/** SHA-256 as hex, synchronous and dependency-free, so the core runs anywhere: of text (as UTF-8), or of bytes. */
-function sha256(message) {
-	const K = new Uint32Array([
-		1116352408,
-		1899447441,
-		3049323471,
-		3921009573,
-		961987163,
-		1508970993,
-		2453635748,
-		2870763221,
-		3624381080,
-		310598401,
-		607225278,
-		1426881987,
-		1925078388,
-		2162078206,
-		2614888103,
-		3248222580,
-		3835390401,
-		4022224774,
-		264347078,
-		604807628,
-		770255983,
-		1249150122,
-		1555081692,
-		1996064986,
-		2554220882,
-		2821834349,
-		2952996808,
-		3210313671,
-		3336571891,
-		3584528711,
-		113926993,
-		338241895,
-		666307205,
-		773529912,
-		1294757372,
-		1396182291,
-		1695183700,
-		1986661051,
-		2177026350,
-		2456956037,
-		2730485921,
-		2820302411,
-		3259730800,
-		3345764771,
-		3516065817,
-		3600352804,
-		4094571909,
-		275423344,
-		430227734,
-		506948616,
-		659060556,
-		883997877,
-		958139571,
-		1322822218,
-		1537002063,
-		1747873779,
-		1955562222,
-		2024104815,
-		2227730452,
-		2361852424,
-		2428436474,
-		2756734187,
-		3204031479,
-		3329325298
-	]);
-	const data = typeof message === "string" ? new TextEncoder().encode(message) : message;
-	const len = data.length;
-	const padded = new Uint8Array(len + 9 + 63 >> 6 << 6);
-	padded.set(data);
-	padded[len] = 128;
-	const view = new DataView(padded.buffer);
-	view.setUint32(padded.length - 8, Math.floor(len / 536870912));
-	view.setUint32(padded.length - 4, len << 3 >>> 0);
-	const h = new Uint32Array([
-		1779033703,
-		3144134277,
-		1013904242,
-		2773480762,
-		1359893119,
-		2600822924,
-		528734635,
-		1541459225
-	]);
-	const w = /* @__PURE__ */ new Uint32Array(64);
-	const rotr = (x, n) => x >>> n | x << 32 - n;
-	for (let off = 0; off < padded.length; off += 64) {
-		for (let i = 0; i < 16; i++) w[i] = view.getUint32(off + i * 4);
-		for (let i = 16; i < 64; i++) {
-			const a = w[i - 15], b = w[i - 2];
-			const s0 = rotr(a, 7) ^ rotr(a, 18) ^ a >>> 3;
-			const s1 = rotr(b, 17) ^ rotr(b, 19) ^ b >>> 10;
-			w[i] = w[i - 16] + s0 + w[i - 7] + s1 >>> 0;
-		}
-		let [a, b, c, d, e, f, g, hh] = h;
-		for (let i = 0; i < 64; i++) {
-			const S1 = rotr(e, 6) ^ rotr(e, 11) ^ rotr(e, 25);
-			const ch = e & f ^ ~e & g;
-			const t1 = hh + S1 + ch + K[i] + w[i] >>> 0;
-			const t2 = (rotr(a, 2) ^ rotr(a, 13) ^ rotr(a, 22)) + (a & b ^ a & c ^ b & c) >>> 0;
-			hh = g;
-			g = f;
-			f = e;
-			e = d + t1 >>> 0;
-			d = c;
-			c = b;
-			b = a;
-			a = t1 + t2 >>> 0;
-		}
-		h[0] += a;
-		h[1] += b;
-		h[2] += c;
-		h[3] += d;
-		h[4] += e;
-		h[5] += f;
-		h[6] += g;
-		h[7] += hh;
-	}
-	return [...h].map((x) => x.toString(16).padStart(8, "0")).join("");
-}
-/** The version of a note that learner-record events refer to. */
-function contentHash(body) {
-	return sha256(strip(body)).slice(0, 12);
-}
-/** Python's repr() of a float. */
-function floatRepr(x) {
-	if (!Number.isFinite(x)) return Number.isNaN(x) ? "NaN" : x > 0 ? "Infinity" : "-Infinity";
-	const a = Math.abs(x);
-	if (x !== 0 && (a >= 0x2386f26fc10000 || a < 1e-4)) return x.toExponential().replace(/e([+-])(\d)$/, "e$10$2");
-	return Number.isInteger(x) ? `${x.toFixed(0)}.0` : String(x);
-}
-/** Python's repr(): what Python prints for a value inside a list or dict. */
-function pyRepr(v) {
-	if (v === null || v === void 0) return "None";
-	if (typeof v === "boolean") return v ? "True" : "False";
-	if (typeof v === "number") return Number.isInteger(v) ? String(v) : floatRepr(v);
-	if (typeof v === "string") {
-		const quote = v.includes("'") && !v.includes("\"") ? "\"" : "'";
-		return quote + [...v].map((c) => {
-			if (c === "\\" || c === quote) return "\\" + c;
-			if (c === "\n") return "\\n";
-			if (c === "\r") return "\\r";
-			if (c === "	") return "\\t";
-			const cp = c.codePointAt(0);
-			return cp < 32 || cp === 127 ? "\\x" + cp.toString(16).padStart(2, "0") : c;
-		}).join("") + quote;
-	}
-	if (Array.isArray(v)) return "[" + v.map(pyRepr).join(", ") + "]";
-	if (typeof v === "object") return "{" + Object.entries(v).map(([k, x]) => `${pyRepr(k)}: ${pyRepr(x)}`).join(", ") + "}";
-	return String(v);
-}
-//#endregion
-//#region packages/core/src/frontmatter.ts
-var FrontmatterError = class extends Error {};
-const BOM$1 = "";
-/** The frontmatter's YAML text (with its last line break, as in the file) and
-*  the body; the YAML is null when the note has none. */
-function frontmatterText(source) {
-	const text = source.startsWith(BOM$1) ? source.slice(1) : source;
-	if (!text.startsWith("---")) return [null, text];
-	const lines = text.split("\n");
-	if (strip(lines[0]) !== "---") return [null, text];
-	for (let i = 1; i < lines.length; i++) if (rstrip(lines[i]) === "---") return [lines.slice(1, i).join("\n") + "\n", lines.slice(i + 1).join("\n")];
-	throw new FrontmatterError("frontmatter block is not closed with '---'");
-}
-/** Parse frontmatter YAML as the core reads it. */
-function parseYaml(raw) {
-	return parseDocument(raw.replace(/\r\n?/g, "\n"), {
-		version: "1.2",
-		schema: "core",
-		uniqueKeys: false
-	});
-}
-/** `[frontmatter, body]`; frontmatter is null when the note has none. */
-function splitFrontmatter(source) {
-	const [raw, body] = frontmatterText(source);
-	if (raw === null) return [null, body];
-	let meta = {};
-	if (strip(raw)) {
-		const doc = parseYaml(raw);
-		const problem = doc.errors[0] ?? doc.warnings.find((w) => w.code === "TAG_RESOLVE_FAILED");
-		if (problem) throw new FrontmatterError(`unparseable YAML frontmatter: ${problem.message}`);
-		meta = doc.toJS({ maxAliasCount: 1e3 });
-	}
-	if (meta === null || meta === void 0) meta = {};
-	if (typeof meta !== "object" || Array.isArray(meta)) throw new FrontmatterError("frontmatter is not a mapping");
-	return [meta, body.replace(/^\n+/, "")];
-}
-/** Serialise frontmatter, keeping key order. */
-function dumpFrontmatter(meta) {
-	return stringify(meta, {
-		version: "1.2",
-		lineWidth: 100
-	});
-}
-//#endregion
-//#region packages/core/src/markdown.ts
-const md = new MarkdownIt("commonmark");
-const cache = /* @__PURE__ */ new Map();
-function parse$1(body) {
-	let hit = cache.get(body);
-	if (!hit) {
-		const env = {};
-		hit = {
-			tokens: md.parse(body, env),
-			defs: Object.values(env.references ?? {}).map((d) => [d.href ?? "", d.title ?? null])
-		};
-		if (cache.size > 8192) cache.clear();
-		cache.set(body, hit);
-	}
-	return hit;
-}
-const RATINGS = {
-	requires: 3,
-	uses: 2,
-	"see also": 1
-};
-/** The rating a link title names, or null (unrated, or an ordinary title). */
-function rating(title) {
-	let key = strip((title ?? "").toLowerCase().replaceAll("-", " ").replaceAll("_", " ")).split(/\s+/).filter(Boolean).join(" ");
-	if (key === "seealso") key = "see also";
-	return key in RATINGS ? key : null;
-}
-/** Link targets with their ratings: every link in order of appearance, then
-*  each reference definition no link used. */
-function linkRefs(body) {
-	const { tokens, defs } = parse$1(body);
-	const refs = [];
-	for (const t of tokens) {
-		if (t.type !== "inline" || !t.children) continue;
-		for (const c of t.children) if (c.type === "link_open") refs.push([c.attrGet("href") ?? "", rating(c.attrGet("title"))]);
-	}
-	const used = new Set(refs.map(([href]) => href));
-	for (const [href, title] of defs) if (!used.has(href)) refs.push([href, rating(title)]);
-	return refs;
-}
-/** Every link in a body, in order, with its text as written (marks dropped). */
-function linkTexts(body) {
-	const { tokens } = parse$1(body);
-	const out = [];
-	for (const t of tokens) {
-		if (t.type !== "inline" || !t.children) continue;
-		let open = null;
-		for (const c of t.children) if (c.type === "link_open") open = {
-			href: c.attrGet("href") ?? "",
-			text: ""
-		};
-		else if (c.type === "link_close" && open) {
-			out.push({
-				href: open.href,
-				text: open.text.trim()
-			});
-			open = null;
-		} else if (open && (c.type === "text" || c.type === "code_inline")) open.text += c.content;
-	}
-	return out;
-}
-/** Every link and image in a body, in order: where it points, its title, and whether it is an image
-*  (`![…](…)`, which for an artifact or a picture means "shown here", an embed), with an image's alt text. */
-function citeRefs(body) {
-	const { tokens } = parse$1(body);
-	const out = [];
-	for (const t of tokens) {
-		if (t.type !== "inline" || !t.children) continue;
-		for (const c of t.children) if (c.type === "link_open") out.push({
-			href: c.attrGet("href") ?? "",
-			title: c.attrGet("title"),
-			embed: false
-		});
-		else if (c.type === "image") out.push({
-			href: c.attrGet("src") ?? "",
-			title: c.attrGet("title"),
-			embed: true,
-			alt: c.content
-		});
-	}
-	return out;
-}
-const NOT_SLUG = /[^\p{L}\p{N}_\s-]/gu;
-const SPACES = /[\s_]+/gu;
-function slugify(text) {
-	return strip(text.toLowerCase().replace(NOT_SLUG, "")).replace(SPACES, "-");
-}
-function headings(body) {
-	const { tokens } = parse$1(body);
-	const out = [];
-	tokens.forEach((t, i) => {
-		if (t.type !== "heading_open") return;
-		const text = strip(tokens[i + 1]?.content ?? "");
-		out.push({
-			level: Number(t.tag.slice(1)),
-			text,
-			slug: slugify(text),
-			line: t.map?.[0] ?? 0
-		});
-	});
-	return out;
-}
-/** The text under `heading` (matched by text or slug) up to the next heading of
-*  the same or higher level, including the heading line itself. */
-function section(body, heading) {
-	const wanted = strip(strip(heading).replace(/^#+/, "")).toLowerCase();
-	const wantedSlug = slugify(wanted);
-	const hs = headings(body);
-	const lines = body.split("\n");
-	for (const [idx, h] of hs.entries()) {
-		if (h.text.toLowerCase() !== wanted && h.slug !== wantedSlug) continue;
-		let end = lines.length;
-		for (const later of hs.slice(idx + 1)) if (later.level <= h.level) {
-			end = later.line;
-			break;
-		}
-		return strip(lines.slice(h.line, end).join("\n"));
-	}
-	return null;
-}
-//#endregion
-//#region packages/core/src/picture.ts
-const TYPES = {
-	png: "image/png",
-	jpg: "image/jpeg",
-	jpeg: "image/jpeg",
-	gif: "image/gif",
-	svg: "image/svg+xml",
-	webp: "image/webp",
-	avif: "image/avif"
-};
-/** A picture's media type, by its extension, or null when the path isn't a picture's (M22). */
-const pictureType = (path) => {
-	const dot = path.lastIndexOf(".");
-	return dot < 0 || path.lastIndexOf("/") > dot ? null : TYPES[path.slice(dot + 1).toLowerCase()] ?? null;
-};
-const OTHER = {
-	html: "text/html",
-	htm: "text/html",
-	csv: "text/csv",
-	tsv: "text/tab-separated-values",
-	json: "application/json",
-	jsonl: "application/jsonl",
-	ndjson: "application/x-ndjson",
-	txt: "text/plain",
-	tex: "text/plain",
-	pdf: "application/pdf",
-	glb: "model/gltf-binary",
-	gltf: "model/gltf+json",
-	stl: "model/stl",
-	obj: "model/obj",
-	zip: "application/zip",
-	parquet: "application/vnd.apache.parquet",
-	arrow: "application/vnd.apache.arrow.file",
-	npy: "application/octet-stream",
-	xlsx: "application/vnd.openxmlformats-officedocument.spreadsheetml.sheet",
-	docx: "application/vnd.openxmlformats-officedocument.wordprocessingml.document",
-	epub: "application/epub+zip",
-	odt: "application/vnd.oasis.opendocument.text"
-};
-/** Any file's media type in the notes (M23), by its extension: a picture's, one listed, or octet-stream. Null for a
-*  note (Markdown is read as a note, never as a file) and for a path with no extension. */
-const fileType = (path) => {
-	const dot = path.lastIndexOf(".");
-	if (dot < 0 || path.lastIndexOf("/") > dot) return null;
-	const ext = path.slice(dot + 1).toLowerCase();
-	return ext === "md" ? null : pictureType(path) ?? OTHER[ext] ?? "application/octet-stream";
-};
-/** Width and height in pixels, or null. */
-function pictureSize(bytes, type) {
-	const v = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength), n = bytes.length;
-	const at = (i, s) => [...s].every((c, k) => bytes[i + k] === c.charCodeAt(0));
-	const ok = (w, h) => w > 0 && h > 0 ? {
-		width: w,
-		height: h
-	} : null;
-	try {
-		if (type === "image/png" && n >= 24 && at(12, "IHDR")) return ok(v.getUint32(16), v.getUint32(20));
-		if (type === "image/gif" && n >= 10 && at(0, "GIF")) return ok(v.getUint16(6, true), v.getUint16(8, true));
-		if (type === "image/jpeg") {
-			for (let i = 2; i + 9 < n;) {
-				if (bytes[i] !== 255) return null;
-				const m = bytes[i + 1];
-				if (m >= 192 && m <= 207 && m !== 196 && m !== 200 && m !== 204) return ok(v.getUint16(i + 7), v.getUint16(i + 5));
-				i += 2 + v.getUint16(i + 2);
-			}
-			return null;
-		}
-		if (type === "image/webp" && n >= 30 && at(0, "RIFF") && at(8, "WEBP")) {
-			if (at(12, "VP8 ")) return ok(v.getUint16(26, true) & 16383, v.getUint16(28, true) & 16383);
-			if (at(12, "VP8L")) {
-				const b = v.getUint32(21, true);
-				return ok((b & 16383) + 1, (b >> 14 & 16383) + 1);
-			}
-			if (at(12, "VP8X")) return ok(1 + (bytes[24] | bytes[25] << 8 | bytes[26] << 16), 1 + (bytes[27] | bytes[28] << 8 | bytes[29] << 16));
-			return null;
-		}
-		if (type === "image/svg+xml") {
-			const head = new TextDecoder().decode(bytes.subarray(0, 4096)), tag = /<svg\b[^>]*>/i.exec(head)?.[0] ?? "";
-			const attr = (name) => new RegExp(`\\s${name}\\s*=\\s*["']\\s*([\\d.]+)\\s*(px)?\\s*["']`, "i").exec(tag);
-			const w = attr("width"), h = attr("height");
-			if (w && h) return ok(Math.round(Number(w[1])), Math.round(Number(h[1])));
-			const box = /\sviewBox\s*=\s*["']\s*[-\d.]+[\s,]+[-\d.]+[\s,]+([\d.]+)[\s,]+([\d.]+)/i.exec(tag);
-			return box ? ok(Math.round(Number(box[1])), Math.round(Number(box[2]))) : null;
-		}
-	} catch {}
-	return null;
-}
-//#endregion
-//#region packages/core/src/kinds.ts
-function kindOf(type) {
-	const t = type.trim().toLowerCase();
-	return t === "question" ? "question" : t === "problem" ? "problem" : "note";
-}
-/** The field naming what a kind is about, and the one saying it is done. */
-const ABOUT = {
-	question: "about",
-	problem: "uses"
-};
-const DONE = {
-	question: "resolved",
-	problem: "solved"
-};
-/** Note ids from frontmatter: a list, or one; `/a/b.md` and `a/b` alike. */
-function idsOf(raw) {
-	return (typeof raw === "string" ? [raw] : Array.isArray(raw) ? raw : []).map((t) => text(t).trim().replace(/^\/+/, "").replace(/\.md$/, "")).filter(Boolean);
-}
-/** When it was resolved or solved, as written (a date), or null while it is open. */
-function doneOf(meta, kind) {
-	if (kind === "note") return null;
-	const v = meta[DONE[kind]];
-	if (v === null || v === void 0 || v === false || v === "") return null;
-	return v instanceof Date ? v.toISOString().slice(0, 10) : text(v);
-}
-/** An embed: `[[!name]]` alone on a line, outside code. */
-const EMBED = /^[ \t]*\[\[!([^\]\n]+)\]\][ \t]*$/;
-/** The embeds in a note's body, in order, as written (a name, or a path). */
-function embedRefs(body) {
-	const out = [];
-	let fenced = false;
-	for (const line of body.split("\n")) {
-		if (/^\s*(```|~~~)/.test(line)) {
-			fenced = !fenced;
-			continue;
-		}
-		if (fenced) continue;
-		const m = EMBED.exec(line);
-		if (m) out.push(m[1].trim());
-	}
-	return out;
-}
-/** The embed that names a note, in its shortest form: its file name, or its path where the name is shared. */
-function embedFor(id, ids) {
-	const name = id.split("/").at(-1);
-	let shared = 0;
-	for (const other of ids) if (other.split("/").at(-1) === name) shared++;
-	return `[[!${shared > 1 ? id : name}]]`;
-}
-/** A code link's file and lines, or null when it is not one, or names a path outside the repository. */
-function codeTarget(href) {
-	const m = /^code:([^#?]+)(?:#L(\d+)(?:-L?(\d+))?)?$/.exec(href.trim());
-	if (!m) return null;
-	const path = decodeURIComponent(m[1]).replace(/^\.?\/+/, "");
-	if (!path || path.split("/").some((p) => p === ".." || !p)) return null;
-	return {
-		path,
-		...m[2] ? { line: Number(m[2]) } : {},
-		...m[3] ? { end: Number(m[3]) } : {}
-	};
-}
-/** A note's links out of the base, in order, each once. */
-function outwardLinks(body) {
-	const out = [], seen = /* @__PURE__ */ new Set();
-	for (const { href, text: words } of linkTexts(body)) {
-		if (seen.has(href)) continue;
-		if (/^https?:\/\//i.test(href)) out.push({
-			kind: "web",
-			href,
-			text: words || href.replace(/^https?:\/\/(www\.)?/i, "")
-		});
-		else {
-			const c = codeTarget(href);
-			if (!c) continue;
-			out.push({
-				kind: "code",
-				href,
-				text: words || c.path.split("/").at(-1),
-				...c
-			});
-		}
-		seen.add(href);
-	}
-	for (const { href, embed, alt } of citeRefs(body)) {
-		if (!embed || seen.has(href)) continue;
-		const c = codeTarget(href);
-		if (!c || !pictureType(c.path)) continue;
-		out.push({
-			kind: "code",
-			href,
-			text: alt || c.path.split("/").at(-1),
-			path: c.path,
-			picture: true
-		});
-		seen.add(href);
-	}
-	return out;
-}
-//#endregion
-//#region packages/core/src/bundle.ts
-/** The base's own instructions, for Iso and any other agent, at the top of the notes (M15). Not a note. */
-const AGENTS_FILE = "AGENTS.md";
-const OKF_VERSION = "0.2";
-const KINDS$2 = [
-	["artifact", /\.html?$/i],
-	["image", /\.(png|jpe?g|gif|svg|webp|avif)$/i],
-	["data", /\.(csv|tsv|json|jsonl|ndjson|parquet|arrow|feather|npy|npz|xlsx|xls|h5|hdf5|nc)$/i],
-	["document", /\.(pdf|docx?|odt|rtf|epub|pptx?|odp|txt|tex)$/i]
-];
-/** What kind of file a path is: null for a note, or a path with no extension (a note or a folder named without one);
-*  anything not listed is misc rather than dropped. */
-const citeKind = (path) => {
-	const name = basename(path);
-	if (/\.md$/i.test(name) || !/\.[^.]+$/.test(name.replace(/^\./, ""))) return null;
-	return KINDS$2.find(([, re]) => re.test(name))?.[0] ?? "misc";
-};
-const isEntry = (v) => typeof v === "object" && v !== null && !Array.isArray(v);
-var Concept = class {
-	id;
-	path;
-	meta;
-	body;
-	mtime;
-	links = [];
-	cites = [];
-	/** The notes it embeds (`[[!name]]`, M12), resolved to ids, in order. */
-	embeds = [];
-	/** Its links out of the base: to the web, and to code (M12). */
-	outward = [];
-	/** For a question or a problem: the notes it is about (or uses), from its frontmatter and from the notes that
-	*  embed it. */
-	attached = [];
-	constructor(id, path, meta, body, mtime = 0) {
-		this.id = id;
-		this.path = path;
-		this.meta = meta;
-		this.body = body;
-		this.mtime = mtime;
-	}
-	get directory() {
-		return dirname(this.id);
-	}
-	get type() {
-		const t = this.meta.type;
-		return t === null || t === void 0 || t === "" ? "" : text(t);
-	}
-	get title() {
-		const t = this.meta.title;
-		if (t) return text(t);
-		const stem = basename(this.id);
-		const words = strip(stem.replaceAll("-", " ").replaceAll("_", " "));
-		return words ? words[0].toUpperCase() + words.slice(1).toLowerCase() : stem;
-	}
-	get description() {
-		return text(this.meta.description || "");
-	}
-	/** A note, an open question, or a problem (M12). */
-	get kind() {
-		return kindOf(this.type);
-	}
-	/** When a question was resolved or a problem solved, as written; null while open, and for a note. */
-	get done() {
-		return doneOf(this.meta, this.kind);
-	}
-	get tags() {
-		let tags = this.meta.tags || [];
-		if (typeof tags === "string") tags = [tags];
-		return Array.isArray(tags) ? tags.filter((t) => t !== null && t !== void 0).map(text) : [];
-	}
-	get status() {
-		return text(this.meta.status || "stable");
-	}
-	get generated() {
-		return isEntry(this.meta.generated) ? this.meta.generated : {};
-	}
-	get generatedAt() {
-		return toTime(this.generated.at);
-	}
-	get verified() {
-		const v = this.meta.verified;
-		if (isEntry(v)) return [v];
-		return Array.isArray(v) ? v.filter(isEntry) : [];
-	}
-	/** OKF §5.3. */
-	get trust() {
-		const events = this.verified;
-		if (!events.length) return "unverified";
-		return events.some((e) => text(e.by).startsWith("human:")) ? "human-reviewed" : "machine-confirmed";
-	}
-	get lastHumanVerification() {
-		const times = this.verified.filter((e) => text(e.by).startsWith("human:")).map((e) => toTime(e.at)).filter((t) => t !== null);
-		return times.length ? Math.max(...times) : null;
-	}
-	/** Human-reviewed, but meaningfully changed since the latest human check. */
-	get verificationStale() {
-		const verified = this.lastHumanVerification, generated = this.generatedAt;
-		return verified !== null && generated !== null && generated > verified;
-	}
-	/** `stale_after` has passed (OKF §5.5). */
-	contentStale(now = Date.now()) {
-		const at = toTime(this.meta.stale_after);
-		return at !== null && Math.floor(now / 1e3) * 1e3 >= at;
-	}
-};
-var Directory = class {
-	concepts = [];
-	children = [];
-	hasIndex = false;
-	hasLog = false;
-	id;
-	constructor(id) {
-		this.id = id;
-	}
-	get name() {
-		return this.id ? basename(this.id) : "";
-	}
-};
-const SCHEME = /^[a-zA-Z][a-zA-Z0-9+.-]*:/;
-const LOG_DATE = /^\d{4}-\d{2}-\d{2}$/;
-/** Sort paths part by part, as Python sorts Path objects. */
-function comparePaths(a, b) {
-	return cmpTuple(a.split("/"), b.split("/"));
-}
-var Bundle = class Bundle {
-	concepts = /* @__PURE__ */ new Map();
-	directories = /* @__PURE__ */ new Map();
-	issues = [];
-	/** Every file in the bundle that is not Markdown, by path: what a note may cite (artifacts, pictures, data). */
-	files = /* @__PURE__ */ new Set();
-	rootMeta = {};
-	cache = /* @__PURE__ */ new Map();
-	/** Load a bundle from its files (paths relative to the bundle root). */
-	static fromFiles(files) {
-		const b = new Bundle();
-		b.scan([...files]);
-		return b;
-	}
-	memo(key, make) {
-		if (!this.cache.has(key)) this.cache.set(key, make());
-		return this.cache.get(key);
-	}
-	scan(files) {
-		this.directories.set("", new Directory(""));
-		const entries = /* @__PURE__ */ new Map();
-		for (const f of files) {
-			const path = f.path.replace(/^\/+|\/+$/g, "");
-			if (!path) continue;
-			entries.set(path, {
-				...f,
-				path
-			});
-			const parts = path.split("/");
-			for (let i = 1; i < parts.length; i++) {
-				const d = parts.slice(0, i).join("/");
-				if (!entries.has(d)) entries.set(d, {
-					path: d,
-					dir: true
-				});
-			}
-		}
-		for (const f of [...entries.values()].sort((a, b) => comparePaths(a.path, b.path))) {
-			const rel = f.path;
-			if (f.text !== void 0) f.text = f.text.replace(/\r\n?/g, "\n");
-			if (rel.split("/").some((part) => part.startsWith("."))) continue;
-			if (f.dir) {
-				this.ensureDir(rel);
-				continue;
-			}
-			if (!rel.endsWith(".md") || rel === "AGENTS.md") {
-				this.files.add(rel);
-				continue;
-			}
-			const directory = dirname(rel);
-			this.ensureDir(directory);
-			const name = basename(rel);
-			if (name === "index.md") {
-				this.directories.get(directory).hasIndex = true;
-				this.checkIndex(f.text ?? "", rel, directory);
-			} else if (name === "log.md") {
-				this.directories.get(directory).hasLog = true;
-				this.checkLog(f.text ?? "", rel);
-			} else this.loadConcept(f.text ?? "", rel, f.mtime ?? 0);
-		}
-		for (const concept of this.concepts.values()) {
-			const links = [];
-			for (const [target, rel] of linkRefs(concept.body)) {
-				const link = this.resolve(concept, target);
-				if (link) {
-					link.rel = rel;
-					links.push(link);
-				}
-			}
-			concept.links = links;
-			concept.outward = outwardLinks(concept.body);
-			for (const link of links) if (link.broken) this.issue(concept.path, "warning", "broken-link", `broken link to ${link.target}`);
-			for (const { href, title, embed, alt } of citeRefs(concept.body)) {
-				const path = this.filePath(concept, href), kind = path === null ? null : citeKind(path);
-				if (path === null || kind === null) continue;
-				const t = strip((title ?? "").toLowerCase());
-				const cite = {
-					target: path,
-					kind,
-					embed,
-					broken: !this.files.has(path),
-					rel: rating(title),
-					align: t === "left" ? "left" : t === "center" || t === "centre" ? "center" : null,
-					...embed && alt ? { alt } : {}
-				};
-				concept.cites.push(cite);
-				if (cite.broken) this.issue(concept.path, "warning", "broken-link", kind === "image" ? `picture not in the notes: ${path}` : `broken link to ${path}`);
-			}
-		}
-		const byName = /* @__PURE__ */ new Map();
-		for (const id of this.concepts.keys()) {
-			const n = basename(id);
-			byName.set(n, [...byName.get(n) ?? [], id]);
-		}
-		for (const concept of this.concepts.values()) for (const ref of embedRefs(concept.body)) {
-			const path = ref.replace(/^\/+/, "").replace(/\.md$/, "");
-			const found = path.includes("/") ? this.concepts.has(path) ? [path] : [] : byName.get(path) ?? [];
-			if (found.length === 1) concept.embeds.push(found[0]);
-			else this.issue(concept.path, "warning", "embed-broken", found.length ? `two notes are named ${path}: embed one by its path` : `no note to embed: ${ref}`);
-		}
-		for (const concept of this.concepts.values()) {
-			if (concept.kind === "note") continue;
-			concept.attached = idsOf(concept.meta[ABOUT[concept.kind]]).filter((id) => this.concepts.has(id) && id !== concept.id);
-		}
-		for (const concept of this.concepts.values()) for (const id of concept.embeds) {
-			const embedded = this.concepts.get(id);
-			if (embedded.kind !== "note" && id !== concept.id && !embedded.attached.includes(concept.id)) embedded.attached.push(concept.id);
-		}
-		for (const group of this.requiresCycles()) this.issue(this.concepts.get(group[0]).path, "warning", "requires-cycle", `requires cycle: ${group.join(", ")} require each other`);
-	}
-	issue(path, level, code, message) {
-		this.issues.push({
-			path,
-			level,
-			code,
-			message
-		});
-	}
-	ensureDir(directory) {
-		if (this.directories.has(directory)) return;
-		const parent = dirname(directory);
-		this.ensureDir(parent);
-		this.directories.set(directory, new Directory(directory));
-		this.directories.get(parent).children.push(directory);
-	}
-	loadConcept(source, rel, mtime) {
-		const cid = rel.slice(0, -3);
-		let meta, body;
-		try {
-			[meta, body] = splitFrontmatter(source);
-		} catch (err) {
-			if (!(err instanceof FrontmatterError)) throw err;
-			this.issue(rel, "error", "frontmatter-invalid", err.message);
-			[meta, body] = [{}, source];
-		}
-		const concept = new Concept(cid, rel, meta ?? {}, body, mtime);
-		if (meta === null) this.issue(rel, "error", "frontmatter-missing", "missing YAML frontmatter");
-		else if (!concept.type) this.issue(rel, "error", "type-missing", "frontmatter has no non-empty 'type'");
-		if ("generated" in concept.meta && !("by" in concept.generated)) this.issue(rel, "warning", "generated-without-by", "'generated' should record 'by'");
-		for (const event of concept.verified) if (!("by" in event)) this.issue(rel, "warning", "verified-without-by", "'verified' entry without 'by'");
-		this.concepts.set(cid, concept);
-		this.directories.get(dirname(rel)).concepts.push(cid);
-	}
-	checkIndex(source, rel, directory) {
-		let meta;
-		try {
-			[meta] = splitFrontmatter(source);
-		} catch (err) {
-			if (!(err instanceof FrontmatterError)) throw err;
-			this.issue(rel, "error", "frontmatter-invalid", err.message);
-			return;
-		}
-		if (meta === null) return;
-		if (directory !== "") this.issue(rel, "error", "index-frontmatter", "index.md below the root must not have frontmatter");
-		else if (Object.keys(meta).some((k) => k !== "okf_version")) this.issue(rel, "error", "root-index-frontmatter", "root index.md frontmatter may only carry okf_version");
-		else this.rootMeta = meta;
-	}
-	checkLog(source, rel) {
-		for (const line of source.split("\n")) if (line.startsWith("## ") && !LOG_DATE.test(strip(line.slice(3)))) this.issue(rel, "warning", "log-heading-date", `log heading is not YYYY-MM-DD: ${strip(line)}`);
-	}
-	/** A link's target as a path in the bundle (not checked to exist), or null for an address or a way out of it. */
-	filePath(concept, raw) {
-		if (!raw || raw.startsWith("#") || SCHEME.test(raw)) return null;
-		const target = unquote(raw.split("#", 1)[0].split("?", 1)[0]);
-		if (!target || target.endsWith("/")) return null;
-		const norm = normpath(target.startsWith("/") ? target.replace(/^\/+/, "") : join(concept.directory, target));
-		return norm.startsWith("..") || norm === "." ? null : norm;
-	}
-	resolve(concept, raw) {
-		if (!raw || raw.startsWith("#") || SCHEME.test(raw)) return null;
-		const target = unquote(raw.split("#", 1)[0].split("?", 1)[0]);
-		if (!target) return null;
-		const joined = target.startsWith("/") ? target.replace(/^\/+/, "") : join(concept.directory, target);
-		let norm = joined ? normpath(joined) : ".";
-		if (norm.startsWith("..")) return null;
-		if (norm === ".") norm = "";
-		const link = (t, kind, broken) => ({
-			target: t,
-			kind,
-			broken,
-			rel: null
-		});
-		if (target.endsWith("/") || this.directories.has(norm)) return link(norm + "/", "directory", !this.directories.has(norm));
-		if (norm.endsWith("/index.md") || norm === "index.md") {
-			const d = dirname(norm);
-			return link(d + "/", "directory", !this.directories.has(d));
-		}
-		if (norm.endsWith(".md")) {
-			const cid = norm.slice(0, -3);
-			return link(cid, "concept", !this.concepts.has(cid));
-		}
-		return null;
-	}
-	/** Each concept's direct prerequisites: the concepts it links to as `requires`. */
-	requiresGraph() {
-		return this.memo("requires", () => {
-			const graph = /* @__PURE__ */ new Map();
-			for (const [cid, c] of this.concepts) {
-				const targets = new Set(c.links.filter((l) => l.rel === "requires" && l.kind === "concept" && !l.broken && l.target !== cid && this.concepts.has(l.target)).map((l) => l.target));
-				graph.set(cid, [...targets].sort(cmp));
-			}
-			return graph;
-		});
-	}
-	/** Strongly connected components of the requires graph (Tarjan), singletons
-	*  included; a component is a group that require each other. */
-	components() {
-		return this.memo("components", () => {
-			const graph = this.requiresGraph();
-			const index = /* @__PURE__ */ new Map(), low = /* @__PURE__ */ new Map();
-			const stack = [], onStack = /* @__PURE__ */ new Set(), groups = [];
-			let counter = 0;
-			const visit = (v) => {
-				index.set(v, counter);
-				low.set(v, counter);
-				counter++;
-				stack.push(v);
-				onStack.add(v);
-				for (const w of graph.get(v)) if (!index.has(w)) {
-					visit(w);
-					low.set(v, Math.min(low.get(v), low.get(w)));
-				} else if (onStack.has(w)) low.set(v, Math.min(low.get(v), index.get(w)));
-				if (low.get(v) === index.get(v)) {
-					const group = [];
-					for (;;) {
-						const w = stack.pop();
-						onStack.delete(w);
-						group.push(w);
-						if (w === v) break;
-					}
-					groups.push(group.sort(cmp));
-				}
-			};
-			for (const v of [...graph.keys()].sort(cmp)) if (!index.has(v)) visit(v);
-			return groups;
-		});
-	}
-	/** Groups of concepts that require each other, directly or through a chain. */
-	requiresCycles() {
-		return this.components().filter((g) => g.length > 1).sort(cmpTuple);
-	}
-	/** Every concept's place in a reading order and its depth (the longest chain
-	*  of prerequisites below it). A topological sort of the requires graph with
-	*  cycles as one step; among the notes ready, it prefers staying in the
-	*  folder just read, then shallower notes, then folder and title. */
-	prerequisiteOrder() {
-		return this.memo("order", () => {
-			const graph = this.requiresGraph();
-			const comps = this.components();
-			const compOf = /* @__PURE__ */ new Map();
-			comps.forEach((g, i) => g.forEach((cid) => compOf.set(cid, i)));
-			const needs = comps.map((g, i) => [...new Set(g.flatMap((v) => graph.get(v).map((w) => compOf.get(w))))].filter((j) => j !== i).sort((a, b) => a - b));
-			const depth = comps.map(() => -1);
-			comps.forEach((_, i) => {
-				depth[i] = 1 + Math.max(-1, ...needs[i].map((j) => depth[j]));
-			});
-			const waiting = needs.map((n) => n.length);
-			const unlocks = comps.map(() => []);
-			needs.forEach((n, i) => n.forEach((j) => unlocks[j].push(i)));
-			const ready = new Set(waiting.flatMap((w, i) => w === 0 ? [i] : []));
-			const lower = (cid) => this.concepts.get(cid).title.toLowerCase();
-			const title = comps.map((g) => g.map(lower).sort(cmp)[0]);
-			const folder = comps.map((g) => this.concepts.get(g[0]).directory);
-			const parts = folder.map((f) => f ? f.split("/") : []);
-			const shared = (a, b) => {
-				let n = 0;
-				while (n < Math.min(a.length, b.length) && a[n] === b[n]) n++;
-				return n;
-			};
-			const out = /* @__PURE__ */ new Map();
-			let last = null;
-			while (ready.size) {
-				const near = last === null ? [] : parts[last];
-				const key = (k) => [
-					-shared(parts[k], near),
-					depth[k],
-					folder[k],
-					title[k]
-				];
-				let best = -1;
-				for (const k of [...ready].sort((a, b) => a - b)) if (best < 0 || cmpTuple(key(k), key(best)) < 0) best = k;
-				ready.delete(best);
-				for (const cid of [...comps[best]].sort((a, b) => cmp(lower(a), lower(b)))) out.set(cid, {
-					order: out.size,
-					depth: depth[best]
-				});
-				last = best;
-				for (const k of unlocks[best]) if (--waiting[k] === 0) ready.add(k);
-			}
-			return out;
-		});
-	}
-	/** Everything `cid` requires, directly or through a chain, in reading order. */
-	prerequisites(cid) {
-		const graph = this.requiresGraph();
-		const seen = /* @__PURE__ */ new Set();
-		const todo = [...graph.get(cid) ?? []];
-		while (todo.length) {
-			const v = todo.pop();
-			if (!seen.has(v)) {
-				seen.add(v);
-				todo.push(...graph.get(v));
-			}
-		}
-		seen.delete(cid);
-		const order = this.prerequisiteOrder();
-		return [...seen].sort((a, b) => order.get(a).order - order.get(b).order);
-	}
-	/** The concepts that link to `cid`. */
-	backlinks(cid) {
-		return this.memo("backlinks", () => {
-			const m = /* @__PURE__ */ new Map();
-			for (const c of this.concepts.values()) for (const l of c.links) {
-				if (!m.has(l.target)) m.set(l.target, /* @__PURE__ */ new Set());
-				m.get(l.target).add(c.id);
-			}
-			return new Map([...m].map(([t, ids]) => [t, [...ids].sort(cmp)]));
-		}).get(cid) ?? [];
-	}
-	/** Accept an id, a bundle path, or a bundle-absolute link. */
-	resolveId(ref) {
-		let id = strip(ref).replace(/^\/+/, "");
-		if (id.endsWith(".md")) id = id.slice(0, -3);
-		return this.concepts.has(id) ? id : null;
-	}
-	/** Every issue found in the bundle. */
-	lint() {
-		return [...this.issues];
-	}
-	overviewFor(directory) {
-		for (const cid of this.directories.get(directory).concepts) {
-			const c = this.concepts.get(cid);
-			if (c.type.toLowerCase() === "overview") return c;
-		}
-		return null;
-	}
-	/** The generated OKF §8 index of a folder. */
-	renderIndex(directory) {
-		const d = this.directories.get(directory);
-		const groups = /* @__PURE__ */ new Map();
-		for (const cid of d.concepts) {
-			const c = this.concepts.get(cid);
-			const t = c.type || "Concept";
-			if (!groups.has(t)) groups.set(t, []);
-			groups.get(t).push(c);
-		}
-		const parts = [];
-		if (directory === "") parts.push(`---\nokf_version: "0.2"\n---\n`);
-		const typeKey = (t) => [t.toLowerCase() !== "overview" ? 1 : 0, t.toLowerCase()];
-		for (const typeName of [...groups.keys()].sort((a, b) => cmpTuple(typeKey(a), typeKey(b)))) {
-			const items = [...groups.get(typeName)].sort((a, b) => cmp(a.title.toLowerCase(), b.title.toLowerCase()));
-			const lines = [`# ${typeName}`, ""];
-			for (const c of items) {
-				const desc = c.description ? ` - ${oneLine(c.description)}` : "";
-				lines.push(`* [${escape(c.title)}](${basename(c.path)})${desc}`);
-			}
-			parts.push(lines.join("\n") + "\n");
-		}
-		if (d.children.length) {
-			const lines = ["# Directories", ""];
-			for (const child of [...d.children].sort(cmp)) {
-				const overview = this.overviewFor(child);
-				const desc = overview?.description ? ` - ${oneLine(overview.description)}` : "";
-				const name = basename(child);
-				lines.push(`* [${name}](${name}/)${desc}`);
-			}
-			parts.push(lines.join("\n") + "\n");
-		}
-		if (!groups.size && !d.children.length) parts.push("# Contents\n");
-		return parts.join("\n").replace(/\s+$/u, "") + "\n";
-	}
-};
-const oneLine = (s) => strip(s).split(/\s+/u).filter(Boolean).join(" ");
-const escape = (s) => s.replaceAll("[", "\\[").replaceAll("]", "\\]");
-//#endregion
-//#region packages/core/src/source.ts
-const BOM = "";
-/** The file as `[prefix, frontmatter, body]`: `prefix + body` is exactly the text. The prefix is the frontmatter
-*  block with its fences and the blank lines under it; `frontmatter` is the YAML between the fences, or null. */
-function splitSource(text) {
-	const [raw] = frontmatterText(text);
-	if (raw === null) return [
-		"",
-		null,
-		text
-	];
-	const open = text.indexOf("\n") + 1;
-	let at = open;
-	for (const line of text.slice(open).split("\n")) {
-		at += line.length + 1;
-		if (line.replace(/\s+$/u, "") === "---") break;
-	}
-	at = Math.min(at, text.length);
-	while (text[at] === "\n" || text[at] === "\r" && text[at + 1] === "\n") at += text[at] === "\r" ? 2 : 1;
-	return [
-		text.slice(0, at),
-		raw,
-		text.slice(at)
-	];
-}
-const YAML_STYLE = {
-	lineWidth: 100,
-	flowCollectionPadding: false,
-	indentSeq: false
-};
-function node(doc, value) {
-	const n = doc.createNode(value);
-	const style = (x) => {
-		if (isSeq(x)) {
-			if (x.items.length && x.items.every((i) => isScalar(i) && !String(i.value).includes("\n"))) x.flow = true;
-			else x.items.forEach(style);
-		} else if (isMap(x)) x.items.forEach((p) => style(p.value));
-		else if (isScalar(x) && typeof x.value === "string" && x.value.includes("\n")) x.type = Scalar.BLOCK_LITERAL;
-	};
-	style(n);
-	return n;
-}
-/** One top-level field as it is written, ending in a line break. */
-function fieldText(key, value) {
-	const doc = new Document({}, { version: "1.2" });
-	const n = node(doc, value);
-	if (isMap(n) && n.items.every((p) => isScalar(p.value) && !String(p.value.value).includes("\n"))) n.flow = true;
-	doc.set(key, n);
-	return doc.toString(YAML_STYLE);
-}
-const lineStart = (text, at) => text.lastIndexOf("\n", at - 1) + 1;
-const lineEnd = (text, at) => {
-	const nl = text.indexOf("\n", at);
-	return nl < 0 ? text.length : nl + 1;
-};
-/** Change top-level frontmatter fields in `raw` (null removes one), touching only their lines; new fields go at
-*  the end, or `type` at the start. */
-function editFrontmatter(raw, changes) {
-	let text = raw && !raw.endsWith("\n") ? raw + "\n" : raw;
-	for (const [key, value] of Object.entries(changes)) {
-		const doc = parseYaml(text);
-		if (doc.errors.length) throw new FrontmatterError(`unparseable YAML frontmatter: ${doc.errors[0].message}`);
-		if (text.trim() && !isMap(doc.contents)) throw new FrontmatterError("frontmatter is not a mapping");
-		const pair = (isMap(doc.contents) ? doc.contents.items : []).find((p) => (isScalar(p.key) ? p.key.value : p.key) === key);
-		const replacement = value === null || value === void 0 ? "" : fieldText(key, value);
-		if (pair) {
-			const keyRange = pair.key.range;
-			const valueRange = pair.value?.range;
-			const start = lineStart(text, keyRange[0]);
-			const end = lineEnd(text, Math.max(keyRange[1], (valueRange?.[1] ?? keyRange[1]) - 1));
-			text = text.slice(0, start) + replacement + text.slice(end);
-		} else if (replacement) text = key === "type" ? replacement + text : text + replacement;
-	}
-	return text;
-}
-/** The file `before` with frontmatter fields changed and, when `body` is not null, its body replaced. What was
-*  not changed is kept to the character, the file's line endings and byte-order mark included. */
-function spliceText(before, changes, body) {
-	const bom = before.startsWith(BOM) ? BOM : "";
-	const [prefix, raw, oldBody] = splitSource(bom ? before.slice(1) : before);
-	let head = prefix;
-	if (Object.keys(changes).length) {
-		head = `---\n${editFrontmatter((raw ?? "").replace(/\r\n/g, "\n"), changes)}---\n${raw === null ? "\n" : prefix.slice(prefix.lastIndexOf("---") + 3).replace(/^[^\n]*\n/, "")}`;
-		if (before.includes("\r\n")) head = head.replace(/\r?\n/g, "\r\n");
-	}
-	let newBody = oldBody;
-	if (body !== null) newBody = before.includes("\r\n") ? body.replace(/\r?\n/g, "\r\n") : body;
-	return bom + head + newBody;
-}
-//#endregion
-//#region packages/core/src/unwrap.ts
-const ITEM = /^\s*([-*+]|\d+[.)])\s+/;
-const APART = /^\s*(#{1,6}\s|\||<|```|~~~|\$\$|>|---\s*$|\*\*\*\s*$|___\s*$|\[[^\]]+\]:\s)/;
-const QUOTED = /^\s*>\s?\S/;
-function unwrap(text) {
-	const lines = text.split("\n"), out = [];
-	let i = 0, fence = "", maths = false;
-	/** What the last line written may be continued by: prose, a quoted line, or nothing. */
-	let open = "";
-	if (lines[0] === "---") {
-		const end = lines.indexOf("---", 1);
-		if (end > 0) {
-			out.push(...lines.slice(0, end + 1));
-			i = end + 1;
-		}
-	}
-	for (; i < lines.length; i++) {
-		const l = lines[i], t = l.trim();
-		if (fence) {
-			out.push(l);
-			if (t.startsWith(fence)) fence = "";
-			continue;
-		}
-		if (maths) {
-			out.push(l);
-			if (t.endsWith("$$")) maths = false;
-			continue;
-		}
-		if (t.startsWith("```") || t.startsWith("~~~")) {
-			fence = t.slice(0, 3);
-			out.push(l);
-			open = "";
-			continue;
-		}
-		if (t.startsWith("$$") && !t.slice(2).includes("$$")) {
-			maths = true;
-			out.push(l);
-			open = "";
-			continue;
-		}
-		if (!t) {
-			out.push(l);
-			open = "";
-			continue;
-		}
-		const hard = /( {2}|\\)$/.test(out.at(-1) ?? "");
-		if (APART.test(l)) {
-			if (open === "quote" && QUOTED.test(l) && !/^\s*>\s*([-*+]|\d+[.)]|#)/.test(l) && !hard) {
-				out[out.length - 1] += " " + l.replace(/^\s*>\s?/, "").trim();
-				continue;
-			}
-			out.push(l);
-			open = QUOTED.test(l) ? "quote" : "";
-			continue;
-		}
-		if (ITEM.test(l)) {
-			out.push(l);
-			open = "prose";
-			continue;
-		}
-		if (open === "prose" && !hard) {
-			out[out.length - 1] += " " + t;
-			continue;
-		}
-		out.push(l);
-		open = open === "" && /^( {4}|\t)/.test(l) ? "" : "prose";
-	}
-	return out.join("\n");
-}
-//#endregion
-//#region packages/core/src/search.ts
-const TOKEN = /[a-z0-9]+(?:['’][a-z]+)?/g;
-const STOP = new Set("a an and are as at be by for from has have in is it its of on or that the this to was were will with not but if then than so do does did can could should would into about".split(" "));
-const FIELD_WEIGHTS = {
-	title: 4,
-	tags: 3,
-	description: 2,
-	headings: 2,
-	type: 1,
-	body: 1
-};
-const K1 = 1.4;
-const B = .75;
-function stem(token) {
-	for (const suffix of ["ness", "ing"]) if (token.endsWith(suffix) && token.length - suffix.length >= 4) return token.slice(0, -suffix.length);
-	if (token.length > 4 && token.endsWith("ies")) return token.slice(0, -3) + "y";
-	if (token.length > 3 && token.endsWith("s") && ![
-		"ss",
-		"us",
-		"is"
-	].some((e) => token.endsWith(e))) return token.slice(0, -1);
-	return token;
-}
-function tokenize(text) {
-	return (text.toLowerCase().replaceAll("’", "'").match(TOKEN) ?? []).filter((t) => !STOP.has(t)).map(stem);
-}
-/** Rounded as Python's round(x, 3) prints it (they differ only on exact ties). */
-const round3 = (x) => Number(x.toFixed(3));
-var SearchIndex = class {
-	bundle;
-	docs = /* @__PURE__ */ new Map();
-	lengths = /* @__PURE__ */ new Map();
-	df = /* @__PURE__ */ new Map();
-	avgLen;
-	constructor(bundle) {
-		this.bundle = bundle;
-		for (const [cid, c] of bundle.concepts) {
-			const tf = /* @__PURE__ */ new Map();
-			const fields = {
-				title: c.title,
-				tags: c.tags.join(" "),
-				description: c.description,
-				headings: headings(c.body).map((h) => h.text).join(" "),
-				type: c.type,
-				body: c.body
-			};
-			for (const [name, text] of Object.entries(fields)) for (const token of tokenize(text)) tf.set(token, (tf.get(token) ?? 0) + FIELD_WEIGHTS[name]);
-			this.docs.set(cid, tf);
-			this.lengths.set(cid, [...tf.values()].reduce((s, v) => s + v, 0));
-			for (const token of tf.keys()) this.df.set(token, (this.df.get(token) ?? 0) + 1);
-		}
-		const total = [...this.lengths.values()].reduce((s, v) => s + v, 0);
-		this.avgLen = this.lengths.size ? total / this.lengths.size : 0;
-	}
-	idf(token) {
-		const n = this.docs.size, df = this.df.get(token) ?? 0;
-		return Math.log(1 + (n - df + .5) / (df + .5));
-	}
-	search(query, { limit = 8, type, tags, trust, status, under } = {}) {
-		const terms = tokenize(query);
-		const wanted = new Set([...tags ?? []].map((t) => t.toLowerCase()));
-		const hits = [];
-		for (const [cid, tf] of this.docs) {
-			const c = this.bundle.concepts.get(cid);
-			if (type && c.type.toLowerCase() !== type.toLowerCase()) continue;
-			if (wanted.size) {
-				const have = new Set(c.tags.map((t) => t.toLowerCase()));
-				if (![...wanted].every((t) => have.has(t))) continue;
-			}
-			if (trust && c.trust !== trust) continue;
-			if (status && c.status !== status) continue;
-			if (under && !(cid + "/").startsWith(under.replace(/^\/+|\/+$/g, "") + "/")) continue;
-			let score = 0;
-			const norm = this.avgLen ? K1 * (.25 + B * this.lengths.get(cid) / this.avgLen) : K1;
-			for (const term of terms) {
-				const f = tf.get(term) ?? 0;
-				if (f) score += this.idf(term) * f * 2.4 / (f + norm);
-			}
-			if (terms.length && score <= 0) continue;
-			hits.push({
-				concept: c,
-				score,
-				snippet: snippet(c, terms)
-			});
-		}
-		hits.sort((a, b) => b.score - a.score || cmp(a.concept.id, b.concept.id));
-		return hits.slice(0, limit);
-	}
-};
-/** The first body line mentioning a query term, trimmed around the match. */
-function snippet(concept, terms, width = 160) {
-	const termSet = new Set(terms);
-	let inFence = false;
-	for (const raw of concept.body.split("\n")) {
-		const line = strip(raw);
-		if (line.startsWith("```") || line.startsWith("~~~")) {
-			inFence = !inFence;
-			continue;
-		}
-		if (inFence || !line) continue;
-		if (!tokenize(line).some((t) => termSet.has(t))) continue;
-		const chars = [...line];
-		const lower = [...line.toLowerCase()];
-		const find = (t, from = 0) => {
-			const tt = [...t];
-			outer: for (let i = from; i + tt.length <= lower.length; i++) {
-				for (let j = 0; j < tt.length; j++) if (lower[i + j] !== tt[j]) continue outer;
-				return i;
-			}
-			return -1;
-		};
-		const positions = [...termSet].map((t) => find(t)).filter((p) => p >= 0);
-		const pos = positions.length ? Math.min(...positions) : 0;
-		let start = Math.max(0, pos - Math.floor(width / 3));
-		if (start) {
-			const space = chars.indexOf(" ", start);
-			start = space >= 0 && space < pos ? space + 1 : start;
-		}
-		const text = chars.slice(start, start + width).join("");
-		return (start ? "…" : "") + text + (start + width < chars.length ? "…" : "");
-	}
-	return [...concept.description].slice(0, width).join("");
-}
-//#endregion
-//#region packages/core/src/record.ts
-const KINDS = [
-	"autodidactic",
-	"interactive",
-	"ai"
-];
-const MAX_EVENT_BYTES = 65536;
-const ID_RE = /^[0-9A-HJKMNP-TV-Z]{26}$/;
-const DEVICE_RE = /^[a-z0-9]{4,16}$/;
-const CROCKFORD = "0123456789ABCDEFGHJKMNPQRSTVWXYZ";
-const LINE_BREAKS = /* @__PURE__ */ new RegExp("\\r\\n|[\\n\\r\\v\\f\\x1c\\x1d\\x1e\\x85\\u2028\\u2029]");
-var LearnerError = class extends Error {};
-function encode(n, length) {
-	let out = "";
-	for (let i = length - 1; i >= 0; i--) out += CROCKFORD[Number(n >> BigInt(5 * i) & 31n)];
-	return out;
-}
-const RANDOM_MASK = (1n << 80n) - 1n;
-let last = [0, 0n];
-function random80() {
-	return crypto.getRandomValues(/* @__PURE__ */ new Uint8Array(10)).reduce((acc, b) => acc << 8n | BigInt(b), 0n);
-}
-/** A ULID. Within one millisecond the random part counts up, so ids from one
-*  device sort in the order they were made. */
-function newId(ms = Date.now()) {
-	const rand = ms === last[0] ? last[1] + 1n : random80();
-	last = [ms, rand];
-	return encode(BigInt(ms), 10) + encode(rand & RANDOM_MASK, 16);
-}
-/** A fixed id for an event written before events had ids: its time, and a
-*  hash of the line in place of randomness, so every device derives the same one. */
-function legacyId(line, at) {
-	const ms = toTime(typeof at === "string" ? at : null) ?? 0;
-	return encode(BigInt(ms), 10) + encode(BigInt("0x" + sha256(line).slice(0, 20)), 16);
-}
-/** The events in one record's text, in the order written, each once (a retried
-*  write can repeat one); lines that do not parse are skipped. */
-function readRecord(text) {
-	const out = [];
-	const seen = /* @__PURE__ */ new Set();
-	for (const line of text.split(LINE_BREAKS)) {
-		let e;
-		try {
-			e = JSON.parse(line);
-		} catch {
-			continue;
-		}
-		if (typeof e !== "object" || e === null || Array.isArray(e)) continue;
-		const event = e;
-		const withId = typeof event.id === "string" ? event : {
-			id: legacyId(line, event.at),
-			...event
-		};
-		if (!seen.has(withId.id)) {
-			seen.add(withId.id);
-			out.push(withId);
-		}
-	}
-	return out;
-}
-/** The union of several devices' records, by id, in time order. The same in
-*  any order and however often it is repeated. */
-function mergeRecords(...records) {
-	const byId = /* @__PURE__ */ new Map();
-	for (const record of records) for (const e of record) if (!byId.has(e.id)) byId.set(e.id, e);
-	return [...byId.keys()].sort().map((k) => byId.get(k));
-}
-/** Check an event from a page or agent, and stamp it (id, time, device) for
-*  appending. Callers supply the device id and the time. */
-function cleanEvent(event, { device, now = Date.now() }) {
-	if (typeof event !== "object" || event === null || Array.isArray(event)) throw new LearnerError("an event is a JSON object");
-	const e = event;
-	if (typeof e.event !== "string" || !e.event || e.event.length > 40) throw new LearnerError("an event needs an 'event' name");
-	if (e.kind !== void 0 && e.kind !== null && !KINDS.includes(e.kind)) throw new LearnerError(`'kind' is one of ${KINDS.join(", ")}`);
-	if (e.id !== void 0 && e.id !== null && !(typeof e.id === "string" && ID_RE.test(e.id))) throw new LearnerError("'id' is a ULID (26 characters)");
-	if (e.device !== void 0 && e.device !== null && !(typeof e.device === "string" && DEVICE_RE.test(e.device))) throw new LearnerError("'device' is 4 to 16 lowercase letters and digits");
-	const { at: _at, id, device: dev, ...rest } = e;
-	const out = {
-		id: id || newId(now),
-		at: iso(now),
-		device: dev || device,
-		...rest
-	};
-	if (new TextEncoder().encode(JSON.stringify(out)).length > 65536) throw new LearnerError("event too large");
-	return out;
-}
-//#endregion
-//#region packages/core/src/graph.ts
-const STRENGTH = {
-	requires: 3,
-	uses: 2,
-	"see also": 1
-};
-/** Note ids in the order the dashboard lists them (sorted, as the build writes them). */
-function noteIds(bundle) {
-	return [...bundle.concepts.keys()].sort(cmp);
-}
-/** Directed links between notes, each with its strongest rating. */
-function strengthEdges(bundle, ids = noteIds(bundle)) {
-	const strongest = /* @__PURE__ */ new Map();
-	for (const id of ids) for (const l of bundle.concepts.get(id).links) {
-		if (l.broken || l.kind !== "concept" || !bundle.concepts.has(l.target) || l.target === id) continue;
-		const key = id + "\n" + l.target;
-		strongest.set(key, Math.max(strongest.get(key) ?? 0, l.rel ? STRENGTH[l.rel] : 2));
-	}
-	return [...strongest].map(([key, s]) => {
-		const [a, b] = key.split("\n");
-		return [
-			a,
-			b,
-			s
-		];
-	});
-}
-/** PageRank over the links: how central each note is. */
-function pagerank(ids, edges, damping = .85, rounds = 40) {
-	const n = ids.length;
-	const out = new Map(ids.map((id) => [id, []]));
-	for (const [a, b] of edges) out.get(a).push(b);
-	let rank = new Map(ids.map((id) => [id, 1 / n]));
-	for (let i = 0; i < rounds; i++) {
-		const next = new Map(ids.map((id) => [id, (1 - damping) / n]));
-		let dangling = 0;
-		for (const id of ids) {
-			const targets = out.get(id);
-			if (!targets.length) {
-				dangling += rank.get(id);
-				continue;
-			}
-			const share = damping * rank.get(id) / targets.length;
-			for (const t of targets) next.set(t, next.get(t) + share);
-		}
-		for (const id of ids) next.set(id, next.get(id) + damping * dangling / n);
-		rank = next;
-	}
-	return rank;
-}
-/** Tarjan's strongly connected components: node → component number. */
-function stronglyConnected(ids, next) {
-	const index = /* @__PURE__ */ new Map(), low = /* @__PURE__ */ new Map(), onStack = /* @__PURE__ */ new Set();
-	const stack = [], component = /* @__PURE__ */ new Map();
-	let counter = 0, groups = 0;
-	const visit = (v) => {
-		index.set(v, counter);
-		low.set(v, counter);
-		counter++;
-		stack.push(v);
-		onStack.add(v);
-		for (const w of next(v)) if (!index.has(w)) {
-			visit(w);
-			low.set(v, Math.min(low.get(v), low.get(w)));
-		} else if (onStack.has(w)) low.set(v, Math.min(low.get(v), index.get(w)));
-		if (low.get(v) === index.get(v)) {
-			let w;
-			do {
-				w = stack.pop();
-				onStack.delete(w);
-				component.set(w, groups);
-			} while (w !== v);
-			groups++;
-		}
-	};
-	for (const v of ids) if (!index.has(v)) visit(v);
-	return component;
-}
-/** Links implied by others, as "from\nto" keys: a → c is implied when c can also
-*  be reached from a through a chain of links at least as strong (never through
-*  "see also"), as in a transitive reduction. Links inside a group of notes that
-*  require each other (a cycle) are left alone. Only the map hides them. */
-function impliedLinks(ids, edges) {
-	const out = new Map(ids.map((id) => [id, []]));
-	for (const [a, b, s] of edges) out.get(a).push([b, s]);
-	const component = stronglyConnected(ids, (v) => out.get(v).filter(([, s]) => s >= 2).map(([w]) => w));
-	const implied = /* @__PURE__ */ new Set();
-	for (const [a, c, s] of edges) {
-		if (component.get(a) === component.get(c)) continue;
-		const need = Math.max(s, 2);
-		const seen = /* @__PURE__ */ new Set([a]);
-		const stack = [];
-		for (const [b, sb] of out.get(a)) if (b !== c && sb >= need && !seen.has(b)) {
-			seen.add(b);
-			stack.push(b);
-		}
-		while (stack.length) {
-			const v = stack.pop();
-			if (v === c) {
-				implied.add(a + "\n" + c);
-				break;
-			}
-			for (const [w, sw] of out.get(v)) if (sw >= need && !seen.has(w)) {
-				seen.add(w);
-				stack.push(w);
-			}
-		}
-	}
-	return implied;
-}
-//#endregion
-//#region packages/core/src/blocks.ts
-const FENCE = /^\s{0,3}(`{3,}|~{3,})/;
-function blocks(source) {
-	const lines = source.split("\n"), out = [];
-	let i = 0;
-	if (lines[0]?.trimEnd() === "---") {
-		const close = lines.findIndex((l, k) => k > 0 && l.trimEnd() === "---");
-		if (close > 0) i = close + 1;
-	}
-	while (i < lines.length) {
-		if (!lines[i].trim()) {
-			i++;
-			continue;
-		}
-		const from = i;
-		let fence = null, maths = false;
-		for (; i < lines.length; i++) {
-			const line = lines[i], t = line.trim();
-			if (fence) {
-				if (t.startsWith(fence) && !t.slice(fence.length).trim().replaceAll(fence[0], "")) fence = null;
-				continue;
-			}
-			if (maths) {
-				if (t.endsWith("$$")) maths = false;
-				continue;
-			}
-			if (!t) break;
-			const f = FENCE.exec(line);
-			if (f) fence = f[1];
-			else if (t.startsWith("$$") && !(t.length > 2 && t.endsWith("$$"))) maths = true;
-		}
-		out.push({
-			from,
-			to: i,
-			text: lines.slice(from, i).join("\n")
-		});
-	}
-	return out;
-}
-/** The anchor of the block at `index`. */
-function anchorOf(all, index) {
-	const text = all[index].text;
-	let nth = 0;
-	for (let k = 0; k < index; k++) if (all[k].text === text) nth++;
-	return {
-		text,
-		nth
-	};
-}
-/** The index of the block an anchor names, or -1. A block that is now the only one with its text is found whatever its `nth`. */
-function findAnchor(all, anchor) {
-	const same = [];
-	all.forEach((b, k) => {
-		if (b.text === anchor.text) same.push(k);
-	});
-	if (same.length === 1) return same[0];
-	return same[anchor.nth] ?? -1;
-}
-//#endregion
-//#region packages/core/src/diff.ts
-var DiffError = class extends Error {};
-const TABLE_LIMIT = 4e6;
-function diffLines(a, b) {
-	let start = 0;
-	while (start < a.length && start < b.length && a[start] === b[start]) start++;
-	let endA = a.length, endB = b.length;
-	while (endA > start && endB > start && a[endA - 1] === b[endB - 1]) {
-		endA--;
-		endB--;
-	}
-	const n = endA - start, m = endB - start;
-	if (!n && !m) return [];
-	if (!n || !m || n * m > TABLE_LIMIT) return [{
-		at: start,
-		del: a.slice(start, endA),
-		ins: b.slice(start, endB)
-	}];
-	const w = m + 1, table = new Uint32Array((n + 1) * w);
-	for (let i = n - 1; i >= 0; i--) for (let j = m - 1; j >= 0; j--) table[i * w + j] = a[start + i] === b[start + j] ? table[(i + 1) * w + j + 1] + 1 : Math.max(table[(i + 1) * w + j], table[i * w + j + 1]);
-	const out = [];
-	let open = null, i = 0, j = 0;
-	const hunk = () => open ??= (out.push({
-		at: start + i,
-		del: [],
-		ins: []
-	}), out[out.length - 1]);
-	while (i < n || j < m) if (i < n && j < m && a[start + i] === b[start + j]) {
-		open = null;
-		i++;
-		j++;
-	} else if (j < m && (i === n || table[i * w + j + 1] >= table[(i + 1) * w + j])) {
-		hunk().ins.push(b[start + j]);
-		j++;
-	} else {
-		hunk().del.push(a[start + i]);
-		i++;
-	}
-	return out;
-}
-/** The later version, from the earlier and the hunks. Throws if the hunks were not made from `a`. */
-function applyHunks(a, hunks) {
-	const out = [];
-	let at = 0;
-	for (const h of hunks) {
-		if (h.at < at || h.at + h.del.length > a.length) throw new DiffError("a hunk is out of place");
-		for (let k = 0; k < h.del.length; k++) if (a[h.at + k] !== h.del[k]) throw new DiffError("a hunk does not match the text");
-		out.push(...a.slice(at, h.at), ...h.ins);
-		at = h.at + h.del.length;
-	}
-	out.push(...a.slice(at));
-	return out;
-}
-//#endregion
-//#region packages/core/src/journal.ts
-/** The kinds an entry may be. Format 1 also wrote `marks` (Iso's marking of an exercise): a journal moved in by
-*  `isorite migrate` may hold them, and they are passed over. */
-const KINDS$1 = [
-	"change",
-	"proposal",
-	"revise",
-	"discard"
-];
-const SNAPSHOT_EVERY = 40;
-const SESSION_GAP_MS = 18e5;
-/** Your edits in a row are one moment, one layer of a note's history (M24, T), until 10 minutes pass with none. */
-const LAYER_IDLE_MS = 6e5;
-const hashText = (text) => sha256(text).slice(0, 16);
-/** A stamp for a new entry. `last` is the newest entry anywhere in the study base, which decides the session. */
-function stamp(who, device, last, now = Date.now()) {
-	const id = newId(now);
-	const fresh = !last || now - Date.parse(last.at) > 18e5;
-	return {
-		id,
-		at: iso(now),
-		session: fresh ? id : last.session,
-		device,
-		who
-	};
-}
-/** The entries in a journal's text, each once, oldest first. Lines that do not parse are skipped. */
-function readJournal(text) {
-	const byId = /* @__PURE__ */ new Map();
-	for (const line of text.split("\n")) {
-		if (!line.trim()) continue;
-		let e;
-		try {
-			e = JSON.parse(line);
-		} catch {
-			continue;
-		}
-		if (typeof e !== "object" || e === null) continue;
-		const entry = e;
-		if (typeof entry.id !== "string" || !KINDS$1.includes(entry.kind) || byId.has(entry.id)) continue;
-		byId.set(entry.id, entry);
-	}
-	return [...byId.keys()].sort().map((k) => byId.get(k));
-}
-/** An entry as the line appended to the journal. */
-const journalLine = (entry) => JSON.stringify(entry) + "\n";
-const isChange = (e) => e.kind === "change";
-/** The note as the journal has it after the entry `upTo` (or after the last), and the changes that could not be
-*  replayed because the chain before them is missing. Null when the journal has no change yet. */
-function replay(entries, upTo) {
-	let text = null;
-	const broken = [];
-	for (const e of entries) {
-		if (upTo !== void 0 && e.id > upTo) break;
-		if (!isChange(e)) continue;
-		if (e.text !== void 0) text = e.text;
-		else if (text !== null && hashText(text) === e.before) try {
-			text = applyHunks(text.split("\n"), e.hunks).join("\n");
-		} catch {
-			broken.push(e.id);
-		}
-		else broken.push(e.id);
-	}
-	return text === null ? null : {
-		text,
-		hash: hashText(text),
-		broken
-	};
-}
-/** Who last wrote each line of the note as the journal last has it: `you`, `iso:…`, `agent:…` or `external`. Text
-*  kept from a proposal is its proposer's. Null when the journal's chain is broken, as nothing can then be said. */
-function authors(entries) {
-	const proposers = /* @__PURE__ */ new Map();
-	let owners = null, text = null;
-	for (const e of entries) {
-		if (e.kind === "proposal") proposers.set(e.id, e.who);
-		if (!isChange(e)) continue;
-		const who = e.why === "keep" && e.proposal ? proposers.get(e.proposal) ?? e.who : e.who;
-		if (owners === null || text === null) {
-			if (e.text === void 0) return null;
-			text = e.text.split("\n");
-			owners = text.map(() => who);
-			continue;
-		}
-		if (hashText(text.join("\n")) !== e.before) return null;
-		const next = [];
-		let at = 0;
-		for (const h of e.hunks) {
-			next.push(...owners.slice(at, h.at), ...h.ins.map(() => who));
-			at = h.at + h.del.length;
-		}
-		next.push(...owners.slice(at));
-		owners = next;
-		text = applyHunks(text, e.hunks);
-	}
-	return owners;
-}
-/** A line's words, spaces and marks, in order: what is compared to tell who wrote what within a line. */
-const tokens = (line) => line.match(/\s+|[\p{L}\p{N}_]+|[^\s\p{L}\p{N}_]/gu) ?? [];
-/** Who wrote each word of the note as the journal last has it, line by line, as runs. Where a change replaced
-*  lines, the old and the new are compared word by word, so a word kept keeps its writer and only the words put in
-*  are the changer's. Text kept from a proposal is its proposer's, as in `authors`. Null when the chain is broken. */
-function wordAuthors(entries) {
-	const proposers = /* @__PURE__ */ new Map();
-	let lines = null, text = null;
-	const line = (l, who) => {
-		const t = tokens(l);
-		return {
-			t,
-			w: t.map(() => who)
-		};
-	};
-	for (const e of entries) {
-		if (e.kind === "proposal") proposers.set(e.id, e.who);
-		if (!isChange(e)) continue;
-		const who = e.why === "keep" && e.proposal ? proposers.get(e.proposal) ?? e.who : e.who;
-		if (lines === null || text === null) {
-			if (e.text === void 0) return null;
-			text = e.text.split("\n");
-			lines = text.map((l) => line(l, who));
-			continue;
-		}
-		if (hashText(text.join("\n")) !== e.before) return null;
-		const next = [];
-		let at = 0;
-		for (const h of e.hunks) {
-			next.push(...lines.slice(at, h.at));
-			const old = lines.slice(h.at, h.at + h.del.length);
-			const a = [], aw = [];
-			old.forEach((l, k) => {
-				if (k) {
-					a.push("\n");
-					aw.push("");
-				}
-				a.push(...l.t);
-				aw.push(...l.w);
-			});
-			const b = [];
-			h.ins.forEach((l, k) => {
-				if (k) b.push("\n");
-				b.push(...tokens(l));
-			});
-			const bw = b.map(() => who);
-			const kept = [];
-			let i = 0, j = 0;
-			for (const d of diffLines(a, b)) {
-				while (i < d.at) {
-					kept.push([j, i]);
-					i++;
-					j++;
-				}
-				i += d.del.length;
-				j += d.ins.length;
-			}
-			while (i < a.length && j < b.length) {
-				kept.push([j, i]);
-				i++;
-				j++;
-			}
-			const words = (ts) => ts.filter((t) => /[\p{L}\p{N}]/u.test(t)).length;
-			if (kept.filter(([jj]) => /[\p{L}\p{N}]/u.test(b[jj])).length * 2 >= words(b)) for (const [jj, ii] of kept) bw[jj] = aw[ii];
-			let cur = {
-				t: [],
-				w: []
-			};
-			const made = [];
-			b.forEach((tok, k) => {
-				if (tok === "\n") {
-					made.push(cur);
-					cur = {
-						t: [],
-						w: []
-					};
-				} else {
-					cur.t.push(tok);
-					cur.w.push(bw[k]);
-				}
-			});
-			if (h.ins.length) made.push(cur);
-			next.push(...made);
-			at = h.at + h.del.length;
-		}
-		next.push(...lines.slice(at));
-		lines = next;
-		text = applyHunks(text, e.hunks);
-	}
-	return (lines ?? []).map((l) => {
-		const runs = [];
-		let pos = 0;
-		l.t.forEach((tok, k) => {
-			const who = l.w[k], last = runs.at(-1);
-			if (last && last.who === who && last.to === pos) last.to += tok.length;
-			else runs.push({
-				from: pos,
-				to: pos + tok.length,
-				who
-			});
-			pos += tok.length;
-		});
-		return runs;
-	});
-}
-/** The note as it was after an entry. */
-const textAt = (entries, id) => replay(entries, id)?.text ?? null;
-/** The entry for a change of the note's file to `after`, or null when nothing changed. The difference is taken
-*  from the journal's own last version, so the chain holds whatever the caller thought the file was. */
-function change(entries, after, s, why, extra = {}) {
-	const head = replay(entries);
-	if (head && head.text === after) return null;
-	const changes = entries.filter(isChange);
-	let sinceText = 0;
-	for (let k = changes.length - 1; k >= 0 && changes[k].text === void 0; k--) sinceText++;
-	const whole = !head || head.broken.length > 0 || sinceText + 1 >= 40;
-	return {
-		...s,
-		kind: "change",
-		why: head ? why : "start",
-		before: head ? head.hash : null,
-		after: hashText(after),
-		hunks: head ? diffLines(head.text.split("\n"), after.split("\n")) : [],
-		...whole ? { text: after } : {},
-		...extra
-	};
-}
-/** If the file is not what the journal last saw (it was edited elsewhere, or the note is new to the journal),
-*  the entry that records it. Call before anything else is entered. */
-function reconcile(entries, file, s) {
-	return change(entries, file, {
-		...s,
-		who: "external"
-	}, "external");
-}
-/** The proposals neither kept nor discarded, as last revised, oldest first. A rewrite waits while any of its
-*  regions does, and says which (`open`). */
-function pending(entries) {
-	const open = /* @__PURE__ */ new Map();
-	const settle = (id, region) => {
-		const p = open.get(id);
-		if (!p) return;
-		const left = p.form === "rewrite" && region !== void 0 ? (p.open ?? []).filter((k) => k !== region) : [];
-		if (p.form === "rewrite" && left.length) open.set(id, {
-			...p,
-			open: left
-		});
-		else open.delete(id);
-	};
-	for (const e of entries) if (e.kind === "proposal") open.set(e.id, e.form === "rewrite" ? {
-		...e,
-		open: e.regions.map((_, k) => k)
-	} : e);
-	else if (e.kind === "discard") settle(e.proposal, e.region);
-	else if (e.kind === "change" && e.proposal && e.why === "keep") settle(e.proposal, e.region);
-	else if (e.kind === "revise") {
-		const p = open.get(e.proposal);
-		if (!p) continue;
-		if (p.form === "insert" && e.text !== void 0) open.set(p.id, {
-			...p,
-			text: e.text
-		});
-		if (p.form === "rewrite" && e.regions) open.set(p.id, {
-			...p,
-			regions: p.regions.map((r, k) => ({
-				old: r.old,
-				new: e.regions[k] ?? r.new
-			}))
-		});
-	}
-	return [...open.values()];
-}
-/** Where a passage is in the note now, as character offsets, or null when its text is no longer there. */
-function findPassage(note, p) {
-	if (!p.text) return null;
-	let at = -1;
-	for (let n = 0; n <= p.nth; n++) {
-		at = note.indexOf(p.text, at + 1);
-		if (at < 0) break;
-	}
-	if (at < 0) {
-		const first = note.indexOf(p.text);
-		if (first < 0 || note.indexOf(p.text, first + 1) >= 0) return null;
-		at = first;
-	}
-	return {
-		from: at,
-		to: at + p.text.length
-	};
-}
-/** The passage between two character offsets of the note, as it is named in the journal. */
-function passageOf(note, from, to) {
-	const text = note.slice(from, to);
-	let nth = 0;
-	for (let at = note.indexOf(text); at >= 0 && at < from; at = note.indexOf(text, at + 1)) nth++;
-	return {
-		text,
-		nth
-	};
-}
-/** Null when the place of new text cannot be found: the proposal is then shown apart from the text, and is not lost. */
-function locate(note, p) {
-	if (p.form === "rewrite") return {
-		form: "rewrite",
-		regions: p.regions.map((r) => findPassage(note, r.old))
-	};
-	const all = blocks(note);
-	const a = p.after ? findAnchor(all, p.after) : -1, b = p.before ? findAnchor(all, p.before) : -1;
-	if (a >= 0) return {
-		form: "insert",
-		line: all[a].to
-	};
-	if (b >= 0) return {
-		form: "insert",
-		line: all[b].from
-	};
-	if (!p.after && !p.before) {
-		if (all.length) return {
-			form: "insert",
-			line: all[all.length - 1].to
-		};
-		const lines = note.split("\n");
-		let end = lines.length;
-		while (end > 0 && !lines[end - 1].trim()) end--;
-		return {
-			form: "insert",
-			line: end
-		};
-	}
-	if (!p.after && all.length) return {
-		form: "insert",
-		line: all[0].from
-	};
-	return null;
-}
-/** The note with a proposal written in. For a rewrite, `region` writes that one alone; without it, every region
-*  still open. Null when the place (or, for a rewrite, any of the places asked for) cannot be found. */
-function written(note, p, region) {
-	if (p.form === "rewrite") {
-		const places = (region !== void 0 ? [region] : p.open ?? p.regions.map((_, k) => k)).map((k) => ({
-			k,
-			at: p.regions[k] ? findPassage(note, p.regions[k].old) : null
-		}));
-		if (!places.length || places.some((x) => !x.at)) return null;
-		let out = note;
-		for (const { k, at } of places.sort((x, y) => y.at.from - x.at.from)) out = out.slice(0, at.from) + p.regions[k].new + out.slice(at.to);
-		return out;
-	}
-	const place = locate(note, p);
-	if (!place || place.form !== "insert") return null;
-	const lines = note.split("\n");
-	const blank = (k) => k < 0 || k >= lines.length || !lines[k].trim();
-	const ins = p.text.replace(/^\n+|\n+$/g, "").split("\n");
-	const at = place.line;
-	lines.splice(at, 0, ...blank(at - 1) ? [] : [""], ...ins, ...blank(at) ? [] : [""]);
-	return lines.join("\n");
-}
-/** A proposal to put `text` at a line of the note as it stands. */
-function insertAt(note, line) {
-	const all = blocks(note);
-	let prev = -1;
-	for (let k = 0; k < all.length; k++) if (all[k].from < line) prev = k;
-	return {
-		form: "insert",
-		after: prev >= 0 ? anchorOf(all, prev) : null,
-		before: prev + 1 < all.length ? anchorOf(all, prev + 1) : null
-	};
-}
-/** The journal as the timeline shows it. Your own edits in a row within a session are one moment, until ten minutes
-*  pass with none (LAYER_IDLE_MS); a proposal is one moment whose `what` says how it ended. Revisions are not
-*  moments. */
-function moments(entries) {
-	const out = [], offered = /* @__PURE__ */ new Map(), asked = /* @__PURE__ */ new Map();
-	/** Lines a change put in and took out: a note's first entry, all of its text. */
-	const size = (c) => c.why === "start" || !c.hunks.length && c.before === null ? [(c.text ?? "").split("\n").length, 0] : [c.hunks.reduce((n, h) => n + h.ins.length, 0), c.hunks.reduce((n, h) => n + h.del.length, 0)];
-	for (const e of entries) {
-		const base = {
-			ids: [e.id],
-			at: e.at,
-			session: e.session,
-			who: e.who,
-			added: 0,
-			removed: 0
-		};
-		if (e.kind === "proposal") {
-			const m = {
-				...base,
-				what: "offered",
-				asked: e.asked
-			};
-			offered.set(e.id, m);
-			asked.set(e.id, e.asked);
-			out.push(m);
-		} else if (e.kind === "discard") {
-			const m = offered.get(e.proposal);
-			if (m) {
-				m.what = "discarded";
-				m.ids.push(e.id);
-			}
-		} else if (e.kind === "change") {
-			const m = e.proposal ? offered.get(e.proposal) : void 0;
-			const [added, removed] = size(e);
-			if (e.why === "keep" && m) {
-				m.what = "kept";
-				m.ids.push(e.id);
-				m.at = e.at;
-				m.added += added;
-				m.removed += removed;
-				continue;
-			}
-			const last = out[out.length - 1];
-			if (e.why === "edit" && last && last.what === "edited" && last.who === e.who && last.session === e.session && Date.parse(e.at) - Date.parse(last.at) <= 6e5) {
-				last.ids.push(e.id);
-				last.at = e.at;
-				last.added += added;
-				last.removed += removed;
-				continue;
-			}
-			const what = e.why === "start" ? e.who === "external" ? "found" : "wrote" : e.why === "edit" ? "edited" : e.why === "restore" ? "restored" : e.why === "keep" ? "kept" : e.why === "move" ? "moved" : "changed elsewhere";
-			out.push({
-				...base,
-				what,
-				added,
-				removed,
-				...e.asked ? { asked: e.asked } : {}
-			});
-		}
-	}
-	return out;
-}
-/** Where a line of the version before a change is in the version after it, or null if the change took it out. */
-function carried(hunks, line) {
-	let shift = 0;
-	for (const h of hunks) {
-		if (line < h.at) break;
-		if (line < h.at + h.del.length) return null;
-		shift += h.ins.length - h.del.length;
-	}
-	return line + shift;
-}
-/** The lines of the version after a change that the change put there. */
-function putIn(c) {
-	if (c.why === "start" || !c.hunks.length && c.before === null) return (c.text ?? "").split("\n").map((_, k) => k);
-	const out = [];
-	let shift = 0;
-	for (const h of c.hunks) {
-		for (let k = 0; k < h.ins.length; k++) out.push(h.at + shift + k);
-		shift += h.ins.length - h.del.length;
-	}
-	return out;
-}
-/** The lines of the note as the journal has it now that a moment put there and that are still there, as runs of
-*  lines (from 0, through the whole file, `to` exclusive). `removed` when it put lines in and none are left. A
-*  moment that changed nothing in the file (Iso's text not kept, a marking) touches nothing. */
-function touched(entries, ids) {
-	const mine = new Set(ids);
-	let lines = /* @__PURE__ */ new Set(), put = false;
-	for (const e of entries) {
-		if (!isChange(e)) continue;
-		const next = /* @__PURE__ */ new Set();
-		for (const l of lines) {
-			const at = carried(e.hunks, l);
-			if (at !== null) next.add(at);
-		}
-		lines = next;
-		if (mine.has(e.id)) for (const l of putIn(e)) {
-			lines.add(l);
-			put = true;
-		}
-	}
-	const sorted = [...lines].sort((a, b) => a - b), runs = [];
-	for (const l of sorted) {
-		const last = runs[runs.length - 1];
-		if (last && last.to === l) last.to = l + 1;
-		else runs.push({
-			from: l,
-			to: l + 1
-		});
-	}
-	return {
-		runs,
-		removed: put && !runs.length
-	};
-}
-/** The moments of one session across notes, in the order they began. `journals` holds each note's entries of that
-*  session only. */
-function sessionMoments(journals) {
-	const out = [];
-	for (const [note, entries] of journals) for (const m of moments(entries)) out.push({
-		...m,
-		note
-	});
-	return out.sort((a, b) => a.ids[0] < b.ids[0] ? -1 : 1);
-}
-//#endregion
-//#region packages/core/src/own.ts
-const OWN_DIR = ".isorite";
-const OWN_FORMAT = 2;
-const GITATTRIBUTES = "*.jsonl merge=union\n";
-const SETTINGS_FILE = "settings.toml";
-function parseSettings(text) {
-	if (!text) return {};
-	let raw;
-	try {
-		raw = parse(text);
-	} catch {
-		return {};
-	}
-	return typeof raw.repository === "string" && raw.repository.trim() ? { repository: raw.repository.trim() } : {};
-}
-function settingsText(s) {
-	return `# isorite's settings for this base (format 2)\n${stringify$1(s)}\n`;
-}
-const SAFE = /^[^\0]+$/;
-function checkId(id) {
-	if (!SAFE.test(id) || id.startsWith("/") || id.split("/").some((part) => part === ".." || part === "." || !part)) throw new Error(`not a note's id: ${JSON.stringify(id)}`);
-	return id;
-}
-/** Where a note's journal is. Drafts are journalled under their `@draft/` ids (and Understanding notes were, before
-*  M24, under `@understanding/`). */
-const journalPath = (noteId) => `journal/${checkId(noteId)}.jsonl`;
-/** This device's record of usage: what was cleared from Iso's context, and what each turn cost (record.ts). */
-const recordPath = (device) => `record/${checkId(device)}.jsonl`;
-//#endregion
-//#region packages/core/src/study.ts
-const STUDY_FORMAT = 1;
-const CONFIG_FILE = "isorite.toml";
-const STUDY_DIR = "study";
-var StudyError = class extends Error {};
-function parseStudyConfig(source) {
-	let raw;
-	try {
-		raw = parse(source);
-	} catch (e) {
-		throw new StudyError(`${CONFIG_FILE} is not valid TOML: ${e.message}`);
-	}
-	const base = raw.base ?? {};
-	const format = raw.format === void 0 ? 1 : Number(raw.format);
-	if (format !== 1) throw new StudyError(`${CONFIG_FILE} is format ${text(raw.format)}; this isorite reads format 1`);
-	if (typeof base.path !== "string" || !base.path) throw new StudyError(`${CONFIG_FILE} needs [base] path, the knowledge base's folder`);
-	return {
-		format,
-		base: {
-			path: base.path,
-			remote: text(base.remote ?? ""),
-			root: text(base.root ?? "")
-		}
-	};
-}
-//#endregion
-//#region packages/core/src/map.ts
-/** The Atlas's model of a knowledge base: its folders and notes, and the links between notes, each with its strength.
-*  A question or a problem is joined to each note it is about, or uses, as a "uses" link from it (M12). */
-function mapModel(base) {
-	const order = base.prerequisiteOrder();
-	const note = (id) => {
-		const k = base.concepts.get(id).kind;
-		return {
-			kind: "concept",
-			id: "c:" + id,
-			ref: id,
-			weight: 1,
-			rank: order.get(id)?.depth ?? 0,
-			...k === "note" ? {} : { of: k }
-		};
-	};
-	const edges = [];
-	for (const c of base.concepts.values()) {
-		const strongest = /* @__PURE__ */ new Map();
-		for (const l of c.links) {
-			if (l.broken || l.kind !== "concept" || l.target === c.id || !base.concepts.has(l.target)) continue;
-			strongest.set(l.target, Math.max(strongest.get(l.target) ?? 0, l.rel && STRENGTH[l.rel] || STRENGTH.uses));
-		}
-		for (const to of c.attached) if (!strongest.has(to)) strongest.set(to, STRENGTH.uses);
-		for (const [to, s] of strongest) edges.push([
-			c.id,
-			to,
-			s
-		]);
-	}
-	const holdsFiles = /* @__PURE__ */ new Set();
-	const parentOf = (p) => p.includes("/") ? p.slice(0, p.lastIndexOf("/")) : "";
-	for (const f of base.files) holdsFiles.add(parentOf(f));
-	const pictureFolder = (d) => {
-		const dd = base.directories.get(d);
-		const here = [...base.files].filter((f) => parentOf(f) === d);
-		return !!d && (!dd || !dd.concepts.length && !dd.children.length) && here.length > 0 && here.every((f) => citeKind(f) === "image");
-	};
-	const refOf = (f) => citeKind(f) === "image" && pictureFolder(parentOf(f)) ? parentOf(f) + "/" : f;
-	const fileEdges = /* @__PURE__ */ new Map();
-	for (const c of base.concepts.values()) for (const x of c.cites) {
-		if (x.broken || !base.files.has(x.target)) continue;
-		const ref = refOf(x.target);
-		if (!fileEdges.has(c.id)) fileEdges.set(c.id, /* @__PURE__ */ new Set());
-		fileEdges.get(c.id).add(ref);
-	}
-	const rankOf = /* @__PURE__ */ new Map();
-	for (const [from, refs] of fileEdges) for (const ref of refs) {
-		edges.push([
-			from,
-			ref,
-			STRENGTH.uses
-		]);
-		rankOf.set(ref, Math.max(rankOf.get(ref) ?? 0, order.get(from)?.depth ?? 0));
-	}
-	const filesIn = /* @__PURE__ */ new Map();
-	for (const f of [...base.files].sort()) {
-		const of = citeKind(f), ref = of ? refOf(f) : null;
-		if (!of || !ref) continue;
-		const at = ref.endsWith("/") ? parentOf(ref.slice(0, -1)) : parentOf(f);
-		const list = filesIn.get(at) ?? [];
-		if (!list.some((n) => n.ref === ref)) list.push({
-			kind: "concept",
-			id: "f:" + ref,
-			ref,
-			weight: 1,
-			rank: rankOf.get(ref) ?? 0,
-			of
-		});
-		filesIn.set(at, list);
-	}
-	const dir = (id) => {
-		const d = base.directories.get(id);
-		if (id && pictureFolder(id)) return null;
-		const children = [
-			...[...d.children].sort().map(dir).filter((c) => c !== null),
-			...[...d.concepts].sort().map(note),
-			...filesIn.get(id) ?? []
-		];
-		return id && !children.length && (holdsFiles.has(id) || d.children.length) ? null : {
-			kind: "dir",
-			id: "d:" + id,
-			ref: id,
-			children
-		};
-	};
-	return {
-		root: dir(""),
-		edges
-	};
-}
-/** Whether a map item is a file (M23), not a note: its ref has an extension, or is a folder of pictures. */
-const isFileRef = (ref) => ref.endsWith("/") || citeKind(ref) !== null;
-/** What lights when a note is chosen on the Atlas (refs, as the map model names notes). Where the base rates its
-*  links, only "requires" is followed back; where it rates none, every drawn link is. */
-function reach(model, note) {
-	const least = model.edges.some(([, , s]) => s >= STRENGTH.requires) ? STRENGTH.requires : STRENGTH.uses;
-	const needs = /* @__PURE__ */ new Map(), neededBy = /* @__PURE__ */ new Map();
-	const uses = /* @__PURE__ */ new Set(), also = /* @__PURE__ */ new Set(), weak = [];
-	for (const [from, to, s] of model.edges) {
-		if (from === to) continue;
-		if (s < least) {
-			if (from !== note && to !== note) continue;
-			(s >= STRENGTH.uses ? uses : also).add(from === note ? to : from);
-			if (s >= STRENGTH.uses) weak.push({
-				from,
-				to,
-				kind: "uses"
-			});
-			continue;
-		}
-		needs.set(from, [...needs.get(from) ?? [], to]);
-		neededBy.set(to, [...neededBy.get(to) ?? [], from]);
-	}
-	const depth = {}, via = {};
-	const seen = /* @__PURE__ */ new Set([note]), requires = [], links = [], todo = [note];
-	for (let k = 0; k < todo.length; k++) {
-		const from = todo[k];
-		for (const to of needs.get(from) ?? []) {
-			links.push({
-				from,
-				to,
-				kind: "requires"
-			});
-			if (seen.has(to)) continue;
-			seen.add(to);
-			requires.push(to);
-			todo.push(to);
-			depth[to] = (depth[from] ?? 0) + 1;
-			via[to] = from;
-		}
-	}
-	const kept = /* @__PURE__ */ new Map();
-	for (const l of links) kept.set(l.from, (kept.get(l.from) ?? /* @__PURE__ */ new Set()).add(l.to));
-	for (const l of links) {
-		const met = /* @__PURE__ */ new Set(), walk = [...kept.get(l.from)].filter((t) => t !== l.to);
-		let found = false;
-		while (walk.length && !found) {
-			const v = walk.pop();
-			if (v === l.to) found = true;
-			else if (v !== l.from && !met.has(v)) {
-				met.add(v);
-				walk.push(...kept.get(v) ?? []);
-			}
-		}
-		if (found) {
-			l.spare = true;
-			kept.get(l.from).delete(l.to);
-		}
-	}
-	const builds = [...new Set(neededBy.get(note) ?? [])];
-	for (const from of builds) links.push({
-		from,
-		to: note,
-		kind: "builds"
-	});
-	const own = /* @__PURE__ */ new Set([...requires, ...builds]);
-	return {
-		requires,
-		depth,
-		via,
-		builds,
-		uses: [...uses].filter((r) => !own.has(r)),
-		also: [...also].filter((r) => !own.has(r) && !uses.has(r)),
-		links: [...links, ...weak.filter((l) => !own.has(l.from === note ? l.to : l.from))]
-	};
-}
-//#endregion
-//#region packages/core/src/agents.ts
-const NAMES = {
-	opencode: "OpenCode",
-	"claude-code": "Claude Code",
-	pi: "Pi"
-};
-/** An agent's name as people say it, from its own (`opencode`) or from a journal's who (`agent:opencode`). Empty when it is not an agent. */
-function agentName(name) {
-	const bare = name?.startsWith("agent:") ? name.slice(6) : name?.includes(":") ? "" : name ?? "";
-	return bare ? NAMES[bare] ?? bare : "";
-}
-//#endregion
-//#region packages/core/src/timeline.ts
-const WHAT = {
-	wrote: "wrote the note",
-	found: "found",
-	edited: "edited",
-	kept: "kept",
-	offered: "offered",
-	discarded: "removed",
-	restored: "restored an earlier version",
-	moved: "moved the note",
-	"changed elsewhere": "changed elsewhere"
-};
-/** Who did what: "you edited", "Iso · “give the Bethe lattice form” · kept". */
-function describe(m) {
-	const who = m.who === "you" ? "you" : m.who === "external" ? "outside isorite" : m.who.startsWith("agent:") ? agentName(m.who) : "Iso";
-	if (m.asked !== void 0) return `${who} · “${m.asked.length > 80 ? m.asked.slice(0, 80) + "…" : m.asked}” · ${m.what === "offered" ? "not kept yet" : WHAT[m.what]}`;
-	if (m.who === "external") return m.what === "found" ? "found as it was, outside isorite" : "changed outside isorite";
-	return `${who} ${WHAT[m.what]}`;
-}
-/** How long ago, in the largest whole unit. */
-function ago(at, now = Date.now()) {
-	const s = Math.max(0, (now - Date.parse(at)) / 1e3);
-	const [n, unit] = s < 90 ? [0, "now"] : s < 5400 ? [Math.round(s / 60), "minute"] : s < 129600 ? [Math.round(s / 3600), "hour"] : [Math.round(s / 86400), "day"];
-	return unit === "now" ? "just now" : `${n} ${unit}${n === 1 ? "" : "s"} ago`;
-}
-/** A moment is named by its last entry: the one the note is shown at. */
-const momentKey = (m) => m.ids.at(-1);
-//#endregion
-export { ABOUT, AGENTS_FILE, Bundle, CONFIG_FILE, Concept, DEVICE_RE, DONE, DiffError, Directory, FrontmatterError, GITATTRIBUTES, ID_RE, KINDS, LAYER_IDLE_MS, LearnerError, MAX_EVENT_BYTES, OKF_VERSION, OWN_DIR, OWN_FORMAT, RATINGS, SESSION_GAP_MS, SETTINGS_FILE, SNAPSHOT_EVERY, STRENGTH, STUDY_DIR, STUDY_FORMAT, SearchIndex, StudyError, agentName, ago, anchorOf, applyHunks, authors, blocks, change, citeKind, cleanEvent, cmp, cmpTuple, codeTarget, contentHash, describe, diffLines, doneOf, dumpFrontmatter, editFrontmatter, embedFor, embedRefs, fileType, findAnchor, findPassage, floatRepr, frontmatterText, hashText, headings, idsOf, impliedLinks, insertAt, isFileRef, iso, journalLine, journalPath, kindOf, legacyId, linkRefs, linkTexts, locate, mapModel, mergeRecords, momentKey, moments, newId, noteIds, outwardLinks, pagerank, parseSettings, parseStudyConfig, parseYaml, passageOf, pending, pictureSize, pictureType, pyRepr, rating, reach, readJournal, readRecord, reconcile, recordPath, replay, round3, section, sessionMoments, settingsText, sha256, slugify, snippet, spliceText, splitFrontmatter, splitSource, stamp, strengthEdges, strip, stronglyConnected, text, textAt, toTime, tokenize, touched, unwrap, wordAuthors, written };