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
use std::ops::RangeInclusive;
use idx_sized::RowSet;
use crate::ConditionField;
use crate::Data;
#[derive(Clone,Copy,PartialEq)]
pub enum ConditionActivity{
Active
,Inactive
}
#[derive(Clone,Copy,PartialEq)]
pub enum ConditionTerm{
In(i64)
,Past(i64)
,Future(i64)
}
pub enum ConditionRow{
Min(u32)
,Max(u32)
,Range(RangeInclusive<u32>)
,In(Vec<u32>)
}
pub enum SearchCondition{
Activity(ConditionActivity)
,Term(ConditionTerm)
,Field(String,ConditionField)
,Row(ConditionRow)
}
pub struct Reducer<'a>{
data:&'a Data
,result:RowSet
}
impl<'a> Reducer<'a>{
pub fn new(data:&'a Data,result:RowSet)->Reducer{
Reducer{
data
,result
}
}
pub fn get(self)->RowSet{
self.result
}
pub fn search(mut self,condition:&SearchCondition)->Self{
if self.result.len()>0{
let search=self.data.search(condition);
self.reduce(search.result);
}
self
}
pub fn reduce_default(mut self)->Self{
if self.result.len()>0{
self.reduce(
self.data.search_term(&ConditionTerm::In(chrono::Local::now().timestamp())).result
);
self.reduce(
self.data.search_activity(&ConditionActivity::Active).result
);
}
self
}
fn reduce(&mut self,newset:RowSet){
self.result=newset.intersection(&self.result).map(|&x|x).collect();
}
}