[−][src]Struct broccoli::collections::TreeRefInd
Implementations
impl<'a, A: Axis, N: Num, T: Send + Sync> TreeRefInd<'a, A, N, T>
[src]
pub fn collect_colliding_pairs_par<D: Send + Sync>(
&mut self,
func: impl Fn(&mut T, &mut T) -> Option<D> + Send + Sync + Copy
) -> CollidingPairsPar<T, D>
[src]
&mut self,
func: impl Fn(&mut T, &mut T) -> Option<D> + Send + Sync + Copy
) -> CollidingPairsPar<T, D>
impl<'a, A: Axis, N: Num, T> TreeRefInd<'a, A, N, T>
[src]
pub fn collect_all<D: Send + Sync>(
&mut self,
func: impl FnMut(&Rect<N>, &mut T) -> Option<D>
) -> FilteredElements<T, D>
[src]
&mut self,
func: impl FnMut(&Rect<N>, &mut T) -> Option<D>
) -> FilteredElements<T, D>
impl<'a, A: Axis, N: Num, T> TreeRefInd<'a, A, N, T>
[src]
pub fn collect_colliding_pairs<D: Send + Sync>(
&mut self,
func: impl FnMut(&mut T, &mut T) -> Option<D> + Send + Sync
) -> CollidingPairs<T, D>
[src]
&mut self,
func: impl FnMut(&mut T, &mut T) -> Option<D> + Send + Sync
) -> CollidingPairs<T, D>
impl<'a, N: Num, T> TreeRefInd<'a, DefaultA, N, T>
[src]
pub fn new(
arr: &'a mut [T],
func: impl FnMut(&mut T) -> Rect<N>
) -> TreeRefInd<'a, DefaultA, N, T>
[src]
arr: &'a mut [T],
func: impl FnMut(&mut T) -> Rect<N>
) -> TreeRefInd<'a, DefaultA, N, T>
impl<'a, N: Num, T: Send + Sync> TreeRefInd<'a, DefaultA, N, T>
[src]
pub fn new_par(
arr: &'a mut [T],
func: impl FnMut(&mut T) -> Rect<N>
) -> TreeRefInd<'a, DefaultA, N, T>
[src]
arr: &'a mut [T],
func: impl FnMut(&mut T) -> Rect<N>
) -> TreeRefInd<'a, DefaultA, N, T>
impl<'a, A: Axis, N: Num, T: Send + Sync> TreeRefInd<'a, A, N, T>
[src]
pub fn with_axis_par(
axis: A,
arr: &'a mut [T],
func: impl FnMut(&mut T) -> Rect<N>
) -> TreeRefInd<'a, A, N, T>
[src]
axis: A,
arr: &'a mut [T],
func: impl FnMut(&mut T) -> Rect<N>
) -> TreeRefInd<'a, A, N, T>
impl<'a, A: Axis, N: Num, T> TreeRefInd<'a, A, N, T>
[src]
pub fn with_axis(
axis: A,
arr: &'a mut [T],
func: impl FnMut(&mut T) -> Rect<N>
) -> TreeRefInd<'a, A, N, T>
[src]
axis: A,
arr: &'a mut [T],
func: impl FnMut(&mut T) -> Rect<N>
) -> TreeRefInd<'a, A, N, T>
pub fn get_elements(&self) -> &[T]ⓘ
[src]
pub fn get_elements_mut(&mut self) -> &'a mut [T]ⓘ
[src]
Methods from Deref<Target = TreeRef<'a, A, BBox<N, &'a mut T>>>
pub fn get_bbox_elements(&self) -> &[T]ⓘ
[src]
pub fn get_bbox_elements_mut(&mut self) -> PMut<'a, [T]>
[src]
Trait Implementations
impl<'a, A: Axis, N: Num + 'a, T> Deref for TreeRefInd<'a, A, N, T>
[src]
type Target = TreeRef<'a, A, BBox<N, &'a mut T>>
The resulting type after dereferencing.
fn deref(&self) -> &Self::Target
[src]
impl<'a, A: Axis, N: Num + 'a, T> DerefMut for TreeRefInd<'a, A, N, T>
[src]
Auto Trait Implementations
impl<'a, A, N, T> RefUnwindSafe for TreeRefInd<'a, A, N, T> where
A: RefUnwindSafe,
N: RefUnwindSafe,
T: RefUnwindSafe,
A: RefUnwindSafe,
N: RefUnwindSafe,
T: RefUnwindSafe,
impl<'a, A, N, T> Send for TreeRefInd<'a, A, N, T> where
T: Send,
T: Send,
impl<'a, A, N, T> Sync for TreeRefInd<'a, A, N, T> where
T: Sync,
T: Sync,
impl<'a, A, N, T> Unpin for TreeRefInd<'a, A, N, T> where
A: Unpin,
A: Unpin,
impl<'a, A, N, T> !UnwindSafe for TreeRefInd<'a, A, N, T>
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,
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.
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>,