use std::sync::Arc;
use crate::entry::Entry;
use crate::store::Store;
use crate::view::ReadView;
#[derive(Debug, Clone)]
pub struct SearchHit {
pub key: String,
pub score: f32,
pub entry: Arc<Entry>,
}
pub fn cosine(a: &[f32], b: &[f32]) -> f32 {
if a.len() != b.len() || a.is_empty() {
return 0.0;
}
let mut dot = 0.0f32;
let mut na = 0.0f32;
let mut nb = 0.0f32;
for i in 0..a.len() {
dot += a[i] * b[i];
na += a[i] * a[i];
nb += b[i] * b[i];
}
let denom = na.sqrt() * nb.sqrt();
if denom == 0.0 || !denom.is_finite() {
0.0
} else {
dot / denom
}
}
pub fn search(view: &ReadView, query: &[f32], k: usize, prefix: Option<&str>) -> Vec<SearchHit> {
if k == 0 || query.is_empty() {
return Vec::new();
}
let root = &view.commit().root;
let mut hits: Vec<SearchHit> = match prefix {
Some(p) => collect(root.range_prefix(p), query),
None => collect(root.iter(), query),
};
hits.sort_by(|a, b| {
b.score.total_cmp(&a.score).then_with(|| a.key.cmp(&b.key))
});
hits.truncate(k);
hits
}
fn collect<'a, I>(it: I, query: &[f32]) -> Vec<SearchHit>
where
I: Iterator<Item = (&'a String, &'a Arc<Entry>)>,
{
it.filter_map(|(key, entry)| {
let embedding = entry.embedding.as_deref()?;
Some(SearchHit {
key: key.clone(),
score: cosine(query, embedding),
entry: Arc::clone(entry),
})
})
.collect()
}