@tamagui/compiler-core 0.0.0-bootstrap.0 → 3.0.0-beta.637.1

package/dist/esm/output.mjs

@@ -0,0 +1,119 @@
+import { GenMapping, addSegment, setSourceContent, toEncodedMap } from "@jridgewell/gen-mapping";
+import MagicString from "magic-string";
+import { contentHash } from "./hash.mjs";
+
+function compareEdits(left, right) {
+	return left.start - right.start || left.end - right.end || left.index - right.index;
+}
+function sourceContentHash(source) {
+	return contentHash(source);
+}
+function validateSourceEdits(source, edits) {
+	const sorted = edits.map((edit, index) => ({
+		...edit,
+		index
+	})).sort(compareEdits);
+	let previousEnd = 0;
+	for (const edit of sorted) {
+		if (!Number.isInteger(edit.start) || !Number.isInteger(edit.end) || edit.start < 0 || edit.end < edit.start || edit.end > source.length) {
+			throw new Error(`Invalid UTF-16 source edit [${edit.start}, ${edit.end})`);
+		}
+		if (edit.start < previousEnd) {
+			throw new Error(`Overlapping UTF-16 source edit at ${edit.start}`);
+		}
+		previousEnd = Math.max(previousEnd, edit.end);
+	}
+}
+function sourcePositions(source) {
+	const positions = new Array(source.length + 1);
+	let line = 0;
+	let column = 0;
+	for (let index = 0; index <= source.length; index++) {
+		positions[index] = {
+			line,
+			column
+		};
+		if (index === source.length) break;
+		if (source.charCodeAt(index) === 10) {
+			line++;
+			column = 0;
+		} else {
+			column++;
+		}
+	}
+	return positions;
+}
+function mappedSourceMap(source, id, edits) {
+	const map = new GenMapping();
+	setSourceContent(map, id, source);
+	const positions = sourcePositions(source);
+	let generatedLine = 0;
+	let generatedColumn = 0;
+	let sourceCursor = 0;
+	const emit = (content, sourceStart, sourceEnd) => {
+		const available = Math.max(1, sourceEnd - sourceStart);
+		for (let offset = 0; offset < content.length; offset++) {
+			const originalIndex = Math.min(sourceStart + offset, sourceStart + available - 1);
+			const original = positions[originalIndex];
+			addSegment(map, generatedLine, generatedColumn, id, original.line, original.column);
+			if (content.charCodeAt(offset) === 10) {
+				generatedLine++;
+				generatedColumn = 0;
+			} else {
+				generatedColumn++;
+			}
+		}
+	};
+	for (const edit of edits) {
+		emit(source.slice(sourceCursor, edit.start), sourceCursor, edit.start);
+		if (edit.origin.id !== id) {
+			throw new Error(`Source edit for ${id} must use a local mapping origin`);
+		}
+		emit(edit.content, edit.origin.start, edit.start === edit.end ? edit.origin.start + 1 : edit.origin.end);
+		sourceCursor = edit.end;
+	}
+	emit(source.slice(sourceCursor), sourceCursor, source.length);
+	const encoded = toEncodedMap(map);
+	return {
+		version: 3,
+		file: encoded.file ?? void 0,
+		names: encoded.names,
+		sources: encoded.sources,
+		sourcesContent: encoded.sourcesContent ?? [source],
+		mappings: encoded.mappings
+	};
+}
+function applyLoweredModule(source, id, plan) {
+	if (plan.id !== id) {
+		throw new Error(`Lowered module plan ${plan.id} cannot be applied to ${id}`);
+	}
+	if (plan.sourceHash !== sourceContentHash(source)) {
+		throw new Error(`Lowered module plan for ${id} does not match the supplied source`);
+	}
+	if (plan.edits.length === 0) return {
+		changed: false,
+		code: source,
+		map: null
+	};
+	validateSourceEdits(source, plan.edits);
+	const output = new MagicString(source);
+	const sorted = plan.edits.map((edit, index) => ({
+		...edit,
+		index
+	})).sort(compareEdits);
+	for (const edit of sorted) {
+		if (edit.start === edit.end) {
+			output.appendLeft(edit.start, edit.content);
+		} else {
+			output.overwrite(edit.start, edit.end, edit.content);
+		}
+	}
+	return {
+		changed: true,
+		code: output.toString(),
+		map: mappedSourceMap(source, id, sorted)
+	};
+}
+
+export { applyLoweredModule, sourceContentHash, validateSourceEdits };
+//# sourceMappingURL=output.mjs.map

