[−][src]Struct ve::vec::Vec
A continuous growable array type, written Vec<T>
but pronounced 'vector'.
Examples
let mut vec = Vec::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().copied()); for x in &vec { println!("{}", x); } assert_eq!(vec, [7, 1, 2, 3]);
The vec!
macro is provided to make initialization more convenient:
let mut vec = vec![1, 2, 3]; vec.push(4); assert_eq!(vec, [1, 2, 3, 4]);
It can also initialize each element of a Vec<T>
with a given value.
This may be more efficient than performing allocation and initialization in separate steps,
especially when initializing a vector of zeros:
let vec = vec![0; 5]; assert_eq!(vec, [0, 0, 0, 0, 0]); // The follwing is equavalent, but potentially slower: let mut vec1 = Vec::with_capacity(5); vec1.resize(5, 0);
Use a Vec<T>
as an efficient stack:
let mut stack = Vec::new(); stack.push(1); stack.push(2); stack.push(3); while let Some(top) = stack.pop() { // Prints 3, 2, 1 println!("{}", top); }
Indexing
The Vec
type allows to access values by index, because it implements Index
trait.
An example will be more explicit:
let v = vec![0, 2, 4, 6]; println!("{}", v[1]); // it will display '2'
However be careful: if you try to access an index which isn't in the Vec
,
your software will panic! You cannot do this:
let v = vec![0, 2, 4, 6]; println!("{}", v[6]); // it will panic!
Use get
and get_mut
if you want to check whether the index is in the Vec
.
Slicing
A Vec
can be mutable. Slices, on the other hand, are read-only objects.
To get a slice, use &
. Example:
fn read_slice(slice: &[usize]) { // ... } let v = vec![0, 1]; read_slice(&v); // ... and that's all! // you can also do it like this: let u: &[usize] = &v;
In Rust, it's more common to pass slices as arguments rather than vectors when you just want to
provide read access. The same goes for String
and &str
.
Capacity and reallocation
The capacity of a vector is the amount of space allocated for any future elements that will be added onto the vector. This is not to be confused with the length of a vector, which specifies the number of actual elements within the vector. If a vector's length exceeds its capacity, its capacity will automatically be increased but its elements will have to be reallocated.
For example, a vector with capacity 10 and length 0 would be an empty vector with space for 10
more elements. Pushing 10 or fewer elements onto the vector will not change its capacity or
cause reallocation to occur. However, if the vector's length is increased to 11, it will have
to reallocate, which can be slow. For this reason, it is recommended to use
Vec::with_capacity
whenever possible to specify how big the vector is expected to get.
Guarantees
TODO Guarantees
Implementations
impl<T> Vec<T>
[src]
pub fn new() -> Vec<T>
[src]
Constructs a new empty, Vec<T>
.
The vector will not allocate until elements are pushed onto it.
Examples
let mut vec: Vec<i32> = Vec::new();
pub fn with_capacity(capacity: usize) -> Vec<T>
[src]
Constructs a new, empty Vec<T>
with the specified capacity.
The vector will be able to hold exactly capacity
elements without reallocating. If
capacity
is 0, the vector will not allocate.
It is important to note that although the returned vector has the capacity specified, the vector will have a zero length. For an explanation of the difference between length and capacity, see Capacity and reallocation.
Examples
let mut vec = Vec::with_capacity(10); // The vector contains no items, even though it has capacity for more assert_eq!(vec.len(), 0); assert_eq!(vec.capacity(), 10); // These are all done without reallocating... for i in 0..10 { vec.push(i); } assert_eq!(vec.len(), 10); assert_eq!(vec.capacity(), 10); // ...but this may make the vector reallocate vec.push(11); assert_eq!(vec.len(), 11); assert!(vec.capacity() >= 11);
pub unsafe fn from_raw_parts(
ptr: *mut T,
length: usize,
capacity: usize
) -> Vec<T>
[src]
ptr: *mut T,
length: usize,
capacity: usize
) -> Vec<T>
Creates a Vec<T>
directly from the raw components of another vector.
Safety
This is highly unsafe, due to the number of invariants that aren't checked:
ptr
needs to have been previously allocated viaString
/Vec<T>
(at least, it's highly likely to be incorrect if it wasn't).T
needs to have the same size and alignment as whatptr
was allocated with. (T
having a less strict alignment is not sufficient, the alignment really needs to be equal to satisfy thedealloc
requirement that memory must be allocated and deallocated with the same layout.)length
needs to be less than or equal tocapacity
.capacity
needs to be the capacity that the pointer was allocated with.
Violating these may cause problems like corrupting the allocator's internal data
structures. For example it is not safe to build a Vec<u8>
from a pointer to a C
char
array with length size_t
. It's also not safe to build one from a Vec<u16>
and
its length, because the allocator cares about the alignment, and these two types have
different alignments. The buffer was allocated with alignment 2 (for u16
), but after
turning it into a Vec<u8>
it'll be deallocated with alignment 1.
The ownership of ptr
is effectively transferred to the Vec<T>
which may then
deallocate, reallocate or change the contents of memory pointed to by the pointer at will.
Ensure that nothing else uses the pointer after calling this function.
Examples
use std::ptr; use std::mem; let v = vec![1, 2, 3]; // Prevent running `v`'s destructor so we are in complete control // of the allocation. let mut v = mem::ManuallyDrop::new(v); // Pull out the various important pieces of information about `v` let p = v.as_mut_ptr(); let len = v.len(); let cap = v.capacity(); unsafe { // Overwrite memory with 4, 5, 6 for i in 0..len as isize { ptr::write(p.offset(i), 4 + i); } // Put everything back together into a Vec let rebuilt = Vec::from_raw_parts(p, len, cap); assert_eq!(rebuilt, [4, 5, 6]); }
pub fn capacity(&self) -> usize
[src]
Returns the number of elements the vector can hold without reallocating.
Examples
let vec: Vec<i32> = Vec::with_capacity(10); assert_eq!(vec.capacity(), 10);
pub fn reserve(&mut self, additional: usize)
[src]
Reserves capacity for at least additional
more elements to be inserted in the given
Vec<T>
. The collection may reserve more space to avoid frequent reallocations. After
calling reserve
, capacity will be greater than or equal to self.len() + additional
.
Does nothing if capacity is already sufficient.
Panics
Panics if the new capacity overflows usize
.
Examples
let mut vec = vec![1]; vec.reserve(10); assert!(vec.capacity() >= 11);
pub fn reserve_exact(&mut self, additional: usize)
[src]
Reserves the minimum capacity for exactly additional
more elements to be inserted in the
given Vec<T>
. After calling reserve_exact
, capacity will be greater than or equal to
self.len() + additional
. Does nothing if the capacity is already sufficient.
Note that the allocator may give the collection more space than it requests. Therefore,
capacity can not be relied upon to be precisely minimal. Prefer reverse
if future
insertions are expected.
Panics
Panics if the new capacity overflows usize
.
Examples
let mut vec = vec![1]; vec.reserve_exact(10); assert!(vec.capacity() >= 11);
pub fn shrink_to_fit(&mut self)
[src]
Shrinks the capacity of the vector as much as possible.
It will drop down as close as possible to the length but the allocator may still inform the vector that there is space for a few more elements.
Examples
let mut vec = Vec::with_capacity(10); vec.extend([1, 2, 3].iter().cloned()); assert_eq!(vec.capacity(), 10); vec.shrink_to_fit(); assert!(vec.capacity() >= 3);
pub fn into_boxed_slice(self) -> Box<[T]>
[src]
Converts the vector into Box<[T]>
.
Note that this will drop any excess capacity.
Examples
let v = vec![1, 2, 3]; let slice = v.into_boxed_slice();
Any excess capacity is removed:
let mut vec = Vec::with_capacity(10); vec.extend([1, 2, 3].iter().cloned()); assert_eq!(vec.capacity(), 10); let slice = vec.into_boxed_slice(); assert_eq!(slice.into_vec().capacity(), 3);
pub fn truncate(&mut self, len: usize)
[src]
Shortens the vector, keeping the first len
elements and dropping the rest.
If len
is greater than the vector's current length, this has no effect.
The drain
method can emulate truncate
, but causes the excess elements to be returned
instead of dropped.
Note that this method has no effect on the allocated capacity of the vector.
Examples
Truncating a five element vector to two elements:
let mut vec = vec![1, 2, 3, 4, 5]; vec.truncate(2); assert_eq!(vec, [1, 2]);
No truncation occurs when len
is greater than the vector's current length:
let mut vec = vec![1, 2, 3]; vec.truncate(8); assert_eq!(vec, [1, 2, 3]);
Truncating when len == 0
is equivalent to calling the clear
method.
let mut vec = vec![1, 2, 3]; vec.truncate(0); assert_eq!(vec, []);
pub fn as_slice(&self) -> &[T]
[src]
Extracts a slice containing the entire vector.
Equivalent to &s[..]
.
Examples
use std::io::{self, Write}; let buffer = vec![1, 2, 3, 4, 5]; io::sink().write(buffer.as_slice()).unwrap();
pub fn as_mut_slice(&mut self) -> &mut [T]
[src]
Extracts a mutable slice containing the entire vector.
Equivalent to &mut s[..]
.
Examples
use std::io::{self, Read}; let mut buffer = vec![0; 3]; io::repeat(0b101).read_exact(buffer.as_mut_slice()).unwrap();
pub fn as_ptr(&self) -> *const T
[src]
Returns a raw pointer to the vector's buffer.
The caller must ensure that the vector outlives the ponitre this function requires, or else it will end up pointing to garbage. Modifying the vector may cause its buffer to be reallocated, which would also make any pointers to it invalid.
The caller must also ensure that the memory (non-transitively) points to is never written
to (except inside an UnsafeCell
) using this pointer or any pointer derived from it. If
you need to mutate the contents of the slice, use as_mut_ptr
.
Examples
let x = vec![1, 2, 4]; let x_ptr = x.as_ptr(); unsafe { for i in 0..x.len() { assert_eq!(*x_ptr.add(i), 1 << i); } }
pub fn as_mut_ptr(&mut self) -> *mut T
[src]
Returns an unsafe mutable pointer to the vector's buffer.
The caller must ensure that the vector outlives the pointer this function returns, or else it will end up pointing to garbage. Modifying the vector may cause its buffer to be reallocated, which would also make any pointers to it invalid.
Examples
// Allocate vector big enough for 4 elements. let size = 4; let mut x: Vec<i32> = Vec::with_capacity(size); let x_ptr = x.as_mut_ptr(); // Initialize elements via raw pointer writes, then set length. unsafe { for i in 0..size { *x_ptr.add(i) = i as i32; } x.set_len(size); } assert_eq!(&*x, &[0,1,2,3]);
pub unsafe fn set_len(&mut self, new_len: usize)
[src]
Forces the length of the vector to new_len
.
THis is a low-level operation that maintains none of the normal invariants of the types.
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_len
must be less than or equal tocapacity()
.- The elements at
old_len..new_len
must 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:
pub fn get_dictionary(&self) -> Option<Vec<u8>> { // Per the FFI method's docs, "32768 bytes is always enough". let mut dict = Vec::with_capacity(32_768); 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) 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:
let mut vec = vec![vec![1, 0, 0], vec![0, 1, 0], vec![0, 0, 1]]; // 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.
pub fn swap_remove(&mut self, index: usize) -> T
[src]
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
let mut v = vec!["foo", "bar", "baz", "qux"]; 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"]);
pub fn insert(&mut self, index: usize, element: T)
[src]
Inserts an element at position index
within the vector, shifting all elements after it to
the right.
Panics
Panics if index > len
.
Examples
let mut vec = vec![1, 2, 3]; vec.insert(1, 4); assert_eq!(vec, [1, 4, 2, 3]); vec.insert(4, 5); assert_eq!(vec, [1, 4, 2, 3, 5]);
pub fn dedup_by<F>(&mut self, same_bucket: F) where
F: FnMut(&mut T, &mut T) -> bool,
[src]
F: FnMut(&mut T, &mut T) -> bool,
Removes all but the first of consecutive elements in the vector satisfying a given equality relation.
The same_bucket
function is passed references to two elements from the vector and must
determine if the elements compare equal. The elements are passed in opposite order from
their order in the slice, so if same_bucket(a, b)
returns true
, a
is removed.
If the vector is sorted, this removes all duplicates.
Examples
let mut vec = vec!["foo", "bar", "Bar", "baz", "bar"]; vec.dedup_by(|a, b| a.eq_ignore_ascii_case(b)); assert_eq!(vec, ["foo", "bar", "baz", "bar"]);
pub fn push(&mut self, value: T)
[src]
Appends an element to the back of a collection.
Panics
- Panics if the requested capacity exceeds
usize::MAX
bytes. - Panics on 32-bit platforms if the requested capacity exceeds
isize::MAX
bytes.
Examples
let mut vec = vec![1, 2]; vec.push(3); assert_eq!(vec, [1, 2, 3]);
pub fn pop(&mut self) -> Option<T>
[src]
Removes the last element from a vector and returns it, or None
if it is empty.
Examples
let mut vec = vec![1, 2, 3]; assert_eq!(vec.pop(), Some(3)); assert_eq!(vec, [1, 2]);
pub fn append(&mut self, other: &mut Self)
[src]
Moves all the elements of other
into Self
, leaving other
empty.
Panics
Panics if the number of elements in the vector overflows a usize
.
Examples
let mut vec = vec![1, 2, 3]; let mut vec2 = vec![4, 5, 6]; vec.append(&mut vec2);; assert_eq!(vec, [1, 2, 3, 4, 5, 6]); assert_eq!(vec2, []);
pub fn drain<R>(&mut self, range: R) -> Drain<'_, T>ⓘ where
R: RangeBounds<usize>,
[src]
R: RangeBounds<usize>,
Creates a draining iterator that removes the specified range in the vector and yields the removed items.
When the iterator is dropped, all elements in the range are removed from the vector,
even if the iterator was not fully consumed. If the iterator is not dropped (with
mem::forget
for example), it is unspecified how many elements are removed.
Panics
Panics if the starting point is greater than the ending point or if the ending point is greater than the length of the vector.
Examples
let mut v = vec![1, 2, 3]; let u: Vec<_> = v.drain(1..).collect(); assert_eq!(v, &[1]); assert_eq!(u, &[2, 3]); // A full range clears the vector v.drain(..); assert_eq!(v, &[]);
pub fn clear(&mut self)
[src]
Clears the vector, removing all values.
Note that this method has no effect on the allocated capacity of the vector.
Examples
let mut v = vec![1, 2, 3]; v.clear(); assert!(v.is_empty());
pub fn len(&self) -> usize
[src]
Returns the number of elements in the vector, also referred to as its 'length'.
Examples
let a = vec![1, 2, 3]; assert_eq!(a.len(), 3);
pub fn is_empty(&self) -> bool
[src]
Returns true
if the vector contains no elements.
Examples
let mut v = Vec::new(); assert!(v.is_empty()); v.push(1); assert!(!v.is_empty());
pub fn resize_with<F>(&mut self, new_len: usize, f: F) where
F: FnMut() -> T,
[src]
F: FnMut() -> T,
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 the result of calling the closure f
. The return values from
f
will end up in the Vec
in the order they have been generated.
If new_len
is less than len
, the Vec
is simply truncated.
This method uses a closure to create new values on every push. If you'd rather Clone
a
given value, use Vec::resize
. If you want to use the Default
trait to generate
values, you can pass Default::default
as the second argument.
Examples
let mut vec = vec![1, 2, 3]; vec.resize_with(5, Default::default); assert_eq!(vec, [1, 2, 3, 0, 0]); let mut vec = vec![]; let mut p = 1; vec.resize_with(4, || { p *= 2; p }); assert_eq!(vec, [2, 4, 8, 16]);
impl<T: Clone> Vec<T>
[src]
pub fn resize(&mut self, new_len: usize, value: T)
[src]
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.
This method requires T
to implement Clone
, in order to be able to clone the passed
value.
If you need more flexibility (or want to rely on Default
instead of Clone
), use
resize_with
.
Examples
let mut vec = vec!["hello"]; vec.resize(3, "world"); assert_eq!(vec, ["hello", "world", "world"]); let mut vec = vec![1, 2, 3, 4]; vec.resize(2, 0); assert_eq!(vec, [1, 2]);
pub fn extend_from_slice(&mut self, other: &[T])
[src]
Clones and appends all the 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.
Note that this function is same as extend
except that it is specialized to work with
slices instead. If and when Rust gets specialization this function will likely be
deprecated (but still available).
Examples
let mut vec = vec![1]; vec.extend_from_slice(&[2, 3, 4]); assert_eq!(vec, [1, 2, 3, 4]);
impl<T: PartialEq> Vec<T>
[src]
impl<T> Vec<T>
[src]
pub fn splice<R, I>(
&mut self,
range: R,
replace_with: I
) -> Splice<'_, I::IntoIter>ⓘ where
R: RangeBounds<usize>,
I: IntoIterator<Item = T>,
[src]
&mut self,
range: R,
replace_with: I
) -> Splice<'_, I::IntoIter>ⓘ where
R: RangeBounds<usize>,
I: IntoIterator<Item = T>,
Creates a splicing iterator that replaces the specified range in the vector with the given
replace_with
iterator and yields the remove items.
replace_with
does not need to be the same length as range
.
range
is removed even if the iterator is not consumed until the end.
It is unspecified how many elements are removed from the vector if the Splice
value is
leaked.
The input iterator replace_with
is only consumed when the Splice
value is dropped.
This is optimal if:
- The tail (elements in the vector after
range
) is empty, - or
replace_with
yields fewer elements thanrange
's length - or the lower bound of its
size_hint()
is exact.
Otherwise, a temporary vector is allocated and the tail is moved twice.
Panics
Panics if the starting point is greater than the end point or if the end point is greater than the length of the vector.
Examples
let mut v = vec![1, 2, 3]; let new = [7, 8]; let u: Vec<_> = v.splice(..2, new.iter().cloned()).collect(); assert_eq!(v, &[7, 8, 3]); assert_eq!(u, &[1, 2]);
Trait Implementations
impl<T> AsMut<[T]> for Vec<T>
[src]
impl<T> AsMut<Vec<T>> for Vec<T>
[src]
impl<T> AsRef<[T]> for Vec<T>
[src]
impl<T> AsRef<Vec<T>> for Vec<T>
[src]
impl<T> Borrow<[T]> for Vec<T>
[src]
impl<T: Clone> Clone for Vec<T>
[src]
fn clone(&self) -> Vec<T>
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<T: Debug> Debug for Vec<T>
[src]
impl<T> Default for Vec<T>
[src]
impl<T> Deref for Vec<T>
[src]
impl<T> DerefMut for Vec<T>
[src]
impl<T> Drop for Vec<T>
[src]
impl<T: Eq> Eq for Vec<T>
[src]
impl<T> Extend<T> for Vec<T>
[src]
fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)
[src]
fn extend_one(&mut self, item: A)
[src]
fn extend_reserve(&mut self, additional: usize)
[src]
impl<T: Clone, '_> From<&'_ [T]> for Vec<T>
[src]
impl<T: Clone, '_> From<&'_ mut [T]> for Vec<T>
[src]
impl<'_> From<&'_ str> for Vec<u8>
[src]
impl<T, const N: usize> From<[T; N]> for Vec<T>
[src]
impl<T> From<Box<[T]>> for Vec<T>
[src]
impl<'a, T> From<Cow<'a, [T]>> for Vec<T> where
[T]: ToOwned<Owned = Vec<T>>,
[src]
[T]: ToOwned<Owned = Vec<T>>,
impl<T> From<Vec<T>> for Box<[T]>
[src]
impl<T> FromIterator<T> for Vec<T>
[src]
fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Vec<T>
[src]
impl<T: Hash> Hash for Vec<T>
[src]
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<T, I: SliceIndex<[T]>> Index<I> for Vec<T>
[src]
type Output = I::Output
The returned type after indexing.
fn index(&self, index: I) -> &Self::Output
[src]
impl<T, I: SliceIndex<[T]>> IndexMut<I> for Vec<T>
[src]
impl<T> IntoIterator for Vec<T>
[src]
type Item = T
The type of the elements being iterated over.
type IntoIter = IntoIter<T>
Which kind of iterator are we turning this into?
fn into_iter(self) -> IntoIter<T>ⓘ
[src]
Creates a consuming iterator, that is, one that moves each value out of the vector (from start to end). The vector cannot be used after calling this.
Examples
let v = vec!["a".to_string(), "b".to_string()]; for s in v.into_iter() { // s has type String, not &String println!("{}", s); }
impl<'a, T> IntoIterator for &'a Vec<T>
[src]
type Item = &'a T
The type of the elements being iterated over.
type IntoIter = Iter<'a, T>
Which kind of iterator are we turning this into?
fn into_iter(self) -> Iter<'a, T>
[src]
impl<'a, T> IntoIterator for &'a mut Vec<T>
[src]
type Item = &'a mut T
The type of the elements being iterated over.
type IntoIter = IterMut<'a, T>
Which kind of iterator are we turning this into?
fn into_iter(self) -> IterMut<'a, T>
[src]
impl<T: Ord> Ord for Vec<T>
[src]
Implements ordering of vectors, lexographically.
fn cmp(&self, other: &Vec<T>) -> 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, B, const N: usize, '_> PartialEq<&'_ [B; N]> for Vec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
impl<A, B, '_> PartialEq<&'_ [B]> for Vec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
impl<A, B, '_> PartialEq<&'_ mut [B]> for Vec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
impl<A, B, const N: usize> PartialEq<[B; N]> for Vec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
impl<A, B> PartialEq<Vec<B>> for Vec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
impl<A, B, '_> PartialEq<Vec<B>> for &'_ [A] where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
impl<A, B, '_> PartialEq<Vec<B>> for &'_ mut [A] where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
impl<A, B, '_> PartialEq<Vec<B>> for Cow<'_, [A]> where
A: PartialEq<B>,
A: Clone,
[src]
A: PartialEq<B>,
A: Clone,
impl<T: PartialOrd> PartialOrd<Vec<T>> for Vec<T>
[src]
Implements comparison of vectors, lexographically.
Auto Trait Implementations
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<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, 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>,