[go: up one dir, main page]

sif-itree 0.4.0

simple, immutable, flat interval tree
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

use std::marker::PhantomData;

#[cfg(feature = "rayon")]
use rayon::{join, slice::ParallelSliceMut};

use crate::{ITree, Item, Node};

impl<K, V, S> ITree<K, V, S>
where
    K: Ord + Clone,
    S: AsMut<[Node<K, V>]> + FromIterator<Node<K, V>>,
{
    /// Construct a new tree by sorting the given `items`
    pub fn new<I>(items: I) -> Self
    where
        I: IntoIterator<Item = Item<K, V>>,
    {
        let mut nodes = items
            .into_iter()
            .map(|(interval, value)| {
                let end = interval.end.clone();
                ((interval, value), end)
            })
            .collect::<S>();

        {
            let nodes = nodes.as_mut();

            nodes.sort_unstable_by(|lhs, rhs| (lhs.0).0.start.cmp(&(rhs.0).0.start));

            if !nodes.is_empty() {
                update_max(nodes);
            }
        }

        Self {
            nodes,
            _marker: PhantomData,
        }
    }

    #[cfg(feature = "rayon")]
    /// Construct a new tree by sorting the given `items`, in parallel
    ///
    /// Requires the `rayon` feature and dispatches tasks into the current [thread pool][rayon::ThreadPool].
    pub fn par_new<I>(items: I) -> Self
    where
        I: IntoIterator<Item = Item<K, V>>,
        K: Send,
        V: Send,
    {
        let mut nodes = items
            .into_iter()
            .map(|(interval, value)| {
                let end = interval.end.clone();
                ((interval, value), end)
            })
            .collect::<S>();

        {
            let nodes = nodes.as_mut();

            nodes.par_sort_unstable_by(|lhs, rhs| (lhs.0).0.start.cmp(&(rhs.0).0.start));

            if !nodes.is_empty() {
                par_update_max(nodes);
            }
        }

        Self {
            nodes,
            _marker: PhantomData,
        }
    }
}

impl<K, V, S> FromIterator<Item<K, V>> for ITree<K, V, S>
where
    K: Ord + Clone,
    S: AsMut<[Node<K, V>]> + FromIterator<Node<K, V>>,
{
    fn from_iter<I>(items: I) -> Self
    where
        I: IntoIterator<Item = Item<K, V>>,
    {
        Self::new(items)
    }
}

fn update_max<K, V>(nodes: &mut [Node<K, V>]) -> K
where
    K: Ord + Clone,
{
    let (left, [mid, right @ ..]) = nodes.split_at_mut(nodes.len() / 2) else {
        unreachable!()
    };

    if !left.is_empty() {
        mid.1 = mid.1.clone().max(update_max(left));
    }

    if !right.is_empty() {
        mid.1 = mid.1.clone().max(update_max(right));
    }

    mid.1.clone()
}

#[cfg(feature = "rayon")]
fn par_update_max<K, V>(nodes: &mut [Node<K, V>]) -> K
where
    K: Ord + Clone + Send,
    V: Send,
{
    let (left, [mid, right @ ..]) = nodes.split_at_mut(nodes.len() / 2) else {
        unreachable!()
    };

    match (left.is_empty(), right.is_empty()) {
        (true, true) => (),
        (false, true) => {
            mid.1 = mid.1.clone().max(update_max(left));
        }
        (true, false) => {
            mid.1 = mid.1.clone().max(update_max(right));
        }
        (false, false) => {
            let (left, right) = join(|| update_max(left), || update_max(right));

            mid.1 = mid.1.clone().max(left.max(right));
        }
    }

    mid.1.clone()
}