Struct ImmutableKdTree

Source
pub struct ImmutableKdTree<A: Copy + Default, T: Copy + Default, const K: usize, const B: usize> { /* private fields */ }
Expand description

Immutable floating point k-d tree

Offers less memory utilisation, smaller size vs non-immutable tree when serialised, and faster more consistent query performance. This comes at the expense of not being able to modify the contents of the tree after its initial construction, and longer construction times.

Compared to non-dynamic ImmutableKdTree, this can handle data like point clouds that may have many occurrences of multiple points have the exact same value on a given axis. This comes at the expense of slower performance. Memory usage should still be very efficient, more so than the standard and non-dynamic immutable tree types.

As with the vanilla tree, f64 or f32 are supported currently for co-ordinate values, or f16 if used with the half crate.

A convenient type alias exists for ImmutableKdTree with some sensible defaults set: kiddo::ImmutableKdTree.

Implementations§

Source§

impl<A, T, const K: usize, const B: usize> ImmutableKdTree<A, T, K, B>
where A: Axis + LeafSliceFloat<T> + LeafSliceFloatChunk<T, K>, T: Content, usize: Cast<T>,

Source

pub fn new_from_slice(source: &[[A; K]]) -> Self
where usize: Cast<T>,

Creates an ImmutableKdTree, balanced and optimized, populated with items from source.

ImmutableKdTree instances are optimally balanced and tuned, but are not modifiable after construction.

§Examples
use kiddo::immutable::float::kdtree::ImmutableKdTree;

let points: Vec<[f64; 3]> = vec!([1.0f64, 2.0f64, 3.0f64]);
let tree: ImmutableKdTree<f64, u32, 3, 32> = ImmutableKdTree::new_from_slice(&points);

assert_eq!(tree.size(), 1);
Source

pub fn size(&self) -> usize

Returns the current number of elements stored in the tree

§Examples
use kiddo::immutable::float::kdtree::ImmutableKdTree;

let points: Vec<[f64; 3]> = vec!([1.0f64, 2.0f64, 3.0f64]);
let tree: ImmutableKdTree<f64, u32, 3, 32> = ImmutableKdTree::new_from_slice(&points);

assert_eq!(tree.size(), 1);
Source

pub fn capacity(&self) -> usize

Returns the theoretical max capacity of this tree

Source§

impl<A: Axis, T: Content, const K: usize, const B: usize> ImmutableKdTree<A, T, K, B>

Source

pub fn approx_nearest_one<D>(&self, query: &[A; K]) -> NearestNeighbour<A, T>
where A: LeafSliceFloat<T> + LeafSliceFloatChunk<T, K>, D: DistanceMetric<A, K>, usize: Cast<T>,

Queries the tree to find the approximate nearest element to query, using the specified distance metric function.

Faster than querying for nearest_one(point) due to not recursing up the tree to find potentially closer points in other branches.

§Examples
    use kiddo::ImmutableKdTree;
    use kiddo::SquaredEuclidean;

    let content: Vec<[f64; 3]> = vec!(
            [1.0, 2.0, 5.0],
            [2.0, 3.0, 6.0]
        );

        let tree: ImmutableKdTree<f64, 3> = ImmutableKdTree::new_from_slice(&content);

    let nearest = tree.approx_nearest_one::<SquaredEuclidean>(&[1.0, 2.0, 5.1]);

    assert!((nearest.distance - 0.01f64).abs() < f64::EPSILON);
    assert_eq!(nearest.item, 0);
Source§

impl<A, T, const K: usize, const B: usize> ImmutableKdTree<A, T, K, B>
where A: Axis + LeafSliceFloat<T> + LeafSliceFloatChunk<T, K>, T: Content, usize: Cast<T>,

Source

pub fn best_n_within<D>( &self, query: &[A; K], dist: A, max_qty: NonZero<usize>, ) -> impl Iterator<Item = BestNeighbour<A, T>>
where A: LeafSliceFloat<T> + LeafSliceFloatChunk<T, K>, usize: Cast<T>, D: DistanceMetric<A, K>,

Finds the “best” n elements within dist of query.

Results are returned in arbitrary order. ‘Best’ is determined by performing a comparison of the elements using < (ie, std::cmp::Ordering::is_lt). Returns an iterator.

