Struct QuadTree 

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

Implementations

impl<Data: Copy> QuadTree<Data>

pub fn with_capacity( x: Range<f64>, y: Range<f64>, capacity: u16, ) -> QuadTree<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
• capacity: capacity of each TreeNode

pub fn node(&self) -> &QuadTreeNode<Data>

Arguments

returns : &QuadTreeNode the root node of the QuadTree

Trait Implementations

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

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

create a QuadTree with a default capacity of 50. More info here QuadTree::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