[−][src]Enum tinyvec::TinyVec
A vector that starts inline, but can automatically move to the heap.
- Requires the
alloc
feature
A TinyVec
is either an Inline(ArrayVec
) or
Heap(Vec
). The
interface for the type as a whole is a bunch of methods that just match on
the enum variant and then call the same method on the inner vec.
Construction
Because it's an enum, you can construct a TinyVec
simply by making an
ArrayVec
or Vec
and then putting it into the enum.
There is also a macro
let empty_tv = tiny_vec!([u8; 16]); let some_ints = tiny_vec!([i32; 4], 1, 2, 3);
Variants
Inline(ArrayVec<A>)
Implementations
impl<A: Array> TinyVec<A>
[src]
pub fn move_to_the_heap(&mut self)
[src]
Moves the content of the TinyVec to the heap, if it's inline.
impl<A: Array> TinyVec<A>
[src]
pub fn append(&mut self, other: &mut Self)
[src]
Move all values from other
into this vec.
#[must_use]pub fn as_mut_ptr(&mut self) -> *mut A::Item
[src]
A mutable pointer to the backing array.
Safety
This pointer has provenance over the entire backing array/buffer.
#[must_use]pub fn as_mut_slice(&mut self) -> &mut [A::Item]
[src]
Helper for getting the mut slice.
#[must_use]pub fn as_ptr(&self) -> *const A::Item
[src]
A const pointer to the backing array.
Safety
This pointer has provenance over the entire backing array/buffer.
#[must_use]pub fn as_slice(&self) -> &[A::Item]
[src]
Helper for getting the shared slice.
#[must_use]pub fn capacity(&self) -> usize
[src]
The capacity of the TinyVec
.
When not heap allocated this is fixed based on the array type. Otherwise its the result of the underlying Vec::capacity.
pub fn clear(&mut self)
[src]
Removes all elements from the vec.
pub fn drain<R: RangeBounds<usize>>(&mut self, range: R) -> TinyVecDrain<'_, A>ⓘNotable traits for TinyVecDrain<'p, A>
impl<'p, A: Array> Iterator for TinyVecDrain<'p, A> type Item = A::Item;
[src]
Notable traits for TinyVecDrain<'p, A>
impl<'p, A: Array> Iterator for TinyVecDrain<'p, A> type Item = A::Item;
Creates a draining iterator that removes the specified range in the vector and yields the removed items.
Panics
- If the start is greater than the end
- If the end is past the edge of the vec.
Example
use tinyvec::*; let mut tv = tiny_vec!([i32; 4], 1, 2, 3); let tv2: TinyVec<[i32; 4]> = tv.drain(1..).collect(); assert_eq!(tv.as_slice(), &[1][..]); assert_eq!(tv2.as_slice(), &[2, 3][..]); tv.drain(..); assert_eq!(tv.as_slice(), &[]);
pub fn extend_from_slice(&mut self, sli: &[A::Item]) where
A::Item: Clone,
[src]
A::Item: Clone,
Clone each element of the slice into this vec.
#[must_use]pub fn from_array_len(data: A, len: usize) -> Self
[src]
Wraps up an array and uses the given length as the initial length.
Note that the From
impl for arrays assumes the full length is used.
Panics
The length must be less than or equal to the capacity of the array.
pub fn insert(&mut self, index: usize, item: A::Item)
[src]
Inserts an item at the position given, moving all following elements +1 index.
Panics
- If
index
>len
Example
use tinyvec::*; let mut tv = tiny_vec!([i32; 10], 1, 2, 3); tv.insert(1, 4); assert_eq!(tv.as_slice(), &[1, 4, 2, 3]); tv.insert(4, 5); assert_eq!(tv.as_slice(), &[1, 4, 2, 3, 5]);
#[must_use]pub fn is_empty(&self) -> bool
[src]
If the vec is empty.
#[must_use]pub fn len(&self) -> usize
[src]
The length of the vec (in elements).
#[must_use]pub fn new() -> Self where
A: Default,
[src]
A: Default,
Makes a new, empty vec.
pub fn pop(&mut self) -> Option<A::Item>
[src]
Remove and return the last element of the vec, if there is one.
Failure
- If the vec is empty you get
None
.
pub fn push(&mut self, val: A::Item)
[src]
Place an element onto the end of the vec.
Panics
- If the length of the vec would overflow the capacity.
pub fn remove(&mut self, index: usize) -> A::Item
[src]
Removes the item at index
, shifting all others down by one index.
Returns the removed element.
Panics
If the index is out of bounds.
Example
use tinyvec::*; let mut tv = tiny_vec!([i32; 4], 1, 2, 3); assert_eq!(tv.remove(1), 2); assert_eq!(tv.as_slice(), &[1, 3][..]);
pub fn resize(&mut self, new_len: usize, new_val: A::Item) where
A::Item: Clone,
[src]
A::Item: Clone,
Resize the vec to the new length.
If it needs to be longer, it's filled with clones of the provided value. If it needs to be shorter, it's truncated.
Example
use tinyvec::*; let mut tv = tiny_vec!([&str; 10], "hello"); tv.resize(3, "world"); assert_eq!(tv.as_slice(), &["hello", "world", "world"][..]); let mut tv = tiny_vec!([i32; 10], 1, 2, 3, 4); tv.resize(2, 0); assert_eq!(tv.as_slice(), &[1, 2][..]);
pub fn resize_with<F: FnMut() -> A::Item>(&mut self, new_len: usize, f: F)
[src]
Resize the vec to the new length.
If it needs to be longer, it's filled with repeated calls to the provided function. If it needs to be shorter, it's truncated.
Example
use tinyvec::*; let mut tv = tiny_vec!([i32; 10], 1, 2, 3); tv.resize_with(5, Default::default); assert_eq!(tv.as_slice(), &[1, 2, 3, 0, 0][..]); let mut tv = tiny_vec!([i32; 10]); let mut p = 1; tv.resize_with(4, || { p *= 2; p }); assert_eq!(tv.as_slice(), &[2, 4, 8, 16][..]);
pub fn retain<F: FnMut(&A::Item) -> bool>(&mut self, acceptable: F)
[src]
Walk the vec and keep only the elements that pass the predicate given.
Example
use tinyvec::*; let mut tv = tiny_vec!([i32; 10], 1, 2, 3, 4); tv.retain(|&x| x % 2 == 0); assert_eq!(tv.as_slice(), &[2, 4][..]);
pub fn split_off(&mut self, at: usize) -> Self where
A: Default,
[src]
A: Default,
Splits the collection at the point given.
[0, at)
stays in this vec[at, len)
ends up in the new vec.
Panics
- if at > len
Example
use tinyvec::*; let mut tv = tiny_vec!([i32; 4], 1, 2, 3); let tv2 = tv.split_off(1); assert_eq!(tv.as_slice(), &[1][..]); assert_eq!(tv2.as_slice(), &[2, 3][..]);
pub fn swap_remove(&mut self, index: usize) -> A::Item
[src]
Remove an element, swapping the end of the vec into its place.
Panics
- If the index is out of bounds.
Example
use tinyvec::*; let mut tv = tiny_vec!([&str; 4], "foo", "bar", "quack", "zap"); assert_eq!(tv.swap_remove(1), "bar"); assert_eq!(tv.as_slice(), &["foo", "zap", "quack"][..]); assert_eq!(tv.swap_remove(0), "foo"); assert_eq!(tv.as_slice(), &["quack", "zap"][..]);
pub fn truncate(&mut self, new_len: usize)
[src]
Reduces the vec's length to the given value.
If the vec is already shorter than the input, nothing happens.
pub fn try_from_array_len(data: A, len: usize) -> Result<Self, A>
[src]
Wraps an array, using the given length as the starting length.
If you want to use the whole length of the array, you can just use the
From
impl.
Failure
If the given length is greater than the capacity of the array this will
error, and you'll get the array back in the Err
.
Trait Implementations
impl<A: Array> AsMut<[<A as Array>::Item]> for TinyVec<A>
[src]
impl<A: Array> AsRef<[<A as Array>::Item]> for TinyVec<A>
[src]
impl<A: Array> Binary for TinyVec<A> where
A::Item: Binary,
[src]
A::Item: Binary,
impl<A: Array> Borrow<[<A as Array>::Item]> for TinyVec<A>
[src]
impl<A: Array> BorrowMut<[<A as Array>::Item]> for TinyVec<A>
[src]
#[must_use]fn borrow_mut(&mut self) -> &mut [A::Item]
[src]
impl<A: Clone + Array> Clone for TinyVec<A> where
A::Item: Clone,
[src]
A::Item: Clone,
fn clone(&self) -> TinyVec<A>
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<A: Array> Debug for TinyVec<A> where
A::Item: Debug,
[src]
A::Item: Debug,
impl<A: Array + Default> Default for TinyVec<A>
[src]
impl<A: Array> Deref for TinyVec<A>
[src]
type Target = [A::Item]
The resulting type after dereferencing.
#[must_use]fn deref(&self) -> &Self::Target
[src]
impl<A: Array> DerefMut for TinyVec<A>
[src]
impl<A: Array> Display for TinyVec<A> where
A::Item: Display,
[src]
A::Item: Display,
impl<A: Array> Eq for TinyVec<A> where
A::Item: Eq,
[src]
A::Item: Eq,
impl<A: Array> Extend<<A as Array>::Item> for TinyVec<A>
[src]
fn extend<T: IntoIterator<Item = A::Item>>(&mut self, iter: T)
[src]
fn extend_one(&mut self, item: A)
[src]
fn extend_reserve(&mut self, additional: usize)
[src]
impl<T, A, '_> From<&'_ [T]> for TinyVec<A> where
T: Clone + Default,
A: Array<Item = T> + Default,
[src]
T: Clone + Default,
A: Array<Item = T> + Default,
impl<T, A, '_> From<&'_ mut [T]> for TinyVec<A> where
T: Clone + Default,
A: Array<Item = T> + Default,
[src]
T: Clone + Default,
A: Array<Item = T> + Default,
impl<A: Array> From<A> for TinyVec<A>
[src]
impl<A: Array> From<ArrayVec<A>> for TinyVec<A>
[src]
impl<A: Array + Default> FromIterator<<A as Array>::Item> for TinyVec<A>
[src]
#[must_use]fn from_iter<T: IntoIterator<Item = A::Item>>(iter: T) -> Self
[src]
impl<A: Array> Hash for TinyVec<A> where
A::Item: Hash,
[src]
A::Item: Hash,
fn hash<H: Hasher>(&self, state: &mut H)
[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl<A: Array, I: SliceIndex<[A::Item]>> Index<I> for TinyVec<A>
[src]
type Output = <I as SliceIndex<[A::Item]>>::Output
The returned type after indexing.
#[must_use]fn index(&self, index: I) -> &Self::Output
[src]
impl<A: Array, I: SliceIndex<[A::Item]>> IndexMut<I> for TinyVec<A>
[src]
impl<A: Array> IntoIterator for TinyVec<A>
[src]
type Item = A::Item
The type of the elements being iterated over.
type IntoIter = TinyVecIterator<A>
Which kind of iterator are we turning this into?
#[must_use]fn into_iter(self) -> Self::IntoIter
[src]
impl<'a, A: Array> IntoIterator for &'a mut TinyVec<A>
[src]
type Item = &'a mut A::Item
The type of the elements being iterated over.
type IntoIter = IterMut<'a, A::Item>
Which kind of iterator are we turning this into?
#[must_use]fn into_iter(self) -> Self::IntoIter
[src]
impl<'a, A: Array> IntoIterator for &'a TinyVec<A>
[src]
type Item = &'a A::Item
The type of the elements being iterated over.
type IntoIter = Iter<'a, A::Item>
Which kind of iterator are we turning this into?
#[must_use]fn into_iter(self) -> Self::IntoIter
[src]
impl<A: Array> LowerExp for TinyVec<A> where
A::Item: LowerExp,
[src]
A::Item: LowerExp,
impl<A: Array> LowerHex for TinyVec<A> where
A::Item: LowerHex,
[src]
A::Item: LowerHex,
impl<A: Array> Octal for TinyVec<A> where
A::Item: Octal,
[src]
A::Item: Octal,
impl<A: Array> Ord for TinyVec<A> where
A::Item: Ord,
[src]
A::Item: Ord,
#[must_use]fn cmp(&self, other: &Self) -> Ordering
[src]
#[must_use]fn max(self, other: Self) -> Self
1.21.0[src]
#[must_use]fn min(self, other: Self) -> Self
1.21.0[src]
#[must_use]fn clamp(self, min: Self, max: Self) -> Self
[src]
impl<A: Array, '_> PartialEq<&'_ [<A as Array>::Item]> for TinyVec<A> where
A::Item: PartialEq,
[src]
A::Item: PartialEq,
#[must_use]fn eq(&self, other: &&[A::Item]) -> bool
[src]
#[must_use]fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<A: Array, '_> PartialEq<&'_ A> for TinyVec<A> where
A::Item: PartialEq,
[src]
A::Item: PartialEq,
#[must_use]fn eq(&self, other: &&A) -> bool
[src]
#[must_use]fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<A: Array> PartialEq<TinyVec<A>> for TinyVec<A> where
A::Item: PartialEq,
[src]
A::Item: PartialEq,
#[must_use]fn eq(&self, other: &Self) -> bool
[src]
#[must_use]fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<A: Array> PartialOrd<TinyVec<A>> for TinyVec<A> where
A::Item: PartialOrd,
[src]
A::Item: PartialOrd,
#[must_use]fn partial_cmp(&self, other: &Self) -> Option<Ordering>
[src]
#[must_use]fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn le(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn gt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn ge(&self, other: &Rhs) -> bool
1.0.0[src]
impl<A: Array> Pointer for TinyVec<A> where
A::Item: Pointer,
[src]
A::Item: Pointer,
impl<A: Array> UpperExp for TinyVec<A> where
A::Item: UpperExp,
[src]
A::Item: UpperExp,
impl<A: Array> UpperHex for TinyVec<A> where
A::Item: UpperHex,
[src]
A::Item: UpperHex,
Auto Trait Implementations
impl<A> Send for TinyVec<A> where
A: Send,
<A as Array>::Item: Send,
A: Send,
<A as Array>::Item: Send,
impl<A> Sync for TinyVec<A> where
A: Sync,
<A as Array>::Item: Sync,
A: Sync,
<A as Array>::Item: Sync,
impl<A> Unpin for TinyVec<A> where
A: Unpin,
<A as Array>::Item: Unpin,
A: Unpin,
<A as Array>::Item: Unpin,
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<!> for 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<I> IntoIterator for I where
I: Iterator,
[src]
I: Iterator,
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = I
Which kind of iterator are we turning this into?
fn into_iter(self) -> I
[src]
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T> ToString for T where
T: Display + ?Sized,
[src]
T: Display + ?Sized,
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>,