zinzen 0.3.0

Algorithm for auto-scheduling time-constrained tasks on a timeline
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

use std::collections::HashSet;
use std::fmt;
use std::fmt::Debug;

use crate::models::interval::Interval;

#[derive(Debug, Clone)]
pub struct CalendarInterval {
    pub interval: Interval,
    pub status: CalIntStatus,
}

impl CalendarInterval {
    pub(crate) fn claim_by(&mut self, act_index: usize) {
        self.status.claim_by(act_index);
    }
}

#[derive(Clone)]
pub enum CalIntStatus {
    Claimable(HashSet<usize>),
    Occupied(usize, String),
    //TODO: add goal id and budget id to occupied registration so budget object is not necessary anymore!locked,
}

impl CalIntStatus {
    pub(crate) fn claim_by(&mut self, act_index: usize) {
        match self {
            CalIntStatus::Claimable(ref mut claims) => claims.insert(act_index),
            CalIntStatus::Occupied { .. } => false,
        };
    }
}

impl Debug for CalIntStatus {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        match self {
            CalIntStatus::Claimable(claims) => {
                write!(f, "Number of claims: {}", claims.len()).expect("expecting result");
                for act_index in claims {
                    write!(f, "\nby {}", &act_index).expect("expecting result");
                }
                Ok(())
            }
            CalIntStatus::Occupied(act_index, goal_id) => {
                write!(
                    f,
                    "Occupied {{ act_index {}, goal_id ...{} }}",
                    act_index,
                    &goal_id[goal_id.len().saturating_sub(5)..]
                )
                .expect("expecting result");
                Ok(())
            }
        }
    }
}