zipora 2.1.5

High-performance Rust implementation providing advanced data structures and compression algorithms with memory safety guarantees. Features LRU page cache, sophisticated caching layer, fiber-based concurrency, real-time compression, secure memory pools, SIMD optimizations, and complete C FFI for migration from C++.
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
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311

//! Simplified FSA infrastructure implementations for initial Phase 8A completion
//!
//! This module provides basic working implementations of the FSA infrastructure
//! components to establish the foundation for Phase 8A.

use crate::error::Result;
use std::collections::HashMap;

/// Simple FSA cache for basic operations
#[derive(Debug)]
pub struct SimpleFsaCache {
    cache: HashMap<u32, u32>,
    max_size: usize,
}

impl SimpleFsaCache {
    pub fn new(max_size: usize) -> Self {
        Self {
            cache: HashMap::new(),
            max_size,
        }
    }

    #[inline]
    pub fn get(&self, key: u32) -> Option<u32> {
        self.cache.get(&key).copied()
    }

    pub fn insert(&mut self, key: u32, value: u32) -> Result<()> {
        if self.cache.len() >= self.max_size {
            // Simple eviction - remove first entry
            if let Some(&first_key) = self.cache.keys().next() {
                self.cache.remove(&first_key);
            }
        }
        self.cache.insert(key, value);
        Ok(())
    }

    #[inline]
    pub fn len(&self) -> usize {
        self.cache.len()
    }

    #[inline]
    pub fn is_empty(&self) -> bool {
        self.cache.is_empty()
    }
}

/// Simple directed acyclic word graph
#[derive(Debug)]
pub struct SimpleDawg {
    /// States mapped to their terminal status
    states: HashMap<u32, bool>,
    /// Transitions: (from_state, symbol) -> to_state
    transitions: HashMap<(u32, u8), u32>,
    /// Root state
    root: u32,
    /// Next available state ID
    next_state: u32,
    /// Number of keys
    num_keys: usize,
}

impl SimpleDawg {
    pub fn new() -> Self {
        let mut dawg = Self {
            states: HashMap::new(),
            transitions: HashMap::new(),
            root: 0,
            next_state: 1,
            num_keys: 0,
        };
        
        // Add root state
        dawg.states.insert(0, false);
        dawg
    }

    pub fn insert(&mut self, key: &[u8]) -> Result<()> {
        let mut current_state = self.root;

        // Follow existing path as far as possible
        for &symbol in key {
            if let Some(&next_state) = self.transitions.get(&(current_state, symbol)) {
                current_state = next_state;
            } else {
                // Create new state and transition
                let new_state = self.next_state;
                self.next_state += 1;
                
                self.states.insert(new_state, false);
                self.transitions.insert((current_state, symbol), new_state);
                current_state = new_state;
            }
        }

        // Mark final state as terminal
        self.states.insert(current_state, true);
        self.num_keys += 1;
        Ok(())
    }

    pub fn contains(&self, key: &[u8]) -> bool {
        let mut current_state = self.root;

        for &symbol in key {
            if let Some(&next_state) = self.transitions.get(&(current_state, symbol)) {
                current_state = next_state;
            } else {
                return false;
            }
        }

        self.states.get(&current_state).copied().unwrap_or(false)
    }

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

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

    #[inline]
    pub fn memory_usage(&self) -> usize {
        self.states.len() * std::mem::size_of::<(u32, bool)>() +
        self.transitions.len() * std::mem::size_of::<((u32, u8), u32)>()
    }
}

/// Simple graph walker for basic traversal
#[derive(Debug)]
pub struct SimpleGraphWalker {
    visited: HashMap<u32, bool>,
}

impl SimpleGraphWalker {
    pub fn new() -> Self {
        Self {
            visited: HashMap::new(),
        }
    }

    pub fn walk_bfs<F>(&mut self, start: u32, mut visit_fn: F) -> Result<()>
    where
        F: FnMut(u32) -> Result<Vec<u32>>,
    {
        let mut queue = std::collections::VecDeque::new();
        queue.push_back(start);
        self.visited.insert(start, true);

        while let Some(current) = queue.pop_front() {
            let neighbors = visit_fn(current)?;
            
            for neighbor in neighbors {
                if !self.visited.contains_key(&neighbor) {
                    self.visited.insert(neighbor, true);
                    queue.push_back(neighbor);
                }
            }
        }

        Ok(())
    }

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

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

/// Simple fast search using linear methods
#[derive(Debug)]
pub struct SimpleFastSearch;

impl SimpleFastSearch {
    pub fn new() -> Self {
        Self
    }