package/dist/esm/output.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"output.js","names":[],"sources":["esm/output.js"],"sourcesContent":["import {\n  GenMapping,\n  addSegment,\n  setSourceContent,\n  toEncodedMap\n} from \"@jridgewell/gen-mapping\";\nimport MagicString from \"magic-string\";\nimport { contentHash } from \"./hash\";\nfunction compareEdits(left, right) {\n  return left.start - right.start || left.end - right.end || left.index - right.index;\n}\nfunction sourceContentHash(source) {\n  return contentHash(source);\n}\nfunction validateSourceEdits(source, edits) {\n  const sorted = edits.map((edit, index) => ({ ...edit, index })).sort(compareEdits);\n  let previousEnd = 0;\n  for (const edit of sorted) {\n    if (!Number.isInteger(edit.start) || !Number.isInteger(edit.end) || edit.start < 0 || edit.end < edit.start || edit.end > source.length) {\n      throw new Error(`Invalid UTF-16 source edit [${edit.start}, ${edit.end})`);\n    }\n    if (edit.start < previousEnd) {\n      throw new Error(`Overlapping UTF-16 source edit at ${edit.start}`);\n    }\n    previousEnd = Math.max(previousEnd, edit.end);\n  }\n}\nfunction sourcePositions(source) {\n  const positions = new Array(source.length + 1);\n  let line = 0;\n  let column = 0;\n  for (let index = 0; index <= source.length; index++) {\n    positions[index] = { line, column };\n    if (index === source.length) break;\n    if (source.charCodeAt(index) === 10) {\n      line++;\n      column = 0;\n    } else {\n      column++;\n    }\n  }\n  return positions;\n}\nfunction mappedSourceMap(source, id, edits) {\n  const map = new GenMapping();\n  setSourceContent(map, id, source);\n  const positions = sourcePositions(source);\n  let generatedLine = 0;\n  let generatedColumn = 0;\n  let sourceCursor = 0;\n  const emit = (content, sourceStart, sourceEnd) => {\n    const available = Math.max(1, sourceEnd - sourceStart);\n    for (let offset = 0; offset < content.length; offset++) {\n      const originalIndex = Math.min(sourceStart + offset, sourceStart + available - 1);\n      const original = positions[originalIndex];\n      addSegment(map, generatedLine, generatedColumn, id, original.line, original.column);\n      if (content.charCodeAt(offset) === 10) {\n        generatedLine++;\n        generatedColumn = 0;\n      } else {\n        generatedColumn++;\n      }\n    }\n  };\n  for (const edit of edits) {\n    emit(source.slice(sourceCursor, edit.start), sourceCursor, edit.start);\n    if (edit.origin.id !== id) {\n      throw new Error(`Source edit for ${id} must use a local mapping origin`);\n    }\n    emit(\n      edit.content,\n      edit.origin.start,\n      edit.start === edit.end ? edit.origin.start + 1 : edit.origin.end\n    );\n    sourceCursor = edit.end;\n  }\n  emit(source.slice(sourceCursor), sourceCursor, source.length);\n  const encoded = toEncodedMap(map);\n  return {\n    version: 3,\n    file: encoded.file ?? void 0,\n    names: encoded.names,\n    sources: encoded.sources,\n    sourcesContent: encoded.sourcesContent ?? [source],\n    mappings: encoded.mappings\n  };\n}\nfunction applyLoweredModule(source, id, plan) {\n  if (plan.id !== id) {\n    throw new Error(`Lowered module plan ${plan.id} cannot be applied to ${id}`);\n  }\n  if (plan.sourceHash !== sourceContentHash(source)) {\n    throw new Error(`Lowered module plan for ${id} does not match the supplied source`);\n  }\n  if (plan.edits.length === 0) return { changed: false, code: source, map: null };\n  validateSourceEdits(source, plan.edits);\n  const output = new MagicString(source);\n  const sorted = plan.edits.map((edit, index) => ({ ...edit, index })).sort(compareEdits);\n  for (const edit of sorted) {\n    if (edit.start === edit.end) {\n      output.appendLeft(edit.start, edit.content);\n    } else {\n      output.overwrite(edit.start, edit.end, edit.content);\n    }\n  }\n  return {\n    changed: true,\n    code: output.toString(),\n    map: mappedSourceMap(source, id, sorted)\n  };\n}\nexport {\n  applyLoweredModule,\n  sourceContentHash,\n  validateSourceEdits\n};\n//# sourceMappingURL=output.js.map\n"],"mappings":";;;;;AAQA,SAAS,aAAa,MAAM,OAAO;CACjC,OAAO,KAAK,QAAQ,MAAM,SAAS,KAAK,MAAM,MAAM,OAAO,KAAK,QAAQ,MAAM;AAChF;AACA,SAAS,kBAAkB,QAAQ;CACjC,OAAO,YAAY,MAAM;AAC3B;AACA,SAAS,oBAAoB,QAAQ,OAAO;CAC1C,MAAM,SAAS,MAAM,KAAK,MAAM,WAAW;EAAE,GAAG;EAAM;CAAM,EAAE,EAAE,KAAK,YAAY;CACjF,IAAI,cAAc;CAClB,KAAK,MAAM,QAAQ,QAAQ;EACzB,IAAI,CAAC,OAAO,UAAU,KAAK,KAAK,KAAK,CAAC,OAAO,UAAU,KAAK,GAAG,KAAK,KAAK,QAAQ,KAAK,KAAK,MAAM,KAAK,SAAS,KAAK,MAAM,OAAO,QAAQ;GACvI,MAAM,IAAI,MAAM,+BAA+B,KAAK,MAAM,IAAI,KAAK,IAAI,EAAE;EAC3E;EACA,IAAI,KAAK,QAAQ,aAAa;GAC5B,MAAM,IAAI,MAAM,qCAAqC,KAAK,OAAO;EACnE;EACA,cAAc,KAAK,IAAI,aAAa,KAAK,GAAG;CAC9C;AACF;AACA,SAAS,gBAAgB,QAAQ;CAC/B,MAAM,YAAY,IAAI,MAAM,OAAO,SAAS,CAAC;CAC7C,IAAI,OAAO;CACX,IAAI,SAAS;CACb,KAAK,IAAI,QAAQ,GAAG,SAAS,OAAO,QAAQ,SAAS;EACnD,UAAU,SAAS;GAAE;GAAM;EAAO;EAClC,IAAI,UAAU,OAAO,QAAQ;EAC7B,IAAI,OAAO,WAAW,KAAK,MAAM,IAAI;GACnC;GACA,SAAS;EACX,OAAO;GACL;EACF;CACF;CACA,OAAO;AACT;AACA,SAAS,gBAAgB,QAAQ,IAAI,OAAO;CAC1C,MAAM,MAAM,IAAI,WAAW;CAC3B,iBAAiB,KAAK,IAAI,MAAM;CAChC,MAAM,YAAY,gBAAgB,MAAM;CACxC,IAAI,gBAAgB;CACpB,IAAI,kBAAkB;CACtB,IAAI,eAAe;CACnB,MAAM,QAAQ,SAAS,aAAa,cAAc;EAChD,MAAM,YAAY,KAAK,IAAI,GAAG,YAAY,WAAW;EACrD,KAAK,IAAI,SAAS,GAAG,SAAS,QAAQ,QAAQ,UAAU;GACtD,MAAM,gBAAgB,KAAK,IAAI,cAAc,QAAQ,cAAc,YAAY,CAAC;GAChF,MAAM,WAAW,UAAU;GAC3B,WAAW,KAAK,eAAe,iBAAiB,IAAI,SAAS,MAAM,SAAS,MAAM;GAClF,IAAI,QAAQ,WAAW,MAAM,MAAM,IAAI;IACrC;IACA,kBAAkB;GACpB,OAAO;IACL;GACF;EACF;CACF;CACA,KAAK,MAAM,QAAQ,OAAO;EACxB,KAAK,OAAO,MAAM,cAAc,KAAK,KAAK,GAAG,cAAc,KAAK,KAAK;EACrE,IAAI,KAAK,OAAO,OAAO,IAAI;GACzB,MAAM,IAAI,MAAM,mBAAmB,GAAG,iCAAiC;EACzE;EACA,KACE,KAAK,SACL,KAAK,OAAO,OACZ,KAAK,UAAU,KAAK,MAAM,KAAK,OAAO,QAAQ,IAAI,KAAK,OAAO,GAChE;EACA,eAAe,KAAK;CACtB;CACA,KAAK,OAAO,MAAM,YAAY,GAAG,cAAc,OAAO,MAAM;CAC5D,MAAM,UAAU,aAAa,GAAG;CAChC,OAAO;EACL,SAAS;EACT,MAAM,QAAQ,QAAQ,KAAK;EAC3B,OAAO,QAAQ;EACf,SAAS,QAAQ;EACjB,gBAAgB,QAAQ,kBAAkB,CAAC,MAAM;EACjD,UAAU,QAAQ;CACpB;AACF;AACA,SAAS,mBAAmB,QAAQ,IAAI,MAAM;CAC5C,IAAI,KAAK,OAAO,IAAI;EAClB,MAAM,IAAI,MAAM,uBAAuB,KAAK,GAAG,wBAAwB,IAAI;CAC7E;CACA,IAAI,KAAK,eAAe,kBAAkB,MAAM,GAAG;EACjD,MAAM,IAAI,MAAM,2BAA2B,GAAG,oCAAoC;CACpF;CACA,IAAI,KAAK,MAAM,WAAW,GAAG,OAAO;EAAE,SAAS;EAAO,MAAM;EAAQ,KAAK;CAAK;CAC9E,oBAAoB,QAAQ,KAAK,KAAK;CACtC,MAAM,SAAS,IAAI,YAAY,MAAM;CACrC,MAAM,SAAS,KAAK,MAAM,KAAK,MAAM,WAAW;EAAE,GAAG;EAAM;CAAM,EAAE,EAAE,KAAK,YAAY;CACtF,KAAK,MAAM,QAAQ,QAAQ;EACzB,IAAI,KAAK,UAAU,KAAK,KAAK;GAC3B,OAAO,WAAW,KAAK,OAAO,KAAK,OAAO;EAC5C,OAAO;GACL,OAAO,UAAU,KAAK,OAAO,KAAK,KAAK,KAAK,OAAO;EACrD;CACF;CACA,OAAO;EACL,SAAS;EACT,MAAM,OAAO,SAAS;EACtB,KAAK,gBAAgB,QAAQ,IAAI,MAAM;CACzC;AACF"}

package/dist/esm/planCache.mjs

