Struct KdTree 

pub struct KdTree { /* private fields */ }

Implementations

impl KdTree

pub fn new() -> Self

pub fn reset(&mut self)

pub fn add_player(&mut self, ent: Entity, point: Vec3<f32>)

pub fn add_entity(&mut self, ent: Entity, point: Vec3<f32>)

pub fn update_player(&mut self, ent: Entity, point: Vec3<f32>)

pub fn update_entity(&mut self, ent: Entity, point: Vec3<f32>)

pub fn remove_player(&mut self, ent: Entity)

pub fn remove_entity(&mut self, ent: Entity)

pub fn contains(&self, ent: Entity) -> bool

pub fn contains_player(&self, ent: Entity) -> bool

pub fn contains_entity(&self, ent: Entity) -> bool

pub fn get_position(&self, ent: Entity) -> Option<[f32; 3]>

pub fn retain<F>(&mut self, f: F)

where F: Fn(u32) -> bool,

pub fn search(&self, point: &Vec3<f32>, count: usize) -> Vec<(f32, &Entity)>

pub fn search_player( &self, point: &Vec3<f32>, count: usize, is_player: bool, ) -> Vec<(f32, &Entity)>

pub fn search_entity( &self, point: &Vec3<f32>, count: usize, is_entity: bool, ) -> Vec<(f32, &Entity)>

pub fn players_within_radius( &self, point: &Vec3<f32>, radius: f32, ) -> Vec<&Entity>

pub fn entities_within_radius( &self, point: &Vec3<f32>, radius: f32, ) -> Vec<(f32, &Entity)>

pub fn all_within_radius( &self, point: &Vec3<f32>, radius: f32, ) -> Vec<(f32, &Entity)>

Every tracked entity AND player within radius of point. Area effects (blasts, suction fields) use this so clients are never silently excluded the way the entities-only radius query excludes them.

Trait Implementations

impl Debug for KdTree

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for KdTree

fn default() -> Self

Returns the “default value” for a type.