sif-rtree 0.3.1

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

use std::num::NonZeroUsize;
use std::ops::ControlFlow;

use crate::{Node, Object, TWIG_LEN};

pub fn branch_for_each<O, V, R>(
    len: &NonZeroUsize,
    twigs: &[Node<O>],
    mut visitor: V,
) -> ControlFlow<R>
where
    O: Object,
    V: FnMut(usize) -> ControlFlow<R>,
{
    let (len, pad) = twig_len_pad(len);

    let mut twigs = twigs[..len].iter();

    let mut twig = match twigs.next().unwrap() {
        Node::Twig(twig) => &twig[pad..],
        Node::Branch { .. } | Node::Leaf(_) => unreachable!(),
    };

    loop {
        for idx in twig {
            visitor(*idx)?;
        }

        twig = match twigs.next() {
            Some(Node::Twig(twig)) => twig,
            Some(Node::Branch { .. } | Node::Leaf(_)) => unreachable!(),
            None => break,
        };
    }

    ControlFlow::Continue(())
}

pub fn twig_len_pad(len: &NonZeroUsize) -> (usize, usize) {
    let len = len.get();
    let quot = len / TWIG_LEN;
    let rem = len % TWIG_LEN;

    let len = if rem == 0 { quot } else { quot + 1 };
    let pad = if rem == 0 { 0 } else { TWIG_LEN - rem };

    (len, pad)
}