§Examples
    use std::num::NonZero;
    use kiddo::ImmutableKdTree;
    use kiddo::best_neighbour::BestNeighbour;
    use kiddo::SquaredEuclidean;

    let content: Vec<[f64; 3]> = vec!(
            [1.0, 2.0, 5.0],
            [2.0, 3.0, 6.0]
        );

        let tree: ImmutableKdTree<f64, 3> = ImmutableKdTree::new_from_slice(&content);

    let mut best_n_within = tree.best_n_within::<SquaredEuclidean>(&[1.0, 2.0, 5.0], 10f64, NonZero::new(1).unwrap());
    let first = best_n_within.next().unwrap();

    assert_eq!(first, BestNeighbour { distance: 0.0, item: 0 });
Source§

impl<A, T, const K: usize, const B: usize> ImmutableKdTree<A, T, K, B>
where A: Axis + LeafSliceFloat<T> + LeafSliceFloatChunk<T, K>, T: Content, usize: Cast<T>,

Source

pub fn nearest_n<D>( &self, query: &[A; K], max_qty: NonZero<usize>, ) -> Vec<NearestNeighbour<A, T>>
where A: LeafSliceFloat<T> + LeafSliceFloatChunk<T, K>, D: DistanceMetric<A, K>, usize: Cast<T>,

Finds the nearest qty elements to query, according the specified distance metric function.

§Examples
    use std::num::NonZero;
    use kiddo::ImmutableKdTree;
    use kiddo::SquaredEuclidean;

    let content: Vec<[f64; 3]> = vec!(
            [1.0, 2.0, 5.0],
            [2.0, 3.0, 6.0]
        );

        let tree: ImmutableKdTree<f64, 3> = ImmutableKdTree::new_from_slice(&content);

    let nearest: Vec<_> = tree.nearest_n::<SquaredEuclidean>(&[1.0, 2.0, 5.1], NonZero::new(1).unwrap());

    assert_eq!(nearest.len(), 1);
    assert!((nearest[0].distance - 0.01f64).abs() < f64::EPSILON);
    assert_eq!(nearest[0].item, 0);
Source§

impl<A, T, const K: usize, const B: usize> ImmutableKdTree<A, T, K, B>
where A: Axis + LeafSliceFloat<T> + LeafSliceFloatChunk<T, K>, T: Content, usize: Cast<T>,

Source

pub fn nearest_n_within<D>( &self, query: &[A; K], dist: A, max_items: NonZero<usize>, sorted: bool, ) -> Vec<NearestNeighbour<A, T>>
where D: DistanceMetric<A, K>,

Finds up to n elements within dist of query, using the specified distance metric function.

§Examples
    use std::num::NonZero;
    use kiddo::ImmutableKdTree;
    use kiddo::SquaredEuclidean;
    let content: Vec<[f64; 3]> = vec!(
            [1.0, 2.0, 5.0],
            [2.0, 3.0, 6.0]
        );

        let tree: ImmutableKdTree<f64, 3> = ImmutableKdTree::new_from_slice(&content);

    let within = tree.nearest_n_within::<SquaredEuclidean>(&[1.0, 2.0, 5.0], 10f64, NonZero::new(2).unwrap(), true);

    assert_eq!(within.len(), 2);
Source§

impl<A, T, const K: usize, const B: usize> ImmutableKdTree<A, T, K, B>
where A: Axis + LeafSliceFloat<T> + LeafSliceFloatChunk<T, K>, T: Content, usize: Cast<T>,

Source

pub fn nearest_one<D>(&self, query: &[A; K]) -> NearestNeighbour<A, T>
where D: DistanceMetric<A, K>,

Queries the tree to find the nearest item to the query point.

Faster than querying for nearest_n(point, 1, …) due to not needing to allocate memory or maintain sorted results.

§Examples
    use kiddo::ImmutableKdTree;
    use kiddo::SquaredEuclidean;

    let content: Vec<[f64; 3]> = vec!(
            [1.0, 2.0, 5.0],
            [2.0, 3.0, 6.0]
        );

        let tree: ImmutableKdTree<f64, 3> = ImmutableKdTree::new_from_slice(&content);

    let nearest = tree.nearest_one::<SquaredEuclidean>(&[1.0, 2.0, 5.1]);

    assert!((nearest.distance - 0.01f64).abs() < f64::EPSILON);
    assert_eq!(nearest.item, 0);
Source§

impl<A, T, const K: usize, const B: usize> ImmutableKdTree<A, T, K, B>
where A: Axis + LeafSliceFloat<T> + LeafSliceFloatChunk<T, K>, T: Content, usize: Cast<T>,

Source

pub fn within<D>(&self, query: &[A; K], dist: A) -> Vec<NearestNeighbour<A, T>>
where A: LeafSliceFloat<T> + LeafSliceFloatChunk<T, K>, D: DistanceMetric<A, K>, usize: Cast<T>,

