zipora 3.1.7

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

use crate::error::{Result, ZiporaError};
use std::cmp::Ordering;

use super::state::{DaState, NInfo, FREE_BIT, NIL_STATE, MAX_STATE, NINFO_NONE, label_to_ninfo};
use super::trie::*;
use super::map::{MapValue, DoubleArrayTrieMap};

pub(crate) struct PrefixFrame {
    pub(crate) state: u32,
    /// Next sibling to visit (NInfo encoding: label+1, 0=done).
    pub(crate) next_sibling: u16,
    /// Whether we've checked/yielded this state's terminal value.
    pub(crate) checked_terminal: bool,
    /// Depth of the path when this frame was pushed (path[0..depth] is the key).
    pub(crate) depth: usize,
}

/// Lazy iterator over all (key, value) pairs with keys starting with a given prefix.
///
/// Traverses NInfo sibling chains using an explicit DFS stack, yielding entries
/// one at a time without collecting all results into a Vec. This prevents memory
/// spikes on broad queries (e.g., prefix="a").
pub struct PrefixIterator<'a, V: MapValue> {
    pub(crate) trie: &'a DoubleArrayTrieMap<V>,
    pub(crate) stack: Vec<PrefixFrame>,
    pub(crate) path: Vec<u8>,
}

impl<'a, V: MapValue> Iterator for PrefixIterator<'a, V> {
    type Item = (Vec<u8>, V);

    fn next(&mut self) -> Option<Self::Item> {
        loop {
            let frame = self.stack.last_mut()?;
            let state = frame.state;

            // First, check if this state is terminal and should yield
            if !frame.checked_terminal {
                frame.checked_terminal = true;
                let state_idx = state as usize;
                if state_idx < self.trie.trie.ninfos.len()
                    && self.trie.trie.ninfos[state_idx].is_term()
                    && let Some(&val) = self.trie.values.get(state_idx)
                    && val != V::EMPTY
                {
                    return Some((self.path[..frame.depth].to_vec(), val));
                }
            }

            // Then try to visit the next child
            if frame.next_sibling == NINFO_NONE {
                // No more children — pop
                self.stack.pop();
                continue;
            }

            let label = (frame.next_sibling - 1) as u8;
            let base = self.trie.trie.states[state as usize].child0();
            let child_pos = (base ^ label as u32) as usize;

            // Advance sibling cursor BEFORE pushing child
            frame.next_sibling = if child_pos < self.trie.trie.ninfos.len() {
                self.trie.trie.ninfos[child_pos].sibling
            } else {
                NINFO_NONE
            };
            let parent_depth = frame.depth;

            // Validate child
            if child_pos >= self.trie.trie.states.len()
                || self.trie.trie.states[child_pos].is_free()
            {
                continue;
            }

            // Set path for child
            let child_depth = parent_depth + 1;
            self.path.truncate(parent_depth);
            self.path.push(label);

            // Push child frame
            let first_child = if child_pos < self.trie.trie.ninfos.len() {
                self.trie.trie.ninfos[child_pos].first_child()
            } else {
                NINFO_NONE
            };
            self.stack.push(PrefixFrame {
                state: child_pos as u32,
                next_sibling: first_child,
                checked_terminal: false,
                depth: child_depth,
            });
        }
    }
}

/// Stack frame for fuzzy iteration DFS.
pub(crate) struct FuzzyFrame {
    pub(crate) state: u32,
    pub(crate) next_sibling: u16,
    pub(crate) checked_terminal: bool,
    pub(crate) depth: usize,
}

/// Lazy iterator over all (key, value) pairs within edit distance `max_dist` of a query.
///
/// Uses incremental Levenshtein distance computation with DP rows maintained
/// per depth level. Prunes subtrees where `min(dp_row) > max_dist`.
pub struct FuzzyIterator<'a, V: MapValue> {
    pub(crate) trie: &'a DoubleArrayTrieMap<V>,
    pub(crate) stack: Vec<FuzzyFrame>,
    pub(crate) path: Vec<u8>,
    pub(crate) query: Vec<u8>,
    pub(crate) max_dist: usize,
    /// dp_columns[d] = edit distance row for path[0..d] vs query[0..j], j in 0..=query.len()
    pub(crate) dp_columns: Vec<Vec<usize>>,
}

