aurora-db 0.5.7

A lightweight, real-time embedded database with built-in PubSub, reactive queries, background workers, and intelligent caching.
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

use roaring::RoaringBitmap;
use serde::{Deserialize, Serialize};

#[derive(Debug, Clone, Serialize, Deserialize)]
pub enum IndexStorage {
    Single(u32),
    List(Vec<u32>),
    Bitmap(RoaringBitmap),
}

pub enum IndexStorageIter<'a> {
    Single(std::iter::Once<u32>),
    List(std::slice::Iter<'a, u32>),
    Bitmap(roaring::bitmap::Iter<'a>),
}

impl<'a> Iterator for IndexStorageIter<'a> {
    type Item = u32;
    fn next(&mut self) -> Option<Self::Item> {
        match self {
            IndexStorageIter::Single(i) => i.next(),
            IndexStorageIter::List(i) => i.next().copied(),
            IndexStorageIter::Bitmap(i) => i.next(),
        }
    }
}

impl IndexStorage {
    pub fn new() -> Self {
        IndexStorage::Bitmap(RoaringBitmap::new())
    }

    pub fn add(&mut self, id: u32) {
        match self {
            IndexStorage::Single(old_id) => {
                if *old_id != id {
                    *self = IndexStorage::List(vec![*old_id, id]);
                }
            }
            IndexStorage::List(list) => {
                if !list.contains(&id) {
                    list.push(id);
                    if list.len() > 16 {
                        let mut bitmap = RoaringBitmap::new();
                        for &i in list.iter() {
                            bitmap.insert(i);
                        }
                        bitmap.insert(id);
                        *self = IndexStorage::Bitmap(bitmap);
                    }
                }
            }
            IndexStorage::Bitmap(bitmap) => {
                bitmap.insert(id);
            }
        }
    }

    pub fn remove(&mut self, id: u32) {
        match self {
            IndexStorage::Single(old_id) => {
                if *old_id == id {
                    *self = IndexStorage::Bitmap(RoaringBitmap::new());
                }
            }
            IndexStorage::List(list) => {
                list.retain(|&i| i != id);
            }
            IndexStorage::Bitmap(bitmap) => {
                bitmap.remove(id);
            }
        }
    }

    pub fn len(&self) -> usize {
        match self {
            IndexStorage::Single(_) => 1,
            IndexStorage::List(list) => list.len(),
            IndexStorage::Bitmap(bitmap) => bitmap.len() as usize,
        }
    }

    pub fn is_empty(&self) -> bool {
        self.len() == 0
    }

    pub fn to_bitmap(&self) -> RoaringBitmap {
        match self {
            IndexStorage::Single(id) => {
                let mut b = RoaringBitmap::new();
                b.insert(*id);
                b
            }
            IndexStorage::List(list) => {
                let mut b = RoaringBitmap::new();
                for &i in list {
                    b.insert(i);
                }
                b
            }
            IndexStorage::Bitmap(bitmap) => bitmap.clone(),
        }
    }

    pub fn iter(&self) -> IndexStorageIter<'_> {
        match self {
            IndexStorage::Single(id) => IndexStorageIter::Single(std::iter::once(*id)),
            IndexStorage::List(list) => IndexStorageIter::List(list.iter()),
            IndexStorage::Bitmap(bitmap) => IndexStorageIter::Bitmap(bitmap.iter()),
        }
    }
}

impl Default for IndexStorage {
    fn default() -> Self {
        Self::new()
    }
}