From 9fef98b01ec8063d66bd7cd3e2efdf6b50c2980c Mon Sep 17 00:00:00 2001 From: ProofOfConcept Date: Tue, 10 Mar 2026 23:49:08 -0400 Subject: [PATCH] rename: sort candidates by least-recently visited Instead of a hard 7-day cutoff, sort rename candidates so the least-recently visited come first. Naturally prioritizes unseen nodes while allowing revisits once everything's been through. --- poc-memory/src/agents/prompts.rs | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/poc-memory/src/agents/prompts.rs b/poc-memory/src/agents/prompts.rs index be07bb7..726db1b 100644 --- a/poc-memory/src/agents/prompts.rs +++ b/poc-memory/src/agents/prompts.rs @@ -275,7 +275,8 @@ pub fn format_rename_candidates(store: &Store, count: usize) -> (Vec, St .map(|(k, n)| (k.as_str(), n)) .collect(); - candidates.sort_by(|a, b| b.1.timestamp.cmp(&a.1.timestamp)); + // Least-recently visited first — naturally prioritizes unseen nodes + candidates.sort_by_key(|(key, _)| store.last_visited(key, "rename")); candidates.truncate(count); let keys: Vec = candidates.iter().map(|(k, _)| k.to_string()).collect();