Primitive Type slice [−]
A dynamically-sized view into a contiguous sequence, [T]
.
Slices are a view into a block of memory represented as a pointer and a length.
fn main() { // slicing a Vec let vec = vec![1, 2, 3]; let int_slice = &vec[..]; // coercing an array to a slice let str_slice: &[&str] = &["one", "two", "three"]; }// slicing a Vec let vec = vec![1, 2, 3]; let int_slice = &vec[..]; // coercing an array to a slice let str_slice: &[&str] = &["one", "two", "three"];
Slices are either mutable or shared. The shared slice type is &[T]
,
while the mutable slice type is &mut [T]
, where T
represents the element
type. For example, you can mutate the block of memory that a mutable slice
points to:
let x = &mut [1, 2, 3]; x[1] = 7; assert_eq!(x, &[1, 7, 3]);
Methods
impl<T> [T]
fn len(&self) -> usize
1.0.0
Returns the number of elements in the slice.
Example
fn main() { let a = [1, 2, 3]; assert_eq!(a.len(), 3); }let a = [1, 2, 3]; assert_eq!(a.len(), 3);
fn is_empty(&self) -> bool
1.0.0
Returns true if the slice has a length of 0
Example
fn main() { let a = [1, 2, 3]; assert!(!a.is_empty()); }let a = [1, 2, 3]; assert!(!a.is_empty());
fn first(&self) -> Option<&T>
1.0.0
Returns the first element of a slice, or None
if it is empty.
Examples
fn main() { let v = [10, 40, 30]; assert_eq!(Some(&10), v.first()); let w: &[i32] = &[]; assert_eq!(None, w.first()); }let v = [10, 40, 30]; assert_eq!(Some(&10), v.first()); let w: &[i32] = &[]; assert_eq!(None, w.first());
fn first_mut(&mut self) -> Option<&mut T>
1.0.0
Returns a mutable pointer to the first element of a slice, or None
if it is empty.
Examples
fn main() { let x = &mut [0, 1, 2]; if let Some(first) = x.first_mut() { *first = 5; } assert_eq!(x, &[5, 1, 2]); }let x = &mut [0, 1, 2]; if let Some(first) = x.first_mut() { *first = 5; } assert_eq!(x, &[5, 1, 2]);
fn split_first(&self) -> Option<(&T, &[T])>
1.5.0
Returns the first and all the rest of the elements of a slice.
Examples
fn main() { let x = &[0, 1, 2]; if let Some((first, elements)) = x.split_first() { assert_eq!(first, &0); assert_eq!(elements, &[1, 2]); } }let x = &[0, 1, 2]; if let Some((first, elements)) = x.split_first() { assert_eq!(first, &0); assert_eq!(elements, &[1, 2]); }
fn split_first_mut(&mut self) -> Option<(&mut T, &mut [T])>
1.5.0
Returns the first and all the rest of the elements of a slice.
Examples
fn main() { 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]); }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]);
fn split_last(&self) -> Option<(&T, &[T])>
1.5.0
Returns the last and all the rest of the elements of a slice.
Examples
fn main() { let x = &[0, 1, 2]; if let Some((last, elements)) = x.split_last() { assert_eq!(last, &2); assert_eq!(elements, &[0, 1]); } }let x = &[0, 1, 2]; if let Some((last, elements)) = x.split_last() { assert_eq!(last, &2); assert_eq!(elements, &[0, 1]); }
fn split_last_mut(&mut self) -> Option<(&mut T, &mut [T])>
1.5.0
Returns the last and all the rest of the elements of a slice.
Examples
fn main() { 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]); }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]);
fn last(&self) -> Option<&T>
1.0.0
Returns the last element of a slice, or None
if it is empty.
Examples
fn main() { let v = [10, 40, 30]; assert_eq!(Some(&30), v.last()); let w: &[i32] = &[]; assert_eq!(None, w.last()); }let v = [10, 40, 30]; assert_eq!(Some(&30), v.last()); let w: &[i32] = &[]; assert_eq!(None, w.last());
fn last_mut(&mut self) -> Option<&mut T>
1.0.0
Returns a mutable pointer to the last item in the slice.
Examples
fn main() { let x = &mut [0, 1, 2]; if let Some(last) = x.last_mut() { *last = 10; } assert_eq!(x, &[0, 1, 10]); }let x = &mut [0, 1, 2]; if let Some(last) = x.last_mut() { *last = 10; } assert_eq!(x, &[0, 1, 10]);
fn get(&self, index: usize) -> Option<&T>
1.0.0
Returns the element of a slice at the given index, or None
if the
index is out of bounds.
Examples
fn main() { let v = [10, 40, 30]; assert_eq!(Some(&40), v.get(1)); assert_eq!(None, v.get(3)); }let v = [10, 40, 30]; assert_eq!(Some(&40), v.get(1)); assert_eq!(None, v.get(3));
fn get_mut(&mut self, index: usize) -> Option<&mut T>
1.0.0
Returns a mutable reference to the element at the given index.
Examples
fn main() { let x = &mut [0, 1, 2]; if let Some(elem) = x.get_mut(1) { *elem = 42; } assert_eq!(x, &[0, 42, 2]); }let x = &mut [0, 1, 2]; if let Some(elem) = x.get_mut(1) { *elem = 42; } assert_eq!(x, &[0, 42, 2]);
or None
if the index is out of bounds
unsafe fn get_unchecked(&self, index: usize) -> &T
1.0.0
Returns a pointer to the element at the given index, without doing bounds checking. So use it very carefully!
Examples
fn main() { let x = &[1, 2, 4]; unsafe { assert_eq!(x.get_unchecked(1), &2); } }let x = &[1, 2, 4]; unsafe { assert_eq!(x.get_unchecked(1), &2); }
unsafe fn get_unchecked_mut(&mut self, index: usize) -> &mut T
1.0.0
Returns an unsafe mutable pointer to the element in index. So use it very carefully!
Examples
fn main() { let x = &mut [1, 2, 4]; unsafe { let elem = x.get_unchecked_mut(1); *elem = 13; } assert_eq!(x, &[1, 13, 4]); }let x = &mut [1, 2, 4]; unsafe { let elem = x.get_unchecked_mut(1); *elem = 13; } assert_eq!(x, &[1, 13, 4]);
fn as_ptr(&self) -> *const T
1.0.0
Returns an 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 slice may cause its buffer to be reallocated, which would also make any pointers to it invalid.
Examples
fn main() { 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)); } } }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)); } }
fn as_mut_ptr(&mut self) -> *mut T
1.0.0
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 slice may cause its buffer to be reallocated, which would also make any pointers to it invalid.
Examples
fn main() { 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]); }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]);
fn swap(&mut self, a: usize, b: usize)
1.0.0
Swaps two elements in a 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
fn main() { let mut v = ["a", "b", "c", "d"]; v.swap(1, 3); assert!(v == ["a", "d", "c", "b"]); }let mut v = ["a", "b", "c", "d"]; v.swap(1, 3); assert!(v == ["a", "d", "c", "b"]);
fn reverse(&mut self)
1.0.0
Reverse the order of elements in a slice, in place.
Example
fn main() { let mut v = [1, 2, 3]; v.reverse(); assert!(v == [3, 2, 1]); }let mut v = [1, 2, 3]; v.reverse(); assert!(v == [3, 2, 1]);
fn iter(&self) -> Iter<T>
1.0.0
Returns an iterator over the slice.
Examples
fn main() { 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); }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);
fn iter_mut(&mut self) -> IterMut<T>
1.0.0
Returns an iterator that allows modifying each value.
Examples
fn main() { let x = &mut [1, 2, 4]; { let iterator = x.iter_mut(); for elem in iterator { *elem += 2; } } assert_eq!(x, &[3, 4, 6]); }let x = &mut [1, 2, 4]; { let iterator = x.iter_mut(); for elem in iterator { *elem += 2; } } assert_eq!(x, &[3, 4, 6]);
fn windows(&self, size: usize) -> Windows<T>
1.0.0
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.
Example
fn main() { 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()); }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());
fn chunks(&self, size: usize) -> Chunks<T>
1.0.0
Returns an iterator over size
elements of the slice at a
time. The chunks are slices and do not overlap. If size
does not divide the
length of the slice, then the last chunk will not have length
size
.
Panics
Panics if size
is 0.
Example
fn main() { 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()); }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());
fn chunks_mut(&mut self, chunk_size: usize) -> ChunksMut<T>
1.0.0
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
.
Panics
Panics if chunk_size
is 0.
Examples
fn main() { 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]); }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]);
fn split_at(&self, mid: usize) -> (&[T], &[T])
1.0.0
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
fn main() { let v = [10, 40, 30, 20, 50]; let (v1, v2) = v.split_at(2); assert_eq!([10, 40], v1); assert_eq!([30, 20, 50], v2); }let v = [10, 40, 30, 20, 50]; let (v1, v2) = v.split_at(2); assert_eq!([10, 40], v1); assert_eq!([30, 20, 50], v2);
fn split_at_mut(&mut self, mid: usize) -> (&mut [T], &mut [T])
1.0.0
Divides one &mut
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
fn main() { let mut v = [1, 2, 3, 4, 5, 6]; // scoped to restrict the lifetime of the borrows { let (left, right) = v.split_at_mut(0); assert!(left == []); assert!(right == [1, 2, 3, 4, 5, 6]); } { let (left, right) = v.split_at_mut(2); assert!(left == [1, 2]); assert!(right == [3, 4, 5, 6]); } { let (left, right) = v.split_at_mut(6); assert!(left == [1, 2, 3, 4, 5, 6]); assert!(right == []); } }let mut v = [1, 2, 3, 4, 5, 6]; // scoped to restrict the lifetime of the borrows { let (left, right) = v.split_at_mut(0); assert!(left == []); assert!(right == [1, 2, 3, 4, 5, 6]); } { let (left, right) = v.split_at_mut(2); assert!(left == [1, 2]); assert!(right == [3, 4, 5, 6]); } { let (left, right) = v.split_at_mut(6); assert!(left == [1, 2, 3, 4, 5, 6]); assert!(right == []); }
fn split<F>(&self, pred: F) -> Split<T, F> where F: FnMut(&T) -> bool
1.0.0
Returns an iterator over subslices separated by elements that match
pred
. The matched element is not contained in the subslices.
Examples
fn main() { 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()); }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:
fn main() { 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()); }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:
fn main() { 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()); }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());
fn split_mut<F>(&mut self, pred: F) -> SplitMut<T, F> where F: FnMut(&T) -> bool
1.0.0
Returns an iterator over mutable subslices separated by elements that
match pred
. The matched element is not contained in the subslices.
Examples
fn main() { 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]); }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]);
fn splitn<F>(&self, n: usize, pred: F) -> SplitN<T, F> where F: FnMut(&T) -> bool
1.0.0
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); }
fn splitn_mut<F>(&mut self, n: usize, pred: F) -> SplitNMut<T, F> where F: FnMut(&T) -> bool
1.0.0
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
fn main() { 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]); }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]);
fn rsplitn<F>(&self, n: usize, pred: F) -> RSplitN<T, F> where F: FnMut(&T) -> bool
1.0.0
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); }
fn rsplitn_mut<F>(&mut self, n: usize, pred: F) -> RSplitNMut<T, F> where F: FnMut(&T) -> bool
1.0.0
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
fn main() { 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]); }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]);
fn contains(&self, x: &T) -> bool where T: PartialEq<T>
1.0.0
Returns true if the slice contains an element with the given value.
Examples
fn main() { let v = [10, 40, 30]; assert!(v.contains(&30)); assert!(!v.contains(&50)); }let v = [10, 40, 30]; assert!(v.contains(&30)); assert!(!v.contains(&50));
fn starts_with(&self, needle: &[T]) -> bool where T: PartialEq<T>
1.0.0
Returns true if needle
is a prefix of the slice.
Examples
fn main() { 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])); }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]));
fn ends_with(&self, needle: &[T]) -> bool where T: PartialEq<T>
1.0.0
Returns true if needle
is a suffix of the slice.
Examples
fn main() { 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])); }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]));
fn binary_search(&self, x: &T) -> Result<usize, usize> where T: Ord
1.0.0
Binary search a 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.
Example
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, });
fn binary_search_by<'a, F>(&'a self, f: F) -> Result<usize, usize> where F: FnMut(&'a T) -> Ordering
1.0.0
Binary search a 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.
Example
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, });
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
Binary search a 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, });
fn sort(&mut self) where T: Ord
1.0.0
This is equivalent to self.sort_by(|a, b| a.cmp(b))
.
This sort is stable and O(n log n)
worst-case but allocates
approximately 2 * n
where n
is the length of self
.
Examples
fn main() { let mut v = [-5, 4, 1, -3, 2]; v.sort(); assert!(v == [-5, -3, 1, 2, 4]); }let mut v = [-5, 4, 1, -3, 2]; v.sort(); assert!(v == [-5, -3, 1, 2, 4]);
fn sort_by_key<B, F>(&mut self, f: F) where B: Ord, F: FnMut(&T) -> B
1.7.0
Sorts the slice, in place, using key
to extract a key by which to
order the sort by.
This sort is stable and O(n log n)
worst-case but allocates
approximately 2 * n
, where n
is the length of self
.
Examples
fn main() { let mut v = [-5i32, 4, 1, -3, 2]; v.sort_by_key(|k| k.abs()); assert!(v == [1, 2, -3, 4, -5]); }let mut v = [-5i32, 4, 1, -3, 2]; v.sort_by_key(|k| k.abs()); assert!(v == [1, 2, -3, 4, -5]);
fn sort_by<F>(&mut self, compare: F) where F: FnMut(&T, &T) -> Ordering
1.0.0
Sorts the slice, in place, using compare
to compare
elements.
This sort is stable and O(n log n)
worst-case but allocates
approximately 2 * n
, where n
is the length of self
.
Examples
fn main() { 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]); }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]);
fn clone_from_slice(&mut self, src: &[T]) where T: Clone
1.7.0
Copies the elements from src
into self
.
The length of src
must be the same as self
.
Panics
This function will panic if the two slices have different lengths.
Example
fn main() { let mut dst = [0, 0, 0]; let src = [1, 2, 3]; dst.clone_from_slice(&src); assert!(dst == [1, 2, 3]); }let mut dst = [0, 0, 0]; let src = [1, 2, 3]; dst.clone_from_slice(&src); assert!(dst == [1, 2, 3]);
fn copy_from_slice(&mut self, src: &[T]) where T: Copy
1.9.0
Copies all elements from src
into self
, using a memcpy.
The length of src
must be the same as self
.
Panics
This function will panic if the two slices have different lengths.
Example
fn main() { let mut dst = [0, 0, 0]; let src = [1, 2, 3]; dst.copy_from_slice(&src); assert_eq!(src, dst); }let mut dst = [0, 0, 0]; let src = [1, 2, 3]; dst.copy_from_slice(&src); assert_eq!(src, dst);
fn to_vec(&self) -> Vec<T> where T: Clone
1.0.0
Copies self
into a new Vec
.
Examples
fn main() { let s = [10, 40, 30]; let x = s.to_vec(); // Here, `s` and `x` can be modified independently. }let s = [10, 40, 30]; let x = s.to_vec(); // Here, `s` and `x` can be modified independently.
fn into_vec(self: Box<[T]>) -> Vec<T>
1.0.0
Converts self
into a vector without clones or allocation.
Examples
fn main() { let s: Box<[i32]> = Box::new([10, 40, 30]); let x = s.into_vec(); // `s` cannot be used anymore because it has been converted into `x`. assert_eq!(x, vec!(10, 40, 30)); }let s: Box<[i32]> = Box::new([10, 40, 30]); let x = s.into_vec(); // `s` cannot be used anymore because it has been converted into `x`. assert_eq!(x, vec!(10, 40, 30));
Trait Implementations
impl<T> AsRef<[T]> for [T]
1.0.0
impl<T> AsMut<[T]> for [T]
1.0.0
impl<'a, 'b, A, B> PartialEq<[A; 0]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 0]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 0]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 0]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 0]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 0]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 0]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 0]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 0]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 1]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 1]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 1]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 1]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 1]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 1]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 1]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 1]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 1]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 2]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 2]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 2]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 2]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 2]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 2]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 2]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 2]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 2]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 3]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 3]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 3]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 3]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 3]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 3]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 3]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 3]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 3]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 4]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 4]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 4]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 4]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 4]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 4]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 4]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 4]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 4]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 5]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 5]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 5]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 5]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 5]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 5]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 5]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 5]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 5]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 6]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 6]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 6]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 6]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 6]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 6]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 6]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 6]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 6]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 7]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 7]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 7]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 7]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 7]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 7]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 7]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 7]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 7]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 8]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 8]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 8]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 8]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 8]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 8]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 8]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 8]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 8]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 9]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 9]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 9]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 9]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 9]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 9]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 9]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 9]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 9]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 10]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 10]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 10]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 10]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 10]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 10]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 10]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 10]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 10]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 11]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 11]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 11]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 11]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 11]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 11]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 11]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 11]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 11]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 12]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 12]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 12]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 12]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 12]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 12]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 12]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 12]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 12]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 13]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 13]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 13]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 13]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 13]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 13]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 13]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 13]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 13]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 14]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 14]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 14]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 14]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 14]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 14]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 14]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 14]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 14]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 15]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 15]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 15]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 15]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 15]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 15]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 15]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 15]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 15]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 16]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 16]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 16]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 16]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 16]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 16]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 16]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 16]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 16]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 17]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 17]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 17]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 17]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 17]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 17]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 17]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 17]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 17]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 18]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 18]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 18]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 18]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 18]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 18]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 18]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 18]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 18]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 19]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 19]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 19]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 19]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 19]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 19]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 19]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 19]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 19]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 20]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 20]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 20]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 20]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 20]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 20]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 20]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 20]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 20]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 21]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 21]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 21]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 21]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 21]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 21]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 21]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 21]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 21]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 22]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 22]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 22]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 22]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 22]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 22]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 22]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 22]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 22]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 23]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 23]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 23]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 23]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 23]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 23]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 23]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 23]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 23]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 24]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 24]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 24]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 24]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 24]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 24]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 24]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 24]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 24]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 25]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 25]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 25]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 25]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 25]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 25]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 25]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 25]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 25]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 26]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 26]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 26]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 26]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 26]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 26]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 26]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 26]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 26]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 27]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 27]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 27]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 27]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 27]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 27]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 27]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 27]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 27]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 28]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 28]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 28]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 28]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 28]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 28]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 28]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 28]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 28]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 29]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 29]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 29]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 29]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 29]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 29]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 29]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 29]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 29]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 30]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 30]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 30]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 30]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 30]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 30]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 30]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 30]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 30]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 31]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 31]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 31]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 31]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 31]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 31]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 31]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 31]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 31]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 32]> for [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 32]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 32]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 32]> for &'b [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 32]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 32]) -> bool
This method tests for !=
.
impl<'a, 'b, A, B> PartialEq<[A; 32]> for &'b mut [B] where B: PartialEq<A>
1.0.0
fn eq(&self, other: &[A; 32]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[A; 32]) -> bool
This method tests for !=
.
impl<T> SliceExt for [T]
type Item = T
fn split_at(&self, mid: usize) -> (&[T], &[T])
fn iter(&self) -> Iter<T>
fn split<P>(&self, pred: P) -> Split<T, P> where P: FnMut(&T) -> bool
fn splitn<P>(&self, n: usize, pred: P) -> SplitN<T, P> where P: FnMut(&T) -> bool
fn rsplitn<P>(&self, n: usize, pred: P) -> RSplitN<T, P> where P: FnMut(&T) -> bool
fn windows(&self, size: usize) -> Windows<T>
fn chunks(&self, size: usize) -> Chunks<T>
fn get(&self, index: usize) -> Option<&T>
fn first(&self) -> Option<&T>
fn split_first(&self) -> Option<(&T, &[T])>
fn split_last(&self) -> Option<(&T, &[T])>
fn last(&self) -> Option<&T>
unsafe fn get_unchecked(&self, index: usize) -> &T
fn as_ptr(&self) -> *const T
fn binary_search_by<'a, F>(&'a self, f: F) -> Result<usize, usize> where F: FnMut(&'a T) -> Ordering
fn len(&self) -> usize
fn get_mut(&mut self, index: usize) -> Option<&mut T>
fn split_at_mut(&mut self, mid: usize) -> (&mut [T], &mut [T])
fn iter_mut(&mut self) -> IterMut<T>
fn last_mut(&mut self) -> Option<&mut T>
fn first_mut(&mut self) -> Option<&mut T>
fn split_first_mut(&mut self) -> Option<(&mut T, &mut [T])>
fn split_last_mut(&mut self) -> Option<(&mut T, &mut [T])>
fn split_mut<P>(&mut self, pred: P) -> SplitMut<T, P> where P: FnMut(&T) -> bool
fn splitn_mut<P>(&mut self, n: usize, pred: P) -> SplitNMut<T, P> where P: FnMut(&T) -> bool
fn rsplitn_mut<P>(&mut self, n: usize, pred: P) -> RSplitNMut<T, P> where P: FnMut(&T) -> bool
fn chunks_mut(&mut self, chunk_size: usize) -> ChunksMut<T>
fn swap(&mut self, a: usize, b: usize)
fn reverse(&mut self)
unsafe fn get_unchecked_mut(&mut self, index: usize) -> &mut T
fn as_mut_ptr(&mut self) -> *mut T
fn contains(&self, x: &T) -> bool where T: PartialEq<T>
fn starts_with(&self, needle: &[T]) -> bool where T: PartialEq<T>
fn ends_with(&self, needle: &[T]) -> bool where T: PartialEq<T>
fn binary_search(&self, x: &T) -> Result<usize, usize> where T: Ord
fn clone_from_slice(&mut self, src: &[T]) where T: Clone
fn copy_from_slice(&mut self, src: &[T]) where T: Copy
fn binary_search_by_key<'a, B, F>(&'a self, b: &B, f: F) -> Result<usize, usize> where B: Ord, F: FnMut(&'a [T]::Item) -> B
impl<T> Index<usize> for [T]
1.0.0
type Output = T
The returned type after indexing
fn index(&self, index: usize) -> &T
The method for the indexing (Foo[Bar]
) operation
impl<T> IndexMut<usize> for [T]
1.0.0
impl<T> Index<Range<usize>> for [T]
1.0.0
Implements slicing with syntax &self[begin .. end]
.
Returns a slice of self for the index range [begin
..end
).
This operation is O(1)
.
Panics
Requires that begin <= end
and end <= self.len()
,
otherwise slicing will panic.
type Output = [T]
The returned type after indexing
fn index(&self, index: Range<usize>) -> &[T]
The method for the indexing (Foo[Bar]
) operation
impl<T> Index<RangeTo<usize>> for [T]
1.0.0
Implements slicing with syntax &self[.. end]
.
Returns a slice of self from the beginning until but not including
the index end
.
Equivalent to &self[0 .. end]
type Output = [T]
The returned type after indexing
fn index(&self, index: RangeTo<usize>) -> &[T]
The method for the indexing (Foo[Bar]
) operation
impl<T> Index<RangeFrom<usize>> for [T]
1.0.0
Implements slicing with syntax &self[begin ..]
.
Returns a slice of self from and including the index begin
until the end.
Equivalent to &self[begin .. self.len()]
type Output = [T]
The returned type after indexing
fn index(&self, index: RangeFrom<usize>) -> &[T]
The method for the indexing (Foo[Bar]
) operation
impl<T> Index<RangeFull> for [T]
1.0.0
Implements slicing with syntax &self[..]
.
Returns a slice of the whole slice. This operation cannot panic.
Equivalent to &self[0 .. self.len()]
type Output = [T]
The returned type after indexing
fn index(&self, _index: RangeFull) -> &[T]
The method for the indexing (Foo[Bar]
) operation
impl<T> Index<RangeInclusive<usize>> for [T]
type Output = [T]
The returned type after indexing
fn index(&self, index: RangeInclusive<usize>) -> &[T]
The method for the indexing (Foo[Bar]
) operation
impl<T> Index<RangeToInclusive<usize>> for [T]
type Output = [T]
The returned type after indexing
fn index(&self, index: RangeToInclusive<usize>) -> &[T]
The method for the indexing (Foo[Bar]
) operation
impl<T> IndexMut<Range<usize>> for [T]
1.0.0
Implements mutable slicing with syntax &mut self[begin .. end]
.
Returns a slice of self for the index range [begin
..end
).
This operation is O(1)
.
Panics
Requires that begin <= end
and end <= self.len()
,
otherwise slicing will panic.
fn index_mut(&mut self, index: Range<usize>) -> &mut [T]
The method for the indexing (Foo[Bar]
) operation
impl<T> IndexMut<RangeTo<usize>> for [T]
1.0.0
Implements mutable slicing with syntax &mut self[.. end]
.
Returns a slice of self from the beginning until but not including
the index end
.
Equivalent to &mut self[0 .. end]
fn index_mut(&mut self, index: RangeTo<usize>) -> &mut [T]
The method for the indexing (Foo[Bar]
) operation
impl<T> IndexMut<RangeFrom<usize>> for [T]
1.0.0
Implements mutable slicing with syntax &mut self[begin ..]
.
Returns a slice of self from and including the index begin
until the end.
Equivalent to &mut self[begin .. self.len()]
fn index_mut(&mut self, index: RangeFrom<usize>) -> &mut [T]
The method for the indexing (Foo[Bar]
) operation
impl<T> IndexMut<RangeFull> for [T]
1.0.0
Implements mutable slicing with syntax &mut self[..]
.
Returns a slice of the whole slice. This operation can not panic.
Equivalent to &mut self[0 .. self.len()]
fn index_mut(&mut self, _index: RangeFull) -> &mut [T]
The method for the indexing (Foo[Bar]
) operation
impl<T> IndexMut<RangeInclusive<usize>> for [T]
fn index_mut(&mut self, index: RangeInclusive<usize>) -> &mut [T]
The method for the indexing (Foo[Bar]
) operation
impl<T> IndexMut<RangeToInclusive<usize>> for [T]
fn index_mut(&mut self, index: RangeToInclusive<usize>) -> &mut [T]
The method for the indexing (Foo[Bar]
) operation
impl<'a, T> Default for &'a [T]
1.0.0
impl<'a, T> Default for &'a mut [T]
1.5.0
fn default() -> &'a mut [T]
Returns the "default value" for a type. Read more
impl<'a, T> IntoIterator for &'a [T]
1.0.0
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>
Creates an iterator from a value. Read more
impl<'a, T> IntoIterator for &'a mut [T]
1.0.0
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>
Creates an iterator from a value. Read more
impl<A, B> PartialEq<[B]> for [A] where A: PartialEq<B>
1.0.0
fn eq(&self, other: &[B]) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &[B]) -> bool
This method tests for !=
.
impl<T> Eq for [T] where T: Eq
1.0.0
impl<T> Ord for [T] where T: Ord
1.0.0
fn cmp(&self, other: &[T]) -> Ordering
This method returns an Ordering
between self
and other
. Read more
impl<T> PartialOrd<[T]> for [T] where T: PartialOrd<T>
1.0.0
fn partial_cmp(&self, other: &[T]) -> Option<Ordering>
This method returns an ordering between self
and other
values if one exists. Read more
fn lt(&self, other: &Rhs) -> bool
1.0.0
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
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
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
This method tests greater than or equal to (for self
and other
) and is used by the >=
operator. Read more
impl<'a, 'b> Pattern<'a> for &'b [char]
Searches for chars that are equal to any of the chars in the array
type Searcher = CharSliceSearcher<'a, 'b>
Associated searcher for this pattern
fn into_searcher(self, haystack: &'a str) -> CharSliceSearcher<'a, 'b>
Constructs the associated searcher from self
and the haystack
to search in. Read more
fn is_contained_in(self, haystack: &'a str) -> bool
Checks whether the pattern matches anywhere in the haystack
fn is_prefix_of(self, haystack: &'a str) -> bool
Checks whether the pattern matches at the front of the haystack
fn is_suffix_of(self, haystack: &'a str) -> bool where CharSliceSearcher<'a, 'b>: ReverseSearcher<'a>
Checks whether the pattern matches at the back of the haystack
impl<T> Hash for [T] where T: Hash
1.0.0
fn hash<H>(&self, state: &mut H) where H: Hasher
Feeds this value into the state given, updating the hasher as necessary.
fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher
1.3.0
Feeds a slice of this type into the state provided.
impl<T> Debug for [T] where T: Debug
1.0.0
impl<T, V> SliceConcatExt<T> for [V] where T: Clone, V: Borrow<[T]>
type Output = Vec<T>
The resulting type after concatenation
fn concat(&self) -> Vec<T>
Flattens a slice of T
into a single value Self::Output
. Read more
fn join(&self, sep: &T) -> Vec<T>
Flattens a slice of T
into a single value Self::Output
, placing a given separator between each. Read more
fn connect(&self, sep: &T) -> Vec<T>
: renamed to join
impl<T> ToOwned for [T] where T: Clone
1.0.0
type Owned = Vec<T>
fn to_owned(&self) -> Vec<T>
Creates owned data from borrowed data, usually by cloning. Read more
impl<S> SliceConcatExt<str> for [S] where S: Borrow<str>
type Output = String
The resulting type after concatenation
fn concat(&self) -> String
Flattens a slice of T
into a single value Self::Output
. Read more
fn join(&self, sep: &str) -> String
Flattens a slice of T
into a single value Self::Output
, placing a given separator between each. Read more
fn connect(&self, sep: &str) -> String
: renamed to join
impl AsciiExt for [u8]
1.0.0[src]
type Owned = Vec<u8>
Container type for copied ASCII characters.
fn is_ascii(&self) -> bool
Checks if the value is within the ASCII range. Read more
fn to_ascii_uppercase(&self) -> Vec<u8>
Makes a copy of the string in ASCII upper case. Read more
fn to_ascii_lowercase(&self) -> Vec<u8>
Makes a copy of the string in ASCII lower case. Read more
fn eq_ignore_ascii_case(&self, other: &[u8]) -> bool
Checks that two strings are an ASCII case-insensitive match. Read more
fn make_ascii_uppercase(&mut self)
Converts this type to its ASCII upper case equivalent in-place. Read more
fn make_ascii_lowercase(&mut self)
Converts this type to its ASCII lower case equivalent in-place. Read more
impl<'a> Read for &'a [u8]
1.0.0[src]
fn read(&mut self, buf: &mut [u8]) -> Result<usize>
Pull some bytes from this source into the specified buffer, returning how many bytes were read. Read more
fn read_exact(&mut self, buf: &mut [u8]) -> Result<()>
Read the exact number of bytes required to fill buf
. Read more
fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize>
1.0.0
Read all bytes until EOF in this source, placing them into buf
. Read more
fn read_to_string(&mut self, buf: &mut String) -> Result<usize>
1.0.0
Read all bytes until EOF in this source, placing them into buf
. Read more
fn by_ref(&mut self) -> &mut Self where Self: Sized
1.0.0
Creates a "by reference" adaptor for this instance of Read
. Read more
fn bytes(self) -> Bytes<Self> where Self: Sized
1.0.0
Transforms this Read
instance to an Iterator
over its bytes. Read more
fn chars(self) -> Chars<Self> where Self: Sized
io
#27802): the semantics of a partial read/write of where errors happen is currently unclear and may change
Transforms this Read
instance to an Iterator
over char
s. Read more
fn chain<R: Read>(self, next: R) -> Chain<Self, R> where Self: Sized
1.0.0
Creates an adaptor which will chain this stream with another. Read more
fn take(self, limit: u64) -> Take<Self> where Self: Sized
1.0.0
Creates an adaptor which will read at most limit
bytes from it. Read more
impl<'a> BufRead for &'a [u8]
1.0.0[src]
fn fill_buf(&mut self) -> Result<&[u8]>
Fills the internal buffer of this object, returning the buffer contents. Read more
fn consume(&mut self, amt: usize)
Tells this buffer that amt
bytes have been consumed from the buffer, so they should no longer be returned in calls to read
. Read more
fn read_until(&mut self, byte: u8, buf: &mut Vec<u8>) -> Result<usize>
1.0.0
Read all bytes into buf
until the delimiter byte
is reached. Read more
fn read_line(&mut self, buf: &mut String) -> Result<usize>
1.0.0
Read all bytes until a newline (the 0xA byte) is reached, and append them to the provided buffer. Read more
fn split(self, byte: u8) -> Split<Self> where Self: Sized
1.0.0
Returns an iterator over the contents of this reader split on the byte byte
. Read more
fn lines(self) -> Lines<Self> where Self: Sized
1.0.0
Returns an iterator over the lines of this reader. Read more
impl<'a> Write for &'a mut [u8]
1.0.0[src]
fn write(&mut self, data: &[u8]) -> Result<usize>
Write a buffer into this object, returning how many bytes were written. Read more
fn write_all(&mut self, data: &[u8]) -> Result<()>
Attempts to write an entire buffer into this write. Read more
fn flush(&mut self) -> Result<()>
Flush this output stream, ensuring that all intermediately buffered contents reach their destination. Read more
fn write_fmt(&mut self, fmt: Arguments) -> Result<()>
1.0.0
Writes a formatted string into this writer, returning any error encountered. Read more
fn by_ref(&mut self) -> &mut Self where Self: Sized
1.0.0
Creates a "by reference" adaptor for this instance of Write
. Read more
impl<'a> ToSocketAddrs for &'a [SocketAddr]
1.8.0[src]
type Iter = Cloned<Iter<'a, SocketAddr>>
Returned iterator over socket addresses which this type may correspond to. Read more
fn to_socket_addrs(&self) -> Result<Self::Iter>
Converts this object to an iterator of resolved SocketAddr
s. Read more