@@ -0,0 +1,194 @@
+import { randomBytes } from "node:crypto";
+import { mkdir, readFile, readdir, rename, stat, unlink, writeFile } from "node:fs/promises";
+import { dirname, join } from "node:path";
+import { contentHash, stableStringify } from "./hash.mjs";
+import { LOWERED_MODULE_PLAN_VERSION } from "./lower.mjs";
+import { moduleContentHash } from "./graph.mjs";
+
+const PLAN_CACHE_SCHEMA_VERSION = 1;
+const PLAN_CACHE_MAX_ENTRIES = 2e4;
+function tamaguiCacheRoot(projectRoot) {
+	return join(projectRoot, "node_modules", ".cache", "tamagui");
+}
+function defaultPlanCacheRoot(projectRoot, target) {
+	return join(tamaguiCacheRoot(projectRoot), "plans", target);
+}
+function moduleClosureNode(input) {
+	return {
+		contentHash: moduleContentHash(input),
+		dependencies: input.imports.filter(({ external }) => !external).map(({ resolvedId }) => resolvedId)
+	};
+}
+function moduleClosureDigest(id, lookup, memo) {
+	const cached = memo?.get(id);
+	if (cached !== void 0) return cached;
+	const reached = /* @__PURE__ */ new Map();
+	const queue = [id];
+	let complete = true;
+	while (queue.length) {
+		const current = queue.pop();
+		if (reached.has(current)) continue;
+		const node = lookup(current);
+		if (!node) {
+			complete = false;
+			break;
+		}
+		reached.set(current, node.contentHash);
+		for (const dependency of node.dependencies) queue.push(dependency);
+	}
+	const digest = complete ? contentHash([...reached].sort(([left], [right]) => left < right ? -1 : left > right ? 1 : 0).map(([current, hash]) => `${current}\0${hash}`).join("\0")) : null;
+	memo?.set(id, digest);
+	return digest;
+}
+function planCacheKey(identity, id, closureDigest) {
+	return contentHash(stableStringify({
+		schema: 1,
+		plan: LOWERED_MODULE_PLAN_VERSION,
+		stamp: identity.stamp,
+		target: identity.target,
+		structuralPassHash: identity.structuralPassHash,
+		id,
+		closureDigest
+	}));
+}
+var JsonFileCache = class {
+	constructor(root, schemaVersion, maxEntries = PLAN_CACHE_MAX_ENTRIES) {
+		this.root = root;
+		this.schemaVersion = schemaVersion;
+		this.maxEntries = maxEntries;
+	}
+	root;
+	schemaVersion;
+	maxEntries;
+	#hits = 0;
+	#misses = 0;
+	#writes = 0;
+	#writesSincePrune = 0;
+	#prunedThisProcess = false;
+	#created = /* @__PURE__ */ new Set();
+	get stats() {
+		return {
+			hits: this.#hits,
+			misses: this.#misses,
+			writes: this.#writes
+		};
+	}
+	resetStats() {
+		this.#hits = 0;
+		this.#misses = 0;
+		this.#writes = 0;
+	}
+	#path(key) {
+		return join(this.root, `v${this.schemaVersion}`, key.slice(0, 2), `${key}.json`);
+	}
+	/**
+	* Null on anything short of an entry `validate` fully accepts. A miss
+	* recompiles; nothing here repairs or partially trusts an entry, and a later
+	* successful compile overwrites the bad file.
+	*/
+	async read(key, validate) {
+		let parsed;
+		try {
+			parsed = JSON.parse(await readFile(this.#path(key), "utf8"));
+		} catch {
+			this.#misses++;
+			return null;
+		}
+		const entry = validate(parsed);
+		if (entry === null) {
+			this.#misses++;
+			return null;
+		}
+		this.#hits++;
+		return entry;
+	}
+	async write(key, value) {
+		const path = this.#path(key);
+		const directory = dirname(path);
+		if (!this.#created.has(directory)) {
+			await mkdir(directory, { recursive: true });
+			this.#created.add(directory);
+		}
+		const temporaryPath = `${path}.${process.pid}-${randomBytes(6).toString("hex")}.tmp`;
+		await writeFile(temporaryPath, `${stableStringify(value)}
+`, "utf8");
+		await rename(temporaryPath, path);
+		this.#writes++;
+		this.#writesSincePrune++;
+		const batch = Math.max(1, Math.floor(this.maxEntries / 4));
+		if (!this.#prunedThisProcess || this.#writesSincePrune >= batch) {
+			this.#prunedThisProcess = true;
+			this.#writesSincePrune = 0;
+			await this.#prune();
+		}
+	}
+	/**
+	* Drops the oldest entries once the store exceeds its cap, oldest by the later
+	* of read and write time so an entry a build keeps hitting is not treated as
+	* dead on filesystems that maintain access times.
+	*/
+	async #prune() {
+		const versionRoot = join(this.root, `v${this.schemaVersion}`);
+		let shards;
+		try {
+			shards = await readdir(versionRoot);
+		} catch {
+			return;
+		}
+		const paths = [];
+		for (const shard of shards) {
+			const directory = join(versionRoot, shard);
+			let files;
+			try {
+				files = await readdir(directory);
+			} catch {
+				continue;
+			}
+			for (const file of files) {
+				if (file.endsWith(".json")) paths.push(join(directory, file));
+			}
+		}
+		if (paths.length <= this.maxEntries) return;
+		const entries = [];
+		for (const path of paths) {
+			try {
+				const stats = await stat(path);
+				entries.push({
+					path,
+					usedAt: Math.max(stats.atimeMs, stats.mtimeMs)
+				});
+			} catch {}
+		}
+		entries.sort((left, right) => left.usedAt - right.usedAt);
+		for (const entry of entries.slice(0, Math.max(0, entries.length - this.maxEntries))) {
+			await unlink(entry.path).catch(() => {});
+		}
+	}
+};
+var ModulePlanCache = class {
+	constructor(root) {
+		this.root = root;
+		this.#files = new JsonFileCache(root, 1);
+	}
+	root;
+	#files;
+	get stats() {
+		return this.#files.stats;
+	}
+	resetStats() {
+		this.#files.resetStats();
+	}
+	read(key, id, closureDigest) {
+		return this.#files.read(key, (value) => {
+			const entry = value;
+			const plan = entry?.plan;
+			return entry?.schemaVersion === 1 && entry.moduleId === id && entry.closureDigest === closureDigest && plan && plan.version === LOWERED_MODULE_PLAN_VERSION && plan.id === id && typeof plan.sourceHash === "string" && typeof plan.css === "string" && Array.isArray(plan.edits) && Array.isArray(plan.diagnostics) && Array.isArray(plan.dependencies) && !!plan.stats ? entry : null;
+		});
+	}
+	write(key, entry) {
+		return this.#files.write(key, entry);
+	}
+};
+
+export { JsonFileCache, ModulePlanCache, PLAN_CACHE_MAX_ENTRIES, PLAN_CACHE_SCHEMA_VERSION, defaultPlanCacheRoot, moduleClosureDigest, moduleClosureNode, planCacheKey, tamaguiCacheRoot };
+//# sourceMappingURL=planCache.mjs.map

