rswarm 0.1.8

A Rust implementation of the Swarm framework
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102

pub mod qdrant;
pub mod sqlite_vss;
pub mod vector;

use crate::error::{SwarmError, SwarmResult};
use async_trait::async_trait;
use std::collections::HashMap;

#[async_trait]
pub trait Memory: Send + Sync {
    async fn store(&mut self, key: &str, value: &str) -> Result<(), SwarmError>;
    async fn retrieve(&self, key: &str) -> Result<Option<String>, SwarmError>;
    async fn clear(&mut self) -> Result<(), SwarmError>;
    async fn keys(&self) -> Result<Vec<String>, SwarmError>;
}

pub struct SlidingWindowMemory {
    max_size: usize,
    storage: HashMap<String, String>,
    insertion_order: Vec<String>,
    token_estimates: HashMap<String, usize>,
}

impl SlidingWindowMemory {
    pub fn new(max_size: usize) -> SwarmResult<Self> {
        if max_size == 0 {
            return Err(SwarmError::ValidationError(
                "SlidingWindowMemory max_size must be greater than zero".to_string(),
            ));
        }
        Ok(Self {
            max_size,
            storage: HashMap::new(),
            insertion_order: Vec::new(),
            token_estimates: HashMap::new(),
        })
    }

    pub fn len(&self) -> usize {
        self.storage.len()
    }

    pub fn is_empty(&self) -> bool {
        self.storage.is_empty()
    }

    pub fn is_full(&self) -> bool {
        self.storage.len() >= self.max_size
    }

    pub fn total_tokens(&self) -> usize {
        self.token_estimates.values().sum()
    }

    fn estimate_tokens(key: &str, value: &str) -> usize {
        key.split_whitespace().count() + value.split_whitespace().count()
    }
}

#[async_trait]
impl Memory for SlidingWindowMemory {
    async fn store(&mut self, key: &str, value: &str) -> Result<(), SwarmError> {
        let token_estimate = Self::estimate_tokens(key, value);

        if self.storage.contains_key(key) {
            self.insertion_order.retain(|k| k != key);
            self.insertion_order.push(key.to_string());
            self.storage.insert(key.to_string(), value.to_string());
            self.token_estimates.insert(key.to_string(), token_estimate);
            return Ok(());
        }

        if self.storage.len() >= self.max_size {
            if let Some(evicted_key) = self.insertion_order.first().cloned() {
                self.storage.remove(&evicted_key);
                self.token_estimates.remove(&evicted_key);
                self.insertion_order.remove(0);
            }
        }

        self.storage.insert(key.to_string(), value.to_string());
        self.insertion_order.push(key.to_string());
        self.token_estimates.insert(key.to_string(), token_estimate);

        Ok(())
    }

    async fn retrieve(&self, key: &str) -> Result<Option<String>, SwarmError> {
        Ok(self.storage.get(key).cloned())
    }

    async fn clear(&mut self) -> Result<(), SwarmError> {
        self.storage.clear();
        self.insertion_order.clear();
        self.token_estimates.clear();
        Ok(())
    }

    async fn keys(&self) -> Result<Vec<String>, SwarmError> {
        Ok(self.insertion_order.clone())
    }
}