@tekmidian/pai 0.5.7 → 0.6.0

package/dist/zettelkasten-e-a4rW_6.mjs

@@ -1,901 +0,0 @@
-import { a as generateEmbedding, n as cosineSimilarity, r as deserializeEmbedding } from "./embeddings-DGRAPAYb.mjs";
-import { i as searchMemoryHybrid } from "./search-_oHfguA5.mjs";
-import { basename, dirname } from "node:path";
-
-//#region src/zettelkasten/explore.ts
-function classifyEdge(source, target) {
-	return dirname(source) === dirname(target) ? "sequential" : "associative";
-}
-function resolveStart(db, startNote) {
-	const inFiles = db.prepare("SELECT vault_path FROM vault_files WHERE vault_path = ?").get(startNote);
-	if (inFiles) return inFiles.vault_path;
-	const alias = db.prepare("SELECT canonical_path FROM vault_aliases WHERE vault_path = ?").get(startNote);
-	if (!alias) return null;
-	const canonical = db.prepare("SELECT vault_path FROM vault_files WHERE vault_path = ?").get(alias.canonical_path);
-	return canonical ? canonical.vault_path : null;
-}
-function getForwardNeighbors(db, path) {
-	return db.prepare("SELECT target_path FROM vault_links WHERE source_path = ? AND target_path IS NOT NULL").all(path).map((r) => r.target_path);
-}
-function getBackwardNeighbors(db, path) {
-	return db.prepare("SELECT source_path FROM vault_links WHERE target_path = ?").all(path).map((r) => r.source_path);
-}
-function getFileInfo(db, path) {
-	const file = db.prepare("SELECT title FROM vault_files WHERE vault_path = ?").get(path);
-	const health = db.prepare("SELECT inbound_count, outbound_count FROM vault_health WHERE vault_path = ?").get(path);
-	return {
-		title: file?.title ?? null,
-		inbound: health?.inbound_count ?? 0,
-		outbound: health?.outbound_count ?? 0
-	};
-}
-/**
-* Traverse the Zettelkasten link graph using BFS, following chains of thought
-* from a starting note up to a configurable depth.
-*/
-function zettelExplore(db, opts) {
-	const depth = Math.min(Math.max(opts.depth ?? 3, 1), 10);
-	const direction = opts.direction ?? "both";
-	const mode = opts.mode ?? "all";
-	const root = resolveStart(db, opts.startNote);
-	if (!root) return {
-		root: opts.startNote,
-		nodes: [],
-		edges: [],
-		branchingPoints: [],
-		maxDepthReached: false
-	};
-	const visited = new Set([root]);
-	const nodes = [];
-	const edges = [];
-	let maxDepthReached = false;
-	const queue = [{
-		path: root,
-		depth: 0
-	}];
-	while (queue.length > 0) {
-		const current = queue.shift();
-		if (current.depth >= depth) {
-			maxDepthReached = true;
-			continue;
-		}
-		const neighbors = [];
-		if (direction === "forward" || direction === "both") for (const n of getForwardNeighbors(db, current.path)) neighbors.push({
-			neighbor: n,
-			from: current.path,
-			to: n
-		});
-		if (direction === "backward" || direction === "both") for (const n of getBackwardNeighbors(db, current.path)) neighbors.push({
-			neighbor: n,
-			from: n,
-			to: current.path
-		});
-		for (const { neighbor, from, to } of neighbors) {
-			const edgeType = classifyEdge(from, to);
-			if (mode !== "all" && edgeType !== mode) continue;
-			`${from}${to}`;
-			if (!edges.some((e) => e.from === from && e.to === to)) edges.push({
-				from,
-				to,
-				type: edgeType
-			});
-			if (!visited.has(neighbor)) {
-				visited.add(neighbor);
-				const info = getFileInfo(db, neighbor);
-				nodes.push({
-					path: neighbor,
-					title: info.title,
-					depth: current.depth + 1,
-					linkType: edgeType,
-					inbound: info.inbound,
-					outbound: info.outbound
-				});
-				queue.push({
-					path: neighbor,
-					depth: current.depth + 1
-				});
-			}
-		}
-	}
-	const branchingPoints = nodes.filter((n) => n.outbound > 2).map((n) => n.path);
-	if (getFileInfo(db, root).outbound > 2) branchingPoints.unshift(root);
-	return {
-		root,
-		nodes,
-		edges,
-		branchingPoints,
-		maxDepthReached
-	};
-}
-
-//#endregion
-//#region src/zettelkasten/surprise.ts
-const MAX_CHUNKS$2 = 5e3;
-const BFS_HOP_CAP = 20;
-function getFileEmbeddings(db, projectId) {
-	const rows = db.prepare(`SELECT path, embedding, text FROM memory_chunks
-       WHERE project_id = ? AND embedding IS NOT NULL
-       ORDER BY path, start_line
-       LIMIT ?`).all(projectId, MAX_CHUNKS$2);
-	const byPath = /* @__PURE__ */ new Map();
-	for (const row of rows) {
-		const vec = deserializeEmbedding(row.embedding);
-		const entry = byPath.get(row.path);
-		if (!entry) byPath.set(row.path, {
-			sum: new Float32Array(vec),
-			count: 1,
-			text: row.text
-		});
-		else {
-			for (let i = 0; i < vec.length; i++) entry.sum[i] += vec[i];
-			entry.count++;
-		}
-	}
-	const result = /* @__PURE__ */ new Map();
-	for (const [path, { sum, count, text }] of byPath) {
-		const avg = new Float32Array(sum.length);
-		for (let i = 0; i < sum.length; i++) avg[i] = sum[i] / count;
-		result.set(path, {
-			embedding: avg,
-			text
-		});
-	}
-	return result;
-}
-function getReferenceEmbedding(db, projectId, path) {
-	const rows = db.prepare(`SELECT embedding FROM memory_chunks
-       WHERE project_id = ? AND path = ? AND embedding IS NOT NULL`).all(projectId, path);
-	if (rows.length === 0) return {
-		embedding: new Float32Array(0),
-		found: false
-	};
-	const dim = deserializeEmbedding(rows[0].embedding).length;
-	const sum = new Float32Array(dim);
-	for (const row of rows) {
-		const vec = deserializeEmbedding(row.embedding);
-		for (let i = 0; i < dim; i++) sum[i] += vec[i];
-	}
-	const avg = new Float32Array(dim);
-	for (let i = 0; i < dim; i++) avg[i] = sum[i] / rows.length;
-	return {
-		embedding: avg,
-		found: true
-	};
-}
-function bfsGraphDistance(db, source, target) {
-	if (source === target) return 0;
-	const visited = new Set([source]);
-	const queue = [{
-		path: source,
-		hops: 0
-	}];
-	while (queue.length > 0) {
-		const { path, hops } = queue.shift();
-		if (hops >= BFS_HOP_CAP) continue;
-		const neighbors = db.prepare(`SELECT target_path AS neighbor FROM vault_links
-         WHERE source_path = ? AND target_path IS NOT NULL
-         UNION
-         SELECT source_path AS neighbor FROM vault_links
-         WHERE target_path = ?`).all(path, path);
-		for (const { neighbor } of neighbors) {
-			if (neighbor === target) return hops + 1;
-			if (!visited.has(neighbor)) {
-				visited.add(neighbor);
-				queue.push({
-					path: neighbor,
-					hops: hops + 1
-				});
-			}
-		}
-	}
-	return Infinity;
-}
-function getBestChunkText(db, projectId, path, refEmbedding) {
-	const rows = db.prepare(`SELECT text, embedding FROM memory_chunks
-       WHERE project_id = ? AND path = ? AND embedding IS NOT NULL
-       LIMIT 20`).all(projectId, path);
-	if (rows.length === 0) return "";
-	let bestText = rows[0].text;
-	let bestSim = -Infinity;
-	for (const row of rows) {
-		const sim = cosineSimilarity(refEmbedding, deserializeEmbedding(row.embedding));
-		if (sim > bestSim) {
-			bestSim = sim;
-			bestText = row.text;
-		}
-	}
-	return bestText.trim().slice(0, 200);
-}
-/**
-* Find notes that are semantically similar to a reference note but graph-distant —
-* revealing surprising conceptual connections across unrelated areas of the Zettelkasten.
-*/
-async function zettelSurprise(db, opts) {
-	const limit = opts.limit ?? 10;
-	const minSimilarity = opts.minSimilarity ?? .3;
-	const minGraphDistance = opts.minGraphDistance ?? 3;
-	let { embedding: refEmbedding, found } = getReferenceEmbedding(db, opts.vaultProjectId, opts.referencePath);
-	if (!found) refEmbedding = await generateEmbedding(db.prepare("SELECT title FROM vault_files WHERE vault_path = ?").get(opts.referencePath)?.title ?? opts.referencePath, true);
-	const allFileEmbeddings = getFileEmbeddings(db, opts.vaultProjectId);
-	allFileEmbeddings.delete(opts.referencePath);
-	const semanticCandidates = [];
-	for (const [path, { embedding }] of allFileEmbeddings) {
-		const sim = cosineSimilarity(refEmbedding, embedding);
-		if (sim >= minSimilarity) semanticCandidates.push({
-			path,
-			sim
-		});
-	}
-	const results = [];
-	for (const { path, sim } of semanticCandidates) {
-		const graphDistance = bfsGraphDistance(db, opts.referencePath, path);
-		const effectiveDistance = isFinite(graphDistance) ? graphDistance : BFS_HOP_CAP;
-		if (effectiveDistance < minGraphDistance) continue;
-		const file = db.prepare("SELECT title FROM vault_files WHERE vault_path = ?").get(path);
-		const surpriseScore = sim * Math.log2(effectiveDistance + 1);
-		const sharedSnippet = getBestChunkText(db, opts.vaultProjectId, path, refEmbedding);
-		results.push({
-			path,
-			title: file?.title ?? null,
-			cosineSimilarity: sim,
-			graphDistance: isFinite(graphDistance) ? graphDistance : Infinity,
-			surpriseScore,
-			sharedSnippet
-		});
-	}
-	results.sort((a, b) => b.surpriseScore - a.surpriseScore);
-	return results.slice(0, limit);
-}
-
-//#endregion
-//#region src/zettelkasten/converse.ts
-/** Extract the top-level folder from a vault path (first path segment). */
-function extractDomain(vaultPath) {
-	const slash = vaultPath.indexOf("/");
-	return slash === -1 ? vaultPath : vaultPath.slice(0, slash);
-}
-/**
-* Expand one level of graph neighbors for a set of paths.
-* Returns all outbound and inbound neighbor paths (excluding already-visited).
-*/
-function expandNeighbors(db, paths) {
-	if (paths.size === 0) return [];
-	const placeholders = Array.from(paths).map(() => "?").join(", ");
-	const pathList = Array.from(paths);
-	const forward = db.prepare(`SELECT DISTINCT target_path FROM vault_links WHERE source_path IN (${placeholders}) AND target_path IS NOT NULL`).all(...pathList);
-	const backward = db.prepare(`SELECT DISTINCT source_path FROM vault_links WHERE target_path IN (${placeholders})`).all(...pathList);
-	const neighbors = [];
-	for (const r of forward) neighbors.push(r.target_path);
-	for (const r of backward) neighbors.push(r.source_path);
-	return neighbors;
-}
-/**
-* Look up the title for a single vault path.
-* Returns null when the path is not found in vault_files.
-*/
-function getTitle(db, path) {
-	return db.prepare("SELECT title FROM vault_files WHERE vault_path = ?").get(path)?.title ?? null;
-}
-/**
-* Count inbound links for a path from vault_health.
-* Used as a tiebreaker when trimming neighbor-only notes.
-*/
-function getInboundCount(db, path) {
-	return db.prepare("SELECT inbound_count FROM vault_health WHERE vault_path = ?").get(path)?.inbound_count ?? 0;
-}
-/**
-* Let the vault "talk back" — find notes relevant to a question, expand
-* through the link graph, identify cross-domain connections, and return a
-* structured result including a synthesis prompt for an AI to generate insights.
-*/
-async function zettelConverse(db, opts) {
-	const depth = Math.max(opts.depth ?? 2, 0);
-	const limit = Math.max(opts.limit ?? 15, 1);
-	const candidateLimit = 20;
-	const queryEmbedding = await generateEmbedding(opts.question, true);
-	const searchResults = searchMemoryHybrid(db, opts.question, queryEmbedding, {
-		projectIds: [opts.vaultProjectId],
-		maxResults: candidateLimit
-	});
-	const searchHits = /* @__PURE__ */ new Map();
-	for (const r of searchResults) {
-		const existing = searchHits.get(r.path);
-		if (!existing || r.score > existing.score) searchHits.set(r.path, {
-			score: r.score,
-			snippet: r.snippet
-		});
-	}
-	const allPaths = new Set(searchHits.keys());
-	let frontier = new Set(searchHits.keys());
-	for (let d = 0; d < depth; d++) {
-		const neighbors = expandNeighbors(db, frontier);
-		const newFrontier = /* @__PURE__ */ new Set();
-		for (const n of neighbors) if (!allPaths.has(n)) {
-			allPaths.add(n);
-			newFrontier.add(n);
-		}
-		if (newFrontier.size === 0) break;
-		frontier = newFrontier;
-	}
-	const searchRanked = Array.from(searchHits.entries()).sort((a, b) => b[1].score - a[1].score).map(([path, info]) => ({
-		path,
-		...info,
-		isSearchResult: true
-	}));
-	const neighborRanked = Array.from(allPaths).filter((p) => !searchHits.has(p)).map((path) => ({
-		path,
-		score: 0,
-		snippet: "",
-		inbound: getInboundCount(db, path),
-		isSearchResult: false
-	})).sort((a, b) => b.inbound - a.inbound);
-	const budgetForNeighbors = Math.max(limit - searchRanked.length, 0);
-	const selectedNeighbors = neighborRanked.slice(0, budgetForNeighbors);
-	const selectedSearchPaths = searchRanked.slice(0, limit);
-	const selectedPaths = new Set([...selectedSearchPaths.map((r) => r.path), ...selectedNeighbors.map((r) => r.path)]);
-	const relevantNotes = [];
-	for (const r of selectedSearchPaths) {
-		if (!selectedPaths.has(r.path)) continue;
-		relevantNotes.push({
-			path: r.path,
-			title: getTitle(db, r.path),
-			snippet: r.snippet,
-			score: r.score,
-			domain: extractDomain(r.path)
-		});
-	}
-	for (const r of selectedNeighbors) relevantNotes.push({
-		path: r.path,
-		title: getTitle(db, r.path),
-		snippet: r.snippet,
-		score: 0,
-		domain: extractDomain(r.path)
-	});
-	let connections = [];
-	if (selectedPaths.size > 0) {
-		const pathList = Array.from(selectedPaths);
-		const placeholders = pathList.map(() => "?").join(", ");
-		const edgeRows = db.prepare(`SELECT source_path, target_path, COUNT(*) AS cnt
-         FROM vault_links
-         WHERE source_path IN (${placeholders})
-           AND target_path IN (${placeholders})
-         GROUP BY source_path, target_path`).all(...pathList, ...pathList);
-		for (const row of edgeRows) connections.push({
-			fromPath: row.source_path,
-			toPath: row.target_path,
-			fromDomain: extractDomain(row.source_path),
-			toDomain: extractDomain(row.target_path),
-			strength: row.cnt
-		});
-	}
-	const domainSet = new Set(relevantNotes.map((n) => n.domain));
-	const domains = Array.from(domainSet).sort();
-	const crossDomainConnections = connections.filter((c) => c.fromDomain !== c.toDomain);
-	const notesSummary = relevantNotes.map((n, i) => {
-		const title = n.title ? `"${n.title}"` : "(untitled)";
-		const domain = n.domain;
-		const scoreLabel = n.score > 0 ? ` [relevance: ${n.score.toFixed(3)}]` : " [context]";
-		const snippet = n.snippet.trim().slice(0, 300);
-		return `${i + 1}. [${domain}] ${title}${scoreLabel}\n   Path: ${n.path}\n   "${snippet}"`;
-	}).join("\n\n");
-	const connectionSummary = crossDomainConnections.length > 0 ? crossDomainConnections.map((c) => `- "${c.fromPath}" (${c.fromDomain}) → "${c.toPath}" (${c.toDomain}) [strength: ${c.strength}]`).join("\n") : "(no cross-domain connections found)";
-	const domainList = domains.join(", ");
-	return {
-		relevantNotes,
-		connections: crossDomainConnections,
-		domains,
-		synthesisPrompt: `You are a Zettelkasten research assistant. The vault has surfaced the following notes in response to this question:
-
-QUESTION: ${opts.question}
-
----
-
-RELEVANT NOTES (${relevantNotes.length} notes across ${domains.length} domain(s): ${domainList}):
-
-${notesSummary}
-
----
-
-CROSS-DOMAIN CONNECTIONS (links bridging different knowledge areas):
-
-${connectionSummary}
-
----
-
-SYNTHESIS TASK:
-
-Based on these notes and the connections between them, please:
-
-1. Identify the key insights that emerge in direct response to the question.
-2. Highlight any unexpected connections between notes from different domains (${domainList}).
-3. Point out tensions, contradictions, or open questions the vault raises but does not resolve.
-4. Suggest what is notably absent — what the vault does NOT yet contain that would strengthen the understanding of this topic.
-5. Propose 2-3 new notes that would meaningfully extend this knowledge cluster.
-
-Think like a scholar who has deeply internalized these ideas and is now synthesizing them for the first time.`
-	};
-}
-
-//#endregion
-//#region src/zettelkasten/themes.ts
-const MAX_CHUNKS$1 = 5e3;
-const STOP_WORDS = new Set([
-	"a",
-	"an",
-	"the",
-	"and",
-	"or",
-	"but",
-	"in",
-	"on",
-	"at",
-	"to",
-	"for",
-	"of",
-	"with",
-	"by",
-	"from",
-	"is",
-	"it",
-	"as",
-	"be",
-	"was",
-	"are",
-	"has",
-	"had",
-	"have",
-	"not",
-	"this",
-	"that",
-	"i",
-	"my",
-	"we",
-	"our",
-	"new",
-	"note",
-	"untitled",
-	"page",
-	"file",
-	"doc"
-]);
-function getTopFolder(vaultPath) {
-	const parts = vaultPath.split("/");
-	return parts.length > 1 ? parts[0] : "";
-}
-function generateLabel(titles) {
-	const wordCounts = /* @__PURE__ */ new Map();
-	for (const title of titles) {
-		if (!title) continue;
-		const words = title.toLowerCase().replace(/[^a-z0-9\s]/g, " ").split(/\s+/).filter((w) => w.length > 2 && !STOP_WORDS.has(w));
-		for (const word of words) wordCounts.set(word, (wordCounts.get(word) ?? 0) + 1);
-	}
-	return [...wordCounts.entries()].sort((a, b) => b[1] - a[1]).slice(0, 3).map(([w]) => w).join(" / ");
-}
-function computeLinkedRatio(db, paths) {
-	if (paths.length < 2) return 0;
-	const totalPairs = paths.length * (paths.length - 1) / 2;
-	const pathSet = new Set(paths);
-	let linkedPairs = 0;
-	for (const path of paths) {
-		const rows = db.prepare(`SELECT target_path FROM vault_links
-         WHERE source_path = ? AND target_path IS NOT NULL`).all(path);
-		for (const { target_path } of rows) if (pathSet.has(target_path)) linkedPairs++;
-	}
-	const uniquePairs = linkedPairs / 2;
-	return Math.min(1, uniquePairs / totalPairs);
-}
-function averageEmbeddings(embeddings) {
-	if (embeddings.length === 0) return new Float32Array(0);
-	const dim = embeddings[0].length;
-	const sum = new Float32Array(dim);
-	for (const vec of embeddings) for (let i = 0; i < dim; i++) sum[i] += vec[i];
-	const avg = new Float32Array(dim);
-	for (let i = 0; i < dim; i++) avg[i] = sum[i] / embeddings.length;
-	return avg;
-}
-/**
-* Detect emerging themes in recently-modified notes using agglomerative single-linkage
-* clustering of note-level embeddings.
-*/
-async function zettelThemes(db, opts) {
-	const lookbackDays = opts.lookbackDays ?? 30;
-	const minClusterSize = opts.minClusterSize ?? 3;
-	const maxThemes = opts.maxThemes ?? 10;
-	const similarityThreshold = opts.similarityThreshold ?? .65;
-	const now = Date.now();
-	const from = now - lookbackDays * 864e5;
-	const recentNotes = db.prepare(`SELECT vault_path, title, indexed_at FROM vault_files WHERE indexed_at > ?`).all(from);
-	const chunkRows = db.prepare(`SELECT path, embedding FROM memory_chunks
-       WHERE project_id = ? AND embedding IS NOT NULL
-       ORDER BY path, start_line
-       LIMIT ?`).all(opts.vaultProjectId, MAX_CHUNKS$1);
-	const embeddingsByPath = /* @__PURE__ */ new Map();
-	for (const row of chunkRows) {
-		const vec = deserializeEmbedding(row.embedding);
-		const arr = embeddingsByPath.get(row.path);
-		if (!arr) embeddingsByPath.set(row.path, [vec]);
-		else arr.push(vec);
-	}
-	const fileEmbeddings = /* @__PURE__ */ new Map();
-	for (const [path, vecs] of embeddingsByPath) fileEmbeddings.set(path, averageEmbeddings(vecs));
-	const clusters = [];
-	for (const note of recentNotes) {
-		const embedding = fileEmbeddings.get(note.vault_path);
-		if (!embedding) continue;
-		clusters.push({
-			paths: [note.vault_path],
-			titles: [note.title],
-			indexedAts: [note.indexed_at],
-			centroid: embedding
-		});
-	}
-	const totalNotesAnalyzed = clusters.length;
-	let merged = true;
-	while (merged && clusters.length > 1) {
-		merged = false;
-		let bestSim = similarityThreshold;
-		let bestI = -1;
-		let bestJ = -1;
-		for (let i = 0; i < clusters.length; i++) for (let j = i + 1; j < clusters.length; j++) {
-			const sim = cosineSimilarity(clusters[i].centroid, clusters[j].centroid);
-			if (sim > bestSim) {
-				bestSim = sim;
-				bestI = i;
-				bestJ = j;
-			}
-		}
-		if (bestI === -1) break;
-		const ci = clusters[bestI];
-		const cj = clusters[bestJ];
-		const mergedPaths = [...ci.paths, ...cj.paths];
-		const mergedTitles = [...ci.titles, ...cj.titles];
-		const mergedIndexedAts = [...ci.indexedAts, ...cj.indexedAts];
-		const memberEmbeddings = [];
-		for (const p of mergedPaths) {
-			const emb = fileEmbeddings.get(p);
-			if (emb) memberEmbeddings.push(emb);
-		}
-		clusters[bestI] = {
-			paths: mergedPaths,
-			titles: mergedTitles,
-			indexedAts: mergedIndexedAts,
-			centroid: averageEmbeddings(memberEmbeddings)
-		};
-		clusters.splice(bestJ, 1);
-		merged = true;
-	}
-	const themes = [];
-	let clusterIndex = 0;
-	for (const cluster of clusters) {
-		if (cluster.paths.length < minClusterSize) continue;
-		const label = generateLabel(cluster.titles) || `Theme ${clusterIndex + 1}`;
-		const avgRecency = cluster.indexedAts.reduce((sum, t) => sum + t, 0) / cluster.indexedAts.length;
-		const folderDiversity = new Set(cluster.paths.map(getTopFolder)).size / cluster.paths.length;
-		const linkedRatio = computeLinkedRatio(db, cluster.paths);
-		const suggestIndexNote = linkedRatio < .3 && cluster.paths.length >= 5;
-		themes.push({
-			id: clusterIndex++,
-			label,
-			notes: cluster.paths.map((path, idx) => ({
-				path,
-				title: cluster.titles[idx]
-			})),
-			size: cluster.paths.length,
-			folderDiversity,
-			avgRecency,
-			linkedRatio,
-			suggestIndexNote
-		});
-	}
-	themes.sort((a, b) => b.size * b.folderDiversity * (b.avgRecency / now) - a.size * a.folderDiversity * (a.avgRecency / now));
-	return {
-		themes: themes.slice(0, maxThemes),
-		totalNotesAnalyzed,
-		timeWindow: {
-			from,
-			to: now
-		}
-	};
-}
-
-//#endregion
-//#region src/zettelkasten/health.ts
-function countComponents(nodes, edges) {
-	if (nodes.length === 0) return 0;
-	const parent = /* @__PURE__ */ new Map();
-	const rank = /* @__PURE__ */ new Map();
-	for (const n of nodes) {
-		parent.set(n, n);
-		rank.set(n, 0);
-	}
-	function find(x) {
-		let root = x;
-		while (parent.get(root) !== root) root = parent.get(root);
-		let current = x;
-		while (current !== root) {
-			const next = parent.get(current);
-			parent.set(current, root);
-			current = next;
-		}
-		return root;
-	}
-	function union(a, b) {
-		const ra = find(a);
-		const rb = find(b);
-		if (ra === rb) return;
-		const rankA = rank.get(ra) ?? 0;
-		const rankB = rank.get(rb) ?? 0;
-		if (rankA < rankB) parent.set(ra, rb);
-		else if (rankA > rankB) parent.set(rb, ra);
-		else {
-			parent.set(rb, ra);
-			rank.set(ra, rankA + 1);
-		}
-	}
-	for (const { source, target } of edges) if (parent.has(source) && parent.has(target)) union(source, target);
-	const roots = /* @__PURE__ */ new Set();
-	for (const n of nodes) roots.add(find(n));
-	return roots.size;
-}
-/**
-* Audit the structural health of the Zettelkasten vault using graph metrics.
-* Designed to complete in under 60ms for a full vault.
-*/
-function zettelHealth(db, opts) {
-	const options = opts ?? {};
-	const scope = options.scope ?? "full";
-	const include = options.include ?? [
-		"dead_links",
-		"orphans",
-		"disconnected",
-		"low_connectivity"
-	];
-	const computedAt = Date.now();
-	let totalFiles = 0;
-	if (scope === "full") totalFiles = db.prepare("SELECT COUNT(*) AS n FROM vault_files").get().n;
-	else if (scope === "project") {
-		const prefix = options.projectPath ?? "";
-		totalFiles = db.prepare("SELECT COUNT(*) AS n FROM vault_files WHERE vault_path LIKE ? || '%'").get(prefix).n;
-	} else {
-		const cutoff = computedAt - (options.recentDays ?? 30) * 864e5;
-		totalFiles = db.prepare("SELECT COUNT(*) AS n FROM vault_files WHERE indexed_at > ?").get(cutoff).n;
-	}
-	let totalLinks = 0;
-	if (scope === "full") totalLinks = db.prepare("SELECT COUNT(*) AS n FROM vault_links").get().n;
-	else if (scope === "project") {
-		const prefix = options.projectPath ?? "";
-		totalLinks = db.prepare("SELECT COUNT(*) AS n FROM vault_links WHERE source_path LIKE ? || '%'").get(prefix).n;
-	} else {
-		const cutoff = computedAt - (options.recentDays ?? 30) * 864e5;
-		totalLinks = db.prepare("SELECT COUNT(*) AS n FROM vault_links WHERE source_path IN (SELECT vault_path FROM vault_files WHERE indexed_at > ?)").get(cutoff).n;
-	}
-	let deadLinks = [];
-	if (include.includes("dead_links")) if (scope === "full") deadLinks = db.prepare("SELECT source_path, target_raw, line_number FROM vault_links WHERE target_path IS NULL").all().map((r) => ({
-		sourcePath: r.source_path,
-		targetRaw: r.target_raw,
-		lineNumber: r.line_number
-	}));
-	else if (scope === "project") {
-		const prefix = options.projectPath ?? "";
-		deadLinks = db.prepare("SELECT source_path, target_raw, line_number FROM vault_links WHERE target_path IS NULL AND source_path LIKE ? || '%'").all(prefix).map((r) => ({
-			sourcePath: r.source_path,
-			targetRaw: r.target_raw,
-			lineNumber: r.line_number
-		}));
-	} else {
-		const cutoff = computedAt - (options.recentDays ?? 30) * 864e5;
-		deadLinks = db.prepare("SELECT source_path, target_raw, line_number FROM vault_links WHERE target_path IS NULL AND source_path IN (SELECT vault_path FROM vault_files WHERE indexed_at > ?)").all(cutoff).map((r) => ({
-			sourcePath: r.source_path,
-			targetRaw: r.target_raw,
-			lineNumber: r.line_number
-		}));
-	}
-	let orphans = [];
-	if (include.includes("orphans")) if (scope === "full") orphans = db.prepare("SELECT vault_path FROM vault_health WHERE is_orphan = 1").all().map((r) => r.vault_path);
-	else if (scope === "project") {
-		const prefix = options.projectPath ?? "";
-		orphans = db.prepare("SELECT vault_path FROM vault_health WHERE is_orphan = 1 AND vault_path LIKE ? || '%'").all(prefix).map((r) => r.vault_path);
-	} else {
-		const cutoff = computedAt - (options.recentDays ?? 30) * 864e5;
-		orphans = db.prepare("SELECT vh.vault_path FROM vault_health vh JOIN vault_files vf ON vh.vault_path = vf.vault_path WHERE vh.is_orphan = 1 AND vf.indexed_at > ?").all(cutoff).map((r) => r.vault_path);
-	}
-	let disconnectedClusters = 1;
-	if (include.includes("disconnected")) {
-		let allNodes;
-		let allEdges;
-		if (scope === "full") {
-			allNodes = db.prepare("SELECT vault_path FROM vault_files").all().map((r) => r.vault_path);
-			allEdges = db.prepare("SELECT DISTINCT source_path AS source, target_path AS target FROM vault_links WHERE target_path IS NOT NULL").all();
-		} else if (scope === "project") {
-			const prefix = options.projectPath ?? "";
-			allNodes = db.prepare("SELECT vault_path FROM vault_files WHERE vault_path LIKE ? || '%'").all(prefix).map((r) => r.vault_path);
-			allEdges = db.prepare("SELECT DISTINCT source_path AS source, target_path AS target FROM vault_links WHERE target_path IS NOT NULL AND source_path LIKE ? || '%'").all(prefix);
-		} else {
-			const cutoff = computedAt - (options.recentDays ?? 30) * 864e5;
-			allNodes = db.prepare("SELECT vault_path FROM vault_files WHERE indexed_at > ?").all(cutoff).map((r) => r.vault_path);
-			allEdges = db.prepare("SELECT DISTINCT source_path AS source, target_path AS target FROM vault_links WHERE target_path IS NOT NULL AND source_path IN (SELECT vault_path FROM vault_files WHERE indexed_at > ?)").all(cutoff);
-		}
-		disconnectedClusters = countComponents(allNodes, allEdges);
-	}
-	let lowConnectivity = [];
-	if (include.includes("low_connectivity")) if (scope === "full") lowConnectivity = db.prepare("SELECT vault_path FROM vault_health WHERE inbound_count + outbound_count <= 1").all().map((r) => r.vault_path);
-	else if (scope === "project") {
-		const prefix = options.projectPath ?? "";
-		lowConnectivity = db.prepare("SELECT vault_path FROM vault_health WHERE inbound_count + outbound_count <= 1 AND vault_path LIKE ? || '%'").all(prefix).map((r) => r.vault_path);
-	} else {
-		const cutoff = computedAt - (options.recentDays ?? 30) * 864e5;
-		lowConnectivity = db.prepare("SELECT vh.vault_path FROM vault_health vh JOIN vault_files vf ON vh.vault_path = vf.vault_path WHERE vh.inbound_count + vh.outbound_count <= 1 AND vf.indexed_at > ?").all(cutoff).map((r) => r.vault_path);
-	}
-	const deadRatio = totalLinks > 0 ? deadLinks.length / totalLinks : 0;
-	const orphanRatio = totalFiles > 0 ? orphans.length / totalFiles : 0;
-	const lowConnRatio = totalFiles > 0 ? lowConnectivity.length / totalFiles : 0;
-	const healthScore = Math.round(100 * (1 - deadRatio) * (1 - orphanRatio * .5) * (1 - lowConnRatio * .3));
-	return {
-		totalFiles,
-		totalLinks,
-		deadLinks,
-		orphans,
-		disconnectedClusters,
-		lowConnectivity,
-		healthScore,
-		computedAt
-	};
-}
-
-//#endregion
-//#region src/zettelkasten/suggest.ts
-const MAX_CHUNKS = 5e3;
-const SEMANTIC_WEIGHT = .5;
-const TAG_WEIGHT = .2;
-const NEIGHBOR_WEIGHT = .3;
-function extractTagsFromChunkTexts(texts) {
-	const tags = /* @__PURE__ */ new Set();
-	for (const text of texts) {
-		const match = text.match(/^tags:\s*\n((?:[ \t]*-[ \t]*.+\n?)*)/m);
-		if (!match) continue;
-		const lines = match[1].split("\n");
-		for (const line of lines) {
-			const tagMatch = line.match(/^[ \t]*-[ \t]*(.+)/);
-			if (tagMatch) {
-				const tag = tagMatch[1].trim().toLowerCase();
-				if (tag) tags.add(tag);
-			}
-		}
-	}
-	return tags;
-}
-function getFileAvgEmbedding(db, projectId, path) {
-	const rows = db.prepare(`SELECT embedding FROM memory_chunks
-       WHERE project_id = ? AND path = ? AND embedding IS NOT NULL`).all(projectId, path);
-	if (rows.length === 0) return null;
-	const first = deserializeEmbedding(rows[0].embedding);
-	const sum = new Float32Array(first.length);
-	for (const row of rows) {
-		const vec = deserializeEmbedding(row.embedding);
-		for (let i = 0; i < vec.length; i++) sum[i] += vec[i];
-	}
-	const avg = new Float32Array(sum.length);
-	for (let i = 0; i < sum.length; i++) avg[i] = sum[i] / rows.length;
-	return avg;
-}
-function getAllFileEmbeddings(db, projectId) {
-	const rows = db.prepare(`SELECT path, embedding FROM memory_chunks
-       WHERE project_id = ? AND embedding IS NOT NULL
-       ORDER BY path, start_line
-       LIMIT ?`).all(projectId, MAX_CHUNKS);
-	const byPath = /* @__PURE__ */ new Map();
-	for (const row of rows) {
-		const vec = deserializeEmbedding(row.embedding);
-		const entry = byPath.get(row.path);
-		if (!entry) byPath.set(row.path, {
-			sum: new Float32Array(vec),
-			count: 1
-		});
-		else {
-			for (let i = 0; i < vec.length; i++) entry.sum[i] += vec[i];
-			entry.count++;
-		}
-	}
-	const result = /* @__PURE__ */ new Map();
-	for (const [path, { sum, count }] of byPath) {
-		const avg = new Float32Array(sum.length);
-		for (let i = 0; i < sum.length; i++) avg[i] = sum[i] / count;
-		result.set(path, avg);
-	}
-	return result;
-}
-function getFileTags(db, projectId, path) {
-	return extractTagsFromChunkTexts(db.prepare(`SELECT text FROM memory_chunks
-       WHERE project_id = ? AND path = ?
-       ORDER BY start_line
-       LIMIT 5`).all(projectId, path).map((r) => r.text));
-}
-function jaccardSimilarity(a, b) {
-	if (a.size === 0 && b.size === 0) return 0;
-	let intersection = 0;
-	for (const tag of a) if (b.has(tag)) intersection++;
-	const union = a.size + b.size - intersection;
-	return union === 0 ? 0 : intersection / union;
-}
-function buildReason(semanticScore, tagScore, neighborScore, neighborCount) {
-	const signals = [
-		{
-			label: `Semantically similar (${semanticScore.toFixed(2)})`,
-			value: semanticScore * SEMANTIC_WEIGHT
-		},
-		{
-			label: `Shared tags (${tagScore.toFixed(2)} Jaccard)`,
-			value: tagScore * TAG_WEIGHT
-		},
-		{
-			label: `Linked by ${neighborCount} mutual connection${neighborCount !== 1 ? "s" : ""}`,
-			value: neighborScore * NEIGHBOR_WEIGHT
-		}
-	];
-	signals.sort((a, b) => b.value - a.value);
-	return signals[0].label;
-}
-function suggestedWikilink(vaultPath) {
-	const base = basename(vaultPath);
-	return `[[${base.endsWith(".md") ? base.slice(0, -3) : base}]]`;
-}
-/**
-* Proactively find notes worth linking to a given note, combining semantic similarity,
-* shared tags, and graph-neighborhood signals into a ranked list of suggestions.
-*/
-async function zettelSuggest(db, opts) {
-	const limit = opts.limit ?? 5;
-	const excludeLinked = opts.excludeLinked ?? true;
-	const outboundRows = db.prepare(`SELECT target_path FROM vault_links
-       WHERE source_path = ? AND target_path IS NOT NULL`).all(opts.notePath);
-	const linkedPaths = new Set(outboundRows.map((r) => r.target_path));
-	const sourceEmbedding = getFileAvgEmbedding(db, opts.vaultProjectId, opts.notePath);
-	const allEmbeddings = getAllFileEmbeddings(db, opts.vaultProjectId);
-	allEmbeddings.delete(opts.notePath);
-	const sourceTags = getFileTags(db, opts.vaultProjectId, opts.notePath);
-	const friendTargetRows = db.prepare(`SELECT DISTINCT target_path AS path FROM vault_links
-       WHERE source_path IN (
-         SELECT target_path FROM vault_links
-         WHERE source_path = ? AND target_path IS NOT NULL
-       ) AND target_path IS NOT NULL`).all(opts.notePath);
-	const friendLinkCounts = /* @__PURE__ */ new Map();
-	for (const { path } of friendTargetRows) {
-		if (path === opts.notePath) continue;
-		friendLinkCounts.set(path, (friendLinkCounts.get(path) ?? 0) + 1);
-	}
-	const maxFriendLinks = Math.max(1, ...friendLinkCounts.values());
-	const allFiles = db.prepare("SELECT vault_path, title FROM vault_files").all();
-	const suggestions = [];
-	for (const { vault_path, title } of allFiles) {
-		if (vault_path === opts.notePath) continue;
-		if (excludeLinked && linkedPaths.has(vault_path)) continue;
-		let semanticScore = 0;
-		if (sourceEmbedding) {
-			const candidateEmbedding = allEmbeddings.get(vault_path);
-			if (candidateEmbedding) semanticScore = Math.max(0, cosineSimilarity(sourceEmbedding, candidateEmbedding));
-		}
-		let tagScore = 0;
-		if (allEmbeddings.has(vault_path)) tagScore = jaccardSimilarity(sourceTags, getFileTags(db, opts.vaultProjectId, vault_path));
-		const friendCount = friendLinkCounts.get(vault_path) ?? 0;
-		const neighborScore = friendCount / maxFriendLinks;
-		const score = SEMANTIC_WEIGHT * semanticScore + TAG_WEIGHT * tagScore + NEIGHBOR_WEIGHT * neighborScore;
-		if (score <= 0) continue;
-		const reason = buildReason(semanticScore, tagScore, neighborScore, friendCount);
-		suggestions.push({
-			path: vault_path,
-			title,
-			score,
-			semanticScore,
-			tagScore,
-			neighborScore,
-			reason,
-			suggestedWikilink: suggestedWikilink(vault_path)
-		});
-	}
-	suggestions.sort((a, b) => b.score - a.score);
-	return suggestions.slice(0, limit);
-}
-
-//#endregion
-export { zettelConverse, zettelExplore, zettelHealth, zettelSuggest, zettelSurprise, zettelThemes };
-//# sourceMappingURL=zettelkasten-e-a4rW_6.mjs.map