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

extern crate theban_interval_tree;
extern crate memrange;

use self::memrange::Range;
use self::theban_interval_tree::IntervalTree;
use self::theban_interval_tree::RangePairIter;

use std::collections::BTreeMap;
use std::u64;

use content::Object;
use content::Bitmap;
use db_iterator::BitmapSliceIter;

pub struct DB {
    pub obj_map: BTreeMap<String, IntervalTree<Object>>,
    pub bit_map: BTreeMap<String, IntervalTree<Bitmap>>,
}

impl DB {
    pub fn new() -> DB {
        return DB { obj_map: BTreeMap::new(), bit_map: BTreeMap::new() };
    }

    pub fn new_from_data(obj_map: BTreeMap<String, IntervalTree<Object>>, bit_map: BTreeMap<String, IntervalTree<Bitmap>>) -> DB {
        return DB { obj_map: obj_map, bit_map: bit_map };
    }

    pub fn insert_object(&mut self, table: &String, r: Range, d: Object) {
        self.add_table(table);
        let mut tree = self.obj_map.get_mut(table).unwrap();
        tree.insert(r, d);
    }

    pub fn query_object(&self, table: &String, r: Range) -> Option<RangePairIter<Object>> {
        return self.obj_map.get(table).map(|tree| tree.range(r.min, r.max));
    }
    
    pub fn query_bitmap<'a>(&'a self, table: &String, r: Range) -> Option<BitmapSliceIter<'a>> {
        return self.bit_map.get(table).map(|tree| BitmapSliceIter::new(tree.range(r.min, r.max), r));
    }

    pub fn delete_object(&mut self, table: &String, r: Range) {
        if let Some(mut tree) = self.obj_map.get_mut(table) {
            tree.delete(r)
        };
    }

    pub fn delete_intersecting_objects(&mut self, table: &String, r: Range) {
        let ranges = if let Some(iter) = self.query_object(table, r) {
            iter.map(|(range, _)| range.clone()).collect::<Vec<Range>>()
        } else {
            vec![]
        };
        for range in ranges {
            self.delete_object(table, range)
        }
    }

    fn get_overlaping_bitmaps(&mut self,
                              table: &String,
                              r: Range,
                              entry_size: u64)
                              -> Vec<(Range, Bitmap)> {
        let mut res = vec![];
        if let Some(iter) = self.bit_map.get(table).map(|tree| tree.range(r.min,r.max)) {
            for (ref rng, ref cont) in iter {
                if cont.entry_size == entry_size && (*rng).intersect(&r) {
                    res.push((**rng, (*cont).clone()));
                }
            }
        }
        return res;
    }

    fn delete_bitmaps_from_tree(&mut self, table: &String, bitmaps: &Vec<(Range, Bitmap)>) {
        for &(rng, _) in bitmaps {
            self.bit_map.get_mut(table).map(|mut tree| { tree.delete(rng) });
        };
    }

    pub fn insert_bitmap(&mut self, table: &String, r: Range, d: Bitmap) {
            assert_eq!(d.data.len() as u64, d.entry_size * r.len());
            self.add_table(table);

            let merge_partners = self.get_overlaping_bitmaps(table, r.get_extended(), d.entry_size);

            self.delete_bitmaps_from_tree(table, &merge_partners);
            let (new_range, new_bitmap) = d.merge_bitmaps(r, merge_partners);

            let mut tree = self.bit_map.get_mut(table).unwrap();
            tree.insert(new_range, new_bitmap);
    }

    fn insert_subrange_bitmap(&mut self,
                              table: &String,
                              old_range: Range,
                              new_range: Range,
                              old_bitmap: &Bitmap,
                                ) {
        let data = old_bitmap.to_subbitmap(old_range, new_range);
        let mut tree = self.bit_map.get_mut(table).unwrap();
        tree.insert(new_range, data);
    }

    fn add_trunkated_version_of_bitmap(&mut self,
                                       table: &String,
                                       old_range: Range,
                                       old_bitmap: Bitmap,
                                       range_to_remove: Range) {

        let (first,last) = old_range.get_difference(&range_to_remove);
        if let Some(first_part) = first {
            self.insert_subrange_bitmap(table, old_range, first_part, &old_bitmap)
        }
        if let Some(last_part) = last {
            self.insert_subrange_bitmap(table, old_range, last_part, &old_bitmap)
        }
    }

    pub fn delete_bitmap(&mut self, table: &String,entry_size: u64, range_to_remove: Range) {
        let bitmaps_to_delete = self.get_overlaping_bitmaps(table, range_to_remove, entry_size);
        self.delete_bitmaps_from_tree(table, &bitmaps_to_delete);
        for (rng, data) in bitmaps_to_delete {
            self.add_trunkated_version_of_bitmap(table, rng, data, range_to_remove.get_extended());
        }
    }

    fn add_table(&mut self, table: &String) {
        if !self.has_table(&table) {
            self.obj_map.insert(table.clone(), IntervalTree::new());
            self.bit_map.insert(table.clone(), IntervalTree::new());
        }
    }

    pub fn has_table(& self, table: &String) -> bool {
        assert!(self.obj_map.contains_key(table) == self.bit_map.contains_key(table));
        return self.obj_map.contains_key(table);
    }
}

