Plan, apply and roll back changes to a production ontology, with a blast radius report and a proof an auditor can re-check.
Rust ai-nativedescription-logicsformal-verificationinfrastructure-as-codeisabelle-languageknowledge-graphleanlean4mcpmcp-serverontologyowlowl2reasoningrustshaclsparqltheorem-proving
fix(clippy): gate fetch_text_vecs on turbovec, drop useless vec! in tests
FABIOTESS9cb6325e9ebb
diff --git a/src/vecstore.rs b/src/vecstore.rsindex 09564353..3ab00a54 100644--- a/src/vecstore.rs+++ b/src/vecstore.rs@@ -216,6 +216,10 @@ impl VecStore {/// A named subset of text vectors in one query. This is the hot path under/// eviction: the re-score needs the shortlist and nothing else, so it must/// not degenerate into one round trip per candidate.+ ///+ /// Only the TurboQuant path re-scores a shortlist, so this is gated with+ /// it; the HNSW backend either scans everything or trusts the graph.+ #[cfg(feature = "turbovec")]fn fetch_text_vecs(&self, iris: &[String]) -> HashMap<String, Vec<f32>> {if !self.evict_text {return irisdiff --git a/tests/turbovec_index_test.rs b/tests/turbovec_index_test.rsindex 27d60693..b44e772b 100644--- a/tests/turbovec_index_test.rs+++ b/tests/turbovec_index_test.rs@@ -219,10 +219,10 @@ fn a_query_of_the_wrong_dimensionality_returns_nothing_rather_than_being_truncat// Silently truncating or padding a mismatched query would return a// plausible-looking ranking computed against the wrong vector.- assert!(index.search(&vec![0.1f32; 128], 5).is_empty());- assert!(index.search(&vec![0.1f32; 32], 5).is_empty());+ assert!(index.search(&[0.1f32; 128], 5).is_empty());+ assert!(index.search(&[0.1f32; 32], 5).is_empty());assert!(index- .search_within(&vec![0.1f32; 128], 5, &["http://ex.org/C1".to_string()])+ .search_within(&[0.1f32; 128], 5, &["http://ex.org/C1".to_string()]).unwrap().is_empty());}@@ -269,7 +269,7 @@ fn turbo_search_returns_the_same_ranking_and_scores_as_the_exact_scan() {fn upsert_keeps_the_turbo_index_warm_instead_of_dropping_it() {let (mut store, _entries) = populated_store(100, 64);// Warm the index.- let _ = store.search_cosine_turbo(&vec![0.1; 64], 5);+ let _ = store.search_cosine_turbo(&[0.1; 64], 5);assert_eq!(store.turbo_index_len(), Some(100));let mut newcomer = vec![0.0f32; 64];@@ -342,7 +342,7 @@ fn a_stale_turbo_index_cache_is_rejected() {let _ = store.search_cosine_turbo(&entries[0].1, 5);store.persist_turbo_index().unwrap();// Entries move on without the cache being refreshed.- store.upsert("http://ex.org/Extra", &vec![0.5; 64], &[0.1, 0.1]);+ store.upsert("http://ex.org/Extra", &[0.5; 64], &[0.1, 0.1]);store.persist().unwrap();}