osb 0.3.0

A fast, fully-fledged, scalable and secure implementation of the .osb storyboard file format
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

/// Data structure to associate keys of an interval type to a certain value
pub struct IntervalMap<K, V> {
    points: Vec<(K, Vec<V>)>,
}

impl<K, V> Default for IntervalMap<K, V> {
    fn default() -> Self {
        Self { points: Vec::new() }
    }
}

use std::cmp::{Ord, Ordering::*};
use std::ops::Range;

impl<K, V> IntervalMap<K, V>
where
    K: Ord,
    V: Clone,
{
    /// Initializes a `IntervalMap`
    pub fn new() -> Self {
        Self::default()
    }

    /// Adds a value to our `IntervalMap`.
    ///
    /// In the following example, our value is of integer type, but
    /// it can be anything type that implements the trait `Clone`.
    ///
    /// Usage:
    /// ```
    /// use osb::utils::IntervalMap;
    /// let mut interval_map = IntervalMap::new();
    /// interval_map.push(10..50, 1);
    /// ```
    pub fn push(&mut self, range: Range<K>, value: V) {
        let position = match self
            .points
            .binary_search_by(|&(ref point, _)| point.cmp(&range.start))
        {
            Ok(position) => position,
            Err(position) => {
                self.points.insert(
                    position,
                    (
                        range.start,
                        self.points
                            .get(position.wrapping_sub(1))
                            .map(|(_, values)| values.clone())
                            .unwrap_or_default(),
                    ),
                );
                position
            }
        };
        for (i, point) in self.points.iter_mut().enumerate().skip(position) {
            match point.0.cmp(&range.end) {
                Less => point.1.push(value.clone()),
                Equal => return,
                Greater => {
                    let mut new_point = (range.end, point.1.clone());
                    new_point.1.push(value);
                    self.points.insert(i, new_point);
                    return;
                }
            }
        }
        self.points.push((range.end, Vec::new()))
    }

    /// Retrieve all of the values that is inside an interval
    ///
    /// Usage:
    /// ```
    /// use osb::utils::IntervalMap;
    /// let mut interval_map = IntervalMap::new();
    /// interval_map.push(10..50, 1);
    /// interval_map.push(30..50, 42);
    ///
    /// let mut result1 = interval_map.get(&20);
    /// assert_eq!(result1.next(), Some(&1));
    /// assert_eq!(result1.next(), None);
    ///
    /// let mut result2 = interval_map.get(&40);
    /// assert_eq!(result2.next(), Some(&1));
    /// assert_eq!(result2.next(), Some(&42));
    /// assert_eq!(result2.next(), None);
    /// ```
    pub fn get(&self, key: &K) -> std::slice::Iter<V> {
        let index = match self
            .points
            .binary_search_by(|&(ref point, _)| point.cmp(key))
        {
            Err(index) => {
                if index == 0 {
                    return (&[]).iter();
                } else {
                    index - 1
                }
            }
            Ok(index) => index,
        };
        self.points
            .get(index)
            .map(|point| &point.1[..])
            .unwrap_or(&[])
            .iter()
    }
}

#[cfg(test)]
mod tests {
    use super::IntervalMap;

    #[test]
    fn basic() {
        let mut interval_map = IntervalMap::new();

        interval_map.push(10..50, 1);
        interval_map.push(30..55, 2);

        assert_eq!(interval_map.get(&0).next(), None);
        assert_eq!(interval_map.get(&100).next(), None);

        let mut result = interval_map.get(&20);
        assert_eq!(result.next(), Some(&1));
        assert_eq!(result.next(), None);

        let mut result = interval_map.get(&53);
        assert_eq!(result.next(), Some(&2));
        assert_eq!(result.next(), None);

        let mut result = interval_map.get(&40);
        assert_eq!(result.next(), Some(&1));
        assert_eq!(result.next(), Some(&2));
        assert_eq!(result.next(), None);
    }
}