chronologic 0.7.12

Time constraint reasoning (scheduling...)
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

use std::iter::FusedIterator;
use crate::{TimePoint, Timestamp, Timestamped, TimeValue};
use crate::seq::{TimeSeqBackward, TimeSeqForward, TimeSequence};


impl Timestamped for TimeSeqBackward {

    #[inline] fn timestamp(&self) -> Timestamp { self.t }
}

impl TimeSequence for TimeSeqBackward
{
    fn new<T:Timestamped>(t: T, delta: TimeValue) -> Self
    {
        assert!( delta.is_strictly_positive(), "sequence interval should be strictly positive" );
        let t = t.timestamp() - delta; // so we will start at t
        assert!( t.is_finite(), "infinite start value");
        Self { t, step: delta }
    }

    #[inline]
    fn reverse(self) -> impl TimeSequence {
        TimeSeqForward { t: self.t, step: self.step }
    }

    #[inline]
    fn increment(&self) -> TimeValue { - self.step }

    #[inline]
    fn period(&self) -> TimeValue { self.step }

    fn len(&self) -> usize
    {
        if self.t.0.is_strictly_negative() {
            (self.t.0.as_ticks() - i64::MIN) as usize / self.step.as_ticks() as usize
        } else {
            self.t.0.as_ticks() as usize + i64::MAX as usize + 1 / self.step.as_ticks() as usize
        }
    }
}

impl FusedIterator for TimeSeqBackward { }


impl Iterator for TimeSeqBackward {

    type Item = Timestamp;

    #[inline]
    fn next(&mut self) -> Option<Timestamp>
    {
        self.t -= self.step;
        (!self.t.is_past_infinite()).then_some(self.t)
    }

    #[inline]
    fn size_hint(&self) -> (usize, Option<usize>)
    {
        let n = self.len();
        (n,Some(n))
    }

    #[inline]
    fn count(self) -> usize {
        self.len()
    }

    fn last(self) -> Option<Self::Item>
    {
        let n = self.len();
        (n > 0).then_some(self.t - n*self.step)
    }


    fn nth(&mut self, n: usize) -> Option<Self::Item>
    {
        if self.len() < n {
            self.t = -Timestamp::INFINITE;
            None
        } else {
            self.t -= self.step * n;
            Some(self.t)
        }
    }
}