[−][src]Struct kdt::KdTree
Implementations
impl<T: PartialOrd + PartialEq + Clone + Debug, const DIM: usize> KdTree<T, DIM>
[src]
pub fn dim() -> usize
[src]
pub fn from_slice(points: &mut [Point<T, DIM>]) -> Self
[src]
pub fn contains(&self, point: &Point<T, DIM>) -> bool
[src]
pub fn insert(&mut self, point: Point<T, DIM>) -> bool
[src]
Insert a point into the tree.
Inserting elements one by one is likely to cause the tree to become inbalanced.
Prefer from_slice
to construct the tree.
impl<T: PartialOrd + PartialEq + Clone + Float + Debug, const DIM: usize> KdTree<T, DIM>
[src]
Trait Implementations
impl<T: Debug + PartialOrd + PartialEq + Clone, const DIM: usize> Debug for KdTree<T, DIM>
[src]
impl<T: Default + PartialOrd + PartialEq + Clone, const DIM: usize> Default for KdTree<T, DIM>
[src]
Auto Trait Implementations
impl<T, const DIM: usize> RefUnwindSafe for KdTree<T, DIM> where
T: RefUnwindSafe,
[src]
T: RefUnwindSafe,
impl<T, const DIM: usize> Send for KdTree<T, DIM> where
T: Send,
[src]
T: Send,
impl<T, const DIM: usize> Sync for KdTree<T, DIM> where
T: Sync,
[src]
T: Sync,
impl<T, const DIM: usize> Unpin for KdTree<T, DIM>
[src]
impl<T, const DIM: usize> UnwindSafe for KdTree<T, DIM> where
T: UnwindSafe,
[src]
T: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,