package/dist/esm/planCache.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"planCache.js","names":["#hits","#misses","#writes","#path","#created","#writesSincePrune","#prunedThisProcess","#prune","#files"],"sources":["esm/planCache.js"],"sourcesContent":["import { randomBytes } from \"node:crypto\";\nimport {\n  mkdir,\n  readdir,\n  readFile,\n  rename,\n  stat,\n  unlink,\n  writeFile\n} from \"node:fs/promises\";\nimport { dirname, join } from \"node:path\";\nimport { contentHash, stableStringify } from \"./hash\";\nimport { LOWERED_MODULE_PLAN_VERSION } from \"./lower\";\nimport { moduleContentHash } from \"./graph\";\nconst PLAN_CACHE_SCHEMA_VERSION = 1;\nconst PLAN_CACHE_MAX_ENTRIES = 2e4;\nfunction tamaguiCacheRoot(projectRoot) {\n  return join(projectRoot, \"node_modules\", \".cache\", \"tamagui\");\n}\nfunction defaultPlanCacheRoot(projectRoot, target) {\n  return join(tamaguiCacheRoot(projectRoot), \"plans\", target);\n}\nfunction moduleClosureNode(input) {\n  return {\n    contentHash: moduleContentHash(input),\n    dependencies: input.imports.filter(({ external }) => !external).map(({ resolvedId }) => resolvedId)\n  };\n}\nfunction moduleClosureDigest(id, lookup, memo) {\n  const cached = memo?.get(id);\n  if (cached !== void 0) return cached;\n  const reached = /* @__PURE__ */ new Map();\n  const queue = [id];\n  let complete = true;\n  while (queue.length) {\n    const current = queue.pop();\n    if (reached.has(current)) continue;\n    const node = lookup(current);\n    if (!node) {\n      complete = false;\n      break;\n    }\n    reached.set(current, node.contentHash);\n    for (const dependency of node.dependencies) queue.push(dependency);\n  }\n  const digest = complete ? contentHash(\n    [...reached].sort(([left], [right]) => left < right ? -1 : left > right ? 1 : 0).map(([current, hash]) => `${current}\\0${hash}`).join(\"\\0\")\n  ) : null;\n  memo?.set(id, digest);\n  return digest;\n}\nfunction planCacheKey(identity, id, closureDigest) {\n  return contentHash(\n    stableStringify({\n      schema: PLAN_CACHE_SCHEMA_VERSION,\n      plan: LOWERED_MODULE_PLAN_VERSION,\n      stamp: identity.stamp,\n      target: identity.target,\n      structuralPassHash: identity.structuralPassHash,\n      id,\n      closureDigest\n    })\n  );\n}\nclass JsonFileCache {\n  constructor(root, schemaVersion, maxEntries = PLAN_CACHE_MAX_ENTRIES) {\n    this.root = root;\n    this.schemaVersion = schemaVersion;\n    this.maxEntries = maxEntries;\n  }\n  root;\n  schemaVersion;\n  maxEntries;\n  #hits = 0;\n  #misses = 0;\n  #writes = 0;\n  #writesSincePrune = 0;\n  #prunedThisProcess = false;\n  #created = /* @__PURE__ */ new Set();\n  get stats() {\n    return { hits: this.#hits, misses: this.#misses, writes: this.#writes };\n  }\n  resetStats() {\n    this.#hits = 0;\n    this.#misses = 0;\n    this.#writes = 0;\n  }\n  #path(key) {\n    return join(this.root, `v${this.schemaVersion}`, key.slice(0, 2), `${key}.json`);\n  }\n  /**\n   * Null on anything short of an entry `validate` fully accepts. A miss\n   * recompiles; nothing here repairs or partially trusts an entry, and a later\n   * successful compile overwrites the bad file.\n   */\n  async read(key, validate) {\n    let parsed;\n    try {\n      parsed = JSON.parse(await readFile(this.#path(key), \"utf8\"));\n    } catch {\n      this.#misses++;\n      return null;\n    }\n    const entry = validate(parsed);\n    if (entry === null) {\n      this.#misses++;\n      return null;\n    }\n    this.#hits++;\n    return entry;\n  }\n  async write(key, value) {\n    const path = this.#path(key);\n    const directory = dirname(path);\n    if (!this.#created.has(directory)) {\n      await mkdir(directory, { recursive: true });\n      this.#created.add(directory);\n    }\n    const temporaryPath = `${path}.${process.pid}-${randomBytes(6).toString(\"hex\")}.tmp`;\n    await writeFile(temporaryPath, `${stableStringify(value)}\n`, \"utf8\");\n    await rename(temporaryPath, path);\n    this.#writes++;\n    this.#writesSincePrune++;\n    const batch = Math.max(1, Math.floor(this.maxEntries / 4));\n    if (!this.#prunedThisProcess || this.#writesSincePrune >= batch) {\n      this.#prunedThisProcess = true;\n      this.#writesSincePrune = 0;\n      await this.#prune();\n    }\n  }\n  /**\n   * Drops the oldest entries once the store exceeds its cap, oldest by the later\n   * of read and write time so an entry a build keeps hitting is not treated as\n   * dead on filesystems that maintain access times.\n   */\n  async #prune() {\n    const versionRoot = join(this.root, `v${this.schemaVersion}`);\n    let shards;\n    try {\n      shards = await readdir(versionRoot);\n    } catch {\n      return;\n    }\n    const paths = [];\n    for (const shard of shards) {\n      const directory = join(versionRoot, shard);\n      let files;\n      try {\n        files = await readdir(directory);\n      } catch {\n        continue;\n      }\n      for (const file of files) {\n        if (file.endsWith(\".json\")) paths.push(join(directory, file));\n      }\n    }\n    if (paths.length <= this.maxEntries) return;\n    const entries = [];\n    for (const path of paths) {\n      try {\n        const stats = await stat(path);\n        entries.push({ path, usedAt: Math.max(stats.atimeMs, stats.mtimeMs) });\n      } catch {\n      }\n    }\n    entries.sort((left, right) => left.usedAt - right.usedAt);\n    for (const entry of entries.slice(0, Math.max(0, entries.length - this.maxEntries))) {\n      await unlink(entry.path).catch(() => {\n      });\n    }\n  }\n}\nclass ModulePlanCache {\n  constructor(root) {\n    this.root = root;\n    this.#files = new JsonFileCache(root, PLAN_CACHE_SCHEMA_VERSION);\n  }\n  root;\n  #files;\n  get stats() {\n    return this.#files.stats;\n  }\n  resetStats() {\n    this.#files.resetStats();\n  }\n  read(key, id, closureDigest) {\n    return this.#files.read(key, (value) => {\n      const entry = value;\n      const plan = entry?.plan;\n      return entry?.schemaVersion === PLAN_CACHE_SCHEMA_VERSION && entry.moduleId === id && entry.closureDigest === closureDigest && plan && plan.version === LOWERED_MODULE_PLAN_VERSION && plan.id === id && typeof plan.sourceHash === \"string\" && typeof plan.css === \"string\" && Array.isArray(plan.edits) && Array.isArray(plan.diagnostics) && Array.isArray(plan.dependencies) && !!plan.stats ? entry : null;\n    });\n  }\n  write(key, entry) {\n    return this.#files.write(key, entry);\n  }\n}\nexport {\n  JsonFileCache,\n  ModulePlanCache,\n  PLAN_CACHE_MAX_ENTRIES,\n  PLAN_CACHE_SCHEMA_VERSION,\n  defaultPlanCacheRoot,\n  moduleClosureDigest,\n  moduleClosureNode,\n  planCacheKey,\n  tamaguiCacheRoot\n};\n//# sourceMappingURL=planCache.js.map\n"],"mappings":";;;;;;;;AAcA,MAAM,4BAA4B;AAClC,MAAM,yBAAyB;AAC/B,SAAS,iBAAiB,aAAa;CACrC,OAAO,KAAK,aAAa,gBAAgB,UAAU,SAAS;AAC9D;AACA,SAAS,qBAAqB,aAAa,QAAQ;CACjD,OAAO,KAAK,iBAAiB,WAAW,GAAG,SAAS,MAAM;AAC5D;AACA,SAAS,kBAAkB,OAAO;CAChC,OAAO;EACL,aAAa,kBAAkB,KAAK;EACpC,cAAc,MAAM,QAAQ,QAAQ,EAAE,eAAe,CAAC,QAAQ,EAAE,KAAK,EAAE,iBAAiB,UAAU;CACpG;AACF;AACA,SAAS,oBAAoB,IAAI,QAAQ,MAAM;CAC7C,MAAM,SAAS,MAAM,IAAI,EAAE;CAC3B,IAAI,WAAW,KAAK,GAAG,OAAO;CAC9B,MAAM,0BAA0B,IAAI,IAAI;CACxC,MAAM,QAAQ,CAAC,EAAE;CACjB,IAAI,WAAW;CACf,OAAO,MAAM,QAAQ;EACnB,MAAM,UAAU,MAAM,IAAI;EAC1B,IAAI,QAAQ,IAAI,OAAO,GAAG;EAC1B,MAAM,OAAO,OAAO,OAAO;EAC3B,IAAI,CAAC,MAAM;GACT,WAAW;GACX;EACF;EACA,QAAQ,IAAI,SAAS,KAAK,WAAW;EACrC,KAAK,MAAM,cAAc,KAAK,cAAc,MAAM,KAAK,UAAU;CACnE;CACA,MAAM,SAAS,WAAW,YACxB,CAAC,GAAG,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC,WAAW,OAAO,QAAQ,CAAC,IAAI,OAAO,QAAQ,IAAI,CAAC,EAAE,KAAK,CAAC,SAAS,UAAU,GAAG,QAAQ,IAAI,MAAM,EAAE,KAAK,IAAI,CAC5I,IAAI;CACJ,MAAM,IAAI,IAAI,MAAM;CACpB,OAAO;AACT;AACA,SAAS,aAAa,UAAU,IAAI,eAAe;CACjD,OAAO,YACL,gBAAgB;EACd;EACA,MAAM;EACN,OAAO,SAAS;EAChB,QAAQ,SAAS;EACjB,oBAAoB,SAAS;EAC7B;EACA;CACF,CAAC,CACH;AACF;AACA,IAAM,gBAAN,MAAoB;CAClB,YAAY,MAAM,eAAe,aAAa,wBAAwB;EACpE,KAAK,OAAO;EACZ,KAAK,gBAAgB;EACrB,KAAK,aAAa;CACpB;CACA;CACA;CACA;CACA,QAAQ;CACR,UAAU;CACV,UAAU;CACV,oBAAoB;CACpB,qBAAqB;CACrB,2BAA2B,IAAI,IAAI;CACnC,IAAI,QAAQ;EACV,OAAO;GAAE,MAAM,KAAKA;GAAO,QAAQ,KAAKC;GAAS,QAAQ,KAAKC;EAAQ;CACxE;CACA,aAAa;EACX,KAAKF,QAAQ;EACb,KAAKC,UAAU;EACf,KAAKC,UAAU;CACjB;CACA,MAAM,KAAK;EACT,OAAO,KAAK,KAAK,MAAM,IAAI,KAAK,iBAAiB,IAAI,MAAM,GAAG,CAAC,GAAG,GAAG,IAAI,MAAM;CACjF;;;;;;CAMA,MAAM,KAAK,KAAK,UAAU;EACxB,IAAI;EACJ,IAAI;GACF,SAAS,KAAK,MAAM,MAAM,SAAS,KAAKC,MAAM,GAAG,GAAG,MAAM,CAAC;EAC7D,QAAQ;GACN,KAAKF;GACL,OAAO;EACT;EACA,MAAM,QAAQ,SAAS,MAAM;EAC7B,IAAI,UAAU,MAAM;GAClB,KAAKA;GACL,OAAO;EACT;EACA,KAAKD;EACL,OAAO;CACT;CACA,MAAM,MAAM,KAAK,OAAO;EACtB,MAAM,OAAO,KAAKG,MAAM,GAAG;EAC3B,MAAM,YAAY,QAAQ,IAAI;EAC9B,IAAI,CAAC,KAAKC,SAAS,IAAI,SAAS,GAAG;GACjC,MAAM,MAAM,WAAW,EAAE,WAAW,KAAK,CAAC;GAC1C,KAAKA,SAAS,IAAI,SAAS;EAC7B;EACA,MAAM,gBAAgB,GAAG,KAAK,GAAG,QAAQ,IAAI,GAAG,YAAY,CAAC,EAAE,SAAS,KAAK,EAAE;EAC/E,MAAM,UAAU,eAAe,GAAG,gBAAgB,KAAK,EAAE;GAC1D,MAAM;EACL,MAAM,OAAO,eAAe,IAAI;EAChC,KAAKF;EACL,KAAKG;EACL,MAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,aAAa,CAAC,CAAC;EACzD,IAAI,CAAC,KAAKC,sBAAsB,KAAKD,qBAAqB,OAAO;GAC/D,KAAKC,qBAAqB;GAC1B,KAAKD,oBAAoB;GACzB,MAAM,KAAKE,OAAO;EACpB;CACF;;;;;;CAMA,MAAMA,SAAS;EACb,MAAM,cAAc,KAAK,KAAK,MAAM,IAAI,KAAK,eAAe;EAC5D,IAAI;EACJ,IAAI;GACF,SAAS,MAAM,QAAQ,WAAW;EACpC,QAAQ;GACN;EACF;EACA,MAAM,QAAQ,CAAC;EACf,KAAK,MAAM,SAAS,QAAQ;GAC1B,MAAM,YAAY,KAAK,aAAa,KAAK;GACzC,IAAI;GACJ,IAAI;IACF,QAAQ,MAAM,QAAQ,SAAS;GACjC,QAAQ;IACN;GACF;GACA,KAAK,MAAM,QAAQ,OAAO;IACxB,IAAI,KAAK,SAAS,OAAO,GAAG,MAAM,KAAK,KAAK,WAAW,IAAI,CAAC;GAC9D;EACF;EACA,IAAI,MAAM,UAAU,KAAK,YAAY;EACrC,MAAM,UAAU,CAAC;EACjB,KAAK,MAAM,QAAQ,OAAO;GACxB,IAAI;IACF,MAAM,QAAQ,MAAM,KAAK,IAAI;IAC7B,QAAQ,KAAK;KAAE;KAAM,QAAQ,KAAK,IAAI,MAAM,SAAS,MAAM,OAAO;IAAE,CAAC;GACvE,QAAQ,CACR;EACF;EACA,QAAQ,MAAM,MAAM,UAAU,KAAK,SAAS,MAAM,MAAM;EACxD,KAAK,MAAM,SAAS,QAAQ,MAAM,GAAG,KAAK,IAAI,GAAG,QAAQ,SAAS,KAAK,UAAU,CAAC,GAAG;GACnF,MAAM,OAAO,MAAM,IAAI,EAAE,YAAY,CACrC,CAAC;EACH;CACF;AACF;AACA,IAAM,kBAAN,MAAsB;CACpB,YAAY,MAAM;EAChB,KAAK,OAAO;EACZ,KAAKC,SAAS,IAAI,cAAc,OAA+B;CACjE;CACA;CACA;CACA,IAAI,QAAQ;EACV,OAAO,KAAKA,OAAO;CACrB;CACA,aAAa;EACX,KAAKA,OAAO,WAAW;CACzB;CACA,KAAK,KAAK,IAAI,eAAe;EAC3B,OAAO,KAAKA,OAAO,KAAK,MAAM,UAAU;GACtC,MAAM,QAAQ;GACd,MAAM,OAAO,OAAO;GACpB,OAAO,OAAO,uBAA+C,MAAM,aAAa,MAAM,MAAM,kBAAkB,iBAAiB,QAAQ,KAAK,YAAY,+BAA+B,KAAK,OAAO,MAAM,OAAO,KAAK,eAAe,YAAY,OAAO,KAAK,QAAQ,YAAY,MAAM,QAAQ,KAAK,KAAK,KAAK,MAAM,QAAQ,KAAK,WAAW,KAAK,MAAM,QAAQ,KAAK,YAAY,KAAK,CAAC,CAAC,KAAK,QAAQ,QAAQ;EAC7Y,CAAC;CACH;CACA,MAAM,KAAK,OAAO;EAChB,OAAO,KAAKA,OAAO,MAAM,KAAK,KAAK;CACrC;AACF"}