#[test]
fn test_ranges() {
    let mut db = DB::new();
    let tbl = "foo".to_string();
    db.insert_object(&tbl,
              Range::new(3, 4),
              Object{data: "foo".into() } );
    db.insert_object(&tbl,
              Range::new(4, 5),
              Object{data: "foo".into() } );
    db.insert_object(&tbl,
              Range::new(5, 6),
              Object{ data:"foo".into() } );
    let mut is = db.query_object(&tbl, Range::new(4, 4))
                   .unwrap()
                   .map(|(r, _)| r.clone())
                   .collect::<Vec<Range>>();
    assert_eq!(is, vec![Range::new(3, 4), Range::new(4, 5)]);
    db.delete_intersecting_objects(&tbl, Range::new(3, 4));
    is = db.query_object(&tbl, Range::new(0, 100))
           .unwrap()
           .map(|(r, _)| r.clone())
           .collect::<Vec<Range>>();
    assert_eq!(is, vec![Range::new(5, 6)]);

    assert!(db.query_object(&"bar".to_string(), Range::new(0, 100)).is_none());
}

#[cfg(test)]
fn query_bitmap_test(db: &mut DB, tbl: &String, rng: Range) -> Vec<(Range,Bitmap)>{
    return db.query_bitmap(&tbl, rng)
                   .unwrap()
                   .map(|(r, data)| (r.clone(), data.to_bitmap()) )
                   .collect::<Vec<(Range,Bitmap)>>();
}

#[test]
fn test_bitmaps_insert() {
    let mut db = DB::new();
    let tbl = "tbl".to_string();

    db.insert_bitmap(&tbl,
              Range::new(2, 7),
              Bitmap{ entry_size: 1, data: "foofoo".into() }
              );

    db.insert_bitmap(&tbl,
              Range::new(5, 10),
              Bitmap{ entry_size: 1, data: "barbar".into() }
              );

    let is = query_bitmap_test(&mut db, &tbl, Range::new(0, 50));
    assert_eq!(is, vec![(Range::new(2, 10), Bitmap{entry_size: 1, data: "foobarbar".into() } ) ]);

    db.insert_bitmap(&tbl,
              Range::new(7, 9),
              Bitmap{ entry_size: 1, data: "goo".into() }
              );

    let is = query_bitmap_test(&mut db, &tbl, Range::new(0, 50));
    assert_eq!(is, vec![(Range::new(2, 10), Bitmap{entry_size: 1, data: "foobagoor".into() } ) ]);

    db.insert_bitmap(&tbl,
              Range::new(7, 9),
              Bitmap{ entry_size: 2, data: "googoo".into() }
              );

    let is = query_bitmap_test(&mut db, &tbl, Range::new(0, 50));
    assert_eq!(is, vec![
               (Range::new(2, 10), Bitmap{entry_size: 1, data: "foobagoor".into() } ), 
               (Range::new(7, 9), Bitmap{entry_size: 2, data: "googoo".into() } )
               ]);

    let is = query_bitmap_test(&mut db, &tbl, Range::new(0, 3));
    assert_eq!(is, vec![
               (Range::new(2, 3), Bitmap{entry_size: 1, data: "fo".into() } ), 
               ]);

    db.delete_bitmap(&tbl,1, Range::new(0, 1000));
    db.delete_bitmap(&tbl,2, Range::new(0, 1000));
    db.delete_bitmap(&tbl,3, Range::new(0, 1000));

    let is = query_bitmap_test(&mut db, &tbl, Range::new(0, 1000));
    assert_eq!(is, vec![ ]);

    db.insert_bitmap(&tbl,
              Range::new(0, 10),
              Bitmap{ entry_size: 1, data: "googooazabu".into() }
              );
    db.delete_bitmap(&tbl,1, Range::new(2, 3));
    let is = query_bitmap_test(&mut db, &tbl, Range::new(0, 1000));

    assert_eq!(is, vec![
               (Range::new(0, 1), Bitmap{entry_size: 1, data: "go".into() } ), 
               (Range::new(4, 10), Bitmap{entry_size: 1, data: "ooazabu".into() } ), 
               ]);

    db.delete_bitmap(&tbl,1, Range::new(0, 0));
    let is = query_bitmap_test(&mut db, &tbl, Range::new(0, 1000));

    assert_eq!(is, vec![
               (Range::new(1, 1), Bitmap{entry_size: 1, data: "o".into() } ), 
               (Range::new(4, 10), Bitmap{entry_size: 1, data: "ooazabu".into() } ), 
               ]);

}