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
use std::ops::{Deref, Range};
#[derive(Debug, Clone, Eq, PartialEq, Serialize, Deserialize)]
pub struct Interval<N: Ord + Clone>(Range<N>);
impl<N: Ord + Clone> Interval<N> {
pub fn new(r: Range<N>) -> Result<Interval<N>, IntervalError> {
if r.end >= r.start {
Ok(Interval(r))
} else {
Err(IntervalError::InvalidRange)
}
}
}
impl<N: Ord + Clone> From<Range<N>> for Interval<N> {
fn from(r: Range<N>) -> Self {
match Interval::new(r) {
Ok(interval) => interval,
Err(IntervalError::InvalidRange) => {
panic!("Cannot convert negative width range to interval")
}
}
}
}
impl<'a, N: Ord + Clone> From<&'a Range<N>> for Interval<N> {
fn from(r: &Range<N>) -> Self {
match Interval::new(r.clone()) {
Ok(interval) => interval,
Err(IntervalError::InvalidRange) => {
panic!("Cannot convert negative width range to interval")
}
}
}
}
impl<N: Ord + Clone> Deref for Interval<N> {
type Target = Range<N>;
fn deref(&self) -> &Self::Target {
&self.0
}
}
quick_error! {
#[derive(Debug)]
pub enum IntervalError {
InvalidRange {
description("An Interval must have a Range with a positive width")
}
}
}
#[cfg(test)]
mod tests {
use super::Interval;
#[test]
#[should_panic]
fn negative_width_range() {
let _ = Interval::from(10..5);
}
#[test]
fn range_interval_conversions() {
assert_eq!(Interval::new(1..10).unwrap(), (1..10).into());
assert_eq!(Interval::from(1..10), Interval::new(1..10).unwrap());
let r = Interval::new(1..10).unwrap();
assert_eq!(*r, (1..10));
assert_eq!(r.start, 1);
assert_eq!(r.end, 10);
}
}