Primitive Type slice1.0.0 [−]

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.

// 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"];Run

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]);Run

See also the std::slice module.

Methods

`impl<T> [T]`
[src]

`pub fn len(&self) -> usize`
[src]

Returns the number of elements in the slice.

Examples

let a = [1, 2, 3];
assert_eq!(a.len(), 3);Run

`pub fn is_empty(&self) -> bool`
[src]

Returns true if the slice has a length of 0.

Examples

let a = [1, 2, 3];
assert!(!a.is_empty());Run

`pub fn first(&self) -> Option<&T>`
[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());Run

`pub fn first_mut(&mut self) -> Option<&mut T>`
[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]);Run

`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]);
}Run

`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]);Run

`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]);
}Run

`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]);Run

`pub fn last(&self) -> Option<&T>`
[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());Run

`pub fn last_mut(&mut self) -> Option<&mut T>`
[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]);Run

`pub fn get(&self, index: I) -> Option<&>::Output> where I: SliceIndex<[T]>,`
[src]

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));Run

`pub fn get_mut( &mut self, index: I ) -> Option<&mut >::Output> where I: SliceIndex<[T]>,`
[src]

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]);Run

`pub unsafe fn get_unchecked( &self, index: I ) -> &>::Output where I: SliceIndex<[T]>,`
[src]

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);
}Run

`pub unsafe fn get_unchecked_mut( &mut self, index: I ) -> &mut >::Output where I: SliceIndex<[T]>,`
[src]

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]);Run

`pub fn as_ptr(&self) -> *const T`
[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));
    }
}Run

`pub fn as_mut_ptr(&mut self) -> *mut T`
[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]);Run

`pub fn swap(&mut self, a: usize, b: usize)`
[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"]);Run

`pub fn reverse(&mut self)`
[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]);Run

ⓘImportant traits for Iter<'a, T>
Important traits for Iter<'a, T>
`impl<'a, T> Iterator for Iter<'a, T> type Item = &'a T;`
`pub fn iter(&self) -> Iter<T>`
[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);Run

ⓘImportant traits for IterMut<'a, T>
Important traits for IterMut<'a, T>
`impl<'a, T> Iterator for IterMut<'a, T> type Item = &'a mut T;`
`pub fn iter_mut(&mut self) -> IterMut<T>`
[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]);Run

ⓘImportant traits for Windows<'a, T>
Important traits for Windows<'a, T>
`impl<'a, T> Iterator for Windows<'a, T> type Item = &'a [T];`
`pub fn windows(&self, size: usize) -> Windows<T>`
[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());Run

If the slice is shorter than size:

let slice = ['f', 'o', 'o'];
let mut iter = slice.windows(4);
assert!(iter.next().is_none());Run

ⓘImportant traits for Chunks<'a, T>
Important traits for Chunks<'a, T>
`impl<'a, T> Iterator for Chunks<'a, T> type Item = &'a [T];`
`pub fn chunks(&self, size: usize) -> Chunks<T>`
[src]

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.

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());Run

ⓘImportant traits for ChunksMut<'a, T>
Important traits for ChunksMut<'a, T>
`impl<'a, T> Iterator for ChunksMut<'a, T> type Item = &'a mut [T];`
`pub fn chunks_mut(&mut self, chunk_size: usize) -> ChunksMut<T>`
[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.

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]);Run

`pub fn split_at(&self, mid: usize) -> (&[T], &[T])`
[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 == []);
}Run

`pub fn split_at_mut(&mut self, mid: usize) -> (&mut [T], &mut [T])`
[src]

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

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]);Run

ⓘImportant traits for Split<'a, T, P>
Important traits for Split<'a, T, P>
`impl<'a, T, P> Iterator for Split<'a, T, P> where P: FnMut(&T) -> bool, type Item = &'a [T];`
`pub fn split<F>(&self, pred: F) -> Split<T, F> where F: FnMut(&T) -> bool,`
[src]

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());Run

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());Run

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());Run

ⓘImportant traits for SplitMut<'a, T, P>
Important traits for SplitMut<'a, T, P>
`impl<'a, T, P> Iterator for SplitMut<'a, T, P> where P: FnMut(&T) -> bool, type Item = &'a mut [T];`
`pub fn split_mut<F>(&mut self, pred: F) -> SplitMut<T, F> where F: FnMut(&T) -> bool,`
[src]

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]);Run