Finds all elements within dist of query, using the specified distance metric function.

Results are returned sorted nearest-first

§Examples
    use kiddo::ImmutableKdTree;
    use kiddo::SquaredEuclidean;
    let content: Vec<[f64; 3]> = vec!(
            [1.0, 2.0, 5.0],
            [2.0, 3.0, 6.0]
        );

        let tree: ImmutableKdTree<f64, 3> = ImmutableKdTree::new_from_slice(&content);

    let within = tree.within::<SquaredEuclidean>(&[1.0, 2.0, 5.0], 10f64);

    assert_eq!(within.len(), 2);
Source§

impl<A, T, const K: usize, const B: usize> ImmutableKdTree<A, T, K, B>
where A: Axis + LeafSliceFloat<T> + LeafSliceFloatChunk<T, K>, T: Content, usize: Cast<T>,

Source

pub fn within_unsorted<D>( &self, query: &[A; K], dist: A, ) -> Vec<NearestNeighbour<A, T>>
where A: LeafSliceFloat<T> + LeafSliceFloatChunk<T, K>, D: DistanceMetric<A, K>, usize: Cast<T>,

Finds all elements within dist of query, using the specified distance metric function.

Results are returned in arbitrary order. Faster than within.

§Examples
use kiddo::ImmutableKdTree;
use kiddo::SquaredEuclidean;
let content: Vec<[f64; 3]> = vec!(
            [1.0, 2.0, 5.0],
            [2.0, 3.0, 6.0]
        );

        let tree: ImmutableKdTree<f64, 3> = ImmutableKdTree::new_from_slice(&content);

let within = tree.within_unsorted::<SquaredEuclidean>(&[1.0, 2.0, 5.0], 10f64);

assert_eq!(within.len(), 2);

Trait Implementations§

Source§

impl<A: Copy + Default, T: Copy + Default, const K: usize, const B: usize> Archive for ImmutableKdTree<A, T, K, B>
where EncodeAVec<A>: ArchiveWith<AVec<A>>, [Vec<A>; K]: Archive, Vec<T>: Archive, Vec<(u32, u32)>: Archive, i32: Archive,

Source§

type Archived = ArchivedR8ImmutableKdTree<A, T, K, B>

The archived representation of this type. Read more
Source§

type Resolver = ImmutableKdTreeR8Resolver<A, T, K, B>

The resolver for this type. It must contain all the additional information from serializing needed to make the archived type from the normal type.
Source§

fn resolve(&self, resolver: Self::Resolver, out: Place<Self::Archived>)

Creates the archived version of this value at the given position and writes it to the given output. Read more
Source§

const COPY_OPTIMIZATION: CopyOptimization<Self> = _

An optimization flag that allows the bytes of this type to be copied directly to a writer instead of calling serialize. Read more
Source§

impl<A: Clone + Copy + Default, T: Clone + Copy + Default, const K: usize, const B: usize> Clone for ImmutableKdTree<A, T, K, B>

Source§

fn clone(&self) -> ImmutableKdTree<A, T, K, B>

Returns a duplicate of the value. Read more
1.0.0 · Source§

const fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl<A: Debug + Copy + Default, T: Debug + Copy + Default, const K: usize, const B: usize> Debug for ImmutableKdTree<A, T, K, B>

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl<'de, A, T, const K: usize, const B: usize> Deserialize<'de> for ImmutableKdTree<A, T, K, B>
where A: Deserialize<'de> + Deserialize<'de> + Copy + Default, T: Deserialize<'de> + Copy + Default + Deserialize<'de>,

Source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
Source§

impl<__D: Fallible + ?Sized, A: Copy + Default, T: Copy + Default, const K: usize, const B: usize> Deserialize<ImmutableKdTree<A, T, K, B>, __D> for Archived<ImmutableKdTree<A, T, K, B>>
where EncodeAVec<A>: ArchiveWith<AVec<A>> + DeserializeWith<<EncodeAVec<A> as ArchiveWith<AVec<A>>>::Archived, AVec<A>, __D>, [Vec<A>; K]: Archive, <[Vec<A>; K] as Archive>::Archived: Deserialize<[Vec<A>; K], __D>, Vec<T>: Archive, <Vec<T> as Archive>::Archived: Deserialize<Vec<T>, __D>, Vec<(u32, u32)>: Archive, <Vec<(u32, u32)> as Archive>::Archived: Deserialize<Vec<(u32, u32)>, __D>, i32: Archive, <i32 as Archive>::Archived: Deserialize<i32, __D>,

Source§

