hdf5-pure-rust 0.3.2

Pure Rust implementation of the HDF5 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

/// Inclusive integer range result.
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub struct ResultRange {
    pub start: u64,
    pub end: u64,
}

/// Ordered range result tree analogue.
#[derive(Debug, Clone, Default, PartialEq, Eq)]
pub struct ResultTree {
    ranges: Vec<ResultRange>,
}

impl ResultRange {
    pub fn intersects(self, other: Self) -> bool {
        self.start <= other.end && other.start <= self.end
    }
}

impl ResultTree {
    /// Initialize leaf storage.
    pub fn leaf_init(range: ResultRange) -> ResultRange {
        range
    }

    /// Add a range to a result set.
    pub fn result_set_add(&mut self, range: ResultRange) {
        self.ranges.push(range);
        self.ranges.sort_by_key(|range| (range.start, range.end));
    }

    /// Bulk-load ranges.
    pub fn bulk_load(ranges: Vec<ResultRange>) -> Self {
        let mut tree = Self::create();
        for range in ranges {
            tree.result_set_add(range);
        }
        tree
    }

    /// Create an empty result tree.
    pub fn create() -> Self {
        Self::default()
    }

    /// Recursive search helper.
    pub fn search_recurse(&self, query: ResultRange) -> Vec<ResultRange> {
        self.ranges
            .iter()
            .copied()
            .filter(|range| range.intersects(query))
            .collect()
    }

    /// Search for ranges intersecting `query`.
    pub fn search(&self, query: ResultRange) -> Vec<ResultRange> {
        self.search_recurse(query)
    }

    /// Free search results.
    pub fn free_results(_results: Vec<ResultRange>) {}

    /// Copy a node/range.
    pub fn node_copy(range: ResultRange) -> ResultRange {
        range
    }

    /// Recursive free hook.
    pub fn free_recurse(&mut self) {
        self.ranges.clear();
    }

    /// Free this tree.
    pub fn free(mut self) {
        self.free_recurse();
    }

    /// Copy this tree.
    pub fn copy(&self) -> Self {
        self.clone()
    }

    /// Return whether two leaves intersect.
    pub fn leaves_intersect(lhs: ResultRange, rhs: ResultRange) -> bool {
        lhs.intersects(rhs)
    }
}

#[cfg(test)]
mod tests {
    use super::{ResultRange, ResultTree};

    #[test]
    fn result_tree_aliases_find_intersections() {
        let a = ResultTree::leaf_init(ResultRange { start: 0, end: 3 });
        let b = ResultRange { start: 10, end: 12 };
        assert!(ResultTree::leaves_intersect(
            a,
            ResultRange { start: 2, end: 5 }
        ));
        assert!(!ResultTree::leaves_intersect(a, b));

        let mut tree = ResultTree::create();
        tree.result_set_add(a);
        tree.result_set_add(b);
        assert_eq!(tree.search(ResultRange { start: 1, end: 1 }), vec![a]);
        assert_eq!(
            tree.search_recurse(ResultRange { start: 11, end: 11 }),
            vec![b]
        );
        let copy = tree.copy();
        assert_eq!(copy, tree);
        ResultTree::free_results(copy.search(ResultRange { start: 0, end: 20 }));
        ResultTree::bulk_load(vec![a, b]).free();
        assert_eq!(ResultTree::node_copy(a), a);
    }
}