ⓘImportant traits for RSplit<'a, T, P>
Important traits for RSplit<'a, T, P>
`impl<'a, T, P> Iterator for RSplit<'a, T, P> where P: FnMut(&T) -> bool, type Item = &'a [T];`
`pub fn rsplit<F>(&self, pred: F) -> RSplit<T, F> where F: FnMut(&T) -> bool,`
[src]

🔬 This is a nightly-only experimental API. (slice_rsplit #41020)

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);Run

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);Run

ⓘImportant traits for RSplitMut<'a, T, P>
Important traits for RSplitMut<'a, T, P>
`impl<'a, T, P> Iterator for RSplitMut<'a, T, P> where P: FnMut(&T) -> bool, type Item = &'a mut [T];`
`pub fn rsplit_mut<F>(&mut self, pred: F) -> RSplitMut<T, F> where F: FnMut(&T) -> bool,`
[src]

🔬 This is a nightly-only experimental API. (slice_rsplit #41020)

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]);Run

ⓘImportant traits for SplitN<'a, T, P>
Important traits for SplitN<'a, T, P>
`impl<'a, T, P> Iterator for SplitN<'a, T, P> where P: FnMut(&T) -> bool, type Item = &'a [T];`
`pub fn splitn<F>(&self, n: usize, pred: F) -> SplitN<T, F> where F: FnMut(&T) -> bool,`
[src]

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);
}Run

ⓘImportant traits for SplitNMut<'a, T, P>
Important traits for SplitNMut<'a, T, P>
`impl<'a, T, P> Iterator for SplitNMut<'a, T, P> where P: FnMut(&T) -> bool, type Item = &'a mut [T];`
`pub fn splitn_mut<F>(&mut self, n: usize, pred: F) -> SplitNMut<T, F> where F: FnMut(&T) -> bool,`
[src]

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]);Run

ⓘImportant traits for RSplitN<'a, T, P>
Important traits for RSplitN<'a, T, P>
`impl<'a, T, P> Iterator for RSplitN<'a, T, P> where P: FnMut(&T) -> bool, type Item = &'a [T];`
`pub fn rsplitn<F>(&self, n: usize, pred: F) -> RSplitN<T, F> where F: FnMut(&T) -> bool,`
[src]

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);
}Run

ⓘImportant traits for RSplitNMut<'a, T, P>
Important traits for RSplitNMut<'a, T, P>
`impl<'a, T, P> Iterator for RSplitNMut<'a, T, P> where P: FnMut(&T) -> bool, type Item = &'a mut [T];`
`pub fn rsplitn_mut<F>(&mut self, n: usize, pred: F) -> RSplitNMut<T, F> where F: FnMut(&T) -> bool,`
[src]

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]);Run

`pub fn contains(&self, x: &T) -> bool where T: PartialEq<T>,`
[src]

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));Run

`pub fn starts_with(&self, needle: &[T]) -> bool where T: PartialEq<T>,`
[src]

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]));Run

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(&[]));Run

`pub fn ends_with(&self, needle: &[T]) -> bool where T: PartialEq<T>,`
[src]

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]));Run

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(&[]));Run

`pub fn binary_search(&self, x: &T) -> Result<usize, usize> where T: Ord,`
[src]

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, });Run

`pub fn binary_search_by<'a, F>(&'a self, f: F) -> Result<usize, usize> where F: FnMut(&'a T) -> Ordering,`
[src]

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, });Run

