rstared 0.15.6

Simple decorator that adds rstar::RTree to arbitrary collections.
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

// SPDX-FileCopyrightText: 2025 rstared contributors
//
// SPDX-License-Identifier: MIT OR Apache-2.0

use rstared::RTreed;
use rstared::{AABB, primitives::Rectangle};

fn main() {
    // A vec of 2D rectangles will be the underlying collection.
    let rect_vec: Vec<Rectangle<(i32, i32)>> = Vec::new();

    // Wrap `RTreed` around the vec.
    let mut rtreed = RTreed::new(rect_vec);

    // Push two rectangles, recording them in the R-tree.
    rtreed.push(Rectangle::from_corners((0, 0), (1, 1)));
    rtreed.push(Rectangle::from_corners((1, 1), (2, 2)));

    // Locate the two rectangles in the R-tree.
    assert_eq!(
        rtreed
            .rtree()
            .locate_in_envelope(AABB::from_corners((0, 0), (2, 2)))
            .count(),
        2
    );

    // Access a rectangle by its index in the vec.
    assert_eq!(
        rtreed.get(&0),
        Some(&Rectangle::from_corners((0, 0), (1, 1)))
    );

    // Push one more rectangle.
    rtreed.push(Rectangle::from_corners((2, 2), (3, 3)));

    // Swap-remove the first rectangle.
    assert_eq!(
        rtreed.swap_remove(&0),
        Rectangle::from_corners((0, 0), (1, 1))
    );

    // Now the latest-pushed rectangle occupies the place of the first
    // rectangle. The second rectangle is as it was previously.
    assert_eq!(
        rtreed.get(&0),
        Some(&Rectangle::from_corners((2, 2), (3, 3)))
    );
    assert_eq!(
        rtreed.get(&1),
        Some(&Rectangle::from_corners((1, 1), (2, 2)))
    );
    assert_eq!(
        rtreed
            .rtree()
            .locate_in_envelope(AABB::from_corners((0, 0), (3, 3)))
            .count(),
        2
    );
}

#[test]
fn test() {
    main();
}