ssr_facade/
lib.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
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
128
129
130
131
use std::collections::BTreeSet;
use std::time::SystemTime;

use serde::{Deserialize, Serialize};
use ssr_core::{
    task::{SharedStateExt, Task},
    tasks_facade::TasksFacade,
};

#[derive(Serialize, Deserialize)]
#[serde(bound(deserialize = "T: Task<'de>"))]
#[serde(transparent)]
struct TaskWraper<T>(T);
impl<'a, T: Task<'a>> PartialEq for TaskWraper<T> {
    fn eq(&self, other: &Self) -> bool {
        (self.0.next_repetition(0.5)) == (other.0.next_repetition(0.5))
    }
}
impl<'a, T: Task<'a>> Eq for TaskWraper<T> {}
impl<'a, T: Task<'a>> PartialOrd for TaskWraper<T> {
    fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
        Some(self.cmp(other))
    }
}
impl<'a, T: Task<'a>> Ord for TaskWraper<T> {
    fn cmp(&self, other: &Self) -> std::cmp::Ordering {
        (self.0.next_repetition(0.5)).cmp(&other.0.next_repetition(0.5))
    }
}

#[derive(Serialize, Deserialize)]
#[serde(bound(deserialize = "'a: 'de, 'de: 'a"))]
pub struct Facade<'a, T>
where
    T: Task<'a>,
{
    name: String,
    tasks_pool: BTreeSet<TaskWraper<T>>,
    tasks_to_recall: BTreeSet<TaskWraper<T>>,
    target_recall: f64,
    state: T::SharedState,
}

impl<'a, T: Task<'a>> Facade<'a, T> {
    fn find_tasks_to_recall(&mut self) {
        let now = SystemTime::now();
        while let Some(task) = self.tasks_pool.pop_first() {
            if task.0.next_repetition(self.target_recall) <= now {
                self.tasks_to_recall.insert(task);
            } else {
                self.tasks_pool.insert(task);
                break;
            }
        }
    }
}
impl<'a, T: Task<'a>> TasksFacade<'a, T> for Facade<'a, T> {
    fn new(name: String) -> Self {
        Self {
            name,
            tasks_pool: Default::default(),
            tasks_to_recall: Default::default(),
            target_recall: 0.8,
            state: T::SharedState::default(),
        }
    }

    fn get_name(&self) -> &str {
        &self.name
    }

    fn tasks_total(&self) -> usize {
        self.tasks_pool.len() + self.tasks_to_recall.len()
    }

    fn tasks_to_complete(&self) -> usize {
        self.tasks_to_recall.len()
    }

    fn complete_task(
        &mut self,
        interaction: &mut impl FnMut(
            s_text_input_f::Blocks,
        ) -> std::io::Result<s_text_input_f::Response>,
    ) -> Result<(), ssr_core::tasks_facade::Error> {
        self.find_tasks_to_recall();
        if let Some(TaskWraper(mut task)) = self.tasks_to_recall.pop_first() {
            task.complete(&mut self.state, interaction)?;
            self.tasks_pool.insert(TaskWraper(task));
            Ok(())
        } else {
            match self
                .tasks_pool
                .first()
                .map(|TaskWraper(x)| x.next_repetition(self.target_recall))
            {
                Some(next_repetition) => Err(ssr_core::tasks_facade::Error::NoTaskToComplete {
                    time_until_next_repetition: next_repetition.elapsed().unwrap(),
                }),
                None => Err(ssr_core::tasks_facade::Error::NoTask),
            }
        }
    }

    fn insert(&mut self, task: T) {
        self.tasks_pool.insert(TaskWraper(task));
    }

    fn iter<'t>(&'t self) -> impl Iterator<Item = &'t T>
    where
        T: 't,
    {
        self.tasks_pool
            .iter()
            .chain(self.tasks_to_recall.iter())
            .map(|TaskWraper(x)| x)
    }

    fn remove(&mut self, _task: &T) -> bool {
        todo!()
    }
}

impl<'a, T: Task<'a>> Facade<'a, T>
where
    T::SharedState: SharedStateExt<'a>,
{
    pub fn optimize(&mut self) {
        self.state.optimize()
    }
}