Struct thin_vec::ThinVec
[−]
[src]
pub struct ThinVec<T> { /* fields omitted */ }
ThinVec is exactly the same as Vec, except that it stores its len
and capacity
in the buffer
it allocates.
This makes the memory footprint of ThinVecs lower; notably in cases where space is reserved for
a non-existence ThinVecVec<ThinVec<T>>
and Option<ThinVec<T>>::None
will waste less
space. Being pointer-sized also means it can be passed/stored in registers.
Of course, any actually constructed ThinVec will theoretically have a bigger allocation, but the fuzzy nature of allocators means that might not actually be the case.
Properties of Vec that are preserved:
ThinVec::new()
doesn't allocate (it points to a statically allocated singleton)- reallocation can be done in place
size_of::<ThinVec<T>>()
==size_of::<Option<ThinVec<T>>>()
- NOTE: This is only possible when the
unstable
feature is used.
- NOTE: This is only possible when the
Properties of Vec that aren't preserved:
ThinVec<T>
can't ever be zero-cost roundtripped to aBox<[T]>
,String
, or*mut T
from_raw_parts
doesn't exist- ThinVec currently doesn't bother to not-allocate for Zero Sized Types (e.g.
ThinVec<()>
), but it could be done if someone cared enough to implement it.
Methods
impl<T> ThinVec<T>
[src]
pub fn new() -> ThinVec<T>
[src]
pub fn with_capacity(cap: usize) -> ThinVec<T>
[src]
pub fn len(&self) -> usize
[src]
pub fn is_empty(&self) -> bool
[src]
pub fn capacity(&self) -> usize
[src]
pub unsafe fn set_len(&mut self, len: usize)
[src]
pub fn push(&mut self, val: T)
[src]
pub fn pop(&mut self) -> Option<T>
[src]
pub fn insert(&mut self, idx: usize, elem: T)
[src]
pub fn remove(&mut self, idx: usize) -> T
[src]
pub fn swap_remove(&mut self, idx: usize) -> T
[src]
pub fn truncate(&mut self, len: usize)
[src]
pub fn clear(&mut self)
[src]
pub fn as_slice(&self) -> &[T]
[src]
pub fn as_mut_slice(&mut self) -> &mut [T]
[src]
pub fn reserve(&mut self, additional: usize)
[src]
Reserve capacity for at least additional
more elements to be inserted.
May reserve more space than requested, to avoid frequent reallocations.
Panics if the new capacity overflows usize
.
Re-allocates only if self.capacity() < self.len() + additional
.
pub fn reserve_exact(&mut self, additional: usize)
[src]
Reserves the minimum capacity for additional
more elements to be inserted.
Panics if the new capacity overflows usize
.
Re-allocates only if self.capacity() < self.len() + additional
.
pub fn shrink_to_fit(&mut self)
[src]
pub fn retain<F>(&mut self, f: F) where
F: FnMut(&T) -> bool,
[src]
F: FnMut(&T) -> bool,
Retains only the elements specified by the predicate.
In other words, remove all elements e
such that f(&e)
returns false
.
This method operates in place and preserves the order of the retained
elements.
Examples
let mut vec = thin_vec![1, 2, 3, 4]; vec.retain(|&x| x%2 == 0); assert_eq!(vec, [2, 4]);
pub fn dedup_by_key<F, K>(&mut self, key: F) where
F: FnMut(&mut T) -> K,
K: PartialEq<K>,
[src]
F: FnMut(&mut T) -> K,
K: PartialEq<K>,
Removes consecutive elements in the vector that resolve to the same key.
If the vector is sorted, this removes all duplicates.
Examples
let mut vec = thin_vec![10, 20, 21, 30, 20]; vec.dedup_by_key(|i| *i / 10); assert_eq!(vec, [10, 20, 30, 20]);
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 consecutive elements in the vector according to a predicate.
The same_bucket
function is passed references to two elements from the vector, and
returns true
if the elements compare equal, or false
if they do not. Only the first
of adjacent equal items is kept.
If the vector is sorted, this removes all duplicates.
Examples
let mut vec = thin_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 split_off(&mut self, at: usize) -> ThinVec<T>
[src]
pub fn append(&mut self, other: &mut ThinVec<T>)
[src]
ⓘImportant traits for Drain<'a, T>pub fn drain<R>(&mut self, range: R) -> Drain<T> where
R: RangeArgument<usize>,
[src]
R: RangeArgument<usize>,
impl<T: Clone> ThinVec<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.
Examples
let mut vec = thin_vec!["hello"]; vec.resize(3, "world"); assert_eq!(vec, ["hello", "world", "world"]); let mut vec = thin_vec![1, 2, 3, 4]; vec.resize(2, 0); assert_eq!(vec, [1, 2]);
pub fn extend_from_slice(&mut self, other: &[T])
[src]
impl<T: PartialEq> ThinVec<T>
[src]
pub fn dedup(&mut self)
[src]
Removes consecutive repeated elements in the vector.
If the vector is sorted, this removes all duplicates.
Examples
let mut vec = thin_vec![1, 2, 2, 3, 2]; vec.dedup(); assert_eq!(vec, [1, 2, 3, 2]);
Methods from Deref<Target = [T]>
pub fn len(&self) -> usize
1.0.0[src]
pub fn is_empty(&self) -> bool
1.0.0[src]
pub fn first(&self) -> Option<&T>
1.0.0[src]
Returns the first element of the slice, or None
if it is empty.
Examples
let v = [10, 40, 30]; assert_eq!(Some(&10), v.first()); let w: &[i32] = &[]; assert_eq!(None, w.first());
pub fn first_mut(&mut self) -> Option<&mut T>
1.0.0[src]
Returns a mutable pointer to the first element of the slice, or None
if it is empty.
Examples
let x = &mut [0, 1, 2]; if let Some(first) = x.first_mut() { *first = 5; } assert_eq!(x, &[5, 1, 2]);
pub fn split_first(&self) -> Option<(&T, &[T])>
1.5.0[src]
Returns the first and all the rest of the elements of the slice, or None
if it is empty.
Examples
let x = &[0, 1, 2]; if let Some((first, elements)) = x.split_first() { assert_eq!(first, &0); assert_eq!(elements, &[1, 2]); }
pub fn split_first_mut(&mut self) -> Option<(&mut T, &mut [T])>
1.5.0[src]
Returns the first and all the rest of the elements of the slice, or None
if it is empty.
Examples
let x = &mut [0, 1, 2]; if let Some((first, elements)) = x.split_first_mut() { *first = 3; elements[0] = 4; elements[1] = 5; } assert_eq!(x, &[3, 4, 5]);
pub fn split_last(&self) -> Option<(&T, &[T])>
1.5.0[src]
Returns the last and all the rest of the elements of the slice, or None
if it is empty.
Examples
let x = &[0, 1, 2]; if let Some((last, elements)) = x.split_last() { assert_eq!(last, &2); assert_eq!(elements, &[0, 1]); }
pub fn split_last_mut(&mut self) -> Option<(&mut T, &mut [T])>
1.5.0[src]
Returns the last and all the rest of the elements of the slice, or None
if it is empty.
Examples
let x = &mut [0, 1, 2]; if let Some((last, elements)) = x.split_last_mut() { *last = 3; elements[0] = 4; elements[1] = 5; } assert_eq!(x, &[4, 5, 3]);
pub fn last(&self) -> Option<&T>
1.0.0[src]
Returns the last element of the slice, or None
if it is empty.
Examples
let v = [10, 40, 30]; assert_eq!(Some(&30), v.last()); let w: &[i32] = &[]; assert_eq!(None, w.last());
pub fn last_mut(&mut self) -> Option<&mut T>
1.0.0[src]
Returns a mutable pointer to the last item in the slice.
Examples
let x = &mut [0, 1, 2]; if let Some(last) = x.last_mut() { *last = 10; } assert_eq!(x, &[0, 1, 10]);
pub fn get<I>(&self, index: I) -> Option<&<I as SliceIndex<[T]>>::Output> where
I: SliceIndex<[T]>,
1.0.0[src]
I: SliceIndex<[T]>,
Returns a reference to an element or subslice depending on the type of index.
- If given a position, returns a reference to the element at that
position or
None
if out of bounds. - If given a range, returns the subslice corresponding to that range,
or
None
if out of bounds.
Examples
let v = [10, 40, 30]; assert_eq!(Some(&40), v.get(1)); assert_eq!(Some(&[10, 40][..]), v.get(0..2)); assert_eq!(None, v.get(3)); assert_eq!(None, v.get(0..4));
pub fn get_mut<I>(
&mut self,
index: I
) -> Option<&mut <I as SliceIndex<[T]>>::Output> where
I: SliceIndex<[T]>,
1.0.0[src]
&mut self,
index: I
) -> Option<&mut <I as SliceIndex<[T]>>::Output> where
I: SliceIndex<[T]>,
Returns a mutable reference to an element or subslice depending on the
type of index (see get
) or None
if the index is out of bounds.
Examples
let x = &mut [0, 1, 2]; if let Some(elem) = x.get_mut(1) { *elem = 42; } assert_eq!(x, &[0, 42, 2]);
pub unsafe fn get_unchecked<I>(
&self,
index: I
) -> &<I as SliceIndex<[T]>>::Output where
I: SliceIndex<[T]>,
1.0.0[src]
&self,
index: I
) -> &<I as SliceIndex<[T]>>::Output where
I: SliceIndex<[T]>,
Returns a reference to an element or subslice, without doing bounds checking.
This is generally not recommended, use with caution! For a safe
alternative see get
.
Examples
let x = &[1, 2, 4]; unsafe { assert_eq!(x.get_unchecked(1), &2); }
pub unsafe fn get_unchecked_mut<I>(
&mut self,
index: I
) -> &mut <I as SliceIndex<[T]>>::Output where
I: SliceIndex<[T]>,
1.0.0[src]
&mut self,
index: I
) -> &mut <I as SliceIndex<[T]>>::Output where
I: SliceIndex<[T]>,
Returns a mutable reference to an element or subslice, without doing bounds checking.
This is generally not recommended, use with caution! For a safe
alternative see get_mut
.
Examples
let x = &mut [1, 2, 4]; unsafe { let elem = x.get_unchecked_mut(1); *elem = 13; } assert_eq!(x, &[1, 13, 4]);
pub fn as_ptr(&self) -> *const T
1.0.0[src]
Returns a raw pointer to the slice's buffer.
The caller must ensure that the slice outlives the pointer this function returns, or else it will end up pointing to garbage.
Modifying the container referenced by this slice may cause its buffer to be reallocated, which would also make any pointers to it invalid.
Examples
let x = &[1, 2, 4]; let x_ptr = x.as_ptr(); unsafe { for i in 0..x.len() { assert_eq!(x.get_unchecked(i), &*x_ptr.offset(i as isize)); } }
pub fn as_mut_ptr(&mut self) -> *mut T
1.0.0[src]
Returns an unsafe mutable pointer to the slice's buffer.
The caller must ensure that the slice outlives the pointer this function returns, or else it will end up pointing to garbage.
Modifying the container referenced by this slice may cause its buffer to be reallocated, which would also make any pointers to it invalid.
Examples
let x = &mut [1, 2, 4]; let x_ptr = x.as_mut_ptr(); unsafe { for i in 0..x.len() { *x_ptr.offset(i as isize) += 2; } } assert_eq!(x, &[3, 4, 6]);
pub fn swap(&mut self, a: usize, b: usize)
1.0.0[src]
Swaps two elements in the slice.
Arguments
- a - The index of the first element
- b - The index of the second element
Panics
Panics if a
or b
are out of bounds.
Examples
let mut v = ["a", "b", "c", "d"]; v.swap(1, 3); assert!(v == ["a", "d", "c", "b"]);
pub fn reverse(&mut self)
1.0.0[src]
Reverses the order of elements in the slice, in place.
Examples
let mut v = [1, 2, 3]; v.reverse(); assert!(v == [3, 2, 1]);
pub fn iter(&self) -> Iter<T>
1.0.0[src]
Returns an iterator over the slice.
Examples
let x = &[1, 2, 4]; let mut iterator = x.iter(); assert_eq!(iterator.next(), Some(&1)); assert_eq!(iterator.next(), Some(&2)); assert_eq!(iterator.next(), Some(&4)); assert_eq!(iterator.next(), None);
pub fn iter_mut(&mut self) -> IterMut<T>
1.0.0[src]
Returns an iterator that allows modifying each value.
Examples
let x = &mut [1, 2, 4]; for elem in x.iter_mut() { *elem += 2; } assert_eq!(x, &[3, 4, 6]);
pub fn windows(&self, size: usize) -> Windows<T>
1.0.0[src]
Returns an iterator over all contiguous windows of length
size
. The windows overlap. If the slice is shorter than
size
, the iterator returns no values.
Panics
Panics if size
is 0.
Examples
let slice = ['r', 'u', 's', 't']; let mut iter = slice.windows(2); assert_eq!(iter.next().unwrap(), &['r', 'u']); assert_eq!(iter.next().unwrap(), &['u', 's']); assert_eq!(iter.next().unwrap(), &['s', 't']); assert!(iter.next().is_none());
If the slice is shorter than size
:
let slice = ['f', 'o', 'o']; let mut iter = slice.windows(4); assert!(iter.next().is_none());
pub fn chunks(&self, chunk_size: usize) -> Chunks<T>
1.0.0[src]
Returns an iterator over chunk_size
elements of the slice at a
time. The chunks are slices and do not overlap. If chunk_size
does
not divide the length of the slice, then the last chunk will
not have length chunk_size
.
See exact_chunks
for a variant of this iterator that returns chunks
of always exactly chunk_size
elements.
Panics
Panics if chunk_size
is 0.
Examples
let slice = ['l', 'o', 'r', 'e', 'm']; let mut iter = slice.chunks(2); assert_eq!(iter.next().unwrap(), &['l', 'o']); assert_eq!(iter.next().unwrap(), &['r', 'e']); assert_eq!(iter.next().unwrap(), &['m']); assert!(iter.next().is_none());
pub fn exact_chunks(&self, chunk_size: usize) -> ExactChunks<T>
[src]
exact_chunks
)Returns an iterator over chunk_size
elements of the slice at a
time. The chunks are slices and do not overlap. If chunk_size
does
not divide the length of the slice, then the last up to chunk_size-1
elements will be omitted.
Due to each chunk having exactly chunk_size
elements, the compiler
can often optimize the resulting code better than in the case of
chunks
.
Panics
Panics if chunk_size
is 0.
Examples
#![feature(exact_chunks)] let slice = ['l', 'o', 'r', 'e', 'm']; let mut iter = slice.exact_chunks(2); assert_eq!(iter.next().unwrap(), &['l', 'o']); assert_eq!(iter.next().unwrap(), &['r', 'e']); assert!(iter.next().is_none());
pub fn chunks_mut(&mut self, chunk_size: usize) -> ChunksMut<T>
1.0.0[src]
Returns an iterator over chunk_size
elements of the slice at a time.
The chunks are mutable slices, and do not overlap. If chunk_size
does
not divide the length of the slice, then the last chunk will not
have length chunk_size
.
See exact_chunks_mut
for a variant of this iterator that returns chunks
of always exactly chunk_size
elements.
Panics
Panics if chunk_size
is 0.
Examples
let v = &mut [0, 0, 0, 0, 0]; let mut count = 1; for chunk in v.chunks_mut(2) { for elem in chunk.iter_mut() { *elem += count; } count += 1; } assert_eq!(v, &[1, 1, 2, 2, 3]);
pub fn exact_chunks_mut(&mut self, chunk_size: usize) -> ExactChunksMut<T>
[src]
exact_chunks
)Returns an iterator over chunk_size
elements of the slice at a time.
The chunks are mutable slices, and do not overlap. If chunk_size
does
not divide the length of the slice, then the last up to chunk_size-1
elements will be omitted.
Due to each chunk having exactly chunk_size
elements, the compiler
can often optimize the resulting code better than in the case of
chunks_mut
.
Panics
Panics if chunk_size
is 0.
Examples
#![feature(exact_chunks)] let v = &mut [0, 0, 0, 0, 0]; let mut count = 1; for chunk in v.exact_chunks_mut(2) { for elem in chunk.iter_mut() { *elem += count; } count += 1; } assert_eq!(v, &[1, 1, 2, 2, 0]);
pub fn split_at(&self, mid: usize) -> (&[T], &[T])
1.0.0[src]
Divides one slice into two at an index.
The first will contain all indices from [0, mid)
(excluding
the index mid
itself) and the second will contain all
indices from [mid, len)
(excluding the index len
itself).
Panics
Panics if mid > len
.
Examples
let v = [1, 2, 3, 4, 5, 6]; { let (left, right) = v.split_at(0); assert!(left == []); assert!(right == [1, 2, 3, 4, 5, 6]); } { let (left, right) = v.split_at(2); assert!(left == [1, 2]); assert!(right == [3, 4, 5, 6]); } { let (left, right) = v.split_at(6); assert!(left == [1, 2, 3, 4, 5, 6]); assert!(right == []); }
pub fn split_at_mut(&mut self, mid: usize) -> (&mut [T], &mut [T])
1.0.0[src]
Divides one mutable slice into two at an index.
The first will contain all indices from [0, mid)
(excluding
the index mid
itself) and the second will contain all
indices from [mid, len)
(excluding the index len
itself).
Panics
Panics if mid > len
.
Examples
let mut v = [1, 0, 3, 0, 5, 6]; // scoped to restrict the lifetime of the borrows { let (left, right) = v.split_at_mut(2); assert!(left == [1, 0]); assert!(right == [3, 0, 5, 6]); left[1] = 2; right[1] = 4; } assert!(v == [1, 2, 3, 4, 5, 6]);
pub fn split<F>(&self, pred: F) -> Split<T, F> where
F: FnMut(&T) -> bool,
1.0.0[src]
F: FnMut(&T) -> bool,
Returns an iterator over subslices separated by elements that match
pred
. The matched element is not contained in the subslices.
Examples
let slice = [10, 40, 33, 20]; let mut iter = slice.split(|num| num % 3 == 0); assert_eq!(iter.next().unwrap(), &[10, 40]); assert_eq!(iter.next().unwrap(), &[20]); assert!(iter.next().is_none());
If the first element is matched, an empty slice will be the first item returned by the iterator. Similarly, if the last element in the slice is matched, an empty slice will be the last item returned by the iterator:
let slice = [10, 40, 33]; let mut iter = slice.split(|num| num % 3 == 0); assert_eq!(iter.next().unwrap(), &[10, 40]); assert_eq!(iter.next().unwrap(), &[]); assert!(iter.next().is_none());
If two matched elements are directly adjacent, an empty slice will be present between them:
let slice = [10, 6, 33, 20]; let mut iter = slice.split(|num| num % 3 == 0); assert_eq!(iter.next().unwrap(), &[10]); assert_eq!(iter.next().unwrap(), &[]); assert_eq!(iter.next().unwrap(), &[20]); assert!(iter.next().is_none());
pub fn split_mut<F>(&mut self, pred: F) -> SplitMut<T, F> where
F: FnMut(&T) -> bool,
1.0.0[src]
F: FnMut(&T) -> bool,
Returns an iterator over mutable subslices separated by elements that
match pred
. The matched element is not contained in the subslices.
Examples
let mut v = [10, 40, 30, 20, 60, 50]; for group in v.split_mut(|num| *num % 3 == 0) { group[0] = 1; } assert_eq!(v, [1, 40, 30, 1, 60, 1]);
pub fn rsplit<F>(&self, pred: F) -> RSplit<T, F> where
F: FnMut(&T) -> bool,
[src]
F: FnMut(&T) -> bool,
slice_rsplit
)Returns an iterator over subslices separated by elements that match
pred
, starting at the end of the slice and working backwards.
The matched element is not contained in the subslices.
Examples
#![feature(slice_rsplit)] let slice = [11, 22, 33, 0, 44, 55]; let mut iter = slice.rsplit(|num| *num == 0); assert_eq!(iter.next().unwrap(), &[44, 55]); assert_eq!(iter.next().unwrap(), &[11, 22, 33]); assert_eq!(iter.next(), None);
As with split()
, if the first or last element is matched, an empty
slice will be the first (or last) item returned by the iterator.
#![feature(slice_rsplit)] let v = &[0, 1, 1, 2, 3, 5, 8]; let mut it = v.rsplit(|n| *n % 2 == 0); assert_eq!(it.next().unwrap(), &[]); assert_eq!(it.next().unwrap(), &[3, 5]); assert_eq!(it.next().unwrap(), &[1, 1]); assert_eq!(it.next().unwrap(), &[]); assert_eq!(it.next(), None);
pub fn rsplit_mut<F>(&mut self, pred: F) -> RSplitMut<T, F> where
F: FnMut(&T) -> bool,
[src]
F: FnMut(&T) -> bool,
slice_rsplit
)Returns an iterator over mutable subslices separated by elements that
match pred
, starting at the end of the slice and working
backwards. The matched element is not contained in the subslices.
Examples
#![feature(slice_rsplit)] let mut v = [100, 400, 300, 200, 600, 500]; let mut count = 0; for group in v.rsplit_mut(|num| *num % 3 == 0) { count += 1; group[0] = count; } assert_eq!(v, [3, 400, 300, 2, 600, 1]);
pub fn splitn<F>(&self, n: usize, pred: F) -> SplitN<T, F> where
F: FnMut(&T) -> bool,
1.0.0[src]
F: FnMut(&T) -> bool,
Returns an iterator over subslices separated by elements that match
pred
, limited to returning at most n
items. The matched element is
not contained in the subslices.
The last element returned, if any, will contain the remainder of the slice.
Examples
Print the slice split once by numbers divisible by 3 (i.e. [10, 40]
,
[20, 60, 50]
):
let v = [10, 40, 30, 20, 60, 50]; for group in v.splitn(2, |num| *num % 3 == 0) { println!("{:?}", group); }
pub fn splitn_mut<F>(&mut self, n: usize, pred: F) -> SplitNMut<T, F> where
F: FnMut(&T) -> bool,
1.0.0[src]
F: FnMut(&T) -> bool,
Returns an iterator over subslices separated by elements that match
pred
, limited to returning at most n
items. The matched element is
not contained in the subslices.
The last element returned, if any, will contain the remainder of the slice.
Examples
let mut v = [10, 40, 30, 20, 60, 50]; for group in v.splitn_mut(2, |num| *num % 3 == 0) { group[0] = 1; } assert_eq!(v, [1, 40, 30, 1, 60, 50]);
pub fn rsplitn<F>(&self, n: usize, pred: F) -> RSplitN<T, F> where
F: FnMut(&T) -> bool,
1.0.0[src]
F: FnMut(&T) -> bool,
Returns an iterator over subslices separated by elements that match
pred
limited to returning at most n
items. This starts at the end of
the slice and works backwards. The matched element is not contained in
the subslices.
The last element returned, if any, will contain the remainder of the slice.
Examples
Print the slice split once, starting from the end, by numbers divisible
by 3 (i.e. [50]
, [10, 40, 30, 20]
):
let v = [10, 40, 30, 20, 60, 50]; for group in v.rsplitn(2, |num| *num % 3 == 0) { println!("{:?}", group); }
pub fn rsplitn_mut<F>(&mut self, n: usize, pred: F) -> RSplitNMut<T, F> where
F: FnMut(&T) -> bool,
1.0.0[src]
F: FnMut(&T) -> bool,
Returns an iterator over subslices separated by elements that match
pred
limited to returning at most n
items. This starts at the end of
the slice and works backwards. The matched element is not contained in
the subslices.
The last element returned, if any, will contain the remainder of the slice.
Examples
let mut s = [10, 40, 30, 20, 60, 50]; for group in s.rsplitn_mut(2, |num| *num % 3 == 0) { group[0] = 1; } assert_eq!(s, [1, 40, 30, 20, 60, 1]);
pub fn contains(&self, x: &T) -> bool where
T: PartialEq<T>,
1.0.0[src]
T: PartialEq<T>,
Returns true
if the slice contains an element with the given value.
Examples
let v = [10, 40, 30]; assert!(v.contains(&30)); assert!(!v.contains(&50));
pub fn starts_with(&self, needle: &[T]) -> bool where
T: PartialEq<T>,
1.0.0[src]
T: PartialEq<T>,
Returns true
if needle
is a prefix of the slice.
Examples
let v = [10, 40, 30]; assert!(v.starts_with(&[10])); assert!(v.starts_with(&[10, 40])); assert!(!v.starts_with(&[50])); assert!(!v.starts_with(&[10, 50]));
Always returns true
if needle
is an empty slice:
let v = &[10, 40, 30]; assert!(v.starts_with(&[])); let v: &[u8] = &[]; assert!(v.starts_with(&[]));
pub fn ends_with(&self, needle: &[T]) -> bool where
T: PartialEq<T>,
1.0.0[src]
T: PartialEq<T>,
Returns true
if needle
is a suffix of the slice.
Examples
let v = [10, 40, 30]; assert!(v.ends_with(&[30])); assert!(v.ends_with(&[40, 30])); assert!(!v.ends_with(&[50])); assert!(!v.ends_with(&[50, 30]));
Always returns true
if needle
is an empty slice:
let v = &[10, 40, 30]; assert!(v.ends_with(&[])); let v: &[u8] = &[]; assert!(v.ends_with(&[]));
pub fn binary_search(&self, x: &T) -> Result<usize, usize> where
T: Ord,
1.0.0[src]
T: Ord,
Binary searches this sorted slice for a given element.
If the value is found then Ok
is returned, containing the
index of the matching element; if the value is not found then
Err
is returned, containing the index where a matching
element could be inserted while maintaining sorted order.
Examples
Looks up a series of four elements. The first is found, with a
uniquely determined position; the second and third are not
found; the fourth could match any position in [1, 4]
.
let s = [0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55]; assert_eq!(s.binary_search(&13), Ok(9)); assert_eq!(s.binary_search(&4), Err(7)); assert_eq!(s.binary_search(&100), Err(13)); let r = s.binary_search(&1); assert!(match r { Ok(1...4) => true, _ => false, });
pub fn binary_search_by<'a, F>(&'a self, f: F) -> Result<usize, usize> where
F: FnMut(&'a T) -> Ordering,
1.0.0[src]
F: FnMut(&'a T) -> Ordering,
Binary searches this sorted slice with a comparator function.
The comparator function should implement an order consistent
with the sort order of the underlying slice, returning an
order code that indicates whether its argument is Less
,
Equal
or Greater
the desired target.
If a matching value is found then returns Ok
, containing
the index for the matched element; if no match is found then
Err
is returned, containing the index where a matching
element could be inserted while maintaining sorted order.
Examples
Looks up a series of four elements. The first is found, with a
uniquely determined position; the second and third are not
found; the fourth could match any position in [1, 4]
.
let s = [0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55]; let seek = 13; assert_eq!(s.binary_search_by(|probe| probe.cmp(&seek)), Ok(9)); let seek = 4; assert_eq!(s.binary_search_by(|probe| probe.cmp(&seek)), Err(7)); let seek = 100; assert_eq!(s.binary_search_by(|probe| probe.cmp(&seek)), Err(13)); let seek = 1; let r = s.binary_search_by(|probe| probe.cmp(&seek)); assert!(match r { Ok(1...4) => true, _ => false, });
pub fn binary_search_by_key<'a, B, F>(
&'a self,
b: &B,
f: F
) -> Result<usize, usize> where
B: Ord,
F: FnMut(&'a T) -> B,
1.10.0[src]
&'a self,
b: &B,
f: F
) -> Result<usize, usize> where
B: Ord,
F: FnMut(&'a T) -> B,
Binary searches this sorted slice with a key extraction function.
Assumes that the slice is sorted by the key, for instance with
sort_by_key
using the same key extraction function.
If a matching value is found then returns Ok
, containing the
index for the matched element; if no match is found then Err
is returned, containing the index where a matching element could
be inserted while maintaining sorted order.
Examples
Looks up a series of four elements in a slice of pairs sorted by
their second elements. The first is found, with a uniquely
determined position; the second and third are not found; the
fourth could match any position in [1, 4]
.
let s = [(0, 0), (2, 1), (4, 1), (5, 1), (3, 1), (1, 2), (2, 3), (4, 5), (5, 8), (3, 13), (1, 21), (2, 34), (4, 55)]; assert_eq!(s.binary_search_by_key(&13, |&(a,b)| b), Ok(9)); assert_eq!(s.binary_search_by_key(&4, |&(a,b)| b), Err(7)); assert_eq!(s.binary_search_by_key(&100, |&(a,b)| b), Err(13)); let r = s.binary_search_by_key(&1, |&(a,b)| b); assert!(match r { Ok(1...4) => true, _ => false, });
pub fn sort(&mut self) where
T: Ord,
1.0.0[src]
T: Ord,
Sorts the slice.
This sort is stable (i.e. does not reorder equal elements) and O(n log n)
worst-case.
When applicable, unstable sorting is preferred because it is generally faster than stable
sorting and it doesn't allocate auxiliary memory.
See sort_unstable
.
Current implementation
The current algorithm is an adaptive, iterative merge sort inspired by timsort. It is designed to be very fast in cases where the slice is nearly sorted, or consists of two or more sorted sequences concatenated one after another.
Also, it allocates temporary storage half the size of self
, but for short slices a
non-allocating insertion sort is used instead.
Examples
let mut v = [-5, 4, 1, -3, 2]; v.sort(); assert!(v == [-5, -3, 1, 2, 4]);
pub fn sort_by<F>(&mut self, compare: F) where
F: FnMut(&T, &T) -> Ordering,
1.0.0[src]
F: FnMut(&T, &T) -> Ordering,
Sorts the slice with a comparator function.
This sort is stable (i.e. does not reorder equal elements) and O(n log n)
worst-case.
When applicable, unstable sorting is preferred because it is generally faster than stable
sorting and it doesn't allocate auxiliary memory.
See sort_unstable_by
.
Current implementation
The current algorithm is an adaptive, iterative merge sort inspired by timsort. It is designed to be very fast in cases where the slice is nearly sorted, or consists of two or more sorted sequences concatenated one after another.
Also, it allocates temporary storage half the size of self
, but for short slices a
non-allocating insertion sort is used instead.
Examples
let mut v = [5, 4, 1, 3, 2]; v.sort_by(|a, b| a.cmp(b)); assert!(v == [1, 2, 3, 4, 5]); // reverse sorting v.sort_by(|a, b| b.cmp(a)); assert!(v == [5, 4, 3, 2, 1]);
pub fn sort_by_key<B, F>(&mut self, f: F) where
B: Ord,
F: FnMut(&T) -> B,
1.7.0[src]
B: Ord,
F: FnMut(&T) -> B,
Sorts the slice with a key extraction function.
This sort is stable (i.e. does not reorder equal elements) and O(n log n)
worst-case.
When applicable, unstable sorting is preferred because it is generally faster than stable
sorting and it doesn't allocate auxiliary memory.
See sort_unstable_by_key
.
Current implementation
The current algorithm is an adaptive, iterative merge sort inspired by timsort. It is designed to be very fast in cases where the slice is nearly sorted, or consists of two or more sorted sequences concatenated one after another.
Also, it allocates temporary storage half the size of self
, but for short slices a
non-allocating insertion sort is used instead.
Examples
let mut v = [-5i32, 4, 1, -3, 2]; v.sort_by_key(|k| k.abs()); assert!(v == [1, 2, -3, 4, -5]);
pub fn sort_unstable(&mut self) where
T: Ord,
1.20.0[src]
T: Ord,
Sorts the slice, but may not preserve the order of equal elements.
This sort is unstable (i.e. may reorder equal elements), in-place (i.e. does not allocate),
and O(n log n)
worst-case.
Current implementation
The current algorithm is based on pattern-defeating quicksort by Orson Peters, which combines the fast average case of randomized quicksort with the fast worst case of heapsort, while achieving linear time on slices with certain patterns. It uses some randomization to avoid degenerate cases, but with a fixed seed to always provide deterministic behavior.
It is typically faster than stable sorting, except in a few special cases, e.g. when the slice consists of several concatenated sorted sequences.
Examples
let mut v = [-5, 4, 1, -3, 2]; v.sort_unstable(); assert!(v == [-5, -3, 1, 2, 4]);
pub fn sort_unstable_by<F>(&mut self, compare: F) where
F: FnMut(&T, &T) -> Ordering,
1.20.0[src]
F: FnMut(&T, &T) -> Ordering,
Sorts the slice with a comparator function, but may not preserve the order of equal elements.
This sort is unstable (i.e. may reorder equal elements), in-place (i.e. does not allocate),
and O(n log n)
worst-case.
Current implementation
The current algorithm is based on pattern-defeating quicksort by Orson Peters, which combines the fast average case of randomized quicksort with the fast worst case of heapsort, while achieving linear time on slices with certain patterns. It uses some randomization to avoid degenerate cases, but with a fixed seed to always provide deterministic behavior.
It is typically faster than stable sorting, except in a few special cases, e.g. when the slice consists of several concatenated sorted sequences.
Examples
let mut v = [5, 4, 1, 3, 2]; v.sort_unstable_by(|a, b| a.cmp(b)); assert!(v == [1, 2, 3, 4, 5]); // reverse sorting v.sort_unstable_by(|a, b| b.cmp(a)); assert!(v == [5, 4, 3, 2, 1]);
pub fn sort_unstable_by_key<B, F>(&mut self, f: F) where
B: Ord,
F: FnMut(&T) -> B,
1.20.0[src]
B: Ord,
F: FnMut(&T) -> B,
Sorts the slice with a key extraction function, but may not preserve the order of equal elements.
This sort is unstable (i.e. may reorder equal elements), in-place (i.e. does not allocate),
and O(n log n)
worst-case.
Current implementation
The current algorithm is based on pattern-defeating quicksort by Orson Peters, which combines the fast average case of randomized quicksort with the fast worst case of heapsort, while achieving linear time on slices with certain patterns. It uses some randomization to avoid degenerate cases, but with a fixed seed to always provide deterministic behavior.
It is typically faster than stable sorting, except in a few special cases, e.g. when the slice consists of several concatenated sorted sequences.
Examples
let mut v = [-5i32, 4, 1, -3, 2]; v.sort_unstable_by_key(|k| k.abs()); assert!(v == [1, 2, -3, 4, -5]);
pub fn rotate_left(&mut self, mid: usize)
1.26.0[src]
Rotates the slice in-place such that the first mid
elements of the
slice move to the end while the last self.len() - mid
elements move to
the front. After calling rotate_left
, the element previously at index
mid
will become the first element in the slice.
Panics
This function will panic if mid
is greater than the length of the
slice. Note that mid == self.len()
does not panic and is a no-op
rotation.
Complexity
Takes linear (in self.len()
) time.
Examples
let mut a = ['a', 'b', 'c', 'd', 'e', 'f']; a.rotate_left(2); assert_eq!(a, ['c', 'd', 'e', 'f', 'a', 'b']);
Rotating a subslice:
let mut a = ['a', 'b', 'c', 'd', 'e', 'f']; a[1..5].rotate_left(1); assert_eq!(a, ['a', 'c', 'd', 'e', 'b', 'f']);
pub fn rotate_right(&mut self, k: usize)
1.26.0[src]
Rotates the slice in-place such that the first self.len() - k
elements of the slice move to the end while the last k
elements move
to the front. After calling rotate_right
, the element previously at
index self.len() - k
will become the first element in the slice.
Panics
This function will panic if k
is greater than the length of the
slice. Note that k == self.len()
does not panic and is a no-op
rotation.
Complexity
Takes linear (in self.len()
) time.
Examples
let mut a = ['a', 'b', 'c', 'd', 'e', 'f']; a.rotate_right(2); assert_eq!(a, ['e', 'f', 'a', 'b', 'c', 'd']);
Rotate a subslice:
let mut a = ['a', 'b', 'c', 'd', 'e', 'f']; a[1..5].rotate_right(1); assert_eq!(a, ['a', 'e', 'b', 'c', 'd', 'f']);
pub fn clone_from_slice(&mut self, src: &[T]) where
T: Clone,
1.7.0[src]
T: Clone,
Copies the elements from src
into self
.
The length of src
must be the same as self
.
If src
implements Copy
, it can be more performant to use
copy_from_slice
.
Panics
This function will panic if the two slices have different lengths.
Examples
Cloning two elements from a slice into another:
let src = [1, 2, 3, 4]; let mut dst = [0, 0]; dst.clone_from_slice(&src[2..]); assert_eq!(src, [1, 2, 3, 4]); assert_eq!(dst, [3, 4]);
Rust enforces that there can only be one mutable reference with no
immutable references to a particular piece of data in a particular
scope. Because of this, attempting to use clone_from_slice
on a
single slice will result in a compile failure:
let mut slice = [1, 2, 3, 4, 5]; slice[..2].clone_from_slice(&slice[3..]); // compile fail!
To work around this, we can use split_at_mut
to create two distinct
sub-slices from a slice:
let mut slice = [1, 2, 3, 4, 5]; { let (left, right) = slice.split_at_mut(2); left.clone_from_slice(&right[1..]); } assert_eq!(slice, [4, 5, 3, 4, 5]);
pub fn copy_from_slice(&mut self, src: &[T]) where
T: Copy,
1.9.0[src]
T: Copy,
Copies all elements from src
into self
, using a memcpy.
The length of src
must be the same as self
.
If src
does not implement Copy
, use clone_from_slice
.
Panics
This function will panic if the two slices have different lengths.
Examples
Copying two elements from a slice into another:
let src = [1, 2, 3, 4]; let mut dst = [0, 0]; dst.copy_from_slice(&src[2..]); assert_eq!(src, [1, 2, 3, 4]); assert_eq!(dst, [3, 4]);
Rust enforces that there can only be one mutable reference with no
immutable references to a particular piece of data in a particular
scope. Because of this, attempting to use copy_from_slice
on a
single slice will result in a compile failure:
let mut slice = [1, 2, 3, 4, 5]; slice[..2].copy_from_slice(&slice[3..]); // compile fail!
To work around this, we can use split_at_mut
to create two distinct
sub-slices from a slice:
let mut slice = [1, 2, 3, 4, 5]; { let (left, right) = slice.split_at_mut(2); left.copy_from_slice(&right[1..]); } assert_eq!(slice, [4, 5, 3, 4, 5]);
pub fn swap_with_slice(&mut self, other: &mut [T])
[src]
swap_with_slice
)Swaps all elements in self
with those in other
.
The length of other
must be the same as self
.
Panics
This function will panic if the two slices have different lengths.
Example
Swapping two elements across slices:
#![feature(swap_with_slice)] let mut slice1 = [0, 0]; let mut slice2 = [1, 2, 3, 4]; slice1.swap_with_slice(&mut slice2[2..]); assert_eq!(slice1, [3, 4]); assert_eq!(slice2, [1, 2, 0, 0]);
Rust enforces that there can only be one mutable reference to a
particular piece of data in a particular scope. Because of this,
attempting to use swap_with_slice
on a single slice will result in
a compile failure:
#![feature(swap_with_slice)] let mut slice = [1, 2, 3, 4, 5]; slice[..2].swap_with_slice(&mut slice[3..]); // compile fail!
To work around this, we can use split_at_mut
to create two distinct
mutable sub-slices from a slice:
#![feature(swap_with_slice)] let mut slice = [1, 2, 3, 4, 5]; { let (left, right) = slice.split_at_mut(2); left.swap_with_slice(&mut right[1..]); } assert_eq!(slice, [4, 5, 3, 1, 2]);
pub fn to_vec(&self) -> Vec<T> where
T: Clone,
1.0.0[src]
T: Clone,
Copies self
into a new Vec
.
Examples
let s = [10, 40, 30]; let x = s.to_vec(); // Here, `s` and `x` can be modified independently.
Trait Implementations
impl<T> Drop for ThinVec<T>
[src]
impl<T> Deref for ThinVec<T>
[src]
type Target = [T]
The resulting type after dereferencing.
fn deref(&self) -> &[T]
[src]
Dereferences the value.
impl<T> DerefMut for ThinVec<T>
[src]
impl<T> Borrow<[T]> for ThinVec<T>
[src]
impl<T> BorrowMut<[T]> for ThinVec<T>
[src]
fn borrow_mut(&mut self) -> &mut [T]
[src]
Mutably borrows from an owned value. Read more
impl<T> AsRef<[T]> for ThinVec<T>
[src]
impl<T> Extend<T> for ThinVec<T>
[src]
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = T>,
[src]
I: IntoIterator<Item = T>,
Extends a collection with the contents of an iterator. Read more
impl<T: Debug> Debug for ThinVec<T>
[src]
fn fmt(&self, f: &mut Formatter) -> Result
[src]
Formats the value using the given formatter. Read more
impl<T> Hash for ThinVec<T> where
T: Hash,
[src]
T: Hash,
fn hash<H>(&self, state: &mut H) where
H: Hasher,
[src]
H: Hasher,
Feeds this value into the given [Hasher
]. Read more
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
Feeds a slice of this type into the given [Hasher
]. Read more
impl<T> PartialOrd for ThinVec<T> where
T: PartialOrd,
[src]
T: PartialOrd,
fn partial_cmp(&self, other: &ThinVec<T>) -> Option<Ordering>
[src]
This method returns an ordering between self
and other
values if one exists. Read more
fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests less than (for self
and other
) and is used by the <
operator. Read more
fn le(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
fn gt(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests greater than (for self
and other
) and is used by the >
operator. Read more
fn ge(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests greater than or equal to (for self
and other
) and is used by the >=
operator. Read more
impl<T> Ord for ThinVec<T> where
T: Ord,
[src]
T: Ord,
fn cmp(&self, other: &ThinVec<T>) -> Ordering
[src]
This method returns an Ordering
between self
and other
. Read more
fn max(self, other: Self) -> Self
1.21.0[src]
Compares and returns the maximum of two values. Read more
fn min(self, other: Self) -> Self
1.21.0[src]
Compares and returns the minimum of two values. Read more
impl<A, B> PartialEq<ThinVec<B>> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &ThinVec<B>) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &ThinVec<B>) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<Vec<B>> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &Vec<B>) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &Vec<B>) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 0]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 0]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 0]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 0]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 0]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 0]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 1]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 1]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 1]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 1]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 1]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 1]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 2]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 2]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 2]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 2]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 2]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 2]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 3]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 3]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 3]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 3]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 3]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 3]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 4]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 4]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 4]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 4]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 4]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 4]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 5]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 5]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 5]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 5]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 5]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 5]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 6]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 6]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 6]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 6]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 6]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 6]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 7]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 7]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 7]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 7]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 7]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 7]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 8]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 8]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 8]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 8]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 8]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 8]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 9]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 9]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 9]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 9]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 9]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 9]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 10]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 10]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 10]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 10]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 10]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 10]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 11]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 11]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 11]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 11]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 11]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 11]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 12]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 12]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 12]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 12]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 12]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 12]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 13]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 13]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 13]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 13]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 13]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 13]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 14]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 14]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 14]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 14]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 14]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 14]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 15]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 15]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 15]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 15]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 15]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 15]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 16]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 16]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 16]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 16]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 16]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 16]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 17]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 17]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 17]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 17]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 17]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 17]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 18]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 18]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 18]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 18]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 18]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 18]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 19]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 19]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 19]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 19]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 19]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 19]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 20]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 20]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 20]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 20]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 20]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 20]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 21]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 21]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 21]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 21]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 21]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 21]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 22]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 22]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 22]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 22]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 22]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 22]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 23]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 23]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 23]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 23]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 23]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 23]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 24]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 24]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 24]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 24]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 24]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 24]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 25]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 25]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 25]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 25]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 25]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 25]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 26]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 26]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 26]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 26]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 26]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 26]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 27]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 27]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 27]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 27]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 27]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 27]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 28]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 28]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 28]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 28]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 28]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 28]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 29]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 29]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 29]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 29]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 29]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 29]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 30]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 30]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 30]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 30]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 30]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 30]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 31]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 31]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 31]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 31]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 31]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 31]) -> bool
[src]
This method tests for !=
.
impl<A, B> PartialEq<[B; 32]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &[B; 32]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B; 32]) -> bool
[src]
This method tests for !=
.
impl<'a, A, B> PartialEq<&'a [B; 32]> for ThinVec<A> where
A: PartialEq<B>,
[src]
A: PartialEq<B>,
fn eq(&self, other: &&'a [B; 32]) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &&'a [B; 32]) -> bool
[src]
This method tests for !=
.
impl<T> Eq for ThinVec<T> where
T: Eq,
[src]
T: Eq,
impl<T> IntoIterator for ThinVec<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?
ⓘImportant traits for IntoIter<T>fn into_iter(self) -> IntoIter<T>
[src]
Creates an iterator from a value. Read more
impl<'a, T> IntoIterator for &'a ThinVec<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]
Creates an iterator from a value. Read more
impl<'a, T> IntoIterator for &'a mut ThinVec<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]
Creates an iterator from a value. Read more
impl<T> Clone for ThinVec<T> where
T: Clone,
[src]
T: Clone,
fn clone(&self) -> ThinVec<T>
[src]
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl<T> Default for ThinVec<T>
[src]
impl<T> FromIterator<T> for ThinVec<T>
[src]
fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> ThinVec<T>
[src]
Creates a value from an iterator. Read more
impl Write for ThinVec<u8>
[src]
Write is implemented for ThinVec<u8>
by appending to the vector.
The vector will grow as needed.
This implementation is identical to the one for Vec<u8>
.
fn write(&mut self, buf: &[u8]) -> Result<usize>
[src]
Write a buffer into this object, returning how many bytes were written. Read more
fn write_all(&mut self, buf: &[u8]) -> Result<()>
[src]
Attempts to write an entire buffer into this write. Read more
fn flush(&mut self) -> Result<()>
[src]
Flush this output stream, ensuring that all intermediately buffered contents reach their destination. Read more
fn write_fmt(&mut self, fmt: Arguments) -> Result<(), Error>
1.0.0[src]
Writes a formatted string into this writer, returning any error encountered. Read more
fn by_ref(&mut self) -> &mut Self
1.0.0[src]
Creates a "by reference" adaptor for this instance of Write
. Read more