package/dist/esm/session.mjs

@@ -0,0 +1,99 @@
+import { ProjectGraph } from "./graph.mjs";
+import { lowerModule } from "./lower.mjs";
+import { materializeModule } from "./materialize.mjs";
+import { applyLoweredModule } from "./output.mjs";
+import { PLAN_CACHE_SCHEMA_VERSION, moduleClosureDigest, planCacheKey } from "./planCache.mjs";
+import { yukuFactory } from "./yuku.mjs";
+
+function compareIds(left, right) {
+	return left < right ? -1 : left > right ? 1 : 0;
+}
+var CompilerSession = class {
+	#graph = new ProjectGraph(yukuFactory, { modules: [] });
+	#queue = Promise.resolve();
+	compile(input) {
+		const operation = this.#queue.then(() => this.#compile(input));
+		this.#queue = operation.catch(() => void 0);
+		return operation;
+	}
+	update(module) {
+		return this.#enqueue(() => this.#graph.updateModule(module).invalidatedIds);
+	}
+	has(id) {
+		return this.#graph.contentHash(id) !== null;
+	}
+	dependentsOf(id) {
+		return this.#graph.dependentsOf(id);
+	}
+	remove(id) {
+		return this.#enqueue(() => this.#graph.removeModule(id));
+	}
+	parseCount(id) {
+		return this.#graph.parseCount(id);
+	}
+	#enqueue(operation) {
+		const queued = this.#queue.then(operation);
+		this.#queue = queued.catch(() => void 0);
+		return queued;
+	}
+	async #compile({ module, adapter, structuralPass }) {
+		const invalidated = /* @__PURE__ */ new Set();
+		await this.#install(module, adapter, /* @__PURE__ */ new Set(), invalidated);
+		const graph = this.#graph;
+		const cache = adapter.planCache?.stamp ? adapter.planCache : null;
+		const closureDigest = cache ? moduleClosureDigest(module.id, (id) => {
+			const hash = graph.contentHash(id);
+			return hash ? {
+				contentHash: hash,
+				dependencies: graph.dependenciesOf(id)
+			} : null;
+		}) : null;
+		const entry = cache && closureDigest ? {
+			store: cache.store,
+			digest: closureDigest,
+			key: planCacheKey({
+				stamp: cache.stamp,
+				target: adapter.target,
+				structuralPassHash: structuralPass?.versionHash ?? `${adapter.target}-noop-v1`
+			}, module.id, closureDigest)
+		} : null;
+		const cached = entry ? await entry.store.read(entry.key, module.id, entry.digest) : null;
+		const plan = cached?.plan ?? lowerModule({
+			module: materializeModule(graph, module.id),
+			source: module.source,
+			target: adapter.target,
+			host: adapter.host,
+			options: { projectGeneration: adapter.projectGeneration },
+			structuralPass
+		});
+		if (entry && !cached) {
+			await entry.store.write(entry.key, {
+				schemaVersion: PLAN_CACHE_SCHEMA_VERSION,
+				moduleId: module.id,
+				closureDigest: entry.digest,
+				plan
+			});
+		}
+		return {
+			plan,
+			output: applyLoweredModule(module.source, module.id, plan),
+			invalidatedIds: [...invalidated].sort(compareIds)
+		};
+	}
+	async #install(module, adapter, visited, invalidated) {
+		if (visited.has(module.id)) return;
+		visited.add(module.id);
+		for (const dependency of module.imports) {
+			if (dependency.external || this.has(dependency.resolvedId)) continue;
+			const loaded = await adapter.load(dependency.resolvedId);
+			if (loaded) {
+				await this.#install(loaded, adapter, visited, invalidated);
+			}
+		}
+		const update = this.#graph.updateModule(module);
+		for (const id of update.invalidatedIds) invalidated.add(id);
+	}
+};
+
+export { CompilerSession };
+//# sourceMappingURL=session.mjs.map

