zipora 3.1.2

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

//! Trivial rank/select implementations for all-zero and all-one bitvectors.
//!
//! No bit storage — just `size`. All operations are O(1).

use crate::error::{Result, ZiporaError};
use super::RankSelectOps;

/// Rank/select for a bitvector that is entirely zeros.
///
/// No actual bit storage. `rank0(pos) = pos`, `rank1(pos) = 0`.
/// Used when all values are known to be zero (e.g., empty LOUDS labels).
#[derive(Debug, Clone)]
pub struct RankSelectAllZero {
    size: usize,
}

impl RankSelectAllZero {
    pub fn new(size: usize) -> Self { Self { size } }
    #[inline(always)] pub fn is0(&self, i: usize) -> bool { assert!(i < self.size); true }
    #[inline(always)] pub fn is1(&self, i: usize) -> bool { assert!(i < self.size); false }
    pub fn max_rank0(&self) -> usize { self.size }
    pub fn max_rank1(&self) -> usize { 0 }
    #[inline]
    pub fn mem_size(&self) -> usize { std::mem::size_of::<Self>() }
    pub fn zero_seq_len(&self, bitpos: usize) -> usize { assert!(bitpos < self.size); self.size - bitpos }
    pub fn one_seq_len(&self, _bitpos: usize) -> usize { 0 }
}

impl RankSelectOps for RankSelectAllZero {
    #[inline(always)]
    fn rank1(&self, pos: usize) -> usize { assert!(pos <= self.size); 0 }
    #[inline(always)]
    fn rank0(&self, pos: usize) -> usize { assert!(pos <= self.size); pos }
    fn select1(&self, _k: usize) -> Result<usize> {
        Err(ZiporaError::invalid_data("select1 on all-zero bitvector"))
    }
    #[inline(always)]
    fn select0(&self, k: usize) -> Result<usize> {
        if k < self.size { Ok(k) } else {
            Err(ZiporaError::invalid_data("select0 out of range"))
        }
    }
    fn len(&self) -> usize { self.size }
    fn count_ones(&self) -> usize { 0 }
    fn get(&self, index: usize) -> Option<bool> {
        if index < self.size { Some(false) } else { None }
    }
    fn space_overhead_percent(&self) -> f64 { 0.0 }
}

/// Rank/select for a bitvector that is entirely ones.
///
/// No actual bit storage. `rank1(pos) = pos`, `rank0(pos) = 0`.
/// Used when all values are known to be one.
#[derive(Debug, Clone)]
pub struct RankSelectAllOne {
    size: usize,
}

impl RankSelectAllOne {
    pub fn new(size: usize) -> Self { Self { size } }
    #[inline(always)] pub fn is0(&self, i: usize) -> bool { assert!(i < self.size); false }
    #[inline(always)] pub fn is1(&self, i: usize) -> bool { assert!(i < self.size); true }
    pub fn max_rank0(&self) -> usize { 0 }
    pub fn max_rank1(&self) -> usize { self.size }
    #[inline]
    pub fn mem_size(&self) -> usize { std::mem::size_of::<Self>() }
    pub fn zero_seq_len(&self, _bitpos: usize) -> usize { 0 }
    pub fn one_seq_len(&self, bitpos: usize) -> usize { assert!(bitpos < self.size); self.size - bitpos }
}

impl RankSelectOps for RankSelectAllOne {
    #[inline(always)]
    fn rank1(&self, pos: usize) -> usize { assert!(pos <= self.size); pos }
    #[inline(always)]
    fn rank0(&self, pos: usize) -> usize { assert!(pos <= self.size); 0 }
    #[inline(always)]
    fn select1(&self, k: usize) -> Result<usize> {
        if k < self.size { Ok(k) } else {
            Err(ZiporaError::invalid_data("select1 out of range"))
        }
    }
    #[inline]
    fn select0(&self, _k: usize) -> Result<usize> {
        Err(ZiporaError::invalid_data("select0 on all-one bitvector"))
    }
    fn len(&self) -> usize { self.size }
    fn count_ones(&self) -> usize { self.size }
    fn get(&self, index: usize) -> Option<bool> {
        if index < self.size { Some(true) } else { None }
    }
    fn space_overhead_percent(&self) -> f64 { 0.0 }
}

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

    #[test]
    fn test_allzero() {
        let rs = RankSelectAllZero::new(100);
        assert_eq!(rs.len(), 100);
        assert_eq!(rs.count_ones(), 0);
        assert_eq!(rs.rank0(50), 50);
        assert_eq!(rs.rank1(50), 0);
        assert_eq!(rs.select0(42).unwrap(), 42);
        assert!(rs.select1(0).is_err());
        assert_eq!(rs.get(0), Some(false));
        assert_eq!(rs.get(99), Some(false));
        assert_eq!(rs.get(100), None);
        for i in 0..=100 {
            assert_eq!(rs.rank0(i) + rs.rank1(i), i);
        }
    }

    #[test]
    fn test_allone() {
        let rs = RankSelectAllOne::new(100);
        assert_eq!(rs.len(), 100);
        assert_eq!(rs.count_ones(), 100);
        assert_eq!(rs.rank1(50), 50);
        assert_eq!(rs.rank0(50), 0);
        assert_eq!(rs.select1(42).unwrap(), 42);
        assert!(rs.select0(0).is_err());
        assert_eq!(rs.get(0), Some(true));
        assert_eq!(rs.get(99), Some(true));
        assert_eq!(rs.get(100), None);
        for i in 0..=100 {
            assert_eq!(rs.rank0(i) + rs.rank1(i), i);
        }
    }

    #[test]
    fn test_empty() {
        let rs0 = RankSelectAllZero::new(0);
        assert_eq!(rs0.len(), 0);
        assert_eq!(rs0.rank0(0), 0);
        assert_eq!(rs0.rank1(0), 0);

        let rs1 = RankSelectAllOne::new(0);
        assert_eq!(rs1.len(), 0);
        assert_eq!(rs1.rank0(0), 0);
        assert_eq!(rs1.rank1(0), 0);
    }

    #[test]
    fn test_large_allzero() {
        let rs = RankSelectAllZero::new(1_000_000);
        assert_eq!(rs.rank0(500_000), 500_000);
        assert_eq!(rs.rank1(500_000), 0);
        assert_eq!(rs.select0(999_999).unwrap(), 999_999);
        assert_eq!(rs.max_rank0(), 1_000_000);
        assert_eq!(rs.mem_size(), std::mem::size_of::<RankSelectAllZero>());
    }

    #[test]
    fn test_large_allone() {
        let rs = RankSelectAllOne::new(1_000_000);
        assert_eq!(rs.rank1(500_000), 500_000);
        assert_eq!(rs.rank0(500_000), 0);
        assert_eq!(rs.select1(999_999).unwrap(), 999_999);
        assert_eq!(rs.max_rank1(), 1_000_000);
    }

    #[test]
    fn test_allzero_select_boundary() {
        let rs = RankSelectAllZero::new(10);
        assert_eq!(rs.select0(0).unwrap(), 0);
        assert_eq!(rs.select0(9).unwrap(), 9);
        assert!(rs.select0(10).is_err());
    }

    #[test]
    fn test_allone_select_boundary() {
        let rs = RankSelectAllOne::new(10);
        assert_eq!(rs.select1(0).unwrap(), 0);
        assert_eq!(rs.select1(9).unwrap(), 9);
        assert!(rs.select1(10).is_err());
    }
}