Struct spatial::tree::mbr::RStar

source ·
pub struct RStar<P: FP, const DIM: usize, LG, T> { /* private fields */ }
Expand description

Convenience struct for creating a new R* Tree

Algorithms descibed by Beckmann, N.; Kriegel, H. P.; Schneider, R.; Seeger, B. (1990). “The R*-tree: an efficient and robust access method for points and rectangles”.

Implementations§

source§

impl<P: FP, const DIM: usize, LG, T> RStar<P, DIM, LG, T>
where LG: MbrLeafGeometry<P, DIM>,

source

pub fn new() -> RStarTree<P, DIM, LG, T>

Create a new R* tree with min and max children lengths set to 19 and 64, respectively

source

pub fn new_with_max(max: usize) -> RStarTree<P, DIM, LG, T>

Create a new R* tree with max children lengths as provided. min length will be set to 0.3 * max

source

pub fn new_with_options( max: usize, reinsert_p: f32, split_p: f32, choose_subtree_p: usize ) -> RStarTree<P, DIM, LG, T>

Creates a mew R* tree with options as provided. min children will be set to reinsert_p.min(split_p) * max

Auto Trait Implementations§

§

impl<P, const DIM: usize, LG, T> Freeze for RStar<P, DIM, LG, T>

§

impl<P, const DIM: usize, LG, T> RefUnwindSafe for RStar<P, DIM, LG, T>

§

impl<P, const DIM: usize, LG, T> Send for RStar<P, DIM, LG, T>
where P: Send, LG: Send, T: Send,

§

impl<P, const DIM: usize, LG, T> Sync for RStar<P, DIM, LG, T>
where P: Sync, LG: Sync, T: Sync,

§

impl<P, const DIM: usize, LG, T> Unpin for RStar<P, DIM, LG, T>
where P: Unpin, LG: Unpin, T: Unpin,

§

impl<P, const DIM: usize, LG, T> UnwindSafe for RStar<P, DIM, LG, T>
where P: UnwindSafe, LG: UnwindSafe, T: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IntoEither for T

source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.