package/dist/esm/session.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"session.js","names":["#queue","#compile","#enqueue","#graph","#install"],"sources":["esm/session.js"],"sourcesContent":["import { ProjectGraph } from \"./graph\";\nimport { lowerModule } from \"./lower\";\nimport { materializeModule } from \"./materialize\";\nimport { applyLoweredModule } from \"./output\";\nimport { PLAN_CACHE_SCHEMA_VERSION, moduleClosureDigest, planCacheKey } from \"./planCache\";\nimport { yukuFactory } from \"./yuku\";\nfunction compareIds(left, right) {\n  return left < right ? -1 : left > right ? 1 : 0;\n}\nclass CompilerSession {\n  #graph = new ProjectGraph(yukuFactory, { modules: [] });\n  #queue = Promise.resolve();\n  compile(input) {\n    const operation = this.#queue.then(() => this.#compile(input));\n    this.#queue = operation.catch(() => void 0);\n    return operation;\n  }\n  update(module) {\n    return this.#enqueue(() => this.#graph.updateModule(module).invalidatedIds);\n  }\n  has(id) {\n    return this.#graph.contentHash(id) !== null;\n  }\n  dependentsOf(id) {\n    return this.#graph.dependentsOf(id);\n  }\n  remove(id) {\n    return this.#enqueue(() => this.#graph.removeModule(id));\n  }\n  parseCount(id) {\n    return this.#graph.parseCount(id);\n  }\n  #enqueue(operation) {\n    const queued = this.#queue.then(operation);\n    this.#queue = queued.catch(() => void 0);\n    return queued;\n  }\n  async #compile({\n    module,\n    adapter,\n    structuralPass\n  }) {\n    const invalidated = /* @__PURE__ */ new Set();\n    await this.#install(module, adapter, /* @__PURE__ */ new Set(), invalidated);\n    const graph = this.#graph;\n    const cache = adapter.planCache?.stamp ? adapter.planCache : null;\n    const closureDigest = cache ? moduleClosureDigest(module.id, (id) => {\n      const hash = graph.contentHash(id);\n      return hash ? { contentHash: hash, dependencies: graph.dependenciesOf(id) } : null;\n    }) : null;\n    const entry = cache && closureDigest ? {\n      store: cache.store,\n      digest: closureDigest,\n      key: planCacheKey(\n        {\n          stamp: cache.stamp,\n          target: adapter.target,\n          structuralPassHash: structuralPass?.versionHash ?? `${adapter.target}-noop-v1`\n        },\n        module.id,\n        closureDigest\n      )\n    } : null;\n    const cached = entry ? await entry.store.read(entry.key, module.id, entry.digest) : null;\n    const plan = cached?.plan ?? lowerModule({\n      module: materializeModule(graph, module.id),\n      source: module.source,\n      target: adapter.target,\n      host: adapter.host,\n      options: { projectGeneration: adapter.projectGeneration },\n      structuralPass\n    });\n    if (entry && !cached) {\n      await entry.store.write(entry.key, {\n        schemaVersion: PLAN_CACHE_SCHEMA_VERSION,\n        moduleId: module.id,\n        closureDigest: entry.digest,\n        plan\n      });\n    }\n    return {\n      plan,\n      output: applyLoweredModule(module.source, module.id, plan),\n      invalidatedIds: [...invalidated].sort(compareIds)\n    };\n  }\n  async #install(module, adapter, visited, invalidated) {\n    if (visited.has(module.id)) return;\n    visited.add(module.id);\n    for (const dependency of module.imports) {\n      if (dependency.external || this.has(dependency.resolvedId)) continue;\n      const loaded = await adapter.load(dependency.resolvedId);\n      if (loaded) {\n        await this.#install(loaded, adapter, visited, invalidated);\n      }\n    }\n    const update = this.#graph.updateModule(module);\n    for (const id of update.invalidatedIds) invalidated.add(id);\n  }\n}\nexport {\n  CompilerSession\n};\n//# sourceMappingURL=session.js.map\n"],"mappings":";;;;;;;;AAMA,SAAS,WAAW,MAAM,OAAO;CAC/B,OAAO,OAAO,QAAQ,CAAC,IAAI,OAAO,QAAQ,IAAI;AAChD;AACA,IAAM,kBAAN,MAAsB;CACpB,SAAS,IAAI,aAAa,aAAa,EAAE,SAAS,CAAC,EAAE,CAAC;CACtD,SAAS,QAAQ,QAAQ;CACzB,QAAQ,OAAO;EACb,MAAM,YAAY,KAAKA,OAAO,WAAW,KAAKC,SAAS,KAAK,CAAC;EAC7D,KAAKD,SAAS,UAAU,YAAY,KAAK,CAAC;EAC1C,OAAO;CACT;CACA,OAAO,QAAQ;EACb,OAAO,KAAKE,eAAe,KAAKC,OAAO,aAAa,MAAM,EAAE,cAAc;CAC5E;CACA,IAAI,IAAI;EACN,OAAO,KAAKA,OAAO,YAAY,EAAE,MAAM;CACzC;CACA,aAAa,IAAI;EACf,OAAO,KAAKA,OAAO,aAAa,EAAE;CACpC;CACA,OAAO,IAAI;EACT,OAAO,KAAKD,eAAe,KAAKC,OAAO,aAAa,EAAE,CAAC;CACzD;CACA,WAAW,IAAI;EACb,OAAO,KAAKA,OAAO,WAAW,EAAE;CAClC;CACA,SAAS,WAAW;EAClB,MAAM,SAAS,KAAKH,OAAO,KAAK,SAAS;EACzC,KAAKA,SAAS,OAAO,YAAY,KAAK,CAAC;EACvC,OAAO;CACT;CACA,MAAMC,SAAS,EACb,QACA,SACA,kBACC;EACD,MAAM,8BAA8B,IAAI,IAAI;EAC5C,MAAM,KAAKG,SAAS,QAAQ,yBAAyB,IAAI,IAAI,GAAG,WAAW;EAC3E,MAAM,QAAQ,KAAKD;EACnB,MAAM,QAAQ,QAAQ,WAAW,QAAQ,QAAQ,YAAY;EAC7D,MAAM,gBAAgB,QAAQ,oBAAoB,OAAO,KAAK,OAAO;GACnE,MAAM,OAAO,MAAM,YAAY,EAAE;GACjC,OAAO,OAAO;IAAE,aAAa;IAAM,cAAc,MAAM,eAAe,EAAE;GAAE,IAAI;EAChF,CAAC,IAAI;EACL,MAAM,QAAQ,SAAS,gBAAgB;GACrC,OAAO,MAAM;GACb,QAAQ;GACR,KAAK,aACH;IACE,OAAO,MAAM;IACb,QAAQ,QAAQ;IAChB,oBAAoB,gBAAgB,eAAe,GAAG,QAAQ,OAAO;GACvE,GACA,OAAO,IACP,aACF;EACF,IAAI;EACJ,MAAM,SAAS,QAAQ,MAAM,MAAM,MAAM,KAAK,MAAM,KAAK,OAAO,IAAI,MAAM,MAAM,IAAI;EACpF,MAAM,OAAO,QAAQ,QAAQ,YAAY;GACvC,QAAQ,kBAAkB,OAAO,OAAO,EAAE;GAC1C,QAAQ,OAAO;GACf,QAAQ,QAAQ;GAChB,MAAM,QAAQ;GACd,SAAS,EAAE,mBAAmB,QAAQ,kBAAkB;GACxD;EACF,CAAC;EACD,IAAI,SAAS,CAAC,QAAQ;GACpB,MAAM,MAAM,MAAM,MAAM,MAAM,KAAK;IACjC,eAAe;IACf,UAAU,OAAO;IACjB,eAAe,MAAM;IACrB;GACF,CAAC;EACH;EACA,OAAO;GACL;GACA,QAAQ,mBAAmB,OAAO,QAAQ,OAAO,IAAI,IAAI;GACzD,gBAAgB,CAAC,GAAG,WAAW,EAAE,KAAK,UAAU;EAClD;CACF;CACA,MAAMC,SAAS,QAAQ,SAAS,SAAS,aAAa;EACpD,IAAI,QAAQ,IAAI,OAAO,EAAE,GAAG;EAC5B,QAAQ,IAAI,OAAO,EAAE;EACrB,KAAK,MAAM,cAAc,OAAO,SAAS;GACvC,IAAI,WAAW,YAAY,KAAK,IAAI,WAAW,UAAU,GAAG;GAC5D,MAAM,SAAS,MAAM,QAAQ,KAAK,WAAW,UAAU;GACvD,IAAI,QAAQ;IACV,MAAM,KAAKA,SAAS,QAAQ,SAAS,SAAS,WAAW;GAC3D;EACF;EACA,MAAM,SAAS,KAAKD,OAAO,aAAa,MAAM;EAC9C,KAAK,MAAM,MAAM,OAAO,gBAAgB,YAAY,IAAI,EAAE;CAC5D;AACF"}

package/dist/esm/yuku.mjs

