Struct NeighborhoodGrid 

pub struct NeighborhoodGrid {
    pub cell_size: f32,
    pub cells: HashMap<(i32, i32), Vec<usize>>,
}

Efficient neighbor lookup for flocking using a simple spatial bucket.

Fields

cell_size: f32

cells: HashMap<(i32, i32), Vec<usize>>

Implementations

impl NeighborhoodGrid

pub fn new(cell_size: f32) -> Self

pub fn clear(&mut self)

pub fn insert(&mut self, pos: Vec2, idx: usize)

pub fn query(&self, pos: Vec2, radius: f32) -> Vec<usize>

Collect indices of all agents within radius of pos.