vicinity 0.3.1

Approximate Nearest Neighbor Search: HNSW, DiskANN, IVF-PQ, ScaNN, quantization
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42

//! Working set cache for DiskANN.

use std::collections::HashMap;

/// LRU cache for frequently accessed vectors.
pub struct WorkingSetCache {
    capacity: usize,
    cache: HashMap<u32, Vec<f32>>,
}

impl WorkingSetCache {
    /// Create new cache with specified capacity.
    pub fn new(capacity: usize) -> Self {
        Self {
            capacity,
            cache: HashMap::new(),
        }
    }

    /// Get vector from cache.
    pub fn get(&self, id: u32) -> Option<&Vec<f32>> {
        self.cache.get(&id)
    }

    /// Insert vector into cache.
    pub fn insert(&mut self, id: u32, vector: Vec<f32>) {
        // Simple implementation: if cache is full, remove oldest (FIFO)
        // In production, would use proper LRU
        if self.cache.len() >= self.capacity {
            // Remove first entry (simple FIFO)
            if let Some(&first_key) = self.cache.keys().next() {
                self.cache.remove(&first_key);
            }
        }
        self.cache.insert(id, vector);
    }

    /// Clear cache.
    pub fn clear(&mut self) {
        self.cache.clear();
    }
}