remove hardcoded skip lists, prune orphan edges in fsck
All nodes in the store are memory — none should be excluded from knowledge extraction, search, or graph algorithms by name. Removed the MEMORY/where-am-i/work-queue/work-state skip lists entirely. Deleted where-am-i and work-queue nodes from the store (ephemeral scratchpads that don't belong). Added orphan edge pruning to fsck so broken links get cleaned up automatically. Co-Authored-By: ProofOfConcept <poc@bcachefs.org>
This commit is contained in:
parent
70c0276fa0
commit
fd5591653d
4 changed files with 23 additions and 26 deletions
|
|
@ -145,11 +145,9 @@ fn format_nodes_section(store: &Store, items: &[ReplayItem], graph: &Graph) -> S
|
|||
// Suggested link targets: text-similar semantic nodes not already neighbors
|
||||
let neighbor_keys: std::collections::HashSet<&str> = neighbors.iter()
|
||||
.map(|(k, _)| k.as_str()).collect();
|
||||
let skip = ["MEMORY", "where-am-i", "work-queue", "work-state"];
|
||||
let mut candidates: Vec<(&str, f32)> = store.nodes.iter()
|
||||
.filter(|(k, _)| {
|
||||
!skip.contains(&k.as_str())
|
||||
&& *k != &item.key
|
||||
*k != &item.key
|
||||
&& !neighbor_keys.contains(k.as_str())
|
||||
})
|
||||
.map(|(k, n)| {
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue