mace-kv 0.0.31

A fast, cross-platform embedded key-value storage engine with ACID, MVCC, and flash-optimized storage
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

use std::fmt::{Debug, Formatter};

#[derive(Clone)]
pub(crate) struct BitMap {
    cap: u32,
    data: Vec<u64>,
}

const POWER: u32 = 6;
const BITS: u32 = 64;
const MASK: u32 = BITS - 1;

impl BitMap {
    /// cap is the target count
    pub(crate) fn new(cap: u32) -> Self {
        let cap = match cap % BITS {
            0 => cap / BITS,
            _ => cap / BITS + 1,
        };

        Self {
            cap,
            data: vec![0u64; cap as usize],
        }
    }

    pub(crate) fn set(&mut self, bit: u32) {
        self.data[(bit >> POWER) as usize] |= 1 << (bit & MASK);
    }

    #[allow(unused)]
    pub(crate) fn del(&mut self, bit: u32) {
        self.data[(bit >> POWER) as usize] &= !(1 << (bit & MASK));
    }

    pub(crate) fn test(&self, bit: u32) -> bool {
        self.data[(bit >> POWER) as usize] & (1 << (bit & MASK)) != 0
    }

    #[allow(unused)]
    pub(crate) fn len(&self) -> usize {
        self.data.len()
    }

    #[allow(unused)]
    pub(crate) fn clear(&mut self) {
        self.data.fill(0);
    }

    #[cfg(test)]
    pub(crate) fn iter(&'_ self) -> BitMapIter<'_> {
        BitMapIter {
            m: self,
            idx: 0,
            end: self.bits(),
        }
    }

    pub(crate) fn bits(&self) -> u32 {
        self.cap * BITS
    }
}

#[cfg(test)]
pub(crate) struct BitMapIter<'a> {
    m: &'a BitMap,
    idx: u32,
    end: u32,
}

#[cfg(test)]
impl Iterator for BitMapIter<'_> {
    type Item = (bool, u32);
    fn next(&mut self) -> Option<Self::Item> {
        if self.idx < self.end {
            let r = Some((self.m.test(self.idx), self.idx));
            self.idx += 1;
            return r;
        }
        None
    }
}

impl Debug for BitMap {
    fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {
        let mut bits = vec![0u8; self.bits() as usize];
        for i in 0..self.bits() {
            if self.test(i) {
                bits[i as usize] = 1;
            }
        }
        f.write_fmt(format_args!("{bits:?}"))
    }
}

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

    #[test]
    fn bitmap() {
        let mut m = BitMap::new(32);

        assert_eq!(m.len(), 1);

        for i in 0..32 {
            m.set(i);
        }

        for i in 0..32 {
            assert!(m.test(i));
            m.del(i);
        }

        for i in 0..64 {
            assert!(!m.test(i));
        }

        let mut m = BitMap::new(12);
        for i in 0..12 {
            m.set(i);
        }

        for i in 0..12 {
            assert!(m.test(i));
        }

        let cnt = m.iter().filter(|x| x.0).count();
        assert_eq!(cnt, 12);
    }
}