broccoli 0.1.11

broadphase collision detection algorithms
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

### Overview

Broccoli is a broadphase collision detection library. 
The base data structure is a hybrid between a [KD Tree](https://en.wikipedia.org/wiki/K-d_tree) and [Sweep and Prune](https://en.wikipedia.org/wiki/Sweep_and_prune).

### Inner projects

The broccoli_demo inner project is meant to show case the use of these algorithms. 
The report inner project generates benches used in the [broccoli book](https://tiby312.github.io/broccoli_report).

### Screenshot

Screen capture from the inner dinotree_alg_demo project.

<img src="./assets/screenshot.gif" alt="screenshot">

### Example

```rust
use broccoli::prelude::*;
fn main() {
    let mut inner1=0;
    let mut inner2=0;
    let mut inner3=0;

    //Using a semi-direct layout for best performance.
    //rect is stored directly in tree, but inner is not.
    let mut aabbs = [
        broccoli::bbox(broccoli::rect(0isize, 10, 0, 10), &mut inner1),
        broccoli::bbox(broccoli::rect(15, 20, 15, 20), &mut inner2),
        broccoli::bbox(broccoli::rect(5, 15, 5, 15), &mut inner3),
    ];

    //This will change the order of the elements in bboxes,
    //but this is okay since we populated it with mutable references.
    let mut tree = broccoli::new(&mut aabbs);

    //Find all colliding aabbs.
    tree.find_colliding_pairs_mut(|a, b| {
        **a += 1;
        **b += 1;
    });

    assert_eq!(inner1, 1);
    assert_eq!(inner2, 0);
    assert_eq!(inner3, 1);
}

```