@@ -0,0 +1,136 @@
+import { Analyzer } from "yuku-analyzer";
+import { resolveFromHost, resolvedModuleId } from "./contracts.mjs";
+import { childNode, walkAst } from "./ast.mjs";
+import { asAstNode, declarationForName, definitionFromDeclaration } from "./normalize.mjs";
+
+var YukuCandidate = class {
+	constructor(project) {
+		this.project = project;
+		this.#analyzer = new Analyzer({ resolve: (specifier, importer) => resolveFromHost(this.project.resolutions, specifier, importer) });
+		for (const [id, source] of project.files) this.addFile(id, source);
+	}
+	project;
+	name = "yuku";
+	#analyzer;
+	#parseCounts = /* @__PURE__ */ new Map();
+	addFile(id, source) {
+		this.#analyzer.addFile(id, source, {
+			preserveParens: true,
+			sourceType: "module"
+		});
+		this.#parseCounts.set(id, (this.#parseCounts.get(id) ?? 0) + 1);
+	}
+	removeFile(id) {
+		return this.#analyzer.removeFile(id);
+	}
+	link() {
+		this.#analyzer.link();
+	}
+	#module(id) {
+		const module = this.#analyzer.module(id);
+		if (!module) throw new Error(`yuku: unknown module ${id}`);
+		return module;
+	}
+	#canonicalSymbol(id, localName) {
+		const symbol = this.#module(id).resolve(localName);
+		return symbol ? this.#analyzer.definitionOf(symbol)?.symbol ?? null : null;
+	}
+	definitionOf(id, localName) {
+		const symbol = this.#canonicalSymbol(id, localName);
+		if (!symbol) return null;
+		const declaration = symbol.declarations[0];
+		if (!declaration) return null;
+		const program = asAstNode(symbol.module.ast, `${symbol.module.path} program`);
+		const normalizedDeclaration = declarationForName(program, symbol.name) ?? asAstNode(declaration, `${symbol.name} declaration`);
+		return definitionFromDeclaration(symbol.module.path, symbol.name, program, normalizedDeclaration);
+	}
+	referencesOf(definition) {
+		const symbol = this.#canonicalSymbol(definition.id, definition.name);
+		if (!symbol) return [];
+		return this.#analyzer.referencesOf(symbol).map(({ module, reference }) => ({
+			id: resolvedModuleId(module.path),
+			name: reference.name,
+			start: reference.node.start,
+			end: reference.node.end
+		}));
+	}
+	dependenciesOf(id) {
+		return this.#module(id).dependencies.map((module) => module.path).sort();
+	}
+	dependentsOf(id) {
+		return this.#module(id).dependents.map((module) => module.path).sort();
+	}
+	affectedBy(id) {
+		const affected = /* @__PURE__ */ new Set([id]);
+		const queue = [id];
+		while (queue.length) {
+			const current = queue.shift();
+			for (const dependent of this.dependentsOf(current)) {
+				if (!affected.has(dependent)) {
+					affected.add(dependent);
+					queue.push(dependent);
+				}
+			}
+		}
+		return [...affected].sort();
+	}
+	programOf(id) {
+		return asAstNode(this.#module(id).ast, `${id} program`);
+	}
+	sourceOf(id) {
+		return this.#module(id).source;
+	}
+	parseCount(id) {
+		return this.#parseCounts.get(id) ?? 0;
+	}
+	diagnostics() {
+		const parseDiagnostics = [...this.#analyzer.modules.values()].flatMap((module) => module.diagnostics.map((diagnostic) => ({
+			kind: "parse",
+			id: resolvedModuleId(module.path),
+			message: diagnostic.message
+		})));
+		return [...parseDiagnostics, ...this.#analyzer.diagnostics.map((diagnostic) => ({
+			kind: "link",
+			id: resolvedModuleId(diagnostic.module),
+			message: diagnostic.message
+		}))];
+	}
+};
+const yukuFactory = {
+	name: "yuku",
+	create: (project) => new YukuCandidate(project),
+	scanImports(id, source) {
+		const candidate = new YukuCandidate({
+			files: /* @__PURE__ */ new Map([[id, source]]),
+			resolutions: /* @__PURE__ */ new Map()
+		});
+		const found = [];
+		walkAst(candidate.programOf(id), (node) => {
+			if (node.type !== "ImportDeclaration" && node.type !== "ExportNamedDeclaration" && node.type !== "ExportAllDeclaration" && node.type !== "ImportExpression") {
+				return;
+			}
+			const sourceNode = childNode(node, "source");
+			if (sourceNode && typeof sourceNode.value === "string") {
+				found.push({
+					start: node.start,
+					specifier: sourceNode.value
+				});
+			}
+		});
+		return [...new Set(found.sort((left, right) => left.start - right.start).map(({ specifier }) => specifier))];
+	}
+};
+function parseModuleAst(source, id = "/tamagui/compiler-module.tsx") {
+	const candidate = yukuFactory.create({
+		files: /* @__PURE__ */ new Map([[id, source]]),
+		resolutions: /* @__PURE__ */ new Map()
+	});
+	const diagnostics = candidate.diagnostics().filter((diagnostic) => diagnostic.kind === "parse");
+	if (diagnostics.length) {
+		throw new Error(`Unable to parse ${id}: ${diagnostics.map(({ message }) => message).join("; ")}`);
+	}
+	return candidate.programOf(id);
+}
+
+export { parseModuleAst, yukuFactory };
+//# sourceMappingURL=yuku.mjs.map