`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]

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, });Run

`pub fn sort(&mut self) where T: Ord,`
[src]

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]);Run

`pub fn sort_by<F>(&mut self, compare: F) where F: FnMut(&T, &T) -> Ordering,`
[src]

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]);Run

`pub fn sort_by_key<B, F>(&mut self, f: F) where B: Ord, F: FnMut(&T) -> B,`
1.7.0
[src]

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]);Run

`pub fn sort_unstable(&mut self) where T: Ord,`
1.20.0
[src]

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]);Run

`pub fn sort_unstable_by<F>(&mut self, compare: F) where F: FnMut(&T, &T) -> Ordering,`
1.20.0
[src]

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]);Run

`pub fn sort_unstable_by_key<B, F>(&mut self, f: F) where B: Ord, F: FnMut(&T) -> B,`
1.20.0
[src]

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]);Run

`pub fn rotate(&mut self, mid: usize)`
[src]

🔬 This is a nightly-only experimental API. (slice_rotate #41891)

Permutes the slice in-place such that self[mid..] moves to the beginning of the slice while self[..mid] moves to the end of the slice. Equivalently, rotates the slice mid places to the left or k = self.len() - mid places to the right.

This is a "k-rotation", a permutation in which item i moves to position i + k, modulo the length of the slice. See Elements of Programming §10.4.

Rotation by mid and rotation by k are inverse operations.

Panics

This function will panic if mid is greater than the length of the slice. (Note that mid == self.len() does not panic; it's a nop rotation with k == 0, the inverse of a rotation with mid == 0.)

Complexity

Takes linear (in self.len()) time.

Examples

#![feature(slice_rotate)]

let mut a = [1, 2, 3, 4, 5, 6, 7];
let mid = 2;
a.rotate(mid);
assert_eq!(&a, &[3, 4, 5, 6, 7, 1, 2]);
let k = a.len() - mid;
a.rotate(k);
assert_eq!(&a, &[1, 2, 3, 4, 5, 6, 7]);

use std::ops::Range;
fn slide<T>(slice: &mut [T], range: Range<usize>, to: usize) {
    if to < range.start {
        slice[to..range.end].rotate(range.start-to);
    } else if to > range.end {
        slice[range.start..to].rotate(range.end-range.start);
    }
}
let mut v: Vec<_> = (0..10).collect();
slide(&mut v, 1..4, 7);
assert_eq!(&v, &[0, 4, 5, 6, 1, 2, 3, 7, 8, 9]);
slide(&mut v, 6..8, 1);
assert_eq!(&v, &[0, 3, 7, 4, 5, 6, 1, 2, 8, 9]);Run

`pub fn clone_from_slice(&mut self, src: &[T]) where T: Clone,`
1.7.0
[src]

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]);Run

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!Run

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]);Run

`pub fn copy_from_slice(&mut self, src: &[T]) where T: Copy,`
1.9.0
[src]

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]);Run

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!Run

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]);Run

`pub fn swap_with_slice(&mut self, other: &mut [T])`
[src]

🔬 This is a nightly-only experimental API. (swap_with_slice #44030)

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]);Run

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!Run

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]);Run

ⓘImportant traits for Vec<u8>
Important traits for Vec<u8>
`impl Write for Vec<u8>`
`pub fn to_vec(&self) -> Vec<T> where T: Clone,`
[src]

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.Run

ⓘImportant traits for Vec<u8>
Important traits for Vec<u8>
`impl Write for Vec<u8>`
`pub fn into_vec(self: Box<[T]>) -> Vec<T>`
[src]

Converts self into a vector without clones or allocation.

The resulting vector can be converted back into a box via Vec<T>'s into_boxed_slice method.

Examples

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]);Run

`impl [u8]`
[src]

`pub fn is_ascii(&self) -> bool`
1.23.0
[src]

Checks if all bytes in this slice are within the ASCII range.

ⓘImportant traits for Vec<u8>
Important traits for Vec<u8>
`impl Write for Vec<u8>`
`pub fn to_ascii_uppercase(&self) -> Vec<u8>`
1.23.0
[src]

Returns a vector containing a copy of this slice where each byte is mapped to its ASCII upper case equivalent.

ASCII letters 'a' to 'z' are mapped to 'A' to 'Z', but non-ASCII letters are unchanged.

To uppercase the value in-place, use make_ascii_uppercase.

ⓘImportant traits for Vec<u8>
Important traits for Vec<u8>
`impl Write for Vec<u8>`
`pub fn to_ascii_lowercase(&self) -> Vec<u8>`
1.23.0
[src]

Returns a vector containing a copy of this slice where each byte is mapped to its ASCII lower case equivalent.

ASCII letters 'A' to 'Z' are mapped to 'a' to 'z', but non-ASCII letters are unchanged.

To lowercase the value in-place, use make_ascii_lowercase.

`pub fn eq_ignore_ascii_case(&self, other: &[u8]) -> bool`
1.23.0
[src]

Checks that two slices are an ASCII case-insensitive match.

Same as to_ascii_lowercase(a) == to_ascii_lowercase(b), but without allocating and copying temporaries.

`pub fn make_ascii_uppercase(&mut self)`
1.23.0
[src]

Converts this slice to its ASCII upper case equivalent in-place.

ASCII letters 'a' to 'z' are mapped to 'A' to 'Z', but non-ASCII letters are unchanged.

To return a new uppercased value without modifying the existing one, use to_ascii_uppercase.

`pub fn make_ascii_lowercase(&mut self)`
1.23.0
[src]

Converts this slice to its ASCII lower case equivalent in-place.

ASCII letters 'A' to 'Z' are mapped to 'a' to 'z', but non-ASCII letters are unchanged.

To return a new lowercased value without modifying the existing one, use to_ascii_lowercase.

Trait Implementations

`impl<S> SliceConcatExt<str> for [S] where S: Borrow<str>,`
[src]

`type Output = String`

🔬 This is a nightly-only experimental API. (slice_concat_ext #27747)

trait should not have to exist

The resulting type after concatenation

`fn concat(&self) -> String`
[src]

Flattens a slice of T into a single value Self::Output. Read more

`fn join(&self, sep: &str) -> String`
[src]

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`
[src]

