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
use ;
use ;
use Filter;
use Schedule;
use TaskResults;
//use std::collections::BinaryHeap;
//use std::time::{Instant};
//use std::cmp::{PartialOrd, PartialEq, Eq, Ordering};
//use std::collections::VecDeque;
//use std::mem;
// add task:
// - task
// - at micro sec
// current time micro sec:
// ->
// callback:
// - add to looped tasks
/*
struct Item {
at : Instant,
task : Box<Task>,
}
impl Ord for Item {
fn cmp(&self, other:&Self) -> Ordering {
if self.at < other.at {
Ordering::Less
} else if self.at > other.at {
Ordering::Greater
} else {
Ordering::Equal
}
}
}
impl PartialOrd for Item {
fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
Some(self.cmp(other))
}
}
impl PartialEq for Item {
fn eq(&self, other: &Self) -> bool {
if self.at == other.at {
true
} else {
false
}
}
}
impl Eq for Item { }
pub struct TimeTriggered {
items : BinaryHeap<Item>,
}
impl TimeTriggered {
pub fn add(&mut self, at: Instant, task: Box<Task>) {
self.items.push(Item{at: at, task: task});
}
}
*/
/*
pub fn new() -> TimeTriggered {
TimeTriggered {
items : BinaryHeap::new(),
}
}
*/