[−][src]Struct dinotree_alg::NotSorted

pub struct NotSorted<A: AxisTrait, N: NodeTrait>(_);

A version of dinotree where the elements are not sorted along each axis, like a KD Tree.

Methods

impl<'a, A: AxisTrait, T: HasAabb + Send + Sync> NotSorted<A, NodeMut<'a, T>>[src]

#[must_use] pub fn new_par(axis: A, bots: &'a mut [T]) -> NotSorted<A, NodeMut<'a, T>>[src]

impl<'a, A: AxisTrait, T: HasAabb> NotSorted<A, NodeMut<'a, T>>[src]

#[must_use] pub fn new(axis: A, bots: &'a mut [T]) -> NotSorted<A, NodeMut<'a, T>>[src]

impl<A: AxisTrait, N: NodeTrait + Send + Sync> NotSorted<A, N> where
    N::T: Send + Sync, [src]

pub fn find_collisions_mut_par(
    &mut self,
    func: impl Fn(ProtectedBBox<N::T>, ProtectedBBox<N::T>) + Send + Sync
)[src]

impl<A: AxisTrait, N: NodeTrait> NotSorted<A, N>[src]

pub fn find_collisions_mut(
    &mut self,
    func: impl FnMut(ProtectedBBox<N::T>, ProtectedBBox<N::T>)
)[src]

pub fn axis(&self) -> A[src]

pub fn get_height(&self) -> usize[src]

pub fn vistr(&self) -> Vistr<N>[src]

pub fn vistr_mut(&mut self) -> VistrMut<N>[src]

Auto Trait Implementations

impl<A, N> Unpin for NotSorted<A, N> where
    A: Unpin,
    N: Unpin, 

impl<A, N> Send for NotSorted<A, N> where
    N: Send, 

impl<A, N> Sync for NotSorted<A, N> where
    N: Sync, 

impl<A, N> UnwindSafe for NotSorted<A, N> where
    A: UnwindSafe,
    N: UnwindSafe, 

impl<A, N> RefUnwindSafe for NotSorted<A, N> where
    A: RefUnwindSafe,
    N: RefUnwindSafe, 

Blanket Implementations

impl<T> From<T> for T[src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, [src]

type Error = !

The type returned in the event of a conversion error.

impl<T, U> Into<U> for T where
    U: From<T>, [src]

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, [src]

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

The type returned in the event of a conversion error.

impl<T> Borrow<T> for T where
    T: ?Sized, [src]

impl<T> BorrowMut<T> for T where
    T: ?Sized, [src]

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