Type Alias DynVec 

pub type DynVec<T> = dyn Vector<T>;

Implementations

impl<T: DataTrait + ?Sized> DynVec<T>

pub fn approximate_byte_size(&self) -> usize

Methods from Deref<Target = LeanVec<T::Type>>

pub fn len(&self) -> usize

pub fn spare_capacity(&self) -> usize

pub fn has_spare_capacity(&self) -> bool

pub unsafe fn set_len(&mut self, new_len: usize)

Sets the current vector’s length to new_len

Safety

• new_len must be less than or equal to [self.capacity()].
• The elements at old_len..new_len must be initialized.

[self.capacity()]: RawVec ::capacity

pub fn is_empty(&self) -> bool

pub fn capacity(&self) -> usize

pub fn as_ptr(&self) -> *const T

pub fn as_slice(&self) -> &[T]

pub fn as_mut_ptr(&mut self) -> *mut T

pub fn as_mut_slice(&mut self) -> &mut [T]

pub fn reserve(&mut self, additional: usize)

pub fn reserve_exact(&mut self, additional: usize)

pub fn clear(&mut self)

pub fn truncate(&mut self, len: usize)

pub fn push(&mut self, value: T)

pub unsafe fn push_unchecked(&mut self, value: T)

Push value to self without checking for spare capacity or allocating new capacity.

Safety

Requires that self.capacity() > self.len().

pub fn extend_from_slice(&mut self, other: &[T])

where T: Clone,

pub fn append_from_slice(&mut self, other: &mut [T])

where T: Default,

pub fn append(&mut self, other: &mut Self)

pub fn dedup(&mut self)

where T: Eq,

pub fn dedup_by<F>(&mut self, same_bucket: F)

where F: FnMut(&mut T, &mut T) -> bool,

pub fn dedup_by_starting_at<F>(&mut self, start: usize, same_bucket: F)

where F: FnMut(&mut T, &mut T) -> bool,

pub fn retain<F>(&mut self, f: F)

where F: FnMut(&mut T) -> bool,

pub fn retain_starting_at<F>(&mut self, start: usize, f: F)

where F: FnMut(&mut T) -> bool,

pub fn is_sorted_by<F>(&self, compare: F) -> bool

where F: Fn(&T, &T) -> Ordering,

pub fn raw_iter(&self) -> RawIter<'_>

Trait Implementations

impl<T> Archive for Box<DynVec<T>>

type Archived = ()

The archived representation of this type.

type Resolver = ()

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

unsafe fn resolve( &self, _pos: usize, _resolver: Self::Resolver, _out: *mut Self::Archived, )

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

impl<T> ArchiveTrait for DynVec<T>

where T: DataTrait + ?Sized,

type Archived = dyn DeserializeDyn<dyn Vector<T>>

impl<T> Clone for Box<DynVec<T>>

where T: DataTrait + ?Sized,

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: DataTraitTyped + ?Sized> Deref for DynVec<T>

type Target = LeanVec<<T as DataTyped>::Type>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T: DataTraitTyped + ?Sized> DerefMut for DynVec<T>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<T> DowncastTrait for DynVec<T>

where T: DataTrait + ?Sized,

fn downcast_checked<T: AsAny>(&self) -> &T

Cast trait object reference to a reference to a concrete type T.

fn downcast_mut_checked<T: AsAny>(&mut self) -> &mut T

Cast trait object reference to a mutable reference to a concrete type T.

unsafe fn downcast<T: AsAny>(&self) -> &T

Cast trait object reference to a reference to a concrete type T, eliding type checking.

unsafe fn downcast_mut<T: AsAny>(&mut self) -> &mut T

Cast trait object reference to a reference to a mutable reference to concrete type T, eliding type checking.

impl<T> Hash for DynVec<T>

where T: DataTrait + ?Sized,

fn hash<H>(&self, state: &mut H)

where H: Hasher,

Feeds this value into the given Hasher.

impl<T: DataTrait + ?Sized> Index<usize> for DynVec<T>

type Output = T

The returned type after indexing.

fn index(&self, index: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<T: DataTrait + ?Sized> IndexMut<usize> for DynVec<T>

fn index_mut(&mut self, index: usize) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<T> Ord for DynVec<T>

where T: DataTrait + ?Sized,

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

impl<T> PartialEq for DynVec<T>

where T: DataTrait + ?Sized,

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<T> PartialOrd for DynVec<T>

where T: DataTrait + ?Sized,

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T> Serialize<CompositeSerializer<FBufSerializer<FBuf>, FallbackScratch<HeapScratch<65536>, AllocScratch>, SharedSerializeMap>> for Box<DynVec<T>>

fn serialize( &self, _serializer: &mut Serializer, ) -> Result<Self::Resolver, <Serializer as Fallible>::Error>

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

impl<T> Eq for DynVec<T>

where T: DataTrait + ?Sized,