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

use core::ops::RangeFull;

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

/// An unbounded interval (`..`).
#[derive(Clone, Copy, Debug, Hash, Eq, PartialEq)]
pub struct IntervalFull;

impl From<RangeFull> for IntervalFull {
    fn from(_value: RangeFull) -> Self {
        Self
    }
}

impl From<IntervalFull> for RangeFull {
    fn from(_value: IntervalFull) -> Self {
        Self
    }
}

// IntervalFull vs. IntervalFull

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

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

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

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

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

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

impl Equals<NonEmpty<IntervalFull>> for NonEmpty<IntervalFull> {
    #[inline]
    fn equals(&self, _other: &NonEmpty<IntervalFull>) -> bool {
        true
    }
}

// IntervalFull vs. IntervalTo

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

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

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

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

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

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

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

// IntervalFull vs. IntervalFrom

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

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

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

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

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

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

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

// IntervalFull vs. Interval

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

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

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

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

impl<T> Contains<NonEmpty<Interval<T>>> for NonEmpty<IntervalFull> {
    fn contains(&self, _other: &NonEmpty<Interval<T>>) -> bool {
        true
    }
}

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

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