@graftland/hmr 0.2.0-beta.0 → 0.2.0-beta.1

package/dist/internal/modules.js

@@ -1,7 +1,7 @@
+import { digest } from "./digest.js";
 import { registerHooks } from "node:module";
 import { fileURLToPath, pathToFileURL } from "node:url";
-import { Array, HashMap, HashSet, Option, Predicate, Schema, String } from "effect";
-import { Base64 } from "effect/encoding";
+import { Array, Chunk, HashMap, HashSet, Option, Predicate, Schema, String } from "effect";
 // src/internal/modules.ts
 var RestartRequired = class extends Schema.TaggedError()("RestartRequired", { url: Schema.String }) {};
 const isMissingEntry = (url, cause) => String.startsWith("file:")(url) && Predicate.hasProperty(cause, "code") && (cause.code === "ERR_MODULE_NOT_FOUND" && Predicate.hasProperty(cause, "url") && cause.url === url || cause.code === "ENOENT" && Predicate.hasProperty(cause, "path") && cause.path === fileURLToPath(url));
@@ -21,7 +21,6 @@ const fileRequest = (specifier, parent) => {
 const modules = (base, include) => {
 	const key = `graft-hmr-${++sessions}`;
 	const prefix = `${key}:`;
-	/** What `request` produces: the generation that imports a specifier. */
 	const decodeRequest = Schema.decodeUnknownOption(Schema.TemplateLiteralParser([
 		prefix,
 		Schema.String.check(Schema.isPattern(/^\d+$/)),
@@ -30,148 +29,225 @@ const modules = (base, include) => {
 	]));
 	let revision = 0;
 	let importing;
-	let dependencies = HashMap.empty();
+	let resolved;
+	let views = HashMap.empty();
 	let edges = HashMap.empty();
-	const link = (id, parent, child, request) => {
-		const graph = Option.getOrElse(HashMap.get(edges, id), HashMap.empty);
-		const children = Option.getOrElse(HashMap.get(graph, parent), HashMap.empty);
-		edges = HashMap.set(edges, id, HashMap.set(graph, parent, HashMap.set(children, request ?? child, {
-			generation: { id: Number(id) },
-			parent,
-			url: child,
-			...request === void 0 ? {} : { request }
-		})));
+	let sources = HashMap.empty();
+	let dependencies = HashSet.empty();
+	let reachCache = HashMap.empty();
+	let retained = HashSet.empty();
+	let instantiatedViews = HashSet.empty();
+	const clean = (url) => {
+		const value = new URL(url);
+		value.searchParams.delete(key);
+		return value.href;
+	};
+	const version = (url) => {
+		if (url === void 0) return void 0;
+		const value = new URL(url).searchParams.get(key);
+		return value === null ? void 0 : Number(value);
+	};
+	const tag = (url, id) => {
+		const value = new URL(url);
+		value.searchParams.set(key, String.String(id));
+		return value.href;
 	};
-	const reachable = (id, roots) => {
-		const graph = Option.getOrElse(HashMap.get(edges, id), HashMap.empty);
+	const route = (url, id) => Option.getOrElse(HashMap.get(Option.getOrElse(HashMap.get(views, id), HashMap.empty), url), () => tag(url, id));
+	const root = (attempt) => route(attempt.url, attempt.generation.id);
+	const children = (node) => Option.getOrElse(HashMap.get(edges, node), HashMap.empty);
+	const reachable = (node) => {
+		const cached = HashMap.get(reachCache, node);
+		if (Option.isSome(cached)) return cached.value;
 		let seen = HashSet.empty();
-		let pending = roots;
-		while (Array.isReadonlyArrayNonEmpty(pending)) {
-			const [url, ...rest] = pending;
-			pending = rest;
-			if (HashSet.has(seen, url)) continue;
-			seen = HashSet.add(seen, url);
-			pending = Array.appendAll(pending, Array.map(HashMap.toValues(Option.getOrElse(HashMap.get(graph, url), HashMap.empty)), (edge) => edge.url));
+		let pending = Chunk.of(node);
+		while (Chunk.isNonEmpty(pending)) {
+			const current = Chunk.headNonEmpty(pending);
+			pending = Chunk.drop(pending, 1);
+			if (HashSet.has(seen, current)) continue;
+			seen = HashSet.add(seen, current);
+			for (const edge of HashMap.values(children(current))) pending = Chunk.prepend(pending, edge.node);
 		}
+		reachCache = HashMap.set(reachCache, node, seen);
 		return seen;
 	};
-	const resolutionsFor = (attempt) => {
-		const id = String.String(attempt.generation.id);
-		const used = reachable(id, [attempt.url]);
-		const graph = Option.getOrElse(HashMap.get(edges, id), HashMap.empty);
-		return [...attempt.request === void 0 ? [] : [attempt], ...Array.flatMap(HashMap.toValues(graph), (children) => Array.filter(HashMap.toValues(children), (edge) => edge.request !== void 0 && HashSet.has(used, edge.parent)))];
+	const usedBy = (attempts) => {
+		const roots = HashSet.fromIterable(Array.map(attempts, root));
+		let used = HashSet.empty();
+		for (const node of roots) used = HashSet.union(used, reachable(node));
+		return used;
 	};
-	let sources = HashMap.empty();
-	let resolved;
-	const prepare = () => ({ id: ++revision });
-	const clean = (url) => {
-		const value = new URL(url);
-		value.searchParams.delete(key);
-		return value.href;
+	const link = (parent, node, request) => {
+		if (importing === void 0 && !HashSet.has(retained, parent) && !HashSet.has(instantiatedViews, version(parent))) return;
+		retained = HashSet.add(retained, node);
+		const url = clean(node);
+		const edge = {
+			node,
+			url,
+			generation: { id: version(node) },
+			...request === void 0 ? {} : { request }
+		};
+		const previous = HashMap.get(children(parent), request ?? url);
+		if (Option.exists(previous, (previous) => previous.node === node && previous.request === request)) return;
+		edges = HashMap.set(edges, parent, HashMap.set(children(parent), request ?? url, edge));
+		reachCache = HashMap.empty();
 	};
-	const version = (url) => url === void 0 ? null : new URL(url).searchParams.get(key);
+	const resolutions = (attempts) => [...Array.filter(attempts, (attempt) => attempt.request !== void 0), ...Array.flatMap(Array.fromIterable(usedBy(attempts)), (node) => Array.filter(HashMap.toValues(children(node)), (edge) => edge.request !== void 0))];
 	const unsupported = (url, format) => format === "commonjs" || format === "commonjs-typescript" || format === "addon" || String.endsWith(".node")(new URL(url).pathname);
-	const requireRestart = (url, id) => {
-		dependencies = HashMap.set(dependencies, id, HashSet.add(Option.getOrElse(HashMap.get(dependencies, id), HashSet.empty), url));
-		if (importing !== void 0 && String.String(importing.generation.id) === id && importing.reload) throw RestartRequired.make({ url });
+	const requireRestart = (node) => {
+		if (importing !== void 0 || HashSet.has(retained, node)) dependencies = HashSet.add(dependencies, node);
+		if (importing?.reload === true && importing.generation.id === version(node)) throw RestartRequired.make({ url: clean(node) });
 	};
-	const record = (url, id, format) => {
-		if (unsupported(url, format)) requireRestart(url, id);
+	const record = (node, format) => {
+		if (unsupported(clean(node), format)) requireRestart(node);
+	};
+	const invalidated = (attempts, dirty) => {
+		const used = usedBy(attempts);
+		let parents = HashMap.empty();
+		let pending = Chunk.empty();
+		for (const node of used) {
+			if (HashSet.has(dirty, clean(node))) pending = Chunk.prepend(pending, node);
+			for (const edge of HashMap.values(children(node))) {
+				parents = HashMap.set(parents, edge.node, HashSet.add(Option.getOrElse(HashMap.get(parents, edge.node), HashSet.empty), node));
+				if (edge.request !== void 0 && HashSet.has(dirty, edge.request)) pending = Chunk.prepend(pending, edge.node);
+			}
+		}
+		for (const attempt of attempts) if (attempt.request !== void 0 && HashSet.has(dirty, attempt.request)) pending = Chunk.prepend(pending, root(attempt));
+		let invalid = HashSet.empty();
+		while (Chunk.isNonEmpty(pending)) {
+			const node = Chunk.headNonEmpty(pending);
+			pending = Chunk.drop(pending, 1);
+			if (HashSet.has(invalid, node)) continue;
+			invalid = HashSet.add(invalid, node);
+			for (const parent of Option.getOrElse(HashMap.get(parents, node), HashSet.empty)) pending = Chunk.prepend(pending, parent);
+		}
+		return invalid;
+	};
+	const prepare = (attempts = [], invalid = HashSet.empty()) => {
+		const id = ++revision;
+		const seed = Array.reduce(attempts, 0, (id, attempt) => Math.max(id, attempt.generation.id));
+		let view = Option.getOrElse(HashMap.get(views, seed), HashMap.empty);
+		const used = usedBy(attempts);
+		for (const [url, node] of view) if (!HashSet.has(used, node) || HashSet.has(invalid, node)) view = HashMap.remove(view, url);
+		for (const node of used) {
+			if (HashSet.has(invalid, node)) continue;
+			const url = clean(node);
+			const previous = HashMap.get(view, url);
+			if (Option.isNone(previous) || version(previous.value) < version(node)) view = HashMap.set(view, url, node);
+		}
+		views = HashMap.set(views, id, view);
+		return { id };
 	};
 	const hooks = registerHooks({
 		resolve(specifier, context, nextResolve) {
+			const parentNode = context.parentURL;
 			const request = decodeRequest(specifier);
 			const entry = Option.isSome(request);
 			const id = Option.match(request, {
 				onNone: () => version(context.parentURL),
-				onSome: ([, id]) => id
+				onSome: ([, id]) => Number(id)
 			});
-			if (id === null) return nextResolve(specifier, context);
-			const resolve = () => nextResolve(Option.match(request, {
+			if (id === void 0) return nextResolve(specifier, context);
+			const target = Option.match(request, {
 				onNone: () => specifier,
 				onSome: ([, , , target]) => target
-			}), {
-				...context,
-				parentURL: entry ? base : clean(context.parentURL)
 			});
+			const parent = entry ? base : clean(context.parentURL);
+			const lexical = Option.getOrUndefined(fileRequest(target, parent));
 			const result = (() => {
 				try {
-					return resolve();
+					return nextResolve(target, {
+						...context,
+						parentURL: parent
+					});
 				} catch (cause) {
 					if (Predicate.hasProperty(cause, "url") && typeof cause.url === "string" && String.startsWith("file:")(cause.url)) {
 						if (entry) resolved = cause.url;
-						else if (context.parentURL !== void 0 && include(cause.url)) link(id, clean(context.parentURL), cause.url, Option.getOrUndefined(fileRequest(specifier, clean(context.parentURL))));
+						else if (include(cause.url)) link(parentNode, route(cause.url, id), lexical);
 					}
 					throw cause;
 				}
 			})();
 			if (entry) resolved = result.url;
-			if (!entry && result.url === "node:module" && context.parentURL !== void 0) {
-				link(id, clean(context.parentURL), result.url);
-				requireRestart(result.url, id);
+			if (!entry && result.url === "node:module") {
+				const node = route(result.url, id);
+				link(parentNode, node);
+				requireRestart(node);
 			}
 			if (!String.startsWith("file:")(result.url) || !entry && !include(result.url)) return result;
-			if (!entry && context.parentURL !== void 0) link(id, clean(context.parentURL), result.url, Option.getOrUndefined(fileRequest(specifier, clean(context.parentURL))));
+			const node = route(result.url, id);
+			if (!entry) link(parentNode, node, lexical);
 			const required = Array.contains(context.conditions, "require");
-			if (required) requireRestart(result.url, id);
-			else record(result.url, id, result.format);
-			if (required || unsupported(result.url, result.format)) return result;
-			const url = new URL(result.url);
-			url.searchParams.set(key, id);
-			return {
+			if (required) requireRestart(node);
+			else record(node, result.format);
+			return required || unsupported(result.url, result.format) ? result : {
 				...result,
-				url: url.href
+				url: node
 			};
 		},
 		load(url, context, nextLoad) {
 			const id = version(url);
-			if (id === null) return nextLoad(url, context);
+			if (id === void 0) return nextLoad(url, context);
+			instantiatedViews = HashSet.add(instantiatedViews, id);
 			const original = clean(url);
-			record(original, id, context.format);
+			record(url, context.format);
 			const result = nextLoad(original, context);
 			const source = result.source;
 			if (source !== void 0 && source !== null) {
 				const bytes = typeof source === "string" ? source : ArrayBuffer.isView(source) ? new Uint8Array(source.buffer, source.byteOffset, source.byteLength) : new Uint8Array(source);
-				sources = HashMap.set(sources, id, HashMap.set(Option.getOrElse(HashMap.get(sources, id), HashMap.empty), original, Base64.encode(bytes)));
+				if (importing !== void 0 || HashSet.has(retained, url)) sources = HashMap.set(sources, url, digest(bytes));
 			}
-			record(original, id, result.format);
+			record(url, result.format);
 			return result;
 		}
 	});
+	const files = (attempts) => {
+		let files = HashMap.empty();
+		const put = (url, node, resolution) => {
+			if (!String.startsWith("file:")(url) || HashSet.has(dependencies, node)) return;
+			const generation = version(node);
+			const previous = HashMap.get(files, url);
+			if (Option.exists(previous, (previous) => previous.generation > generation || previous.generation === generation && previous.resolution !== void 0)) return;
+			files = HashMap.set(files, url, {
+				generation,
+				content: Option.getOrUndefined(HashMap.get(sources, node)),
+				...resolution === void 0 ? {} : { resolution }
+			});
+		};
+		for (const node of usedBy(attempts)) put(clean(node), node);
+		for (const attempt of resolutions(attempts)) if (attempt.request !== void 0) put(attempt.request, root(attempt), pathToFileURL(fileURLToPath(attempt.url)).href);
+		return files;
+	};
 	return {
 		prepare,
+		files,
+		resolutions,
+		invalidated,
+		affected: (attempt, invalid) => HashSet.has(invalid, root(attempt)),
 		fileRequest: (specifier) => fileRequest(specifier, base),
-		resolutions: (attempts) => Array.flatMap(attempts, resolutionsFor),
-		files: (attempts) => Array.reduce(attempts, HashMap.empty(), (files, { generation, url, request }) => {
-			const contents = Option.getOrElse(HashMap.get(sources, String.String(generation.id)), HashMap.empty);
-			const unversioned = Option.getOrElse(HashMap.get(dependencies, String.String(generation.id)), HashSet.empty);
-			const tracked = Array.reduce(Array.fromIterable(reachable(String.String(generation.id), [url])), files, (files, url) => {
-				if (!String.startsWith("file:")(url) || HashSet.has(unversioned, url)) return files;
-				if (Option.exists(HashMap.get(files, url), (current) => current.generation > generation.id || current.generation === generation.id && current.resolution !== void 0)) return files;
-				return HashMap.set(files, url, {
-					generation: generation.id,
-					content: Option.getOrUndefined(HashMap.get(contents, url))
-				});
-			});
-			return Array.reduce(resolutionsFor({
-				generation,
-				url,
-				...request === void 0 ? {} : { request }
-			}), tracked, (files, edge) => {
-				if (edge.request === void 0 || HashSet.has(unversioned, edge.url) || Option.exists(HashMap.get(files, edge.request), (file) => file.generation > generation.id)) return files;
-				return HashMap.set(files, edge.request, {
-					generation: generation.id,
-					content: Option.getOrUndefined(HashMap.get(contents, edge.url)),
-					resolution: pathToFileURL(fileURLToPath(edge.url)).href
-				});
-			});
-		}),
 		unsupported: (generation, roots) => {
-			const found = Option.getOrElse(HashMap.get(dependencies, String.String(generation.id)), HashSet.empty);
-			if (roots === void 0) return found;
-			const used = reachable(String.String(generation.id), roots);
-			return HashSet.filter(found, (url) => HashSet.has(used, url));
+			const used = roots === void 0 ? void 0 : usedBy(Array.map(roots, (url) => ({
+				url,
+				generation
+			})));
+			return HashSet.fromIterable(Array.map(Array.filter(Array.fromIterable(dependencies), (node) => used === void 0 ? version(node) === generation.id : HashSet.has(used, node)), clean));
+		},
+		collect: (attempts) => {
+			const used = usedBy(attempts);
+			const ownedViews = HashSet.fromIterable(Array.map(attempts, (attempt) => attempt.generation.id));
+			views = HashMap.filter(views, (_, id) => id === revision || HashSet.has(instantiatedViews, id) || HashSet.has(ownedViews, id));
+			const keep = (node) => HashSet.has(used, node) || HashSet.has(instantiatedViews, version(node));
+			retained = used;
+			sources = HashMap.filter(sources, (_, node) => keep(node));
+			edges = HashMap.filter(edges, (_, node) => keep(node));
+			dependencies = HashSet.filter(dependencies, keep);
+			reachCache = HashMap.filter(reachCache, (_, node) => HashSet.has(used, node));
 		},
+		counts: () => ({
+			sources: HashMap.size(sources),
+			edges: HashMap.size(edges),
+			dependencies: HashSet.size(dependencies),
+			views: HashMap.size(views)
+		}),
 		start: (generation, reload = false) => {
 			importing = {
 				generation,
@@ -186,7 +262,16 @@ const modules = (base, include) => {
 			return `${prefix}${importing.generation.id}:${specifier}`;
 		},
 		resolved: () => Option.fromUndefinedOr(resolved),
-		close: () => hooks.deregister()
+		close: () => {
+			hooks.deregister();
+			views = HashMap.empty();
+			sources = HashMap.empty();
+			edges = HashMap.empty();
+			dependencies = HashSet.empty();
+			reachCache = HashMap.empty();
+			retained = HashSet.empty();
+			instantiatedViews = HashSet.empty();
+		}
 	};
 };
 export { RestartRequired, isMissingEntry, modules };

package/dist/internal/modules.js.map

@@ -1 +1 @@
-{"version":3,"file":"modules.js","names":[],"sources":["../../src/internal/modules.ts"],"sourcesContent":["// Node's synchronous module hooks have no Effect equivalent.\nimport { Base64 } from \"effect/encoding\"\nimport { registerHooks } from \"node:module\"\nimport { fileURLToPath, pathToFileURL } from \"node:url\"\nimport {\n\tArray,\n\tHashMap,\n\tHashSet,\n\tOption,\n\tPredicate,\n\tSchema,\n\tString,\n} from \"effect\"\n\nexport class RestartRequired extends Schema.TaggedError<\n\tRestartRequired,\n\t{ readonly brand: unique symbol }\n>()(\"RestartRequired\", { url: Schema.String }) {}\n\n// Only a missing entry is disposable; missing dependencies still fail the reload.\nexport const isMissingEntry = (url: string, cause: unknown): boolean =>\n\tString.startsWith(\"file:\")(url) &&\n\tPredicate.hasProperty(cause, \"code\") &&\n\t((cause.code === \"ERR_MODULE_NOT_FOUND\" &&\n\t\tPredicate.hasProperty(cause, \"url\") &&\n\t\tcause.url === url) ||\n\t\t(cause.code === \"ENOENT\" &&\n\t\t\tPredicate.hasProperty(cause, \"path\") &&\n\t\t\tcause.path === fileURLToPath(url)))\n\n// Allocated only when a session starts; importing this module performs no I/O.\nlet sessions = 0\n\nexport interface Generation {\n\treadonly id: number\n}\n\n/** Bytes actually read by a particular native import attempt. */\nexport interface FileVersion {\n\treadonly generation: number\n\treadonly content: string | undefined\n\treadonly resolution?: string\n}\n\nexport interface Attempt {\n\treadonly generation: Generation\n\treadonly url: string\n\treadonly request?: string\n}\n\ninterface Dependency extends Attempt {\n\treadonly parent: string\n}\n\n/** Resolve local requests lexically; Node's cached physical target is a separate fact. */\nconst fileRequest = (\n\tspecifier: string,\n\tparent: string,\n): Option.Option<string> => {\n\tif (\n\t\t!Array.some([\"file:\", \"./\", \"../\", \"/\"], (prefix) =>\n\t\t\tString.startsWith(prefix)(specifier),\n\t\t)\n\t)\n\t\treturn Option.none()\n\tconst url = new URL(specifier, parent)\n\treturn url.protocol === \"file:\" ? Option.some(url.href) : Option.none()\n}\n\n/** A scoped Node hook. Mutable bindings bridge synchronous hooks to Effect. */\nexport const modules = (base: string, include: (url: string) => boolean) => {\n\tconst key = `graft-hmr-${++sessions}`\n\tconst prefix = `${key}:`\n\t/** What `request` produces: the generation that imports a specifier. */\n\tconst decodeRequest = Schema.decodeUnknownOption(\n\t\tSchema.TemplateLiteralParser([\n\t\t\tprefix,\n\t\t\tSchema.String.check(Schema.isPattern(/^\\d+$/)),\n\t\t\t\":\",\n\t\t\tSchema.String,\n\t\t]),\n\t)\n\tlet revision = 0\n\tlet importing:\n\t\t{ readonly generation: Generation; readonly reload: boolean } | undefined\n\t// Dependency facts outlive an import operation: apply may import modules later.\n\tlet dependencies = HashMap.empty<string, HashSet.HashSet<string>>()\n\tlet edges = HashMap.empty<\n\t\tstring,\n\t\tHashMap.HashMap<string, HashMap.HashMap<string, Dependency>>\n\t>()\n\tconst link = (\n\t\tid: string,\n\t\tparent: string,\n\t\tchild: string,\n\t\trequest?: string,\n\t) => {\n\t\tconst graph = Option.getOrElse(\n\t\t\tHashMap.get(edges, id),\n\t\t\tHashMap.empty<string, HashMap.HashMap<string, Dependency>>,\n\t\t)\n\t\tconst children = Option.getOrElse(\n\t\t\tHashMap.get(graph, parent),\n\t\t\tHashMap.empty<string, Dependency>,\n\t\t)\n\t\tedges = HashMap.set(\n\t\t\tedges,\n\t\t\tid,\n\t\t\tHashMap.set(\n\t\t\t\tgraph,\n\t\t\t\tparent,\n\t\t\t\tHashMap.set(children, request ?? child, {\n\t\t\t\t\tgeneration: { id: Number(id) },\n\t\t\t\t\tparent,\n\t\t\t\t\turl: child,\n\t\t\t\t\t...(request === undefined ? {} : { request }),\n\t\t\t\t}),\n\t\t\t),\n\t\t)\n\t}\n\tconst reachable = (id: string, roots: ReadonlyArray<string>) => {\n\t\tconst graph = Option.getOrElse(\n\t\t\tHashMap.get(edges, id),\n\t\t\tHashMap.empty<string, HashMap.HashMap<string, Dependency>>,\n\t\t)\n\t\tlet seen = HashSet.empty<string>()\n\t\tlet pending = roots\n\t\twhile (Array.isReadonlyArrayNonEmpty(pending)) {\n\t\t\tconst [url, ...rest] = pending\n\t\t\tpending = rest\n\t\t\tif (HashSet.has(seen, url)) continue\n\t\t\tseen = HashSet.add(seen, url)\n\t\t\tpending = Array.appendAll(\n\t\t\t\tpending,\n\t\t\t\tArray.map(\n\t\t\t\t\tHashMap.toValues(\n\t\t\t\t\t\tOption.getOrElse(\n\t\t\t\t\t\t\tHashMap.get(graph, url),\n\t\t\t\t\t\t\tHashMap.empty<string, Dependency>,\n\t\t\t\t\t\t),\n\t\t\t\t\t),\n\t\t\t\t\t(edge) => edge.url,\n\t\t\t\t),\n\t\t\t)\n\t\t}\n\t\treturn seen\n\t}\n\t// Both checks and polling derive resolution facts from the same owned graph.\n\tconst resolutionsFor = (attempt: Attempt): ReadonlyArray<Attempt> => {\n\t\tconst id = String.String(attempt.generation.id)\n\t\tconst used = reachable(id, [attempt.url])\n\t\tconst graph = Option.getOrElse(\n\t\t\tHashMap.get(edges, id),\n\t\t\tHashMap.empty<string, HashMap.HashMap<string, Dependency>>,\n\t\t)\n\t\treturn [\n\t\t\t...(attempt.request === undefined ? [] : [attempt]),\n\t\t\t...Array.flatMap(HashMap.toValues(graph), (children) =>\n\t\t\t\tArray.filter(\n\t\t\t\t\tHashMap.toValues(children),\n\t\t\t\t\t(edge) =>\n\t\t\t\t\t\tedge.request !== undefined && HashSet.has(used, edge.parent),\n\t\t\t\t),\n\t\t\t),\n\t\t]\n\t}\n\n\tlet sources = HashMap.empty<string, HashMap.HashMap<string, string>>()\n\tlet resolved: string | undefined\n\n\tconst prepare = (): Generation => ({\n\t\tid: ++revision,\n\t})\n\tconst clean = (url: string): string => {\n\t\tconst value = new URL(url)\n\t\tvalue.searchParams.delete(key)\n\t\treturn value.href\n\t}\n\tconst version = (url: string | undefined): string | null =>\n\t\turl === undefined ? null : new URL(url).searchParams.get(key)\n\tconst unsupported = (url: string, format: string | null | undefined) =>\n\t\tformat === \"commonjs\" ||\n\t\tformat === \"commonjs-typescript\" ||\n\t\tformat === \"addon\" ||\n\t\tString.endsWith(\".node\")(new URL(url).pathname)\n\tconst requireRestart = (url: string, id: string) => {\n\t\tdependencies = HashMap.set(\n\t\t\tdependencies,\n\t\t\tid,\n\t\t\tHashSet.add(\n\t\t\t\tOption.getOrElse(HashMap.get(dependencies, id), HashSet.empty<string>),\n\t\t\t\turl,\n\t\t\t),\n\t\t)\n\t\tif (\n\t\t\timporting !== undefined &&\n\t\t\tString.String(importing.generation.id) === id &&\n\t\t\timporting.reload\n\t\t)\n\t\t\tthrow RestartRequired.make({ url })\n\t}\n\n\tconst record = (\n\t\turl: string,\n\t\tid: string,\n\t\tformat: string | null | undefined,\n\t) => {\n\t\tif (unsupported(url, format)) requireRestart(url, id)\n\t}\n\n\tconst hooks = registerHooks({\n\t\tresolve(specifier, context, nextResolve) {\n\t\t\tconst request = decodeRequest(specifier)\n\t\t\tconst entry = Option.isSome(request)\n\t\t\tconst id = Option.match(request, {\n\t\t\t\tonNone: () => version(context.parentURL),\n\t\t\t\tonSome: ([, id]) => id,\n\t\t\t})\n\t\t\tif (id === null) return nextResolve(specifier, context)\n\t\t\tconst resolve = () =>\n\t\t\t\tnextResolve(\n\t\t\t\t\tOption.match(request, {\n\t\t\t\t\t\tonNone: () => specifier,\n\t\t\t\t\t\tonSome: ([, , , target]) => target,\n\t\t\t\t\t}),\n\t\t\t\t\t{\n\t\t\t\t\t\t...context,\n\t\t\t\t\t\tparentURL: entry ? base : clean(context.parentURL!),\n\t\t\t\t\t},\n\t\t\t\t)\n\t\t\tconst result = (() => {\n\t\t\t\ttry {\n\t\t\t\t\treturn resolve()\n\t\t\t\t} catch (cause) {\n\t\t\t\t\t// Node reports the missing file even though resolution did not complete.\n\t\t\t\t\tif (\n\t\t\t\t\t\tPredicate.hasProperty(cause, \"url\") &&\n\t\t\t\t\t\ttypeof cause.url === \"string\" &&\n\t\t\t\t\t\tString.startsWith(\"file:\")(cause.url)\n\t\t\t\t\t) {\n\t\t\t\t\t\tif (entry) resolved = cause.url\n\t\t\t\t\t\telse if (context.parentURL !== undefined && include(cause.url))\n\t\t\t\t\t\t\tlink(\n\t\t\t\t\t\t\t\tid,\n\t\t\t\t\t\t\t\tclean(context.parentURL),\n\t\t\t\t\t\t\t\tcause.url,\n\t\t\t\t\t\t\t\tOption.getOrUndefined(\n\t\t\t\t\t\t\t\t\tfileRequest(specifier, clean(context.parentURL)),\n\t\t\t\t\t\t\t\t),\n\t\t\t\t\t\t\t)\n\t\t\t\t\t}\n\t\t\t\t\tthrow cause\n\t\t\t\t}\n\t\t\t})()\n\t\t\tif (entry) resolved = result.url\n\t\t\t// Acquiring node:module permits require calls that Node can satisfy\n\t\t\t// without hooks. Record this capability before any cache can hide them.\n\t\t\tif (\n\t\t\t\t!entry &&\n\t\t\t\tresult.url === \"node:module\" &&\n\t\t\t\tcontext.parentURL !== undefined\n\t\t\t) {\n\t\t\t\tlink(id, clean(context.parentURL), result.url)\n\t\t\t\trequireRestart(result.url, id)\n\t\t\t}\n\t\t\tif (\n\t\t\t\t!String.startsWith(\"file:\")(result.url) ||\n\t\t\t\t(!entry && !include(result.url))\n\t\t\t)\n\t\t\t\treturn result\n\t\t\tif (!entry && context.parentURL !== undefined)\n\t\t\t\tlink(\n\t\t\t\t\tid,\n\t\t\t\t\tclean(context.parentURL),\n\t\t\t\t\tresult.url,\n\t\t\t\t\tOption.getOrUndefined(\n\t\t\t\t\t\tfileRequest(specifier, clean(context.parentURL)),\n\t\t\t\t\t),\n\t\t\t\t)\n\t\t\tconst required = Array.contains(context.conditions, \"require\")\n\t\t\tif (required) requireRestart(result.url, id)\n\t\t\telse record(result.url, id, result.format)\n\t\t\tif (required || unsupported(result.url, result.format)) return result\n\t\t\tconst url = new URL(result.url)\n\t\t\turl.searchParams.set(key, id)\n\t\t\treturn { ...result, url: url.href }\n\t\t},\n\t\tload(url, context, nextLoad) {\n\t\t\tconst id = version(url)\n\t\t\tif (id === null) return nextLoad(url, context)\n\t\t\tconst original = clean(url)\n\t\t\trecord(original, id, context.format)\n\t\t\tconst result = nextLoad(original, context)\n\t\t\tconst source = result.source\n\t\t\tif (source !== undefined && source !== null) {\n\t\t\t\tconst bytes =\n\t\t\t\t\ttypeof source === \"string\"\n\t\t\t\t\t\t? source\n\t\t\t\t\t\t: ArrayBuffer.isView(source)\n\t\t\t\t\t\t\t? new Uint8Array(\n\t\t\t\t\t\t\t\t\tsource.buffer,\n\t\t\t\t\t\t\t\t\tsource.byteOffset,\n\t\t\t\t\t\t\t\t\tsource.byteLength,\n\t\t\t\t\t\t\t\t)\n\t\t\t\t\t\t\t: new Uint8Array(source)\n\t\t\t\tsources = HashMap.set(\n\t\t\t\t\tsources,\n\t\t\t\t\tid,\n\t\t\t\t\tHashMap.set(\n\t\t\t\t\t\tOption.getOrElse(\n\t\t\t\t\t\t\tHashMap.get(sources, id),\n\t\t\t\t\t\t\tHashMap.empty<string, string>,\n\t\t\t\t\t\t),\n\t\t\t\t\t\toriginal,\n\t\t\t\t\t\tBase64.encode(bytes),\n\t\t\t\t\t),\n\t\t\t\t)\n\t\t\t}\n\t\t\trecord(original, id, result.format)\n\t\t\treturn result\n\t\t},\n\t})\n\treturn {\n\t\tprepare,\n\t\tfileRequest: (specifier: string) => fileRequest(specifier, base),\n\t\tresolutions: (attempts: ReadonlyArray<Attempt>) =>\n\t\t\tArray.flatMap(attempts, resolutionsFor),\n\t\tfiles: (attempts: ReadonlyArray<Attempt>) =>\n\t\t\tArray.reduce(\n\t\t\t\tattempts,\n\t\t\t\tHashMap.empty<string, FileVersion>(),\n\t\t\t\t(files, { generation, url, request }) => {\n\t\t\t\t\tconst contents = Option.getOrElse(\n\t\t\t\t\t\tHashMap.get(sources, String.String(generation.id)),\n\t\t\t\t\t\tHashMap.empty<string, string>,\n\t\t\t\t\t)\n\t\t\t\t\tconst unversioned = Option.getOrElse(\n\t\t\t\t\t\tHashMap.get(dependencies, String.String(generation.id)),\n\t\t\t\t\t\tHashSet.empty<string>,\n\t\t\t\t\t)\n\t\t\t\t\tconst tracked = Array.reduce(\n\t\t\t\t\t\tArray.fromIterable(reachable(String.String(generation.id), [url])),\n\t\t\t\t\t\tfiles,\n\t\t\t\t\t\t(files, url) => {\n\t\t\t\t\t\t\tif (\n\t\t\t\t\t\t\t\t!String.startsWith(\"file:\")(url) ||\n\t\t\t\t\t\t\t\tHashSet.has(unversioned, url)\n\t\t\t\t\t\t\t)\n\t\t\t\t\t\t\t\treturn files\n\t\t\t\t\t\t\t// A retained failed lease must not override a newer import\n\t\t\t\t\t\t\t// of the same file just because its owner is visited last.\n\t\t\t\t\t\t\tif (\n\t\t\t\t\t\t\t\tOption.exists(\n\t\t\t\t\t\t\t\t\tHashMap.get(files, url),\n\t\t\t\t\t\t\t\t\t(current) =>\n\t\t\t\t\t\t\t\t\t\tcurrent.generation > generation.id ||\n\t\t\t\t\t\t\t\t\t\t(current.generation === generation.id &&\n\t\t\t\t\t\t\t\t\t\t\tcurrent.resolution !== undefined),\n\t\t\t\t\t\t\t\t)\n\t\t\t\t\t\t\t)\n\t\t\t\t\t\t\t\treturn files\n\t\t\t\t\t\t\treturn HashMap.set(files, url, {\n\t\t\t\t\t\t\t\tgeneration: generation.id,\n\t\t\t\t\t\t\t\tcontent: Option.getOrUndefined(HashMap.get(contents, url)),\n\t\t\t\t\t\t\t})\n\t\t\t\t\t\t},\n\t\t\t\t\t)\n\t\t\t\t\treturn Array.reduce(\n\t\t\t\t\t\tresolutionsFor({\n\t\t\t\t\t\t\tgeneration,\n\t\t\t\t\t\t\turl,\n\t\t\t\t\t\t\t...(request === undefined ? {} : { request }),\n\t\t\t\t\t\t}),\n\t\t\t\t\t\ttracked,\n\t\t\t\t\t\t(files, edge) => {\n\t\t\t\t\t\t\tif (\n\t\t\t\t\t\t\t\tedge.request === undefined ||\n\t\t\t\t\t\t\t\tHashSet.has(unversioned, edge.url) ||\n\t\t\t\t\t\t\t\tOption.exists(\n\t\t\t\t\t\t\t\t\tHashMap.get(files, edge.request),\n\t\t\t\t\t\t\t\t\t(file) => file.generation > generation.id,\n\t\t\t\t\t\t\t\t)\n\t\t\t\t\t\t\t)\n\t\t\t\t\t\t\t\treturn files\n\t\t\t\t\t\t\treturn HashMap.set(files, edge.request, {\n\t\t\t\t\t\t\t\tgeneration: generation.id,\n\t\t\t\t\t\t\t\tcontent: Option.getOrUndefined(HashMap.get(contents, edge.url)),\n\t\t\t\t\t\t\t\tresolution: pathToFileURL(fileURLToPath(edge.url)).href,\n\t\t\t\t\t\t\t})\n\t\t\t\t\t\t},\n\t\t\t\t\t)\n\t\t\t\t},\n\t\t\t),\n\t\tunsupported: (generation: Generation, roots?: ReadonlyArray<string>) => {\n\t\t\tconst found = Option.getOrElse(\n\t\t\t\tHashMap.get(dependencies, String.String(generation.id)),\n\t\t\t\tHashSet.empty<string>,\n\t\t\t)\n\t\t\tif (roots === undefined) return found\n\t\t\tconst used = reachable(String.String(generation.id), roots)\n\t\t\treturn HashSet.filter(found, (url) => HashSet.has(used, url))\n\t\t},\n\t\tstart: (generation: Generation, reload = false) => {\n\t\t\timporting = { generation, reload }\n\t\t},\n\t\tdiscard: () => {\n\t\t\timporting = undefined\n\t\t},\n\t\trequest: (specifier: string) => {\n\t\t\tresolved = undefined\n\t\t\treturn `${prefix}${importing!.generation.id}:${specifier}`\n\t\t},\n\t\tresolved: () => Option.fromUndefinedOr(resolved),\n\t\tclose: () => hooks.deregister(),\n\t}\n}\n"],"mappings":";;;;;AAcA,IAAa,kBAAb,cAAqC,OAAO,YAG1C,CAAC,CAAC,mBAAmB,EAAE,KAAK,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;AAGhD,MAAa,kBAAkB,KAAa,UAC3C,OAAO,WAAW,OAAO,CAAC,CAAC,GAAG,KAC9B,UAAU,YAAY,OAAO,MAAM,MACjC,MAAM,SAAS,0BAChB,UAAU,YAAY,OAAO,KAAK,KAClC,MAAM,QAAQ,OACb,MAAM,SAAS,YACf,UAAU,YAAY,OAAO,MAAM,KACnC,MAAM,SAAS,cAAc,GAAG;AAGnC,IAAI,WAAW;;AAwBf,MAAM,eACL,WACA,WAC2B;CAC3B,IACC,CAAC,MAAM,KAAK;EAAC;EAAS;EAAM;EAAO;CAAG,IAAI,WACzC,OAAO,WAAW,MAAM,CAAC,CAAC,SAAS,CACpC,GAEA,OAAO,OAAO,KAAK;CACpB,MAAM,MAAM,IAAI,IAAI,WAAW,MAAM;CACrC,OAAO,IAAI,aAAa,UAAU,OAAO,KAAK,IAAI,IAAI,IAAI,OAAO,KAAK;AACvE;;AAGA,MAAa,WAAW,MAAc,YAAsC;CAC3E,MAAM,MAAM,aAAa,EAAE;CAC3B,MAAM,SAAS,GAAG,IAAI;;CAEtB,MAAM,gBAAgB,OAAO,oBAC5B,OAAO,sBAAsB;EAC5B;EACA,OAAO,OAAO,MAAM,OAAO,UAAU,OAAO,CAAC;EAC7C;EACA,OAAO;CACR,CAAC,CACF;CACA,IAAI,WAAW;CACf,IAAI;CAGJ,IAAI,eAAe,QAAQ,MAAuC;CAClE,IAAI,QAAQ,QAAQ,MAGlB;CACF,MAAM,QACL,IACA,QACA,OACA,YACI;EACJ,MAAM,QAAQ,OAAO,UACpB,QAAQ,IAAI,OAAO,EAAE,GACrB,QAAQ,KACT;EACA,MAAM,WAAW,OAAO,UACvB,QAAQ,IAAI,OAAO,MAAM,GACzB,QAAQ,KACT;EACA,QAAQ,QAAQ,IACf,OACA,IACA,QAAQ,IACP,OACA,QACA,QAAQ,IAAI,UAAU,WAAW,OAAO;GACvC,YAAY,EAAE,IAAI,OAAO,EAAE,EAAE;GAC7B;GACA,KAAK;GACL,GAAI,YAAY,KAAA,IAAY,CAAC,IAAI,EAAE,QAAQ;EAC5C,CAAC,CACF,CACD;CACD;CACA,MAAM,aAAa,IAAY,UAAiC;EAC/D,MAAM,QAAQ,OAAO,UACpB,QAAQ,IAAI,OAAO,EAAE,GACrB,QAAQ,KACT;EACA,IAAI,OAAO,QAAQ,MAAc;EACjC,IAAI,UAAU;EACd,OAAO,MAAM,wBAAwB,OAAO,GAAG;GAC9C,MAAM,CAAC,KAAK,GAAG,QAAQ;GACvB,UAAU;GACV,IAAI,QAAQ,IAAI,MAAM,GAAG,GAAG;GAC5B,OAAO,QAAQ,IAAI,MAAM,GAAG;GAC5B,UAAU,MAAM,UACf,SACA,MAAM,IACL,QAAQ,SACP,OAAO,UACN,QAAQ,IAAI,OAAO,GAAG,GACtB,QAAQ,KACT,CACD,IACC,SAAS,KAAK,GAChB,CACD;EACD;EACA,OAAO;CACR;CAEA,MAAM,kBAAkB,YAA6C;EACpE,MAAM,KAAK,OAAO,OAAO,QAAQ,WAAW,EAAE;EAC9C,MAAM,OAAO,UAAU,IAAI,CAAC,QAAQ,GAAG,CAAC;EACxC,MAAM,QAAQ,OAAO,UACpB,QAAQ,IAAI,OAAO,EAAE,GACrB,QAAQ,KACT;EACA,OAAO,CACN,GAAI,QAAQ,YAAY,KAAA,IAAY,CAAC,IAAI,CAAC,OAAO,GACjD,GAAG,MAAM,QAAQ,QAAQ,SAAS,KAAK,IAAI,aAC1C,MAAM,OACL,QAAQ,SAAS,QAAQ,IACxB,SACA,KAAK,YAAY,KAAA,KAAa,QAAQ,IAAI,MAAM,KAAK,MAAM,CAC7D,CACD,CACD;CACD;CAEA,IAAI,UAAU,QAAQ,MAA+C;CACrE,IAAI;CAEJ,MAAM,iBAA6B,EAClC,IAAI,EAAE,SACP;CACA,MAAM,SAAS,QAAwB;EACtC,MAAM,QAAQ,IAAI,IAAI,GAAG;EACzB,MAAM,aAAa,OAAO,GAAG;EAC7B,OAAO,MAAM;CACd;CACA,MAAM,WAAW,QAChB,QAAQ,KAAA,IAAY,OAAO,IAAI,IAAI,GAAG,CAAC,CAAC,aAAa,IAAI,GAAG;CAC7D,MAAM,eAAe,KAAa,WACjC,WAAW,cACX,WAAW,yBACX,WAAW,WACX,OAAO,SAAS,OAAO,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC,QAAQ;CAC/C,MAAM,kBAAkB,KAAa,OAAe;EACnD,eAAe,QAAQ,IACtB,cACA,IACA,QAAQ,IACP,OAAO,UAAU,QAAQ,IAAI,cAAc,EAAE,GAAG,QAAQ,KAAa,GACrE,GACD,CACD;EACA,IACC,cAAc,KAAA,KACd,OAAO,OAAO,UAAU,WAAW,EAAE,MAAM,MAC3C,UAAU,QAEV,MAAM,gBAAgB,KAAK,EAAE,IAAI,CAAC;CACpC;CAEA,MAAM,UACL,KACA,IACA,WACI;EACJ,IAAI,YAAY,KAAK,MAAM,GAAG,eAAe,KAAK,EAAE;CACrD;CAEA,MAAM,QAAQ,cAAc;EAC3B,QAAQ,WAAW,SAAS,aAAa;GACxC,MAAM,UAAU,cAAc,SAAS;GACvC,MAAM,QAAQ,OAAO,OAAO,OAAO;GACnC,MAAM,KAAK,OAAO,MAAM,SAAS;IAChC,cAAc,QAAQ,QAAQ,SAAS;IACvC,SAAS,GAAG,QAAQ;GACrB,CAAC;GACD,IAAI,OAAO,MAAM,OAAO,YAAY,WAAW,OAAO;GACtD,MAAM,gBACL,YACC,OAAO,MAAM,SAAS;IACrB,cAAc;IACd,SAAS,OAAO,YAAY;GAC7B,CAAC,GACD;IACC,GAAG;IACH,WAAW,QAAQ,OAAO,MAAM,QAAQ,SAAU;GACnD,CACD;GACD,MAAM,gBAAgB;IACrB,IAAI;KACH,OAAO,QAAQ;IAChB,SAAS,OAAO;KAEf,IACC,UAAU,YAAY,OAAO,KAAK,KAClC,OAAO,MAAM,QAAQ,YACrB,OAAO,WAAW,OAAO,CAAC,CAAC,MAAM,GAAG,GACnC;MACD,IAAI,OAAO,WAAW,MAAM;WACvB,IAAI,QAAQ,cAAc,KAAA,KAAa,QAAQ,MAAM,GAAG,GAC5D,KACC,IACA,MAAM,QAAQ,SAAS,GACvB,MAAM,KACN,OAAO,eACN,YAAY,WAAW,MAAM,QAAQ,SAAS,CAAC,CAChD,CACD;KACF;KACA,MAAM;IACP;GACD,EAAA,CAAG;GACH,IAAI,OAAO,WAAW,OAAO;GAG7B,IACC,CAAC,SACD,OAAO,QAAQ,iBACf,QAAQ,cAAc,KAAA,GACrB;IACD,KAAK,IAAI,MAAM,QAAQ,SAAS,GAAG,OAAO,GAAG;IAC7C,eAAe,OAAO,KAAK,EAAE;GAC9B;GACA,IACC,CAAC,OAAO,WAAW,OAAO,CAAC,CAAC,OAAO,GAAG,KACrC,CAAC,SAAS,CAAC,QAAQ,OAAO,GAAG,GAE9B,OAAO;GACR,IAAI,CAAC,SAAS,QAAQ,cAAc,KAAA,GACnC,KACC,IACA,MAAM,QAAQ,SAAS,GACvB,OAAO,KACP,OAAO,eACN,YAAY,WAAW,MAAM,QAAQ,SAAS,CAAC,CAChD,CACD;GACD,MAAM,WAAW,MAAM,SAAS,QAAQ,YAAY,SAAS;GAC7D,IAAI,UAAU,eAAe,OAAO,KAAK,EAAE;QACtC,OAAO,OAAO,KAAK,IAAI,OAAO,MAAM;GACzC,IAAI,YAAY,YAAY,OAAO,KAAK,OAAO,MAAM,GAAG,OAAO;GAC/D,MAAM,MAAM,IAAI,IAAI,OAAO,GAAG;GAC9B,IAAI,aAAa,IAAI,KAAK,EAAE;GAC5B,OAAO;IAAE,GAAG;IAAQ,KAAK,IAAI;GAAK;EACnC;EACA,KAAK,KAAK,SAAS,UAAU;GAC5B,MAAM,KAAK,QAAQ,GAAG;GACtB,IAAI,OAAO,MAAM,OAAO,SAAS,KAAK,OAAO;GAC7C,MAAM,WAAW,MAAM,GAAG;GAC1B,OAAO,UAAU,IAAI,QAAQ,MAAM;GACnC,MAAM,SAAS,SAAS,UAAU,OAAO;GACzC,MAAM,SAAS,OAAO;GACtB,IAAI,WAAW,KAAA,KAAa,WAAW,MAAM;IAC5C,MAAM,QACL,OAAO,WAAW,WACf,SACA,YAAY,OAAO,MAAM,IACxB,IAAI,WACJ,OAAO,QACP,OAAO,YACP,OAAO,UACR,IACC,IAAI,WAAW,MAAM;IAC1B,UAAU,QAAQ,IACjB,SACA,IACA,QAAQ,IACP,OAAO,UACN,QAAQ,IAAI,SAAS,EAAE,GACvB,QAAQ,KACT,GACA,UACA,OAAO,OAAO,KAAK,CACpB,CACD;GACD;GACA,OAAO,UAAU,IAAI,OAAO,MAAM;GAClC,OAAO;EACR;CACD,CAAC;CACD,OAAO;EACN;EACA,cAAc,cAAsB,YAAY,WAAW,IAAI;EAC/D,cAAc,aACb,MAAM,QAAQ,UAAU,cAAc;EACvC,QAAQ,aACP,MAAM,OACL,UACA,QAAQ,MAA2B,IAClC,OAAO,EAAE,YAAY,KAAK,cAAc;GACxC,MAAM,WAAW,OAAO,UACvB,QAAQ,IAAI,SAAS,OAAO,OAAO,WAAW,EAAE,CAAC,GACjD,QAAQ,KACT;GACA,MAAM,cAAc,OAAO,UAC1B,QAAQ,IAAI,cAAc,OAAO,OAAO,WAAW,EAAE,CAAC,GACtD,QAAQ,KACT;GACA,MAAM,UAAU,MAAM,OACrB,MAAM,aAAa,UAAU,OAAO,OAAO,WAAW,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GACjE,QACC,OAAO,QAAQ;IACf,IACC,CAAC,OAAO,WAAW,OAAO,CAAC,CAAC,GAAG,KAC/B,QAAQ,IAAI,aAAa,GAAG,GAE5B,OAAO;IAGR,IACC,OAAO,OACN,QAAQ,IAAI,OAAO,GAAG,IACrB,YACA,QAAQ,aAAa,WAAW,MAC/B,QAAQ,eAAe,WAAW,MAClC,QAAQ,eAAe,KAAA,CAC1B,GAEA,OAAO;IACR,OAAO,QAAQ,IAAI,OAAO,KAAK;KAC9B,YAAY,WAAW;KACvB,SAAS,OAAO,eAAe,QAAQ,IAAI,UAAU,GAAG,CAAC;IAC1D,CAAC;GACF,CACD;GACA,OAAO,MAAM,OACZ,eAAe;IACd;IACA;IACA,GAAI,YAAY,KAAA,IAAY,CAAC,IAAI,EAAE,QAAQ;GAC5C,CAAC,GACD,UACC,OAAO,SAAS;IAChB,IACC,KAAK,YAAY,KAAA,KACjB,QAAQ,IAAI,aAAa,KAAK,GAAG,KACjC,OAAO,OACN,QAAQ,IAAI,OAAO,KAAK,OAAO,IAC9B,SAAS,KAAK,aAAa,WAAW,EACxC,GAEA,OAAO;IACR,OAAO,QAAQ,IAAI,OAAO,KAAK,SAAS;KACvC,YAAY,WAAW;KACvB,SAAS,OAAO,eAAe,QAAQ,IAAI,UAAU,KAAK,GAAG,CAAC;KAC9D,YAAY,cAAc,cAAc,KAAK,GAAG,CAAC,CAAC,CAAC;IACpD,CAAC;GACF,CACD;EACD,CACD;EACD,cAAc,YAAwB,UAAkC;GACvE,MAAM,QAAQ,OAAO,UACpB,QAAQ,IAAI,cAAc,OAAO,OAAO,WAAW,EAAE,CAAC,GACtD,QAAQ,KACT;GACA,IAAI,UAAU,KAAA,GAAW,OAAO;GAChC,MAAM,OAAO,UAAU,OAAO,OAAO,WAAW,EAAE,GAAG,KAAK;GAC1D,OAAO,QAAQ,OAAO,QAAQ,QAAQ,QAAQ,IAAI,MAAM,GAAG,CAAC;EAC7D;EACA,QAAQ,YAAwB,SAAS,UAAU;GAClD,YAAY;IAAE;IAAY;GAAO;EAClC;EACA,eAAe;GACd,YAAY,KAAA;EACb;EACA,UAAU,cAAsB;GAC/B,WAAW,KAAA;GACX,OAAO,GAAG,SAAS,UAAW,WAAW,GAAG,GAAG;EAChD;EACA,gBAAgB,OAAO,gBAAgB,QAAQ;EAC/C,aAAa,MAAM,WAAW;CAC/B;AACD"}
+{"version":3,"file":"modules.js","names":[],"sources":["../../src/internal/modules.ts"],"sourcesContent":["// Node's synchronous module hooks have no Effect equivalent.\nimport { digest } from \"./digest\"\nimport { registerHooks } from \"node:module\"\nimport { fileURLToPath, pathToFileURL } from \"node:url\"\nimport {\n\tArray,\n\tChunk,\n\tHashMap,\n\tHashSet,\n\tOption,\n\tPredicate,\n\tSchema,\n\tString,\n} from \"effect\"\n\nexport class RestartRequired extends Schema.TaggedError<\n\tRestartRequired,\n\t{ readonly brand: unique symbol }\n>()(\"RestartRequired\", { url: Schema.String }) {}\n\n// Only a missing entry is disposable; missing dependencies still fail the reload.\nexport const isMissingEntry = (url: string, cause: unknown): boolean =>\n\tString.startsWith(\"file:\")(url) &&\n\tPredicate.hasProperty(cause, \"code\") &&\n\t((cause.code === \"ERR_MODULE_NOT_FOUND\" &&\n\t\tPredicate.hasProperty(cause, \"url\") &&\n\t\tcause.url === url) ||\n\t\t(cause.code === \"ENOENT\" &&\n\t\t\tPredicate.hasProperty(cause, \"path\") &&\n\t\t\tcause.path === fileURLToPath(url)))\n\n// Allocated only when a session starts; importing this module performs no I/O.\nlet sessions = 0\n\n/** A resolution view that allocates fresh URLs for new or invalidated instances. */\nexport interface Generation {\n\treadonly id: number\n}\n\n/** Digest of the bytes actually loaded by a concrete module instance. */\nexport interface FileVersion {\n\treadonly generation: number\n\treadonly content: string | undefined\n\treadonly resolution?: string\n}\n\nexport interface Attempt {\n\treadonly generation: Generation\n\treadonly url: string\n\treadonly request?: string\n}\n\ninterface Dependency extends Attempt {\n\treadonly node: string\n}\n\n/** Resolve local requests lexically; Node's cached physical target is a separate fact. */\nconst fileRequest = (\n\tspecifier: string,\n\tparent: string,\n): Option.Option<string> => {\n\tif (\n\t\t!Array.some([\"file:\", \"./\", \"../\", \"/\"], (prefix) =>\n\t\t\tString.startsWith(prefix)(specifier),\n\t\t)\n\t)\n\t\treturn Option.none()\n\tconst url = new URL(specifier, parent)\n\treturn url.protocol === \"file:\" ? Option.some(url.href) : Option.none()\n}\n\n/** A scoped Node hook. Mutable bindings bridge synchronous hooks to Effect. */\nexport const modules = (base: string, include: (url: string) => boolean) => {\n\tconst key = `graft-hmr-${++sessions}`\n\tconst prefix = `${key}:`\n\tconst decodeRequest = Schema.decodeUnknownOption(\n\t\tSchema.TemplateLiteralParser([\n\t\t\tprefix,\n\t\t\tSchema.String.check(Schema.isPattern(/^\\d+$/)),\n\t\t\t\":\",\n\t\t\tSchema.String,\n\t\t]),\n\t)\n\tlet revision = 0\n\tlet importing:\n\t\t{ readonly generation: Generation; readonly reload: boolean } | undefined\n\tlet resolved: string | undefined\n\t// Resolution views contain only routing identities. Old code can execute after\n\t// replacement (including teardown), so these persistent maps live until close.\n\t// Cached instances also retain their facts: Node does not replay static imports.\n\t// Leases restrict observation, not the lifetime of old routing targets.\n\tlet views = HashMap.empty<number, HashMap.HashMap<string, string>>()\n\tlet edges = HashMap.empty<string, HashMap.HashMap<string, Dependency>>()\n\tlet sources = HashMap.empty<string, string>()\n\tlet dependencies = HashSet.empty<string>()\n\tlet reachCache = HashMap.empty<string, HashSet.HashSet<string>>()\n\tlet retained = HashSet.empty<string>()\n\tlet instantiatedViews = HashSet.empty<number>()\n\tconst clean = (url: string): string => {\n\t\tconst value = new URL(url)\n\t\tvalue.searchParams.delete(key)\n\t\treturn value.href\n\t}\n\tconst version = (url: string | undefined): number | undefined => {\n\t\tif (url === undefined) return undefined\n\t\tconst value = new URL(url).searchParams.get(key)\n\t\treturn value === null ? undefined : Number(value)\n\t}\n\tconst tag = (url: string, id: number) => {\n\t\tconst value = new URL(url)\n\t\tvalue.searchParams.set(key, String.String(id))\n\t\treturn value.href\n\t}\n\tconst route = (url: string, id: number): string =>\n\t\tOption.getOrElse(\n\t\t\tHashMap.get(\n\t\t\t\tOption.getOrElse(HashMap.get(views, id), HashMap.empty<string, string>),\n\t\t\t\turl,\n\t\t\t),\n\t\t\t() => tag(url, id),\n\t\t)\n\n\tconst root = (attempt: Attempt) => route(attempt.url, attempt.generation.id)\n\tconst children = (node: string) =>\n\t\tOption.getOrElse(\n\t\t\tHashMap.get(edges, node),\n\t\t\tHashMap.empty<string, Dependency>,\n\t\t)\n\tconst reachable = (node: string) => {\n\t\tconst cached = HashMap.get(reachCache, node)\n\t\tif (Option.isSome(cached)) return cached.value\n\t\tlet seen = HashSet.empty<string>()\n\t\tlet pending: Chunk.Chunk<string> = Chunk.of(node)\n\t\twhile (Chunk.isNonEmpty(pending)) {\n\t\t\tconst current = Chunk.headNonEmpty(pending)\n\t\t\tpending = Chunk.drop(pending, 1)\n\t\t\tif (HashSet.has(seen, current)) continue\n\t\t\tseen = HashSet.add(seen, current)\n\t\t\tfor (const edge of HashMap.values(children(current)))\n\t\t\t\tpending = Chunk.prepend(pending, edge.node)\n\t\t}\n\t\treachCache = HashMap.set(reachCache, node, seen)\n\t\treturn seen\n\t}\n\tconst usedBy = (attempts: ReadonlyArray<Attempt>) => {\n\t\tconst roots = HashSet.fromIterable(Array.map(attempts, root))\n\t\tlet used = HashSet.empty<string>()\n\t\tfor (const node of roots) used = HashSet.union(used, reachable(node))\n\t\treturn used\n\t}\n\tconst link = (parent: string, node: string, request?: string) => {\n\t\tif (\n\t\t\timporting === undefined &&\n\t\t\t!HashSet.has(retained, parent) &&\n\t\t\t!HashSet.has(instantiatedViews, version(parent)!)\n\t\t)\n\t\t\treturn\n\t\tretained = HashSet.add(retained, node)\n\t\tconst url = clean(node)\n\t\tconst edge = {\n\t\t\tnode,\n\t\t\turl,\n\t\t\tgeneration: { id: version(node)! },\n\t\t\t...(request === undefined ? {} : { request }),\n\t\t}\n\t\tconst previous = HashMap.get(children(parent), request ?? url)\n\t\tif (\n\t\t\tOption.exists(\n\t\t\t\tprevious,\n\t\t\t\t(previous) => previous.node === node && previous.request === request,\n\t\t\t)\n\t\t)\n\t\t\treturn\n\t\tedges = HashMap.set(\n\t\t\tedges,\n\t\t\tparent,\n\t\t\tHashMap.set(children(parent), request ?? url, edge),\n\t\t)\n\t\treachCache = HashMap.empty()\n\t}\n\tconst resolutions = (\n\t\tattempts: ReadonlyArray<Attempt>,\n\t): ReadonlyArray<Attempt> => [\n\t\t...Array.filter(attempts, (attempt) => attempt.request !== undefined),\n\t\t...Array.flatMap(Array.fromIterable(usedBy(attempts)), (node) =>\n\t\t\tArray.filter(\n\t\t\t\tHashMap.toValues(children(node)),\n\t\t\t\t(edge) => edge.request !== undefined,\n\t\t\t),\n\t\t),\n\t]\n\tconst unsupported = (url: string, format: string | null | undefined) =>\n\t\tformat === \"commonjs\" ||\n\t\tformat === \"commonjs-typescript\" ||\n\t\tformat === \"addon\" ||\n\t\tString.endsWith(\".node\")(new URL(url).pathname)\n\tconst requireRestart = (node: string) => {\n\t\tif (importing !== undefined || HashSet.has(retained, node))\n\t\t\tdependencies = HashSet.add(dependencies, node)\n\t\tif (importing?.reload === true && importing.generation.id === version(node))\n\t\t\tthrow RestartRequired.make({ url: clean(node) })\n\t}\n\tconst record = (node: string, format: string | null | undefined) => {\n\t\tif (unsupported(clean(node), format)) requireRestart(node)\n\t}\n\t// One reverse traversal closes cycles and all importers of every dirty instance.\n\tconst invalidated = (\n\t\tattempts: ReadonlyArray<Attempt>,\n\t\tdirty: HashSet.HashSet<string>,\n\t) => {\n\t\tconst used = usedBy(attempts)\n\t\tlet parents = HashMap.empty<string, HashSet.HashSet<string>>()\n\t\tlet pending = Chunk.empty<string>()\n\t\tfor (const node of used) {\n\t\t\tif (HashSet.has(dirty, clean(node)))\n\t\t\t\tpending = Chunk.prepend(pending, node)\n\t\t\tfor (const edge of HashMap.values(children(node))) {\n\t\t\t\tparents = HashMap.set(\n\t\t\t\t\tparents,\n\t\t\t\t\tedge.node,\n\t\t\t\t\tHashSet.add(\n\t\t\t\t\t\tOption.getOrElse(\n\t\t\t\t\t\t\tHashMap.get(parents, edge.node),\n\t\t\t\t\t\t\tHashSet.empty<string>,\n\t\t\t\t\t\t),\n\t\t\t\t\t\tnode,\n\t\t\t\t\t),\n\t\t\t\t)\n\t\t\t\tif (edge.request !== undefined && HashSet.has(dirty, edge.request))\n\t\t\t\t\tpending = Chunk.prepend(pending, edge.node)\n\t\t\t}\n\t\t}\n\t\tfor (const attempt of attempts)\n\t\t\tif (attempt.request !== undefined && HashSet.has(dirty, attempt.request))\n\t\t\t\tpending = Chunk.prepend(pending, root(attempt))\n\t\tlet invalid = HashSet.empty<string>()\n\t\twhile (Chunk.isNonEmpty(pending)) {\n\t\t\tconst node = Chunk.headNonEmpty(pending)\n\t\t\tpending = Chunk.drop(pending, 1)\n\t\t\tif (HashSet.has(invalid, node)) continue\n\t\t\tinvalid = HashSet.add(invalid, node)\n\t\t\tfor (const parent of Option.getOrElse(\n\t\t\t\tHashMap.get(parents, node),\n\t\t\t\tHashSet.empty<string>,\n\t\t\t))\n\t\t\t\tpending = Chunk.prepend(pending, parent)\n\t\t}\n\t\treturn invalid\n\t}\n\tconst prepare = (\n\t\tattempts: ReadonlyArray<Attempt> = [],\n\t\tinvalid = HashSet.empty<string>(),\n\t): Generation => {\n\t\tconst id = ++revision\n\t\tconst seed = Array.reduce(attempts, 0, (id, attempt) =>\n\t\t\tMath.max(id, attempt.generation.id),\n\t\t)\n\t\tlet view = Option.getOrElse(\n\t\t\tHashMap.get(views, seed),\n\t\t\tHashMap.empty<string, string>,\n\t\t)\n\t\tconst used = usedBy(attempts)\n\t\t// Retain HAMT structure between views. Default routes need no stored entry;\n\t\t// only modules reused from older views need an explicit override.\n\t\tfor (const [url, node] of view)\n\t\t\tif (!HashSet.has(used, node) || HashSet.has(invalid, node))\n\t\t\t\tview = HashMap.remove(view, url)\n\t\tfor (const node of used) {\n\t\t\tif (HashSet.has(invalid, node)) continue\n\t\t\tconst url = clean(node)\n\t\t\tconst previous = HashMap.get(view, url)\n\t\t\tif (Option.isNone(previous) || version(previous.value)! < version(node)!)\n\t\t\t\tview = HashMap.set(view, url, node)\n\t\t}\n\n\t\tviews = HashMap.set(views, id, view)\n\t\treturn { id }\n\t}\n\tconst hooks = registerHooks({\n\t\tresolve(specifier, context, nextResolve) {\n\t\t\tconst parentNode = context.parentURL\n\t\t\tconst request = decodeRequest(specifier)\n\t\t\tconst entry = Option.isSome(request)\n\t\t\tconst id = Option.match(request, {\n\t\t\t\tonNone: () => version(context.parentURL),\n\t\t\t\tonSome: ([, id]) => Number(id),\n\t\t\t})\n\t\t\tif (id === undefined) return nextResolve(specifier, context)\n\t\t\tconst target = Option.match(request, {\n\t\t\t\tonNone: () => specifier,\n\t\t\t\tonSome: ([, , , target]) => target,\n\t\t\t})\n\t\t\tconst parent = entry ? base : clean(context.parentURL!)\n\t\t\tconst lexical = Option.getOrUndefined(fileRequest(target, parent))\n\t\t\tconst result = (() => {\n\t\t\t\ttry {\n\t\t\t\t\treturn nextResolve(target, { ...context, parentURL: parent })\n\t\t\t\t} catch (cause) {\n\t\t\t\t\tif (\n\t\t\t\t\t\tPredicate.hasProperty(cause, \"url\") &&\n\t\t\t\t\t\ttypeof cause.url === \"string\" &&\n\t\t\t\t\t\tString.startsWith(\"file:\")(cause.url)\n\t\t\t\t\t) {\n\t\t\t\t\t\tif (entry) resolved = cause.url\n\t\t\t\t\t\telse if (include(cause.url))\n\t\t\t\t\t\t\tlink(parentNode!, route(cause.url, id), lexical)\n\t\t\t\t\t}\n\t\t\t\t\tthrow cause\n\t\t\t\t}\n\t\t\t})()\n\t\t\tif (entry) resolved = result.url\n\t\t\tif (!entry && result.url === \"node:module\") {\n\t\t\t\tconst node = route(result.url, id)\n\t\t\t\tlink(parentNode!, node)\n\t\t\t\trequireRestart(node)\n\t\t\t}\n\t\t\tif (\n\t\t\t\t!String.startsWith(\"file:\")(result.url) ||\n\t\t\t\t(!entry && !include(result.url))\n\t\t\t)\n\t\t\t\treturn result\n\t\t\tconst node = route(result.url, id)\n\t\t\tif (!entry) link(parentNode!, node, lexical)\n\t\t\tconst required = Array.contains(context.conditions, \"require\")\n\t\t\tif (required) requireRestart(node)\n\t\t\telse record(node, result.format)\n\t\t\treturn required || unsupported(result.url, result.format)\n\t\t\t\t? result\n\t\t\t\t: { ...result, url: node }\n\t\t},\n\t\tload(url, context, nextLoad) {\n\t\t\tconst id = version(url)\n\t\t\tif (id === undefined) return nextLoad(url, context)\n\t\t\tinstantiatedViews = HashSet.add(instantiatedViews, id)\n\t\t\tconst original = clean(url)\n\t\t\trecord(url, context.format)\n\t\t\tconst result = nextLoad(original, context)\n\t\t\tconst source = result.source\n\t\t\tif (source !== undefined && source !== null) {\n\t\t\t\tconst bytes =\n\t\t\t\t\ttypeof source === \"string\"\n\t\t\t\t\t\t? source\n\t\t\t\t\t\t: ArrayBuffer.isView(source)\n\t\t\t\t\t\t\t? new Uint8Array(\n\t\t\t\t\t\t\t\t\tsource.buffer,\n\t\t\t\t\t\t\t\t\tsource.byteOffset,\n\t\t\t\t\t\t\t\t\tsource.byteLength,\n\t\t\t\t\t\t\t\t)\n\t\t\t\t\t\t\t: new Uint8Array(source)\n\t\t\t\tif (importing !== undefined || HashSet.has(retained, url))\n\t\t\t\t\tsources = HashMap.set(sources, url, digest(bytes))\n\t\t\t}\n\t\t\trecord(url, result.format)\n\t\t\treturn result\n\t\t},\n\t})\n\tconst files = (attempts: ReadonlyArray<Attempt>) => {\n\t\tlet files = HashMap.empty<string, FileVersion>()\n\t\tconst put = (url: string, node: string, resolution?: string) => {\n\t\t\tif (!String.startsWith(\"file:\")(url) || HashSet.has(dependencies, node))\n\t\t\t\treturn\n\t\t\tconst generation = version(node)!\n\t\t\tconst previous = HashMap.get(files, url)\n\t\t\tif (\n\t\t\t\tOption.exists(\n\t\t\t\t\tprevious,\n\t\t\t\t\t(previous) =>\n\t\t\t\t\t\tprevious.generation > generation ||\n\t\t\t\t\t\t(previous.generation === generation &&\n\t\t\t\t\t\t\tprevious.resolution !== undefined),\n\t\t\t\t)\n\t\t\t)\n\t\t\t\treturn\n\t\t\tfiles = HashMap.set(files, url, {\n\t\t\t\tgeneration,\n\t\t\t\tcontent: Option.getOrUndefined(HashMap.get(sources, node)),\n\t\t\t\t...(resolution === undefined ? {} : { resolution }),\n\t\t\t})\n\t\t}\n\t\tfor (const node of usedBy(attempts)) put(clean(node), node)\n\t\tfor (const attempt of resolutions(attempts))\n\t\t\tif (attempt.request !== undefined)\n\t\t\t\tput(\n\t\t\t\t\tattempt.request,\n\t\t\t\t\troot(attempt),\n\t\t\t\t\tpathToFileURL(fileURLToPath(attempt.url)).href,\n\t\t\t\t)\n\t\treturn files\n\t}\n\treturn {\n\t\tprepare,\n\t\tfiles,\n\t\tresolutions,\n\t\tinvalidated,\n\t\taffected: (attempt: Attempt, invalid: HashSet.HashSet<string>) =>\n\t\t\tHashSet.has(invalid, root(attempt)),\n\t\tfileRequest: (specifier: string) => fileRequest(specifier, base),\n\t\tunsupported: (generation: Generation, roots?: ReadonlyArray<string>) => {\n\t\t\tconst used =\n\t\t\t\troots === undefined\n\t\t\t\t\t? undefined\n\t\t\t\t\t: usedBy(Array.map(roots, (url) => ({ url, generation })))\n\t\t\treturn HashSet.fromIterable(\n\t\t\t\tArray.map(\n\t\t\t\t\tArray.filter(Array.fromIterable(dependencies), (node) =>\n\t\t\t\t\t\tused === undefined\n\t\t\t\t\t\t\t? version(node) === generation.id\n\t\t\t\t\t\t\t: HashSet.has(used, node),\n\t\t\t\t\t),\n\t\t\t\t\tclean,\n\t\t\t\t),\n\t\t\t)\n\t\t},\n\t\tcollect: (attempts: ReadonlyArray<Attempt>) => {\n\t\t\tconst used = usedBy(attempts)\n\t\t\tconst ownedViews = HashSet.fromIterable(\n\t\t\t\tArray.map(attempts, (attempt) => attempt.generation.id),\n\t\t\t)\n\t\t\tviews = HashMap.filter(\n\t\t\t\tviews,\n\t\t\t\t(_, id) =>\n\t\t\t\t\tid === revision ||\n\t\t\t\t\tHashSet.has(instantiatedViews, id) ||\n\t\t\t\t\tHashSet.has(ownedViews, id),\n\t\t\t)\n\t\t\t// Old code can reach any default route in its instantiated view, even\n\t\t\t// after every lease on that target closed. Preserve its complete graph,\n\t\t\t// source baseline and native capabilities until the session closes.\n\t\t\tconst keep = (node: string) =>\n\t\t\t\tHashSet.has(used, node) ||\n\t\t\t\tHashSet.has(instantiatedViews, version(node)!)\n\t\t\tretained = used\n\t\t\tsources = HashMap.filter(sources, (_, node) => keep(node))\n\t\t\tedges = HashMap.filter(edges, (_, node) => keep(node))\n\t\t\tdependencies = HashSet.filter(dependencies, keep)\n\t\t\treachCache = HashMap.filter(reachCache, (_, node) =>\n\t\t\t\tHashSet.has(used, node),\n\t\t\t)\n\t\t},\n\t\t// Internal counters support deterministic retention tests and external benchmarks.\n\t\tcounts: () => ({\n\t\t\tsources: HashMap.size(sources),\n\t\t\tedges: HashMap.size(edges),\n\t\t\tdependencies: HashSet.size(dependencies),\n\t\t\tviews: HashMap.size(views),\n\t\t}),\n\t\tstart: (generation: Generation, reload = false) => {\n\t\t\timporting = { generation, reload }\n\t\t},\n\t\tdiscard: () => {\n\t\t\timporting = undefined\n\t\t},\n\t\trequest: (specifier: string) => {\n\t\t\tresolved = undefined\n\t\t\treturn `${prefix}${importing!.generation.id}:${specifier}`\n\t\t},\n\t\tresolved: () => Option.fromUndefinedOr(resolved),\n\t\tclose: () => {\n\t\t\thooks.deregister()\n\t\t\tviews = HashMap.empty()\n\t\t\tsources = HashMap.empty()\n\t\t\tedges = HashMap.empty()\n\t\t\tdependencies = HashSet.empty()\n\t\t\treachCache = HashMap.empty()\n\t\t\tretained = HashSet.empty()\n\t\t\tinstantiatedViews = HashSet.empty()\n\t\t},\n\t}\n}\n"],"mappings":";;;;;AAeA,IAAa,kBAAb,cAAqC,OAAO,YAG1C,CAAC,CAAC,mBAAmB,EAAE,KAAK,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;AAGhD,MAAa,kBAAkB,KAAa,UAC3C,OAAO,WAAW,OAAO,CAAC,CAAC,GAAG,KAC9B,UAAU,YAAY,OAAO,MAAM,MACjC,MAAM,SAAS,0BAChB,UAAU,YAAY,OAAO,KAAK,KAClC,MAAM,QAAQ,OACb,MAAM,SAAS,YACf,UAAU,YAAY,OAAO,MAAM,KACnC,MAAM,SAAS,cAAc,GAAG;AAGnC,IAAI,WAAW;;AAyBf,MAAM,eACL,WACA,WAC2B;CAC3B,IACC,CAAC,MAAM,KAAK;EAAC;EAAS;EAAM;EAAO;CAAG,IAAI,WACzC,OAAO,WAAW,MAAM,CAAC,CAAC,SAAS,CACpC,GAEA,OAAO,OAAO,KAAK;CACpB,MAAM,MAAM,IAAI,IAAI,WAAW,MAAM;CACrC,OAAO,IAAI,aAAa,UAAU,OAAO,KAAK,IAAI,IAAI,IAAI,OAAO,KAAK;AACvE;;AAGA,MAAa,WAAW,MAAc,YAAsC;CAC3E,MAAM,MAAM,aAAa,EAAE;CAC3B,MAAM,SAAS,GAAG,IAAI;CACtB,MAAM,gBAAgB,OAAO,oBAC5B,OAAO,sBAAsB;EAC5B;EACA,OAAO,OAAO,MAAM,OAAO,UAAU,OAAO,CAAC;EAC7C;EACA,OAAO;CACR,CAAC,CACF;CACA,IAAI,WAAW;CACf,IAAI;CAEJ,IAAI;CAKJ,IAAI,QAAQ,QAAQ,MAA+C;CACnE,IAAI,QAAQ,QAAQ,MAAmD;CACvE,IAAI,UAAU,QAAQ,MAAsB;CAC5C,IAAI,eAAe,QAAQ,MAAc;CACzC,IAAI,aAAa,QAAQ,MAAuC;CAChE,IAAI,WAAW,QAAQ,MAAc;CACrC,IAAI,oBAAoB,QAAQ,MAAc;CAC9C,MAAM,SAAS,QAAwB;EACtC,MAAM,QAAQ,IAAI,IAAI,GAAG;EACzB,MAAM,aAAa,OAAO,GAAG;EAC7B,OAAO,MAAM;CACd;CACA,MAAM,WAAW,QAAgD;EAChE,IAAI,QAAQ,KAAA,GAAW,OAAO,KAAA;EAC9B,MAAM,QAAQ,IAAI,IAAI,GAAG,CAAC,CAAC,aAAa,IAAI,GAAG;EAC/C,OAAO,UAAU,OAAO,KAAA,IAAY,OAAO,KAAK;CACjD;CACA,MAAM,OAAO,KAAa,OAAe;EACxC,MAAM,QAAQ,IAAI,IAAI,GAAG;EACzB,MAAM,aAAa,IAAI,KAAK,OAAO,OAAO,EAAE,CAAC;EAC7C,OAAO,MAAM;CACd;CACA,MAAM,SAAS,KAAa,OAC3B,OAAO,UACN,QAAQ,IACP,OAAO,UAAU,QAAQ,IAAI,OAAO,EAAE,GAAG,QAAQ,KAAqB,GACtE,GACD,SACM,IAAI,KAAK,EAAE,CAClB;CAED,MAAM,QAAQ,YAAqB,MAAM,QAAQ,KAAK,QAAQ,WAAW,EAAE;CAC3E,MAAM,YAAY,SACjB,OAAO,UACN,QAAQ,IAAI,OAAO,IAAI,GACvB,QAAQ,KACT;CACD,MAAM,aAAa,SAAiB;EACnC,MAAM,SAAS,QAAQ,IAAI,YAAY,IAAI;EAC3C,IAAI,OAAO,OAAO,MAAM,GAAG,OAAO,OAAO;EACzC,IAAI,OAAO,QAAQ,MAAc;EACjC,IAAI,UAA+B,MAAM,GAAG,IAAI;EAChD,OAAO,MAAM,WAAW,OAAO,GAAG;GACjC,MAAM,UAAU,MAAM,aAAa,OAAO;GAC1C,UAAU,MAAM,KAAK,SAAS,CAAC;GAC/B,IAAI,QAAQ,IAAI,MAAM,OAAO,GAAG;GAChC,OAAO,QAAQ,IAAI,MAAM,OAAO;GAChC,KAAK,MAAM,QAAQ,QAAQ,OAAO,SAAS,OAAO,CAAC,GAClD,UAAU,MAAM,QAAQ,SAAS,KAAK,IAAI;EAC5C;EACA,aAAa,QAAQ,IAAI,YAAY,MAAM,IAAI;EAC/C,OAAO;CACR;CACA,MAAM,UAAU,aAAqC;EACpD,MAAM,QAAQ,QAAQ,aAAa,MAAM,IAAI,UAAU,IAAI,CAAC;EAC5D,IAAI,OAAO,QAAQ,MAAc;EACjC,KAAK,MAAM,QAAQ,OAAO,OAAO,QAAQ,MAAM,MAAM,UAAU,IAAI,CAAC;EACpE,OAAO;CACR;CACA,MAAM,QAAQ,QAAgB,MAAc,YAAqB;EAChE,IACC,cAAc,KAAA,KACd,CAAC,QAAQ,IAAI,UAAU,MAAM,KAC7B,CAAC,QAAQ,IAAI,mBAAmB,QAAQ,MAAM,CAAE,GAEhD;EACD,WAAW,QAAQ,IAAI,UAAU,IAAI;EACrC,MAAM,MAAM,MAAM,IAAI;EACtB,MAAM,OAAO;GACZ;GACA;GACA,YAAY,EAAE,IAAI,QAAQ,IAAI,EAAG;GACjC,GAAI,YAAY,KAAA,IAAY,CAAC,IAAI,EAAE,QAAQ;EAC5C;EACA,MAAM,WAAW,QAAQ,IAAI,SAAS,MAAM,GAAG,WAAW,GAAG;EAC7D,IACC,OAAO,OACN,WACC,aAAa,SAAS,SAAS,QAAQ,SAAS,YAAY,OAC9D,GAEA;EACD,QAAQ,QAAQ,IACf,OACA,QACA,QAAQ,IAAI,SAAS,MAAM,GAAG,WAAW,KAAK,IAAI,CACnD;EACA,aAAa,QAAQ,MAAM;CAC5B;CACA,MAAM,eACL,aAC4B,CAC5B,GAAG,MAAM,OAAO,WAAW,YAAY,QAAQ,YAAY,KAAA,CAAS,GACpE,GAAG,MAAM,QAAQ,MAAM,aAAa,OAAO,QAAQ,CAAC,IAAI,SACvD,MAAM,OACL,QAAQ,SAAS,SAAS,IAAI,CAAC,IAC9B,SAAS,KAAK,YAAY,KAAA,CAC5B,CACD,CACD;CACA,MAAM,eAAe,KAAa,WACjC,WAAW,cACX,WAAW,yBACX,WAAW,WACX,OAAO,SAAS,OAAO,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC,QAAQ;CAC/C,MAAM,kBAAkB,SAAiB;EACxC,IAAI,cAAc,KAAA,KAAa,QAAQ,IAAI,UAAU,IAAI,GACxD,eAAe,QAAQ,IAAI,cAAc,IAAI;EAC9C,IAAI,WAAW,WAAW,QAAQ,UAAU,WAAW,OAAO,QAAQ,IAAI,GACzE,MAAM,gBAAgB,KAAK,EAAE,KAAK,MAAM,IAAI,EAAE,CAAC;CACjD;CACA,MAAM,UAAU,MAAc,WAAsC;EACnE,IAAI,YAAY,MAAM,IAAI,GAAG,MAAM,GAAG,eAAe,IAAI;CAC1D;CAEA,MAAM,eACL,UACA,UACI;EACJ,MAAM,OAAO,OAAO,QAAQ;EAC5B,IAAI,UAAU,QAAQ,MAAuC;EAC7D,IAAI,UAAU,MAAM,MAAc;EAClC,KAAK,MAAM,QAAQ,MAAM;GACxB,IAAI,QAAQ,IAAI,OAAO,MAAM,IAAI,CAAC,GACjC,UAAU,MAAM,QAAQ,SAAS,IAAI;GACtC,KAAK,MAAM,QAAQ,QAAQ,OAAO,SAAS,IAAI,CAAC,GAAG;IAClD,UAAU,QAAQ,IACjB,SACA,KAAK,MACL,QAAQ,IACP,OAAO,UACN,QAAQ,IAAI,SAAS,KAAK,IAAI,GAC9B,QAAQ,KACT,GACA,IACD,CACD;IACA,IAAI,KAAK,YAAY,KAAA,KAAa,QAAQ,IAAI,OAAO,KAAK,OAAO,GAChE,UAAU,MAAM,QAAQ,SAAS,KAAK,IAAI;GAC5C;EACD;EACA,KAAK,MAAM,WAAW,UACrB,IAAI,QAAQ,YAAY,KAAA,KAAa,QAAQ,IAAI,OAAO,QAAQ,OAAO,GACtE,UAAU,MAAM,QAAQ,SAAS,KAAK,OAAO,CAAC;EAChD,IAAI,UAAU,QAAQ,MAAc;EACpC,OAAO,MAAM,WAAW,OAAO,GAAG;GACjC,MAAM,OAAO,MAAM,aAAa,OAAO;GACvC,UAAU,MAAM,KAAK,SAAS,CAAC;GAC/B,IAAI,QAAQ,IAAI,SAAS,IAAI,GAAG;GAChC,UAAU,QAAQ,IAAI,SAAS,IAAI;GACnC,KAAK,MAAM,UAAU,OAAO,UAC3B,QAAQ,IAAI,SAAS,IAAI,GACzB,QAAQ,KACT,GACC,UAAU,MAAM,QAAQ,SAAS,MAAM;EACzC;EACA,OAAO;CACR;CACA,MAAM,WACL,WAAmC,CAAC,GACpC,UAAU,QAAQ,MAAc,MAChB;EAChB,MAAM,KAAK,EAAE;EACb,MAAM,OAAO,MAAM,OAAO,UAAU,IAAI,IAAI,YAC3C,KAAK,IAAI,IAAI,QAAQ,WAAW,EAAE,CACnC;EACA,IAAI,OAAO,OAAO,UACjB,QAAQ,IAAI,OAAO,IAAI,GACvB,QAAQ,KACT;EACA,MAAM,OAAO,OAAO,QAAQ;EAG5B,KAAK,MAAM,CAAC,KAAK,SAAS,MACzB,IAAI,CAAC,QAAQ,IAAI,MAAM,IAAI,KAAK,QAAQ,IAAI,SAAS,IAAI,GACxD,OAAO,QAAQ,OAAO,MAAM,GAAG;EACjC,KAAK,MAAM,QAAQ,MAAM;GACxB,IAAI,QAAQ,IAAI,SAAS,IAAI,GAAG;GAChC,MAAM,MAAM,MAAM,IAAI;GACtB,MAAM,WAAW,QAAQ,IAAI,MAAM,GAAG;GACtC,IAAI,OAAO,OAAO,QAAQ,KAAK,QAAQ,SAAS,KAAK,IAAK,QAAQ,IAAI,GACrE,OAAO,QAAQ,IAAI,MAAM,KAAK,IAAI;EACpC;EAEA,QAAQ,QAAQ,IAAI,OAAO,IAAI,IAAI;EACnC,OAAO,EAAE,GAAG;CACb;CACA,MAAM,QAAQ,cAAc;EAC3B,QAAQ,WAAW,SAAS,aAAa;GACxC,MAAM,aAAa,QAAQ;GAC3B,MAAM,UAAU,cAAc,SAAS;GACvC,MAAM,QAAQ,OAAO,OAAO,OAAO;GACnC,MAAM,KAAK,OAAO,MAAM,SAAS;IAChC,cAAc,QAAQ,QAAQ,SAAS;IACvC,SAAS,GAAG,QAAQ,OAAO,EAAE;GAC9B,CAAC;GACD,IAAI,OAAO,KAAA,GAAW,OAAO,YAAY,WAAW,OAAO;GAC3D,MAAM,SAAS,OAAO,MAAM,SAAS;IACpC,cAAc;IACd,SAAS,OAAO,YAAY;GAC7B,CAAC;GACD,MAAM,SAAS,QAAQ,OAAO,MAAM,QAAQ,SAAU;GACtD,MAAM,UAAU,OAAO,eAAe,YAAY,QAAQ,MAAM,CAAC;GACjE,MAAM,gBAAgB;IACrB,IAAI;KACH,OAAO,YAAY,QAAQ;MAAE,GAAG;MAAS,WAAW;KAAO,CAAC;IAC7D,SAAS,OAAO;KACf,IACC,UAAU,YAAY,OAAO,KAAK,KAClC,OAAO,MAAM,QAAQ,YACrB,OAAO,WAAW,OAAO,CAAC,CAAC,MAAM,GAAG,GACnC;MACD,IAAI,OAAO,WAAW,MAAM;WACvB,IAAI,QAAQ,MAAM,GAAG,GACzB,KAAK,YAAa,MAAM,MAAM,KAAK,EAAE,GAAG,OAAO;KACjD;KACA,MAAM;IACP;GACD,EAAA,CAAG;GACH,IAAI,OAAO,WAAW,OAAO;GAC7B,IAAI,CAAC,SAAS,OAAO,QAAQ,eAAe;IAC3C,MAAM,OAAO,MAAM,OAAO,KAAK,EAAE;IACjC,KAAK,YAAa,IAAI;IACtB,eAAe,IAAI;GACpB;GACA,IACC,CAAC,OAAO,WAAW,OAAO,CAAC,CAAC,OAAO,GAAG,KACrC,CAAC,SAAS,CAAC,QAAQ,OAAO,GAAG,GAE9B,OAAO;GACR,MAAM,OAAO,MAAM,OAAO,KAAK,EAAE;GACjC,IAAI,CAAC,OAAO,KAAK,YAAa,MAAM,OAAO;GAC3C,MAAM,WAAW,MAAM,SAAS,QAAQ,YAAY,SAAS;GAC7D,IAAI,UAAU,eAAe,IAAI;QAC5B,OAAO,MAAM,OAAO,MAAM;GAC/B,OAAO,YAAY,YAAY,OAAO,KAAK,OAAO,MAAM,IACrD,SACA;IAAE,GAAG;IAAQ,KAAK;GAAK;EAC3B;EACA,KAAK,KAAK,SAAS,UAAU;GAC5B,MAAM,KAAK,QAAQ,GAAG;GACtB,IAAI,OAAO,KAAA,GAAW,OAAO,SAAS,KAAK,OAAO;GAClD,oBAAoB,QAAQ,IAAI,mBAAmB,EAAE;GACrD,MAAM,WAAW,MAAM,GAAG;GAC1B,OAAO,KAAK,QAAQ,MAAM;GAC1B,MAAM,SAAS,SAAS,UAAU,OAAO;GACzC,MAAM,SAAS,OAAO;GACtB,IAAI,WAAW,KAAA,KAAa,WAAW,MAAM;IAC5C,MAAM,QACL,OAAO,WAAW,WACf,SACA,YAAY,OAAO,MAAM,IACxB,IAAI,WACJ,OAAO,QACP,OAAO,YACP,OAAO,UACR,IACC,IAAI,WAAW,MAAM;IAC1B,IAAI,cAAc,KAAA,KAAa,QAAQ,IAAI,UAAU,GAAG,GACvD,UAAU,QAAQ,IAAI,SAAS,KAAK,OAAO,KAAK,CAAC;GACnD;GACA,OAAO,KAAK,OAAO,MAAM;GACzB,OAAO;EACR;CACD,CAAC;CACD,MAAM,SAAS,aAAqC;EACnD,IAAI,QAAQ,QAAQ,MAA2B;EAC/C,MAAM,OAAO,KAAa,MAAc,eAAwB;GAC/D,IAAI,CAAC,OAAO,WAAW,OAAO,CAAC,CAAC,GAAG,KAAK,QAAQ,IAAI,cAAc,IAAI,GACrE;GACD,MAAM,aAAa,QAAQ,IAAI;GAC/B,MAAM,WAAW,QAAQ,IAAI,OAAO,GAAG;GACvC,IACC,OAAO,OACN,WACC,aACA,SAAS,aAAa,cACrB,SAAS,eAAe,cACxB,SAAS,eAAe,KAAA,CAC3B,GAEA;GACD,QAAQ,QAAQ,IAAI,OAAO,KAAK;IAC/B;IACA,SAAS,OAAO,eAAe,QAAQ,IAAI,SAAS,IAAI,CAAC;IACzD,GAAI,eAAe,KAAA,IAAY,CAAC,IAAI,EAAE,WAAW;GAClD,CAAC;EACF;EACA,KAAK,MAAM,QAAQ,OAAO,QAAQ,GAAG,IAAI,MAAM,IAAI,GAAG,IAAI;EAC1D,KAAK,MAAM,WAAW,YAAY,QAAQ,GACzC,IAAI,QAAQ,YAAY,KAAA,GACvB,IACC,QAAQ,SACR,KAAK,OAAO,GACZ,cAAc,cAAc,QAAQ,GAAG,CAAC,CAAC,CAAC,IAC3C;EACF,OAAO;CACR;CACA,OAAO;EACN;EACA;EACA;EACA;EACA,WAAW,SAAkB,YAC5B,QAAQ,IAAI,SAAS,KAAK,OAAO,CAAC;EACnC,cAAc,cAAsB,YAAY,WAAW,IAAI;EAC/D,cAAc,YAAwB,UAAkC;GACvE,MAAM,OACL,UAAU,KAAA,IACP,KAAA,IACA,OAAO,MAAM,IAAI,QAAQ,SAAS;IAAE;IAAK;GAAW,EAAE,CAAC;GAC3D,OAAO,QAAQ,aACd,MAAM,IACL,MAAM,OAAO,MAAM,aAAa,YAAY,IAAI,SAC/C,SAAS,KAAA,IACN,QAAQ,IAAI,MAAM,WAAW,KAC7B,QAAQ,IAAI,MAAM,IAAI,CAC1B,GACA,KACD,CACD;EACD;EACA,UAAU,aAAqC;GAC9C,MAAM,OAAO,OAAO,QAAQ;GAC5B,MAAM,aAAa,QAAQ,aAC1B,MAAM,IAAI,WAAW,YAAY,QAAQ,WAAW,EAAE,CACvD;GACA,QAAQ,QAAQ,OACf,QACC,GAAG,OACH,OAAO,YACP,QAAQ,IAAI,mBAAmB,EAAE,KACjC,QAAQ,IAAI,YAAY,EAAE,CAC5B;GAIA,MAAM,QAAQ,SACb,QAAQ,IAAI,MAAM,IAAI,KACtB,QAAQ,IAAI,mBAAmB,QAAQ,IAAI,CAAE;GAC9C,WAAW;GACX,UAAU,QAAQ,OAAO,UAAU,GAAG,SAAS,KAAK,IAAI,CAAC;GACzD,QAAQ,QAAQ,OAAO,QAAQ,GAAG,SAAS,KAAK,IAAI,CAAC;GACrD,eAAe,QAAQ,OAAO,cAAc,IAAI;GAChD,aAAa,QAAQ,OAAO,aAAa,GAAG,SAC3C,QAAQ,IAAI,MAAM,IAAI,CACvB;EACD;EAEA,eAAe;GACd,SAAS,QAAQ,KAAK,OAAO;GAC7B,OAAO,QAAQ,KAAK,KAAK;GACzB,cAAc,QAAQ,KAAK,YAAY;GACvC,OAAO,QAAQ,KAAK,KAAK;EAC1B;EACA,QAAQ,YAAwB,SAAS,UAAU;GAClD,YAAY;IAAE;IAAY;GAAO;EAClC;EACA,eAAe;GACd,YAAY,KAAA;EACb;EACA,UAAU,cAAsB;GAC/B,WAAW,KAAA;GACX,OAAO,GAAG,SAAS,UAAW,WAAW,GAAG,GAAG;EAChD;EACA,gBAAgB,OAAO,gBAAgB,QAAQ;EAC/C,aAAa;GACZ,MAAM,WAAW;GACjB,QAAQ,QAAQ,MAAM;GACtB,UAAU,QAAQ,MAAM;GACxB,QAAQ,QAAQ,MAAM;GACtB,eAAe,QAAQ,MAAM;GAC7B,aAAa,QAAQ,MAAM;GAC3B,WAAW,QAAQ,MAAM;GACzB,oBAAoB,QAAQ,MAAM;EACnC;CACD;AACD"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@graftland/hmr",
-  "version": "0.2.0-beta.0",
+  "version": "0.2.0-beta.1",
   "type": "module",
   "engines": {
     "node": ">=22.19.0"
@@ -33,7 +33,7 @@
     "vitest": "5.1.0"
   },
   "dependencies": {
-    "@graftland/graft": "0.2.0-beta.0"
+    "@graftland/graft": "0.2.0-beta.1"
   },
   "scripts": {
     "build": "tsdown",