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
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
132
133
134
135
136
137
138
139
140
141
142

use std::ops::{BitOr, BitOrAssign};
use crate::*;
use crate::iter::TimeUnion;

//------------ TIME POINTS ------------


impl<TW> BitOr<TW> for TimeValue
    where TW: TimeConvex<TimePoint=TimeValue>
{
    type Output = TimeSet<TimeValue>;
    #[inline] fn bitor(self, tw: TW) -> Self::Output { TimeInterval::singleton(self).bitor(tw) }
}

impl<TW> BitOr<TW> for Timestamp
    where TW: TimeConvex<TimePoint=Timestamp>
{
    type Output = TimeSet<Timestamp>;
    #[inline] fn bitor(self, tw: TW) -> Self::Output { TimeInterval::singleton(self).bitor(tw) }
}

//------------ TIME INTERVALS ------------


impl<T:TimePoint,TW> BitOr<TW> for TimeInterval<T>
    where TW: TimeConvex<TimePoint=T>
{
    type Output = TimeSet<T>;
    #[inline] fn bitor(self, tw: TW) -> Self::Output { (&self).bitor(tw) }
}

impl<T:TimePoint,TW> BitOr<TW> for &TimeInterval<T>
    where TW: TimeConvex<TimePoint=T>
{
    type Output = TimeSet<T>;

    fn bitor(self, tw: TW) -> Self::Output
    {
        if self.is_empty() {
            TimeSet::from(tw)

        } else if tw.is_empty() {
            (*self).into()

        } else if tw.upper_bound() < self.lower.just_before() {
            TimeSet(vec![tw.into(), *self])

        } else if self.upper < tw.lower_bound().just_before() {
            TimeSet(vec![*self, tw.into()])

        } else {
            TimeSet(vec![
                TimeInterval {
                    lower: self.lower.min(tw.lower_bound()),
                    upper: self.upper.max(tw.upper_bound())
                }
            ])
        }
    }
}

//------------ TIME SETS ------------

impl<T:TimePoint,TW> BitOrAssign<TW> for TimeSet<T>
    where TW: TimeConvex<TimePoint=T>
{
    fn bitor_assign(&mut self, tw: TW) {
        // todo: optimise cloning
        *self = self.clone().bitor(tw)
    }
}


impl<T:TimePoint> BitOrAssign<Self> for TimeSet<T>
{
    fn bitor_assign(&mut self, tw: Self) {
        // fixme: suppress cloning
        *self = self.clone().bitor(tw)
    }
}

impl<T:TimePoint> BitOrAssign<&Self> for TimeSet<T>
{
    fn bitor_assign(&mut self, tw: &Self) {
        // fixme: suppress cloning
        *self = self.clone().bitor(tw)
    }
}

impl<T:TimePoint> BitOr<Self> for TimeSet<T>
{
    type Output = Self;
    #[inline] fn bitor(self, tw: Self) -> Self::Output { (&self).bitor(tw) }
}

impl<T:TimePoint> BitOr<&Self> for TimeSet<T>
{
    type Output = Self;
    #[inline] fn bitor(self, tw: &Self) -> Self::Output { (&self).bitor(tw) }
}

impl<T:TimePoint, TW> BitOr<TW> for TimeSet<T>
where TW: TimeConvex<TimePoint=T>
{
    type Output = Self;
    #[inline] fn bitor(self, tw: TW) -> Self::Output { (&self).bitor(tw) }
}


impl<T:TimePoint> BitOr<TimeSet<T>> for &TimeSet<T>
{
    type Output = TimeSet<T>;

    #[inline]
    fn bitor(self, tw: TimeSet<T>) -> Self::Output {
        self.into_iter().union(tw.into_iter()).collect()
    }
}

impl<T:TimePoint> BitOr<Self> for &TimeSet<T>
{
    type Output = TimeSet<T>;

    #[inline]
    fn bitor(self, tw: &TimeSet<T>) -> Self::Output {
        self.into_iter().union(tw.into_iter()).collect()
    }
}



impl<T:TimePoint, TW> BitOr<TW> for &TimeSet<T>
where TW: TimeConvex<TimePoint=T>
{
    type Output = TimeSet<T>;

    #[inline]
    fn bitor(self, tw: TW) -> Self::Output {
        self.into_iter().union(tw.into()).collect()
    }
}