meminterval 0.4.2

A simple interval-tree in Rust made to store memory mappings
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

use core::{
    cmp::{max, min, Eq, Ord, Ordering, PartialEq, PartialOrd},
    fmt::{Debug, Display},
    ops::{Range, RangeInclusive},
};
use num_traits::{CheckedAdd, One};
#[cfg(feature = "serde")]
use serde::{Deserialize, Serialize};

#[derive(Debug, Copy, Clone)]
#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
pub struct Interval<T: Ord> {
    pub start: T,
    pub end: T,
}

impl<T: Ord> Interval<T> {
    pub fn new(start: T, end: T) -> Self {
        Interval { start, end }
    }

    pub fn is_valid(&self) -> bool {
        self.start < self.end
    }
}

impl<T: Ord + Clone> Interval<T> {
    pub fn intersect(&self, other: &Self) -> Option<Self> {
        let result = Interval::new(
            max(self.start.clone(), other.start.clone()),
            min(self.end.clone(), other.end.clone()),
        );
        if result.is_valid() {
            Some(result)
        } else {
            None
        }
    }
}

impl<T: Ord> PartialEq for Interval<T> {
    fn eq(&self, other: &Self) -> bool {
        self.start == other.start && self.end == other.end
    }
}

impl<T: Ord> Eq for Interval<T> {}

impl<T: Ord> PartialOrd for Interval<T> {
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        Some(match self.start.cmp(&other.start) {
            Ordering::Equal => self.end.cmp(&other.end),
            ord => ord,
        })
    }
}

impl<T: Ord> Ord for Interval<T> {
    fn cmp(&self, other: &Self) -> Ordering {
        self.partial_cmp(other).unwrap()
    }
}

impl<T: Ord + Display> Display for Interval<T> {
    fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
        write!(f, "{}..{}", self.start, self.end)
    }
}

impl<T: Ord + Clone> From<Range<T>> for Interval<T> {
    fn from(range: Range<T>) -> Self {
        Interval::new(range.start.clone(), range.end.clone())
    }
}

impl<T: Ord + Clone> From<&Range<T>> for Interval<T> {
    fn from(range: &Range<T>) -> Self {
        Interval::new(range.start.clone(), range.end.clone())
    }
}

impl<T: Ord + Clone + CheckedAdd + One> From<RangeInclusive<T>> for Interval<T> {
    fn from(range: RangeInclusive<T>) -> Self {
        Interval::new(range.start().clone(), range.end().clone() + T::one())
    }
}

impl<T: Ord + Clone + CheckedAdd + One> From<&RangeInclusive<T>> for Interval<T> {
    fn from(range: &RangeInclusive<T>) -> Self {
        Interval::new(range.start().clone(), range.end().clone() + T::one())
    }
}