dsh-mnemon-source-runtime 0.5.11 → 0.5.12

package/lib/index.js

@@ -267,12 +267,14 @@ function prepareMutation(before, request, now) {
 }
 function compactionCandidates(compacted, existing, target, now) {
 	const seen = /* @__PURE__ */ new Set();
+	const existingByContent = /* @__PURE__ */ new Map();
+	for (const entry of existing) if (!existingByContent.has(entry.content)) existingByContent.set(entry.content, entry);
 	return compacted.map((entry) => {
 		const content = normalizeContent(entry.content, "compacted content");
 		if (!isImportance(entry.importance)) throw new Error("compacted importance must be critical, normal, or low");
 		if (seen.has(content)) throw new Error("compacted runtime memory contains duplicate entries");
 		seen.add(content);
-		const unchanged = existing.find((current) => current.content === content);
+		const unchanged = existingByContent.get(content);
 		const inheritedBranches = entry.branches ?? unchanged?.branches;
 		return {
 			content,
@@ -285,21 +287,28 @@ function compactionCandidates(compacted, existing, target, now) {
 	});
 }
 function packCompactionCandidates(replacements, target, maxBytes) {
-	const priority = {
-		critical: 0,
-		normal: 1,
-		low: 2
+	const ranked = {
+		critical: [],
+		normal: [],
+		low: []
 	};
-	const ranked = replacements.map((entry, index) => ({
-		entry,
-		index
-	})).sort((left, right) => priority[left.entry.importance] - priority[right.entry.importance] || left.index - right.index);
+	replacements.forEach((entry, index) => ranked[entry.importance].push(index));
 	const selected = /* @__PURE__ */ new Set();
-	const packed = [];
-	for (const candidate of ranked) {
-		if (byteCount([...packed, candidate.entry], target) > maxBytes) continue;
-		packed.push(candidate.entry);
-		selected.add(candidate.index);
+	const delimiterBytes = Buffer.byteLength(RUNTIME_ENTRY_DELIMITER, "utf8");
+	let used = 0;
+	let count = 0;
+	for (const importance of [
+		"critical",
+		"normal",
+		"low"
+	]) for (const index of ranked[importance]) {
+		const entry = replacements[index];
+		const matchesTarget = entry.target === target;
+		const added = matchesTarget ? Buffer.byteLength(entry.content, "utf8") + (count === 0 ? 0 : delimiterBytes) : 0;
+		if (used + added > maxBytes) continue;
+		used += added;
+		if (matchesTarget) count += 1;
+		selected.add(index);
 	}
 	return replacements.filter((_, index) => selected.has(index));
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "dsh-mnemon-source-runtime",
-  "version": "0.5.11",
+  "version": "0.5.12",
   "description": "Self-contained runtime Source for Composable View Memory.",
   "license": "MIT",
   "type": "module",
@@ -60,7 +60,7 @@
     "@types/node": "^22.0.0",
     "@types/react": "^18.3.0",
     "@types/react-dom": "^18.3.0",
-    "dsh-mnemon": "^0.5.19",
+    "dsh-mnemon": "^0.5.23",
     "jsdom": "^26.0.0",
     "react": "^18.2.0",
     "react-dom": "^18.2.0",