package/dist/esm/yuku.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"yuku.js","names":["#analyzer","#parseCounts","#module","#canonicalSymbol"],"sources":["esm/yuku.js"],"sourcesContent":["import { Analyzer } from \"yuku-analyzer\";\nimport { resolveFromHost, resolvedModuleId } from \"./contracts\";\nimport { childNode, walkAst } from \"./ast\";\nimport { asAstNode, declarationForName, definitionFromDeclaration } from \"./normalize\";\nclass YukuCandidate {\n  constructor(project) {\n    this.project = project;\n    this.#analyzer = new Analyzer({\n      resolve: (specifier, importer) => resolveFromHost(this.project.resolutions, specifier, importer)\n    });\n    for (const [id, source] of project.files) this.addFile(id, source);\n  }\n  project;\n  name = \"yuku\";\n  #analyzer;\n  #parseCounts = /* @__PURE__ */ new Map();\n  addFile(id, source) {\n    this.#analyzer.addFile(id, source, { preserveParens: true, sourceType: \"module\" });\n    this.#parseCounts.set(id, (this.#parseCounts.get(id) ?? 0) + 1);\n  }\n  removeFile(id) {\n    return this.#analyzer.removeFile(id);\n  }\n  link() {\n    this.#analyzer.link();\n  }\n  #module(id) {\n    const module = this.#analyzer.module(id);\n    if (!module) throw new Error(`yuku: unknown module ${id}`);\n    return module;\n  }\n  #canonicalSymbol(id, localName) {\n    const symbol = this.#module(id).resolve(localName);\n    return symbol ? this.#analyzer.definitionOf(symbol)?.symbol ?? null : null;\n  }\n  definitionOf(id, localName) {\n    const symbol = this.#canonicalSymbol(id, localName);\n    if (!symbol) return null;\n    const declaration = symbol.declarations[0];\n    if (!declaration) return null;\n    const program = asAstNode(symbol.module.ast, `${symbol.module.path} program`);\n    const normalizedDeclaration = declarationForName(program, symbol.name) ?? asAstNode(declaration, `${symbol.name} declaration`);\n    return definitionFromDeclaration(\n      symbol.module.path,\n      symbol.name,\n      program,\n      normalizedDeclaration\n    );\n  }\n  referencesOf(definition) {\n    const symbol = this.#canonicalSymbol(definition.id, definition.name);\n    if (!symbol) return [];\n    return this.#analyzer.referencesOf(symbol).map(({ module, reference }) => ({\n      id: resolvedModuleId(module.path),\n      name: reference.name,\n      start: reference.node.start,\n      end: reference.node.end\n    }));\n  }\n  dependenciesOf(id) {\n    return this.#module(id).dependencies.map((module) => module.path).sort();\n  }\n  dependentsOf(id) {\n    return this.#module(id).dependents.map((module) => module.path).sort();\n  }\n  affectedBy(id) {\n    const affected = /* @__PURE__ */ new Set([id]);\n    const queue = [id];\n    while (queue.length) {\n      const current = queue.shift();\n      for (const dependent of this.dependentsOf(current)) {\n        if (!affected.has(dependent)) {\n          affected.add(dependent);\n          queue.push(dependent);\n        }\n      }\n    }\n    return [...affected].sort();\n  }\n  programOf(id) {\n    return asAstNode(this.#module(id).ast, `${id} program`);\n  }\n  sourceOf(id) {\n    return this.#module(id).source;\n  }\n  parseCount(id) {\n    return this.#parseCounts.get(id) ?? 0;\n  }\n  diagnostics() {\n    const parseDiagnostics = [...this.#analyzer.modules.values()].flatMap(\n      (module) => module.diagnostics.map((diagnostic) => ({\n        kind: \"parse\",\n        id: resolvedModuleId(module.path),\n        message: diagnostic.message\n      }))\n    );\n    return [\n      ...parseDiagnostics,\n      ...this.#analyzer.diagnostics.map((diagnostic) => ({\n        kind: \"link\",\n        id: resolvedModuleId(diagnostic.module),\n        message: diagnostic.message\n      }))\n    ];\n  }\n}\nconst yukuFactory = {\n  name: \"yuku\",\n  create: (project) => new YukuCandidate(project),\n  scanImports(id, source) {\n    const candidate = new YukuCandidate({\n      files: /* @__PURE__ */ new Map([[id, source]]),\n      resolutions: /* @__PURE__ */ new Map()\n    });\n    const found = [];\n    walkAst(candidate.programOf(id), (node) => {\n      if (node.type !== \"ImportDeclaration\" && node.type !== \"ExportNamedDeclaration\" && node.type !== \"ExportAllDeclaration\" && node.type !== \"ImportExpression\") {\n        return;\n      }\n      const sourceNode = childNode(node, \"source\");\n      if (sourceNode && typeof sourceNode.value === \"string\") {\n        found.push({ start: node.start, specifier: sourceNode.value });\n      }\n    });\n    return [\n      ...new Set(\n        found.sort((left, right) => left.start - right.start).map(({ specifier }) => specifier)\n      )\n    ];\n  }\n};\nfunction parseModuleAst(source, id = \"/tamagui/compiler-module.tsx\") {\n  const candidate = yukuFactory.create({\n    files: /* @__PURE__ */ new Map([[id, source]]),\n    resolutions: /* @__PURE__ */ new Map()\n  });\n  const diagnostics = candidate.diagnostics().filter((diagnostic) => diagnostic.kind === \"parse\");\n  if (diagnostics.length) {\n    throw new Error(\n      `Unable to parse ${id}: ${diagnostics.map(({ message }) => message).join(\"; \")}`\n    );\n  }\n  return candidate.programOf(id);\n}\nexport {\n  parseModuleAst,\n  yukuFactory\n};\n//# sourceMappingURL=yuku.js.map\n"],"mappings":";;;;;;AAIA,IAAM,gBAAN,MAAoB;CAClB,YAAY,SAAS;EACnB,KAAK,UAAU;EACf,KAAKA,YAAY,IAAI,SAAS,EAC5B,UAAU,WAAW,aAAa,gBAAgB,KAAK,QAAQ,aAAa,WAAW,QAAQ,EACjG,CAAC;EACD,KAAK,MAAM,CAAC,IAAI,WAAW,QAAQ,OAAO,KAAK,QAAQ,IAAI,MAAM;CACnE;CACA;CACA,OAAO;CACP;CACA,+BAA+B,IAAI,IAAI;CACvC,QAAQ,IAAI,QAAQ;EAClB,KAAKA,UAAU,QAAQ,IAAI,QAAQ;GAAE,gBAAgB;GAAM,YAAY;EAAS,CAAC;EACjF,KAAKC,aAAa,IAAI,KAAK,KAAKA,aAAa,IAAI,EAAE,KAAK,KAAK,CAAC;CAChE;CACA,WAAW,IAAI;EACb,OAAO,KAAKD,UAAU,WAAW,EAAE;CACrC;CACA,OAAO;EACL,KAAKA,UAAU,KAAK;CACtB;CACA,QAAQ,IAAI;EACV,MAAM,SAAS,KAAKA,UAAU,OAAO,EAAE;EACvC,IAAI,CAAC,QAAQ,MAAM,IAAI,MAAM,wBAAwB,IAAI;EACzD,OAAO;CACT;CACA,iBAAiB,IAAI,WAAW;EAC9B,MAAM,SAAS,KAAKE,QAAQ,EAAE,EAAE,QAAQ,SAAS;EACjD,OAAO,SAAS,KAAKF,UAAU,aAAa,MAAM,GAAG,UAAU,OAAO;CACxE;CACA,aAAa,IAAI,WAAW;EAC1B,MAAM,SAAS,KAAKG,iBAAiB,IAAI,SAAS;EAClD,IAAI,CAAC,QAAQ,OAAO;EACpB,MAAM,cAAc,OAAO,aAAa;EACxC,IAAI,CAAC,aAAa,OAAO;EACzB,MAAM,UAAU,UAAU,OAAO,OAAO,KAAK,GAAG,OAAO,OAAO,KAAK,SAAS;EAC5E,MAAM,wBAAwB,mBAAmB,SAAS,OAAO,IAAI,KAAK,UAAU,aAAa,GAAG,OAAO,KAAK,aAAa;EAC7H,OAAO,0BACL,OAAO,OAAO,MACd,OAAO,MACP,SACA,qBACF;CACF;CACA,aAAa,YAAY;EACvB,MAAM,SAAS,KAAKA,iBAAiB,WAAW,IAAI,WAAW,IAAI;EACnE,IAAI,CAAC,QAAQ,OAAO,CAAC;EACrB,OAAO,KAAKH,UAAU,aAAa,MAAM,EAAE,KAAK,EAAE,QAAQ,iBAAiB;GACzE,IAAI,iBAAiB,OAAO,IAAI;GAChC,MAAM,UAAU;GAChB,OAAO,UAAU,KAAK;GACtB,KAAK,UAAU,KAAK;EACtB,EAAE;CACJ;CACA,eAAe,IAAI;EACjB,OAAO,KAAKE,QAAQ,EAAE,EAAE,aAAa,KAAK,WAAW,OAAO,IAAI,EAAE,KAAK;CACzE;CACA,aAAa,IAAI;EACf,OAAO,KAAKA,QAAQ,EAAE,EAAE,WAAW,KAAK,WAAW,OAAO,IAAI,EAAE,KAAK;CACvE;CACA,WAAW,IAAI;EACb,MAAM,2BAA2B,IAAI,IAAI,CAAC,EAAE,CAAC;EAC7C,MAAM,QAAQ,CAAC,EAAE;EACjB,OAAO,MAAM,QAAQ;GACnB,MAAM,UAAU,MAAM,MAAM;GAC5B,KAAK,MAAM,aAAa,KAAK,aAAa,OAAO,GAAG;IAClD,IAAI,CAAC,SAAS,IAAI,SAAS,GAAG;KAC5B,SAAS,IAAI,SAAS;KACtB,MAAM,KAAK,SAAS;IACtB;GACF;EACF;EACA,OAAO,CAAC,GAAG,QAAQ,EAAE,KAAK;CAC5B;CACA,UAAU,IAAI;EACZ,OAAO,UAAU,KAAKA,QAAQ,EAAE,EAAE,KAAK,GAAG,GAAG,SAAS;CACxD;CACA,SAAS,IAAI;EACX,OAAO,KAAKA,QAAQ,EAAE,EAAE;CAC1B;CACA,WAAW,IAAI;EACb,OAAO,KAAKD,aAAa,IAAI,EAAE,KAAK;CACtC;CACA,cAAc;EACZ,MAAM,mBAAmB,CAAC,GAAG,KAAKD,UAAU,QAAQ,OAAO,CAAC,EAAE,SAC3D,WAAW,OAAO,YAAY,KAAK,gBAAgB;GAClD,MAAM;GACN,IAAI,iBAAiB,OAAO,IAAI;GAChC,SAAS,WAAW;EACtB,EAAE,CACJ;EACA,OAAO,CACL,GAAG,kBACH,GAAG,KAAKA,UAAU,YAAY,KAAK,gBAAgB;GACjD,MAAM;GACN,IAAI,iBAAiB,WAAW,MAAM;GACtC,SAAS,WAAW;EACtB,EAAE,CACJ;CACF;AACF;AACA,MAAM,cAAc;CAClB,MAAM;CACN,SAAS,YAAY,IAAI,cAAc,OAAO;CAC9C,YAAY,IAAI,QAAQ;EACtB,MAAM,YAAY,IAAI,cAAc;GAClC,uBAAuB,IAAI,IAAI,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC;GAC7C,6BAA6B,IAAI,IAAI;EACvC,CAAC;EACD,MAAM,QAAQ,CAAC;EACf,QAAQ,UAAU,UAAU,EAAE,IAAI,SAAS;GACzC,IAAI,KAAK,SAAS,uBAAuB,KAAK,SAAS,4BAA4B,KAAK,SAAS,0BAA0B,KAAK,SAAS,oBAAoB;IAC3J;GACF;GACA,MAAM,aAAa,UAAU,MAAM,QAAQ;GAC3C,IAAI,cAAc,OAAO,WAAW,UAAU,UAAU;IACtD,MAAM,KAAK;KAAE,OAAO,KAAK;KAAO,WAAW,WAAW;IAAM,CAAC;GAC/D;EACF,CAAC;EACD,OAAO,CACL,GAAG,IAAI,IACL,MAAM,MAAM,MAAM,UAAU,KAAK,QAAQ,MAAM,KAAK,EAAE,KAAK,EAAE,gBAAgB,SAAS,CACxF,CACF;CACF;AACF;AACA,SAAS,eAAe,QAAQ,KAAK,gCAAgC;CACnE,MAAM,YAAY,YAAY,OAAO;EACnC,uBAAuB,IAAI,IAAI,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC;EAC7C,6BAA6B,IAAI,IAAI;CACvC,CAAC;CACD,MAAM,cAAc,UAAU,YAAY,EAAE,QAAQ,eAAe,WAAW,SAAS,OAAO;CAC9F,IAAI,YAAY,QAAQ;EACtB,MAAM,IAAI,MACR,mBAAmB,GAAG,IAAI,YAAY,KAAK,EAAE,cAAc,OAAO,EAAE,KAAK,IAAI,GAC/E;CACF;CACA,OAAO,UAAU,UAAU,EAAE;AAC/B"}