jagua-rs 0.6.2

A fast and fearless Collision Detection Engine for 2D irregular Cutting and Packing problems
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

use crate::collision_detection::hazards::filter::HazardFilter;
use crate::collision_detection::hazards::{HazKey, HazardEntity};
use slotmap::SecondaryMap;

/// Trait for structs that can track and store detected [`Hazard`](crate::collision_detection::hazards::Hazard)s.
/// Used in 'collision collection' queries to avoid having to repeatedly check hazards induced by one that has already been detected.
pub trait HazardCollector: HazardFilter {
    fn contains_key(&self, hkey: HazKey) -> bool;

    fn contains_entity(&self, entity: &HazardEntity) -> bool {
        self.iter().any(|(_, e)| e == entity)
    }

    fn insert(&mut self, hkey: HazKey, entity: HazardEntity);

    fn remove_by_key(&mut self, hkey: HazKey);

    fn remove_by_entity(&mut self, entity: &HazardEntity) {
        let hkey = self
            .iter()
            .find(|(_, v)| *v == entity)
            .map(|(hkey, _)| hkey)
            .expect("HazardEntity not found in collector");
        self.remove_by_key(hkey);
    }

    fn is_empty(&self) -> bool {
        self.len() == 0
    }

    fn len(&self) -> usize;

    fn iter(&self) -> impl Iterator<Item = (HazKey, &HazardEntity)>;

    fn keys(&self) -> impl Iterator<Item = HazKey> {
        self.iter().map(|(k, _)| k)
    }

    fn entities(&self) -> impl Iterator<Item = &HazardEntity> {
        self.iter().map(|(_, e)| e)
    }
}

/// A basic implementation of a [`HazardCollector`] using a `SecondaryMap` to store hazards by their `HazKey`.
pub type BasicHazardCollector = SecondaryMap<HazKey, HazardEntity>;

impl HazardCollector for BasicHazardCollector {
    fn contains_key(&self, hkey: HazKey) -> bool {
        self.contains_key(hkey)
    }

    fn insert(&mut self, hkey: HazKey, entity: HazardEntity) {
        self.insert(hkey, entity);
    }

    fn remove_by_key(&mut self, hkey: HazKey) {
        self.remove(hkey);
    }

    fn len(&self) -> usize {
        self.len()
    }

    fn iter(&self) -> impl Iterator<Item = (HazKey, &HazardEntity)> {
        self.iter()
    }
}