fn deserialize( &self, deserializer: &mut __D, ) -> Result<ImmutableKdTree<A, T, K, B>, <__D as Fallible>::Error>

Deserializes using the given deserializer
Source§

impl<A, T, const K: usize, const B: usize> From<&[[A; K]]> for ImmutableKdTree<A, T, K, B>
where A: Axis + LeafSliceFloat<T> + LeafSliceFloatChunk<T, K>, T: Content, usize: Cast<T>,

Source§

fn from(slice: &[[A; K]]) -> Self

Creates an ImmutableKdTree, balanced and optimized, populated with items from source.

ImmutableKdTree instances are optimally balanced and tuned, but are not modifiable after construction.

§Examples
use kiddo::immutable::float::kdtree::ImmutableKdTree;

let points: Vec<[f64; 3]> = vec!([1.0f64, 2.0f64, 3.0f64]);
let tree: ImmutableKdTree<f64, u32, 3, 32> = (&*points).into();

assert_eq!(tree.size(), 1);
Source§

impl<A, T, const K: usize, const B: usize> From<ImmutableKdTree<A, T, K, B>> for ImmutableKdTreeRK<A, T, K, B>
where A: Axis + LeafSliceFloat<T> + LeafSliceFloatChunk<T, K>, T: Content, usize: Cast<T>,

Source§

fn from(orig: ImmutableKdTree<A, T, K, B>) -> Self

Creates an ImmutableKdTreeRK from an ImmutableKdTree

ImmutableKdTreeRK implements rkyv::Archive, permitting it to be serialized to as close to a zero-copy form as possible. Zero-copy-deserialized ImmutableKdTreeRK instances can be converted to instances of AlignedArchivedImmutableKdTree, which involves a copy of the stems to ensure correct alignment, but re-use of the rest of the structure. AlignedArchivedImmutableKdTree instances can then be queried in the same way as the original ImmutableKdTree.

§Examples
use kiddo::immutable::float::kdtree::ImmutableKdTree;

let points: Vec<[f64; 3]> = vec!([1.0f64, 2.0f64, 3.0f64]);
let tree: ImmutableKdTree<f64, u32, 3, 32> = (&*points).into();

assert_eq!(tree.size(), 1);
Source§

impl<A: PartialEq + Copy + Default, T: PartialEq + Copy + Default, const K: usize, const B: usize> PartialEq for ImmutableKdTree<A, T, K, B>

Source§

fn eq(&self, other: &ImmutableKdTree<A, T, K, B>) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§

const fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

impl<__S: Fallible + ?Sized, A: Copy + Default, T: Copy + Default, const K: usize, const B: usize> Serialize<__S> for ImmutableKdTree<A, T, K, B>
where EncodeAVec<A>: SerializeWith<AVec<A>, __S>, [Vec<A>; K]: Serialize<__S>, Vec<T>: Serialize<__S>, Vec<(u32, u32)>: Serialize<__S>, i32: Serialize<__S>,

Source§

fn serialize( &self, serializer: &mut __S, ) -> Result<<Self as Archive>::Resolver, <__S as Fallible>::Error>

Writes the dependencies for the object and returns a resolver that can create the archived type.
Source§

impl<A, T, const K: usize, const B: usize> Serialize for ImmutableKdTree<A, T, K, B>

Source§

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
where __S: Serializer,

Serialize this value into the given Serde serializer. Read more
Source§

impl<A: Copy + Default, T: Copy + Default, const K: usize, const B: usize> StructuralPartialEq for ImmutableKdTree<A, T, K, B>

Auto Trait Implementations§

§

impl<A, T, const K: usize, const B: usize> Freeze for ImmutableKdTree<A, T, K, B>

§

impl<A, T, const K: usize, const B: usize> RefUnwindSafe for ImmutableKdTree<A, T, K, B>

§

impl<A, T, const K: usize, const B: usize> Send for ImmutableKdTree<A, T, K, B>
where A: Send, T: Send,

§

impl<A, T, const K: usize, const B: usize> Sync for ImmutableKdTree<A, T, K, B>
where A: Sync, T: Sync,

§

impl<A, T, const K: usize, const B: usize> Unpin for ImmutableKdTree<A, T, K, B>
where A: Unpin, T: Unpin,

§

impl<A, T, const K: usize, const B: usize> UnwindSafe for ImmutableKdTree<A, T, K, B>

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> ArchivePointee for T

Source§

type ArchivedMetadata = ()

The archived version of the pointer metadata for this type.
Source§

fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata

Converts some archived metadata to the pointer metadata for itself.
Source§