Deprecated since 1.3.0

: renamed to join

`impl<T, V> SliceConcatExt<T> for [V] where T: Clone, V: Borrow<[T]>,`
[src]

`type Output = Vec<T>`

🔬 This is a nightly-only experimental API. (slice_concat_ext #27747)

trait should not have to exist

The resulting type after concatenation

ⓘImportant traits for Vec<u8>
Important traits for Vec<u8>
`impl Write for Vec<u8>`
`fn concat(&self) -> Vec<T>`
[src]

Flattens a slice of T into a single value Self::Output. Read more

ⓘImportant traits for Vec<u8>
Important traits for Vec<u8>
`impl Write for Vec<u8>`
`fn join(&self, sep: &T) -> Vec<T>`
[src]

Flattens a slice of T into a single value Self::Output, placing a given separator between each. Read more

ⓘImportant traits for Vec<u8>
Important traits for Vec<u8>
`impl Write for Vec<u8>`
`fn connect(&self, sep: &T) -> Vec<T>`
[src]

Deprecated since 1.3.0

: renamed to join

`impl<T> ToOwned for [T] where T: Clone,`
[src]

`type Owned = Vec<T>`

ⓘImportant traits for Vec<u8>
Important traits for Vec<u8>
`impl Write for Vec<u8>`
`fn to_owned(&self) -> Vec<T>`
[src]

Creates owned data from borrowed data, usually by cloning. Read more

`fn clone_into(&self, target: &mut Vec<T>)`
[src]

🔬 This is a nightly-only experimental API. (toowned_clone_into #41263)

recently added

Uses borrowed data to replace owned data, usually by cloning. Read more

`impl<T> PartialOrd<[T]> for [T] where T: PartialOrd<T>,`
[src]

Implements comparison of vectors lexicographically.

`fn partial_cmp(&self, other: &[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`
[src]

This method tests less than (for self and other) and is used by the < operator. Read more

`fn le(&self, other: &Rhs) -> bool`
[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`
[src]

This method tests greater than (for self and other) and is used by the > operator. Read more

`fn ge(&self, other: &Rhs) -> bool`
[src]

This method tests greater than or equal to (for self and other) and is used by the >= operator. Read more

`impl<T> Eq for [T] where T: Eq,`
[src]

`impl<T> AsRef<[T]> for [T]`
[src]

ⓘImportant traits for &'a [u8 ]
Important traits for &'a [u8 ]
`impl<'a> Read for &'a [u8]impl<'a> Write for &'a mut [u8]`
`fn as_ref(&self) -> &[T]`
[src]

Performs the conversion.

`impl<T, I> IndexMut for [T] where I: SliceIndex<[T]>,`
[src]

`fn index_mut(&mut self, index: I) -> &mut >::Output`
[src]

Performs the mutable indexing (container[index]) operation.

`impl<'a, 'b> Pattern<'a> for &'b [char]`
[src]

Searches for chars that are equal to any of the chars in the array

`type Searcher = CharSliceSearcher<'a, 'b>`

🔬 This is a nightly-only experimental API. (pattern #27721)

API not fully fleshed out and ready to be stabilized

Associated searcher for this pattern

`fn into_searcher(self, haystack: &'a str) -> CharSliceSearcher<'a, 'b>`
[src]

🔬 This is a nightly-only experimental API. (pattern #27721)

API not fully fleshed out and ready to be stabilized

Constructs the associated searcher from self and the haystack to search in. Read more

`fn is_contained_in(self, haystack: &'a str) -> bool`
[src]

🔬 This is a nightly-only experimental API. (pattern #27721)

API not fully fleshed out and ready to be stabilized

Checks whether the pattern matches anywhere in the haystack

`fn is_prefix_of(self, haystack: &'a str) -> bool`
[src]

🔬 This is a nightly-only experimental API. (pattern #27721)

API not fully fleshed out and ready to be stabilized

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>,`
[src]

🔬 This is a nightly-only experimental API. (pattern #27721)

API not fully fleshed out and ready to be stabilized

Checks whether the pattern matches at the back of the haystack

`impl<T> SliceExt for [T]`
[src]

`type Item = T`

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn split_at(&self, mid: usize) -> (&[T], &[T])`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

ⓘImportant traits for Iter<'a, T>
Important traits for Iter<'a, T>
`impl<'a, T> Iterator for Iter<'a, T> type Item = &'a T;`
`fn iter(&self) -> Iter<T>`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

ⓘImportant traits for Split<'a, T, P>
Important traits for Split<'a, T, P>
`impl<'a, T, P> Iterator for Split<'a, T, P> where P: FnMut(&T) -> bool, type Item = &'a [T];`
`fn split(&self, pred: P) -> Split<T, P> where P: FnMut(&T) -> bool,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

ⓘImportant traits for RSplit<'a, T, P>
Important traits for RSplit<'a, T, P>
`impl<'a, T, P> Iterator for RSplit<'a, T, P> where P: FnMut(&T) -> bool, type Item = &'a [T];`
`fn rsplit(&self, pred: P) -> RSplit<T, P> where P: FnMut(&T) -> bool,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

ⓘImportant traits for SplitN<'a, T, P>
Important traits for SplitN<'a, T, P>
`impl<'a, T, P> Iterator for SplitN<'a, T, P> where P: FnMut(&T) -> bool, type Item = &'a [T];`
`fn splitn(&self, n: usize, pred: P) -> SplitN<T, P> where P: FnMut(&T) -> bool,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

ⓘImportant traits for RSplitN<'a, T, P>
Important traits for RSplitN<'a, T, P>
`impl<'a, T, P> Iterator for RSplitN<'a, T, P> where P: FnMut(&T) -> bool, type Item = &'a [T];`
`fn rsplitn(&self, n: usize, pred: P) -> RSplitN<T, P> where P: FnMut(&T) -> bool,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

ⓘImportant traits for Windows<'a, T>
Important traits for Windows<'a, T>
`impl<'a, T> Iterator for Windows<'a, T> type Item = &'a [T];`
`fn windows(&self, size: usize) -> Windows<T>`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

ⓘImportant traits for Chunks<'a, T>
Important traits for Chunks<'a, T>
`impl<'a, T> Iterator for Chunks<'a, T> type Item = &'a [T];`
`fn chunks(&self, size: usize) -> Chunks<T>`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn get(&self, index: I) -> Option<&>::Output> where I: SliceIndex<[T]>,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn first(&self) -> Option<&T>`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn split_first(&self) -> Option<(&T, &[T])>`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn split_last(&self) -> Option<(&T, &[T])>`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn last(&self) -> Option<&T>`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`unsafe fn get_unchecked(&self, index: I) -> &>::Output where I: SliceIndex<[T]>,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn as_ptr(&self) -> *const T`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn binary_search_by<'a, F>(&'a self, f: F) -> Result<usize, usize> where F: FnMut(&'a T) -> Ordering,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn len(&self) -> usize`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn get_mut( &mut self, index: I ) -> Option<&mut >::Output> where I: SliceIndex<[T]>,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn split_at_mut(&mut self, mid: usize) -> (&mut [T], &mut [T])`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

ⓘImportant traits for IterMut<'a, T>
Important traits for IterMut<'a, T>
`impl<'a, T> Iterator for IterMut<'a, T> type Item = &'a mut T;`
`fn iter_mut(&mut self) -> IterMut<T>`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn last_mut(&mut self) -> Option<&mut T>`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn first_mut(&mut self) -> Option<&mut T>`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn split_first_mut(&mut self) -> Option<(&mut T, &mut [T])>`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn split_last_mut(&mut self) -> Option<(&mut T, &mut [T])>`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

ⓘImportant traits for SplitMut<'a, T, P>
Important traits for SplitMut<'a, T, P>
`impl<'a, T, P> Iterator for SplitMut<'a, T, P> where P: FnMut(&T) -> bool, type Item = &'a mut [T];`
`fn split_mut(&mut self, pred: P) -> SplitMut<T, P> where P: FnMut(&T) -> bool,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

ⓘImportant traits for RSplitMut<'a, T, P>
Important traits for RSplitMut<'a, T, P>
`impl<'a, T, P> Iterator for RSplitMut<'a, T, P> where P: FnMut(&T) -> bool, type Item = &'a mut [T];`
`fn rsplit_mut(&mut self, pred: P) -> RSplitMut<T, P> where P: FnMut(&T) -> bool,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

ⓘImportant traits for SplitNMut<'a, T, P>
Important traits for SplitNMut<'a, T, P>
`impl<'a, T, P> Iterator for SplitNMut<'a, T, P> where P: FnMut(&T) -> bool, type Item = &'a mut [T];`
`fn splitn_mut(&mut self, n: usize, pred: P) -> SplitNMut<T, P> where P: FnMut(&T) -> bool,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

ⓘImportant traits for RSplitNMut<'a, T, P>
Important traits for RSplitNMut<'a, T, P>
`impl<'a, T, P> Iterator for RSplitNMut<'a, T, P> where P: FnMut(&T) -> bool, type Item = &'a mut [T];`
`fn rsplitn_mut(&mut self, n: usize, pred: P) -> RSplitNMut<T, P> where P: FnMut(&T) -> bool,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

ⓘImportant traits for ChunksMut<'a, T>
Important traits for ChunksMut<'a, T>
`impl<'a, T> Iterator for ChunksMut<'a, T> type Item = &'a mut [T];`
`fn chunks_mut(&mut self, chunk_size: usize) -> ChunksMut<T>`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn swap(&mut self, a: usize, b: usize)`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn reverse(&mut self)`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`unsafe fn get_unchecked_mut( &mut self, index: I ) -> &mut >::Output where I: SliceIndex<[T]>,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn as_mut_ptr(&mut self) -> *mut T`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn contains(&self, x: &T) -> bool where T: PartialEq<T>,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn starts_with(&self, needle: &[T]) -> bool where T: PartialEq<T>,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn ends_with(&self, needle: &[T]) -> bool where T: PartialEq<T>,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn binary_search(&self, x: &T) -> Result<usize, usize> where T: Ord,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn rotate(&mut self, mid: usize)`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn clone_from_slice(&mut self, src: &[T]) where T: Clone,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn copy_from_slice(&mut self, src: &[T]) where T: Copy,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn swap_with_slice(&mut self, src: &mut [T])`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn binary_search_by_key<'a, B, F>(&'a self, b: &B, f: F) -> Result<usize, usize> where B: Ord, F: FnMut(&'a <[T] as SliceExt>::Item) -> B,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn sort_unstable(&mut self) where <[T] as SliceExt>::Item: Ord,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn sort_unstable_by<F>(&mut self, compare: F) where F: FnMut(&<[T] as SliceExt>::Item, &<[T] as SliceExt>::Item) -> Ordering,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`fn sort_unstable_by_key<B, F>(&mut self, f: F) where B: Ord, F: FnMut(&<[T] as SliceExt>::Item) -> B,`
[src]

🔬 This is a nightly-only experimental API. (core_slice_ext #32110)

stable interface provided by impl [T] in later crates

`impl<T> AsMut<[T]> for [T]`
[src]

ⓘImportant traits for &'a [u8 ]
Important traits for &'a [u8 ]
`impl<'a> Read for &'a [u8]impl<'a> Write for &'a mut [u8]`
`fn as_mut(&mut self) -> &mut [T]`
[src]

Performs the conversion.

`impl<'a, T> IntoIterator for &'a mut [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?

ⓘImportant traits for IterMut<'a, T>
Important traits for IterMut<'a, T>
`impl<'a, T> Iterator for IterMut<'a, T> type Item = &'a mut T;`
`fn into_iter(self) -> IterMut<'a, T>`
[src]

Creates an iterator from a value. Read more

`impl<'a, T> IntoIterator for &'a [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?

ⓘImportant traits for Iter<'a, T>
Important traits for Iter<'a, T>
`impl<'a, T> Iterator for Iter<'a, T> type Item = &'a T;`
`fn into_iter(self) -> Iter<'a, T>`
[src]

Creates an iterator from a value. Read more

`impl<T> Ord for [T] where T: Ord,`
[src]

Implements comparison of vectors lexicographically.

`fn cmp(&self, other: &[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