arthas 0.3.0

Arthas is an in-memory structure database.
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


pub mod node;
pub mod rc;
pub mod inserter;
pub mod searcher;
pub mod deleter;
pub mod math;
pub mod comparision;
pub mod cmp;
pub mod action;
pub mod len;

use std::collections::HashMap;
use serde_json::Value;
use traits::{Structure, FieldIntMap};
use query::{Query, QueryType};
use error::Error;
use item::{Id, FieldInt};
use self::rc::{RcNode, RcItem};
use self::inserter::Inserter;
use self::searcher::Searcher;
use self::deleter::Deleter;
use utils::hash_map::revert;
use scoped_pool::Pool;


pub struct Tree {
    pub int_field_map: FieldIntMap,
    pub id_map: HashMap<Id, RcItem>,
    pub root: HashMap<FieldInt, RcNode>,
    pub min: HashMap<FieldInt, RcNode>,
    pub max: HashMap<FieldInt, RcNode>,
    pub searcher: Searcher,
}

impl Tree {
    pub fn new<T: Structure>() -> Tree {
        Tree {
            int_field_map: revert(T::get_field_int_map()),
            id_map: HashMap::new(),
            root: HashMap::new(),
            min: HashMap::new(),
            max: HashMap::new(),
            searcher: Searcher::new(),
        }
    }

    pub fn insert(&mut self, id: Id, value: Value) {
        Inserter::insert(self, id, value);
    }

    pub fn delete(&mut self, id: &str) {
        Deleter::delete(self, id);
    }

    pub fn clear(&mut self) {
        Deleter::clear(self);
    }

    pub fn search<T: Structure>(&self,
                                pool: &Pool,
                                query: &Query<T>,
                                query_type: &QueryType)
                                -> Result<(usize, Vec<*const Value>), Error> {
        self.searcher.search(pool, self, query, query_type)
    }
}