allen-intervals 0.1.0

An efficient implementation of Allen's interval relations for Rust's range types.
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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168

use core::ops::{RangeTo, RangeToInclusive};

use crate::{
    Contains, Equals, Finishes, Interval, IntervalFrom, IntervalFull, Meets, NonEmpty, Overlaps,
    Precedes, Starts,
};

/// An interval only bounded exclusively, or inclusively above (`..end`, or `..=end`).
///
/// The RangeTo ..end contains all values with `x < end`, if `T` is a discrete domain,
/// or `x <= end`, if `T` is a continuous domain.
#[derive(Clone, Copy, Debug, Hash, Eq, PartialEq)]
pub struct IntervalTo<T> {
    /// The upper bound of the interval (exclusive, or inclusive).
    pub end: T,
}

impl<T> From<RangeTo<T>> for IntervalTo<T> {
    fn from(value: RangeTo<T>) -> Self {
        Self { end: value.end }
    }
}

impl<T> From<IntervalTo<T>> for RangeTo<T> {
    fn from(value: IntervalTo<T>) -> Self {
        ..(value.end)
    }
}

impl<T> From<RangeToInclusive<T>> for IntervalTo<T> {
    fn from(value: RangeToInclusive<T>) -> Self {
        let end = value.end;
        Self { end }
    }
}

impl<T> From<IntervalTo<T>> for RangeToInclusive<T> {
    fn from(value: IntervalTo<T>) -> Self {
        ..=(value.end)
    }
}

// IntervalTo<T> vs. IntervalFull

impl<T> Precedes<NonEmpty<IntervalFull>> for NonEmpty<IntervalTo<T>> {}

impl<T> Meets<NonEmpty<IntervalFull>> for NonEmpty<IntervalTo<T>> {}

impl<T> Overlaps<NonEmpty<IntervalFull>> for NonEmpty<IntervalTo<T>> {}

impl<T> Starts<NonEmpty<IntervalFull>> for NonEmpty<IntervalTo<T>> {}

impl<T> Contains<NonEmpty<IntervalFull>> for NonEmpty<IntervalTo<T>> {}

impl<T> Finishes<NonEmpty<IntervalFull>> for NonEmpty<IntervalTo<T>> {}

impl<T> Equals<NonEmpty<IntervalFull>> for NonEmpty<IntervalTo<T>> {}

// IntervalTo<T> vs. IntervalTo

impl<T> Precedes<NonEmpty<IntervalTo<T>>> for NonEmpty<IntervalTo<T>> {}

impl<T> Meets<NonEmpty<IntervalTo<T>>> for NonEmpty<IntervalTo<T>> {}

impl<T> Overlaps<NonEmpty<IntervalTo<T>>> for NonEmpty<IntervalTo<T>> {}

impl<T> Starts<NonEmpty<IntervalTo<T>>> for NonEmpty<IntervalTo<T>>
where
    T: PartialOrd,
{
    fn starts(&self, other: &NonEmpty<IntervalTo<T>>) -> bool {
        self.0.end < other.0.end
    }
}

impl<T> Contains<NonEmpty<IntervalTo<T>>> for NonEmpty<IntervalTo<T>> {}

impl<T> Finishes<NonEmpty<IntervalTo<T>>> for NonEmpty<IntervalTo<T>> {}

impl<T> Equals<NonEmpty<IntervalTo<T>>> for NonEmpty<IntervalTo<T>>
where
    T: PartialOrd,
{
    fn equals(&self, other: &NonEmpty<IntervalTo<T>>) -> bool {
        self == other
    }
}

// IntervalTo<T> vs. IntervalFrom

impl<T> Precedes<NonEmpty<IntervalFrom<T>>> for NonEmpty<IntervalTo<T>>
where
    T: PartialOrd,
{
    fn precedes(&self, other: &NonEmpty<IntervalFrom<T>>) -> bool {
        self.0.end < other.0.start
    }
}

impl<T> Meets<NonEmpty<IntervalFrom<T>>> for NonEmpty<IntervalTo<T>>
where
    T: PartialOrd,
{
    fn meets(&self, other: &NonEmpty<IntervalFrom<T>>) -> bool {
        self.0.end == other.0.start
    }
}

impl<T> Overlaps<NonEmpty<IntervalFrom<T>>> for NonEmpty<IntervalTo<T>>
where
    T: PartialOrd,
{
    fn overlaps(&self, other: &NonEmpty<IntervalFrom<T>>) -> bool {
        self.0.end > other.0.start
    }
}

impl<T> Starts<NonEmpty<IntervalFrom<T>>> for NonEmpty<IntervalTo<T>> {}

impl<T> Contains<NonEmpty<IntervalFrom<T>>> for NonEmpty<IntervalTo<T>> {}

impl<T> Finishes<NonEmpty<IntervalFrom<T>>> for NonEmpty<IntervalTo<T>> {}

impl<T> Equals<NonEmpty<IntervalFrom<T>>> for NonEmpty<IntervalTo<T>> {}

// IntervalTo<T> vs. Interval

impl<T> Precedes<NonEmpty<Interval<T>>> for NonEmpty<IntervalTo<T>>
where
    T: PartialOrd,
{
    fn precedes(&self, other: &NonEmpty<Interval<T>>) -> bool {
        self.0.end < other.0.start
    }
}

impl<T> Meets<NonEmpty<Interval<T>>> for NonEmpty<IntervalTo<T>>
where
    T: PartialOrd,
{
    fn meets(&self, other: &NonEmpty<Interval<T>>) -> bool {
        self.0.end == other.0.start
    }
}

impl<T> Overlaps<NonEmpty<Interval<T>>> for NonEmpty<IntervalTo<T>>
where
    T: PartialOrd,
{
    fn overlaps(&self, other: &NonEmpty<Interval<T>>) -> bool {
        (self.0.end > other.0.start) && (self.0.end < other.0.end)
    }
}

impl<T> Starts<NonEmpty<Interval<T>>> for NonEmpty<IntervalTo<T>> {}

impl<T> Contains<NonEmpty<Interval<T>>> for NonEmpty<IntervalTo<T>>
where
    T: PartialOrd,
{
    fn contains(&self, other: &NonEmpty<Interval<T>>) -> bool {
        self.0.end > other.0.end
    }
}

impl<T> Finishes<NonEmpty<Interval<T>>> for NonEmpty<IntervalTo<T>> {}

impl<T> Equals<NonEmpty<Interval<T>>> for NonEmpty<IntervalTo<T>> {}