Struct spatial::tree::mbr::MbrMap

pub struct MbrMap<NODE, I, R> { /* private fields */ }

The generic container interface for spatial maps. Will, at the very least, be able to support R, R+, R*, and X trees

Implementations

impl<P: FP, const DIM: usize, LG, I, R, T> MbrMap<RTreeNode<P, DIM, LG, T>, I, R>

where LG: MbrLeafGeometry<P, DIM>, I: IndexInsert<P, DIM, LG, T, RTreeNode<P, DIM, LG, T>>, R: IndexRemove<P, DIM, LG, T, RTreeNode<P, DIM, LG, T>, I>,

pub fn new( insert_index: I, remove_index: R ) -> MbrMap<RTreeNode<P, DIM, LG, T>, I, R>

Create a new MbrMap with the given insert and remove indexes

pub fn insert(&mut self, geometry: LG, item: T)

Insert an item

pub fn remove<Q: MbrQuery<P, DIM, LG, T, RTreeNode<P, DIM, LG, T>>>( &mut self, query: Q ) -> Vec<(LG, T)>

Remove all items whose shapes are accepted by the query. Returns removed entries.

pub fn retain<Q: MbrQuery<P, DIM, LG, T, RTreeNode<P, DIM, LG, T>>, F: FnMut(&T) -> bool>( &mut self, query: Q, f: F ) -> Vec<(LG, T)>

Remove all items whose shapes are accepted by the query and where f(&T) returns false. Returns removed entries

pub fn is_empty(&self) -> bool

Whether the map is empty

pub fn len(&self) -> usize

Length of the map

pub fn clear(&mut self)

Clear the map

pub fn iter(&self) -> Iter<'_, P, DIM, LG, T, MbrRectQuery<P, DIM>>

Iter for the map

pub fn iter_mut(&mut self) -> IterMut<'_, P, DIM, LG, T, MbrRectQuery<P, DIM>>

IterMut for the map

pub fn iter_query<Q: MbrQuery<P, DIM, LG, T, RTreeNode<P, DIM, LG, T>>>( &self, query: Q ) -> Iter<'_, P, DIM, LG, T, Q>

Iter for the map with a given query

pub fn iter_query_mut<Q: MbrQuery<P, DIM, LG, T, RTreeNode<P, DIM, LG, T>>>( &mut self, query: Q ) -> IterMut<'_, P, DIM, LG, T, Q>

IterMut for the map with a given query