Struct heapless::Vec [−][src]
#[repr(transparent)]pub struct Vec<T, N>(_)
where
N: ArrayLength<T>;
Expand description
A fixed capacity Vec
Examples
use heapless::Vec; use heapless::consts::*; // A vector with a fixed capacity of 8 elements allocated on the stack let mut vec = Vec::<_, U8>::new(); vec.push(1); vec.push(2); assert_eq!(vec.len(), 2); assert_eq!(vec[0], 1); assert_eq!(vec.pop(), Some(2)); assert_eq!(vec.len(), 1); vec[0] = 7; assert_eq!(vec[0], 7); vec.extend([1, 2, 3].iter().cloned()); for x in &vec { println!("{}", x); } assert_eq!(vec, [7, 1, 2, 3]);
Implementations
Constructs a new, empty vector with a fixed capacity of N
Examples
use heapless::Vec; use heapless::consts::*; // allocate the vector on the stack let mut x: Vec<u8, U16> = Vec::new(); // allocate the vector in a static variable static mut X: Vec<u8, U16> = Vec(heapless::i::Vec::new());
Constructs a new vector with a fixed capacity of N and fills it
with the provided slice.
This is equivalent to the following code:
use heapless::Vec; use heapless::consts::*; let mut v: Vec<u8, U16> = Vec::new(); v.extend_from_slice(&[1, 2, 3]).unwrap();
Clones and appends all elements in a slice to the Vec.
Iterates over the slice other, clones each element, and then appends
it to this Vec. The other vector is traversed in-order.
Examples
use heapless::Vec; use heapless::consts::*; let mut vec = Vec::<u8, U8>::new(); vec.push(1).unwrap(); vec.extend_from_slice(&[2, 3, 4]).unwrap(); assert_eq!(*vec, [1, 2, 3, 4]);
Removes the last element from a vector and return it, or None if it’s empty
Appends an item to the back of the collection
Returns back the item if the vector is full
Shortens the vector, keeping the first len elements and dropping the rest.
Resizes the Vec in-place so that len is equal to new_len.
If new_len is greater than len, the Vec is extended by the difference, with each additional slot filled with value. If new_len is less than len, the Vec is simply truncated.
See also resize_default.
Resizes the Vec in-place so that len is equal to new_len.
If new_len is greater than len, the Vec is extended by the
difference, with each additional slot filled with Default::default().
If new_len is less than len, the Vec is simply truncated.
See also resize.
Forces the length of the vector to new_len.
This is a low-level operation that maintains none of the normal
invariants of the type. Normally changing the length of a vector
is done using one of the safe operations instead, such as
truncate, resize, extend, or clear.
Safety
new_lenmust be less than or equal tocapacity().- The elements at
old_len..new_lenmust be initialized.
Examples
This method can be useful for situations in which the vector is serving as a buffer for other code, particularly over FFI:
use heapless::Vec; use heapless::consts::*; pub fn get_dictionary(&self) -> Option<Vec<u8, U32768>> { // Per the FFI method's docs, "32768 bytes is always enough". let mut dict = Vec::new(); let mut dict_length = 0; // SAFETY: When `deflateGetDictionary` returns `Z_OK`, it holds that: // 1. `dict_length` elements were initialized. // 2. `dict_length` <= the capacity (32_768) // which makes `set_len` safe to call. unsafe { // Make the FFI call... let r = deflateGetDictionary(self.strm, dict.as_mut_ptr(), &mut dict_length); if r == Z_OK { // ...and update the length to what was initialized. dict.set_len(dict_length); Some(dict) } else { None } } }
While the following example is sound, there is a memory leak since
the inner vectors were not freed prior to the set_len call:
use core::iter::FromIterator; use heapless::Vec; use heapless::consts::*; let mut vec = Vec::<Vec<u8, U3>, U3>::from_iter( [ Vec::from_iter([1, 0, 0].iter().cloned()), Vec::from_iter([0, 1, 0].iter().cloned()), Vec::from_iter([0, 0, 1].iter().cloned()), ] .iter() .cloned() ); // SAFETY: // 1. `old_len..0` is empty so no elements need to be initialized. // 2. `0 <= capacity` always holds whatever `capacity` is. unsafe { vec.set_len(0); }
Normally, here, one would use clear instead to correctly drop
the contents and thus not leak memory.
Removes an element from the vector and returns it.
The removed element is replaced by the last element of the vector.
This does not preserve ordering, but is O(1).
Panics
Panics if index is out of bounds.
Examples
use heapless::Vec; use heapless::consts::*; let mut v: Vec<_, U8> = Vec::new(); v.push("foo").unwrap(); v.push("bar").unwrap(); v.push("baz").unwrap(); v.push("qux").unwrap(); assert_eq!(v.swap_remove(1), "bar"); assert_eq!(&*v, ["foo", "qux", "baz"]); assert_eq!(v.swap_remove(0), "foo"); assert_eq!(&*v, ["baz", "qux"]);
Returns true if needle is a prefix of the Vec.
Always returns true if needle is an empty slice.
Examples
use heapless::Vec; use heapless::consts::*; let v: Vec<_, U8> = Vec::from_slice(b"abc").unwrap(); assert_eq!(v.starts_with(b""), true); assert_eq!(v.starts_with(b"ab"), true); assert_eq!(v.starts_with(b"bc"), false);
Returns true if needle is a suffix of the Vec.
Always returns true if needle is an empty slice.
Examples
use heapless::Vec; use heapless::consts::*; let v: Vec<_, U8> = Vec::from_slice(b"abc").unwrap(); assert_eq!(v.ends_with(b""), true); assert_eq!(v.ends_with(b"ab"), false); assert_eq!(v.ends_with(b"bc"), true);
Trait Implementations
Performs copy-assignment from source. Read more
Extends a collection with the contents of an iterator. Read more
fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)extend_one)Extends a collection with exactly one element.
fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)extend_one)Reserves capacity in a collection for the given number of additional elements. Read more
Extends a collection with the contents of an iterator. Read more
fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)extend_one)Extends a collection with exactly one element.
fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)extend_one)Reserves capacity in a collection for the given number of additional elements. Read more
Feeds a slice of this type into the given [Hasher]. Read more
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 0]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 0]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 1]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 1]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 10]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 10]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 11]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 11]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 12]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 12]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 13]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 13]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 14]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 14]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 15]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 15]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 16]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 16]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 17]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 17]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 18]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 18]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 19]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 19]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 2]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 2]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 20]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 20]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 21]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 21]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 22]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 22]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 23]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 23]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 24]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 24]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 25]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 25]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 26]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 26]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 27]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 27]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 28]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 28]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 29]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 29]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 3]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 3]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 30]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 30]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 31]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 31]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 32]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 32]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 4]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 4]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 5]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 5]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 6]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 6]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 7]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 7]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 8]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 8]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B; 9]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B; 9]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a [B]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a [B]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<&'a mut [B]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<&'a mut [B]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 0]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 0]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 1]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 1]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 10]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 10]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 11]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 11]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 12]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 12]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 13]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 13]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 14]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 14]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 15]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 15]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 16]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 16]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 17]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 17]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 18]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 18]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 19]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 19]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 2]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 2]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 20]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 20]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 21]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 21]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 22]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 22]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 23]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 23]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 24]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 24]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 25]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 25]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 26]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 26]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 27]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 27]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 28]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 28]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 29]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 29]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 3]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 3]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 30]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 30]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 31]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 31]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 32]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 32]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 4]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 4]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 5]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 5]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 6]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 6]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 7]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 7]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 8]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 8]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<'a, 'b, A, B, N> PartialEq<[B; 9]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>,
impl<'a, 'b, A, B, N> PartialEq<[B; 9]> for Vec<A, N> where
A: PartialEq<B>,
N: ArrayLength<A>, impl<A, B, N1, N2> PartialEq<Vec<B, N2>> for Vec<A, N1> where
N1: ArrayLength<A>,
N2: ArrayLength<B>,
A: PartialEq<B>,
impl<A, B, N1, N2> PartialEq<Vec<B, N2>> for Vec<A, N1> where
N1: ArrayLength<A>,
N2: ArrayLength<B>,
A: PartialEq<B>, Writes a string slice into this writer, returning whether the write succeeded. Read more
Auto Trait Implementations
impl<T, N> Send for Vec<T, N> where
T: Send, impl<T, N> Sync for Vec<T, N> where
T: Sync, impl<T, N> Unpin for Vec<T, N> where
<N as ArrayLength<T>>::ArrayType: Unpin, Blanket Implementations
pub fn borrow_mut(&mut self) -> &mut T
pub fn borrow_mut(&mut self) -> &mut TMutably borrows from an owned value. Read more
pub fn from(t: T) -> T
pub fn from(t: T) -> TPerforms the conversion.
pub fn into(self) -> U
pub fn into(self) -> UPerforms the conversion.