leankg 0.8.5

Lightweight Knowledge Graph for AI-Assisted Development
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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172

use std::collections::HashMap;
use std::hash::Hash;
use std::time::{Duration, Instant};

#[derive(Debug, Clone)]
pub struct OrchestratorCacheEntry {
    pub value: CachedContent,
    pub created_at: Instant,
}

#[derive(Debug, Clone)]
pub struct CachedContent {
    pub content: String,
    pub mode: String,
    pub tokens: usize,
    pub total_tokens: usize,
    pub savings_percent: f64,
    pub elements_count: usize,
}

pub struct OrchestratorCache {
    data: HashMap<String, OrchestratorCacheEntry>,
    ttl: Duration,
    max_entries: usize,
}

impl OrchestratorCache {
    pub fn new(ttl_secs: u64, max_entries: usize) -> Self {
        Self {
            data: HashMap::new(),
            ttl: Duration::from_secs(ttl_secs),
            max_entries,
        }
    }

    pub fn get(&self, key: &str) -> Option<CachedContent> {
        self.data.get(key).and_then(|entry| {
            if entry.created_at.elapsed() < self.ttl {
                Some(entry.value.clone())
            } else {
                None
            }
        })
    }

    pub fn insert(&mut self, key: String, value: CachedContent) {
        if self.data.len() >= self.max_entries {
            self.evict_expired();
            if self.data.len() >= self.max_entries {
                if let Some(oldest) = self
                    .data
                    .iter()
                    .min_by_key(|(_, entry)| entry.created_at)
                    .map(|(k, _)| k.clone())
                {
                    self.data.remove(&oldest);
                }
            }
        }
        self.data.insert(
            key,
            OrchestratorCacheEntry {
                value,
                created_at: Instant::now(),
            },
        );
    }

    pub fn invalidate(&mut self, key: &str) {
        self.data.remove(key);
    }

    pub fn invalidate_prefix(&mut self, prefix: &str) {
        self.data.retain(|k, _| !k.starts_with(prefix));
    }

    fn evict_expired(&mut self) {
        self.data
            .retain(|_, entry| entry.created_at.elapsed() < self.ttl);
    }

    pub fn clear(&mut self) {
        self.data.clear();
    }

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

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

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_cache_basic() {
        let mut cache = OrchestratorCache::new(60, 10);
        cache.insert(
            "key1".to_string(),
            CachedContent {
                content: "value1".to_string(),
                mode: "test".to_string(),
                tokens: 10,
                total_tokens: 100,
                savings_percent: 90.0,
                elements_count: 5,
            },
        );
        assert!(cache.get("key1").is_some());
    }

    #[test]
    fn test_cache_expiry() {
        let mut cache = OrchestratorCache::new(0, 10);
        cache.insert(
            "key1".to_string(),
            CachedContent {
                content: "value1".to_string(),
                mode: "test".to_string(),
                tokens: 10,
                total_tokens: 100,
                savings_percent: 90.0,
                elements_count: 5,
            },
        );
        std::thread::sleep(Duration::from_millis(10));
        assert!(cache.get("key1").is_none());
    }

    #[test]
    fn test_cache_max_entries() {
        let mut cache = OrchestratorCache::new(60, 2);
        for i in 0..3 {
            cache.insert(
                format!("key{}", i),
                CachedContent {
                    content: format!("value{}", i),
                    mode: "test".to_string(),
                    tokens: 10,
                    total_tokens: 100,
                    savings_percent: 90.0,
                    elements_count: 5,
                },
            );
        }
        assert!(cache.get("key0").is_none());
        assert!(cache.get("key1").is_some());
        assert!(cache.get("key2").is_some());
    }

    #[test]
    fn test_cache_invalidate() {
        let mut cache = OrchestratorCache::new(60, 10);
        cache.insert(
            "key1".to_string(),
            CachedContent {
                content: "value1".to_string(),
                mode: "test".to_string(),
                tokens: 10,
                total_tokens: 100,
                savings_percent: 90.0,
                elements_count: 5,
            },
        );
        cache.invalidate("key1");
        assert!(cache.get("key1").is_none());
    }
}