impl<'a, V: MapValue> FuzzyIterator<'a, V> {
    /// Compute the next DP row when appending character `c` at current depth.
    fn compute_row(prev_row: &[usize], query: &[u8], c: u8) -> Vec<usize> {
        let mut row = vec![0; query.len() + 1];
        row[0] = prev_row[0] + 1; // deletion
        for j in 1..=query.len() {
            let cost = if query[j - 1] == c { 0 } else { 1 };
            row[j] = (prev_row[j] + 1) // deletion
                .min(row[j - 1] + 1) // insertion
                .min(prev_row[j - 1] + cost); // substitution
        }
        row
    }
}

impl<'a, V: MapValue> Iterator for FuzzyIterator<'a, V> {
    type Item = (Vec<u8>, V);

    fn next(&mut self) -> Option<Self::Item> {
        loop {
            let frame = self.stack.last_mut()?;
            let state = frame.state;
            let depth = frame.depth;

            // Check terminal
            if !frame.checked_terminal {
                frame.checked_terminal = true;
                let state_idx = state as usize;
                if depth < self.dp_columns.len()
                    && self.dp_columns[depth][self.query.len()] <= self.max_dist
                    && state_idx < self.trie.trie.ninfos.len()
                    && self.trie.trie.ninfos[state_idx].is_term()
                    && let Some(&val) = self.trie.values.get(state_idx)
                    && val != V::EMPTY
                {
                    return Some((self.path[..depth].to_vec(), val));
                }
            }

            // Try next child
            if frame.next_sibling == NINFO_NONE {
                self.stack.pop();
                // Restore dp_columns: each stack frame at depth d has dp_columns[0..=d].
                // When popping, truncate to the parent's depth + 1.
                if let Some(parent) = self.stack.last() {
                    self.dp_columns.truncate(parent.depth + 1);
                } else {
                    self.dp_columns.truncate(1); // keep root row only
                }
                continue;
            }

            let label = (frame.next_sibling - 1) as u8;
            let base = self.trie.trie.states[state as usize].child0();
            let child_pos = (base ^ label as u32) as usize;

            // Advance sibling cursor
            frame.next_sibling = if child_pos < self.trie.trie.ninfos.len() {
                self.trie.trie.ninfos[child_pos].sibling
            } else {
                NINFO_NONE
            };
            let parent_depth = frame.depth;

            // Validate child
            if child_pos >= self.trie.trie.states.len()
                || self.trie.trie.states[child_pos].is_free()
            {
                continue;
            }

            // Compute DP row for this child
            let prev_row = &self.dp_columns[parent_depth];
            let new_row = Self::compute_row(prev_row, &self.query, label);

            // Prune: if min edit distance in row > max_dist, skip subtree
            if *new_row.iter().min().unwrap_or(&usize::MAX) > self.max_dist {
                continue;
            }

            // Set path
            let child_depth = parent_depth + 1;
            self.path.truncate(parent_depth);
            self.path.push(label);

            // Set DP column for child depth
            self.dp_columns.truncate(child_depth);
            self.dp_columns.push(new_row);

            // Push child frame
            let first_child = if child_pos < self.trie.trie.ninfos.len() {
                self.trie.trie.ninfos[child_pos].first_child()
            } else {
                NINFO_NONE
            };
            self.stack.push(FuzzyFrame {
                state: child_pos as u32,
                next_sibling: first_child,
                checked_terminal: false,
                depth: child_depth,
            });
        }
    }
}

impl<V: MapValue> std::fmt::Debug for DoubleArrayTrieMap<V> {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        f.debug_struct("DoubleArrayTrieMap")
            .field("num_keys", &self.trie.len())
            .field("total_states", &self.trie.total_states())
            .field("mem_size", &self.trie.mem_size())
            .finish()
    }
}