Struct Grid 

pub struct Grid<Data: Copy> { /* private fields */ }

Implementations

impl<Data: Copy> Grid<Data>

pub fn with_cell_count( x: Range<f64>, y: Range<f64>, cell_count: (usize, usize), ) -> Grid<Data>

Arguments

• x: min_x..max_x defines the area in wich data can be inserted
• y: min_y..max_y defines the area in wich data can be inserted
• cell_count: (count_x, count_y) defines how many cell should be present

pub fn cell(&self, indexes: (usize, usize)) -> &Vec<((f64, f64), Data)>

Arguments

• indexes: (x,y) cord of the cell

returns: &Vec<((f64, f64), Data), Global> the data stored in the cell

pub fn cell_count(&self) -> (usize, usize)

Arguments

returns: (usize, usize) the defined cell_count

pub fn cell_size(&self) -> (f64, f64)

Arguments

returns: (f64, f64) width and height of each cell

Trait Implementations

impl<Data: Copy> SpatialPartitioner<Data> for Grid<Data>

fn new(x: Range<f64>, y: Range<f64>) -> Self

create a Grid with a default size of (100,100). More info here Grid::new()

fn insert(&mut self, position: (f64, f64), data: Data)

inserts an obj and checks if position is out of bounce

fn insert_unchecked(&mut self, position: (f64, f64), data: Data)

inserts an obj and DOES NOT check if position is out of bounce

fn count(&self) -> usize

returns the count of DataValues which are currently stored

fn clear(&mut self)

fn in_circle(&self, position: (f64, f64), radius: f64) -> Vec<Data>

gets all DataValues in the given search circle