flinch/
range.rs

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
use std::collections::{BTreeMap, BTreeSet};
use std::fmt::{Debug, Display};
use std::hash::Hash;
use std::ops::Bound;

use dashmap::{DashMap, DashSet};
use log::trace;
use serde::de::DeserializeOwned;
use serde::Serialize;

use crate::doc_trait::Document;

pub struct Range<K> {
    pub tree: DashMap<String, BTreeMap<String, DashSet<K>>>,
}

impl<K> Range<K>
    where K: Serialize
    + DeserializeOwned
    + PartialOrd
    + Ord
    + PartialEq
    + Eq
    + Hash
    + Clone
    + Send
    + Debug
    + Display
    + 'static
{
    pub fn new() -> Self {
        Self {
            tree: DashMap::new()
        }
    }

    pub fn put<D>(&self, k: &K, v: &D) where D: Document {
        v.fields().into_iter().for_each(|f| {
            let val = f.value;
            match self.tree.get_mut(&f.key) {
                None => {
                    let mut tree = BTreeMap::new();
                    let set = DashSet::new();
                    set.insert(k.clone());
                    tree.insert(val, set);
                    self.tree.insert(f.key, tree);
                }
                Some(mut tree) => match tree.get_mut(&val) {
                    None => {
                        let set = DashSet::new();
                        set.insert(k.clone());
                        tree.value_mut().insert(val, set);
                    }
                    Some(set) => {
                        set.insert(k.clone());
                    }
                }
            }
        });
    }

    pub fn delete<D>(&self, k: &K, d: &D) where D: Document {
        trace!("deleting range for key - {}",&k);
        d.fields().into_iter().for_each(|f| {
            if let Some(mut tree) = self.tree.get_mut(&f.key) {
                if let Some(set) = tree.value_mut().get_mut(&f.value) {
                    set.insert(k.clone());
                }
            }
        });
    }

    pub fn delete_tree(&self, f: &str) {
        trace!("deleting range tree {}",&f);
        self.tree.remove(f);
    }

    pub fn clear_trees(&self) {
        let non_ref = self.tree.clone();
        for kv in non_ref {
            self.delete_tree(kv.0.as_str());
        }
    }

    pub fn range(&self, f: &str, from: String, to: String) -> Vec<K> {
        match self.tree.get(f) {
            None => BTreeSet::new(),
            Some(tree) => {
                let mut res = BTreeSet::new();
                for (_, set) in tree.range((Bound::Included(from), Bound::Included(to))) {
                    for el in set.iter() {
                        res.insert(el.key().clone());
                    }
                }
                res
            }
        }.into_iter().collect::<Vec<K>>()
    }
}