    pub fn search_byte(&self, data: &[u8], target: u8) -> Vec<usize> {
        data.iter()
            .enumerate()
            .filter_map(|(i, &b)| if b == target { Some(i) } else { None })
            .collect()
    }

    pub fn find_first(&self, data: &[u8], target: u8) -> Option<usize> {
        data.iter().position(|&b| b == target)
    }

    pub fn find_last(&self, data: &[u8], target: u8) -> Option<usize> {
        data.iter().rposition(|&b| b == target)
    }

    pub fn count(&self, data: &[u8], target: u8) -> usize {
        data.iter().filter(|&&b| b == target).count()
    }

    pub fn search_pattern(&self, data: &[u8], pattern: &[u8]) -> Vec<usize> {
        let mut positions = Vec::new();
        
        if pattern.is_empty() || pattern.len() > data.len() {
            return positions;
        }
        
        for i in 0..=(data.len() - pattern.len()) {
            if data[i..i + pattern.len()] == *pattern {
                positions.push(i);
            }
        }
        
        positions
    }
}

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

    #[test]
    fn test_simple_fsa_cache() {
        let mut cache = SimpleFsaCache::new(3);
        
        cache.insert(1, 10).unwrap();
        cache.insert(2, 20).unwrap();
        cache.insert(3, 30).unwrap();
        
        assert_eq!(cache.len(), 3);
        assert_eq!(cache.get(1), Some(10));
        assert_eq!(cache.get(2), Some(20));
        assert_eq!(cache.get(3), Some(30));
        
        // Test eviction
        cache.insert(4, 40).unwrap();
        assert_eq!(cache.len(), 3);
    }

    #[test]
    fn test_simple_dawg() {
        let mut dawg = SimpleDawg::new();
        
        dawg.insert(b"cat").unwrap();
        dawg.insert(b"car").unwrap();
        dawg.insert(b"card").unwrap();
        
        assert!(dawg.contains(b"cat"));
        assert!(dawg.contains(b"car"));
        assert!(dawg.contains(b"card"));
        assert!(!dawg.contains(b"dog"));
        assert!(!dawg.contains(b"ca"));
        
        assert_eq!(dawg.num_keys(), 3);
        assert!(dawg.num_states() > 0);
        assert!(dawg.memory_usage() > 0);
    }

    #[test]
    fn test_simple_graph_walker() {
        let mut walker = SimpleGraphWalker::new();
        
        // Simple graph: 0 -> [1, 2], 1 -> [3], 2 -> [3], 3 -> []
        let graph = |node: u32| -> Result<Vec<u32>> {
            match node {
                0 => Ok(vec![1, 2]),
                1 => Ok(vec![3]),
                2 => Ok(vec![3]),
                3 => Ok(vec![]),
                _ => Ok(vec![]),
            }
        };
        
        walker.walk_bfs(0, graph).unwrap();
        assert_eq!(walker.visited_count(), 4);
        
        walker.reset();
        assert_eq!(walker.visited_count(), 0);
    }

    #[test]
    fn test_simple_fast_search() {
        let search = SimpleFastSearch::new();
        let data = b"hello world hello";
        
        // Test byte search
        let positions = search.search_byte(data, b'l');
        assert_eq!(positions, vec![2, 3, 9, 14, 15]);
        
        // Test find operations
        assert_eq!(search.find_first(data, b'l'), Some(2));
        assert_eq!(search.find_last(data, b'l'), Some(15));
        assert_eq!(search.find_first(data, b'z'), None);
        
        // Test count
        assert_eq!(search.count(data, b'l'), 5);
        assert_eq!(search.count(data, b'o'), 3);
        
        // Test pattern search
        let positions = search.search_pattern(data, b"hello");
        assert_eq!(positions, vec![0, 12]);
        
        let positions = search.search_pattern(data, b"xyz");
        assert_eq!(positions, Vec::<usize>::new());
    }
}