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
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


use std::collections::HashSet;
use super::super::comparision::Comparision;
use item::FieldInt;
use query::{Query, Order, QueryType};
use super::super::rc::RcChild;

pub type Subs = Vec<Sub>;
pub type Orders = Vec<(String, Order)>;

#[derive(Debug)]
pub struct Sub {
    pub field_int: FieldInt,
    pub comparisions: Vec<Comparision>,
    pub order: Option<Order>,
    pub stopped: bool,
}

impl Sub {
    pub fn _match(&self, rc_child: &RcChild) -> bool {
        let child = rc_child.read().unwrap();
        let item = child.item.read().unwrap();
        let rc_data = item.datas.get(&self.field_int).unwrap();
        let data = rc_data.read().unwrap();
        let value = data.get_value();

        for comparision in &self.comparisions {
            if !comparision._match(value) {
                return false;
            }
        }
        true
    }
}


#[derive(Default, Debug)]
pub struct Task {
    pub subs: Subs,
    pub orders: Orders,
    pub order_field: Option<String>,
    pub order: Option<Order>,
    pub offset: usize,
    pub limit: Option<usize>,
    pub query_type: QueryType,
    pub subs_length: usize,
    pub current: usize,
}

impl Task {
    pub fn new<T>(query: &Query<T>, query_type: &QueryType) -> Task {
        let (subs_length, subs) = Self::create_subs(query);
        let orders = Self::create_orders(query);
        let order_field = if let Some(order) = orders.first() {
            Some(order.0.to_owned())
        } else {
            None
        };
        let order = if let Some(order) = orders.first() {
            Some(order.1.clone())
        } else {
            None
        };

        Task {
            subs: subs,
            orders: orders,
            order: order,
            offset: query.offset.unwrap_or(0),
            limit: query.limit.clone(),
            query_type: query_type.clone(),
            subs_length: subs_length,
            order_field: order_field,
            current: 0,
        }
    }

    fn create_orders<T>(query: &Query<T>) -> Orders {
        let mut fields = HashSet::new();
        let mut orders = Vec::new();

        for tup in &query.orders {
            if fields.contains(&tup.0) {
                continue;
            } else {
                orders.push(tup.clone());
                fields.insert(tup.0.clone());
            }
        }

        orders
    }

    fn create_subs<T>(query: &Query<T>) -> (usize, Subs) {
        let mut subs_length = 0;
        let mut subs = Vec::new();

        for (field_int, comparisions) in &query.conditions {
            subs_length += 1;
            let mut sub_order = None;

            if !query.orders.is_empty() {
                let order = query.orders.first().unwrap();
                if field_int == &order.0 {
                    sub_order = Some(order.1.clone());
                }
            }

            subs.push(Sub {
                field_int: field_int.to_owned(),
                comparisions: comparisions.clone(),
                order: sub_order,
                stopped: false,
            });
        }

        (subs_length, subs)
    }

    pub fn get_order_field(&self) -> &str {
        self.order_field.as_ref().unwrap()
    }

    pub fn has_order(&self) -> bool {
        self.order_field.is_some()
    }
}