Struct rustbatch::entities::detection::quadmap::QuadMap

pub struct QuadMap<T: Eq + Hash + Clone + Copy> { /* fields omitted */ }

QuadMap is very similar to QuadTree but there is a trade off. It eliminates recursion so overall performance is better but it has to allocate all memory at once witch can be slow. It also takes ids over pointers because this is rust ofter all.

Implementations

impl<T: Eq + Hash + Clone + Copy> QuadMap<T>

pub fn new(resolution: usize, size: Vect) -> Self

new makes lot of memory allocations and its over all slowest. Do not rebuild QuadMap update it.

pub fn insert(&mut self, shape: Rect, id: T) -> Address

insert inserts shape to quad map and returns address to it. You should store this address and use it when updating or removing your object. This is most efficient way to interact with QuadMap and so it is only one.

pub fn query(&self, shape: Rect, collector: &mut Vec<T>)

query returns ids of all possibly colliding shapes, you have to make collision check your self witch improves memory consumption.

pub fn remove(&mut self, id: &T, address: &Address)

remove removes shape from QuadMap

pub fn update(&mut self, shape: Rect, id: T, address: &Address) -> Address

update updates the shape

pub fn shape_count(&self) -> usize