impl<T> ArchivePointee for T

Source§

type ArchivedMetadata = ()

The archived version of the pointer metadata for this type.
Source§

fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata

Converts some archived metadata to the pointer metadata for itself.
Source§

impl<T> ArchiveUnsized for T
where T: Archive,

Source§

type Archived = <T as Archive>::Archived

The archived counterpart of this type. Unlike Archive, it may be unsized. Read more
Source§

fn archived_metadata( &self, ) -> <<T as ArchiveUnsized>::Archived as ArchivePointee>::ArchivedMetadata

Creates the archived version of the metadata for this value.
Source§

impl<T> Az for T

Source§

fn az<Dst>(self) -> Dst
where T: Cast<Dst>,

Casts the value.
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<Src, Dst> CastFrom<Src> for Dst
where Src: Cast<Dst>,

Source§

fn cast_from(src: Src) -> Dst

Casts the value.
Source§

impl<T> CheckedAs for T

Source§

fn checked_as<Dst>(self) -> Option<Dst>
where T: CheckedCast<Dst>,

Casts the value.
Source§

impl<Src, Dst> CheckedCastFrom<Src> for Dst
where Src: CheckedCast<Dst>,

Source§

fn checked_cast_from(src: Src) -> Option<Dst>

Casts the value.
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit #126799)
Performs copy-assignment from self to dest. Read more
Source§

impl<F, W, T, D> Deserialize<With<T, W>, D> for F
where W: DeserializeWith<F, T, D>, D: Fallible + ?Sized, F: ?Sized,

Source§

fn deserialize( &self, deserializer: &mut D, ) -> Result<With<T, W>, <D as Fallible>::Error>

Deserializes using the given deserializer
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> LayoutRaw for T

Source§

fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>

Returns the layout of the type.
Source§

impl<Src, Dst> LosslessTryInto<Dst> for Src
where Dst: LosslessTryFrom<Src>,

Source§

fn lossless_try_into(self) -> Option<Dst>

Performs the conversion.
Source§

impl<Src, Dst> LossyInto<Dst> for Src
where Dst: LossyFrom<Src>,

Source§

fn lossy_into(self) -> Dst

Performs the conversion.
Source§

impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
where T: SharedNiching<N1, N2>, N1: Niching<T>, N2: Niching<T>,

Source§

unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool

Returns whether the given value has been niched. Read more
Source§

fn resolve_niched(out: Place<NichedOption<T, N1>>)

Writes data to out indicating that a T is niched.
Source§

impl<T> OverflowingAs for T

Source§

fn overflowing_as<Dst>(self) -> (Dst, bool)
where T: OverflowingCast<Dst>,

Casts the value.
Source§

impl<Src, Dst> OverflowingCastFrom<Src> for Dst
where Src: OverflowingCast<Dst>,

Source§

fn overflowing_cast_from(src: Src) -> (Dst, bool)

Casts the value.
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Pointee for T

Source§

type Metadata = ()

The type for metadata in pointers and references to Self.
Source§

impl<T> Pointee for T

Source§

type Metadata = ()

The metadata type for pointers and references to this type.
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> SaturatingAs for T

Source§

fn saturating_as<Dst>(self) -> Dst
where T: SaturatingCast<Dst>,

Casts the value.
Source§

impl<Src, Dst> SaturatingCastFrom<Src> for Dst
where Src: SaturatingCast<Dst>,

Source§

fn saturating_cast_from(src: Src) -> Dst

Casts the value.
Source§

impl<T, S> SerializeUnsized<S> for T
where T: Serialize<S>, S: Fallible + Writer + ?Sized,

Source§

fn serialize_unsized( &self, serializer: &mut S, ) -> Result<usize, <S as Fallible>::Error>

Writes the object and returns the position of the archived type.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

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

Source§

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>,

Source§

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.
Source§

impl<T> UnwrappedAs for T

Source§

fn unwrapped_as<Dst>(self) -> Dst
where T: UnwrappedCast<Dst>,

Casts the value.
Source§

impl<Src, Dst> UnwrappedCastFrom<Src> for Dst
where Src: UnwrappedCast<Dst>,

Source§

fn unwrapped_cast_from(src: Src) -> Dst

Casts the value.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> WrappingAs for T

Source§

fn wrapping_as<Dst>(self) -> Dst
where T: WrappingCast<Dst>,

Casts the value.
Source§

impl<Src, Dst> WrappingCastFrom<Src> for Dst
where Src: WrappingCast<Dst>,

Source§

fn wrapping_cast_from(src: Src) -> Dst

Casts the value.
Source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,